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.0606 | Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs | Many problems in areas as diverse as recommendation systems, social network
analysis, semantic search, and distributed root cause analysis can be modeled
as pattern search on labeled graphs (also called "heterogeneous information
networks" or HINs). Given a large graph and a query pattern with node and edge
label constraints, a fundamental challenge is to nd the top-k matches ac-
cording to a ranking function over edge and node weights. For users, it is di
cult to select value k . We therefore propose the novel notion of an any-k
ranking algorithm: for a given time budget, re- turn as many of the top-ranked
results as possible. Then, given additional time, produce the next lower-ranked
results quickly as well. It can be stopped anytime, but may have to continues
until all results are returned. This paper focuses on acyclic patterns over
arbitrary labeled graphs. We are interested in practical algorithms that
effectively exploit (1) properties of heterogeneous networks, in particular
selective constraints on labels, and (2) that the users often explore only a
fraction of the top-ranked results. Our solution, KARPET, carefully integrates
aggressive pruning that leverages the acyclic nature of the query, and
incremental guided search. It enables us to prove strong non-trivial time and
space guarantees, which is generally considered very hard for this type of
graph search problem. Through experimental studies we show that KARPET achieves
running times in the order of milliseconds for tree patterns on large networks
with millions of nodes and edges.
| cs.SI cs.DB cs.DS | many problems in areas as diverse as recommendation systems social network analysis semantic search and distributed root cause analysis can be modeled as pattern search on labeled graphs also called heterogeneous information networks or hins given a large graph and a query pattern with node and edge label constraints a fundamental challenge is to nd the topk matches ac cording to a ranking function over edge and node weights for users it is di cult to select value k we therefore propose the novel notion of an anyk ranking algorithm for a given time budget re turn as many of the topranked results as possible then given additional time produce the next lowerranked results quickly as well it can be stopped anytime but may have to continues until all results are returned this paper focuses on acyclic patterns over arbitrary labeled graphs we are interested in practical algorithms that effectively exploit 1 properties of heterogeneous networks in particular selective constraints on labels and 2 that the users often explore only a fraction of the topranked results our solution karpet carefully integrates aggressive pruning that leverages the acyclic nature of the query and incremental guided search it enables us to prove strong nontrivial time and space guarantees which is generally considered very hard for this type of graph search problem through experimental studies we show that karpet achieves running times in the order of milliseconds for tree patterns on large networks with millions of nodes and edges | [['many', 'problems', 'in', 'areas', 'as', 'diverse', 'as', 'recommendation', 'systems', 'social', 'network', 'analysis', 'semantic', 'search', 'and', 'distributed', 'root', 'cause', 'analysis', 'can', 'be', 'modeled', 'as', 'pattern', 'search', 'on', 'labeled', 'graphs', 'also', 'called', 'heterogeneous', 'information', 'networks', 'or', 'hins', 'given', 'a', 'large', 'graph', 'and', 'a', 'query', 'pattern', 'with', 'node', 'and', 'edge', 'label', 'constraints', 'a', 'fundamental', 'challenge', 'is', 'to', 'nd', 'the', 'topk', 'matches', 'ac', 'cording', 'to', 'a', 'ranking', 'function', 'over', 'edge', 'and', 'node', 'weights', 'for', 'users', 'it', 'is', 'di', 'cult', 'to', 'select', 'value', 'k', 'we', 'therefore', 'propose', 'the', 'novel', 'notion', 'of', 'an', 'anyk', 'ranking', 'algorithm', 'for', 'a', 'given', 'time', 'budget', 're', 'turn', 'as', 'many', 'of', 'the', 'topranked', 'results', 'as', 'possible', 'then', 'given', 'additional', 'time', 'produce', 'the', 'next', 'lowerranked', 'results', 'quickly', 'as', 'well', 'it', 'can', 'be', 'stopped', 'anytime', 'but', 'may', 'have', 'to', 'continues', 'until', 'all', 'results', 'are', 'returned', 'this', 'paper', 'focuses', 'on', 'acyclic', 'patterns', 'over', 'arbitrary', 'labeled', 'graphs', 'we', 'are', 'interested', 'in', 'practical', 'algorithms', 'that', 'effectively', 'exploit', '1', 'properties', 'of', 'heterogeneous', 'networks', 'in', 'particular', 'selective', 'constraints', 'on', 'labels', 'and', '2', 'that', 'the', 'users', 'often', 'explore', 'only', 'a', 'fraction', 'of', 'the', 'topranked', 'results', 'our', 'solution', 'karpet', 'carefully', 'integrates', 'aggressive', 'pruning', 'that', 'leverages', 'the', 'acyclic', 'nature', 'of', 'the', 'query', 'and', 'incremental', 'guided', 'search', 'it', 'enables', 'us', 'to', 'prove', 'strong', 'nontrivial', 'time', 'and', 'space', 'guarantees', 'which', 'is', 'generally', 'considered', 'very', 'hard', 'for', 'this', 'type', 'of', 'graph', 'search', 'problem', 'through', 'experimental', 'studies', 'we', 'show', 'that', 'karpet', 'achieves', 'running', 'times', 'in', 'the', 'order', 'of', 'milliseconds', 'for', 'tree', 'patterns', 'on', 'large', 'networks', 'with', 'millions', 'of', 'nodes', 'and', 'edges']] | [-0.12451840854406387, 0.06696016073078308, -0.03186895555557042, 0.05772952641003582, -0.14571471246470866, -0.16034675182461677, 0.11976029748931054, 0.42403545617660293, -0.2964440016992024, -0.35474008612227853, 0.09551434707637022, -0.2948809921079254, -0.17657855366018876, 0.1603714617677262, -0.08635678950155184, 0.050293707899713734, 0.11944215827584305, 0.08762023247874792, 0.0033863980748332113, -0.28258742897444, 0.2776144968148237, 0.053731019080036364, 0.2702100903299622, 0.05280196356881013, 0.08253713026554534, 0.01815411865856254, -0.059187575488649, 0.0611557290219219, -0.08178790808012652, 0.10714570052213737, 0.331055033814351, 0.20905355700829875, 0.31222276543801436, -0.40982299509504044, -0.18744043840408386, 0.14228725384684188, 0.16016392942210736, 0.09619245664684148, -0.024360023669852706, -0.2838172476140393, 0.14922772232036594, -0.14048077242895501, -0.01830655152023938, -0.09206254102411818, 0.020942241644303573, 0.028565573633923272, -0.2937402276438661, -0.01100847343105506, 0.05513483014689629, 0.004650226815176181, -0.022440961345488238, -0.1069737513984752, 0.0093421712384147, 0.14242585762079468, 0.016790750438870374, 0.048672335223794806, 0.11106123826199318, -0.14362688017885017, -0.17345642883017598, 0.3818826519952873, -0.006574403308999923, -0.1649822242570288, 0.18569886904080077, -0.05282901515936113, -0.1832545658248595, 0.10653485456618984, 0.2377122658010015, 0.13342920603368003, -0.14767963261788208, 0.033186094791506277, -0.07988928017954601, 0.17580379108367794, 0.06917699339005669, 0.03436739190880469, 0.16718517806090902, 0.20158705569815166, 0.12904074261218812, 0.12652873672968631, -0.049995927839562845, -0.06576051877596374, -0.21753378042600072, -0.12240620291043745, -0.2038520241435808, -0.008030092972521594, -0.14480012723723748, -0.17668711031323345, 0.39251497935610596, 0.1740280491644402, 0.22147557071050378, 0.10345478941348656, 0.2787893584540083, 0.0679852487662517, 0.08516967104932534, 0.12587779459398485, 0.12882809615484056, 0.025868913006098546, 0.11799359069989239, -0.12964785290542288, 0.13537024415563792, 0.04235652153242807] |
1,802.06061 | Z4 parafermions in one-dimensional fermionic lattices | Parafermions are emergent excitations which generalize Majorana fermions and
are potentially relevant to topological quantum computation. Using the concept
of Fock parafermions, we present a mapping between lattice $\mathbb{Z}_4$
parafermions and lattice spin-$1/2$ fermions which preserves the locality of
operators with $\mathbb{Z}_4$ symmetry. Based on this mapping, we construct an
exactly solvable, local, and interacting one-dimensional fermionic Hamiltonian
which hosts zero-energy modes obeying parafermionic algebra. We numerically
show that this parafermionic phase remains stable in a wide range of
parameters, and discuss its signatures in the fermionic spectral function.
| cond-mat.str-el cond-mat.mes-hall | parafermions are emergent excitations which generalize majorana fermions and are potentially relevant to topological quantum computation using the concept of fock parafermions we present a mapping between lattice mathbbz_4 parafermions and lattice spin12 fermions which preserves the locality of operators with mathbbz_4 symmetry based on this mapping we construct an exactly solvable local and interacting onedimensional fermionic hamiltonian which hosts zeroenergy modes obeying parafermionic algebra we numerically show that this parafermionic phase remains stable in a wide range of parameters and discuss its signatures in the fermionic spectral function | [['parafermions', 'are', 'emergent', 'excitations', 'which', 'generalize', 'majorana', 'fermions', 'and', 'are', 'potentially', 'relevant', 'to', 'topological', 'quantum', 'computation', 'using', 'the', 'concept', 'of', 'fock', 'parafermions', 'we', 'present', 'a', 'mapping', 'between', 'lattice', 'mathbbz_4', 'parafermions', 'and', 'lattice', 'spin12', 'fermions', 'which', 'preserves', 'the', 'locality', 'of', 'operators', 'with', 'mathbbz_4', 'symmetry', 'based', 'on', 'this', 'mapping', 'we', 'construct', 'an', 'exactly', 'solvable', 'local', 'and', 'interacting', 'onedimensional', 'fermionic', 'hamiltonian', 'which', 'hosts', 'zeroenergy', 'modes', 'obeying', 'parafermionic', 'algebra', 'we', 'numerically', 'show', 'that', 'this', 'parafermionic', 'phase', 'remains', 'stable', 'in', 'a', 'wide', 'range', 'of', 'parameters', 'and', 'discuss', 'its', 'signatures', 'in', 'the', 'fermionic', 'spectral', 'function']] | [-0.22494439492943916, 0.31131456269286806, -0.044688608361345326, 0.05847284966671651, -0.08407511122870061, -0.21615797036923887, 0.028088212934102904, 0.3388218398237329, -0.23776517743558695, -0.21452824259438458, 0.03305330200989343, -0.2705546532956402, -0.16546179344249742, 0.10031238632810334, 0.028568206046605902, 0.0561443483973644, -0.002484944076120351, 0.019787918117022917, -0.16232226203127734, -0.2602611785817347, 0.3205887988063224, -0.028346558615533906, 0.26295028279765686, 0.02840841820285645, 0.07311084509691161, 0.040665542513257665, 0.08609492717875858, -0.09599326234938724, -0.15959736012392273, 0.07817635664276862, 0.25379844862978196, -0.0386681338887285, 0.08776941484237989, -0.41193580409784, -0.1934576699866003, 0.1464539033876146, 0.20283578209620848, 0.14652858830575066, -0.035189673784607495, -0.3548332773714086, 0.018372766343939504, -0.23527407134474998, -0.1562576037046782, -0.17016012087762566, -0.019431923479469638, -0.06998081900849101, -0.2101702494546771, 0.09087092648103332, 0.02883499539509583, 0.12064808819865974, -0.04746431412091583, -0.05981116872699408, -0.0888808790301339, 0.04651914967035645, -0.04544382006599662, -0.04769889187993837, 0.07197363485367654, -0.13271024083886085, -0.18791630104435295, 0.38609263472968003, -0.050294229979862284, -0.23487382376137492, 0.20715188305416887, -0.09679647884593251, -0.17907188722884723, 0.03884788497947575, 0.05678484851842369, 0.09479553247226423, -0.09730840822828285, 0.17784643762619393, -0.1278641737966139, 0.12232954331426463, -0.01121812096137679, 0.17100228226398317, 0.29828910676113674, 0.09313086991648326, 0.08271427126862946, 0.1916805939079168, -0.006053989164510302, -0.14398086969374438, -0.33621306376259646, -0.19789754736415122, -0.2524780176286952, 0.061336051400625306, -0.044705080715390026, -0.21036538726838536, 0.501251284451632, 0.1733304989430007, 0.18308213734156636, 0.04244667492686572, 0.15711081319415335, 0.15817016065434625, 0.10442236541466934, 0.05700502671782723, 0.12760862133863352, 0.1508736219806492, -0.03790398178820948, -0.2974889369555906, -0.15240599057542975, 0.15089099205444367] |
1,802.06062 | Gravitational Pressure, apparent horizon and thermodynamics of FLRW
universe in the teleparallel gravity | In the context of the teleparallel equivalent of general relativity the
concept of gravitational pressure and gravitational energy-momentum arisen in a
natural way. In the case of a Friedmann-Lemaitre-Robertson-Walker space FLRW we
obtain the total energy contained inside the apparent horizon and the radial
pressure over the apparent horizon area. We use these definitions to written a
thermodynamics relation $T_{A}dS_{A} = dE_{A}+P_{A}dV_{A}$ at the apparent
horizon, where $E_{A}$ is the total energy inside the apparent horizon, $V_{A}$
is the areal volume of the apparent horizon, $P_{A}$ is the radial pressure
over the apparent horizon area, $S_{A}$ is the entropy which can be assumed as
one quarter of the apparent horizon area only for a non stationary apparent
horizon. We identify $T_{A}$ as the temperature at the surface of the apparent
horizon. We shown that for all expanding accelerated FLRW model of universe the
radial pressure is positive.
| gr-qc | in the context of the teleparallel equivalent of general relativity the concept of gravitational pressure and gravitational energymomentum arisen in a natural way in the case of a friedmannlemaitrerobertsonwalker space flrw we obtain the total energy contained inside the apparent horizon and the radial pressure over the apparent horizon area we use these definitions to written a thermodynamics relation t_ads_a de_ap_adv_a at the apparent horizon where e_a is the total energy inside the apparent horizon v_a is the areal volume of the apparent horizon p_a is the radial pressure over the apparent horizon area s_a is the entropy which can be assumed as one quarter of the apparent horizon area only for a non stationary apparent horizon we identify t_a as the temperature at the surface of the apparent horizon we shown that for all expanding accelerated flrw model of universe the radial pressure is positive | [['in', 'the', 'context', 'of', 'the', 'teleparallel', 'equivalent', 'of', 'general', 'relativity', 'the', 'concept', 'of', 'gravitational', 'pressure', 'and', 'gravitational', 'energymomentum', 'arisen', 'in', 'a', 'natural', 'way', 'in', 'the', 'case', 'of', 'a', 'friedmannlemaitrerobertsonwalker', 'space', 'flrw', 'we', 'obtain', 'the', 'total', 'energy', 'contained', 'inside', 'the', 'apparent', 'horizon', 'and', 'the', 'radial', 'pressure', 'over', 'the', 'apparent', 'horizon', 'area', 'we', 'use', 'these', 'definitions', 'to', 'written', 'a', 'thermodynamics', 'relation', 't_ads_a', 'de_ap_adv_a', 'at', 'the', 'apparent', 'horizon', 'where', 'e_a', 'is', 'the', 'total', 'energy', 'inside', 'the', 'apparent', 'horizon', 'v_a', 'is', 'the', 'areal', 'volume', 'of', 'the', 'apparent', 'horizon', 'p_a', 'is', 'the', 'radial', 'pressure', 'over', 'the', 'apparent', 'horizon', 'area', 's_a', 'is', 'the', 'entropy', 'which', 'can', 'be', 'assumed', 'as', 'one', 'quarter', 'of', 'the', 'apparent', 'horizon', 'area', 'only', 'for', 'a', 'non', 'stationary', 'apparent', 'horizon', 'we', 'identify', 't_a', 'as', 'the', 'temperature', 'at', 'the', 'surface', 'of', 'the', 'apparent', 'horizon', 'we', 'shown', 'that', 'for', 'all', 'expanding', 'accelerated', 'flrw', 'model', 'of', 'universe', 'the', 'radial', 'pressure', 'is', 'positive']] | [-0.1568488403467604, 0.12613172143917634, -0.11820654519316223, 0.09531123154980985, -0.0900523109085043, -0.0641829368938084, -0.031460056618218206, 0.31997391614843057, -0.2624467199461328, -0.28642307097713154, 0.10853918185926482, -0.29183373375821653, -0.021383335535776697, 0.16224476803229967, -0.08715909277735692, 0.009995215310482308, -0.04757402524248593, 0.12624556397915715, -0.10650703873478859, -0.22842099989712653, 0.34933085648420575, 0.11425282027347647, 0.2504138931916613, 0.05965621591571511, 0.17933335632874836, -0.03946237972963394, -0.02454254435320359, 0.16685833983804818, -0.19219476288086904, 0.0325233230768289, 0.2191485579824075, 0.11780176291035281, 0.26170534077876556, -0.37459616664434886, -0.21539137192242683, 0.14118508104648855, 0.12067731661308143, 0.11335840261876405, -0.0011837592335521346, -0.24349714904706665, -0.006150487509633725, -0.17868541688140896, -0.20487939874874428, 0.04748641057893918, 0.10853048410111417, -0.0716376889936833, -0.13817347177407807, 0.19091682436151636, 0.03973192777225955, -0.0040194108215574585, -0.14606732930082622, -0.03653975190536585, -0.046878469383551016, 0.045603188239814095, 0.1270146923238321, 0.04198626333689188, 0.18465062751137237, -0.06162141968282716, -0.02732779767959275, 0.35130413921756876, -0.07108172605512664, -0.1491260522743687, 0.10771525575546548, -0.24064963130513206, -0.026129361090069223, 0.12296609465233309, 0.12515524137092549, 0.11929749107285817, -0.14828746584761474, 0.1446575591406953, -0.0006994296887165143, 0.1308793266750096, 0.14261468216621628, 0.01266785502351316, 0.34475896555361235, 0.10568516460221468, 0.09307063139729305, 0.12477584850219298, -0.11423304219432692, -0.11930300548232885, -0.44351067858385956, -0.21333934963654932, -0.1606046486586921, 0.04534736591126097, -0.18168863924458695, -0.18132345970237415, 0.2998935041574037, 0.08992745166243468, 0.14601242573310932, 0.06548588959736258, 0.25453876516419566, 0.11240724835079163, 0.07641667090744401, 0.1655999518261524, 0.3015576109723447, 0.09163466882374552, 0.1636173526494531, -0.2661640673080304, 0.013791502380222987, 0.04690968165070646] |
1,802.06063 | Code smells | Code smells as symptoms of poor design and implementation choices. Many times
they are the result of so called technical debt. Our study showed that the
interest in code smells research is increasing. However, most of the
publications are appearing in conference proceedings. Most of the research is
done in G7 and other highly developed countries. Four main research themes were
identified namely code smell detection, bad smell based refactoring, software
development and anti patterns. The results show that code smells can also have
a positive connotation, we can develop software which smells good and attracts
various customers and good smelling code could also serve as a pattern for
future software development.
| cs.SE | code smells as symptoms of poor design and implementation choices many times they are the result of so called technical debt our study showed that the interest in code smells research is increasing however most of the publications are appearing in conference proceedings most of the research is done in g7 and other highly developed countries four main research themes were identified namely code smell detection bad smell based refactoring software development and anti patterns the results show that code smells can also have a positive connotation we can develop software which smells good and attracts various customers and good smelling code could also serve as a pattern for future software development | [['code', 'smells', 'as', 'symptoms', 'of', 'poor', 'design', 'and', 'implementation', 'choices', 'many', 'times', 'they', 'are', 'the', 'result', 'of', 'so', 'called', 'technical', 'debt', 'our', 'study', 'showed', 'that', 'the', 'interest', 'in', 'code', 'smells', 'research', 'is', 'increasing', 'however', 'most', 'of', 'the', 'publications', 'are', 'appearing', 'in', 'conference', 'proceedings', 'most', 'of', 'the', 'research', 'is', 'done', 'in', 'g7', 'and', 'other', 'highly', 'developed', 'countries', 'four', 'main', 'research', 'themes', 'were', 'identified', 'namely', 'code', 'smell', 'detection', 'bad', 'smell', 'based', 'refactoring', 'software', 'development', 'and', 'anti', 'patterns', 'the', 'results', 'show', 'that', 'code', 'smells', 'can', 'also', 'have', 'a', 'positive', 'connotation', 'we', 'can', 'develop', 'software', 'which', 'smells', 'good', 'and', 'attracts', 'various', 'customers', 'and', 'good', 'smelling', 'code', 'could', 'also', 'serve', 'as', 'a', 'pattern', 'for', 'future', 'software', 'development']] | [-0.09872078506259231, 0.06441785051982414, -0.06358203253297655, 0.0863569447003003, -0.10725628357246383, -0.19856513391441857, -0.010158889230575648, 0.4097079512671576, -0.16209952746987813, -0.33765245952668627, 0.16360258654720644, -0.308083751108833, -0.17875654622073378, 0.2559124140062596, -0.14991116759929438, 0.0644112775995824, 0.13669017127501099, -0.0066563785999073635, -0.029662640095134644, -0.32017779751756303, 0.26783419380316864, 0.13266519117294936, 0.34212889686763825, 0.11098624534405735, -0.01272240718239331, -0.06009531532087036, -0.12573995309470742, 0.0027742220994991227, -0.07476627242136306, 0.11491404297165908, 0.4010569844562728, 0.2777815330605786, 0.34005531337351314, -0.3926973538892763, -0.18852424138301127, 0.02844751345178297, 0.13865678572632908, 0.110448296243736, -0.08553429573421946, -0.23762240745798424, 0.09370465841310031, -0.2421297733839769, -0.10060258764225091, -0.08241518383409392, 0.0077979458991001855, 0.04749120558876343, -0.17494813597819828, -0.0687481036628932, 0.02699462313263736, 0.13742693136907644, 0.015847021692877147, -0.192834260600812, -0.03185078896779298, 0.20735150150669454, 0.12817548168823123, 0.05098034550859551, 0.15258512195401094, -0.1148024425413963, -0.16008600478714988, 0.3952177973078178, -0.025826014041363657, -0.13016833593599028, 0.21814993515543574, -0.049404740274825075, -0.2070839162454479, 0.06308584242035542, 0.19416117313871714, 0.06646549884599072, -0.1744504612576854, 0.007399707778277261, 0.0015381673720103125, 0.19414046673557242, 0.09017669710934766, 0.015879269708199677, 0.2212080994184624, 0.12832899820814664, -0.014154998802156229, 0.10969258134037273, -0.017778044633634457, -0.05171946047276661, -0.2675510932028562, -0.18316677636844483, -0.06784729201657076, -0.0275997071451432, -0.023849187917385443, -0.2015083718474384, 0.41136015806481374, 0.19699502420015969, 0.06076691130402725, -0.04060162841615074, 0.25433813490242035, -0.03929850906616093, 0.10996589270999303, 0.122420021693583, 0.15640547677354366, -0.016273392590920668, 0.11099618349459257, -0.14036386826721667, 0.15144659388760054, 0.013012147378512062] |
1,802.06064 | AD Leonis: Radial velocity signal of stellar rotation or spin-orbit
resonance? | AD Leonis is a nearby magnetically active M dwarf. We find Doppler
variability with a period of 2.23 days as well as photometric signals: (1) a
short period signal which is similar to the radial velocity signal albeit with
considerable variability; and (2) a long term activity cycle of 4070$\pm$120
days. We examine the short-term photometric signal in the available ASAS and
MOST photometry and find that the signal is not consistently present and varies
considerably as a function of time. This signal undergoes a phase change of
roughly 0.8 rad when considering the first and second halves of the MOST data
set which are separated in median time by 3.38 days. In contrast, the Doppler
signal is stable in the combined HARPS and HIRES radial velocities for over
4700 days and does not appear to vary in time in amplitude, phase, period or as
a function of extracted wavelength. We consider a variety of star-spot
scenarios and find it challenging to simultaneously explain the rapidly varying
photometric signal and the stable radial velocity signal as being caused by
starspots co-rotating on the stellar surface. This suggests that the origin of
the Doppler periodicity might be the gravitational tug of a planet orbiting the
star in spin-orbit resonance. For such a scenario and no spin-orbit
misalignment, the measured $v \sin i$ indicates an inclination angle of
15.5$\pm$2.5 deg and a planetary companion mass of 0.237$\pm$0.047 M$_{\rm
Jup}$.
| astro-ph.EP astro-ph.SR | ad leonis is a nearby magnetically active m dwarf we find doppler variability with a period of 223 days as well as photometric signals 1 a short period signal which is similar to the radial velocity signal albeit with considerable variability and 2 a long term activity cycle of 4070pm120 days we examine the shortterm photometric signal in the available asas and most photometry and find that the signal is not consistently present and varies considerably as a function of time this signal undergoes a phase change of roughly 08 rad when considering the first and second halves of the most data set which are separated in median time by 338 days in contrast the doppler signal is stable in the combined harps and hires radial velocities for over 4700 days and does not appear to vary in time in amplitude phase period or as a function of extracted wavelength we consider a variety of starspot scenarios and find it challenging to simultaneously explain the rapidly varying photometric signal and the stable radial velocity signal as being caused by starspots corotating on the stellar surface this suggests that the origin of the doppler periodicity might be the gravitational tug of a planet orbiting the star in spinorbit resonance for such a scenario and no spinorbit misalignment the measured v sin i indicates an inclination angle of 155pm25 deg and a planetary companion mass of 0237pm0047 m_rm jup | [['ad', 'leonis', 'is', 'a', 'nearby', 'magnetically', 'active', 'm', 'dwarf', 'we', 'find', 'doppler', 'variability', 'with', 'a', 'period', 'of', '223', 'days', 'as', 'well', 'as', 'photometric', 'signals', '1', 'a', 'short', 'period', 'signal', 'which', 'is', 'similar', 'to', 'the', 'radial', 'velocity', 'signal', 'albeit', 'with', 'considerable', 'variability', 'and', '2', 'a', 'long', 'term', 'activity', 'cycle', 'of', '4070pm120', 'days', 'we', 'examine', 'the', 'shortterm', 'photometric', 'signal', 'in', 'the', 'available', 'asas', 'and', 'most', 'photometry', 'and', 'find', 'that', 'the', 'signal', 'is', 'not', 'consistently', 'present', 'and', 'varies', 'considerably', 'as', 'a', 'function', 'of', 'time', 'this', 'signal', 'undergoes', 'a', 'phase', 'change', 'of', 'roughly', '08', 'rad', 'when', 'considering', 'the', 'first', 'and', 'second', 'halves', 'of', 'the', 'most', 'data', 'set', 'which', 'are', 'separated', 'in', 'median', 'time', 'by', '338', 'days', 'in', 'contrast', 'the', 'doppler', 'signal', 'is', 'stable', 'in', 'the', 'combined', 'harps', 'and', 'hires', 'radial', 'velocities', 'for', 'over', '4700', 'days', 'and', 'does', 'not', 'appear', 'to', 'vary', 'in', 'time', 'in', 'amplitude', 'phase', 'period', 'or', 'as', 'a', 'function', 'of', 'extracted', 'wavelength', 'we', 'consider', 'a', 'variety', 'of', 'starspot', 'scenarios', 'and', 'find', 'it', 'challenging', 'to', 'simultaneously', 'explain', 'the', 'rapidly', 'varying', 'photometric', 'signal', 'and', 'the', 'stable', 'radial', 'velocity', 'signal', 'as', 'being', 'caused', 'by', 'starspots', 'corotating', 'on', 'the', 'stellar', 'surface', 'this', 'suggests', 'that', 'the', 'origin', 'of', 'the', 'doppler', 'periodicity', 'might', 'be', 'the', 'gravitational', 'tug', 'of', 'a', 'planet', 'orbiting', 'the', 'star', 'in', 'spinorbit', 'resonance', 'for', 'such', 'a', 'scenario', 'and', 'no', 'spinorbit', 'misalignment', 'the', 'measured', 'v', 'sin', 'i', 'indicates', 'an', 'inclination', 'angle', 'of', '155pm25', 'deg', 'and', 'a', 'planetary', 'companion', 'mass', 'of', '0237pm0047', 'm_rm', 'jup']] | [-0.16820363161894372, 0.16571147555171195, -0.06054657877574109, 0.04003160212210849, -0.09447231046202728, -0.10853542139530818, 0.06105388778870782, 0.40260531964640206, -0.22831578576009104, -0.34987454332061046, 0.09727005585560448, -0.2590754146480726, -0.08346123697781442, 0.21309875096711847, -0.08939146964599848, -0.014436384372444998, 0.10278833017766109, 0.006396626006875537, -0.0629197495101959, -0.20048109310369194, 0.23223239776248542, 0.0339387416626669, 0.13009797514448118, -0.02881801162615546, 0.06306876208579454, -0.01946829894571152, -0.05509815229768129, -0.02415843859402479, -0.12102852819486706, -0.021170056974276517, 0.21770780273048013, 0.11909771838790587, 0.21452154027314013, -0.32554014367807627, -0.20283120589501932, 0.08760593821390127, 0.14521485802112546, 0.05091928321824401, -0.02369945531593572, -0.2725060997574598, 0.05982922569303335, -0.1807691541323279, -0.12708726786693925, 0.048483559400097936, 0.14140938378424725, 0.010193157598822035, -0.273580155430887, 0.1420276711916782, 0.03480665190901575, 0.15769326935112318, -0.1142024686261534, -0.09462836657702509, -0.06303728429966757, 0.07425699699891465, 0.07654460123590887, 0.12115345071477847, 0.11266040760460588, -0.06548251571436213, -0.036154233486367725, 0.40051321940830886, -0.14848573955520192, -0.04427834059426195, 0.18066607371497995, -0.20139032090679768, -0.09751619543267302, 0.15743495322043538, 0.18119357463816166, 0.1104146738593371, -0.13240691696217285, -0.02281670237201839, 0.009552983891489541, 0.25954178764542535, 0.08024067326019016, 0.05025698344619212, 0.30859710029490556, 0.11780557330373403, 0.06585417461330788, 0.03985830699441891, -0.2750038453984735, -0.022340810197031397, -0.2198203689601316, -0.09210147644576226, -0.15119210137233424, 0.047664741080171734, -0.11479112483556313, -0.11654125093721235, 0.42174727520626837, 0.11253778216962376, 0.25440142290272677, 0.030653807252016652, 0.3106303308875515, 0.11089624031492892, 0.10364434474517749, 0.0720109340404439, 0.33835364321772105, 0.11986243137771375, 0.12735876641942698, -0.23589722119765774, 0.07895384668884999, -0.03452325286542694] |
1,802.06065 | A Centrality Measure for Cycles and Subgraphs II | In a recent work we introduced a measure of importance for groups of vertices
in a complex network. This centrality for groups is always between 0 and 1 and
induces the eigenvector centrality over vertices. Furthermore, its value over
any group is the fraction of all network flows intercepted by this group. Here
we provide the rigorous mathematical constructions underpinning these results
via a semi-commutative extension of a number theoretic sieve. We then
established further relations between the eigenvector centrality and the
centrality proposed here, showing that the latter is a proper extension of the
former to groups of nodes. We finish by comparing the centrality proposed here
with the notion of group-centrality introduced by Everett and Borgatti on two
real-world networks: the Wolfe's dataset and the protein-protein interaction
network of the yeast \textit{Saccharomyces cerevisiae}. In this latter case, we
demonstrate that the centrality is able to distinguish protein complexes.
| cs.DS math.CO | in a recent work we introduced a measure of importance for groups of vertices in a complex network this centrality for groups is always between 0 and 1 and induces the eigenvector centrality over vertices furthermore its value over any group is the fraction of all network flows intercepted by this group here we provide the rigorous mathematical constructions underpinning these results via a semicommutative extension of a number theoretic sieve we then established further relations between the eigenvector centrality and the centrality proposed here showing that the latter is a proper extension of the former to groups of nodes we finish by comparing the centrality proposed here with the notion of groupcentrality introduced by everett and borgatti on two realworld networks the wolfes dataset and the proteinprotein interaction network of the yeast textitsaccharomyces cerevisiae in this latter case we demonstrate that the centrality is able to distinguish protein complexes | [['in', 'a', 'recent', 'work', 'we', 'introduced', 'a', 'measure', 'of', 'importance', 'for', 'groups', 'of', 'vertices', 'in', 'a', 'complex', 'network', 'this', 'centrality', 'for', 'groups', 'is', 'always', 'between', '0', 'and', '1', 'and', 'induces', 'the', 'eigenvector', 'centrality', 'over', 'vertices', 'furthermore', 'its', 'value', 'over', 'any', 'group', 'is', 'the', 'fraction', 'of', 'all', 'network', 'flows', 'intercepted', 'by', 'this', 'group', 'here', 'we', 'provide', 'the', 'rigorous', 'mathematical', 'constructions', 'underpinning', 'these', 'results', 'via', 'a', 'semicommutative', 'extension', 'of', 'a', 'number', 'theoretic', 'sieve', 'we', 'then', 'established', 'further', 'relations', 'between', 'the', 'eigenvector', 'centrality', 'and', 'the', 'centrality', 'proposed', 'here', 'showing', 'that', 'the', 'latter', 'is', 'a', 'proper', 'extension', 'of', 'the', 'former', 'to', 'groups', 'of', 'nodes', 'we', 'finish', 'by', 'comparing', 'the', 'centrality', 'proposed', 'here', 'with', 'the', 'notion', 'of', 'groupcentrality', 'introduced', 'by', 'everett', 'and', 'borgatti', 'on', 'two', 'realworld', 'networks', 'the', 'wolfes', 'dataset', 'and', 'the', 'proteinprotein', 'interaction', 'network', 'of', 'the', 'yeast', 'textitsaccharomyces', 'cerevisiae', 'in', 'this', 'latter', 'case', 'we', 'demonstrate', 'that', 'the', 'centrality', 'is', 'able', 'to', 'distinguish', 'protein', 'complexes']] | [-0.13226416910765693, 0.08147524604007501, -0.09744372754357755, 0.04843205962144468, -0.04568896070122719, -0.087509141514405, 0.05493189612831417, 0.39732567665821594, -0.26241499993862033, -0.2771957639409733, 0.00015207701378401267, -0.28867559341046756, -0.2072562686406781, 0.1499256919597502, -0.05915896198712289, -0.008315195993762589, 0.08832278944838264, 0.08006543818899789, 0.0025437251928992367, -0.2402407456617299, 0.3566283536146747, 0.05366182524232647, 0.2554933823616798, 0.1152588843204383, 0.10448658188200884, 0.017497429712297948, -0.03248589391492911, 0.09084066736584252, -0.14777000037989835, 0.17710071842884645, 0.26574427886855023, 0.14435191080918083, 0.2928541820284728, -0.3439178911943895, -0.19598946108080045, 0.16290606718787268, 0.11761229385848383, 0.06758611807536737, -0.015428362149946593, -0.2873871277253194, 0.14093218714539968, -0.22488913385077958, -0.07905313979230218, -0.05807568215941255, 0.05728675456830879, 0.027158488591856045, -0.236331219457694, 0.06090137090477337, 0.056335850813853984, 0.08445216363572793, -0.014463965295190801, -0.08980783981245917, -0.040959857950125494, 0.13248383612812473, 0.03268838546087814, 0.007409414836532764, 0.10550052738383513, -0.08688793878379353, -0.17537370520467693, 0.33779099350165875, -0.00042660037256978656, -0.20283292050865115, 0.1842826013579159, -0.08894713564675201, -0.17786197864916176, 0.051759806304314246, 0.15218795445823186, 0.12837988964433, -0.12393945364306706, 0.03754483243234997, -0.10024282189614668, 0.1272184739575243, 0.060176989139133205, -0.027383178595226963, 0.07995777776326381, 0.17796323286067392, 0.09273405775830552, 0.1372365880886571, -0.05083082909412632, -0.07990722675694505, -0.28408769924804017, -0.16415096550701638, -0.18772905323154143, 0.04689383284012611, -0.14352076722423443, -0.1157262214739505, 0.4711022087973794, 0.14689403747183247, 0.23309839339423422, 0.10631266391735424, 0.25104998036998016, 0.015646262480594166, 0.06496089667072394, 0.06930619886623242, 0.193235171040067, 0.16608517022482497, 0.06838699495750228, -0.1804252082538615, 0.0848500126024167, 0.1020091161780009] |
1,802.06066 | Quantitative Constraints on the Reionization History from the IGM
Damping Wing Signature in Two Quasars at z > 7 | During reionization, neutral hydrogen in the intergalactic medium (IGM)
imprints a damping wing absorption feature on the spectrum of high-redshift
quasars. A detection of this signature provides compelling evidence for a
significantly neutral Universe, and enables measurements of the hydrogen
neutral fraction $x_{\rm HI}(z)$ at that epoch. Obtaining reliable quantitative
constraints from this technique, however, is challenging due to stochasticity
induced by the patchy inside-out topology of reionization, degeneracies with
quasar lifetime, and the unknown unabsorbed quasar spectrum close to rest-frame
Ly$\alpha$. We combine a large-volume semi-numerical simulation of reionization
topology with 1D radiative transfer through high-resolution hydrodynamical
simulations of the high-redshift Universe to construct models of quasar
transmission spectra during reionization. Our state-of-the-art approach
captures the distribution of damping wing strengths in biased quasar halos that
should have reionized earlier, as well as the erosion of neutral gas in the
quasar environment caused by its own ionizing radiation. Combining this
detailed model with our new technique for predicting the quasar continuum and
its associated uncertainty, we introduce a Bayesian statistical method to
jointly constrain the neutral fraction of the Universe and the quasar lifetime
from individual quasar spectra. We apply this methodology to the spectra of the
two highest redshift quasars known, ULAS J1120+0641 and ULAS J1342+0928, and
measured volume-averaged neutral fractions $\langle x_{\rm HI}
\rangle(z=7.09)=0.48^{+0.26}_{-0.26}$ and $\langle x_{\rm HI}
\rangle(z=7.54)=0.60^{+0.20}_{-0.23}$ (posterior medians and 68% credible
intervals) when marginalized over quasar lifetimes of $10^3 \leq t_{\rm q} \leq
10^8$ years.
| astro-ph.CO | during reionization neutral hydrogen in the intergalactic medium igm imprints a damping wing absorption feature on the spectrum of highredshift quasars a detection of this signature provides compelling evidence for a significantly neutral universe and enables measurements of the hydrogen neutral fraction x_rm hiz at that epoch obtaining reliable quantitative constraints from this technique however is challenging due to stochasticity induced by the patchy insideout topology of reionization degeneracies with quasar lifetime and the unknown unabsorbed quasar spectrum close to restframe lyalpha we combine a largevolume seminumerical simulation of reionization topology with 1d radiative transfer through highresolution hydrodynamical simulations of the highredshift universe to construct models of quasar transmission spectra during reionization our stateoftheart approach captures the distribution of damping wing strengths in biased quasar halos that should have reionized earlier as well as the erosion of neutral gas in the quasar environment caused by its own ionizing radiation combining this detailed model with our new technique for predicting the quasar continuum and its associated uncertainty we introduce a bayesian statistical method to jointly constrain the neutral fraction of the universe and the quasar lifetime from individual quasar spectra we apply this methodology to the spectra of the two highest redshift quasars known ulas j11200641 and ulas j13420928 and measured volumeaveraged neutral fractions langle x_rm hi ranglez709048026_026 and langle x_rm hi ranglez754060020_023 posterior medians and 68 credible intervals when marginalized over quasar lifetimes of 103 leq t_rm q leq 108 years | [['during', 'reionization', 'neutral', 'hydrogen', 'in', 'the', 'intergalactic', 'medium', 'igm', 'imprints', 'a', 'damping', 'wing', 'absorption', 'feature', 'on', 'the', 'spectrum', 'of', 'highredshift', 'quasars', 'a', 'detection', 'of', 'this', 'signature', 'provides', 'compelling', 'evidence', 'for', 'a', 'significantly', 'neutral', 'universe', 'and', 'enables', 'measurements', 'of', 'the', 'hydrogen', 'neutral', 'fraction', 'x_rm', 'hiz', 'at', 'that', 'epoch', 'obtaining', 'reliable', 'quantitative', 'constraints', 'from', 'this', 'technique', 'however', 'is', 'challenging', 'due', 'to', 'stochasticity', 'induced', 'by', 'the', 'patchy', 'insideout', 'topology', 'of', 'reionization', 'degeneracies', 'with', 'quasar', 'lifetime', 'and', 'the', 'unknown', 'unabsorbed', 'quasar', 'spectrum', 'close', 'to', 'restframe', 'lyalpha', 'we', 'combine', 'a', 'largevolume', 'seminumerical', 'simulation', 'of', 'reionization', 'topology', 'with', '1d', 'radiative', 'transfer', 'through', 'highresolution', 'hydrodynamical', 'simulations', 'of', 'the', 'highredshift', 'universe', 'to', 'construct', 'models', 'of', 'quasar', 'transmission', 'spectra', 'during', 'reionization', 'our', 'stateoftheart', 'approach', 'captures', 'the', 'distribution', 'of', 'damping', 'wing', 'strengths', 'in', 'biased', 'quasar', 'halos', 'that', 'should', 'have', 'reionized', 'earlier', 'as', 'well', 'as', 'the', 'erosion', 'of', 'neutral', 'gas', 'in', 'the', 'quasar', 'environment', 'caused', 'by', 'its', 'own', 'ionizing', 'radiation', 'combining', 'this', 'detailed', 'model', 'with', 'our', 'new', 'technique', 'for', 'predicting', 'the', 'quasar', 'continuum', 'and', 'its', 'associated', 'uncertainty', 'we', 'introduce', 'a', 'bayesian', 'statistical', 'method', 'to', 'jointly', 'constrain', 'the', 'neutral', 'fraction', 'of', 'the', 'universe', 'and', 'the', 'quasar', 'lifetime', 'from', 'individual', 'quasar', 'spectra', 'we', 'apply', 'this', 'methodology', 'to', 'the', 'spectra', 'of', 'the', 'two', 'highest', 'redshift', 'quasars', 'known', 'ulas', 'j11200641', 'and', 'ulas', 'j13420928', 'and', 'measured', 'volumeaveraged', 'neutral', 'fractions', 'langle', 'x_rm', 'hi', 'ranglez709048026_026', 'and', 'langle', 'x_rm', 'hi', 'ranglez754060020_023', 'posterior', 'medians', 'and', '68', 'credible', 'intervals', 'when', 'marginalized', 'over', 'quasar', 'lifetimes', 'of', '103', 'leq', 't_rm', 'q', 'leq', '108', 'years']] | [-0.02025549990153252, 0.10317936804044259, -0.014281956286064377, 0.09064608053050967, -0.08969177604189228, -0.0870058949253518, 0.05224450056296948, 0.4516667429991963, -0.12877476800459137, -0.315975217890992, -0.0073616841357887165, -0.31800459819031435, 0.008825282370437825, 0.16229622573669703, 0.043418715957349564, -0.003487673361598666, 0.021692545991001268, -0.17004917031270939, 0.008681832278445928, -0.27887287384939524, 0.2720223511630089, 0.15550179294384547, 0.1959819458054854, -0.009740708339822997, 0.11253113675644333, -0.09328984866059038, -0.1554085134302566, -0.023514649261833484, -0.20649123782513393, 0.03529562389626164, 0.23906954453555027, 0.1822078511134476, 0.23653619676423124, -0.29656725914985194, -0.21934053001664267, 0.11883103746236945, 0.23201382664498915, 0.10685780919624578, -0.0394344583984706, -0.30329724950676934, 0.023032921561596247, -0.20866101136173912, -0.10797598332490102, 0.0610355844240924, 0.016661345152083052, -0.021890073524160645, -0.2238002489968768, 0.20021577615088249, -0.031020997581656665, 0.04954326422748674, -0.08025972629219262, -0.06639237835015478, -0.0995965463910096, 0.02749150396808378, -0.006903568819987443, 0.03477807291179397, 0.23045006955323047, -0.16667163565123616, -0.003266811269534183, 0.4256627188165473, -0.13081929882380441, 0.031747543085444425, 0.15437462255865272, -0.21273112252245513, -0.19816066824858344, 0.20560926745088468, 0.17458573295627663, 0.08555878406764636, -0.11037997245501432, 0.03503673258295992, -0.025226345225130148, 0.24797260919274083, -0.0016520705159800322, 0.060158734738818956, 0.3217815110483304, 0.08886990205152935, 0.03757872298519638, 0.051413038016830774, -0.1833908737602519, 0.027847689009470298, -0.22017817260944927, -0.08422067388794754, -0.13232888102289836, 0.15711692846906236, -0.14965521485133634, -0.13308267905591173, 0.36017180284267003, 0.1933588870161965, 0.26520268932505114, 0.10225426914778277, 0.3759205565246204, 0.07497367651199836, 0.0034834042758482148, 0.06136694824358129, 0.28884230285423135, 0.19108611790494504, 0.097081591009365, -0.2417332598068615, 0.08868443622608439, 0.02182417526713545] |
1,802.06067 | Algorithmic improvements for the CIECAM02 and CAM16 color appearance
models | This note is concerned with the CIECAM02 color appearance model and its
successor, the CAM16 color appearance model. Several algorithmic flaws are
pointed out and remedies are suggested. The resulting color model is
algebraically equivalent to CIECAM02/CAM16, but shorter, more efficient, and
works correctly for all edge cases.
| eess.IV | this note is concerned with the ciecam02 color appearance model and its successor the cam16 color appearance model several algorithmic flaws are pointed out and remedies are suggested the resulting color model is algebraically equivalent to ciecam02cam16 but shorter more efficient and works correctly for all edge cases | [['this', 'note', 'is', 'concerned', 'with', 'the', 'ciecam02', 'color', 'appearance', 'model', 'and', 'its', 'successor', 'the', 'cam16', 'color', 'appearance', 'model', 'several', 'algorithmic', 'flaws', 'are', 'pointed', 'out', 'and', 'remedies', 'are', 'suggested', 'the', 'resulting', 'color', 'model', 'is', 'algebraically', 'equivalent', 'to', 'ciecam02cam16', 'but', 'shorter', 'more', 'efficient', 'and', 'works', 'correctly', 'for', 'all', 'edge', 'cases']] | [-0.0604924716702145, 0.09611988812685013, -0.09297453036110205, 0.156032660512978, -0.08881344417524006, -0.21386052816071444, 0.010139267663988802, 0.46389269563886854, -0.2319846472909881, -0.3060174397399856, 0.10742765148687694, -0.28652483561179704, -0.1716127379073037, 0.12958690704674355, -0.13299615189122657, 0.030523933296919697, 0.04209369930128257, 0.05241962360839049, -0.03680351444830497, -0.3038171112123463, 0.27358345655310484, 0.01749523344139258, 0.2880372270165632, 0.042722728020615046, 0.04610879220482376, -0.0052333904533750485, -0.12102102444817622, 0.06349402233313918, -0.07875766431291899, 0.0783342995784349, 0.24285624155567753, 0.11694114892808204, 0.21550665199756622, -0.37749699080983795, -0.2102839039431678, 0.13355595185421407, 0.13654112461954354, 0.14938993586434257, 0.0031469001056393608, -0.23879353064629766, 0.1363015139165024, -0.14833983319501082, -0.13715879809525278, -0.06432869895878765, 0.08592963102791044, -0.05477979549517234, -0.20471083439058727, 0.02442005833403932, 0.15101599266959562, 0.03815886713564396, -0.037232908246935245, -0.17870998525371154, -0.02138806482156118, 0.07292082370776269, 0.0823041022884556, 0.059489879001759824, 0.07121119800334176, -0.1492318300064653, -0.10039860136393043, 0.37771058993207085, 0.026996961867229805, -0.1452601677013768, 0.20078941768345734, -0.030203365741504562, -0.0836185168267952, 0.1201051465753052, 0.012227649086465437, 0.12532913531694148, -0.17038089289433425, 0.04483301993071412, -0.04806572176102135, 0.12199451008604632, 0.045805345496369734, 0.06744208586298757, 0.22789843095363013, 0.13473972531759904, 0.03628858394869086, 0.15048313579625552, -0.08062189368324148, -0.12326145330443979, -0.33625203793247543, -0.07527184501135101, -0.08822576182428747, -0.04409295399155882, -0.02839586673621347, -0.14043371498377788, 0.43634889307949276, 0.23495552562073702, 0.18945063019378316, 0.04605052156580819, 0.30719859624902407, 0.07831717127313216, 0.08209025291725994, 0.08646576277290781, 0.19652026045239634, 0.09721023771497939, 0.045172672108229665, -0.18465755813651616, 0.08160674422979355, 0.07718991624812285] |
1,802.06068 | Artificial intelligence and pediatrics: A synthetic mini review | The use of artificial intelligence intelligencein medicine can be traced back
to 1968 when Paycha published his paper Le diagnostic a l'aide d'intelligences
artificielle, presentation de la premiere machine diagnostri. Few years later
Shortliffe et al. presented an expert system named Mycin which was able to
identify bacteria causing severe blood infections and to recommend antibiotics.
Despite the fact that Mycin outperformed members of the Stanford medical school
in the reliability of diagnosis it was never used in practice due to a legal
issue who do you sue if it gives a wrong diagnosis?. However only in 2016 when
the artificial intelligence software built into the IBM Watson AI platform
correctly diagnosed and proposed an effective treatment for a 60-year-old
womans rare form of leukemia the AI use in medicine become really popular.On of
first papers presenting the use of AI in paediatrics was published in 1984. The
paper introduced a computer-assisted medical decision making system called
SHELP.
| cs.AI | the use of artificial intelligence intelligencein medicine can be traced back to 1968 when paycha published his paper le diagnostic a laide dintelligences artificielle presentation de la premiere machine diagnostri few years later shortliffe et al presented an expert system named mycin which was able to identify bacteria causing severe blood infections and to recommend antibiotics despite the fact that mycin outperformed members of the stanford medical school in the reliability of diagnosis it was never used in practice due to a legal issue who do you sue if it gives a wrong diagnosis however only in 2016 when the artificial intelligence software built into the ibm watson ai platform correctly diagnosed and proposed an effective treatment for a 60yearold womans rare form of leukemia the ai use in medicine become really popularon of first papers presenting the use of ai in paediatrics was published in 1984 the paper introduced a computerassisted medical decision making system called shelp | [['the', 'use', 'of', 'artificial', 'intelligence', 'intelligencein', 'medicine', 'can', 'be', 'traced', 'back', 'to', '1968', 'when', 'paycha', 'published', 'his', 'paper', 'le', 'diagnostic', 'a', 'laide', 'dintelligences', 'artificielle', 'presentation', 'de', 'la', 'premiere', 'machine', 'diagnostri', 'few', 'years', 'later', 'shortliffe', 'et', 'al', 'presented', 'an', 'expert', 'system', 'named', 'mycin', 'which', 'was', 'able', 'to', 'identify', 'bacteria', 'causing', 'severe', 'blood', 'infections', 'and', 'to', 'recommend', 'antibiotics', 'despite', 'the', 'fact', 'that', 'mycin', 'outperformed', 'members', 'of', 'the', 'stanford', 'medical', 'school', 'in', 'the', 'reliability', 'of', 'diagnosis', 'it', 'was', 'never', 'used', 'in', 'practice', 'due', 'to', 'a', 'legal', 'issue', 'who', 'do', 'you', 'sue', 'if', 'it', 'gives', 'a', 'wrong', 'diagnosis', 'however', 'only', 'in', '2016', 'when', 'the', 'artificial', 'intelligence', 'software', 'built', 'into', 'the', 'ibm', 'watson', 'ai', 'platform', 'correctly', 'diagnosed', 'and', 'proposed', 'an', 'effective', 'treatment', 'for', 'a', '60yearold', 'womans', 'rare', 'form', 'of', 'leukemia', 'the', 'ai', 'use', 'in', 'medicine', 'become', 'really', 'popularon', 'of', 'first', 'papers', 'presenting', 'the', 'use', 'of', 'ai', 'in', 'paediatrics', 'was', 'published', 'in', '1984', 'the', 'paper', 'introduced', 'a', 'computerassisted', 'medical', 'decision', 'making', 'system', 'called', 'shelp']] | [-0.01576784857221552, 0.0612770929962878, -0.08904154262838986, 0.07061876995470123, -0.1404728014242357, -0.2008821365102572, 0.06425473255237464, 0.2910101292780726, -0.18020754434621414, -0.330491710274883, 0.08730346886472576, -0.2940602315042319, -0.21704975151255526, 0.2005752496605399, -0.22355931301638987, 0.023842446529621107, 0.08691354742906107, 0.040786901429119345, 0.07879842949379864, -0.3718460368942721, 0.21114962446390073, 0.09607437867167834, 0.31211345916538424, 0.01513176022146237, 0.08285588549758383, 0.039301505142420125, -0.04101322788581554, -0.017521204017071256, -0.09538888007685002, 0.11220963023024032, 0.3670171115585175, 0.23680533640514556, 0.4204025765427867, -0.4094757866234333, -0.16800888372912398, 0.09040601308948386, 0.16038988807830154, 0.09723136963863932, -0.023211768738661164, -0.33407009009120836, 0.03416937477418656, -0.22710855300435986, -0.1097869799013023, -0.06155449636296269, 0.0612925435447864, -0.06602829072397907, -0.2106495678607324, 0.005901891605045987, 0.03614451354243667, 0.15551994788158383, -0.01798422947035146, -0.15465847997001145, 0.0018607198034186622, 0.15547696531103686, 0.032165605197283065, 0.07124895147815649, 0.12994867572372124, -0.1323223360656836, -0.13342127342695823, 0.36013061063666196, 0.011945660115137847, -0.10351904866449232, 0.20111496116953423, -0.03305051734708753, -0.2023379117088405, 0.05647458602372255, 0.17260403122054413, 0.0726972823161034, -0.19855439258242621, 0.036251232461418606, 0.02307042674943364, 0.16766168682747898, 0.12324149933772639, -0.11966475707044624, 0.16236530979969413, 0.15347364604963945, -0.04714015356974512, 0.047313257970853485, -0.041136095424598035, -0.05577953820426734, -0.16395811866213744, -0.2003770985202455, -0.12715742497616825, 0.07310962997852019, 0.05849981517236007, -0.17848408537149127, 0.3123773782989136, 0.21579080696431668, 0.09600140493067384, -0.02821302306885529, 0.2539454360450838, 0.028986427855891856, 0.06963364922243322, 0.07057716283708106, 0.22946702180637954, 0.05804564000887645, 0.20591399618864967, -0.1516951308774485, 0.12055511092704192, 0.05186072750822515] |
1,802.06069 | Inflation in a scale invariant universe | A scale-invariant universe can have a period of accelerated expansion at
early times: inflation. We use a frame-invariant approach to calculate
inflationary observables in a scale invariant theory of gravity involving two
scalar fields - the spectral indices, the tensor to scalar ratio, the level of
isocurvature modes and non-Gaussianity. We show that scale symmetry leads to an
exact cancellation of isocurvature modes and that, in the scale-symmetry broken
phase, this theory is well described by a single scalar field theory. We find
the predictions of this theory strongly compatible with current observations.
| astro-ph.CO gr-qc hep-ph hep-th | a scaleinvariant universe can have a period of accelerated expansion at early times inflation we use a frameinvariant approach to calculate inflationary observables in a scale invariant theory of gravity involving two scalar fields the spectral indices the tensor to scalar ratio the level of isocurvature modes and nongaussianity we show that scale symmetry leads to an exact cancellation of isocurvature modes and that in the scalesymmetry broken phase this theory is well described by a single scalar field theory we find the predictions of this theory strongly compatible with current observations | [['a', 'scaleinvariant', 'universe', 'can', 'have', 'a', 'period', 'of', 'accelerated', 'expansion', 'at', 'early', 'times', 'inflation', 'we', 'use', 'a', 'frameinvariant', 'approach', 'to', 'calculate', 'inflationary', 'observables', 'in', 'a', 'scale', 'invariant', 'theory', 'of', 'gravity', 'involving', 'two', 'scalar', 'fields', 'the', 'spectral', 'indices', 'the', 'tensor', 'to', 'scalar', 'ratio', 'the', 'level', 'of', 'isocurvature', 'modes', 'and', 'nongaussianity', 'we', 'show', 'that', 'scale', 'symmetry', 'leads', 'to', 'an', 'exact', 'cancellation', 'of', 'isocurvature', 'modes', 'and', 'that', 'in', 'the', 'scalesymmetry', 'broken', 'phase', 'this', 'theory', 'is', 'well', 'described', 'by', 'a', 'single', 'scalar', 'field', 'theory', 'we', 'find', 'the', 'predictions', 'of', 'this', 'theory', 'strongly', 'compatible', 'with', 'current', 'observations']] | [-0.19366502384250256, 0.2307467110236441, -0.14709760046199613, 0.1114883432658288, -0.05818586202297846, -0.11468893915171856, -0.05586934310217064, 0.31157889219162904, -0.2103147401433924, -0.27771470900473144, 0.052317134340030505, -0.22556376797349556, -0.14952672848923373, 0.10376927402040051, 0.003931944896264568, 0.006689930162595018, 0.00517981354167442, 0.03576752788427731, -0.06103120226939411, -0.22029981484798633, 0.30674562631579844, 0.09265555513759507, 0.2492482476240105, 0.00543711813794368, 0.06347863405117886, -0.07109689500446068, -0.01895054477189779, 0.019565391111309113, -0.14363476212478735, 0.11164273490683864, 0.18310058086543626, 0.10746492917204033, 0.183882305621291, -0.4230909755089037, -0.22676613345570135, 0.12125757349270355, 0.12878388120367637, 0.15000567396434591, -0.025893656972228833, -0.2528460143417444, 0.06600045091877489, -0.17756279019395943, -0.1384770256396302, -0.11127831350566576, -0.031189818743808682, -0.1114053773774725, -0.32192250770395214, 0.15794873010916333, -0.03799000653974793, 0.01032041465235955, -0.04305595332635161, -0.02913943457963836, -0.012478222255595028, -0.004066327576646986, 0.14922009107059517, 0.036545128421415066, 0.14689824543513721, -0.16316554778883152, -0.12724587553226308, 0.3795607883138987, -0.21304656224041854, -0.12666804323215847, 0.10114883746870834, -0.1490698076389811, -0.1759622377930614, 0.07674478075679635, 0.13013735652455818, 0.11479479923803845, -0.08308869469708399, 0.16426815205570322, 0.05605577442379992, 0.18764371622819453, 0.07582717627266665, 0.04340708844930581, 0.3027757979909201, 0.062475056691176215, 0.04163496773791216, 0.09441372657538918, -0.01592813292518258, -0.10474632249173263, -0.38091796604187594, -0.09772226944915019, -0.16072160292431995, 0.0790916837691127, -0.1437086430122018, -0.20308058012438857, 0.44962990279916837, 0.13943475449923426, 0.19887229184804828, 0.07758090609644094, 0.27807197861535393, 0.15761813365489893, 0.05938331479584398, 0.05283681529766435, 0.3113436221256447, 0.1705894577304286, 0.10097712323105319, -0.22692493286550694, -0.09303983641565657, 0.0530998687988714] |
1,802.0607 | Diversity is All You Need: Learning Skills without a Reward Function | Intelligent creatures can explore their environments and learn useful skills
without supervision. In this paper, we propose DIAYN ('Diversity is All You
Need'), a method for learning useful skills without a reward function. Our
proposed method learns skills by maximizing an information theoretic objective
using a maximum entropy policy. On a variety of simulated robotic tasks, we
show that this simple objective results in the unsupervised emergence of
diverse skills, such as walking and jumping. In a number of reinforcement
learning benchmark environments, our method is able to learn a skill that
solves the benchmark task despite never receiving the true task reward. We show
how pretrained skills can provide a good parameter initialization for
downstream tasks, and can be composed hierarchically to solve complex, sparse
reward tasks. Our results suggest that unsupervised discovery of skills can
serve as an effective pretraining mechanism for overcoming challenges of
exploration and data efficiency in reinforcement learning.
| cs.AI cs.RO | intelligent creatures can explore their environments and learn useful skills without supervision in this paper we propose diayn diversity is all you need a method for learning useful skills without a reward function our proposed method learns skills by maximizing an information theoretic objective using a maximum entropy policy on a variety of simulated robotic tasks we show that this simple objective results in the unsupervised emergence of diverse skills such as walking and jumping in a number of reinforcement learning benchmark environments our method is able to learn a skill that solves the benchmark task despite never receiving the true task reward we show how pretrained skills can provide a good parameter initialization for downstream tasks and can be composed hierarchically to solve complex sparse reward tasks our results suggest that unsupervised discovery of skills can serve as an effective pretraining mechanism for overcoming challenges of exploration and data efficiency in reinforcement learning | [['intelligent', 'creatures', 'can', 'explore', 'their', 'environments', 'and', 'learn', 'useful', 'skills', 'without', 'supervision', 'in', 'this', 'paper', 'we', 'propose', 'diayn', 'diversity', 'is', 'all', 'you', 'need', 'a', 'method', 'for', 'learning', 'useful', 'skills', 'without', 'a', 'reward', 'function', 'our', 'proposed', 'method', 'learns', 'skills', 'by', 'maximizing', 'an', 'information', 'theoretic', 'objective', 'using', 'a', 'maximum', 'entropy', 'policy', 'on', 'a', 'variety', 'of', 'simulated', 'robotic', 'tasks', 'we', 'show', 'that', 'this', 'simple', 'objective', 'results', 'in', 'the', 'unsupervised', 'emergence', 'of', 'diverse', 'skills', 'such', 'as', 'walking', 'and', 'jumping', 'in', 'a', 'number', 'of', 'reinforcement', 'learning', 'benchmark', 'environments', 'our', 'method', 'is', 'able', 'to', 'learn', 'a', 'skill', 'that', 'solves', 'the', 'benchmark', 'task', 'despite', 'never', 'receiving', 'the', 'true', 'task', 'reward', 'we', 'show', 'how', 'pretrained', 'skills', 'can', 'provide', 'a', 'good', 'parameter', 'initialization', 'for', 'downstream', 'tasks', 'and', 'can', 'be', 'composed', 'hierarchically', 'to', 'solve', 'complex', 'sparse', 'reward', 'tasks', 'our', 'results', 'suggest', 'that', 'unsupervised', 'discovery', 'of', 'skills', 'can', 'serve', 'as', 'an', 'effective', 'pretraining', 'mechanism', 'for', 'overcoming', 'challenges', 'of', 'exploration', 'and', 'data', 'efficiency', 'in', 'reinforcement', 'learning']] | [-0.02457547422309765, 0.0471190825255749, -0.11119791523407341, 0.0876344796467962, -0.22231972346301465, -0.1951046578153919, 0.07395796722571177, 0.5068056285746542, -0.26582259396882424, -0.3804198609896345, 0.027893812544765622, -0.19794682811434364, -0.2512237610648465, 0.21650751211126548, -0.18803122909009165, 0.07410213545427408, 0.15634160580378317, 0.05387709432702323, -0.037898330083360375, -0.2871996481610718, 0.28187689238708785, 0.004340228174198297, 0.30142497395475704, 0.036256103198123134, 0.17829874473444363, -0.007347164986034234, 0.04122132125608866, -0.03227637711230641, -0.04094397608456894, 0.16075475207755183, 0.4368099979310619, 0.2810972652556314, 0.4411587398620992, -0.3831139305070822, -0.2273045985843816, 0.12764156496249676, 0.15496753376156847, 0.0892441021156759, -0.08402560196369521, -0.32837216724075524, 0.06098652575157425, -0.16369849141516718, -0.04186984653176825, -0.1925186511141315, -0.07087819236543735, -0.03552911051372492, -0.34310991373034866, -0.025461440754702826, 0.06306335813247178, 0.0673259947771584, -0.061160173203211786, -0.11196441085266522, 0.03873693348925098, 0.21743175202335407, 0.02510072116350475, 0.048885672668975116, 0.18891283727305777, -0.23952262475173555, -0.20437927877080012, 0.3497164071981911, -0.021374922719011022, -0.21824720790988258, 0.21095640214351827, 0.023523461303614334, -0.15494806795712754, 0.0746691026968358, 0.2752456653062741, 0.14735399123914297, -0.15859512950969384, -0.007790775121999235, -0.05649790207526701, 0.1848031158126842, 0.003070678626601067, -0.0451721390610366, 0.18761549024839635, 0.2778972518885983, 0.07346786370537445, 0.13280447446847687, -0.03519904959392947, -0.06279103382143612, -0.2024128653430167, -0.1411970233224375, -0.22415608575862828, -0.010206446426713632, -0.11604354763517667, -0.06200713630148599, 0.3602197898028333, 0.24595943267998938, 0.20786366962639044, 0.15684224537336358, 0.34845527659894693, 0.01090027205113419, 0.08341306683167418, 0.11533800810134172, 0.15862026160318113, -0.043162084978950375, 0.15837508821981697, -0.2116725420125827, 0.13974772037913888, 0.026387971959813357] |
1,802.06071 | The origins and legacy of Kolmogorov's Grundbegriffe | April 25, 2003, marked the 100th anniversary of the birth of Andrei
Nikolaevich Kolmogorov, the twentieth century's foremost contributor to the
mathematical and philosophical foundations of probability. The year 2003 was
also the 70th anniversary of the publication of Kolmogorov's Grundbegriffe der
Wahrscheinlichkeitsrechnung. Kolmogorov's Grundbegriffe put probability's
modern mathematical formalism in place. It also provided a philosophy of
probability - an explanation of how the formalism can be connected to the world
of experience. In this article, we examine the sources of these two aspects of
the Grundbegriffe - the work of the earlier scholars whose ideas Kolmogorov
synthesized.
| math.HO math.PR | april 25 2003 marked the 100th anniversary of the birth of andrei nikolaevich kolmogorov the twentieth centurys foremost contributor to the mathematical and philosophical foundations of probability the year 2003 was also the 70th anniversary of the publication of kolmogorovs grundbegriffe der wahrscheinlichkeitsrechnung kolmogorovs grundbegriffe put probabilitys modern mathematical formalism in place it also provided a philosophy of probability an explanation of how the formalism can be connected to the world of experience in this article we examine the sources of these two aspects of the grundbegriffe the work of the earlier scholars whose ideas kolmogorov synthesized | [['april', '25', '2003', 'marked', 'the', '100th', 'anniversary', 'of', 'the', 'birth', 'of', 'andrei', 'nikolaevich', 'kolmogorov', 'the', 'twentieth', 'centurys', 'foremost', 'contributor', 'to', 'the', 'mathematical', 'and', 'philosophical', 'foundations', 'of', 'probability', 'the', 'year', '2003', 'was', 'also', 'the', '70th', 'anniversary', 'of', 'the', 'publication', 'of', 'kolmogorovs', 'grundbegriffe', 'der', 'wahrscheinlichkeitsrechnung', 'kolmogorovs', 'grundbegriffe', 'put', 'probabilitys', 'modern', 'mathematical', 'formalism', 'in', 'place', 'it', 'also', 'provided', 'a', 'philosophy', 'of', 'probability', 'an', 'explanation', 'of', 'how', 'the', 'formalism', 'can', 'be', 'connected', 'to', 'the', 'world', 'of', 'experience', 'in', 'this', 'article', 'we', 'examine', 'the', 'sources', 'of', 'these', 'two', 'aspects', 'of', 'the', 'grundbegriffe', 'the', 'work', 'of', 'the', 'earlier', 'scholars', 'whose', 'ideas', 'kolmogorov', 'synthesized']] | [-0.05168749345714187, 0.09474409956616929, -0.1650367534863069, 0.11354316187839202, -0.1217521409048362, -0.07686933270219634, 0.07258126448079488, 0.19657952251269462, -0.22229709095281966, -0.3237417517031761, 0.051991221794680235, -0.2969093005410693, -0.17292242727064072, 0.19512900587250578, -0.16539003136270541, -0.01007996586726067, 0.033392957669306306, 0.0058609332649057055, 0.007560876193159121, -0.32572281731173713, 0.2937558323808728, 0.14575473501525343, 0.2952406694518125, 0.06100450772693024, 0.08546312651541232, -0.040040931743668746, -0.14344887325337077, -0.05963720407019904, -0.18008135028302352, 0.1644423854576939, 0.27091420098069185, 0.19361413274198136, 0.3541457063340126, -0.43256330779416763, -0.13652570275193515, 0.025182181275746923, 0.047108201793038304, 0.05413151773168368, 0.05707801750147755, -0.32575981722193514, -0.0117227630442048, -0.21689135529734987, -0.153245298667474, 0.074031004045924, 0.10751279302813271, -0.009242684610108746, -0.07790906687187864, 0.05460122298446801, 0.1262476603559991, 0.0914186382606784, -0.02156980403084704, -0.10677503495343386, 0.03050957749439205, 0.11327904764008015, 0.08018412667901274, 0.04547920295512898, 0.06342521306880294, -0.07455063255335342, -0.16397828252074567, 0.38054261163887665, 0.013944826227553348, -0.04326463924681253, 0.14623781337719807, -0.1581626374750061, -0.18810655238067217, 0.03687464658596969, 0.15022203104293091, 0.05802375892117778, -0.15210430771905056, 0.1079216132781399, -0.04366666768142517, 0.12533718896930682, 0.1342633079206125, -0.010342870006694439, 0.2062187088217507, 0.13739974678375144, -0.0806919967859706, 0.05166188538188432, -0.05880451863482991, -0.17063311272439488, -0.3178616007963354, -0.20459967984347616, -0.1450524478209542, 0.11672832877028416, -0.0011268059989038676, -0.15157627271168786, 0.40165483211464387, 0.1654438530794652, 0.09049604485366256, 0.04153907208386412, 0.19934376121122152, 0.10997250149066144, -0.04597998737912387, 0.0508974881129379, 0.2610304888679666, 0.18918794078474982, 0.2252354138392083, -0.11400093715836077, 0.08540152336787829, 0.11707811217576741] |
1,802.06072 | 3-D Volumetric Gamma-ray Imaging and Source Localization with a Mobile
Robot | Radiation detection has largely been a manual inspection process with point
sensors such as Geiger-Muller counters and scintillation spectrometers to date.
While their observations of source proximity prove useful, they lack the
directional information necessary for efficient source localization and
characterization in cluttered environments with multiple radiation sources. The
recent commercialization of Compton gamma cameras provides directional
information to the broader radiation detection community for the first time.
This paper presents the integration of a Compton gamma camera with a
self-localizing ground robot for accurate 3D radiation mapping. Using the
position and orientation of the robot, radiation images from the gamma camera
are accumulated over a traversed path in a shared frame of reference to
construct a consistent voxel grid-based radiation map. The peaks of the map at
pre-specified energy windows are selected as the source location estimates,
which are compared to the ground truth source locations. The proposed approach
localizes multiple sources to within an average of 0.2 m in two 5 x 4 m^2 and
14 x 6 m^2 laboratory environments.
| cs.RO | radiation detection has largely been a manual inspection process with point sensors such as geigermuller counters and scintillation spectrometers to date while their observations of source proximity prove useful they lack the directional information necessary for efficient source localization and characterization in cluttered environments with multiple radiation sources the recent commercialization of compton gamma cameras provides directional information to the broader radiation detection community for the first time this paper presents the integration of a compton gamma camera with a selflocalizing ground robot for accurate 3d radiation mapping using the position and orientation of the robot radiation images from the gamma camera are accumulated over a traversed path in a shared frame of reference to construct a consistent voxel gridbased radiation map the peaks of the map at prespecified energy windows are selected as the source location estimates which are compared to the ground truth source locations the proposed approach localizes multiple sources to within an average of 02 m in two 5 x 4 m2 and 14 x 6 m2 laboratory environments | [['radiation', 'detection', 'has', 'largely', 'been', 'a', 'manual', 'inspection', 'process', 'with', 'point', 'sensors', 'such', 'as', 'geigermuller', 'counters', 'and', 'scintillation', 'spectrometers', 'to', 'date', 'while', 'their', 'observations', 'of', 'source', 'proximity', 'prove', 'useful', 'they', 'lack', 'the', 'directional', 'information', 'necessary', 'for', 'efficient', 'source', 'localization', 'and', 'characterization', 'in', 'cluttered', 'environments', 'with', 'multiple', 'radiation', 'sources', 'the', 'recent', 'commercialization', 'of', 'compton', 'gamma', 'cameras', 'provides', 'directional', 'information', 'to', 'the', 'broader', 'radiation', 'detection', 'community', 'for', 'the', 'first', 'time', 'this', 'paper', 'presents', 'the', 'integration', 'of', 'a', 'compton', 'gamma', 'camera', 'with', 'a', 'selflocalizing', 'ground', 'robot', 'for', 'accurate', '3d', 'radiation', 'mapping', 'using', 'the', 'position', 'and', 'orientation', 'of', 'the', 'robot', 'radiation', 'images', 'from', 'the', 'gamma', 'camera', 'are', 'accumulated', 'over', 'a', 'traversed', 'path', 'in', 'a', 'shared', 'frame', 'of', 'reference', 'to', 'construct', 'a', 'consistent', 'voxel', 'gridbased', 'radiation', 'map', 'the', 'peaks', 'of', 'the', 'map', 'at', 'prespecified', 'energy', 'windows', 'are', 'selected', 'as', 'the', 'source', 'location', 'estimates', 'which', 'are', 'compared', 'to', 'the', 'ground', 'truth', 'source', 'locations', 'the', 'proposed', 'approach', 'localizes', 'multiple', 'sources', 'to', 'within', 'an', 'average', 'of', '02', 'm', 'in', 'two', '5', 'x', '4', 'm2', 'and', '14', 'x', '6', 'm2', 'laboratory', 'environments']] | [-0.11139872976756424, 0.08402808374838669, -0.06130804246489357, 0.028839802233261446, -0.07678671712001969, -0.12398272715347437, 0.03490684393220016, 0.4550763623778186, -0.21990344013394303, -0.3758059976934698, 0.0900514544818195, -0.31729180473737373, -0.03217154622853147, 0.19912431220863167, -0.0716073611102503, 0.0514566271264386, 0.06799605299282625, 0.03512865670477552, -0.03203604390837637, -0.15301556583773884, 0.25572051905429344, 0.11064689936159405, 0.27698936308209243, 0.009407358841615261, 0.15158343740141375, 0.020137003107491686, -0.08187310127918258, -0.03324376962368371, -0.06483257391538493, 0.10665962440257816, 0.2955167552152099, 0.136134418788113, 0.21629161900178545, -0.39088650909521633, -0.23013583635319176, 0.08868414166819498, 0.11344627422049125, 0.032662321464158595, -0.062360738937721476, -0.34612935540707773, 0.05315021437059851, -0.14273840105268737, -0.1088602451215272, 0.03129881030928365, 0.03731283694411482, 0.013584519759011643, -0.25718675398219354, 0.0045470811475089865, -0.013635966349110502, 0.05749956264316691, -0.10113906410032872, -0.0802512392973678, 0.021705114150775133, 0.17809100903979788, -0.008069903495744398, 0.10457086211912915, 0.18342243960514837, -0.1605937346867205, -0.09075813415437409, 0.3825896302012005, -0.018651783102961807, -0.16182172309938345, 0.1942430373141273, -0.15549563505616837, -0.1040470328496909, 0.23977561627186275, 0.15834310511127114, 0.14791244205431958, -0.17875295187308954, 0.014615229198391512, 0.024336509635359736, 0.18278373918994706, 0.08290382147352131, 0.050403957746753394, 0.2354094182756259, 0.16490270279487865, 0.080445469887335, 0.11413930056110627, -0.22778906031226406, 0.0010710805896777293, -0.29197254240569376, -0.13051105007275904, -0.17707328638869385, 0.031327757684277056, -0.08952819928392294, -0.13033832309009222, 0.33775484305133535, 0.17566624784443766, 0.15741918132387403, 0.04610266590509779, 0.34554016870053517, 0.048541209201538406, 0.05543040134405685, 0.05066470971271783, 0.2194992243877553, 0.049735953958672766, 0.11631248820360449, -0.14152591412407858, 0.04177182626633264, -0.005711516650727374] |
1,802.06073 | An Introduction to Schur Polynomials | Notes from a course at the ATM Workshop on Schubert Varieties, held at The
Institute of Mathematical Sciences, Chennai, in November 2017.
Various expansions of Schur functions, the Lindstr\"om-Gessel-Viennot lemma,
semistandard Young tableaux, Schensted's insertion algorithm, the plactic
monoid, the RSK correspondence, and the Littlewood-Richardson rule are
discussed.
| math.HO math.CO math.RT | notes from a course at the atm workshop on schubert varieties held at the institute of mathematical sciences chennai in november 2017 various expansions of schur functions the lindstromgesselviennot lemma semistandard young tableaux schensteds insertion algorithm the plactic monoid the rsk correspondence and the littlewoodrichardson rule are discussed | [['notes', 'from', 'a', 'course', 'at', 'the', 'atm', 'workshop', 'on', 'schubert', 'varieties', 'held', 'at', 'the', 'institute', 'of', 'mathematical', 'sciences', 'chennai', 'in', 'november', '2017', 'various', 'expansions', 'of', 'schur', 'functions', 'the', 'lindstromgesselviennot', 'lemma', 'semistandard', 'young', 'tableaux', 'schensteds', 'insertion', 'algorithm', 'the', 'plactic', 'monoid', 'the', 'rsk', 'correspondence', 'and', 'the', 'littlewoodrichardson', 'rule', 'are', 'discussed']] | [-0.042704269884431614, 0.06175433880986368, -0.14841274891365716, 0.07915815027391022, -0.13411115137662025, -0.12989958228067833, 0.09892158134979137, 0.2950652927120632, -0.32979203876543867, -0.2971698629887814, 0.14822963898768649, -0.24008550069374132, -0.1824814998247522, 0.15148932966304587, -0.21154210191378567, -0.02718375958105985, 0.08786645381057516, -0.028502234039788552, -0.09727271185058387, -0.32691882522974874, 0.27382251698068005, 0.09239529826222583, 0.30171405603276924, 0.04315923647261522, 0.11776736421272793, 0.020362473159850118, -0.09728647288470034, -0.16907649067171077, -0.130707195177278, 0.13227526766267864, 0.40328350587886697, 0.1610322673805058, 0.22637629275150756, -0.41206816837508625, 0.07894019451626438, 0.0622582857923067, 0.054405160064987364, -0.008549151149518947, -0.006486023095079717, -0.3236833842510873, -0.09283710450449205, -0.18366392872276457, -0.14880050477036771, 0.06967454183068959, 0.07530982732435966, 0.08232369087636471, -0.20517158476596184, -0.010171998292207718, 0.10634357682330177, 0.283443528197785, -0.023953108822907063, -0.3077751482301887, 0.021754902695860476, 0.0803289160300684, -0.0934329508070616, 0.04244223500582132, 0.14214060067179354, -0.10224463031726315, -0.231060751218428, 0.35543425034414583, 0.09850022161102041, -0.08799347309197517, 0.12834467623163598, -0.20500402594421138, -0.2609611422893532, 0.11467668965974069, 0.11160167381960026, 0.11326784742104405, -0.06693397175045089, 0.1680428257714858, -0.16883624395500482, 0.051210275177467374, 0.30254127912500756, -0.0981957430138867, 0.23913198511334174, 0.01721372175961733, -0.12480698177155028, 0.16319583612989555, 0.031308231682100514, -0.13197089315570415, -0.35307136138385914, -0.16200839434849454, -0.10317534832482009, 0.009420270219128182, -0.1070399595758298, -0.17904929963356636, 0.32522706162343, 0.05019249581791302, 0.018608803110335893, 0.07917071425138002, 0.09542726794693698, 0.06030185435195156, 0.06563088706040636, 0.004908122974348829, 0.08025357852432322, 0.305875087498707, 0.18615232056323835, -0.09877984986242348, 0.005462610677994312, 0.37388923218810655] |
1,802.06074 | Direct Calculation of the Transfer Map of Electrostatic Deflectors, and
Comparison with the Codes COSY INFINITY and GIOS | COSY INFINITY uses a beamline coordinate system with a Frenet-Serret frame
relative to the reference particle, and calculates differential algebra-valued
transfer maps by integrating the ODEs of motion in the respective vector space
over a differential algebra (DA).
We will describe and perform computation of the DA transfer map of an
electrostatic spherical deflector in a laboratory coordinate system using two
conventional methods: (1) by integrating the ODEs of motion using a 4th order
Runge-Kutta integrator and (2) by computing analytically and in closed form the
properties of the respective elliptical orbits from Kepler theory. We will
compare the resulting transfer maps with (3) the DA transfer map of COSY
INFINITY's built-in electrostatic spherical deflector element ESP and (4) the
transfer map of the electrostatic spherical deflector computed using the
program GIOS.
In addition to the electrostatic spherical deflector, we study an
electrostatic cylindrical deflector, where the Kepler theory is not applicable.
We compute the DA transfer map by the ODE integration method (1), and compare
it with the transfer maps by (3) COSY INFINITY's built-in electrostatic
cylindrical deflector element ECL, and (4) GIOS.
In addition to the code listings in the appendices, the codes to run the test
cases are available at http://bt.pa.msu.edu/cgi-bin/display.pl?name=ELSPHTM17
| physics.acc-ph | cosy infinity uses a beamline coordinate system with a frenetserret frame relative to the reference particle and calculates differential algebravalued transfer maps by integrating the odes of motion in the respective vector space over a differential algebra da we will describe and perform computation of the da transfer map of an electrostatic spherical deflector in a laboratory coordinate system using two conventional methods 1 by integrating the odes of motion using a 4th order rungekutta integrator and 2 by computing analytically and in closed form the properties of the respective elliptical orbits from kepler theory we will compare the resulting transfer maps with 3 the da transfer map of cosy infinitys builtin electrostatic spherical deflector element esp and 4 the transfer map of the electrostatic spherical deflector computed using the program gios in addition to the electrostatic spherical deflector we study an electrostatic cylindrical deflector where the kepler theory is not applicable we compute the da transfer map by the ode integration method 1 and compare it with the transfer maps by 3 cosy infinitys builtin electrostatic cylindrical deflector element ecl and 4 gios in addition to the code listings in the appendices the codes to run the test cases are available at httpbtpamsueducgibindisplayplnameelsphtm17 | [['cosy', 'infinity', 'uses', 'a', 'beamline', 'coordinate', 'system', 'with', 'a', 'frenetserret', 'frame', 'relative', 'to', 'the', 'reference', 'particle', 'and', 'calculates', 'differential', 'algebravalued', 'transfer', 'maps', 'by', 'integrating', 'the', 'odes', 'of', 'motion', 'in', 'the', 'respective', 'vector', 'space', 'over', 'a', 'differential', 'algebra', 'da', 'we', 'will', 'describe', 'and', 'perform', 'computation', 'of', 'the', 'da', 'transfer', 'map', 'of', 'an', 'electrostatic', 'spherical', 'deflector', 'in', 'a', 'laboratory', 'coordinate', 'system', 'using', 'two', 'conventional', 'methods', '1', 'by', 'integrating', 'the', 'odes', 'of', 'motion', 'using', 'a', '4th', 'order', 'rungekutta', 'integrator', 'and', '2', 'by', 'computing', 'analytically', 'and', 'in', 'closed', 'form', 'the', 'properties', 'of', 'the', 'respective', 'elliptical', 'orbits', 'from', 'kepler', 'theory', 'we', 'will', 'compare', 'the', 'resulting', 'transfer', 'maps', 'with', '3', 'the', 'da', 'transfer', 'map', 'of', 'cosy', 'infinitys', 'builtin', 'electrostatic', 'spherical', 'deflector', 'element', 'esp', 'and', '4', 'the', 'transfer', 'map', 'of', 'the', 'electrostatic', 'spherical', 'deflector', 'computed', 'using', 'the', 'program', 'gios', 'in', 'addition', 'to', 'the', 'electrostatic', 'spherical', 'deflector', 'we', 'study', 'an', 'electrostatic', 'cylindrical', 'deflector', 'where', 'the', 'kepler', 'theory', 'is', 'not', 'applicable', 'we', 'compute', 'the', 'da', 'transfer', 'map', 'by', 'the', 'ode', 'integration', 'method', '1', 'and', 'compare', 'it', 'with', 'the', 'transfer', 'maps', 'by', '3', 'cosy', 'infinitys', 'builtin', 'electrostatic', 'cylindrical', 'deflector', 'element', 'ecl', 'and', '4', 'gios', 'in', 'addition', 'to', 'the', 'code', 'listings', 'in', 'the', 'appendices', 'the', 'codes', 'to', 'run', 'the', 'test', 'cases', 'are', 'available', 'at', 'httpbtpamsueducgibindisplayplnameelsphtm17']] | [-0.08661271436997128, 0.02757193676247586, -0.08747153641483445, 0.04352438376477424, -0.019073305059622844, -0.1181731963303144, -0.061419206693425626, 0.38073756227001027, -0.2696032801675448, -0.30075071075038096, 0.06909637393161136, -0.2727245188646009, -0.08868892777905758, 0.18789252937500323, -0.023635740511076506, 0.06028152648730213, 0.0785486750798161, -0.003778940269987641, -0.11020348916833396, -0.18717796834062933, 0.3417402771232066, 0.09350753829476252, 0.22744862118907347, -0.05177248300131948, 0.17074022357628926, 0.019023285766331412, -0.05208062951392795, -0.028011785137353928, -0.11720504158579592, 0.12430787203712991, 0.20945424138132798, 0.09798753053987798, 0.19179799450579937, -0.3936865899146567, -0.1511696018487104, 0.0347808128876139, 0.14352280835838832, 0.11304336556914582, -0.05655699289769898, -0.24345454991568083, 0.08911949524479867, -0.2196380960481677, -0.1331476684027254, -0.06036587446506381, 0.03845587765058938, 0.0876914700238377, -0.2744502941614471, -0.0011729697386423747, 0.05465348676590287, 0.10974722767054144, -0.10101809572493334, -0.1055345025819388, -0.028065971773006577, 0.14005326261206424, -0.04614852080915476, 0.056398561257933875, 0.17085018877255087, -0.05138842423738384, -0.06440091024231703, 0.39026162007925524, -0.09491915886512776, -0.2639107541250649, 0.15467614639754318, -0.150450265287556, -0.031224970842493857, 0.13510040932135722, 0.1589622878659498, 0.11884580905414859, -0.1643397027432029, 0.12983050635715818, 0.04268627914493505, 0.165238035816134, 0.12399806077036062, -0.10634138624401605, 0.18556707527544072, 0.10111234952992208, 0.03261406466408878, 0.1262328810016833, -0.147287450443527, -0.08275622939598279, -0.3207441086403618, -0.17866821099183897, -0.1427277981046476, 0.014143825815692289, -0.055122314924006446, -0.12142398168532113, 0.36706167890514196, 0.11068580691721197, 0.14335718974749098, 0.024860877228613517, 0.3346977490533273, 0.1043678078151323, 0.07678808997714179, 0.06640327247369349, 0.2163857108153477, 0.16762449639960567, 0.12998317243399293, -0.24692470126956775, -0.07324261239159909, 0.10492180051879763] |
1,802.06075 | Resurrecting the Power-law, Intermediate, and Logamediate Inflations in
the DBI Scenario with Constant Sound Speed | We investigate the power-law, intermediate, and logamediate inflationary
models in the framework of DBI non-canonical scalar field with constant sound
speed. In the DBI setting, we first represent the power spectrum of both scalar
density and tensor gravitational perturbations. Then, we derive different
inflationary observables including the scalar spectral index $n_s$, the running
of the scalar spectral index $dn_s/d\ln k$, and the tensor-to-scalar ratio $r$.
We show that the 95\% CL constraint of the Planck 2015 T+E data on the
non-Gaussianity parameter $f_{{\rm NL}}^{{\rm DBI}}$ leads to the sound speed
bound $c_{s}\geq0.087$ in the DBI inflation. Moreover, our results imply that,
although the predictions of the power-law, intermediate, and logamediate
inflations in the standard canonical framework ($c_s=1$) are not consistent
with the Planck 2015 data, in the DBI scenario with constant sound speed
$c_s<1$, the result of the $r-n_s$ diagram for these models can lie inside the
68\% CL region favored by the Planck 2015 TT,TE,EE+lowP data. We also specify
the parameter space of the power-law, intermediate, and logamediate inflations
for which our models are compatible with the 68\% or 95\% CL regions of the
Planck 2015 TT,TE,EE+lowP data. Using the allowed ranges of the parameter space
of the intermediate and logamediate inflationary models, we estimate the
running of the scalar spectral index and find that it is compatible with the
95\% CL constraint from the Planck 2015 TT,TE,EE+lowP data.
| astro-ph.CO gr-qc hep-th | we investigate the powerlaw intermediate and logamediate inflationary models in the framework of dbi noncanonical scalar field with constant sound speed in the dbi setting we first represent the power spectrum of both scalar density and tensor gravitational perturbations then we derive different inflationary observables including the scalar spectral index n_s the running of the scalar spectral index dn_sdln k and the tensortoscalar ratio r we show that the 95 cl constraint of the planck 2015 te data on the nongaussianity parameter f_rm nlrm dbi leads to the sound speed bound c_sgeq0087 in the dbi inflation moreover our results imply that although the predictions of the powerlaw intermediate and logamediate inflations in the standard canonical framework c_s1 are not consistent with the planck 2015 data in the dbi scenario with constant sound speed c_s1 the result of the rn_s diagram for these models can lie inside the 68 cl region favored by the planck 2015 ttteeelowp data we also specify the parameter space of the powerlaw intermediate and logamediate inflations for which our models are compatible with the 68 or 95 cl regions of the planck 2015 ttteeelowp data using the allowed ranges of the parameter space of the intermediate and logamediate inflationary models we estimate the running of the scalar spectral index and find that it is compatible with the 95 cl constraint from the planck 2015 ttteeelowp data | [['we', 'investigate', 'the', 'powerlaw', 'intermediate', 'and', 'logamediate', 'inflationary', 'models', 'in', 'the', 'framework', 'of', 'dbi', 'noncanonical', 'scalar', 'field', 'with', 'constant', 'sound', 'speed', 'in', 'the', 'dbi', 'setting', 'we', 'first', 'represent', 'the', 'power', 'spectrum', 'of', 'both', 'scalar', 'density', 'and', 'tensor', 'gravitational', 'perturbations', 'then', 'we', 'derive', 'different', 'inflationary', 'observables', 'including', 'the', 'scalar', 'spectral', 'index', 'n_s', 'the', 'running', 'of', 'the', 'scalar', 'spectral', 'index', 'dn_sdln', 'k', 'and', 'the', 'tensortoscalar', 'ratio', 'r', 'we', 'show', 'that', 'the', '95', 'cl', 'constraint', 'of', 'the', 'planck', '2015', 'te', 'data', 'on', 'the', 'nongaussianity', 'parameter', 'f_rm', 'nlrm', 'dbi', 'leads', 'to', 'the', 'sound', 'speed', 'bound', 'c_sgeq0087', 'in', 'the', 'dbi', 'inflation', 'moreover', 'our', 'results', 'imply', 'that', 'although', 'the', 'predictions', 'of', 'the', 'powerlaw', 'intermediate', 'and', 'logamediate', 'inflations', 'in', 'the', 'standard', 'canonical', 'framework', 'c_s1', 'are', 'not', 'consistent', 'with', 'the', 'planck', '2015', 'data', 'in', 'the', 'dbi', 'scenario', 'with', 'constant', 'sound', 'speed', 'c_s1', 'the', 'result', 'of', 'the', 'rn_s', 'diagram', 'for', 'these', 'models', 'can', 'lie', 'inside', 'the', '68', 'cl', 'region', 'favored', 'by', 'the', 'planck', '2015', 'ttteeelowp', 'data', 'we', 'also', 'specify', 'the', 'parameter', 'space', 'of', 'the', 'powerlaw', 'intermediate', 'and', 'logamediate', 'inflations', 'for', 'which', 'our', 'models', 'are', 'compatible', 'with', 'the', '68', 'or', '95', 'cl', 'regions', 'of', 'the', 'planck', '2015', 'ttteeelowp', 'data', 'using', 'the', 'allowed', 'ranges', 'of', 'the', 'parameter', 'space', 'of', 'the', 'intermediate', 'and', 'logamediate', 'inflationary', 'models', 'we', 'estimate', 'the', 'running', 'of', 'the', 'scalar', 'spectral', 'index', 'and', 'find', 'that', 'it', 'is', 'compatible', 'with', 'the', '95', 'cl', 'constraint', 'from', 'the', 'planck', '2015', 'ttteeelowp', 'data']] | [-0.14262469932762295, 0.16648615968482788, -0.07236024588102467, 0.0925584430282724, -0.08153181595984017, -0.15223844413234808, 0.019817708591385604, 0.2840141650181524, -0.17307199822336142, -0.35566475271251397, 0.06594301743064825, -0.25167647299385226, -0.07283444132876489, 0.16794744670273143, 0.020467278253623614, 0.02866083847391358, 0.016009802842618468, 0.029548864095882556, -0.02051041242422528, -0.261176729227587, 0.303382094863062, 0.1457369321810822, 0.25497690979065984, -0.004559063904600495, 0.05429409414084474, -0.08436894668550861, -0.04578578560058979, -0.014344216283974054, -0.2165268720793281, 0.08634920433310052, 0.16337413342840418, 0.16634009066586866, 0.1427177186795067, -0.3417800732056598, -0.2311868635921304, 0.13981965627505008, 0.09965922438649372, 0.06535798316062977, 0.03674959377680527, -0.3009611761185247, 0.04089134738481386, -0.19350583901360435, -0.06310162020391707, -0.04044054980149826, 0.005797215886353047, -0.07257153110489184, -0.32058914059642946, 0.18161026967623817, -0.013221795587316482, -0.012004677629236571, -0.10146638400462257, -0.10956622291901291, -0.08963861090932286, -0.011407485212439337, 0.08881825160979412, 0.02283040138050979, 0.12077752642911009, -0.14607367872293045, -0.05642294039284835, 0.3640138968443051, -0.21331782746393088, -0.09885495292494587, 0.09486374449834846, -0.16468958315280913, -0.1932417564805776, 0.054843413694375336, 0.11442294118592443, 0.05583328379757344, -0.07410145607496323, 0.23316525665491078, 0.03718543061925562, 0.21404979102248448, 0.10062731848419623, 0.007362820214173028, 0.2529828299495786, 0.08660394511608545, 0.02523163173502254, 0.09072931640065686, -0.11273175868913368, -0.08607808626589862, -0.3934435312672799, -0.06771734053819078, -0.12400347123270261, 0.0016876907275575844, -0.26399345560703175, -0.12847953484857283, 0.40692708666912203, 0.15159765749917606, 0.26127503231176946, 0.11884057465747536, 0.24772749539041752, 0.12740739681234373, 0.016546555902548624, 0.10517962135813773, 0.34322339714826067, 0.089317421313969, 0.13367984515277254, -0.18009769566068384, -0.06688805738073575, -0.006127014789754712] |
1,802.06076 | Gamma-ray intensities in multi-gated spectra | The level structure of nuclei offers a large amount and variety of
information to improve our knowledge of the strong interaction and of
mesoscopic quantum systems. Gamma spectroscopy is a powerful tool to perform
such studies: modern gamma multi-detectors present increasing performances in
terms of sensitivity and efficiency, allowing to extend ever more our ability
to observe and characterize abundant nuclear states. For instance, the
high-spin part of level schemes often reflects intriguing nuclear shape
phenomena: this behaviour is unveiled by high-fold experimental data analysed
through multi-coincidence spectra, in which long deexcitation cascades become
observable. Determining the intensity of newly discovered transitions is
important to characterize the nuclear structure and formation mechanism of the
emitting levels. However, it is not trivial to relate the apparent intensity
observed in multi-gated spectra to the actual transition intensity. In this
work, we introduce the basis of a formalism affiliated with graph theory: we
have obtained analytic expressions from which data-analysis methods can
eventually be derived to recover this link in a rigorous way.
| physics.data-an | the level structure of nuclei offers a large amount and variety of information to improve our knowledge of the strong interaction and of mesoscopic quantum systems gamma spectroscopy is a powerful tool to perform such studies modern gamma multidetectors present increasing performances in terms of sensitivity and efficiency allowing to extend ever more our ability to observe and characterize abundant nuclear states for instance the highspin part of level schemes often reflects intriguing nuclear shape phenomena this behaviour is unveiled by highfold experimental data analysed through multicoincidence spectra in which long deexcitation cascades become observable determining the intensity of newly discovered transitions is important to characterize the nuclear structure and formation mechanism of the emitting levels however it is not trivial to relate the apparent intensity observed in multigated spectra to the actual transition intensity in this work we introduce the basis of a formalism affiliated with graph theory we have obtained analytic expressions from which dataanalysis methods can eventually be derived to recover this link in a rigorous way | [['the', 'level', 'structure', 'of', 'nuclei', 'offers', 'a', 'large', 'amount', 'and', 'variety', 'of', 'information', 'to', 'improve', 'our', 'knowledge', 'of', 'the', 'strong', 'interaction', 'and', 'of', 'mesoscopic', 'quantum', 'systems', 'gamma', 'spectroscopy', 'is', 'a', 'powerful', 'tool', 'to', 'perform', 'such', 'studies', 'modern', 'gamma', 'multidetectors', 'present', 'increasing', 'performances', 'in', 'terms', 'of', 'sensitivity', 'and', 'efficiency', 'allowing', 'to', 'extend', 'ever', 'more', 'our', 'ability', 'to', 'observe', 'and', 'characterize', 'abundant', 'nuclear', 'states', 'for', 'instance', 'the', 'highspin', 'part', 'of', 'level', 'schemes', 'often', 'reflects', 'intriguing', 'nuclear', 'shape', 'phenomena', 'this', 'behaviour', 'is', 'unveiled', 'by', 'highfold', 'experimental', 'data', 'analysed', 'through', 'multicoincidence', 'spectra', 'in', 'which', 'long', 'deexcitation', 'cascades', 'become', 'observable', 'determining', 'the', 'intensity', 'of', 'newly', 'discovered', 'transitions', 'is', 'important', 'to', 'characterize', 'the', 'nuclear', 'structure', 'and', 'formation', 'mechanism', 'of', 'the', 'emitting', 'levels', 'however', 'it', 'is', 'not', 'trivial', 'to', 'relate', 'the', 'apparent', 'intensity', 'observed', 'in', 'multigated', 'spectra', 'to', 'the', 'actual', 'transition', 'intensity', 'in', 'this', 'work', 'we', 'introduce', 'the', 'basis', 'of', 'a', 'formalism', 'affiliated', 'with', 'graph', 'theory', 'we', 'have', 'obtained', 'analytic', 'expressions', 'from', 'which', 'dataanalysis', 'methods', 'can', 'eventually', 'be', 'derived', 'to', 'recover', 'this', 'link', 'in', 'a', 'rigorous', 'way']] | [-0.07553227946042324, 0.10147414171878627, -0.1125356786588798, 0.10903818167615012, -0.06921275144074848, -0.09378084547756363, 0.047934673465147036, 0.37062599528915513, -0.25990137023695126, -0.3382901908100644, 0.06153572067091364, -0.26190674656857094, -0.13307192151484912, 0.19489573307257302, -0.005609193010936062, 0.019383912373468013, 0.04993404783839607, 0.020803955145888477, -0.041524082114836366, -0.165249144383267, 0.29742979593045205, 0.11812660724557601, 0.28465255128197414, 0.07185944154005341, 0.04950948105131633, -0.012180059674212675, -0.04388363587162541, 0.005631592303157566, -0.13320362197951843, 0.1494104966962526, 0.3115203135209799, 0.11905895405543779, 0.22423554113006475, -0.4160916454376218, -0.2298391949070665, 0.10507286922074854, 0.13681861869210077, 0.11082673430983758, -0.04539193164999527, -0.28089067897296505, 0.05896775450412474, -0.16735749077163414, -0.15123471354335144, -0.12535434316085306, 0.027618314209254737, 0.004083780992168286, -0.22627685994431265, 0.04977421607880736, 0.04000540661017695, 0.05737744231340977, -0.039197044109669094, -0.08028646189897895, 0.0013318377885755575, 0.1606143454011686, 0.026993498818190423, 0.010253826533737007, 0.13447214390324083, -0.13233992018009128, -0.1127309384198112, 0.3794630046788893, -0.04923302031813669, -0.11496167049553624, 0.20579693330700013, -0.19335631439099812, -0.164432355777143, 0.16673898261771009, 0.16862250470436418, 0.10400752753889311, -0.1409289242447393, 0.05508088384312996, 0.01022597511708848, 0.18481380492588226, 0.017918842585344694, 0.09155450693978566, 0.19936043232913592, 0.183706024538971, 0.01409813430032018, 0.14110216840719636, -0.08949205151502557, -0.09327366714042327, -0.23341564901039272, -0.1326024070029256, -0.15484405585744523, 0.06147983017620494, -0.013963197851062105, -0.13527427101228945, 0.3911030582364225, 0.1451711735582191, 0.21143828847439972, -0.010946170076962093, 0.2921160843898124, 0.11007132506538964, 0.07787497020410207, 0.02900351321082116, 0.260492786318956, 0.15802132521343312, 0.07782170868863514, -0.22348588277463116, 0.09348949722243016, 0.00922013270322925] |
1,802.06077 | A sampling-based approximation of the complex error function and its
implementation without poles | Recently we developed a new sampling methodology based on incomplete cosine
expansion of the sinc function and applied it in numerical integration in order
to obtain a rational approximation for the complex error function $w\left(z
\right) = e^{- {z^2}}\left(1 + \frac{2i}{\sqrt \pi}\int_0^z e^{t^2}dt\right),$
where $z = x + iy$. As a further development, in this work we show how this
sampling-based rational approximation can be transformed into alternative form
for efficient computation of the complex error function $w\left(z \right)$ at
smaller values of the imaginary argument $y=\operatorname{Im}\left[z \right]$.
Such an approach enables us to avoid poles in implementation and to cover the
entire complex plain with high accuracy in a rapid algorithm. An optimized
Matlab code utilizing only three rapid approximations is presented.
| math.NA | recently we developed a new sampling methodology based on incomplete cosine expansion of the sinc function and applied it in numerical integration in order to obtain a rational approximation for the complex error function wleftz right e z2left1 frac2isqrt piint_0z et2dtright where z x iy as a further development in this work we show how this samplingbased rational approximation can be transformed into alternative form for efficient computation of the complex error function wleftz right at smaller values of the imaginary argument yoperatornameimleftz right such an approach enables us to avoid poles in implementation and to cover the entire complex plain with high accuracy in a rapid algorithm an optimized matlab code utilizing only three rapid approximations is presented | [['recently', 'we', 'developed', 'a', 'new', 'sampling', 'methodology', 'based', 'on', 'incomplete', 'cosine', 'expansion', 'of', 'the', 'sinc', 'function', 'and', 'applied', 'it', 'in', 'numerical', 'integration', 'in', 'order', 'to', 'obtain', 'a', 'rational', 'approximation', 'for', 'the', 'complex', 'error', 'function', 'wleftz', 'right', 'e', 'z2left1', 'frac2isqrt', 'piint_0z', 'et2dtright', 'where', 'z', 'x', 'iy', 'as', 'a', 'further', 'development', 'in', 'this', 'work', 'we', 'show', 'how', 'this', 'samplingbased', 'rational', 'approximation', 'can', 'be', 'transformed', 'into', 'alternative', 'form', 'for', 'efficient', 'computation', 'of', 'the', 'complex', 'error', 'function', 'wleftz', 'right', 'at', 'smaller', 'values', 'of', 'the', 'imaginary', 'argument', 'yoperatornameimleftz', 'right', 'such', 'an', 'approach', 'enables', 'us', 'to', 'avoid', 'poles', 'in', 'implementation', 'and', 'to', 'cover', 'the', 'entire', 'complex', 'plain', 'with', 'high', 'accuracy', 'in', 'a', 'rapid', 'algorithm', 'an', 'optimized', 'matlab', 'code', 'utilizing', 'only', 'three', 'rapid', 'approximations', 'is', 'presented']] | [-0.08103050912281365, 0.007112324290054468, -0.10867444147048186, 0.07714741516455044, -0.09863725244609409, -0.1293398546113167, 0.0655842538066541, 0.40824746729673017, -0.28337569902734167, -0.262699192655938, 0.10548295991267358, -0.21125295073060052, -0.17026560796823884, 0.2269810691317876, -0.04315142103561292, 0.07757205856523797, 0.037540683853356835, 0.009735559678769537, -0.11027086587481401, -0.26086722823259023, 0.21839185658817378, 0.047915994530610205, 0.2348642101112221, 0.03186420418205671, 0.12040606820456949, 0.03170553337050868, -0.03155184328872045, -0.03323551438266544, -0.125149997882545, 0.147000370472337, 0.24946948925831489, 0.12989862654441303, 0.31934780193582163, -0.4026661903896768, -0.14353660335161425, 0.08336137021511345, 0.19880078042790825, 0.05795350069612531, -0.04463628712047856, -0.23921210444366028, 0.09589851487960134, -0.20352198642545513, -0.1419212115496131, -0.1253780692059081, 0.021067731038783677, 0.008212864340748638, -0.33781086364095764, 0.02765325421309431, 0.01866879358047819, 0.038354180877961754, -0.00828300653977619, -0.12444903042549933, 0.06041778049049234, 0.09575591991805206, -0.003822229925260347, 0.09937335421480904, 0.06638077888055705, -0.07122372502843584, -0.07471661107514851, 0.33964740846671965, -0.07301818298895212, -0.26511480981051655, 0.13968085432549873, -0.12408057557851342, -0.11181083973497152, 0.172678317808147, 0.2028649324908786, 0.1440043962294502, -0.10678699743168961, 0.10986937553285056, 0.02420571680730583, 0.15294663776044867, 0.07204146131074854, -0.034198360230740424, 0.12551880517276004, 0.14979824270786984, 0.06978419699173953, 0.11756110174194744, -0.03769016443610391, -0.10357456677593291, -0.29491840519975604, -0.19910910635787463, -0.18094685585154885, 0.0377938374610624, -0.10033637724258629, -0.20615945149412646, 0.394345674437188, 0.15610420308491615, 0.20342698454624042, 0.055379371832324456, 0.33824547636322677, 0.1540968059385445, 0.06512638227182574, 0.062055995517377074, 0.15258138021038445, 0.08599288380147689, 0.06367880723389265, -0.17031993212003727, 0.05225098304383989, 0.09345653134888769] |
1,802.06078 | Decay Modes of the Hoyle State in $^{12}C$ | Recent experimental results give an upper limit less than 0.043\% (95\% C.L.)
to the direct decay of the Hoyle state into 3$\alpha$ respect to the sequential
decay into $^8${Be}+$\alpha$. We performed one and two-dimensional tunneling
calculations to estimate such a ratio and found it to be more than one order of
magnitude smaller than experiment depending on the range of the nuclear force.
This is within high statistics experimental capabilities. Our results can also
be tested by measuring the decay modes of high excitation energy states of
$^{12}$C where the ratio of direct to sequential decay might reach 10\% at
$E^*$($^{12}$C)=10.3 MeV. The link between a Bose Einstein Condensate (BEC) and
the direct decay of the Hoyle state is also addressed. We discuss a
hypothetical `Efimov state' at $E^*$($^{12}$C)=7.458 MeV, which would mainly
{\it sequentially} decay with 3$\alpha$ of {\it equal energies}: a
counterintuitive result of tunneling. Such a state, if it would exist, is at
least 8 orders of magnitude less probable than the Hoyle's, thus below the
sensitivity of recent and past experiments.
| nucl-th nucl-ex | recent experimental results give an upper limit less than 0043 95 cl to the direct decay of the hoyle state into 3alpha respect to the sequential decay into 8bealpha we performed one and twodimensional tunneling calculations to estimate such a ratio and found it to be more than one order of magnitude smaller than experiment depending on the range of the nuclear force this is within high statistics experimental capabilities our results can also be tested by measuring the decay modes of high excitation energy states of 12c where the ratio of direct to sequential decay might reach 10 at e12c103 mev the link between a bose einstein condensate bec and the direct decay of the hoyle state is also addressed we discuss a hypothetical efimov state at e12c7458 mev which would mainly it sequentially decay with 3alpha of it equal energies a counterintuitive result of tunneling such a state if it would exist is at least 8 orders of magnitude less probable than the hoyles thus below the sensitivity of recent and past experiments | [['recent', 'experimental', 'results', 'give', 'an', 'upper', 'limit', 'less', 'than', '0043', '95', 'cl', 'to', 'the', 'direct', 'decay', 'of', 'the', 'hoyle', 'state', 'into', '3alpha', 'respect', 'to', 'the', 'sequential', 'decay', 'into', '8bealpha', 'we', 'performed', 'one', 'and', 'twodimensional', 'tunneling', 'calculations', 'to', 'estimate', 'such', 'a', 'ratio', 'and', 'found', 'it', 'to', 'be', 'more', 'than', 'one', 'order', 'of', 'magnitude', 'smaller', 'than', 'experiment', 'depending', 'on', 'the', 'range', 'of', 'the', 'nuclear', 'force', 'this', 'is', 'within', 'high', 'statistics', 'experimental', 'capabilities', 'our', 'results', 'can', 'also', 'be', 'tested', 'by', 'measuring', 'the', 'decay', 'modes', 'of', 'high', 'excitation', 'energy', 'states', 'of', '12c', 'where', 'the', 'ratio', 'of', 'direct', 'to', 'sequential', 'decay', 'might', 'reach', '10', 'at', 'e12c103', 'mev', 'the', 'link', 'between', 'a', 'bose', 'einstein', 'condensate', 'bec', 'and', 'the', 'direct', 'decay', 'of', 'the', 'hoyle', 'state', 'is', 'also', 'addressed', 'we', 'discuss', 'a', 'hypothetical', 'efimov', 'state', 'at', 'e12c7458', 'mev', 'which', 'would', 'mainly', 'it', 'sequentially', 'decay', 'with', '3alpha', 'of', 'it', 'equal', 'energies', 'a', 'counterintuitive', 'result', 'of', 'tunneling', 'such', 'a', 'state', 'if', 'it', 'would', 'exist', 'is', 'at', 'least', '8', 'orders', 'of', 'magnitude', 'less', 'probable', 'than', 'the', 'hoyles', 'thus', 'below', 'the', 'sensitivity', 'of', 'recent', 'and', 'past', 'experiments']] | [-0.06758885663150772, 0.21780613127019527, -0.06318787864888507, 0.09616112926398872, -0.019475996748993786, -0.13402403152219391, 0.07493899719832692, 0.3237370165021864, -0.20589227462725745, -0.3165442956052317, 0.05486031066803961, -0.3137276272876242, -0.001520334082491416, 0.2045739885497666, 0.09132258944627909, 0.028813045633407686, 0.08384853024425987, 0.0763853760974514, -0.0784985884732023, -0.24874458627269275, 0.26668862268904686, 0.10586216765848887, 0.24415451542318212, 0.10595874439028624, 0.042181946833838704, -0.027418599753355272, 0.0507286033092465, -0.04250434744023756, -0.18007576645411164, 0.06338008110259385, 0.21228909352525122, 0.06213714561096764, 0.2314995140526336, -0.40258439524756, -0.14245929786695888, 0.12944934547022846, 0.17536241307348616, 0.11551758880805052, 0.0016840717655497554, -0.32696402296316246, 0.09860666573113752, -0.18740190577294916, -0.11155870763283503, -0.05065423504831646, 0.03812573439101123, -0.05145310861128517, -0.25213366036836293, 0.12172209155830592, 0.017102921413892955, 0.01003019553635268, -0.07242053079639556, -0.17902441709598452, 0.005778367656708367, 0.03179181209157054, 0.06876695720543492, 0.05844183046790647, 0.1528572531853065, -0.11802614882798337, -0.11392661296046538, 0.36167948579986314, -0.07452737925422104, -0.11807899612319693, 0.1992101474702789, -0.1792954725517509, -0.07854102552004395, 0.19601161961142255, 0.10664798429698785, 0.09748534086790216, -0.09007942560801789, -0.007529368216301061, -0.02034397420037344, 0.22630555470167213, 0.09511525067635354, 0.06551178661309656, 0.1861969579086569, 0.21513988027844383, 0.07082852468465191, 0.08736695711651676, -0.11243071177882825, -0.0973972979256065, -0.27298993011600087, -0.14809486545310113, -0.17466146517625736, 0.09388040966553494, -0.035408811728675944, -0.08220148461230228, 0.36516292837873704, 0.11464314697299562, 0.22423520851934145, 0.005421322679572411, 0.30124114897314763, 0.1413420224567334, 0.06105014283581491, 0.023229060511540816, 0.3361020632884923, 0.14215211124116328, 0.04122926509734566, -0.216527452530552, 0.062444791038294534, -0.010893059913284344] |
1,802.06079 | Global-scale phylogenetic linguistic inference from lexical resources | Automatic phylogenetic inference plays an increasingly important role in
computational historical linguistics. Most pertinent work is currently based on
expert cognate judgments. This limits the scope of this approach to a small
number of well-studied language families. We used machine learning techniques
to compile data suitable for phylogenetic inference from the ASJP database, a
collection of almost 7,000 phonetically transcribed word lists over 40
concepts, covering two third of the extant world-wide linguistic diversity.
First, we estimated Pointwise Mutual Information scores between sound classes
using weighted sequence alignment and general-purpose optimization. From this
we computed a dissimilarity matrix over all ASJP word lists. This matrix is
suitable for distance-based phylogenetic inference. Second, we applied cognate
clustering to the ASJP data, using supervised training of an SVM classifier on
expert cognacy judgments. Third, we defined two types of binary characters,
based on automatically inferred cognate classes and on sound-class occurrences.
Several tests are reported demonstrating the suitability of these characters
for character-based phylogenetic inference.
| cs.CL q-bio.QM | automatic phylogenetic inference plays an increasingly important role in computational historical linguistics most pertinent work is currently based on expert cognate judgments this limits the scope of this approach to a small number of wellstudied language families we used machine learning techniques to compile data suitable for phylogenetic inference from the asjp database a collection of almost 7000 phonetically transcribed word lists over 40 concepts covering two third of the extant worldwide linguistic diversity first we estimated pointwise mutual information scores between sound classes using weighted sequence alignment and generalpurpose optimization from this we computed a dissimilarity matrix over all asjp word lists this matrix is suitable for distancebased phylogenetic inference second we applied cognate clustering to the asjp data using supervised training of an svm classifier on expert cognacy judgments third we defined two types of binary characters based on automatically inferred cognate classes and on soundclass occurrences several tests are reported demonstrating the suitability of these characters for characterbased phylogenetic inference | [['automatic', 'phylogenetic', 'inference', 'plays', 'an', 'increasingly', 'important', 'role', 'in', 'computational', 'historical', 'linguistics', 'most', 'pertinent', 'work', 'is', 'currently', 'based', 'on', 'expert', 'cognate', 'judgments', 'this', 'limits', 'the', 'scope', 'of', 'this', 'approach', 'to', 'a', 'small', 'number', 'of', 'wellstudied', 'language', 'families', 'we', 'used', 'machine', 'learning', 'techniques', 'to', 'compile', 'data', 'suitable', 'for', 'phylogenetic', 'inference', 'from', 'the', 'asjp', 'database', 'a', 'collection', 'of', 'almost', '7000', 'phonetically', 'transcribed', 'word', 'lists', 'over', '40', 'concepts', 'covering', 'two', 'third', 'of', 'the', 'extant', 'worldwide', 'linguistic', 'diversity', 'first', 'we', 'estimated', 'pointwise', 'mutual', 'information', 'scores', 'between', 'sound', 'classes', 'using', 'weighted', 'sequence', 'alignment', 'and', 'generalpurpose', 'optimization', 'from', 'this', 'we', 'computed', 'a', 'dissimilarity', 'matrix', 'over', 'all', 'asjp', 'word', 'lists', 'this', 'matrix', 'is', 'suitable', 'for', 'distancebased', 'phylogenetic', 'inference', 'second', 'we', 'applied', 'cognate', 'clustering', 'to', 'the', 'asjp', 'data', 'using', 'supervised', 'training', 'of', 'an', 'svm', 'classifier', 'on', 'expert', 'cognacy', 'judgments', 'third', 'we', 'defined', 'two', 'types', 'of', 'binary', 'characters', 'based', 'on', 'automatically', 'inferred', 'cognate', 'classes', 'and', 'on', 'soundclass', 'occurrences', 'several', 'tests', 'are', 'reported', 'demonstrating', 'the', 'suitability', 'of', 'these', 'characters', 'for', 'characterbased', 'phylogenetic', 'inference']] | [-0.04828254256096686, 0.017775075983759363, -0.006554273589115057, 0.14383927460973908, -0.1557283224595815, -0.12114499932551259, 0.09345036834515978, 0.4217219675908455, -0.29551086081437744, -0.34418502542543117, 0.048970276839099824, -0.2977098918010868, -0.13251758867842925, 0.20495613482272793, -0.11078248873514973, 0.08161209168502633, 0.14556865289124735, 0.10060812117566603, -0.044031853188893626, -0.3031017013900676, 0.32155318973695873, 0.03056087105112694, 0.3313829182265384, -0.04795620544171481, 0.10231886368088702, 0.014477152865985986, -0.10580447266132843, -0.006353070504633675, -0.11685837680323524, 0.23593888255646048, 0.39812379501910405, 0.3098378397686326, 0.32788101608014625, -0.33159068700284783, -0.15320633851593327, 0.12341746899253409, 0.12893868283576893, 0.11551047004151928, -0.009007573042965858, -0.31803772092134525, 0.06145283079023548, -0.1812123455467304, 0.06600097928236684, -0.10589669137955961, 0.01466995997568419, 0.0050964706710406715, -0.22560333815961497, 0.04564707126665097, 0.06575953591360438, 0.18688147456200088, -0.036902564263943095, -0.19052509813401733, 0.0295856907777199, 0.17204297907210842, 0.04053117274538099, 0.02100952410917174, 0.12331420816018344, -0.09533339521922865, -0.1711226110437, 0.3363942735545013, -0.039320472532793624, -0.20279885406218331, 0.20293074511627882, -0.01753584030576004, -0.2442648866884873, 0.08236170240521709, 0.19651215663468985, 0.12265070435672026, -0.2116325311651974, -0.003967929828871527, -0.029384816406722764, 0.216826645230805, 0.09767467894349884, -0.04666240403706335, 0.20339330927445698, 0.24451726301347618, -0.02909735266859672, 0.1006536981986072, -0.11521237215709797, -0.07369654165922161, -0.2128640268061611, -0.11258732574928251, -0.19141086911195485, -0.015247207967946248, -0.16449908245197983, -0.208349699813942, 0.3742226872127503, 0.20491638056563666, 0.15330140951367222, 0.12818200853277253, 0.26842710866031716, -0.012212701918779994, 0.10350198442440318, 0.0538318800900467, 0.10365116604464997, 0.07139222648411249, 0.0653544308267742, -0.1268162361907654, 0.13971638876868134, 0.10217632878869476] |
1,802.0608 | Possibility of Entanglement at LIGO! | It is shown that a linearized classical gravity wave $\hat{a}$ {\em la}
Einstein can get entangled with an array of test masses in a plane
perpendicular to its direction of propagation. A Bell-CHSH inequality based on
the requirement of noncontextuality for classical realism is derived, and it is
shown that the entangled state produced violates this inequality.
| gr-qc quant-ph | it is shown that a linearized classical gravity wave hata em la einstein can get entangled with an array of test masses in a plane perpendicular to its direction of propagation a bellchsh inequality based on the requirement of noncontextuality for classical realism is derived and it is shown that the entangled state produced violates this inequality | [['it', 'is', 'shown', 'that', 'a', 'linearized', 'classical', 'gravity', 'wave', 'hata', 'em', 'la', 'einstein', 'can', 'get', 'entangled', 'with', 'an', 'array', 'of', 'test', 'masses', 'in', 'a', 'plane', 'perpendicular', 'to', 'its', 'direction', 'of', 'propagation', 'a', 'bellchsh', 'inequality', 'based', 'on', 'the', 'requirement', 'of', 'noncontextuality', 'for', 'classical', 'realism', 'is', 'derived', 'and', 'it', 'is', 'shown', 'that', 'the', 'entangled', 'state', 'produced', 'violates', 'this', 'inequality']] | [-0.17241380092067024, 0.14288527255682806, -0.11650960869564299, 0.09584189482899219, -0.08054553703486658, -0.20153743620929226, -0.029045798774939357, 0.29013787897042276, -0.2502197166741417, -0.2602785024465176, 0.04730335674697958, -0.2511178795656745, -0.08172912372831713, 0.20140554353986917, -0.03230236527885784, 0.05975873604837576, 0.06443177713816495, 0.0629452169084464, -0.055009985162892884, -0.26425547152757645, 0.28466939853438944, 0.06573009131508961, 0.3387969409630291, 0.010079097868711279, 0.1479595711520105, 0.03387689696657553, 0.07403228026528827, 0.0642700230277944, -0.07484451012012933, 0.09750960634106345, 0.18861048675975517, 0.2097878392066872, 0.24074350741871617, -0.39267555790904324, -0.1861751172364804, 0.08687452194199227, 0.08636429791518471, 0.13346661850319883, -0.03240077814552933, -0.373403479034702, 0.02203516202995129, -0.108136195876317, -0.19964936522668913, -0.029530098661780357, 0.010703396252274774, -0.049194800920719116, -0.29430497097864483, 0.13393824414774907, 0.06662422413794782, -0.04462507082835624, -0.009092913738353864, -0.04171440413777243, -0.0381739968760756, -0.029696232475863213, 0.02227957137419205, 0.10047578372126609, 0.09656282850916971, -0.07510328161726265, -0.12463090871052261, 0.3833316003805713, -0.040376376399459936, -0.25316053641992703, 0.14125969465985372, -0.15260600435431115, -0.1027451438273777, 0.04592410527300416, 0.07933076431876734, 0.10958195724442862, -0.14601291789624252, 0.10325279277892326, -0.11222711921104826, 0.20641343746530383, 0.10273877240660224, 0.06479940006280677, 0.19432141615502668, 0.06215969855455976, 0.13274538356876164, 0.13954620082094743, -0.057561143632291964, -0.08298466495123871, -0.32839549653101385, -0.2310090453053514, -0.2556776711655977, 0.1237345024473095, -0.0641617415441719, -0.12430920782233507, 0.294864843101159, 0.12292401029997946, 0.04913682789590798, 0.043356053857949745, 0.23142482007020398, 0.10490943100956972, 0.050240502950098166, 0.07338507881126645, 0.3827557816055783, 0.2098036969832161, 0.10808819727236896, -0.20275517281046823, 0.04860326227029426, 0.07927731553648125] |
1,802.06081 | A cooling neutron star crust after recurrent outbursts: Modelling the
accretion outburst history of Aql X-1 | With our neutron star crust cooling code {\tt NSCool} we track the thermal
evolution of the neutron star in Aql X-1 over the full accretion outburst
history from 1996 until 2015. For the first time, we model many outbursts (23
outbursts were detected) collectively and in great detail. This allows us to
investigate the influence of previous outbursts on the internal temperature
evolution and to test different neutron star crust cooling scenarios. Aql X-1
is an ideal test source for this purpose, because it shows frequent, short
outbursts and thermally dominated quiescence spectra. The source goes into
outburst roughly once a year for a few months.
Assuming that the quiescent {\it Swift}/XRT observations of Aql X-1 can be
explained within the crust cooling scenario (Waterhouse et al. 2016), we find
three main conclusions. Firstly, the data are well reproduced by our model if
the envelope composition and shallow heating parameters are allowed to change
between outbursts. This is not the case if both shallow heating parameters
(strength and depth) are tied throughout all accretion episodes, supporting
earlier results that the properties of the shallow heating mechanism are not
constant between outbursts. Second, from our models shallow heating could not
be connected to one specific spectral state during outburst. Third, and most
importantly, we find that the neutron star in Aql X-1 does not have enough time
between outbursts to cool down to crust-core equilibrium and that heating
during one outburst influences the cooling curves of the next.
| astro-ph.HE | with our neutron star crust cooling code tt nscool we track the thermal evolution of the neutron star in aql x1 over the full accretion outburst history from 1996 until 2015 for the first time we model many outbursts 23 outbursts were detected collectively and in great detail this allows us to investigate the influence of previous outbursts on the internal temperature evolution and to test different neutron star crust cooling scenarios aql x1 is an ideal test source for this purpose because it shows frequent short outbursts and thermally dominated quiescence spectra the source goes into outburst roughly once a year for a few months assuming that the quiescent it swiftxrt observations of aql x1 can be explained within the crust cooling scenario waterhouse et al 2016 we find three main conclusions firstly the data are well reproduced by our model if the envelope composition and shallow heating parameters are allowed to change between outbursts this is not the case if both shallow heating parameters strength and depth are tied throughout all accretion episodes supporting earlier results that the properties of the shallow heating mechanism are not constant between outbursts second from our models shallow heating could not be connected to one specific spectral state during outburst third and most importantly we find that the neutron star in aql x1 does not have enough time between outbursts to cool down to crustcore equilibrium and that heating during one outburst influences the cooling curves of the next | [['with', 'our', 'neutron', 'star', 'crust', 'cooling', 'code', 'tt', 'nscool', 'we', 'track', 'the', 'thermal', 'evolution', 'of', 'the', 'neutron', 'star', 'in', 'aql', 'x1', 'over', 'the', 'full', 'accretion', 'outburst', 'history', 'from', '1996', 'until', '2015', 'for', 'the', 'first', 'time', 'we', 'model', 'many', 'outbursts', '23', 'outbursts', 'were', 'detected', 'collectively', 'and', 'in', 'great', 'detail', 'this', 'allows', 'us', 'to', 'investigate', 'the', 'influence', 'of', 'previous', 'outbursts', 'on', 'the', 'internal', 'temperature', 'evolution', 'and', 'to', 'test', 'different', 'neutron', 'star', 'crust', 'cooling', 'scenarios', 'aql', 'x1', 'is', 'an', 'ideal', 'test', 'source', 'for', 'this', 'purpose', 'because', 'it', 'shows', 'frequent', 'short', 'outbursts', 'and', 'thermally', 'dominated', 'quiescence', 'spectra', 'the', 'source', 'goes', 'into', 'outburst', 'roughly', 'once', 'a', 'year', 'for', 'a', 'few', 'months', 'assuming', 'that', 'the', 'quiescent', 'it', 'swiftxrt', 'observations', 'of', 'aql', 'x1', 'can', 'be', 'explained', 'within', 'the', 'crust', 'cooling', 'scenario', 'waterhouse', 'et', 'al', '2016', 'we', 'find', 'three', 'main', 'conclusions', 'firstly', 'the', 'data', 'are', 'well', 'reproduced', 'by', 'our', 'model', 'if', 'the', 'envelope', 'composition', 'and', 'shallow', 'heating', 'parameters', 'are', 'allowed', 'to', 'change', 'between', 'outbursts', 'this', 'is', 'not', 'the', 'case', 'if', 'both', 'shallow', 'heating', 'parameters', 'strength', 'and', 'depth', 'are', 'tied', 'throughout', 'all', 'accretion', 'episodes', 'supporting', 'earlier', 'results', 'that', 'the', 'properties', 'of', 'the', 'shallow', 'heating', 'mechanism', 'are', 'not', 'constant', 'between', 'outbursts', 'second', 'from', 'our', 'models', 'shallow', 'heating', 'could', 'not', 'be', 'connected', 'to', 'one', 'specific', 'spectral', 'state', 'during', 'outburst', 'third', 'and', 'most', 'importantly', 'we', 'find', 'that', 'the', 'neutron', 'star', 'in', 'aql', 'x1', 'does', 'not', 'have', 'enough', 'time', 'between', 'outbursts', 'to', 'cool', 'down', 'to', 'crustcore', 'equilibrium', 'and', 'that', 'heating', 'during', 'one', 'outburst', 'influences', 'the', 'cooling', 'curves', 'of', 'the', 'next']] | [-0.03795068771370992, 0.16566476417637782, -0.08122596990784653, 0.0863167908177466, -0.11869369845965552, -0.11027105347355187, 0.07528117544023388, 0.4279889761157304, -0.23076561680732877, -0.32786472818177, 0.12128084990750199, -0.2915089029021894, -0.038991644388434256, 0.2391376544302895, -0.05664411954004846, -0.028837822017124155, 0.1266326838835644, -0.03679837564926459, -0.0657241395622801, -0.31140443696055997, 0.2641028736860337, 0.07008639710996797, 0.15792645429739888, -0.0016184307555649204, 0.018109123814975474, -0.07501810165037315, -0.015409620471208202, -0.09502272722066234, -0.12437420733037842, -0.055674197742345964, 0.23461504792860866, 0.13348470531170245, 0.18424592124838343, -0.44202150589963685, -0.2640336913825861, 0.06398516225059203, 0.129216776214359, 0.020671436363767063, 0.01712802390290824, -0.18727993182856817, 0.03214812218230444, -0.2534713680452482, -0.11045440334095223, 0.014335664973296375, 0.09889439522285912, 0.02582976006316436, -0.21961026380087442, 0.10390922322922089, 0.11506743162473558, 0.01013562079473787, -0.18022070397827436, -0.03428910068577525, -0.051303587052669485, 0.09045758848323633, 0.08408712026962882, 0.06825268873002244, 0.13239751137069122, -0.09240780168718202, -0.041793132475143685, 0.3219024420749803, -0.08995986418649629, 0.02688207288238744, 0.21867834965166774, -0.21948128597347089, -0.185302424022121, 0.15414354833043728, 0.10590281910291281, 0.13033710859210687, -0.15856701933292422, -0.04445599836390654, -0.003045492363445129, 0.24166641245701687, 0.060399187024614893, -0.003325100162402097, 0.320730358194409, 0.1579826745272497, -0.051496650151925366, 0.1291265376642731, -0.19502509057687722, -0.07222359970533421, -0.26510238021174787, -0.046177451860778006, -0.117756402521085, 0.08273747967587226, -0.06376562438211696, -0.09790313055527657, 0.3805529835361984, 0.09309041688600715, 0.18633798798730009, -0.022146752489700553, 0.27524146655959036, 0.09377847165048409, 0.05321667949020531, 0.20122231382627778, 0.34581618668013797, 0.15540597033743495, 0.15505771093807647, -0.27402653182851555, 0.14181371105585985, 0.027215273081803854] |
1,802.06082 | Studies of Lepton Flavor Violation at the LHC | We examine the charged lepton flavor violating process $gg \rightarrow
\mu^\pm \tau^\mp$ at the $\sqrt{s} = 13$ TeV LHC. Operators generating this
process can be induced by new physics (NP) at dimension 8. Despite the power
suppression associated with dimension 8 operators, we show that the LHC's large
gluon luminosity makes it possible to probe this channel. For an integrated
luminosity of 100 fb$^{-1}$ at the LHC, we predict a constraint on the NP scale
$\Lambda \gtrsim 3$ TeV. In addition, we point out that such operators can be
induced through top quark loops in models that generate dimension 6 operators
of the form $\overline{t} t \, \mu \tau$. We find that the NP scale of these
dimension 6 operators can be constrained to be $\Lambda \gtrsim 3.4-4.1$ TeV
with 100 fb$^{-1}$ of data.
| hep-ph hep-ex | we examine the charged lepton flavor violating process gg rightarrow mupm taump at the sqrts 13 tev lhc operators generating this process can be induced by new physics np at dimension 8 despite the power suppression associated with dimension 8 operators we show that the lhcs large gluon luminosity makes it possible to probe this channel for an integrated luminosity of 100 fb1 at the lhc we predict a constraint on the np scale lambda gtrsim 3 tev in addition we point out that such operators can be induced through top quark loops in models that generate dimension 6 operators of the form overlinet t mu tau we find that the np scale of these dimension 6 operators can be constrained to be lambda gtrsim 3441 tev with 100 fb1 of data | [['we', 'examine', 'the', 'charged', 'lepton', 'flavor', 'violating', 'process', 'gg', 'rightarrow', 'mupm', 'taump', 'at', 'the', 'sqrts', '13', 'tev', 'lhc', 'operators', 'generating', 'this', 'process', 'can', 'be', 'induced', 'by', 'new', 'physics', 'np', 'at', 'dimension', '8', 'despite', 'the', 'power', 'suppression', 'associated', 'with', 'dimension', '8', 'operators', 'we', 'show', 'that', 'the', 'lhcs', 'large', 'gluon', 'luminosity', 'makes', 'it', 'possible', 'to', 'probe', 'this', 'channel', 'for', 'an', 'integrated', 'luminosity', 'of', '100', 'fb1', 'at', 'the', 'lhc', 'we', 'predict', 'a', 'constraint', 'on', 'the', 'np', 'scale', 'lambda', 'gtrsim', '3', 'tev', 'in', 'addition', 'we', 'point', 'out', 'that', 'such', 'operators', 'can', 'be', 'induced', 'through', 'top', 'quark', 'loops', 'in', 'models', 'that', 'generate', 'dimension', '6', 'operators', 'of', 'the', 'form', 'overlinet', 't', 'mu', 'tau', 'we', 'find', 'that', 'the', 'np', 'scale', 'of', 'these', 'dimension', '6', 'operators', 'can', 'be', 'constrained', 'to', 'be', 'lambda', 'gtrsim', '3441', 'tev', 'with', '100', 'fb1', 'of', 'data']] | [-0.061367877081713894, 0.26827693969166966, -0.013257742834729, 0.16709486027808784, -0.04834358801775979, -0.15198389107756544, 0.008448336760259488, 0.3442776601860356, -0.2546749283602835, -0.325923655774783, 0.03676522153634296, -0.34805096616742737, 0.034891772542543935, 0.13511762213117132, 0.09194529339826356, 0.051282652681975655, 0.08412656107093701, -0.021399542050803022, -0.04556998027405688, -0.24634213449109776, 0.3053777544462884, 0.055259425662260386, 0.16990260667675597, 0.13885460811963474, 0.0560665152848797, -0.03507035827461743, -0.02480799165399124, -0.06435667797852533, -0.11038293878686312, 0.031510328308672106, 0.24653702930479057, 0.10552831919983763, 0.10532563254519393, -0.3521726605708175, -0.055806823743323825, 0.2095571530552468, 0.15058727616401898, 0.026210510976273905, -0.002354187641299866, -0.28380183640613477, 0.2099655055137577, -0.21904146849093112, -0.15572822773405773, -0.025192121590600546, 0.03662258319584935, -0.12255570518644879, -0.37571225845198514, 0.07902228887277571, -0.008588634734747537, 0.052952739000884874, 0.020753992640300457, -0.18040294398176202, -0.04923019607226844, -0.0506788405755563, 0.04358158224027703, 0.08270261774128868, 0.1760434878348006, -0.14487875573412926, -0.19874137341993806, 0.30425597586189257, -0.06153803195268141, -0.15714039869260776, 0.1988460719007752, -0.2158252751334768, -0.15182265262542802, 0.1282158333307245, 0.259400915255438, 0.08122024946902512, -0.19568783229668485, 0.20503154524714884, -0.015438648411707783, 0.22167411844786716, 0.10690532157296372, 0.06689298241822557, 0.17480680659046452, 0.20360817125236447, 0.07453457367691127, 0.05953161297436578, -0.12859163681710153, 0.016734220242307692, -0.4403111888836561, -0.09663547246644598, -0.08691050107308636, 0.17124937059777562, -0.11561940500696162, -0.0021064636353967767, 0.3489845370305843, 0.14544271249817967, 0.31628533493494615, 0.019266239644352798, 0.20391178206597088, 0.15734004004237553, 0.13191528209471004, 0.1038297412204415, 0.26536389385265385, 0.07713685712643024, 0.13684806035775127, -0.217900159516527, -0.04656357634953703, 0.04442804877180606] |
1,802.06083 | ALMA view of a massive spheroid progenitor: a compact rotating core of
molecular gas in an AGN host at z=2.226 | We present ALMA observations at 107.291 GHz (band 3) and 214.532 GHz (band 6)
of GMASS 0953, a star-forming galaxy at z=2.226 hosting an obscured AGN that
has been proposed as a progenitor of compact quiescent galaxies (QG). We
measure for the first time the size of the dust and molecular gas emission of
GMASS 0953 that we find to be extremely compact ($\sim$1 kpc). This result,
coupled with a very high ISM density (n$\sim$10$^{5.5}$ cm$^{-3}$), a low gas
mass fraction ($\sim$0.2) and a short gas depletion timescale ($\sim$150 Myr)
imply that GMASS 0953 is experiencing an episode of intense star-formation in
its central region that will rapidly exhaust its gas reservoirs, likely aided
by AGN-induced feedback, confirming its fate as a compact QG. Kinematic
analysis of the CO(6-5) line shows evidence of rapidly-rotating gas
($V_{rot}$=320$^{+92}_{-53}$ km s$^{-1}$), as observed also in a handful of
similar sources at the same redshift. On-going quenching mechanisms could
either destroy the rotation or leave it intact leading the galaxy to evolve
into a rotating QG.
| astro-ph.GA | we present alma observations at 107291 ghz band 3 and 214532 ghz band 6 of gmass 0953 a starforming galaxy at z2226 hosting an obscured agn that has been proposed as a progenitor of compact quiescent galaxies qg we measure for the first time the size of the dust and molecular gas emission of gmass 0953 that we find to be extremely compact sim1 kpc this result coupled with a very high ism density nsim1055 cm3 a low gas mass fraction sim02 and a short gas depletion timescale sim150 myr imply that gmass 0953 is experiencing an episode of intense starformation in its central region that will rapidly exhaust its gas reservoirs likely aided by agninduced feedback confirming its fate as a compact qg kinematic analysis of the co65 line shows evidence of rapidlyrotating gas v_rot32092_53 km s1 as observed also in a handful of similar sources at the same redshift ongoing quenching mechanisms could either destroy the rotation or leave it intact leading the galaxy to evolve into a rotating qg | [['we', 'present', 'alma', 'observations', 'at', '107291', 'ghz', 'band', '3', 'and', '214532', 'ghz', 'band', '6', 'of', 'gmass', '0953', 'a', 'starforming', 'galaxy', 'at', 'z2226', 'hosting', 'an', 'obscured', 'agn', 'that', 'has', 'been', 'proposed', 'as', 'a', 'progenitor', 'of', 'compact', 'quiescent', 'galaxies', 'qg', 'we', 'measure', 'for', 'the', 'first', 'time', 'the', 'size', 'of', 'the', 'dust', 'and', 'molecular', 'gas', 'emission', 'of', 'gmass', '0953', 'that', 'we', 'find', 'to', 'be', 'extremely', 'compact', 'sim1', 'kpc', 'this', 'result', 'coupled', 'with', 'a', 'very', 'high', 'ism', 'density', 'nsim1055', 'cm3', 'a', 'low', 'gas', 'mass', 'fraction', 'sim02', 'and', 'a', 'short', 'gas', 'depletion', 'timescale', 'sim150', 'myr', 'imply', 'that', 'gmass', '0953', 'is', 'experiencing', 'an', 'episode', 'of', 'intense', 'starformation', 'in', 'its', 'central', 'region', 'that', 'will', 'rapidly', 'exhaust', 'its', 'gas', 'reservoirs', 'likely', 'aided', 'by', 'agninduced', 'feedback', 'confirming', 'its', 'fate', 'as', 'a', 'compact', 'qg', 'kinematic', 'analysis', 'of', 'the', 'co65', 'line', 'shows', 'evidence', 'of', 'rapidlyrotating', 'gas', 'v_rot32092_53', 'km', 's1', 'as', 'observed', 'also', 'in', 'a', 'handful', 'of', 'similar', 'sources', 'at', 'the', 'same', 'redshift', 'ongoing', 'quenching', 'mechanisms', 'could', 'either', 'destroy', 'the', 'rotation', 'or', 'leave', 'it', 'intact', 'leading', 'the', 'galaxy', 'to', 'evolve', 'into', 'a', 'rotating', 'qg']] | [-0.10142870488734135, 0.1374172656951977, -0.06366613593710932, 0.0855968915057455, -0.04951303464661681, -0.0705316675768351, 0.04874177924413122, 0.43872918060863625, -0.12121542709918615, -0.3026282712259514, 0.09237021301359964, -0.2654968083663258, 0.01947639364342088, 0.18124820685019705, -0.004023665667011006, -0.09349423659579204, 0.04195480774126077, -0.10492777893135692, -0.04607157443409916, -0.23294302047380877, 0.2828431421135201, 0.11070383401743755, 0.13605739557306967, 0.03295246056214109, 0.09480490242716616, -0.17215754508882938, -0.045838694462153926, -0.059505242279251136, -0.14818874061331405, -0.01129967486764678, 0.25208079584032117, 0.10666086997496645, 0.26765936603044677, -0.36390875053486066, -0.2242694615168932, 0.06362671851289241, 0.2211533348092776, 0.03785800977894468, -0.09646297033463498, -0.2550967602159627, 0.07318257891522821, -0.24574599555041082, -0.2146097340699129, 0.10481172211295339, 0.07486463791712028, -0.027646811035094265, -0.19664560862022876, 0.18475774639201753, 0.04473949989658072, 0.07425247637476928, -0.09403239831768957, -0.05619447873724056, -0.09214531390754852, 0.060093835266000276, -0.01837127542326751, 0.14086833994516346, 0.25670128699648614, -0.13218002452816213, 0.009390650202748839, 0.400188001370459, -0.09499921567018652, 0.038531152419968996, 0.28065875802233725, -0.24317178476328577, -0.21293285280231855, 0.22142224497451798, 0.15411441739436663, 0.07472621298410434, -0.11785903328773148, -0.04285750696299637, -0.05230942838699808, 0.24352737646661476, 0.01977449527685112, 0.09399963470059447, 0.3672783158463008, 0.14349249627407706, 0.04322300829316774, 0.0831459147338393, -0.21376379285409244, 0.004883484549096835, -0.22299317956182682, -0.10685162308687221, -0.1259962696774478, 0.1543133699643275, -0.121058085275006, -0.07106669551886696, 0.29980874398700935, 0.07501190826709837, 0.2251622823797568, 0.056225375983373314, 0.2976356551558627, 0.0788262016906732, 0.13526287688357855, 0.17337466172126684, 0.2808650501579894, 0.1911844351638421, 0.05584887350131451, -0.2452547788597078, 0.047706689178095965, -0.034596307831955796] |
1,802.06084 | The Influence of Galaxy Environment on the Stellar Initial Mass Function
of Early-Type Galaxies | In this paper we investigate whether the stellar initial mass function of
early-type galaxies depends on their host environment. To this purpose, we have
selected a sample of early-type galaxies from the SPIDER catalogue,
characterized their environment through the group catalogue of Wang et al. and
used their optical SDSS spectra to constrain the IMF slope, through the
analysis of IMF-sensitive spectral indices. To reach a high enough
signal-to-noise ratio, we have stacked spectra in velocity dispersion
($\sigma_0$) bins, on top of separating the sample by galaxy hierarchy and host
halo mass, as proxies for galaxy environment. In order to constrain the IMF, we
have compared observed line strengths to predictions of MIUSCAT/EMILES
synthetic stellar population models, with varying age, metallicity, and
"bimodal" (low-mass tapered) IMF slope ($\rm \Gamma_b$). Consistent with
previous studies, we find that $\rm \Gamma_b$ increases with $\sigma_0$,
becoming bottom-heavy (i.e. an excess of low-mass stars with respect to the
Milky-Way-like IMF) at high $\sigma_0$. We find that this result is robust
against the set of isochrones used in the stellar population models, as well as
the way the effect of elemental abundance ratios is taken into account. We thus
conclude that it is possible to use currently state-of-the-art stellar
population models and intermediate resolution spectra to consistently probe IMF
variations. For the first time, we show that there is no dependence of
$\Gamma_b$ on environment or galaxy hierarchy, as measured within the $3"$ SDSS
fibre, thus leaving the IMF as an intrinsic galaxy property, possibly set
already at high redshift.
| astro-ph.GA | in this paper we investigate whether the stellar initial mass function of earlytype galaxies depends on their host environment to this purpose we have selected a sample of earlytype galaxies from the spider catalogue characterized their environment through the group catalogue of wang et al and used their optical sdss spectra to constrain the imf slope through the analysis of imfsensitive spectral indices to reach a high enough signaltonoise ratio we have stacked spectra in velocity dispersion sigma_0 bins on top of separating the sample by galaxy hierarchy and host halo mass as proxies for galaxy environment in order to constrain the imf we have compared observed line strengths to predictions of miuscatemiles synthetic stellar population models with varying age metallicity and bimodal lowmass tapered imf slope rm gamma_b consistent with previous studies we find that rm gamma_b increases with sigma_0 becoming bottomheavy ie an excess of lowmass stars with respect to the milkywaylike imf at high sigma_0 we find that this result is robust against the set of isochrones used in the stellar population models as well as the way the effect of elemental abundance ratios is taken into account we thus conclude that it is possible to use currently stateoftheart stellar population models and intermediate resolution spectra to consistently probe imf variations for the first time we show that there is no dependence of gamma_b on environment or galaxy hierarchy as measured within the 3 sdss fibre thus leaving the imf as an intrinsic galaxy property possibly set already at high redshift | [['in', 'this', 'paper', 'we', 'investigate', 'whether', 'the', 'stellar', 'initial', 'mass', 'function', 'of', 'earlytype', 'galaxies', 'depends', 'on', 'their', 'host', 'environment', 'to', 'this', 'purpose', 'we', 'have', 'selected', 'a', 'sample', 'of', 'earlytype', 'galaxies', 'from', 'the', 'spider', 'catalogue', 'characterized', 'their', 'environment', 'through', 'the', 'group', 'catalogue', 'of', 'wang', 'et', 'al', 'and', 'used', 'their', 'optical', 'sdss', 'spectra', 'to', 'constrain', 'the', 'imf', 'slope', 'through', 'the', 'analysis', 'of', 'imfsensitive', 'spectral', 'indices', 'to', 'reach', 'a', 'high', 'enough', 'signaltonoise', 'ratio', 'we', 'have', 'stacked', 'spectra', 'in', 'velocity', 'dispersion', 'sigma_0', 'bins', 'on', 'top', 'of', 'separating', 'the', 'sample', 'by', 'galaxy', 'hierarchy', 'and', 'host', 'halo', 'mass', 'as', 'proxies', 'for', 'galaxy', 'environment', 'in', 'order', 'to', 'constrain', 'the', 'imf', 'we', 'have', 'compared', 'observed', 'line', 'strengths', 'to', 'predictions', 'of', 'miuscatemiles', 'synthetic', 'stellar', 'population', 'models', 'with', 'varying', 'age', 'metallicity', 'and', 'bimodal', 'lowmass', 'tapered', 'imf', 'slope', 'rm', 'gamma_b', 'consistent', 'with', 'previous', 'studies', 'we', 'find', 'that', 'rm', 'gamma_b', 'increases', 'with', 'sigma_0', 'becoming', 'bottomheavy', 'ie', 'an', 'excess', 'of', 'lowmass', 'stars', 'with', 'respect', 'to', 'the', 'milkywaylike', 'imf', 'at', 'high', 'sigma_0', 'we', 'find', 'that', 'this', 'result', 'is', 'robust', 'against', 'the', 'set', 'of', 'isochrones', 'used', 'in', 'the', 'stellar', 'population', 'models', 'as', 'well', 'as', 'the', 'way', 'the', 'effect', 'of', 'elemental', 'abundance', 'ratios', 'is', 'taken', 'into', 'account', 'we', 'thus', 'conclude', 'that', 'it', 'is', 'possible', 'to', 'use', 'currently', 'stateoftheart', 'stellar', 'population', 'models', 'and', 'intermediate', 'resolution', 'spectra', 'to', 'consistently', 'probe', 'imf', 'variations', 'for', 'the', 'first', 'time', 'we', 'show', 'that', 'there', 'is', 'no', 'dependence', 'of', 'gamma_b', 'on', 'environment', 'or', 'galaxy', 'hierarchy', 'as', 'measured', 'within', 'the', '3', 'sdss', 'fibre', 'thus', 'leaving', 'the', 'imf', 'as', 'an', 'intrinsic', 'galaxy', 'property', 'possibly', 'set', 'already', 'at', 'high', 'redshift']] | [-0.0269077567258489, 0.09641624423833987, -0.08091918045191072, 0.10622284001175668, -0.07421786679560502, -0.06174112378947231, 0.046138082516357565, 0.47182428297907, -0.14038945121042753, -0.41031386200343206, 0.003049493579584148, -0.2756055457215653, -0.007053975962845999, 0.19813886463339347, -0.03955554120332783, 0.011685357155304093, 0.0516675762130912, -0.09169916936708063, -0.03372514694937175, -0.26212804867396416, 0.3426235244055407, 0.07754359773558973, 0.2034266657000886, -0.05457051650146133, 0.050058814907251406, -0.07958606885389054, -0.07844702648771963, -0.0036555906268123817, -0.17724820797245586, -0.007812880321954315, 0.21653139982345776, 0.13195422311849397, 0.21239458219600996, -0.3062050258296173, -0.17238262344313704, 0.10795239698355318, 0.21230826024039695, 0.03844485340617862, -0.08945053884724574, -0.24609124994001133, 0.09742045451738787, -0.19064609602778385, -0.1818796440626756, 0.04379062551504421, 0.04036784189359355, 0.021133146955532284, -0.22731356974231012, 0.1534952189680833, 0.006937529796480455, 0.10456960397844273, -0.10379001091274878, -0.12568600740276364, -0.12178403281757659, 0.10046554164291017, 0.03875365052298595, 0.06907458682204026, 0.1854294521923696, -0.13680160401403726, 0.01333311271141449, 0.39039410569193395, -0.10251780936407963, -0.05527013377930689, 0.21467957511109856, -0.18820255978415784, -0.1864052579353753, 0.041488485117240445, 0.19815758922737342, 0.08129424587114835, -0.13629027866857796, 0.035312004797823225, -0.024836861383052095, 0.2551149964431971, 0.008889168579124003, 0.03981115312472892, 0.28938688809353963, 0.11249851064872468, 0.03996291488552606, 0.05876862775606173, -0.17332605873841955, -0.0002587275085381781, -0.20994187675953913, -0.0786273025653579, -0.12612681533440048, 0.07753209169841788, -0.1429558577411256, -0.14894768717540466, 0.35194157033039647, 0.14038825350198822, 0.2730850525818795, 0.13298132781375552, 0.2962359422776414, 0.11887252784167092, 0.11700245812111958, 0.07647763634939851, 0.2775991402617969, 0.18380515901703137, 0.057362616044679, -0.23794950882300528, 0.10175947318996557, -0.022187318609615148] |
1,802.06085 | Kaluza-Klein reductions and AdS/Ricci-flat correspondence | The AdS/Ricci-flat (AdS/RF) correspondence is a map between families of
asymptotically locally AdS solutions on a torus and families of asymptotically
flat spacetimes on a sphere. The aim of this work is to perturbatively extend
this map to general AdS and asymptotically flat solutions. A prime application
for such map would be the development of holography for Minkowski spacetime. In
this paper we perform a Kaluza-Klein (KK) reduction of AdS on a torus and of
Minkowski on a sphere, keeping all massive KK modes. Such computation is
interesting on its own, as there are relatively few examples of such explicit
KK reductions in the literature. We perform both KK reductions in parallel to
illustrate their similarity. In particular, we show how to construct gauge
invariant variables, find the field equations they satisfy, and construct a
corresponding effective action. We further diagonalize all equations and find
their general solution in closed form. Surprisingly, in the limit of large
dimension of the compact manifolds (torus and sphere), the AdS/RF
correspondence maps individual KK modes from one side to the other. In a sequel
of this paper we will discuss how the AdS/RF maps acts when the dimension of
the compact space is finite.
| hep-th | the adsricciflat adsrf correspondence is a map between families of asymptotically locally ads solutions on a torus and families of asymptotically flat spacetimes on a sphere the aim of this work is to perturbatively extend this map to general ads and asymptotically flat solutions a prime application for such map would be the development of holography for minkowski spacetime in this paper we perform a kaluzaklein kk reduction of ads on a torus and of minkowski on a sphere keeping all massive kk modes such computation is interesting on its own as there are relatively few examples of such explicit kk reductions in the literature we perform both kk reductions in parallel to illustrate their similarity in particular we show how to construct gauge invariant variables find the field equations they satisfy and construct a corresponding effective action we further diagonalize all equations and find their general solution in closed form surprisingly in the limit of large dimension of the compact manifolds torus and sphere the adsrf correspondence maps individual kk modes from one side to the other in a sequel of this paper we will discuss how the adsrf maps acts when the dimension of the compact space is finite | [['the', 'adsricciflat', 'adsrf', 'correspondence', 'is', 'a', 'map', 'between', 'families', 'of', 'asymptotically', 'locally', 'ads', 'solutions', 'on', 'a', 'torus', 'and', 'families', 'of', 'asymptotically', 'flat', 'spacetimes', 'on', 'a', 'sphere', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'perturbatively', 'extend', 'this', 'map', 'to', 'general', 'ads', 'and', 'asymptotically', 'flat', 'solutions', 'a', 'prime', 'application', 'for', 'such', 'map', 'would', 'be', 'the', 'development', 'of', 'holography', 'for', 'minkowski', 'spacetime', 'in', 'this', 'paper', 'we', 'perform', 'a', 'kaluzaklein', 'kk', 'reduction', 'of', 'ads', 'on', 'a', 'torus', 'and', 'of', 'minkowski', 'on', 'a', 'sphere', 'keeping', 'all', 'massive', 'kk', 'modes', 'such', 'computation', 'is', 'interesting', 'on', 'its', 'own', 'as', 'there', 'are', 'relatively', 'few', 'examples', 'of', 'such', 'explicit', 'kk', 'reductions', 'in', 'the', 'literature', 'we', 'perform', 'both', 'kk', 'reductions', 'in', 'parallel', 'to', 'illustrate', 'their', 'similarity', 'in', 'particular', 'we', 'show', 'how', 'to', 'construct', 'gauge', 'invariant', 'variables', 'find', 'the', 'field', 'equations', 'they', 'satisfy', 'and', 'construct', 'a', 'corresponding', 'effective', 'action', 'we', 'further', 'diagonalize', 'all', 'equations', 'and', 'find', 'their', 'general', 'solution', 'in', 'closed', 'form', 'surprisingly', 'in', 'the', 'limit', 'of', 'large', 'dimension', 'of', 'the', 'compact', 'manifolds', 'torus', 'and', 'sphere', 'the', 'adsrf', 'correspondence', 'maps', 'individual', 'kk', 'modes', 'from', 'one', 'side', 'to', 'the', 'other', 'in', 'a', 'sequel', 'of', 'this', 'paper', 'we', 'will', 'discuss', 'how', 'the', 'adsrf', 'maps', 'acts', 'when', 'the', 'dimension', 'of', 'the', 'compact', 'space', 'is', 'finite']] | [-0.15447720410535112, 0.10080554889689665, -0.09752675391267986, 0.105013897549361, -0.09399522156221791, -0.11900295187253505, 0.024598196952138097, 0.33758192737586795, -0.21044343346031383, -0.2353414367127698, 0.13395153555844444, -0.29328891951125113, -0.158017134310212, 0.1839397633308545, -0.07973322100224323, 0.01075388121040305, 0.027180905604327562, 0.08029492200585082, -0.10006736438081135, -0.2600146977661643, 0.37400094521231947, 0.006900885778013617, 0.253164209240349, 0.012745225346880034, 0.1141860900411848, -0.01501162988366559, -0.03471744874725118, 0.0200734233132971, -0.16383322963840327, 0.12724403829779476, 0.25880142028909175, 0.09423567208461464, 0.17651781362248584, -0.3806961812265217, -0.17636755347251892, 0.1199730607168749, 0.17363238900201394, 0.12949342923238874, -0.0297020494955359, -0.2358999642683193, 0.0944511184480507, -0.1584604940493591, -0.14890926580701488, -0.0984794556023553, 0.03195380138990003, -0.05615817346144467, -0.22396074993535875, 0.007900268637313275, 0.07124481527484022, 0.03682193490210921, -0.0761519683530787, -0.038056232574163004, -0.03699411711655557, 0.12363694934247178, 0.0849275294621475, 0.04302984573645517, 0.09483977977884933, -0.10066428302176064, -0.088208225897979, 0.36390865496825425, -0.09513454596046358, -0.30080711213406175, 0.2103183787036687, -0.14776728258933872, -0.1440154105098918, 0.08801476134336554, 0.19399418215733022, 0.17621282359352336, -0.08675830316999054, 0.19739949445065577, -0.07696642766008154, 0.12563770259963347, 0.11306553278351203, 0.053499859142466445, 0.21413100931909868, 0.09019012666074559, 0.098067552204011, 0.17324283797963289, -0.015368781954748556, -0.08632954940985656, -0.3619583850167692, -0.1873420432698913, -0.10637209178064949, 0.1034633469604887, -0.11679884760596906, -0.17548818566603586, 0.3613381214172114, 0.0826367617235519, 0.19728555792709812, 0.08241626145507325, 0.24369559730868787, 0.08438982496911195, 0.04679125579306856, 0.10418901553377509, 0.2255849322769791, 0.12563318536034784, 0.045912831380264835, -0.17714786370110233, -0.1177046389860334, 0.111678221069742] |
1,802.06086 | The convective photosphere of the red supergiant CE Tau. I. VLTI/PIONIER
H-band interferometric imaging | Context. Red supergiant stars are one of the latest stages in the evolution
of massive stars. Their photospheric convection may play an important role in
the launching mechanism of their mass loss; however, its characteristics and
dynamics are still poorly constrained. Aims. By observing red supergiant stars
with near infrared interferometry at different epochs, we expect to reveal the
evolution of bright convective features on their stellar surface. Methods. We
observed the M2Iab-Ib red supergiant star CE Tau with the VLTI/PIONIER
instrument in the H band at two different epochs separated by one month.
Results. We derive the angular diameter of the star and basic stellar
parameters, and reconstruct two reliable images of its H-band photosphere. The
contrast of the convective pattern of the reconstructed images is $5 \pm 1 \%$
and $6 \pm 1 \%$ for our two epochs of observation. Conclusions. The stellar
photosphere shows few changes between the two epochs. The contrast of the
convective pattern is below the average contrast variations obtained on 30
randomly chosen snapshots of the best matching 3D radiative hydrodynamics
simulation: $23 \pm 1~\%$ for the original simulation images and $16 \pm 1~\%$
for the maps degraded to the reconstruction resolution. We offer two hypotheses
to explain this observation. CE Tau may be experiencing a quiet convective
activity episode or it could be a consequence of its warmer effective
temperature (hence its smaller radius) compared to the simulation.
| astro-ph.SR | context red supergiant stars are one of the latest stages in the evolution of massive stars their photospheric convection may play an important role in the launching mechanism of their mass loss however its characteristics and dynamics are still poorly constrained aims by observing red supergiant stars with near infrared interferometry at different epochs we expect to reveal the evolution of bright convective features on their stellar surface methods we observed the m2iabib red supergiant star ce tau with the vltipionier instrument in the h band at two different epochs separated by one month results we derive the angular diameter of the star and basic stellar parameters and reconstruct two reliable images of its hband photosphere the contrast of the convective pattern of the reconstructed images is 5 pm 1 and 6 pm 1 for our two epochs of observation conclusions the stellar photosphere shows few changes between the two epochs the contrast of the convective pattern is below the average contrast variations obtained on 30 randomly chosen snapshots of the best matching 3d radiative hydrodynamics simulation 23 pm 1 for the original simulation images and 16 pm 1 for the maps degraded to the reconstruction resolution we offer two hypotheses to explain this observation ce tau may be experiencing a quiet convective activity episode or it could be a consequence of its warmer effective temperature hence its smaller radius compared to the simulation | [['context', 'red', 'supergiant', 'stars', 'are', 'one', 'of', 'the', 'latest', 'stages', 'in', 'the', 'evolution', 'of', 'massive', 'stars', 'their', 'photospheric', 'convection', 'may', 'play', 'an', 'important', 'role', 'in', 'the', 'launching', 'mechanism', 'of', 'their', 'mass', 'loss', 'however', 'its', 'characteristics', 'and', 'dynamics', 'are', 'still', 'poorly', 'constrained', 'aims', 'by', 'observing', 'red', 'supergiant', 'stars', 'with', 'near', 'infrared', 'interferometry', 'at', 'different', 'epochs', 'we', 'expect', 'to', 'reveal', 'the', 'evolution', 'of', 'bright', 'convective', 'features', 'on', 'their', 'stellar', 'surface', 'methods', 'we', 'observed', 'the', 'm2iabib', 'red', 'supergiant', 'star', 'ce', 'tau', 'with', 'the', 'vltipionier', 'instrument', 'in', 'the', 'h', 'band', 'at', 'two', 'different', 'epochs', 'separated', 'by', 'one', 'month', 'results', 'we', 'derive', 'the', 'angular', 'diameter', 'of', 'the', 'star', 'and', 'basic', 'stellar', 'parameters', 'and', 'reconstruct', 'two', 'reliable', 'images', 'of', 'its', 'hband', 'photosphere', 'the', 'contrast', 'of', 'the', 'convective', 'pattern', 'of', 'the', 'reconstructed', 'images', 'is', '5', 'pm', '1', 'and', '6', 'pm', '1', 'for', 'our', 'two', 'epochs', 'of', 'observation', 'conclusions', 'the', 'stellar', 'photosphere', 'shows', 'few', 'changes', 'between', 'the', 'two', 'epochs', 'the', 'contrast', 'of', 'the', 'convective', 'pattern', 'is', 'below', 'the', 'average', 'contrast', 'variations', 'obtained', 'on', '30', 'randomly', 'chosen', 'snapshots', 'of', 'the', 'best', 'matching', '3d', 'radiative', 'hydrodynamics', 'simulation', '23', 'pm', '1', 'for', 'the', 'original', 'simulation', 'images', 'and', '16', 'pm', '1', 'for', 'the', 'maps', 'degraded', 'to', 'the', 'reconstruction', 'resolution', 'we', 'offer', 'two', 'hypotheses', 'to', 'explain', 'this', 'observation', 'ce', 'tau', 'may', 'be', 'experiencing', 'a', 'quiet', 'convective', 'activity', 'episode', 'or', 'it', 'could', 'be', 'a', 'consequence', 'of', 'its', 'warmer', 'effective', 'temperature', 'hence', 'its', 'smaller', 'radius', 'compared', 'to', 'the', 'simulation']] | [-0.08271061252930517, 0.148446148090115, -0.06440910439570574, 0.09002290261447701, -0.058393648822588025, -0.08388912979245601, 0.029286541792668017, 0.4129049831225893, -0.20915012704728114, -0.4012652136297505, 0.09521107816601036, -0.2941956525596554, -0.044596446609092566, 0.1661328720778243, -0.06256796261310665, -0.02896785498706648, 0.12452927373235749, -0.028781275205961687, -0.06127776194347844, -0.23511933274936234, 0.28265865567308157, 0.0650136680642039, 0.16512218352343264, -0.039960226997365386, 0.046686689522269266, -0.11810235280939278, -0.08827081996529831, -0.061279957042807164, -0.1466927089980232, 0.02759401814499595, 0.20163314133011156, 0.12575067910205875, 0.23058223948552165, -0.40097090789784434, -0.20388160009924403, 0.03939907402404716, 0.1887405964689801, 0.029751186172528865, -0.02581318361033154, -0.23102325048145755, 0.0839024080271341, -0.11852292686524948, -0.12442740565665514, 0.06613986152364142, 0.02013275552842798, -0.020480272218873805, -0.2559173626969109, 0.10384936890424461, 0.03208053863333546, 0.10337661590293258, -0.10469191732252808, -0.13438902248912232, -0.09574156276014326, 0.14980400950935682, 0.030462326660808257, 0.06912236403306155, 0.1371337814524354, -0.13370313355998964, -0.028996881242949402, 0.38501053106023775, -0.09878166779763836, -0.04053116405019017, 0.22212651483075047, -0.1987930547342088, -0.1145087290523262, 0.16158920361224738, 0.12876823879458618, 0.16101647049284545, -0.11948576222209843, -0.053666920038669616, 0.009470359224910036, 0.18327844145711783, 0.06639388755219688, 0.05717148427160001, 0.3028371342469822, 0.16781839674869312, 0.002338040336295003, 0.06278395877757345, -0.25404144493990893, -0.05073446588183038, -0.23801192838364868, -0.07364810255402099, -0.13819093762721082, 0.05354614527668712, -0.16304929679939914, -0.10283164863270815, 0.4046119816657236, 0.13279010441984637, 0.21603386187995885, 0.02435974302789588, 0.3134410137434534, 0.07528603953147475, 0.0738200894014834, 0.10484986972111746, 0.31259817690008956, 0.17756389114853843, 0.1453398377659567, -0.2651944439402592, 0.06197114274317455, 0.009612398143146236] |
1,802.06087 | Boson-fermion duality in a gravitational background | We study the $2+1$ dimensional boson-fermion duality in the presence of
background curvature and electromagnetic fields. The main players are, on the
one hand, a massive complex $|\phi|^4$ scalar field coupled to a $U(1)$
Maxwell-Chern-Simons gauge field at level $1$, representing a relativistic
composite boson with one unit of attached flux, and on the other hand, a
massive Dirac fermion. We show that, in a curved background and at the level of
the partition function, the relativistic composite boson, in the infinite
coupling limit, is dual to a short-range interacting Dirac fermion. The
coupling to the gravitational spin connection arises naturally from the spin
factors of the Wilson loop in the Chern-Simons theory. A non-minimal coupling
to the scalar curvature is included on the bosonic side in order to obtain
agreement between partition functions. Although an explicit Lagrangian
expression for the fermionic interactions is not obtained, their short-range
nature constrains them to be irrelevant, which protects the duality in its
strong interpretation as an exact mapping at the IR fixed point between a
Wilson-Fischer-Chern-Simons complex scalar and a free Dirac fermion. We also
show that, even away from the IR, keeping the $|\phi|^4$ term is of key
importance as it provides the short-range bosonic interactions necessary to
prevent intersections of worldlines in the path integral, thus forbidding
unknotting of knots and ensuring preservation of the worldline topologies.
| cond-mat.str-el hep-th math-ph math.MP | we study the 21 dimensional bosonfermion duality in the presence of background curvature and electromagnetic fields the main players are on the one hand a massive complex phi4 scalar field coupled to a u1 maxwellchernsimons gauge field at level 1 representing a relativistic composite boson with one unit of attached flux and on the other hand a massive dirac fermion we show that in a curved background and at the level of the partition function the relativistic composite boson in the infinite coupling limit is dual to a shortrange interacting dirac fermion the coupling to the gravitational spin connection arises naturally from the spin factors of the wilson loop in the chernsimons theory a nonminimal coupling to the scalar curvature is included on the bosonic side in order to obtain agreement between partition functions although an explicit lagrangian expression for the fermionic interactions is not obtained their shortrange nature constrains them to be irrelevant which protects the duality in its strong interpretation as an exact mapping at the ir fixed point between a wilsonfischerchernsimons complex scalar and a free dirac fermion we also show that even away from the ir keeping the phi4 term is of key importance as it provides the shortrange bosonic interactions necessary to prevent intersections of worldlines in the path integral thus forbidding unknotting of knots and ensuring preservation of the worldline topologies | [['we', 'study', 'the', '21', 'dimensional', 'bosonfermion', 'duality', 'in', 'the', 'presence', 'of', 'background', 'curvature', 'and', 'electromagnetic', 'fields', 'the', 'main', 'players', 'are', 'on', 'the', 'one', 'hand', 'a', 'massive', 'complex', 'phi4', 'scalar', 'field', 'coupled', 'to', 'a', 'u1', 'maxwellchernsimons', 'gauge', 'field', 'at', 'level', '1', 'representing', 'a', 'relativistic', 'composite', 'boson', 'with', 'one', 'unit', 'of', 'attached', 'flux', 'and', 'on', 'the', 'other', 'hand', 'a', 'massive', 'dirac', 'fermion', 'we', 'show', 'that', 'in', 'a', 'curved', 'background', 'and', 'at', 'the', 'level', 'of', 'the', 'partition', 'function', 'the', 'relativistic', 'composite', 'boson', 'in', 'the', 'infinite', 'coupling', 'limit', 'is', 'dual', 'to', 'a', 'shortrange', 'interacting', 'dirac', 'fermion', 'the', 'coupling', 'to', 'the', 'gravitational', 'spin', 'connection', 'arises', 'naturally', 'from', 'the', 'spin', 'factors', 'of', 'the', 'wilson', 'loop', 'in', 'the', 'chernsimons', 'theory', 'a', 'nonminimal', 'coupling', 'to', 'the', 'scalar', 'curvature', 'is', 'included', 'on', 'the', 'bosonic', 'side', 'in', 'order', 'to', 'obtain', 'agreement', 'between', 'partition', 'functions', 'although', 'an', 'explicit', 'lagrangian', 'expression', 'for', 'the', 'fermionic', 'interactions', 'is', 'not', 'obtained', 'their', 'shortrange', 'nature', 'constrains', 'them', 'to', 'be', 'irrelevant', 'which', 'protects', 'the', 'duality', 'in', 'its', 'strong', 'interpretation', 'as', 'an', 'exact', 'mapping', 'at', 'the', 'ir', 'fixed', 'point', 'between', 'a', 'wilsonfischerchernsimons', 'complex', 'scalar', 'and', 'a', 'free', 'dirac', 'fermion', 'we', 'also', 'show', 'that', 'even', 'away', 'from', 'the', 'ir', 'keeping', 'the', 'phi4', 'term', 'is', 'of', 'key', 'importance', 'as', 'it', 'provides', 'the', 'shortrange', 'bosonic', 'interactions', 'necessary', 'to', 'prevent', 'intersections', 'of', 'worldlines', 'in', 'the', 'path', 'integral', 'thus', 'forbidding', 'unknotting', 'of', 'knots', 'and', 'ensuring', 'preservation', 'of', 'the', 'worldline', 'topologies']] | [-0.19410009545158693, 0.19257748558351345, -0.054167293939858974, 0.1165191800317076, -0.09120081834375561, -0.1600605474498568, 0.012321943969906728, 0.3151574835574782, -0.2070397681400048, -0.2634909003354873, 0.020786546031116154, -0.2942887422344359, -0.1470584356245601, 0.10855765478475332, 0.02290697742162882, -0.015515479646814757, -0.009786543299328635, 0.0961359211169513, -0.07882268450725659, -0.22342712966935396, 0.3602803306452172, 0.024195247134028944, 0.22597405195042525, 0.09784682711021793, 0.10442454844457716, 0.05304800454873295, 0.012392624220563577, 0.001271680533160678, -0.06613207951558195, 0.106665118786494, 0.18701580658027556, 0.0034701078357504663, 0.18128617061302066, -0.41070833972004134, -0.20337108902806267, 0.0895187882196562, 0.14799668837752836, 0.11399384126411256, -0.03961452733327643, -0.2961172344332017, 0.02951799287147556, -0.14871364123851424, -0.16768796872646358, -0.04519606096076623, -0.030774687478149855, -0.05745816635651992, -0.2776717313161466, 0.06194516451526083, 0.011050566359715684, 0.039666362226306075, -0.051923842570359154, -0.06190056365758049, -0.07718179013530634, 0.1127616642578711, 0.11210692750570257, 0.07708262934877982, 0.1159384385146926, -0.22779628623780343, -0.10762636581862313, 0.39281912164482397, -0.10440323260598362, -0.23960685690419864, 0.21634335153266393, -0.14138407016557278, -0.1434789273240892, 0.14094733836528392, 0.10994516786360965, 0.0915425030547565, -0.13890391861014398, 0.1888549946095543, -0.04076850522552675, 0.1395396543879204, 0.06681006250540371, 0.06671597883055698, 0.2863581968270579, 0.0782536489701525, 0.06141711511047541, 0.14131805298214292, -0.04108337077852524, -0.15843935538314086, -0.36682055197837476, -0.17627319765629543, -0.1747393468796663, 0.09189068294132584, -0.12678069911963633, -0.17882365977126446, 0.3827535132980551, 0.1352485484323584, 0.17102623962080188, 0.03763621086944966, 0.26412914687998396, 0.12809308267361277, 0.09252396563945783, 0.03996396512081599, 0.2535900044136096, 0.17004221344708703, 0.05964448682930881, -0.2625217942121249, -0.10276942223359921, 0.12918153066503346] |
1,802.06088 | Reducing and Analyzing the PHAT Survey with the Cloud | We discuss the technical challenges we faced and the techniques we used to
overcome them when reducing the PHAT photometric data set on the Amazon Elastic
Compute Cloud (EC2). We first describe the architecture of our photometry
pipeline, which we found particularly efficient for reducing the data in
multiple ways for different purposes. We then describe the features of EC2 that
make this architecture both efficient to use and challenging to implement. We
describe the techniques we adopted to process our data, and suggest ways these
techniques may be improved for those interested in trying such reductions in
the future. Finally, we summarize the output photometry data products, which
are now hosted publicly in two places in two formats. They are in simple fits
tables in the high-level science products on MAST, and on a queryable database
available through the NOAO Data Lab.
| astro-ph.IM astro-ph.GA | we discuss the technical challenges we faced and the techniques we used to overcome them when reducing the phat photometric data set on the amazon elastic compute cloud ec2 we first describe the architecture of our photometry pipeline which we found particularly efficient for reducing the data in multiple ways for different purposes we then describe the features of ec2 that make this architecture both efficient to use and challenging to implement we describe the techniques we adopted to process our data and suggest ways these techniques may be improved for those interested in trying such reductions in the future finally we summarize the output photometry data products which are now hosted publicly in two places in two formats they are in simple fits tables in the highlevel science products on mast and on a queryable database available through the noao data lab | [['we', 'discuss', 'the', 'technical', 'challenges', 'we', 'faced', 'and', 'the', 'techniques', 'we', 'used', 'to', 'overcome', 'them', 'when', 'reducing', 'the', 'phat', 'photometric', 'data', 'set', 'on', 'the', 'amazon', 'elastic', 'compute', 'cloud', 'ec2', 'we', 'first', 'describe', 'the', 'architecture', 'of', 'our', 'photometry', 'pipeline', 'which', 'we', 'found', 'particularly', 'efficient', 'for', 'reducing', 'the', 'data', 'in', 'multiple', 'ways', 'for', 'different', 'purposes', 'we', 'then', 'describe', 'the', 'features', 'of', 'ec2', 'that', 'make', 'this', 'architecture', 'both', 'efficient', 'to', 'use', 'and', 'challenging', 'to', 'implement', 'we', 'describe', 'the', 'techniques', 'we', 'adopted', 'to', 'process', 'our', 'data', 'and', 'suggest', 'ways', 'these', 'techniques', 'may', 'be', 'improved', 'for', 'those', 'interested', 'in', 'trying', 'such', 'reductions', 'in', 'the', 'future', 'finally', 'we', 'summarize', 'the', 'output', 'photometry', 'data', 'products', 'which', 'are', 'now', 'hosted', 'publicly', 'in', 'two', 'places', 'in', 'two', 'formats', 'they', 'are', 'in', 'simple', 'fits', 'tables', 'in', 'the', 'highlevel', 'science', 'products', 'on', 'mast', 'and', 'on', 'a', 'queryable', 'database', 'available', 'through', 'the', 'noao', 'data', 'lab']] | [-0.06825073658475665, 0.011234280422095445, -0.08956352794393116, 0.09573740565991268, -0.09788340521924249, -0.08871839625656709, 0.06701002058319071, 0.4476137163859981, -0.2793447843433677, -0.34442584316565333, 0.14875047216989698, -0.2991878048946651, -0.12700409190794387, 0.28712112972369563, -0.08075325234167903, 0.07128874319638093, 0.12867304003777932, -0.03434476557259376, -0.03695842232538869, -0.3193269503674099, 0.30772128532204285, 0.03342499835351547, 0.29967234264147447, 0.02086385177982437, 0.051343824855260345, -0.019981968770181383, -0.11936738502585909, -0.03643040881016767, -0.1519610581975418, 0.1687847989989067, 0.3199818816908694, 0.23234898021275346, 0.22643304511357645, -0.4764732380586487, -0.1193139321753638, 0.0676034268287297, 0.1445670973613754, 0.10874237145388407, -0.04571593104018276, -0.2620047168167946, 0.06776997992049226, -0.20724689972365495, -0.1014908238548551, -0.13884500274760322, -0.008828853957120564, 0.019221614114940166, -0.24167818275534295, -0.03422832041588071, -0.04038276305825977, 0.04989675749919599, -0.08146584637697551, -0.1412566322426253, 0.03015436546329956, 0.17427939444172222, -0.014355398450979728, -0.0012898019456363224, 0.11582627892819838, -0.1458191885053216, -0.10207244113186974, 0.4031250373935783, -0.043063365089482386, -0.14287436417453772, 0.21783658941895082, -0.0532875179957885, -0.22876322655645492, 0.026155411845424793, 0.2399948594010585, 0.08512385331836718, -0.1956168332067359, 0.03442320674560131, 0.008053439637561414, 0.1477978290954175, 0.015485024293379897, 0.0033575426770856122, 0.1781496001615912, 0.1665611301330602, -0.006171423813223943, 0.15532237733470056, -0.1388123060325877, -0.04525983764649975, -0.2535799713841952, -0.1256976866544309, -0.13208337205826873, -0.02729171854313593, -0.06012268078804889, -0.10435675884356031, 0.36646440863638624, 0.2523049401824356, 0.18492124686050196, 0.023583754840945187, 0.37601275443770255, 0.028691630661621906, 0.12359096080559742, 0.10632296124069424, 0.20724826328817858, -0.017813517783696834, 0.13431911671964022, -0.13491891525194075, 0.01573195762202059, -0.026437645562528797] |
1,802.06089 | Self-organization on Riemannian manifolds | We consider an aggregation model that consists of an active transport
equation for the macroscopic population density, where the velocity has a
nonlocal functional dependence on the density, modelled via an interaction
potential. We set up the model on general Riemannian manifolds and provide a
framework for constructing interaction potentials which lead to equilibria that
are constant on their supports. We consider such potentials for two specific
cases (the two-dimensional sphere and the two-dimensional hyperbolic space) and
investigate analytically and numerically the long-time behaviour and
equilibrium solutions of the aggregation model on these manifolds. Equilibria
obtained numerically with other interaction potentials are also presented.
| nlin.AO math.AP math.DS | we consider an aggregation model that consists of an active transport equation for the macroscopic population density where the velocity has a nonlocal functional dependence on the density modelled via an interaction potential we set up the model on general riemannian manifolds and provide a framework for constructing interaction potentials which lead to equilibria that are constant on their supports we consider such potentials for two specific cases the twodimensional sphere and the twodimensional hyperbolic space and investigate analytically and numerically the longtime behaviour and equilibrium solutions of the aggregation model on these manifolds equilibria obtained numerically with other interaction potentials are also presented | [['we', 'consider', 'an', 'aggregation', 'model', 'that', 'consists', 'of', 'an', 'active', 'transport', 'equation', 'for', 'the', 'macroscopic', 'population', 'density', 'where', 'the', 'velocity', 'has', 'a', 'nonlocal', 'functional', 'dependence', 'on', 'the', 'density', 'modelled', 'via', 'an', 'interaction', 'potential', 'we', 'set', 'up', 'the', 'model', 'on', 'general', 'riemannian', 'manifolds', 'and', 'provide', 'a', 'framework', 'for', 'constructing', 'interaction', 'potentials', 'which', 'lead', 'to', 'equilibria', 'that', 'are', 'constant', 'on', 'their', 'supports', 'we', 'consider', 'such', 'potentials', 'for', 'two', 'specific', 'cases', 'the', 'twodimensional', 'sphere', 'and', 'the', 'twodimensional', 'hyperbolic', 'space', 'and', 'investigate', 'analytically', 'and', 'numerically', 'the', 'longtime', 'behaviour', 'and', 'equilibrium', 'solutions', 'of', 'the', 'aggregation', 'model', 'on', 'these', 'manifolds', 'equilibria', 'obtained', 'numerically', 'with', 'other', 'interaction', 'potentials', 'are', 'also', 'presented']] | [-0.13296201568132696, 0.07808747050246613, -0.06827254027414781, 0.06709520807131551, -0.0030951775619401955, -0.14647955989214376, -0.009589913350422509, 0.3762231315486133, -0.2575309714526296, -0.26250746121737534, 0.08075981412996323, -0.30376855860119506, -0.1680930002453701, 0.16464977193614827, 0.03195716650225222, 0.058428140522804685, 0.024710415705787733, 0.028063851639532143, -0.019921930350112513, -0.21181467740209953, 0.4047795906763685, -0.0009705937879446608, 0.2550025772160062, 0.06516685092803808, 0.10675550606818153, 0.006671725937989182, 0.04360054596327245, 0.066157143252807, -0.1958745459522526, 0.10101401490660813, 0.14876382715290395, 0.04080462591865888, 0.2295843144999638, -0.4666219658504885, -0.267596186667036, 0.0934961904780581, 0.13574188285901284, 0.10215992837262232, -0.09281270205974579, -0.2751682553341827, 0.02243172682938166, -0.15192183159076825, -0.17297529951611068, -0.14209961290292156, 0.04304602611451768, 0.07492207467797786, -0.26821010222192854, 0.09329171416706791, 0.01604447662472152, 0.024279151514817316, -0.15431264841642517, -0.08324019831958979, -0.029568581597861618, 0.11406678427010775, 0.002600602841539512, -0.03930362099065231, 0.10045264632656024, -0.1214509116879736, -0.0855182882425232, 0.3773195714725611, -0.08054800282339923, -0.29188347505763745, 0.2253099633156895, -0.08614353315743546, -0.0951650685747154, 0.07663408091936547, 0.20613112640925324, 0.16237373989917195, -0.16094575226844215, 0.1140323773025347, -0.039381552707009874, 0.11496479705405924, 0.019080665096855506, -0.031196101265847504, 0.18224748043128505, 0.15541710669640452, 0.09662150953730676, 0.13069754585852095, -0.057207687283292986, -0.18426801902331555, -0.30591422828057635, -0.12225724301802424, -0.14382922210587332, 0.061950748710212514, -0.11936836887546703, -0.20212843886558682, 0.3984119870941728, 0.09971570600366529, 0.19022762281103775, 0.09286740199380662, 0.22688515240756366, 0.15294686450733236, -0.021161061299678225, 0.0814190103376929, 0.25346281903330237, 0.11919346609367774, 0.054927511427264944, -0.22430118206494415, 0.020050649073359985, 0.07708161047104603] |
1,802.0609 | Unveiled electric profiles within hydrogen bonds suggest DNA base pairs
with similar bond strengths | Electrical forces are the background of all the interactions occurring in
biochemical systems. From here and by using a combination of ab-initio and
ad-hoc models, we introduce the first description of electric field profiles
with intrabond resolution to support a characterization of single bond forces
attending to its electrical origin. This fundamental issue has eluded a
physical description so far. Our method is applied to describe hydrogen bonds
(HB) in DNA base pairs. Numerical results reveal that base pairs in DNA could
be equivalent considering HB strength contributions, which challenges previous
interpretations of thermodynamic properties of DNA based on the assumption that
Adenine/Thymine pairs are weaker than Guanine/Cytosine pairs due to the sole
difference in the number of HB. Thus, our methodology provides solid
foundations to support the development of extended models intended to go deeper
into the molecular mechanisms of DNA functioning.
| q-bio.BM physics.bio-ph | electrical forces are the background of all the interactions occurring in biochemical systems from here and by using a combination of abinitio and adhoc models we introduce the first description of electric field profiles with intrabond resolution to support a characterization of single bond forces attending to its electrical origin this fundamental issue has eluded a physical description so far our method is applied to describe hydrogen bonds hb in dna base pairs numerical results reveal that base pairs in dna could be equivalent considering hb strength contributions which challenges previous interpretations of thermodynamic properties of dna based on the assumption that adeninethymine pairs are weaker than guaninecytosine pairs due to the sole difference in the number of hb thus our methodology provides solid foundations to support the development of extended models intended to go deeper into the molecular mechanisms of dna functioning | [['electrical', 'forces', 'are', 'the', 'background', 'of', 'all', 'the', 'interactions', 'occurring', 'in', 'biochemical', 'systems', 'from', 'here', 'and', 'by', 'using', 'a', 'combination', 'of', 'abinitio', 'and', 'adhoc', 'models', 'we', 'introduce', 'the', 'first', 'description', 'of', 'electric', 'field', 'profiles', 'with', 'intrabond', 'resolution', 'to', 'support', 'a', 'characterization', 'of', 'single', 'bond', 'forces', 'attending', 'to', 'its', 'electrical', 'origin', 'this', 'fundamental', 'issue', 'has', 'eluded', 'a', 'physical', 'description', 'so', 'far', 'our', 'method', 'is', 'applied', 'to', 'describe', 'hydrogen', 'bonds', 'hb', 'in', 'dna', 'base', 'pairs', 'numerical', 'results', 'reveal', 'that', 'base', 'pairs', 'in', 'dna', 'could', 'be', 'equivalent', 'considering', 'hb', 'strength', 'contributions', 'which', 'challenges', 'previous', 'interpretations', 'of', 'thermodynamic', 'properties', 'of', 'dna', 'based', 'on', 'the', 'assumption', 'that', 'adeninethymine', 'pairs', 'are', 'weaker', 'than', 'guaninecytosine', 'pairs', 'due', 'to', 'the', 'sole', 'difference', 'in', 'the', 'number', 'of', 'hb', 'thus', 'our', 'methodology', 'provides', 'solid', 'foundations', 'to', 'support', 'the', 'development', 'of', 'extended', 'models', 'intended', 'to', 'go', 'deeper', 'into', 'the', 'molecular', 'mechanisms', 'of', 'dna', 'functioning']] | [-0.11888024578253004, 0.08628986770300273, -0.07436994984819764, 0.05143290860775176, -0.08154828623789821, -0.11196209784124939, 0.09767893278105579, 0.37283202206952054, -0.24420286392347074, -0.28255183794404526, 0.0010342482763545876, -0.2528302047768949, -0.14260985466166282, 0.18244702577538474, -0.013696927262443892, -0.01997829062747769, 0.06823612188897424, -0.0019780966891041417, -0.0015836323719655334, -0.19519547135896062, 0.2778423589869061, 0.06521554043660806, 0.2994513697577903, 0.0818314370453279, 0.03644270153427628, -0.02093523958514274, -0.019365367471424103, 0.022723411905093933, -0.12333111075447088, 0.18131765646410739, 0.23295876478947886, 0.11289945281189408, 0.2515404755118447, -0.4844651103649341, -0.2581480405896797, 0.07844109495472111, 0.1441430935478756, 0.13360886104014688, -0.022331487811268896, -0.24085849107728458, 0.0963381846455044, -0.14083902691130223, -0.11909248578094904, -0.07741166860796511, 0.01540388315211011, 0.07184226367898075, -0.20314703431164086, 0.06038481477339765, 0.06406915966301671, 0.10486422487678872, -0.08196503352488614, -0.1349043404932698, -0.03180031874872954, 0.14064343667484192, 0.04583894470083514, 0.009397745483331906, 0.1888410213213204, -0.12024335721409289, -0.1261481002209262, 0.4018538237457544, -0.024708189723318816, -0.17880675991551137, 0.24703286065470795, -0.10700803020359083, -0.1374131936389743, 0.1521040857966307, 0.11957659449061038, 0.08147697162861169, -0.1906190490166486, 0.04250047154786905, 0.018831994633754373, 0.18466659194566834, 0.057583069041843564, 0.03957483914195442, 0.24793735893548163, 0.18150782808136773, -0.004813615186795802, 0.12485516140594895, -0.06846361176248535, -0.10839054947161496, -0.2610839613529683, -0.1507982284848867, -0.13136995857512632, 0.06391237383301725, -0.007552854014801609, -0.1672161507721938, 0.3634687985595263, 0.15907389972962335, 0.18405380139781083, 0.004023362035554847, 0.3004125319388498, 0.03408650169968867, 0.09353443787393856, -0.007702533467213663, 0.24003730921573202, 0.17461873098558575, 0.06735786517367134, -0.20100815724220755, 0.09073915337474728, 0.047337452544909446] |
1,802.06091 | Bridging Cognitive Programs and Machine Learning | While great advances are made in pattern recognition and machine learning,
the successes of such fields remain restricted to narrow applications and seem
to break down when training data is scarce, a shift in domain occurs, or when
intelligent reasoning is required for rapid adaptation to new environments. In
this work, we list several of the shortcomings of modern machine-learning
solutions, specifically in the contexts of computer vision and in reinforcement
learning and suggest directions to explore in order to try to ameliorate these
weaknesses.
| cs.LG cs.AI cs.CV | while great advances are made in pattern recognition and machine learning the successes of such fields remain restricted to narrow applications and seem to break down when training data is scarce a shift in domain occurs or when intelligent reasoning is required for rapid adaptation to new environments in this work we list several of the shortcomings of modern machinelearning solutions specifically in the contexts of computer vision and in reinforcement learning and suggest directions to explore in order to try to ameliorate these weaknesses | [['while', 'great', 'advances', 'are', 'made', 'in', 'pattern', 'recognition', 'and', 'machine', 'learning', 'the', 'successes', 'of', 'such', 'fields', 'remain', 'restricted', 'to', 'narrow', 'applications', 'and', 'seem', 'to', 'break', 'down', 'when', 'training', 'data', 'is', 'scarce', 'a', 'shift', 'in', 'domain', 'occurs', 'or', 'when', 'intelligent', 'reasoning', 'is', 'required', 'for', 'rapid', 'adaptation', 'to', 'new', 'environments', 'in', 'this', 'work', 'we', 'list', 'several', 'of', 'the', 'shortcomings', 'of', 'modern', 'machinelearning', 'solutions', 'specifically', 'in', 'the', 'contexts', 'of', 'computer', 'vision', 'and', 'in', 'reinforcement', 'learning', 'and', 'suggest', 'directions', 'to', 'explore', 'in', 'order', 'to', 'try', 'to', 'ameliorate', 'these', 'weaknesses']] | [-0.049039720502846385, 0.05802772932631128, -0.025919398325769342, 0.06219482455840882, -0.1647156691069112, -0.15954599845606615, 0.040304839817861864, 0.45777453613631863, -0.31319003472762075, -0.3640733363873818, 0.12964711193104878, -0.2356804763624335, -0.15054513200953165, 0.18765797730918754, -0.18221155580900172, 0.08897774397606982, 0.07469130702974165, 0.014428070938105093, -0.07214708788703908, -0.275707908763605, 0.29169741706813085, -0.004695984085693079, 0.32008421658812203, 0.058279469225774795, 0.05512332682847045, -0.03710459702483872, -0.009653009468799129, -0.026442329497898327, -0.0870002811665044, 0.1744162570027744, 0.3795884920831989, 0.1957412173081299, 0.3794236584621317, -0.45210320451022945, -0.23143449921763556, 0.13350088986403802, 0.21007076067411723, 0.16433164198773312, -0.07682994311154985, -0.2715735242647283, 0.10135923345669118, -0.14423909022965853, -0.07899508940822939, -0.1421060749767896, 0.04588263269294711, 0.008702588792862918, -0.22247849206357975, -0.016473497072344318, 0.08543804446372258, 0.10674283356570145, -0.016192527549505672, -0.09748750120291814, 0.11861475199899253, 0.15610084686606354, 0.12248077842352145, 0.05326548668432652, 0.1231727560489055, -0.25242427672216283, -0.14543509084101328, 0.40597969113903887, 0.0007230365457122817, -0.14278797386761974, 0.2712421605582623, -0.05904410912052673, -0.22187736093011848, 0.07001444586169193, 0.24186153085902334, 0.07815889135441359, -0.13513568534193943, 0.06145575671895024, 0.07662839697509566, 0.1328061370891245, 0.051028454725575795, -0.014880128017188434, 0.22457560069434454, 0.2028616563526585, 0.02968730385250905, 0.08541439441306627, -0.07262885805137237, -0.1220079594236963, -0.19813988403800656, -0.12079209743396324, -0.14459070209961603, -0.022861912030288402, -0.02071840105619391, -0.11185270235052004, 0.36080914074007203, 0.25781851460171096, 0.21323377737665877, 0.03074010543196517, 0.32326110046466483, 0.02962084000601488, 0.13389806034974755, 0.07014252898447654, 0.23586646087659413, 0.06067934164448696, 0.17223781579831504, -0.16242697046357482, 0.05069186737870469, -0.05573101394453689] |
1,802.06092 | Four moments theorems on Markov chaos | We obtain quantitative Four Moments Theorems establishing convergence of the
laws of elements of a Markov chaos to a Pearson distribution, where the only
assumption we make on the Pearson distribution is that it admits four moments.
While in general one cannot use moments to establish convergence to a
heavy-tailed distributions, we provide a context in which only the first four
moments suffices. These results are obtained by proving a general carr\'e du
champ bound on the distance between laws of random variables in the domain of a
Markov diffusion generator and invariant measures of diffusions. For elements
of a Markov chaos, this bound can be reduced to just the first four moments.
| math.PR | we obtain quantitative four moments theorems establishing convergence of the laws of elements of a markov chaos to a pearson distribution where the only assumption we make on the pearson distribution is that it admits four moments while in general one cannot use moments to establish convergence to a heavytailed distributions we provide a context in which only the first four moments suffices these results are obtained by proving a general carre du champ bound on the distance between laws of random variables in the domain of a markov diffusion generator and invariant measures of diffusions for elements of a markov chaos this bound can be reduced to just the first four moments | [['we', 'obtain', 'quantitative', 'four', 'moments', 'theorems', 'establishing', 'convergence', 'of', 'the', 'laws', 'of', 'elements', 'of', 'a', 'markov', 'chaos', 'to', 'a', 'pearson', 'distribution', 'where', 'the', 'only', 'assumption', 'we', 'make', 'on', 'the', 'pearson', 'distribution', 'is', 'that', 'it', 'admits', 'four', 'moments', 'while', 'in', 'general', 'one', 'can', 'not', 'use', 'moments', 'to', 'establish', 'convergence', 'to', 'a', 'heavytailed', 'distributions', 'we', 'provide', 'a', 'context', 'in', 'which', 'only', 'the', 'first', 'four', 'moments', 'suffices', 'these', 'results', 'are', 'obtained', 'by', 'proving', 'a', 'general', 'carre', 'du', 'champ', 'bound', 'on', 'the', 'distance', 'between', 'laws', 'of', 'random', 'variables', 'in', 'the', 'domain', 'of', 'a', 'markov', 'diffusion', 'generator', 'and', 'invariant', 'measures', 'of', 'diffusions', 'for', 'elements', 'of', 'a', 'markov', 'chaos', 'this', 'bound', 'can', 'be', 'reduced', 'to', 'just', 'the', 'first', 'four', 'moments']] | [-0.1138761180265104, 0.09934321620599612, -0.13563413356773948, 0.12045038822964814, -0.04537978093139827, -0.10428212731341391, 0.04799106390942542, 0.33481610321292754, -0.27287209648312183, -0.24483251576556972, 0.12103386702559267, -0.28678702532003325, -0.10363481143946972, 0.16818508262370238, -0.03413967161619088, 0.05723203510237988, 0.01770908611401785, 0.05296305733505154, -0.09274661288343436, -0.24860179845831895, 0.3146821059646052, 0.01687783457077386, 0.26021757116132793, -0.002261845162138343, 0.13076813663601092, -0.014675712315038893, -0.019934177153596754, 0.0019408178499393295, -0.1294111319056946, 0.1519380196716571, 0.1975703054606065, 0.11208856612721686, 0.2586448969638073, -0.36730346519892154, -0.1679868381388747, 0.13711399843573177, 0.10441262793692499, 0.08957318503005234, -0.013371308941778057, -0.3058121714071093, 0.08836973901315216, -0.12345772990630123, -0.13292242261875226, -0.10694787157045905, -0.005125785985830845, 0.10317877906307235, -0.35855511295315073, 0.07746362212326444, 0.1344714262441062, 0.06242624167843085, 0.003564524713478852, -0.12131960303400104, 0.013204434649659353, 0.1227956091976937, 0.045769100933205006, -0.029813330779832444, 0.056738236954787, -0.06599677644369781, -0.14060925541592664, 0.32505406826538474, -0.10868033542085373, -0.25629647380035175, 0.16812048048156789, -0.21404974282261702, -0.20971789252290732, 0.08892895300921641, 0.16832437969972952, 0.14602813050314262, -0.18908355483915984, 0.07849750398982953, -0.03341702208037309, 0.145421915438451, 0.06378154237264473, 0.017741524460194467, 0.12102013740999003, 0.09399231435044815, 0.13523431996643348, 0.12678208648280256, -0.05805063904508164, -0.13908417924642236, -0.32205823805640665, -0.19959522441148006, -0.23391397937462388, 0.07521767653088318, -0.1437360341332622, -0.18745438208836213, 0.3687229259593183, 0.12235474549928321, 0.18810101293778994, 0.11552628276873739, 0.2154884398874026, 0.15342122339235062, 0.005573534206568934, 0.09314991286016282, 0.1984330386989505, 0.19197037167593903, 0.07024284633562754, -0.12465861323289573, 0.13731598776863202, 0.14205647042642036] |
1,802.06093 | Gradient descent with identity initialization efficiently learns
positive definite linear transformations by deep residual networks | We analyze algorithms for approximating a function $f(x) = \Phi x$ mapping
$\Re^d$ to $\Re^d$ using deep linear neural networks, i.e. that learn a
function $h$ parameterized by matrices $\Theta_1,...,\Theta_L$ and defined by
$h(x) = \Theta_L \Theta_{L-1} ... \Theta_1 x$. We focus on algorithms that
learn through gradient descent on the population quadratic loss in the case
that the distribution over the inputs is isotropic.
We provide polynomial bounds on the number of iterations for gradient descent
to approximate the least squares matrix $\Phi$, in the case where the initial
hypothesis $\Theta_1 = ... = \Theta_L = I$ has excess loss bounded by a small
enough constant. On the other hand, we show that gradient descent fails to
converge for $\Phi$ whose distance from the identity is a larger constant, and
we show that some forms of regularization toward the identity in each layer do
not help.
If $\Phi$ is symmetric positive definite, we show that an algorithm that
initializes $\Theta_i = I$ learns an $\epsilon$-approximation of $f$ using a
number of updates polynomial in $L$, the condition number of $\Phi$, and
$\log(d/\epsilon)$. In contrast, we show that if the least squares matrix
$\Phi$ is symmetric and has a negative eigenvalue, then all members of a class
of algorithms that perform gradient descent with identity initialization, and
optionally regularize toward the identity in each layer, fail to converge.
We analyze an algorithm for the case that $\Phi$ satisfies $u^{\top} \Phi u >
0$ for all $u$, but may not be symmetric. This algorithm uses two regularizers:
one that maintains the invariant $u^{\top} \Theta_L \Theta_{L-1} ... \Theta_1 u
> 0$ for all $u$, and another that "balances" $\Theta_1, ..., \Theta_L$ so that
they have the same singular values.
| cs.LG cs.NE math.OC math.ST stat.ML stat.TH | we analyze algorithms for approximating a function fx phi x mapping red to red using deep linear neural networks ie that learn a function h parameterized by matrices theta_1theta_l and defined by hx theta_l theta_l1 theta_1 x we focus on algorithms that learn through gradient descent on the population quadratic loss in the case that the distribution over the inputs is isotropic we provide polynomial bounds on the number of iterations for gradient descent to approximate the least squares matrix phi in the case where the initial hypothesis theta_1 theta_l i has excess loss bounded by a small enough constant on the other hand we show that gradient descent fails to converge for phi whose distance from the identity is a larger constant and we show that some forms of regularization toward the identity in each layer do not help if phi is symmetric positive definite we show that an algorithm that initializes theta_i i learns an epsilonapproximation of f using a number of updates polynomial in l the condition number of phi and logdepsilon in contrast we show that if the least squares matrix phi is symmetric and has a negative eigenvalue then all members of a class of algorithms that perform gradient descent with identity initialization and optionally regularize toward the identity in each layer fail to converge we analyze an algorithm for the case that phi satisfies utop phi u 0 for all u but may not be symmetric this algorithm uses two regularizers one that maintains the invariant utop theta_l theta_l1 theta_1 u 0 for all u and another that balances theta_1 theta_l so that they have the same singular values | [['we', 'analyze', 'algorithms', 'for', 'approximating', 'a', 'function', 'fx', 'phi', 'x', 'mapping', 'red', 'to', 'red', 'using', 'deep', 'linear', 'neural', 'networks', 'ie', 'that', 'learn', 'a', 'function', 'h', 'parameterized', 'by', 'matrices', 'theta_1theta_l', 'and', 'defined', 'by', 'hx', 'theta_l', 'theta_l1', 'theta_1', 'x', 'we', 'focus', 'on', 'algorithms', 'that', 'learn', 'through', 'gradient', 'descent', 'on', 'the', 'population', 'quadratic', 'loss', 'in', 'the', 'case', 'that', 'the', 'distribution', 'over', 'the', 'inputs', 'is', 'isotropic', 'we', 'provide', 'polynomial', 'bounds', 'on', 'the', 'number', 'of', 'iterations', 'for', 'gradient', 'descent', 'to', 'approximate', 'the', 'least', 'squares', 'matrix', 'phi', 'in', 'the', 'case', 'where', 'the', 'initial', 'hypothesis', 'theta_1', 'theta_l', 'i', 'has', 'excess', 'loss', 'bounded', 'by', 'a', 'small', 'enough', 'constant', 'on', 'the', 'other', 'hand', 'we', 'show', 'that', 'gradient', 'descent', 'fails', 'to', 'converge', 'for', 'phi', 'whose', 'distance', 'from', 'the', 'identity', 'is', 'a', 'larger', 'constant', 'and', 'we', 'show', 'that', 'some', 'forms', 'of', 'regularization', 'toward', 'the', 'identity', 'in', 'each', 'layer', 'do', 'not', 'help', 'if', 'phi', 'is', 'symmetric', 'positive', 'definite', 'we', 'show', 'that', 'an', 'algorithm', 'that', 'initializes', 'theta_i', 'i', 'learns', 'an', 'epsilonapproximation', 'of', 'f', 'using', 'a', 'number', 'of', 'updates', 'polynomial', 'in', 'l', 'the', 'condition', 'number', 'of', 'phi', 'and', 'logdepsilon', 'in', 'contrast', 'we', 'show', 'that', 'if', 'the', 'least', 'squares', 'matrix', 'phi', 'is', 'symmetric', 'and', 'has', 'a', 'negative', 'eigenvalue', 'then', 'all', 'members', 'of', 'a', 'class', 'of', 'algorithms', 'that', 'perform', 'gradient', 'descent', 'with', 'identity', 'initialization', 'and', 'optionally', 'regularize', 'toward', 'the', 'identity', 'in', 'each', 'layer', 'fail', 'to', 'converge', 'we', 'analyze', 'an', 'algorithm', 'for', 'the', 'case', 'that', 'phi', 'satisfies', 'utop', 'phi', 'u', '0', 'for', 'all', 'u', 'but', 'may', 'not', 'be', 'symmetric', 'this', 'algorithm', 'uses', 'two', 'regularizers', 'one', 'that', 'maintains', 'the', 'invariant', 'utop', 'theta_l', 'theta_l1', 'theta_1', 'u', '0', 'for', 'all', 'u', 'and', 'another', 'that', 'balances', 'theta_1', 'theta_l', 'so', 'that', 'they', 'have', 'the', 'same', 'singular', 'values']] | [-0.12322529393241387, 0.09850702343681077, -0.08897941136849542, 0.04354517154500397, -0.06853663573570797, -0.20918929432020472, 0.011599377956244807, 0.42212535621945463, -0.3210711533004397, -0.21683055452995578, 0.07557620644411313, -0.29433814973683814, -0.16601423827958778, 0.14200720325502397, -0.0460966510394918, 0.030636101637718207, 0.06570466493197967, 0.08459708126310372, -0.11138034367554124, -0.26606138158981374, 0.31070023702072647, -0.04240193597148035, 0.17162225740122766, 0.007644436997554791, 0.153058383514163, -0.004920122855449459, 0.0459591095349528, 0.013972426396949265, -0.11124911735395877, 0.06506595498198348, 0.19266046648003107, 0.17927986176553906, 0.33488554788780883, -0.36309889051332944, -0.1201270215197834, 0.21511108059147407, 0.1433840063185778, 0.010788178476900192, -0.0359036408835589, -0.2112988596584483, 0.15545938219282282, -0.11181441132955226, -0.09540383945428853, -0.07312184006209413, 0.036497508656797156, 0.042199362144973884, -0.3539142154030007, 0.046951126577882474, 0.07367136288602662, 0.006517021336018819, -0.022371479777474904, -0.19708027784039037, -0.0192365425009954, 0.08472287329772961, 0.04117717248528536, 0.11651326591240042, 0.10433474883980141, -0.1267930856756385, -0.04005396900341135, 0.3199932009464549, -0.11923882541696909, -0.25116649938822894, 0.10178826920554124, -0.12710758523733742, -0.15510732298149862, 0.09746337857705668, 0.15994536696299155, 0.1483527332182623, -0.079901334508305, 0.13931301294102563, -0.10072813547350384, 0.16830391624239635, 0.07026449218048711, -0.03932993337718213, 0.09602504090330395, 0.04367962574739953, 0.1665130023246569, 0.11270064990636738, -0.07579116433742027, -0.06517851105942718, -0.3308484014811001, -0.13765251112561003, -0.19882294291766134, 0.06035913872359427, -0.12951379966618393, -0.16463588620031278, 0.3425024840525417, 0.11680369705135325, 0.26677172193887927, 0.12677283880792256, 0.272855933463524, 0.11130603173287153, 0.07669820426705523, 0.14831433751245762, 0.17725268271513286, 0.11711510153044001, 0.05739275153728058, -0.20764367479995938, 0.09755074740576514, 0.11054417038630872] |
1,802.06094 | Examining the rank of Semi-definite Programming for Power System State
Estimation | In the power system, state estimation (SE) is important monitoring task for
the reliable operation of the system. The optimal estimate from the SE is
delivered to all EMS application such as fault analysis, automatic generation
control. Hence, it is crucial to have good estimation before taking any
critical actions. However, the SE problem is challenging problem due to
nonconvexity of power flow equations in the nonlinear AC power flow model,
which give us a usually local solution. To deal with this nonconvexity, some
recent literatures applied the convex semi-definite (SDP) relaxation technique
to relax the SE problem attaining or approximating a global solution. In this
paper, we investigate the rank of this technique, which is critical to yield a
physically meaningful solution with the five-bus test system and propose new
approach to possibly reduce the rank by complementing the traditional set of
measurement with PMU data. Numerical tests on the standard IEEE 14, 30, 57,
118-bus test system are presented for the demonstration.
| math.OC | in the power system state estimation se is important monitoring task for the reliable operation of the system the optimal estimate from the se is delivered to all ems application such as fault analysis automatic generation control hence it is crucial to have good estimation before taking any critical actions however the se problem is challenging problem due to nonconvexity of power flow equations in the nonlinear ac power flow model which give us a usually local solution to deal with this nonconvexity some recent literatures applied the convex semidefinite sdp relaxation technique to relax the se problem attaining or approximating a global solution in this paper we investigate the rank of this technique which is critical to yield a physically meaningful solution with the fivebus test system and propose new approach to possibly reduce the rank by complementing the traditional set of measurement with pmu data numerical tests on the standard ieee 14 30 57 118bus test system are presented for the demonstration | [['in', 'the', 'power', 'system', 'state', 'estimation', 'se', 'is', 'important', 'monitoring', 'task', 'for', 'the', 'reliable', 'operation', 'of', 'the', 'system', 'the', 'optimal', 'estimate', 'from', 'the', 'se', 'is', 'delivered', 'to', 'all', 'ems', 'application', 'such', 'as', 'fault', 'analysis', 'automatic', 'generation', 'control', 'hence', 'it', 'is', 'crucial', 'to', 'have', 'good', 'estimation', 'before', 'taking', 'any', 'critical', 'actions', 'however', 'the', 'se', 'problem', 'is', 'challenging', 'problem', 'due', 'to', 'nonconvexity', 'of', 'power', 'flow', 'equations', 'in', 'the', 'nonlinear', 'ac', 'power', 'flow', 'model', 'which', 'give', 'us', 'a', 'usually', 'local', 'solution', 'to', 'deal', 'with', 'this', 'nonconvexity', 'some', 'recent', 'literatures', 'applied', 'the', 'convex', 'semidefinite', 'sdp', 'relaxation', 'technique', 'to', 'relax', 'the', 'se', 'problem', 'attaining', 'or', 'approximating', 'a', 'global', 'solution', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'rank', 'of', 'this', 'technique', 'which', 'is', 'critical', 'to', 'yield', 'a', 'physically', 'meaningful', 'solution', 'with', 'the', 'fivebus', 'test', 'system', 'and', 'propose', 'new', 'approach', 'to', 'possibly', 'reduce', 'the', 'rank', 'by', 'complementing', 'the', 'traditional', 'set', 'of', 'measurement', 'with', 'pmu', 'data', 'numerical', 'tests', 'on', 'the', 'standard', 'ieee', '14', '30', '57', '118bus', 'test', 'system', 'are', 'presented', 'for', 'the', 'demonstration']] | [-0.1079758376374475, -0.03396990435895013, -0.046171335303481734, 0.021727480032864066, -0.06878387447635134, -0.17320184283632717, 0.056609418952374785, 0.30926054023689037, -0.2892041828631898, -0.3394900545295031, 0.17958468782781206, -0.2661095594707305, -0.13063681705039212, 0.214357898996263, -0.10164421725663945, 0.1369001097102975, 0.0717132220063837, 0.01483521467371861, -0.05957365430251586, -0.25702133252245424, 0.27761857744386315, 0.07774565076352628, 0.33360862667940877, 0.046005358233865055, 0.097041862471132, 0.01496776097105599, -0.02272135183283705, 0.03034387932278993, -0.08445018311273993, 0.12493572995192342, 0.2934582856729444, 0.1840942528390217, 0.3093131445462535, -0.398966469996226, -0.2045590921227986, 0.11007920278741927, 0.094196943722971, 0.10347778442675716, -0.04160584336749501, -0.23810272141605432, 0.12581980163002945, -0.18254424816146037, -0.08457147910836742, -0.08641799452480363, -0.025491134364992105, -0.013619693005428953, -0.3154704016179812, 0.07721820529093223, 0.03960636888821381, 0.030175706488794526, -0.09956753674603176, -0.08168316377966774, 0.051037398219091444, 0.10802109275681704, 0.05001862343912087, 0.05709966853620953, 0.11354832538293583, -0.08394793670573072, -0.08941729165945042, 0.38964766284388036, 0.006559763491893633, -0.21614281257594495, 0.18336306031839064, -0.0892401944154565, -0.12977366116857786, 0.13731145250262475, 0.2156810934535382, 0.11558823613985585, -0.17153935366384457, 0.05206952819513568, -0.023269395249684348, 0.17774674452289915, 0.020869910471324176, 0.0048193995458033915, 0.1497400153008364, 0.19055812363512814, 0.14923020070161602, 0.12758355104918678, -0.05697579153254914, -0.07707959640359768, -0.2500208779902375, -0.1471669257395655, -0.17087081945829802, 0.04429882587336484, -0.07970343891842264, -0.13521151478613722, 0.4083818283183443, 0.17542623449674918, 0.15076669107656926, 0.055869769368554964, 0.341468734355312, 0.1649498751779277, 0.020127546152191384, 0.06754334025803461, 0.2504876194519285, 0.10166428055031443, 0.12857419137551557, -0.242587540437256, 0.06809028594803203, 0.06519534474701558] |
1,802.06095 | Mining Sub-Interval Relationships In Time Series Data | Time-series data is being increasingly collected and stud- ied in several
areas such as neuroscience, climate science, transportation, and social media.
Discovery of complex patterns of relationships between individual time-series,
using data-driven approaches can improve our understanding of real-world
systems. While traditional approaches typically study relationships between two
entire time series, many interesting relationships in real-world applications
exist in small sub-intervals of time while remaining absent or feeble during
other sub-intervals. In this paper, we define the notion of a sub-interval
relationship (SIR) to capture inter- actions between two time series that are
prominent only in certain sub-intervals of time. We propose a novel and
efficient approach to find most interesting SIR in a pair of time series. We
evaluate our proposed approach on two real-world datasets from climate science
and neuroscience domain and demonstrated the scalability and computational
efficiency of our proposed approach. We further evaluated our discovered SIRs
based on a randomization based procedure. Our results indicated the existence
of several such relationships that are statistically significant, some of which
were also found to have physical interpretation.
| stat.ML cs.IR cs.LG | timeseries data is being increasingly collected and stud ied in several areas such as neuroscience climate science transportation and social media discovery of complex patterns of relationships between individual timeseries using datadriven approaches can improve our understanding of realworld systems while traditional approaches typically study relationships between two entire time series many interesting relationships in realworld applications exist in small subintervals of time while remaining absent or feeble during other subintervals in this paper we define the notion of a subinterval relationship sir to capture inter actions between two time series that are prominent only in certain subintervals of time we propose a novel and efficient approach to find most interesting sir in a pair of time series we evaluate our proposed approach on two realworld datasets from climate science and neuroscience domain and demonstrated the scalability and computational efficiency of our proposed approach we further evaluated our discovered sirs based on a randomization based procedure our results indicated the existence of several such relationships that are statistically significant some of which were also found to have physical interpretation | [['timeseries', 'data', 'is', 'being', 'increasingly', 'collected', 'and', 'stud', 'ied', 'in', 'several', 'areas', 'such', 'as', 'neuroscience', 'climate', 'science', 'transportation', 'and', 'social', 'media', 'discovery', 'of', 'complex', 'patterns', 'of', 'relationships', 'between', 'individual', 'timeseries', 'using', 'datadriven', 'approaches', 'can', 'improve', 'our', 'understanding', 'of', 'realworld', 'systems', 'while', 'traditional', 'approaches', 'typically', 'study', 'relationships', 'between', 'two', 'entire', 'time', 'series', 'many', 'interesting', 'relationships', 'in', 'realworld', 'applications', 'exist', 'in', 'small', 'subintervals', 'of', 'time', 'while', 'remaining', 'absent', 'or', 'feeble', 'during', 'other', 'subintervals', 'in', 'this', 'paper', 'we', 'define', 'the', 'notion', 'of', 'a', 'subinterval', 'relationship', 'sir', 'to', 'capture', 'inter', 'actions', 'between', 'two', 'time', 'series', 'that', 'are', 'prominent', 'only', 'in', 'certain', 'subintervals', 'of', 'time', 'we', 'propose', 'a', 'novel', 'and', 'efficient', 'approach', 'to', 'find', 'most', 'interesting', 'sir', 'in', 'a', 'pair', 'of', 'time', 'series', 'we', 'evaluate', 'our', 'proposed', 'approach', 'on', 'two', 'realworld', 'datasets', 'from', 'climate', 'science', 'and', 'neuroscience', 'domain', 'and', 'demonstrated', 'the', 'scalability', 'and', 'computational', 'efficiency', 'of', 'our', 'proposed', 'approach', 'we', 'further', 'evaluated', 'our', 'discovered', 'sirs', 'based', 'on', 'a', 'randomization', 'based', 'procedure', 'our', 'results', 'indicated', 'the', 'existence', 'of', 'several', 'such', 'relationships', 'that', 'are', 'statistically', 'significant', 'some', 'of', 'which', 'were', 'also', 'found', 'to', 'have', 'physical', 'interpretation']] | [-0.10433202263425682, 0.03411785424452837, -0.07705312800156629, 0.0734732400953728, -0.08329145695530295, -0.12226161566906343, 0.06012834958516207, 0.4244172204618847, -0.25798519607568315, -0.3495261735652246, 0.11199319052156165, -0.28732913556409867, -0.250496023497154, 0.2475247944574465, -0.06479571988108937, 0.06660885842290691, 0.0858603465037847, 0.006898588350032295, -0.01850885281068736, -0.27431594718809565, 0.27254381336209327, -0.009944819267735135, 0.3149931812450789, 0.05605170599252568, 0.08095476373980685, -0.03849933464756475, -0.10699180736728064, 0.016586724554277, -0.0900370987167474, 0.1555767092494783, 0.31586368764781875, 0.19992979458798577, 0.343215512983272, -0.4485667498064274, -0.25415213566856176, 0.11253911949558881, 0.14438829651784005, 0.04219980305459093, -0.030224763017600433, -0.2976758822580206, 0.04260822815961054, -0.13978834261378928, -0.030385885894943714, -0.11149626958324423, 0.05284422152680891, 0.031616042059190656, -0.23787442591644864, 0.06357197193334571, 0.02970763425571667, 0.10679558762472757, -0.033356502924020814, -0.11451918685382138, 0.0009098345278528149, 0.16816241236263105, 0.09046834802148375, -0.04426052137121933, 0.09131827590175431, -0.0958864519696708, -0.16127382707912163, 0.36095814602501564, -0.023718136609870127, -0.15052179872531798, 0.26347965554349834, -0.11467170983932747, -0.17798026427418492, 0.0687996608246763, 0.22845884444264894, 0.1114301143900892, -0.18764968874458451, 0.011954763033375268, -0.0399492548143897, 0.17647128978382545, 0.07781178775820985, 0.021987659513284373, 0.16316749577478157, 0.2198433721920621, 0.03267873949650935, 0.10344995744949123, -0.08741789894157698, -0.1398740139680618, -0.2396504222077198, -0.12717446538115013, -0.15779014586278514, -0.015279907444439952, -0.11153629289724729, -0.14478739409306862, 0.4012121976201693, 0.23223565337973304, 0.19715377085389538, 0.05155702593135413, 0.28514445927540394, 0.0483801765845407, 0.03575270398462701, 0.06210120988739186, 0.16909621249934445, 0.03380363786920863, 0.12563267934224542, -0.17364669762462034, 0.08796173508939796, 0.005514485753718867] |
1,802.06096 | Rho-meson properties in medium | Properties of $\rho$-meson in symmetric nuclear matter are investigated in a
light-front constituent quark model (LFCQM), using the in-medium inputs
calculated by the quark-meson coupling (QMC) model. The LFCQM used in this
study was already applied for the studies of the electromagnetic properties of
$\rho$-meson in vacuum, namely, the charge~$G_0$, magnetic~$G_1$, and
quadrupole~$G_2$ form factors, electromagnetic charge radius, and
electromagnetic decay constant. We predict that the electromagnetic decay
constant, charge radius, and quadrupole moment are enhanced as increasing the
nuclear matter density, while the magnetic moment is slightly quenched.
Furthermore, we predict that the value $Q^2_{\rm zero}$, which crosses zero of
the charge form factor, $G_0(Q^2_{\rm zero})=0$ ($Q^2 = -q^2 > 0$ with $q$
being the four-momentum transfer), decreases as increasing the nuclear matter
density.
| hep-ph nucl-th | properties of rhomeson in symmetric nuclear matter are investigated in a lightfront constituent quark model lfcqm using the inmedium inputs calculated by the quarkmeson coupling qmc model the lfcqm used in this study was already applied for the studies of the electromagnetic properties of rhomeson in vacuum namely the chargeg_0 magneticg_1 and quadrupoleg_2 form factors electromagnetic charge radius and electromagnetic decay constant we predict that the electromagnetic decay constant charge radius and quadrupole moment are enhanced as increasing the nuclear matter density while the magnetic moment is slightly quenched furthermore we predict that the value q2_rm zero which crosses zero of the charge form factor g_0q2_rm zero0 q2 q2 0 with q being the fourmomentum transfer decreases as increasing the nuclear matter density | [['properties', 'of', 'rhomeson', 'in', 'symmetric', 'nuclear', 'matter', 'are', 'investigated', 'in', 'a', 'lightfront', 'constituent', 'quark', 'model', 'lfcqm', 'using', 'the', 'inmedium', 'inputs', 'calculated', 'by', 'the', 'quarkmeson', 'coupling', 'qmc', 'model', 'the', 'lfcqm', 'used', 'in', 'this', 'study', 'was', 'already', 'applied', 'for', 'the', 'studies', 'of', 'the', 'electromagnetic', 'properties', 'of', 'rhomeson', 'in', 'vacuum', 'namely', 'the', 'chargeg_0', 'magneticg_1', 'and', 'quadrupoleg_2', 'form', 'factors', 'electromagnetic', 'charge', 'radius', 'and', 'electromagnetic', 'decay', 'constant', 'we', 'predict', 'that', 'the', 'electromagnetic', 'decay', 'constant', 'charge', 'radius', 'and', 'quadrupole', 'moment', 'are', 'enhanced', 'as', 'increasing', 'the', 'nuclear', 'matter', 'density', 'while', 'the', 'magnetic', 'moment', 'is', 'slightly', 'quenched', 'furthermore', 'we', 'predict', 'that', 'the', 'value', 'q2_rm', 'zero', 'which', 'crosses', 'zero', 'of', 'the', 'charge', 'form', 'factor', 'g_0q2_rm', 'zero0', 'q2', 'q2', '0', 'with', 'q', 'being', 'the', 'fourmomentum', 'transfer', 'decreases', 'as', 'increasing', 'the', 'nuclear', 'matter', 'density']] | [-0.10189782687802247, 0.26691567947519784, -0.06107679190177281, 0.11084341293327131, -0.027004356665726183, -0.0741026052234347, 0.008961001932976168, 0.35116905046595354, -0.1861833675401443, -0.26163946729058685, -0.026312518178216986, -0.2891382126816375, -0.04133766928245708, 0.07396534271143629, 0.11882168347000192, 0.062348076075283906, -0.03681214099702567, 0.0967738730477769, -0.13884508784592026, -0.14489209768362343, 0.3374044511119946, 0.042351412539512426, 0.24854523274565107, 0.12708112021135679, 0.035912008770599455, 0.02818359041554948, 0.020228954785310078, -0.003206845211117702, -0.15861183132690682, 0.013289847482248382, 0.19019011500384264, 0.031046354417751793, 0.1897092053500967, -0.3782754471304558, -0.1786684985016078, 0.10186480637639761, 0.11643223639901222, 0.11307242632768574, -0.07778563946327668, -0.2544728864410545, 0.08612913800545542, -0.25133189537080985, -0.18277416836028382, -0.10263924988902222, 0.027122059998781246, 0.04446682010499082, -0.3056678778286708, 0.13137857510187365, -0.015898023305808084, -0.018313691568545114, -0.10593966102637982, -0.23852097995034655, -0.018115795556834693, 0.0799256733468718, 0.1455645102571491, 0.13202082911719396, 0.2354747607664726, -0.21370191267352173, -0.03928904214250398, 0.36833008639198744, -0.08644033802704791, -0.16744951488671161, 0.04327214550783352, -0.2263411136494034, -0.06719823667021879, 0.15178799330083242, 0.15769652334452308, 0.09253090394510871, -0.12836225012759284, 0.13845487427355138, -0.020229254717054636, 0.19651609083629704, 0.09333985003690093, 0.044375801676000325, 0.21171750408701867, 0.13450566120445728, -0.049552193022001596, 0.08810020729867836, -0.07115223386593289, -0.11091270437464118, -0.30391193272830064, -0.1002299871756419, -0.1920132739942963, 0.07819137605246536, -0.1084684131232187, -0.1231088381757865, 0.3581157361386123, 0.0748595464264311, 0.19881220216768147, -0.015303422948463931, 0.3052477201257469, 0.14149971385052332, 0.10308643072543634, 0.07846269961367598, 0.3199028387030397, 0.25683855296357266, 0.11755456328707731, -0.3233290949749555, 0.008269431093170986, 0.04681270215976036] |
1,802.06097 | Characterization of finite metric space by their isometric sequences | Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$
we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by
isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence
$(a_1,a_2,\ldots,a_{n})$ is called the isometric sequence of $(X,d)$. In this
article we aim to characterize finite metric spaces by their isometric
sequences under one of the following assumptions: (i) $a_k=1$ for some $k$ with
$2\leq k\leq n-2$; (ii) $a_k=2$ for some $k$ with $4\leq k\leq
\frac{1+\sqrt{1+4n}}{2}$; (iii) $a_3=2$; (iv) $a_2=a_3=3$. Furthermore, we give
some criterion on how to embed such finite metric spaces to Euclidean spaces.
We give some maximum cardinalities of subsets in the $d$-dimensional Euclidean
space with small $a_3$, which are analogue problems on a sets with few distinct
triangles discussed by Epstein, Lott, Miller and Palsson.
| math.CO | let xd be a finite metric space with xn for a positive integer k we define a_kx to be the quotient set of all ksubsets of x by isometry and we denote a_kx by a_k the sequence a_1a_2ldotsa_n is called the isometric sequence of xd in this article we aim to characterize finite metric spaces by their isometric sequences under one of the following assumptions i a_k1 for some k with 2leq kleq n2 ii a_k2 for some k with 4leq kleq frac1sqrt14n2 iii a_32 iv a_2a_33 furthermore we give some criterion on how to embed such finite metric spaces to euclidean spaces we give some maximum cardinalities of subsets in the ddimensional euclidean space with small a_3 which are analogue problems on a sets with few distinct triangles discussed by epstein lott miller and palsson | [['let', 'xd', 'be', 'a', 'finite', 'metric', 'space', 'with', 'xn', 'for', 'a', 'positive', 'integer', 'k', 'we', 'define', 'a_kx', 'to', 'be', 'the', 'quotient', 'set', 'of', 'all', 'ksubsets', 'of', 'x', 'by', 'isometry', 'and', 'we', 'denote', 'a_kx', 'by', 'a_k', 'the', 'sequence', 'a_1a_2ldotsa_n', 'is', 'called', 'the', 'isometric', 'sequence', 'of', 'xd', 'in', 'this', 'article', 'we', 'aim', 'to', 'characterize', 'finite', 'metric', 'spaces', 'by', 'their', 'isometric', 'sequences', 'under', 'one', 'of', 'the', 'following', 'assumptions', 'i', 'a_k1', 'for', 'some', 'k', 'with', '2leq', 'kleq', 'n2', 'ii', 'a_k2', 'for', 'some', 'k', 'with', '4leq', 'kleq', 'frac1sqrt14n2', 'iii', 'a_32', 'iv', 'a_2a_33', 'furthermore', 'we', 'give', 'some', 'criterion', 'on', 'how', 'to', 'embed', 'such', 'finite', 'metric', 'spaces', 'to', 'euclidean', 'spaces', 'we', 'give', 'some', 'maximum', 'cardinalities', 'of', 'subsets', 'in', 'the', 'ddimensional', 'euclidean', 'space', 'with', 'small', 'a_3', 'which', 'are', 'analogue', 'problems', 'on', 'a', 'sets', 'with', 'few', 'distinct', 'triangles', 'discussed', 'by', 'epstein', 'lott', 'miller', 'and', 'palsson']] | [-0.15700361891684675, 0.15133496024645865, -0.023732445547637298, 0.054093170452414824, -0.07569946811877583, -0.18374786354405315, 0.023921269795654298, 0.3917980766294986, -0.2814107848177279, -0.18930734700656363, 0.11495760427542816, -0.3258376370597267, -0.12482154973138376, 0.13869293993934148, -0.14936886191774243, 0.0005395509376141586, -0.0012960593265138175, 0.0930186949160013, -0.08556226295545082, -0.3304956202304229, 0.41002759718357173, -0.09924076175093091, 0.14138529094678343, 0.017737724907132553, 0.11055937944030647, 0.012397037689483031, 0.0160361658536682, 0.05710264466855241, -0.25290568978210587, 0.09910846479531181, 0.2884499558135587, 0.1849112988841769, 0.2477731363588762, -0.32232539604165894, -0.15700345669165813, 0.2511961481190826, 0.13896500484587246, -0.05063158126558436, 0.015196874967068993, -0.2665603776931539, 0.18463255067161613, -0.07196089505442047, -0.11370779569365812, -0.08455190050618765, 0.1007427999441673, 0.018910760214006093, -0.2956073173020679, -0.038510547296137065, 0.10116892482357141, 0.07797351279961211, -0.05527396412799135, -0.16340604703173153, -0.008725457318841402, 0.06213204543407362, -0.021740292892196124, 0.1146010206233276, 0.0028199693678241026, 0.02752658801461409, -0.10087528196338535, 0.36433569068103133, -0.07504929892746802, -0.2572079538857858, 0.07838623529244074, -0.1824622837287423, -0.14258860082442598, 0.08803998476902682, 0.09568673358088765, 0.18249229443455606, -0.0410193939116885, 0.19443989323742716, -0.09258820126323324, 0.075216151829949, 0.1322400610074681, 0.05553550425832881, 0.10702893064756479, 0.05416010417870449, 0.09897157040081526, 0.1610478566507844, 0.01247976624749993, 0.01808716212110454, -0.37046818894551214, -0.16013478045876986, -0.15697472729226505, 0.17483991970346638, -0.19498463795337426, -0.162566145479371, 0.293338484463415, 0.061664105292332634, 0.24010751139428607, 0.1279174468411777, 0.16921971582709566, 0.017692221783007903, -0.011233505951345694, 0.10454189449310639, 0.05590642228305928, 0.170960957811151, -0.03729386789430129, -0.15376029490262158, -0.029597638584533355, 0.21927567795479208] |
1,802.06098 | Characterization of finite colored spaces with certain conditions | A colored space is the pair $(X,r)$ of a set $X$ and a function $r$ whose
domain is $\binom{X}{2}$. Let $(X,r)$ be a finite colored space and
$Y,Z\subseteq X$. We shall write $Y\simeq_r Z$ if there exists a bijection
$f:Y\to Z$ such that $r(U)=r(f(U))$ for each $U\in\binom{Y}{2}$. We denote the
numbers of equivalence classes with respect to $\simeq_r$ contained in
$\binom{X}{2}$ and $\binom{X}{3}$ by $a_2(r)$ and $a_3(r)$, respectively. In
this paper we prove that $a_2(r)\leq a_3(r)$ when $5\leq |X|$, and show what
happens when the equality holds.
| math.CO | a colored space is the pair xr of a set x and a function r whose domain is binomx2 let xr be a finite colored space and yzsubseteq x we shall write ysimeq_r z if there exists a bijection fyto z such that rurfu for each uinbinomy2 we denote the numbers of equivalence classes with respect to simeq_r contained in binomx2 and binomx3 by a_2r and a_3r respectively in this paper we prove that a_2rleq a_3r when 5leq x and show what happens when the equality holds | [['a', 'colored', 'space', 'is', 'the', 'pair', 'xr', 'of', 'a', 'set', 'x', 'and', 'a', 'function', 'r', 'whose', 'domain', 'is', 'binomx2', 'let', 'xr', 'be', 'a', 'finite', 'colored', 'space', 'and', 'yzsubseteq', 'x', 'we', 'shall', 'write', 'ysimeq_r', 'z', 'if', 'there', 'exists', 'a', 'bijection', 'fyto', 'z', 'such', 'that', 'rurfu', 'for', 'each', 'uinbinomy2', 'we', 'denote', 'the', 'numbers', 'of', 'equivalence', 'classes', 'with', 'respect', 'to', 'simeq_r', 'contained', 'in', 'binomx2', 'and', 'binomx3', 'by', 'a_2r', 'and', 'a_3r', 'respectively', 'in', 'this', 'paper', 'we', 'prove', 'that', 'a_2rleq', 'a_3r', 'when', '5leq', 'x', 'and', 'show', 'what', 'happens', 'when', 'the', 'equality', 'holds']] | [-0.18044461232299605, 0.1595358775707726, -0.06038656797952568, 0.03461831675108092, -0.04138560925359623, -0.1536354731517629, 0.054988931539134145, 0.3703218182020534, -0.3385417346770947, -0.20056701577880467, 0.0714146165171256, -0.30921476991035235, -0.1071202299820307, 0.1543401868787045, -0.0886139546891149, -0.07754180444261202, 0.03995105629571928, 0.09882274888551389, -0.10712672699577151, -0.2701493953712858, 0.3487660143858729, -0.13278720205506453, 0.15064660040661693, 0.02692338020633309, 0.17496665472833392, 0.024644308681719195, 0.038581896686735444, 0.05181661162164229, -0.19643609714787602, 0.07287925637986821, 0.24991314267763534, 0.15845338198750353, 0.2405916390976367, -0.28871732445147175, -0.10329194071416098, 0.27610273884895903, 0.13623573761194563, -0.05809818003147554, -0.024635069482685186, -0.22856937387050727, 0.21553839348071518, -0.12799494768468997, -0.11411877989004819, -0.013905326173139306, 0.1356009480615075, 0.02367669550510935, -0.32999206496736944, -0.025128188769882306, 0.10725305269424541, 0.0492959803997133, 0.02359047004332145, -0.09124947029452485, -0.08161136525599524, 0.060657946936911546, -0.00753119211190213, 0.16357794895362204, 0.005924345334418691, -0.0896210794737085, -0.06015638764708852, 0.4026799919322515, -0.07587127413791724, -0.2500432524591302, 0.12529836893559265, -0.21590998692987248, -0.13630249369173095, 0.059979115039683305, 0.08508538172986263, 0.12868455963997313, -0.05503890453688561, 0.23224022493396218, -0.13067846088550794, 0.14744238457523096, 0.10037644029571077, 0.010415473343947759, 0.14712284193135416, 0.09320665205207963, 0.08616079454525159, 0.16088048652865183, -0.026502054017514754, 0.05248333152905196, -0.4018065143281069, -0.21164180726433793, -0.1606728099182081, 0.15130034139236578, -0.08347084096133656, -0.1314427612397151, 0.30354766269477135, 0.10501601817146039, 0.2448551579951667, 0.11620203393678634, 0.19328059329358765, 0.09479900368490071, -0.020621224975165647, 0.09846471968847208, 0.05522087906511166, 0.129716314726139, -0.01535414869729907, -0.09625687242413943, 0.003653923574930582, 0.11811247411876535] |
1,802.06099 | A problem in control of elastodynamics with piezoelectric effects | We consider an optimal control problem where the state equations are a
coupled hyperbolic-elliptic system. This system arises in elastodynamics with
piezoelectric effects -- the elastic stress tensor is a function of elastic
displacement and electric potential. The electric flux acts as the control
variable and, in addition to the state constraints, the bound constraints on
the control are considered. We develop a complete analysis for the state
equations and the control problem. The requisite regularity on the control, to
show the well-posedness of state equations, is enforced using the cost
functional. We rigorously derive the first order necessary and sufficient
conditions using adjoint equations and further study their well-posedness. For
spatially discrete (time continuous) problem, we show the convergence of our
numerical scheme. Three dimensional numerical experiments are provided showing
convergence properties of a fully discrete method and the practical
applicability of our approach.
| math.NA cs.NA math.AP math.OC | we consider an optimal control problem where the state equations are a coupled hyperbolicelliptic system this system arises in elastodynamics with piezoelectric effects the elastic stress tensor is a function of elastic displacement and electric potential the electric flux acts as the control variable and in addition to the state constraints the bound constraints on the control are considered we develop a complete analysis for the state equations and the control problem the requisite regularity on the control to show the wellposedness of state equations is enforced using the cost functional we rigorously derive the first order necessary and sufficient conditions using adjoint equations and further study their wellposedness for spatially discrete time continuous problem we show the convergence of our numerical scheme three dimensional numerical experiments are provided showing convergence properties of a fully discrete method and the practical applicability of our approach | [['we', 'consider', 'an', 'optimal', 'control', 'problem', 'where', 'the', 'state', 'equations', 'are', 'a', 'coupled', 'hyperbolicelliptic', 'system', 'this', 'system', 'arises', 'in', 'elastodynamics', 'with', 'piezoelectric', 'effects', 'the', 'elastic', 'stress', 'tensor', 'is', 'a', 'function', 'of', 'elastic', 'displacement', 'and', 'electric', 'potential', 'the', 'electric', 'flux', 'acts', 'as', 'the', 'control', 'variable', 'and', 'in', 'addition', 'to', 'the', 'state', 'constraints', 'the', 'bound', 'constraints', 'on', 'the', 'control', 'are', 'considered', 'we', 'develop', 'a', 'complete', 'analysis', 'for', 'the', 'state', 'equations', 'and', 'the', 'control', 'problem', 'the', 'requisite', 'regularity', 'on', 'the', 'control', 'to', 'show', 'the', 'wellposedness', 'of', 'state', 'equations', 'is', 'enforced', 'using', 'the', 'cost', 'functional', 'we', 'rigorously', 'derive', 'the', 'first', 'order', 'necessary', 'and', 'sufficient', 'conditions', 'using', 'adjoint', 'equations', 'and', 'further', 'study', 'their', 'wellposedness', 'for', 'spatially', 'discrete', 'time', 'continuous', 'problem', 'we', 'show', 'the', 'convergence', 'of', 'our', 'numerical', 'scheme', 'three', 'dimensional', 'numerical', 'experiments', 'are', 'provided', 'showing', 'convergence', 'properties', 'of', 'a', 'fully', 'discrete', 'method', 'and', 'the', 'practical', 'applicability', 'of', 'our', 'approach']] | [-0.15154702085419558, 0.04948193774998799, -0.07878310773068936, 0.01967396061405048, -0.06463540611407047, -0.09101837142629342, 0.018143525141769916, 0.335283541198199, -0.3167341786498178, -0.27085187644439024, 0.15848770109813712, -0.240880733071309, -0.15097302781133395, 0.17279878783705904, -0.023538536469762523, 0.13977694625241888, 0.04402895658535676, 0.015361528801602416, -0.0755194397857445, -0.23544899850740977, 0.3229886883645021, -0.01643284571926213, 0.3077666516700346, 0.06612386986186418, 0.16369879486349723, 0.004440699888315673, 0.016361539835795864, 0.03009465876190613, -0.13863204833695716, 0.0992820274639396, 0.20775397060141484, 0.07140635002805437, 0.3002472858513809, -0.4747379991927624, -0.21235678758886126, 0.07926615857286379, 0.0963723080963569, 0.12858403173999655, -0.05697123428399209, -0.2842627249839198, 0.06814609003453774, -0.12737013108562678, -0.15888296072241953, -0.12466259517855684, -0.04805664447808845, 0.06274151895680309, -0.3395375108682654, 0.10871756873449259, 0.03692738039212094, 0.022010172563669685, -0.19872321076480956, -0.05565353555559543, -0.02994785267057725, 0.10367240380340566, 0.031934649521038715, -0.02373086568129818, 0.08818575267731729, -0.12361162729601144, -0.08545248316174063, 0.3764484177679858, -0.050640541213700395, -0.28963929406988126, 0.16396750710231978, -0.08155154931268448, -0.09328812587450051, 0.09536798529572682, 0.21172002854614724, 0.17531213438552287, -0.16090139087059974, 0.11243040552572994, -0.030083541669430107, 0.16542394975355515, -0.013004757805093605, 0.013113164258862121, 0.09001343661576458, 0.2072901390816292, 0.1344074218618011, 0.17099022456224905, -0.047004142143931754, -0.10781818296204114, -0.3755725622435825, -0.13931543848149078, -0.1495194957501048, 0.03959398759777994, -0.08115938958366718, -0.13938039812233505, 0.37511480197935676, 0.1594234242458899, 0.12300303583591206, 0.07283064362127334, 0.305726353958663, 0.2039225453712182, -0.023871941564721055, 0.0798059460810489, 0.2556830705466887, 0.18109136298072473, 0.11607624323288393, -0.2865193420447112, 0.03193459521733328, 0.09437292857263754] |
1,802.061 | Extreme Value Analysis of Solar Flare Events | Space weather events such as solar flares can be harmful for life and
infrastructure on earth or in near-earth orbit. In this paper we employ extreme
value theory (EVT) to model extreme solar flare events; EVT offers the
appropriate tools for the study and estimation of probabilities for
extrapolation to ranges outside of those that have already been observed. In
the past such phenomena have been modelled as following a power law which may
gives poor estimates of such events due to overestimation. The data used in the
study were X-ray fluxes from NOAA/GOES and the expected return levels for
Carrington or Halloween like events were calculated with the outcome that the
existing data predict similar events happening in 110 and 38 years
respectively.
| stat.AP astro-ph.SR physics.data-an physics.space-ph | space weather events such as solar flares can be harmful for life and infrastructure on earth or in nearearth orbit in this paper we employ extreme value theory evt to model extreme solar flare events evt offers the appropriate tools for the study and estimation of probabilities for extrapolation to ranges outside of those that have already been observed in the past such phenomena have been modelled as following a power law which may gives poor estimates of such events due to overestimation the data used in the study were xray fluxes from noaagoes and the expected return levels for carrington or halloween like events were calculated with the outcome that the existing data predict similar events happening in 110 and 38 years respectively | [['space', 'weather', 'events', 'such', 'as', 'solar', 'flares', 'can', 'be', 'harmful', 'for', 'life', 'and', 'infrastructure', 'on', 'earth', 'or', 'in', 'nearearth', 'orbit', 'in', 'this', 'paper', 'we', 'employ', 'extreme', 'value', 'theory', 'evt', 'to', 'model', 'extreme', 'solar', 'flare', 'events', 'evt', 'offers', 'the', 'appropriate', 'tools', 'for', 'the', 'study', 'and', 'estimation', 'of', 'probabilities', 'for', 'extrapolation', 'to', 'ranges', 'outside', 'of', 'those', 'that', 'have', 'already', 'been', 'observed', 'in', 'the', 'past', 'such', 'phenomena', 'have', 'been', 'modelled', 'as', 'following', 'a', 'power', 'law', 'which', 'may', 'gives', 'poor', 'estimates', 'of', 'such', 'events', 'due', 'to', 'overestimation', 'the', 'data', 'used', 'in', 'the', 'study', 'were', 'xray', 'fluxes', 'from', 'noaagoes', 'and', 'the', 'expected', 'return', 'levels', 'for', 'carrington', 'or', 'halloween', 'like', 'events', 'were', 'calculated', 'with', 'the', 'outcome', 'that', 'the', 'existing', 'data', 'predict', 'similar', 'events', 'happening', 'in', '110', 'and', '38', 'years', 'respectively']] | [-0.03692468893676391, 0.14538280092694653, -0.06131605214886064, 0.1778492734226118, -0.03817811736276722, -0.05011924246053507, 0.058840901615491846, 0.37534398391721696, -0.1703559584249326, -0.4108273053496349, 0.1457959548257882, -0.33130644788072117, -0.11160744670437785, 0.23735543777522577, -0.12786154043898593, 0.06519672098168271, 0.09856579687287349, 0.03629839836006484, -0.04696868248738167, -0.19512532705940852, 0.2343694000671489, 0.11792571916116204, 0.24146401991204516, -0.015312920958399999, 0.060402912540149276, -0.027457817298610035, -0.03598000741813604, 0.0036320184635252094, -0.09912160746963805, 0.06055577335561194, 0.28659006542851767, 0.1484625230008444, 0.2521705568230491, -0.45245156825588245, -0.28476034737063377, 0.10700900307705065, 0.1083927664724065, 0.012889347053360103, -0.023491267187755585, -0.25878688766492336, 0.07218146626648259, -0.18630593418658567, -0.12521407858476163, -0.01137431539387851, 0.05617283368710338, 0.03702637204726234, -0.2945426894972722, 0.07749522135146265, 0.01511308067379807, 0.10172598765466392, -0.09655622752549929, -0.1044293736927287, -0.010054674590142762, 0.14961499759427657, 0.1309910645846626, 0.012271106572503724, 0.14788735277829615, -0.0687757811444713, -0.1370358050656997, 0.4010173373257484, -0.050397691983214726, -0.05211036721607897, 0.2046553318472049, -0.20619749934298964, -0.15059202246564796, 0.1378338421142198, 0.2273587249484428, 0.08358430984645099, -0.169203474822386, 0.004371372625095452, 0.016445049557009546, 0.08804093543828155, 0.06779249909341456, 0.03671707235640142, 0.2399406744492793, 0.13121571423906106, 0.026568174767270077, 0.06597160724298347, -0.18619052062333538, -0.07794100932996507, -0.2231150849351311, -0.11482473835727669, -0.10454543481526019, 0.07495762579468632, -0.05315257346482826, -0.16094345187132314, 0.3623773866461787, 0.20360131336970452, 0.21397291546748057, -0.019282278643610578, 0.2457929283865099, 0.12468933901461826, 0.08246538203542794, 0.06287198685624493, 0.30519411884763137, 0.0471612248679517, 0.12950266188586024, -0.1261818259102633, 0.14341065434860142, 0.021123656013041614] |
1,802.06101 | Market Impact in a Latent Order Book | The latent order book of \cite{donier2015fully} is one of the most promising
agent-based models for market impact. This work extends the minimal model by
allowing agents to exhibit mean-reversion, a commonly observed pattern in real
markets. This modification leads to new order book dynamics, which we
explicitly study and analyze. Underlying our analysis is a mean-field
assumption that views the order book through its \textit{average} density. We
show how price impact develops in this new model, providing a flexible family
of solutions that can potentially improve calibration to real data. While no
closed-form solution is provided, we complement our theoretical investigation
with extensive numerical results, including a simulation scheme for the entire
order book.
| q-fin.TR | the latent order book of citedonier2015fully is one of the most promising agentbased models for market impact this work extends the minimal model by allowing agents to exhibit meanreversion a commonly observed pattern in real markets this modification leads to new order book dynamics which we explicitly study and analyze underlying our analysis is a meanfield assumption that views the order book through its textitaverage density we show how price impact develops in this new model providing a flexible family of solutions that can potentially improve calibration to real data while no closedform solution is provided we complement our theoretical investigation with extensive numerical results including a simulation scheme for the entire order book | [['the', 'latent', 'order', 'book', 'of', 'citedonier2015fully', 'is', 'one', 'of', 'the', 'most', 'promising', 'agentbased', 'models', 'for', 'market', 'impact', 'this', 'work', 'extends', 'the', 'minimal', 'model', 'by', 'allowing', 'agents', 'to', 'exhibit', 'meanreversion', 'a', 'commonly', 'observed', 'pattern', 'in', 'real', 'markets', 'this', 'modification', 'leads', 'to', 'new', 'order', 'book', 'dynamics', 'which', 'we', 'explicitly', 'study', 'and', 'analyze', 'underlying', 'our', 'analysis', 'is', 'a', 'meanfield', 'assumption', 'that', 'views', 'the', 'order', 'book', 'through', 'its', 'textitaverage', 'density', 'we', 'show', 'how', 'price', 'impact', 'develops', 'in', 'this', 'new', 'model', 'providing', 'a', 'flexible', 'family', 'of', 'solutions', 'that', 'can', 'potentially', 'improve', 'calibration', 'to', 'real', 'data', 'while', 'no', 'closedform', 'solution', 'is', 'provided', 'we', 'complement', 'our', 'theoretical', 'investigation', 'with', 'extensive', 'numerical', 'results', 'including', 'a', 'simulation', 'scheme', 'for', 'the', 'entire', 'order', 'book']] | [-0.09606739680851455, 0.005731278853243695, -0.11944413628322031, 0.07616197486949952, -0.1393820511061797, -0.09525687082266782, 0.06909860315860405, 0.3643460596450069, -0.23560493149427877, -0.31925137988003216, 0.11778705869801342, -0.2841466242299143, -0.20772348948449423, 0.1799144717633922, -0.068490207393085, 0.03568809104937055, 0.07165638413857174, -0.0015114882695117752, -0.006036818526124796, -0.2665751623906673, 0.2907336699957671, 0.07627320306301447, 0.2890251986455766, 0.0597325893020076, 0.08291805068605819, -0.024203338148278408, -0.055918984189299886, 0.0289800595553938, -0.17887448791923946, 0.15478590512091903, 0.2637363783370323, 0.11424773173258368, 0.3040786175700152, -0.430530337946473, -0.24128888858136086, 0.10304975167197068, 0.10811953131208378, 0.10465978429368408, -0.03514137548555216, -0.24956333675149794, 0.08955324932405379, -0.22464123481999984, -0.15193089988263966, -0.1444397351861132, -0.03761996739684085, 0.0013923242052530755, -0.28943769360966654, 0.034431317260703156, 0.06818594194668452, 0.03815401104573506, -0.0374825161776662, -0.08557478575843626, 0.02227896360054085, 0.1294388365849391, 0.0867806528324047, -0.0005574539134822852, 0.07700852437389899, -0.10408635826707216, -0.15255593263752248, 0.38095636581909326, -0.085150708465021, -0.2044558155028957, 0.15517936762323423, -0.12727806370383937, -0.14496052684262395, 0.12204080958545735, 0.19570843908787433, 0.07006019641917231, -0.16625458731489107, 0.06922361606565114, -0.06622442336592296, 0.1944165718144185, -0.0009399930724000509, -0.02530542526299348, 0.14615768131560983, 0.23911560820085945, 0.0655933573792598, 0.13551809074381876, -0.031383739036417245, -0.1791221245801884, -0.2903488708610556, -0.13665959180489315, -0.13702553494182307, 0.02598737719761356, -0.11294677208445089, -0.1548639429502387, 0.42460393837139404, 0.2202804144574906, 0.1693040800355045, 0.05815429488852192, 0.32023529355636743, 0.1009344126373958, -0.00931973002471887, 0.07583226364485063, 0.17421327276254253, 0.03471527428292068, 0.09861330419935418, -0.16035406012809217, 0.12093273471768913, 0.02910131831505064] |
1,802.06102 | Mapping fast evolution of transient surface photovoltage dynamics using
G-Mode Kelvin probe force microscopy | Optoelectronic phenomena in materials such as organic/inorganic hybrid
perovskites depend on a complex interplay between light induced carrier
generation and fast (electronic) and slower (ionic) processes, all of which are
known to be strongly affected by structural inhomogeneities such as interfaces
and grain boundaries. Here, we develop a time resolved Kelvin probe force
microscopy (KPFM) approach, based on the G-Mode SPM platform, allowing
quantification of surface photovoltage (SPV) with microsecond temporal and
nanoscale spatial resolution. We demonstrate the approach on methylammonium
lead bromide (MAPbBr3) thin films and further highlight the usefulness of
unsupervised clustering methods to quickly discern spatial variability in the
information rich SPV dataset. Using this technique, we observe concurrent
spatial and ultra-fast temporal variations in the SPV generated across the thin
film, indicating that structure is likely responsible for the heterogenous
behavior.
| physics.app-ph cond-mat.mtrl-sci | optoelectronic phenomena in materials such as organicinorganic hybrid perovskites depend on a complex interplay between light induced carrier generation and fast electronic and slower ionic processes all of which are known to be strongly affected by structural inhomogeneities such as interfaces and grain boundaries here we develop a time resolved kelvin probe force microscopy kpfm approach based on the gmode spm platform allowing quantification of surface photovoltage spv with microsecond temporal and nanoscale spatial resolution we demonstrate the approach on methylammonium lead bromide mapbbr3 thin films and further highlight the usefulness of unsupervised clustering methods to quickly discern spatial variability in the information rich spv dataset using this technique we observe concurrent spatial and ultrafast temporal variations in the spv generated across the thin film indicating that structure is likely responsible for the heterogenous behavior | [['optoelectronic', 'phenomena', 'in', 'materials', 'such', 'as', 'organicinorganic', 'hybrid', 'perovskites', 'depend', 'on', 'a', 'complex', 'interplay', 'between', 'light', 'induced', 'carrier', 'generation', 'and', 'fast', 'electronic', 'and', 'slower', 'ionic', 'processes', 'all', 'of', 'which', 'are', 'known', 'to', 'be', 'strongly', 'affected', 'by', 'structural', 'inhomogeneities', 'such', 'as', 'interfaces', 'and', 'grain', 'boundaries', 'here', 'we', 'develop', 'a', 'time', 'resolved', 'kelvin', 'probe', 'force', 'microscopy', 'kpfm', 'approach', 'based', 'on', 'the', 'gmode', 'spm', 'platform', 'allowing', 'quantification', 'of', 'surface', 'photovoltage', 'spv', 'with', 'microsecond', 'temporal', 'and', 'nanoscale', 'spatial', 'resolution', 'we', 'demonstrate', 'the', 'approach', 'on', 'methylammonium', 'lead', 'bromide', 'mapbbr3', 'thin', 'films', 'and', 'further', 'highlight', 'the', 'usefulness', 'of', 'unsupervised', 'clustering', 'methods', 'to', 'quickly', 'discern', 'spatial', 'variability', 'in', 'the', 'information', 'rich', 'spv', 'dataset', 'using', 'this', 'technique', 'we', 'observe', 'concurrent', 'spatial', 'and', 'ultrafast', 'temporal', 'variations', 'in', 'the', 'spv', 'generated', 'across', 'the', 'thin', 'film', 'indicating', 'that', 'structure', 'is', 'likely', 'responsible', 'for', 'the', 'heterogenous', 'behavior']] | [-0.0981240879157903, 0.15455943337055267, -0.07656713172586428, 0.03665794367595852, -0.06880256645036516, -0.1516596841108468, 0.04905236463916177, 0.47607482059134376, -0.3116690363114079, -0.31768797753309763, 0.034069649727704626, -0.25075299539085893, -0.19369167381621621, 0.2226914774820519, -0.022573086045061547, 0.022882522652529318, -0.0015942843216988775, -0.126075865831916, -0.021455651264706697, -0.13802924661690164, 0.24872893902507645, 0.025374821799643406, 0.34592475549973273, 0.11276690296621786, 0.09520262989594981, -0.027134336189677317, 4.3790704674190946e-05, 0.019327832530770035, -0.13296329223888245, 0.12852616720418963, 0.2562291111158966, -0.005770964976572604, 0.22290115590655693, -0.508403370819158, -0.281945443139584, -0.004454922140090882, 0.140670881451418, 0.1020285185072916, -0.07898398888797534, -0.29221008522780956, 0.06574650989776408, -0.08800486380372334, -0.09697216058977776, -0.1458846177582422, -0.010483060370164889, 0.054123398987576364, -0.22271014724435562, 0.11817649061688118, 0.04378786687221792, 0.1059590589048134, -0.08147257922079276, -0.054840773916630836, -0.049945623217219556, 0.08592865659372398, 0.011833894466636357, -0.005226483900548407, 0.20913338895016179, -0.10749702727749806, -0.10026683453470468, 0.36026671355314277, -0.06281389939529752, -0.10876013682810244, 0.24093094048849134, -0.16645863478037495, -0.07989956341959813, 0.1472143361137973, 0.17583292444684992, 0.16667768875205957, -0.13931606629285617, 0.027578778322613625, 0.045830301019466585, 0.25185887354115644, 0.09782683300544266, 0.13849845583792086, 0.22178265741439881, 0.2804880393703503, 0.011838649448731708, 0.1018053219964107, -0.15678338182710663, -0.017379415997614462, -0.1493739012249366, -0.1753389519397859, -0.14658673292250132, 0.028147099272852454, -0.11456933243618415, -0.20741512124875078, 0.4050481248853935, 0.16845339070143248, 0.13939708500962567, -0.07445629534798812, 0.27770146514996197, 0.014593389976976647, 0.08633400609854747, -0.003596407219905544, 0.18092340080550423, 0.10999016092089867, 0.13556539919593855, -0.29281307899703585, 0.12542577390559018, 0.005614063557651308] |
1,802.06103 | Counting Homomorphisms to Trees Modulo a Prime | Many important graph theoretic notions can be encoded as counting graph
homomorphism problems, such as partition functions in statistical physics, in
particular, independent sets and colourings. In this article we study the
complexity of $\#_p\mathsf{H}$OMS$\mathsf{T}$O$H$, the problem of counting
graph homomorphisms from an input graph to a graph $H$ modulo a prime number
$p$. Dyer and Greenhill proved a dichotomy stating that the tractability of
non-modular counting graph homomorphisms depends on the structure of the input
graph. Many intractable cases in non-modular counting become tractable in
modular counting due to the common phenomenon of cancellation. However, in
subsequent studies on counting modulo $2$ the influence, the structure of $H$
has on the tractability, was shown to persist, yielding similar dichotomies.
Our main result shows that for every tree $H$ and every prime $p$ the problem
$\#_p\mathsf{H}$OMS$\mathsf{T}$O$H$ is either polynomial time computable or
$\#_p\mathsf{P}$-complete. This addresses the conjecture of Faben and Jerrum
stating this dichotomy for every graph $H$ when counting modulo 2. In order to
prove this result, we study the structural properties of a homomorphism. As an
important interim, this study yields a dichotomy for the problem of weighted
counting independent sets in a bipartite graph modulo some prime $p$. Our
results are the first suggesting that such dichotomies hold not only for the
one-bit functions of the modulo~2 case but for the modular counting functions
of all primes $p$.
| cs.CC cs.DM | many important graph theoretic notions can be encoded as counting graph homomorphism problems such as partition functions in statistical physics in particular independent sets and colourings in this article we study the complexity of _pmathsfhomsmathsftoh the problem of counting graph homomorphisms from an input graph to a graph h modulo a prime number p dyer and greenhill proved a dichotomy stating that the tractability of nonmodular counting graph homomorphisms depends on the structure of the input graph many intractable cases in nonmodular counting become tractable in modular counting due to the common phenomenon of cancellation however in subsequent studies on counting modulo 2 the influence the structure of h has on the tractability was shown to persist yielding similar dichotomies our main result shows that for every tree h and every prime p the problem _pmathsfhomsmathsftoh is either polynomial time computable or _pmathsfpcomplete this addresses the conjecture of faben and jerrum stating this dichotomy for every graph h when counting modulo 2 in order to prove this result we study the structural properties of a homomorphism as an important interim this study yields a dichotomy for the problem of weighted counting independent sets in a bipartite graph modulo some prime p our results are the first suggesting that such dichotomies hold not only for the onebit functions of the modulo2 case but for the modular counting functions of all primes p | [['many', 'important', 'graph', 'theoretic', 'notions', 'can', 'be', 'encoded', 'as', 'counting', 'graph', 'homomorphism', 'problems', 'such', 'as', 'partition', 'functions', 'in', 'statistical', 'physics', 'in', 'particular', 'independent', 'sets', 'and', 'colourings', 'in', 'this', 'article', 'we', 'study', 'the', 'complexity', 'of', '_pmathsfhomsmathsftoh', 'the', 'problem', 'of', 'counting', 'graph', 'homomorphisms', 'from', 'an', 'input', 'graph', 'to', 'a', 'graph', 'h', 'modulo', 'a', 'prime', 'number', 'p', 'dyer', 'and', 'greenhill', 'proved', 'a', 'dichotomy', 'stating', 'that', 'the', 'tractability', 'of', 'nonmodular', 'counting', 'graph', 'homomorphisms', 'depends', 'on', 'the', 'structure', 'of', 'the', 'input', 'graph', 'many', 'intractable', 'cases', 'in', 'nonmodular', 'counting', 'become', 'tractable', 'in', 'modular', 'counting', 'due', 'to', 'the', 'common', 'phenomenon', 'of', 'cancellation', 'however', 'in', 'subsequent', 'studies', 'on', 'counting', 'modulo', '2', 'the', 'influence', 'the', 'structure', 'of', 'h', 'has', 'on', 'the', 'tractability', 'was', 'shown', 'to', 'persist', 'yielding', 'similar', 'dichotomies', 'our', 'main', 'result', 'shows', 'that', 'for', 'every', 'tree', 'h', 'and', 'every', 'prime', 'p', 'the', 'problem', '_pmathsfhomsmathsftoh', 'is', 'either', 'polynomial', 'time', 'computable', 'or', '_pmathsfpcomplete', 'this', 'addresses', 'the', 'conjecture', 'of', 'faben', 'and', 'jerrum', 'stating', 'this', 'dichotomy', 'for', 'every', 'graph', 'h', 'when', 'counting', 'modulo', '2', 'in', 'order', 'to', 'prove', 'this', 'result', 'we', 'study', 'the', 'structural', 'properties', 'of', 'a', 'homomorphism', 'as', 'an', 'important', 'interim', 'this', 'study', 'yields', 'a', 'dichotomy', 'for', 'the', 'problem', 'of', 'weighted', 'counting', 'independent', 'sets', 'in', 'a', 'bipartite', 'graph', 'modulo', 'some', 'prime', 'p', 'our', 'results', 'are', 'the', 'first', 'suggesting', 'that', 'such', 'dichotomies', 'hold', 'not', 'only', 'for', 'the', 'onebit', 'functions', 'of', 'the', 'modulo2', 'case', 'but', 'for', 'the', 'modular', 'counting', 'functions', 'of', 'all', 'primes', 'p']] | [-0.1596713080831697, 0.05961329987481453, -0.0926928042910029, 0.10537281769875176, -0.06891458036414788, -0.12354305616923068, 0.04017058729087901, 0.31376364240586235, -0.32862214069494877, -0.3192027286083127, 0.07906453816203314, -0.25638328655929254, -0.16155749864635272, 0.19129341071483827, -0.1360028139438088, 0.07507817848460961, 0.09329504007065113, 0.0908877427318019, -0.0042382934582092914, -0.29451791515225123, 0.3248319318752916, -0.03405459297107626, 0.20240582399307178, 0.08415055168964165, 0.033903400778255766, 0.08361710920692994, -0.03376791565147996, 0.042030646800213345, -0.1534877001729336, 0.07140059232672986, 0.3220193282039346, 0.16870871955357042, 0.2689487376360615, -0.37323597308440776, -0.14181698072934523, 0.22745861438319512, 0.13829389974483075, 0.04182604979315217, -0.00548676193718341, -0.20267902011880978, 0.13390413535760895, -0.1100994590138853, -0.059360117575954316, -0.04059047401543674, 0.07361600320610594, 0.017094617199434555, -0.27243855488210866, -0.009956918266732572, 0.17859611465195357, 0.07821438377600555, 0.0030939503860855965, -0.1386583837284298, 0.02696493925044738, 0.0942925226701303, -0.0006045223808063096, 0.06454573622026497, 0.034122485092794114, -0.144365784396589, -0.18310631595127153, 0.37906197573695527, 0.029116939702298464, -0.1591826893080699, 0.12892729838520672, -0.15314088417053745, -0.2744093241554015, 0.11823487582232542, 0.09095341269041232, 0.12382987135686307, -0.05505919885565578, 0.1583441658989167, -0.1489530568125478, 0.14443421175523677, 0.13984075283607175, 0.021428425528778973, 0.10029605396802684, 0.12726543157304263, 0.11677582162991983, 0.1950174221761827, 0.031967147249368985, -0.006878569172776974, -0.3026650145878656, -0.13319719635897823, -0.2119580591888894, 0.09085088282454148, -0.13746447261732292, -0.2105773362383939, 0.39860809103814526, 0.1019741196783766, 0.17086043630026101, 0.14238372976940714, 0.2421030644894161, 0.10764883554146397, 0.03349931906549293, 0.08966635503671377, 0.10884423740016676, 0.1834034626249616, -0.011378489357332256, -0.1594551022117549, 0.06580777452511125, 0.13074091270978547] |
1,802.06104 | Information-theoretic Limits for Community Detection in Network Models | We analyze the information-theoretic limits for the recovery of node labels
in several network models. This includes the Stochastic Block Model, the
Exponential Random Graph Model, the Latent Space Model, the Directed
Preferential Attachment Model, and the Directed Small-world Model. For the
Stochastic Block Model, the non-recoverability condition depends on the
probabilities of having edges inside a community, and between different
communities. For the Latent Space Model, the non-recoverability condition
depends on the dimension of the latent space, and how far and spread are the
communities in the latent space. For the Directed Preferential Attachment Model
and the Directed Small-world Model, the non-recoverability condition depends on
the ratio between homophily and neighborhood size. We also consider dynamic
versions of the Stochastic Block Model and the Latent Space Model.
| cs.LG cs.SI physics.soc-ph stat.ML | we analyze the informationtheoretic limits for the recovery of node labels in several network models this includes the stochastic block model the exponential random graph model the latent space model the directed preferential attachment model and the directed smallworld model for the stochastic block model the nonrecoverability condition depends on the probabilities of having edges inside a community and between different communities for the latent space model the nonrecoverability condition depends on the dimension of the latent space and how far and spread are the communities in the latent space for the directed preferential attachment model and the directed smallworld model the nonrecoverability condition depends on the ratio between homophily and neighborhood size we also consider dynamic versions of the stochastic block model and the latent space model | [['we', 'analyze', 'the', 'informationtheoretic', 'limits', 'for', 'the', 'recovery', 'of', 'node', 'labels', 'in', 'several', 'network', 'models', 'this', 'includes', 'the', 'stochastic', 'block', 'model', 'the', 'exponential', 'random', 'graph', 'model', 'the', 'latent', 'space', 'model', 'the', 'directed', 'preferential', 'attachment', 'model', 'and', 'the', 'directed', 'smallworld', 'model', 'for', 'the', 'stochastic', 'block', 'model', 'the', 'nonrecoverability', 'condition', 'depends', 'on', 'the', 'probabilities', 'of', 'having', 'edges', 'inside', 'a', 'community', 'and', 'between', 'different', 'communities', 'for', 'the', 'latent', 'space', 'model', 'the', 'nonrecoverability', 'condition', 'depends', 'on', 'the', 'dimension', 'of', 'the', 'latent', 'space', 'and', 'how', 'far', 'and', 'spread', 'are', 'the', 'communities', 'in', 'the', 'latent', 'space', 'for', 'the', 'directed', 'preferential', 'attachment', 'model', 'and', 'the', 'directed', 'smallworld', 'model', 'the', 'nonrecoverability', 'condition', 'depends', 'on', 'the', 'ratio', 'between', 'homophily', 'and', 'neighborhood', 'size', 'we', 'also', 'consider', 'dynamic', 'versions', 'of', 'the', 'stochastic', 'block', 'model', 'and', 'the', 'latent', 'space', 'model']] | [-0.1002635263139382, 0.12369868039604626, -0.017161994630441768, 0.09566708004695101, -0.09930191831699631, -0.15359180097470926, 0.09717560528224567, 0.38873227262229193, -0.3157234677564702, -0.2829249453207012, 0.04449445857790124, -0.26910446315741865, -0.19428227074604365, 0.06450785550441651, -0.013029658955929335, 0.023372785210085567, 0.04613657027221052, 0.09654897058658207, 0.022069618591558537, -0.21484764301499126, 0.34777188551925065, 0.0945520338791539, 0.32521410881599877, 0.009344985090137925, 0.13174206321309612, 0.04568969852334703, -0.04410741090941883, 0.026285058292842223, -0.15473734380793758, 0.12303124239770113, 0.14333699998806537, 0.17339098478078085, 0.26368116957019083, -0.42396027126233093, -0.2864131539754453, 0.16629783576354384, 0.0917061407460551, 0.09967391358804889, 0.08217063616348241, -0.2898689840967563, 0.029793476192935486, -0.17054892785381526, -0.035104320537357125, 0.0025032703401848266, -0.014194380455592182, 0.05724304894101806, -0.28064268743037246, 0.06654560458787273, 0.11826826926562717, 0.027435054009401938, -0.0715958330220019, -0.10756108181521995, -0.07286457893496845, 0.14228709876897483, 0.012859070444392273, -0.023088823745638365, 0.1218605952890357, -0.15621138684764446, -0.13734199047030415, 0.3553861177770159, -0.044629720694501884, -0.2415521537332097, 0.16218655782722635, -0.09828133104747394, -0.17911879091479932, 0.06726129778689938, 0.2599306991614867, 0.09345012719495571, -0.134799649596971, 0.10619938389254457, -0.11416902035125531, 0.11378131726087304, -0.005498020076629473, -0.02335582259547664, 0.13612356508383527, 0.22402795495145256, 0.11650016041676281, 0.15142289077630267, -0.10777155515643244, -0.17372543293458875, -0.2587631844289717, -0.10368572614970617, -0.20315642602417938, -0.0652197310118936, -0.2582882641464721, -0.20512605916155735, 0.45970651162133436, 0.15552776553158765, 0.24679199962702114, 0.11574357303470606, 0.2223008852743078, 0.06825456341721292, 0.017881238174595637, 0.11522174982309252, 0.12934559236600762, 0.14315562283445615, 0.08696960688394029, -0.1737251034082874, 0.2078489256073226, 0.1048619813645928] |
1,802.06105 | Sub-tree counts on hyperbolic random geometric graphs | We study the hyperbolic random geometric graph introduced in Krioukov et al.
For a sequence $R_n \to \infty$, we define these graphs to have the vertex set
as Poisson points distributed uniformly in balls $B(0,R_n) \subset
B_d^{\alpha}$, the $d$-dimensional Poincar\'e ball (unit d-ball with the
Poincar\'e metric $d_{\alpha}$ corresponding to negative curvature $-\alpha^2,
\alpha > 0$) by connecting any two points within a distance $R_n$ according to
the metric $d_{\zeta}, \zeta > 0$. Denoting these graphs by $HG_n(R_n ; \alpha,
\zeta)$, we study asymptotic counts of copies of a fixed tree $\Gamma_k$ (with
the ordered degree sequence $d_{(1)} \leq \ldots \leq d_{(k)}$) in $HG_n(R_n ;
\alpha, \zeta)$. Unlike earlier works, we count more involved structures,
allowing for $d > 2$, and in many places, more general choices of $R_n$ rather
than $R_n = 2[\zeta (d-1)]^{-1}\log (n/ \nu), \nu \in (0,\infty)$. The latter
choice of $R_n$ for $\alpha / \zeta > 1/2$ corresponds to the thermodynamic
regime. We show multiple phase transitions in $HG_n(R_n ; \alpha, \zeta)$ as
$\alpha / \zeta$ increases, i.e., the space $B_d^{\alpha}$ becomes more
hyperbolic. In particular, our analyses reveal that the sub-tree counts exhibit
an intricate dependence on the degree sequence $d_{(1)},\ldots,d_{(k)}$ of
$\Gamma_k$ as well as the ratio $\alpha/\zeta$. Under a more general radius
regime $R_n$ than that described above, we investigate the asymptotics of the
expectation and variance of sub-tree counts. Moreover, we prove the
corresponding central limit theorem as well. Our proofs rely crucially on a
careful analysis of the sub-tree counts near the boundary using Palm calculus
for Poisson point processes along with estimates for the hyperbolic metric and
measure. For the central limit theorem, we use the abstract normal
approximation result from Last et al. derived using the Malliavin-Stein method.
| math.PR math.CO math.GT | we study the hyperbolic random geometric graph introduced in krioukov et al for a sequence r_n to infty we define these graphs to have the vertex set as poisson points distributed uniformly in balls b0r_n subset b_dalpha the ddimensional poincare ball unit dball with the poincare metric d_alpha corresponding to negative curvature alpha2 alpha 0 by connecting any two points within a distance r_n according to the metric d_zeta zeta 0 denoting these graphs by hg_nr_n alpha zeta we study asymptotic counts of copies of a fixed tree gamma_k with the ordered degree sequence d_1 leq ldots leq d_k in hg_nr_n alpha zeta unlike earlier works we count more involved structures allowing for d 2 and in many places more general choices of r_n rather than r_n 2zeta d11log n nu nu in 0infty the latter choice of r_n for alpha zeta 12 corresponds to the thermodynamic regime we show multiple phase transitions in hg_nr_n alpha zeta as alpha zeta increases ie the space b_dalpha becomes more hyperbolic in particular our analyses reveal that the subtree counts exhibit an intricate dependence on the degree sequence d_1ldotsd_k of gamma_k as well as the ratio alphazeta under a more general radius regime r_n than that described above we investigate the asymptotics of the expectation and variance of subtree counts moreover we prove the corresponding central limit theorem as well our proofs rely crucially on a careful analysis of the subtree counts near the boundary using palm calculus for poisson point processes along with estimates for the hyperbolic metric and measure for the central limit theorem we use the abstract normal approximation result from last et al derived using the malliavinstein method | [['we', 'study', 'the', 'hyperbolic', 'random', 'geometric', 'graph', 'introduced', 'in', 'krioukov', 'et', 'al', 'for', 'a', 'sequence', 'r_n', 'to', 'infty', 'we', 'define', 'these', 'graphs', 'to', 'have', 'the', 'vertex', 'set', 'as', 'poisson', 'points', 'distributed', 'uniformly', 'in', 'balls', 'b0r_n', 'subset', 'b_dalpha', 'the', 'ddimensional', 'poincare', 'ball', 'unit', 'dball', 'with', 'the', 'poincare', 'metric', 'd_alpha', 'corresponding', 'to', 'negative', 'curvature', 'alpha2', 'alpha', '0', 'by', 'connecting', 'any', 'two', 'points', 'within', 'a', 'distance', 'r_n', 'according', 'to', 'the', 'metric', 'd_zeta', 'zeta', '0', 'denoting', 'these', 'graphs', 'by', 'hg_nr_n', 'alpha', 'zeta', 'we', 'study', 'asymptotic', 'counts', 'of', 'copies', 'of', 'a', 'fixed', 'tree', 'gamma_k', 'with', 'the', 'ordered', 'degree', 'sequence', 'd_1', 'leq', 'ldots', 'leq', 'd_k', 'in', 'hg_nr_n', 'alpha', 'zeta', 'unlike', 'earlier', 'works', 'we', 'count', 'more', 'involved', 'structures', 'allowing', 'for', 'd', '2', 'and', 'in', 'many', 'places', 'more', 'general', 'choices', 'of', 'r_n', 'rather', 'than', 'r_n', '2zeta', 'd11log', 'n', 'nu', 'nu', 'in', '0infty', 'the', 'latter', 'choice', 'of', 'r_n', 'for', 'alpha', 'zeta', '12', 'corresponds', 'to', 'the', 'thermodynamic', 'regime', 'we', 'show', 'multiple', 'phase', 'transitions', 'in', 'hg_nr_n', 'alpha', 'zeta', 'as', 'alpha', 'zeta', 'increases', 'ie', 'the', 'space', 'b_dalpha', 'becomes', 'more', 'hyperbolic', 'in', 'particular', 'our', 'analyses', 'reveal', 'that', 'the', 'subtree', 'counts', 'exhibit', 'an', 'intricate', 'dependence', 'on', 'the', 'degree', 'sequence', 'd_1ldotsd_k', 'of', 'gamma_k', 'as', 'well', 'as', 'the', 'ratio', 'alphazeta', 'under', 'a', 'more', 'general', 'radius', 'regime', 'r_n', 'than', 'that', 'described', 'above', 'we', 'investigate', 'the', 'asymptotics', 'of', 'the', 'expectation', 'and', 'variance', 'of', 'subtree', 'counts', 'moreover', 'we', 'prove', 'the', 'corresponding', 'central', 'limit', 'theorem', 'as', 'well', 'our', 'proofs', 'rely', 'crucially', 'on', 'a', 'careful', 'analysis', 'of', 'the', 'subtree', 'counts', 'near', 'the', 'boundary', 'using', 'palm', 'calculus', 'for', 'poisson', 'point', 'processes', 'along', 'with', 'estimates', 'for', 'the', 'hyperbolic', 'metric', 'and', 'measure', 'for', 'the', 'central', 'limit', 'theorem', 'we', 'use', 'the', 'abstract', 'normal', 'approximation', 'result', 'from', 'last', 'et', 'al', 'derived', 'using', 'the', 'malliavinstein', 'method']] | [-0.14798123205661007, 0.1104158067546915, -0.06408762931993679, 0.07774283976572817, -0.038027038634584766, -0.13504379049426177, 0.08348469296130386, 0.341514278062191, -0.25075688129537366, -0.24437212266442604, 0.059909468437256086, -0.3155796251116987, -0.13733586940462328, 0.17395496833219742, -0.06303170022434032, 0.023196768540341788, -0.00610173236830228, 0.09307944891127982, -0.05117023055506258, -0.21267634473528513, 0.334580561606278, 0.0012407373487405534, 0.20198125435365705, -0.008961561242803374, 0.06140554437998438, 0.04734434300768495, -0.033096548242929534, 0.010648963435965778, -0.2359739538123572, 0.05789987770942495, 0.22011279602140787, 0.07984914360686891, 0.2462032009770135, -0.32076289566628036, -0.15058703394946607, 0.17331791299532923, 0.160937118454476, -0.01974655090266988, 0.05409203826370785, -0.2559766318261569, 0.10643860445838815, -0.09026555413345001, -0.1593195621079738, -0.0264872665628349, 0.08355478076486259, 0.056848768850985616, -0.29434446782811824, 0.08096300350649989, 0.09799977215890684, 0.05827961586089465, 6.360525306123887e-05, -0.19434149277202759, -0.02783861982272462, 0.10592704568989575, 0.031569088297644564, 0.08382050205089227, 0.10569416096187145, -0.06867581448878032, -0.08999140812491957, 0.30995458181621166, -0.058731391343282174, -0.2001817115373488, 0.11027803673684243, -0.2008949874196691, -0.19715477891632163, 0.09273227710229257, 0.09952809793082658, 0.18148204999513598, -0.05965843057790159, 0.15452475199095303, -0.06266137727015367, 0.13965854978575082, 0.17130895340934152, 0.018984783460797374, 0.13854337012459844, 0.10156150332041915, 0.1045291784487539, 0.13544332671121959, -0.0616864959656662, -0.08368090474782648, -0.33974055686721705, -0.13330393656748382, -0.1902530554119099, 0.11551149077772972, -0.20245654416682893, -0.1900080128905982, 0.30739972020166306, 0.09215230345861973, 0.25056387194649854, 0.1495114222643081, 0.18819838862893354, 0.13286487603999622, 0.021503507472782048, 0.09282104079513878, 0.11357137889611488, 0.17307632047866545, 0.042764219020350575, -0.14547730680048657, 0.02653514883518355, 0.15366144816010482] |
1,802.06106 | A deep learning framework for turbulence modeling using data
assimilation and feature extraction | Turbulent problems in industrial applications are predominantly solved using
Reynolds Averaged Navier Stokes (RANS) turbulence models. The accuracy of the
RANS models is limited due to closure assumptions that induce uncertainty into
the RANS modeling. We propose the use of deep learning algorithms via
convolution neural networks along with data from direct numerical simulations
to extract the optimal set of features that explain the evolution of turbulent
flow statistics. Statistical tests are used to determine the correlation of
these features with the variation in the quantities of interest that are to be
predicted. These features are then used to develop improved partial
differential equations that can replace classical Reynolds Averaged Navier
Stokes models and show improvement in the accuracy of the predictions.
| physics.flu-dyn physics.comp-ph | turbulent problems in industrial applications are predominantly solved using reynolds averaged navier stokes rans turbulence models the accuracy of the rans models is limited due to closure assumptions that induce uncertainty into the rans modeling we propose the use of deep learning algorithms via convolution neural networks along with data from direct numerical simulations to extract the optimal set of features that explain the evolution of turbulent flow statistics statistical tests are used to determine the correlation of these features with the variation in the quantities of interest that are to be predicted these features are then used to develop improved partial differential equations that can replace classical reynolds averaged navier stokes models and show improvement in the accuracy of the predictions | [['turbulent', 'problems', 'in', 'industrial', 'applications', 'are', 'predominantly', 'solved', 'using', 'reynolds', 'averaged', 'navier', 'stokes', 'rans', 'turbulence', 'models', 'the', 'accuracy', 'of', 'the', 'rans', 'models', 'is', 'limited', 'due', 'to', 'closure', 'assumptions', 'that', 'induce', 'uncertainty', 'into', 'the', 'rans', 'modeling', 'we', 'propose', 'the', 'use', 'of', 'deep', 'learning', 'algorithms', 'via', 'convolution', 'neural', 'networks', 'along', 'with', 'data', 'from', 'direct', 'numerical', 'simulations', 'to', 'extract', 'the', 'optimal', 'set', 'of', 'features', 'that', 'explain', 'the', 'evolution', 'of', 'turbulent', 'flow', 'statistics', 'statistical', 'tests', 'are', 'used', 'to', 'determine', 'the', 'correlation', 'of', 'these', 'features', 'with', 'the', 'variation', 'in', 'the', 'quantities', 'of', 'interest', 'that', 'are', 'to', 'be', 'predicted', 'these', 'features', 'are', 'then', 'used', 'to', 'develop', 'improved', 'partial', 'differential', 'equations', 'that', 'can', 'replace', 'classical', 'reynolds', 'averaged', 'navier', 'stokes', 'models', 'and', 'show', 'improvement', 'in', 'the', 'accuracy', 'of', 'the', 'predictions']] | [-0.07587519939988852, 0.05377383189291128, -0.07792638317819257, 0.08292875334059392, -0.07266489028182553, -0.09429328722238052, -0.0576568020003863, 0.342670678954999, -0.3378957911989972, -0.32178571771021136, 0.1030891004732245, -0.25163281773079615, -0.12095465838764106, 0.23678084664413188, -0.061931187508352956, 0.14800768002455475, 0.12456565910996106, -0.03921623298989945, -0.0647904680370063, -0.21952284489506396, 0.2991835514148392, 0.011413304362070106, 0.3012429685255543, 0.004880723512929971, 0.1148128828852529, -0.13097659266767564, -0.06876867672917052, 0.07328376582476356, -0.16027810892255281, 0.13996239959598197, 0.2837452873385492, 0.10027624909063709, 0.26001925868760856, -0.4901264602257336, -0.3001420859965023, 0.0770508694623742, 0.15626348874180532, 0.08179992249380554, 0.04922913606507612, -0.27364043871582044, 0.12459248458092544, -0.15198214691452927, -0.06324865124341039, -0.1308696205063616, -0.01784496861280965, 0.08715473732254544, -0.327615433342022, 0.13462022336993795, 0.016038991381093614, 0.08655528809119505, -0.04636923083272137, -0.1074196125884525, -0.029110462994497942, 0.13602862055279832, 0.08305060918839863, -0.03263557253435987, 0.13485388757401437, -0.19599008894540737, -0.1026913964253522, 0.39395615082905916, -0.07169556377892626, -0.2805856173842779, 0.1700276246706604, -0.08170487060684894, -0.1064994440101026, 0.1542773265028983, 0.2492097434239485, 0.06379130893085366, -0.1219092796396342, 0.017282206984523103, -0.06981398064459933, 0.16293678885196014, 0.02622720897655751, -0.05654962273070314, 0.15621201338658688, 0.1548586210358094, 0.005489358418911207, 0.08254030186847067, -0.13291486604597236, -0.1262306403864908, -0.27093326875016277, -0.09216537995294469, -0.15964213985048967, 0.011873933942640223, -0.10503713824186516, -0.15068840478226297, 0.3466242980288311, 0.2647773841540062, 0.1678067014293104, 0.09003357792112854, 0.30529584397454973, 0.15211644437324856, 0.06457321916813732, 0.1019595245597884, 0.2659550368438521, 0.18951907116522798, 0.1368119632367228, -0.21498835367936886, 0.0807395615637852, 0.0794955757561094] |
1,802.06107 | Stable rationality in smooth families of threefolds | We exhibit families of smooth projective threefolds with both stably rational
and non stably rational fibers.
| math.AG | we exhibit families of smooth projective threefolds with both stably rational and non stably rational fibers | [['we', 'exhibit', 'families', 'of', 'smooth', 'projective', 'threefolds', 'with', 'both', 'stably', 'rational', 'and', 'non', 'stably', 'rational', 'fibers']] | [-0.2565485639497638, 0.041365278404555283, -0.11757212231168523, -0.0007458257023245096, -0.050411616917699575, -0.32090022857300937, -0.054295640242344234, 0.4640575055964291, -0.3433943875133991, -0.11216822010464966, 0.07040679032797925, -0.22946842206874862, -0.2040813835337758, 0.27616930240765214, -0.21978811908047646, 0.02573880591080524, -0.013953524365206249, 0.009555506752803922, -0.12447459751274437, -0.4625742060597986, 0.5127472076565027, -0.19605606866753078, 0.19606216112151742, -0.01676232018508017, 0.1967073208943475, -0.018099423497915268, 0.08340762098669074, 0.03279121359810233, -0.19027666631154716, 0.11364498781040311, 0.45016550086438656, -0.019706330145709217, 0.05813068518182263, -0.39666712284088135, -0.17510950978612527, 0.41227463772520423, 0.11095151654444635, -0.0027264722157269716, -0.0051461076945997775, -0.17254491709172726, 0.07550924946554005, -0.11624227872380288, -0.22883237665519118, -0.22129516332643107, -0.08602327411063015, 0.22093765740282834, -0.16445433674380183, -0.07539807935245335, 0.12734183948487043, 0.29489782912423834, -0.025846851232927293, 0.036596844089217484, -0.24262332942453213, -0.002990885521285236, -0.06280124976183288, -0.057660589227452874, 0.07714478686102666, -0.07550897088367492, -0.030705271114129573, 0.31365399714559317, -0.07602883828803897, -0.28222840517992154, 0.17927598487585783, -0.20074481796473265, -0.03829762729583308, 0.3371325448388234, 0.08562343730591238, 0.25791589356958866, 0.14652839809423313, 0.13103051948928623, -0.1215273761190474, 0.07287874465691857, 0.1716315487283282, -0.10600174288265407, 0.16760468017309904, -0.010019342764280736, 0.04599850717931986, 0.039427090901881456, 0.06190678267739713, -0.06190682924352586, -0.39577520824968815, -0.16299089969834313, 0.060595823160838336, 0.21132355881854892, -0.050347643175882695, -0.2577036008005962, 0.3820075364783406, -0.19561588490614668, 0.22743802634067833, 0.19982112321304157, 0.1789534934796393, -0.1328155979863368, -0.03395966510288417, 0.08700183313339949, 0.20764309377409518, 0.2679606011370197, -0.1473844263528008, -0.010458803983055986, -0.11733974480375764, 0.15883208252489567] |
1,802.06108 | Modeling the Formation of Social Conventions from Embodied Real-Time
Interactions | What is the role of real-time control and learning in the formation of social
conventions? To answer this question, we propose a computational model that
matches human behavioral data in a social decision-making game that was
analyzed both in discrete-time and continuous-time setups. Furthermore, unlike
previous approaches, our model takes into account the role of sensorimotor
control loops in embodied decision-making scenarios. For this purpose, we
introduce the Control-based Reinforcement Learning (CRL) model. CRL is grounded
in the Distributed Adaptive Control (DAC) theory of mind and brain, where
low-level sensorimotor control is modulated through perceptual and behavioral
learning in a layered structure. CRL follows these principles by implementing a
feedback control loop handling the agent's reactive behaviors (pre-wired
reflexes), along with an adaptive layer that uses reinforcement learning to
maximize long-term reward. We test our model in a multi-agent game-theoretic
task in which coordination must be achieved to find an optimal solution. We
show that CRL is able to reach human-level performance on standard
game-theoretic metrics such as efficiency in acquiring rewards and fairness in
reward distribution.
| cs.MA cs.AI cs.GT q-bio.NC stat.ML | what is the role of realtime control and learning in the formation of social conventions to answer this question we propose a computational model that matches human behavioral data in a social decisionmaking game that was analyzed both in discretetime and continuoustime setups furthermore unlike previous approaches our model takes into account the role of sensorimotor control loops in embodied decisionmaking scenarios for this purpose we introduce the controlbased reinforcement learning crl model crl is grounded in the distributed adaptive control dac theory of mind and brain where lowlevel sensorimotor control is modulated through perceptual and behavioral learning in a layered structure crl follows these principles by implementing a feedback control loop handling the agents reactive behaviors prewired reflexes along with an adaptive layer that uses reinforcement learning to maximize longterm reward we test our model in a multiagent gametheoretic task in which coordination must be achieved to find an optimal solution we show that crl is able to reach humanlevel performance on standard gametheoretic metrics such as efficiency in acquiring rewards and fairness in reward distribution | [['what', 'is', 'the', 'role', 'of', 'realtime', 'control', 'and', 'learning', 'in', 'the', 'formation', 'of', 'social', 'conventions', 'to', 'answer', 'this', 'question', 'we', 'propose', 'a', 'computational', 'model', 'that', 'matches', 'human', 'behavioral', 'data', 'in', 'a', 'social', 'decisionmaking', 'game', 'that', 'was', 'analyzed', 'both', 'in', 'discretetime', 'and', 'continuoustime', 'setups', 'furthermore', 'unlike', 'previous', 'approaches', 'our', 'model', 'takes', 'into', 'account', 'the', 'role', 'of', 'sensorimotor', 'control', 'loops', 'in', 'embodied', 'decisionmaking', 'scenarios', 'for', 'this', 'purpose', 'we', 'introduce', 'the', 'controlbased', 'reinforcement', 'learning', 'crl', 'model', 'crl', 'is', 'grounded', 'in', 'the', 'distributed', 'adaptive', 'control', 'dac', 'theory', 'of', 'mind', 'and', 'brain', 'where', 'lowlevel', 'sensorimotor', 'control', 'is', 'modulated', 'through', 'perceptual', 'and', 'behavioral', 'learning', 'in', 'a', 'layered', 'structure', 'crl', 'follows', 'these', 'principles', 'by', 'implementing', 'a', 'feedback', 'control', 'loop', 'handling', 'the', 'agents', 'reactive', 'behaviors', 'prewired', 'reflexes', 'along', 'with', 'an', 'adaptive', 'layer', 'that', 'uses', 'reinforcement', 'learning', 'to', 'maximize', 'longterm', 'reward', 'we', 'test', 'our', 'model', 'in', 'a', 'multiagent', 'gametheoretic', 'task', 'in', 'which', 'coordination', 'must', 'be', 'achieved', 'to', 'find', 'an', 'optimal', 'solution', 'we', 'show', 'that', 'crl', 'is', 'able', 'to', 'reach', 'humanlevel', 'performance', 'on', 'standard', 'gametheoretic', 'metrics', 'such', 'as', 'efficiency', 'in', 'acquiring', 'rewards', 'and', 'fairness', 'in', 'reward', 'distribution']] | [-0.08741678560605157, 0.018932902989652545, -0.08252004030460523, 0.051847814275937563, -0.12109173369583395, -0.1958879050982874, 0.06277254268482306, 0.48571963916601096, -0.28718666281908917, -0.30042337097943167, 0.03319122616890923, -0.20817438421749884, -0.2419449973767255, 0.13801000047327772, -0.19707115990304425, 0.07069521810922583, 0.03800480446244174, 0.03484472791180225, 0.03537922129982104, -0.22798480391554998, 0.2742074969610052, 0.06348293497079804, 0.3155631728807075, -0.001990052874036933, 0.14726876669844854, 0.0033622970383635348, 0.030855418577537697, 0.011862983604193281, -0.09030579741518698, 0.14243876699395713, 0.3757781964479446, 0.22860619115069677, 0.39806377105967344, -0.43557127209453933, -0.2326302429619061, 0.0721290533491384, 0.1270267046977487, 0.05787679845582967, -0.05252625461796688, -0.2956230828991044, 0.0827107731927723, -0.19796833295985466, -0.012324508486084093, -0.0690156573766453, -0.0685973728646519, -0.018848345157396265, -0.3229844913739674, -0.025834777813383752, 0.07168124698754927, 0.10192316969183121, -0.0953483390043053, -0.05749362055869973, 0.04212221496417529, 0.19554193753296625, 0.0036167381399099916, 0.014150018382838553, 0.2070931974380135, -0.18342826804271137, -0.23626933684099025, 0.3668468210656764, -0.018283262154308415, -0.18466558135351388, 0.15816211624933924, -0.036766149324633304, -0.1633947272311454, 0.06724456284658215, 0.2402555470086508, 0.10021886007076308, -0.19251624820260646, 0.028469154091964943, -0.05349750584517579, 0.21355132226263945, 0.0009660027752825096, -0.003949675035510359, 0.16431058255697753, 0.2718577971471484, 0.07680841779736224, 0.12092081414427777, -0.008050604935177723, -0.21878290780435847, -0.21757143202874452, -0.12618570791894182, -0.10572520611902415, 0.0015976662792944176, -0.10725403949840318, -0.10588172737950996, 0.33506537565572114, 0.2141052218111979, 0.16059804746965314, 0.12463189210640109, 0.3495240810578478, 0.08412115039937935, 0.04575988749768269, 0.08963747640991436, 0.21696616303817617, 0.006945950924589872, 0.1650409070553921, -0.24691093102686823, 0.15518377096415892, 0.016703142075520535] |
1,802.06109 | Toeplitz algebras in quantum Hopf fibrations | The paper presents applications of Toeplitz algebras in Noncommutative
Geometry. As an example, a quantum Hopf fibration is given by gluing trivial
U(1) bundles over quantum discs (or, synonymously, Toeplitz algebras) along
their boundaries. The construction yields associated quantum line bundles over
the generic Podles spheres which are isomorphic to those from the well-known
Hopf fibration of quantum SU(2). The relation between these two versions of
quantum Hopf fibrations is made precise by giving an isomorphism in the
category of right U(1)-comodules and left modules over the C*-algebra of the
generic Podles spheres. It is argued that the gluing construction yields a
significant simplification of index computations by obtaining elementary
projections as representatives of K-theory classes.
| math.QA | the paper presents applications of toeplitz algebras in noncommutative geometry as an example a quantum hopf fibration is given by gluing trivial u1 bundles over quantum discs or synonymously toeplitz algebras along their boundaries the construction yields associated quantum line bundles over the generic podles spheres which are isomorphic to those from the wellknown hopf fibration of quantum su2 the relation between these two versions of quantum hopf fibrations is made precise by giving an isomorphism in the category of right u1comodules and left modules over the calgebra of the generic podles spheres it is argued that the gluing construction yields a significant simplification of index computations by obtaining elementary projections as representatives of ktheory classes | [['the', 'paper', 'presents', 'applications', 'of', 'toeplitz', 'algebras', 'in', 'noncommutative', 'geometry', 'as', 'an', 'example', 'a', 'quantum', 'hopf', 'fibration', 'is', 'given', 'by', 'gluing', 'trivial', 'u1', 'bundles', 'over', 'quantum', 'discs', 'or', 'synonymously', 'toeplitz', 'algebras', 'along', 'their', 'boundaries', 'the', 'construction', 'yields', 'associated', 'quantum', 'line', 'bundles', 'over', 'the', 'generic', 'podles', 'spheres', 'which', 'are', 'isomorphic', 'to', 'those', 'from', 'the', 'wellknown', 'hopf', 'fibration', 'of', 'quantum', 'su2', 'the', 'relation', 'between', 'these', 'two', 'versions', 'of', 'quantum', 'hopf', 'fibrations', 'is', 'made', 'precise', 'by', 'giving', 'an', 'isomorphism', 'in', 'the', 'category', 'of', 'right', 'u1comodules', 'and', 'left', 'modules', 'over', 'the', 'calgebra', 'of', 'the', 'generic', 'podles', 'spheres', 'it', 'is', 'argued', 'that', 'the', 'gluing', 'construction', 'yields', 'a', 'significant', 'simplification', 'of', 'index', 'computations', 'by', 'obtaining', 'elementary', 'projections', 'as', 'representatives', 'of', 'ktheory', 'classes']] | [-0.1894433137839255, 0.09253388194736782, -0.060898518282920124, 0.07507231685525292, -0.08505247513885084, -0.17996752153596152, -0.066446001808483, 0.3541681451803964, -0.34841440755307024, -0.21009559689656548, 0.12306221606736274, -0.24573680539058684, -0.15478576504999933, 0.22500821868079188, -0.18756574729214545, -0.0044611597069255686, 0.07427764045803444, 0.08797355624030942, -0.1351859031184374, -0.25608970195702885, 0.4328846151009202, 0.010780322967785532, 0.21996608628769931, 0.019358347212571812, 0.08707501990315707, 0.035384286259827404, -0.019511557297538156, -0.026815750368911286, -0.15775394025594047, 0.11705472818373339, 0.32486073162340884, 0.028802276350071897, 0.13830373625513975, -0.3681020989123246, -0.09851676226016538, 0.14339046194623023, 0.15197200094218083, 0.01751642163903655, -0.022494012437274922, -0.32028208221106425, 0.03797597390316103, -0.2310903999888662, -0.0893186917245064, -0.103249501866167, 0.043906336042868054, -0.050154480346195074, -0.16827581177425124, -0.040958491405067236, 0.11826375535405849, 0.14651997775730233, -0.05371926794962391, -0.026698659550722526, -0.10516369822637542, 0.09131896808622, -0.019111344378261886, 0.007077672344672939, 0.15153888889952846, -0.10037563907427956, -0.19982532146994186, 0.3615143343482328, 0.011035840367169484, -0.22705071473230973, 0.1295455447792926, -0.08876640227795377, -0.14140709117561093, 0.15780363932008976, -0.013746733922997247, 0.13647558841368426, -0.008230237205229377, 0.20927409645240835, -0.13430084393805136, 0.06142252568438973, 0.11092825120962832, -0.0025580494178702, 0.20877737436524552, 0.07031974553575983, 0.07368197815654719, 0.1526220567240987, 0.05111269429275442, -0.16181232180932295, -0.36295588062165063, -0.22107184706103947, -0.07441958359078221, 0.18502752859684457, -0.13703260465876868, -0.22146857948163928, 0.40897244618314765, 0.04947950146768404, 0.22368290463219517, 0.09745524137827527, 0.23378943990430107, 0.023105778425688978, 0.10494829631491524, 0.0085031991156385, 0.15691388373708595, 0.30770678250321554, 0.00037658786421398754, -0.06771337077547998, -0.07492459520859562, 0.28207856261211894] |
1,802.0611 | Light, the universe, and everything -- 12 Herculean tasks for quantum
cowboys and black diamond skiers | The Winter Colloquium on the Physics of Quantum Electronics (PQE) has been a
seminal force in quantum optics and related areas since 1971. It is rather
mindboggling to recognize how the concepts presented at these conferences have
transformed scientific understanding and human society. In January, 2017, the
participants of PQE were asked to consider the equally important prospects for
the future, and to formulate a set of questions representing some of the
greatest aspirations in this broad field. The result is this multi-authored
paper, in which many of the world's leading experts address the following
fundamental questions: (1) What is the future of gravitational wave astronomy?
(2) Are there new quantum phases of matter away from equilibrium that can be
found and exploited - such as the time crystal? (3) Quantum theory in uncharted
territory: What can we learn? (4) What are the ultimate limits for laser photon
energies? (5) What are the ultimate limits to temporal, spatial, and optical
resolution? (6) What novel roles will atoms play in technology? (7) What
applications lie ahead for nitrogen-vacancy centers in diamond? (8) What is the
future of quantum coherence, squeezing, and entanglement for enhanced
superresolution and sensing? (9) How can we solve (some of) humanity's biggest
problems through new quantum technologies? (10) What new understanding of
materials and biological molecules will result from their dynamical
characterization with free electron lasers? (11) What new technologies and
fundamental discoveries might quantum optics achieve by the end of this
century? (12) What novel topological structures can be created and employed in
quantum optics?
| quant-ph cond-mat.other physics.optics | the winter colloquium on the physics of quantum electronics pqe has been a seminal force in quantum optics and related areas since 1971 it is rather mindboggling to recognize how the concepts presented at these conferences have transformed scientific understanding and human society in january 2017 the participants of pqe were asked to consider the equally important prospects for the future and to formulate a set of questions representing some of the greatest aspirations in this broad field the result is this multiauthored paper in which many of the worlds leading experts address the following fundamental questions 1 what is the future of gravitational wave astronomy 2 are there new quantum phases of matter away from equilibrium that can be found and exploited such as the time crystal 3 quantum theory in uncharted territory what can we learn 4 what are the ultimate limits for laser photon energies 5 what are the ultimate limits to temporal spatial and optical resolution 6 what novel roles will atoms play in technology 7 what applications lie ahead for nitrogenvacancy centers in diamond 8 what is the future of quantum coherence squeezing and entanglement for enhanced superresolution and sensing 9 how can we solve some of humanitys biggest problems through new quantum technologies 10 what new understanding of materials and biological molecules will result from their dynamical characterization with free electron lasers 11 what new technologies and fundamental discoveries might quantum optics achieve by the end of this century 12 what novel topological structures can be created and employed in quantum optics | [['the', 'winter', 'colloquium', 'on', 'the', 'physics', 'of', 'quantum', 'electronics', 'pqe', 'has', 'been', 'a', 'seminal', 'force', 'in', 'quantum', 'optics', 'and', 'related', 'areas', 'since', '1971', 'it', 'is', 'rather', 'mindboggling', 'to', 'recognize', 'how', 'the', 'concepts', 'presented', 'at', 'these', 'conferences', 'have', 'transformed', 'scientific', 'understanding', 'and', 'human', 'society', 'in', 'january', '2017', 'the', 'participants', 'of', 'pqe', 'were', 'asked', 'to', 'consider', 'the', 'equally', 'important', 'prospects', 'for', 'the', 'future', 'and', 'to', 'formulate', 'a', 'set', 'of', 'questions', 'representing', 'some', 'of', 'the', 'greatest', 'aspirations', 'in', 'this', 'broad', 'field', 'the', 'result', 'is', 'this', 'multiauthored', 'paper', 'in', 'which', 'many', 'of', 'the', 'worlds', 'leading', 'experts', 'address', 'the', 'following', 'fundamental', 'questions', '1', 'what', 'is', 'the', 'future', 'of', 'gravitational', 'wave', 'astronomy', '2', 'are', 'there', 'new', 'quantum', 'phases', 'of', 'matter', 'away', 'from', 'equilibrium', 'that', 'can', 'be', 'found', 'and', 'exploited', 'such', 'as', 'the', 'time', 'crystal', '3', 'quantum', 'theory', 'in', 'uncharted', 'territory', 'what', 'can', 'we', 'learn', '4', 'what', 'are', 'the', 'ultimate', 'limits', 'for', 'laser', 'photon', 'energies', '5', 'what', 'are', 'the', 'ultimate', 'limits', 'to', 'temporal', 'spatial', 'and', 'optical', 'resolution', '6', 'what', 'novel', 'roles', 'will', 'atoms', 'play', 'in', 'technology', '7', 'what', 'applications', 'lie', 'ahead', 'for', 'nitrogenvacancy', 'centers', 'in', 'diamond', '8', 'what', 'is', 'the', 'future', 'of', 'quantum', 'coherence', 'squeezing', 'and', 'entanglement', 'for', 'enhanced', 'superresolution', 'and', 'sensing', '9', 'how', 'can', 'we', 'solve', 'some', 'of', 'humanitys', 'biggest', 'problems', 'through', 'new', 'quantum', 'technologies', '10', 'what', 'new', 'understanding', 'of', 'materials', 'and', 'biological', 'molecules', 'will', 'result', 'from', 'their', 'dynamical', 'characterization', 'with', 'free', 'electron', 'lasers', '11', 'what', 'new', 'technologies', 'and', 'fundamental', 'discoveries', 'might', 'quantum', 'optics', 'achieve', 'by', 'the', 'end', 'of', 'this', 'century', '12', 'what', 'novel', 'topological', 'structures', 'can', 'be', 'created', 'and', 'employed', 'in', 'quantum', 'optics']] | [-0.05983338750765276, 0.1972183577432983, -0.07440416495696563, 0.08596540012716337, -0.06455702603976927, -0.1590090253766691, 0.016499254675203023, 0.36309311515290665, -0.2777180933310513, -0.3492323207549837, 0.11191124681386981, -0.2838076708672294, -0.1733248029260665, 0.22351963534705746, -0.09277944623803099, 0.06700372026241457, 0.02823705833573111, 0.02637553528626269, -0.016853238873782952, -0.28270993383994775, 0.2675658339641757, 0.07210447326620188, 0.27187860526222113, 0.08101408256105821, 0.0634071239154757, -0.015270043170583152, -0.016358428918296298, -0.036961173487090784, -0.14306743295442845, 0.16056758341336147, 0.3415706758387387, 0.16172860142487902, 0.3131201613167402, -0.45033776506333967, -0.201405926399987, 0.07159440793988635, 0.13197512203437645, 0.11256377055181566, -0.05082841283441413, -0.2892690460331189, 0.039636334213256734, -0.13226585744432529, -0.1390422396402438, -0.0380732483833364, 0.0344171628573469, -0.019653470925048225, -0.14593848641131565, 0.015655184766460866, 0.05060667236159148, 0.08238577566722358, -0.015389368300824317, -0.10932264610125084, 0.0651880769968726, 0.16679166985473545, -0.033494928991828155, 0.04622149731613724, 0.14350430426808694, -0.18874117811553381, -0.19662228958544054, 0.41810108684436526, 0.01955661322703123, -0.10196247649588441, 0.19221991531157417, -0.17244698375003464, -0.1352449827538731, 0.07907360042048286, 0.1704134339917462, 0.06260603685234312, -0.16666778766240134, 0.0634836714309568, -0.006078995861663111, 0.15491467925932895, 0.11778780054698099, 0.09718826609616737, 0.2750832669963959, 0.1679276605533768, 0.0594739367661532, 0.08132619009030145, -0.07717429499875164, -0.09802553654096068, -0.2620329801931746, -0.18143964628508502, -0.15194021117902368, 0.0982540984839506, -0.01876630043453454, -0.08029322621527975, 0.3782316442838935, 0.20073723018687406, 0.10913902447493963, -0.06480460267833456, 0.24052005150723596, 0.06741792409616033, 0.055293063934475715, 0.02355837518558657, 0.2795469500460615, 0.12002117319985531, 0.16840416008661602, -0.14831231810989998, 0.012929751303104697, 0.009056061149805842] |
1,802.06111 | The small-x gluon distribution in centrality biased pA and pp collisions | The nuclear modification factor $R_{pA}(p_T)$ provides information on the
small-$x$ gluon distribution of a nucleus at hadron colliders. Several
experiments have recently measured the nuclear modification factor not only in
minimum bias but also for central $pA$ collisions. In this paper we analyze the
bias on the configurations of soft gluon fields introduced by a centrality
selection via the number of hard particles. Such bias can be viewed as
reweighting of configurations of small-$x$ gluons. We find that the biased
nuclear modification factor ${\cal Q}_{pA}(p_T)$ for central collisions is
above $R_{pA}(p_T)$ for minimum bias events, and that it may redevelop a
"Cronin peak" even at small $x$. The magnitude of the peak is predicted to
increase approximately like $1/{A_{\perp}}^\nu$, $\nu\sim0.6\pm0.1$, if one is
able to select more compact configurations of the projectile proton where its
gluons occupy a smaller transverse area $A_\perp$. We predict an enhanced
${\cal
Q}_{pp}(p_T)-1 \sim 1/(p_T^2)^\nu$ and a Cronin peak even for central $pp$
collisions.
| hep-ph nucl-th | the nuclear modification factor r_pap_t provides information on the smallx gluon distribution of a nucleus at hadron colliders several experiments have recently measured the nuclear modification factor not only in minimum bias but also for central pa collisions in this paper we analyze the bias on the configurations of soft gluon fields introduced by a centrality selection via the number of hard particles such bias can be viewed as reweighting of configurations of smallx gluons we find that the biased nuclear modification factor cal q_pap_t for central collisions is above r_pap_t for minimum bias events and that it may redevelop a cronin peak even at small x the magnitude of the peak is predicted to increase approximately like 1a_perpnu nusim06pm01 if one is able to select more compact configurations of the projectile proton where its gluons occupy a smaller transverse area a_perp we predict an enhanced cal q_ppp_t1 sim 1p_t2nu and a cronin peak even for central pp collisions | [['the', 'nuclear', 'modification', 'factor', 'r_pap_t', 'provides', 'information', 'on', 'the', 'smallx', 'gluon', 'distribution', 'of', 'a', 'nucleus', 'at', 'hadron', 'colliders', 'several', 'experiments', 'have', 'recently', 'measured', 'the', 'nuclear', 'modification', 'factor', 'not', 'only', 'in', 'minimum', 'bias', 'but', 'also', 'for', 'central', 'pa', 'collisions', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'bias', 'on', 'the', 'configurations', 'of', 'soft', 'gluon', 'fields', 'introduced', 'by', 'a', 'centrality', 'selection', 'via', 'the', 'number', 'of', 'hard', 'particles', 'such', 'bias', 'can', 'be', 'viewed', 'as', 'reweighting', 'of', 'configurations', 'of', 'smallx', 'gluons', 'we', 'find', 'that', 'the', 'biased', 'nuclear', 'modification', 'factor', 'cal', 'q_pap_t', 'for', 'central', 'collisions', 'is', 'above', 'r_pap_t', 'for', 'minimum', 'bias', 'events', 'and', 'that', 'it', 'may', 'redevelop', 'a', 'cronin', 'peak', 'even', 'at', 'small', 'x', 'the', 'magnitude', 'of', 'the', 'peak', 'is', 'predicted', 'to', 'increase', 'approximately', 'like', '1a_perpnu', 'nusim06pm01', 'if', 'one', 'is', 'able', 'to', 'select', 'more', 'compact', 'configurations', 'of', 'the', 'projectile', 'proton', 'where', 'its', 'gluons', 'occupy', 'a', 'smaller', 'transverse', 'area', 'a_perp', 'we', 'predict', 'an', 'enhanced', 'cal', 'q_ppp_t1', 'sim', '1p_t2nu', 'and', 'a', 'cronin', 'peak', 'even', 'for', 'central', 'pp', 'collisions']] | [-0.06446011081961363, 0.19837464833002932, -0.1333804151371097, 0.15542318177636175, -0.02420560886017292, -0.0825976672759249, 0.004673706726814424, 0.3679238536140857, -0.20134331259606897, -0.30049017780019266, 0.00309978736913763, -0.30452472890580173, 0.013888072761657991, 0.1362312109895835, -0.010286715643719378, 0.0026520409825791015, 0.06020333558569148, 0.036283778216640805, -0.043075234633809155, -0.2116996945850061, 0.3008974563838963, 0.1176171686108175, 0.2249745904991869, 0.14599204174397815, 0.10112697282640606, 0.07452585722479087, 0.009356556708409795, 0.05711266482601212, -0.09479603647244068, 0.045042962178022686, 0.2544628590051281, 0.05087190461467559, 0.2271524964415125, -0.35215711598529625, -0.1310203914349825, 0.13858560402571274, 0.1556125575742427, 0.09854740115636225, -0.05244823183841761, -0.190676395720067, 0.11655739925519906, -0.24968720114453677, -0.14152213110049305, -0.051446347362606934, 0.04984757137840221, -0.009151830711696101, -0.3106899624659778, 0.10440654922441402, 0.017230100657846043, 0.018525834630341513, 0.03496840918255897, -0.18658735174272137, -0.04361119407756058, 0.028290297459247278, 0.06160847825690565, 0.12410055556699119, 0.23858830157213992, -0.20296103724869777, -0.10914846958506755, 0.3686207611187312, -0.004595912482871331, -0.12368361634128776, 0.1449289538646362, -0.20731864800358094, -0.14893497159937397, 0.1642032975245169, 0.24134236377492352, 0.10904645871242362, -0.15613264664027252, 0.029674904604019645, -0.027018359868395094, 0.19864800010844574, 0.1112461220641547, 0.05158931892564349, 0.17662009329682118, 0.17663144728239308, 0.06285317812121081, 0.10707412802730687, -0.1353229006207058, -0.05274457645627033, -0.33606221906130057, -0.05181329108247729, -0.136549696862379, 0.07046841925531273, -0.11434203450316043, -0.08676911771640573, 0.3639555008604044, 0.09467295867369485, 0.2674428841135906, -0.02870541231976332, 0.258483739647904, 0.13928211948261474, 0.11747656164592818, 0.1002656057703701, 0.29181220686357273, 0.13642680279965708, 0.10875198166621358, -0.23927802707705842, 0.054024457131929104, 0.019744184021347838] |
1,802.06112 | Affine quadrics and the Picard group of the motivic category | In this article we study the subgroup of the Picard group of Voevodsky's
category of geometric motives generated by the reduced motives of affine
quadrics. Our main tools here are the functors of Bachmann, but we also provide
an alternative method. We show that the group in question can be described in
terms of indecomposable direct summands in the motives of projective quadrics.
In particular, we describe all the relations among the reduced motives of
affine quadrics. We also extend the Criterion of motivic equivalence of
projective quadrics.
| math.AG math.AT math.KT | in this article we study the subgroup of the picard group of voevodskys category of geometric motives generated by the reduced motives of affine quadrics our main tools here are the functors of bachmann but we also provide an alternative method we show that the group in question can be described in terms of indecomposable direct summands in the motives of projective quadrics in particular we describe all the relations among the reduced motives of affine quadrics we also extend the criterion of motivic equivalence of projective quadrics | [['in', 'this', 'article', 'we', 'study', 'the', 'subgroup', 'of', 'the', 'picard', 'group', 'of', 'voevodskys', 'category', 'of', 'geometric', 'motives', 'generated', 'by', 'the', 'reduced', 'motives', 'of', 'affine', 'quadrics', 'our', 'main', 'tools', 'here', 'are', 'the', 'functors', 'of', 'bachmann', 'but', 'we', 'also', 'provide', 'an', 'alternative', 'method', 'we', 'show', 'that', 'the', 'group', 'in', 'question', 'can', 'be', 'described', 'in', 'terms', 'of', 'indecomposable', 'direct', 'summands', 'in', 'the', 'motives', 'of', 'projective', 'quadrics', 'in', 'particular', 'we', 'describe', 'all', 'the', 'relations', 'among', 'the', 'reduced', 'motives', 'of', 'affine', 'quadrics', 'we', 'also', 'extend', 'the', 'criterion', 'of', 'motivic', 'equivalence', 'of', 'projective', 'quadrics']] | [-0.17567898778890428, 0.0018211712874538287, -0.1344717193146194, 0.06886595551490741, -0.05573261564660987, -0.07930992351082916, -0.02183177194621583, 0.34909352857026865, -0.3962613370862197, -0.1985131778055802, 0.050344856576306156, -0.18749556237493048, -0.203386799308646, 0.20544916956516152, -0.26300327492010017, -0.04561260481238027, 0.023219678704415193, 0.03719638286731259, -0.10450423024436035, -0.38586347797800874, 0.5063046860767909, -0.05146986270979555, 0.22190235675820572, 0.04657093705530067, 0.11511053668263313, 0.01711555856639858, -0.05351418783803555, -0.03281184674282982, -0.13873050701237266, 0.19144879398994485, 0.39421014077114785, 0.08933010870929468, 0.18150292204253757, -0.392945574787022, -0.08289401248012754, 0.23503915606257084, 0.13806940900394693, 0.0676476746712896, 0.001966143315340477, -0.2705380929930305, 0.09659548447763716, -0.2565342617983168, -0.14728027880615133, -0.10295785679376092, 0.018105056094513697, 0.027192979503359475, -0.16244863737797874, -0.014092180830960966, 0.08578627260232513, 0.22680084096183153, -0.11052915404434316, -0.07230239120227369, -0.08466776884531348, 0.07227071093141356, -0.0052426552018997345, -0.024127641446697948, 0.10463104790224778, -0.08639093868127516, -0.15968070113608104, 0.3914310443426736, -0.027666877415454524, -0.2120250124505467, 0.10672130176945674, -0.15936981659615412, -0.14134789615425028, 0.1160636736101217, 0.07130431209225208, 0.20787355304293503, 0.013716048815033653, 0.1529428839250448, -0.1894219200740653, 0.062248164422767746, 0.08726482466127808, -0.004905010779938576, 0.10579463126751679, 0.0817760980386414, -0.006820215166292407, 0.14660120743131053, 0.04014740889595652, -0.013860541364093397, -0.4118507757613605, -0.2954154831187969, -0.062262373334802265, 0.11384521909481422, -0.12520765101329412, -0.1036962527485395, 0.41458076812242245, 0.15878124862634155, 0.1584224185419523, 0.13863492552561432, 0.2542816069696776, 0.007747800950627689, 0.011451116116156547, -0.01495918194996193, 0.20354423627511345, 0.2629528528910173, -0.08036002955949781, -0.08713833960196511, -0.04627684167776765, 0.22918784860733218] |
1,802.06113 | Optics and bremsstrahlung estimates for channeling radiation experiments
at FAST | This paper presents X-ray spectra of channeling radiation (CR) expected at
the FAST (Fermi Accelerator Science and Technology) facility in Fermilab. Our
purpose is to produce high brightness quasi-monochromatic X-rays in an energy
range from 40 keV to 110 keV. We will use a diamond crystal and low emittance
electrons with an energy of around 43 MeV. The quality of emitted X-rays
strongly depends on parameters of the electron beam at the crystal. We present
simulations of the beam optics for high brightness and high yield operations
with bunch charges of 1 pC, 20 pC, and 200 pC. We estimate the X-ray spectra
including bremsstrahlung background for a charge of 20 pC. The electron beam
distributions with and without channeling in the diamond crystal are
calculated. We discuss an X-ray detector system to avoid pile-up effect during
high charge operations.
| physics.acc-ph | this paper presents xray spectra of channeling radiation cr expected at the fast fermi accelerator science and technology facility in fermilab our purpose is to produce high brightness quasimonochromatic xrays in an energy range from 40 kev to 110 kev we will use a diamond crystal and low emittance electrons with an energy of around 43 mev the quality of emitted xrays strongly depends on parameters of the electron beam at the crystal we present simulations of the beam optics for high brightness and high yield operations with bunch charges of 1 pc 20 pc and 200 pc we estimate the xray spectra including bremsstrahlung background for a charge of 20 pc the electron beam distributions with and without channeling in the diamond crystal are calculated we discuss an xray detector system to avoid pileup effect during high charge operations | [['this', 'paper', 'presents', 'xray', 'spectra', 'of', 'channeling', 'radiation', 'cr', 'expected', 'at', 'the', 'fast', 'fermi', 'accelerator', 'science', 'and', 'technology', 'facility', 'in', 'fermilab', 'our', 'purpose', 'is', 'to', 'produce', 'high', 'brightness', 'quasimonochromatic', 'xrays', 'in', 'an', 'energy', 'range', 'from', '40', 'kev', 'to', '110', 'kev', 'we', 'will', 'use', 'a', 'diamond', 'crystal', 'and', 'low', 'emittance', 'electrons', 'with', 'an', 'energy', 'of', 'around', '43', 'mev', 'the', 'quality', 'of', 'emitted', 'xrays', 'strongly', 'depends', 'on', 'parameters', 'of', 'the', 'electron', 'beam', 'at', 'the', 'crystal', 'we', 'present', 'simulations', 'of', 'the', 'beam', 'optics', 'for', 'high', 'brightness', 'and', 'high', 'yield', 'operations', 'with', 'bunch', 'charges', 'of', '1', 'pc', '20', 'pc', 'and', '200', 'pc', 'we', 'estimate', 'the', 'xray', 'spectra', 'including', 'bremsstrahlung', 'background', 'for', 'a', 'charge', 'of', '20', 'pc', 'the', 'electron', 'beam', 'distributions', 'with', 'and', 'without', 'channeling', 'in', 'the', 'diamond', 'crystal', 'are', 'calculated', 'we', 'discuss', 'an', 'xray', 'detector', 'system', 'to', 'avoid', 'pileup', 'effect', 'during', 'high', 'charge', 'operations']] | [-0.03717628067159759, 0.20836217667123752, -0.037703827642170444, 0.06136980678482879, -0.005149433839376018, -0.09684155517939612, 0.03486523856990971, 0.4789703535581274, -0.20438562141415398, -0.4002746858234916, 0.016084760468220338, -0.3675862282315003, 0.09141064677512206, 0.24202691387285347, -0.01747694780850517, 0.04225594087370804, 0.05298955373166661, -0.07140029017713719, -0.08939286906139127, -0.16783345328627286, 0.2240003241093031, 0.22049147802005922, 0.27858425279014876, 0.1242831328817244, 0.13422254505234638, 0.03440063703414385, 0.019992784142959862, -0.08071795715285199, -0.10868147328229887, 0.05501705170609057, 0.24643639434860753, 0.04584650510971967, 0.17775225464055047, -0.43654986057164413, -0.18184130917569355, 0.024858908586403623, 0.11401255114719139, 0.04921622470387125, -0.10619641018648898, -0.19685482578019478, 0.09085140491037497, -0.1928876498248428, -0.18655025238570358, 0.03309185010148212, -0.03438410120683589, 0.04167878364678472, -0.20161118365691177, 0.05721517090486097, -0.01937039431816499, 0.0897430479227166, -0.10252903806311743, -0.09992754014092498, 0.025755724947833056, -0.018594301730627195, 0.005867196684370616, 0.07851030615025333, 0.22769489554422243, -0.09924931204711486, -0.08911922293149734, 0.3935093958230157, -0.005246855907275208, -0.03203135300677137, 0.16328434597983557, -0.25840900245155873, -0.07307455194448786, 0.25176913126238754, 0.17730684145894235, 0.07942125993182085, -0.1411268887775285, 0.006541966172725162, 0.055024692477724915, 0.2463986477465369, 0.11880823522473552, 0.06836216287920252, 0.25376877768763473, 0.1581615160277579, 0.04778087110192116, 0.1398482542198118, -0.2832904063847049, 0.06219486169284209, -0.2803013019928975, -0.10864400211721659, -0.14109597317832856, 0.07246444328421993, -0.0620613176470215, -0.11262830860713231, 0.39284417152604356, 0.10306967730866745, 0.14171205598727932, -0.04984084233874455, 0.298880614443416, 0.0874319964229861, 0.05316096043347248, 0.0877012195098879, 0.27578439691569656, 0.1439104667931263, 0.16668109477530899, -0.24484176096739246, -0.050134822576572854, -0.04289954450214282] |
1,802.06114 | Restricting the bi-equivariant spectral triple on quantum SU(2) to the
Podles spheres | It is shown that the isospectral bi-equivariant spectral triple on quantum
SU(2) and the isospectral equivariant spectral triples on the Podles spheres
are related by restriction. In this approach, the equatorial Podles sphere is
distinguished because only in this case the restricted spectral triple admits
an equivariant grading operator together with a real structure (up to
infinitesimals of arbitrary high order). The real structure is expressed by the
Tomita operator on quantum SU(2) and it is shown that the failure of the real
structure to satisfy the commutant property is related to the failure of the
universal R-matrix operator to be unitary.
| math.QA | it is shown that the isospectral biequivariant spectral triple on quantum su2 and the isospectral equivariant spectral triples on the podles spheres are related by restriction in this approach the equatorial podles sphere is distinguished because only in this case the restricted spectral triple admits an equivariant grading operator together with a real structure up to infinitesimals of arbitrary high order the real structure is expressed by the tomita operator on quantum su2 and it is shown that the failure of the real structure to satisfy the commutant property is related to the failure of the universal rmatrix operator to be unitary | [['it', 'is', 'shown', 'that', 'the', 'isospectral', 'biequivariant', 'spectral', 'triple', 'on', 'quantum', 'su2', 'and', 'the', 'isospectral', 'equivariant', 'spectral', 'triples', 'on', 'the', 'podles', 'spheres', 'are', 'related', 'by', 'restriction', 'in', 'this', 'approach', 'the', 'equatorial', 'podles', 'sphere', 'is', 'distinguished', 'because', 'only', 'in', 'this', 'case', 'the', 'restricted', 'spectral', 'triple', 'admits', 'an', 'equivariant', 'grading', 'operator', 'together', 'with', 'a', 'real', 'structure', 'up', 'to', 'infinitesimals', 'of', 'arbitrary', 'high', 'order', 'the', 'real', 'structure', 'is', 'expressed', 'by', 'the', 'tomita', 'operator', 'on', 'quantum', 'su2', 'and', 'it', 'is', 'shown', 'that', 'the', 'failure', 'of', 'the', 'real', 'structure', 'to', 'satisfy', 'the', 'commutant', 'property', 'is', 'related', 'to', 'the', 'failure', 'of', 'the', 'universal', 'rmatrix', 'operator', 'to', 'be', 'unitary']] | [-0.11939675713530924, 0.07914184877211251, -0.08411319577591676, 0.08759839056109936, -0.09620080278346352, -0.1369114878231331, -0.05356786378166255, 0.35719153069544074, -0.29865638244276244, -0.21258106646949754, 0.1164613298123917, -0.2691622402920735, -0.18043129857830412, 0.17683604777808867, -0.13050094665046416, 0.07459524134173989, 0.07478799644455898, 0.1372864399830481, -0.09992875064399057, -0.2383031465070934, 0.4164059189531733, 0.02725277870993915, 0.246501195034487, 0.0742674391424539, 0.09870763852114917, 0.024013320340172332, 0.012313367817185674, -0.042119132907257655, -0.07848016953842792, 0.13524239232727125, 0.24168575373386927, 0.054845988709370005, 0.15017923209633605, -0.34147197258311746, -0.12662310778692948, 0.13267274666577578, 0.10674424734715299, -0.00789814411352078, 0.04322038045468028, -0.3032427426386515, 0.11501240342691102, -0.19061758864086634, -0.14585629407791237, -0.10554581959092733, 0.015101768697301546, -0.0405733640232653, -0.22430626937820503, 0.016055840332353234, 0.09191891078051984, 0.057734843553500434, -0.0549610138131196, -0.024618164535757957, -0.05504929296234075, 0.08188939069662535, -0.018307260646229135, 0.03476009363600729, 0.11812288051142412, -0.05451332240858499, -0.1326860431730108, 0.416808011558126, -0.02026551576244517, -0.2679007971184511, 0.13675210964135534, -0.165256359020942, -0.14978909315815306, 0.11912894480879985, 0.030678831993867003, 0.11848305063504799, -0.04880302347951596, 0.22497888140302771, -0.0930878775486467, 0.1250655344532182, 0.07970720432315241, -0.018104651349359284, 0.13689883604848885, 0.03865767054387605, 0.07585582384547475, 0.12251850521972622, 0.028250972788287875, -0.1439397187958307, -0.31649986145944864, -0.17761464722856296, -0.2070024662089589, 0.13570216055229015, -0.11621657515591804, -0.21969614851952748, 0.40534363730865364, 0.07246576626693793, 0.220493871508641, 0.014616173655525143, 0.2438246604504849, 0.16419288585209013, 0.1234095048013271, 0.020403506138416773, 0.20320685834203864, 0.22061410477366664, 0.019039503718708075, -0.22145849228927902, -0.02866975896462214, 0.16238678489610844] |
1,802.06115 | On the dissociation between potential vorticity conservation and
symmetries | Using a four-dimensional manifestly covariant formalism suitable for
classical fluid dynamics, it is shown that the conservation of potential
vorticity is not associated with any symmetry of the equations of motion but is
instead a trivial conservation law of the second kind. The demonstration is
provided in arbitrary coordinates and therefore applies to comoving (or label)
coordinates. Since this is at odds with previous studies, which claimed that
potential vorticity conservation is associated with a symmetry under
particle-relabeling, a detailed discussion on relabeling transformations is
also presented.
| physics.flu-dyn | using a fourdimensional manifestly covariant formalism suitable for classical fluid dynamics it is shown that the conservation of potential vorticity is not associated with any symmetry of the equations of motion but is instead a trivial conservation law of the second kind the demonstration is provided in arbitrary coordinates and therefore applies to comoving or label coordinates since this is at odds with previous studies which claimed that potential vorticity conservation is associated with a symmetry under particlerelabeling a detailed discussion on relabeling transformations is also presented | [['using', 'a', 'fourdimensional', 'manifestly', 'covariant', 'formalism', 'suitable', 'for', 'classical', 'fluid', 'dynamics', 'it', 'is', 'shown', 'that', 'the', 'conservation', 'of', 'potential', 'vorticity', 'is', 'not', 'associated', 'with', 'any', 'symmetry', 'of', 'the', 'equations', 'of', 'motion', 'but', 'is', 'instead', 'a', 'trivial', 'conservation', 'law', 'of', 'the', 'second', 'kind', 'the', 'demonstration', 'is', 'provided', 'in', 'arbitrary', 'coordinates', 'and', 'therefore', 'applies', 'to', 'comoving', 'or', 'label', 'coordinates', 'since', 'this', 'is', 'at', 'odds', 'with', 'previous', 'studies', 'which', 'claimed', 'that', 'potential', 'vorticity', 'conservation', 'is', 'associated', 'with', 'a', 'symmetry', 'under', 'particlerelabeling', 'a', 'detailed', 'discussion', 'on', 'relabeling', 'transformations', 'is', 'also', 'presented']] | [-0.16666483681047942, 0.12675449910552003, -0.13461021726496172, 0.03568255002231359, -0.12891901806430067, -0.14741512265619497, -0.029893154933572162, 0.30851778228832194, -0.212515540940817, -0.26321942894178074, 0.06677368575663761, -0.2502772089657049, -0.13475654482960614, 0.1274021497066674, -0.07183282986976379, 0.045521213976276474, 0.02636929804480873, 0.08915033049578237, -0.08321683453720842, -0.20305200547066538, 0.3287024035465059, 0.0719762342483845, 0.2950684600184823, 0.016603792808424726, 0.16227289814458684, -0.022671944683764215, -0.047707019844850485, 0.05765679943765145, -0.08083154848146626, 0.06062311202634212, 0.1670007112105702, 0.07493950887908075, 0.21724686947066424, -0.39839358846548684, -0.2322033776598441, 0.0703435284843625, 0.12124090563765792, 0.14317307060145837, -0.08134879500148388, -0.2698328539425897, 0.07174002769441062, -0.1391863731591594, -0.19515905241200396, -0.1129973959719199, 0.0613852217576878, -0.002757103258180757, -0.2648463632402465, 0.1363860699046961, 0.09006645849927566, 0.06060629563276158, -0.08801600428265628, -0.027050737518990457, -0.07390727826697362, 0.03639698348841955, 0.0860687762737101, 0.07147380321958037, 0.09435708968910973, -0.10253819886887403, -0.08852870930744292, 0.4731391424876313, -0.0008254802913058463, -0.3147808478192188, 0.17088847464427007, -0.13764368562937476, -0.17049842539005156, 0.1186347261428573, 0.08077155936747617, 0.13579160046161676, -0.17109529109844981, 0.11040953468723591, -0.041099815261225366, 0.16075633081531715, 0.047939138741470703, -0.028665382274274908, 0.18811118358009776, 0.08238208263592664, 0.09730115265390554, 0.08973539948225194, -0.00412494168199902, -0.16742191580665666, -0.4229521877890409, -0.17852981639238308, -0.21318676084453284, 0.08316583222412466, -0.03369497839171239, -0.13597852997799934, 0.3540765150168607, 0.1103503042202562, 0.1414507138542831, 0.050915971329316585, 0.2908609946323342, 0.15408167559220348, 0.10034914091662613, 0.07044805460176322, 0.23103341076869605, 0.14757141710237362, 0.1119774586919067, -0.19825488486805076, 0.025596043869289896, 0.09963128885774072] |
1,802.06116 | Evolution of H$_2$O Production in Comet C/2012 S1 (ISON) as Inferred
from Forbidden Oxygen and OH Emission | We present H$_2$O production rates for comet C/2012 S1 (ISON) derived from
observations of [OI] and OH emission during its inbound leg, covering a
heliocentric distance range of 1.8-0.44 AU. Our production rates are in
agreement with previous measurements using a variety of instruments and
techniques and with data from the various observatories greatly differing in
their projected fields of view. The consistent results across all data suggest
the absence of an extended source of H$_2$O production, for example sublimation
of icy grains in the coma, or a source with spatial extent confined to the
dimensions of the smallest projected field of view (in this case $<$ 1,000 km).
We find that ISON had an active area of around 10 km$^2$ for heliocentric
distances R$_h$ > 1.2 AU, which then decreased to about half this value from
R$_h$=1.2-0.9 AU. This was followed by a rapid increase in active area at about
R$_h$=0.6 AU, corresponding to the first of three major outbursts ISON
experienced inside of 1 AU. The combination of a detected outburst in the light
curve and rapid increase in active area likely indicates a major nucleus
fragmentation event. The 5-10 km$^2$ active area observed outside of R$_h$=0.6
AU is consistent with a 50-100% active fraction for the nucleus, larger than
typically observed for cometary nuclei. Although the absolute value of the
active area is somewhat dependent on the thermal model employed, the changes in
active area observed are consistent among models. The conclusion of a 50-100+%
active fraction is robust for realistic thermal models of the nucleus. However
the possibility of a contribution of a spatially unresolved distribution of icy
grains cannot be discounted.
| astro-ph.EP | we present h_2o production rates for comet c2012 s1 ison derived from observations of oi and oh emission during its inbound leg covering a heliocentric distance range of 18044 au our production rates are in agreement with previous measurements using a variety of instruments and techniques and with data from the various observatories greatly differing in their projected fields of view the consistent results across all data suggest the absence of an extended source of h_2o production for example sublimation of icy grains in the coma or a source with spatial extent confined to the dimensions of the smallest projected field of view in this case 1000 km we find that ison had an active area of around 10 km2 for heliocentric distances r_h 12 au which then decreased to about half this value from r_h1209 au this was followed by a rapid increase in active area at about r_h06 au corresponding to the first of three major outbursts ison experienced inside of 1 au the combination of a detected outburst in the light curve and rapid increase in active area likely indicates a major nucleus fragmentation event the 510 km2 active area observed outside of r_h06 au is consistent with a 50100 active fraction for the nucleus larger than typically observed for cometary nuclei although the absolute value of the active area is somewhat dependent on the thermal model employed the changes in active area observed are consistent among models the conclusion of a 50100 active fraction is robust for realistic thermal models of the nucleus however the possibility of a contribution of a spatially unresolved distribution of icy grains cannot be discounted | [['we', 'present', 'h_2o', 'production', 'rates', 'for', 'comet', 'c2012', 's1', 'ison', 'derived', 'from', 'observations', 'of', 'oi', 'and', 'oh', 'emission', 'during', 'its', 'inbound', 'leg', 'covering', 'a', 'heliocentric', 'distance', 'range', 'of', '18044', 'au', 'our', 'production', 'rates', 'are', 'in', 'agreement', 'with', 'previous', 'measurements', 'using', 'a', 'variety', 'of', 'instruments', 'and', 'techniques', 'and', 'with', 'data', 'from', 'the', 'various', 'observatories', 'greatly', 'differing', 'in', 'their', 'projected', 'fields', 'of', 'view', 'the', 'consistent', 'results', 'across', 'all', 'data', 'suggest', 'the', 'absence', 'of', 'an', 'extended', 'source', 'of', 'h_2o', 'production', 'for', 'example', 'sublimation', 'of', 'icy', 'grains', 'in', 'the', 'coma', 'or', 'a', 'source', 'with', 'spatial', 'extent', 'confined', 'to', 'the', 'dimensions', 'of', 'the', 'smallest', 'projected', 'field', 'of', 'view', 'in', 'this', 'case', '1000', 'km', 'we', 'find', 'that', 'ison', 'had', 'an', 'active', 'area', 'of', 'around', '10', 'km2', 'for', 'heliocentric', 'distances', 'r_h', '12', 'au', 'which', 'then', 'decreased', 'to', 'about', 'half', 'this', 'value', 'from', 'r_h1209', 'au', 'this', 'was', 'followed', 'by', 'a', 'rapid', 'increase', 'in', 'active', 'area', 'at', 'about', 'r_h06', 'au', 'corresponding', 'to', 'the', 'first', 'of', 'three', 'major', 'outbursts', 'ison', 'experienced', 'inside', 'of', '1', 'au', 'the', 'combination', 'of', 'a', 'detected', 'outburst', 'in', 'the', 'light', 'curve', 'and', 'rapid', 'increase', 'in', 'active', 'area', 'likely', 'indicates', 'a', 'major', 'nucleus', 'fragmentation', 'event', 'the', '510', 'km2', 'active', 'area', 'observed', 'outside', 'of', 'r_h06', 'au', 'is', 'consistent', 'with', 'a', '50100', 'active', 'fraction', 'for', 'the', 'nucleus', 'larger', 'than', 'typically', 'observed', 'for', 'cometary', 'nuclei', 'although', 'the', 'absolute', 'value', 'of', 'the', 'active', 'area', 'is', 'somewhat', 'dependent', 'on', 'the', 'thermal', 'model', 'employed', 'the', 'changes', 'in', 'active', 'area', 'observed', 'are', 'consistent', 'among', 'models', 'the', 'conclusion', 'of', 'a', '50100', 'active', 'fraction', 'is', 'robust', 'for', 'realistic', 'thermal', 'models', 'of', 'the', 'nucleus', 'however', 'the', 'possibility', 'of', 'a', 'contribution', 'of', 'a', 'spatially', 'unresolved', 'distribution', 'of', 'icy', 'grains', 'can', 'not', 'be', 'discounted']] | [-0.06843861873000448, 0.14385888618694162, -0.037827407757363304, 0.040856349927835454, 0.007325205729408293, -0.07149160085623994, 0.05135382154189236, 0.3921585252037705, -0.1954377000512232, -0.3653897543985919, 0.10760130686341782, -0.3303961934233119, -0.02901157703700843, 0.19805715374504232, -0.0628309526680058, -0.025264423454826445, 0.05620478680168323, -0.012920556905270447, -0.04595034400850012, -0.19947991003643212, 0.2388158970077718, 0.11485002147518374, 0.18273694198527046, 0.04079474864374117, 0.0852120386142751, -0.05684952467346626, -0.0369612679688339, -0.00838098407300306, -0.11970072177190327, 0.12678036966421355, 0.23499577436064017, 0.0847756595009718, 0.22234043060214262, -0.3914398805502926, -0.22805840440087596, 0.06044678086401187, 0.16172442920385718, 0.03505805963072565, -0.033358482815363064, -0.2584519185790813, 0.04020401523633245, -0.19982698430887996, -0.20762816834954262, 0.10710244713440482, 0.11302477015118799, -0.008828211906091121, -0.22061229575720936, 0.1297483925400061, 0.01742264817424146, 0.13079908232348955, -0.1266609402283222, -0.1555358488095505, -0.045703883821959175, 0.0926144814272961, 0.08100855314109227, 0.0850844890999563, 0.23655848925404002, -0.08644496620829455, -0.038277038047433834, 0.35586514735140756, -0.07513342806288664, -0.025516514802554353, 0.20706005684423134, -0.21542098528423734, -0.1330279181092785, 0.2548250203928137, 0.19217928771850587, 0.13815107580009725, -0.12776178266334165, -0.030797806180965472, -0.03394400747707698, 0.22695166218061022, 0.047639824053087025, 0.03311203380445138, 0.2937005888537514, 0.15539354048033566, 0.036259546963587345, 0.1054623034113427, -0.24340212419955576, -0.09537113686109382, -0.25410260551530056, -0.1182520772425829, -0.12916592698126717, 0.056182755664305854, -0.1214633094045038, -0.07163989607406251, 0.3252926491281684, 0.12489765476627873, 0.2315002408744664, 0.01637211830363389, 0.2576990179473541, 0.008400688598463414, 0.12848015037379004, 0.10065133973605574, 0.3432197698251932, 0.09059502901268841, 0.10701034369369852, -0.17130111987621788, 0.1125365200528112, -0.018974379155650818] |
1,802.06117 | Scenarios: A New Representation for Complex Scene Understanding | The ability for computational agents to reason about the high-level content
of real world scene images is important for many applications. Existing
attempts at addressing the problem of complex scene understanding lack
representational power, efficiency, and the ability to create robust
meta-knowledge about scenes. In this paper, we introduce scenarios as a new way
of representing scenes. The scenario is a simple, low-dimensional, data-driven
representation consisting of sets of frequently co-occurring objects and is
useful for a wide range of scene understanding tasks. We learn scenarios from
data using a novel matrix factorization method which we integrate into a new
neural network architecture, the ScenarioNet. Using ScenarioNet, we can recover
semantic information about real world scene images at three levels of
granularity: 1) scene categories, 2) scenarios, and 3) objects. Training a
single ScenarioNet model enables us to perform scene classification, scenario
recognition, multi-object recognition, content-based scene image retrieval, and
content-based image comparison. In addition to solving many tasks in a single,
unified framework, ScenarioNet is more computationally efficient than other
CNNs because it requires significantly fewer parameters while achieving similar
performance on benchmark tasks and is more interpretable because it produces
explanations when making decisions. We validate the utility of scenarios and
ScenarioNet on a diverse set of scene understanding tasks on several benchmark
datasets.
| cs.CV | the ability for computational agents to reason about the highlevel content of real world scene images is important for many applications existing attempts at addressing the problem of complex scene understanding lack representational power efficiency and the ability to create robust metaknowledge about scenes in this paper we introduce scenarios as a new way of representing scenes the scenario is a simple lowdimensional datadriven representation consisting of sets of frequently cooccurring objects and is useful for a wide range of scene understanding tasks we learn scenarios from data using a novel matrix factorization method which we integrate into a new neural network architecture the scenarionet using scenarionet we can recover semantic information about real world scene images at three levels of granularity 1 scene categories 2 scenarios and 3 objects training a single scenarionet model enables us to perform scene classification scenario recognition multiobject recognition contentbased scene image retrieval and contentbased image comparison in addition to solving many tasks in a single unified framework scenarionet is more computationally efficient than other cnns because it requires significantly fewer parameters while achieving similar performance on benchmark tasks and is more interpretable because it produces explanations when making decisions we validate the utility of scenarios and scenarionet on a diverse set of scene understanding tasks on several benchmark datasets | [['the', 'ability', 'for', 'computational', 'agents', 'to', 'reason', 'about', 'the', 'highlevel', 'content', 'of', 'real', 'world', 'scene', 'images', 'is', 'important', 'for', 'many', 'applications', 'existing', 'attempts', 'at', 'addressing', 'the', 'problem', 'of', 'complex', 'scene', 'understanding', 'lack', 'representational', 'power', 'efficiency', 'and', 'the', 'ability', 'to', 'create', 'robust', 'metaknowledge', 'about', 'scenes', 'in', 'this', 'paper', 'we', 'introduce', 'scenarios', 'as', 'a', 'new', 'way', 'of', 'representing', 'scenes', 'the', 'scenario', 'is', 'a', 'simple', 'lowdimensional', 'datadriven', 'representation', 'consisting', 'of', 'sets', 'of', 'frequently', 'cooccurring', 'objects', 'and', 'is', 'useful', 'for', 'a', 'wide', 'range', 'of', 'scene', 'understanding', 'tasks', 'we', 'learn', 'scenarios', 'from', 'data', 'using', 'a', 'novel', 'matrix', 'factorization', 'method', 'which', 'we', 'integrate', 'into', 'a', 'new', 'neural', 'network', 'architecture', 'the', 'scenarionet', 'using', 'scenarionet', 'we', 'can', 'recover', 'semantic', 'information', 'about', 'real', 'world', 'scene', 'images', 'at', 'three', 'levels', 'of', 'granularity', '1', 'scene', 'categories', '2', 'scenarios', 'and', '3', 'objects', 'training', 'a', 'single', 'scenarionet', 'model', 'enables', 'us', 'to', 'perform', 'scene', 'classification', 'scenario', 'recognition', 'multiobject', 'recognition', 'contentbased', 'scene', 'image', 'retrieval', 'and', 'contentbased', 'image', 'comparison', 'in', 'addition', 'to', 'solving', 'many', 'tasks', 'in', 'a', 'single', 'unified', 'framework', 'scenarionet', 'is', 'more', 'computationally', 'efficient', 'than', 'other', 'cnns', 'because', 'it', 'requires', 'significantly', 'fewer', 'parameters', 'while', 'achieving', 'similar', 'performance', 'on', 'benchmark', 'tasks', 'and', 'is', 'more', 'interpretable', 'because', 'it', 'produces', 'explanations', 'when', 'making', 'decisions', 'we', 'validate', 'the', 'utility', 'of', 'scenarios', 'and', 'scenarionet', 'on', 'a', 'diverse', 'set', 'of', 'scene', 'understanding', 'tasks', 'on', 'several', 'benchmark', 'datasets']] | [-0.04542560811063999, -0.044612613983055646, -0.07170670747291297, 0.08357276042052372, -0.1518652379923474, -0.17232121788051533, 0.021897738282590312, 0.46288084055521284, -0.2402447423492386, -0.4003187266256039, 0.05038969564689237, -0.25420763691309495, -0.18161680561455865, 0.23295868625885946, -0.1760934671619907, 0.06597741791241181, 0.15247219628913122, 0.046867137615292986, -0.06035232383011909, -0.2555693096569653, 0.29177712875901274, 0.009025085085778739, 0.33345501069238204, 0.007464691953457616, 0.1420587790710636, -0.019098748607912393, -0.03364050407307567, -0.024844025257927435, -0.007117676730019782, 0.20080709686617074, 0.3695459225564264, 0.23976263089355565, 0.28683578775855023, -0.4121413585792955, -0.26011479895182504, 0.09500305811740907, 0.15201855323242922, 0.09828987211012982, -0.022234479860209697, -0.34763355332500023, 0.1040413391868545, -0.15510565117626726, 0.02532959948142956, -0.18229746592287147, 0.013560245280300646, -0.10347655129212567, -0.28877162437829945, 0.025680537945946626, 0.0633648760178605, 0.08773843956145423, -0.054825789021345335, -0.09543888431033809, 0.051160378496947316, 0.2087568971367512, -0.0028790683077036024, 0.012610334683106177, 0.17045725856479732, -0.251153016155715, -0.13341076367672672, 0.44874207644197334, 0.02010416413011424, -0.2038362953092777, 0.249599648314028, -0.03531759602979205, -0.16815726072053183, 0.11661241921225425, 0.2601865815953783, 0.16121794854040705, -0.18006258844582557, 0.00033033498577963283, -0.07929223919873712, 0.2031002215937608, 0.05823261166612307, 0.017726852386086074, 0.2318820194869423, 0.30684024495120094, 0.04308938169021901, 0.11675614662305668, -0.12123677433420973, -0.07748142571330795, -0.17656120654471494, -0.10163830038099722, -0.1480977853643708, -0.02663587624017425, -0.13295423934687278, -0.1037724277021981, 0.42724787004947384, 0.2715945257438795, 0.22053174570815084, 0.08189124815840775, 0.38159947870816624, -0.026414862305534404, 0.07818503073994415, 0.05657851785481735, 0.09059774391331572, 0.0055879982214214075, 0.15116062096893546, -0.0981066667666676, 0.06556169054561502, 0.023353284278224844] |
1,802.06118 | Tracking critical points on evolving curves and surfaces | In recent years it became apparent that geophysical abrasion can be well
characterized by the time evolution $N(t)$ of the number $N$ of static balance
points of the abrading particle. Static balance points correspond to the
critical points of the particle's surface represented as a scalar distance
function $r$, measured from the center of mass, so their time evolution can be
expressed as $N(r(t))$. The mathematical model of the particle can be
constructed on two scales: on the macro scale the particle may be viewed as a
smooth, convex manifold described by the smooth distance function $r$ with
$N=N(r)$ equilibria, while on the micro scale the particle's natural model is a
finely discretized, convex polyhedral approximation $r^{\Delta}$ of $r$, with
$N^{\Delta}=N(r^{\Delta})$ equilibria. There is strong intuitive evidence
suggesting that under some particular evolution models $N(t)$ and
$N^{\Delta}(t)$ primarily evolve in the opposite manner. Here we create the
mathematical framework necessary to understand these phenomenon more broadly,
regardless of the particular evolution equation. We study micro and macro
events in one-parameter families of curves and surfaces, corresponding to
bifurcations triggering the jumps in $N(t)$ and $N^{\Delta}(t)$. We show that
the intuitive picture developed for curvature-driven flows is not only correct,
it has universal validity, as long as the evolving surface $r$ is smooth. In
this case, bifurcations associated with $r$ and $r^{\Delta}$ are coupled to
some extent: resonance-like phenomena in $N^{\Delta}(t)$ can be used to
forecast downward jumps in $N(t)$ (but not upward jumps). Beyond proving
rigorous results for the $\Delta \to 0$ limit on the nontrivial interplay
between singularities in the discrete and continuum approximations we also show
that our mathematical model is structurally stable, i.e. it may be verified by
computer simulations.
| math.DS math-ph math.MP math.NA | in recent years it became apparent that geophysical abrasion can be well characterized by the time evolution nt of the number n of static balance points of the abrading particle static balance points correspond to the critical points of the particles surface represented as a scalar distance function r measured from the center of mass so their time evolution can be expressed as nrt the mathematical model of the particle can be constructed on two scales on the macro scale the particle may be viewed as a smooth convex manifold described by the smooth distance function r with nnr equilibria while on the micro scale the particles natural model is a finely discretized convex polyhedral approximation rdelta of r with ndeltanrdelta equilibria there is strong intuitive evidence suggesting that under some particular evolution models nt and ndeltat primarily evolve in the opposite manner here we create the mathematical framework necessary to understand these phenomenon more broadly regardless of the particular evolution equation we study micro and macro events in oneparameter families of curves and surfaces corresponding to bifurcations triggering the jumps in nt and ndeltat we show that the intuitive picture developed for curvaturedriven flows is not only correct it has universal validity as long as the evolving surface r is smooth in this case bifurcations associated with r and rdelta are coupled to some extent resonancelike phenomena in ndeltat can be used to forecast downward jumps in nt but not upward jumps beyond proving rigorous results for the delta to 0 limit on the nontrivial interplay between singularities in the discrete and continuum approximations we also show that our mathematical model is structurally stable ie it may be verified by computer simulations | [['in', 'recent', 'years', 'it', 'became', 'apparent', 'that', 'geophysical', 'abrasion', 'can', 'be', 'well', 'characterized', 'by', 'the', 'time', 'evolution', 'nt', 'of', 'the', 'number', 'n', 'of', 'static', 'balance', 'points', 'of', 'the', 'abrading', 'particle', 'static', 'balance', 'points', 'correspond', 'to', 'the', 'critical', 'points', 'of', 'the', 'particles', 'surface', 'represented', 'as', 'a', 'scalar', 'distance', 'function', 'r', 'measured', 'from', 'the', 'center', 'of', 'mass', 'so', 'their', 'time', 'evolution', 'can', 'be', 'expressed', 'as', 'nrt', 'the', 'mathematical', 'model', 'of', 'the', 'particle', 'can', 'be', 'constructed', 'on', 'two', 'scales', 'on', 'the', 'macro', 'scale', 'the', 'particle', 'may', 'be', 'viewed', 'as', 'a', 'smooth', 'convex', 'manifold', 'described', 'by', 'the', 'smooth', 'distance', 'function', 'r', 'with', 'nnr', 'equilibria', 'while', 'on', 'the', 'micro', 'scale', 'the', 'particles', 'natural', 'model', 'is', 'a', 'finely', 'discretized', 'convex', 'polyhedral', 'approximation', 'rdelta', 'of', 'r', 'with', 'ndeltanrdelta', 'equilibria', 'there', 'is', 'strong', 'intuitive', 'evidence', 'suggesting', 'that', 'under', 'some', 'particular', 'evolution', 'models', 'nt', 'and', 'ndeltat', 'primarily', 'evolve', 'in', 'the', 'opposite', 'manner', 'here', 'we', 'create', 'the', 'mathematical', 'framework', 'necessary', 'to', 'understand', 'these', 'phenomenon', 'more', 'broadly', 'regardless', 'of', 'the', 'particular', 'evolution', 'equation', 'we', 'study', 'micro', 'and', 'macro', 'events', 'in', 'oneparameter', 'families', 'of', 'curves', 'and', 'surfaces', 'corresponding', 'to', 'bifurcations', 'triggering', 'the', 'jumps', 'in', 'nt', 'and', 'ndeltat', 'we', 'show', 'that', 'the', 'intuitive', 'picture', 'developed', 'for', 'curvaturedriven', 'flows', 'is', 'not', 'only', 'correct', 'it', 'has', 'universal', 'validity', 'as', 'long', 'as', 'the', 'evolving', 'surface', 'r', 'is', 'smooth', 'in', 'this', 'case', 'bifurcations', 'associated', 'with', 'r', 'and', 'rdelta', 'are', 'coupled', 'to', 'some', 'extent', 'resonancelike', 'phenomena', 'in', 'ndeltat', 'can', 'be', 'used', 'to', 'forecast', 'downward', 'jumps', 'in', 'nt', 'but', 'not', 'upward', 'jumps', 'beyond', 'proving', 'rigorous', 'results', 'for', 'the', 'delta', 'to', '0', 'limit', 'on', 'the', 'nontrivial', 'interplay', 'between', 'singularities', 'in', 'the', 'discrete', 'and', 'continuum', 'approximations', 'we', 'also', 'show', 'that', 'our', 'mathematical', 'model', 'is', 'structurally', 'stable', 'ie', 'it', 'may', 'be', 'verified', 'by', 'computer', 'simulations']] | [-0.12618186496102063, 0.14230287878722733, -0.10349974777794764, 0.10464630719751544, -0.047886415357366735, -0.1435374283211909, 0.009443159177659073, 0.3539567892655094, -0.29001741212033716, -0.3037789984460377, 0.09424320205025295, -0.24737119424286103, -0.15179480805668277, 0.18347830268897422, -0.05449219323069958, 0.04073713029835463, 0.030739938527895833, 0.018801833708435828, -0.04123770582300754, -0.19468543751851333, 0.2796893269072197, 0.037567934891050744, 0.22538657978283128, 0.048284274441632524, 0.07590500229813849, -0.042959672557952355, 0.003206112130700024, 0.0850567019489027, -0.14713056487649814, 0.04494915040395491, 0.23990583672740315, 0.09994776144597242, 0.2475570569343507, -0.43422291876609004, -0.2305181869939533, 0.10756122225956011, 0.15766064980165914, 0.052815058912412394, -0.001852808794716383, -0.24906949698345013, 0.09043096954142178, -0.12345185021627893, -0.1691805294555781, -0.06672715741082084, 0.05226154691867822, 0.051630703639259784, -0.24450664302198302, 0.08409922294684494, 0.07313556149825652, 0.06456349584360166, -0.04858896874796162, -0.06690251729301976, -0.0764180034945066, 0.10963974359027463, 0.062408184327120524, 0.03779196480265901, 0.1321974158124647, -0.07976617771399695, -0.08852734051858575, 0.37959534013345575, -0.06419022300602119, -0.2285076653075987, 0.21049745851096918, -0.15929362225284951, -0.0960323905391665, 0.1179979483106462, 0.16530735153469564, 0.12098075843041636, -0.12679992272150686, 0.08732815998032283, -0.04804414068597279, 0.14486719810758517, 0.08766240980956716, -0.011771061963126647, 0.22346239304501445, 0.15434880339369855, 0.0644648261123844, 0.08957214180953482, -0.046107829126464765, -0.1479981572278593, -0.3196529058003765, -0.12204118378980755, -0.16414062057566262, 0.07217689816439375, -0.105271385236601, -0.17799249919814147, 0.37079590193933915, 0.10643391166638634, 0.21091915534981576, 0.04675508265506171, 0.22206823233170336, 0.12918509412358029, 0.03569111504320228, 0.09803428733721375, 0.22716096326898538, 0.10573821372080766, 0.09328878938147527, -0.1857248712614845, 0.07471714915108645, 0.06307688197021595] |
1,802.06119 | Superconductivity in Cage Compounds La$Tr_{2}$Al$_{20}$ with $Tr$ = Ti,
V, Nb, and Ta | Electrical resistivity, magnetic susceptibility, and specific heat
measurements on single crystals of La$Tr_{2}$Al$_{20}$ ($Tr$ = Ti, V, Nb, and
Ta) revealed that these four compounds exhibit weak-coupling superconductivity
with transition temperatures $T_{\rm c}$ = 0.46, 0.15, 1.05, and 1.03 K,
respectively. LaTi$_{2}$Al$_{20}$ is most probably a type-I superconductor,
which is quite rare among intermetallic compounds. Single-crystal X-ray
diffraction suggests "rattling" anharmonic large-amplitude oscillations of Al
ions (16$c$ site) on the Al$_{16}$ cage, while no such feature is suggested for
the cage-center La ion. Using a parameter $d_{\rm GFS}$ quantifying the "guest
free space" of the cage-center ion, we demonstrate that nonmagnetic
$RTr_{2}$Al$_{20}$ superconductors are classified into two groups, i.e., (A)
$d_{\rm GFS} \ne 0$ and $T_{\rm c}$ correlates with $d_{\rm GFS}$, and (B)
$d_{\rm GFS} \simeq 0$ and $T_{\rm c}$ seems to be governed by other factors.
| cond-mat.supr-con cond-mat.str-el | electrical resistivity magnetic susceptibility and specific heat measurements on single crystals of latr_2al_20 tr ti v nb and ta revealed that these four compounds exhibit weakcoupling superconductivity with transition temperatures t_rm c 046 015 105 and 103 k respectively lati_2al_20 is most probably a typei superconductor which is quite rare among intermetallic compounds singlecrystal xray diffraction suggests rattling anharmonic largeamplitude oscillations of al ions 16c site on the al_16 cage while no such feature is suggested for the cagecenter la ion using a parameter d_rm gfs quantifying the guest free space of the cagecenter ion we demonstrate that nonmagnetic rtr_2al_20 superconductors are classified into two groups ie a d_rm gfs ne 0 and t_rm c correlates with d_rm gfs and b d_rm gfs simeq 0 and t_rm c seems to be governed by other factors | [['electrical', 'resistivity', 'magnetic', 'susceptibility', 'and', 'specific', 'heat', 'measurements', 'on', 'single', 'crystals', 'of', 'latr_2al_20', 'tr', 'ti', 'v', 'nb', 'and', 'ta', 'revealed', 'that', 'these', 'four', 'compounds', 'exhibit', 'weakcoupling', 'superconductivity', 'with', 'transition', 'temperatures', 't_rm', 'c', '046', '015', '105', 'and', '103', 'k', 'respectively', 'lati_2al_20', 'is', 'most', 'probably', 'a', 'typei', 'superconductor', 'which', 'is', 'quite', 'rare', 'among', 'intermetallic', 'compounds', 'singlecrystal', 'xray', 'diffraction', 'suggests', 'rattling', 'anharmonic', 'largeamplitude', 'oscillations', 'of', 'al', 'ions', '16c', 'site', 'on', 'the', 'al_16', 'cage', 'while', 'no', 'such', 'feature', 'is', 'suggested', 'for', 'the', 'cagecenter', 'la', 'ion', 'using', 'a', 'parameter', 'd_rm', 'gfs', 'quantifying', 'the', 'guest', 'free', 'space', 'of', 'the', 'cagecenter', 'ion', 'we', 'demonstrate', 'that', 'nonmagnetic', 'rtr_2al_20', 'superconductors', 'are', 'classified', 'into', 'two', 'groups', 'ie', 'a', 'd_rm', 'gfs', 'ne', '0', 'and', 't_rm', 'c', 'correlates', 'with', 'd_rm', 'gfs', 'and', 'b', 'd_rm', 'gfs', 'simeq', '0', 'and', 't_rm', 'c', 'seems', 'to', 'be', 'governed', 'by', 'other', 'factors']] | [-0.17024335503765894, 0.28524749158419554, 0.06364668602152734, -0.004107193935611971, -0.0011899263251486214, -0.2583446350172451, 0.14671366787046308, 0.3720474837189035, -0.22152140296638273, -0.28683933344229245, -0.034390992012105936, -0.4219588882561068, -0.010709003491197215, 0.17874979160639437, 0.08680425157008852, -0.04143563005080548, -0.07054869857681699, -0.030035720429249655, -0.13410986590744248, -0.18364653536010273, 0.2090012175536375, 0.025514247547474132, 0.2670028674770002, 0.05256023065840407, 0.012487651505904604, -0.07378629520679861, 0.12748061480946377, 0.0548411011801899, -0.1672816888982874, -0.008710024549892937, 0.26654884879217416, -0.016755242427709954, 0.1447165147148708, -0.35398644431992327, -0.21428887282368228, 0.003995883646746015, 0.13394967711516187, 0.015110312146134675, 1.8937018692724465e-06, -0.24499461814299112, 0.054901910989090454, -0.11894658280855998, -0.07644317312122778, -0.08028138617537338, 0.07410473640026279, -0.010335459110828824, -0.28544136236400103, 0.165278268097214, 0.037311725693848705, 0.15496478859847773, -0.10352752121280907, -0.22359750632110031, -0.08686084616135141, -0.05419754680172114, 0.01891546578926229, 0.1164202464332934, 0.17481836643748622, -0.0068665689557733, -0.02988445539976824, 0.3920034782044127, -0.06382417999651976, 0.023686798520443975, 0.19284435211457024, -0.20591328610407095, -0.14195959290937166, 0.1519523285701149, 0.04734304854140956, 0.10838878945476382, -0.14232895018662825, 0.08488691731467987, 0.03164576723189779, 0.2311459897339724, 0.05778053392432341, 0.07329035648451612, 0.21290339458762675, 0.15716767516221794, -0.0453244428504114, 0.06137193305496408, -0.16440765609668725, 0.05178258240416054, -0.22467865424533917, -0.19967061283189602, -0.17135519775753308, 0.05721791816312213, -0.13426727914479705, -0.14061188277095382, 0.28990350334450254, 0.08103718100191913, 0.18873765189633812, -0.08316070378429523, 0.1169057899992191, 0.06481076017754918, 0.07255053697939053, 0.12140101819595163, 0.22196362981240647, 0.17517252077074189, 0.09516812173122641, -0.32539216011343886, 0.09057539598583135, 0.031653417106952464] |
1,802.0612 | Simple Bounds for Utility Maximization with Small Transaction Costs | Using elementary arguments, we show how to derive $\mathbf{L}_p$-error bounds
for the approximation of frictionless wealth process in markets with
proportional transaction costs. For utilities with bounded risk aversion, these
estimates yield lower bounds for the frictional value function, which pave the
way for its asymptotic analysis using stability results for viscosity
solutions. Using tools from Malliavin calculus, we also derive simple
sufficient conditions for the regularity of frictionless optimal trading
strategies, the second main ingredient for the asymptotic analysis of small
transaction costs.
| q-fin.PM math.OC q-fin.TR | using elementary arguments we show how to derive mathbfl_perror bounds for the approximation of frictionless wealth process in markets with proportional transaction costs for utilities with bounded risk aversion these estimates yield lower bounds for the frictional value function which pave the way for its asymptotic analysis using stability results for viscosity solutions using tools from malliavin calculus we also derive simple sufficient conditions for the regularity of frictionless optimal trading strategies the second main ingredient for the asymptotic analysis of small transaction costs | [['using', 'elementary', 'arguments', 'we', 'show', 'how', 'to', 'derive', 'mathbfl_perror', 'bounds', 'for', 'the', 'approximation', 'of', 'frictionless', 'wealth', 'process', 'in', 'markets', 'with', 'proportional', 'transaction', 'costs', 'for', 'utilities', 'with', 'bounded', 'risk', 'aversion', 'these', 'estimates', 'yield', 'lower', 'bounds', 'for', 'the', 'frictional', 'value', 'function', 'which', 'pave', 'the', 'way', 'for', 'its', 'asymptotic', 'analysis', 'using', 'stability', 'results', 'for', 'viscosity', 'solutions', 'using', 'tools', 'from', 'malliavin', 'calculus', 'we', 'also', 'derive', 'simple', 'sufficient', 'conditions', 'for', 'the', 'regularity', 'of', 'frictionless', 'optimal', 'trading', 'strategies', 'the', 'second', 'main', 'ingredient', 'for', 'the', 'asymptotic', 'analysis', 'of', 'small', 'transaction', 'costs']] | [-0.060733814016882194, 0.03365515280761812, -0.15330764074551773, 0.12600758024684663, -0.0879108454016632, -0.1424456844499043, 0.13967633567166976, 0.3370779199660363, -0.2821739139315863, -0.2774804371748546, 0.1916088918995404, -0.25657161529434014, -0.14916387083729818, 0.2283537140318069, -0.127436480159501, 0.11256371518100489, 0.046353946125740744, -0.027178607477122044, 0.010304910394486534, -0.2673259141619306, 0.30210259278495627, 0.036553433688121834, 0.25692194028398446, 0.09746881895305881, 0.09062881357070193, 0.015087817447731295, -0.02876072869277054, -0.0164400633446962, -0.28724088957421035, 0.16901991736278477, 0.2817364020233817, 0.08879347316112864, 0.3330990176490811, -0.46834655034254835, -0.10256577022822506, 0.12684624795297003, 0.051022439322670005, 0.05375223821562053, -0.04005631880767374, -0.21911005941724562, 0.06294374988717308, -0.18584425623124712, -0.1998338834999735, -0.15255149769181586, -0.0027672478323241315, 0.08029625829623406, -0.3567300263500537, 0.10652290503122754, 0.05151521762361728, 0.046482895332646657, -0.1525974977931221, -0.15275856686464276, 0.0014248150064194776, 0.12493583572893796, 0.12041886232713384, -0.11482713639130254, 0.14793179504550905, -0.13054937671544592, -0.1549703995528889, 0.31597777744418526, -0.10688235135805087, -0.23212319224264966, 0.13166053942124167, -0.13950350556062557, -0.1310453284026898, 0.1267217335933595, 0.19242511910150747, 0.09941814258604882, -0.1897167057410466, 0.06863923690629652, -0.009009726944446832, 0.11379500063338194, 0.08210949221603482, 0.07079909082098179, 0.10699990717133126, 0.170443874189114, 0.20184518495597034, 0.17172652640357525, 0.007062117086656122, -0.16253601068473725, -0.36948807858469257, -0.14572415446178114, -0.16004163475078811, 0.03352552043072071, -0.22726737694388413, -0.1588263678145651, 0.2748894036175257, 0.15946919056979647, 0.10280473016522242, 0.23469421466257065, 0.3172171067850417, 0.19792275302075635, -0.022592293221997208, 0.13557187447616134, 0.218447837748576, 0.0787845380766968, 0.12317389857966497, -0.182661457234469, 0.16776052027581687, 0.11860996585795852] |
1,802.06121 | Contextuality and The Single-Qubit Stabilizer Formalism | Contextuality is a fundamental non-classical property of quantum theory,
which has recently been proven to be a key resource for achieving quantum
speed-ups in some leading models of quantum computation. However, which of the
forms of contextuality, and how much thereof, are required to obtain a speed-up
in an arbitrary model of quantum computation remains unclear. In this paper, we
show that the relation between contextuality and a compuational advantage is
more complicated than previously thought. We achieve this by proving that
generalized contextuality is present even within the simplest subset of quantum
operations, the so-called single-qubit stabilizer theory, which offers no
computational advantage and was previously believed to be completely
non-contextual. However, the contextuality of the single-qubit stabilizer
theory can be confined to transformations. Therefore our result also
demonstrates that the commonly considered prepare-and-measure scenarios (which
ignore transformations) do not fully capture the contextuality of quantum
theory.
| quant-ph | contextuality is a fundamental nonclassical property of quantum theory which has recently been proven to be a key resource for achieving quantum speedups in some leading models of quantum computation however which of the forms of contextuality and how much thereof are required to obtain a speedup in an arbitrary model of quantum computation remains unclear in this paper we show that the relation between contextuality and a compuational advantage is more complicated than previously thought we achieve this by proving that generalized contextuality is present even within the simplest subset of quantum operations the socalled singlequbit stabilizer theory which offers no computational advantage and was previously believed to be completely noncontextual however the contextuality of the singlequbit stabilizer theory can be confined to transformations therefore our result also demonstrates that the commonly considered prepareandmeasure scenarios which ignore transformations do not fully capture the contextuality of quantum theory | [['contextuality', 'is', 'a', 'fundamental', 'nonclassical', 'property', 'of', 'quantum', 'theory', 'which', 'has', 'recently', 'been', 'proven', 'to', 'be', 'a', 'key', 'resource', 'for', 'achieving', 'quantum', 'speedups', 'in', 'some', 'leading', 'models', 'of', 'quantum', 'computation', 'however', 'which', 'of', 'the', 'forms', 'of', 'contextuality', 'and', 'how', 'much', 'thereof', 'are', 'required', 'to', 'obtain', 'a', 'speedup', 'in', 'an', 'arbitrary', 'model', 'of', 'quantum', 'computation', 'remains', 'unclear', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'relation', 'between', 'contextuality', 'and', 'a', 'compuational', 'advantage', 'is', 'more', 'complicated', 'than', 'previously', 'thought', 'we', 'achieve', 'this', 'by', 'proving', 'that', 'generalized', 'contextuality', 'is', 'present', 'even', 'within', 'the', 'simplest', 'subset', 'of', 'quantum', 'operations', 'the', 'socalled', 'singlequbit', 'stabilizer', 'theory', 'which', 'offers', 'no', 'computational', 'advantage', 'and', 'was', 'previously', 'believed', 'to', 'be', 'completely', 'noncontextual', 'however', 'the', 'contextuality', 'of', 'the', 'singlequbit', 'stabilizer', 'theory', 'can', 'be', 'confined', 'to', 'transformations', 'therefore', 'our', 'result', 'also', 'demonstrates', 'that', 'the', 'commonly', 'considered', 'prepareandmeasure', 'scenarios', 'which', 'ignore', 'transformations', 'do', 'not', 'fully', 'capture', 'the', 'contextuality', 'of', 'quantum', 'theory']] | [-0.10891646496885507, 0.12745860565504502, -0.1339300605720161, 0.09726069247542024, -0.04798896420028098, -0.22129713915716354, 0.03941284113711476, 0.32553311184401046, -0.259477809877009, -0.3071787730913383, 0.036352257738267446, -0.1733848952461739, -0.17633010670259544, 0.22986505238411672, -0.135251106821375, 0.10644776335716047, 0.03721933836759244, 0.041931784139140636, -0.08077759001359998, -0.30404226252859506, 0.2669381630336362, 0.04676638956329584, 0.28388948785770385, 0.05460987872022481, 0.07736328953084208, -0.03976241079461131, 0.04105527130761058, 0.022479194822104497, -0.057438487040279734, 0.13391265716101672, 0.30699075574505735, 0.16159023130092318, 0.2798504284205469, -0.43824852836307304, -0.23980224525832847, 0.12436669935296113, 0.13485008822691097, 0.18109191441121888, -0.013792939096035567, -0.288111684120235, 0.07929074959011397, -0.18849174422841217, -0.07508227062675901, -0.15503752176221963, 0.01534471582980021, -0.11879622415998145, -0.2308788893373079, 0.07138943883438588, 0.12888943758868687, 0.05434167206820692, 0.045801597697710666, -0.019492723017842887, 0.057624383103118175, 0.11401701229939086, -0.04406579199948701, 0.010465395410318632, 0.0984210418077104, -0.1112171281274641, -0.21689706495601205, 0.4154377071866514, 0.051987110598880414, -0.22513732021183683, 0.1759782293528268, -0.11286723049282021, -0.1871161096307726, 0.05622190704594392, 0.06117172951407328, 0.09219354497405663, -0.1629633871284691, 0.10388987042785408, -0.06925005966646446, 0.20573661778738872, 0.06462744939474489, 0.14545357367574438, 0.16373572460803631, 0.11052095995920182, 0.0614336331223918, 0.1315419234349581, -0.007671250628206778, -0.19417973984083212, -0.31886978557559886, -0.2233755989881182, -0.19762370681918756, 0.11172054854004937, -0.04001558413447866, -0.15330836190716238, 0.34245424049377843, 0.16399036464910652, 0.1433922261868075, 0.040567801938065, 0.2811975648651856, 0.0986320025081482, 0.10647238797753596, 0.07913564855069224, 0.27593908709811354, 0.1772421351083353, 0.00086407911196049, -0.1967912168632186, 0.11151739426359937, 0.014396738666864866] |
1,802.06122 | The operator approach to the truncated multidimensional moment problem | We study the truncated multidimensional moment problem with a general type of
truncations. The operator approach to the moment problem is presented. A way to
construct atomic solutions of the moment problem is indicated.
| math.FA | we study the truncated multidimensional moment problem with a general type of truncations the operator approach to the moment problem is presented a way to construct atomic solutions of the moment problem is indicated | [['we', 'study', 'the', 'truncated', 'multidimensional', 'moment', 'problem', 'with', 'a', 'general', 'type', 'of', 'truncations', 'the', 'operator', 'approach', 'to', 'the', 'moment', 'problem', 'is', 'presented', 'a', 'way', 'to', 'construct', 'atomic', 'solutions', 'of', 'the', 'moment', 'problem', 'is', 'indicated']] | [-0.10784868770005072, 0.009757927112171756, -0.054417442804312, 0.09698237836881377, -0.10029891829061158, -0.033220877234057034, 0.02705154537654701, 0.32379099781460624, -0.34648156944004926, -0.2500934542827856, 0.1412677367847851, -0.2856594221666455, -0.13179932868875124, 0.1325740520568455, -0.04505487312288845, 0.07192473840790198, 0.06349209818632945, 0.04267239039215971, -0.1023680674021735, -0.22430114338503165, 0.3748247178737074, 0.007859942174571402, 0.24114183432367794, 0.02674473515328239, 0.11898316558012191, -0.035163236398469, -0.009069080902811359, 0.050458012641791034, -0.11139004026293098, 0.1972076807082083, 0.19225634261965752, 0.1065960445386522, 0.267085435855038, -0.39487790546434764, -0.14401571507401326, 0.1223362161339644, 0.07751961655038245, 0.15687181173330722, -0.08244187609456918, -0.2619385969112901, 0.07863023696357713, -0.1665810771724757, -0.2703679047305794, -0.07719869158395073, -0.00584504720481003, 0.001466682886102182, -0.37670946638921604, 0.10841502947732806, 0.09601913907510393, -0.0034000176991171695, -0.124245199128328, -0.0900759548873312, 0.11713942934704177, 0.021458917324814725, 0.08986707394668723, 0.04682773846092031, 0.02310881299404975, -0.06935100297799662, -0.11760837421752512, 0.4086577584282221, -0.025028983969926175, -0.25822984914788427, 0.11069424858535915, -0.1600838890299201, -0.12340717349091873, 0.049708900863633436, 0.12692569479729762, 0.22633758296861367, -0.16578103412928827, 0.13392378784277859, -0.08334924751783118, 0.1534048084388761, 0.011805738596355213, -0.046240530913243726, 0.16109849016784744, 0.17407117364928126, 0.14710726172608488, 0.20383288015556686, -0.06258536567089751, -0.12460380063994843, -0.26623306571341615, -0.13094013636274374, -0.1679320880485808, 0.0678908475126852, -0.03769029945354251, -0.21525262964560704, 0.3933482175857267, 0.10580382205765038, 0.18701287096037583, 0.048734898706350255, 0.257282821351991, 0.24070057141430237, 0.03276262810344205, 0.004749664625919917, 0.156228989307933, 0.1831416695871774, 0.07934128676595933, -0.24457816176993005, 0.023601229686070892, 0.2249006561058409] |
1,802.06123 | SBP-SAT finite difference discretization of acoustic wave equations on
staggered block-wise uniform grids | We consider the numerical simulation of the acoustic wave equations arising
from seismic applications, for which staggered grid finite difference methods
are popular choices due to their simplicity and efficiency. We relax the
uniform grid restriction on finite difference methods and allow the grids to be
block-wise uniform with nonconforming interfaces. In doing so, variations in
the wave speeds of the subterranean media can be accounted for more
efficiently. Staggered grid finite difference operators satisfying the
summation-by-parts (SBP) property are devised to approximate the spatial
derivatives appearing in the acoustic wave equation. These operators are
applied within each block independently. The coupling between blocks is
achieved through simultaneous approximation terms (SATs), which impose the
interface condition weakly, i.e., by penalty. Ratio of the grid spacing of
neighboring blocks is allowed to be rational number, for which specially
designed interpolation formulas are presented. These interpolation formulas
constitute key pieces of the simultaneous approximation terms. The overall
discretization is shown to be energy-conserving and examined on test cases of
both theoretical and practical interests, delivering accurate and stable
simulation results.
| math.NA | we consider the numerical simulation of the acoustic wave equations arising from seismic applications for which staggered grid finite difference methods are popular choices due to their simplicity and efficiency we relax the uniform grid restriction on finite difference methods and allow the grids to be blockwise uniform with nonconforming interfaces in doing so variations in the wave speeds of the subterranean media can be accounted for more efficiently staggered grid finite difference operators satisfying the summationbyparts sbp property are devised to approximate the spatial derivatives appearing in the acoustic wave equation these operators are applied within each block independently the coupling between blocks is achieved through simultaneous approximation terms sats which impose the interface condition weakly ie by penalty ratio of the grid spacing of neighboring blocks is allowed to be rational number for which specially designed interpolation formulas are presented these interpolation formulas constitute key pieces of the simultaneous approximation terms the overall discretization is shown to be energyconserving and examined on test cases of both theoretical and practical interests delivering accurate and stable simulation results | [['we', 'consider', 'the', 'numerical', 'simulation', 'of', 'the', 'acoustic', 'wave', 'equations', 'arising', 'from', 'seismic', 'applications', 'for', 'which', 'staggered', 'grid', 'finite', 'difference', 'methods', 'are', 'popular', 'choices', 'due', 'to', 'their', 'simplicity', 'and', 'efficiency', 'we', 'relax', 'the', 'uniform', 'grid', 'restriction', 'on', 'finite', 'difference', 'methods', 'and', 'allow', 'the', 'grids', 'to', 'be', 'blockwise', 'uniform', 'with', 'nonconforming', 'interfaces', 'in', 'doing', 'so', 'variations', 'in', 'the', 'wave', 'speeds', 'of', 'the', 'subterranean', 'media', 'can', 'be', 'accounted', 'for', 'more', 'efficiently', 'staggered', 'grid', 'finite', 'difference', 'operators', 'satisfying', 'the', 'summationbyparts', 'sbp', 'property', 'are', 'devised', 'to', 'approximate', 'the', 'spatial', 'derivatives', 'appearing', 'in', 'the', 'acoustic', 'wave', 'equation', 'these', 'operators', 'are', 'applied', 'within', 'each', 'block', 'independently', 'the', 'coupling', 'between', 'blocks', 'is', 'achieved', 'through', 'simultaneous', 'approximation', 'terms', 'sats', 'which', 'impose', 'the', 'interface', 'condition', 'weakly', 'ie', 'by', 'penalty', 'ratio', 'of', 'the', 'grid', 'spacing', 'of', 'neighboring', 'blocks', 'is', 'allowed', 'to', 'be', 'rational', 'number', 'for', 'which', 'specially', 'designed', 'interpolation', 'formulas', 'are', 'presented', 'these', 'interpolation', 'formulas', 'constitute', 'key', 'pieces', 'of', 'the', 'simultaneous', 'approximation', 'terms', 'the', 'overall', 'discretization', 'is', 'shown', 'to', 'be', 'energyconserving', 'and', 'examined', 'on', 'test', 'cases', 'of', 'both', 'theoretical', 'and', 'practical', 'interests', 'delivering', 'accurate', 'and', 'stable', 'simulation', 'results']] | [-0.12734886159429723, 0.10226261792534418, -0.05719234662266511, 0.062368545785227145, -0.09562378051151846, -0.1354011417146814, 0.031867738045343943, 0.4028251085200169, -0.2657417306235698, -0.2890686824828847, 0.13493038252260264, -0.23921726805712568, -0.08186271875897903, 0.18299595967884794, -0.033618302875704636, 0.09666226440262353, 0.06698597465305631, -0.03348667445210635, -0.09545393683686015, -0.2415853520486441, 0.29628262832091096, 0.020365669067656057, 0.31038426232178895, 0.0533457765943669, 0.096873940368905, -0.016846577158155903, -0.06835980260263333, 0.02494142492887068, -0.08532600690547922, 0.1346186410918246, 0.2659986406418212, 0.053550802092094056, 0.2581233040090298, -0.4773380361246259, -0.22250756337778288, 0.09233938826750336, 0.15557327503344998, 0.08180835246686625, -0.036073872168385555, -0.24822673235831552, 0.09926166460101148, -0.15015002289849722, -0.12497362006832374, -0.10438832034503392, -0.03188268567456372, 0.09952935953153653, -0.32407938375587714, 0.0674966851071444, 0.02772003823264732, 0.0412419298088199, -0.026591153255548707, -0.13840056529394193, -0.019996446876504113, 0.1431317348007029, 0.016126307986514498, -0.034308581165655445, 0.04497441013207596, -0.047009136281865704, -0.05701253295737434, 0.4117648923309164, -0.025923211730524812, -0.2921249024868221, 0.16417089513675676, -0.09566149623342528, -0.05786587140624924, 0.11155279628472047, 0.18687125122739692, 0.12577484914522194, -0.112779475469273, 0.08301080380313967, 0.0079603484870828, 0.14341823979061138, 0.11506188690552509, 0.02098152791725451, 0.16010303450539037, 0.10618410994079006, 0.10544098091927838, 0.0964915265991049, -0.049133532874160606, -0.1348239843356894, -0.2919576063992853, -0.09862209451860642, -0.17835292366288832, -0.042471093671665176, -0.14505080036317675, -0.1967166639840573, 0.36860254595809605, 0.16366864560077782, 0.12220755574722471, 0.05457623453557052, 0.3177434666961264, 0.17854625173959504, 0.07768792669377761, 0.06856505013217501, 0.2016901367793927, 0.15843506166423682, 0.09257178688474167, -0.22536296604771502, 0.06183566968218329, 0.14459414039005974] |
1,802.06124 | Dirac operator on a noncommutative Toeplitz torus | We construct a 1+ summable regular even spectral triple for a noncommutative
torus defined by a C*-subalgebra of the Toeplitz algebra.
| math.QA math.OA | we construct a 1 summable regular even spectral triple for a noncommutative torus defined by a csubalgebra of the toeplitz algebra | [['we', 'construct', 'a', '1', 'summable', 'regular', 'even', 'spectral', 'triple', 'for', 'a', 'noncommutative', 'torus', 'defined', 'by', 'a', 'csubalgebra', 'of', 'the', 'toeplitz', 'algebra']] | [-0.2088409619671958, 0.09130645671948082, -0.027424130677467302, 0.15751028495530286, -0.0671711422148205, -0.2156317398351218, -0.07449583354450408, 0.36918784411890165, -0.33791641820044743, -0.09285422458889939, 0.18954398312295476, -0.21854190375389798, -0.12593880978723368, 0.1489792156166264, -0.17016065338005623, -0.03068640207250913, 0.08045119898659843, 0.1019141032094402, -0.20496118956777667, -0.15247771126173792, 0.4766461253166199, -0.01347456517673674, 0.05468239331440557, -0.03457213587881554, 0.1131233928636426, 0.04349471684101792, -0.055700327757568585, -0.018453277292705718, -0.16965009347491322, 0.10355575209749597, 0.2788000571585837, 0.0536799482291653, 0.24370111808890388, -0.2759008753512587, -0.10914842567096154, 0.20428552545074904, 0.1504569845939321, -0.1300563540841852, -0.06789687116231237, -0.2459068850259341, 0.09813742752053908, -0.33673522621393204, -0.16828856579515905, -0.061150818531002314, 0.10035746957042388, -0.023131757885927244, -0.37218321540525984, -0.05592282870340915, 0.1964500980185611, 0.11959030811807939, -0.031078139275667212, -0.006338498677082714, -0.08746227568813733, 0.055968236643821, -0.18793738030252002, 0.028781266860841287, 0.10191189331401672, 0.016307171611558823, -0.1726640827421631, 0.2928807084404287, -0.09798053674222458, -0.25175357095542406, 0.062186289756071, -0.25237990314850495, -0.17999176055725133, 0.1427835002541542, 0.006953384549844833, 0.1630284357815981, -0.009413792086499078, 0.29541019285984693, -0.15510453966756663, 0.14123712941294625, 0.07513398863375187, 0.047357206277194475, 0.1950098911211604, 0.05424880639960369, 0.0754048651793883, 0.16572934353635424, 0.04916659806899372, -0.04661941217879454, -0.30168313936640817, -0.11846844834231195, -0.22344322830793403, 0.24047276271241053, -0.18538024039229467, -0.32581428651298794, 0.45505678724674953, 0.043631199858195725, 0.23402608780279047, 0.09239573516034787, 0.15326467276151692, 0.14375651685432309, 0.1087766515889338, 0.04285000827873037, 0.06489843396203858, 0.23043400298671, 0.011901367633115677, -0.103633855159084, -0.14825715552571983, 0.271979737494673] |
1,802.06125 | Characterization of Type Ia Supernova Light Curves Using Principal
Component Analysis of Sparse Functional Data | With growing data from ongoing and future supernova surveys it is possible to
empirically quantify the shapes of SNIa light curves in more detail, and to
quantitatively relate the shape parameters with the intrinsic properties of
SNIa. Building such relationship is critical in controlling systematic errors
associated with supernova cosmology. Based on a collection of well-observed
SNIa samples accumulated in the past years, we construct an empirical SNIa
light curve model using a statistical method called the functional principal
component analysis (FPCA) for sparse and irregularly sampled functional data.
Using this method, the entire light curve of an SNIa is represented by a linear
combination of principal component functions, and the SNIa is represented by a
few numbers called principal component scores. These scores are used to
establish relations between light curve shapes and physical quantities such as
intrinsic color, interstellar dust reddening, spectral line strength, and
spectral classes. These relations allow for descriptions of some critical
physical quantities based purely on light curve shape parameters. Our study
shows that some important spectral feature information is being encoded in the
broad band light curves, for instance, we find that the light curve shapes are
correlated with the velocity and velocity gradient of the Si II $\lambda$6355
line. This is important for supernova surveys, e.g., LSST and WFIRST. Moreover,
the FPCA light curve model is used to construct the entire light curve shape,
which in turn is used in a functional linear form to adjust intrinsic
luminosity when fitting distance models.
| astro-ph.SR astro-ph.CO astro-ph.HE | with growing data from ongoing and future supernova surveys it is possible to empirically quantify the shapes of snia light curves in more detail and to quantitatively relate the shape parameters with the intrinsic properties of snia building such relationship is critical in controlling systematic errors associated with supernova cosmology based on a collection of wellobserved snia samples accumulated in the past years we construct an empirical snia light curve model using a statistical method called the functional principal component analysis fpca for sparse and irregularly sampled functional data using this method the entire light curve of an snia is represented by a linear combination of principal component functions and the snia is represented by a few numbers called principal component scores these scores are used to establish relations between light curve shapes and physical quantities such as intrinsic color interstellar dust reddening spectral line strength and spectral classes these relations allow for descriptions of some critical physical quantities based purely on light curve shape parameters our study shows that some important spectral feature information is being encoded in the broad band light curves for instance we find that the light curve shapes are correlated with the velocity and velocity gradient of the si ii lambda6355 line this is important for supernova surveys eg lsst and wfirst moreover the fpca light curve model is used to construct the entire light curve shape which in turn is used in a functional linear form to adjust intrinsic luminosity when fitting distance models | [['with', 'growing', 'data', 'from', 'ongoing', 'and', 'future', 'supernova', 'surveys', 'it', 'is', 'possible', 'to', 'empirically', 'quantify', 'the', 'shapes', 'of', 'snia', 'light', 'curves', 'in', 'more', 'detail', 'and', 'to', 'quantitatively', 'relate', 'the', 'shape', 'parameters', 'with', 'the', 'intrinsic', 'properties', 'of', 'snia', 'building', 'such', 'relationship', 'is', 'critical', 'in', 'controlling', 'systematic', 'errors', 'associated', 'with', 'supernova', 'cosmology', 'based', 'on', 'a', 'collection', 'of', 'wellobserved', 'snia', 'samples', 'accumulated', 'in', 'the', 'past', 'years', 'we', 'construct', 'an', 'empirical', 'snia', 'light', 'curve', 'model', 'using', 'a', 'statistical', 'method', 'called', 'the', 'functional', 'principal', 'component', 'analysis', 'fpca', 'for', 'sparse', 'and', 'irregularly', 'sampled', 'functional', 'data', 'using', 'this', 'method', 'the', 'entire', 'light', 'curve', 'of', 'an', 'snia', 'is', 'represented', 'by', 'a', 'linear', 'combination', 'of', 'principal', 'component', 'functions', 'and', 'the', 'snia', 'is', 'represented', 'by', 'a', 'few', 'numbers', 'called', 'principal', 'component', 'scores', 'these', 'scores', 'are', 'used', 'to', 'establish', 'relations', 'between', 'light', 'curve', 'shapes', 'and', 'physical', 'quantities', 'such', 'as', 'intrinsic', 'color', 'interstellar', 'dust', 'reddening', 'spectral', 'line', 'strength', 'and', 'spectral', 'classes', 'these', 'relations', 'allow', 'for', 'descriptions', 'of', 'some', 'critical', 'physical', 'quantities', 'based', 'purely', 'on', 'light', 'curve', 'shape', 'parameters', 'our', 'study', 'shows', 'that', 'some', 'important', 'spectral', 'feature', 'information', 'is', 'being', 'encoded', 'in', 'the', 'broad', 'band', 'light', 'curves', 'for', 'instance', 'we', 'find', 'that', 'the', 'light', 'curve', 'shapes', 'are', 'correlated', 'with', 'the', 'velocity', 'and', 'velocity', 'gradient', 'of', 'the', 'si', 'ii', 'lambda6355', 'line', 'this', 'is', 'important', 'for', 'supernova', 'surveys', 'eg', 'lsst', 'and', 'wfirst', 'moreover', 'the', 'fpca', 'light', 'curve', 'model', 'is', 'used', 'to', 'construct', 'the', 'entire', 'light', 'curve', 'shape', 'which', 'in', 'turn', 'is', 'used', 'in', 'a', 'functional', 'linear', 'form', 'to', 'adjust', 'intrinsic', 'luminosity', 'when', 'fitting', 'distance', 'models']] | [-0.04271344344574027, 0.05953886840224732, -0.12508705096319317, 0.11474975135084242, -0.11892928924039006, -0.13742919887159952, 0.02967978550773114, 0.4348890782193048, -0.275316364325583, -0.2933426910880953, 0.08176466290187091, -0.3102392960889265, -0.12435622411966324, 0.26527948899380865, -0.06604641564190387, 0.04935275667719543, 0.06399589812476188, -0.049367524285800754, -0.07434704784140922, -0.24909038064535707, 0.31310400812420996, 0.030844850415363907, 0.27143500151485206, -0.03266679964773357, 0.06473694141372106, -0.005018981685861945, -0.0929042756559793, 0.0051826984975487, -0.12833314804889961, 0.15957919046282767, 0.22840007234470977, 0.19020227022841574, 0.1768174919821322, -0.35975664407759905, -0.27048187716503164, 0.156141156533733, 0.14143135026207893, 0.06289146785251797, -0.007093004001595546, -0.2276029251180589, 0.01726233892585151, -0.10890918480604887, -0.16393019373714923, -0.030926161878276615, 0.04940678594633937, 0.07145125256385654, -0.2213284182138741, 0.09157118981331587, -0.021156522653996944, 0.11794804029166699, -0.05810314254742116, -0.10940055950544775, -0.05163141316268593, 0.07485116489569191, 0.03618287049420178, 0.031463316957000644, 0.12614046933315695, -0.11849376195855439, -0.025841028193943204, 0.38902191000431774, -0.08535861961357295, -0.1084711998142302, 0.12180712608806789, -0.1063583059636876, -0.11291824345849455, 0.10474131055735052, 0.19492914702743291, 0.058567135848570616, -0.16454593808139908, 0.012509179828688502, -0.0018259173445403577, 0.21088442838424817, -0.012069302136078477, 0.03527540724558639, 0.26391244237497447, 0.14265772030036897, -0.0003701161555945873, 0.09278554575983435, -0.17632894785818645, -0.028344616994494573, -0.3168471374474466, -0.10577485129237175, -0.15905238264147192, 0.04726780198561028, -0.17150319790979848, -0.1832094442099333, 0.40909341371897606, 0.10823636559583247, 0.2514750189688057, 0.018166921178344637, 0.2923174587339163, 0.08094517820701003, 0.0772593360543251, 0.07549645263561978, 0.25993285603565164, 0.14951299678348004, 0.06069313659798354, -0.19937376866862178, 0.09587119699455798, 0.03583434318937361] |
1,802.06126 | The Mean-Field Approximation: Information Inequalities, Algorithms, and
Complexity | The mean field approximation to the Ising model is a canonical variational
tool that is used for analysis and inference in Ising models. We provide a
simple and optimal bound for the KL error of the mean field approximation for
Ising models on general graphs, and extend it to higher order Markov random
fields. Our bound improves on previous bounds obtained in work in the graph
limit literature by Borgs, Chayes, Lov\'asz, S\'os, and Vesztergombi and
another recent work by Basak and Mukherjee. Our bound is tight up to lower
order terms. Building on the methods used to prove the bound, along with
techniques from combinatorics and optimization, we study the algorithmic
problem of estimating the (variational) free energy for Ising models and
general Markov random fields. For a graph $G$ on $n$ vertices and interaction
matrix $J$ with Frobenius norm $\| J \|_F$, we provide algorithms that
approximate the free energy within an additive error of $\epsilon n \|J\|_F$ in
time $\exp(poly(1/\epsilon))$. We also show that approximation within $(n
\|J\|_F)^{1-\delta}$ is NP-hard for every $\delta > 0$. Finally, we provide
more efficient approximation algorithms, which find the optimal mean field
approximation, for ferromagnetic Ising models and for Ising models satisfying
Dobrushin's condition.
| cs.LG cond-mat.stat-mech math-ph math.CO math.MP | the mean field approximation to the ising model is a canonical variational tool that is used for analysis and inference in ising models we provide a simple and optimal bound for the kl error of the mean field approximation for ising models on general graphs and extend it to higher order markov random fields our bound improves on previous bounds obtained in work in the graph limit literature by borgs chayes lovasz sos and vesztergombi and another recent work by basak and mukherjee our bound is tight up to lower order terms building on the methods used to prove the bound along with techniques from combinatorics and optimization we study the algorithmic problem of estimating the variational free energy for ising models and general markov random fields for a graph g on n vertices and interaction matrix j with frobenius norm j _f we provide algorithms that approximate the free energy within an additive error of epsilon n j_f in time exppoly1epsilon we also show that approximation within n j_f1delta is nphard for every delta 0 finally we provide more efficient approximation algorithms which find the optimal mean field approximation for ferromagnetic ising models and for ising models satisfying dobrushins condition | [['the', 'mean', 'field', 'approximation', 'to', 'the', 'ising', 'model', 'is', 'a', 'canonical', 'variational', 'tool', 'that', 'is', 'used', 'for', 'analysis', 'and', 'inference', 'in', 'ising', 'models', 'we', 'provide', 'a', 'simple', 'and', 'optimal', 'bound', 'for', 'the', 'kl', 'error', 'of', 'the', 'mean', 'field', 'approximation', 'for', 'ising', 'models', 'on', 'general', 'graphs', 'and', 'extend', 'it', 'to', 'higher', 'order', 'markov', 'random', 'fields', 'our', 'bound', 'improves', 'on', 'previous', 'bounds', 'obtained', 'in', 'work', 'in', 'the', 'graph', 'limit', 'literature', 'by', 'borgs', 'chayes', 'lovasz', 'sos', 'and', 'vesztergombi', 'and', 'another', 'recent', 'work', 'by', 'basak', 'and', 'mukherjee', 'our', 'bound', 'is', 'tight', 'up', 'to', 'lower', 'order', 'terms', 'building', 'on', 'the', 'methods', 'used', 'to', 'prove', 'the', 'bound', 'along', 'with', 'techniques', 'from', 'combinatorics', 'and', 'optimization', 'we', 'study', 'the', 'algorithmic', 'problem', 'of', 'estimating', 'the', 'variational', 'free', 'energy', 'for', 'ising', 'models', 'and', 'general', 'markov', 'random', 'fields', 'for', 'a', 'graph', 'g', 'on', 'n', 'vertices', 'and', 'interaction', 'matrix', 'j', 'with', 'frobenius', 'norm', 'j', '_f', 'we', 'provide', 'algorithms', 'that', 'approximate', 'the', 'free', 'energy', 'within', 'an', 'additive', 'error', 'of', 'epsilon', 'n', 'j_f', 'in', 'time', 'exppoly1epsilon', 'we', 'also', 'show', 'that', 'approximation', 'within', 'n', 'j_f1delta', 'is', 'nphard', 'for', 'every', 'delta', '0', 'finally', 'we', 'provide', 'more', 'efficient', 'approximation', 'algorithms', 'which', 'find', 'the', 'optimal', 'mean', 'field', 'approximation', 'for', 'ferromagnetic', 'ising', 'models', 'and', 'for', 'ising', 'models', 'satisfying', 'dobrushins', 'condition']] | [-0.09203147747841706, 0.08009115728643552, -0.06351506486947499, 0.11266121698131588, -0.05184016559254284, -0.16953509991483098, 0.0764807152395703, 0.366644482086202, -0.2390452817728247, -0.33096647657566336, 0.08497672780749187, -0.24536196196957225, -0.15512497827349858, 0.1818571871967902, -0.030678070968148022, 0.08283243991958736, 0.04829023960491071, 0.05014192000023866, -0.0662914999262266, -0.28360555902382023, 0.25946061594713593, 0.029039749786744465, 0.2345112347872998, 0.06882725503054639, 0.08832137328549171, 0.05524619336675235, 0.049515962865128736, 0.012717095447058355, -0.22541339595531712, 0.1446078910554371, 0.23094166067855426, 0.10012921611497637, 0.2754783295141767, -0.3902514866421914, -0.19190645163139355, 0.14122255815043297, 0.137459738793123, 0.1139596447075984, 0.013493159787841118, -0.2515402522696248, 0.09053696989280408, -0.12873250336840225, -0.07459588200509099, -0.08901165578462858, 0.023393793732990234, 0.027744303882150118, -0.3623924172909266, 0.08770525914920499, 0.12686087945171973, 0.06051769789926071, -0.04070463918743833, -0.1888587516404913, 0.04899674257609862, 0.0756833448411719, 0.013863176471423872, 0.11215396218490904, 0.05191514839215822, -0.11401990312385611, -0.16945357410115514, 0.30467835020849565, -0.0994227068295735, -0.21219512204120133, 0.1325639881680359, -0.08440348991291158, -0.18257928538796067, 0.07952708545276642, 0.1697172108363716, 0.14818210117163513, -0.11112434490310057, 0.1832358185827835, -0.07013285208034829, 0.12000419157346588, 0.021836504260319092, -0.032815742525786874, 0.07629042603988107, 0.11842583716921883, 0.1379082218121419, 0.16429826168427666, -0.022159129954481393, -0.12315704988727542, -0.2727617936854686, -0.12216182232801638, -0.24435359888696043, 0.050533579974248066, -0.16548487122719652, -0.1793239012813364, 0.36003492888585015, 0.17749810472935737, 0.14411151496899413, 0.1618985361308468, 0.2590942877396267, 0.13145698233151892, -0.014839103886501948, 0.1799418431117045, 0.1915213291833982, 0.21841451533878195, 0.021884430246661656, -0.1616375649250791, 0.042703580832572176, 0.15811463108932103] |
1,802.06127 | K-theory and index pairings for C*-algebras generated by q-normal
operators | The paper presents a detailed description of the K-theory and K-homology of
C*-algebras generated by q-normal operators including generators and the index
pairing. The C*-algebras generated by q-normal operators can be viewed as a
q-deformation of the quantum complex plane. In this sense, we find deformations
of the classical Bott projections describing complex line bundles over the
2-sphere, but there are also simpler generators for the K_0-groups, for
instance 1-dimensional Powers-Rieffel type projections and elementary
projections belonging to the C*-algebra. The index pairing between these
projections and generators of the even K-homology group is computed, and the
result is used to express the K_0-classes of the quantized line bundles of any
winding number in terms of the other projections.
| math.QA math.KT | the paper presents a detailed description of the ktheory and khomology of calgebras generated by qnormal operators including generators and the index pairing the calgebras generated by qnormal operators can be viewed as a qdeformation of the quantum complex plane in this sense we find deformations of the classical bott projections describing complex line bundles over the 2sphere but there are also simpler generators for the k_0groups for instance 1dimensional powersrieffel type projections and elementary projections belonging to the calgebra the index pairing between these projections and generators of the even khomology group is computed and the result is used to express the k_0classes of the quantized line bundles of any winding number in terms of the other projections | [['the', 'paper', 'presents', 'a', 'detailed', 'description', 'of', 'the', 'ktheory', 'and', 'khomology', 'of', 'calgebras', 'generated', 'by', 'qnormal', 'operators', 'including', 'generators', 'and', 'the', 'index', 'pairing', 'the', 'calgebras', 'generated', 'by', 'qnormal', 'operators', 'can', 'be', 'viewed', 'as', 'a', 'qdeformation', 'of', 'the', 'quantum', 'complex', 'plane', 'in', 'this', 'sense', 'we', 'find', 'deformations', 'of', 'the', 'classical', 'bott', 'projections', 'describing', 'complex', 'line', 'bundles', 'over', 'the', '2sphere', 'but', 'there', 'are', 'also', 'simpler', 'generators', 'for', 'the', 'k_0groups', 'for', 'instance', '1dimensional', 'powersrieffel', 'type', 'projections', 'and', 'elementary', 'projections', 'belonging', 'to', 'the', 'calgebra', 'the', 'index', 'pairing', 'between', 'these', 'projections', 'and', 'generators', 'of', 'the', 'even', 'khomology', 'group', 'is', 'computed', 'and', 'the', 'result', 'is', 'used', 'to', 'express', 'the', 'k_0classes', 'of', 'the', 'quantized', 'line', 'bundles', 'of', 'any', 'winding', 'number', 'in', 'terms', 'of', 'the', 'other', 'projections']] | [-0.1650608690274027, 0.12911424947945968, -0.0452387738199431, 0.09773254584446076, -0.05522374730257286, -0.11220028019368143, -0.025635254313829906, 0.3573055513424136, -0.3179328799823899, -0.23207759778252093, 0.09486664521361907, -0.2549195755396425, -0.14261275509390112, 0.21172766764727186, -0.13316048268165628, -0.00956995427900515, 0.05419028507766582, 0.07583972458112037, -0.1268904426702894, -0.21671799687230645, 0.40491344723692635, -0.009971403932175204, 0.2336898682504829, 0.009363554039243924, 0.068403242582108, 0.04814345565806064, -0.04578903012798499, 0.012997563760648718, -0.09237423498120348, 0.17218624944088318, 0.2974819279260049, 0.06949164890052782, 0.12418215447973649, -0.3889775604277976, -0.14077019315386602, 0.19145919373495726, 0.11635656330055731, 0.014522796694063029, -0.0012714473197189301, -0.29037134524561087, 0.06075465451924513, -0.20490037111202414, -0.12934001967689748, -0.12103332044020043, 0.04504267610925234, 0.016653017685511858, -0.2357344850858326, 0.00013644951647265926, 0.11187893610005661, 0.13552406834220412, -0.059865898719073225, -0.055173076803685495, -0.10382956949504629, 0.12871674046520207, 0.01615084400321594, -0.003382812857912001, 0.13077827827547187, -0.07944794693740748, -0.18234684358260167, 0.39553162330461633, -0.005592081356414799, -0.23757516465177445, 0.12017555151852953, -0.16074306023764914, -0.12857291470597482, 0.12170062028660865, 0.07430210957398355, 0.12840852058113758, 0.00016591519559338943, 0.1523293687077042, -0.11808745464373191, 0.07888168469268703, 0.05154628230464029, 0.028113523584995734, 0.1477400818918595, 0.02845605939895041, 0.06751382479175799, 0.12830553428315306, 0.015174928926310297, -0.07805734044493381, -0.3417897427817649, -0.22138588407503093, -0.1500519626187871, 0.12470927594576851, -0.09814340930559842, -0.19564965746160282, 0.4643712152048188, 0.07683177227381285, 0.23701994806938506, 0.06639245854122407, 0.23878078381294163, 0.1324871594068531, 0.08019803430080034, 0.04791250122983356, 0.1438958551497909, 0.23394352786037756, 0.010222190654623495, -0.13092464197947942, -0.02288027718600075, 0.23581035812464307] |
1,802.06128 | Topological edge states in the Su-Schrieffer-Heeger model subject to
balanced particle gain and loss | We investigate the Su-Schrieffer-Heeger model in presence of an injection and
removal of particles, introduced via a master equation in Lindblad form. It is
shown that the dynamics of the density matrix follows the predictions of
calculations in which the gain and loss are modeled by complex
$\mathcal{PT}$-symmetric potentials. In particular it is found that there is a
clear distinction in the dynamics between the topologically different cases
known from the stationary eigenstates.
| quant-ph cond-mat.quant-gas | we investigate the suschriefferheeger model in presence of an injection and removal of particles introduced via a master equation in lindblad form it is shown that the dynamics of the density matrix follows the predictions of calculations in which the gain and loss are modeled by complex mathcalptsymmetric potentials in particular it is found that there is a clear distinction in the dynamics between the topologically different cases known from the stationary eigenstates | [['we', 'investigate', 'the', 'suschriefferheeger', 'model', 'in', 'presence', 'of', 'an', 'injection', 'and', 'removal', 'of', 'particles', 'introduced', 'via', 'a', 'master', 'equation', 'in', 'lindblad', 'form', 'it', 'is', 'shown', 'that', 'the', 'dynamics', 'of', 'the', 'density', 'matrix', 'follows', 'the', 'predictions', 'of', 'calculations', 'in', 'which', 'the', 'gain', 'and', 'loss', 'are', 'modeled', 'by', 'complex', 'mathcalptsymmetric', 'potentials', 'in', 'particular', 'it', 'is', 'found', 'that', 'there', 'is', 'a', 'clear', 'distinction', 'in', 'the', 'dynamics', 'between', 'the', 'topologically', 'different', 'cases', 'known', 'from', 'the', 'stationary', 'eigenstates']] | [-0.13363526481975585, 0.13447450186394647, -0.0877141774925467, 0.06418999308586273, 0.03660355408816305, -0.13143208666309103, -0.014938450890452894, 0.3561967229087875, -0.258534942163164, -0.2682570206026917, 0.024129181811649813, -0.29394928644066803, -0.22984268926466778, 0.14295595892615717, -0.0003596557278747428, 0.02144849873211694, 0.04489081162538328, 0.030572170761656272, -0.0605458020462259, -0.16973355588541456, 0.3223056466165573, 0.01812077106984511, 0.24368005618453026, 0.04683933645639926, 0.08082909310517246, 0.0019532525848138006, 0.017936514149904763, -0.020387359232824552, -0.12264969969931384, 0.04102088398402174, 0.19168018794631306, 0.06891884736410558, 0.2267224911396226, -0.43353352769699, -0.2504309824323409, 0.08544380771640483, 0.13587402410754193, 0.12253212635819992, -0.08459259437601248, -0.2836050133536608, 0.025059258322907636, -0.17338207584793028, -0.15160266054181815, -0.059580324686527866, 0.04377720337233519, 0.004998435177011032, -0.2513354295379903, 0.10475908662830416, 0.08284052821156913, -0.010839347419116092, -0.0632363349448073, -0.04319188053630395, -0.078106536632021, 0.10409091922059042, 0.025042395415231074, -0.014151378923848476, 0.09289037492381383, -0.14490577283838432, -0.09025835813571738, 0.3963199491064026, -0.08055897883764684, -0.2524014846357989, 0.20916153778870628, -0.14184501242173247, -0.08155931432871785, 0.1315524974544469, 0.09976029128142416, 0.0887005816992015, -0.19427507406432334, 0.0976952643002932, -0.051633596045526434, 0.1472987192491554, 0.041952776167643806, -0.006488812666335334, 0.1778933360458237, 0.14289481543348975, 0.037377788639015024, 0.1589484614358373, -0.031141906326049813, -0.19089407864192579, -0.2985450851998917, -0.11107716218198407, -0.2164589886438765, 0.0601932995199953, -0.047611998023755514, -0.1683770154219293, 0.41219171684885986, 0.1272094098417318, 0.20172251436910402, -0.018905564145925008, 0.2605930842516612, 0.18648229678454872, 0.0527775011038127, 0.08581472794231895, 0.2597683840495062, 0.1872298623122632, 0.05403438528157668, -0.24624982186312444, 0.06375901660027161, 0.014126368406011837] |
1,802.06129 | The Vertex Sample Complexity of Free Energy is Polynomial | We study the following question: given a massive Markov random field on $n$
nodes, can a small sample from it provide a rough approximation to the free
energy $\mathcal{F}_n = \log{Z_n}$?
Results in graph limit literature by Borgs, Chayes, Lov\'asz, S\'os, and
Vesztergombi show that for Ising models on $n$ nodes and interactions of
strength $\Theta(1/n)$, an $\epsilon$ approximation to $\log Z_n / n$ can be
achieved by sampling a randomly induced model on $2^{O(1/\epsilon^2)}$ nodes.
We show that the sampling complexity of this problem is {\em polynomial in}
$1/\epsilon$. We further show a polynomial dependence on $\epsilon$ cannot be
avoided.
Our results are very general as they apply to higher order Markov random
fields. For Markov random fields of order $r$, we obtain an algorithm that
achieves $\epsilon$ approximation using a number of samples polynomial in $r$
and $1/\epsilon$ and running time that is $2^{O(1/\epsilon^2)}$ up to
polynomial factors in $r$ and $\epsilon$. For ferromagnetic Ising models, the
running time is polynomial in $1/\epsilon$.
Our results are intimately connected to recent research on the regularity
lemma and property testing, where the interest is in finding which properties
can tested within $\epsilon$ error in time polynomial in $1/\epsilon$. In
particular, our proofs build on results from a recent work by Alon, de la Vega,
Kannan and Karpinski, who also introduced the notion of polynomial vertex
sample complexity. Another critical ingredient of the proof is an effective
bound by the authors of the paper relating the variational free energy and the
free energy.
| cs.LG math.CO | we study the following question given a massive markov random field on n nodes can a small sample from it provide a rough approximation to the free energy mathcalf_n logz_n results in graph limit literature by borgs chayes lovasz sos and vesztergombi show that for ising models on n nodes and interactions of strength theta1n an epsilon approximation to log z_n n can be achieved by sampling a randomly induced model on 2o1epsilon2 nodes we show that the sampling complexity of this problem is em polynomial in 1epsilon we further show a polynomial dependence on epsilon cannot be avoided our results are very general as they apply to higher order markov random fields for markov random fields of order r we obtain an algorithm that achieves epsilon approximation using a number of samples polynomial in r and 1epsilon and running time that is 2o1epsilon2 up to polynomial factors in r and epsilon for ferromagnetic ising models the running time is polynomial in 1epsilon our results are intimately connected to recent research on the regularity lemma and property testing where the interest is in finding which properties can tested within epsilon error in time polynomial in 1epsilon in particular our proofs build on results from a recent work by alon de la vega kannan and karpinski who also introduced the notion of polynomial vertex sample complexity another critical ingredient of the proof is an effective bound by the authors of the paper relating the variational free energy and the free energy | [['we', 'study', 'the', 'following', 'question', 'given', 'a', 'massive', 'markov', 'random', 'field', 'on', 'n', 'nodes', 'can', 'a', 'small', 'sample', 'from', 'it', 'provide', 'a', 'rough', 'approximation', 'to', 'the', 'free', 'energy', 'mathcalf_n', 'logz_n', 'results', 'in', 'graph', 'limit', 'literature', 'by', 'borgs', 'chayes', 'lovasz', 'sos', 'and', 'vesztergombi', 'show', 'that', 'for', 'ising', 'models', 'on', 'n', 'nodes', 'and', 'interactions', 'of', 'strength', 'theta1n', 'an', 'epsilon', 'approximation', 'to', 'log', 'z_n', 'n', 'can', 'be', 'achieved', 'by', 'sampling', 'a', 'randomly', 'induced', 'model', 'on', '2o1epsilon2', 'nodes', 'we', 'show', 'that', 'the', 'sampling', 'complexity', 'of', 'this', 'problem', 'is', 'em', 'polynomial', 'in', '1epsilon', 'we', 'further', 'show', 'a', 'polynomial', 'dependence', 'on', 'epsilon', 'can', 'not', 'be', 'avoided', 'our', 'results', 'are', 'very', 'general', 'as', 'they', 'apply', 'to', 'higher', 'order', 'markov', 'random', 'fields', 'for', 'markov', 'random', 'fields', 'of', 'order', 'r', 'we', 'obtain', 'an', 'algorithm', 'that', 'achieves', 'epsilon', 'approximation', 'using', 'a', 'number', 'of', 'samples', 'polynomial', 'in', 'r', 'and', '1epsilon', 'and', 'running', 'time', 'that', 'is', '2o1epsilon2', 'up', 'to', 'polynomial', 'factors', 'in', 'r', 'and', 'epsilon', 'for', 'ferromagnetic', 'ising', 'models', 'the', 'running', 'time', 'is', 'polynomial', 'in', '1epsilon', 'our', 'results', 'are', 'intimately', 'connected', 'to', 'recent', 'research', 'on', 'the', 'regularity', 'lemma', 'and', 'property', 'testing', 'where', 'the', 'interest', 'is', 'in', 'finding', 'which', 'properties', 'can', 'tested', 'within', 'epsilon', 'error', 'in', 'time', 'polynomial', 'in', '1epsilon', 'in', 'particular', 'our', 'proofs', 'build', 'on', 'results', 'from', 'a', 'recent', 'work', 'by', 'alon', 'de', 'la', 'vega', 'kannan', 'and', 'karpinski', 'who', 'also', 'introduced', 'the', 'notion', 'of', 'polynomial', 'vertex', 'sample', 'complexity', 'another', 'critical', 'ingredient', 'of', 'the', 'proof', 'is', 'an', 'effective', 'bound', 'by', 'the', 'authors', 'of', 'the', 'paper', 'relating', 'the', 'variational', 'free', 'energy', 'and', 'the', 'free', 'energy']] | [-0.13973738629999571, 0.10634720913943602, -0.06549846495431848, 0.052795930055901406, -0.059701873693615196, -0.13769468159414827, 0.07139727945183404, 0.3458629783466458, -0.2749854621533304, -0.3352545108161867, 0.08062705727061256, -0.2555153195625171, -0.139050857976079, 0.1863538971533999, -0.07757570308353752, 0.06119484773697331, 0.03515770642645657, 0.042165765797370115, -0.014505830619949847, -0.34506364134384787, 0.2692652930468321, 0.05092279595672153, 0.212997031387873, 0.06529929211921989, 0.06897673014365137, 0.011514811438508332, 0.003243136302102357, 0.037267942974343896, -0.17356138364749496, 0.0744350179056637, 0.2624860686104803, 0.10258608557656407, 0.30470969749242066, -0.3857628579099546, -0.1518928859019652, 0.12469607586599886, 0.1505542557667941, 0.0925230101714842, -0.014843026918359101, -0.2657568512521684, 0.12295097566395997, -0.11472039059898816, -0.10371897578286007, -0.06695449524745345, 0.02427101325104013, 0.01997955281659961, -0.3302968043927103, 0.03677216154919006, 0.1080878722043708, 0.033452372815459964, 0.011911803105846048, -0.1311855722363107, 0.04368787385290489, 0.05526102059520781, 0.015127601637039334, 0.11206720572430641, 0.06485507616214455, -0.10153935061115772, -0.15045536193298176, 0.3119333966569975, -0.08601805060449988, -0.1861431645974517, 0.14324567968398333, -0.11764117332920432, -0.17966257811710237, 0.09081512782536447, 0.1616323409145698, 0.15079908494191477, -0.09218773003527894, 0.1928992579188198, -0.08720257625449448, 0.16560273796878755, 0.08992426800075919, -0.0028281942165922372, 0.06888978085666896, 0.11467151398863644, 0.0962443240173161, 0.13319019863102585, -0.010476682214066385, -0.08669321172544733, -0.28171756931347774, -0.13734044487518257, -0.26692296393588183, 0.07066095451550791, -0.17809108862740686, -0.15703876898810268, 0.3607919274526648, 0.14343478303588927, 0.1938233591541648, 0.1395211620484479, 0.23678369067329913, 0.12460687380190939, 0.005472859381698072, 0.14158186768181621, 0.16202172188088299, 0.13150808492861688, 0.042506521348143, -0.1707772165471688, 0.09341325605288148, 0.14200278252922] |
1,802.0613 | Fast, Trainable, Multiscale Denoising | Denoising is a fundamental imaging problem. Versatile but fast filtering has
been demanded for mobile camera systems. We present an approach to multiscale
filtering which allows real-time applications on low-powered devices. The key
idea is to learn a set of kernels that upscales, filters, and blends patches of
different scales guided by local structure analysis. This approach is trainable
so that learned filters are capable of treating diverse noise patterns and
artifacts. Experimental results show that the presented approach produces
comparable results to state-of-the-art algorithms while processing time is
orders of magnitude faster.
| cs.CV | denoising is a fundamental imaging problem versatile but fast filtering has been demanded for mobile camera systems we present an approach to multiscale filtering which allows realtime applications on lowpowered devices the key idea is to learn a set of kernels that upscales filters and blends patches of different scales guided by local structure analysis this approach is trainable so that learned filters are capable of treating diverse noise patterns and artifacts experimental results show that the presented approach produces comparable results to stateoftheart algorithms while processing time is orders of magnitude faster | [['denoising', 'is', 'a', 'fundamental', 'imaging', 'problem', 'versatile', 'but', 'fast', 'filtering', 'has', 'been', 'demanded', 'for', 'mobile', 'camera', 'systems', 'we', 'present', 'an', 'approach', 'to', 'multiscale', 'filtering', 'which', 'allows', 'realtime', 'applications', 'on', 'lowpowered', 'devices', 'the', 'key', 'idea', 'is', 'to', 'learn', 'a', 'set', 'of', 'kernels', 'that', 'upscales', 'filters', 'and', 'blends', 'patches', 'of', 'different', 'scales', 'guided', 'by', 'local', 'structure', 'analysis', 'this', 'approach', 'is', 'trainable', 'so', 'that', 'learned', 'filters', 'are', 'capable', 'of', 'treating', 'diverse', 'noise', 'patterns', 'and', 'artifacts', 'experimental', 'results', 'show', 'that', 'the', 'presented', 'approach', 'produces', 'comparable', 'results', 'to', 'stateoftheart', 'algorithms', 'while', 'processing', 'time', 'is', 'orders', 'of', 'magnitude', 'faster']] | [-0.0741909141426966, 0.03678565545609066, -0.10441365187126463, 0.03834394842601552, -0.10522382918705223, -0.17154294720560473, -0.042056804734422394, 0.4841573591273959, -0.2765221255080354, -0.3335970690153459, 0.0814758393392768, -0.2550956986029945, -0.22657882416200253, 0.25663463589084407, -0.09783276131937421, 0.10777269719388857, 0.12909433841505039, -0.03488336947636418, -0.059196586718141875, -0.24396574462423481, 0.2303245234007757, 0.06503792747013992, 0.35090243306902225, -0.01243058608604535, 0.16081438640693344, -0.01529165640753764, -0.08454557122682692, 0.02006267554937832, -0.04007595571836704, 0.17104370458306925, 0.28218579264257543, 0.15694451493321246, 0.3238563224578136, -0.42265897156089866, -0.2526414809267848, 0.03535386930490213, 0.17125822487036868, 0.11713056774154025, -0.055302631276439355, -0.31149751402597914, 0.1305906968929815, -0.10348110603949716, -0.04786734016326141, -0.17096498316173914, 0.008967484017052958, 0.006464200439206975, -0.3095725410128443, 0.043213803806812855, 0.062022501182171605, 0.013285703085843594, -0.027183263142178865, -0.11016448964214613, 0.06960187889685635, 0.12694085122747045, -0.01711097417739771, 0.020057643162867716, 0.17871111971376244, -0.15682255670488363, -0.14470998140712898, 0.36275194488185386, -0.03252134208757711, -0.16819720927757958, 0.2331799641201493, -0.029744052856419515, -0.09817654548853796, 0.16711040589237405, 0.1887562025278326, 0.156020610623302, -0.17878338929468526, 0.028763015472870922, -0.006496076632331135, 0.234707820079019, 0.017141647752053957, 0.06916865758017025, 0.1530263838721239, 0.25326622264667525, 0.11510366142316851, 0.11725936577685418, -0.11313029778470356, -0.057051744292019514, -0.19833220712720387, -0.0882065924114838, -0.1990685302123267, -0.04798806976822395, -0.08647545555735417, -0.1329220905419632, 0.4098651142770885, 0.2700082124561392, 0.16892530658953292, 0.053430369287799366, 0.39260143483738585, 0.08701246276999178, 0.16032744451395928, 0.07117183746329399, 0.1503129598599488, 0.04505055067530002, 0.12593569991839748, -0.15307674713943514, 0.05183666389715928, 0.06537438210059879] |
1,802.06131 | Design and Development of Effective Transmission Mechanisms on a Tendon
Driven Hand Orthosis for Stroke Patients | Tendon-driven hand orthoses have advantages over exoskeletons with respect to
wearability and safety because of their low-profile design and ability to fit a
range of patients without requiring custom joint alignment. However, no
existing study on a wearable tendon-driven hand orthosis for stroke patients
presents evidence that such devices can overcome spasticity given repeated use
and fatigue, or discusses transmission efficiency. In this study, we propose
two designs that provide effective force transmission by increasing moment arms
around finger joints. We evaluate the designs with geometric models and
experiment using a 3D-printed artificial finger to find force and joint angle
characteristics of the suggested structures. We also perform clinical tests
with stroke patients to demonstrate the feasibility of the designs. The testing
supports the hypothesis that the proposed designs efficiently elicit extension
of the digits in patients with spasticity as compared to existing baselines.
| cs.RO | tendondriven hand orthoses have advantages over exoskeletons with respect to wearability and safety because of their lowprofile design and ability to fit a range of patients without requiring custom joint alignment however no existing study on a wearable tendondriven hand orthosis for stroke patients presents evidence that such devices can overcome spasticity given repeated use and fatigue or discusses transmission efficiency in this study we propose two designs that provide effective force transmission by increasing moment arms around finger joints we evaluate the designs with geometric models and experiment using a 3dprinted artificial finger to find force and joint angle characteristics of the suggested structures we also perform clinical tests with stroke patients to demonstrate the feasibility of the designs the testing supports the hypothesis that the proposed designs efficiently elicit extension of the digits in patients with spasticity as compared to existing baselines | [['tendondriven', 'hand', 'orthoses', 'have', 'advantages', 'over', 'exoskeletons', 'with', 'respect', 'to', 'wearability', 'and', 'safety', 'because', 'of', 'their', 'lowprofile', 'design', 'and', 'ability', 'to', 'fit', 'a', 'range', 'of', 'patients', 'without', 'requiring', 'custom', 'joint', 'alignment', 'however', 'no', 'existing', 'study', 'on', 'a', 'wearable', 'tendondriven', 'hand', 'orthosis', 'for', 'stroke', 'patients', 'presents', 'evidence', 'that', 'such', 'devices', 'can', 'overcome', 'spasticity', 'given', 'repeated', 'use', 'and', 'fatigue', 'or', 'discusses', 'transmission', 'efficiency', 'in', 'this', 'study', 'we', 'propose', 'two', 'designs', 'that', 'provide', 'effective', 'force', 'transmission', 'by', 'increasing', 'moment', 'arms', 'around', 'finger', 'joints', 'we', 'evaluate', 'the', 'designs', 'with', 'geometric', 'models', 'and', 'experiment', 'using', 'a', '3dprinted', 'artificial', 'finger', 'to', 'find', 'force', 'and', 'joint', 'angle', 'characteristics', 'of', 'the', 'suggested', 'structures', 'we', 'also', 'perform', 'clinical', 'tests', 'with', 'stroke', 'patients', 'to', 'demonstrate', 'the', 'feasibility', 'of', 'the', 'designs', 'the', 'testing', 'supports', 'the', 'hypothesis', 'that', 'the', 'proposed', 'designs', 'efficiently', 'elicit', 'extension', 'of', 'the', 'digits', 'in', 'patients', 'with', 'spasticity', 'as', 'compared', 'to', 'existing', 'baselines']] | [-0.09449279764279102, 0.018888698011222813, -0.05529966010039465, 0.002460832102062543, -0.12109710717858332, -0.18697381798604815, 0.0614589301100447, 0.4371300014770693, -0.17940878742633182, -0.3281710100309283, 0.11507130808766103, -0.2631405618772583, -0.18859725702431104, 0.22326540827796432, -0.14732504779143105, 0.0804900913382072, 0.09243450710922237, 0.012424150242319834, -0.03604789573243276, -0.2017035748366551, 0.2426470516915692, 0.06848153446238332, 0.33960417814604527, 0.017976041837957583, 0.10640023113147537, 0.032056544250938006, -0.008665450475139854, 0.017732182084324047, -0.10275254376832284, 0.13704380275319433, 0.2700083157084868, 0.1597024936693035, 0.2970279834052134, -0.46793521226694185, -0.20963883119919854, 0.07654678650497873, 0.10531683786474685, 0.048092901318644486, -0.06300562352650256, -0.2797459645145055, 0.10983111505306119, -0.17534371301246665, -0.10089836122309255, -0.10227622611677765, -0.025692304344071697, 0.03960703177654068, -0.2986144903439304, 0.02702419220562054, 0.0009016376053397027, 0.12021636840007785, -0.05790831860991198, -0.12304288998550167, 0.055776286339904696, 0.1532430861762906, 0.08866941205471651, -0.00027974900957714353, 0.16925831902578162, -0.13398636374641784, -0.18540655639501186, 0.3503695381708288, 0.01777460383851172, -0.19335227014299664, 0.21569055784331997, -0.08704933334552657, -0.07228312852870052, 0.08707746280641812, 0.19616350444024042, 0.062280866268944614, -0.13905172507899502, -0.04102726853913433, 0.02542791709129233, 0.19512624219836047, 0.10164320241084271, -0.02547578796818723, 0.18544424153838512, 0.18477214246134585, 0.04029070732940454, 0.15094582604554793, -0.14096881296427455, -0.024024583195568994, -0.21822947936258666, -0.15339128987721373, -0.11110035005387747, -0.00879439222949764, -0.049268037833725326, -0.13417214432977037, 0.37196920931779054, 0.20388802244108067, 0.14406819723080844, 0.1094267978704819, 0.36449376029324615, -0.006586922301115313, 0.1282954993641599, 0.019026241957261745, 0.21494888029216477, 0.02598909146521085, 0.06810630969428327, -0.2503875044478466, 0.11301379335539725, -0.03248402431199793] |
1,802.06132 | Interaction Matters: A Note on Non-asymptotic Local Convergence of
Generative Adversarial Networks | Motivated by the pursuit of a systematic computational and algorithmic
understanding of Generative Adversarial Networks (GANs), we present a simple
yet unified non-asymptotic local convergence theory for smooth two-player
games, which subsumes several discrete-time gradient-based saddle point
dynamics. The analysis reveals the surprising nature of the off-diagonal
interaction term as both a blessing and a curse. On the one hand, this
interaction term explains the origin of the slow-down effect in the convergence
of Simultaneous Gradient Ascent (SGA) to stable Nash equilibria. On the other
hand, for the unstable equilibria, exponential convergence can be proved thanks
to the interaction term, for four modified dynamics proposed to stabilize GAN
training: Optimistic Mirror Descent (OMD), Consensus Optimization (CO),
Implicit Updates (IU) and Predictive Method (PM). The analysis uncovers the
intimate connections among these stabilizing techniques, and provides detailed
characterization on the choice of learning rate. As a by-product, we present a
new analysis for OMD proposed in Daskalakis, Ilyas, Syrgkanis, and Zeng [2017]
with improved rates.
| stat.ML cs.GT cs.LG | motivated by the pursuit of a systematic computational and algorithmic understanding of generative adversarial networks gans we present a simple yet unified nonasymptotic local convergence theory for smooth twoplayer games which subsumes several discretetime gradientbased saddle point dynamics the analysis reveals the surprising nature of the offdiagonal interaction term as both a blessing and a curse on the one hand this interaction term explains the origin of the slowdown effect in the convergence of simultaneous gradient ascent sga to stable nash equilibria on the other hand for the unstable equilibria exponential convergence can be proved thanks to the interaction term for four modified dynamics proposed to stabilize gan training optimistic mirror descent omd consensus optimization co implicit updates iu and predictive method pm the analysis uncovers the intimate connections among these stabilizing techniques and provides detailed characterization on the choice of learning rate as a byproduct we present a new analysis for omd proposed in daskalakis ilyas syrgkanis and zeng 2017 with improved rates | [['motivated', 'by', 'the', 'pursuit', 'of', 'a', 'systematic', 'computational', 'and', 'algorithmic', 'understanding', 'of', 'generative', 'adversarial', 'networks', 'gans', 'we', 'present', 'a', 'simple', 'yet', 'unified', 'nonasymptotic', 'local', 'convergence', 'theory', 'for', 'smooth', 'twoplayer', 'games', 'which', 'subsumes', 'several', 'discretetime', 'gradientbased', 'saddle', 'point', 'dynamics', 'the', 'analysis', 'reveals', 'the', 'surprising', 'nature', 'of', 'the', 'offdiagonal', 'interaction', 'term', 'as', 'both', 'a', 'blessing', 'and', 'a', 'curse', 'on', 'the', 'one', 'hand', 'this', 'interaction', 'term', 'explains', 'the', 'origin', 'of', 'the', 'slowdown', 'effect', 'in', 'the', 'convergence', 'of', 'simultaneous', 'gradient', 'ascent', 'sga', 'to', 'stable', 'nash', 'equilibria', 'on', 'the', 'other', 'hand', 'for', 'the', 'unstable', 'equilibria', 'exponential', 'convergence', 'can', 'be', 'proved', 'thanks', 'to', 'the', 'interaction', 'term', 'for', 'four', 'modified', 'dynamics', 'proposed', 'to', 'stabilize', 'gan', 'training', 'optimistic', 'mirror', 'descent', 'omd', 'consensus', 'optimization', 'co', 'implicit', 'updates', 'iu', 'and', 'predictive', 'method', 'pm', 'the', 'analysis', 'uncovers', 'the', 'intimate', 'connections', 'among', 'these', 'stabilizing', 'techniques', 'and', 'provides', 'detailed', 'characterization', 'on', 'the', 'choice', 'of', 'learning', 'rate', 'as', 'a', 'byproduct', 'we', 'present', 'a', 'new', 'analysis', 'for', 'omd', 'proposed', 'in', 'daskalakis', 'ilyas', 'syrgkanis', 'and', 'zeng', '2017', 'with', 'improved', 'rates']] | [-0.12466786967796142, -0.016167438374775137, -0.13781667477165582, 0.12271183561420757, -0.08300232548592326, -0.18907645773828213, 0.10109809041523198, 0.3515403501266625, -0.28833330998574297, -0.2993501342398806, 0.09831058825239428, -0.22102493465380982, -0.21387257962344797, 0.14315743001600717, -0.12050727261173214, 0.05680607950052052, 0.07109447288686878, -0.024977661030755546, -0.055849442491307855, -0.27683837001034817, 0.2620668219533846, 0.08097118864041622, 0.29326459821999257, 0.028592914752788953, 0.13396703860575357, -0.0021690519646587183, 0.0041312069840660675, 0.0017749703620657598, -0.11360508424909843, 0.13655130119074388, 0.23969044520461108, 0.13916759141806537, 0.3516358780714632, -0.4087520026940384, -0.20645985801338554, 0.1214433795346827, 0.15234933826576724, 0.1149463489204588, -0.1014610419374465, -0.28368526351055345, 0.054096772522591284, -0.14003710277904213, -0.0832654235429599, -0.14534297131824714, -0.04052555564779537, 0.03376523216192159, -0.31218710745701944, 0.06715154304080558, 0.11254220342451415, 0.0710973064929384, -0.046624386353143976, -0.13877803130658126, 0.009353173775255588, 0.07470996190073895, 0.07694654827980336, 0.027180036741303155, 0.09952217487363356, -0.11364963700269218, -0.16004067067516842, 0.31575294876002646, -0.08687513815938992, -0.15868543683047023, 0.18859689765426965, -0.021264761846306865, -0.1761846071833379, 0.12600304990824016, 0.19158326227366468, 0.1514640136591896, -0.11640175802781721, 0.07074499205776141, -0.023775049439914226, 0.13620359238120727, 0.03886813378001512, 0.013788593538745415, 0.11794745232595667, 0.20085245660689025, 0.1497147233151128, 0.1294595509873949, -0.03734817846815325, -0.201633980229177, -0.26838803462729866, -0.09330290771358035, -0.13722423272653042, 0.040123278572955424, -0.147096384667625, -0.15090167923277656, 0.39926112524342317, 0.13294859499059206, 0.17528810206389317, 0.10547525790574291, 0.2991986537775013, 0.05376650907522056, -0.004325245964152315, 0.09272002902943777, 0.2686156397106903, 0.14493779939930726, 0.10810398878358259, -0.2674009330246449, 0.12935624976979535, 0.13869510498987025] |
1,802.06133 | Dual phase-space cascades in 3D hybrid-Vlasov-Maxwell turbulence | To explain energy dissipation via turbulence in collisionless, magnetized
plasmas, the existence of a dual real- and velocity-space cascade of
ion-entropy fluctuations below the ion gyroradius has been proposed. Such a
dual cascade, predicted by the gyrokinetic theory, has previously been observed
in gyrokinetic simulations of two-dimensional, electrostatic turbulence. For
the first time we show evidence for a dual phase-space cascade of ion-entropy
fluctuations in a three-dimensional simulation of hybrid-kinetic,
electromagnetic turbulence. Some of the scalings observed in the energy spectra
are consistent with a generalized theory for the cascade that accounts for the
spectral anisotropy of critically balanced, intermittent, sub-ion-Larmor-scale
fluctuations. The observed velocity-space cascade is also anisotropic with
respect to the magnetic-field direction, with linear phase mixing along
magnetic-field lines proceeding mainly at spatial scales above the ion
gyroradius and nonlinear phase mixing across magnetic-field lines proceeding at
perpendicular scales below the ion gyroradius. Such phase-space anisotropy
could be sought in heliospheric and magnetospheric data of solar-wind
turbulence and has far-reaching implications for the dissipation of turbulence
in weakly collisional astrophysical plasmas.
| physics.plasm-ph astro-ph.SR physics.space-ph | to explain energy dissipation via turbulence in collisionless magnetized plasmas the existence of a dual real and velocityspace cascade of ionentropy fluctuations below the ion gyroradius has been proposed such a dual cascade predicted by the gyrokinetic theory has previously been observed in gyrokinetic simulations of twodimensional electrostatic turbulence for the first time we show evidence for a dual phasespace cascade of ionentropy fluctuations in a threedimensional simulation of hybridkinetic electromagnetic turbulence some of the scalings observed in the energy spectra are consistent with a generalized theory for the cascade that accounts for the spectral anisotropy of critically balanced intermittent subionlarmorscale fluctuations the observed velocityspace cascade is also anisotropic with respect to the magneticfield direction with linear phase mixing along magneticfield lines proceeding mainly at spatial scales above the ion gyroradius and nonlinear phase mixing across magneticfield lines proceeding at perpendicular scales below the ion gyroradius such phasespace anisotropy could be sought in heliospheric and magnetospheric data of solarwind turbulence and has farreaching implications for the dissipation of turbulence in weakly collisional astrophysical plasmas | [['to', 'explain', 'energy', 'dissipation', 'via', 'turbulence', 'in', 'collisionless', 'magnetized', 'plasmas', 'the', 'existence', 'of', 'a', 'dual', 'real', 'and', 'velocityspace', 'cascade', 'of', 'ionentropy', 'fluctuations', 'below', 'the', 'ion', 'gyroradius', 'has', 'been', 'proposed', 'such', 'a', 'dual', 'cascade', 'predicted', 'by', 'the', 'gyrokinetic', 'theory', 'has', 'previously', 'been', 'observed', 'in', 'gyrokinetic', 'simulations', 'of', 'twodimensional', 'electrostatic', 'turbulence', 'for', 'the', 'first', 'time', 'we', 'show', 'evidence', 'for', 'a', 'dual', 'phasespace', 'cascade', 'of', 'ionentropy', 'fluctuations', 'in', 'a', 'threedimensional', 'simulation', 'of', 'hybridkinetic', 'electromagnetic', 'turbulence', 'some', 'of', 'the', 'scalings', 'observed', 'in', 'the', 'energy', 'spectra', 'are', 'consistent', 'with', 'a', 'generalized', 'theory', 'for', 'the', 'cascade', 'that', 'accounts', 'for', 'the', 'spectral', 'anisotropy', 'of', 'critically', 'balanced', 'intermittent', 'subionlarmorscale', 'fluctuations', 'the', 'observed', 'velocityspace', 'cascade', 'is', 'also', 'anisotropic', 'with', 'respect', 'to', 'the', 'magneticfield', 'direction', 'with', 'linear', 'phase', 'mixing', 'along', 'magneticfield', 'lines', 'proceeding', 'mainly', 'at', 'spatial', 'scales', 'above', 'the', 'ion', 'gyroradius', 'and', 'nonlinear', 'phase', 'mixing', 'across', 'magneticfield', 'lines', 'proceeding', 'at', 'perpendicular', 'scales', 'below', 'the', 'ion', 'gyroradius', 'such', 'phasespace', 'anisotropy', 'could', 'be', 'sought', 'in', 'heliospheric', 'and', 'magnetospheric', 'data', 'of', 'solarwind', 'turbulence', 'and', 'has', 'farreaching', 'implications', 'for', 'the', 'dissipation', 'of', 'turbulence', 'in', 'weakly', 'collisional', 'astrophysical', 'plasmas']] | [-0.14621033031242894, 0.2701046053559808, -0.04684070450368158, 0.11459623877304928, -0.00712859851161116, -0.05898420599545216, -0.11110934061651821, 0.3316253803300056, -0.2780390630165736, -0.27252127557934386, -0.000654807244835977, -0.23466495276368848, -0.02483097247082239, 0.2200803766735116, 0.07852528037841035, 0.07097347767660067, 0.019534492842738695, -0.05700346440817529, -0.015490065243677917, -0.1011178876567436, 0.3074839263500875, 0.18970586175074508, 0.2936782484972163, 0.055834387026030066, 0.08485479875976949, -0.12175301465815837, -0.025617366969825056, 0.07867215920174331, -0.17161852327654206, -0.0009525009534425206, 0.1991629582361389, 0.008191893634941886, 0.23930374560441975, -0.45946778701237073, -0.30433569375795927, 0.020997960556145997, 0.2084170312495434, 0.10399740430858662, -0.05772178474206434, -0.2161734226481085, 0.03292293472988912, -0.1424180609010683, -0.13410723256491866, -0.030976440607738947, 0.04239698393373854, 0.06960302106600408, -0.3113385858940102, 0.14852336472651256, 0.06486543027237493, 0.09005637904247868, -0.0811704082104067, -0.05592149650754287, -0.07491302079717188, -0.005603649806672413, 0.09347271644074623, 0.032355041270367584, 0.1699079931931494, -0.12352227407088232, -0.1011964168443143, 0.3842647597193718, -0.05932514330478418, -0.14225707001635554, 0.19710492653968303, -0.22325690892900815, -0.1257720763797801, 0.2172983113338637, 0.17508151255308363, 0.04207856476045491, -0.0828044092941659, 0.0798858756577999, -0.04875258231339486, 0.1161338437711934, 0.05401044562241139, 0.037997969055864195, 0.23388850900796596, 0.17875757591924168, 0.01212025248058881, 0.0782228291094438, -0.15611178351822172, -0.09629246637181581, -0.2880326769320153, -0.11323883973759169, -0.17399504307755514, 0.03222384965265093, -0.07438155449135433, -0.16997673403340996, 0.4044634693285875, 0.20153998760833292, 0.1454971279344407, -0.029724359565601027, 0.29626053096236366, 0.1314442881222335, 0.009733365543665941, 0.1293306036454718, 0.31154435182249646, 0.23188047207025975, 0.17286828604706547, -0.2914354485413332, 0.041758979914426717, 0.06207337092651784] |
1,802.06134 | Towards commissioning the Fermilab Muon G-2 Experiment | Starting this summer, Fermilab will host a key experiment dedicated to the
search for signals of new physics: The Fermilab Muon g-2 Experiment. Its aim is
to precisely measure the anomalous magnetic moment of the muon. In full
operation, in order to avoid contamination, the newly born secondary beam is
injected into a 505 m long Delivery Ring (DR) wherein it makes several
revolutions before being sent to the experiment. Part of the commissioning
scenario will execute a running mode wherein the passage from the DR will be
skipped. With the aid of numerical simulations, we provide estimates of the
expected performance.
| physics.acc-ph physics.ins-det | starting this summer fermilab will host a key experiment dedicated to the search for signals of new physics the fermilab muon g2 experiment its aim is to precisely measure the anomalous magnetic moment of the muon in full operation in order to avoid contamination the newly born secondary beam is injected into a 505 m long delivery ring dr wherein it makes several revolutions before being sent to the experiment part of the commissioning scenario will execute a running mode wherein the passage from the dr will be skipped with the aid of numerical simulations we provide estimates of the expected performance | [['starting', 'this', 'summer', 'fermilab', 'will', 'host', 'a', 'key', 'experiment', 'dedicated', 'to', 'the', 'search', 'for', 'signals', 'of', 'new', 'physics', 'the', 'fermilab', 'muon', 'g2', 'experiment', 'its', 'aim', 'is', 'to', 'precisely', 'measure', 'the', 'anomalous', 'magnetic', 'moment', 'of', 'the', 'muon', 'in', 'full', 'operation', 'in', 'order', 'to', 'avoid', 'contamination', 'the', 'newly', 'born', 'secondary', 'beam', 'is', 'injected', 'into', 'a', '505', 'm', 'long', 'delivery', 'ring', 'dr', 'wherein', 'it', 'makes', 'several', 'revolutions', 'before', 'being', 'sent', 'to', 'the', 'experiment', 'part', 'of', 'the', 'commissioning', 'scenario', 'will', 'execute', 'a', 'running', 'mode', 'wherein', 'the', 'passage', 'from', 'the', 'dr', 'will', 'be', 'skipped', 'with', 'the', 'aid', 'of', 'numerical', 'simulations', 'we', 'provide', 'estimates', 'of', 'the', 'expected', 'performance']] | [-0.12416236675983551, 0.1456348918990104, -0.1180370050053313, 0.05531288347978547, -0.09059084343778737, -0.12285177710046079, 0.05779948137876322, 0.3150828798465869, -0.24480266134966822, -0.3297352688021812, 0.13724401297604702, -0.30727629858416083, -0.03560595306586109, 0.19416125579828433, -0.02896564186313281, 0.0519760618746445, 0.0985344336938807, 0.05078062839953311, -0.04132511453958703, -0.2713806611262079, 0.20795154755058534, 0.18877379064375133, 0.23158324506891637, 0.021569013344489185, 0.06628616139927294, -0.018927699703650148, -0.06615889792424152, -0.0761831374405244, -0.07752520309797689, 0.055336374314684494, 0.2563434965616348, 0.15052667065231384, 0.23212234086046615, -0.46087788304715765, -0.09702593373025165, 0.08611034852676276, 0.10805811351119522, 0.07237085740666326, -0.08142219153552444, -0.286827233784339, 0.08974588500774082, -0.19279427593802193, -0.16696146304956547, 0.006911598506620994, -0.0006593236900573852, -0.0013321943891545136, -0.28639417837428693, -0.04194247853079373, -0.008402004856251035, 0.04306523318347685, -0.01882701840219727, -0.1104202067625581, 0.04176678997921009, 0.13508678703938665, 0.05257621686449092, 0.08718283231571025, 0.14101074903966018, -0.08217424682145208, -0.1247100836583687, 0.3815710198718543, -0.06787203368844975, -0.09051469394562803, 0.15009962162915982, -0.2267869888969204, -0.09335610481873885, 0.1851294615999887, 0.21356769298276335, 0.07142675058646858, -0.20464405509661518, 0.007634346818496638, 0.019808807172903828, 0.1517461894831036, 0.03259573994642671, -0.024654968315849592, 0.25540057440315755, 0.22618221465781257, 0.07809013440119623, 0.11317494532490588, -0.1736192302344659, -0.04905423561257182, -0.3466852670735177, -0.1634091140391926, -0.1536797836486264, 0.04863858926475194, 0.04854456984036255, -0.04110565900291298, 0.4003155184544477, 0.14059751330619202, 0.1534420874828071, -0.023003105514719353, 0.3606053511886036, 0.05833875038661063, 0.10570389167154573, 0.016243372002945226, 0.28012457714580435, 0.11050597800296565, 0.1652396494093552, -0.25595777056992564, 0.05088528606803248, 0.05471730812945787] |
1,802.06135 | Null Conservation Laws for Gravity | We give a full analysis of the conservation along null surfaces of
generalized energy and super-momenta, for gravitational systems enclosed by a
finite boundary. In particular we interpret the conservation equations in a
canonical manner, revealing a notion of symplectic potential and a boundary
current intrinsic to null surfaces. This generalizes similar analyses done at
asymptotic infinity or on horizons.
| gr-qc hep-th | we give a full analysis of the conservation along null surfaces of generalized energy and supermomenta for gravitational systems enclosed by a finite boundary in particular we interpret the conservation equations in a canonical manner revealing a notion of symplectic potential and a boundary current intrinsic to null surfaces this generalizes similar analyses done at asymptotic infinity or on horizons | [['we', 'give', 'a', 'full', 'analysis', 'of', 'the', 'conservation', 'along', 'null', 'surfaces', 'of', 'generalized', 'energy', 'and', 'supermomenta', 'for', 'gravitational', 'systems', 'enclosed', 'by', 'a', 'finite', 'boundary', 'in', 'particular', 'we', 'interpret', 'the', 'conservation', 'equations', 'in', 'a', 'canonical', 'manner', 'revealing', 'a', 'notion', 'of', 'symplectic', 'potential', 'and', 'a', 'boundary', 'current', 'intrinsic', 'to', 'null', 'surfaces', 'this', 'generalizes', 'similar', 'analyses', 'done', 'at', 'asymptotic', 'infinity', 'or', 'on', 'horizons']] | [-0.2137870830949396, 0.0653382861521095, -0.14004416541817288, 0.11599082699782835, -0.08501120538761218, -0.12026664323639125, 0.03660591139147679, 0.27351656844839456, -0.2093257335557913, -0.25804690712442, 0.07564096976614867, -0.269084578147158, -0.10264141536705816, 0.15320669314435995, -0.10234056975071629, 0.08281825297356894, 0.0650849770521745, 0.03214605439764758, -0.16016304132839043, -0.17336492448424298, 0.3754669857521852, 0.04692795127048157, 0.27979292389936744, 0.05451123552241673, 0.14829603786444448, 0.016329421828656147, -0.038797579420982706, 0.0865285297234853, -0.17092656199820339, 0.10675114202313125, 0.19718166786866884, 0.05119160722242668, 0.20413070588062207, -0.4432643002520005, -0.2541583895140017, 0.10282876036750774, 0.15535312000817308, 0.10623323122660319, -0.02805469407273146, -0.26669218949973583, 0.0793922194277305, -0.13562707941358287, -0.237075751950033, -0.04922242673734824, -0.01016088305041194, 0.016494540590792896, -0.19333610913405816, 0.08949153490054111, 0.09236195207340643, 0.11687611335267624, -0.1386778607033193, -0.047361873804281154, -0.04666224241179104, 0.03980118784044559, 0.07048275802517309, -0.005213367706164718, 0.09026072517347833, -0.07022711536459005, -0.07498179278724516, 0.33545533462117116, -0.0658271836854207, -0.2985433562658727, 0.18452422837726773, -0.1627890146880721, -0.1299376933525006, 0.09265914134060343, 0.1532599688041955, 0.1420818587692338, -0.14536421600884447, 0.1440235200318663, -0.01108684460244452, 0.05310678044334054, 0.12107821251265705, -0.04341286967198054, 0.25493583901164435, 0.10622062184653866, 0.11601372025907039, 0.13932492680226763, -0.024373753093338262, -0.09313755681117376, -0.41180855051303905, -0.2235083545713375, -0.1375807736379405, 0.11592770285787993, -0.09622951558897815, -0.20269570397213102, 0.36585857917865117, 0.06939600745099597, 0.2093281927984208, 0.08652284002164379, 0.27530083240320286, 0.10787672987401796, 0.05466012441708396, 0.08585864854976535, 0.20024181118545434, 0.15971180146637684, 0.1120938576835518, -0.18880715034902096, -0.021296448780534168, 0.09344688787435491] |
1,802.06136 | Self-organized oscillations of Leidenfrost drops | In the Leidenfrost effect, a thin layer of evaporated vapor forms between a
liquid and a hot solid. The complex interactions between the solid, liquid, and
vapor phases can lead to rich dynamics even in a single Leidenfrost drop. Here
we investigate the self-organized oscillations of Leidenfrost drops that are
excited by a constant flow of evaporated vapor beneath the drop. We show that
for small Leidenfrost drops, the frequency of a recently reported "breathing
mode" can be explained by a simple balance of gravitational and surface tension
forces. For large Leidenfrost drops, azimuthal star-shaped oscillations are
observed. Our previous work showed how the coupling between the rapid
evaporated vapor flow and the vapor-liquid interface excites the star
oscillations (Ma \textit{et al., Phys. Rev. Fluids}, 2, 2017, 031602). In our
experiments, star-shaped oscillation modes of $n=2$ to 13 are observed in
different liquids, the number of observed modes depends sensitively on the
liquid viscosity. Here we expand on this work by directly comparing the
oscillations with theoretical predictions, and show how the oscillations are
initiated by a parametric forcing mechanism through pressure oscillations in
the vapor layer. The pressure oscillations are driven by the capillary waves of
a characteristic wavelength beneath the drop. These capillary waves can be
generated by a large shear stress at the liquid-vapor interface due to the
rapid flow of evaporated vapor. We also explore potential effects of thermal
convection in the liquid. Although the measured Rayleigh number is
significantly larger than the critical value, the frequency (wavelength) of the
oscillations depends only on the capillary length of the liquid, and is
independent of the drop radius and substrate temperature. Thus convection seems
to play a minor role in Leidenfrost drop oscillations, which are mostly
hydrodynamic in origin.
| physics.flu-dyn | in the leidenfrost effect a thin layer of evaporated vapor forms between a liquid and a hot solid the complex interactions between the solid liquid and vapor phases can lead to rich dynamics even in a single leidenfrost drop here we investigate the selforganized oscillations of leidenfrost drops that are excited by a constant flow of evaporated vapor beneath the drop we show that for small leidenfrost drops the frequency of a recently reported breathing mode can be explained by a simple balance of gravitational and surface tension forces for large leidenfrost drops azimuthal starshaped oscillations are observed our previous work showed how the coupling between the rapid evaporated vapor flow and the vaporliquid interface excites the star oscillations ma textitet al phys rev fluids 2 2017 031602 in our experiments starshaped oscillation modes of n2 to 13 are observed in different liquids the number of observed modes depends sensitively on the liquid viscosity here we expand on this work by directly comparing the oscillations with theoretical predictions and show how the oscillations are initiated by a parametric forcing mechanism through pressure oscillations in the vapor layer the pressure oscillations are driven by the capillary waves of a characteristic wavelength beneath the drop these capillary waves can be generated by a large shear stress at the liquidvapor interface due to the rapid flow of evaporated vapor we also explore potential effects of thermal convection in the liquid although the measured rayleigh number is significantly larger than the critical value the frequency wavelength of the oscillations depends only on the capillary length of the liquid and is independent of the drop radius and substrate temperature thus convection seems to play a minor role in leidenfrost drop oscillations which are mostly hydrodynamic in origin | [['in', 'the', 'leidenfrost', 'effect', 'a', 'thin', 'layer', 'of', 'evaporated', 'vapor', 'forms', 'between', 'a', 'liquid', 'and', 'a', 'hot', 'solid', 'the', 'complex', 'interactions', 'between', 'the', 'solid', 'liquid', 'and', 'vapor', 'phases', 'can', 'lead', 'to', 'rich', 'dynamics', 'even', 'in', 'a', 'single', 'leidenfrost', 'drop', 'here', 'we', 'investigate', 'the', 'selforganized', 'oscillations', 'of', 'leidenfrost', 'drops', 'that', 'are', 'excited', 'by', 'a', 'constant', 'flow', 'of', 'evaporated', 'vapor', 'beneath', 'the', 'drop', 'we', 'show', 'that', 'for', 'small', 'leidenfrost', 'drops', 'the', 'frequency', 'of', 'a', 'recently', 'reported', 'breathing', 'mode', 'can', 'be', 'explained', 'by', 'a', 'simple', 'balance', 'of', 'gravitational', 'and', 'surface', 'tension', 'forces', 'for', 'large', 'leidenfrost', 'drops', 'azimuthal', 'starshaped', 'oscillations', 'are', 'observed', 'our', 'previous', 'work', 'showed', 'how', 'the', 'coupling', 'between', 'the', 'rapid', 'evaporated', 'vapor', 'flow', 'and', 'the', 'vaporliquid', 'interface', 'excites', 'the', 'star', 'oscillations', 'ma', 'textitet', 'al', 'phys', 'rev', 'fluids', '2', '2017', '031602', 'in', 'our', 'experiments', 'starshaped', 'oscillation', 'modes', 'of', 'n2', 'to', '13', 'are', 'observed', 'in', 'different', 'liquids', 'the', 'number', 'of', 'observed', 'modes', 'depends', 'sensitively', 'on', 'the', 'liquid', 'viscosity', 'here', 'we', 'expand', 'on', 'this', 'work', 'by', 'directly', 'comparing', 'the', 'oscillations', 'with', 'theoretical', 'predictions', 'and', 'show', 'how', 'the', 'oscillations', 'are', 'initiated', 'by', 'a', 'parametric', 'forcing', 'mechanism', 'through', 'pressure', 'oscillations', 'in', 'the', 'vapor', 'layer', 'the', 'pressure', 'oscillations', 'are', 'driven', 'by', 'the', 'capillary', 'waves', 'of', 'a', 'characteristic', 'wavelength', 'beneath', 'the', 'drop', 'these', 'capillary', 'waves', 'can', 'be', 'generated', 'by', 'a', 'large', 'shear', 'stress', 'at', 'the', 'liquidvapor', 'interface', 'due', 'to', 'the', 'rapid', 'flow', 'of', 'evaporated', 'vapor', 'we', 'also', 'explore', 'potential', 'effects', 'of', 'thermal', 'convection', 'in', 'the', 'liquid', 'although', 'the', 'measured', 'rayleigh', 'number', 'is', 'significantly', 'larger', 'than', 'the', 'critical', 'value', 'the', 'frequency', 'wavelength', 'of', 'the', 'oscillations', 'depends', 'only', 'on', 'the', 'capillary', 'length', 'of', 'the', 'liquid', 'and', 'is', 'independent', 'of', 'the', 'drop', 'radius', 'and', 'substrate', 'temperature', 'thus', 'convection', 'seems', 'to', 'play', 'a', 'minor', 'role', 'in', 'leidenfrost', 'drop', 'oscillations', 'which', 'are', 'mostly', 'hydrodynamic', 'in', 'origin']] | [-0.15343013158935595, 0.2991481277842891, -0.08375810473548943, -0.02489349355064779, -0.04082541945326614, -0.10331628390760098, 0.07903222775657674, 0.29524165109335765, -0.24733626064589273, -0.29875190219561226, 0.054506520979897416, -0.2811754316295663, -0.14196998335114897, 0.19321750126035936, -0.027944043832065613, 0.017713357311711735, 0.01745430476467559, -0.0691502335248515, -0.013358712123789862, -0.17289661350325133, 0.2753838639393806, 0.06858520773048066, 0.3082192177048642, 0.11693770677721996, 0.05323146027991268, -0.10230376424063763, 0.03194429427193963, 0.05086570516968631, -0.20445830185851002, -0.018131698444262403, 0.1981426024233782, -0.045411108519981834, 0.22206922620215952, -0.5057530952362369, -0.2741585007632687, 0.043354028566383235, 0.12064666332079381, 0.13920797612350624, -0.05733029288199909, -0.2426316457475043, 0.009114544059641098, -0.1385695582227016, -0.135338506865481, -0.016159749990935144, 0.0602857551875537, 0.025924129389949646, -0.22717026074050944, 0.15057387936544167, 0.06523857894672515, 0.07350338510419434, -0.05748421950616606, -0.07978874482597186, -0.08370423172313515, 0.05034399708599005, 0.04990227349670221, 0.02559920405803172, 0.25879011851614214, -0.12199626517823374, -0.01234863382406941, 0.3638659684744597, -0.12305568981133697, -0.12938945092382834, 0.22692990571751628, -0.20252681583289117, -0.006079683780402251, 0.20705577022115357, 0.18314970816383522, 0.09951384739363439, -0.08129248694494393, -0.017659338682926618, -0.047677706732105286, 0.185819024279114, 0.16481838654726744, -0.061134706970147966, 0.2803971136805333, 0.23205790960920453, -0.003113716589573975, 0.13307958851649732, -0.1359435026593704, -0.06658672517319433, -0.24964679764226488, -0.1385266322009457, -0.15605129432214984, 0.00686471125404813, -0.052300979591850656, -0.1736663828232351, 0.37143388390541077, 0.09596846175614476, 0.19644022837547548, -0.012270491876821225, 0.2747684385314941, 0.07507135184945807, 0.04735054596317677, 0.08128282902299822, 0.3466181989172346, 0.15039180033586677, 0.13847634179621485, -0.29907606728454694, 0.09723564911289267, 0.016037097819506713] |
1,802.06137 | A Unified Framework for Planning in Adversarial and Cooperative
Environments | Users of AI systems may rely upon them to produce plans for achieving desired
objectives. Such AI systems should be able to compute obfuscated plans whose
execution in adversarial situations protects privacy, as well as legible plans
which are easy for team members to understand in cooperative situations. We
develop a unified framework that addresses these dual problems by computing
plans with a desired level of comprehensibility from the point of view of a
partially informed observer. For adversarial settings, our approach produces
obfuscated plans with observations that are consistent with at least k goals
from a set of decoy goals. By slightly varying our framework, we present an
approach for goal legibility in cooperative settings which produces plans that
achieve a goal while being consistent with at most j goals from a set of
confounding goals. In addition, we show how the observability of the observer
can be controlled to either obfuscate or clarify the next actions in a plan
when the goal is known to the observer. We present theoretical results on the
complexity analysis of our problems. We demonstrate the execution of obfuscated
and legible plans in a cooking domain using a physical robot Fetch. We also
provide an empirical evaluation to show the feasibility and usefulness of our
approaches using IPC domains.
| cs.AI | users of ai systems may rely upon them to produce plans for achieving desired objectives such ai systems should be able to compute obfuscated plans whose execution in adversarial situations protects privacy as well as legible plans which are easy for team members to understand in cooperative situations we develop a unified framework that addresses these dual problems by computing plans with a desired level of comprehensibility from the point of view of a partially informed observer for adversarial settings our approach produces obfuscated plans with observations that are consistent with at least k goals from a set of decoy goals by slightly varying our framework we present an approach for goal legibility in cooperative settings which produces plans that achieve a goal while being consistent with at most j goals from a set of confounding goals in addition we show how the observability of the observer can be controlled to either obfuscate or clarify the next actions in a plan when the goal is known to the observer we present theoretical results on the complexity analysis of our problems we demonstrate the execution of obfuscated and legible plans in a cooking domain using a physical robot fetch we also provide an empirical evaluation to show the feasibility and usefulness of our approaches using ipc domains | [['users', 'of', 'ai', 'systems', 'may', 'rely', 'upon', 'them', 'to', 'produce', 'plans', 'for', 'achieving', 'desired', 'objectives', 'such', 'ai', 'systems', 'should', 'be', 'able', 'to', 'compute', 'obfuscated', 'plans', 'whose', 'execution', 'in', 'adversarial', 'situations', 'protects', 'privacy', 'as', 'well', 'as', 'legible', 'plans', 'which', 'are', 'easy', 'for', 'team', 'members', 'to', 'understand', 'in', 'cooperative', 'situations', 'we', 'develop', 'a', 'unified', 'framework', 'that', 'addresses', 'these', 'dual', 'problems', 'by', 'computing', 'plans', 'with', 'a', 'desired', 'level', 'of', 'comprehensibility', 'from', 'the', 'point', 'of', 'view', 'of', 'a', 'partially', 'informed', 'observer', 'for', 'adversarial', 'settings', 'our', 'approach', 'produces', 'obfuscated', 'plans', 'with', 'observations', 'that', 'are', 'consistent', 'with', 'at', 'least', 'k', 'goals', 'from', 'a', 'set', 'of', 'decoy', 'goals', 'by', 'slightly', 'varying', 'our', 'framework', 'we', 'present', 'an', 'approach', 'for', 'goal', 'legibility', 'in', 'cooperative', 'settings', 'which', 'produces', 'plans', 'that', 'achieve', 'a', 'goal', 'while', 'being', 'consistent', 'with', 'at', 'most', 'j', 'goals', 'from', 'a', 'set', 'of', 'confounding', 'goals', 'in', 'addition', 'we', 'show', 'how', 'the', 'observability', 'of', 'the', 'observer', 'can', 'be', 'controlled', 'to', 'either', 'obfuscate', 'or', 'clarify', 'the', 'next', 'actions', 'in', 'a', 'plan', 'when', 'the', 'goal', 'is', 'known', 'to', 'the', 'observer', 'we', 'present', 'theoretical', 'results', 'on', 'the', 'complexity', 'analysis', 'of', 'our', 'problems', 'we', 'demonstrate', 'the', 'execution', 'of', 'obfuscated', 'and', 'legible', 'plans', 'in', 'a', 'cooking', 'domain', 'using', 'a', 'physical', 'robot', 'fetch', 'we', 'also', 'provide', 'an', 'empirical', 'evaluation', 'to', 'show', 'the', 'feasibility', 'and', 'usefulness', 'of', 'our', 'approaches', 'using', 'ipc', 'domains']] | [-0.07042454143434211, 0.03181694354875449, -0.07921467641480612, 0.053932160766972055, -0.0840333810753051, -0.14519002644940177, 0.09798471376362378, 0.42870559150146115, -0.24111877449764438, -0.35597630966178795, 0.10444896904367919, -0.2617643689370231, -0.14353791072089397, 0.21586566629358223, -0.16297060146677755, 0.06038936844669041, 0.07622291908747111, 0.024793332088140434, -0.018518625867997157, -0.2608532179157784, 0.3108370580572497, 0.06053465115406585, 0.25815018743701834, 0.00579857421150707, 0.10317372011680466, 0.0010415616274662574, -0.005811323450837302, 0.038829942779287835, -0.0737814330363512, 0.1502335980045178, 0.3466313714312424, 0.23797205805399077, 0.32095583829235425, -0.4143351731884953, -0.1458962656303171, 0.06118514157451163, 0.10704185722958452, 0.11586872502919976, -0.04823396240762021, -0.3231051522479565, 0.10818339877382473, -0.1584003767196986, -0.11889430669921071, -0.11511780044788288, -0.04626325824237601, 0.022566727431290526, -0.30921496265067683, -0.04010948384112217, 0.05386353963802793, 0.052027191121683074, -0.0669550058664754, -0.09704967336384235, 0.026972479733457375, 0.18227376377156665, 0.033511098509835496, 0.04311801703429578, 0.14586039500702302, -0.14866362213527923, -0.2161657362572711, 0.4039008592436504, -0.0041332557275718836, -0.19365614274068288, 0.199832999909025, -0.08630101412482974, -0.14130702583308988, 0.07898066776882236, 0.2133859108381094, 0.14164254323178385, -0.16725263458223102, 0.01595758156003689, -0.003632204893855723, 0.17888606410741448, 0.01732170172315953, 0.006627712303910543, 0.21994637509326115, 0.20586629132891107, 0.1242019080155943, 0.1397503147276843, -0.01284537312622652, -0.08564571707231355, -0.31288868744202236, -0.12113537463031847, -0.13572526273438362, -0.0037619898982854836, -0.04084026353653085, -0.07610589251810408, 0.36922649921918355, 0.25423619647874685, 0.16848731954383697, 0.1065820839150412, 0.3306892878695012, 0.025019206500238162, 0.057664925540814656, 0.10763371370827642, 0.20090056247621155, -0.01658849553981175, 0.08896463753168334, -0.19525077843422037, 0.12414453404037179, -0.013924799766822683] |
1,802.06138 | Detecting Social Influence in Event Cascades by Comparing Discriminative
Rankers | The global dynamics of event cascades are often governed by the local
dynamics of peer influence. However, detecting social influence from
observational data is challenging due to confounds like homophily and practical
issues like missing data. We propose a simple discriminative method to detect
influence from observational data. The core of the approach is to train a
ranking algorithm to predict the source of the next event in a cascade, and
compare its out-of-sample accuracy against a competitive baseline which lacks
access to features corresponding to social influence. We analyze synthetically
generated data to show that this method correctly identifies influence in the
presence of confounds, and is robust to both missing data and misspecification
--- unlike well-known alternatives. We apply the method to two real-world
datasets: (1) the co-sponsorship of legislation in the U.S. House of
Representatives on a social network of shared campaign donors; (2) rumors about
the Higgs boson discovery on a follower network of $10^5$ Twitter accounts. Our
model identifies the role of social influence in these scenarios and uses it to
make more accurate predictions about the future trajectory of cascades.
| cs.SI cs.LG physics.soc-ph | the global dynamics of event cascades are often governed by the local dynamics of peer influence however detecting social influence from observational data is challenging due to confounds like homophily and practical issues like missing data we propose a simple discriminative method to detect influence from observational data the core of the approach is to train a ranking algorithm to predict the source of the next event in a cascade and compare its outofsample accuracy against a competitive baseline which lacks access to features corresponding to social influence we analyze synthetically generated data to show that this method correctly identifies influence in the presence of confounds and is robust to both missing data and misspecification unlike wellknown alternatives we apply the method to two realworld datasets 1 the cosponsorship of legislation in the us house of representatives on a social network of shared campaign donors 2 rumors about the higgs boson discovery on a follower network of 105 twitter accounts our model identifies the role of social influence in these scenarios and uses it to make more accurate predictions about the future trajectory of cascades | [['the', 'global', 'dynamics', 'of', 'event', 'cascades', 'are', 'often', 'governed', 'by', 'the', 'local', 'dynamics', 'of', 'peer', 'influence', 'however', 'detecting', 'social', 'influence', 'from', 'observational', 'data', 'is', 'challenging', 'due', 'to', 'confounds', 'like', 'homophily', 'and', 'practical', 'issues', 'like', 'missing', 'data', 'we', 'propose', 'a', 'simple', 'discriminative', 'method', 'to', 'detect', 'influence', 'from', 'observational', 'data', 'the', 'core', 'of', 'the', 'approach', 'is', 'to', 'train', 'a', 'ranking', 'algorithm', 'to', 'predict', 'the', 'source', 'of', 'the', 'next', 'event', 'in', 'a', 'cascade', 'and', 'compare', 'its', 'outofsample', 'accuracy', 'against', 'a', 'competitive', 'baseline', 'which', 'lacks', 'access', 'to', 'features', 'corresponding', 'to', 'social', 'influence', 'we', 'analyze', 'synthetically', 'generated', 'data', 'to', 'show', 'that', 'this', 'method', 'correctly', 'identifies', 'influence', 'in', 'the', 'presence', 'of', 'confounds', 'and', 'is', 'robust', 'to', 'both', 'missing', 'data', 'and', 'misspecification', 'unlike', 'wellknown', 'alternatives', 'we', 'apply', 'the', 'method', 'to', 'two', 'realworld', 'datasets', '1', 'the', 'cosponsorship', 'of', 'legislation', 'in', 'the', 'us', 'house', 'of', 'representatives', 'on', 'a', 'social', 'network', 'of', 'shared', 'campaign', 'donors', '2', 'rumors', 'about', 'the', 'higgs', 'boson', 'discovery', 'on', 'a', 'follower', 'network', 'of', '105', 'twitter', 'accounts', 'our', 'model', 'identifies', 'the', 'role', 'of', 'social', 'influence', 'in', 'these', 'scenarios', 'and', 'uses', 'it', 'to', 'make', 'more', 'accurate', 'predictions', 'about', 'the', 'future', 'trajectory', 'of', 'cascades']] | [-0.07951422918767266, 0.007833145646302886, -0.07837099529916068, 0.1500271802906551, -0.1404080509182972, -0.14771734965663103, 0.07850989085697645, 0.39627991866421053, -0.25148523559391095, -0.34931602834950426, 0.08032287358482544, -0.3357590746386228, -0.17736340933416442, 0.1726429044432636, -0.06585008684495414, 0.02849387252495649, 0.1129205338933782, 0.05562116044346948, 0.023524645294339674, -0.27623765158743874, 0.3225758259914614, 0.08939432912833385, 0.3270301731624263, 0.05036437976476107, 0.09170288894942182, -0.00787985415600643, -0.09222022765819486, -0.0009583942529216811, -0.06335502571832999, 0.14100626950227732, 0.2550323720417313, 0.2075521139528703, 0.3261351941707166, -0.4036479277133539, -0.21166425588591076, 0.10729391445984711, 0.09640829704349509, 0.11656192125653458, -0.013486116680684751, -0.33568820920395287, 0.09824444628540879, -0.19707384879600157, -0.07407648912505121, -0.10363057475612575, -0.004058022756834288, -0.00464696167351527, -0.2881822353581319, 0.0859689067067528, 0.015250325674895902, 0.04540085730149184, -0.03896014727966709, -0.06680013792576721, -0.019846426545818512, 0.1743486211710685, 0.11414066724844177, -0.014279822907032998, 0.16662553843815583, -0.17412299338249942, -0.15507790671057395, 0.40519570995726295, -0.04723431700085466, -0.15685164826368359, 0.1982005733291845, -0.08251078182869163, -0.15076634848389675, 0.09642963407661867, 0.26934930151076736, 0.07720456011719196, -0.15586753303902476, -0.029771614484048473, -0.027785018570972857, 0.16550126358161907, 0.009220544918994041, -0.0035539158770965563, 0.1768401342167242, 0.24243974106235278, 0.053697044978774075, 0.11404829177300672, -0.1310595837575887, -0.10888915905930303, -0.216736229767746, -0.07906749552623935, -0.15059708053988682, 0.030257451514134535, -0.09039725203568909, -0.1525388625274236, 0.42663580890543557, 0.2616632978155001, 0.2039560738900626, 0.02798052281959335, 0.2981257234976904, -0.029102952030134965, 0.05979999743553029, 0.07287734088211044, 0.22007858637921712, 0.0375772737595882, 0.11516450833327867, -0.2006378174369299, 0.14634132368011854, -0.025883472579959276] |
1,802.06139 | Reactive Reinforcement Learning in Asynchronous Environments | The relationship between a reinforcement learning (RL) agent and an
asynchronous environment is often ignored. Frequently used models of the
interaction between an agent and its environment, such as Markov Decision
Processes (MDP) or Semi-Markov Decision Processes (SMDP), do not capture the
fact that, in an asynchronous environment, the state of the environment may
change during computation performed by the agent. In an asynchronous
environment, minimizing reaction time---the time it takes for an agent to react
to an observation---also minimizes the time in which the state of the
environment may change following observation. In many environments, the
reaction time of an agent directly impacts task performance by permitting the
environment to transition into either an undesirable terminal state or a state
where performing the chosen action is inappropriate. We propose a class of
reactive reinforcement learning algorithms that address this problem of
asynchronous environments by immediately acting after observing new state
information. We compare a reactive SARSA learning algorithm with the
conventional SARSA learning algorithm on two asynchronous robotic tasks
(emergency stopping and impact prevention), and show that the reactive RL
algorithm reduces the reaction time of the agent by approximately the duration
of the algorithm's learning update. This new class of reactive algorithms may
facilitate safer control and faster decision making without any change to
standard learning guarantees.
| cs.AI cs.LG | the relationship between a reinforcement learning rl agent and an asynchronous environment is often ignored frequently used models of the interaction between an agent and its environment such as markov decision processes mdp or semimarkov decision processes smdp do not capture the fact that in an asynchronous environment the state of the environment may change during computation performed by the agent in an asynchronous environment minimizing reaction timethe time it takes for an agent to react to an observationalso minimizes the time in which the state of the environment may change following observation in many environments the reaction time of an agent directly impacts task performance by permitting the environment to transition into either an undesirable terminal state or a state where performing the chosen action is inappropriate we propose a class of reactive reinforcement learning algorithms that address this problem of asynchronous environments by immediately acting after observing new state information we compare a reactive sarsa learning algorithm with the conventional sarsa learning algorithm on two asynchronous robotic tasks emergency stopping and impact prevention and show that the reactive rl algorithm reduces the reaction time of the agent by approximately the duration of the algorithms learning update this new class of reactive algorithms may facilitate safer control and faster decision making without any change to standard learning guarantees | [['the', 'relationship', 'between', 'a', 'reinforcement', 'learning', 'rl', 'agent', 'and', 'an', 'asynchronous', 'environment', 'is', 'often', 'ignored', 'frequently', 'used', 'models', 'of', 'the', 'interaction', 'between', 'an', 'agent', 'and', 'its', 'environment', 'such', 'as', 'markov', 'decision', 'processes', 'mdp', 'or', 'semimarkov', 'decision', 'processes', 'smdp', 'do', 'not', 'capture', 'the', 'fact', 'that', 'in', 'an', 'asynchronous', 'environment', 'the', 'state', 'of', 'the', 'environment', 'may', 'change', 'during', 'computation', 'performed', 'by', 'the', 'agent', 'in', 'an', 'asynchronous', 'environment', 'minimizing', 'reaction', 'timethe', 'time', 'it', 'takes', 'for', 'an', 'agent', 'to', 'react', 'to', 'an', 'observationalso', 'minimizes', 'the', 'time', 'in', 'which', 'the', 'state', 'of', 'the', 'environment', 'may', 'change', 'following', 'observation', 'in', 'many', 'environments', 'the', 'reaction', 'time', 'of', 'an', 'agent', 'directly', 'impacts', 'task', 'performance', 'by', 'permitting', 'the', 'environment', 'to', 'transition', 'into', 'either', 'an', 'undesirable', 'terminal', 'state', 'or', 'a', 'state', 'where', 'performing', 'the', 'chosen', 'action', 'is', 'inappropriate', 'we', 'propose', 'a', 'class', 'of', 'reactive', 'reinforcement', 'learning', 'algorithms', 'that', 'address', 'this', 'problem', 'of', 'asynchronous', 'environments', 'by', 'immediately', 'acting', 'after', 'observing', 'new', 'state', 'information', 'we', 'compare', 'a', 'reactive', 'sarsa', 'learning', 'algorithm', 'with', 'the', 'conventional', 'sarsa', 'learning', 'algorithm', 'on', 'two', 'asynchronous', 'robotic', 'tasks', 'emergency', 'stopping', 'and', 'impact', 'prevention', 'and', 'show', 'that', 'the', 'reactive', 'rl', 'algorithm', 'reduces', 'the', 'reaction', 'time', 'of', 'the', 'agent', 'by', 'approximately', 'the', 'duration', 'of', 'the', 'algorithms', 'learning', 'update', 'this', 'new', 'class', 'of', 'reactive', 'algorithms', 'may', 'facilitate', 'safer', 'control', 'and', 'faster', 'decision', 'making', 'without', 'any', 'change', 'to', 'standard', 'learning', 'guarantees']] | [-0.09208633810193106, 0.08834785844200427, -0.08138473393807269, 0.03129539701611299, -0.09265794714596635, -0.1785402733067888, 0.10845710133809015, 0.47454327660177004, -0.3192462476970064, -0.3134906010172509, 0.08787757372739938, -0.20354653342943127, -0.13407976677429803, 0.14271227802938158, -0.11460692669601936, 0.0573265270301709, 0.07377623511615013, 0.07151632392437222, -0.010448117057980816, -0.24790035608147673, 0.27618390550129884, 0.07114012783538516, 0.26613826863574497, -0.028591488420732593, 0.14784421654495009, 0.052366380415292915, 0.026555836632198425, -0.03142327591915692, -0.02649216470785878, 0.06303170172298976, 0.3170222128973773, 0.2195079188741564, 0.3768162760336738, -0.48263775243705836, -0.20227787922640597, 0.1540969153484351, 0.12579923239963794, 0.09133479373749567, -0.02192977537804736, -0.32807279532399336, 0.0103544398710781, -0.1928602538462472, -0.029140892439658558, -0.05855911789000581, -0.0028258808076791807, -0.010537997745255162, -0.307309431592622, -0.037067634101055666, 0.09525690647162531, 0.03128582953716791, -0.08723276802135733, -0.06367180989029894, 0.032712982059670014, 0.16653423337906667, 0.033649186221370045, 0.028010888580940963, 0.23536867515713727, -0.1640841608926859, -0.1981017140398195, 0.33718881995733313, -0.03619588503225305, -0.15566915919611213, 0.23272560758157335, -0.005284115753281827, -0.13876280291518622, 0.15128670022139376, 0.24641964950603049, 0.157703894181946, -0.20774600868019352, 0.03589040911494788, 0.02799971801455244, 0.17116715161155466, -0.02637468047713468, -0.04138966926604236, 0.12413645694096394, 0.22422163682741994, 0.11127514590657692, 0.11495699319954313, -0.023383314921007994, -0.17813600164409854, -0.2251413998091508, -0.16294820251615094, -0.1527038911921442, 0.01620414616320327, -0.09488126677384871, -0.13002511754807153, 0.31973594543737693, 0.19753711311298278, 0.19351863980169381, 0.09407016144127696, 0.3481204738357711, 0.1011999903685721, 0.023612256983184008, 0.1311819871581574, 0.19566195466824798, -8.030937810496794e-05, 0.13989131962624166, -0.276064454150651, 0.22558770665830566, 0.026430211122865456] |
1,802.0614 | Real-Time 3D Shape of Micro-Details | Motivated by the growing demand for interactive environments, we propose an
accurate real-time 3D shape reconstruction technique. To provide a reliable 3D
reconstruction which is still a challenging task when dealing with real-world
applications, we integrate several components including (i) Photometric Stereo
(PS), (ii) perspective Cook-Torrance reflectance model that enables PS to deal
with a broad range of possible real-world object reflections, (iii) realistic
lightening situation, (iv) a Recurrent Optimization Network (RON) and finally
(v) heuristic Dijkstra Gaussian Mean Curvature (DGMC) initialization approach.
We demonstrate the potential benefits of our hybrid model by providing 3D shape
with highly-detailed information from micro-prints for the first time. All
real-world images are taken by a mobile phone camera under a simple setup as a
consumer-level equipment. In addition, complementary synthetic experiments
confirm the beneficial properties of our novel method and its superiority over
the state-of-the-art approaches.
| cs.CV | motivated by the growing demand for interactive environments we propose an accurate realtime 3d shape reconstruction technique to provide a reliable 3d reconstruction which is still a challenging task when dealing with realworld applications we integrate several components including i photometric stereo ps ii perspective cooktorrance reflectance model that enables ps to deal with a broad range of possible realworld object reflections iii realistic lightening situation iv a recurrent optimization network ron and finally v heuristic dijkstra gaussian mean curvature dgmc initialization approach we demonstrate the potential benefits of our hybrid model by providing 3d shape with highlydetailed information from microprints for the first time all realworld images are taken by a mobile phone camera under a simple setup as a consumerlevel equipment in addition complementary synthetic experiments confirm the beneficial properties of our novel method and its superiority over the stateoftheart approaches | [['motivated', 'by', 'the', 'growing', 'demand', 'for', 'interactive', 'environments', 'we', 'propose', 'an', 'accurate', 'realtime', '3d', 'shape', 'reconstruction', 'technique', 'to', 'provide', 'a', 'reliable', '3d', 'reconstruction', 'which', 'is', 'still', 'a', 'challenging', 'task', 'when', 'dealing', 'with', 'realworld', 'applications', 'we', 'integrate', 'several', 'components', 'including', 'i', 'photometric', 'stereo', 'ps', 'ii', 'perspective', 'cooktorrance', 'reflectance', 'model', 'that', 'enables', 'ps', 'to', 'deal', 'with', 'a', 'broad', 'range', 'of', 'possible', 'realworld', 'object', 'reflections', 'iii', 'realistic', 'lightening', 'situation', 'iv', 'a', 'recurrent', 'optimization', 'network', 'ron', 'and', 'finally', 'v', 'heuristic', 'dijkstra', 'gaussian', 'mean', 'curvature', 'dgmc', 'initialization', 'approach', 'we', 'demonstrate', 'the', 'potential', 'benefits', 'of', 'our', 'hybrid', 'model', 'by', 'providing', '3d', 'shape', 'with', 'highlydetailed', 'information', 'from', 'microprints', 'for', 'the', 'first', 'time', 'all', 'realworld', 'images', 'are', 'taken', 'by', 'a', 'mobile', 'phone', 'camera', 'under', 'a', 'simple', 'setup', 'as', 'a', 'consumerlevel', 'equipment', 'in', 'addition', 'complementary', 'synthetic', 'experiments', 'confirm', 'the', 'beneficial', 'properties', 'of', 'our', 'novel', 'method', 'and', 'its', 'superiority', 'over', 'the', 'stateoftheart', 'approaches']] | [-0.059322943189346514, -0.017861414336535836, -0.05501401216676789, 0.030193892701616484, -0.10170219336960015, -0.21138679483205292, 0.020248707638581196, 0.4742796882565533, -0.24767673468706033, -0.34249796025481416, 0.07992056403589824, -0.23480730270966887, -0.19915975479851641, 0.2407063417869838, -0.1285256587104304, 0.09252882849198851, 0.15093866033984862, -0.01921959808042623, -0.07515434306222245, -0.2359461634698925, 0.24680357458935193, 0.033302100329884454, 0.3319681063872359, 0.03376666787088723, 0.11537915627399446, 0.0271431630252735, -0.03895434699556295, 0.04842212929552196, -0.0708244628835315, 0.15526565709126558, 0.24982648651307146, 0.18806588815538383, 0.2808987339099882, -0.4283753570486256, -0.26981946444039806, 0.050868309928593064, 0.11464182359120208, 0.08856284190283045, -0.10264665084223903, -0.34566008607387966, 0.09124193975952923, -0.1755380502089541, -0.07067999866269264, -0.11948060877092764, 0.010335640984270325, 0.0005905614366609577, -0.325257780783354, 0.03955652824510549, 0.00591229210634128, 0.07496235507428117, -0.06134188259334191, -0.08621680438155242, 0.043705005789875774, 0.1546747120394923, -0.020579793335249025, 0.007336432460186911, 0.11728979089687057, -0.15540909183588117, -0.13448163668182514, 0.39025112203196854, -0.03404660494081636, -0.1617577043609654, 0.2027763695000334, -0.03184259025188467, -0.11289466761964116, 0.14605239722448407, 0.20285476489134582, 0.1504206021501293, -0.16243380419994582, 0.045217233197268177, -0.03068466341875969, 0.16084507551949953, -0.004040427661190431, -0.0019357909567337087, 0.18695796079808147, 0.24539819463314685, 0.05760544245307794, 0.11707070685018198, -0.17174714618091677, -0.06416610416713507, -0.23605392761000082, -0.10934324056999543, -0.17647365018054975, 0.00908290952153451, -0.11770397015159507, -0.13224591353762868, 0.41154728806082236, 0.2312157416158085, 0.20439178242879846, 0.09838252052324593, 0.40861494041952895, 0.02810042423232465, 0.045499764442285325, 0.042117192571345344, 0.14879733067689502, 0.029548690438019574, 0.15853493500431565, -0.16682129752172442, 0.03603113084331366, -0.001580538396584861] |
1,802.06141 | A generic characterization of Pol(C) | We investigate the polynomial closure operation (C -> Pol(C)) defined on
classes of regular languages. We present an interesting and useful connection
relating the separation problem for the class C and the membership problem for
it polynomial closure Pol(C). This connection is formulated as an algebraic
characterization of Pol(C) which holds when C is an arbitrary \pvari of regular
languages and whose statement is parameterized by C-separation. Its main
application is an effective reduction from Pol(C)-membership to C-separation.
Thus, as soon as one designs a C-separation algorithm, this yields "for free" a
membership algorithm for the more complex class Pol(C).
| cs.FL | we investigate the polynomial closure operation c polc defined on classes of regular languages we present an interesting and useful connection relating the separation problem for the class c and the membership problem for it polynomial closure polc this connection is formulated as an algebraic characterization of polc which holds when c is an arbitrary pvari of regular languages and whose statement is parameterized by cseparation its main application is an effective reduction from polcmembership to cseparation thus as soon as one designs a cseparation algorithm this yields for free a membership algorithm for the more complex class polc | [['we', 'investigate', 'the', 'polynomial', 'closure', 'operation', 'c', 'polc', 'defined', 'on', 'classes', 'of', 'regular', 'languages', 'we', 'present', 'an', 'interesting', 'and', 'useful', 'connection', 'relating', 'the', 'separation', 'problem', 'for', 'the', 'class', 'c', 'and', 'the', 'membership', 'problem', 'for', 'it', 'polynomial', 'closure', 'polc', 'this', 'connection', 'is', 'formulated', 'as', 'an', 'algebraic', 'characterization', 'of', 'polc', 'which', 'holds', 'when', 'c', 'is', 'an', 'arbitrary', 'pvari', 'of', 'regular', 'languages', 'and', 'whose', 'statement', 'is', 'parameterized', 'by', 'cseparation', 'its', 'main', 'application', 'is', 'an', 'effective', 'reduction', 'from', 'polcmembership', 'to', 'cseparation', 'thus', 'as', 'soon', 'as', 'one', 'designs', 'a', 'cseparation', 'algorithm', 'this', 'yields', 'for', 'free', 'a', 'membership', 'algorithm', 'for', 'the', 'more', 'complex', 'class', 'polc']] | [-0.12593127861402967, 0.04597166216675403, -0.053483716591462956, 0.08805625336292709, -0.1007005995734758, -0.17042088375628456, 0.036103816153889655, 0.3389782778841933, -0.3478627636183783, -0.2679876839050773, 0.1300721725487371, -0.18535763050247098, -0.16149254609379418, 0.2452183249454523, -0.08176735825068557, 0.0267623949732353, 0.03586162733317343, 0.06828486802867739, -0.07807187235808556, -0.24675538237254643, 0.32978470160712287, 0.009458257768725612, 0.20161272776697176, 0.038022867360718776, 0.09528506285098103, 0.04909273948443612, 0.0154691813273605, 0.05990965766160144, -0.13432590733042238, 0.13099384639164932, 0.28421919535576684, 0.20666295053322137, 0.2386323915621669, -0.31160193908306744, -0.13054861975401716, 0.12488378890785244, 0.11728856649211387, 0.07398710550005864, -0.008599870388915753, -0.24265939419724278, 0.1079946433424412, -0.17541375333568102, -0.1462534805375737, -0.05062913855018104, 0.12248199229541513, -0.015338292206186302, -0.2804994197543134, -0.02550699585987514, 0.13395636222870136, 0.10377121286601135, -0.04716093273780587, -0.08845264360458067, 0.04191346402212824, 0.09612229790870994, -0.038098837604227755, 0.08917759817343243, 0.032700221281085816, -0.09549615048256117, -0.1268077277453597, 0.3982122803164512, -0.019574730085765886, -0.20611380207707586, 0.1913025640527305, -0.03395353020984948, -0.16033714714450473, 0.09927669287534412, 0.11077699783382956, 0.1521624442737204, -0.10779927586299516, 0.15250006643875225, -0.109573504695496, 0.12844123841100133, 0.09384992262636571, -0.00022274451618342056, 0.15734379849223823, 0.17317990075134354, 0.1336794746799644, 0.1939382391127268, 0.003696636308810299, -0.047099081624164874, -0.3229124033343546, -0.1908115806086853, -0.15552662273139223, 0.053623467472564315, -0.09532879462382234, -0.22337658892952136, 0.3781854647413357, 0.036946860382083765, 0.13582482739092455, 0.12142078253109315, 0.2343818406315194, 0.14668304386390277, 0.0352241707732901, 0.08044806394015544, 0.11167863205305695, 0.1713342672266719, 0.038052586804998595, -0.19131682412074782, 0.10638634860995658, 0.11376222362261765] |
1,802.06142 | A noncommutative 2-sphere generated by the quantum complex plane | S. L. Woronowicz's theory of introducing C*-algebras generated by unbounded
elements is applied to q-normal operators satisfying the defining relation of
the quantum complex plane. The unique non-degenerate C*-algebra of bounded
operators generated by a q-normal operator is computed and an abstract
description is given by using crossed product algebras. If the spectrum of the
modulus of the q-normal operator is the positive half line, this C*-algebra
will be considered as the algebra of continuous functions on the quantum
complex plane vanishing at infinity, and its unitization will be viewed as the
algebra of continuous functions on a quantum 2-sphere.
| math.QA math.OA | s l woronowiczs theory of introducing calgebras generated by unbounded elements is applied to qnormal operators satisfying the defining relation of the quantum complex plane the unique nondegenerate calgebra of bounded operators generated by a qnormal operator is computed and an abstract description is given by using crossed product algebras if the spectrum of the modulus of the qnormal operator is the positive half line this calgebra will be considered as the algebra of continuous functions on the quantum complex plane vanishing at infinity and its unitization will be viewed as the algebra of continuous functions on a quantum 2sphere | [['s', 'l', 'woronowiczs', 'theory', 'of', 'introducing', 'calgebras', 'generated', 'by', 'unbounded', 'elements', 'is', 'applied', 'to', 'qnormal', 'operators', 'satisfying', 'the', 'defining', 'relation', 'of', 'the', 'quantum', 'complex', 'plane', 'the', 'unique', 'nondegenerate', 'calgebra', 'of', 'bounded', 'operators', 'generated', 'by', 'a', 'qnormal', 'operator', 'is', 'computed', 'and', 'an', 'abstract', 'description', 'is', 'given', 'by', 'using', 'crossed', 'product', 'algebras', 'if', 'the', 'spectrum', 'of', 'the', 'modulus', 'of', 'the', 'qnormal', 'operator', 'is', 'the', 'positive', 'half', 'line', 'this', 'calgebra', 'will', 'be', 'considered', 'as', 'the', 'algebra', 'of', 'continuous', 'functions', 'on', 'the', 'quantum', 'complex', 'plane', 'vanishing', 'at', 'infinity', 'and', 'its', 'unitization', 'will', 'be', 'viewed', 'as', 'the', 'algebra', 'of', 'continuous', 'functions', 'on', 'a', 'quantum', '2sphere']] | [-0.16124661668669432, 0.16852288623005734, -0.056341504673473534, 0.05452382376301102, -0.09037982916925102, -0.1247590957628563, -0.023178057469194754, 0.3314209932461381, -0.3637661958113313, -0.14101443435065447, 0.1251872779702535, -0.2846151176467538, -0.10238521037623287, 0.18846190866548568, -0.09047111206687987, 0.018475317572592756, 0.05264818119816482, 0.1255973193794489, -0.12805656994692982, -0.2033077233005315, 0.4326468602614477, 0.00043841327424161137, 0.18317960787331686, 0.0486396250128746, 0.11344739069521893, 0.03309040986932814, -0.01801554957870394, 0.02207208691863343, -0.11411301601212472, 0.11708684911951422, 0.2697567928396165, 0.1258419876685366, 0.22306533303111792, -0.37721564490348103, -0.12966424921294675, 0.1897817744500935, 0.11513841774314643, -0.05252545725554228, 0.00011143089039251209, -0.31075051533058284, 0.08975667712744326, -0.20096427700016647, -0.1710415655793622, -0.05827648617676459, 0.05333736746571958, -0.025915458519011735, -0.25805478538852183, 0.012344074682332576, 0.10805924952030183, 0.11655722490511834, -0.0642360289406497, -0.05622170599643141, -0.11706951987463982, 0.09917470974382013, -0.09233190328814089, 0.07376970194163732, 0.14773140894249082, -0.04811548698460683, -0.1458744724513963, 0.35920344153419137, -0.047094425670802596, -0.2616297468543053, 0.09088374986313283, -0.19845543865812942, -0.08424314273521304, 0.09180157855153084, 0.0628147695865482, 0.14450627310201525, -0.04387430197559297, 0.2343028069718275, -0.10869062166661024, 0.07048862014664337, 0.06382725820876659, 0.023293927423655988, 0.1441583284456283, 0.04284639381221496, 0.10808083448093385, 0.16150842658476905, 0.10087784465868026, -0.06624523690436035, -0.36668212961405516, -0.1535238749277778, -0.20637090822216123, 0.1526810231152922, -0.09975998622336192, -0.2052057478018105, 0.39922385251149534, 0.03480359305860475, 0.2141148594673723, 0.03927921073511243, 0.2324913396500051, 0.22224564348114653, 0.10796089246403426, 0.021108943531289698, 0.13305239978712052, 0.25520758466096594, 0.046451182747259734, -0.14803297899430617, -0.0021472483314573763, 0.19811881219546193] |
1,802.06143 | On the Tur\'an density of $\{1, 3\}$-Hypergraphs | In this paper, we consider the Tur\'an problems on $\{1,3\}$-hypergraphs. We
prove that a $\{1, 3\}$-hypergraph is degenerate if and only if it's $H^{\{1,
3\}}_5$-colorable, where $H^{\{1, 3\}}_5$ is a hypergraph with vertex set
$V=[5]$ and edge set $E=\{\{2\}, \{3\}, \{1, 2, 4\}, \{1, 3, 5\}, \{1, 4,
5\}\}.$ Using this result, we further prove that for any finite set $R$ of
distinct positive integers, except the case $R=\{1, 2\}$, there always exist
non-trivial degenerate $R$-graphs. We also compute the Tur\'an densities of
some small $\{1,3\}$-hypergraphs.
| math.CO | in this paper we consider the turan problems on 13hypergraphs we prove that a 1 3hypergraph is degenerate if and only if its h1 3_5colorable where h1 3_5 is a hypergraph with vertex set v5 and edge set e2 3 1 2 4 1 3 5 1 4 5 using this result we further prove that for any finite set r of distinct positive integers except the case r1 2 there always exist nontrivial degenerate rgraphs we also compute the turan densities of some small 13hypergraphs | [['in', 'this', 'paper', 'we', 'consider', 'the', 'turan', 'problems', 'on', '13hypergraphs', 'we', 'prove', 'that', 'a', '1', '3hypergraph', 'is', 'degenerate', 'if', 'and', 'only', 'if', 'its', 'h1', '3_5colorable', 'where', 'h1', '3_5', 'is', 'a', 'hypergraph', 'with', 'vertex', 'set', 'v5', 'and', 'edge', 'set', 'e2', '3', '1', '2', '4', '1', '3', '5', '1', '4', '5', 'using', 'this', 'result', 'we', 'further', 'prove', 'that', 'for', 'any', 'finite', 'set', 'r', 'of', 'distinct', 'positive', 'integers', 'except', 'the', 'case', 'r1', '2', 'there', 'always', 'exist', 'nontrivial', 'degenerate', 'rgraphs', 'we', 'also', 'compute', 'the', 'turan', 'densities', 'of', 'some', 'small', '13hypergraphs']] | [-0.15957407787351346, 0.14818539636255038, 0.0203250891574454, 0.07156780212208992, 0.011436606967458275, -0.2014643814380667, 0.01005408178770733, 0.3290722021696771, -0.23592679302503422, -0.2715076355763325, 0.13985759572824463, -0.34744155152541834, -0.13816907089885053, 0.1061082940673592, -0.0406138723767249, -0.03041045033875512, 0.059883020483184515, 0.09337072707031195, -0.04282532789085696, -0.31609528207663085, 0.360126282020313, -0.16414574027152323, 0.09600198967382312, 0.11503010288607783, 0.07413596126091916, -0.013534179417325593, 0.037907616556167784, 0.04804904285318604, -0.23074538715090745, 0.09533845637811393, 0.2529449689332623, 0.16268842409523884, 0.2943499710058748, -0.36022767827777963, -0.11969754036243369, 0.22173703650989365, 0.15332035072113773, 0.043867877474418136, -0.026392884416187683, -0.14915497231626565, 0.25250409156646264, -0.17637281969371366, -0.13722025778530755, 0.00787645078650335, 0.12569501798418237, 0.004873371160611874, -0.29996877251386006, 0.037643566749998504, 0.11852818073295965, 0.052682565974153966, -0.01738506436444501, -0.20672974527086607, -0.006339231349823133, 0.060593067588875206, -0.04688810566355043, 0.08955776963309135, 0.006452514540131499, -0.07575734651920091, -0.09344470489588452, 0.3293043939146872, -0.020936341604172456, -0.1918989295912225, 0.1358164176969539, -0.23966022115484698, -0.21915266559481983, 0.11088114481691907, 0.05244409565518542, 0.1532368276540826, -0.005522564950785259, 0.1504626919887392, -0.12198357148913712, 0.18667835658189, 0.14943694753754067, -0.027480452202215063, 0.06463173762100136, 0.08507722813249906, 0.20178160864700814, 0.07479843825510726, -0.06844400978226942, 0.06838339300281028, -0.3847484673123534, -0.11936736816722082, -0.21226830858873522, 0.13951035946459941, -0.1447321321391472, -0.12740965916707023, 0.3722993141812522, 0.09651738162175184, 0.20647436064077404, 0.10603203669917292, 0.19859270876409804, 0.11394732692701282, -0.026466056562551275, 0.18267581141951336, 0.1474719866616907, 0.10430879919312713, -0.01904665505536264, -0.09565445645527755, -0.0678060509991355, 0.07832120664463174] |
1,802.06144 | Function algebras on a 2-dimensional quantum complex plane | The well-behaved representations of the coordinate algebra of a 2-dimensional
quantum complex plane are classified and a C*-algebra is defined which can be
viewed as the algebra of continuous functions on the 2-dimensional quantum
complex plane vanishing at infinity.
| math.QA | the wellbehaved representations of the coordinate algebra of a 2dimensional quantum complex plane are classified and a calgebra is defined which can be viewed as the algebra of continuous functions on the 2dimensional quantum complex plane vanishing at infinity | [['the', 'wellbehaved', 'representations', 'of', 'the', 'coordinate', 'algebra', 'of', 'a', '2dimensional', 'quantum', 'complex', 'plane', 'are', 'classified', 'and', 'a', 'calgebra', 'is', 'defined', 'which', 'can', 'be', 'viewed', 'as', 'the', 'algebra', 'of', 'continuous', 'functions', 'on', 'the', '2dimensional', 'quantum', 'complex', 'plane', 'vanishing', 'at', 'infinity']] | [-0.1878663715070639, 0.13670957900392702, -0.07889822392891614, 0.05274206076641209, -0.11723053751465602, -0.12439930856896517, -0.0795289402326139, 0.32155375770078254, -0.35897012016712093, -0.15876087971413747, 0.1388569243538838, -0.22788300986091295, -0.13290005072187155, 0.20840418486832044, -0.07429600117775874, 0.017678727968954124, 0.0017025250559433913, 0.12545343580393073, -0.1473436215892434, -0.20536240715629014, 0.3715007822865095, -0.018285201366943043, 0.23125065343741041, -0.03193518994614864, 0.1502207929152064, 0.04606110874850016, 0.01910606383656462, 0.05994026611248652, -0.07633994301207937, 0.07326212852524641, 0.32827252445694727, 0.08850002095389825, 0.1700161973384615, -0.37416092167871123, -0.1797667161728709, 0.15081744817778087, 0.17915145633742213, 0.01812248916711467, 0.020442293894190628, -0.31503343257384425, 0.0682445824241791, -0.1634932705320609, -0.1670684987344803, -0.06205246731256827, -0.0036573181143746926, 0.0052852037434394546, -0.20306686407480484, -0.00040439778986649634, 0.08343202016579035, 0.14381648413836956, -0.05529535402997564, -0.042140210357805095, -0.13229068788962486, 0.13659705735074404, -0.11860116674469258, 0.13310854581113046, 0.16978553717191786, -0.05749363674280735, -0.16274794699767461, 0.41063085444367087, 0.013792848453307763, -0.32491376810969835, 0.18127464371709487, -0.1730682019574138, -0.11587148414065059, 0.10280415759636806, 0.14208294909733993, 0.17123145304429224, -0.02189852103877526, 0.22721265170287389, -0.11158363621395367, 0.03363860708673318, 0.05923693198471879, 0.017528341605495185, 0.2276918012648821, 0.06031342075230219, 0.06570864187028164, 0.1680931661200399, 0.05062711246622106, -0.13601328456440034, -0.352332673393763, -0.19828513708825296, -0.1881446007352609, 0.17741064318957236, -0.12207728303119672, -0.2286252010231599, 0.4106225131604916, -0.013868613496948129, 0.26690969238869655, 0.052342403754711345, 0.23066072528943038, 0.20542668049426702, 0.12382815071405509, 0.014645623986442119, 0.13647469417311442, 0.1907417631875246, 0.006409190177248838, -0.1100206108739934, -0.036535376408256784, 0.15963634523825768] |
1,802.06145 | Selmer groups are intersection of two direct summands of the adelic
cohomology | We give a positive answer to a Conjecture by Manjul Bhargava, Daniel M. Kane,
Hendrik W. Lenstra Jr., Bjorn Poonen and Eric Rains, concerning the cohomology
of torsion subgroups of elliptic curves over global fields. This implies that,
given a global field $k$ and an integer $n$, for $100\%$ of elliptic curves $E$
defined over $k$, the $n$-th Selmer group of $E$ is the intersection of two
direct summands of the adelic cohomology group $H^1(\mathbf{A},E[n])$. We also
give examples of elliptic curves for which the conclusion of this conjecture
does not hold.
| math.NT | we give a positive answer to a conjecture by manjul bhargava daniel m kane hendrik w lenstra jr bjorn poonen and eric rains concerning the cohomology of torsion subgroups of elliptic curves over global fields this implies that given a global field k and an integer n for 100 of elliptic curves e defined over k the nth selmer group of e is the intersection of two direct summands of the adelic cohomology group h1mathbfaen we also give examples of elliptic curves for which the conclusion of this conjecture does not hold | [['we', 'give', 'a', 'positive', 'answer', 'to', 'a', 'conjecture', 'by', 'manjul', 'bhargava', 'daniel', 'm', 'kane', 'hendrik', 'w', 'lenstra', 'jr', 'bjorn', 'poonen', 'and', 'eric', 'rains', 'concerning', 'the', 'cohomology', 'of', 'torsion', 'subgroups', 'of', 'elliptic', 'curves', 'over', 'global', 'fields', 'this', 'implies', 'that', 'given', 'a', 'global', 'field', 'k', 'and', 'an', 'integer', 'n', 'for', '100', 'of', 'elliptic', 'curves', 'e', 'defined', 'over', 'k', 'the', 'nth', 'selmer', 'group', 'of', 'e', 'is', 'the', 'intersection', 'of', 'two', 'direct', 'summands', 'of', 'the', 'adelic', 'cohomology', 'group', 'h1mathbfaen', 'we', 'also', 'give', 'examples', 'of', 'elliptic', 'curves', 'for', 'which', 'the', 'conclusion', 'of', 'this', 'conjecture', 'does', 'not', 'hold']] | [-0.2774427482355539, 0.062031705895915966, -0.15844744852242562, 0.056093217220392774, -0.10293794805081663, -0.162236348290897, 0.023710303100665193, 0.24656756644925246, -0.2856116512135326, -0.29014029041710465, 0.038256789434824016, -0.2526303771525048, -0.09136496307481858, 0.2386870513757138, -0.17155981221451208, -0.010207607383983066, 0.024497637340983192, 0.06530865917882912, -0.04384516039095655, -0.40786225540092685, 0.34897501535642034, -0.020538057272250835, 0.1464370344330526, 0.09389456478715107, 0.07383005286229181, 0.06524814291253359, -0.04216482236490145, -0.055281280048682796, -0.18471414990159285, 0.1419985202591416, 0.3040960069622967, 0.06313874619593332, 0.19104903607352913, -0.3282262205420021, -0.13598175092528647, 0.21757680204297816, 0.09247062567130222, -0.033911820947561046, -0.009849503574954285, -0.24008774317309753, 0.1293818356551148, -0.16221631422720767, -0.16785823807099853, -0.03861184041834549, 0.13269258571077383, 0.023571476056931315, -0.2598648706993477, 0.00644967337055797, 0.1372341021990076, 0.1834978543856478, -0.06002537076678741, -0.15827297946376787, -0.028494207733464273, 0.020055820881440253, 0.029313843656762022, 0.06497153907804494, 0.027681212384697652, -0.06628939627598111, -0.17130958327798398, 0.33754372890273643, -0.09576046250883367, -0.1162081592010109, 0.048201876602284, -0.17764155274502688, -0.14214579982089473, 0.1361255032358343, 0.06460032506671907, 0.17669361907026762, 0.017828889262790863, 0.20819412481300736, -0.21563895739637992, 0.0495922543098229, 0.129438916057512, -0.09681850317149208, 0.10442250688652416, -0.029450740660080216, 0.06458832359882993, 0.07354047186135386, 0.050541612246728776, 0.0413887576036319, -0.34669565268188385, -0.2611241307375686, -0.1390715975027818, 0.20690797443599518, -0.0676071003090928, -0.1396515810872418, 0.39888768308734585, 0.04781426578391712, 0.18084164729321395, 0.12198886728799482, 0.15480465443477362, 0.04064474966131396, 0.005175617661654621, 0.09261005399953369, 0.11313625854941514, 0.26282243494323076, 0.005468366726475594, -0.15815723522126182, -0.0383294369656961, 0.21631929554700197] |
1,802.06146 | Representations of quantum SU(2) operators on a local chart | Hilbert space representations of quantum SU(2) by multiplication operators on
a local chart are constructed, where the local chart is given by tensor
products of square integrable functions on a quantum disc and on the classical
unit circle. The actions of generators of quantum SU(2), generators of the
opposite algebra, and noncommutative partial derivatives are computed on a
Hilbert space basis.
| math.QA | hilbert space representations of quantum su2 by multiplication operators on a local chart are constructed where the local chart is given by tensor products of square integrable functions on a quantum disc and on the classical unit circle the actions of generators of quantum su2 generators of the opposite algebra and noncommutative partial derivatives are computed on a hilbert space basis | [['hilbert', 'space', 'representations', 'of', 'quantum', 'su2', 'by', 'multiplication', 'operators', 'on', 'a', 'local', 'chart', 'are', 'constructed', 'where', 'the', 'local', 'chart', 'is', 'given', 'by', 'tensor', 'products', 'of', 'square', 'integrable', 'functions', 'on', 'a', 'quantum', 'disc', 'and', 'on', 'the', 'classical', 'unit', 'circle', 'the', 'actions', 'of', 'generators', 'of', 'quantum', 'su2', 'generators', 'of', 'the', 'opposite', 'algebra', 'and', 'noncommutative', 'partial', 'derivatives', 'are', 'computed', 'on', 'a', 'hilbert', 'space', 'basis']] | [-0.14363675515671245, 0.15982560271427768, -0.040466192773863915, 0.07230659914164819, -0.06577348819414734, -0.06787935642098061, -0.03298495260265763, 0.3624964681316595, -0.2847105489402521, -0.14219569127823486, 0.16480775750967383, -0.2714810751215841, -0.13031074728389255, 0.19852775967389832, -0.0623877842902954, 0.06464804312000509, 0.025545602007845385, 0.13179070203274976, -0.1972486566691125, -0.30876552591436224, 0.41402460008737496, -0.0018892152765460435, 0.2210693559151326, -0.06663212068302587, 0.20317814938846182, 0.059427758434512576, -0.05982591050722804, -0.071919619198316, -0.09556861027892007, 0.159404749798848, 0.22556911683717712, 0.06616660757142989, 0.19642010819334843, -0.44779297272812146, -0.13837148820156933, 0.11448781528189535, 0.09947519784518441, -0.0002599441003604013, 0.006598575025430468, -0.33114787227031395, 0.010250663277922107, -0.18180657499546155, -0.07297480043756668, -0.1345614870918579, 0.0185407843883531, -0.012230680144743109, -0.24206588050869646, 0.003196395994698415, 0.031642831327607396, 0.12691405465918, -0.07111093963755936, -0.06812980691673326, -0.08558489677694733, 0.08648167328420477, -0.0711010019867452, 0.07156289952089552, 0.1762611048876262, -0.0900943326901217, -0.18980365440432653, 0.3623306665905431, -0.013060648893158822, -0.30278974589052016, 0.07519220400479484, -0.19204618429123868, -0.0960566224835691, 0.041320273255715606, 0.13524900790548228, 0.12372176794976485, -0.04002627261654764, 0.2697196985713252, -0.10767901470487723, 0.07496899573445381, 0.047709872915607986, 0.06856192192291749, 0.16074980233536393, 0.0021425074607622427, 0.09415199730514748, 0.11014862309713833, 0.044297544911625936, -0.23682294807351026, -0.39853494104425435, -0.2027347382448125, -0.21514980070155543, 0.12572008333184193, -0.1463751874875552, -0.20342548322848608, 0.4460545772014827, -0.01391083418609208, 0.20185189614870172, 0.026179616415842634, 0.22664105748666113, 0.1477752199365956, 0.12412598683330857, 0.039819586037307, 0.10820928735078358, 0.19630438742059908, -0.02342215751404645, -0.18857156360220378, -0.05455581562166087, 0.26487341512483165] |
1,802.06147 | Doubling inequality and nodal sets for solutions of bi-Laplace equations | We investigate the doubling inequality and nodal sets for the solutions of
bi-Laplace equations. A polynomial upper bound for the nodal sets of solutions
and their gradient is obtained based on the recent development of nodal sets
for Laplace eigenfunctions by Logunov. In addition, we derive an implicit upper
bound for the nodal sets of solutions. We show two types of doubling
inequalities for the solutions of bi-Laplace equations. As a consequence, the
rate of vanishing is given for the solutions.
| math.AP | we investigate the doubling inequality and nodal sets for the solutions of bilaplace equations a polynomial upper bound for the nodal sets of solutions and their gradient is obtained based on the recent development of nodal sets for laplace eigenfunctions by logunov in addition we derive an implicit upper bound for the nodal sets of solutions we show two types of doubling inequalities for the solutions of bilaplace equations as a consequence the rate of vanishing is given for the solutions | [['we', 'investigate', 'the', 'doubling', 'inequality', 'and', 'nodal', 'sets', 'for', 'the', 'solutions', 'of', 'bilaplace', 'equations', 'a', 'polynomial', 'upper', 'bound', 'for', 'the', 'nodal', 'sets', 'of', 'solutions', 'and', 'their', 'gradient', 'is', 'obtained', 'based', 'on', 'the', 'recent', 'development', 'of', 'nodal', 'sets', 'for', 'laplace', 'eigenfunctions', 'by', 'logunov', 'in', 'addition', 'we', 'derive', 'an', 'implicit', 'upper', 'bound', 'for', 'the', 'nodal', 'sets', 'of', 'solutions', 'we', 'show', 'two', 'types', 'of', 'doubling', 'inequalities', 'for', 'the', 'solutions', 'of', 'bilaplace', 'equations', 'as', 'a', 'consequence', 'the', 'rate', 'of', 'vanishing', 'is', 'given', 'for', 'the', 'solutions']] | [-0.21068406014208807, 0.027864583073949935, -0.04794629203316606, 0.1049318744795236, -0.04914661103652583, -0.08504176687127278, 0.0956702160384552, 0.22798965057864048, -0.24605697070041466, -0.2479912263088296, 0.17128367134352662, -0.3220394270517576, -0.10210566334483892, 0.27459536200492746, -0.04137026919856852, 0.10646708268258306, 0.03883205967046964, 0.04850646382036768, -0.09753001265423257, -0.24519535669206102, 0.41210739907843097, -0.06398055799029491, 0.2708199525102513, 0.08996759007259468, 0.10062164503989028, -0.07086511603614062, 0.006599192197124164, -0.010272983783557092, -0.22355168075933132, 0.19920969174967873, 0.1908021468301246, 0.1380414925918075, 0.23937960373766629, -0.4113476598796285, -0.15924937570076667, 0.12023590858105893, 0.17474648781856636, 0.10457451487488953, -0.04713004864436103, -0.27538786531874426, 0.0862169038090441, -0.0847775738824297, -0.2070542088261357, -0.09753566324986794, 0.033462890067402225, 0.1120805416578128, -0.29030866065510996, 0.08630039660191094, 0.0859393862961435, 0.06077507418295783, -0.17391686511145513, -0.11980748082292669, -0.0014838085130408959, 0.04412237381746555, 0.05166842993118881, -0.033907591790696724, -0.03795455361250788, -0.09291508006805807, -0.1497483793416141, 0.3019598887106519, -0.11589125953442245, -0.2735968708854031, 0.14674550119247057, -0.12306065933870865, -0.1167880661762607, 0.07295327011587811, 0.16325359042291243, 0.16650834649709273, -0.1192461765244787, 0.13864594484524181, -0.09472923368836443, 0.0970798294853281, 0.12683395688410526, 0.03952785205371954, 0.11361378012799922, 0.11356766765684258, 0.18854335266061956, 0.15485148763077128, -0.056403496115824875, -0.09130193458663093, -0.33880842486281454, -0.17484497342885322, -0.19038298831861697, 0.05496208728463561, -0.15177621105994835, -0.22749096303775815, 0.37472020534591544, 0.048503934106801025, 0.2053250709755553, 0.09239197479859915, 0.21387590075854535, 0.2158819401829308, 0.015169673596428316, 0.11173990202699731, 0.20919901022204646, 0.13966447619985742, 0.05512428691288755, -0.20544037954122932, 0.06417397934696234, 0.19163911319395274] |
1,802.06148 | Multi-user Beam-Alignment for Millimeter-Wave Networks | Millimeter-wave communications is the most promising technology for
next-generation cellular wireless systems, thanks to the large bandwidth
available compared to sub-6 GHz networks. Nevertheless, communication at these
frequencies requires narrow beams via massive MIMO and beamforming to overcome
the strong signal attenuation, and thus precise beam-alignment between
transmitter and receiver is needed. The resulting signaling overhead may become
a severe impairment, especially in mobile networks with high users density.
Therefore, it is imperative to optimize the beam-alignment protocol to minimize
the signaling overhead. In this paper, the design of energy efficient joint
beam-alignment protocols for two users is addressed, with the goal to minimize
the power consumption during data transmission, subject to rate constraints for
both users, under analog beamforming constraints. It is proved that a bisection
search algorithm is optimal. Additionally, the optimal scheduling strategy of
the two users in the data communication phase is optimized based on the outcome
of beam-alignment, according to a time division multiplexing scheme. The
numerical results show significant decrease in the power consumption for the
proposed joint beam-alignment scheme compared to exhaustive search and a
single-user beam-alignment scheme taking place separately for each user.
| eess.SP | millimeterwave communications is the most promising technology for nextgeneration cellular wireless systems thanks to the large bandwidth available compared to sub6 ghz networks nevertheless communication at these frequencies requires narrow beams via massive mimo and beamforming to overcome the strong signal attenuation and thus precise beamalignment between transmitter and receiver is needed the resulting signaling overhead may become a severe impairment especially in mobile networks with high users density therefore it is imperative to optimize the beamalignment protocol to minimize the signaling overhead in this paper the design of energy efficient joint beamalignment protocols for two users is addressed with the goal to minimize the power consumption during data transmission subject to rate constraints for both users under analog beamforming constraints it is proved that a bisection search algorithm is optimal additionally the optimal scheduling strategy of the two users in the data communication phase is optimized based on the outcome of beamalignment according to a time division multiplexing scheme the numerical results show significant decrease in the power consumption for the proposed joint beamalignment scheme compared to exhaustive search and a singleuser beamalignment scheme taking place separately for each user | [['millimeterwave', 'communications', 'is', 'the', 'most', 'promising', 'technology', 'for', 'nextgeneration', 'cellular', 'wireless', 'systems', 'thanks', 'to', 'the', 'large', 'bandwidth', 'available', 'compared', 'to', 'sub6', 'ghz', 'networks', 'nevertheless', 'communication', 'at', 'these', 'frequencies', 'requires', 'narrow', 'beams', 'via', 'massive', 'mimo', 'and', 'beamforming', 'to', 'overcome', 'the', 'strong', 'signal', 'attenuation', 'and', 'thus', 'precise', 'beamalignment', 'between', 'transmitter', 'and', 'receiver', 'is', 'needed', 'the', 'resulting', 'signaling', 'overhead', 'may', 'become', 'a', 'severe', 'impairment', 'especially', 'in', 'mobile', 'networks', 'with', 'high', 'users', 'density', 'therefore', 'it', 'is', 'imperative', 'to', 'optimize', 'the', 'beamalignment', 'protocol', 'to', 'minimize', 'the', 'signaling', 'overhead', 'in', 'this', 'paper', 'the', 'design', 'of', 'energy', 'efficient', 'joint', 'beamalignment', 'protocols', 'for', 'two', 'users', 'is', 'addressed', 'with', 'the', 'goal', 'to', 'minimize', 'the', 'power', 'consumption', 'during', 'data', 'transmission', 'subject', 'to', 'rate', 'constraints', 'for', 'both', 'users', 'under', 'analog', 'beamforming', 'constraints', 'it', 'is', 'proved', 'that', 'a', 'bisection', 'search', 'algorithm', 'is', 'optimal', 'additionally', 'the', 'optimal', 'scheduling', 'strategy', 'of', 'the', 'two', 'users', 'in', 'the', 'data', 'communication', 'phase', 'is', 'optimized', 'based', 'on', 'the', 'outcome', 'of', 'beamalignment', 'according', 'to', 'a', 'time', 'division', 'multiplexing', 'scheme', 'the', 'numerical', 'results', 'show', 'significant', 'decrease', 'in', 'the', 'power', 'consumption', 'for', 'the', 'proposed', 'joint', 'beamalignment', 'scheme', 'compared', 'to', 'exhaustive', 'search', 'and', 'a', 'singleuser', 'beamalignment', 'scheme', 'taking', 'place', 'separately', 'for', 'each', 'user']] | [-0.23645985957371626, 0.015572345268264101, -0.02324894414385732, 0.033870050949056714, -0.10259275964500275, -0.26095273126774904, 0.14112929037360095, 0.4142204119533749, -0.2471469986985111, -0.3019470441598855, 0.10235353053610831, -0.2234695053928171, -0.15179491089169345, 0.18445873252940193, -0.11311389174292849, 0.10048817619084044, 0.06295415439706355, 0.007824058756622345, 0.0025699676041301164, -0.26439105561710113, 0.22860742819919713, 0.18733910918942803, 0.41374967614900693, 0.030497457094293048, 0.08026590188404457, 0.007768886374719246, -0.055955141318318344, -0.08223644096843309, -0.08300607151819511, 0.09191225891255077, 0.3666222820444586, 0.19419103209904506, 0.30273798424555526, -0.4262396228153512, -0.23619639126983769, 0.13266819858367687, 0.14466173539220975, 0.07173917038580745, -0.04901884162630301, -0.2393959656172476, 0.13859510658728202, -0.2016742182590789, -0.009436419033914737, 0.01319849830003777, -0.05004811411508949, 0.030983081641357088, -0.3619373916204609, 0.002900497557861116, -0.051616925353681696, -0.0027243193867982057, -0.05089660034836782, -0.08732963004759, 0.029998131444999528, 0.1471138348210486, 0.01938309159412668, 0.0040770819092520475, 0.09088000823397444, -0.08843856398655242, -0.10860856203849949, 0.3940193608259363, 0.025543204764713636, -0.20322290352540803, 0.16168926585909388, -0.06075781083504879, -0.10934390766419354, 0.1911781058492534, 0.2572772476227262, 0.02992652237893165, -0.18689400771040351, -0.005239157797281109, 0.06225907723041475, 0.208156704488186, 0.07122594195281531, 0.13316512619588933, 0.15214821128711026, 0.218599082074367, 0.1768908011324762, 0.10201028626319508, -0.1081182754958775, -0.10663052632093079, -0.19251794820768436, -0.13046724981438193, -0.22266795310186935, -0.007402805462772153, -0.07831035177826794, -0.014862872591286078, 0.34137482485319537, 0.14431027929769116, 0.10792806015120751, 0.12213443405072921, 0.4363343927190098, 0.10975119043677967, 0.10173198511745996, 0.11852325960574428, 0.21234131636614886, 0.08545408411078272, 0.18229982895406052, -0.2531786449229179, 0.0492549955830251, -0.056711439120081] |
1,802.06149 | Search for narrow resonances in the b-tagged dijet mass spectrum in
proton-proton collisions at $\sqrt{s} =$ 8 TeV | A search for narrow resonances decaying to bottom quark-antiquark pairs is
presented, using a data sample of proton-proton collisions at $\sqrt{s} =$ 8
TeV corresponding to an integrated luminosity of 19.7 fb$^{-1}$. The search is
extended to masses lower than those reached in typical searches for resonances
decaying into jet pairs at the LHC, by taking advantage of triggers that
identify jets originating from bottom quarks. No significant excess of events
is observed above the background predictions. Limits are set on the product of
cross section and branching fraction to bottom quarks for spin 0, 1, and 2
resonances in the mass range of 325-1200 GeV. These results significantly
improve on the limits for resonances decaying into jet pairs in the 325-500 GeV
mass range.
| hep-ex | a search for narrow resonances decaying to bottom quarkantiquark pairs is presented using a data sample of protonproton collisions at sqrts 8 tev corresponding to an integrated luminosity of 197 fb1 the search is extended to masses lower than those reached in typical searches for resonances decaying into jet pairs at the lhc by taking advantage of triggers that identify jets originating from bottom quarks no significant excess of events is observed above the background predictions limits are set on the product of cross section and branching fraction to bottom quarks for spin 0 1 and 2 resonances in the mass range of 3251200 gev these results significantly improve on the limits for resonances decaying into jet pairs in the 325500 gev mass range | [['a', 'search', 'for', 'narrow', 'resonances', 'decaying', 'to', 'bottom', 'quarkantiquark', 'pairs', 'is', 'presented', 'using', 'a', 'data', 'sample', 'of', 'protonproton', 'collisions', 'at', 'sqrts', '8', 'tev', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '197', 'fb1', 'the', 'search', 'is', 'extended', 'to', 'masses', 'lower', 'than', 'those', 'reached', 'in', 'typical', 'searches', 'for', 'resonances', 'decaying', 'into', 'jet', 'pairs', 'at', 'the', 'lhc', 'by', 'taking', 'advantage', 'of', 'triggers', 'that', 'identify', 'jets', 'originating', 'from', 'bottom', 'quarks', 'no', 'significant', 'excess', 'of', 'events', 'is', 'observed', 'above', 'the', 'background', 'predictions', 'limits', 'are', 'set', 'on', 'the', 'product', 'of', 'cross', 'section', 'and', 'branching', 'fraction', 'to', 'bottom', 'quarks', 'for', 'spin', '0', '1', 'and', '2', 'resonances', 'in', 'the', 'mass', 'range', 'of', '3251200', 'gev', 'these', 'results', 'significantly', 'improve', 'on', 'the', 'limits', 'for', 'resonances', 'decaying', 'into', 'jet', 'pairs', 'in', 'the', '325500', 'gev', 'mass', 'range']] | [-0.03727642501576529, 0.22350547084459352, -0.03882963594324032, 0.17708782466094117, -0.038110341430168414, -0.07772696527392893, 0.03698321831885908, 0.3575884755319137, -0.16388603180769037, -0.3725621160119772, -0.015549215055872366, -0.3886207062751055, 0.164303430879, 0.207247585764338, 0.1147494234495842, 0.05973378270788149, 0.157702514031505, -0.0018634491019928064, -0.027330029574528215, -0.19425002940487665, 0.2921278867069021, 0.03088445639520212, 0.18752353965136848, 0.13002202390372508, 0.04101912587304737, 0.0033668534883649136, -0.014120618415782686, -0.11899208185858413, -0.1064832932566847, 0.046416074898500435, 0.20962689565609163, 0.05468582040553943, 0.14073124556975405, -0.3122020203189721, -0.08045264709832482, 0.14871723401802975, 0.20862325579004332, 0.02373259228684741, -0.061372001806167184, -0.35927441331832743, 0.19073466934859143, -0.19274666555012104, -0.11763896738163761, 0.035505359994293356, 0.06024955704686095, -0.08342211327103317, -0.32457438592615795, 0.10102780006413699, -0.0056781353215213685, 0.03365002850215638, -0.03226758764300984, -0.2201645814538857, -0.10788418037137475, -0.024739198543161887, 0.0828954668135428, 0.0503122712088058, 0.21374294310273817, -0.16960924496389884, -0.20466356115324086, 0.32958586468193374, -0.062052289190626754, -0.11679919264813671, 0.2409514648664254, -0.19491600802885828, -0.09036384311649705, 0.2600880360581958, 0.3377294727662181, 0.04209240047131344, -0.19403405655289954, 0.04910656148243359, -0.003001969529041013, 0.18710806710095923, 0.09329996765858387, 0.06552344569688297, 0.23459332566861002, 0.2249938975103566, 0.006172986495018494, 0.07042977918649367, -0.14692611748841208, -0.05258557227913473, -0.4087291313182624, -0.07691820627593694, -0.09114614207312831, 0.04351861840953714, -0.0518004916239526, -0.04576151814601827, 0.3768979936196912, 0.08238480238579825, 0.3496091782695568, 0.036126273254802846, 0.26755454806901025, 0.12790240249493956, 0.11398273861020437, 0.10424941319582953, 0.3507154439041605, 0.15083318907714097, 0.13862509067364984, -0.1536704335365536, -0.04476699492985719, 0.026991731471946983] |
1,802.0615 | Robust s+/- pairing in CaK[Fe(1-x)Ni(x)]4As4$ (x = 0 and 0.05) from the
response to electron irradiation | Controlled point-like disorder introduced by 2.5 MeV electron irradiation was
used to probe the superconducting state of single crystals of \CaKx\
superconductor at $x = 0$ and 0.05 doping levels. Both compositions show an
increase of the residual resistivity and a decrease of the superconducting
transition temperature, $T_c$ at the rate of $dT_c/d\rho(T_c) \approx$ 0.19
K(\textmu$\Omega$cm)$^{-1}$ for $x=0$ and 0.38 K(\textmu$\Omega$cm)$^{-1}$ for
$x=\:$0.05, respectively. In Ni - doped, $x = 0.05$, compound the coexisting
spin-vortex crystal (SVC) magnetic phase is suppressed at the rate of
$dT_N/d\rho(T_N)\approx$ 0.16 K(\textmu$\Omega$cm)$^{-1}$. Low - temperature
variation of London penetration depth is well approximated by the power law,
$\Delta \lambda (T) = AT^n$ with $n\approx\,$2.5 for $x=0$ and $n\approx\,$1.9
for $x=0.05$ in the pristine state. Electron irradiation leads to the exponent
$n$ increase above 2 in $x=0.05$ suggesting superconducting gap with
significant anisotropy that is smeared by the disorder scattering. Detailed
analysis of $\lambda (T)$ and \(T_{c}\) evolution with disorder is consistent
with two effective nodeless superconducting energy gaps due to robust s$_{\pm}$
pairing. Overall the behavior of \CaKx\ at $x = 0$ is similar to a slightly
overdoped \BaK\ at $y \approx$ 0.5 and at $x= 0.05$ to an underdoped
composition at $y \approx$ 0.2.
| cond-mat.supr-con | controlled pointlike disorder introduced by 25 mev electron irradiation was used to probe the superconducting state of single crystals of cakx superconductor at x 0 and 005 doping levels both compositions show an increase of the residual resistivity and a decrease of the superconducting transition temperature t_c at the rate of dt_cdrhot_c approx 019 ktextmuomegacm1 for x0 and 038 ktextmuomegacm1 for x005 respectively in ni doped x 005 compound the coexisting spinvortex crystal svc magnetic phase is suppressed at the rate of dt_ndrhot_napprox 016 ktextmuomegacm1 low temperature variation of london penetration depth is well approximated by the power law delta lambda t atn with napprox25 for x0 and napprox19 for x005 in the pristine state electron irradiation leads to the exponent n increase above 2 in x005 suggesting superconducting gap with significant anisotropy that is smeared by the disorder scattering detailed analysis of lambda t and t_c evolution with disorder is consistent with two effective nodeless superconducting energy gaps due to robust s_pm pairing overall the behavior of cakx at x 0 is similar to a slightly overdoped bak at y approx 05 and at x 005 to an underdoped composition at y approx 02 | [['controlled', 'pointlike', 'disorder', 'introduced', 'by', '25', 'mev', 'electron', 'irradiation', 'was', 'used', 'to', 'probe', 'the', 'superconducting', 'state', 'of', 'single', 'crystals', 'of', 'cakx', 'superconductor', 'at', 'x', '0', 'and', '005', 'doping', 'levels', 'both', 'compositions', 'show', 'an', 'increase', 'of', 'the', 'residual', 'resistivity', 'and', 'a', 'decrease', 'of', 'the', 'superconducting', 'transition', 'temperature', 't_c', 'at', 'the', 'rate', 'of', 'dt_cdrhot_c', 'approx', '019', 'ktextmuomegacm1', 'for', 'x0', 'and', '038', 'ktextmuomegacm1', 'for', 'x005', 'respectively', 'in', 'ni', 'doped', 'x', '005', 'compound', 'the', 'coexisting', 'spinvortex', 'crystal', 'svc', 'magnetic', 'phase', 'is', 'suppressed', 'at', 'the', 'rate', 'of', 'dt_ndrhot_napprox', '016', 'ktextmuomegacm1', 'low', 'temperature', 'variation', 'of', 'london', 'penetration', 'depth', 'is', 'well', 'approximated', 'by', 'the', 'power', 'law', 'delta', 'lambda', 't', 'atn', 'with', 'napprox25', 'for', 'x0', 'and', 'napprox19', 'for', 'x005', 'in', 'the', 'pristine', 'state', 'electron', 'irradiation', 'leads', 'to', 'the', 'exponent', 'n', 'increase', 'above', '2', 'in', 'x005', 'suggesting', 'superconducting', 'gap', 'with', 'significant', 'anisotropy', 'that', 'is', 'smeared', 'by', 'the', 'disorder', 'scattering', 'detailed', 'analysis', 'of', 'lambda', 't', 'and', 't_c', 'evolution', 'with', 'disorder', 'is', 'consistent', 'with', 'two', 'effective', 'nodeless', 'superconducting', 'energy', 'gaps', 'due', 'to', 'robust', 's_pm', 'pairing', 'overall', 'the', 'behavior', 'of', 'cakx', 'at', 'x', '0', 'is', 'similar', 'to', 'a', 'slightly', 'overdoped', 'bak', 'at', 'y', 'approx', '05', 'and', 'at', 'x', '005', 'to', 'an', 'underdoped', 'composition', 'at', 'y', 'approx', '02']] | [-0.15027816409353542, 0.26674999916761566, 0.001478168324976371, -0.002437557128908497, 0.036239939224542855, -0.19830264034804213, 0.15393787189374467, 0.36419631995595797, -0.24934128171237058, -0.3211301539645151, -0.038947452807665935, -0.4209969391474727, 0.0441556127887298, 0.13744810098417537, 0.021864054113547637, -0.0009287503996381054, -0.11109037497992474, -0.011643323007596549, -0.1738330185420752, -0.21830026541526118, 0.2681148206450479, 0.05322376912534878, 0.32978941308994775, 0.08915103292437615, 0.027067527061614093, -0.0320743016563553, 0.15939046851379018, 0.0030313894945990156, -0.1902838996847523, -0.0435881752529423, 0.2882076956075493, -0.13538755985622408, 0.1849771854590881, -0.32290691405869826, -0.20092692297129405, 0.013807058754431271, 0.1402641749452977, 0.009789753813671056, -0.02938196384446528, -0.24604509672317557, 0.12788074509679245, -0.11590751916941294, -0.15038572347146414, -0.030646732695420426, 0.03565014371027549, -0.04920290294349706, -0.30143220312326713, 0.185160791727304, 0.054243072136255996, 0.13109168648552247, -0.10097843099745217, -0.19772642285799577, -0.09277270585865216, -0.023290568047385447, 0.0564807109219372, 0.17643113495478968, 0.1456313204394762, -0.08535609681839271, 0.011067099378951801, 0.28907853831837654, -0.0695830590865284, -0.004545371209474671, 0.08051441493567335, -0.22468871380098993, -0.07316536501680733, 0.2543403485188724, 0.0710939522780276, 0.061433842051695726, -0.08635363635661268, 0.09184027686619653, 0.04485822986705455, 0.27007666802792635, 0.06395512346237425, 0.06396241393679428, 0.2222324838660406, 0.23153444351480593, 0.028188347306457303, 0.07899094664949984, -0.16300710720051986, 0.03838317122719394, -0.21605900852699522, -0.1309440799966632, -0.16534069795457143, 0.1129525308700515, -0.14255592782772886, -0.1332938984136846, 0.31418062488070475, 0.11943068432069763, 0.21988616088188437, -0.027247122479060654, 0.15544556787794347, 0.11866226479554026, 0.023214050279141814, 0.05627356656881236, 0.1978926858455115, 0.1641057865415754, 0.15369590359035307, -0.3036271859589895, 0.09612012048444105, -0.040320044388950226] |
1,802.06151 | Scalable Inference for Space-Time Gaussian Cox Processes | The log-Gaussian Cox process is a flexible and popular class of point pattern
models for capturing spatial and space-time dependence for point patterns.
Model fitting requires approximation of stochastic integrals which is
implemented through discretization over the domain of interest. With fine scale
discretization, inference based on Markov chain Monte Carlo is computationally
burdensome because of the cost of matrix decompositions and storage, such as
the Cholesky, for high dimensional covariance matrices associated with latent
Gaussian variables. This article addresses these computational bottlenecks by
combining two recent developments: (i) a data augmentation strategy that has
been proposed for space-time Gaussian Cox processes that is based on exact
Bayesian inference and does not require fine grid approximations for infinite
dimensional integrals, and (ii) a recently developed family of
sparsity-inducing Gaussian processes, called nearest-neighbor Gaussian
processes, to avoid expensive matrix computations. Our inference is delivered
within the fully model-based Bayesian paradigm and does not sacrifice the
richness of traditional log-Gaussian Cox processes. We apply our method to
crime event data in San Francisco and investigate the recovery of the intensity
surface.
| stat.CO | the loggaussian cox process is a flexible and popular class of point pattern models for capturing spatial and spacetime dependence for point patterns model fitting requires approximation of stochastic integrals which is implemented through discretization over the domain of interest with fine scale discretization inference based on markov chain monte carlo is computationally burdensome because of the cost of matrix decompositions and storage such as the cholesky for high dimensional covariance matrices associated with latent gaussian variables this article addresses these computational bottlenecks by combining two recent developments i a data augmentation strategy that has been proposed for spacetime gaussian cox processes that is based on exact bayesian inference and does not require fine grid approximations for infinite dimensional integrals and ii a recently developed family of sparsityinducing gaussian processes called nearestneighbor gaussian processes to avoid expensive matrix computations our inference is delivered within the fully modelbased bayesian paradigm and does not sacrifice the richness of traditional loggaussian cox processes we apply our method to crime event data in san francisco and investigate the recovery of the intensity surface | [['the', 'loggaussian', 'cox', 'process', 'is', 'a', 'flexible', 'and', 'popular', 'class', 'of', 'point', 'pattern', 'models', 'for', 'capturing', 'spatial', 'and', 'spacetime', 'dependence', 'for', 'point', 'patterns', 'model', 'fitting', 'requires', 'approximation', 'of', 'stochastic', 'integrals', 'which', 'is', 'implemented', 'through', 'discretization', 'over', 'the', 'domain', 'of', 'interest', 'with', 'fine', 'scale', 'discretization', 'inference', 'based', 'on', 'markov', 'chain', 'monte', 'carlo', 'is', 'computationally', 'burdensome', 'because', 'of', 'the', 'cost', 'of', 'matrix', 'decompositions', 'and', 'storage', 'such', 'as', 'the', 'cholesky', 'for', 'high', 'dimensional', 'covariance', 'matrices', 'associated', 'with', 'latent', 'gaussian', 'variables', 'this', 'article', 'addresses', 'these', 'computational', 'bottlenecks', 'by', 'combining', 'two', 'recent', 'developments', 'i', 'a', 'data', 'augmentation', 'strategy', 'that', 'has', 'been', 'proposed', 'for', 'spacetime', 'gaussian', 'cox', 'processes', 'that', 'is', 'based', 'on', 'exact', 'bayesian', 'inference', 'and', 'does', 'not', 'require', 'fine', 'grid', 'approximations', 'for', 'infinite', 'dimensional', 'integrals', 'and', 'ii', 'a', 'recently', 'developed', 'family', 'of', 'sparsityinducing', 'gaussian', 'processes', 'called', 'nearestneighbor', 'gaussian', 'processes', 'to', 'avoid', 'expensive', 'matrix', 'computations', 'our', 'inference', 'is', 'delivered', 'within', 'the', 'fully', 'modelbased', 'bayesian', 'paradigm', 'and', 'does', 'not', 'sacrifice', 'the', 'richness', 'of', 'traditional', 'loggaussian', 'cox', 'processes', 'we', 'apply', 'our', 'method', 'to', 'crime', 'event', 'data', 'in', 'san', 'francisco', 'and', 'investigate', 'the', 'recovery', 'of', 'the', 'intensity', 'surface']] | [-0.027863423860314505, 0.03302362720435225, -0.07630619878072438, 0.09201355721167942, -0.12078991885603972, -0.1670076037333061, 0.04446168366413793, 0.4259856525976367, -0.28302779530504113, -0.2614119794042833, 0.14716116357503678, -0.22515219867010938, -0.15428385224359828, 0.14702949126061785, -0.09612285316396275, 0.11625890640766938, 0.08734633037352196, -0.052210594782366435, -0.06999721118120877, -0.25219090920014503, 0.30227548422294476, 0.1188454794536173, 0.33158038290186304, -0.01937435728181726, 0.17605691996413445, 0.05659293472850123, -0.10985728578548358, -0.016546986107428312, -0.08661953503093305, 0.13679861865792028, 0.2798590284531623, 0.15886346705702742, 0.3128309916475965, -0.44100472431983695, -0.2736818935545213, 0.1328761627596501, 0.1623089791913894, 0.08477091350558204, -0.0025191566869148248, -0.25328682996228585, 0.034429890158268826, -0.179465875346942, -0.08711928862222476, -0.14381844304923447, -0.022952080277632403, 0.018831008087906092, -0.34681402227461505, 0.08938604422751294, 0.056885390741459235, 0.07905554217052277, 0.038633040860087176, -0.14195114933214456, 0.02173362786272884, 0.04179966678926149, 0.025095125611970012, -0.030369450668570216, 0.12554712678102892, -0.0827295428253977, -0.15310024046052934, 0.32405198835631227, -0.035480845173106755, -0.2515336376401549, 0.18773243968848494, -0.08861791793589985, -0.18190512316322277, 0.16169912672950235, 0.1934741261075693, 0.11744393733448437, -0.18129149357565189, 0.15285993482970878, 0.012711573467595117, 0.1380371946152742, 0.01811523257244857, -0.03915963672600978, 0.12815596349537373, 0.2134200532129815, 0.06089617980789789, 0.07319424897640445, -0.13811117401847345, -0.18878281171571504, -0.2669651658799728, -0.1269494602268083, -0.22084307523350644, 0.008877450440439276, -0.14342098310662957, -0.2326880021738773, 0.35960308270393637, 0.17817150355514266, 0.17696649027473227, 0.0894159498324035, 0.3004062389746808, 0.09352165739528065, 0.058324797194081686, 0.08967837994637269, 0.07813600379214024, 0.11575038364162284, 0.07059328992624751, -0.16259317532670814, 0.12580976505209718, 0.08651043468951014] |
1,802.06152 | Plasma diagnostics of coronal dimming events | Coronal mass ejections (CMEs) are often associated with coronal dimmings,
i.e. transient dark regions that are most distinctly observed in Extreme
Ultra-violet (EUV) wavelengths. Using Atmospheric Imaging Assembly (AIA) data,
we apply Differential Emission Measure (DEM) diagnostics to study the plasma
characteristics of six coronal dimming events. In the core dimming region, we
find a steep and impulsive decrease of density with values up to 50-70%. Five
of the events also reveal an associated drop in temperature of 5-25%. The
secondary dimming regions also show a distinct decrease in density, but less
strong, decreasing by 10-45%. In both the core and the secondary dimming the
density changes are much larger than the temperature changes, confirming that
the dimming regions are mainly caused by plasma evacuation. In the core
dimming, the plasma density reduces rapidly within the first 20-30 min after
the flare start, and does not recover for at least 10 hrs later, whereas the
secondary dimming tends to be more gradual and starts to replenish after 1-2
hrs. The pre-event temperatures are higher in the core dimming (1.7-2.6 MK)
than in the secondary dimming regions (1.6-2.0 MK). Both core and secondary
dimmings are best observed in the AIA 211 \AA\ and 193 \AA\ filters. These
findings suggest that the core dimming corresponds to the footpoints of the
erupting flux rope rooted in the AR, while the secondary dimming represents
plasma from overlying coronal structures that expand during the CME eruption.
| astro-ph.SR | coronal mass ejections cmes are often associated with coronal dimmings ie transient dark regions that are most distinctly observed in extreme ultraviolet euv wavelengths using atmospheric imaging assembly aia data we apply differential emission measure dem diagnostics to study the plasma characteristics of six coronal dimming events in the core dimming region we find a steep and impulsive decrease of density with values up to 5070 five of the events also reveal an associated drop in temperature of 525 the secondary dimming regions also show a distinct decrease in density but less strong decreasing by 1045 in both the core and the secondary dimming the density changes are much larger than the temperature changes confirming that the dimming regions are mainly caused by plasma evacuation in the core dimming the plasma density reduces rapidly within the first 2030 min after the flare start and does not recover for at least 10 hrs later whereas the secondary dimming tends to be more gradual and starts to replenish after 12 hrs the preevent temperatures are higher in the core dimming 1726 mk than in the secondary dimming regions 1620 mk both core and secondary dimmings are best observed in the aia 211 aa and 193 aa filters these findings suggest that the core dimming corresponds to the footpoints of the erupting flux rope rooted in the ar while the secondary dimming represents plasma from overlying coronal structures that expand during the cme eruption | [['coronal', 'mass', 'ejections', 'cmes', 'are', 'often', 'associated', 'with', 'coronal', 'dimmings', 'ie', 'transient', 'dark', 'regions', 'that', 'are', 'most', 'distinctly', 'observed', 'in', 'extreme', 'ultraviolet', 'euv', 'wavelengths', 'using', 'atmospheric', 'imaging', 'assembly', 'aia', 'data', 'we', 'apply', 'differential', 'emission', 'measure', 'dem', 'diagnostics', 'to', 'study', 'the', 'plasma', 'characteristics', 'of', 'six', 'coronal', 'dimming', 'events', 'in', 'the', 'core', 'dimming', 'region', 'we', 'find', 'a', 'steep', 'and', 'impulsive', 'decrease', 'of', 'density', 'with', 'values', 'up', 'to', '5070', 'five', 'of', 'the', 'events', 'also', 'reveal', 'an', 'associated', 'drop', 'in', 'temperature', 'of', '525', 'the', 'secondary', 'dimming', 'regions', 'also', 'show', 'a', 'distinct', 'decrease', 'in', 'density', 'but', 'less', 'strong', 'decreasing', 'by', '1045', 'in', 'both', 'the', 'core', 'and', 'the', 'secondary', 'dimming', 'the', 'density', 'changes', 'are', 'much', 'larger', 'than', 'the', 'temperature', 'changes', 'confirming', 'that', 'the', 'dimming', 'regions', 'are', 'mainly', 'caused', 'by', 'plasma', 'evacuation', 'in', 'the', 'core', 'dimming', 'the', 'plasma', 'density', 'reduces', 'rapidly', 'within', 'the', 'first', '2030', 'min', 'after', 'the', 'flare', 'start', 'and', 'does', 'not', 'recover', 'for', 'at', 'least', '10', 'hrs', 'later', 'whereas', 'the', 'secondary', 'dimming', 'tends', 'to', 'be', 'more', 'gradual', 'and', 'starts', 'to', 'replenish', 'after', '12', 'hrs', 'the', 'preevent', 'temperatures', 'are', 'higher', 'in', 'the', 'core', 'dimming', '1726', 'mk', 'than', 'in', 'the', 'secondary', 'dimming', 'regions', '1620', 'mk', 'both', 'core', 'and', 'secondary', 'dimmings', 'are', 'best', 'observed', 'in', 'the', 'aia', '211', 'aa', 'and', '193', 'aa', 'filters', 'these', 'findings', 'suggest', 'that', 'the', 'core', 'dimming', 'corresponds', 'to', 'the', 'footpoints', 'of', 'the', 'erupting', 'flux', 'rope', 'rooted', 'in', 'the', 'ar', 'while', 'the', 'secondary', 'dimming', 'represents', 'plasma', 'from', 'overlying', 'coronal', 'structures', 'that', 'expand', 'during', 'the', 'cme', 'eruption']] | [-0.06510327183651154, 0.2515960176987018, 0.0024970797667303027, 0.14866282979482437, -0.03851299992756709, -0.07547675204826558, 0.0063103709709965835, 0.4391479829627696, -0.15966213690706324, -0.3898685776939639, 0.08838178770021532, -0.29409863196962605, -0.08584648605215815, 0.1713679712664247, -0.07015555484123293, -0.04368499936182119, 0.0987618021180088, -0.03836083982774555, -0.07687685553721613, -0.20087985275080789, 0.24906225104843308, 0.1392038409864816, 0.1874175050809856, 0.006731330728181541, 0.017922273626902692, -0.1188789255481813, -0.08051249867351533, 0.008919638771896108, -0.10295588555550145, -0.02532624975031607, 0.18512810949869918, 0.11821386517659294, 0.2410217552181117, -0.41319362929535747, -0.284608652336036, -0.02509318798088712, 0.20646375625614555, -0.04675130835718367, 0.03408588417505032, -0.22741128988583337, 0.08299615205225971, -0.12457776302085316, -0.09711609969951243, 0.13861907067871942, 0.05308998158902965, -0.026258430299754894, -0.2578499313275797, 0.13441980338565565, 0.0002327591979767957, 0.09100601718571671, -0.1309589268774938, -0.052782064390704965, -0.09525987228448213, 0.08112334915851262, 0.07105509035677661, 0.08882924965466855, 0.22574103651065922, -0.10263741990219014, -0.040500365041149976, 0.3265160848830993, -0.052953554857044026, 0.078886772846007, 0.20380022895765873, -0.2602536579622033, -0.12382991309181103, 0.31889009533287704, 0.12506272970153892, 0.049556612817732874, -0.11665121605619788, -0.08748078730133173, 0.02452575121387932, 0.1733297063810635, 0.13666732164768355, 0.008488845399192523, 0.29012153126276197, 0.09183183043356598, 0.05856196691390297, 0.1316137720571823, -0.25403461901758917, -0.055022069318722396, -0.28182309196249455, -0.09952900881388252, -0.026855271602343165, 0.009025048473291969, -0.11314162226184658, -0.1969064187192787, 0.38329671602889404, 0.15697043094227547, 0.26329715461161035, -0.03773202555431865, 0.2638996564029596, 0.10452275496764549, 0.09327400101327503, 0.1909171196516638, 0.2935163391197556, 0.1846434301377904, 0.22456237606905186, -0.24729400407957663, 0.06130891998541924, 0.027460542425834015] |
1,802.06153 | A Likelihood-Free Inference Framework for Population Genetic Data using
Exchangeable Neural Networks | An explosion of high-throughput DNA sequencing in the past decade has led to
a surge of interest in population-scale inference with whole-genome data.
Recent work in population genetics has centered on designing inference methods
for relatively simple model classes, and few scalable general-purpose inference
techniques exist for more realistic, complex models. To achieve this, two
inferential challenges need to be addressed: (1) population data are
exchangeable, calling for methods that efficiently exploit the symmetries of
the data, and (2) computing likelihoods is intractable as it requires
integrating over a set of correlated, extremely high-dimensional latent
variables. These challenges are traditionally tackled by likelihood-free
methods that use scientific simulators to generate datasets and reduce them to
hand-designed, permutation-invariant summary statistics, often leading to
inaccurate inference. In this work, we develop an exchangeable neural network
that performs summary statistic-free, likelihood-free inference. Our framework
can be applied in a black-box fashion across a variety of simulation-based
tasks, both within and outside biology. We demonstrate the power of our
approach on the recombination hotspot testing problem, outperforming the
state-of-the-art.
| cs.LG q-bio.PE stat.ML | an explosion of highthroughput dna sequencing in the past decade has led to a surge of interest in populationscale inference with wholegenome data recent work in population genetics has centered on designing inference methods for relatively simple model classes and few scalable generalpurpose inference techniques exist for more realistic complex models to achieve this two inferential challenges need to be addressed 1 population data are exchangeable calling for methods that efficiently exploit the symmetries of the data and 2 computing likelihoods is intractable as it requires integrating over a set of correlated extremely highdimensional latent variables these challenges are traditionally tackled by likelihoodfree methods that use scientific simulators to generate datasets and reduce them to handdesigned permutationinvariant summary statistics often leading to inaccurate inference in this work we develop an exchangeable neural network that performs summary statisticfree likelihoodfree inference our framework can be applied in a blackbox fashion across a variety of simulationbased tasks both within and outside biology we demonstrate the power of our approach on the recombination hotspot testing problem outperforming the stateoftheart | [['an', 'explosion', 'of', 'highthroughput', 'dna', 'sequencing', 'in', 'the', 'past', 'decade', 'has', 'led', 'to', 'a', 'surge', 'of', 'interest', 'in', 'populationscale', 'inference', 'with', 'wholegenome', 'data', 'recent', 'work', 'in', 'population', 'genetics', 'has', 'centered', 'on', 'designing', 'inference', 'methods', 'for', 'relatively', 'simple', 'model', 'classes', 'and', 'few', 'scalable', 'generalpurpose', 'inference', 'techniques', 'exist', 'for', 'more', 'realistic', 'complex', 'models', 'to', 'achieve', 'this', 'two', 'inferential', 'challenges', 'need', 'to', 'be', 'addressed', '1', 'population', 'data', 'are', 'exchangeable', 'calling', 'for', 'methods', 'that', 'efficiently', 'exploit', 'the', 'symmetries', 'of', 'the', 'data', 'and', '2', 'computing', 'likelihoods', 'is', 'intractable', 'as', 'it', 'requires', 'integrating', 'over', 'a', 'set', 'of', 'correlated', 'extremely', 'highdimensional', 'latent', 'variables', 'these', 'challenges', 'are', 'traditionally', 'tackled', 'by', 'likelihoodfree', 'methods', 'that', 'use', 'scientific', 'simulators', 'to', 'generate', 'datasets', 'and', 'reduce', 'them', 'to', 'handdesigned', 'permutationinvariant', 'summary', 'statistics', 'often', 'leading', 'to', 'inaccurate', 'inference', 'in', 'this', 'work', 'we', 'develop', 'an', 'exchangeable', 'neural', 'network', 'that', 'performs', 'summary', 'statisticfree', 'likelihoodfree', 'inference', 'our', 'framework', 'can', 'be', 'applied', 'in', 'a', 'blackbox', 'fashion', 'across', 'a', 'variety', 'of', 'simulationbased', 'tasks', 'both', 'within', 'and', 'outside', 'biology', 'we', 'demonstrate', 'the', 'power', 'of', 'our', 'approach', 'on', 'the', 'recombination', 'hotspot', 'testing', 'problem', 'outperforming', 'the', 'stateoftheart']] | [-0.020090745501728707, 0.0006372529637649249, -0.05084586513881711, 0.10964331917140911, -0.11618579329719403, -0.17946082192483817, 0.042419150927981854, 0.44731241031068153, -0.26879308220727005, -0.35204024392985683, 0.09707860079200553, -0.23389708103301624, -0.1510194939498966, 0.2528477937087481, -0.1259650074028485, 0.11026807150792801, 0.15017066120127237, -0.04524029775030226, -0.04328110353384253, -0.29336317297306724, 0.25067383851508085, 0.049033161263441906, 0.329669379083247, -0.03707749908522371, 0.09066765816503736, -0.03173063350901618, -0.04883108273999573, 0.012581247548658359, -0.07942332637334214, 0.22188720340109913, 0.37419756400846255, 0.24762034354913423, 0.38830301984502325, -0.45495820044400703, -0.26636321038735666, 0.12812431233041202, 0.1818704864186845, 0.15613801558005247, -0.05000504007572696, -0.2748543292407118, 0.04317723118014976, -0.19773902858061523, -0.011883272279265347, -0.1813099043518733, -0.004390026581869729, -0.0035236297986850186, -0.28624780092859403, 0.06607791065805774, 0.02739600920460947, 0.08513349631062612, 0.03822856831455325, -0.13798635087950134, 0.057807696599076905, 0.1251005227212532, 0.05617372994645681, 0.043946183666629696, 0.13579835757698822, -0.14575946745670124, -0.1839444076042922, 0.3315394813323329, -0.01042484661702056, -0.2014580313705079, 0.20189540191813127, -0.04121788007597942, -0.2436707764328725, 0.11749625236502495, 0.22988505319735014, 0.1257994510979397, -0.20118876743590694, 0.07498622408170429, -0.0032999393819221133, 0.14826977883242123, 0.008988839958194944, -0.03682710070580501, 0.21922830990569173, 0.2556275742653029, 0.03661286556857756, 0.07998337218572718, -0.11822860807213188, -0.12539235585243388, -0.18459710105329494, -0.08723215711431513, -0.21013684497996307, 0.013057334205381915, -0.07965707703160346, -0.19140562826189503, 0.37025365410586714, 0.2547724872356516, 0.17587925898628418, 0.09891801696901621, 0.31685793834729065, 0.0356806273420439, 0.0914380774758328, 0.079654991945209, 0.13491154132255664, 0.06431368569811356, 0.08437343792997878, -0.12171480431517147, 0.1137283150174912, -0.042058386746258745] |
1,802.06154 | InP femtosecond mode-locked laser in a compound feedback cavity with a
switchable repetition rate | A monolithically integrated mode-locked semiconductor laser is proposed. The
compound ring cavity is composed of a colliding pulse mode-locking (ML)
subcavity and a passive Fabry-Perot feedback subcavity. These two 1.6 mm long
subcavities are coupled by using on-chip reflectors at both ends, enabling
harmonic mode locking. By changing DC-bias conditions, optical mode spacing
from 50 to 450 GHz is experimentally demonstrated. Ultrafast pulses shorter
than 0.3 ps emitted from this laser diode are shown in autocorrelation traces.
| physics.optics | a monolithically integrated modelocked semiconductor laser is proposed the compound ring cavity is composed of a colliding pulse modelocking ml subcavity and a passive fabryperot feedback subcavity these two 16 mm long subcavities are coupled by using onchip reflectors at both ends enabling harmonic mode locking by changing dcbias conditions optical mode spacing from 50 to 450 ghz is experimentally demonstrated ultrafast pulses shorter than 03 ps emitted from this laser diode are shown in autocorrelation traces | [['a', 'monolithically', 'integrated', 'modelocked', 'semiconductor', 'laser', 'is', 'proposed', 'the', 'compound', 'ring', 'cavity', 'is', 'composed', 'of', 'a', 'colliding', 'pulse', 'modelocking', 'ml', 'subcavity', 'and', 'a', 'passive', 'fabryperot', 'feedback', 'subcavity', 'these', 'two', '16', 'mm', 'long', 'subcavities', 'are', 'coupled', 'by', 'using', 'onchip', 'reflectors', 'at', 'both', 'ends', 'enabling', 'harmonic', 'mode', 'locking', 'by', 'changing', 'dcbias', 'conditions', 'optical', 'mode', 'spacing', 'from', '50', 'to', '450', 'ghz', 'is', 'experimentally', 'demonstrated', 'ultrafast', 'pulses', 'shorter', 'than', '03', 'ps', 'emitted', 'from', 'this', 'laser', 'diode', 'are', 'shown', 'in', 'autocorrelation', 'traces']] | [-0.18443298328512658, 0.2376757791141669, -0.048361276009430486, -0.05503381262727392, 0.002538532704735796, -0.2607162230151395, 0.0017269193606140713, 0.5623556255425016, -0.2150156536946694, -0.2825449199974537, 0.05594312159810215, -0.25879482766302925, -0.023152668476104737, 0.29666495576500895, 0.01751977102831006, 0.08529219063309332, 0.010490190796554088, -0.13101406247975925, 0.034779277058939136, -0.09814310036599636, 0.18255158747313543, 0.06305500569559323, 0.35560376015802225, -0.05952858441819747, 0.15897545405353108, -0.07405378548428417, 0.054112560885647934, -0.14024596337694675, -0.055488267325175304, 0.03766068471595645, 0.26040255242493004, -0.07337207570361594, 0.27871608854581914, -0.42831559928134083, -0.20611504931002855, -0.01208390069679202, 0.1965962735687693, 0.10591363867123922, -0.08472781072215488, -0.3034004858508706, 0.07826248339532564, -0.13964657928794622, -0.11013312026237448, 0.08716401090845466, -0.003908730124433836, 0.05628196444937203, -0.2540205325186253, 0.003679731952336927, -0.012444651946425437, 0.0896453369781375, -0.019554974511265755, -0.03013567248980204, -0.038147575358549755, -0.028457059493909278, -0.1319441789140304, 0.02556845553064098, 0.2583870987594128, -0.025075941613564887, -0.11507596670029065, 0.2931346761745711, -0.1275875896613191, -0.047367651310438914, 0.1509696049739917, -0.1641913491487503, 0.0799177844946583, 0.2561577864115437, 0.10448293191070358, 0.09717952717483665, -0.14672840642121932, -0.06689685620445138, 0.04774325330431262, 0.3407950933339695, 0.2336347334459424, 0.14633377343260995, 0.2682977340867122, 0.24851945213973523, -0.0020114888650520396, 0.1890848197663824, -0.13831022853652636, -0.041449980422233544, -0.21136943669368824, -0.06477946265290181, -0.1708767959002095, 0.11048633010437091, -0.045325324187482086, -0.0449247904009341, 0.42032962111135325, 0.08470146312067905, 0.09094129983646174, 0.01654196755165079, 0.3639658387253682, 0.13476340970645348, 0.12805273719752827, 0.015329215144738555, 0.3244612091903885, 0.20011120857670903, 0.12584168031811716, -0.25151120919113357, -0.07505016505718232, -0.06175914308677117] |
1,802.06155 | Oriented Borel-Moore homologies of toric varieties | We generalize the K\"unneth formula for Chow groups to an arbitrary
OBM-homology theory satisfying descent (e.g. algebraic cobordism) when taking a
product with a toric variety. As a corollary we obtain a universal coefficient
theorem for the operational cohomology rings. We also give a description for
the homology groups of smooth toric varieties, that allows the calculation of
algebraic cobordism groups of singular toric varieties. Some computations are
carried out.
| math.AG math.KT | we generalize the kunneth formula for chow groups to an arbitrary obmhomology theory satisfying descent eg algebraic cobordism when taking a product with a toric variety as a corollary we obtain a universal coefficient theorem for the operational cohomology rings we also give a description for the homology groups of smooth toric varieties that allows the calculation of algebraic cobordism groups of singular toric varieties some computations are carried out | [['we', 'generalize', 'the', 'kunneth', 'formula', 'for', 'chow', 'groups', 'to', 'an', 'arbitrary', 'obmhomology', 'theory', 'satisfying', 'descent', 'eg', 'algebraic', 'cobordism', 'when', 'taking', 'a', 'product', 'with', 'a', 'toric', 'variety', 'as', 'a', 'corollary', 'we', 'obtain', 'a', 'universal', 'coefficient', 'theorem', 'for', 'the', 'operational', 'cohomology', 'rings', 'we', 'also', 'give', 'a', 'description', 'for', 'the', 'homology', 'groups', 'of', 'smooth', 'toric', 'varieties', 'that', 'allows', 'the', 'calculation', 'of', 'algebraic', 'cobordism', 'groups', 'of', 'singular', 'toric', 'varieties', 'some', 'computations', 'are', 'carried', 'out']] | [-0.24248481160569665, -0.036134911638446676, -0.20471808619365311, 0.13031922193730008, -0.09473831430617449, -0.20032431821649274, -0.009353393791715844, 0.2763086806010941, -0.3240105789222255, -0.19226995750289896, 0.09353204842899805, -0.18825661102533375, -0.1489703674206807, 0.24151659959360308, -0.20251523699287488, -0.04046321013753397, 0.036153658070480044, 0.0549479443984835, -0.16594774045718266, -0.34293081055975694, 0.4406685486935295, -0.030137621959590393, 0.22209420133436072, 0.10457160419690004, 0.11790397028992142, 0.03552603158101007, -0.022100120212585814, -0.0005960178602000941, -0.18246836985001236, 0.14099275215488413, 0.4255199795183928, 0.020330169062683548, 0.1113537116435127, -0.40812947017991025, -0.10795509818590422, 0.2049115963847093, 0.09583567251325618, 0.09138875977014718, -0.01054299584981324, -0.24986446974124166, 0.10324121170096855, -0.2510355329275995, -0.19838653700561196, -0.18328164770281402, 0.046641420350288565, 0.0429582934340705, -0.21777675567410779, -0.06771043718807683, 0.08733231293550436, 0.2184680648471998, -0.07936356278166742, -0.07682318038955006, -0.04275377104193836, 0.0795566446094713, -0.03360537288761512, 0.004767752421236988, 0.15627710217529017, -0.07156553290838348, -0.13619495699843526, 0.3732325097957653, -0.04465561582153474, -0.23090194603023323, 0.08710247015351079, -0.08565822249764334, -0.24523533742361958, 0.15139595895627703, 0.025665120525366587, 0.18703570152443927, 0.047446121558491344, 0.17165481965934884, -0.1646119241292278, -0.0026365797966718674, 0.09787060044354935, -0.008114136883692034, 0.1251278476708609, 0.027840172227445073, 0.0852409476292846, 0.1765543854849386, 0.022128035395365696, -0.06925674095965814, -0.3868110833446617, -0.2314370086254633, -0.06916246025323652, 0.2637517891176369, -0.17854185388558477, -0.2076705433782595, 0.3932415819524423, 0.014726071814210087, 0.16873043856543044, 0.22772423368271277, 0.27089805479930795, 0.0160888523467398, 0.03293376716960599, 0.020997293590419533, 0.054143212434069755, 0.3164441908939161, -0.04579065977663234, -0.07683129444974812, -0.03934124276797841, 0.29787437682566437] |
1,802.06156 | A Parsimonious Personalized Dose Finding Model via Dimension Reduction | Learning an individualized dose rule in personalized medicine is a
challenging statistical problem. Existing methods often suffer from the curse
of dimensionality, especially when the decision function is estimated
nonparametrically. To tackle this problem, we propose a dimension reduction
framework that effectively reduces the estimation to a lower-dimensional
subspace of the covariates. We exploit that the individualized dose rule can be
defined in a subspace spanned by a few linear combinations of the covariates,
leading to a more parsimonious model. The proposed framework does not require
the inverse probability of the propensity score under observational studies due
to a direct maximization of the value function. This distinguishes us from the
outcome weighted learning framework, which also solves decision rules directly.
Under the same framework, we further propose a pseudo-direct learning approach
that focuses more on estimating the dimensionality-reduced subspace of the
treatment outcome. Parameters in both approaches can be estimated efficiently
using an orthogonality constrained optimization algorithm on the Stiefel
manifold. Under mild regularity assumptions, the results on the asymptotic
normality of the proposed estimators are established, respectively. We also
derive the consistency and convergence rate for the value function under the
estimated optimal dose rule. We evaluate the performance of the proposed
approaches through extensive simulation studies and a warfarin pharmacogenetic
dataset.
| stat.ME | learning an individualized dose rule in personalized medicine is a challenging statistical problem existing methods often suffer from the curse of dimensionality especially when the decision function is estimated nonparametrically to tackle this problem we propose a dimension reduction framework that effectively reduces the estimation to a lowerdimensional subspace of the covariates we exploit that the individualized dose rule can be defined in a subspace spanned by a few linear combinations of the covariates leading to a more parsimonious model the proposed framework does not require the inverse probability of the propensity score under observational studies due to a direct maximization of the value function this distinguishes us from the outcome weighted learning framework which also solves decision rules directly under the same framework we further propose a pseudodirect learning approach that focuses more on estimating the dimensionalityreduced subspace of the treatment outcome parameters in both approaches can be estimated efficiently using an orthogonality constrained optimization algorithm on the stiefel manifold under mild regularity assumptions the results on the asymptotic normality of the proposed estimators are established respectively we also derive the consistency and convergence rate for the value function under the estimated optimal dose rule we evaluate the performance of the proposed approaches through extensive simulation studies and a warfarin pharmacogenetic dataset | [['learning', 'an', 'individualized', 'dose', 'rule', 'in', 'personalized', 'medicine', 'is', 'a', 'challenging', 'statistical', 'problem', 'existing', 'methods', 'often', 'suffer', 'from', 'the', 'curse', 'of', 'dimensionality', 'especially', 'when', 'the', 'decision', 'function', 'is', 'estimated', 'nonparametrically', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'a', 'dimension', 'reduction', 'framework', 'that', 'effectively', 'reduces', 'the', 'estimation', 'to', 'a', 'lowerdimensional', 'subspace', 'of', 'the', 'covariates', 'we', 'exploit', 'that', 'the', 'individualized', 'dose', 'rule', 'can', 'be', 'defined', 'in', 'a', 'subspace', 'spanned', 'by', 'a', 'few', 'linear', 'combinations', 'of', 'the', 'covariates', 'leading', 'to', 'a', 'more', 'parsimonious', 'model', 'the', 'proposed', 'framework', 'does', 'not', 'require', 'the', 'inverse', 'probability', 'of', 'the', 'propensity', 'score', 'under', 'observational', 'studies', 'due', 'to', 'a', 'direct', 'maximization', 'of', 'the', 'value', 'function', 'this', 'distinguishes', 'us', 'from', 'the', 'outcome', 'weighted', 'learning', 'framework', 'which', 'also', 'solves', 'decision', 'rules', 'directly', 'under', 'the', 'same', 'framework', 'we', 'further', 'propose', 'a', 'pseudodirect', 'learning', 'approach', 'that', 'focuses', 'more', 'on', 'estimating', 'the', 'dimensionalityreduced', 'subspace', 'of', 'the', 'treatment', 'outcome', 'parameters', 'in', 'both', 'approaches', 'can', 'be', 'estimated', 'efficiently', 'using', 'an', 'orthogonality', 'constrained', 'optimization', 'algorithm', 'on', 'the', 'stiefel', 'manifold', 'under', 'mild', 'regularity', 'assumptions', 'the', 'results', 'on', 'the', 'asymptotic', 'normality', 'of', 'the', 'proposed', 'estimators', 'are', 'established', 'respectively', 'we', 'also', 'derive', 'the', 'consistency', 'and', 'convergence', 'rate', 'for', 'the', 'value', 'function', 'under', 'the', 'estimated', 'optimal', 'dose', 'rule', 'we', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'approaches', 'through', 'extensive', 'simulation', 'studies', 'and', 'a', 'warfarin', 'pharmacogenetic', 'dataset']] | [-0.037548485536014066, -3.582877993807724e-05, -0.10137033069787442, 0.09744972032923163, -0.1061707609278185, -0.13229235919095786, 0.10262858759576701, 0.3990347306837134, -0.2697721996711444, -0.27133298042792614, 0.11620660635416466, -0.22454055971114562, -0.17455212543454934, 0.18072493522392832, -0.133345312118214, 0.10427809076357351, 0.10006402700454137, 0.028587130850009655, -0.10415513495110713, -0.291283410773964, 0.3010500587307725, 0.08205442927461469, 0.3540074083724011, 0.012614773274487201, 0.13887622727318402, 0.04877544896466271, -0.024484709247876452, 0.041904199585090125, -0.12436163414843937, 0.1433845394892829, 0.28434828100704046, 0.23667807969207577, 0.38138538172011666, -0.36829867600002064, -0.21763217474008859, 0.1385978846525211, 0.11260299215242618, 0.08385679212712929, 0.009991627468651749, -0.27114401828444934, 0.06678765335006041, -0.1557563749572508, -0.05507321082912759, -0.10927590586789795, -0.08385688040014531, -0.03224532192250064, -0.3745257365671074, 0.09235817946923044, 0.03334181799272181, 0.03005830253240211, -0.0915068507321917, -0.15056110037938814, 0.035364541870910884, 0.08597994022235277, 0.09861475095001296, 0.019012381933313213, 0.14923704365698867, -0.13453395114104424, -0.12483415016432223, 0.34114502856446394, -0.021759717483600637, -0.27636853925321464, 0.15527306508079594, -0.07386369361181937, -0.13185304184312457, 0.12408329896027011, 0.22488321460243138, 0.14757646582246414, -0.18716893258169875, 0.059531025333167495, -0.06340382224880159, 0.1533472779622073, 0.007171395764123859, -0.03459034325062947, 0.13432754419429913, 0.18628202139659134, 0.09191382588063068, 0.12312167816474717, -0.1076068276965569, -0.07743671701403933, -0.2552557392611458, -0.1055352203328303, -0.17813093610599917, 0.01790274055967083, -0.14055654030641374, -0.14851953517228259, 0.374932133285153, 0.21268588150104614, 0.1949643702467273, 0.10462726271362044, 0.3126562098919783, 0.14000220224700588, 0.06036424077027955, 0.07178464149594975, 0.1992301565269887, 0.0862645190088342, 0.012131158356941393, -0.24116074665941578, 0.15016468405890507, 0.07595186577648592] |
1,802.06157 | Attack on the Edon-K Key Encapsulation Mechanism | The key encapsulation mechanism Edon-K was proposed in response to the call
for post-quantum cryptography standardization issued by the National Institute
of Standards and Technologies (NIST). This scheme is inspired by the McEliece
scheme but uses another family of codes defined over $\mathbb{F}_{2^{128}}$
instead of $\mathbb{F}_2$ and is not based on the Hamming metric. It allows
significantly shorter public keys than the McEliece scheme. In this paper, we
give a polynomial time algorithm that recovers the encapsulated secret. This
attack makes the scheme insecure for the intended use. We obtain this result by
observing that recovering the error in the McEliece scheme corresponding to
Edon-K can be viewed as a decoding problem for the rank-metric. We show that
the code used in Edon-K is in fact a super-code of a Low Rank Parity Check
(LRPC) code of very small rank (1 or 2). A suitable parity-check matrix for the
super-code of such low rank can be easily derived from for the public key. We
then use this parity-check matrix in a decoding algorithm that was devised for
LRPC codes to recover the error. Finally we explain how we decapsulate the
secret once we have found the error.
| cs.CR | the key encapsulation mechanism edonk was proposed in response to the call for postquantum cryptography standardization issued by the national institute of standards and technologies nist this scheme is inspired by the mceliece scheme but uses another family of codes defined over mathbbf_2128 instead of mathbbf_2 and is not based on the hamming metric it allows significantly shorter public keys than the mceliece scheme in this paper we give a polynomial time algorithm that recovers the encapsulated secret this attack makes the scheme insecure for the intended use we obtain this result by observing that recovering the error in the mceliece scheme corresponding to edonk can be viewed as a decoding problem for the rankmetric we show that the code used in edonk is in fact a supercode of a low rank parity check lrpc code of very small rank 1 or 2 a suitable paritycheck matrix for the supercode of such low rank can be easily derived from for the public key we then use this paritycheck matrix in a decoding algorithm that was devised for lrpc codes to recover the error finally we explain how we decapsulate the secret once we have found the error | [['the', 'key', 'encapsulation', 'mechanism', 'edonk', 'was', 'proposed', 'in', 'response', 'to', 'the', 'call', 'for', 'postquantum', 'cryptography', 'standardization', 'issued', 'by', 'the', 'national', 'institute', 'of', 'standards', 'and', 'technologies', 'nist', 'this', 'scheme', 'is', 'inspired', 'by', 'the', 'mceliece', 'scheme', 'but', 'uses', 'another', 'family', 'of', 'codes', 'defined', 'over', 'mathbbf_2128', 'instead', 'of', 'mathbbf_2', 'and', 'is', 'not', 'based', 'on', 'the', 'hamming', 'metric', 'it', 'allows', 'significantly', 'shorter', 'public', 'keys', 'than', 'the', 'mceliece', 'scheme', 'in', 'this', 'paper', 'we', 'give', 'a', 'polynomial', 'time', 'algorithm', 'that', 'recovers', 'the', 'encapsulated', 'secret', 'this', 'attack', 'makes', 'the', 'scheme', 'insecure', 'for', 'the', 'intended', 'use', 'we', 'obtain', 'this', 'result', 'by', 'observing', 'that', 'recovering', 'the', 'error', 'in', 'the', 'mceliece', 'scheme', 'corresponding', 'to', 'edonk', 'can', 'be', 'viewed', 'as', 'a', 'decoding', 'problem', 'for', 'the', 'rankmetric', 'we', 'show', 'that', 'the', 'code', 'used', 'in', 'edonk', 'is', 'in', 'fact', 'a', 'supercode', 'of', 'a', 'low', 'rank', 'parity', 'check', 'lrpc', 'code', 'of', 'very', 'small', 'rank', '1', 'or', '2', 'a', 'suitable', 'paritycheck', 'matrix', 'for', 'the', 'supercode', 'of', 'such', 'low', 'rank', 'can', 'be', 'easily', 'derived', 'from', 'for', 'the', 'public', 'key', 'we', 'then', 'use', 'this', 'paritycheck', 'matrix', 'in', 'a', 'decoding', 'algorithm', 'that', 'was', 'devised', 'for', 'lrpc', 'codes', 'to', 'recover', 'the', 'error', 'finally', 'we', 'explain', 'how', 'we', 'decapsulate', 'the', 'secret', 'once', 'we', 'have', 'found', 'the', 'error']] | [-0.13095730824085575, 0.03300808536378332, -0.10652137337228618, 0.09332940355779078, -0.02015987627255993, -0.24437521978830679, 0.06935316801656229, 0.3495111397539194, -0.2898864576831842, -0.26866309869891175, 0.14130210428116605, -0.19245206779712298, -0.1764229010945807, 0.22259898650316665, -0.15712655657448638, 0.08778164897066279, 0.029266784377157306, 0.028176264794997106, -0.09558853133080097, -0.345235885393161, 0.3178925796459692, 0.1317044945863577, 0.28701785139214153, 0.033849534726677795, 0.10024194650423641, 0.02246812779504137, -0.04200365617871284, -0.048554666426916346, -0.10024856850937701, 0.11211455864593005, 0.29684430142530266, 0.20422815155142393, 0.25931413480295584, -0.3581083167774173, -0.18147641625494146, 0.09747039219603325, 0.11891410766432109, 0.1942133030997446, -0.0607908478538052, -0.24543873915830866, 0.1571860555702677, -0.23847786533908966, -0.05161609288591605, -0.031853625658326425, -0.03461000418397956, -0.005042903034541852, -0.285254729560648, -0.0016994187500900947, 0.031456211882715045, 0.03901510771650534, 0.005993037428169583, -0.10893046133435116, 0.05788712945695107, 0.11998638287306022, -0.010407209601730872, 0.05899463252176364, 0.0641814757269831, -0.03739517432733033, -0.1121373478973953, 0.39168528267868963, -0.05619930841800315, -0.17854167989885006, 0.09454522187320086, -0.05486951690310469, -0.11924629493688162, 0.10499190010894567, 0.18513433365867688, 0.11861868659400035, -0.09808930581292281, 0.06564911153042116, -0.08473986205286704, 0.2163273358120559, 0.08153086439348184, 0.06069084943021433, 0.10964213445400581, 0.1043648630929872, 0.05313228600037594, 0.14900886401749, -0.09038429433981386, -0.062292596050657525, -0.26449763315419356, -0.18008632935488073, -0.2163874220341826, 0.02690988674719567, -0.0640821573358829, -0.12309966609359552, 0.3798002972885278, 0.18274335961979934, 0.1265826680248257, 0.09009793397421256, 0.3155548783472906, 0.04557282186459559, 0.12007250605294338, 0.1561435652266179, 0.19682768125755665, 0.11097211854842802, 0.053160096880179857, -0.16018866408401383, 0.13492118613555645, 0.1377100425426108] |
1,802.06158 | Study of the likelihood of Alfv\'enic mode bifurcation in NSTX and
predictions for ITER baseline scenarios | Rare Alfv\'enic wave transitions between fixed-frequency and chirping phases
are identified in NSTX, where Alfv\'enic waves are normally observed to exhibit
either chirping or avalanching responses. For those transitions, we apply a
criterion [Duarte et al, Nucl. Fusion 57, 054001 (2017)] to predict the nature
of fast ion redistribution in tokamaks to be in the convective or diffusive
nonlinear regimes. For NSTX discharges in which the transition is not
accompanied by changes in the beam deposited power or modifications in the
injected radiofrequency power, it has been found that the anomalous fast ion
transport is a likely mediator of the bifurcation between the fixed-frequency
mode behavior and rapid chirping. For a quantitative assessment, global
gyrokinetic simulations of the effects of electrostatic ion temperature
gradient turbulence and trapped electron mode turbulence on chirping were
pursued using the GTS code. The investigation is extended by means of
predictive studies of the probable spectral behavior of Alfv\'enic eigenmodes
for baseline ITER cases consisting of elmy, advanced and hybrid scenarios. It
has been observed that most modes are found to be borderline between the steady
and the chirping phases.
| physics.plasm-ph | rare alfvenic wave transitions between fixedfrequency and chirping phases are identified in nstx where alfvenic waves are normally observed to exhibit either chirping or avalanching responses for those transitions we apply a criterion duarte et al nucl fusion 57 054001 2017 to predict the nature of fast ion redistribution in tokamaks to be in the convective or diffusive nonlinear regimes for nstx discharges in which the transition is not accompanied by changes in the beam deposited power or modifications in the injected radiofrequency power it has been found that the anomalous fast ion transport is a likely mediator of the bifurcation between the fixedfrequency mode behavior and rapid chirping for a quantitative assessment global gyrokinetic simulations of the effects of electrostatic ion temperature gradient turbulence and trapped electron mode turbulence on chirping were pursued using the gts code the investigation is extended by means of predictive studies of the probable spectral behavior of alfvenic eigenmodes for baseline iter cases consisting of elmy advanced and hybrid scenarios it has been observed that most modes are found to be borderline between the steady and the chirping phases | [['rare', 'alfvenic', 'wave', 'transitions', 'between', 'fixedfrequency', 'and', 'chirping', 'phases', 'are', 'identified', 'in', 'nstx', 'where', 'alfvenic', 'waves', 'are', 'normally', 'observed', 'to', 'exhibit', 'either', 'chirping', 'or', 'avalanching', 'responses', 'for', 'those', 'transitions', 'we', 'apply', 'a', 'criterion', 'duarte', 'et', 'al', 'nucl', 'fusion', '57', '054001', '2017', 'to', 'predict', 'the', 'nature', 'of', 'fast', 'ion', 'redistribution', 'in', 'tokamaks', 'to', 'be', 'in', 'the', 'convective', 'or', 'diffusive', 'nonlinear', 'regimes', 'for', 'nstx', 'discharges', 'in', 'which', 'the', 'transition', 'is', 'not', 'accompanied', 'by', 'changes', 'in', 'the', 'beam', 'deposited', 'power', 'or', 'modifications', 'in', 'the', 'injected', 'radiofrequency', 'power', 'it', 'has', 'been', 'found', 'that', 'the', 'anomalous', 'fast', 'ion', 'transport', 'is', 'a', 'likely', 'mediator', 'of', 'the', 'bifurcation', 'between', 'the', 'fixedfrequency', 'mode', 'behavior', 'and', 'rapid', 'chirping', 'for', 'a', 'quantitative', 'assessment', 'global', 'gyrokinetic', 'simulations', 'of', 'the', 'effects', 'of', 'electrostatic', 'ion', 'temperature', 'gradient', 'turbulence', 'and', 'trapped', 'electron', 'mode', 'turbulence', 'on', 'chirping', 'were', 'pursued', 'using', 'the', 'gts', 'code', 'the', 'investigation', 'is', 'extended', 'by', 'means', 'of', 'predictive', 'studies', 'of', 'the', 'probable', 'spectral', 'behavior', 'of', 'alfvenic', 'eigenmodes', 'for', 'baseline', 'iter', 'cases', 'consisting', 'of', 'elmy', 'advanced', 'and', 'hybrid', 'scenarios', 'it', 'has', 'been', 'observed', 'that', 'most', 'modes', 'are', 'found', 'to', 'be', 'borderline', 'between', 'the', 'steady', 'and', 'the', 'chirping', 'phases']] | [-0.14035723009980536, 0.23804252538830042, -0.04969540190052342, 0.07081817368161865, -0.03345556659623981, -0.15204437773523702, -0.0011693909097261525, 0.3599647595320602, -0.2066883745861265, -0.291030776817855, 0.06568985720003036, -0.2631024501815036, -0.08387924937682377, 0.22948846683233373, 0.013995269735696146, 0.06965158397797495, 0.044514134267936586, -0.0733654850741496, 0.006492037333019481, -0.11703358544666018, 0.2389958664749724, 0.11707240851545656, 0.31225940336448116, 0.009228503733017557, 0.041414833929652436, -0.0929475233512553, 0.00755617184614813, 0.0036735640380061957, -0.12616162353008042, -0.01722059576749342, 0.2618909281263178, 0.047159316362435554, 0.2524498336193328, -0.4615533114502181, -0.2598448763223919, 0.043956105458877376, 0.1715126480218149, 0.09832377318179587, -0.0433039203094243, -0.2605361423543277, 0.04639175030437449, -0.16957861917043054, -0.10026271419750678, -0.054208452118611014, 0.048468183984073834, 0.09219055929649118, -0.33185889310883104, 0.13540756946328927, 0.06259037163989568, 0.08764346626058624, -0.053452207703093016, -0.05150109845459106, -0.06244365196577525, 0.04704493810485646, 0.06437635524764758, 0.01841963587228108, 0.16548092320460725, -0.09336956124501052, -0.10987314005206163, 0.353639367081829, -0.03572843029679781, -0.12343216405149449, 0.22557409876152068, -0.17289793197383374, -0.06639354740949095, 0.18721486040063806, 0.165507116271938, 0.07566253895040702, -0.11401158038627457, -0.019396348066338515, 0.03305472754503638, 0.14809654568181596, 0.10032028372374338, 0.015431371066920661, 0.22007631050624155, 0.1872895008871785, -0.009556563989561354, 0.11386623459268752, -0.1295238706663981, -0.056934184789959645, -0.22944632953385244, -0.10949225945687677, -0.13554317098507357, 0.00042762503034208675, 0.020221268499940256, -0.158202207904007, 0.4228886945450024, 0.11995143896799434, 0.1263006512113419, -0.0780720849162773, 0.272812328754446, 0.1473405799979495, 0.03482888505819279, 0.11811957634935105, 0.33071689245895153, 0.16348276960512473, 0.14957959349518893, -0.2863540744987895, 0.0637170191412175, 0.04145798627035441] |
1,802.06159 | Ad Hoc Table Retrieval using Semantic Similarity | We introduce and address the problem of ad hoc table retrieval: answering a
keyword query with a ranked list of tables. This task is not only interesting
on its own account, but is also being used as a core component in many other
table-based information access scenarios, such as table completion or table
mining. The main novel contribution of this work is a method for performing
semantic matching between queries and tables. Specifically, we (i) represent
queries and tables in multiple semantic spaces (both discrete sparse and
continuous dense vector representations) and (ii) introduce various similarity
measures for matching those semantic representations. We consider all possible
combinations of semantic representations and similarity measures and use these
as features in a supervised learning model. Using a purpose-built test
collection based on Wikipedia tables, we demonstrate significant and
substantial improvements over a state-of-the-art baseline.
| cs.IR | we introduce and address the problem of ad hoc table retrieval answering a keyword query with a ranked list of tables this task is not only interesting on its own account but is also being used as a core component in many other tablebased information access scenarios such as table completion or table mining the main novel contribution of this work is a method for performing semantic matching between queries and tables specifically we i represent queries and tables in multiple semantic spaces both discrete sparse and continuous dense vector representations and ii introduce various similarity measures for matching those semantic representations we consider all possible combinations of semantic representations and similarity measures and use these as features in a supervised learning model using a purposebuilt test collection based on wikipedia tables we demonstrate significant and substantial improvements over a stateoftheart baseline | [['we', 'introduce', 'and', 'address', 'the', 'problem', 'of', 'ad', 'hoc', 'table', 'retrieval', 'answering', 'a', 'keyword', 'query', 'with', 'a', 'ranked', 'list', 'of', 'tables', 'this', 'task', 'is', 'not', 'only', 'interesting', 'on', 'its', 'own', 'account', 'but', 'is', 'also', 'being', 'used', 'as', 'a', 'core', 'component', 'in', 'many', 'other', 'tablebased', 'information', 'access', 'scenarios', 'such', 'as', 'table', 'completion', 'or', 'table', 'mining', 'the', 'main', 'novel', 'contribution', 'of', 'this', 'work', 'is', 'a', 'method', 'for', 'performing', 'semantic', 'matching', 'between', 'queries', 'and', 'tables', 'specifically', 'we', 'i', 'represent', 'queries', 'and', 'tables', 'in', 'multiple', 'semantic', 'spaces', 'both', 'discrete', 'sparse', 'and', 'continuous', 'dense', 'vector', 'representations', 'and', 'ii', 'introduce', 'various', 'similarity', 'measures', 'for', 'matching', 'those', 'semantic', 'representations', 'we', 'consider', 'all', 'possible', 'combinations', 'of', 'semantic', 'representations', 'and', 'similarity', 'measures', 'and', 'use', 'these', 'as', 'features', 'in', 'a', 'supervised', 'learning', 'model', 'using', 'a', 'purposebuilt', 'test', 'collection', 'based', 'on', 'wikipedia', 'tables', 'we', 'demonstrate', 'significant', 'and', 'substantial', 'improvements', 'over', 'a', 'stateoftheart', 'baseline']] | [-0.07128286495489973, 0.009003549163282233, -0.03311948605458921, 0.10497738149518829, -0.15348225182109237, -0.1481586871996627, 0.11744121721499717, 0.46737736384843437, -0.29421644530285307, -0.33790906896473655, 0.09743190749341779, -0.3055302437893312, -0.15487430630494434, 0.17134325041330722, -0.10050239600569115, 0.06550218183243922, 0.12897175331075322, 0.09090747858371429, -0.10049097289857586, -0.2646558557187771, 0.3376644016948568, 0.010744957109047493, 0.2929476230015034, 0.03926625097183589, 0.097294189858998, 0.0032184534840626828, -0.1427117643396626, -0.0023214302688154957, -0.049166250372187456, 0.19291729009365927, 0.32648673010039025, 0.24972167738359158, 0.2726706807668859, -0.3570315387808311, -0.2066821109906862, 0.12331510409729188, 0.12559906430509676, 0.08701712972300887, -0.042232788395805576, -0.32449895824948455, 0.09102136738644256, -0.22483254860247104, 0.06768101005172225, -0.16068150623189942, 0.039783345233701486, 0.01553767349597224, -0.26612088211785845, -0.016055612547960934, 0.08377247194195507, 0.085033320556198, -0.06738581504626856, -0.11949575163955263, 0.08258632163789359, 0.16368580344428216, -0.019401675290231343, 0.04393351702659037, 0.09169188144610224, -0.15414369397167063, -0.18272820723810376, 0.43870948624967687, -0.054585753446510454, -0.21885644820269565, 0.19537567278258766, 0.006626338648780341, -0.18065068031608744, 0.04762343471069676, 0.21653796531732233, 0.1189726008738483, -0.13539407465239645, 0.03033078014588272, -0.10791231713480723, 0.18544978270484266, 0.09696993888290205, 0.03075736064896722, 0.20444633168640586, 0.2126922646707947, 0.0331375014498456, 0.11837303405668599, -0.08807479418751875, -0.059129890121690086, -0.250268777227767, -0.15539334549791586, -0.1672994585856992, -0.0736887041022501, -0.13834971657865616, -0.20678522366977914, 0.4013321370043805, 0.1958872528851662, 0.23768019599472762, 0.0780667879153043, 0.32965984490608247, 0.008432745130512943, 0.0779084008052604, 0.12307444066227362, 0.07355762862364276, 0.014604266785400015, 0.11470485337875443, -0.08553711575305116, 0.10276272856879612, 0.08195146641851415] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.