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.0996 | Challenges of identifying putative planetary-origin meteorites composed
of non-igneous material | This concept article discusses the challenges of identifying planetary-origin
meteorites of non-igneous composition, primarily of sedimentary origin,
distinct from SNC meteorites. The paper reviews evidence on putative
sedimentary-origin meteorites and potential parent bodies for sedimentary
meteorites. Authors conclude that the list of candidate parent bodies for
sedimentary meteorites includes, but is not limited by the Earth, Mars,
Enceladus, Ganymede, Europa, and hypothetical planets that could exist between
orbits of Mars and Jupiter in the past. Authors argue that extraterrestrial
origin and a parent body for meteoritic sedimentary rocks may be identified
based on the entire body of evidence which is not limited solely by tests of
oxygen and noble gas isotopes whose signatures may undergo terrestrial
contamination and may exhibit significant heterogeneity within the Solar system
and within the parent cosmic bodies. Observed fall of a cosmic body, evidence
of hypervelocity fall, signs of impact in target, and the presence of fusion
crust, melting, and/or shock deformation features in the fragments should be
considered as priority signs of meteoritic origin.
| astro-ph.EP | this concept article discusses the challenges of identifying planetaryorigin meteorites of nonigneous composition primarily of sedimentary origin distinct from snc meteorites the paper reviews evidence on putative sedimentaryorigin meteorites and potential parent bodies for sedimentary meteorites authors conclude that the list of candidate parent bodies for sedimentary meteorites includes but is not limited by the earth mars enceladus ganymede europa and hypothetical planets that could exist between orbits of mars and jupiter in the past authors argue that extraterrestrial origin and a parent body for meteoritic sedimentary rocks may be identified based on the entire body of evidence which is not limited solely by tests of oxygen and noble gas isotopes whose signatures may undergo terrestrial contamination and may exhibit significant heterogeneity within the solar system and within the parent cosmic bodies observed fall of a cosmic body evidence of hypervelocity fall signs of impact in target and the presence of fusion crust melting andor shock deformation features in the fragments should be considered as priority signs of meteoritic origin | [['this', 'concept', 'article', 'discusses', 'the', 'challenges', 'of', 'identifying', 'planetaryorigin', 'meteorites', 'of', 'nonigneous', 'composition', 'primarily', 'of', 'sedimentary', 'origin', 'distinct', 'from', 'snc', 'meteorites', 'the', 'paper', 'reviews', 'evidence', 'on', 'putative', 'sedimentaryorigin', 'meteorites', 'and', 'potential', 'parent', 'bodies', 'for', 'sedimentary', 'meteorites', 'authors', 'conclude', 'that', 'the', 'list', 'of', 'candidate', 'parent', 'bodies', 'for', 'sedimentary', 'meteorites', 'includes', 'but', 'is', 'not', 'limited', 'by', 'the', 'earth', 'mars', 'enceladus', 'ganymede', 'europa', 'and', 'hypothetical', 'planets', 'that', 'could', 'exist', 'between', 'orbits', 'of', 'mars', 'and', 'jupiter', 'in', 'the', 'past', 'authors', 'argue', 'that', 'extraterrestrial', 'origin', 'and', 'a', 'parent', 'body', 'for', 'meteoritic', 'sedimentary', 'rocks', 'may', 'be', 'identified', 'based', 'on', 'the', 'entire', 'body', 'of', 'evidence', 'which', 'is', 'not', 'limited', 'solely', 'by', 'tests', 'of', 'oxygen', 'and', 'noble', 'gas', 'isotopes', 'whose', 'signatures', 'may', 'undergo', 'terrestrial', 'contamination', 'and', 'may', 'exhibit', 'significant', 'heterogeneity', 'within', 'the', 'solar', 'system', 'and', 'within', 'the', 'parent', 'cosmic', 'bodies', 'observed', 'fall', 'of', 'a', 'cosmic', 'body', 'evidence', 'of', 'hypervelocity', 'fall', 'signs', 'of', 'impact', 'in', 'target', 'and', 'the', 'presence', 'of', 'fusion', 'crust', 'melting', 'andor', 'shock', 'deformation', 'features', 'in', 'the', 'fragments', 'should', 'be', 'considered', 'as', 'priority', 'signs', 'of', 'meteoritic', 'origin']] | [-0.1013196710725121, 0.21876454443138624, -0.06519853397982106, 0.04170078670791727, -0.06170067158971159, -0.008262496120074675, 0.054802922957086206, 0.2986451283407708, -0.20850876132248058, -0.33144495545309927, 0.08333728661680306, -0.32811567676253617, -0.13838740822947806, 0.16502606182447857, -0.12190424724914399, -0.013168657483350086, 0.11397421843901698, -0.021379856451641813, -0.03540309067847418, -0.22123959482858135, 0.251048308483968, 0.07807891955322009, 0.12026376882568002, 0.06251406389388389, 0.025106071877027198, -0.10914039944293022, -0.01340724274216752, -0.028969099036961172, -0.1537892442699255, 0.10648504785162263, 0.2520682364868532, 0.18130279058269003, 0.1626607749494724, -0.4799984407699889, -0.2744291489514234, 0.09225223891830649, 0.12408538892937247, 0.027162854182062716, -0.10582905330201833, -0.2790508362675263, 0.0705757612013258, -0.22135294996856136, -0.18324674890997508, 0.06614777827122625, 0.09564976632273534, 0.022010326341149352, -0.1849581647658765, 0.10057602132118995, 0.10325677291257307, 0.1682964953471951, -0.2178766824889906, -0.21520282270129037, -0.060111300548582915, 0.10643177574855231, 0.14748168174299367, -0.06323961824888275, 0.24719342654515503, -0.04045108894656767, -0.03229631350508758, 0.47874121953334126, -0.0226628519625852, -0.03464395216655075, 0.2689166247187781, -0.22702952458695064, -0.15059995404694096, 0.20585998316251097, 0.18932522180797864, 0.07626917145725678, -0.22110401814071728, 0.007302387781064248, -0.08082057155358295, 0.13975560589183478, 0.11304564054063078, 0.05002857291505539, 0.3926494516615224, 0.15887767637849765, -0.012249586380286408, 0.042085217285646306, -0.149874773253465, -0.04445745637972972, -0.2219702899954947, -0.19449912438479564, -0.15090162624671524, -0.01442481706925762, -0.041223057398123535, -0.1623576988248325, 0.2993457826128828, 0.1166970773504415, 0.13063472253270447, -0.06687035578735438, 0.24110327356001585, -0.07428683225866518, 0.11447583772436094, 0.05696501123851964, 0.3000551189172603, 0.061889279198588894, 0.07412968695418731, -0.19486519435373512, 0.2523610664093645, 0.03969325723647628] |
1,802.09961 | Classifying Idiomatic and Literal Expressions Using Topic Models and
Intensity of Emotions | We describe an algorithm for automatic classification of idiomatic and
literal expressions. Our starting point is that words in a given text segment,
such as a paragraph, that are highranking representatives of a common topic of
discussion are less likely to be a part of an idiomatic expression. Our
additional hypothesis is that contexts in which idioms occur, typically, are
more affective and therefore, we incorporate a simple analysis of the intensity
of the emotions expressed by the contexts. We investigate the bag of words
topic representation of one to three paragraphs containing an expression that
should be classified as idiomatic or literal (a target phrase). We extract
topics from paragraphs containing idioms and from paragraphs containing
literals using an unsupervised clustering method, Latent Dirichlet Allocation
(LDA) (Blei et al., 2003). Since idiomatic expressions exhibit the property of
non-compositionality, we assume that they usually present different semantics
than the words used in the local topic. We treat idioms as semantic outliers,
and the identification of a semantic shift as outlier detection. Thus, this
topic representation allows us to differentiate idioms from literals using
local semantic contexts. Our results are encouraging.
| cs.CL | we describe an algorithm for automatic classification of idiomatic and literal expressions our starting point is that words in a given text segment such as a paragraph that are highranking representatives of a common topic of discussion are less likely to be a part of an idiomatic expression our additional hypothesis is that contexts in which idioms occur typically are more affective and therefore we incorporate a simple analysis of the intensity of the emotions expressed by the contexts we investigate the bag of words topic representation of one to three paragraphs containing an expression that should be classified as idiomatic or literal a target phrase we extract topics from paragraphs containing idioms and from paragraphs containing literals using an unsupervised clustering method latent dirichlet allocation lda blei et al 2003 since idiomatic expressions exhibit the property of noncompositionality we assume that they usually present different semantics than the words used in the local topic we treat idioms as semantic outliers and the identification of a semantic shift as outlier detection thus this topic representation allows us to differentiate idioms from literals using local semantic contexts our results are encouraging | [['we', 'describe', 'an', 'algorithm', 'for', 'automatic', 'classification', 'of', 'idiomatic', 'and', 'literal', 'expressions', 'our', 'starting', 'point', 'is', 'that', 'words', 'in', 'a', 'given', 'text', 'segment', 'such', 'as', 'a', 'paragraph', 'that', 'are', 'highranking', 'representatives', 'of', 'a', 'common', 'topic', 'of', 'discussion', 'are', 'less', 'likely', 'to', 'be', 'a', 'part', 'of', 'an', 'idiomatic', 'expression', 'our', 'additional', 'hypothesis', 'is', 'that', 'contexts', 'in', 'which', 'idioms', 'occur', 'typically', 'are', 'more', 'affective', 'and', 'therefore', 'we', 'incorporate', 'a', 'simple', 'analysis', 'of', 'the', 'intensity', 'of', 'the', 'emotions', 'expressed', 'by', 'the', 'contexts', 'we', 'investigate', 'the', 'bag', 'of', 'words', 'topic', 'representation', 'of', 'one', 'to', 'three', 'paragraphs', 'containing', 'an', 'expression', 'that', 'should', 'be', 'classified', 'as', 'idiomatic', 'or', 'literal', 'a', 'target', 'phrase', 'we', 'extract', 'topics', 'from', 'paragraphs', 'containing', 'idioms', 'and', 'from', 'paragraphs', 'containing', 'literals', 'using', 'an', 'unsupervised', 'clustering', 'method', 'latent', 'dirichlet', 'allocation', 'lda', 'blei', 'et', 'al', '2003', 'since', 'idiomatic', 'expressions', 'exhibit', 'the', 'property', 'of', 'noncompositionality', 'we', 'assume', 'that', 'they', 'usually', 'present', 'different', 'semantics', 'than', 'the', 'words', 'used', 'in', 'the', 'local', 'topic', 'we', 'treat', 'idioms', 'as', 'semantic', 'outliers', 'and', 'the', 'identification', 'of', 'a', 'semantic', 'shift', 'as', 'outlier', 'detection', 'thus', 'this', 'topic', 'representation', 'allows', 'us', 'to', 'differentiate', 'idioms', 'from', 'literals', 'using', 'local', 'semantic', 'contexts', 'our', 'results', 'are', 'encouraging']] | [-0.029293509524823142, 0.029062091294373017, -0.09900892232224424, 0.13304222234470583, -0.17869990678114828, -0.1239801552417693, 0.06324101656197359, 0.40065820218512305, -0.2850471353035164, -0.3125153909013582, 0.04535958661498236, -0.30982773315548595, -0.15573024945259686, 0.1609302609170314, -0.10682034328895271, -0.015635752306373978, 0.08107441866945318, 0.11373493660280787, -0.04425035593181198, -0.24673786170524423, 0.31438361926782854, 0.0009723806941004657, 0.26259730140082344, -0.007010631361808726, 0.08400464429465866, -0.020642774448133807, -0.09857954938215988, -0.0005364600992786191, -0.05616127361551022, 0.17114362605753794, 0.38669744775773435, 0.23814604727048722, 0.29275415406227306, -0.38932698083519146, -0.20077945464463146, 0.06288202004211527, 0.1219726528494407, 0.13039245936839727, -0.0007681362445634992, -0.33722192724112166, 0.0870078400494383, -0.20714788060763448, 0.018559849724942255, -0.12895023699593608, 0.06009317170483647, -0.005538074188205419, -0.25940351135580353, 0.057911709988263074, 0.15017264269608954, 0.10538514726179302, -0.06556164954016576, -0.13917178263463986, 0.03852454729183582, 0.16933816165057203, 0.03823147537605591, 0.050216697380636575, 0.11797276891955229, -0.15486450804638918, -0.1479190338369725, 0.3990539164090204, -0.039561658219705954, -0.2291083447847678, 0.19902624966448576, -0.026882438265063143, -0.19606792099993164, 0.0730321511660737, 0.17157198864937065, 0.13166516372581658, -0.18651923634328696, 0.005878331902542856, -0.11295708178705166, 0.211855324749772, 0.13596978728294806, -0.001052036253173673, 0.22573251959007903, 0.15667700037241927, -0.039032107633021146, 0.13679844450446402, -0.07229524977115924, -0.04268297373481026, -0.2734509410247916, -0.15267285599284583, -0.15687233571914178, -0.04043451393523288, -0.06980053597054735, -0.21051490840516865, 0.3900326357159034, 0.2080162206280326, 0.2242195062997145, 0.05905221693929797, 0.2423097353931221, 0.0531416454237871, 0.09734110908444833, 0.07734559383736085, 0.07864486462579517, 0.02763829004418637, 0.0870174747329974, -0.08924615339415454, 0.12328051490876725, 0.09505453008527635] |
1,802.09962 | Topological Crystalline Materials of $J=3/2$ Electrons: Antiperovskites,
Dirac points, and High Winding Topological Superconductivity | We present a theory of the high-spin generalization of topological insulators
and their doped superconducting states. The higher-spin topological insulators
involve a pair of $J=3/2$ bands with opposite parity, and are characterized by
their band inversion. The low-energy effective theory reveals that the
topological insulators host four different phases characterized by mirror Chern
numbers, at which boundaries two different patterns of bulk Dirac points
appear. For the carrier-doped case, it is shown that the system may host unique
unconventional superconductivity because of its high-spin nature and additional
orbital degrees of freedom intrinsic to topological insulators. The
superconducting critical temperature is evaluated by using density-density
pairing interactions, and odd-parity Cooper pairs are shown to be naturally
realized in the presence of interorbital pairing interaction. It is observed
that even the simplest spin 0 odd-parity pairing state exhibits a novel class
of topological superconductivity---high winding topological superconductivity.
We also discuss the experimental signals of high winding topological
superconductivity in the case of the antiperovskite superconductor
Sr$_{3-x}$SnO.
| cond-mat.supr-con | we present a theory of the highspin generalization of topological insulators and their doped superconducting states the higherspin topological insulators involve a pair of j32 bands with opposite parity and are characterized by their band inversion the lowenergy effective theory reveals that the topological insulators host four different phases characterized by mirror chern numbers at which boundaries two different patterns of bulk dirac points appear for the carrierdoped case it is shown that the system may host unique unconventional superconductivity because of its highspin nature and additional orbital degrees of freedom intrinsic to topological insulators the superconducting critical temperature is evaluated by using densitydensity pairing interactions and oddparity cooper pairs are shown to be naturally realized in the presence of interorbital pairing interaction it is observed that even the simplest spin 0 oddparity pairing state exhibits a novel class of topological superconductivityhigh winding topological superconductivity we also discuss the experimental signals of high winding topological superconductivity in the case of the antiperovskite superconductor sr_3xsno | [['we', 'present', 'a', 'theory', 'of', 'the', 'highspin', 'generalization', 'of', 'topological', 'insulators', 'and', 'their', 'doped', 'superconducting', 'states', 'the', 'higherspin', 'topological', 'insulators', 'involve', 'a', 'pair', 'of', 'j32', 'bands', 'with', 'opposite', 'parity', 'and', 'are', 'characterized', 'by', 'their', 'band', 'inversion', 'the', 'lowenergy', 'effective', 'theory', 'reveals', 'that', 'the', 'topological', 'insulators', 'host', 'four', 'different', 'phases', 'characterized', 'by', 'mirror', 'chern', 'numbers', 'at', 'which', 'boundaries', 'two', 'different', 'patterns', 'of', 'bulk', 'dirac', 'points', 'appear', 'for', 'the', 'carrierdoped', 'case', 'it', 'is', 'shown', 'that', 'the', 'system', 'may', 'host', 'unique', 'unconventional', 'superconductivity', 'because', 'of', 'its', 'highspin', 'nature', 'and', 'additional', 'orbital', 'degrees', 'of', 'freedom', 'intrinsic', 'to', 'topological', 'insulators', 'the', 'superconducting', 'critical', 'temperature', 'is', 'evaluated', 'by', 'using', 'densitydensity', 'pairing', 'interactions', 'and', 'oddparity', 'cooper', 'pairs', 'are', 'shown', 'to', 'be', 'naturally', 'realized', 'in', 'the', 'presence', 'of', 'interorbital', 'pairing', 'interaction', 'it', 'is', 'observed', 'that', 'even', 'the', 'simplest', 'spin', '0', 'oddparity', 'pairing', 'state', 'exhibits', 'a', 'novel', 'class', 'of', 'topological', 'superconductivityhigh', 'winding', 'topological', 'superconductivity', 'we', 'also', 'discuss', 'the', 'experimental', 'signals', 'of', 'high', 'winding', 'topological', 'superconductivity', 'in', 'the', 'case', 'of', 'the', 'antiperovskite', 'superconductor', 'sr_3xsno']] | [-0.2780872630941013, 0.2731066694735989, -0.03322445164167499, 0.10255568023653919, -0.06584731453566875, -0.2117057947750472, 0.07402581221315484, 0.3194327806908226, -0.2198928990429896, -0.2739253933305789, -0.040279783768810765, -0.32818311909385073, -0.17448122576421893, 0.11534052808123406, 0.04571115314114862, 0.01569240220409584, -0.09381139730074746, -0.05409712084866146, -0.15188778274152656, -0.2589187105257704, 0.35540821071874146, -0.06830988655243915, 0.33295969385796576, 0.06811910126775365, 0.000952974113241478, -0.019646769339515844, 0.13769940642262896, 0.019722389762912608, -0.09825596392101664, 0.07227656424746912, 0.2956413897386455, -0.10704391122298555, 0.11860323469925878, -0.4182704170377342, -0.22499232096711824, 0.02983637286087304, 0.12314198857838962, 0.1435959598862286, -0.05989910624035708, -0.3720400718874955, 0.08577869536835084, -0.1880923477944238, -0.1323402381639219, -0.1527252843713479, 0.005280690544793394, -0.0678548632258195, -0.18164184439264558, 0.08015398375662844, 0.06830444635874791, 0.10981607378470823, -0.08666235447127052, -0.11738574939874212, -0.16239723838877185, 0.026516584919457055, 0.08345649387198929, 0.029687557196633126, 0.07543516340465542, -0.14521360703589725, -0.15626791054440056, 0.36282486220581767, 0.009070451988444372, -0.11478503990598435, 0.2103995401926476, -0.13771796226367553, -0.10030187169615568, 0.15223654373291812, 0.04305979168753888, 0.0850471198941621, -0.06252019742698026, 0.09378162452214014, -0.04109008244004535, 0.14855503527436154, -0.0014373617392444721, 0.17532544305113837, 0.33600387453820063, 0.13295217427750763, 0.07091314281891185, 0.15900347600019668, -0.10888328330671312, -0.055577219478436746, -0.2645782476496037, -0.1866302718608383, -0.2796725206437058, 0.04553120718280459, -0.019557336839544442, -0.17896038106824072, 0.4539874798726816, 0.11495944819244573, 0.174999182119657, -0.09605467830930317, 0.18006641932540327, 0.1075571001238801, 0.06284244977040616, 0.01568392867206716, 0.23759963460540845, 0.1682211439828017, 0.06778362376131175, -0.31295857418891315, 0.03774127011163091, 0.08185665279789685] |
1,802.09963 | Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based
Models in Polynomial Time | Many applications, including rank aggregation and crowd-labeling, can be
modeled in terms of a bivariate isotonic matrix with unknown permutations
acting on its rows and columns. We consider the problem of estimating such a
matrix based on noisy observations of a subset of its entries, and design and
analyze a polynomial-time algorithm that improves upon the state of the art. In
particular, our results imply that any such $n \times n$ matrix can be
estimated efficiently in the normalized Frobenius norm at rate
$\widetilde{\mathcal O}(n^{-3/4})$, thus narrowing the gap between
$\widetilde{\mathcal O}(n^{-1})$ and $\widetilde{\mathcal O}(n^{-1/2})$, which
were hitherto the rates of the most statistically and computationally efficient
methods, respectively.
| stat.ML cs.IT cs.LG math.IT math.ST stat.TH | many applications including rank aggregation and crowdlabeling can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns we consider the problem of estimating such a matrix based on noisy observations of a subset of its entries and design and analyze a polynomialtime algorithm that improves upon the state of the art in particular our results imply that any such n times n matrix can be estimated efficiently in the normalized frobenius norm at rate widetildemathcal on34 thus narrowing the gap between widetildemathcal on1 and widetildemathcal on12 which were hitherto the rates of the most statistically and computationally efficient methods respectively | [['many', 'applications', 'including', 'rank', 'aggregation', 'and', 'crowdlabeling', 'can', 'be', 'modeled', 'in', 'terms', 'of', 'a', 'bivariate', 'isotonic', 'matrix', 'with', 'unknown', 'permutations', 'acting', 'on', 'its', 'rows', 'and', 'columns', 'we', 'consider', 'the', 'problem', 'of', 'estimating', 'such', 'a', 'matrix', 'based', 'on', 'noisy', 'observations', 'of', 'a', 'subset', 'of', 'its', 'entries', 'and', 'design', 'and', 'analyze', 'a', 'polynomialtime', 'algorithm', 'that', 'improves', 'upon', 'the', 'state', 'of', 'the', 'art', 'in', 'particular', 'our', 'results', 'imply', 'that', 'any', 'such', 'n', 'times', 'n', 'matrix', 'can', 'be', 'estimated', 'efficiently', 'in', 'the', 'normalized', 'frobenius', 'norm', 'at', 'rate', 'widetildemathcal', 'on34', 'thus', 'narrowing', 'the', 'gap', 'between', 'widetildemathcal', 'on1', 'and', 'widetildemathcal', 'on12', 'which', 'were', 'hitherto', 'the', 'rates', 'of', 'the', 'most', 'statistically', 'and', 'computationally', 'efficient', 'methods', 'respectively']] | [-0.08912229504854922, 0.07599570791540376, -0.010134393804537884, 0.03139161664155235, -0.017929401150434662, -0.13897634888443788, 0.08008462951920174, 0.3954690725910007, -0.28731544185622054, -0.2757061746467007, 0.1565381749116585, -0.261293733714644, -0.15410660533634987, 0.17578266998283018, -0.07885338940632043, 0.05900448165863855, 0.06679853571818099, 0.0714356171975442, -0.12619033345200736, -0.27795871292826196, 0.2677261884401151, 0.030094272397253492, 0.2274875624763241, 0.015171672790012228, 0.10302839634529905, 0.0031575301978224463, -0.024654443666270568, -0.007853664885010195, -0.0893849018356953, 0.11360740839020955, 0.26608466779078366, 0.17028459719459124, 0.2619117341610953, -0.4086198137278472, -0.14078446013699158, 0.1892368129343478, 0.15396503917445695, 0.05339707760033497, -0.00964579233737372, -0.2676037757191807, 0.09943030409967749, -0.14121905574788673, -0.06823070059368096, -0.05339732387641428, 0.027169264302964947, 0.02830203450840274, -0.3411208464712793, 0.0821984895428113, 0.05530773140938628, 0.012680652034426228, -0.020447367310434273, -0.22079216781149216, 0.051587559981271625, 0.09546189724548865, 0.010972078461328163, 0.03392002174476965, 0.1045763958672728, -0.09535818334685964, -0.1041475296481897, 0.3348660031162681, -0.05191387104964174, -0.20690475443566064, 0.13897226758754103, -0.11532695178762761, -0.12622488289644276, 0.127991517420448, 0.17781310467852637, 0.14305453810765015, -0.07362467370107087, 0.1304797181665231, -0.09743041437495192, 0.18812234155884985, 0.06840203549294228, 0.03504929409165858, 0.09149043273966793, 0.11218978989006388, 0.08979023519397175, 0.10925205218084498, -0.05714969681639976, -0.0572840307108682, -0.24693115407370303, -0.15074365897693698, -0.22642057988826836, 0.04714522047882575, -0.1709854160128439, -0.16606856231500797, 0.38119413800229995, 0.11933787208084666, 0.2609445496757062, 0.10711571712627871, 0.2522608483671595, 0.0859535924391821, 0.030311465972538934, 0.13080905201426202, 0.13814476698449035, 0.14435532819180655, -0.024692394360558156, -0.21959877018859492, 0.12688443965680146, 0.10998618637917588] |
1,802.09964 | On the vanishing cohomology problem for cocycle actions of groups on
II$_1$ factors | We prove that any free cocycle action of a countable amenable group $\Gamma$
on any II$_1$ factor $N$ can be perturbed by inner automorphisms to a genuine
action. This {\em vanishing cohomology} property, that we call $\mathcal
V\mathcal C$, is also closed to free products with amalgamation over finite
groups. But beyond this no other examples of $\mathcal V\mathcal C$-groups are
known. In turn, by considering special cocycle actions $\Gamma \curvearrowright
N$ in the case $N$ is the hyperfinite II$_1$ factor $R$, respectively the free
group factor $N=L(\Bbb F_\infty)$, we exclude many groups from being $\mathcal
V\mathcal C$. We also show that any free action $\Gamma \curvearrowright R$
gives rise to a free cocycle $\Gamma$-action on the II$_1$ factor $R'\cap
R^\omega$ whose vanishing cohomology is equivalent to Connes' Approximate
Embedding property for the II$_1$ factor $R\rtimes \Gamma$.
| math.OA | we prove that any free cocycle action of a countable amenable group gamma on any ii_1 factor n can be perturbed by inner automorphisms to a genuine action this em vanishing cohomology property that we call mathcal vmathcal c is also closed to free products with amalgamation over finite groups but beyond this no other examples of mathcal vmathcal cgroups are known in turn by considering special cocycle actions gamma curvearrowright n in the case n is the hyperfinite ii_1 factor r respectively the free group factor nlbbb f_infty we exclude many groups from being mathcal vmathcal c we also show that any free action gamma curvearrowright r gives rise to a free cocycle gammaaction on the ii_1 factor rcap romega whose vanishing cohomology is equivalent to connes approximate embedding property for the ii_1 factor rrtimes gamma | [['we', 'prove', 'that', 'any', 'free', 'cocycle', 'action', 'of', 'a', 'countable', 'amenable', 'group', 'gamma', 'on', 'any', 'ii_1', 'factor', 'n', 'can', 'be', 'perturbed', 'by', 'inner', 'automorphisms', 'to', 'a', 'genuine', 'action', 'this', 'em', 'vanishing', 'cohomology', 'property', 'that', 'we', 'call', 'mathcal', 'vmathcal', 'c', 'is', 'also', 'closed', 'to', 'free', 'products', 'with', 'amalgamation', 'over', 'finite', 'groups', 'but', 'beyond', 'this', 'no', 'other', 'examples', 'of', 'mathcal', 'vmathcal', 'cgroups', 'are', 'known', 'in', 'turn', 'by', 'considering', 'special', 'cocycle', 'actions', 'gamma', 'curvearrowright', 'n', 'in', 'the', 'case', 'n', 'is', 'the', 'hyperfinite', 'ii_1', 'factor', 'r', 'respectively', 'the', 'free', 'group', 'factor', 'nlbbb', 'f_infty', 'we', 'exclude', 'many', 'groups', 'from', 'being', 'mathcal', 'vmathcal', 'c', 'we', 'also', 'show', 'that', 'any', 'free', 'action', 'gamma', 'curvearrowright', 'r', 'gives', 'rise', 'to', 'a', 'free', 'cocycle', 'gammaaction', 'on', 'the', 'ii_1', 'factor', 'rcap', 'romega', 'whose', 'vanishing', 'cohomology', 'is', 'equivalent', 'to', 'connes', 'approximate', 'embedding', 'property', 'for', 'the', 'ii_1', 'factor', 'rrtimes', 'gamma']] | [-0.19968233042334974, 0.1895785437835216, -0.05990410690634128, 0.04789244781183216, -0.11454880994963734, -0.19094018778517186, 0.004612973107963198, 0.3956198954872568, -0.35385898315786, -0.15256064846728215, 0.07087193138517357, -0.28237004549009725, -0.07977821459558875, 0.19994573648171568, -0.15488760093542034, -0.056286491008530205, 0.05736010804984664, 0.18163250501760664, -0.08370927824751775, -0.21407193968565585, 0.3971904744257164, -0.029129431139581892, 0.1816838754902539, 0.0478688693666995, 0.06683478674933534, -0.02017383446218446, -0.008060188909653602, 0.014757245159297086, -0.19778848502365315, 0.05516649756292977, 0.26831331466982034, 0.08242469664197843, 0.2134221401407986, -0.27048537363846076, -0.1490048131056349, 0.2534260005109793, 0.1266792873023352, -0.0774268590441138, 0.004208058950847343, -0.29294767118956183, 0.12064270988818915, -0.2816004514255944, -0.10407947670832715, -0.08329129236859872, 0.13439837868174756, -0.08634269659352653, -0.28651432133526267, 0.01258524975128239, 0.12339610235272523, 0.07288663717918098, -0.048906339036287085, -0.0813672474503298, -0.030265270746039116, 0.09522137606023427, -0.005257193285454859, 0.0811408003740807, 0.17063148471745937, -0.03414942677173873, -0.09236051500449642, 0.40645688113427775, -0.10522266664980527, -0.2071460125871989, 0.1110884148887742, -0.2088768291458323, -0.23668582703890828, 0.16672271255640012, 0.01739674060167197, 0.13053622111157678, -0.016216184615212327, 0.29299387474106076, -0.14324426972170307, 0.10861321011907421, 0.09733663849628475, -0.021020795601276298, -0.0035661940586150568, -0.0019696788889739443, 0.10933323357804671, 0.09185282926388455, 0.12220720526666436, 0.07187463173314053, -0.3933227285331882, -0.17428957516847945, -0.07222899387124926, 0.24711668433155864, -0.1650257684489, -0.1892421308918582, 0.2978770994471715, 0.01351149772937574, 0.1383899299236124, 0.126347091548857, 0.15554058729150497, 0.06643977855898864, 0.11393573232892189, 0.15632687378606266, 0.11001351578092641, 0.201597920502536, -0.17931453739583958, -0.16524015256265343, -0.041736835266312805, 0.2454845518051811] |
1,802.09965 | Fitting of the TB-SMA interatomic potentials for Pt/Cu(111) surface
alloy | In this paper we present new parameters of the TB-SMA interatomic potentials
for the Pt/Cu(111) surface alloy. The parameters are fitted using both the
experimental and {\it ab initio} data. The potentials reproduce not only the
bulk properties of copper and platinum, but also the energy characteristics of
the Pt/Cu(111) surface alloy. The potentials can be used for the simulations of
the growth of the Pt/Cu(111) surface alloy on the atomic scale.
| cond-mat.mtrl-sci | in this paper we present new parameters of the tbsma interatomic potentials for the ptcu111 surface alloy the parameters are fitted using both the experimental and it ab initio data the potentials reproduce not only the bulk properties of copper and platinum but also the energy characteristics of the ptcu111 surface alloy the potentials can be used for the simulations of the growth of the ptcu111 surface alloy on the atomic scale | [['in', 'this', 'paper', 'we', 'present', 'new', 'parameters', 'of', 'the', 'tbsma', 'interatomic', 'potentials', 'for', 'the', 'ptcu111', 'surface', 'alloy', 'the', 'parameters', 'are', 'fitted', 'using', 'both', 'the', 'experimental', 'and', 'it', 'ab', 'initio', 'data', 'the', 'potentials', 'reproduce', 'not', 'only', 'the', 'bulk', 'properties', 'of', 'copper', 'and', 'platinum', 'but', 'also', 'the', 'energy', 'characteristics', 'of', 'the', 'ptcu111', 'surface', 'alloy', 'the', 'potentials', 'can', 'be', 'used', 'for', 'the', 'simulations', 'of', 'the', 'growth', 'of', 'the', 'ptcu111', 'surface', 'alloy', 'on', 'the', 'atomic', 'scale']] | [-0.047600940660193145, 0.12331029195928762, -0.09917633810644629, 0.037105615924663424, 0.010968459258511873, -0.08721874499837802, 0.0334703146502979, 0.39352379943257276, -0.26332953624742134, -0.2988847007214184, 0.03754149799556537, -0.29398857938571715, -0.1291779150337212, 0.21916795040572612, 0.04007347263920475, 0.08280996096805787, 0.04355671887718875, -0.022479097988508955, -0.1074829039911569, -0.2380403595661718, 0.30426144984249076, 0.0683821425576445, 0.2317656779032148, 0.11201704774235546, 0.011690373422617329, -0.03087351381660662, 0.07893355695766882, 0.03760734027330304, -0.1950434856969391, 0.12978125067139176, 0.18512656160263002, -0.016515790373349274, 0.14005968105834973, -0.5043645797585937, -0.24326202091039487, 0.0321525307765729, 0.06189614897069167, 0.13617087302493378, -0.07436615379009082, -0.2255746262594008, 0.06701702719003381, -0.12922327505083572, -0.128991303047244, -0.08823610320818466, 0.01923199767955172, 0.10452548881769705, -0.23569863413552372, 0.07011276877339287, 0.013708494892212706, 0.07802779133051214, -0.17828625957743907, -0.15179568534375917, -0.08793469833236345, 0.09913736290108202, 0.011806450311986494, 0.00948999064620322, 0.17257943957335722, -0.09195024519830837, -0.028778183628136004, 0.41725918451245403, -0.05687853533932021, -0.15406798623817067, 0.18165152630125972, -0.12640462295007956, -0.0738222581386881, 0.09833304267245489, 0.13732659995136126, 0.10766096596776599, -0.19367211676714285, 0.12790216263350834, 0.02482792992197292, 0.2004127352642761, 0.034812830158994654, 0.00591805449590205, 0.17264138621238756, 0.18772957102775994, -0.04530821821954049, 0.09177249174033829, -0.1467228491534807, -0.017408997082794215, -0.26870036287836624, -0.16969576750186757, -0.24772243806436448, -0.012334502928252463, -0.0931813242893607, -0.22184134248486706, 0.4449405874401121, 0.13452953811813617, 0.1646724439711428, -0.0054031626098382645, 0.22796151960189914, 0.08225683067780985, 0.1114814871541736, 0.00703791361039793, 0.27115170589425197, 0.12786984574836743, 0.06900807578300297, -0.27996743377953975, 0.11882072919651761, -0.006936085233333665] |
1,802.09966 | Theory of Probability. A Historical Essay | This book covers the history of probability up to Kolmogorov with essential
additional coverage of statistics up to Fisher. Based on my work of ca. 50
years, it is the only suchlike book. Gorrochurn (2016) is similar but his study
of events preceding Laplace is absolutely unsatisfactory. Hald (1990; 1998) are
worthy indeed but the Continental direction of statistics (Russian and German
statisticians) is omitted, it is impossible to find out what was contained in
any particular memoir of Laplace and the explanation does not always explain
the path from, say, Poisson to a modern interpretation of his results. Finally,
the reader ought to master modern math. statistics. I included many barely
known facts and conclusions, e. g., Gauss' justification of least squares
(yes!), the merits of Bayes (again, yes!), the unforgivable mistake of Laplace,
the work of Chebyshev and his students (merits and failures) etc., etc. The
book covers an extremely wide field, and is targeted at the same readers as any
other book on history of science. Mathematical treatment is not as difficult as
it is for readers of Hald.
| math.HO | this book covers the history of probability up to kolmogorov with essential additional coverage of statistics up to fisher based on my work of ca 50 years it is the only suchlike book gorrochurn 2016 is similar but his study of events preceding laplace is absolutely unsatisfactory hald 1990 1998 are worthy indeed but the continental direction of statistics russian and german statisticians is omitted it is impossible to find out what was contained in any particular memoir of laplace and the explanation does not always explain the path from say poisson to a modern interpretation of his results finally the reader ought to master modern math statistics i included many barely known facts and conclusions e g gauss justification of least squares yes the merits of bayes again yes the unforgivable mistake of laplace the work of chebyshev and his students merits and failures etc etc the book covers an extremely wide field and is targeted at the same readers as any other book on history of science mathematical treatment is not as difficult as it is for readers of hald | [['this', 'book', 'covers', 'the', 'history', 'of', 'probability', 'up', 'to', 'kolmogorov', 'with', 'essential', 'additional', 'coverage', 'of', 'statistics', 'up', 'to', 'fisher', 'based', 'on', 'my', 'work', 'of', 'ca', '50', 'years', 'it', 'is', 'the', 'only', 'suchlike', 'book', 'gorrochurn', '2016', 'is', 'similar', 'but', 'his', 'study', 'of', 'events', 'preceding', 'laplace', 'is', 'absolutely', 'unsatisfactory', 'hald', '1990', '1998', 'are', 'worthy', 'indeed', 'but', 'the', 'continental', 'direction', 'of', 'statistics', 'russian', 'and', 'german', 'statisticians', 'is', 'omitted', 'it', 'is', 'impossible', 'to', 'find', 'out', 'what', 'was', 'contained', 'in', 'any', 'particular', 'memoir', 'of', 'laplace', 'and', 'the', 'explanation', 'does', 'not', 'always', 'explain', 'the', 'path', 'from', 'say', 'poisson', 'to', 'a', 'modern', 'interpretation', 'of', 'his', 'results', 'finally', 'the', 'reader', 'ought', 'to', 'master', 'modern', 'math', 'statistics', 'i', 'included', 'many', 'barely', 'known', 'facts', 'and', 'conclusions', 'e', 'g', 'gauss', 'justification', 'of', 'least', 'squares', 'yes', 'the', 'merits', 'of', 'bayes', 'again', 'yes', 'the', 'unforgivable', 'mistake', 'of', 'laplace', 'the', 'work', 'of', 'chebyshev', 'and', 'his', 'students', 'merits', 'and', 'failures', 'etc', 'etc', 'the', 'book', 'covers', 'an', 'extremely', 'wide', 'field', 'and', 'is', 'targeted', 'at', 'the', 'same', 'readers', 'as', 'any', 'other', 'book', 'on', 'history', 'of', 'science', 'mathematical', 'treatment', 'is', 'not', 'as', 'difficult', 'as', 'it', 'is', 'for', 'readers', 'of', 'hald']] | [-0.049825486921084426, 0.04472269207803442, -0.11450830846248815, 0.11209569964687237, -0.1807839365469085, -0.12965546077013843, 0.07043813877842492, 0.3422769131617517, -0.22975899501082797, -0.3278887259830501, 0.11335377350268472, -0.30633716363097646, -0.14688625993827978, 0.20235959691926836, -0.1875859397269475, -0.0082277562831425, 0.07561127404785818, 0.07090983313715292, -0.01676472471509543, -0.35876331453004645, 0.24820771867590438, 0.11224355578629507, 0.25414966448960413, 0.047762107693900664, 0.06974592947970248, 0.00011308116372674704, -0.1060888138315123, -0.017897631694278163, -0.12339893410810165, 0.09263554664018253, 0.29308638170768975, 0.17106414464716282, 0.3336174533185032, -0.37976416495318216, -0.15362608797537783, 0.08759604817088176, 0.10140669538005669, 0.056786596372128566, 0.05491303104790859, -0.25343353728142876, 0.05449857146886643, -0.154017040759532, -0.1294230840130088, -0.04713435794126579, 0.09706107614652461, -0.0011160991161078629, -0.16279808697290718, 0.05270971517182059, 0.1379608938160042, 0.09776854451435307, 0.024369844908101693, -0.17413730055688778, 0.022958261865035943, 0.12010217770520183, 0.08044846388834735, 0.05213716133148409, 0.08876755049115875, -0.11332818611085207, -0.11045307123179858, 0.40147549462401205, -0.008798251115755799, -0.12989022872514194, 0.1626809181490292, -0.1404545425676689, -0.15645885377372099, 0.11293975147806729, 0.10029106413842076, 0.08338380732263127, -0.1597560883861863, 0.09160504898690204, -0.05919935005674941, 0.16870775440604321, 0.12625189608532109, -0.04382834472796983, 0.19355718305503414, 0.10002235094887307, 0.031672730229264645, 0.04185658740300116, -0.022073941010360917, -0.11141901060731875, -0.32766445911385944, -0.17764196489523681, -0.2067568575665872, 0.09948854227178446, 0.010438804936226613, -0.1740556144543613, 0.3461076449512297, 0.18010497564165334, 0.1224892374600232, 0.011598080890770588, 0.2474051605315051, 0.08339648753107111, -0.004918879521493283, 0.0851686534898666, 0.19168301729951054, 0.1399965370856484, 0.1515368719171319, -0.08719190644203789, 0.07980068256535257, 0.028845568283254075] |
1,802.09967 | A New Algorithm to Quantify Maximum Discs in Galaxies | Maximum disc decompositions of rotation curves place a dynamical upper limit
to the mass attributable to stars in galaxies. The precise definition of this
term, however, can be vague and varies in usage. We develop an algorithm to
robustly quantify maximum-disc mass models and apply it to 153 galaxies from
the SPARC database. Our automatic procedure recovers classic results from
manual decompositions. High-mass, high-surface-brightness galaxies have mean
maximum-disc mass-to-light ratios of $\sim 0.7
\;{\mathrm{M}_\odot}/{\mathrm{L}_\odot}$ in the Spitzer 3.6 $\mu$m band, which
are close to the expectations from stellar population models, suggesting that
these galaxies are nearly maximal. Low-mass, low-surface-brightness galaxies
have very high maximum-disc mass-to-light ratios (up to 10
$\mathrm{M}_\odot/\mathrm{L}_\odot$), which are unphysical for standard stellar
population models, confirming they are sub-maximal. The maximum-disc
mass-to-light ratios are more closely correlated with surface brightness than
luminosity. The mean ratio between baryonic and observed velocity at the peak
of the baryonic contribution is
$\mathrm{V}_{\mathrm{bar}}/{\mathrm{V}_\mathrm{p}} \approx 0.88$, but
correlates with surface brightness, so it is unwise to use this mean value to
define the maximum disc concept. Our algorithm requires no manual intervention
and could be applied to large galaxy samples from future HI surveys with
Apertif, Askap, and SKA.
| astro-ph.GA | maximum disc decompositions of rotation curves place a dynamical upper limit to the mass attributable to stars in galaxies the precise definition of this term however can be vague and varies in usage we develop an algorithm to robustly quantify maximumdisc mass models and apply it to 153 galaxies from the sparc database our automatic procedure recovers classic results from manual decompositions highmass highsurfacebrightness galaxies have mean maximumdisc masstolight ratios of sim 07 mathrmm_odotmathrml_odot in the spitzer 36 mum band which are close to the expectations from stellar population models suggesting that these galaxies are nearly maximal lowmass lowsurfacebrightness galaxies have very high maximumdisc masstolight ratios up to 10 mathrmm_odotmathrml_odot which are unphysical for standard stellar population models confirming they are submaximal the maximumdisc masstolight ratios are more closely correlated with surface brightness than luminosity the mean ratio between baryonic and observed velocity at the peak of the baryonic contribution is mathrmv_mathrmbarmathrmv_mathrmp approx 088 but correlates with surface brightness so it is unwise to use this mean value to define the maximum disc concept our algorithm requires no manual intervention and could be applied to large galaxy samples from future hi surveys with apertif askap and ska | [['maximum', 'disc', 'decompositions', 'of', 'rotation', 'curves', 'place', 'a', 'dynamical', 'upper', 'limit', 'to', 'the', 'mass', 'attributable', 'to', 'stars', 'in', 'galaxies', 'the', 'precise', 'definition', 'of', 'this', 'term', 'however', 'can', 'be', 'vague', 'and', 'varies', 'in', 'usage', 'we', 'develop', 'an', 'algorithm', 'to', 'robustly', 'quantify', 'maximumdisc', 'mass', 'models', 'and', 'apply', 'it', 'to', '153', 'galaxies', 'from', 'the', 'sparc', 'database', 'our', 'automatic', 'procedure', 'recovers', 'classic', 'results', 'from', 'manual', 'decompositions', 'highmass', 'highsurfacebrightness', 'galaxies', 'have', 'mean', 'maximumdisc', 'masstolight', 'ratios', 'of', 'sim', '07', 'mathrmm_odotmathrml_odot', 'in', 'the', 'spitzer', '36', 'mum', 'band', 'which', 'are', 'close', 'to', 'the', 'expectations', 'from', 'stellar', 'population', 'models', 'suggesting', 'that', 'these', 'galaxies', 'are', 'nearly', 'maximal', 'lowmass', 'lowsurfacebrightness', 'galaxies', 'have', 'very', 'high', 'maximumdisc', 'masstolight', 'ratios', 'up', 'to', '10', 'mathrmm_odotmathrml_odot', 'which', 'are', 'unphysical', 'for', 'standard', 'stellar', 'population', 'models', 'confirming', 'they', 'are', 'submaximal', 'the', 'maximumdisc', 'masstolight', 'ratios', 'are', 'more', 'closely', 'correlated', 'with', 'surface', 'brightness', 'than', 'luminosity', 'the', 'mean', 'ratio', 'between', 'baryonic', 'and', 'observed', 'velocity', 'at', 'the', 'peak', 'of', 'the', 'baryonic', 'contribution', 'is', 'mathrmv_mathrmbarmathrmv_mathrmp', 'approx', '088', 'but', 'correlates', 'with', 'surface', 'brightness', 'so', 'it', 'is', 'unwise', 'to', 'use', 'this', 'mean', 'value', 'to', 'define', 'the', 'maximum', 'disc', 'concept', 'our', 'algorithm', 'requires', 'no', 'manual', 'intervention', 'and', 'could', 'be', 'applied', 'to', 'large', 'galaxy', 'samples', 'from', 'future', 'hi', 'surveys', 'with', 'apertif', 'askap', 'and', 'ska']] | [-0.019610152327412814, 0.09408964527028729, -0.08041037890603658, 0.13015354293777504, -0.10756761294656567, -0.08349527845608204, 0.042724807018518676, 0.44083207504044536, -0.14426721555919728, -0.4059406852644241, 0.06578525750272983, -0.29677576501853764, -0.046000076284423014, 0.2060293441362755, -0.10270561605492341, 0.018312849183623293, 0.04780958838789363, -0.10285200102715658, -0.0717581099386883, -0.2827325449824067, 0.24809407635012223, 0.06185697418000853, 0.2035301554216338, -0.03334160304892029, 0.03562317154493791, -0.13038004082342497, -0.07678101366689923, -0.037053377723929526, -0.16262491814420488, 0.03660837688711377, 0.2589419145500387, 0.142468007530884, 0.19916589775393545, -0.2992697496166719, -0.13434592795579656, 0.12706365516974724, 0.18804389829105905, 0.05148907708436517, -0.0006768576678616822, -0.2376095514544951, 0.08271150424338791, -0.16159319125320193, -0.16065836627017327, 0.021859685238807137, 0.03599983829130628, 0.0014245680822011996, -0.23881121538876443, 0.1819257599625936, -0.01244776427572978, 0.10984051502556232, -0.08966130005998765, -0.1572712066497806, -0.08324546875890668, 0.060255949297558745, 0.041913819477337466, 0.11408433681876608, 0.2122980556830916, -0.13232478702545394, -0.0026836796234271545, 0.396757036903683, -0.08779164476473685, -0.04481469432832863, 0.2236134883964301, -0.1909533525308967, -0.1502072619255252, 0.1416589031613679, 0.18067064048955217, 0.0726555759985266, -0.13681219841058992, -0.0014885234927440214, -0.013805006290382078, 0.24935264763783435, 0.03147175624831199, 0.043128153210109675, 0.3339334661283587, 0.09035737600120507, 0.07027726774270247, 0.04795774634350186, -0.1940610548243763, -0.03127965505225394, -0.1968647913522638, -0.07886383057885556, -0.11804145610622814, 0.08802685327946722, -0.16134842423856086, -0.1286026528746612, 0.3028303766908238, 0.14854042395493205, 0.2451696819245663, 0.15730015804981623, 0.30186904181265367, 0.10375828817290758, 0.16210021008499803, 0.11939939146752146, 0.3054373193917112, 0.1788771694305719, 0.051537742282320956, -0.2192511186858981, 0.06831881898806944, -0.015895543615238702] |
1,802.09968 | A Hybrid Word-Character Approach to Abstractive Summarization | Automatic abstractive text summarization is an important and challenging
research topic of natural language processing. Among many widely used
languages, the Chinese language has a special property that a Chinese character
contains rich information comparable to a word. Existing Chinese text
summarization methods, either adopt totally character-based or word-based
representations, fail to fully exploit the information carried by both
representations. To accurately capture the essence of articles, we propose a
hybrid word-character approach (HWC) which preserves the advantages of both
word-based and character-based representations. We evaluate the advantage of
the proposed HWC approach by applying it to two existing methods, and discover
that it generates state-of-the-art performance with a margin of 24 ROUGE points
on a widely used dataset LCSTS. In addition, we find an issue contained in the
LCSTS dataset and offer a script to remove overlapping pairs (a summary and a
short text) to create a clean dataset for the community. The proposed HWC
approach also generates the best performance on the new, clean LCSTS dataset.
| cs.CL | automatic abstractive text summarization is an important and challenging research topic of natural language processing among many widely used languages the chinese language has a special property that a chinese character contains rich information comparable to a word existing chinese text summarization methods either adopt totally characterbased or wordbased representations fail to fully exploit the information carried by both representations to accurately capture the essence of articles we propose a hybrid wordcharacter approach hwc which preserves the advantages of both wordbased and characterbased representations we evaluate the advantage of the proposed hwc approach by applying it to two existing methods and discover that it generates stateoftheart performance with a margin of 24 rouge points on a widely used dataset lcsts in addition we find an issue contained in the lcsts dataset and offer a script to remove overlapping pairs a summary and a short text to create a clean dataset for the community the proposed hwc approach also generates the best performance on the new clean lcsts dataset | [['automatic', 'abstractive', 'text', 'summarization', 'is', 'an', 'important', 'and', 'challenging', 'research', 'topic', 'of', 'natural', 'language', 'processing', 'among', 'many', 'widely', 'used', 'languages', 'the', 'chinese', 'language', 'has', 'a', 'special', 'property', 'that', 'a', 'chinese', 'character', 'contains', 'rich', 'information', 'comparable', 'to', 'a', 'word', 'existing', 'chinese', 'text', 'summarization', 'methods', 'either', 'adopt', 'totally', 'characterbased', 'or', 'wordbased', 'representations', 'fail', 'to', 'fully', 'exploit', 'the', 'information', 'carried', 'by', 'both', 'representations', 'to', 'accurately', 'capture', 'the', 'essence', 'of', 'articles', 'we', 'propose', 'a', 'hybrid', 'wordcharacter', 'approach', 'hwc', 'which', 'preserves', 'the', 'advantages', 'of', 'both', 'wordbased', 'and', 'characterbased', 'representations', 'we', 'evaluate', 'the', 'advantage', 'of', 'the', 'proposed', 'hwc', 'approach', 'by', 'applying', 'it', 'to', 'two', 'existing', 'methods', 'and', 'discover', 'that', 'it', 'generates', 'stateoftheart', 'performance', 'with', 'a', 'margin', 'of', '24', 'rouge', 'points', 'on', 'a', 'widely', 'used', 'dataset', 'lcsts', 'in', 'addition', 'we', 'find', 'an', 'issue', 'contained', 'in', 'the', 'lcsts', 'dataset', 'and', 'offer', 'a', 'script', 'to', 'remove', 'overlapping', 'pairs', 'a', 'summary', 'and', 'a', 'short', 'text', 'to', 'create', 'a', 'clean', 'dataset', 'for', 'the', 'community', 'the', 'proposed', 'hwc', 'approach', 'also', 'generates', 'the', 'best', 'performance', 'on', 'the', 'new', 'clean', 'lcsts', 'dataset']] | [-0.031332409768808814, -0.03997240057842213, -0.09270185562560246, 0.1347237982389786, -0.16089532370789952, -0.13555328138283498, 0.03165142250335997, 0.41146294803669053, -0.2690310973945695, -0.29409148782447336, 0.04455191056227444, -0.32393378669179845, -0.14556853880778708, 0.22581458771240986, -0.11857300151210179, 0.027580742034063275, 0.15735373985288398, 0.08377090944919646, -0.04261233387625821, -0.30050690861840157, 0.2684547540113618, 0.0063058406923941915, 0.39944977615405586, 0.02197821096688997, 0.14389551904778705, -0.032887409560360195, -0.05632558022937571, -0.03109094698447734, -0.06212763476971651, 0.2008307515643537, 0.3421227569647488, 0.20199660623967203, 0.29922160259143094, -0.3584901510926318, -0.19561685145682922, 0.07656477764733911, 0.13395076017228089, 0.10829645275953226, -0.05187678170226545, -0.33748216649317847, 0.10330140001661632, -0.2125455836981668, 0.0604594313883267, -0.1529663515317398, 0.007210026270643409, -0.0507086860570347, -0.24918242971484905, 0.00928722529715742, 0.14340526608949794, 0.07122121783738423, 0.008611597034836277, -0.1396001600521794, 0.05495485191585474, 0.1683682263011135, 0.033219617595715956, 0.08727014925084188, 0.0759887802885801, -0.14213192037117378, -0.15280931149512375, 0.4140824475769131, -0.10211219936623127, -0.23236668002763985, 0.22115903598933073, -0.0035857453545932436, -0.1645403755496123, 0.09593664145809487, 0.19170493198769345, 0.0994535690572645, -0.19530415283294306, 0.02951441318804254, -0.07739635712988231, 0.23448090559672674, 0.07143740605845648, -0.00015870992293847458, 0.1852987434443397, 0.2636040082489628, -0.031708896994782014, 0.13229878297785208, -0.12270214664108824, -0.04606517131573388, -0.1640456383659815, -0.12242294511746704, -0.1670515964520053, -0.058213097122331546, -0.05000873169696466, -0.18734094635250845, 0.4468760252486737, 0.25225779600857223, 0.14584548995065102, 0.06508090251771223, 0.32557908210964387, -0.0299994127375872, 0.12266107004428964, 0.09358759133084234, 0.10414843786427463, -0.018359570795880808, 0.11512335728565674, -0.130718475387853, 0.06486042942768629, 0.07610204746153959] |
1,802.09969 | Realization of shift graphs as disjointness graphs of 1-intersecting
curves in the plane | It is shown that shift graphs can be realized as disjointness graphs of
1-intersecting curves in the plane. This implies that the latter class of
graphs is not $\chi$-bounded.
| math.CO cs.DM | it is shown that shift graphs can be realized as disjointness graphs of 1intersecting curves in the plane this implies that the latter class of graphs is not chibounded | [['it', 'is', 'shown', 'that', 'shift', 'graphs', 'can', 'be', 'realized', 'as', 'disjointness', 'graphs', 'of', '1intersecting', 'curves', 'in', 'the', 'plane', 'this', 'implies', 'that', 'the', 'latter', 'class', 'of', 'graphs', 'is', 'not', 'chibounded']] | [-0.21040789397224655, 0.14650205420009021, -0.0640450101827496, 0.09612343001083054, -0.11361352238675644, -0.1070279651160898, 0.00024012293955632326, 0.42996594958521167, -0.30216972966646327, -0.26417599422134586, 0.12311242851990692, -0.22257262718831672, -0.18897531554102898, 0.24646582826972008, -0.16226555028095327, -0.0009748776732333775, 0.0982610016804317, 0.04465225274706709, 0.010900751350383306, -0.2816114638899935, 0.31410741703263645, -0.0406195034176625, 0.2155209095699006, 0.1127524419109626, 0.016464301908854395, -0.016135079159947305, 0.08674694803254358, 0.13749381768163935, -0.08573587948771531, 0.06345440781322019, 0.3017222709183035, 0.1622281281984058, 0.13262816628537558, -0.26376260251834477, -0.24602386381091743, 0.2769220704212785, 0.14352907988660293, 0.06362724721688649, 0.02076586910748276, -0.22627765338482528, 0.09722222606169767, -0.08445653903844028, -0.10382629590558595, -0.021071630754861338, 0.07382262812863136, 0.01705018546560715, -0.22380041538191767, -0.024090520822812385, 0.20668039374567312, 0.0224266713163976, 0.08469128354998498, -0.07301202204463811, -0.0977597715943281, 0.08798919794759874, -0.04003941898780136, 0.08390157438557723, 0.03584100643237089, -0.07245495400776894, -0.16593240329931522, 0.4359202302735427, -0.03450001288076927, -0.18459099479790392, 0.05941013416981902, -0.16602020871279569, -0.19725420245708064, 0.11844239268323471, 0.09051682305490148, 0.1796373307448009, -0.11985756379776988, 0.18099326765614338, -0.18666233494877815, 0.16137486349405913, 0.12247577373837602, -0.0055061663211933495, 0.12210100860302818, 0.0853389311292819, 0.18122839526241197, 0.19866745482231007, 0.05818145401005087, -0.03221785489084392, -0.2746658880135109, -0.12168722278599081, -0.27468888216314774, 0.04650034621440211, -0.10394253184143774, -0.20219700597527693, 0.36907189467857626, 0.06435686097769387, 0.18078038279480976, 0.11691980320831825, 0.16734293835430308, 0.11738527032691215, 0.1560628772552671, 0.1487601170444797, 0.24651725847145606, 0.16764114257590523, 0.012266830091589484, -0.12910228132687765, 0.12228262870861538, 0.11644191131124208] |
1,802.0997 | Equidistribution theorems for holomorphic Siegel modular forms for
$GSp_4$; Hecke fields and $n$-level density | This paper is a continuation of the author's previous wotk. We supplement
four results on a family of holomorphic Siegel cusp forms for
$GSp_4/\mathbb{Q}$. First, we improve the result on Hecke fields. Namely, we
prove that the degree of Hecke fields is unbounded on the subspace of genuine
forms which do not come from functorial lift of smaller subgroups of $GSp_4$
under a conjecture in local-global compatibility and Arthur's classification
for $GSp_4$. Second, we prove simultaneous vertical Sato-Tate theorem. Namely,
we prove simultaneous equidistribution of Hecke eigenvalues at finitely many
primes. Third, we compute the $n$-level density of degree 4 spinor
$L$-functions, and thus we can distinguish the symmetry type depending on the
root numbers. This is conditional on certain conjecture on root numbers.
Fourth, we consider equidistribution of paramodular forms. In this case, we can
prove a result on root numbers. Main tools are the equidistribution theorem in
our previous work and Shin-Templier's work.
| math.NT | this paper is a continuation of the authors previous wotk we supplement four results on a family of holomorphic siegel cusp forms for gsp_4mathbbq first we improve the result on hecke fields namely we prove that the degree of hecke fields is unbounded on the subspace of genuine forms which do not come from functorial lift of smaller subgroups of gsp_4 under a conjecture in localglobal compatibility and arthurs classification for gsp_4 second we prove simultaneous vertical satotate theorem namely we prove simultaneous equidistribution of hecke eigenvalues at finitely many primes third we compute the nlevel density of degree 4 spinor lfunctions and thus we can distinguish the symmetry type depending on the root numbers this is conditional on certain conjecture on root numbers fourth we consider equidistribution of paramodular forms in this case we can prove a result on root numbers main tools are the equidistribution theorem in our previous work and shintempliers work | [['this', 'paper', 'is', 'a', 'continuation', 'of', 'the', 'authors', 'previous', 'wotk', 'we', 'supplement', 'four', 'results', 'on', 'a', 'family', 'of', 'holomorphic', 'siegel', 'cusp', 'forms', 'for', 'gsp_4mathbbq', 'first', 'we', 'improve', 'the', 'result', 'on', 'hecke', 'fields', 'namely', 'we', 'prove', 'that', 'the', 'degree', 'of', 'hecke', 'fields', 'is', 'unbounded', 'on', 'the', 'subspace', 'of', 'genuine', 'forms', 'which', 'do', 'not', 'come', 'from', 'functorial', 'lift', 'of', 'smaller', 'subgroups', 'of', 'gsp_4', 'under', 'a', 'conjecture', 'in', 'localglobal', 'compatibility', 'and', 'arthurs', 'classification', 'for', 'gsp_4', 'second', 'we', 'prove', 'simultaneous', 'vertical', 'satotate', 'theorem', 'namely', 'we', 'prove', 'simultaneous', 'equidistribution', 'of', 'hecke', 'eigenvalues', 'at', 'finitely', 'many', 'primes', 'third', 'we', 'compute', 'the', 'nlevel', 'density', 'of', 'degree', '4', 'spinor', 'lfunctions', 'and', 'thus', 'we', 'can', 'distinguish', 'the', 'symmetry', 'type', 'depending', 'on', 'the', 'root', 'numbers', 'this', 'is', 'conditional', 'on', 'certain', 'conjecture', 'on', 'root', 'numbers', 'fourth', 'we', 'consider', 'equidistribution', 'of', 'paramodular', 'forms', 'in', 'this', 'case', 'we', 'can', 'prove', 'a', 'result', 'on', 'root', 'numbers', 'main', 'tools', 'are', 'the', 'equidistribution', 'theorem', 'in', 'our', 'previous', 'work', 'and', 'shintempliers', 'work']] | [-0.2370016867613518, 0.04928639914387053, -0.13022463916384272, 0.0686950010069842, -0.08670266622089241, -0.09122874642918377, 0.007589923659811336, 0.2749019715457076, -0.27276871955683946, -0.24197607097755136, 0.0727657009701943, -0.2480287610148815, -0.17233441625170312, 0.24703128632743182, -0.15488544464307397, 0.022513486420441615, 0.06206730341134397, 0.11318797207633524, -0.08226658324374032, -0.3237394250724097, 0.4285133193541122, -0.06709871488917422, 0.2372761269836797, 0.09371238783741749, 0.05362538078272911, 0.03592878498755837, -0.0003822701646162099, -0.1185490038325569, -0.15864844260742852, 0.177658299625986, 0.2561931962692669, 0.07308716046636139, 0.24966929557635203, -0.38093308238373874, -0.10605428534740656, 0.19726364996198467, 0.14190653004487486, 0.06085109691929048, -0.0029062739853734933, -0.2452146429737025, 0.11628857719571035, -0.16741083934615936, -0.20312698990547737, -0.10594206691204913, -0.023550168156170434, 0.04155098085634803, -0.27100700230680796, 0.07234301723503067, 0.1463171059773518, 0.17402148226545633, -0.08464411737115465, -0.14639851000270268, 0.01132723517366685, 0.06315825734361026, 0.047625836123571436, -0.013324422253246763, 0.0637835040267275, -0.07851752008489137, -0.13497663969725468, 0.3058426513188782, -0.055918103696680384, -0.19636259396486966, 0.1448660467285663, -0.19960872531794993, -0.2646260082010964, 0.04344667516201489, 0.16037444551597888, 0.1321324308243531, 0.0034242960269023712, 0.14340076039087235, -0.1593751498432156, 0.09579705494750095, 0.17865815921380235, -0.0453265888997856, 0.129568296925802, 0.02137266067591937, 0.104513436844986, 0.13861356936793431, -0.031720452186786326, -0.03267457661422668, -0.3513390763393162, -0.22199262646762163, -0.17319895864439835, 0.13591628521537227, -0.09703922287783491, -0.15103695060641162, 0.4194239032773399, 0.1312908548141805, 0.1781081720837392, 0.17088577038636063, 0.21277409787657425, 0.11688633042917661, 0.06943375122194227, 0.03116708144692606, 0.15498633556815453, 0.20918341749376468, -0.03117019283327911, -0.11714194485581461, -0.014228404514908203, 0.21317341256623254] |
1,802.09971 | Real-World Repetition Estimation by Div, Grad and Curl | We consider the problem of estimating repetition in video, such as performing
push-ups, cutting a melon or playing violin. Existing work shows good results
under the assumption of static and stationary periodicity. As realistic video
is rarely perfectly static and stationary, the often preferred Fourier-based
measurements is inapt. Instead, we adopt the wavelet transform to better handle
non-static and non-stationary video dynamics. From the flow field and its
differentials, we derive three fundamental motion types and three motion
continuities of intrinsic periodicity in 3D. On top of this, the 2D perception
of 3D periodicity considers two extreme viewpoints. What follows are 18
fundamental cases of recurrent perception in 2D. In practice, to deal with the
variety of repetitive appearance, our theory implies measuring time-varying
flow and its differentials (gradient, divergence and curl) over segmented
foreground motion. For experiments, we introduce the new QUVA Repetition
dataset, reflecting reality by including non-static and non-stationary videos.
On the task of counting repetitions in video, we obtain favorable results
compared to a deep learning alternative.
| cs.CV | we consider the problem of estimating repetition in video such as performing pushups cutting a melon or playing violin existing work shows good results under the assumption of static and stationary periodicity as realistic video is rarely perfectly static and stationary the often preferred fourierbased measurements is inapt instead we adopt the wavelet transform to better handle nonstatic and nonstationary video dynamics from the flow field and its differentials we derive three fundamental motion types and three motion continuities of intrinsic periodicity in 3d on top of this the 2d perception of 3d periodicity considers two extreme viewpoints what follows are 18 fundamental cases of recurrent perception in 2d in practice to deal with the variety of repetitive appearance our theory implies measuring timevarying flow and its differentials gradient divergence and curl over segmented foreground motion for experiments we introduce the new quva repetition dataset reflecting reality by including nonstatic and nonstationary videos on the task of counting repetitions in video we obtain favorable results compared to a deep learning alternative | [['we', 'consider', 'the', 'problem', 'of', 'estimating', 'repetition', 'in', 'video', 'such', 'as', 'performing', 'pushups', 'cutting', 'a', 'melon', 'or', 'playing', 'violin', 'existing', 'work', 'shows', 'good', 'results', 'under', 'the', 'assumption', 'of', 'static', 'and', 'stationary', 'periodicity', 'as', 'realistic', 'video', 'is', 'rarely', 'perfectly', 'static', 'and', 'stationary', 'the', 'often', 'preferred', 'fourierbased', 'measurements', 'is', 'inapt', 'instead', 'we', 'adopt', 'the', 'wavelet', 'transform', 'to', 'better', 'handle', 'nonstatic', 'and', 'nonstationary', 'video', 'dynamics', 'from', 'the', 'flow', 'field', 'and', 'its', 'differentials', 'we', 'derive', 'three', 'fundamental', 'motion', 'types', 'and', 'three', 'motion', 'continuities', 'of', 'intrinsic', 'periodicity', 'in', '3d', 'on', 'top', 'of', 'this', 'the', '2d', 'perception', 'of', '3d', 'periodicity', 'considers', 'two', 'extreme', 'viewpoints', 'what', 'follows', 'are', '18', 'fundamental', 'cases', 'of', 'recurrent', 'perception', 'in', '2d', 'in', 'practice', 'to', 'deal', 'with', 'the', 'variety', 'of', 'repetitive', 'appearance', 'our', 'theory', 'implies', 'measuring', 'timevarying', 'flow', 'and', 'its', 'differentials', 'gradient', 'divergence', 'and', 'curl', 'over', 'segmented', 'foreground', 'motion', 'for', 'experiments', 'we', 'introduce', 'the', 'new', 'quva', 'repetition', 'dataset', 'reflecting', 'reality', 'by', 'including', 'nonstatic', 'and', 'nonstationary', 'videos', 'on', 'the', 'task', 'of', 'counting', 'repetitions', 'in', 'video', 'we', 'obtain', 'favorable', 'results', 'compared', 'to', 'a', 'deep', 'learning', 'alternative']] | [-0.10588784805787284, 0.04995451398315795, -0.0715557710408862, 0.07017460957285948, -0.08935562687526856, -0.14969607452595873, -0.015924163570854858, 0.4361160006706736, -0.27246649640506976, -0.31298184370999005, 0.10650814938223145, -0.24805543999121124, -0.16488681492046453, 0.19162437508791863, -0.1704546898448219, 0.08296726477385077, 0.07222014714387201, 0.04675633065718492, -0.054950979976205246, -0.2201627819609019, 0.3089519264827859, -0.00977617959714345, 0.34296159132749643, -0.020793307173118506, 0.12080344335187138, 0.04558514950830223, -0.09024495867751761, 0.019564611419495816, -0.07771578007183659, 0.12885780340695333, 0.22920525529687957, 0.12027545438442237, 0.24828094423061148, -0.43209627884235013, -0.2230209811657135, 0.05486261987105189, 0.12501438936894937, 0.0932254000564128, -0.06265655823786108, -0.29730025172189234, 0.09229080697904075, -0.108201174021122, -0.061419526914722244, -0.10148568005145837, 0.012940289636303316, 0.0056962156827683515, -0.2736957244120449, 0.10133037143636361, 0.0768396399022701, 0.08824777787750852, -0.10830064523837618, -0.06566187741589688, 0.03753810712286005, 0.17821278667127313, 0.08148670632189828, 0.035472847507446115, 0.12666667771381548, -0.17878971999605364, -0.12699186443101748, 0.41548288610231665, -0.07780008275724304, -0.23153917248626904, 0.21492621862229758, -0.1174928376622986, -0.11880070911276908, 0.11709616620681204, 0.18834295739153667, 0.14687781267899222, -0.13529029699774192, 0.007642117783515936, -0.058876344662470124, 0.13738493726954662, 0.12238770129763343, 0.017245992036848855, 0.2090245028264776, 0.17949271704336361, 0.047973951994901565, 0.15002753846402767, -0.13688559881466927, -0.12721994208792844, -0.24765291982441254, -0.10743400243864883, -0.1419861818195343, 0.0391211383657286, -0.11675382990021414, -0.1852376106405808, 0.4086921629454342, 0.17024244292406365, 0.1687693446250965, 0.0455213724801849, 0.3255676060271937, 0.05144903287319245, 0.012549919374231692, 0.061000365846709995, 0.18947864222268218, 0.05304522912843995, 0.13328379862373585, -0.1781380152027677, 0.025423810811757687, 0.06063245911389545] |
1,802.09972 | Fusion of Multispectral Data Through Illumination-aware Deep Neural
Networks for Pedestrian Detection | Multispectral pedestrian detection has received extensive attention in recent
years as a promising solution to facilitate robust human target detection for
around-the-clock applications (e.g. security surveillance and autonomous
driving). In this paper, we demonstrate illumination information encoded in
multispectral images can be utilized to significantly boost performance of
pedestrian detection. A novel illumination-aware weighting mechanism is present
to accurately depict illumination condition of a scene. Such illumination
information is incorporated into two-stream deep convolutional neural networks
to learn multispectral human-related features under different illumination
conditions (daytime and nighttime). Moreover, we utilized illumination
information together with multispectral data to generate more accurate semantic
segmentation which are used to boost pedestrian detection accuracy. Putting all
of the pieces together, we present a powerful framework for multispectral
pedestrian detection based on multi-task learning of illumination-aware
pedestrian detection and semantic segmentation. Our proposed method is trained
end-to-end using a well-designed multi-task loss function and outperforms
state-of-the-art approaches on KAIST multispectral pedestrian dataset.
| cs.CV | multispectral pedestrian detection has received extensive attention in recent years as a promising solution to facilitate robust human target detection for aroundtheclock applications eg security surveillance and autonomous driving in this paper we demonstrate illumination information encoded in multispectral images can be utilized to significantly boost performance of pedestrian detection a novel illuminationaware weighting mechanism is present to accurately depict illumination condition of a scene such illumination information is incorporated into twostream deep convolutional neural networks to learn multispectral humanrelated features under different illumination conditions daytime and nighttime moreover we utilized illumination information together with multispectral data to generate more accurate semantic segmentation which are used to boost pedestrian detection accuracy putting all of the pieces together we present a powerful framework for multispectral pedestrian detection based on multitask learning of illuminationaware pedestrian detection and semantic segmentation our proposed method is trained endtoend using a welldesigned multitask loss function and outperforms stateoftheart approaches on kaist multispectral pedestrian dataset | [['multispectral', 'pedestrian', 'detection', 'has', 'received', 'extensive', 'attention', 'in', 'recent', 'years', 'as', 'a', 'promising', 'solution', 'to', 'facilitate', 'robust', 'human', 'target', 'detection', 'for', 'aroundtheclock', 'applications', 'eg', 'security', 'surveillance', 'and', 'autonomous', 'driving', 'in', 'this', 'paper', 'we', 'demonstrate', 'illumination', 'information', 'encoded', 'in', 'multispectral', 'images', 'can', 'be', 'utilized', 'to', 'significantly', 'boost', 'performance', 'of', 'pedestrian', 'detection', 'a', 'novel', 'illuminationaware', 'weighting', 'mechanism', 'is', 'present', 'to', 'accurately', 'depict', 'illumination', 'condition', 'of', 'a', 'scene', 'such', 'illumination', 'information', 'is', 'incorporated', 'into', 'twostream', 'deep', 'convolutional', 'neural', 'networks', 'to', 'learn', 'multispectral', 'humanrelated', 'features', 'under', 'different', 'illumination', 'conditions', 'daytime', 'and', 'nighttime', 'moreover', 'we', 'utilized', 'illumination', 'information', 'together', 'with', 'multispectral', 'data', 'to', 'generate', 'more', 'accurate', 'semantic', 'segmentation', 'which', 'are', 'used', 'to', 'boost', 'pedestrian', 'detection', 'accuracy', 'putting', 'all', 'of', 'the', 'pieces', 'together', 'we', 'present', 'a', 'powerful', 'framework', 'for', 'multispectral', 'pedestrian', 'detection', 'based', 'on', 'multitask', 'learning', 'of', 'illuminationaware', 'pedestrian', 'detection', 'and', 'semantic', 'segmentation', 'our', 'proposed', 'method', 'is', 'trained', 'endtoend', 'using', 'a', 'welldesigned', 'multitask', 'loss', 'function', 'and', 'outperforms', 'stateoftheart', 'approaches', 'on', 'kaist', 'multispectral', 'pedestrian', 'dataset']] | [-0.03995171157109752, -0.05957678346629432, -0.11234572513067294, 0.04220803461278512, -0.13814502430614084, -0.21542095580680556, -0.04678895659420545, 0.5090319829981161, -0.20452715037980035, -0.3330837694951628, 0.07628935086025114, -0.2632052200386607, -0.20653511752386258, 0.20564549416598357, -0.25375573061512713, 0.14815299703939994, 0.18855531038598547, 0.0471931849584231, -0.03566831309949579, -0.25039784382156366, 0.23260652326501294, 0.03804942531510451, 0.4030157660334548, 0.0797133662298033, 0.20022992273760204, -0.017245623367084073, -0.05686269152859415, -0.026053437647775193, -0.03029603336545745, 0.18914336922926286, 0.37324290359952733, 0.22677580479980458, 0.28517039799237553, -0.4366226381021021, -0.31912175578925805, 0.05129440047459889, 0.14448698458644557, 0.0799203600382279, -0.09260247175368448, -0.45846455996926827, 0.08039105941594543, -0.17998992059898528, 0.0667378297547185, -0.15541830992906744, -0.0344840412498216, -0.05054200098509429, -0.33022472073097087, 0.035221519518961915, 0.027903515589128756, 0.08573946769974089, -0.06824929500293411, -0.07186388456604526, 0.038609473389879904, 0.19967751687280597, 0.0038463169844420273, 0.048222942785448336, 0.18945436276306835, -0.2594626602135404, -0.10432339545127146, 0.3633785452929479, -0.08479621616940757, -0.21338037581807828, 0.2022489462993874, 0.02022384329186163, -0.1398497252898951, 0.15823242452313913, 0.2889567705967664, 0.15286210338036896, -0.1901511804412909, -0.12494061265547489, -0.06587872685951326, 0.18644072028478206, 0.10239608168212956, 0.04411772452000104, 0.19179846868552622, 0.3358044677378633, 0.07144002128418983, 0.13404122337660623, -0.2768724885197427, -0.007047439031995526, -0.13630288297493198, -0.07434578597185694, -0.16402086564207072, -0.04485902830566386, -0.07005131816568112, -0.08356029005499065, 0.4245088987783352, 0.31255021499458085, 0.18559417454525828, 0.08308385876729447, 0.4294702251076321, 0.0020964753746255476, 0.1269404627824839, 0.06743472199179704, 0.1622193433739292, -0.04839861048628647, 0.14300497682010638, -0.1577984311439604, 0.07857469153882275, 0.08499669207737463] |
1,802.09973 | A Cascade Leading to the Emergence of Small Structures in Vortex Ring
Collisions | When vortex rings collide head-on at high enough Reynolds numbers, they
ultimately annihilate through a violent interaction which breaks down their
cores into a turbulent cloud. We experimentally show that this very strong
interaction, which leads to the production of fluid motion at very fine scales,
uncovers direct evidence of a novel iterative cascade of instabilities in a
bulk fluid. When the coherent vortex cores approach each other, they deform
into tent-like structures, and the mutual strain causes them to locally flatten
into extremely thin vortex sheets. These sheets then break down into smaller
secondary vortex filaments, which themselves rapidly flatten and break down
into even smaller tertiary filaments. By performing numerical simulations of
the full Navier-Stokes equations, we also resolve one iteration of this
instability and highlight the subtle role that viscosity must play in the
rupturing of a vortex sheet. The concurrence of this observed iterative cascade
of instabilities over various scales with those of recent theoretical
predictions could provide a new mechanistic framework in which the evolution of
turbulent flows can be examined in real-time as a series of discrete dynamic
instabilities.
| physics.flu-dyn | when vortex rings collide headon at high enough reynolds numbers they ultimately annihilate through a violent interaction which breaks down their cores into a turbulent cloud we experimentally show that this very strong interaction which leads to the production of fluid motion at very fine scales uncovers direct evidence of a novel iterative cascade of instabilities in a bulk fluid when the coherent vortex cores approach each other they deform into tentlike structures and the mutual strain causes them to locally flatten into extremely thin vortex sheets these sheets then break down into smaller secondary vortex filaments which themselves rapidly flatten and break down into even smaller tertiary filaments by performing numerical simulations of the full navierstokes equations we also resolve one iteration of this instability and highlight the subtle role that viscosity must play in the rupturing of a vortex sheet the concurrence of this observed iterative cascade of instabilities over various scales with those of recent theoretical predictions could provide a new mechanistic framework in which the evolution of turbulent flows can be examined in realtime as a series of discrete dynamic instabilities | [['when', 'vortex', 'rings', 'collide', 'headon', 'at', 'high', 'enough', 'reynolds', 'numbers', 'they', 'ultimately', 'annihilate', 'through', 'a', 'violent', 'interaction', 'which', 'breaks', 'down', 'their', 'cores', 'into', 'a', 'turbulent', 'cloud', 'we', 'experimentally', 'show', 'that', 'this', 'very', 'strong', 'interaction', 'which', 'leads', 'to', 'the', 'production', 'of', 'fluid', 'motion', 'at', 'very', 'fine', 'scales', 'uncovers', 'direct', 'evidence', 'of', 'a', 'novel', 'iterative', 'cascade', 'of', 'instabilities', 'in', 'a', 'bulk', 'fluid', 'when', 'the', 'coherent', 'vortex', 'cores', 'approach', 'each', 'other', 'they', 'deform', 'into', 'tentlike', 'structures', 'and', 'the', 'mutual', 'strain', 'causes', 'them', 'to', 'locally', 'flatten', 'into', 'extremely', 'thin', 'vortex', 'sheets', 'these', 'sheets', 'then', 'break', 'down', 'into', 'smaller', 'secondary', 'vortex', 'filaments', 'which', 'themselves', 'rapidly', 'flatten', 'and', 'break', 'down', 'into', 'even', 'smaller', 'tertiary', 'filaments', 'by', 'performing', 'numerical', 'simulations', 'of', 'the', 'full', 'navierstokes', 'equations', 'we', 'also', 'resolve', 'one', 'iteration', 'of', 'this', 'instability', 'and', 'highlight', 'the', 'subtle', 'role', 'that', 'viscosity', 'must', 'play', 'in', 'the', 'rupturing', 'of', 'a', 'vortex', 'sheet', 'the', 'concurrence', 'of', 'this', 'observed', 'iterative', 'cascade', 'of', 'instabilities', 'over', 'various', 'scales', 'with', 'those', 'of', 'recent', 'theoretical', 'predictions', 'could', 'provide', 'a', 'new', 'mechanistic', 'framework', 'in', 'which', 'the', 'evolution', 'of', 'turbulent', 'flows', 'can', 'be', 'examined', 'in', 'realtime', 'as', 'a', 'series', 'of', 'discrete', 'dynamic', 'instabilities']] | [-0.17435835941090574, 0.1998546987771988, -0.13034851238433573, 0.08912182859006665, -0.07346735354009512, -0.1187067086577126, 0.00912510967951872, 0.3355171450690643, -0.3221969725362755, -0.2884267369889327, 0.05566562237218022, -0.2146678449334325, -0.08525989930195785, 0.1593071914001091, 0.04722416676027147, 0.013236816393563876, 0.07376343153505209, -0.06374017306638101, -0.02999283641488669, -0.19616367036250193, 0.28591648116896584, 0.07035175956080894, 0.27837443097016296, 0.03409718013009862, 0.0688853742819078, -0.09237576383795287, -0.0024253778521449785, 0.06495654892925223, -0.16150083571862794, 0.054560537797373694, 0.22163360741153057, 0.009145943948848023, 0.2932653265526971, -0.5517150361795683, -0.21666556504504705, 0.036360509181395176, 0.24003711703400177, 0.12380219874966487, -0.03146485646091703, -0.24994876355536885, 0.09398093088152441, -0.1691245165426989, -0.12753933548574914, -0.08463701493282978, 0.02248368502116284, 0.03862949472826881, -0.22552726944260348, 0.1258028275193332, 0.09483628988870092, 0.02406667262768826, -0.061137324824576844, -0.029868744112349844, -0.08550120331032353, 0.08639470372015509, 0.08686312579902242, 0.0017973906801057023, 0.1875691202494341, -0.17142138377310256, -0.04208161041417436, 0.3943028457966205, -0.006400143835265693, -0.1460490276533607, 0.22644003093796405, -0.14919833375040342, -0.11880358853754965, 0.22576757011733747, 0.19553511462920042, 0.08556562821959725, -0.05724232390639372, -0.037405852034901946, -0.03095841773257062, 0.13970445294210032, 0.10617460711179554, -0.010816419487063949, 0.31701494312366924, 0.18449095138600347, 0.045946312376071476, 0.13286119295391127, -0.09665216893489423, -0.11074020084547433, -0.2689307417569531, -0.13812800290226634, -0.09435550124334122, 0.044514871509651326, -0.0869162646697274, -0.16685388859462094, 0.33794199800924274, 0.13723753244691603, 0.23331554891286746, 0.0077480096823057615, 0.3010824409338671, 0.07451265005306719, 0.1137035078280983, 0.08928075318249899, 0.2562486448048337, 0.12534199903177953, 0.11767594171507045, -0.23400086097268236, 0.005785403256556271, 0.046895690472494506] |
1,802.09974 | Some improvements of Jordan-Steckin and Becker-Stark inequalities | The aim of this article is to give some improvements of Jordan-Steckin and
Becker-Stark inequalities discussed in [1].
| math.CA | the aim of this article is to give some improvements of jordansteckin and beckerstark inequalities discussed in 1 | [['the', 'aim', 'of', 'this', 'article', 'is', 'to', 'give', 'some', 'improvements', 'of', 'jordansteckin', 'and', 'beckerstark', 'inequalities', 'discussed', 'in', '1']] | [-0.10588919504216927, 0.03466374470907099, -0.04731863133116242, 0.09883014441413038, -0.04497535592492889, -0.10107396049972843, 0.012612466755158761, 0.3092155618702664, -0.22378537069786997, -0.27556638507282033, 0.16999633228817188, -0.28291220804128575, -0.1702578960753539, 0.21220029485138023, -0.18179577194592533, 0.023759288384633905, 0.02074967253514949, 0.02806064530330546, -0.09665326560463976, -0.36437668958131003, 0.33829622934846315, 0.05054491221466485, 0.14761461018968156, 0.1893143366803141, 0.03794133493348079, -0.05435827377197497, -0.0859815734644037, -0.01345961431370062, -0.27536431415116086, 0.24510054876480034, 0.2987172417342663, 0.18836203403770924, 0.29620014350203905, -0.3921563569456339, -0.09902356649913333, 0.1093772382420652, 0.12467873603215113, 0.052974532851401496, -0.07982059562688365, -0.22143939627772746, 0.09311947314178243, -0.14203704104704015, -0.17906714080120711, -0.062386845402857834, 0.020658207619014907, 0.08441407912794281, -0.21378238964825869, 0.047531364869107216, 0.1638364906915847, 0.06512980936232078, -0.03369059314889669, -0.15932444532347076, 0.15815762583823764, 0.06799826543668613, 0.09957507508806884, 0.060365623712320536, -0.0015123782898573315, -0.06137826347120983, -0.14068659405936212, 0.36747462214792476, -0.016550627098802256, -0.21144927249235265, 0.14957053373184273, -0.1560950384968344, -0.20387897026889465, 0.03469920147429494, 0.14083289305734284, 0.0808415338397026, -0.1848246042671449, 0.07491646424579598, -0.004587248844258925, 0.06053943647181287, 0.04070498854579294, 0.08876079890657873, 0.03246109669699388, 0.1414103620849988, 0.09604940119692508, 0.192859991453588, -0.04334721013027079, -0.039543098770082, -0.40603555563618154, -0.2432406115181306, -0.11922371792880927, 0.03821214578826638, -0.04000260973921018, -0.07671025088604759, 0.43526701760642666, 0.22580493022413814, 0.21303674666320577, 0.05687097832560539, 0.20380611564306653, 0.06536961275645915, -0.04256543276064536, -0.0019285426036838222, 0.26170985782279305, 0.19068795815110207, 0.1312362382955411, -0.12975316738490672, 0.021596246508552748, 0.037526458981173] |
1,802.09975 | Mono-Camera 3D Multi-Object Tracking Using Deep Learning Detections and
PMBM Filtering | Monocular cameras are one of the most commonly used sensors in the automotive
industry for autonomous vehicles. One major drawback using a monocular camera
is that it only makes observations in the two dimensional image plane and can
not directly measure the distance to objects. In this paper, we aim at filling
this gap by developing a multi-object tracking algorithm that takes an image as
input and produces trajectories of detected objects in a world coordinate
system. We solve this by using a deep neural network trained to detect and
estimate the distance to objects from a single input image. The detections from
a sequence of images are fed in to a state-of-the art Poisson multi-Bernoulli
mixture tracking filter. The combination of the learned detector and the PMBM
filter results in an algorithm that achieves 3D tracking using only mono-camera
images as input. The performance of the algorithm is evaluated both in 3D world
coordinates, and 2D image coordinates, using the publicly available KITTI
object tracking dataset. The algorithm shows the ability to accurately track
objects, correctly handle data associations, even when there is a big overlap
of the objects in the image, and is one of the top performing algorithms on the
KITTI object tracking benchmark. Furthermore, the algorithm is efficient,
running on average close to 20 frames per second.
| cs.CV eess.SP | monocular cameras are one of the most commonly used sensors in the automotive industry for autonomous vehicles one major drawback using a monocular camera is that it only makes observations in the two dimensional image plane and can not directly measure the distance to objects in this paper we aim at filling this gap by developing a multiobject tracking algorithm that takes an image as input and produces trajectories of detected objects in a world coordinate system we solve this by using a deep neural network trained to detect and estimate the distance to objects from a single input image the detections from a sequence of images are fed in to a stateofthe art poisson multibernoulli mixture tracking filter the combination of the learned detector and the pmbm filter results in an algorithm that achieves 3d tracking using only monocamera images as input the performance of the algorithm is evaluated both in 3d world coordinates and 2d image coordinates using the publicly available kitti object tracking dataset the algorithm shows the ability to accurately track objects correctly handle data associations even when there is a big overlap of the objects in the image and is one of the top performing algorithms on the kitti object tracking benchmark furthermore the algorithm is efficient running on average close to 20 frames per second | [['monocular', 'cameras', 'are', 'one', 'of', 'the', 'most', 'commonly', 'used', 'sensors', 'in', 'the', 'automotive', 'industry', 'for', 'autonomous', 'vehicles', 'one', 'major', 'drawback', 'using', 'a', 'monocular', 'camera', 'is', 'that', 'it', 'only', 'makes', 'observations', 'in', 'the', 'two', 'dimensional', 'image', 'plane', 'and', 'can', 'not', 'directly', 'measure', 'the', 'distance', 'to', 'objects', 'in', 'this', 'paper', 'we', 'aim', 'at', 'filling', 'this', 'gap', 'by', 'developing', 'a', 'multiobject', 'tracking', 'algorithm', 'that', 'takes', 'an', 'image', 'as', 'input', 'and', 'produces', 'trajectories', 'of', 'detected', 'objects', 'in', 'a', 'world', 'coordinate', 'system', 'we', 'solve', 'this', 'by', 'using', 'a', 'deep', 'neural', 'network', 'trained', 'to', 'detect', 'and', 'estimate', 'the', 'distance', 'to', 'objects', 'from', 'a', 'single', 'input', 'image', 'the', 'detections', 'from', 'a', 'sequence', 'of', 'images', 'are', 'fed', 'in', 'to', 'a', 'stateofthe', 'art', 'poisson', 'multibernoulli', 'mixture', 'tracking', 'filter', 'the', 'combination', 'of', 'the', 'learned', 'detector', 'and', 'the', 'pmbm', 'filter', 'results', 'in', 'an', 'algorithm', 'that', 'achieves', '3d', 'tracking', 'using', 'only', 'monocamera', 'images', 'as', 'input', 'the', 'performance', 'of', 'the', 'algorithm', 'is', 'evaluated', 'both', 'in', '3d', 'world', 'coordinates', 'and', '2d', 'image', 'coordinates', 'using', 'the', 'publicly', 'available', 'kitti', 'object', 'tracking', 'dataset', 'the', 'algorithm', 'shows', 'the', 'ability', 'to', 'accurately', 'track', 'objects', 'correctly', 'handle', 'data', 'associations', 'even', 'when', 'there', 'is', 'a', 'big', 'overlap', 'of', 'the', 'objects', 'in', 'the', 'image', 'and', 'is', 'one', 'of', 'the', 'top', 'performing', 'algorithms', 'on', 'the', 'kitti', 'object', 'tracking', 'benchmark', 'furthermore', 'the', 'algorithm', 'is', 'efficient', 'running', 'on', 'average', 'close', 'to', '20', 'frames', 'per', 'second']] | [-0.06924324950381873, -0.020619215664313684, -0.08343721907038022, 0.035898726831750764, -0.06581124275442364, -0.16096718551178055, -0.008824422608900866, 0.4538752383371284, -0.23497093747827177, -0.37904573426628274, 0.10287382492028616, -0.3060980697933635, -0.13974718651360288, 0.20851016018805157, -0.15428168604959527, 0.08369247785061429, 0.1690536342725596, 0.06308324052425464, -0.03866342022357618, -0.2599982034849062, 0.26852602106245127, 0.0447755322202448, 0.2773500688846025, -0.06003788683344336, 0.19021907960205883, -0.0002045500191240424, -0.035519303909894835, 0.007060639399558946, -0.0141899187303961, 0.14434915024900968, 0.2897298236659884, 0.1739256807742008, 0.2497868725347303, -0.3731282921887226, -0.1651020652880024, 0.06751434177969376, 0.1472119666568564, 0.09690620654212033, -0.03818824880849148, -0.3718688919617714, 0.08435271531359263, -0.128417848018883, -0.03895204333268207, -0.047458844250953036, -0.004627517785885418, -0.004532400453863539, -0.26969911108779554, 0.01609244607220408, 0.011956229993475103, 0.046819667135917356, -0.0823201865528824, -0.07797058156061479, 0.01115347713872588, 0.20890015643050502, -0.011573395617011243, 0.08724167150639132, 0.16896253223825938, -0.20921412031303874, -0.11096965294590481, 0.39794670323086945, -0.06058079767150476, -0.21554638211598526, 0.19203647473675295, -0.08745115107068649, -0.11459708721398026, 0.1636459237213217, 0.21982122103028354, 0.1577102137514605, -0.171931925427068, 0.02153553747481401, -0.05756464387328107, 0.21182965163596615, 0.05512919145998676, -0.04156657041065506, 0.1821739962867069, 0.22849890342239307, 0.06885300607450003, 0.13956332495920698, -0.2380630341121438, -0.06307088158028074, -0.21832381673072931, -0.13820593775675644, -0.246475653543255, -0.06150127873471274, -0.08119882171411527, -0.1444934079490973, 0.3874279384783625, 0.24437618515284615, 0.230080714727419, 0.055149695060081036, 0.41204067800042316, 0.02123104350123032, 0.11865955617513751, 0.0916061557732455, 0.20946295763896905, 0.008990227999123513, 0.11524594473211111, -0.14003454546280295, 0.04517502237187184, 0.08356361036208391] |
1,802.09976 | Flavor fluctuations in 3-level quantum dots: Generic SU(3)-Kondo fixed
point in equilibrium and non-Kondo fixed points in nonequilibrium | We study a $3$-level quantum dot in the singly occupied cotunneling regime
coupled via a generic tunneling matrix to several multi-channel leads in
equilibrium or nonequilibrium. We derive an effective model where also each
reservoir has three channels labelled by the quark flavors $u$, $d$ and $s$
with an effective d.o.s. polarized w.r.t. an eight-dimensional $F$-spin
corresponding to the eight generators of $SU(3)$. In equilibrium we perform a
standard poor man scaling analysis and show that tunneling via virtual
intermediate states induces flavor fluctuations on the dot which become
$SU(3)$-symmetric at a characteristic and exponentially small low-energy scale
$T_K$. Using the numerical renormalization group (NRG) we study in detail the
linear conductance and confirm the $SU(3)$-symmetric Kondo fixed point with
universal conductance $G=2.25 e^2/h$ for various tunneling setups by tuning the
level spacings on the dot. In contrast to the equilibrium case, we find in
nonequilibrium that the fixed point model is not $SU(3)$-symmetric but
characterized by rotated $F$-spins for each reservoir with total vanishing sum.
At large voltage we analyse the $F$-spin magnetization and the current in
golden rule as function of a magnetic field for the isospin of the up/down
quark and the level spacing to the strange quark. As a smoking gun to detect
the nonequilibrium fixed point we find that the curve of zero $F$-spin
magnetization has a particular shape on the dot parameters. We propose that our
findings can be generalized to the case of quantum dots with an arbitrary
number $N$ of levels.
| cond-mat.mes-hall | we study a 3level quantum dot in the singly occupied cotunneling regime coupled via a generic tunneling matrix to several multichannel leads in equilibrium or nonequilibrium we derive an effective model where also each reservoir has three channels labelled by the quark flavors u d and s with an effective dos polarized wrt an eightdimensional fspin corresponding to the eight generators of su3 in equilibrium we perform a standard poor man scaling analysis and show that tunneling via virtual intermediate states induces flavor fluctuations on the dot which become su3symmetric at a characteristic and exponentially small lowenergy scale t_k using the numerical renormalization group nrg we study in detail the linear conductance and confirm the su3symmetric kondo fixed point with universal conductance g225 e2h for various tunneling setups by tuning the level spacings on the dot in contrast to the equilibrium case we find in nonequilibrium that the fixed point model is not su3symmetric but characterized by rotated fspins for each reservoir with total vanishing sum at large voltage we analyse the fspin magnetization and the current in golden rule as function of a magnetic field for the isospin of the updown quark and the level spacing to the strange quark as a smoking gun to detect the nonequilibrium fixed point we find that the curve of zero fspin magnetization has a particular shape on the dot parameters we propose that our findings can be generalized to the case of quantum dots with an arbitrary number n of levels | [['we', 'study', 'a', '3level', 'quantum', 'dot', 'in', 'the', 'singly', 'occupied', 'cotunneling', 'regime', 'coupled', 'via', 'a', 'generic', 'tunneling', 'matrix', 'to', 'several', 'multichannel', 'leads', 'in', 'equilibrium', 'or', 'nonequilibrium', 'we', 'derive', 'an', 'effective', 'model', 'where', 'also', 'each', 'reservoir', 'has', 'three', 'channels', 'labelled', 'by', 'the', 'quark', 'flavors', 'u', 'd', 'and', 's', 'with', 'an', 'effective', 'dos', 'polarized', 'wrt', 'an', 'eightdimensional', 'fspin', 'corresponding', 'to', 'the', 'eight', 'generators', 'of', 'su3', 'in', 'equilibrium', 'we', 'perform', 'a', 'standard', 'poor', 'man', 'scaling', 'analysis', 'and', 'show', 'that', 'tunneling', 'via', 'virtual', 'intermediate', 'states', 'induces', 'flavor', 'fluctuations', 'on', 'the', 'dot', 'which', 'become', 'su3symmetric', 'at', 'a', 'characteristic', 'and', 'exponentially', 'small', 'lowenergy', 'scale', 't_k', 'using', 'the', 'numerical', 'renormalization', 'group', 'nrg', 'we', 'study', 'in', 'detail', 'the', 'linear', 'conductance', 'and', 'confirm', 'the', 'su3symmetric', 'kondo', 'fixed', 'point', 'with', 'universal', 'conductance', 'g225', 'e2h', 'for', 'various', 'tunneling', 'setups', 'by', 'tuning', 'the', 'level', 'spacings', 'on', 'the', 'dot', 'in', 'contrast', 'to', 'the', 'equilibrium', 'case', 'we', 'find', 'in', 'nonequilibrium', 'that', 'the', 'fixed', 'point', 'model', 'is', 'not', 'su3symmetric', 'but', 'characterized', 'by', 'rotated', 'fspins', 'for', 'each', 'reservoir', 'with', 'total', 'vanishing', 'sum', 'at', 'large', 'voltage', 'we', 'analyse', 'the', 'fspin', 'magnetization', 'and', 'the', 'current', 'in', 'golden', 'rule', 'as', 'function', 'of', 'a', 'magnetic', 'field', 'for', 'the', 'isospin', 'of', 'the', 'updown', 'quark', 'and', 'the', 'level', 'spacing', 'to', 'the', 'strange', 'quark', 'as', 'a', 'smoking', 'gun', 'to', 'detect', 'the', 'nonequilibrium', 'fixed', 'point', 'we', 'find', 'that', 'the', 'curve', 'of', 'zero', 'fspin', 'magnetization', 'has', 'a', 'particular', 'shape', 'on', 'the', 'dot', 'parameters', 'we', 'propose', 'that', 'our', 'findings', 'can', 'be', 'generalized', 'to', 'the', 'case', 'of', 'quantum', 'dots', 'with', 'an', 'arbitrary', 'number', 'n', 'of', 'levels']] | [-0.14843830388359022, 0.19933164765614259, -0.07556794638801348, 0.047504162654795144, 0.0245741214387254, -0.1942268502438486, 0.10330860286851548, 0.3347499740897723, -0.24283825065621414, -0.2577206969426404, 0.023105868467433947, -0.29165569283401466, -0.09920750862746049, 0.1459792478839987, 0.013035584464594121, 0.021770510835208808, 0.017571998292565224, 0.04483212316746733, -0.07840735243676576, -0.20568988562632923, 0.325010844772952, 0.0037253335960427177, 0.2738237385300078, 0.08435562951865816, 0.07460440351485065, 0.026621043342240757, 0.05820260415109055, 0.020431985264651537, -0.1167841672399992, 0.019126921088524883, 0.21690066095564567, -0.033550838902292233, 0.19095936241454534, -0.40878133305663905, -0.1497264370808543, 0.09223217215772057, 0.15508283335328732, 0.1388552481136773, -0.0249992619393461, -0.2587591145326564, 0.07954285574716426, -0.18499006051570177, -0.14503260266463902, -0.09937361946785747, 0.006930790557582382, -0.007990397937030666, -0.28629700256316293, 0.06581013043086709, -0.0009941779909798155, 0.06353050976195523, -0.00019662753179398997, -0.12606732867613074, -0.03944571149927909, 0.09563410261022998, 0.027730648190857122, 0.03950655673073807, 0.16377514308213345, -0.13407090800577745, -0.11762783738067223, 0.3434001113355701, -0.11532531001590073, -0.18386455317733869, 0.1586311545942144, -0.18472656262700535, -0.11015105419210158, 0.09436988345846804, 0.11508300683025512, 0.09439630003462005, -0.13884929644653662, 0.11909712496309376, -0.05901753700773923, 0.16680387047580875, 0.043298842310304606, 0.023175782809454586, 0.2366358218015164, 0.16106193410063674, 0.06748938089003786, 0.13625977230549324, -0.11973903589269837, -0.12850223496770335, -0.31567365990110463, -0.12106609530371404, -0.1808556589699771, 0.12212041728983627, -0.0885523852772284, -0.18093174808253085, 0.40859804729810884, 0.12222330876055264, 0.23575326546204217, 0.01073060011267737, 0.2659996067429142, 0.17905824956617453, 0.04881361096857056, 0.07156288639018912, 0.18308877716340394, 0.1469270086625681, 0.06542702783988188, -0.3209860647987244, -0.02655204382139228, 0.046936391399339625] |
1,802.09977 | Identifying groups of variables with the potential of being large
simultaneously | Identifying groups of variables that may be large simultaneously amounts to
finding out which joint tail dependence coefficients of a multivariate
distribution are positive. The asymptotic distribution of a vector of
nonparametric, rank-based estimators of these coefficients justifies a stopping
criterion in an algorithm that searches the collection of all possible groups
of variables in a systematic way, from smaller groups to larger ones. The issue
that the tolerance level in the stopping criterion should depend on the size of
the groups is circumvented by the use of a conditional tail dependence
coefficient. Alternatively, such stopping criteria can be based on limit
distributions of rank-based estimators of the coefficient of tail dependence,
quantifying the speed of decay of joint survival functions. Numerical
experiments indicate that the algorithm's effectiveness for detecting
tail-dependent groups of variables is highest when paired with a criterion
based on a Hill-type estimator of the coefficient of tail dependence.
| stat.ME | identifying groups of variables that may be large simultaneously amounts to finding out which joint tail dependence coefficients of a multivariate distribution are positive the asymptotic distribution of a vector of nonparametric rankbased estimators of these coefficients justifies a stopping criterion in an algorithm that searches the collection of all possible groups of variables in a systematic way from smaller groups to larger ones the issue that the tolerance level in the stopping criterion should depend on the size of the groups is circumvented by the use of a conditional tail dependence coefficient alternatively such stopping criteria can be based on limit distributions of rankbased estimators of the coefficient of tail dependence quantifying the speed of decay of joint survival functions numerical experiments indicate that the algorithms effectiveness for detecting taildependent groups of variables is highest when paired with a criterion based on a hilltype estimator of the coefficient of tail dependence | [['identifying', 'groups', 'of', 'variables', 'that', 'may', 'be', 'large', 'simultaneously', 'amounts', 'to', 'finding', 'out', 'which', 'joint', 'tail', 'dependence', 'coefficients', 'of', 'a', 'multivariate', 'distribution', 'are', 'positive', 'the', 'asymptotic', 'distribution', 'of', 'a', 'vector', 'of', 'nonparametric', 'rankbased', 'estimators', 'of', 'these', 'coefficients', 'justifies', 'a', 'stopping', 'criterion', 'in', 'an', 'algorithm', 'that', 'searches', 'the', 'collection', 'of', 'all', 'possible', 'groups', 'of', 'variables', 'in', 'a', 'systematic', 'way', 'from', 'smaller', 'groups', 'to', 'larger', 'ones', 'the', 'issue', 'that', 'the', 'tolerance', 'level', 'in', 'the', 'stopping', 'criterion', 'should', 'depend', 'on', 'the', 'size', 'of', 'the', 'groups', 'is', 'circumvented', 'by', 'the', 'use', 'of', 'a', 'conditional', 'tail', 'dependence', 'coefficient', 'alternatively', 'such', 'stopping', 'criteria', 'can', 'be', 'based', 'on', 'limit', 'distributions', 'of', 'rankbased', 'estimators', 'of', 'the', 'coefficient', 'of', 'tail', 'dependence', 'quantifying', 'the', 'speed', 'of', 'decay', 'of', 'joint', 'survival', 'functions', 'numerical', 'experiments', 'indicate', 'that', 'the', 'algorithms', 'effectiveness', 'for', 'detecting', 'taildependent', 'groups', 'of', 'variables', 'is', 'highest', 'when', 'paired', 'with', 'a', 'criterion', 'based', 'on', 'a', 'hilltype', 'estimator', 'of', 'the', 'coefficient', 'of', 'tail', 'dependence']] | [-0.0999765622147702, 0.09295212888968021, -0.17748783780016789, 0.08059147042130414, -0.07340253367223531, -0.10579547438292618, 0.09020948919198035, 0.3561905615865008, -0.24986983896968396, -0.28224056090939004, 0.10306071171362419, -0.26242184226009013, -0.10532608886224855, 0.20231294585851414, -0.051665520130068456, 0.06884207104571703, 0.023783874167987194, 0.020808658354278458, -0.07568980175902222, -0.27633909957091274, 0.3079501016258483, 0.09982451788566418, 0.30835438380017877, 0.011077770499947579, 0.09811261334858787, 0.030277110804730143, -0.07883848548303113, 0.031621787629678454, -0.10253796332280647, 0.12215748030422746, 0.21412352627100373, 0.13436163714351623, 0.32211195832841394, -0.32328684265284163, -0.18769524520106834, 0.1576127580942978, 0.13702443719069524, 0.043837747618549895, -0.012555375192038665, -0.24798788984557368, 0.08146765443349355, -0.16903950127016287, -0.12024662588526935, -0.05831790240604038, 0.0383412900968994, 0.08179494102583512, -0.33777487224065944, 0.1558077657085194, 0.05286232705724327, 0.061096237286141046, -0.03495269830301894, -0.1726906517777886, 0.02511869046812583, 0.09775766970740637, 0.10950060570796363, -0.07896579479424154, 0.14439609478607676, -0.15474798976241513, -0.10895355329021665, 0.3113291388757429, -0.07051776933918805, -0.22701256134773998, 0.149280271908011, -0.1734634673400586, -0.15402439289946893, 0.1388850189579994, 0.20872958637406364, 0.14828051434903355, -0.16041872299808202, 0.032795356721372196, -0.062164625618606806, 0.15084844344834747, 0.048034603071803426, 0.030916251198696523, 0.1742136424811753, 0.1235229241413579, 0.10554900841778267, 0.12954378245079792, -0.08990888831996065, -0.051673163140979965, -0.33465294498264003, -0.1411176778553789, -0.20245165468000587, 0.006985084617841302, -0.1700349622130345, -0.18538426316962087, 0.3792348765081873, 0.14569076373606404, 0.24025360815300556, 0.10408383016980033, 0.22561775785059007, 0.14418987002787426, 0.05147165735460428, 0.05471273631127061, 0.16654773053290373, 0.1381329952216076, -0.038216918746720216, -0.2129611209522026, 0.17433728126956052, 0.06806702125744012] |
1,802.09978 | Topological field theory on r-spin surfaces and the Arf invariant | We give a combinatorial model for r-spin surfaces with parametrised boundary
based on Novak (2015). The r-spin structure is encoded in terms of
$\mathbb{Z}_r$-valued indices assigned to the edges of a polygonal
decomposition. This combinatorial model is designed for our state sum
construction of two-dimensional topological field theories on r-spin surfaces.
We show that an example of such a topological field theory computes the
Arf-invariant of an r-spin surface as introduced in Geiges, Gonzalo (2012) and
Randal-Williams (2014). This implies in particular that the r-spin
Arf-invariant is constant on orbits of the mapping class group, providing an
alternative proof of that fact.
| math.QA hep-th math-ph math.GT math.MP | we give a combinatorial model for rspin surfaces with parametrised boundary based on novak 2015 the rspin structure is encoded in terms of mathbbz_rvalued indices assigned to the edges of a polygonal decomposition this combinatorial model is designed for our state sum construction of twodimensional topological field theories on rspin surfaces we show that an example of such a topological field theory computes the arfinvariant of an rspin surface as introduced in geiges gonzalo 2012 and randalwilliams 2014 this implies in particular that the rspin arfinvariant is constant on orbits of the mapping class group providing an alternative proof of that fact | [['we', 'give', 'a', 'combinatorial', 'model', 'for', 'rspin', 'surfaces', 'with', 'parametrised', 'boundary', 'based', 'on', 'novak', '2015', 'the', 'rspin', 'structure', 'is', 'encoded', 'in', 'terms', 'of', 'mathbbz_rvalued', 'indices', 'assigned', 'to', 'the', 'edges', 'of', 'a', 'polygonal', 'decomposition', 'this', 'combinatorial', 'model', 'is', 'designed', 'for', 'our', 'state', 'sum', 'construction', 'of', 'twodimensional', 'topological', 'field', 'theories', 'on', 'rspin', 'surfaces', 'we', 'show', 'that', 'an', 'example', 'of', 'such', 'a', 'topological', 'field', 'theory', 'computes', 'the', 'arfinvariant', 'of', 'an', 'rspin', 'surface', 'as', 'introduced', 'in', 'geiges', 'gonzalo', '2012', 'and', 'randalwilliams', '2014', 'this', 'implies', 'in', 'particular', 'that', 'the', 'rspin', 'arfinvariant', 'is', 'constant', 'on', 'orbits', 'of', 'the', 'mapping', 'class', 'group', 'providing', 'an', 'alternative', 'proof', 'of', 'that', 'fact']] | [-0.16207764546921716, 0.07777801479629615, -0.12486183326138128, 0.06068102930243689, -0.08506171053072603, -0.09263931285350187, 0.010657911939260615, 0.3012513067056932, -0.2436196423864158, -0.297778514776342, 0.06268385220157664, -0.2162048121047492, -0.229494718364486, 0.20362062496767094, -0.15363831512427123, 0.008106066191385703, 0.011721285368952125, 0.017001534831747045, -0.043491902196230045, -0.27091847606104713, 0.35525068615581656, -0.00043770179410677147, 0.24079928617223656, 0.08005360403273365, 0.1143474123569777, 0.050438845590088925, -0.0058123799511185376, 0.032924808094987996, -0.1812062857955398, 0.17854620233676075, 0.22376851943588935, 0.07264439413084252, 0.13676491038329752, -0.3962208067371261, -0.19566517033225783, 0.08622917618215231, 0.06769415985857423, 0.06360712794974299, -0.04917557909969462, -0.27247352588294754, 0.07559570480635998, -0.153496416257971, -0.13393500091572577, -0.07452453217367724, 0.06253035188800111, -0.025296178803142933, -0.23838887349639024, -0.010877525352637772, 0.0720391759284689, 0.10191342096296277, -0.08105973400277003, -0.09407160349079582, -0.059999997407142625, 0.06300961157989383, -0.009275139576875337, 0.08509972737179977, 0.03832569955341002, -0.11488961867324196, -0.17218524821582112, 0.3497101636695685, -0.06404912493901678, -0.1944555599463753, 0.1561426646767719, -0.07799514602537792, -0.18078268225775054, 0.10319509054764663, 0.12346775262699564, 0.18553859530256525, -0.05730104636421685, 0.18565361631404848, -0.14741815916045872, 0.11779365867450095, 0.0834435343391972, -0.022509316282143983, 0.18894131433006633, 0.11691647959126178, 0.09256892383045581, 0.15807687647128937, -0.03120524151767097, -0.07740507426090759, -0.35149283391322095, -0.22292405248666874, -0.18205119441678325, 0.09331604250301008, -0.0871214913479502, -0.2586025307784871, 0.41560295307178896, 0.06385913282623606, 0.20748784955093028, 0.08914995097582883, 0.20354082296362683, 0.09602434243453611, 0.02928323578781052, 0.06305771320597223, 0.16824364245726295, 0.1629131470373509, -0.005047028971891297, -0.13890365808556723, -0.016742271468006442, 0.21621653032811858] |
1,802.09979 | The Emergence of Spectral Universality in Deep Networks | Recent work has shown that tight concentration of the entire spectrum of
singular values of a deep network's input-output Jacobian around one at
initialization can speed up learning by orders of magnitude. Therefore, to
guide important design choices, it is important to build a full theoretical
understanding of the spectra of Jacobians at initialization. To this end, we
leverage powerful tools from free probability theory to provide a detailed
analytic understanding of how a deep network's Jacobian spectrum depends on
various hyperparameters including the nonlinearity, the weight and bias
distributions, and the depth. For a variety of nonlinearities, our work reveals
the emergence of new universal limiting spectral distributions that remain
concentrated around one even as the depth goes to infinity.
| stat.ML cs.LG | recent work has shown that tight concentration of the entire spectrum of singular values of a deep networks inputoutput jacobian around one at initialization can speed up learning by orders of magnitude therefore to guide important design choices it is important to build a full theoretical understanding of the spectra of jacobians at initialization to this end we leverage powerful tools from free probability theory to provide a detailed analytic understanding of how a deep networks jacobian spectrum depends on various hyperparameters including the nonlinearity the weight and bias distributions and the depth for a variety of nonlinearities our work reveals the emergence of new universal limiting spectral distributions that remain concentrated around one even as the depth goes to infinity | [['recent', 'work', 'has', 'shown', 'that', 'tight', 'concentration', 'of', 'the', 'entire', 'spectrum', 'of', 'singular', 'values', 'of', 'a', 'deep', 'networks', 'inputoutput', 'jacobian', 'around', 'one', 'at', 'initialization', 'can', 'speed', 'up', 'learning', 'by', 'orders', 'of', 'magnitude', 'therefore', 'to', 'guide', 'important', 'design', 'choices', 'it', 'is', 'important', 'to', 'build', 'a', 'full', 'theoretical', 'understanding', 'of', 'the', 'spectra', 'of', 'jacobians', 'at', 'initialization', 'to', 'this', 'end', 'we', 'leverage', 'powerful', 'tools', 'from', 'free', 'probability', 'theory', 'to', 'provide', 'a', 'detailed', 'analytic', 'understanding', 'of', 'how', 'a', 'deep', 'networks', 'jacobian', 'spectrum', 'depends', 'on', 'various', 'hyperparameters', 'including', 'the', 'nonlinearity', 'the', 'weight', 'and', 'bias', 'distributions', 'and', 'the', 'depth', 'for', 'a', 'variety', 'of', 'nonlinearities', 'our', 'work', 'reveals', 'the', 'emergence', 'of', 'new', 'universal', 'limiting', 'spectral', 'distributions', 'that', 'remain', 'concentrated', 'around', 'one', 'even', 'as', 'the', 'depth', 'goes', 'to', 'infinity']] | [-0.07259354771072553, 0.04262059841936162, -0.11127629924627129, 0.0646627661733588, -0.08887297203687351, -0.14067703412753368, 0.04276962130241989, 0.3756567445114132, -0.27364296175939734, -0.2903455481749059, 0.08252738923034515, -0.24013353619447425, -0.16710417413668446, 0.2239526262937868, -0.06273113677474432, 0.07811146407026878, 0.06454309687972808, 0.031585942567297264, -0.08963576111411445, -0.2553657214513264, 0.342748594381808, 0.09258865326795003, 0.30547513537232046, 0.06333719700774994, 0.09434572606364819, 0.003933897726853524, -0.007039085392309121, -0.013561269807175171, -0.1343434017363499, 0.1752594506718249, 0.2628882908039103, 0.12076552579764369, 0.31318823881601254, -0.38752211616490007, -0.24779172661937465, 0.1069702945903621, 0.16244139424756107, 0.10168352166252319, -0.012809639208765378, -0.21379528855827967, 0.0728958406397103, -0.134168660429822, -0.16770014215707163, -0.13034789445078818, 0.030230080920525572, 0.030950158992243453, -0.24913920108074986, 0.024358997109907965, 0.07730288798766873, 0.05523893262513659, -0.022358551648376156, -0.13139737773809798, -0.007599533280580928, 0.15815899197458605, 0.041317654517671665, 0.02228508579875689, 0.13784358213647954, -0.19311487793052676, -0.06664356455199175, 0.3038601150663092, -0.05611914025873623, -0.1315384647416428, 0.19369225781834262, -0.12159192533239968, -0.14285010306841947, 0.14862138512044037, 0.20435479577546092, 0.10908921779141076, -0.1078197598488124, 0.07564071796676683, -0.004601686180777048, 0.18241193493412547, 0.054464452942806364, 0.03747542085095255, 0.2001195863920672, 0.19541845622295437, 0.08258541518329712, 0.11740043948689276, -0.07812836236890006, -0.08408926924582848, -0.2819759741748783, -0.10513677237139753, -0.1715259231369142, 0.1038464099584409, -0.118081917258678, -0.1662293963049142, 0.457109601937296, 0.19214359350687216, 0.26978477157560016, 0.08077547735388367, 0.3060328232101357, 0.10629055322694385, 0.08164640656895628, 0.059233997086417085, 0.22830472878095778, 0.13919440000933742, 0.09651341905417152, -0.16611729746045592, 0.07165419172966075, 0.03167587913349579] |
1,802.0998 | Nematicity and magnetism in LaFeAsO single crystals probed by $^{75}$As
nuclear magnetic resonance | We report a $^{75}$As nuclear magnetic resonance study in LaFeAsO single
crystals, which undergoes nematic and antiferromagnetic transitions at
$T_\text{nem}\sim 156$ K and $T_N \sim 138$ K, respectively. Below
$T_\text{nem}$, the $^{75}$As spectrum splits sharply into two for an external
magnetic field parallel to the orthorhombic $a$ or $b$ axis in the FeAs planes.
Our analysis of the data demonstrates that the NMR line splitting arises from
an electronically driven rotational symmetry breaking. The $^{75}$As
spin-lattice relaxation rate as a function of temperature shows that spin
fluctuations are strongly enhanced just below $T_\text{nem}$. These NMR
findings indicate that nematic order promotes spin fluctuations in magnetically
ordered LaFeAsO, as observed in non-magnetic and superconducting FeSe. We
conclude that the origin of nematicity is identical in both FeSe and LaFeAsO
regardless of whether or not a long range magnetic order develops in the
nematic state.
| cond-mat.str-el | we report a 75as nuclear magnetic resonance study in lafeaso single crystals which undergoes nematic and antiferromagnetic transitions at t_textnemsim 156 k and t_n sim 138 k respectively below t_textnem the 75as spectrum splits sharply into two for an external magnetic field parallel to the orthorhombic a or b axis in the feas planes our analysis of the data demonstrates that the nmr line splitting arises from an electronically driven rotational symmetry breaking the 75as spinlattice relaxation rate as a function of temperature shows that spin fluctuations are strongly enhanced just below t_textnem these nmr findings indicate that nematic order promotes spin fluctuations in magnetically ordered lafeaso as observed in nonmagnetic and superconducting fese we conclude that the origin of nematicity is identical in both fese and lafeaso regardless of whether or not a long range magnetic order develops in the nematic state | [['we', 'report', 'a', '75as', 'nuclear', 'magnetic', 'resonance', 'study', 'in', 'lafeaso', 'single', 'crystals', 'which', 'undergoes', 'nematic', 'and', 'antiferromagnetic', 'transitions', 'at', 't_textnemsim', '156', 'k', 'and', 't_n', 'sim', '138', 'k', 'respectively', 'below', 't_textnem', 'the', '75as', 'spectrum', 'splits', 'sharply', 'into', 'two', 'for', 'an', 'external', 'magnetic', 'field', 'parallel', 'to', 'the', 'orthorhombic', 'a', 'or', 'b', 'axis', 'in', 'the', 'feas', 'planes', 'our', 'analysis', 'of', 'the', 'data', 'demonstrates', 'that', 'the', 'nmr', 'line', 'splitting', 'arises', 'from', 'an', 'electronically', 'driven', 'rotational', 'symmetry', 'breaking', 'the', '75as', 'spinlattice', 'relaxation', 'rate', 'as', 'a', 'function', 'of', 'temperature', 'shows', 'that', 'spin', 'fluctuations', 'are', 'strongly', 'enhanced', 'just', 'below', 't_textnem', 'these', 'nmr', 'findings', 'indicate', 'that', 'nematic', 'order', 'promotes', 'spin', 'fluctuations', 'in', 'magnetically', 'ordered', 'lafeaso', 'as', 'observed', 'in', 'nonmagnetic', 'and', 'superconducting', 'fese', 'we', 'conclude', 'that', 'the', 'origin', 'of', 'nematicity', 'is', 'identical', 'in', 'both', 'fese', 'and', 'lafeaso', 'regardless', 'of', 'whether', 'or', 'not', 'a', 'long', 'range', 'magnetic', 'order', 'develops', 'in', 'the', 'nematic', 'state']] | [-0.22715830895384506, 0.28917926664518223, -0.0012544878958059209, -0.009492281008611566, -0.05038902641806219, -0.11586740594523559, 0.08847186042528067, 0.4187988630096827, -0.26693531454407743, -0.2788236063106784, -0.009498070092273077, -0.344046477926895, -0.06526365442134972, 0.14426749871511543, 0.1316296886386616, -0.05725067465100438, -0.10081720945558377, 0.022971481876447798, -0.16438485721092938, -0.20156353833236998, 0.25458896230640155, -0.012776726899236174, 0.32504160378926567, 0.08116683824919164, 0.01080533564839113, -0.0033479454522291363, 0.18830652435842368, -0.009915397770237177, -0.1522560493631837, -0.02386164016622518, 0.29631531038321557, -0.07740030538822923, 0.17636778238894685, -0.3928681300620415, -0.185962092475633, 0.0036461575738420443, 0.1685156858625955, 0.13880233220739424, -0.06655973315771137, -0.27347751330318193, 0.05226397464450981, -0.09531219751973237, -0.0919016200787155, -0.14286979640268588, -0.05607213279415321, -0.024755386979502095, -0.2570841215451115, 0.17585653318009073, 0.1514540060240376, 0.19300649750512094, -0.17616820621104645, -0.15378117177835002, -0.057887483675897654, -0.02715964183111542, 0.10497768392420508, 0.14667305811142017, 0.193759798422356, -0.054142871366015505, -0.1360750970364149, 0.3337497029253947, -0.05996646484127268, 0.01824761960223051, 0.12015178417786956, -0.2470127236181205, -0.13670591529059622, 0.2117107911767172, 0.10022065345235336, 0.09037480274814048, -0.09317677421495318, 0.036844956869858184, -0.012458318711391516, 0.2913677220498877, -0.009835370430456741, 0.04803531429497525, 0.2689348894570555, 0.17945070730721843, 0.03397099734949214, 0.1561404809621828, -0.1619506749158193, -0.059500771701069814, -0.20325433507096022, -0.139771987639168, -0.20798774616559967, 0.07236385175586163, -0.07352898715887152, -0.17856273164507003, 0.36419277020696816, 0.11816003254747816, 0.2282196168056024, -0.1123413167270233, 0.2074029199812295, 0.030883948520723997, 0.06041598696735621, 0.056848509982228276, 0.25949602496776997, 0.21621949207869226, 0.1346019437137459, -0.3658920271937469, 0.07104817004541733, -0.03795369326253421] |
1,802.09981 | Spanning trees in a Claw-free graph whose stems have at most $k$ branch
vertices | Let $T$ be a tree, a vertex of degree one and a vertex of degree at least
three is called a leaf and a branch vertex, respectively. The set of leaves of
$T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem
of $T$ and denoted by $Stem(T).$ In this paper, we give two sufficient
conditions for a connected claw-free graph to have a spanning tree whose stem
has a bounded number of branch vertices, and those conditions are best
possible. As corollaries of main results we also give some conditions to show
that a connected claw-free graph has a spanning tree whose stem is a spider.
| math.CO | let t be a tree a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex respectively the set of leaves of t is denoted by leaft the subtree tleaft of t is called the stem of t and denoted by stemt in this paper we give two sufficient conditions for a connected clawfree graph to have a spanning tree whose stem has a bounded number of branch vertices and those conditions are best possible as corollaries of main results we also give some conditions to show that a connected clawfree graph has a spanning tree whose stem is a spider | [['let', 't', 'be', 'a', 'tree', 'a', 'vertex', 'of', 'degree', 'one', 'and', 'a', 'vertex', 'of', 'degree', 'at', 'least', 'three', 'is', 'called', 'a', 'leaf', 'and', 'a', 'branch', 'vertex', 'respectively', 'the', 'set', 'of', 'leaves', 'of', 't', 'is', 'denoted', 'by', 'leaft', 'the', 'subtree', 'tleaft', 'of', 't', 'is', 'called', 'the', 'stem', 'of', 't', 'and', 'denoted', 'by', 'stemt', 'in', 'this', 'paper', 'we', 'give', 'two', 'sufficient', 'conditions', 'for', 'a', 'connected', 'clawfree', 'graph', 'to', 'have', 'a', 'spanning', 'tree', 'whose', 'stem', 'has', 'a', 'bounded', 'number', 'of', 'branch', 'vertices', 'and', 'those', 'conditions', 'are', 'best', 'possible', 'as', 'corollaries', 'of', 'main', 'results', 'we', 'also', 'give', 'some', 'conditions', 'to', 'show', 'that', 'a', 'connected', 'clawfree', 'graph', 'has', 'a', 'spanning', 'tree', 'whose', 'stem', 'is', 'a', 'spider']] | [-0.17466188500704313, 0.17866137867396767, -0.07372761481976206, -0.005920563549605302, -0.1205379535267302, -0.1345671018352732, 0.07226743210102776, 0.35404970555531756, -0.2753545081068296, -0.2864556811465364, 0.11962292169940796, -0.29972465386338254, -0.16935143944014003, 0.133569111297321, -0.08295630412693653, -0.03906792137530391, 0.12098521884116861, 0.1659652007209068, 0.03535019622035583, -0.25541543711625747, 0.34377415109257625, -0.05075136123708001, 0.14486129245617324, 0.1020852181698299, 0.17623011943780714, -0.028396845825395926, 0.0033243006392796007, 0.11810475480699635, -0.16426380337637697, 0.061060456796204324, 0.24428476472557695, 0.2032645926853918, 0.2685405485745933, -0.3507511470018438, -0.14742598678330304, 0.187363458698167, 0.1168055843035863, 0.03695904047883771, 0.0103513997444814, -0.14517299051362056, 0.1816688238091215, -0.1163258089415009, -0.12235594873264846, 0.03365771072330298, 0.06102945345143477, -0.003200796553520141, -0.2916085483092401, -0.03272863478573358, 0.0981475756055227, 0.04155626961599208, 0.07926731493703469, -0.1793050119843058, -0.10231207880510569, 0.11235290514822635, -0.08870137176752367, 0.12173141410177643, 0.018538719301836357, -0.1223226117500518, -0.19367088843137026, 0.35352552777880597, -0.028346249756092828, -0.13516366713964897, 0.18007751285201973, -0.1268471801843218, -0.1774082499064712, 0.10493957248723342, 0.11107770697627631, 0.16163301593796522, -0.18351139968123148, 0.12735794131704434, -0.09697313267841107, 0.053928355479405984, 0.14391096770608178, 0.0015188042738440413, 0.13519939509030707, 0.20904086887215576, 0.17154825118551445, 0.18182038104579853, -0.016171087183196237, 0.05031415845075605, -0.3209868067211506, -0.10428757673448504, -0.20500506341664326, 0.05336640620845611, -0.1372720471069139, -0.22490871163016116, 0.46514816985776025, 0.06432155203246684, 0.24802375372706187, 0.12050380017953338, 0.20012771807335042, 0.07894082069442784, 0.08203592378628889, 0.12569112576440805, 0.1007405104844818, 0.1991786858394604, -0.03542519440115602, -0.1499713874525494, 0.07338211175347506, 0.14809562900592466] |
1,802.09982 | Towards an equivalence between maximal entanglement and maximal quantum
nonlocality | While all bipartite pure entangled states are known to generate correlations
violating a Bell inequality, and are therefore nonlocal, the quantitative
relation between pure-state entanglement and nonlocality is poorly understood.
In fact, some Bell inequalities are maximally violated by non-maximally
entangled states and this phenomenon is also observed for other operational
measures of nonlocality. In this work, we study a recently proposed measure of
nonlocality defined as the probability that a pure state displays nonlocal
correlations when subjected to random measurements. We first prove that this
measure satisfies some natural properties for an operational measure of
nonlocality. Then, we show that for pure states of two qubits the measure is
monotonic with entanglement for all correlation two-outcome Bell inequalities:
for all these inequalities, the more the state is entangled, the larger the
probability to violate them when random measurements are performed. Finally, we
extend our results to the multipartite setting.
| quant-ph | while all bipartite pure entangled states are known to generate correlations violating a bell inequality and are therefore nonlocal the quantitative relation between purestate entanglement and nonlocality is poorly understood in fact some bell inequalities are maximally violated by nonmaximally entangled states and this phenomenon is also observed for other operational measures of nonlocality in this work we study a recently proposed measure of nonlocality defined as the probability that a pure state displays nonlocal correlations when subjected to random measurements we first prove that this measure satisfies some natural properties for an operational measure of nonlocality then we show that for pure states of two qubits the measure is monotonic with entanglement for all correlation twooutcome bell inequalities for all these inequalities the more the state is entangled the larger the probability to violate them when random measurements are performed finally we extend our results to the multipartite setting | [['while', 'all', 'bipartite', 'pure', 'entangled', 'states', 'are', 'known', 'to', 'generate', 'correlations', 'violating', 'a', 'bell', 'inequality', 'and', 'are', 'therefore', 'nonlocal', 'the', 'quantitative', 'relation', 'between', 'purestate', 'entanglement', 'and', 'nonlocality', 'is', 'poorly', 'understood', 'in', 'fact', 'some', 'bell', 'inequalities', 'are', 'maximally', 'violated', 'by', 'nonmaximally', 'entangled', 'states', 'and', 'this', 'phenomenon', 'is', 'also', 'observed', 'for', 'other', 'operational', 'measures', 'of', 'nonlocality', 'in', 'this', 'work', 'we', 'study', 'a', 'recently', 'proposed', 'measure', 'of', 'nonlocality', 'defined', 'as', 'the', 'probability', 'that', 'a', 'pure', 'state', 'displays', 'nonlocal', 'correlations', 'when', 'subjected', 'to', 'random', 'measurements', 'we', 'first', 'prove', 'that', 'this', 'measure', 'satisfies', 'some', 'natural', 'properties', 'for', 'an', 'operational', 'measure', 'of', 'nonlocality', 'then', 'we', 'show', 'that', 'for', 'pure', 'states', 'of', 'two', 'qubits', 'the', 'measure', 'is', 'monotonic', 'with', 'entanglement', 'for', 'all', 'correlation', 'twooutcome', 'bell', 'inequalities', 'for', 'all', 'these', 'inequalities', 'the', 'more', 'the', 'state', 'is', 'entangled', 'the', 'larger', 'the', 'probability', 'to', 'violate', 'them', 'when', 'random', 'measurements', 'are', 'performed', 'finally', 'we', 'extend', 'our', 'results', 'to', 'the', 'multipartite', 'setting']] | [-0.11245801150410746, 0.21267291692483317, -0.09256841503083706, 0.13382661250497524, 0.0111970910957704, -0.2385822757675002, 0.036569047681987286, 0.3414577297043676, -0.22995951385630178, -0.26162164902314544, 0.04889827015964935, -0.32880024979511896, -0.10438769566516082, 0.1776272652884169, -0.05723825352421651, 0.13268796210798126, 0.05185227684987088, 0.020733481865997116, -0.08230903999259075, -0.2633147252878795, 0.3550179756168897, -0.03066876461477174, 0.29488765773673853, 0.08091585867106915, 0.054656996329625444, -0.005890681042025486, 0.022165974881500006, 0.05432547154137865, -0.12223207926916074, 0.09688959496755463, 0.2586014481183762, 0.20189102915891757, 0.25367549327823025, -0.39793987181037666, -0.1910138281652083, 0.17299129616857195, 0.047511650734813886, 0.13959005867596716, 0.003865206095215399, -0.3565920082107186, 0.003671770623574654, -0.15406267069901028, -0.11701173673383891, -0.15027263494208454, 0.04271771239116788, -0.047969510635593904, -0.2933179110164444, 0.1630914930360935, 0.08980214968634148, 0.018847682361956684, 0.0034069274831563232, -0.01872881029887746, -0.006437047619062166, 0.08828881178245258, -0.037255425707747536, -0.02617168420770516, 0.07504747995485862, -0.08882485311750012, -0.19692483972408809, 0.3033884378429502, -0.029542279011026646, -0.24726908800842162, 0.17498719457769765, -0.1850886061321944, -0.18765460865416875, -0.005775086792806784, 0.08913463992377123, 0.1124159998105218, -0.16302232471391714, -0.008560727978668485, -0.11844878687833746, 0.16162771481089294, 0.06932594900950789, 0.20087584379129111, 0.11303363371330002, 0.02939997924802204, 0.13474412327011426, 0.22447471638093702, -0.025256905734422616, -0.13547077821257214, -0.35916679435720045, -0.21354343595293662, -0.2672459921403788, 0.10091126385610551, -0.06636798272811575, -0.09270002535854777, 0.35763951152563095, 0.11031407198635862, 0.1339771969942376, 0.0697886781906709, 0.21590149440181752, 0.10157645402631411, 0.03550834494177252, 0.06082631839827324, 0.296736456437114, 0.1873241933947429, 0.04305760431898913, -0.20099228919949383, 0.12213977987412364, -0.011483829674931863] |
1,802.09983 | Multi-messenger gamma-ray counterpart of the IceCube neutrino signal | A signal of high-energy extraterrestrial neutrinos from unknown source(s) was
recently discovered by the IceCube experiment. Neutrinos are always produced
together with gamma-rays, but the gamma-ray flux from extragalactic sources is
suppressed due to attenuation in the intergalactic medium. We report the
discovery of a gamma-ray excess at high Galactic latitudes starting at energies
300 GeV in the data of the Fermi telescope. We show that the multi-TeV
gamma-ray diffuse emission has spectral characteristics at both low and high
Galactic latitudes compatible with those of the IceCube high neutrino signal in
the same sky regions. This suggests that these gamma-rays are the counterpart
of the IceCube neutrino signal, implying that a sizable part of the IceCube
neutrino flux originates from the Milky Way. We argue that the diffuse neutrino
and gamma-ray signal at high Galactic latitudes originates either from
previously unknown nearby cosmic ray "PeVatron" source(s), an extended Galactic
CR halo or from decays of heavy dark matter particles.
| astro-ph.HE hep-ph | a signal of highenergy extraterrestrial neutrinos from unknown sources was recently discovered by the icecube experiment neutrinos are always produced together with gammarays but the gammaray flux from extragalactic sources is suppressed due to attenuation in the intergalactic medium we report the discovery of a gammaray excess at high galactic latitudes starting at energies 300 gev in the data of the fermi telescope we show that the multitev gammaray diffuse emission has spectral characteristics at both low and high galactic latitudes compatible with those of the icecube high neutrino signal in the same sky regions this suggests that these gammarays are the counterpart of the icecube neutrino signal implying that a sizable part of the icecube neutrino flux originates from the milky way we argue that the diffuse neutrino and gammaray signal at high galactic latitudes originates either from previously unknown nearby cosmic ray pevatron sources an extended galactic cr halo or from decays of heavy dark matter particles | [['a', 'signal', 'of', 'highenergy', 'extraterrestrial', 'neutrinos', 'from', 'unknown', 'sources', 'was', 'recently', 'discovered', 'by', 'the', 'icecube', 'experiment', 'neutrinos', 'are', 'always', 'produced', 'together', 'with', 'gammarays', 'but', 'the', 'gammaray', 'flux', 'from', 'extragalactic', 'sources', 'is', 'suppressed', 'due', 'to', 'attenuation', 'in', 'the', 'intergalactic', 'medium', 'we', 'report', 'the', 'discovery', 'of', 'a', 'gammaray', 'excess', 'at', 'high', 'galactic', 'latitudes', 'starting', 'at', 'energies', '300', 'gev', 'in', 'the', 'data', 'of', 'the', 'fermi', 'telescope', 'we', 'show', 'that', 'the', 'multitev', 'gammaray', 'diffuse', 'emission', 'has', 'spectral', 'characteristics', 'at', 'both', 'low', 'and', 'high', 'galactic', 'latitudes', 'compatible', 'with', 'those', 'of', 'the', 'icecube', 'high', 'neutrino', 'signal', 'in', 'the', 'same', 'sky', 'regions', 'this', 'suggests', 'that', 'these', 'gammarays', 'are', 'the', 'counterpart', 'of', 'the', 'icecube', 'neutrino', 'signal', 'implying', 'that', 'a', 'sizable', 'part', 'of', 'the', 'icecube', 'neutrino', 'flux', 'originates', 'from', 'the', 'milky', 'way', 'we', 'argue', 'that', 'the', 'diffuse', 'neutrino', 'and', 'gammaray', 'signal', 'at', 'high', 'galactic', 'latitudes', 'originates', 'either', 'from', 'previously', 'unknown', 'nearby', 'cosmic', 'ray', 'pevatron', 'sources', 'an', 'extended', 'galactic', 'cr', 'halo', 'or', 'from', 'decays', 'of', 'heavy', 'dark', 'matter', 'particles']] | [-0.06409662343274639, 0.2618529329863677, -0.025627912356043763, 0.22081789077968342, -0.12508258317983798, -0.02220878171377212, 0.04822436093466954, 0.4011776848174866, -0.20411956669622153, -0.3683882021936793, -0.04383640406790933, -0.3943769110003545, 0.026553288554632157, 0.22412800267426614, 0.058863093754358636, -0.07640922884163945, 0.04919716459552541, -0.07299361191689968, -0.003303402267490168, -0.1991211539866555, 0.2659397605695299, 0.22014164682419138, 0.1941118982456531, 0.03779357364518369, 0.1465636457810061, -0.12415765214758287, -0.09546078952415935, -0.10755043647855332, -0.018794155478478944, 0.02399254354367138, 0.26835964180810273, 0.10783640174312317, 0.058534075443064736, -0.3815333772064099, -0.27878410107918883, 0.19936574842054514, 0.16739213742819503, 0.032180991246359154, -0.13359985111424783, -0.352322242263728, 0.05923200769748234, -0.18388519763255362, -0.19718232573707056, 0.14073649433634752, -0.06406906963495901, 0.01521959994574013, -0.15983521984304366, 0.10300340987932312, -0.03627117827377991, 0.04148129840914465, -0.11254632888499459, -0.13386360500535033, 0.0021891323080778405, -0.004565558873655848, 0.13752296673713849, 0.0779079050250328, 0.17741148624534034, -0.16732704935525106, -0.08286351360579801, 0.3999904772009021, -0.06651057715896729, 0.042278257998163406, 0.19272830935031082, -0.27243513878985487, -0.22652673131182977, 0.28857382021276223, 0.17305564940994922, 0.023859430189426028, -0.21347599844418982, 0.11250948947623705, -0.04137636925556562, 0.16248701548250685, 0.04815990036740055, 0.05345014319315834, 0.35113092907850846, 0.13100809888597928, 0.13164791322471397, 0.04006623935376136, -0.3122908293222716, 0.08087604721340369, -0.3014144392672387, -0.0291257601241587, -0.16553067474526428, 0.11796637355429032, -0.08000293650511366, -0.06963857424001754, 0.37679660731469683, 0.0922152089927369, 0.20679402131142108, -0.011736239646356436, 0.3323111159627402, 0.034961631509867856, 0.052825931666137756, 0.1447409830384144, 0.4172849860159481, 0.11205429801828691, 0.15692591685040286, -0.1751405019649896, 0.060486866909506845, -0.03447670138107156] |
1,802.09984 | Formal Semantics of the Language Cypher | Cypher is a query language for property graphs. It was originally designed
and implemented as part of the Neo4j graph database, and it is currently used
in a growing number of commercial systems, industrial applications and research
projects. In this work, we provide denotational semantics of the core fragment
of the read-only part of Cypher, which features in particular pattern matching,
filtering, and most relational operations on tables.
| cs.DB cs.PL | cypher is a query language for property graphs it was originally designed and implemented as part of the neo4j graph database and it is currently used in a growing number of commercial systems industrial applications and research projects in this work we provide denotational semantics of the core fragment of the readonly part of cypher which features in particular pattern matching filtering and most relational operations on tables | [['cypher', 'is', 'a', 'query', 'language', 'for', 'property', 'graphs', 'it', 'was', 'originally', 'designed', 'and', 'implemented', 'as', 'part', 'of', 'the', 'neo4j', 'graph', 'database', 'and', 'it', 'is', 'currently', 'used', 'in', 'a', 'growing', 'number', 'of', 'commercial', 'systems', 'industrial', 'applications', 'and', 'research', 'projects', 'in', 'this', 'work', 'we', 'provide', 'denotational', 'semantics', 'of', 'the', 'core', 'fragment', 'of', 'the', 'readonly', 'part', 'of', 'cypher', 'which', 'features', 'in', 'particular', 'pattern', 'matching', 'filtering', 'and', 'most', 'relational', 'operations', 'on', 'tables']] | [-0.09232564035268939, 0.013184872784597032, -0.06872041634051129, 0.06890169518267024, -0.12946969329598634, -0.113021462549702, 0.01877539332353455, 0.3847706035110819, -0.28179442478679395, -0.35762582094792056, 0.15254223903620562, -0.28976105456240475, -0.1278041943168158, 0.20563771709909334, -0.10607962830759146, 0.11214016133624896, 0.08337362039395992, 0.05928610931261895, 0.02905619866343092, -0.2597468668712228, 0.2760909909779644, 0.050707850440898365, 0.2836234577904072, 0.04331447763423271, 0.04132826917681515, 0.011330337619737667, -0.05816239385646494, 0.022854924955240944, -0.04818747310748543, 0.15090090093915076, 0.36108609061578617, 0.2739892475621994, 0.2667701568673639, -0.4006970362080371, -0.12981787211645177, 0.07646956595400457, 0.09152991644462899, 0.07376024231609121, -0.046496974102731604, -0.2737383889856146, 0.09745523028130479, -0.22788181355880463, -0.00931263473980567, -0.061715763712794906, 0.10996464368722894, -0.001423445947961334, -0.22599986589150778, -0.092714377637843, 0.13474257977898507, 0.11759787673294983, 0.024393178895800647, -0.11058297118656543, 0.02868749086936826, 0.1275271383483949, -0.047807306003318555, 0.03815480777035084, 0.14537225826643407, -0.11695566827855895, -0.17477078850446132, 0.421359009712058, -0.019887572346145615, -0.13950925132752778, 0.16008021135348827, -0.029711131513228312, -0.22650820285301, 0.04355641180539832, 0.1744443729848546, 0.12046434325576924, -0.16142943171400795, 0.13004471683148844, -0.06444264559403938, 0.22886328862445868, 0.1091822737507755, 0.039845250026487256, 0.1809805570553769, 0.2538148874985328, 0.04616493549666997, 0.1796315211994464, 0.0008200531969230403, -0.09177610620527583, -0.2375139139339273, -0.1753758417976582, -0.1823171163251733, -0.10966321287389078, -0.04993367075204493, -0.22646134135806384, 0.38797210321268616, 0.17079334358191667, 0.09835988471519051, 0.040910312657669076, 0.3245573424569824, 0.03126711739220328, 0.16402989746454885, 0.1117504173581598, 0.08277415456798147, 0.08215261694482144, 0.18082100049565164, -0.09657047756755834, 0.1252358963897945, 0.05527962452512892] |
1,802.09985 | Neural Stereoscopic Image Style Transfer | Neural style transfer is an emerging technique which is able to endow
daily-life images with attractive artistic styles. Previous work has succeeded
in applying convolutional neural networks (CNNs) to style transfer for
monocular images or videos. However, style transfer for stereoscopic images is
still a missing piece. Different from processing a monocular image, the two
views of a stylized stereoscopic pair are required to be consistent to provide
observers a comfortable visual experience. In this paper, we propose a novel
dual path network for view-consistent style transfer on stereoscopic images.
While each view of the stereoscopic pair is processed in an individual path, a
novel feature aggregation strategy is proposed to effectively share information
between the two paths. Besides a traditional perceptual loss being used for
controlling the style transfer quality in each view, a multi-layer view loss is
leveraged to enforce the network to coordinate the learning of both the paths
to generate view-consistent stylized results. Extensive experiments show that,
compared against previous methods, our proposed model can produce stylized
stereoscopic images which achieve decent view consistency.
| cs.CV | neural style transfer is an emerging technique which is able to endow dailylife images with attractive artistic styles previous work has succeeded in applying convolutional neural networks cnns to style transfer for monocular images or videos however style transfer for stereoscopic images is still a missing piece different from processing a monocular image the two views of a stylized stereoscopic pair are required to be consistent to provide observers a comfortable visual experience in this paper we propose a novel dual path network for viewconsistent style transfer on stereoscopic images while each view of the stereoscopic pair is processed in an individual path a novel feature aggregation strategy is proposed to effectively share information between the two paths besides a traditional perceptual loss being used for controlling the style transfer quality in each view a multilayer view loss is leveraged to enforce the network to coordinate the learning of both the paths to generate viewconsistent stylized results extensive experiments show that compared against previous methods our proposed model can produce stylized stereoscopic images which achieve decent view consistency | [['neural', 'style', 'transfer', 'is', 'an', 'emerging', 'technique', 'which', 'is', 'able', 'to', 'endow', 'dailylife', 'images', 'with', 'attractive', 'artistic', 'styles', 'previous', 'work', 'has', 'succeeded', 'in', 'applying', 'convolutional', 'neural', 'networks', 'cnns', 'to', 'style', 'transfer', 'for', 'monocular', 'images', 'or', 'videos', 'however', 'style', 'transfer', 'for', 'stereoscopic', 'images', 'is', 'still', 'a', 'missing', 'piece', 'different', 'from', 'processing', 'a', 'monocular', 'image', 'the', 'two', 'views', 'of', 'a', 'stylized', 'stereoscopic', 'pair', 'are', 'required', 'to', 'be', 'consistent', 'to', 'provide', 'observers', 'a', 'comfortable', 'visual', 'experience', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'dual', 'path', 'network', 'for', 'viewconsistent', 'style', 'transfer', 'on', 'stereoscopic', 'images', 'while', 'each', 'view', 'of', 'the', 'stereoscopic', 'pair', 'is', 'processed', 'in', 'an', 'individual', 'path', 'a', 'novel', 'feature', 'aggregation', 'strategy', 'is', 'proposed', 'to', 'effectively', 'share', 'information', 'between', 'the', 'two', 'paths', 'besides', 'a', 'traditional', 'perceptual', 'loss', 'being', 'used', 'for', 'controlling', 'the', 'style', 'transfer', 'quality', 'in', 'each', 'view', 'a', 'multilayer', 'view', 'loss', 'is', 'leveraged', 'to', 'enforce', 'the', 'network', 'to', 'coordinate', 'the', 'learning', 'of', 'both', 'the', 'paths', 'to', 'generate', 'viewconsistent', 'stylized', 'results', 'extensive', 'experiments', 'show', 'that', 'compared', 'against', 'previous', 'methods', 'our', 'proposed', 'model', 'can', 'produce', 'stylized', 'stereoscopic', 'images', 'which', 'achieve', 'decent', 'view', 'consistency']] | [-0.04622056393550751, 0.005794748334665201, -0.11217575353889102, 0.07331294661542581, -0.14328566044621932, -0.18551448092330247, -0.026133006168079606, 0.5066413236358627, -0.2896408278955443, -0.3642817838487893, 0.003645765001816802, -0.29854994228067383, -0.18767465908868788, 0.17538858618619005, -0.20835543438707563, 0.07918042864184827, 0.18667358437514023, 0.02367664579072549, -0.04307688178960234, -0.23816557704809715, 0.2771180451263717, 0.059776654985564, 0.3813717866485769, -0.010403576317581941, 0.18462925211695785, -0.019440814810381693, -0.007743201533726692, -0.009553158821125346, -0.023243553035792338, 0.21541580906506913, 0.3214399867257188, 0.1837506312056741, 0.3171305674186442, -0.4283728319516575, -0.2376096938506552, 0.03496834014235488, 0.14247075600856493, 0.08674413141985, -0.09030028991996501, -0.3049650109182535, 0.09419299208490305, -0.17026711735459024, 0.012216136970726604, -0.11504067414419049, -0.05238304269137602, -0.04916786197281908, -0.3186372620085339, -0.034543516537682575, 0.052145970047356306, 0.0770155260371129, -0.06744947871828283, -0.04559608062051914, -0.005172663187047213, 0.24113057866634335, 0.02386596841428069, 0.08606384252131895, 0.11857620866133155, -0.21259956117104262, -0.14863948405995456, 0.37840254621749575, -0.019403350173061797, -0.22099396790674125, 0.2059033750238913, 0.0011431028449971398, -0.10128495420742017, 0.139990148907104, 0.1730800964128734, 0.10629318045208823, -0.2054375101314773, -0.06858513718576763, -0.0765800569100644, 0.19589694362432716, 0.06593014057877801, -0.0057214564268096265, 0.23421973467049445, 0.20692366710334847, 0.0430544207602824, 0.16171318829252745, -0.1474976638644214, -0.07281528945631263, -0.19306117910045115, -0.13077014846071092, -0.20705972803989425, -0.0052295649418903686, -0.06751980031946335, -0.11835655057802796, 0.41470415584362025, 0.24527295428825627, 0.24796277969091368, 0.09450405777103944, 0.39660220012195746, 0.014943870047070297, 0.11325284082439876, 0.040658612498770126, 0.1921842726032165, -0.02864205403470392, 0.2014508188678354, -0.13114265103385234, 0.0878802862981419, 0.09679936988289807] |
1,802.09986 | Re-examining the transition into the N=20 island of inversion: structure
of $^{30}$Mg | Intermediate energy single-neutron removal from $^{31}$Mg has been employed
to investigate the transition into the N=20 island of inversion. Levels up to
5~MeV excitation energy in $^{30}$Mg were populated and spin-parity assignments
were inferred from the corresponding longitudinal momentum distributions and
$\gamma$-ray decay scheme. Comparison with eikonal-model calculations also
permitted spectroscopic factors to be deduced. Surprisingly, the 0$^{+}_{2}$
level in $^{30}$Mg was found to have a strength much weaker than expected in
the conventional picture of a predominantly $2p - 2h$ intruder configuration
having a large overlap with the deformed $^{31}$Mg ground state. In addition,
negative parity levels were identified for the first time in $^{30}$Mg, one of
which is located at low excitation energy. The results are discussed in the
light of shell-model calculations employing two newly developed approaches with
markedly different descriptions of the structure of $^{30}$Mg. It is concluded
that the cross-shell effects in the region of the island of inversion at Z=12
are considerably more complex than previously thought and that $np - nh$
configurations play a major role in the structure of $^{30}$Mg.
| nucl-ex nucl-th | intermediate energy singleneutron removal from 31mg has been employed to investigate the transition into the n20 island of inversion levels up to 5mev excitation energy in 30mg were populated and spinparity assignments were inferred from the corresponding longitudinal momentum distributions and gammaray decay scheme comparison with eikonalmodel calculations also permitted spectroscopic factors to be deduced surprisingly the 0_2 level in 30mg was found to have a strength much weaker than expected in the conventional picture of a predominantly 2p 2h intruder configuration having a large overlap with the deformed 31mg ground state in addition negative parity levels were identified for the first time in 30mg one of which is located at low excitation energy the results are discussed in the light of shellmodel calculations employing two newly developed approaches with markedly different descriptions of the structure of 30mg it is concluded that the crossshell effects in the region of the island of inversion at z12 are considerably more complex than previously thought and that np nh configurations play a major role in the structure of 30mg | [['intermediate', 'energy', 'singleneutron', 'removal', 'from', '31mg', 'has', 'been', 'employed', 'to', 'investigate', 'the', 'transition', 'into', 'the', 'n20', 'island', 'of', 'inversion', 'levels', 'up', 'to', '5mev', 'excitation', 'energy', 'in', '30mg', 'were', 'populated', 'and', 'spinparity', 'assignments', 'were', 'inferred', 'from', 'the', 'corresponding', 'longitudinal', 'momentum', 'distributions', 'and', 'gammaray', 'decay', 'scheme', 'comparison', 'with', 'eikonalmodel', 'calculations', 'also', 'permitted', 'spectroscopic', 'factors', 'to', 'be', 'deduced', 'surprisingly', 'the', '0_2', 'level', 'in', '30mg', 'was', 'found', 'to', 'have', 'a', 'strength', 'much', 'weaker', 'than', 'expected', 'in', 'the', 'conventional', 'picture', 'of', 'a', 'predominantly', '2p', '2h', 'intruder', 'configuration', 'having', 'a', 'large', 'overlap', 'with', 'the', 'deformed', '31mg', 'ground', 'state', 'in', 'addition', 'negative', 'parity', 'levels', 'were', 'identified', 'for', 'the', 'first', 'time', 'in', '30mg', 'one', 'of', 'which', 'is', 'located', 'at', 'low', 'excitation', 'energy', 'the', 'results', 'are', 'discussed', 'in', 'the', 'light', 'of', 'shellmodel', 'calculations', 'employing', 'two', 'newly', 'developed', 'approaches', 'with', 'markedly', 'different', 'descriptions', 'of', 'the', 'structure', 'of', '30mg', 'it', 'is', 'concluded', 'that', 'the', 'crossshell', 'effects', 'in', 'the', 'region', 'of', 'the', 'island', 'of', 'inversion', 'at', 'z12', 'are', 'considerably', 'more', 'complex', 'than', 'previously', 'thought', 'and', 'that', 'np', 'nh', 'configurations', 'play', 'a', 'major', 'role', 'in', 'the', 'structure', 'of', '30mg']] | [-0.06739115835766175, 0.17648103057473366, -0.07211845904056514, 0.1327947064662086, 0.018892095206371907, -0.11524913541972637, 0.05221907225570509, 0.3744916019695146, -0.1714608086246465, -0.35640709340788557, 0.010168245563815747, -0.2846295476864491, -0.052698825395533014, 0.14369363212691885, 0.0714964619064371, 0.0002830129941659314, 0.03660498490590336, 0.02609595715334373, -0.07522105187975935, -0.16634467030276678, 0.3074014055782131, 0.10194645220679896, 0.29110292814671995, 0.03602392391900399, 0.001932032196117299, -0.045873739721719174, 0.01928237609698304, -0.013659569884517364, -0.10213719562785367, 0.08415153649768659, 0.2544345867899912, 0.03828571830477033, 0.2068014496564865, -0.41711213806910175, -0.16966987747033793, 0.049282480279466, 0.15387511801107653, 0.13652649413993848, -0.028592348707191247, -0.2952705668870892, 0.07800241366161832, -0.17152441647968122, -0.13494833737212633, -0.04676321586860078, 0.01689574687242774, -0.0035816651369844164, -0.21165721254755876, 0.07650697461612123, -0.003447010344160455, 0.0629334503537809, -0.11650158490985632, -0.22664876351665172, -0.09135835041957242, 0.0987780276070615, 0.0660724478321416, 0.03943452263334101, 0.12067846445499786, -0.10386577191895673, -0.0887528628446827, 0.36873124188610484, -0.007163937526389158, -0.11564470780747277, 0.17037682960608175, -0.18824037576892547, -0.1583457312493452, 0.22318002001781548, 0.10476747834689117, 0.09700957345044506, -0.0880344902863726, 0.04735319784759278, 0.0030650580834065163, 0.17928678615018726, 0.08695235966022925, 0.05283230380155146, 0.15738616552603032, 0.1428026351186314, 0.0014709751427705799, 0.11553674408434225, -0.1543159121467865, -0.12196894455900682, -0.22741052926118885, -0.09626528872975282, -0.1436672476579302, 0.058791698266785326, 0.002730323070510557, -0.09791395325745855, 0.38631584282771136, 0.050919968522295155, 0.20398049891926348, -0.0426065984428195, 0.2346728523634374, 0.12610791529927934, 0.1255266002366053, 0.04744593907613307, 0.30706739990572846, 0.14260660649410317, 0.0752426423887456, -0.24062757413568242, 0.0762223142239132, 0.002175124202455793] |
1,802.09987 | Multi-View Silhouette and Depth Decomposition for High Resolution 3D
Object Representation | We consider the problem of scaling deep generative shape models to
high-resolution. Drawing motivation from the canonical view representation of
objects, we introduce a novel method for the fast up-sampling of 3D objects in
voxel space through networks that perform super-resolution on the six
orthographic depth projections. This allows us to generate high-resolution
objects with more efficient scaling than methods which work directly in 3D. We
decompose the problem of 2D depth super-resolution into silhouette and depth
prediction to capture both structure and fine detail. This allows our method to
generate sharp edges more easily than an individual network. We evaluate our
work on multiple experiments concerning high-resolution 3D objects, and show
our system is capable of accurately predicting novel objects at resolutions as
large as 512$\mathbf{\times}$512$\mathbf{\times}$512 -- the highest resolution
reported for this task. We achieve state-of-the-art performance on 3D object
reconstruction from RGB images on the ShapeNet dataset, and further demonstrate
the first effective 3D super-resolution method.
| cs.CV | we consider the problem of scaling deep generative shape models to highresolution drawing motivation from the canonical view representation of objects we introduce a novel method for the fast upsampling of 3d objects in voxel space through networks that perform superresolution on the six orthographic depth projections this allows us to generate highresolution objects with more efficient scaling than methods which work directly in 3d we decompose the problem of 2d depth superresolution into silhouette and depth prediction to capture both structure and fine detail this allows our method to generate sharp edges more easily than an individual network we evaluate our work on multiple experiments concerning highresolution 3d objects and show our system is capable of accurately predicting novel objects at resolutions as large as 512mathbftimes512mathbftimes512 the highest resolution reported for this task we achieve stateoftheart performance on 3d object reconstruction from rgb images on the shapenet dataset and further demonstrate the first effective 3d superresolution method | [['we', 'consider', 'the', 'problem', 'of', 'scaling', 'deep', 'generative', 'shape', 'models', 'to', 'highresolution', 'drawing', 'motivation', 'from', 'the', 'canonical', 'view', 'representation', 'of', 'objects', 'we', 'introduce', 'a', 'novel', 'method', 'for', 'the', 'fast', 'upsampling', 'of', '3d', 'objects', 'in', 'voxel', 'space', 'through', 'networks', 'that', 'perform', 'superresolution', 'on', 'the', 'six', 'orthographic', 'depth', 'projections', 'this', 'allows', 'us', 'to', 'generate', 'highresolution', 'objects', 'with', 'more', 'efficient', 'scaling', 'than', 'methods', 'which', 'work', 'directly', 'in', '3d', 'we', 'decompose', 'the', 'problem', 'of', '2d', 'depth', 'superresolution', 'into', 'silhouette', 'and', 'depth', 'prediction', 'to', 'capture', 'both', 'structure', 'and', 'fine', 'detail', 'this', 'allows', 'our', 'method', 'to', 'generate', 'sharp', 'edges', 'more', 'easily', 'than', 'an', 'individual', 'network', 'we', 'evaluate', 'our', 'work', 'on', 'multiple', 'experiments', 'concerning', 'highresolution', '3d', 'objects', 'and', 'show', 'our', 'system', 'is', 'capable', 'of', 'accurately', 'predicting', 'novel', 'objects', 'at', 'resolutions', 'as', 'large', 'as', '512mathbftimes512mathbftimes512', 'the', 'highest', 'resolution', 'reported', 'for', 'this', 'task', 'we', 'achieve', 'stateoftheart', 'performance', 'on', '3d', 'object', 'reconstruction', 'from', 'rgb', 'images', 'on', 'the', 'shapenet', 'dataset', 'and', 'further', 'demonstrate', 'the', 'first', 'effective', '3d', 'superresolution', 'method']] | [0.027679309189604345, -0.03649500109450699, -0.06380310335943985, 0.05281511186933513, -0.08970847957215872, -0.11597250179820665, -0.0018235946424115614, 0.4769206822250679, -0.2598209779377386, -0.37514073057634056, 0.04054363314388616, -0.25974230183852737, -0.19756077851056103, 0.21140906376954002, -0.1300756280417228, 0.09055506227134615, 0.14611087204995238, -0.018088526992649314, -0.08521869880366761, -0.21050990771970884, 0.317186406773521, 0.05970659434842094, 0.3293324533470307, -0.02079329727985748, 0.1538329992597555, -0.0037602434590292776, -0.049390066071016016, 0.022011421886858513, -0.09748382922018185, 0.2208736896971656, 0.23056154730122194, 0.15335450845230728, 0.20765409690541495, -0.4484948393574376, -0.26245825976180803, 0.04509736819839354, 0.16776061320238433, 0.13764614281229745, -0.033173185097873745, -0.33375650653793554, 0.10258818938162187, -0.11435298542759031, -0.028849726283305864, -0.1575482000068874, -0.030124937898218393, -0.07014337685522712, -0.27709741569398516, 0.042589159175763974, 0.0407520347225901, 0.06499815531294484, -0.08522977129701573, -0.07814973717700738, 0.043986518391271594, 0.20134317903085405, -0.05464165216344438, 0.03747719947832998, 0.09623625182256007, -0.21260773867051153, -0.10253898715778331, 0.38353683360537905, -0.04362845298879377, -0.1971413341119506, 0.21675180255844714, -0.12306736335514268, -0.14072996747507982, 0.14785438652037625, 0.23255413479266604, 0.21223665000040345, -0.1084715773957295, -0.015767821939780737, -0.08340535531188273, 0.19656422702969306, 0.04745972352725258, -0.008635396965346329, 0.20540094639732248, 0.2496735158133184, 0.059210281590723494, 0.1472388291457122, -0.2381962156130867, -0.008998570222241483, -0.1867853116313037, -0.14261084533990567, -0.18818785846648609, -0.015512355007112595, -0.10536410535239336, -0.13864136509935426, 0.42526229419063327, 0.2788538043031315, 0.2775136280069306, 0.11816248763426783, 0.38059623531143, 0.02164402150973132, 0.09894048793917629, 0.030459567835883706, 0.15745834722094665, 0.02734087834099106, 0.10661503667557601, -0.17047768739084743, 0.0010285308735836654, 0.10424285630434514] |
1,802.09988 | Linear response time-dependent density functional theory of the Hubbard
dimer | The asymmetric Hubbard dimer is used to study the density-dependence of the
exact frequency-dependent kernel of linear-response time-dependent density
functional theory. The exact form of the kernel is given, and the limitations
of the adiabatic approximation utilizing the exact ground-state functional are
shown. The oscillator strength sum rule is proven for lattice Hamiltonians, and
relative oscillator strengths are defined appropriately. The method of Casida
for extracting oscillator strengths from a frequency-dependent kernel is
demonstrated to yield the exact result with this kernel. An unambiguous way of
labelling the nature of excitations is given. The fluctuation-dissipation
theorem is proven for the ground-state exchange-correlation energy. The
distinction between weak and strong correlation is shown to depend on the ratio
of interaction to asymmetry. A simple interpolation between carefully defined
weak-correlation and strong-correlation regimes yields a density-functional
approximation for the kernel that gives accurate transition frequencies for
both the single and double excitations, including charge-transfer excitations.
Many exact results, limits, and expansions about those limits are given in the
appendices.
| cond-mat.str-el cond-mat.mtrl-sci | the asymmetric hubbard dimer is used to study the densitydependence of the exact frequencydependent kernel of linearresponse timedependent density functional theory the exact form of the kernel is given and the limitations of the adiabatic approximation utilizing the exact groundstate functional are shown the oscillator strength sum rule is proven for lattice hamiltonians and relative oscillator strengths are defined appropriately the method of casida for extracting oscillator strengths from a frequencydependent kernel is demonstrated to yield the exact result with this kernel an unambiguous way of labelling the nature of excitations is given the fluctuationdissipation theorem is proven for the groundstate exchangecorrelation energy the distinction between weak and strong correlation is shown to depend on the ratio of interaction to asymmetry a simple interpolation between carefully defined weakcorrelation and strongcorrelation regimes yields a densityfunctional approximation for the kernel that gives accurate transition frequencies for both the single and double excitations including chargetransfer excitations many exact results limits and expansions about those limits are given in the appendices | [['the', 'asymmetric', 'hubbard', 'dimer', 'is', 'used', 'to', 'study', 'the', 'densitydependence', 'of', 'the', 'exact', 'frequencydependent', 'kernel', 'of', 'linearresponse', 'timedependent', 'density', 'functional', 'theory', 'the', 'exact', 'form', 'of', 'the', 'kernel', 'is', 'given', 'and', 'the', 'limitations', 'of', 'the', 'adiabatic', 'approximation', 'utilizing', 'the', 'exact', 'groundstate', 'functional', 'are', 'shown', 'the', 'oscillator', 'strength', 'sum', 'rule', 'is', 'proven', 'for', 'lattice', 'hamiltonians', 'and', 'relative', 'oscillator', 'strengths', 'are', 'defined', 'appropriately', 'the', 'method', 'of', 'casida', 'for', 'extracting', 'oscillator', 'strengths', 'from', 'a', 'frequencydependent', 'kernel', 'is', 'demonstrated', 'to', 'yield', 'the', 'exact', 'result', 'with', 'this', 'kernel', 'an', 'unambiguous', 'way', 'of', 'labelling', 'the', 'nature', 'of', 'excitations', 'is', 'given', 'the', 'fluctuationdissipation', 'theorem', 'is', 'proven', 'for', 'the', 'groundstate', 'exchangecorrelation', 'energy', 'the', 'distinction', 'between', 'weak', 'and', 'strong', 'correlation', 'is', 'shown', 'to', 'depend', 'on', 'the', 'ratio', 'of', 'interaction', 'to', 'asymmetry', 'a', 'simple', 'interpolation', 'between', 'carefully', 'defined', 'weakcorrelation', 'and', 'strongcorrelation', 'regimes', 'yields', 'a', 'densityfunctional', 'approximation', 'for', 'the', 'kernel', 'that', 'gives', 'accurate', 'transition', 'frequencies', 'for', 'both', 'the', 'single', 'and', 'double', 'excitations', 'including', 'chargetransfer', 'excitations', 'many', 'exact', 'results', 'limits', 'and', 'expansions', 'about', 'those', 'limits', 'are', 'given', 'in', 'the', 'appendices']] | [-0.12071312064427638, 0.08122687405165255, -0.08322330745227055, 0.12352334847255515, -0.04379492245257614, -0.13467878553581364, 0.06073393425722969, 0.38195815848599296, -0.2296408925004705, -0.25429729962844155, -0.001212333683844678, -0.2746915036288207, -0.13667397109323187, 0.1896739386016514, 0.0504604193666381, 0.06200839140491482, 0.03890439923601727, 0.02855275189336724, -0.09819403258261664, -0.16810139089552295, 0.28283617161158586, 0.06417078061815641, 0.2924849975039948, 0.11560852868164594, 0.08875824895570289, 0.016186857370180104, 0.027960290069953944, -0.016158043139218214, -0.1350232831171165, 0.1348219958474179, 0.24887364971190748, 0.01436853507522516, 0.22648560259111983, -0.398610646546467, -0.1804106208791365, 0.07430544146615455, 0.1227940650925899, 0.14286821383514448, 0.020731560776461874, -0.2837719079741405, 0.025931704259605823, -0.16939080233858553, -0.12313959306708264, -0.15020633034385786, 0.0316028572231375, 0.07814813571881704, -0.3056532241066661, 0.12438683747732175, 0.05112152429030752, 0.032603157424886606, -0.0876608818984161, -0.13064843912547577, 0.008436570998035861, 0.1041392458987584, 0.01407230133818139, 0.01604966408138102, 0.1180226840580741, -0.13027176926537098, -0.055887631787207466, 0.3623530704606168, -0.06843027637150517, -0.2052670434622016, 0.17277951251916185, -0.10914029684586975, -0.08504341292323288, 0.12404967122502111, 0.05295603622753497, 0.09898463508606022, -0.1493469300027379, 0.15029962787552442, 0.019841168783354145, 0.14171136294430245, 0.0483114569215104, 0.05273645598452516, 0.152718298622368, 0.107724510821999, 0.045791688489847576, 0.14141977570594072, -0.06714786104383895, -0.15068500947129138, -0.3011546515006416, -0.09576224859845392, -0.24623624423991408, 0.03450635339629775, -0.10031671035971386, -0.2107530387134492, 0.3973138889278324, 0.11168613950972875, 0.17078039901955666, 0.05139018893018811, 0.25343282773956927, 0.24588375640085, 0.019324902640265262, 0.030634269243786615, 0.27047436704760147, 0.223447734540228, 0.015855756716546186, -0.2759609322585054, 0.03788474117946661, 0.1307083643417984] |
1,802.09989 | On some applications of balanced pairs and their relation with cotorsion
triplets | Balanced pairs appear naturally in the realm of Relative Homological Algebra
associated to the balance of right derived functors of the $\mathsf{Hom}$
functor. A natural source to get such pairs is by means of cotorsion triplets.
In this paper we study the connection between balanced pairs and cotorsion
triplets by using recent quiver representation techniques. In doing so, we find
a new characterization of abelian categories having enough projectives and
injectives in terms of the existence of complete hereditary cotorsion triplets.
We also give a short proof of the lack of balance for derived functors of
$\mathsf{Hom}$ computed by using flat resolutions which extends the one showed
by Enochs in the commutative case.
| math.RT | balanced pairs appear naturally in the realm of relative homological algebra associated to the balance of right derived functors of the mathsfhom functor a natural source to get such pairs is by means of cotorsion triplets in this paper we study the connection between balanced pairs and cotorsion triplets by using recent quiver representation techniques in doing so we find a new characterization of abelian categories having enough projectives and injectives in terms of the existence of complete hereditary cotorsion triplets we also give a short proof of the lack of balance for derived functors of mathsfhom computed by using flat resolutions which extends the one showed by enochs in the commutative case | [['balanced', 'pairs', 'appear', 'naturally', 'in', 'the', 'realm', 'of', 'relative', 'homological', 'algebra', 'associated', 'to', 'the', 'balance', 'of', 'right', 'derived', 'functors', 'of', 'the', 'mathsfhom', 'functor', 'a', 'natural', 'source', 'to', 'get', 'such', 'pairs', 'is', 'by', 'means', 'of', 'cotorsion', 'triplets', 'in', 'this', 'paper', 'we', 'study', 'the', 'connection', 'between', 'balanced', 'pairs', 'and', 'cotorsion', 'triplets', 'by', 'using', 'recent', 'quiver', 'representation', 'techniques', 'in', 'doing', 'so', 'we', 'find', 'a', 'new', 'characterization', 'of', 'abelian', 'categories', 'having', 'enough', 'projectives', 'and', 'injectives', 'in', 'terms', 'of', 'the', 'existence', 'of', 'complete', 'hereditary', 'cotorsion', 'triplets', 'we', 'also', 'give', 'a', 'short', 'proof', 'of', 'the', 'lack', 'of', 'balance', 'for', 'derived', 'functors', 'of', 'mathsfhom', 'computed', 'by', 'using', 'flat', 'resolutions', 'which', 'extends', 'the', 'one', 'showed', 'by', 'enochs', 'in', 'the', 'commutative', 'case']] | [-0.14285767079160028, 0.03478173786975645, -0.05137755758724771, 0.1258067478518094, -0.07383404359187898, -0.1252811496850808, 0.0006189159013940282, 0.3557908146973565, -0.34723941381047435, -0.26435053556096144, 0.026352892993731208, -0.20671074007279114, -0.10509927434058071, 0.15566377988219396, -0.17564130162081873, -0.09425780005954407, 0.09823284815023611, 0.06654795500877742, -0.05334731806195467, -0.25445941582255, 0.422904720126131, 0.003565321730969994, 0.2513091879737404, 0.050270617889190045, 0.12249777898158845, 0.023864176367652846, -0.07311119308888174, 0.013038192531681276, -0.1529503359904026, 0.17227347485872135, 0.29403940975867415, 0.11468715177060247, 0.19104619415661506, -0.3847531155590807, -0.08912882521362589, 0.1939926461971088, 0.12381526901817205, 0.06285695924511733, -0.060406614476730965, -0.278687118219111, 0.13820726519265958, -0.22006933188888136, -0.09135670219086581, -0.07232891686411726, 0.06436524593883806, 0.0341788056822544, -0.24044140660715801, 0.02612002844359046, 0.12253059150037819, 0.12729748889703202, -0.04400652157025294, -0.024692035041044693, -0.09103180630854121, 0.09005148246515172, -0.016217526763694378, -0.010415642901936226, 0.047392546136334944, -0.14135886903491443, -0.14478181949019567, 0.35826172911234805, -0.07326597611310783, -0.1941208472257262, 0.1922682861122093, -0.15204809136638367, -0.1195311867621484, 0.12078631842961988, 0.019239660436371424, 0.17355307717681737, -0.0932903181895748, 0.14099136723922817, -0.13535016041819578, 0.07113862167078969, 0.14816066938209105, 0.06380061071097583, 0.17557703189316903, 0.09329939389450324, 0.023529896218967332, 0.18998547618671716, 0.0260383812537593, -0.020710129525747384, -0.3511290003856023, -0.16264208794261018, -0.07478547178477317, 0.08422747787587903, -0.025390208332520398, -0.15946234831469017, 0.4087527057843971, 0.11243167467130062, 0.2179361628116788, 0.10893811240712567, 0.22404008612103826, 0.03336172460721017, 0.07358721805199443, -0.015110547914429827, 0.19460703231717316, 0.24417263526377175, 0.008605639223714132, -0.11498911725252296, -0.02802346219877117, 0.19760392960328776] |
1,802.0999 | Deep Learning Architectures for Face Recognition in Video Surveillance | Face recognition (FR) systems for video surveillance (VS) applications
attempt to accurately detect the presence of target individuals over a
distributed network of cameras. In video-based FR systems, facial models of
target individuals are designed a priori during enrollment using a limited
number of reference still images or video data. These facial models are not
typically representative of faces being observed during operations due to large
variations in illumination, pose, scale, occlusion, blur, and to camera
inter-operability. Specifically, in still-to-video FR application, a single
high-quality reference still image captured with still camera under controlled
conditions is employed to generate a facial model to be matched later against
lower-quality faces captured with video cameras under uncontrolled conditions.
Current video-based FR systems can perform well on controlled scenarios, while
their performance is not satisfactory in uncontrolled scenarios mainly because
of the differences between the source (enrollment) and the target (operational)
domains. Most of the efforts in this area have been toward the design of robust
video-based FR systems in unconstrained surveillance environments. This chapter
presents an overview of recent advances in still-to-video FR scenario through
deep convolutional neural networks (CNNs). In particular, deep learning
architectures proposed in the literature based on triplet-loss function (e.g.,
cross-correlation matching CNN, trunk-branch ensemble CNN and HaarNet) and
supervised autoencoders (e.g., canonical face representation CNN) are reviewed
and compared in terms of accuracy and computational complexity.
| cs.CV | face recognition fr systems for video surveillance vs applications attempt to accurately detect the presence of target individuals over a distributed network of cameras in videobased fr systems facial models of target individuals are designed a priori during enrollment using a limited number of reference still images or video data these facial models are not typically representative of faces being observed during operations due to large variations in illumination pose scale occlusion blur and to camera interoperability specifically in stilltovideo fr application a single highquality reference still image captured with still camera under controlled conditions is employed to generate a facial model to be matched later against lowerquality faces captured with video cameras under uncontrolled conditions current videobased fr systems can perform well on controlled scenarios while their performance is not satisfactory in uncontrolled scenarios mainly because of the differences between the source enrollment and the target operational domains most of the efforts in this area have been toward the design of robust videobased fr systems in unconstrained surveillance environments this chapter presents an overview of recent advances in stilltovideo fr scenario through deep convolutional neural networks cnns in particular deep learning architectures proposed in the literature based on tripletloss function eg crosscorrelation matching cnn trunkbranch ensemble cnn and haarnet and supervised autoencoders eg canonical face representation cnn are reviewed and compared in terms of accuracy and computational complexity | [['face', 'recognition', 'fr', 'systems', 'for', 'video', 'surveillance', 'vs', 'applications', 'attempt', 'to', 'accurately', 'detect', 'the', 'presence', 'of', 'target', 'individuals', 'over', 'a', 'distributed', 'network', 'of', 'cameras', 'in', 'videobased', 'fr', 'systems', 'facial', 'models', 'of', 'target', 'individuals', 'are', 'designed', 'a', 'priori', 'during', 'enrollment', 'using', 'a', 'limited', 'number', 'of', 'reference', 'still', 'images', 'or', 'video', 'data', 'these', 'facial', 'models', 'are', 'not', 'typically', 'representative', 'of', 'faces', 'being', 'observed', 'during', 'operations', 'due', 'to', 'large', 'variations', 'in', 'illumination', 'pose', 'scale', 'occlusion', 'blur', 'and', 'to', 'camera', 'interoperability', 'specifically', 'in', 'stilltovideo', 'fr', 'application', 'a', 'single', 'highquality', 'reference', 'still', 'image', 'captured', 'with', 'still', 'camera', 'under', 'controlled', 'conditions', 'is', 'employed', 'to', 'generate', 'a', 'facial', 'model', 'to', 'be', 'matched', 'later', 'against', 'lowerquality', 'faces', 'captured', 'with', 'video', 'cameras', 'under', 'uncontrolled', 'conditions', 'current', 'videobased', 'fr', 'systems', 'can', 'perform', 'well', 'on', 'controlled', 'scenarios', 'while', 'their', 'performance', 'is', 'not', 'satisfactory', 'in', 'uncontrolled', 'scenarios', 'mainly', 'because', 'of', 'the', 'differences', 'between', 'the', 'source', 'enrollment', 'and', 'the', 'target', 'operational', 'domains', 'most', 'of', 'the', 'efforts', 'in', 'this', 'area', 'have', 'been', 'toward', 'the', 'design', 'of', 'robust', 'videobased', 'fr', 'systems', 'in', 'unconstrained', 'surveillance', 'environments', 'this', 'chapter', 'presents', 'an', 'overview', 'of', 'recent', 'advances', 'in', 'stilltovideo', 'fr', 'scenario', 'through', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'in', 'particular', 'deep', 'learning', 'architectures', 'proposed', 'in', 'the', 'literature', 'based', 'on', 'tripletloss', 'function', 'eg', 'crosscorrelation', 'matching', 'cnn', 'trunkbranch', 'ensemble', 'cnn', 'and', 'haarnet', 'and', 'supervised', 'autoencoders', 'eg', 'canonical', 'face', 'representation', 'cnn', 'are', 'reviewed', 'and', 'compared', 'in', 'terms', 'of', 'accuracy', 'and', 'computational', 'complexity']] | [-0.07956778751863146, -0.029831002231947318, -0.038610602741330734, 0.05375010753255584, -0.058487796668775606, -0.21682797938391427, -0.034854552489069456, 0.47318075795858966, -0.2182215684681253, -0.3715699681117802, 0.10577890153929165, -0.24293049638639594, -0.17557188968321857, 0.1748372483936996, -0.2539609343609424, 0.11104454604000066, 0.12094872017670012, 0.03133642598309673, -0.05907909852354623, -0.2827139546631093, 0.27251821482043287, 0.049424473425765246, 0.33405715025067, -0.02463191142869859, 0.11855468355494372, -0.04925313159015177, -0.044216518754207235, 0.009838675429822984, -0.02961657070329142, 0.1411050722648652, 0.35967092018304336, 0.18399779963315288, 0.27145658887816093, -0.463903129970581, -0.23658637707978117, 0.08660740290136622, 0.14508678988973603, 0.10159986211491609, -0.07248815603550146, -0.379508446721516, 0.07328935594923357, -0.16607436550922675, 0.016939078367393185, -0.07777758217150026, 0.02036863146606209, -0.00970826215789723, -0.2709414906679788, 0.04232968629382977, 0.011315714059672462, 0.128976952436376, -0.06567494798654748, -0.08716583000249865, 0.04883360444970166, 0.18827314603517842, 0.06110999631076961, 0.05842799042445907, 0.1824726527269585, -0.2746421579332583, -0.08793441955839174, 0.39861092121762914, -0.03596453932790898, -0.2173280498102135, 0.22453065793079197, -0.04908157587830913, -0.15649423584042502, 0.11098987228413511, 0.24869290292534837, 0.12567432672770013, -0.19881807843690927, 0.030608655814602478, 0.009591435787928525, 0.19047863685601854, 0.07920611255170391, 0.043456679977279665, 0.2409250634160336, 0.2367176560937357, 0.017797386037064756, 0.11543999293907278, -0.1639750841615254, -0.05696415512244082, -0.19229575717772485, -0.04553916279148589, -0.17664453698350896, -0.045770562249661466, -0.07663312908695366, -0.14028795753576945, 0.39883421927419727, 0.2165347932558917, 0.17031739463840945, 0.07728925763038581, 0.36011000354220424, -0.01100524887134883, 0.12897890841584275, 0.04941607658271288, 0.19459837200561136, -0.018562609356231084, 0.15554338052001113, -0.1501998703779103, 0.09202437788638591, 0.01935306879371766] |
1,802.09991 | Spin-Isospin Properties of $N=Z$ Odd-Odd Nuclei from a Core+$pn$
Three-Body Model including Core Excitations | For $N=Z$ odd-odd nuclei, a three-body model assuming two valence particles
and an inert core can provide an understanding of pairing correlations in the
ground state and spin-isospin excitations. However, since residual core-nucleon
interactions can have a significant impact on these quantities, the inclusion
of core excitations in the model is essential for useful calculation to be
performed. The effect of core excitations must be included in order to gain a
detailed understanding of both the ground state and spin-isospin properties of
these systems. To this end, we include the vibrational excitation of the core
nucleus in our model. We solve the three-body core-nucleon-nucleon problem
including core vibrational states to obtain the nuclear ground state as well as
spin-isospin excitations. The spin-isospin excitations are examined from the
point of view of SU(4) multiplets. By including the effect of core excitation,
several experimental quantities of $N=Z$ odd-odd nuclei are better described,
and the root mean square distances between proton and neutron and that between
the center of mass of proton and neutron and core nucleus increase. Large
$B$($M1$) and $B$(GT) observed for $^{18}$F and $^{40}$Ca were explained in
terms of the SU(4) symmetry. The core nucleus is meaningfully broken by the
residual core-nucleon interactions, and various quantities concerning
spin-isospin excitations as well as the ground state become consistent with
experimental data. Including the core excitation in the three-body model is
thus important for a more detailed understanding of nuclear structure.
| nucl-th nucl-ex | for nz oddodd nuclei a threebody model assuming two valence particles and an inert core can provide an understanding of pairing correlations in the ground state and spinisospin excitations however since residual corenucleon interactions can have a significant impact on these quantities the inclusion of core excitations in the model is essential for useful calculation to be performed the effect of core excitations must be included in order to gain a detailed understanding of both the ground state and spinisospin properties of these systems to this end we include the vibrational excitation of the core nucleus in our model we solve the threebody corenucleonnucleon problem including core vibrational states to obtain the nuclear ground state as well as spinisospin excitations the spinisospin excitations are examined from the point of view of su4 multiplets by including the effect of core excitation several experimental quantities of nz oddodd nuclei are better described and the root mean square distances between proton and neutron and that between the center of mass of proton and neutron and core nucleus increase large bm1 and bgt observed for 18f and 40ca were explained in terms of the su4 symmetry the core nucleus is meaningfully broken by the residual corenucleon interactions and various quantities concerning spinisospin excitations as well as the ground state become consistent with experimental data including the core excitation in the threebody model is thus important for a more detailed understanding of nuclear structure | [['for', 'nz', 'oddodd', 'nuclei', 'a', 'threebody', 'model', 'assuming', 'two', 'valence', 'particles', 'and', 'an', 'inert', 'core', 'can', 'provide', 'an', 'understanding', 'of', 'pairing', 'correlations', 'in', 'the', 'ground', 'state', 'and', 'spinisospin', 'excitations', 'however', 'since', 'residual', 'corenucleon', 'interactions', 'can', 'have', 'a', 'significant', 'impact', 'on', 'these', 'quantities', 'the', 'inclusion', 'of', 'core', 'excitations', 'in', 'the', 'model', 'is', 'essential', 'for', 'useful', 'calculation', 'to', 'be', 'performed', 'the', 'effect', 'of', 'core', 'excitations', 'must', 'be', 'included', 'in', 'order', 'to', 'gain', 'a', 'detailed', 'understanding', 'of', 'both', 'the', 'ground', 'state', 'and', 'spinisospin', 'properties', 'of', 'these', 'systems', 'to', 'this', 'end', 'we', 'include', 'the', 'vibrational', 'excitation', 'of', 'the', 'core', 'nucleus', 'in', 'our', 'model', 'we', 'solve', 'the', 'threebody', 'corenucleonnucleon', 'problem', 'including', 'core', 'vibrational', 'states', 'to', 'obtain', 'the', 'nuclear', 'ground', 'state', 'as', 'well', 'as', 'spinisospin', 'excitations', 'the', 'spinisospin', 'excitations', 'are', 'examined', 'from', 'the', 'point', 'of', 'view', 'of', 'su4', 'multiplets', 'by', 'including', 'the', 'effect', 'of', 'core', 'excitation', 'several', 'experimental', 'quantities', 'of', 'nz', 'oddodd', 'nuclei', 'are', 'better', 'described', 'and', 'the', 'root', 'mean', 'square', 'distances', 'between', 'proton', 'and', 'neutron', 'and', 'that', 'between', 'the', 'center', 'of', 'mass', 'of', 'proton', 'and', 'neutron', 'and', 'core', 'nucleus', 'increase', 'large', 'bm1', 'and', 'bgt', 'observed', 'for', '18f', 'and', '40ca', 'were', 'explained', 'in', 'terms', 'of', 'the', 'su4', 'symmetry', 'the', 'core', 'nucleus', 'is', 'meaningfully', 'broken', 'by', 'the', 'residual', 'corenucleon', 'interactions', 'and', 'various', 'quantities', 'concerning', 'spinisospin', 'excitations', 'as', 'well', 'as', 'the', 'ground', 'state', 'become', 'consistent', 'with', 'experimental', 'data', 'including', 'the', 'core', 'excitation', 'in', 'the', 'threebody', 'model', 'is', 'thus', 'important', 'for', 'a', 'more', 'detailed', 'understanding', 'of', 'nuclear', 'structure']] | [-0.07079205961512527, 0.1839496084703416, -0.07479632605687019, 0.1357141239617505, 0.01095193052006995, -0.07716287317355124, 0.04101436401662581, 0.3468159845083201, -0.20837611512539267, -0.3030548815991135, 0.016957900155249575, -0.31134893696856913, -0.03156256601664418, 0.11808163308765457, 0.08262209442811978, 0.03254391556652654, 0.03802393224215558, 0.06059080858417971, -0.07831875995846324, -0.14463140045345502, 0.3428308225320965, 0.08260156142773858, 0.24074384038915717, 0.1283381473224553, 0.03243581937359912, 0.01578512292907049, 0.05828122574906452, -0.030757236122271093, -0.07199514183737832, 0.08188953936836652, 0.2652923090700373, 0.05467071838700408, 0.16639846357606947, -0.46324801327613724, -0.19794318671661093, 0.08658797164768481, 0.19720069093711892, 0.16176586433219872, -0.03601883886952566, -0.3157733310749676, 0.01753625858324666, -0.2459598768790088, -0.15366797994757697, -0.1421138673527714, 0.026937397126452763, 0.04803997659351395, -0.22008388588804664, 0.10675192588036332, 0.04662894742184773, 0.07158854427676992, -0.15760437734698987, -0.2306317842737654, -0.0620589708579712, 0.13538192823028364, 0.08459106735012517, 0.02625631251345005, 0.15605039671973223, -0.16205593750972552, -0.08070958230327502, 0.4205533479254286, 0.018278617624627787, -0.12251482218965701, 0.14847610501314223, -0.13451415409789882, -0.11747709206773062, 0.12969856079229536, 0.16677510394751946, 0.08554961010344139, -0.11811252360201847, 0.02946500116820421, -0.0170162465665959, 0.20068026316890733, -0.006999309839946883, 0.09471021664422788, 0.2142441839394512, 0.1842064994011669, -0.005252030994077879, 0.11899163947487641, -0.13639765766844497, -0.14059015676602252, -0.2911522536804633, -0.0989138339626595, -0.15853386937577998, 0.025566374763705525, -0.015638492300339972, -0.10602128750668104, 0.4022890565009052, 0.034730376200280896, 0.19869888115022724, -0.03580843547492155, 0.24707179675817864, 0.07513862929528016, 0.07748845344465108, 0.030608796070431585, 0.3019994766795773, 0.20743925203989894, 0.023491610393335086, -0.3214468027478741, 0.03822930543213895, 0.03378729008239921] |
1,802.09992 | Follow Up on Detecting Deficiencies: An Optimal Group Testing Algorithm | In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) there
is an interesting article by Seth Zimmerman, titled Detecting Deficiencies: An
Optimal Group Testing Algorithm. The claim in the summary is contradictory to
well-known facts reported in the group- testing literature, which is easily
verified, beginning with the work by Sobel and Groll (1959), which was cited by
S. Zimmerman himself. Therefore, I feel compelled to offer a number of comments
and clarifications. In addition, I have made some correction of mistaken claim
made by Zimmerman (2017).
| stat.AP | in a recent volume of mathematics magazine vol 90 no 3 june 2017 there is an interesting article by seth zimmerman titled detecting deficiencies an optimal group testing algorithm the claim in the summary is contradictory to wellknown facts reported in the group testing literature which is easily verified beginning with the work by sobel and groll 1959 which was cited by s zimmerman himself therefore i feel compelled to offer a number of comments and clarifications in addition i have made some correction of mistaken claim made by zimmerman 2017 | [['in', 'a', 'recent', 'volume', 'of', 'mathematics', 'magazine', 'vol', '90', 'no', '3', 'june', '2017', 'there', 'is', 'an', 'interesting', 'article', 'by', 'seth', 'zimmerman', 'titled', 'detecting', 'deficiencies', 'an', 'optimal', 'group', 'testing', 'algorithm', 'the', 'claim', 'in', 'the', 'summary', 'is', 'contradictory', 'to', 'wellknown', 'facts', 'reported', 'in', 'the', 'group', 'testing', 'literature', 'which', 'is', 'easily', 'verified', 'beginning', 'with', 'the', 'work', 'by', 'sobel', 'and', 'groll', '1959', 'which', 'was', 'cited', 'by', 's', 'zimmerman', 'himself', 'therefore', 'i', 'feel', 'compelled', 'to', 'offer', 'a', 'number', 'of', 'comments', 'and', 'clarifications', 'in', 'addition', 'i', 'have', 'made', 'some', 'correction', 'of', 'mistaken', 'claim', 'made', 'by', 'zimmerman', '2017']] | [-0.07667859215030653, 0.05977677152679664, -0.1062129110020275, 0.05477943572396826, -0.11716581425733036, -0.1606253704159624, 0.077671751110918, 0.3237148051874505, -0.15677177663375105, -0.3951758892585834, 0.12331237394052247, -0.3044743964655532, -0.18466558915873368, 0.17606068406538625, -0.18866661984680427, -0.003679344306389491, 0.06075689621890585, -0.00020993483356303638, 3.107020941873391e-05, -0.3775972509963645, 0.23972739171133273, 0.1319160806189757, 0.24435253182633054, 0.06726430447306483, 0.014345965606884824, 0.0016512296472986538, -0.13907584275843368, 0.027441828578917516, -0.145821142103523, 0.10175824946620399, 0.2749275678354833, 0.16386430226266385, 0.3391056887857202, -0.41401001415732835, -0.14724913365725015, 0.046410198791676925, 0.058188940108650264, 0.08288461103155795, -0.07522070691920817, -0.3446005134222408, 0.045446495522951914, -0.181842237434143, -0.1256998194122894, -0.017155451666460268, 0.1521654028031561, -0.05039725912113984, -0.16780663843059707, 0.06665806450570623, 0.11884849081592014, 0.11717114043939444, 0.032738601045113884, -0.17920737892078856, 0.0966430924832821, 0.05373403832264659, 0.07630336171003162, 0.08662056427242028, 0.04327955825461282, -0.08140117205782897, -0.17583784494652516, 0.3353971620400747, -0.019027641727653748, -0.097940166749888, 0.15419249524258904, -0.10267110109432703, -0.17822005620433223, 0.10622234818422133, 0.07848305875021551, 0.051028032735404044, -0.1761976345287015, 0.10745571318677523, -0.09825498736463487, 0.1540242352936831, 0.13489769192205536, -0.07823999369025438, 0.16560183997369474, 0.06416350818342632, -0.0327412177161831, 0.059157754335319626, 0.002771874103281233, -0.021837626759790712, -0.3031355281916654, -0.19555456309786273, -0.16987186376419333, 0.05076642785376559, 0.04911857661306082, -0.09108488470729854, 0.3241464187287622, 0.18615967934537264, 0.13166059703669614, -0.027710102687382863, 0.1897840490978625, 0.05492898305981524, 0.010175252829988797, 0.1419427750269986, 0.27218360567316674, 0.09647038074908779, 0.1328708016831014, -0.07905333045766585, 0.1038505859944659, 0.06469963154134652] |
1,802.09993 | Left semi-braces and solutions to the Yang-Baxter equation | Let $r:X^{2}\rightarrow X^{2}$ be a set-theoretic solution of the Yang-Baxter
equation on a finite set $X$. It was proven by Gateva-Ivanova and Van den Bergh
that if $r$ is non-degenerate and involutive then the algebra $K\langle x \in X
\mid xy =uv \mbox{ if } r(x,y)=(u,v)\rangle$ shares many properties with
commutative polynomial algebras in finitely many variables; in particular this
algebra is Noetherian, satisfies a polynomial identity and has Gelfand-Kirillov
dimension a positive integer. Lebed and Vendramin recently extended this result
to arbitrary non-degenerate bijective solutions. Such solutions are naturally
associated to finite skew left braces. In this paper we will prove an analogue
result for arbitrary solutions $r_B$ that are associated to a left semi-brace
$B$; such solutions can be degenerate or can even be idempotent. In order to do
so we first describe such semi-braces and we prove some decompositions results
extending results of Catino, Colazzo, and Stefanelli.
| math.GR math.QA math.RA | let rx2rightarrow x2 be a settheoretic solution of the yangbaxter equation on a finite set x it was proven by gatevaivanova and van den bergh that if r is nondegenerate and involutive then the algebra klangle x in x mid xy uv mbox if rxyuvrangle shares many properties with commutative polynomial algebras in finitely many variables in particular this algebra is noetherian satisfies a polynomial identity and has gelfandkirillov dimension a positive integer lebed and vendramin recently extended this result to arbitrary nondegenerate bijective solutions such solutions are naturally associated to finite skew left braces in this paper we will prove an analogue result for arbitrary solutions r_b that are associated to a left semibrace b such solutions can be degenerate or can even be idempotent in order to do so we first describe such semibraces and we prove some decompositions results extending results of catino colazzo and stefanelli | [['let', 'rx2rightarrow', 'x2', 'be', 'a', 'settheoretic', 'solution', 'of', 'the', 'yangbaxter', 'equation', 'on', 'a', 'finite', 'set', 'x', 'it', 'was', 'proven', 'by', 'gatevaivanova', 'and', 'van', 'den', 'bergh', 'that', 'if', 'r', 'is', 'nondegenerate', 'and', 'involutive', 'then', 'the', 'algebra', 'klangle', 'x', 'in', 'x', 'mid', 'xy', 'uv', 'mbox', 'if', 'rxyuvrangle', 'shares', 'many', 'properties', 'with', 'commutative', 'polynomial', 'algebras', 'in', 'finitely', 'many', 'variables', 'in', 'particular', 'this', 'algebra', 'is', 'noetherian', 'satisfies', 'a', 'polynomial', 'identity', 'and', 'has', 'gelfandkirillov', 'dimension', 'a', 'positive', 'integer', 'lebed', 'and', 'vendramin', 'recently', 'extended', 'this', 'result', 'to', 'arbitrary', 'nondegenerate', 'bijective', 'solutions', 'such', 'solutions', 'are', 'naturally', 'associated', 'to', 'finite', 'skew', 'left', 'braces', 'in', 'this', 'paper', 'we', 'will', 'prove', 'an', 'analogue', 'result', 'for', 'arbitrary', 'solutions', 'r_b', 'that', 'are', 'associated', 'to', 'a', 'left', 'semibrace', 'b', 'such', 'solutions', 'can', 'be', 'degenerate', 'or', 'can', 'even', 'be', 'idempotent', 'in', 'order', 'to', 'do', 'so', 'we', 'first', 'describe', 'such', 'semibraces', 'and', 'we', 'prove', 'some', 'decompositions', 'results', 'extending', 'results', 'of', 'catino', 'colazzo', 'and', 'stefanelli']] | [-0.164685696512202, 0.07006254046276202, -0.09219929741731095, 0.05480232185072964, -0.11116202368672627, -0.2038365468842029, -0.06645464860210065, 0.352053109711657, -0.3849385740338928, -0.15415562549605966, 0.14125937924755919, -0.3149937243951071, -0.1377645469571386, 0.17321004504386414, -0.1550485463521909, -0.007960234076664265, 0.037055262002266116, 0.07266586552820324, -0.08529589713483195, -0.28003847250753705, 0.3399439481824326, -0.08189775586652104, 0.1450050757525282, 0.04795129473657451, 0.11830419513151152, -0.02677063993178308, 0.0223610662934435, 0.03370614702483484, -0.1835957620873564, 0.04289575742505905, 0.32509653534119326, 0.07849571294971408, 0.24911423626407567, -0.35505277702921173, -0.0837589069075572, 0.22283489187409738, 0.19363051175605506, 0.020205711950742018, -0.03439023607724165, -0.2596413690609754, 0.16886680782686703, -0.2222452506216036, -0.16149651805042392, -0.09647266470872434, 0.12106684154261732, 0.03461550593298549, -0.31981423842565465, 0.015213457693688624, 0.13710575471567507, 0.06012712496643265, -0.0644023893326246, -0.09668972059605746, -0.05511704409501464, 0.020282108725546602, -0.060147403341640406, 0.07045083693083143, 0.012174521674751304, -0.05339625131940314, -0.11985671540929212, 0.3299341006430849, -0.044686035871563945, -0.2432485617658434, 0.15158350076106014, -0.18199948426303714, -0.16708176101868352, 0.07236822295817547, 0.02815395555484833, 0.14068033753169906, -0.08652249810984358, 0.26834741287570474, -0.15747069465901908, 0.10034395228851484, 0.13450710790251227, 0.020639134092359908, 0.14579049464252117, 0.02888981574182657, 0.07515324790357328, 0.1023912680013584, 0.06287349206346941, 0.006242786317468724, -0.3118775610087646, -0.18417321747902962, -0.11748875881312415, 0.20960914245127546, -0.07914476107402556, -0.16035805189231825, 0.3314512688278531, 0.11937114385849175, 0.15767353052635574, 0.06445905103949674, 0.1864995263701227, 0.11619554266599152, 0.03290527879895914, 0.09362427861924516, 0.09785740363460921, 0.202061431928693, 0.00548069618202539, -0.11171630437537614, 0.0019417618039167589, 0.1913944943355293] |
1,802.09994 | Nonlinear Energy Harvesting Models in Wireless Information and Power
Transfer | This work compares different linear and nonlinear RF energy harvesting
models, including limited or unlimited sensitivity, for simultaneous wireless
information and power transfer (SWIPT). The probability of successful SWIPT
reception under a family of RF harvesting models is rigorously quantified,
using state-of-the-art rectifiers in the context of commercial RFIDs. A
significant portion of SWIPT literature uses oversimplified models that do not
account for limited sensitivity or nonlinearity of the underlying harvesting
circuitry. This work demonstrates that communications signals are not always
appropriate for simultaneous energy transfer and concludes that for practical
SWIPT studies, the inherent non-ideal characteristics of the harvester should
be carefully taken into account; specific harvester's modeling methodology is
also offered.
| eess.SP | this work compares different linear and nonlinear rf energy harvesting models including limited or unlimited sensitivity for simultaneous wireless information and power transfer swipt the probability of successful swipt reception under a family of rf harvesting models is rigorously quantified using stateoftheart rectifiers in the context of commercial rfids a significant portion of swipt literature uses oversimplified models that do not account for limited sensitivity or nonlinearity of the underlying harvesting circuitry this work demonstrates that communications signals are not always appropriate for simultaneous energy transfer and concludes that for practical swipt studies the inherent nonideal characteristics of the harvester should be carefully taken into account specific harvesters modeling methodology is also offered | [['this', 'work', 'compares', 'different', 'linear', 'and', 'nonlinear', 'rf', 'energy', 'harvesting', 'models', 'including', 'limited', 'or', 'unlimited', 'sensitivity', 'for', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'the', 'probability', 'of', 'successful', 'swipt', 'reception', 'under', 'a', 'family', 'of', 'rf', 'harvesting', 'models', 'is', 'rigorously', 'quantified', 'using', 'stateoftheart', 'rectifiers', 'in', 'the', 'context', 'of', 'commercial', 'rfids', 'a', 'significant', 'portion', 'of', 'swipt', 'literature', 'uses', 'oversimplified', 'models', 'that', 'do', 'not', 'account', 'for', 'limited', 'sensitivity', 'or', 'nonlinearity', 'of', 'the', 'underlying', 'harvesting', 'circuitry', 'this', 'work', 'demonstrates', 'that', 'communications', 'signals', 'are', 'not', 'always', 'appropriate', 'for', 'simultaneous', 'energy', 'transfer', 'and', 'concludes', 'that', 'for', 'practical', 'swipt', 'studies', 'the', 'inherent', 'nonideal', 'characteristics', 'of', 'the', 'harvester', 'should', 'be', 'carefully', 'taken', 'into', 'account', 'specific', 'harvesters', 'modeling', 'methodology', 'is', 'also', 'offered']] | [-0.17972547244857504, 0.01852309552074896, 0.00516787958455033, 0.019841789727437154, -0.10961467218873776, -0.2535614501767322, 0.03319505339208166, 0.4152488320142822, -0.24693298956741933, -0.2880485595607784, 0.05555895522784903, -0.2587406934749961, -0.14436513341889115, 0.2455908452434696, -0.11661112465096259, 0.08876513634536383, 0.08228391498755828, -0.03553055513617212, -0.008759864519392212, -0.16938493094320484, 0.2692809892793606, 0.16264401147125568, 0.3978754257437138, 0.06875911870697282, 0.11950895995513611, 0.0027624894246722743, -0.0367035419408199, -0.03710413317039477, -0.10132367453486113, 0.12002195670904048, 0.3336023591662975, 0.1593183201605833, 0.307831887485443, -0.47025298834901996, -0.390796619319085, 0.15833925282318903, 0.13338369921785243, 0.07370108412578702, -0.0767006477396688, -0.2114811323220487, 0.07878813557161958, -0.26484760901668164, 0.00928917006265982, -0.04334856023336143, -0.06338786514706712, 0.08254057493275113, -0.2937628772579529, 0.023711709534096227, 0.08920331438127659, 0.05823970567105354, -0.0968217067348367, -0.14351201888206785, -0.0038701907640932938, 0.1523016157180928, -0.013162448875033256, -0.10662533450908794, 0.09534354015888102, -0.12079886166972265, -0.08050270550018918, 0.3541006300432517, 0.014400945203708469, -0.2208323689194116, 0.13306351331581848, -0.04568569990188147, -0.09999972510365851, 0.14536997117926326, 0.2334430411373537, 0.057602499986677304, -0.21826441082547096, 0.06613328955105333, 0.06690344793425329, 0.17662349147969378, 0.04239927792295286, 0.13169696583799953, 0.19673761182291583, 0.18483108672338117, 0.05564007684135134, 0.12533862109448496, -0.07530106642835699, -0.11254168259710345, -0.2347202762746071, -0.08955407222996639, -0.23094073636869414, 0.0884815701327299, -0.024727749120700585, -0.05202684173179147, 0.40748506726746536, 0.16017709026101304, 0.08940380881334432, 0.011201845927048574, 0.4457564324931761, 0.12736412535001218, 0.04957856701901265, 0.040594402061923676, 0.25934837684364975, 0.07752975645532782, 0.17844691007208507, -0.20484976442860423, 0.06814897986771785, -0.0810398640341859] |
1,802.09995 | Comment on "Extended Halogen Bonding between Fully Fluorinated Aromatic
Molecules: Kawai et al., ACS Nano, 2015, 9, 2574" | The nature of fluorine-centered noncovalent interactions between Fully
Fluorinated aromatic molecules is revisited.
| physics.chem-ph cond-mat.mtrl-sci | the nature of fluorinecentered noncovalent interactions between fully fluorinated aromatic molecules is revisited | [['the', 'nature', 'of', 'fluorinecentered', 'noncovalent', 'interactions', 'between', 'fully', 'fluorinated', 'aromatic', 'molecules', 'is', 'revisited']] | [-0.1782938070440044, 0.11954680768152078, 0.0034030074942468977, 0.0672141130877814, 0.03698241198435426, -0.17111910165597996, 0.046192096856733166, 0.44312564966579276, -0.3166684750467539, -0.26753049436956644, -0.221168277785182, -0.31915493309497833, -0.16381792863830924, -0.04371646294991175, 0.13722627998019257, -0.11525112607826789, -0.009143137062589327, -0.286575095107158, 0.08677277900278568, -0.17135478556156158, 0.2014240218947331, 0.08901595875310402, 0.25357564135144156, 0.24828134254009152, -0.021649602490166824, -0.02937854457801829, 0.07063798001036048, -0.07688163469235103, -0.1492710905149579, 0.29528432874940336, 0.28222506078115356, -0.23349019760886827, 0.17697570783396563, -0.5039332181525727, -0.2236568407776455, 0.10010640261073907, 0.07138407786260359, 0.189394305460155, -0.06680046099548538, -0.33564432337880135, 0.05141541315242648, -0.11395711358636618, -0.013898690386364857, -0.06647355668246746, 0.10802613788594802, 0.12325030037512381, -0.14728562782208124, 0.1757376065167288, -0.02425042330287397, 0.1402294662160178, -0.10484289680607617, -0.16461570064226785, -0.15189777469883362, 0.07378004825053115, 0.015927747212117538, -0.08465873531531543, 0.2440925029416879, -0.1518991137854755, -0.04443141228208939, 0.5269986850519975, -0.047052010893821716, -0.1401758762076497, 0.3665523926417033, -0.009827245259657502, -0.1270757014863193, 0.28427545353770256, 0.033471487617741026, 0.18348863969246546, -0.2904373562584321, 0.10575461635986964, -0.020458081116278965, 0.25045277333507937, 0.036061347695067525, 0.1554693360812962, 0.26410474100460607, 0.22166329063475132, -0.10509408416692168, 0.13418866662929455, -0.07213316174844901, -0.10516305733472109, -0.12550528720021248, -0.14938177936710417, -0.22984079752738276, -0.014032765524461865, 0.040545338143905006, -0.17518665610502163, 0.2505165703284244, 0.0007398066421349844, 0.0674104734013478, -0.03759877337142825, 0.18794876554359993, -0.12523920182138681, 0.08023407869040966, -0.09792038321029395, 0.3528058254159987, 0.31076934561133385, -0.012910061826308569, -0.3104604008064295, 0.20521455153357238, 0.10065358271822333] |
1,802.09996 | Exact Simulation of reciprocal Archimedean copulas | The decreasing enumeration of the points of a Poisson random measure whose
mean measure has finite survival function on the positive half-axis can be
represented as a non-increasing function of the jump times of a standard
Poisson process. This observation allows to generalize the essential idea from
a well-known exact simulation algorithm for arbitrary extreme-value copulas to
copulas of a more general family of max-infinitely divisible distributions,
with reciprocal Archimedean copulas being a particular example.
| stat.ME | the decreasing enumeration of the points of a poisson random measure whose mean measure has finite survival function on the positive halfaxis can be represented as a nonincreasing function of the jump times of a standard poisson process this observation allows to generalize the essential idea from a wellknown exact simulation algorithm for arbitrary extremevalue copulas to copulas of a more general family of maxinfinitely divisible distributions with reciprocal archimedean copulas being a particular example | [['the', 'decreasing', 'enumeration', 'of', 'the', 'points', 'of', 'a', 'poisson', 'random', 'measure', 'whose', 'mean', 'measure', 'has', 'finite', 'survival', 'function', 'on', 'the', 'positive', 'halfaxis', 'can', 'be', 'represented', 'as', 'a', 'nonincreasing', 'function', 'of', 'the', 'jump', 'times', 'of', 'a', 'standard', 'poisson', 'process', 'this', 'observation', 'allows', 'to', 'generalize', 'the', 'essential', 'idea', 'from', 'a', 'wellknown', 'exact', 'simulation', 'algorithm', 'for', 'arbitrary', 'extremevalue', 'copulas', 'to', 'copulas', 'of', 'a', 'more', 'general', 'family', 'of', 'maxinfinitely', 'divisible', 'distributions', 'with', 'reciprocal', 'archimedean', 'copulas', 'being', 'a', 'particular', 'example']] | [-0.07257596023846417, 0.10163732640445232, -0.16189413065711658, 0.12826763983439984, -0.08382762223482132, -0.13879355018337566, 0.04884621340315789, 0.3519507718086243, -0.28505385560293994, -0.2120876838763555, 0.07921586684882641, -0.26046215735705724, -0.125887148908029, 0.1547548773388068, -0.05111031686887145, 0.09174099318683147, -0.038186981867377956, 0.05287182421733936, -0.07096692974989613, -0.24177129092936714, 0.31108768299066775, 0.062284077840546764, 0.27667009669045606, -0.02519241457960258, 0.15574893930306039, 0.04953218976351006, -0.06845024888170884, -0.008723635760058338, -0.13713143614431222, 0.1174129548917214, 0.24842909568920732, 0.0919774504052475, 0.3135624352035423, -0.33361252148946124, -0.20285566706365596, 0.2305289215967059, 0.1295867884904146, 0.015642066908379396, -0.009081835823793275, -0.28267552495002746, 0.05340215250849724, -0.18238104194092253, -0.18771101410190263, -0.046569299946228666, 0.04809683009361227, 0.10851853860542178, -0.35837749431530636, 0.06604587538788716, 0.11890026616553466, 0.046661801002919674, -0.016494161773007363, -0.14967107139372576, -0.00329742265244325, 0.035933179780840874, 0.05140137892177639, 0.028678207697036367, 0.11566879260043303, -0.022466052090749145, -0.14721117108439405, 0.3110278952020841, -0.04070095170289278, -0.2794012896592418, 0.14315501376365622, -0.19552430322548994, -0.12712327416986227, 0.12628290946284929, 0.17792642505839468, 0.13934134937822817, -0.1468724983371794, 0.1177498826260368, -0.11571869660168886, 0.06773563373368234, 0.07780034651358922, -0.05747916426742449, 0.1745522357399265, 0.12440264407234887, 0.13722116489584246, 0.19711763118083278, -0.02468280613422394, -0.13966229448094963, -0.31539723297425853, -0.16250455919265125, -0.2554777305200696, 0.1135164306530108, -0.1811903003261735, -0.2800554246207078, 0.3873107462376356, 0.09566316013224423, 0.2136011925355221, 0.1638206558674574, 0.22009405101339022, 0.18048321577254683, 0.02246932578893999, 0.017090514320880174, 0.015690690316259862, 0.1848756832567354, -0.006273712224016587, -0.09211356916464865, 0.15291153744173547, 0.06229092602928479] |
1,802.09997 | Neutrino masses from Planck-scale lepton number breaking | We consider an extension of the Standard Model by right-handed neutrinos and
we argue that, under plausible assumptions, a neutrino mass of ${\cal
O}(0.1)\,{\rm eV}$ is naturally generated by the breaking of the lepton number
at the Planck scale, possibly by gravitational effects, without the necessity
of introducing new mass scales in the model. Some implications of this
framework are also briefly discussed.
| hep-ph | we consider an extension of the standard model by righthanded neutrinos and we argue that under plausible assumptions a neutrino mass of cal o01rm ev is naturally generated by the breaking of the lepton number at the planck scale possibly by gravitational effects without the necessity of introducing new mass scales in the model some implications of this framework are also briefly discussed | [['we', 'consider', 'an', 'extension', 'of', 'the', 'standard', 'model', 'by', 'righthanded', 'neutrinos', 'and', 'we', 'argue', 'that', 'under', 'plausible', 'assumptions', 'a', 'neutrino', 'mass', 'of', 'cal', 'o01rm', 'ev', 'is', 'naturally', 'generated', 'by', 'the', 'breaking', 'of', 'the', 'lepton', 'number', 'at', 'the', 'planck', 'scale', 'possibly', 'by', 'gravitational', 'effects', 'without', 'the', 'necessity', 'of', 'introducing', 'new', 'mass', 'scales', 'in', 'the', 'model', 'some', 'implications', 'of', 'this', 'framework', 'are', 'also', 'briefly', 'discussed']] | [-0.10010100142549604, 0.2700211991832475, 0.009326737171279327, 0.16392113833177474, -0.05412578020965861, -0.08387340177526517, 0.015264350545382308, 0.30165781506202033, -0.2502493203106907, -0.3284166923033134, 0.07346701804330692, -0.22544717380116064, -0.1007805620620568, 0.16601810342962703, -0.0033364783364137813, 0.010561787358094607, 0.0099942694087663, -0.010461138456218665, -0.08829733093584617, -0.21733280868389673, 0.3970594610117616, 0.1137130974882072, 0.19428264894973366, 0.09230230575438679, 0.09307568353570757, -0.03488596599744333, -0.049479767011718884, -0.0220004363856729, -0.09833265284901098, 0.060590614699908805, 0.10047789400203093, 0.13206360383980698, 0.21610040641239575, -0.43063270988979285, -0.23300690058198187, 0.13839007436387962, 0.08681366186318619, 0.10217523445645647, -0.11578023765656736, -0.31631564057522243, 0.10178188678072465, -0.22468242002651095, -0.17105024689132528, -0.01961878782528783, -0.030616118602695003, -0.06275112727176278, -0.29668805567968276, 0.11542411301531003, 0.025077541576578252, -0.006011659820233622, -0.04022709133982238, -0.1289730356675723, -0.01344689422647559, -0.014216034695686351, 0.184414247514665, -0.04889192133240642, 0.1133938419084335, -0.16069179115771887, -0.12511842443247237, 0.4493609182536602, -0.07575883369727601, -0.19050219735401053, 0.09876970141645401, -0.11790974849023886, -0.1811951165943737, 0.07807337368027337, 0.13076746571929224, 0.06959471997294214, -0.18758232159269672, 0.167182090135494, -0.09117283986040181, 0.15532917386641906, 0.04683739525987016, 0.04864312255484683, 0.2908132320510284, 0.21365949105952056, 0.0644716416004925, 0.060623394565716866, -0.0869909533855295, -0.033855655223071095, -0.4237590043414985, -0.07998776369758191, -0.10982652354775177, 0.05127287624524005, -0.11250806626119284, -0.058175040303819606, 0.40803339297793084, 0.22143369420401512, 0.24590741698780366, 0.058828772096368935, 0.2771913175876703, 0.09244112753226692, 0.08188590097932084, 0.04089902803271769, 0.2661205651787778, 0.09415957329779744, 0.05691004150937642, -0.23501840623606357, -0.004527605176272411, 0.06020928973767666] |
1,802.09998 | Lecture on Quantum Gravity with Perimeter Action and Gravitational
Singularities | Motivated by quantum-mechanical considerations we earlier suggested an
alternative action for discretised quantum gravity which measures the perimeter
of the space-time and has a dimension of length. It is the so called perimeter
action, since it is a "square root" of the area action in gravity and has a new
constant of dimension one in front. The physical reason to introduce the
perimeter/linear action was to suppress singular configurations "spikes" in the
quantum-mechanical integral over geometries. Here we shall consider the
continuous limit of the discretised perimeter/linear action. We shall
demonstrate that in the modified theory during the time evolution of a large
massive star, when a star undergoes a collapse and develops an event horizon
which confines the light, a smaller space-time region will be created behind
the event horizon which is unreachable by test particles. These regions are
located in the places where a standard theory of gravity has singularities. We
are confronted here with a drastically new concept that during the time
evolution of a massive star a space-time region is created which is excluded
from the physical scene, being physically unreachable by test particles or
observables. If this concept is accepted, then it seems plausible that the
gravitational singularities are excluded from the modified theory.
| hep-th gr-qc | motivated by quantummechanical considerations we earlier suggested an alternative action for discretised quantum gravity which measures the perimeter of the spacetime and has a dimension of length it is the so called perimeter action since it is a square root of the area action in gravity and has a new constant of dimension one in front the physical reason to introduce the perimeterlinear action was to suppress singular configurations spikes in the quantummechanical integral over geometries here we shall consider the continuous limit of the discretised perimeterlinear action we shall demonstrate that in the modified theory during the time evolution of a large massive star when a star undergoes a collapse and develops an event horizon which confines the light a smaller spacetime region will be created behind the event horizon which is unreachable by test particles these regions are located in the places where a standard theory of gravity has singularities we are confronted here with a drastically new concept that during the time evolution of a massive star a spacetime region is created which is excluded from the physical scene being physically unreachable by test particles or observables if this concept is accepted then it seems plausible that the gravitational singularities are excluded from the modified theory | [['motivated', 'by', 'quantummechanical', 'considerations', 'we', 'earlier', 'suggested', 'an', 'alternative', 'action', 'for', 'discretised', 'quantum', 'gravity', 'which', 'measures', 'the', 'perimeter', 'of', 'the', 'spacetime', 'and', 'has', 'a', 'dimension', 'of', 'length', 'it', 'is', 'the', 'so', 'called', 'perimeter', 'action', 'since', 'it', 'is', 'a', 'square', 'root', 'of', 'the', 'area', 'action', 'in', 'gravity', 'and', 'has', 'a', 'new', 'constant', 'of', 'dimension', 'one', 'in', 'front', 'the', 'physical', 'reason', 'to', 'introduce', 'the', 'perimeterlinear', 'action', 'was', 'to', 'suppress', 'singular', 'configurations', 'spikes', 'in', 'the', 'quantummechanical', 'integral', 'over', 'geometries', 'here', 'we', 'shall', 'consider', 'the', 'continuous', 'limit', 'of', 'the', 'discretised', 'perimeterlinear', 'action', 'we', 'shall', 'demonstrate', 'that', 'in', 'the', 'modified', 'theory', 'during', 'the', 'time', 'evolution', 'of', 'a', 'large', 'massive', 'star', 'when', 'a', 'star', 'undergoes', 'a', 'collapse', 'and', 'develops', 'an', 'event', 'horizon', 'which', 'confines', 'the', 'light', 'a', 'smaller', 'spacetime', 'region', 'will', 'be', 'created', 'behind', 'the', 'event', 'horizon', 'which', 'is', 'unreachable', 'by', 'test', 'particles', 'these', 'regions', 'are', 'located', 'in', 'the', 'places', 'where', 'a', 'standard', 'theory', 'of', 'gravity', 'has', 'singularities', 'we', 'are', 'confronted', 'here', 'with', 'a', 'drastically', 'new', 'concept', 'that', 'during', 'the', 'time', 'evolution', 'of', 'a', 'massive', 'star', 'a', 'spacetime', 'region', 'is', 'created', 'which', 'is', 'excluded', 'from', 'the', 'physical', 'scene', 'being', 'physically', 'unreachable', 'by', 'test', 'particles', 'or', 'observables', 'if', 'this', 'concept', 'is', 'accepted', 'then', 'it', 'seems', 'plausible', 'that', 'the', 'gravitational', 'singularities', 'are', 'excluded', 'from', 'the', 'modified', 'theory']] | [-0.13077260958534723, 0.18473120308765165, -0.13755705787638284, 0.08904911907095066, -0.08746864854308646, -0.10867350152581211, -0.004895178385749279, 0.3097979533283607, -0.22402354563329963, -0.2549503689793789, 0.11420617915705693, -0.267434132028965, -0.13877162024950168, 0.15090704986776096, -0.08455497260876944, -0.0032535388836286206, 0.033483817510066134, 0.10315758203142796, -0.055551742031441434, -0.2313992817490249, 0.3413765332267894, 0.08406301947245329, 0.21416557617125592, 0.04442505415974428, 0.13057202139108978, -0.032777244546446455, -0.01550270764383258, 0.06666879934834649, -0.1290983822199745, 0.06411126104817874, 0.1945757543452192, 0.13409306043039126, 0.2625300080160012, -0.4235844691306497, -0.25666360650605247, 0.08610809301048661, 0.13627046131830356, 0.12038339965539233, -0.04563979883363317, -0.28686291920606066, 0.06685059552377873, -0.16719919217161042, -0.18320419660382475, 0.012102926400791547, 0.05902470827354613, -0.06611283861352625, -0.23259742963825158, 0.062296374504126, 0.036729787629331656, 0.014032319692021983, -0.04481127903153355, -0.02070580568762973, 0.0019627377134410367, 0.07072461402037514, 0.057790251576413675, 0.05201410664052023, 0.148392457584738, -0.1166512224820987, -0.09823290234575598, 0.4045022407575884, -0.04031405069725813, -0.2035288947638898, 0.18491780439702174, -0.17660736570197746, -0.11528197134260633, 0.12891919631960888, 0.12150882930913265, 0.1480406736606363, -0.17038198388081802, 0.11977725230288976, -0.032583387737310884, 0.1386201176190623, 0.08677286685867334, 0.013930468066429027, 0.27686520717624163, 0.16893353561250996, 0.04821799444214661, 0.13808319606685535, -0.10635268574095909, -0.1393961259096429, -0.3497205927860046, -0.1367756845654497, -0.18136585359844032, 0.05918542449452559, -0.09501352449992935, -0.16586673663308224, 0.3457313262304102, 0.13568150011174704, 0.17173812018959347, 0.025806276682215395, 0.26026061242941206, 0.12661088609917243, 0.11058075971797937, 0.07989660020274277, 0.2729312000517252, 0.07364983073096039, 0.07424013579212543, -0.18788790252399384, 0.01653438119514697, 0.08891812630519631] |
1,802.09999 | Planning Fallacy or Hiding Hand: Which Is the Better Explanation? | This paper asks and answers the question of whether Kahneman's planning
fallacy or Hirschman's Hiding Hand best explain performance in capital
investment projects. I agree with my critics that the Hiding Hand exists, i.e.,
sometimes benefit overruns outweigh cost overruns in project planning and
delivery. Specifically, I show this happens in one fifth of projects, based on
the best and largest dataset that exists. But that was not the main question I
set out to answer. My main question was whether the Hiding Hand is "typical,"
as claimed by Hirschman. I show this is not the case, with 80 percent of
projects not displaying Hiding Hand behavior. Finally, I agree it would be
important to better understand the circumstances where the Hiding Hand actually
works. However, if you want to understand how projects "typically" work, as
Hirschman said he did, then the theories of the planning fallacy, optimism
bias, and strategic misrepresentation - according to which cost overruns and
benefit shortfalls are the norm - will serve you significantly better than the
principle of the Hiding Hand. The latter will lead you astray, because it is a
special case instead of a typical one.
| q-fin.EC | this paper asks and answers the question of whether kahnemans planning fallacy or hirschmans hiding hand best explain performance in capital investment projects i agree with my critics that the hiding hand exists ie sometimes benefit overruns outweigh cost overruns in project planning and delivery specifically i show this happens in one fifth of projects based on the best and largest dataset that exists but that was not the main question i set out to answer my main question was whether the hiding hand is typical as claimed by hirschman i show this is not the case with 80 percent of projects not displaying hiding hand behavior finally i agree it would be important to better understand the circumstances where the hiding hand actually works however if you want to understand how projects typically work as hirschman said he did then the theories of the planning fallacy optimism bias and strategic misrepresentation according to which cost overruns and benefit shortfalls are the norm will serve you significantly better than the principle of the hiding hand the latter will lead you astray because it is a special case instead of a typical one | [['this', 'paper', 'asks', 'and', 'answers', 'the', 'question', 'of', 'whether', 'kahnemans', 'planning', 'fallacy', 'or', 'hirschmans', 'hiding', 'hand', 'best', 'explain', 'performance', 'in', 'capital', 'investment', 'projects', 'i', 'agree', 'with', 'my', 'critics', 'that', 'the', 'hiding', 'hand', 'exists', 'ie', 'sometimes', 'benefit', 'overruns', 'outweigh', 'cost', 'overruns', 'in', 'project', 'planning', 'and', 'delivery', 'specifically', 'i', 'show', 'this', 'happens', 'in', 'one', 'fifth', 'of', 'projects', 'based', 'on', 'the', 'best', 'and', 'largest', 'dataset', 'that', 'exists', 'but', 'that', 'was', 'not', 'the', 'main', 'question', 'i', 'set', 'out', 'to', 'answer', 'my', 'main', 'question', 'was', 'whether', 'the', 'hiding', 'hand', 'is', 'typical', 'as', 'claimed', 'by', 'hirschman', 'i', 'show', 'this', 'is', 'not', 'the', 'case', 'with', '80', 'percent', 'of', 'projects', 'not', 'displaying', 'hiding', 'hand', 'behavior', 'finally', 'i', 'agree', 'it', 'would', 'be', 'important', 'to', 'better', 'understand', 'the', 'circumstances', 'where', 'the', 'hiding', 'hand', 'actually', 'works', 'however', 'if', 'you', 'want', 'to', 'understand', 'how', 'projects', 'typically', 'work', 'as', 'hirschman', 'said', 'he', 'did', 'then', 'the', 'theories', 'of', 'the', 'planning', 'fallacy', 'optimism', 'bias', 'and', 'strategic', 'misrepresentation', 'according', 'to', 'which', 'cost', 'overruns', 'and', 'benefit', 'shortfalls', 'are', 'the', 'norm', 'will', 'serve', 'you', 'significantly', 'better', 'than', 'the', 'principle', 'of', 'the', 'hiding', 'hand', 'the', 'latter', 'will', 'lead', 'you', 'astray', 'because', 'it', 'is', 'a', 'special', 'case', 'instead', 'of', 'a', 'typical', 'one']] | [-0.04737858833008841, 0.040313566293742956, -0.09498576478223823, 0.13429033940570204, -0.17125210840820643, -0.2244851823496335, 0.07666586445832226, 0.34941937749064406, -0.23773852254249428, -0.3209717502446933, 0.1512758009853719, -0.30272633476939825, -0.16367403703226088, 0.17713453937492563, -0.19975506002875776, -0.05768156186724752, 0.09526059070944295, 0.0628041899653337, -0.014349688685630784, -0.3508279196557184, 0.31099610627112, 0.10222533015846348, 0.2686924871291322, 0.0919217129539045, 0.04569306521778878, -0.0359412444053286, -0.02667542959256244, 0.025173734308179915, -0.09472372969035736, 0.1000815551628661, 0.2873869918784156, 0.23276402533337162, 0.3486434494606, -0.40683717158786387, -0.1441658944152393, 0.14266484340711336, 0.15143050149287932, 0.09282996800438018, 0.0025965443377124623, -0.2294016343331774, 0.050984277299736966, -0.1736513993005556, -0.10243244520364163, -0.0073843379553739, 0.026026190458479977, -0.015528315695914494, -0.2041200436676087, -0.004621198968913075, 0.09790504994407218, 0.0313554183818907, -0.010572307067191842, -0.14257259782359824, 0.008209969714055836, 0.15610313419550073, 0.09924776452680341, 0.07222620436326839, 0.13717233281124247, -0.1273133221304249, -0.1311024530621304, 0.4507060482785964, -0.0037513641758330643, -0.15837010123196463, 0.1702024895936758, -0.16085292513272603, -0.1565095563534969, 0.05301339968036938, 0.12061003197035727, 0.08050265363100624, -0.12933776178397238, 0.02600293885276492, -0.044468411673543026, 0.21963218750471142, 0.08934241415035585, 0.0005186733994535439, 0.19813256499025952, 0.15274330799063152, 0.09715751624124914, 0.044926049367583196, -0.01171167635636804, -0.0794204710275715, -0.2683997100550701, -0.15474967364647246, -0.15103387145303598, 0.07446025848333512, 0.021751934753048856, -0.10047549342447697, 0.3135186776394483, 0.2631844803032646, 0.13962993179984312, 0.009457579185498674, 0.32236049830528335, 0.053408188340135276, 0.07778218848855084, 0.10659908881186658, 0.2348860481282189, -0.03445248267703558, 0.11933163833604511, -0.17909936429883952, 0.16513197056958892, 0.00860369554598918] |
1,802.1 | Private Information, Credit Risk and Graph Structure in P2P Lending
Networks | This research investigated the potential for improving Peer-to-Peer (P2P)
credit scoring by using "private information" about communications and travels
of borrowers. We found that P2P borrowers' ego networks exhibit scale-free
behavior driven by underlying preferential attachment mechanisms that connect
borrowers in a fashion that can be used to predict loan profitability. The
projection of these private networks onto networks of mobile phone
communication and geographical locations from mobile phone GPS potentially give
loan providers access to private information through graph and location metrics
which we used to predict loan profitability. Graph topology was found to be an
important predictor of loan profitability, explaining over 5.5% of variability.
Networks of borrower location information explain an additional 19% of the
profitability. Machine learning algorithms were applied to the data set
previously analyzed to develop the predictive model and resulted in a 4%
reduction in mean squared error.
| q-fin.GN cs.SI q-fin.RM | this research investigated the potential for improving peertopeer p2p credit scoring by using private information about communications and travels of borrowers we found that p2p borrowers ego networks exhibit scalefree behavior driven by underlying preferential attachment mechanisms that connect borrowers in a fashion that can be used to predict loan profitability the projection of these private networks onto networks of mobile phone communication and geographical locations from mobile phone gps potentially give loan providers access to private information through graph and location metrics which we used to predict loan profitability graph topology was found to be an important predictor of loan profitability explaining over 55 of variability networks of borrower location information explain an additional 19 of the profitability machine learning algorithms were applied to the data set previously analyzed to develop the predictive model and resulted in a 4 reduction in mean squared error | [['this', 'research', 'investigated', 'the', 'potential', 'for', 'improving', 'peertopeer', 'p2p', 'credit', 'scoring', 'by', 'using', 'private', 'information', 'about', 'communications', 'and', 'travels', 'of', 'borrowers', 'we', 'found', 'that', 'p2p', 'borrowers', 'ego', 'networks', 'exhibit', 'scalefree', 'behavior', 'driven', 'by', 'underlying', 'preferential', 'attachment', 'mechanisms', 'that', 'connect', 'borrowers', 'in', 'a', 'fashion', 'that', 'can', 'be', 'used', 'to', 'predict', 'loan', 'profitability', 'the', 'projection', 'of', 'these', 'private', 'networks', 'onto', 'networks', 'of', 'mobile', 'phone', 'communication', 'and', 'geographical', 'locations', 'from', 'mobile', 'phone', 'gps', 'potentially', 'give', 'loan', 'providers', 'access', 'to', 'private', 'information', 'through', 'graph', 'and', 'location', 'metrics', 'which', 'we', 'used', 'to', 'predict', 'loan', 'profitability', 'graph', 'topology', 'was', 'found', 'to', 'be', 'an', 'important', 'predictor', 'of', 'loan', 'profitability', 'explaining', 'over', '55', 'of', 'variability', 'networks', 'of', 'borrower', 'location', 'information', 'explain', 'an', 'additional', '19', 'of', 'the', 'profitability', 'machine', 'learning', 'algorithms', 'were', 'applied', 'to', 'the', 'data', 'set', 'previously', 'analyzed', 'to', 'develop', 'the', 'predictive', 'model', 'and', 'resulted', 'in', 'a', '4', 'reduction', 'in', 'mean', 'squared', 'error']] | [-0.12583272231116505, -0.012563711396571055, -0.053246015085485474, 0.13369087875772526, -0.09949470929287631, -0.21028405433713362, 0.14810310031512175, 0.4277100823370033, -0.2846013854129304, -0.3354931350797415, 0.08842146491505415, -0.3096666147868181, -0.16407517681925976, 0.14303898388712571, -0.16196797642985294, 0.027834027106391972, 0.03609607380028043, 0.05717896340607569, 0.06426172026900719, -0.3234490103847026, 0.2532293765645089, 0.08833728334384745, 0.3609346728635438, 0.07328482094172645, 0.052042003058635725, 0.0071897707638684015, -0.058506428430274385, -0.010548891019525712, -0.10312638389953244, 0.17520708891433656, 0.32967080625962336, 0.22139766910755684, 0.3376703678277032, -0.43391674999147656, -0.21393175760669442, 0.1410373917684473, 0.13820518754615352, 0.02135733130853623, -0.017329842768256262, -0.3376039506417924, 0.07479511244896928, -0.25262781727159844, -0.07102438781153539, -0.07017466879192868, 0.013577508820413515, 0.051923114258860203, -0.2807608794011497, 0.0024453616155118776, -0.026038841598121257, 0.10013736826207104, -0.03242433299149933, -0.08905031396365114, -0.04641976277665075, 0.2343928891523131, 0.05870344069031677, -0.008146096964302504, 0.20403751310539142, -0.1359739101198823, -0.2031789692343566, 0.3429940166915285, -0.022574053124669168, -0.13790714219854824, 0.10703533881440244, -0.047106302625917154, -0.12037109619263431, 0.1122228567456377, 0.301063960951207, -0.019629889309149363, -0.24099121091341408, -0.04127349492066122, -0.013972848797104611, 0.17770824618798134, 0.08738093902196349, 0.01814555540713, 0.18275749907539837, 0.19426835903833653, 0.0927138067878269, 0.0528524085493951, -0.08741637238076534, -0.1303644295781851, -0.14358462921167114, -0.09695935109309081, -0.1854972113501923, 0.07136756942992838, -0.15682273992329257, -0.151977990130926, 0.3786593509902214, 0.20268404047358138, 0.15695946325130503, 0.06593233609074277, 0.2783509384359008, 0.013055658500324453, 0.11398787282343055, 0.17352072840139013, 0.1819451499746406, 0.00561533328627461, 0.19140181956282848, -0.11969743777580302, 0.21488029049259835, -0.002358037875644092] |
1,802.10001 | The Information Content of Sarbanes-Oxley in Predicting Security
Breaches | We investigated publicly reported security breaches of internal controls in
corporate systems to determine whether SOX assessments are information bearing
with respect to breaches which can lead to materially significant losses and
misstatements. SOX Section 404 adverse decisions on effectiveness of controls
occurred in 100% of credit card data breaches and around 33% of insider
breaches. SOX 404 audits provided a contrarian "effective" control decisions on
88% of situations where there was a control breach concerning a portable
device. We found that management and SOX 404 auditors do not general agree on
the underlying internal control situation at any time; instead the SOX 404 team
was likely to discover material weaknesses and "educate" management and
internal audit teams about the importance of these control weaknesses. SOX
attestations were poor at identifying control weaknesses from unintended
disclosures, physical losses, hacking and malware. Hazard and occupancy models
showed that both SOX 302 and 404 section audits provided information on the
frequency of breaches, with SOX 404 being three times as informative as section
302 reports. The hazard model found an expected 2.88% reduction in breaches
when SOX 302 controls are effective; management "material weakness'
attestations provided no information in this structural model, whereas there
would be around a 1% increase in breach occurrence when there are significant
deficiencies. SOX 404 attestations were the most informative, and a negative
SOX 404 attestation is projected to increase the frequency of breaches by
around 8.5%.
| q-fin.GN | we investigated publicly reported security breaches of internal controls in corporate systems to determine whether sox assessments are information bearing with respect to breaches which can lead to materially significant losses and misstatements sox section 404 adverse decisions on effectiveness of controls occurred in 100 of credit card data breaches and around 33 of insider breaches sox 404 audits provided a contrarian effective control decisions on 88 of situations where there was a control breach concerning a portable device we found that management and sox 404 auditors do not general agree on the underlying internal control situation at any time instead the sox 404 team was likely to discover material weaknesses and educate management and internal audit teams about the importance of these control weaknesses sox attestations were poor at identifying control weaknesses from unintended disclosures physical losses hacking and malware hazard and occupancy models showed that both sox 302 and 404 section audits provided information on the frequency of breaches with sox 404 being three times as informative as section 302 reports the hazard model found an expected 288 reduction in breaches when sox 302 controls are effective management material weakness attestations provided no information in this structural model whereas there would be around a 1 increase in breach occurrence when there are significant deficiencies sox 404 attestations were the most informative and a negative sox 404 attestation is projected to increase the frequency of breaches by around 85 | [['we', 'investigated', 'publicly', 'reported', 'security', 'breaches', 'of', 'internal', 'controls', 'in', 'corporate', 'systems', 'to', 'determine', 'whether', 'sox', 'assessments', 'are', 'information', 'bearing', 'with', 'respect', 'to', 'breaches', 'which', 'can', 'lead', 'to', 'materially', 'significant', 'losses', 'and', 'misstatements', 'sox', 'section', '404', 'adverse', 'decisions', 'on', 'effectiveness', 'of', 'controls', 'occurred', 'in', '100', 'of', 'credit', 'card', 'data', 'breaches', 'and', 'around', '33', 'of', 'insider', 'breaches', 'sox', '404', 'audits', 'provided', 'a', 'contrarian', 'effective', 'control', 'decisions', 'on', '88', 'of', 'situations', 'where', 'there', 'was', 'a', 'control', 'breach', 'concerning', 'a', 'portable', 'device', 'we', 'found', 'that', 'management', 'and', 'sox', '404', 'auditors', 'do', 'not', 'general', 'agree', 'on', 'the', 'underlying', 'internal', 'control', 'situation', 'at', 'any', 'time', 'instead', 'the', 'sox', '404', 'team', 'was', 'likely', 'to', 'discover', 'material', 'weaknesses', 'and', 'educate', 'management', 'and', 'internal', 'audit', 'teams', 'about', 'the', 'importance', 'of', 'these', 'control', 'weaknesses', 'sox', 'attestations', 'were', 'poor', 'at', 'identifying', 'control', 'weaknesses', 'from', 'unintended', 'disclosures', 'physical', 'losses', 'hacking', 'and', 'malware', 'hazard', 'and', 'occupancy', 'models', 'showed', 'that', 'both', 'sox', '302', 'and', '404', 'section', 'audits', 'provided', 'information', 'on', 'the', 'frequency', 'of', 'breaches', 'with', 'sox', '404', 'being', 'three', 'times', 'as', 'informative', 'as', 'section', '302', 'reports', 'the', 'hazard', 'model', 'found', 'an', 'expected', '288', 'reduction', 'in', 'breaches', 'when', 'sox', '302', 'controls', 'are', 'effective', 'management', 'material', 'weakness', 'attestations', 'provided', 'no', 'information', 'in', 'this', 'structural', 'model', 'whereas', 'there', 'would', 'be', 'around', 'a', '1', 'increase', 'in', 'breach', 'occurrence', 'when', 'there', 'are', 'significant', 'deficiencies', 'sox', '404', 'attestations', 'were', 'the', 'most', 'informative', 'and', 'a', 'negative', 'sox', '404', 'attestation', 'is', 'projected', 'to', 'increase', 'the', 'frequency', 'of', 'breaches', 'by', 'around', '85']] | [-0.13964092327999728, 0.03269152357685622, -0.02989556956163142, 0.10491218641242692, -0.08727396876978068, -0.17699674902833068, 0.12541141311376122, 0.3684587279955546, -0.16461455134995048, -0.3801415458236685, 0.16106881807936588, -0.3824497646128293, -0.06489657925752303, 0.19354000156599796, -0.17588678350827347, 0.017348166461548922, 0.05337680834151494, 0.0061934214919650305, 0.04011184205664904, -0.28345021574447554, 0.24898096278387433, 0.09458204723681168, 0.3109515748452395, 0.10932692586211487, 0.06232022998010507, 0.018751234631539167, -0.06875601487821162, -0.05138687494327314, -0.08734419104966946, 0.09790553902469885, 0.3323317488681672, 0.1632568784446145, 0.34445976321585475, -0.37853615088388326, -0.13069242175358037, 0.09024910213969027, 0.10043723987764679, 0.040980532177976176, -0.035638068078939496, -0.31915107885724864, 0.1185057612696255, -0.2666208519930175, -0.09805838265650285, -0.03402402676777759, 0.06986638338130433, -0.0012171872576194195, -0.22484075426376268, 0.05593138642022192, 0.0015633772025466896, 0.14059338855925793, -0.10678195867609853, -0.1518761314766986, -0.07403384892386385, 0.14168637003288798, 0.08593282750225625, 0.01455928397529836, 0.21870948662787365, -0.10838778134590636, -0.1408885084577681, 0.35609389050805473, 0.02522935291393272, -0.10264299075255015, 0.15981455929965402, -0.07178196269912102, -0.13505328892497345, 0.13235873048154947, 0.22052774008722434, 0.010843756871569592, -0.18343358721431285, -0.03444556783288135, 0.03275806160090724, 0.22563344983548936, 0.07609886298693407, 0.0199683101932654, 0.16871187419747002, 0.12371877294693452, 0.05631241022007695, 0.03841846063296543, -0.10491912815487012, -0.07800971007700355, -0.23092444729506192, -0.085225475418459, -0.0476397111294015, 0.06467488025573402, -0.0418489206957626, -0.09989016984084932, 0.3147460531132917, 0.2091314334582421, 0.1431607918580994, -0.03578449802007526, 0.2869675044537871, 0.006318614355889925, 0.08458501703377502, 0.11836400589575836, 0.24357115137924362, -0.0008914049889426678, 0.13483748820751013, -0.1753478945514265, 0.2104742831569941, -0.11245182877173647] |
1,802.10002 | High Aspect Ratio Sub-Micrometer Channels Using Wet Etching: Application
to the Dynamics of Red Blood Cell Transiting through Biomimetic Splenic Slits | Nanoparticles delivering drugs, disseminating cancer cells, and red blood
cells (RBCs) during splenic filtration must deform and pass through the
sub-micrometer and high aspect ratio interstices between the endothelial cells
lining blood vessels. The dynamics of passage of particles/cells through these
slit-like interstices remain poorly understood because the in vitro
reproduction of slits with physiological dimensions in devices compatible with
optical microscopy observations requires expensive technologies. Here, novel
microfluidic PDMS devices containing high aspect ratio slits with
sub-micrometer width are molded on silicon masters using a simple, inexpensive,
and highly flexible method combining standard UV lithography and anisotropic
wet etching. These devices enabled revealing novel modes of deformations of
healthy and diseased RBCs squeezing through splenic-like slits (0.6--2 um 5--10
um 1.6--11 $\mu$m3) under physiological interstitial pressures. At the slit
exit, the cytoskeleton of spherocytic RBCs seemed to be detached from the lipid
membrane whereas RBCs from healthy donors and patients with sickle cell disease
exhibited peculiar tips at their front. These tips disappeared much slower in
patients' cells, allowing estimating a threefold increase in RBC cytoplasmic
viscosity in sickle cell disease. Measurements of time and rate of RBC
sequestration in the slits allowed quantifying the massive trapping of
spherocytic RBCs.
| cond-mat.soft physics.bio-ph | nanoparticles delivering drugs disseminating cancer cells and red blood cells rbcs during splenic filtration must deform and pass through the submicrometer and high aspect ratio interstices between the endothelial cells lining blood vessels the dynamics of passage of particlescells through these slitlike interstices remain poorly understood because the in vitro reproduction of slits with physiological dimensions in devices compatible with optical microscopy observations requires expensive technologies here novel microfluidic pdms devices containing high aspect ratio slits with submicrometer width are molded on silicon masters using a simple inexpensive and highly flexible method combining standard uv lithography and anisotropic wet etching these devices enabled revealing novel modes of deformations of healthy and diseased rbcs squeezing through spleniclike slits 062 um 510 um 1611 mum3 under physiological interstitial pressures at the slit exit the cytoskeleton of spherocytic rbcs seemed to be detached from the lipid membrane whereas rbcs from healthy donors and patients with sickle cell disease exhibited peculiar tips at their front these tips disappeared much slower in patients cells allowing estimating a threefold increase in rbc cytoplasmic viscosity in sickle cell disease measurements of time and rate of rbc sequestration in the slits allowed quantifying the massive trapping of spherocytic rbcs | [['nanoparticles', 'delivering', 'drugs', 'disseminating', 'cancer', 'cells', 'and', 'red', 'blood', 'cells', 'rbcs', 'during', 'splenic', 'filtration', 'must', 'deform', 'and', 'pass', 'through', 'the', 'submicrometer', 'and', 'high', 'aspect', 'ratio', 'interstices', 'between', 'the', 'endothelial', 'cells', 'lining', 'blood', 'vessels', 'the', 'dynamics', 'of', 'passage', 'of', 'particlescells', 'through', 'these', 'slitlike', 'interstices', 'remain', 'poorly', 'understood', 'because', 'the', 'in', 'vitro', 'reproduction', 'of', 'slits', 'with', 'physiological', 'dimensions', 'in', 'devices', 'compatible', 'with', 'optical', 'microscopy', 'observations', 'requires', 'expensive', 'technologies', 'here', 'novel', 'microfluidic', 'pdms', 'devices', 'containing', 'high', 'aspect', 'ratio', 'slits', 'with', 'submicrometer', 'width', 'are', 'molded', 'on', 'silicon', 'masters', 'using', 'a', 'simple', 'inexpensive', 'and', 'highly', 'flexible', 'method', 'combining', 'standard', 'uv', 'lithography', 'and', 'anisotropic', 'wet', 'etching', 'these', 'devices', 'enabled', 'revealing', 'novel', 'modes', 'of', 'deformations', 'of', 'healthy', 'and', 'diseased', 'rbcs', 'squeezing', 'through', 'spleniclike', 'slits', '062', 'um', '510', 'um', '1611', 'mum3', 'under', 'physiological', 'interstitial', 'pressures', 'at', 'the', 'slit', 'exit', 'the', 'cytoskeleton', 'of', 'spherocytic', 'rbcs', 'seemed', 'to', 'be', 'detached', 'from', 'the', 'lipid', 'membrane', 'whereas', 'rbcs', 'from', 'healthy', 'donors', 'and', 'patients', 'with', 'sickle', 'cell', 'disease', 'exhibited', 'peculiar', 'tips', 'at', 'their', 'front', 'these', 'tips', 'disappeared', 'much', 'slower', 'in', 'patients', 'cells', 'allowing', 'estimating', 'a', 'threefold', 'increase', 'in', 'rbc', 'cytoplasmic', 'viscosity', 'in', 'sickle', 'cell', 'disease', 'measurements', 'of', 'time', 'and', 'rate', 'of', 'rbc', 'sequestration', 'in', 'the', 'slits', 'allowed', 'quantifying', 'the', 'massive', 'trapping', 'of', 'spherocytic', 'rbcs']] | [-0.06209548521247616, 0.22506138303184084, -0.0012010311635391672, -0.05575051353484088, -0.012011757881941311, -0.23108456803637803, 0.078922779028178, 0.43613007371266355, -0.2074533795785843, -0.24990207049520496, 0.05886801728403804, -0.29373230571307396, -0.1808459494222545, 0.15078452829246608, -0.15353912800521952, 0.01152403672862494, 0.11195122769544358, -0.07856769677980956, 0.10238352911968535, -0.19582767774141868, 0.15421645963868622, 0.031536032307931054, 0.3291057162129377, 0.05378523232428385, 0.1158856247435621, -0.04657653804835198, 0.006592667314737123, -0.008352129993371057, -0.20321253367119982, 0.11762754854328018, 0.284510996202494, 0.01093231117571419, 0.27857135773644714, -0.5584191222311644, -0.23180443679733315, 0.024754627075578486, 0.22728318049410853, 0.07611051754911943, -0.033076161039964656, -0.25320324642412667, 0.03953272786362059, -0.0892027201456474, -0.13613605972390433, 0.016492204070661445, -0.008025178292585651, 0.02681511095267654, -0.22130144435237636, 0.17344322778184765, -0.08994303248841695, 0.17492167997573102, -0.08952826653345552, -0.11487549477095278, -0.09497502093483713, 0.1619099039840987, 0.027042950855149905, -0.032947345797153076, 0.34230557580868126, -0.17308966254302283, -0.01050154748729107, 0.32392888654698143, 0.027749587684318577, -0.14135666987716164, 0.23327174260368932, -0.19317774490004272, -0.0023994452904491704, 0.2253830038885377, 0.13859660890635236, 0.10158271028046087, -0.18734014639630914, -0.08458573773814536, 0.06500115982560935, 0.18841825165115866, 0.2611869212016653, 0.004341546127724708, 0.23288693910046498, 0.27489675505963457, -0.04600966942487095, 0.10295423456379782, -0.16119868925425737, -0.0066201562864934, -0.16273767589258828, -0.19172713727386173, -0.09635797148565667, 0.06524901107257726, -0.11433149558641682, -0.19083706411528306, 0.3151806537442061, 0.019213879597373307, 0.1471148889478562, 0.01250961897372059, 0.293175492472519, -0.08139546219870086, 0.14810728069100224, -0.05116261596249758, 0.1953016804740289, 0.13982182526301679, 0.17061292083532437, -0.2632034212559918, 0.09265453834561821, -0.028398732767601936] |
1,802.10003 | Stock management (Gest\~ao de estoques) | There is a great need to stock materials for production, but storing
materials comes at a cost. Lack of organization in the inventory can result in
a very high cost for the final product, in addition to generating other
problems in the production chain. In this work we present mathematical and
statistical methods applicable to stock management. The stock analysis using
ABC curves serves to identify which are the priority items, the most expensive
and with the highest turnover (demand), and thus determine, through stock
control models, the purchase lot size and the periodicity that minimize the
total costs of storing these materials. Using the Economic Order Quantity (EOQ)
model and the (Q,R) model, the inventory costs of a company were minimized. The
comparison of the results provided by the models was performed.
| q-fin.EC math.OC stat.AP | there is a great need to stock materials for production but storing materials comes at a cost lack of organization in the inventory can result in a very high cost for the final product in addition to generating other problems in the production chain in this work we present mathematical and statistical methods applicable to stock management the stock analysis using abc curves serves to identify which are the priority items the most expensive and with the highest turnover demand and thus determine through stock control models the purchase lot size and the periodicity that minimize the total costs of storing these materials using the economic order quantity eoq model and the qr model the inventory costs of a company were minimized the comparison of the results provided by the models was performed | [['there', 'is', 'a', 'great', 'need', 'to', 'stock', 'materials', 'for', 'production', 'but', 'storing', 'materials', 'comes', 'at', 'a', 'cost', 'lack', 'of', 'organization', 'in', 'the', 'inventory', 'can', 'result', 'in', 'a', 'very', 'high', 'cost', 'for', 'the', 'final', 'product', 'in', 'addition', 'to', 'generating', 'other', 'problems', 'in', 'the', 'production', 'chain', 'in', 'this', 'work', 'we', 'present', 'mathematical', 'and', 'statistical', 'methods', 'applicable', 'to', 'stock', 'management', 'the', 'stock', 'analysis', 'using', 'abc', 'curves', 'serves', 'to', 'identify', 'which', 'are', 'the', 'priority', 'items', 'the', 'most', 'expensive', 'and', 'with', 'the', 'highest', 'turnover', 'demand', 'and', 'thus', 'determine', 'through', 'stock', 'control', 'models', 'the', 'purchase', 'lot', 'size', 'and', 'the', 'periodicity', 'that', 'minimize', 'the', 'total', 'costs', 'of', 'storing', 'these', 'materials', 'using', 'the', 'economic', 'order', 'quantity', 'eoq', 'model', 'and', 'the', 'qr', 'model', 'the', 'inventory', 'costs', 'of', 'a', 'company', 'were', 'minimized', 'the', 'comparison', 'of', 'the', 'results', 'provided', 'by', 'the', 'models', 'was', 'performed']] | [-0.08316969034212614, 0.06719218448129002, -0.0628695042140669, 0.08380356644435476, -0.06406554938152884, -0.12254652975719761, 0.12117130225912358, 0.3899413787294179, -0.27225498387424246, -0.3466223397320419, 0.1359242001728324, -0.3209773706286355, -0.09612721773428899, 0.18854738199363716, -0.0951566240806697, 0.07618839297687043, 0.08081408845221934, 0.003989119414296566, 0.01893973139301648, -0.2806367048655044, 0.25341811126704805, 0.09531396233377921, 0.3114332121472354, 0.05483880671266833, 0.08070230256116977, -0.003053807840015824, -0.0576688460961591, -0.007095292182357022, -0.09791628892074214, 0.1899698051609889, 0.29952912265330134, 0.1252912713257088, 0.319500404466508, -0.43810746526684274, -0.18129948491872655, 0.1381964847043326, 0.05645073439121585, 0.06923306680541966, -0.042268798453733325, -0.1866347102437761, 0.056879299044587904, -0.20215607034377614, -0.0831286083786946, -0.08670897692244386, 0.015380678629629652, 0.011053691898599605, -0.2606027618149352, 0.03431538788286024, -0.031239196227750544, 0.06190281045609013, -0.07589835299365928, -0.14330892993673455, -0.058126239141336446, 0.1622925342136031, 0.10231506848834794, -0.016037258570026042, 0.13302131899223296, -0.1596228108286265, -0.15352779051825177, 0.4359790141637804, -0.03207761689643093, -0.17191923804101394, 0.16070862490398047, -0.11264898057561368, -0.146710780886651, 0.12027985560989966, 0.195217620440279, 0.050244351909151934, -0.1829527558998741, 0.0398314763297094, 0.015191273037061997, 0.1774880274809248, 0.030156795748608245, -0.013048251429361037, 0.18608840517558609, 0.20188735636783708, 0.07243730391686161, 0.14376763846314244, -0.0604525084085198, -0.11106229899980297, -0.25339923186622787, -0.19110741867740272, -0.19303227402975387, 0.019422483597846815, -0.09228226397074953, -0.15235478595202562, 0.3874950072530544, 0.16615246411014128, 0.1510016715981306, 0.05946878477962772, 0.29744265105744655, 0.11925270085604014, 0.08310672894973929, 0.0821513969250108, 0.17269447791587675, 0.018793341066956407, 0.16565279675661726, -0.17843270788117396, 0.16708924341594067, 0.006947499664613243] |
1,802.10004 | Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit
Polynomials | Various key problems from theoretical computer science can be expressed as
polynomial optimization problems over the boolean hypercube. One particularly
successful way to prove complexity bounds for these types of problems are based
on sums of squares (SOS) as nonnegativity certificates. In this article, we
initiate the analysis of optimization problems over the boolean hypercube via a
recent, alternative certificate called sums of nonnegative circuit polynomials
(SONC). We show that key results for SOS based certificates remain valid:
First, for polynomials, which are nonnegative over the $n$-variate boolean
hypercube with constraints of degree $d$ there exists a SONC certificate of
degree at most $n+d$. Second, if there exists a degree $d$ SONC certificate for
nonnegativity of a polynomial over the boolean hypercube, then there also
exists a short degree $d$ SONC certificate, that includes at most $n^{O(d)}$
nonnegative circuit polynomials.
| cs.DS cs.CC math.AG math.OC | various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube one particularly successful way to prove complexity bounds for these types of problems are based on sums of squares sos as nonnegativity certificates in this article we initiate the analysis of optimization problems over the boolean hypercube via a recent alternative certificate called sums of nonnegative circuit polynomials sonc we show that key results for sos based certificates remain valid first for polynomials which are nonnegative over the nvariate boolean hypercube with constraints of degree d there exists a sonc certificate of degree at most nd second if there exists a degree d sonc certificate for nonnegativity of a polynomial over the boolean hypercube then there also exists a short degree d sonc certificate that includes at most nod nonnegative circuit polynomials | [['various', 'key', 'problems', 'from', 'theoretical', 'computer', 'science', 'can', 'be', 'expressed', 'as', 'polynomial', 'optimization', 'problems', 'over', 'the', 'boolean', 'hypercube', 'one', 'particularly', 'successful', 'way', 'to', 'prove', 'complexity', 'bounds', 'for', 'these', 'types', 'of', 'problems', 'are', 'based', 'on', 'sums', 'of', 'squares', 'sos', 'as', 'nonnegativity', 'certificates', 'in', 'this', 'article', 'we', 'initiate', 'the', 'analysis', 'of', 'optimization', 'problems', 'over', 'the', 'boolean', 'hypercube', 'via', 'a', 'recent', 'alternative', 'certificate', 'called', 'sums', 'of', 'nonnegative', 'circuit', 'polynomials', 'sonc', 'we', 'show', 'that', 'key', 'results', 'for', 'sos', 'based', 'certificates', 'remain', 'valid', 'first', 'for', 'polynomials', 'which', 'are', 'nonnegative', 'over', 'the', 'nvariate', 'boolean', 'hypercube', 'with', 'constraints', 'of', 'degree', 'd', 'there', 'exists', 'a', 'sonc', 'certificate', 'of', 'degree', 'at', 'most', 'nd', 'second', 'if', 'there', 'exists', 'a', 'degree', 'd', 'sonc', 'certificate', 'for', 'nonnegativity', 'of', 'a', 'polynomial', 'over', 'the', 'boolean', 'hypercube', 'then', 'there', 'also', 'exists', 'a', 'short', 'degree', 'd', 'sonc', 'certificate', 'that', 'includes', 'at', 'most', 'nod', 'nonnegative', 'circuit', 'polynomials']] | [-0.17260775148003762, 0.0008541067122548287, -0.03253169616717579, 0.05023796850333123, -0.06392275696354253, -0.21271559831885886, 0.01823766840555306, 0.32075442779543145, -0.35220694339202185, -0.23544092440445508, 0.1550334637078257, -0.23149113244310554, -0.21831613683940043, 0.22563741160556675, -0.06796618147220995, 0.10501282940053248, 0.03841012503253296, 0.02719443998565631, -0.06920911513235686, -0.38804530782758123, 0.29150178248362085, -0.0724379354139923, 0.13665752078938698, 0.10664471788331867, 0.13087391096965542, 0.029819437362519758, 0.017338922872607198, 0.027844780776649713, -0.13224146472940837, 0.12149559929468004, 0.33735802678524385, 0.28816789409445065, 0.3219865994993597, -0.41727415152958464, -0.09411197526247374, 0.2299816535519702, 0.13340644004388846, 0.036452769916338314, -0.0326975528940758, -0.17398287170965757, 0.11977775864569204, -0.11433551727636118, -0.10766047438207482, -0.06622510919613497, 0.051463091130634506, 0.04835967305116355, -0.3310570812251951, 0.0012467095343579005, 0.0749030421621033, 0.1114740826389087, 0.05315952415445021, -0.24592367851707553, 0.01590230400324799, 0.006415714772551187, -0.05573718517553061, 0.04244890264568052, 0.021426713198057508, -0.05727345300838351, -0.22155187318567188, 0.32707901998156946, 0.0020843574311584234, -0.22120188545169575, 0.08340494344343564, -0.08921807482173401, -0.23983082687149623, 0.12696708085214986, 0.15711105173187598, 0.1386218621879899, -0.0674252616673974, 0.15549177146250648, -0.18452109088455992, 0.2067817429945405, 0.14749519350672408, 0.06438475198977228, 0.156803652547699, 0.08170849492141445, 0.15432394578653788, 0.16483114836820667, 0.0720834678986908, -0.09696324693504721, -0.3120909541978368, -0.13226809464561354, -0.241646300096597, 0.05379834014872488, -0.1877769456111959, -0.20004349316254125, 0.3885434243561966, 0.07398933770434399, 0.1062578537967056, 0.18275416570665715, 0.25102286739690627, 0.09657277357598235, 0.0520881673104928, 0.09113799509858446, 0.08717240951955318, 0.1788617340980896, 0.040233910709087335, -0.11988218047211247, 0.15402996363201446, 0.14478007411983396] |
1,802.10005 | Curvature as a guiding field for patterns in thin block copolymer films | Experimental data on thin films of cylinder-forming block copolymers (BC) --
free-standing BC membranes as well as supported BC films -- strongly suggest
that the local orientation of the BC patterns is coupled to the geometry in
which the patterns are embedded. We analyze this phenomenon using general
symmetry considerations and numerical self-consistent field studies of curved
BC films in cylindrical geometry. The stability of the films against
curvature-induced dewetting is also analyzed. In good agreement with
experiments, we find that the BC cylinders tend to align along the direction of
curvature at high curvatures. At low curvatures, we identify a transition from
perpendicular to parallel alignment in supported films, which is absent in free
standing membranes. Hence both experiments and theory show that curvature can
be used to manipulate and align BC patterns.
| cond-mat.soft | experimental data on thin films of cylinderforming block copolymers bc freestanding bc membranes as well as supported bc films strongly suggest that the local orientation of the bc patterns is coupled to the geometry in which the patterns are embedded we analyze this phenomenon using general symmetry considerations and numerical selfconsistent field studies of curved bc films in cylindrical geometry the stability of the films against curvatureinduced dewetting is also analyzed in good agreement with experiments we find that the bc cylinders tend to align along the direction of curvature at high curvatures at low curvatures we identify a transition from perpendicular to parallel alignment in supported films which is absent in free standing membranes hence both experiments and theory show that curvature can be used to manipulate and align bc patterns | [['experimental', 'data', 'on', 'thin', 'films', 'of', 'cylinderforming', 'block', 'copolymers', 'bc', 'freestanding', 'bc', 'membranes', 'as', 'well', 'as', 'supported', 'bc', 'films', 'strongly', 'suggest', 'that', 'the', 'local', 'orientation', 'of', 'the', 'bc', 'patterns', 'is', 'coupled', 'to', 'the', 'geometry', 'in', 'which', 'the', 'patterns', 'are', 'embedded', 'we', 'analyze', 'this', 'phenomenon', 'using', 'general', 'symmetry', 'considerations', 'and', 'numerical', 'selfconsistent', 'field', 'studies', 'of', 'curved', 'bc', 'films', 'in', 'cylindrical', 'geometry', 'the', 'stability', 'of', 'the', 'films', 'against', 'curvatureinduced', 'dewetting', 'is', 'also', 'analyzed', 'in', 'good', 'agreement', 'with', 'experiments', 'we', 'find', 'that', 'the', 'bc', 'cylinders', 'tend', 'to', 'align', 'along', 'the', 'direction', 'of', 'curvature', 'at', 'high', 'curvatures', 'at', 'low', 'curvatures', 'we', 'identify', 'a', 'transition', 'from', 'perpendicular', 'to', 'parallel', 'alignment', 'in', 'supported', 'films', 'which', 'is', 'absent', 'in', 'free', 'standing', 'membranes', 'hence', 'both', 'experiments', 'and', 'theory', 'show', 'that', 'curvature', 'can', 'be', 'used', 'to', 'manipulate', 'and', 'align', 'bc', 'patterns']] | [-0.16936415618015382, 0.14026427879673606, -0.06603394963117387, 0.015518206329874069, -0.05070824470043979, -0.1661092140391924, -0.020595943559679197, 0.4680762481697984, -0.2635336162323374, -0.24679703386287197, 0.08153758564420073, -0.2727519711657278, -0.13864106406948265, 0.15042900319659072, -0.029912525738184235, 0.021245497129573167, 0.00447158416633615, -0.049723628481835806, -0.07086110611460421, -0.1782813573554727, 0.2636596907307003, 0.050769084619530586, 0.37975937907960805, 0.0560059302116794, -0.001871645945134992, -0.032361147630220376, 0.06733361491600215, 0.09669184480004638, -0.20863984909368713, 0.0870159542692811, 0.2328102039688672, -0.02131070947729563, 0.1316402205354925, -0.4995032854747909, -0.23405065289842394, -0.016151081043729233, 0.16614796014730143, 0.11813263324416377, -0.08176070533227175, -0.2626641454843392, 0.1517161134437601, -0.04973261785615264, -0.1425983536249126, -0.05191769677335183, -0.04510813121922058, 0.02397564222026645, -0.2387638223479246, 0.09674751735625625, 0.029588019305605527, 0.09053374241099103, -0.0993483847554574, -0.10064836070279214, -0.0870476888816178, 0.08338183758048098, 0.10030614858926878, 0.056191109088853795, 0.1556068243154943, -0.08925433190475496, -0.10904652208359983, 0.3640309251304574, -0.07789723915918836, -0.20608584193958462, 0.19529600269765457, -0.1501880346207332, -0.060466886849945965, 0.12101442392609786, 0.17991278828512736, 0.12349594148401996, -0.10142462925615771, 0.04020870728520428, -0.014323876360218033, 0.18584634171699294, 0.11447450903933921, -0.022426703729800514, 0.22772311143406476, 0.12671667434459993, 0.023711908928594972, 0.15720361524407275, -0.07691014444860736, -0.12704864044883465, -0.26546235578774496, -0.17690167366349288, -0.16652814192939122, 0.016251631113096274, -0.08088670465315405, -0.1997913312422865, 0.34219263886227735, 0.0986193870549723, 0.20677093570013994, -0.004698381963619635, 0.24891559637146327, -0.009075875374495642, 0.0764125467612202, 0.03373165623789639, 0.25996639856798504, 0.20130718256638364, 0.12494280849921585, -0.20510780242740936, 0.06508665780344879, -0.04334668883385549] |
1,802.10006 | A combinatorial characterization of Hurewicz cofibrations between finite
topological spaces | We characterize the Hurewicz cofibrations between finite topological spaces,
that is, the continuous functions between finite topological spaces that have
the homotopy extension property with respect to all topological spaces. In
particular, we show that cofibrations between connected non-empty finite
topological spaces are homotopy equivalences. As a consequence of our
characterization, we obtain a simple algorithm capable of determining whether a
given continuous function between finite topological spaces is a cofibration.
| math.AT math.CO | we characterize the hurewicz cofibrations between finite topological spaces that is the continuous functions between finite topological spaces that have the homotopy extension property with respect to all topological spaces in particular we show that cofibrations between connected nonempty finite topological spaces are homotopy equivalences as a consequence of our characterization we obtain a simple algorithm capable of determining whether a given continuous function between finite topological spaces is a cofibration | [['we', 'characterize', 'the', 'hurewicz', 'cofibrations', 'between', 'finite', 'topological', 'spaces', 'that', 'is', 'the', 'continuous', 'functions', 'between', 'finite', 'topological', 'spaces', 'that', 'have', 'the', 'homotopy', 'extension', 'property', 'with', 'respect', 'to', 'all', 'topological', 'spaces', 'in', 'particular', 'we', 'show', 'that', 'cofibrations', 'between', 'connected', 'nonempty', 'finite', 'topological', 'spaces', 'are', 'homotopy', 'equivalences', 'as', 'a', 'consequence', 'of', 'our', 'characterization', 'we', 'obtain', 'a', 'simple', 'algorithm', 'capable', 'of', 'determining', 'whether', 'a', 'given', 'continuous', 'function', 'between', 'finite', 'topological', 'spaces', 'is', 'a', 'cofibration']] | [-0.15963820284101324, 0.16520108584262116, -0.10942105918755414, 0.16269698303888067, -0.10762601854069762, -0.10928508948902009, 0.026608013167557582, 0.4354328870983191, -0.3621308507633881, -0.15097372931457767, 0.05143404338659693, -0.23818654325646413, -0.18634481314884524, 0.2005029070866622, -0.14776517164526165, 0.01388209138695203, -0.004207899401746903, 0.028266681922258625, -0.16640731200746353, -0.23762786456606758, 0.4493439523372012, -0.14908679745251863, 0.2620724903229619, 0.09402993941863239, 0.1241675880212914, -0.013257264690867193, 0.028435372045709634, 0.07986107392525169, -0.18403587624597492, 0.1241605700531476, 0.32729458156973124, 0.06372454053473095, 0.2600721998113981, -0.3185898808526321, -0.17288395500099155, 0.24569849727649085, 0.06797322565952027, -0.014621624040981414, -0.046767720532879024, -0.3020232565648539, 0.21039477955471253, -0.178147101669874, -0.06771267429453282, -0.14524467780031788, 0.0626317062021666, 0.04961788940282775, -0.2249372977448601, -0.0916552433455494, 0.09726565375819173, 0.11959679841890301, -0.12323303974535264, 0.04825829004895099, -0.11433150889811067, 0.1547351256275261, -0.045735913374736696, 0.049584801669534245, 0.018655496210017254, -0.03177765928353117, -0.1598173457240476, 0.36484680839643724, -0.07327124385923987, -0.2714708860189667, 0.20175548887509906, -0.14849955795831243, -0.1828241769394929, 0.10919608369889394, 0.028381362360652904, 0.1425046988461219, -0.0063797023776971115, 0.19595972398741984, -0.1243779125925101, 0.12384860918030773, 0.05975734928465435, 0.10996391750793431, 0.14957837710603022, 0.1420289963897003, 0.20775307938915638, 0.214050482407632, 0.06096148641097923, -0.053148305023082494, -0.385382038291911, -0.19640700895549126, -0.16354246031079755, 0.0750872725752038, -0.13485088258404548, -0.2904626561302534, 0.3706965273718389, 0.08553583606500441, 0.19196414344773535, 0.15777004173051723, 0.23406725308634865, 0.02741764776382438, -0.010713089624760856, 0.018241285267745107, 0.1289231262996163, 0.245210330293868, -0.04239732698655464, -0.12709793680622963, 0.03424554956998204, 0.2694295310992485] |
1,802.10007 | No-Go Bounds for Quantum Seals | We investigate the feasibility of quantum seals. A quantum seal is a state
provided by Alice to Bob along with information which Bob can use to make a
measurement, "break the seal," and read the classical message stored inside.
There are two success criteria for a seal: the probability Bob can successfully
read the message without any further information from Alice must be high, and
if Alice asks for the state back from Bob, the probability Alice can tell if
Bob broke the seal without permission must be high. We build on the work of
[Chau, PRA 2007], which gave optimal bounds on these criteria, showing that
they are mutually exclusive for high probability. We weaken the assumptions of
this previous work by providing Bob with only a classical description of a
prescribed measurement, rather than classical descriptions of the possible seal
states. We show that this weakening does not affect the bounds but does
simplify the analysis. We also prove upper and lower bounds on an alternative
operational metric for measuring the success criteria.
| quant-ph cs.CR cs.IT math.IT | we investigate the feasibility of quantum seals a quantum seal is a state provided by alice to bob along with information which bob can use to make a measurement break the seal and read the classical message stored inside there are two success criteria for a seal the probability bob can successfully read the message without any further information from alice must be high and if alice asks for the state back from bob the probability alice can tell if bob broke the seal without permission must be high we build on the work of chau pra 2007 which gave optimal bounds on these criteria showing that they are mutually exclusive for high probability we weaken the assumptions of this previous work by providing bob with only a classical description of a prescribed measurement rather than classical descriptions of the possible seal states we show that this weakening does not affect the bounds but does simplify the analysis we also prove upper and lower bounds on an alternative operational metric for measuring the success criteria | [['we', 'investigate', 'the', 'feasibility', 'of', 'quantum', 'seals', 'a', 'quantum', 'seal', 'is', 'a', 'state', 'provided', 'by', 'alice', 'to', 'bob', 'along', 'with', 'information', 'which', 'bob', 'can', 'use', 'to', 'make', 'a', 'measurement', 'break', 'the', 'seal', 'and', 'read', 'the', 'classical', 'message', 'stored', 'inside', 'there', 'are', 'two', 'success', 'criteria', 'for', 'a', 'seal', 'the', 'probability', 'bob', 'can', 'successfully', 'read', 'the', 'message', 'without', 'any', 'further', 'information', 'from', 'alice', 'must', 'be', 'high', 'and', 'if', 'alice', 'asks', 'for', 'the', 'state', 'back', 'from', 'bob', 'the', 'probability', 'alice', 'can', 'tell', 'if', 'bob', 'broke', 'the', 'seal', 'without', 'permission', 'must', 'be', 'high', 'we', 'build', 'on', 'the', 'work', 'of', 'chau', 'pra', '2007', 'which', 'gave', 'optimal', 'bounds', 'on', 'these', 'criteria', 'showing', 'that', 'they', 'are', 'mutually', 'exclusive', 'for', 'high', 'probability', 'we', 'weaken', 'the', 'assumptions', 'of', 'this', 'previous', 'work', 'by', 'providing', 'bob', 'with', 'only', 'a', 'classical', 'description', 'of', 'a', 'prescribed', 'measurement', 'rather', 'than', 'classical', 'descriptions', 'of', 'the', 'possible', 'seal', 'states', 'we', 'show', 'that', 'this', 'weakening', 'does', 'not', 'affect', 'the', 'bounds', 'but', 'does', 'simplify', 'the', 'analysis', 'we', 'also', 'prove', 'upper', 'and', 'lower', 'bounds', 'on', 'an', 'alternative', 'operational', 'metric', 'for', 'measuring', 'the', 'success', 'criteria']] | [-0.10230249392800034, 0.1233321013269181, -0.16809907559039336, 0.07174545560231699, -0.09208130058433328, -0.2611314034089446, 0.1336081349344126, 0.33759320137224025, -0.2274394664301404, -0.3201591211291296, 0.1079643465119547, -0.28752947492658026, -0.054353120449398246, 0.17579223651971135, -0.152384561901646, 0.07401369335395949, 0.08760994314216078, 0.0836947010856654, -0.06447653729036185, -0.28962638259466206, 0.279291392753699, 0.0784972642561687, 0.2828996860714895, 0.06774673625826835, 0.10160535431067859, 0.05645043164491653, -0.020275898027632917, -0.017573593689927034, -0.1590257533424301, 0.07248333152217258, 0.25485246104055215, 0.21404325344599784, 0.2771838823466429, -0.45758537167949337, -0.15357253914432867, 0.1412444211795394, 0.0842770703775542, 0.1435531412477472, -0.02113216375200344, -0.30770551046090466, 0.13201581096542733, -0.16223127827181347, -0.06870943543102061, -0.03893729136458465, -0.04677505586030228, -0.003450828990233796, -0.2608900714825307, -0.016254097975158532, 0.09756171861131277, 0.011320607054014026, 0.016657527925978813, -0.054116529455142365, 0.004151861994926419, 0.20186090055054853, -0.02314244733724211, 0.032362620081486444, 0.1287508336171907, -0.10185014756928597, -0.14299830458792193, 0.2955679857305118, -0.025022136514890006, -0.2033647403546742, 0.1643120937209044, -0.14731483463197947, -0.10804511174958731, 0.06652533187530935, 0.13990274645388126, 0.06875926957066571, -0.1275607159441071, 0.037096459070287115, -0.070367323262617, 0.23160773327840226, 0.11358789950077022, 0.07866567382888336, 0.18691434009798935, 0.03163534365594387, 0.07263859588386758, 0.11368882614986173, -0.038460693386649446, -0.09555193582316861, -0.32595054658395906, -0.20147317357095224, -0.20058687696466224, 0.0914512634710575, -0.037256241839661794, -0.0651306518466611, 0.31593017880937885, 0.1540883695377436, 0.19976105941459538, 0.0421696823289884, 0.33752998823566094, 0.053061746915004086, 0.015267744399711123, 0.14224401168392173, 0.28044136479496956, 0.09278163438130703, 0.06236446917722268, -0.15482986222686512, 0.14944266211773669, 0.0315637832001916] |
1,802.10008 | Nuclear frequency focusing in periodically pulsed semiconductor quantum
dots described by infinite classical central spin models | The coherence of an electronic spin in a semiconductor quantum dot decays due
to its interaction with the bath of nuclear spins in the surrounding isotopes.
This effect can be reduced by subjecting the system to an external magnetic
field and by applying optical pulses. By repeated pulses in long trains the
spin precession can be synchronized to the pulse period $T_\text{R}$. This
drives the nuclear spin bath into states far from equilibrium leading to
nuclear frequency focusing. In this paper, we use an efficient classical
approach introduced in Phys. Rev. B $\textbf{96}$, 054415 (2017) to describe
and to analyze this nuclear focusing. Its dependence on the effective bath size
and on the external magnetic field is elucidated in a comprehensive study. We
find that the characteristics of the pulse as well as the nuclear Zeeman effect
influence the behavior decisively.
| cond-mat.mes-hall | the coherence of an electronic spin in a semiconductor quantum dot decays due to its interaction with the bath of nuclear spins in the surrounding isotopes this effect can be reduced by subjecting the system to an external magnetic field and by applying optical pulses by repeated pulses in long trains the spin precession can be synchronized to the pulse period t_textr this drives the nuclear spin bath into states far from equilibrium leading to nuclear frequency focusing in this paper we use an efficient classical approach introduced in phys rev b textbf96 054415 2017 to describe and to analyze this nuclear focusing its dependence on the effective bath size and on the external magnetic field is elucidated in a comprehensive study we find that the characteristics of the pulse as well as the nuclear zeeman effect influence the behavior decisively | [['the', 'coherence', 'of', 'an', 'electronic', 'spin', 'in', 'a', 'semiconductor', 'quantum', 'dot', 'decays', 'due', 'to', 'its', 'interaction', 'with', 'the', 'bath', 'of', 'nuclear', 'spins', 'in', 'the', 'surrounding', 'isotopes', 'this', 'effect', 'can', 'be', 'reduced', 'by', 'subjecting', 'the', 'system', 'to', 'an', 'external', 'magnetic', 'field', 'and', 'by', 'applying', 'optical', 'pulses', 'by', 'repeated', 'pulses', 'in', 'long', 'trains', 'the', 'spin', 'precession', 'can', 'be', 'synchronized', 'to', 'the', 'pulse', 'period', 't_textr', 'this', 'drives', 'the', 'nuclear', 'spin', 'bath', 'into', 'states', 'far', 'from', 'equilibrium', 'leading', 'to', 'nuclear', 'frequency', 'focusing', 'in', 'this', 'paper', 'we', 'use', 'an', 'efficient', 'classical', 'approach', 'introduced', 'in', 'phys', 'rev', 'b', 'textbf96', '054415', '2017', 'to', 'describe', 'and', 'to', 'analyze', 'this', 'nuclear', 'focusing', 'its', 'dependence', 'on', 'the', 'effective', 'bath', 'size', 'and', 'on', 'the', 'external', 'magnetic', 'field', 'is', 'elucidated', 'in', 'a', 'comprehensive', 'study', 'we', 'find', 'that', 'the', 'characteristics', 'of', 'the', 'pulse', 'as', 'well', 'as', 'the', 'nuclear', 'zeeman', 'effect', 'influence', 'the', 'behavior', 'decisively']] | [-0.11030921069239931, 0.21072914482574562, -0.07257482016326061, 0.024678920453048443, -0.030985339903937918, -0.08826473389885255, 0.037327758838156505, 0.3920806485959994, -0.2584527972420411, -0.30081856845811544, 0.026343366918652984, -0.24959760442974843, -0.0833738753804937, 0.19562544638424048, -0.015247846973527756, -0.017118175458329332, 0.006957832690594452, 0.028365630887648357, -0.054642336547840384, -0.18432640212787582, 0.26123510356794993, 0.08994571368592526, 0.2486265650617757, 0.07527210828515568, 0.06291340683570265, 0.06090874120626333, 0.07356628266258797, -0.0050865589907126765, -0.09985893650970995, 0.030266214871828977, 0.21022962651789254, 0.0049369447798069035, 0.25261280084294935, -0.4978739157518638, -0.1964625822854162, 0.07374541554267385, 0.120598174749674, 0.1906500063171344, -0.04471284974133596, -0.33271150317076326, -0.0018134342223804975, -0.21721932357509754, -0.12049170230498671, -0.10782922742489193, 0.06526282187052337, 0.04000328616571746, -0.24577011193947068, 0.07085196650399926, 0.07282538952921251, 0.0547476492838801, -0.06003703912553777, -0.04857226489028627, 0.019017267937306313, 0.09046467798762023, 0.05741903230248551, 0.08103618812913607, 0.20319884896411428, -0.11811159317980387, -0.11778055776043662, 0.32946957462866394, -0.09125967624110802, -0.13518745454826525, 0.15880550018046052, -0.17524578594186876, -0.05367196462050613, 0.10952317523770035, 0.17919538042042404, 0.11387638695762559, -0.17993578259816526, 0.06710940345531397, 0.021721992741471956, 0.20447768779704348, 0.03700290306171935, 0.07788714637780296, 0.22507155926099845, 0.18023466245005174, 0.022122011488370064, 0.18094204477799525, -0.12022415685267852, -0.08976915771906663, -0.2100859864814473, -0.1035762773926503, -0.20036740438912862, 0.12660495245363562, -0.00471888737655328, -0.11473508353831546, 0.462154981167987, 0.15182415137990443, 0.1663541423888611, -0.09162266315626247, 0.2811169850485125, 0.13102796771397282, 0.0387740521343533, 0.0693657525582239, 0.3024164991054152, 0.21811922495752306, 0.10341526847665332, -0.37664417619983265, 0.01663692331141127, -0.018807829104896104] |
1,802.10009 | Anisotropic Thermal Transport in Phase-Transition Layered 2D Alloys
WSe2(1-x)Te2x | Transition metal dichalcogenide (TMD) alloys have attracted great interests
in recent years due to their tunable electronic properties, especially the
semiconductor-metal phase transition, along with their potential applications
in solid-state memories and thermoelectrics. However, the thermal conductivity
of layered two-dimensional (2D) TMD alloys remains largely unexplored despite
that it plays a critical role in the reliability and functionality of
TMD-enabled devices. In this work, we study the temperature-dependent
anisotropic thermal conductivity of the phase-transition 2D TMD alloys
WSe2(1-x)Te2x in both the in-plane direction (parallel to the basal planes) and
the cross-plane direction (along the c-axis) using time-domain
thermoreflectance measurements. In the WSe2(1-x)Te2x alloys, the cross-plane
thermal conductivity is observed to be dependent on the heating frequency
(modulation frequency of the pump laser) due to the non-equilibrium transport
between different phonon modes. Using a two-channel heat conduction model, we
extracted the anisotropic thermal conductivity at the equilibrium limit. A
clear discontinuity in both the cross-plane and the in-plane thermal
conductivity is observed as x increases from 0.4 to 0.6 due to the phase
transition from the 2H to Td phase in the layered 2D alloys. The temperature
dependence of thermal conductivity for the TMD alloys was found to become
weaker compared with the pristine 2H WSe2 and Td WTe2 due to the atomic
disorder. This work serves as an important starting point for exploring phonon
transport in layered 2D alloys.
| cond-mat.mtrl-sci | transition metal dichalcogenide tmd alloys have attracted great interests in recent years due to their tunable electronic properties especially the semiconductormetal phase transition along with their potential applications in solidstate memories and thermoelectrics however the thermal conductivity of layered twodimensional 2d tmd alloys remains largely unexplored despite that it plays a critical role in the reliability and functionality of tmdenabled devices in this work we study the temperaturedependent anisotropic thermal conductivity of the phasetransition 2d tmd alloys wse21xte2x in both the inplane direction parallel to the basal planes and the crossplane direction along the caxis using timedomain thermoreflectance measurements in the wse21xte2x alloys the crossplane thermal conductivity is observed to be dependent on the heating frequency modulation frequency of the pump laser due to the nonequilibrium transport between different phonon modes using a twochannel heat conduction model we extracted the anisotropic thermal conductivity at the equilibrium limit a clear discontinuity in both the crossplane and the inplane thermal conductivity is observed as x increases from 04 to 06 due to the phase transition from the 2h to td phase in the layered 2d alloys the temperature dependence of thermal conductivity for the tmd alloys was found to become weaker compared with the pristine 2h wse2 and td wte2 due to the atomic disorder this work serves as an important starting point for exploring phonon transport in layered 2d alloys | [['transition', 'metal', 'dichalcogenide', 'tmd', 'alloys', 'have', 'attracted', 'great', 'interests', 'in', 'recent', 'years', 'due', 'to', 'their', 'tunable', 'electronic', 'properties', 'especially', 'the', 'semiconductormetal', 'phase', 'transition', 'along', 'with', 'their', 'potential', 'applications', 'in', 'solidstate', 'memories', 'and', 'thermoelectrics', 'however', 'the', 'thermal', 'conductivity', 'of', 'layered', 'twodimensional', '2d', 'tmd', 'alloys', 'remains', 'largely', 'unexplored', 'despite', 'that', 'it', 'plays', 'a', 'critical', 'role', 'in', 'the', 'reliability', 'and', 'functionality', 'of', 'tmdenabled', 'devices', 'in', 'this', 'work', 'we', 'study', 'the', 'temperaturedependent', 'anisotropic', 'thermal', 'conductivity', 'of', 'the', 'phasetransition', '2d', 'tmd', 'alloys', 'wse21xte2x', 'in', 'both', 'the', 'inplane', 'direction', 'parallel', 'to', 'the', 'basal', 'planes', 'and', 'the', 'crossplane', 'direction', 'along', 'the', 'caxis', 'using', 'timedomain', 'thermoreflectance', 'measurements', 'in', 'the', 'wse21xte2x', 'alloys', 'the', 'crossplane', 'thermal', 'conductivity', 'is', 'observed', 'to', 'be', 'dependent', 'on', 'the', 'heating', 'frequency', 'modulation', 'frequency', 'of', 'the', 'pump', 'laser', 'due', 'to', 'the', 'nonequilibrium', 'transport', 'between', 'different', 'phonon', 'modes', 'using', 'a', 'twochannel', 'heat', 'conduction', 'model', 'we', 'extracted', 'the', 'anisotropic', 'thermal', 'conductivity', 'at', 'the', 'equilibrium', 'limit', 'a', 'clear', 'discontinuity', 'in', 'both', 'the', 'crossplane', 'and', 'the', 'inplane', 'thermal', 'conductivity', 'is', 'observed', 'as', 'x', 'increases', 'from', '04', 'to', '06', 'due', 'to', 'the', 'phase', 'transition', 'from', 'the', '2h', 'to', 'td', 'phase', 'in', 'the', 'layered', '2d', 'alloys', 'the', 'temperature', 'dependence', 'of', 'thermal', 'conductivity', 'for', 'the', 'tmd', 'alloys', 'was', 'found', 'to', 'become', 'weaker', 'compared', 'with', 'the', 'pristine', '2h', 'wse2', 'and', 'td', 'wte2', 'due', 'to', 'the', 'atomic', 'disorder', 'this', 'work', 'serves', 'as', 'an', 'important', 'starting', 'point', 'for', 'exploring', 'phonon', 'transport', 'in', 'layered', '2d', 'alloys']] | [-0.1202637048693687, 0.19524821924027397, -0.036549072237984086, -0.056493270728609365, -0.04119974646853299, -0.13062904846846266, 0.09194552393977075, 0.4605548523893926, -0.2962341914044856, -0.2261639079792462, 0.0012152039588107604, -0.34773413509756856, -0.12390664005981741, 0.20036419108046416, 0.042303073504296816, 0.07969745651322244, -0.057337705325386776, -0.11359571842517935, -0.11372101005574738, -0.16644711047410965, 0.23716860439471768, 0.06809115937325806, 0.39597608104545984, 0.12536446707512755, 0.010650948223666148, 0.006699756735655586, 0.10979093093449761, 0.030787671387681854, -0.16667279814633584, 0.026644493665430792, 0.27482749278393404, -0.19208775213672327, 0.18098202865752103, -0.44899101145730347, -0.25789114129338087, -0.0037331623733517574, 0.11383870569267929, 0.13786838421457967, -0.09826827252673118, -0.21049301208417237, 0.03793776006462563, -0.11758770188419725, -0.08877979038934589, -0.07866676820625461, 0.02074980908598899, -0.024238315905162042, -0.20600085848101737, 0.1276787288272671, 0.05156396893553634, 0.0761126950712858, -0.11988631489438642, -0.17443037278892523, -0.10517901096047949, 0.06407234830028724, 0.06825491988133078, 0.06767368157017169, 0.20326466708798455, -0.14344450023717584, -0.07131289742862294, 0.43628715946281377, -0.04166055213045988, -0.05387016583931534, 0.1653218489723379, -0.18887742233990107, -0.06554045040323708, 0.16459211450177286, 0.15060212088344965, 0.0931564606870401, -0.15401487106321363, 0.06811852978961748, 0.05894083041384553, 0.14694725536904607, 0.0446046892351644, 0.11839225190610263, 0.25615136552832823, 0.2182932703424064, -0.025687660873595593, 0.16157712842970345, -0.12827619210048372, -0.032279491036166064, -0.12887760597915776, -0.21345423328029858, -0.24149818844944898, 0.09819216952315095, -0.12118866072061824, -0.22951778594355007, 0.4096162825938988, 0.1922887369057481, 0.171436550070952, -0.06034567412885269, 0.2627578508479735, 0.12328908816536278, 0.08008665988938801, 0.028997940001020257, 0.28505731877907947, 0.21082039944728656, 0.22806575071618818, -0.28283367138067506, 0.11722338120339736, -0.02718880496490582] |
1,802.1001 | Near-IR transmission spectrum of HAT-P-32 b using HST/WFC3 | We report here the analysis of the near-infrared transit spectrum of the
hot-Jupiter HAT-P-32b which was recorded with the Wide Field Camera 3 (WFC3)
on-board the Hubble Space Telescope (HST). HAT-P-32b is one of the most
inflated exoplanets discovered, making it an excellent candidate for transit
spectroscopic measurements. To obtain the transit spectrum, we have adopted
different analysis methods, both parametric and non parametric (Independent
Component Analysis, ICA), and compared the results. The final spectra are all
consistent within 0.5$\sigma$. The uncertainties obtained with ICA are larger
than those obtained with the parametric method by a factor $\sim$1.6 - 1.8.
This difference is the trade-off for higher objectivity due to the lack of any
assumption about the instrument systematics compared to the parametric
approach. The ICA error-bars are therefore worst-case estimates. To interpret
the spectrum of HAT-P-32b, we used T-Rex, our fully Bayesian spectral retrieval
code. As for other hot-Jupiters, the results are consistent with the presence
of water vapor ($\log{\text{H}_2\text{O}} = -3.45_{-1.65}^{+1.83}$), clouds
(top pressure between 5.16 and 1.73 bar). Spectroscopic data over a broader
wavelength range will be needed to de-correlate the mixing ratio of water vapor
from clouds and identify other possible molecular species in the atmosphere of
HAT-P-32b.
| astro-ph.EP | we report here the analysis of the nearinfrared transit spectrum of the hotjupiter hatp32b which was recorded with the wide field camera 3 wfc3 onboard the hubble space telescope hst hatp32b is one of the most inflated exoplanets discovered making it an excellent candidate for transit spectroscopic measurements to obtain the transit spectrum we have adopted different analysis methods both parametric and non parametric independent component analysis ica and compared the results the final spectra are all consistent within 05sigma the uncertainties obtained with ica are larger than those obtained with the parametric method by a factor sim16 18 this difference is the tradeoff for higher objectivity due to the lack of any assumption about the instrument systematics compared to the parametric approach the ica errorbars are therefore worstcase estimates to interpret the spectrum of hatp32b we used trex our fully bayesian spectral retrieval code as for other hotjupiters the results are consistent with the presence of water vapor logtexth_2texto 345_165183 clouds top pressure between 516 and 173 bar spectroscopic data over a broader wavelength range will be needed to decorrelate the mixing ratio of water vapor from clouds and identify other possible molecular species in the atmosphere of hatp32b | [['we', 'report', 'here', 'the', 'analysis', 'of', 'the', 'nearinfrared', 'transit', 'spectrum', 'of', 'the', 'hotjupiter', 'hatp32b', 'which', 'was', 'recorded', 'with', 'the', 'wide', 'field', 'camera', '3', 'wfc3', 'onboard', 'the', 'hubble', 'space', 'telescope', 'hst', 'hatp32b', 'is', 'one', 'of', 'the', 'most', 'inflated', 'exoplanets', 'discovered', 'making', 'it', 'an', 'excellent', 'candidate', 'for', 'transit', 'spectroscopic', 'measurements', 'to', 'obtain', 'the', 'transit', 'spectrum', 'we', 'have', 'adopted', 'different', 'analysis', 'methods', 'both', 'parametric', 'and', 'non', 'parametric', 'independent', 'component', 'analysis', 'ica', 'and', 'compared', 'the', 'results', 'the', 'final', 'spectra', 'are', 'all', 'consistent', 'within', '05sigma', 'the', 'uncertainties', 'obtained', 'with', 'ica', 'are', 'larger', 'than', 'those', 'obtained', 'with', 'the', 'parametric', 'method', 'by', 'a', 'factor', 'sim16', '18', 'this', 'difference', 'is', 'the', 'tradeoff', 'for', 'higher', 'objectivity', 'due', 'to', 'the', 'lack', 'of', 'any', 'assumption', 'about', 'the', 'instrument', 'systematics', 'compared', 'to', 'the', 'parametric', 'approach', 'the', 'ica', 'errorbars', 'are', 'therefore', 'worstcase', 'estimates', 'to', 'interpret', 'the', 'spectrum', 'of', 'hatp32b', 'we', 'used', 'trex', 'our', 'fully', 'bayesian', 'spectral', 'retrieval', 'code', 'as', 'for', 'other', 'hotjupiters', 'the', 'results', 'are', 'consistent', 'with', 'the', 'presence', 'of', 'water', 'vapor', 'logtexth_2texto', '345_165183', 'clouds', 'top', 'pressure', 'between', '516', 'and', '173', 'bar', 'spectroscopic', 'data', 'over', 'a', 'broader', 'wavelength', 'range', 'will', 'be', 'needed', 'to', 'decorrelate', 'the', 'mixing', 'ratio', 'of', 'water', 'vapor', 'from', 'clouds', 'and', 'identify', 'other', 'possible', 'molecular', 'species', 'in', 'the', 'atmosphere', 'of', 'hatp32b']] | [-0.052362298281308305, 0.08276432799006345, -0.10041621017664897, 0.04662427507315038, -0.0844453249363031, -0.11553589109980474, 0.04922783098446977, 0.39185747918155456, -0.19319891196621505, -0.3677592247494054, 0.12527270686419945, -0.29855808070061185, -0.05839384627773078, 0.22915774375915227, -0.055109464757454894, 0.06364656469638864, 0.1054279994092543, -0.059869537346366075, -0.03599187763286708, -0.24823528026098932, 0.25798547796604004, 0.09014122625560067, 0.2072360346521806, -0.02159204028518588, 0.033900130630089814, -0.04923516223465817, -0.11145871369323383, -0.03486997052110529, -0.16023499139989114, 0.10991423529328195, 0.24563362831226315, 0.1422045300729003, 0.1950096955494673, -0.3245940300497236, -0.24920475427907976, 0.10426335069915336, 0.14275743101130833, 0.05915917626128184, 0.014270899469277473, -0.2923519846494074, 0.06814920347809528, -0.15832861418003272, -0.12237659404160116, -0.02615277203754757, -0.02254167154861727, -0.005291555286149936, -0.26550635894421826, 0.07929575889173782, -0.01193850204310935, 0.1443677294100964, -0.11774897515289297, -0.17727463801551346, -0.05149875478195779, 0.09729723341414949, 0.014966599215198346, 0.028200965829198295, 0.12650236431415182, -0.09170566409275951, -0.034115753068372306, 0.3918340451853124, -0.12793414557572852, -0.07261231161578736, 0.20591526380222705, -0.178797454131071, -0.11940327416776181, 0.1887572631145818, 0.13666069485491725, 0.10693730268806144, -0.18454538170081292, 0.00366687547119165, -0.0176808830101344, 0.24215203144286543, 0.05280270739434983, 0.06932714659452552, 0.22235931136314357, 0.1533666613313012, 0.05272994915639624, 0.08682213595837844, -0.23255951247516682, -0.05388257062360127, -0.23785309478490038, -0.10036706922086652, -0.1401311077760777, -0.005559228891283368, -0.11638433843553583, -0.11632180060295275, 0.36259118554822045, 0.16189916201807192, 0.17156629584673228, 0.04777335744960271, 0.34890599823509805, 0.08378983762602067, 0.08862281363749068, 0.05980709465832045, 0.32550715614166675, 0.1388783246464557, 0.10395986611679704, -0.20634029184543348, 0.07352104093738351, -0.041350150516143803] |
1,802.10011 | Stochastic Control of Computation Offloading to a Helper with a
Dynamically Loaded CPU | Due to densification of wireless networks, there exist abundance of idling
computation resources at edge devices. These resources can be scavenged by
offloading heavy computation tasks from small IoT devices in proximity, thereby
overcoming their limitations and lengthening their battery lives. However,
unlike dedicated servers, the spare resources offered by edge helpers are
random and intermittent. Thus, it is essential for a user to intelligently
control the amounts of data for offloading and local computing so as to ensure
a computation task can be finished in time consuming minimum energy. In this
paper, we design energy-efficient control policies in a computation offloading
system with a random channel and a helper with a dynamically loaded CPU.
Specifically, the policy adopted by the helper aims at determining the sizes of
offloaded and locally-computed data for a given task in different slots such
that the total energy consumption for transmission and local CPU is minimized
under a task-deadline constraint. As the result, the polices endow an
offloading user robustness against channel-and-helper randomness besides
balancing offloading and local computing. By modeling the channel and
helper-CPU as Markov chains, the problem of offloading control is converted
into a Markov-decision process. Though dynamic programming (DP) for numerically
solving the problem does not yield the optimal policies in closed form, we
leverage the procedure to quantify the optimal policy structure and apply the
result to design optimal or sub-optimal policies. For different cases ranging
from zero to large buffers, the low-complexity of the policies overcomes the
"curse-of-dimensionality" in DP arising from joint consideration of channel,
helper CPU and buffer states.
| cs.IT math.IT | due to densification of wireless networks there exist abundance of idling computation resources at edge devices these resources can be scavenged by offloading heavy computation tasks from small iot devices in proximity thereby overcoming their limitations and lengthening their battery lives however unlike dedicated servers the spare resources offered by edge helpers are random and intermittent thus it is essential for a user to intelligently control the amounts of data for offloading and local computing so as to ensure a computation task can be finished in time consuming minimum energy in this paper we design energyefficient control policies in a computation offloading system with a random channel and a helper with a dynamically loaded cpu specifically the policy adopted by the helper aims at determining the sizes of offloaded and locallycomputed data for a given task in different slots such that the total energy consumption for transmission and local cpu is minimized under a taskdeadline constraint as the result the polices endow an offloading user robustness against channelandhelper randomness besides balancing offloading and local computing by modeling the channel and helpercpu as markov chains the problem of offloading control is converted into a markovdecision process though dynamic programming dp for numerically solving the problem does not yield the optimal policies in closed form we leverage the procedure to quantify the optimal policy structure and apply the result to design optimal or suboptimal policies for different cases ranging from zero to large buffers the lowcomplexity of the policies overcomes the curseofdimensionality in dp arising from joint consideration of channel helper cpu and buffer states | [['due', 'to', 'densification', 'of', 'wireless', 'networks', 'there', 'exist', 'abundance', 'of', 'idling', 'computation', 'resources', 'at', 'edge', 'devices', 'these', 'resources', 'can', 'be', 'scavenged', 'by', 'offloading', 'heavy', 'computation', 'tasks', 'from', 'small', 'iot', 'devices', 'in', 'proximity', 'thereby', 'overcoming', 'their', 'limitations', 'and', 'lengthening', 'their', 'battery', 'lives', 'however', 'unlike', 'dedicated', 'servers', 'the', 'spare', 'resources', 'offered', 'by', 'edge', 'helpers', 'are', 'random', 'and', 'intermittent', 'thus', 'it', 'is', 'essential', 'for', 'a', 'user', 'to', 'intelligently', 'control', 'the', 'amounts', 'of', 'data', 'for', 'offloading', 'and', 'local', 'computing', 'so', 'as', 'to', 'ensure', 'a', 'computation', 'task', 'can', 'be', 'finished', 'in', 'time', 'consuming', 'minimum', 'energy', 'in', 'this', 'paper', 'we', 'design', 'energyefficient', 'control', 'policies', 'in', 'a', 'computation', 'offloading', 'system', 'with', 'a', 'random', 'channel', 'and', 'a', 'helper', 'with', 'a', 'dynamically', 'loaded', 'cpu', 'specifically', 'the', 'policy', 'adopted', 'by', 'the', 'helper', 'aims', 'at', 'determining', 'the', 'sizes', 'of', 'offloaded', 'and', 'locallycomputed', 'data', 'for', 'a', 'given', 'task', 'in', 'different', 'slots', 'such', 'that', 'the', 'total', 'energy', 'consumption', 'for', 'transmission', 'and', 'local', 'cpu', 'is', 'minimized', 'under', 'a', 'taskdeadline', 'constraint', 'as', 'the', 'result', 'the', 'polices', 'endow', 'an', 'offloading', 'user', 'robustness', 'against', 'channelandhelper', 'randomness', 'besides', 'balancing', 'offloading', 'and', 'local', 'computing', 'by', 'modeling', 'the', 'channel', 'and', 'helpercpu', 'as', 'markov', 'chains', 'the', 'problem', 'of', 'offloading', 'control', 'is', 'converted', 'into', 'a', 'markovdecision', 'process', 'though', 'dynamic', 'programming', 'dp', 'for', 'numerically', 'solving', 'the', 'problem', 'does', 'not', 'yield', 'the', 'optimal', 'policies', 'in', 'closed', 'form', 'we', 'leverage', 'the', 'procedure', 'to', 'quantify', 'the', 'optimal', 'policy', 'structure', 'and', 'apply', 'the', 'result', 'to', 'design', 'optimal', 'or', 'suboptimal', 'policies', 'for', 'different', 'cases', 'ranging', 'from', 'zero', 'to', 'large', 'buffers', 'the', 'lowcomplexity', 'of', 'the', 'policies', 'overcomes', 'the', 'curseofdimensionality', 'in', 'dp', 'arising', 'from', 'joint', 'consideration', 'of', 'channel', 'helper', 'cpu', 'and', 'buffer', 'states']] | [-0.18645457372289556, 0.05563121367758726, -0.025032405098972393, 0.031676527217666804, -0.07565834676592373, -0.23742997147641037, 0.18370041591810177, 0.39156147787192214, -0.3213392799637143, -0.3325779591019215, 0.11540159716337645, -0.23558276879153117, -0.09528536991172926, 0.15626216950093563, -0.1317957506741599, 0.10411980955242432, 0.08505230146973669, 0.011417027590832449, -0.01034774222725266, -0.24769765274804953, 0.27176592029836893, 0.11283562089453718, 0.3473045490176756, 0.04818434986108084, 0.06481492912235251, 0.0016372201742257835, -0.009311159110678605, -0.024181283483784677, -0.07115651280434766, 0.1159178146475641, 0.349798875745357, 0.18154521759458667, 0.3358448527740324, -0.4856602476852, -0.20453788858681354, 0.09783356785570053, 0.15230258914927208, 0.06606072241525245, -0.036995323305379225, -0.23656309709357198, 0.15028687054652345, -0.2195444745688461, -0.016221047016181045, -0.04663253520333836, -2.250484959763843e-05, 0.028066799422282032, -0.32981343902471516, -0.009836632455157679, -0.017991641133413613, 0.005950941844994939, -0.07767910530347136, -0.08533488520260453, -0.002467942584753614, 0.19383414232626903, 0.02747914922239111, -0.015802267270141043, 0.1671637509175208, -0.14644509135084877, -0.14244439023458436, 0.3964705131984092, 0.04157752674361763, -0.20502169281803795, 0.14815422400354783, -0.002682948744469575, -0.1200745280366391, 0.13760184870298245, 0.24018799543133468, 0.08156205104508747, -0.18426854827810374, 0.05612743510314184, 0.029226263479668963, 0.15003155725250064, 0.07368250255826717, 0.07683705827834937, 0.16256681999801695, 0.20049053089433286, 0.15946502921075828, 0.1582047765931952, -0.05230272409069359, -0.13390710799731026, -0.21376114585184197, -0.14633269987160216, -0.22707521014593274, 0.02243515725664717, -0.09404549534063039, -0.08304857227648067, 0.3340796476704711, 0.13307171319647468, 0.14755103958846438, 0.11781819194426459, 0.3877701774210662, 0.11440240562570375, 0.10803745910633615, 0.18118210778483226, 0.12608153766220573, 0.023290682604888143, 0.16572774678483143, -0.2580471787781747, 0.11014398774179511, -0.01643788896847603] |
1,802.10012 | Integral points on generalised affine Ch\^atelet surfaces | We show, conditionally on Schinzel's hypothesis, that the only obstruction to
the integral Hasse principle for generalised affine Ch\^{a}telet surfaces is
the Brauer--Manin one.
| math.NT math.AG | we show conditionally on schinzels hypothesis that the only obstruction to the integral hasse principle for generalised affine chatelet surfaces is the brauermanin one | [['we', 'show', 'conditionally', 'on', 'schinzels', 'hypothesis', 'that', 'the', 'only', 'obstruction', 'to', 'the', 'integral', 'hasse', 'principle', 'for', 'generalised', 'affine', 'chatelet', 'surfaces', 'is', 'the', 'brauermanin', 'one']] | [-0.22699048540865382, 0.032534714710588254, -0.1808136423739294, 0.22098392685196208, -0.16647953493520617, -0.17414106599365672, 0.01691862513932089, 0.27782163117080927, -0.36713932241157937, -0.1891164651606232, 0.10137109842617065, -0.19239213899709284, -0.18611189428096017, 0.21708347151676813, -0.2092248062059904, 0.010538418234015504, 0.050719617128682636, 0.06685994198778644, -0.028048657569646213, -0.4088936431022982, 0.4441773481667042, -0.07646761741489172, 0.2861740117271741, 0.11854873704335962, 0.21445221857478222, 0.09265713539207354, 0.10435783420689404, -0.0046626938371143, -0.14673206428566724, 0.10242459175545567, 0.2936545239451031, 0.0760472128749825, 0.19516922704254588, -0.3881088704025994, -0.1703529490623623, 0.22824333957396448, 0.025700102172171075, 0.03852656716480851, 0.019968883688610124, -0.2630053947214037, 0.08000749857941021, -0.10131586172307532, -0.23282310642146817, -0.048116186051629484, -0.05487867956981063, 0.0168747678399086, -0.2161799231932188, 0.012140034794962654, 0.13488397964586815, 0.12611809613493583, -0.07537338591646403, -0.05637645376070092, -0.06454956764355302, -0.05354201328009367, 0.03313825146566766, 0.0033353392694455883, 0.04839840242251133, 0.011811370650927225, -0.13356487573279688, 0.2873944886960089, -0.06804353328576933, -0.24332759521591166, 0.10723742419698586, -0.14248110559613755, -0.29071652206281823, 0.18615261286807558, -0.016504763392731547, 0.16356201085727662, -0.03728333938245972, 0.19433923709827164, -0.14878808225815496, 0.07353717686297993, 0.1293454742214332, -0.16003692776818448, 0.13070318867297223, -0.028480135835707188, 0.12394609570037574, 0.016969542329510052, -0.09482236287052122, -0.04459935172538584, -0.4579455970476071, -0.2974673695862293, -0.17511718173045665, 0.1419711960867668, -0.08920014478402057, -0.18740764555210868, 0.24555765480423966, 0.10296623067309459, 0.02677196586349358, 0.1846712346887216, 0.17974944994784892, 0.06284082933173825, 0.06464007403701544, 0.0401442987495102, 0.23492625792277977, 0.2130124322914829, -0.12378591312638794, -0.13514346078348657, 0.07390327728353441, 0.3081296590777735] |
1,802.10013 | Clogging and Transport of Driven Particles in Asymmetric Funnel Arrays | We numerically examine the flow and clogging of particles driven through
asymmetric funnel arrays when the commensurability ratio of the number of
particles per plaquette is varied. The particle-particle interactions are
modeled with a soft repulsive potential that could represent vortex flow in
type-II superconductors or driven charged colloids. The velocity-force curves
for driving in the easy flow direction of the funnels exhibit a single
depinning threshold; however, for driving in the hard flow direction, we find
that there can be both negative mobility where the velocity decreases with
increasing driving force as well as a reentrant pinning effect in which the
particles flow at low drives but become pinned at intermediate drives. This
reentrant pinning is associated with a transition from smooth one-dimensional
flow at low drives to a clogged state at higher drives that occurs when the
particles cluster in a small number of plaquettes and block the flow. When the
drive is further increased, particle rearrangements occur that cause the clog
to break apart. We map out the regimes in which the pinned, flowing, and
clogged states appear as a function of plaquette filling and drive. The clogged
states remain robust at finite temperatures but develop intermittent bursts of
flow in which a clog temporarily breaks apart but quickly reforms.
| cond-mat.soft cond-mat.stat-mech | we numerically examine the flow and clogging of particles driven through asymmetric funnel arrays when the commensurability ratio of the number of particles per plaquette is varied the particleparticle interactions are modeled with a soft repulsive potential that could represent vortex flow in typeii superconductors or driven charged colloids the velocityforce curves for driving in the easy flow direction of the funnels exhibit a single depinning threshold however for driving in the hard flow direction we find that there can be both negative mobility where the velocity decreases with increasing driving force as well as a reentrant pinning effect in which the particles flow at low drives but become pinned at intermediate drives this reentrant pinning is associated with a transition from smooth onedimensional flow at low drives to a clogged state at higher drives that occurs when the particles cluster in a small number of plaquettes and block the flow when the drive is further increased particle rearrangements occur that cause the clog to break apart we map out the regimes in which the pinned flowing and clogged states appear as a function of plaquette filling and drive the clogged states remain robust at finite temperatures but develop intermittent bursts of flow in which a clog temporarily breaks apart but quickly reforms | [['we', 'numerically', 'examine', 'the', 'flow', 'and', 'clogging', 'of', 'particles', 'driven', 'through', 'asymmetric', 'funnel', 'arrays', 'when', 'the', 'commensurability', 'ratio', 'of', 'the', 'number', 'of', 'particles', 'per', 'plaquette', 'is', 'varied', 'the', 'particleparticle', 'interactions', 'are', 'modeled', 'with', 'a', 'soft', 'repulsive', 'potential', 'that', 'could', 'represent', 'vortex', 'flow', 'in', 'typeii', 'superconductors', 'or', 'driven', 'charged', 'colloids', 'the', 'velocityforce', 'curves', 'for', 'driving', 'in', 'the', 'easy', 'flow', 'direction', 'of', 'the', 'funnels', 'exhibit', 'a', 'single', 'depinning', 'threshold', 'however', 'for', 'driving', 'in', 'the', 'hard', 'flow', 'direction', 'we', 'find', 'that', 'there', 'can', 'be', 'both', 'negative', 'mobility', 'where', 'the', 'velocity', 'decreases', 'with', 'increasing', 'driving', 'force', 'as', 'well', 'as', 'a', 'reentrant', 'pinning', 'effect', 'in', 'which', 'the', 'particles', 'flow', 'at', 'low', 'drives', 'but', 'become', 'pinned', 'at', 'intermediate', 'drives', 'this', 'reentrant', 'pinning', 'is', 'associated', 'with', 'a', 'transition', 'from', 'smooth', 'onedimensional', 'flow', 'at', 'low', 'drives', 'to', 'a', 'clogged', 'state', 'at', 'higher', 'drives', 'that', 'occurs', 'when', 'the', 'particles', 'cluster', 'in', 'a', 'small', 'number', 'of', 'plaquettes', 'and', 'block', 'the', 'flow', 'when', 'the', 'drive', 'is', 'further', 'increased', 'particle', 'rearrangements', 'occur', 'that', 'cause', 'the', 'clog', 'to', 'break', 'apart', 'we', 'map', 'out', 'the', 'regimes', 'in', 'which', 'the', 'pinned', 'flowing', 'and', 'clogged', 'states', 'appear', 'as', 'a', 'function', 'of', 'plaquette', 'filling', 'and', 'drive', 'the', 'clogged', 'states', 'remain', 'robust', 'at', 'finite', 'temperatures', 'but', 'develop', 'intermittent', 'bursts', 'of', 'flow', 'in', 'which', 'a', 'clog', 'temporarily', 'breaks', 'apart', 'but', 'quickly', 'reforms']] | [-0.18602578565609498, 0.2948642929178606, -0.05945617857442714, 0.033597880801975184, -0.016011573593984817, -0.200638165435111, 0.05718788641456847, 0.3704237653021242, -0.299633694646504, -0.2683651776866279, 0.06800872459406462, -0.29339853967124585, -0.10450504113211703, 0.15089375513196954, 0.014418445260836764, -0.02836492598333348, -0.007726554620569406, 0.010525943604002799, -0.034028834059939415, -0.15975386996211335, 0.25234593502070946, -0.0008862087931571432, 0.2937495956381022, 0.07999720116377647, 0.09030683632467834, -0.02589683249011251, 0.0812478082685211, 0.0802852905840731, -0.12334408520687012, -0.003425804147728557, 0.2038084776556128, -0.06699816950819862, 0.2466776377036118, -0.45680091219643754, -0.21036797594672568, 0.09993775846204882, 0.21036515203129694, 0.13027230775100726, -0.07287970577921946, -0.23352681702722144, 0.05515671592695472, -0.15747468294947464, -0.16921915832093695, -0.03412564738955296, 0.0348601329144191, 0.05635163444804876, -0.24942967768741045, 0.14016563092476467, 0.06291619056186468, 0.05983278311093823, -0.05763674618024816, -0.021206731431704328, -0.08050430903294312, 0.12302735645939955, 0.09006960208291634, 0.0765499965759965, 0.22770635401086767, -0.20052219919768544, -0.05116716725095897, 0.3767401126405758, -0.027334019999749992, -0.15773751276672027, 0.2256948239215925, -0.16201473070535932, -0.09330307741697545, 0.22657712332099816, 0.18030675417063713, 0.0611342131745009, -0.05118544703695711, -0.011084361030543092, -0.0001650740088623874, 0.15977090344851194, 0.0776397355246257, -0.02844439180100013, 0.2925385655813409, 0.1666489575996103, 0.10071287857272396, 0.20367394043176387, -0.1359576841446291, -0.1453993399255852, -0.27086293181303905, -0.10563328915861536, -0.16544438345399315, 0.03275182456687582, -0.07482128394939805, -0.1907871059883176, 0.33479041228411904, 0.10713692474345121, 0.2322101672430044, 0.005017286994573201, 0.24154185113265342, 0.12153275322634727, 0.08790453938612093, 0.1184288370466743, 0.2578388186162906, 0.08314466682326119, 0.138663288320911, -0.24513236860123774, 0.06329594065840771, 0.01977363523826038] |
1,802.10014 | Dynamics of open quantum systems | A tutorial introduction is presented for the calculation of the time dynamics
for models of dissipative quantum mechanics where a small quantum system is
coupled to noninteracting bosonic or fermionic reservoirs. We discuss the
basics and applications of the real-time renormalization group method (RTRG),
where the Fourier variable $E$ conjugate to the time variable $t$ is used as
flow parameter. It is shown how a well-controlled perturbation theory can be
set up in the coupling to the bath where secular and logarithmic terms are
resummed to all order of perturbation theory. This is achieved by a set of
perturbative RG equations for the effective Liouvillian and the effective
vertices. Truncating the RG equations we show how the time dynamics can be
obtained analytically for exponentially small, intermediate and exponentially
large times. Basic applications are discussed for particle and potential energy
exchange within the interacting resonant level model, spin exchange for the
nonequilibrium Kondo model, and heat exchange within the ohmic spin boson model
at zero bias.
| cond-mat.stat-mech cond-mat.str-el | a tutorial introduction is presented for the calculation of the time dynamics for models of dissipative quantum mechanics where a small quantum system is coupled to noninteracting bosonic or fermionic reservoirs we discuss the basics and applications of the realtime renormalization group method rtrg where the fourier variable e conjugate to the time variable t is used as flow parameter it is shown how a wellcontrolled perturbation theory can be set up in the coupling to the bath where secular and logarithmic terms are resummed to all order of perturbation theory this is achieved by a set of perturbative rg equations for the effective liouvillian and the effective vertices truncating the rg equations we show how the time dynamics can be obtained analytically for exponentially small intermediate and exponentially large times basic applications are discussed for particle and potential energy exchange within the interacting resonant level model spin exchange for the nonequilibrium kondo model and heat exchange within the ohmic spin boson model at zero bias | [['a', 'tutorial', 'introduction', 'is', 'presented', 'for', 'the', 'calculation', 'of', 'the', 'time', 'dynamics', 'for', 'models', 'of', 'dissipative', 'quantum', 'mechanics', 'where', 'a', 'small', 'quantum', 'system', 'is', 'coupled', 'to', 'noninteracting', 'bosonic', 'or', 'fermionic', 'reservoirs', 'we', 'discuss', 'the', 'basics', 'and', 'applications', 'of', 'the', 'realtime', 'renormalization', 'group', 'method', 'rtrg', 'where', 'the', 'fourier', 'variable', 'e', 'conjugate', 'to', 'the', 'time', 'variable', 't', 'is', 'used', 'as', 'flow', 'parameter', 'it', 'is', 'shown', 'how', 'a', 'wellcontrolled', 'perturbation', 'theory', 'can', 'be', 'set', 'up', 'in', 'the', 'coupling', 'to', 'the', 'bath', 'where', 'secular', 'and', 'logarithmic', 'terms', 'are', 'resummed', 'to', 'all', 'order', 'of', 'perturbation', 'theory', 'this', 'is', 'achieved', 'by', 'a', 'set', 'of', 'perturbative', 'rg', 'equations', 'for', 'the', 'effective', 'liouvillian', 'and', 'the', 'effective', 'vertices', 'truncating', 'the', 'rg', 'equations', 'we', 'show', 'how', 'the', 'time', 'dynamics', 'can', 'be', 'obtained', 'analytically', 'for', 'exponentially', 'small', 'intermediate', 'and', 'exponentially', 'large', 'times', 'basic', 'applications', 'are', 'discussed', 'for', 'particle', 'and', 'potential', 'energy', 'exchange', 'within', 'the', 'interacting', 'resonant', 'level', 'model', 'spin', 'exchange', 'for', 'the', 'nonequilibrium', 'kondo', 'model', 'and', 'heat', 'exchange', 'within', 'the', 'ohmic', 'spin', 'boson', 'model', 'at', 'zero', 'bias']] | [-0.1454730144335821, 0.20479873058818146, -0.09103708144793489, 0.07443030781662428, -0.022901826050042748, -0.1677250815857011, 0.02519668052649737, 0.3058933893524402, -0.29007548783872145, -0.2730399757533906, 0.06557536825007501, -0.2955873354460135, -0.11056649331311998, 0.16805714939746175, 0.035893039617979204, 0.0656012077984142, 0.03757557194646313, 0.06992987385552646, -0.04670963061030909, -0.2361657330345542, 0.2704451835366437, 0.032776389865720845, 0.2134383632857577, 0.07037748159077692, 0.10453610195699765, 0.02510268543706646, 0.018723902906885886, 0.015653097262908984, -0.11543020730591323, 0.051865100019039156, 0.2649977675744331, -0.020671659261437065, 0.25801058741376165, -0.43126387436627356, -0.2090357979759574, 0.0527075962387923, 0.16152330870173467, 0.1512667660758177, -0.015634138207231838, -0.2623088645793677, 0.04750016949024523, -0.2159911408145205, -0.1529210275515959, -0.13859329369979495, 0.018877399265513677, -0.013392665357530925, -0.28397079656343815, 0.11355726426875454, 0.012888417287494045, 0.021415444506130303, -0.011640267839188216, -0.056107024546482615, -0.025179788167307895, 0.09401891890391482, 0.04256956035232978, 0.03616564101290592, 0.1673082316361637, -0.13392847851451756, -0.07553206535381635, 0.3744226016464688, -0.12180052219023255, -0.20811466021457664, 0.18019422687623785, -0.12042270175809691, -0.08796866823700313, 0.09832380040470197, 0.15968894838854805, 0.12766188769937908, -0.1905290328291615, 0.16563263545247603, 0.022612959131246422, 0.13750654833211776, -0.003908366890601724, 0.032543623045715224, 0.19106320907215935, 0.14934110163755895, 0.03244151830594672, 0.11133203627850231, -0.0293937507611475, -0.18396762173050588, -0.35467855902725315, -0.1296107191354014, -0.1891206079730708, 0.07791010003694031, -0.12047747220631537, -0.1386719527308961, 0.41971650958644696, 0.16942933501664503, 0.16023615188896656, 0.030502564704371054, 0.2882252666224019, 0.2101528114305756, 0.04464757711316616, 0.07673685339346797, 0.20888628923132208, 0.1591326122085216, 0.0634788734815925, -0.29009647101040437, -0.02783349516846419, 0.09709951909488987] |
1,802.10015 | Integrating Latent Classes in the Bayesian Shared Parameter Joint Model
of Longitudinal and Survival Outcomes | Cystic fibrosis is a chronic lung disease which requires frequent patient
monitoring to maintain lung function over time and minimize onset of acute
respiratory events known as pulmonary exacerbations. From the clinical point of
view it is important to characterize the association between key biomarkers
such as $FEV_1$ and time-to first exacerbation. Progression of the disease is
heterogeneous, yielding different sub-groups in the population exhibiting
distinct longitudinal profiles. It is desirable to categorize these unobserved
sub-groups (latent classes) according to their distinctive trajectories.
Accounting for these latent classes, in other words heterogeneity, will lead to
improved estimates of association arising from the joint longitudinal-survival
model.
The joint model of longitudinal and survival data constitutes a popular
framework to analyze such data arising from heterogeneous cohorts. In
particular, two paradigms within this framework are the shared parameter joint
models and the joint latent class models. The former paradigm allows one to
quantify the strength of the association between the longitudinal and survival
outcomes but does not allow for latent sub-populations. The latter paradigm
explicitly postulates the existence of sub-populations but does not directly
quantify the strength of the association.
We propose to integrate latent classes in the shared parameter joint model in
a fully Bayesian approach, which allows us to investigate the association
between $FEV_1$ and time-to first exacerbation within each latent class. We,
furthermore, focus on the selection of the optimal number of latent classes.
| stat.AP | cystic fibrosis is a chronic lung disease which requires frequent patient monitoring to maintain lung function over time and minimize onset of acute respiratory events known as pulmonary exacerbations from the clinical point of view it is important to characterize the association between key biomarkers such as fev_1 and timeto first exacerbation progression of the disease is heterogeneous yielding different subgroups in the population exhibiting distinct longitudinal profiles it is desirable to categorize these unobserved subgroups latent classes according to their distinctive trajectories accounting for these latent classes in other words heterogeneity will lead to improved estimates of association arising from the joint longitudinalsurvival model the joint model of longitudinal and survival data constitutes a popular framework to analyze such data arising from heterogeneous cohorts in particular two paradigms within this framework are the shared parameter joint models and the joint latent class models the former paradigm allows one to quantify the strength of the association between the longitudinal and survival outcomes but does not allow for latent subpopulations the latter paradigm explicitly postulates the existence of subpopulations but does not directly quantify the strength of the association we propose to integrate latent classes in the shared parameter joint model in a fully bayesian approach which allows us to investigate the association between fev_1 and timeto first exacerbation within each latent class we furthermore focus on the selection of the optimal number of latent classes | [['cystic', 'fibrosis', 'is', 'a', 'chronic', 'lung', 'disease', 'which', 'requires', 'frequent', 'patient', 'monitoring', 'to', 'maintain', 'lung', 'function', 'over', 'time', 'and', 'minimize', 'onset', 'of', 'acute', 'respiratory', 'events', 'known', 'as', 'pulmonary', 'exacerbations', 'from', 'the', 'clinical', 'point', 'of', 'view', 'it', 'is', 'important', 'to', 'characterize', 'the', 'association', 'between', 'key', 'biomarkers', 'such', 'as', 'fev_1', 'and', 'timeto', 'first', 'exacerbation', 'progression', 'of', 'the', 'disease', 'is', 'heterogeneous', 'yielding', 'different', 'subgroups', 'in', 'the', 'population', 'exhibiting', 'distinct', 'longitudinal', 'profiles', 'it', 'is', 'desirable', 'to', 'categorize', 'these', 'unobserved', 'subgroups', 'latent', 'classes', 'according', 'to', 'their', 'distinctive', 'trajectories', 'accounting', 'for', 'these', 'latent', 'classes', 'in', 'other', 'words', 'heterogeneity', 'will', 'lead', 'to', 'improved', 'estimates', 'of', 'association', 'arising', 'from', 'the', 'joint', 'longitudinalsurvival', 'model', 'the', 'joint', 'model', 'of', 'longitudinal', 'and', 'survival', 'data', 'constitutes', 'a', 'popular', 'framework', 'to', 'analyze', 'such', 'data', 'arising', 'from', 'heterogeneous', 'cohorts', 'in', 'particular', 'two', 'paradigms', 'within', 'this', 'framework', 'are', 'the', 'shared', 'parameter', 'joint', 'models', 'and', 'the', 'joint', 'latent', 'class', 'models', 'the', 'former', 'paradigm', 'allows', 'one', 'to', 'quantify', 'the', 'strength', 'of', 'the', 'association', 'between', 'the', 'longitudinal', 'and', 'survival', 'outcomes', 'but', 'does', 'not', 'allow', 'for', 'latent', 'subpopulations', 'the', 'latter', 'paradigm', 'explicitly', 'postulates', 'the', 'existence', 'of', 'subpopulations', 'but', 'does', 'not', 'directly', 'quantify', 'the', 'strength', 'of', 'the', 'association', 'we', 'propose', 'to', 'integrate', 'latent', 'classes', 'in', 'the', 'shared', 'parameter', 'joint', 'model', 'in', 'a', 'fully', 'bayesian', 'approach', 'which', 'allows', 'us', 'to', 'investigate', 'the', 'association', 'between', 'fev_1', 'and', 'timeto', 'first', 'exacerbation', 'within', 'each', 'latent', 'class', 'we', 'furthermore', 'focus', 'on', 'the', 'selection', 'of', 'the', 'optimal', 'number', 'of', 'latent', 'classes']] | [-0.06646444404728584, 0.08510290703370085, -0.06601013405184843, 0.10822572351908948, -0.11163116940016098, -0.15328979165229595, 0.0942834866945592, 0.3712910971023206, -0.2852492913092351, -0.30515537411770505, 0.060731202910721906, -0.252964301220003, -0.1477426492358343, 0.14306122986480713, -0.10468257771422848, 0.03710646165184613, 0.0515248316198858, 0.04471940925627406, -0.0024819658456258793, -0.19885060124887297, 0.3262045248630496, 0.01510550836339975, 0.34663325211662066, -0.012399321166762652, 0.09536534803123492, 0.03190006457247302, -0.0980281924478646, -0.014736741464108707, -0.09646728342850733, 0.13486735851794449, 0.31291373180659937, 0.19250642536327434, 0.3385352126075055, -0.38469152101594156, -0.25966999248171657, 0.17285278346638283, 0.12796824074397062, 0.08758361187353571, 0.04965546616424237, -0.27178953033195347, 0.03612388295427952, -0.17135027622713003, -0.07541667188231188, -0.07328757097642137, -0.008391849469775572, 0.003933539241452852, -0.3035831968150794, 0.15389791761055335, 0.0018640151645383264, 0.052425447521078535, -0.10318093752621824, -0.11079583579324122, -0.03417695487220573, 0.21330081700928447, 0.10530605306500633, 0.0020878753648736537, 0.1129308273960064, -0.14382859743916646, -0.12541673255265437, 0.3472656501709826, 0.009320014310626583, -0.1836154225648532, 0.2266580634133524, -0.12892843182915106, -0.17479760896336907, 0.11128097442655355, 0.24459040967019227, 0.08504408156115195, -0.20222071833554336, -0.03443248634516166, -0.01907558467151581, 0.15217288051949293, 0.0019927775799734597, -0.006796536695522566, 0.19209199525121376, 0.183681076244276, 0.0014064623277761743, 0.12348081802966224, -0.15635067883492884, -0.09714768148966643, -0.2598611580757185, -0.15411659288439009, -0.08227797055668715, -0.013546327785583826, -0.10944692879225203, -0.1858147279604171, 0.42908944613021666, 0.16718322237971328, 0.1805100891357049, 0.05516092186698165, 0.23516902497384506, 0.021452193110624056, 0.09098557753982937, 0.03669734260377785, 0.14400751636369535, 0.0872718773110129, 0.03764360456311534, -0.2221219687867894, 0.18119060006549853, 0.012375792508355828] |
1,802.10016 | Pathwise mild solutions for quasilinear stochastic partial differential
equations | Stochastic partial differential equations (SPDEs) have become a key modelling
tool in applications. Yet, there are many classes of SPDEs, where the existence
and regularity theory for solutions is not completely developed. Here we
contribute to this aspect and prove the existence of mild solutions for a broad
class of quasilinear Cauchy problems, including - among others -
cross-diffusion systems as a key application. Our solutions are local-in-time
and are derived via a fixed point argument in suitable function spaces. The key
idea is to combine the classical theory of deterministic quasilinear parabolic
partial differential equations (PDEs) with recent theory of evolution
semigroups. We also show, how to apply our theory to the
Shigesada-Kawasaki-Teramoto (SKT) model. Furthermore, we provide examples of
blow-up and ill-posed operators, which can occur after finite-time showing that
solutions can only be local-in-time for general quasilinear SPDEs, while they
might be global-in-time for special subclasses of problems.
| math.PR | stochastic partial differential equations spdes have become a key modelling tool in applications yet there are many classes of spdes where the existence and regularity theory for solutions is not completely developed here we contribute to this aspect and prove the existence of mild solutions for a broad class of quasilinear cauchy problems including among others crossdiffusion systems as a key application our solutions are localintime and are derived via a fixed point argument in suitable function spaces the key idea is to combine the classical theory of deterministic quasilinear parabolic partial differential equations pdes with recent theory of evolution semigroups we also show how to apply our theory to the shigesadakawasakiteramoto skt model furthermore we provide examples of blowup and illposed operators which can occur after finitetime showing that solutions can only be localintime for general quasilinear spdes while they might be globalintime for special subclasses of problems | [['stochastic', 'partial', 'differential', 'equations', 'spdes', 'have', 'become', 'a', 'key', 'modelling', 'tool', 'in', 'applications', 'yet', 'there', 'are', 'many', 'classes', 'of', 'spdes', 'where', 'the', 'existence', 'and', 'regularity', 'theory', 'for', 'solutions', 'is', 'not', 'completely', 'developed', 'here', 'we', 'contribute', 'to', 'this', 'aspect', 'and', 'prove', 'the', 'existence', 'of', 'mild', 'solutions', 'for', 'a', 'broad', 'class', 'of', 'quasilinear', 'cauchy', 'problems', 'including', 'among', 'others', 'crossdiffusion', 'systems', 'as', 'a', 'key', 'application', 'our', 'solutions', 'are', 'localintime', 'and', 'are', 'derived', 'via', 'a', 'fixed', 'point', 'argument', 'in', 'suitable', 'function', 'spaces', 'the', 'key', 'idea', 'is', 'to', 'combine', 'the', 'classical', 'theory', 'of', 'deterministic', 'quasilinear', 'parabolic', 'partial', 'differential', 'equations', 'pdes', 'with', 'recent', 'theory', 'of', 'evolution', 'semigroups', 'we', 'also', 'show', 'how', 'to', 'apply', 'our', 'theory', 'to', 'the', 'shigesadakawasakiteramoto', 'skt', 'model', 'furthermore', 'we', 'provide', 'examples', 'of', 'blowup', 'and', 'illposed', 'operators', 'which', 'can', 'occur', 'after', 'finitetime', 'showing', 'that', 'solutions', 'can', 'only', 'be', 'localintime', 'for', 'general', 'quasilinear', 'spdes', 'while', 'they', 'might', 'be', 'globalintime', 'for', 'special', 'subclasses', 'of', 'problems']] | [-0.1109285882936678, 0.02089350663075511, -0.09440946242078238, 0.11695764651100132, -0.1135871228480699, -0.17400392958731858, -0.04805316844792574, 0.2830921966932564, -0.33194636791044435, -0.23130288665439158, 0.17644692797779463, -0.2840269636597184, -0.19687431849595535, 0.24517431563147712, -0.10179460195874508, 0.12186335296613858, 0.07282941154713723, -0.04273942595597, -0.07192543162120468, -0.25537825676600057, 0.4311598355525592, -0.07053980010017853, 0.1949067507970503, 0.04953969259052569, 0.13461051419714853, -0.05517449720892368, -0.01323709917729783, 0.03850859640659952, -0.17179703303237154, 0.08615672215819359, 0.3400196061788389, 0.0983569412234383, 0.3276894770112614, -0.4258228643678579, -0.2661522904148438, 0.12121143711155793, 0.14689953201712147, 0.15461044516742556, -0.08552509645193865, -0.27904529869556427, 0.12098028724497471, -0.11823538305150383, -0.2007629657656442, -0.13409212784491628, 0.020342654992369997, 0.11376419882782292, -0.2944148847709829, 0.10275693257138502, 0.11803229823052233, 0.023368303176490652, -0.12386560522257381, -0.05314332161070592, -0.00011546062555589132, 0.0619183195592373, 0.05568277309789329, -0.05576173275952921, 0.024878734478964503, -0.10440859847214548, -0.11809014676501287, 0.34401196129495065, -0.07277678635796445, -0.2878708659777505, 0.20674994361943147, -0.11546018002742289, -0.18998689900133633, 0.11371432775834688, 0.18929214051443358, 0.19904963354948882, -0.15904894000506842, 0.1389521459826962, -0.07316543454391844, 0.14909776765325783, 0.06966310830461798, 0.035077357000980726, 0.11092261688927527, 0.14625819062114062, 0.14313280915696136, 0.0809025870770491, 0.061592511538941186, -0.1608718690511633, -0.3488552514963702, -0.1412018962366969, -0.059828088371920704, 0.09912163919416465, -0.09889670320624024, -0.1977703035965362, 0.34370503497103716, 0.1530945949243138, 0.12482588664134776, 0.0796393188698711, 0.19697778616975617, 0.20805690530765703, -0.009583740207622916, 0.06123481471237614, 0.21576715604052096, 0.18734574905009127, 0.1496326469491242, -0.15039891313414572, 0.05736102464518216, 0.15610235909800102] |
1,802.10017 | Invariant foliations for stochastic dynamical systems with
multiplicative stable Levy noise | This work deals with the dynamics of a class of stochastic dynamical systems
with a multiplicative non-Gaussian Levy noise. We first establish the existence
of stable and unstable foliations for this system via the Lyapunov-Perron
method. Then we examine the geometric structure of the invariant foliations,
and their relation with invariant manifolds. Finally, we illustrate our results
in an example.
| math.DS | this work deals with the dynamics of a class of stochastic dynamical systems with a multiplicative nongaussian levy noise we first establish the existence of stable and unstable foliations for this system via the lyapunovperron method then we examine the geometric structure of the invariant foliations and their relation with invariant manifolds finally we illustrate our results in an example | [['this', 'work', 'deals', 'with', 'the', 'dynamics', 'of', 'a', 'class', 'of', 'stochastic', 'dynamical', 'systems', 'with', 'a', 'multiplicative', 'nongaussian', 'levy', 'noise', 'we', 'first', 'establish', 'the', 'existence', 'of', 'stable', 'and', 'unstable', 'foliations', 'for', 'this', 'system', 'via', 'the', 'lyapunovperron', 'method', 'then', 'we', 'examine', 'the', 'geometric', 'structure', 'of', 'the', 'invariant', 'foliations', 'and', 'their', 'relation', 'with', 'invariant', 'manifolds', 'finally', 'we', 'illustrate', 'our', 'results', 'in', 'an', 'example']] | [-0.18484571672355135, 0.076197515779495, -0.13769675934066375, 0.09580424141992504, -0.019754233242323, -0.10375728058667542, -0.015576675906777382, 0.34068741720790663, -0.30276078295428305, -0.2248899329919368, 0.12478701602085493, -0.23800694961100816, -0.25548814705883466, 0.1882946257169048, -0.11253573607730989, 0.10157091599733879, 0.047166134836152195, 0.03828357442980632, -0.09457511395060768, -0.22480534740025176, 0.46967830198506516, 0.026164900790899993, 0.19653905077526967, -0.006577366774824137, 0.14822687988635153, -0.028690831452452888, -0.05649259990702073, 0.010457398020662367, -0.194022041435043, 0.15191648098795366, 0.1784147480347504, 0.025534407095983626, 0.2531396938837133, -0.33823937450846037, -0.17682824733977517, 0.13778368760831655, 0.08411164615875653, 0.12224739482674825, -0.057748170327492215, -0.34376902456084885, 0.1092610580381006, -0.1451776187401265, -0.1984212760347873, -0.13453077110461892, -0.00965095590800047, 0.056192600478728615, -0.23468215100486609, 0.06620109262876213, 0.15588095860778897, 0.08413423878761629, -0.09915755764426043, -0.03612029226690841, -0.013079454202670603, 0.08238715369564792, 0.040168317034840584, -0.04360126170795411, 0.11626418952364474, -0.07594251853103438, -0.15869379963260144, 0.33027538754977287, -0.11260564450543219, -0.25982514303177595, 0.18706005203227202, -0.13859146024721364, -0.2174657239423444, 0.08921610458443562, 0.17673671881978711, 0.16251734448596836, -0.14078729713122204, 0.1031974781906077, -0.03601567664494117, 0.11370971697227408, 0.023207274141410987, 0.011734842664251725, 0.13698476975162824, 0.19096416774361083, 0.12556888840626926, 0.1986816167870226, -0.04439172473891328, -0.11819003894925117, -0.32544415931527815, -0.18319830998467904, -0.09385573322263857, 0.10053565221217771, -0.09932406221778364, -0.1739937352016568, 0.4254512616743644, 0.12876189961098133, 0.21782464503776283, 0.132917163373592, 0.2641133403405547, 0.10682140546268784, -0.07744329589186236, 0.07410251217273374, 0.1813707028826078, 0.19058563776003817, 0.059512720567484696, -0.20445912692230195, -0.0025165305317689977, 0.07303309498044351] |
1,802.10018 | Spin Transport in a Mott Insulator of Ultracold Fermions | Strongly correlated materials are expected to feature unconventional
transport properties, such that charge, spin, and heat conduction are
potentially independent probes of the dynamics. In contrast to charge
transport, the measurement of spin transport in such materials is highly
challenging. We observed spin conduction and diffusion in a system of ultracold
fermionic atoms that realizes the half-filled Fermi-Hubbard model. For strong
interactions, spin diffusion is driven by super-exchange and
doublon-hole-assisted tunneling, and strongly violates the quantum limit of
charge diffusion. The technique developed in this work can be extended to
finite doping, which can shed light on the complex interplay between spin and
charge in the Hubbard model.
| cond-mat.quant-gas cond-mat.str-el | strongly correlated materials are expected to feature unconventional transport properties such that charge spin and heat conduction are potentially independent probes of the dynamics in contrast to charge transport the measurement of spin transport in such materials is highly challenging we observed spin conduction and diffusion in a system of ultracold fermionic atoms that realizes the halffilled fermihubbard model for strong interactions spin diffusion is driven by superexchange and doublonholeassisted tunneling and strongly violates the quantum limit of charge diffusion the technique developed in this work can be extended to finite doping which can shed light on the complex interplay between spin and charge in the hubbard model | [['strongly', 'correlated', 'materials', 'are', 'expected', 'to', 'feature', 'unconventional', 'transport', 'properties', 'such', 'that', 'charge', 'spin', 'and', 'heat', 'conduction', 'are', 'potentially', 'independent', 'probes', 'of', 'the', 'dynamics', 'in', 'contrast', 'to', 'charge', 'transport', 'the', 'measurement', 'of', 'spin', 'transport', 'in', 'such', 'materials', 'is', 'highly', 'challenging', 'we', 'observed', 'spin', 'conduction', 'and', 'diffusion', 'in', 'a', 'system', 'of', 'ultracold', 'fermionic', 'atoms', 'that', 'realizes', 'the', 'halffilled', 'fermihubbard', 'model', 'for', 'strong', 'interactions', 'spin', 'diffusion', 'is', 'driven', 'by', 'superexchange', 'and', 'doublonholeassisted', 'tunneling', 'and', 'strongly', 'violates', 'the', 'quantum', 'limit', 'of', 'charge', 'diffusion', 'the', 'technique', 'developed', 'in', 'this', 'work', 'can', 'be', 'extended', 'to', 'finite', 'doping', 'which', 'can', 'shed', 'light', 'on', 'the', 'complex', 'interplay', 'between', 'spin', 'and', 'charge', 'in', 'the', 'hubbard', 'model']] | [-0.1515076541402769, 0.2801625333708998, -0.015133679089915425, 0.056524282494324875, -0.025266285741997657, -0.18960628985366393, 0.034538540001262295, 0.3654830132254234, -0.3133201149692672, -0.26320882248648697, -0.00748446740092553, -0.3398465432888158, -0.12578387136318694, 0.19054259757171862, 0.0487268695686117, 0.011607474830245303, -0.034093048662887274, -0.08489552279825488, -0.06613211480848422, -0.19997161209679026, 0.27183202820477537, 0.03652235046007331, 0.29716538937292364, 0.15214319323911984, 0.05135826078008547, 0.04714452468128614, 0.08102208595705505, 0.029083945205278485, -0.0929531886090827, 0.0900350351965873, 0.25244595044701595, -0.10679769954405056, 0.1405972765027502, -0.4697664582005171, -0.2661891296162122, 0.027689569386018215, 0.15490795528107087, 0.17520751825329264, -0.06995989784063057, -0.2598998483235591, -0.04778949001360093, -0.17763065261261485, -0.10728470893211176, -0.1304627524701896, -0.018841194015031107, 0.006117158545459682, -0.26831736386901583, 0.14997982462459009, 0.08744356144985585, 0.018810375254148633, -0.07152330996762421, -0.07261696790680115, -0.08307780426378562, 0.05622808181323877, 0.030567466475017298, 0.01749659341403118, 0.1875777757665682, -0.1619607071222511, -0.1427550687950766, 0.3686497197007743, -0.0801857249598045, -0.19570030856912382, 0.23497938747717956, -0.19119085840201963, -0.06476446064450195, 0.12770727879550553, 0.1407407552462722, 0.09877007385872513, -0.1969830907324207, 0.09044492609579134, -0.02834982144707274, 0.1498543888093277, -0.05055666985980314, 0.12285201450827245, 0.29585245173320035, 0.22998864892173873, 0.07569845068642747, 0.09868095118756989, -0.12455332524439093, -0.14191825059460145, -0.19348430318353158, -0.18973882326521155, -0.25978270948594695, 0.11244666911922743, -0.04509949880784321, -0.1543460073402134, 0.4213973047194358, 0.21073795789765698, 0.14734666652664125, -0.10315820699335711, 0.20577271228708396, 0.13847847003054536, 0.02582142223543096, 0.04039444090258852, 0.2319168261400311, 0.18527366440290602, 0.09206195960308765, -0.36009305636790173, 0.07289393741646172, 0.04023585702666891] |
1,802.10019 | Simultaneous Traffic Sign Detection and Boundary Estimation using
Convolutional Neural Network | We propose a novel traffic sign detection system that simultaneously
estimates the location and precise boundary of traffic signs using
convolutional neural network (CNN). Estimating the precise boundary of traffic
signs is important in navigation systems for intelligent vehicles where traffic
signs can be used as 3D landmarks for road environment. Previous traffic sign
detection systems, including recent methods based on CNN, only provide bounding
boxes of traffic signs as output, and thus requires additional processes such
as contour estimation or image segmentation to obtain the precise sign
boundary. In this work, the boundary estimation of traffic signs is formulated
as a 2D pose and shape class prediction problem, and this is effectively solved
by a single CNN. With the predicted 2D pose and the shape class of a target
traffic sign in an input image, we estimate the actual boundary of the target
sign by projecting the boundary of a corresponding template sign image into the
input image plane. By formulating the boundary estimation problem as a
CNN-based pose and shape prediction task, our method is end-to-end trainable,
and more robust to occlusion and small targets than other boundary estimation
methods that rely on contour estimation or image segmentation. The proposed
method with architectural optimization provides an accurate traffic sign
boundary estimation which is also efficient in compute, showing a detection
frame rate higher than 7 frames per second on low-power mobile platforms.
| cs.CV | we propose a novel traffic sign detection system that simultaneously estimates the location and precise boundary of traffic signs using convolutional neural network cnn estimating the precise boundary of traffic signs is important in navigation systems for intelligent vehicles where traffic signs can be used as 3d landmarks for road environment previous traffic sign detection systems including recent methods based on cnn only provide bounding boxes of traffic signs as output and thus requires additional processes such as contour estimation or image segmentation to obtain the precise sign boundary in this work the boundary estimation of traffic signs is formulated as a 2d pose and shape class prediction problem and this is effectively solved by a single cnn with the predicted 2d pose and the shape class of a target traffic sign in an input image we estimate the actual boundary of the target sign by projecting the boundary of a corresponding template sign image into the input image plane by formulating the boundary estimation problem as a cnnbased pose and shape prediction task our method is endtoend trainable and more robust to occlusion and small targets than other boundary estimation methods that rely on contour estimation or image segmentation the proposed method with architectural optimization provides an accurate traffic sign boundary estimation which is also efficient in compute showing a detection frame rate higher than 7 frames per second on lowpower mobile platforms | [['we', 'propose', 'a', 'novel', 'traffic', 'sign', 'detection', 'system', 'that', 'simultaneously', 'estimates', 'the', 'location', 'and', 'precise', 'boundary', 'of', 'traffic', 'signs', 'using', 'convolutional', 'neural', 'network', 'cnn', 'estimating', 'the', 'precise', 'boundary', 'of', 'traffic', 'signs', 'is', 'important', 'in', 'navigation', 'systems', 'for', 'intelligent', 'vehicles', 'where', 'traffic', 'signs', 'can', 'be', 'used', 'as', '3d', 'landmarks', 'for', 'road', 'environment', 'previous', 'traffic', 'sign', 'detection', 'systems', 'including', 'recent', 'methods', 'based', 'on', 'cnn', 'only', 'provide', 'bounding', 'boxes', 'of', 'traffic', 'signs', 'as', 'output', 'and', 'thus', 'requires', 'additional', 'processes', 'such', 'as', 'contour', 'estimation', 'or', 'image', 'segmentation', 'to', 'obtain', 'the', 'precise', 'sign', 'boundary', 'in', 'this', 'work', 'the', 'boundary', 'estimation', 'of', 'traffic', 'signs', 'is', 'formulated', 'as', 'a', '2d', 'pose', 'and', 'shape', 'class', 'prediction', 'problem', 'and', 'this', 'is', 'effectively', 'solved', 'by', 'a', 'single', 'cnn', 'with', 'the', 'predicted', '2d', 'pose', 'and', 'the', 'shape', 'class', 'of', 'a', 'target', 'traffic', 'sign', 'in', 'an', 'input', 'image', 'we', 'estimate', 'the', 'actual', 'boundary', 'of', 'the', 'target', 'sign', 'by', 'projecting', 'the', 'boundary', 'of', 'a', 'corresponding', 'template', 'sign', 'image', 'into', 'the', 'input', 'image', 'plane', 'by', 'formulating', 'the', 'boundary', 'estimation', 'problem', 'as', 'a', 'cnnbased', 'pose', 'and', 'shape', 'prediction', 'task', 'our', 'method', 'is', 'endtoend', 'trainable', 'and', 'more', 'robust', 'to', 'occlusion', 'and', 'small', 'targets', 'than', 'other', 'boundary', 'estimation', 'methods', 'that', 'rely', 'on', 'contour', 'estimation', 'or', 'image', 'segmentation', 'the', 'proposed', 'method', 'with', 'architectural', 'optimization', 'provides', 'an', 'accurate', 'traffic', 'sign', 'boundary', 'estimation', 'which', 'is', 'also', 'efficient', 'in', 'compute', 'showing', 'a', 'detection', 'frame', 'rate', 'higher', 'than', '7', 'frames', 'per', 'second', 'on', 'lowpower', 'mobile', 'platforms']] | [-0.10957896356564413, -0.009982616259914456, -0.03997228375280825, 0.030921554210810706, -0.10346779844755483, -0.2196697813924402, 0.02411044598208804, 0.43306573233606976, -0.23319314326294976, -0.3671867243316757, 0.14502191392239183, -0.23754677251299733, -0.17870275247130646, 0.18480078152651525, -0.17124399414254177, 0.15443969430784002, 0.1397858334418673, 0.062245298465679035, -0.08560749563651207, -0.2026884657749707, 0.28126096908743375, -0.0173670366868122, 0.32262098154104835, 0.042849764749248564, 0.1176650217300456, 0.03084280817076946, -0.04471596893376838, -0.013095862592837144, -0.05527451773141521, 0.17644755717100274, 0.2832715624390403, 0.1329830419849286, 0.24553588146749789, -0.4381199621537732, -0.2699322862486936, 0.0925004035871253, 0.15958090119449916, 0.09963104636040238, -0.046906954448475625, -0.36110173431911674, 0.07469646609189291, -0.13782859845863035, -0.030871562478649948, -0.04934128473361588, 0.012933976124398984, -0.03996889249413696, -0.31353272419247746, 0.07994604930090102, 0.035067014082764775, 0.0659566936083138, -0.08883854339165916, -0.08285381032390775, -0.006164245799971888, 0.2062814474846117, 0.04097550543339557, 0.08074948746655296, 0.17466029257197171, -0.2356704523564022, -0.10179322642775682, 0.3802849165060454, -0.026734029841992375, -0.2613111373443061, 0.16404457537867287, -0.038093393258591235, -0.10313199980494876, 0.1370753240861142, 0.23509340110816, 0.12503388551716557, -0.14902130709005854, -0.03853231976326141, -0.05583965313037794, 0.17976832396995562, 0.0720548768265125, -0.049763471865230516, 0.20515126407516596, 0.2317974686336059, 0.1682241617450212, 0.11910909319542246, -0.19790183397248273, -0.028651144821694296, -0.2341108218424468, -0.11734146511715261, -0.19418623132091892, -0.029235067176353983, -0.13460466617063627, -0.1672035471504379, 0.40624998437248677, 0.21418638112974694, 0.2445909827778466, 0.07643433916034241, 0.3928763422752834, 0.10014406493546553, 0.08992105384723434, 0.0758624595495908, 0.15159345719103628, 0.0031320833527427325, 0.1307030053088903, -0.18888605015989668, 0.13020524257668653, 0.14281399574918816] |
1,802.1002 | Sub-Hz Linewidth Photonic-Integrated Brillouin Laser | Photonic systems and technologies traditionally relegated to table-top
experiments are poised to make the leap from the laboratory to real-world
applications through integration. Stimulated Brillouin scattering (SBS) lasers,
through their unique linewidth narrowing properties, are an ideal candidate to
create highly-coherent waveguide integrated sources. In particular,
cascaded-order Brillouin lasers show promise for multi-line emission, low-noise
microwave generation and other optical comb applications. Photonic integration
of these lasers can dramatically improve their stability to environmental and
mechanical disturbances, simplify their packaging, and lower cost. While
single-order silicon and cascade-order chalcogenide waveguide SBS lasers have
been demonstrated, these lasers produce modest emission linewidths of 10-100
kHz. We report the first demonstration of a sub-Hz (~0.7 Hz) fundamental
linewidth photonic-integrated Brillouin cascaded-order laser, representing a
significant advancement in the state-of-the-art in integrated waveguide SBS
lasers. This laser is comprised of a bus-ring resonator fabricated using an
ultra-low loss Si3N4 waveguide platform. To achieve a sub-Hz linewidth, we
leverage a high-Q, large mode volume, single polarization mode resonator that
produces photon generated acoustic waves without phonon guiding. This approach
greatly relaxes phase matching conditions between polarization modes, and
optical and acoustic modes. Using a theory for cascaded-order Brillouin laser
dynamics, we determine the fundamental emission linewidth of the first Stokes
order by measuring the beat-note linewidth between and the relative powers of
the first and third Stokes orders. Extension to the visible and near-IR
wavebands is possible due to the low optical loss from 405 nm to 2350 nm,
paving the way to photonic-integrated sub-Hz lasers for visible-light
applications.
| physics.optics | photonic systems and technologies traditionally relegated to tabletop experiments are poised to make the leap from the laboratory to realworld applications through integration stimulated brillouin scattering sbs lasers through their unique linewidth narrowing properties are an ideal candidate to create highlycoherent waveguide integrated sources in particular cascadedorder brillouin lasers show promise for multiline emission lownoise microwave generation and other optical comb applications photonic integration of these lasers can dramatically improve their stability to environmental and mechanical disturbances simplify their packaging and lower cost while singleorder silicon and cascadeorder chalcogenide waveguide sbs lasers have been demonstrated these lasers produce modest emission linewidths of 10100 khz we report the first demonstration of a subhz 07 hz fundamental linewidth photonicintegrated brillouin cascadedorder laser representing a significant advancement in the stateoftheart in integrated waveguide sbs lasers this laser is comprised of a busring resonator fabricated using an ultralow loss si3n4 waveguide platform to achieve a subhz linewidth we leverage a highq large mode volume single polarization mode resonator that produces photon generated acoustic waves without phonon guiding this approach greatly relaxes phase matching conditions between polarization modes and optical and acoustic modes using a theory for cascadedorder brillouin laser dynamics we determine the fundamental emission linewidth of the first stokes order by measuring the beatnote linewidth between and the relative powers of the first and third stokes orders extension to the visible and nearir wavebands is possible due to the low optical loss from 405 nm to 2350 nm paving the way to photonicintegrated subhz lasers for visiblelight applications | [['photonic', 'systems', 'and', 'technologies', 'traditionally', 'relegated', 'to', 'tabletop', 'experiments', 'are', 'poised', 'to', 'make', 'the', 'leap', 'from', 'the', 'laboratory', 'to', 'realworld', 'applications', 'through', 'integration', 'stimulated', 'brillouin', 'scattering', 'sbs', 'lasers', 'through', 'their', 'unique', 'linewidth', 'narrowing', 'properties', 'are', 'an', 'ideal', 'candidate', 'to', 'create', 'highlycoherent', 'waveguide', 'integrated', 'sources', 'in', 'particular', 'cascadedorder', 'brillouin', 'lasers', 'show', 'promise', 'for', 'multiline', 'emission', 'lownoise', 'microwave', 'generation', 'and', 'other', 'optical', 'comb', 'applications', 'photonic', 'integration', 'of', 'these', 'lasers', 'can', 'dramatically', 'improve', 'their', 'stability', 'to', 'environmental', 'and', 'mechanical', 'disturbances', 'simplify', 'their', 'packaging', 'and', 'lower', 'cost', 'while', 'singleorder', 'silicon', 'and', 'cascadeorder', 'chalcogenide', 'waveguide', 'sbs', 'lasers', 'have', 'been', 'demonstrated', 'these', 'lasers', 'produce', 'modest', 'emission', 'linewidths', 'of', '10100', 'khz', 'we', 'report', 'the', 'first', 'demonstration', 'of', 'a', 'subhz', '07', 'hz', 'fundamental', 'linewidth', 'photonicintegrated', 'brillouin', 'cascadedorder', 'laser', 'representing', 'a', 'significant', 'advancement', 'in', 'the', 'stateoftheart', 'in', 'integrated', 'waveguide', 'sbs', 'lasers', 'this', 'laser', 'is', 'comprised', 'of', 'a', 'busring', 'resonator', 'fabricated', 'using', 'an', 'ultralow', 'loss', 'si3n4', 'waveguide', 'platform', 'to', 'achieve', 'a', 'subhz', 'linewidth', 'we', 'leverage', 'a', 'highq', 'large', 'mode', 'volume', 'single', 'polarization', 'mode', 'resonator', 'that', 'produces', 'photon', 'generated', 'acoustic', 'waves', 'without', 'phonon', 'guiding', 'this', 'approach', 'greatly', 'relaxes', 'phase', 'matching', 'conditions', 'between', 'polarization', 'modes', 'and', 'optical', 'and', 'acoustic', 'modes', 'using', 'a', 'theory', 'for', 'cascadedorder', 'brillouin', 'laser', 'dynamics', 'we', 'determine', 'the', 'fundamental', 'emission', 'linewidth', 'of', 'the', 'first', 'stokes', 'order', 'by', 'measuring', 'the', 'beatnote', 'linewidth', 'between', 'and', 'the', 'relative', 'powers', 'of', 'the', 'first', 'and', 'third', 'stokes', 'orders', 'extension', 'to', 'the', 'visible', 'and', 'nearir', 'wavebands', 'is', 'possible', 'due', 'to', 'the', 'low', 'optical', 'loss', 'from', '405', 'nm', 'to', '2350', 'nm', 'paving', 'the', 'way', 'to', 'photonicintegrated', 'subhz', 'lasers', 'for', 'visiblelight', 'applications']] | [-0.11249359097265502, 0.16209431035591845, -0.009013668083670464, -0.06547337696793684, -0.08373747645093224, -0.14149745504312924, 0.05955043833025477, 0.52907652597094, -0.24108485769197022, -0.2725850668452356, 0.0437450628534876, -0.2931353629234508, -0.07660378080428294, 0.31842557296686963, -0.008406022832298231, 0.10287516214976845, 0.038079587573815035, -0.12738458618794093, 0.028993058120537357, -0.10252629586296678, 0.2136884785640116, 0.08319604482590091, 0.3851185418046981, 0.03680329648188864, 0.1142086297321778, -0.053289682793029744, 0.028582190518661333, -0.13315288495666278, -0.09096045805185159, 0.137971861273227, 0.3078214184154679, -0.011912098148903946, 0.2684759656887634, -0.4211314474398145, -0.2320815946303102, 0.05410891907609881, 0.1636299041501088, 0.12987727959310863, -0.06022992012322891, -0.2920154809892884, 0.02938668865074584, -0.13839230007260095, -0.13405532928886768, -0.056655230998657935, -0.01039853680827342, 0.00048671181754507273, -0.2216121617266577, -0.01782128541811329, -0.0011067272925401096, 0.07415708816120688, -0.027959897997328946, -0.029139382631371624, -0.028340239180647677, 0.042724358711645684, -0.07683644778916075, -0.01264105274953066, 0.19359789966681987, -0.09751552299379183, -0.14469977087693717, 0.38848665064355364, -0.10476056868514128, -0.02961111583345728, 0.16097343441746806, -0.18239986365329725, 0.013366972037366491, 0.20228184075021138, 0.17728274955189688, 0.07330133372079398, -0.11003501865306037, -0.012628295592638837, 0.08367795799214672, 0.26567974075005046, 0.19380701968921238, 0.1842341149196382, 0.22100023912788616, 0.21500778427147266, 0.020748259200578326, 0.14568516887584518, -0.14293823834957753, 0.023991693037409306, -0.2223883511185762, -0.12347873009413687, -0.16760025977082513, 0.06710784821499603, -0.08371070628604307, -0.114128743559481, 0.3796889011310082, 0.16952357812979713, 0.10417376267502872, -0.023430201444929473, 0.3543809349961549, 0.15131335965957743, 0.12382682046683674, -0.00031119392698873645, 0.34401364729043993, 0.20042251380208306, 0.12631989976947045, -0.25925963922871254, -0.07802662380194299, -0.06281046576157448] |
1,802.10021 | Thermodynamic phases in two-dimensional active matter | Active matter has been intensely studied for its wealth of intriguing
properties such as collective motion, motility-induced phase separation (MIPS),
and giant fluctuations away from criticality. However, the precise connection
of active materials with their equilibrium counterparts has remained unclear.
For two-dimensional (2D) systems, this is also because the experimental and
theoretical understanding of the liquid, hexatic, and solid equilibrium phases
and their phase transitions is very recent. Here, we use self-propelled
particles with inverse-power-law repulsions (but without alignment
interactions) as a minimal model for 2D active materials. A kinetic Monte Carlo
(MC) algorithm allows us to map out the complete quantitative phase diagram. We
demonstrate that the active system preserves all equilibrium phases, and that
phase transitions are shifted to higher densities as a function of activity.
The two-step melting scenario is maintained. At high activity, a critical point
opens up a gas-liquid MIPS region. We expect that the independent appearance of
two-step melting and of MIPS is generic for a large class of two-dimensional
active systems.
| cond-mat.stat-mech | active matter has been intensely studied for its wealth of intriguing properties such as collective motion motilityinduced phase separation mips and giant fluctuations away from criticality however the precise connection of active materials with their equilibrium counterparts has remained unclear for twodimensional 2d systems this is also because the experimental and theoretical understanding of the liquid hexatic and solid equilibrium phases and their phase transitions is very recent here we use selfpropelled particles with inversepowerlaw repulsions but without alignment interactions as a minimal model for 2d active materials a kinetic monte carlo mc algorithm allows us to map out the complete quantitative phase diagram we demonstrate that the active system preserves all equilibrium phases and that phase transitions are shifted to higher densities as a function of activity the twostep melting scenario is maintained at high activity a critical point opens up a gasliquid mips region we expect that the independent appearance of twostep melting and of mips is generic for a large class of twodimensional active systems | [['active', 'matter', 'has', 'been', 'intensely', 'studied', 'for', 'its', 'wealth', 'of', 'intriguing', 'properties', 'such', 'as', 'collective', 'motion', 'motilityinduced', 'phase', 'separation', 'mips', 'and', 'giant', 'fluctuations', 'away', 'from', 'criticality', 'however', 'the', 'precise', 'connection', 'of', 'active', 'materials', 'with', 'their', 'equilibrium', 'counterparts', 'has', 'remained', 'unclear', 'for', 'twodimensional', '2d', 'systems', 'this', 'is', 'also', 'because', 'the', 'experimental', 'and', 'theoretical', 'understanding', 'of', 'the', 'liquid', 'hexatic', 'and', 'solid', 'equilibrium', 'phases', 'and', 'their', 'phase', 'transitions', 'is', 'very', 'recent', 'here', 'we', 'use', 'selfpropelled', 'particles', 'with', 'inversepowerlaw', 'repulsions', 'but', 'without', 'alignment', 'interactions', 'as', 'a', 'minimal', 'model', 'for', '2d', 'active', 'materials', 'a', 'kinetic', 'monte', 'carlo', 'mc', 'algorithm', 'allows', 'us', 'to', 'map', 'out', 'the', 'complete', 'quantitative', 'phase', 'diagram', 'we', 'demonstrate', 'that', 'the', 'active', 'system', 'preserves', 'all', 'equilibrium', 'phases', 'and', 'that', 'phase', 'transitions', 'are', 'shifted', 'to', 'higher', 'densities', 'as', 'a', 'function', 'of', 'activity', 'the', 'twostep', 'melting', 'scenario', 'is', 'maintained', 'at', 'high', 'activity', 'a', 'critical', 'point', 'opens', 'up', 'a', 'gasliquid', 'mips', 'region', 'we', 'expect', 'that', 'the', 'independent', 'appearance', 'of', 'twostep', 'melting', 'and', 'of', 'mips', 'is', 'generic', 'for', 'a', 'large', 'class', 'of', 'twodimensional', 'active', 'systems']] | [-0.13100464166823908, 0.19702284321621327, -0.11561760818466923, 0.06122858883255893, -0.03832733534952803, -0.14032223187885912, 0.1033951138489924, 0.39763019526366233, -0.2484218178544238, -0.31014812428786953, 0.08202507594251074, -0.29348870954856376, -0.16431380925669578, 0.1293927909254784, 0.020192932674122165, 0.06395335675049518, -0.008551041605339075, -0.05460284828967858, -0.09904459788369768, -0.14887894886972694, 0.24984538270759263, 0.06217700415401764, 0.27437130639390533, 0.025308317782002546, 0.11429142531484277, -0.043708721354570504, 0.04494620212409202, 0.040736660291995144, -0.1671243012831058, 0.041589082700998654, 0.22517982192203773, 0.014856000639849213, 0.2110118626197575, -0.3959567829456535, -0.2607554149858299, 0.12036234381334257, 0.17030990213797417, 0.12258525450098594, -0.09949636069359258, -0.24092151390920793, 0.040339675294013604, -0.15595589090523954, -0.14133051240960845, -0.11023819536924184, 0.05135890633876746, 0.010567044755242975, -0.22040647551018214, 0.09842592595998126, 0.05428302568838089, 0.09445258749127831, -0.07121596872353361, -0.1061403805998409, -0.04491116767271056, 0.13966398753109388, -0.0012027863856582414, 0.04977143565858049, 0.1773144084893699, -0.17368256446622712, -0.10631158867562633, 0.40660367621153237, -0.0015808952011866495, -0.08995561357421268, 0.3042122022639627, -0.14312988242229385, -0.13759932820574336, 0.2379872389941565, 0.14992989524381256, 0.11555767144143049, -0.14372245953944957, 0.044435893197216844, -0.022518272766666042, 0.16365792959394249, -0.04614976216440222, 0.03182256099812332, 0.2910319029705577, 0.23506891506535577, 0.046458501740181374, 0.1815440113561982, -0.11124965932131523, -0.17993201885560883, -0.23855307865666137, -0.1768395557744606, -0.18123240695249046, 0.010772990949806712, -0.06498667892360356, -0.168716300844218, 0.3563713674028848, 0.14019931038048872, 0.1767019927335371, 0.006368448497683164, 0.2715138389085907, 0.045965022575858584, 0.018588441798263893, 0.02488689577495236, 0.30233088083470994, 0.1125364586990881, 0.1137342671337094, -0.21886837319055172, 0.06100952012777617, 0.062041471839793735] |
1,802.10022 | Golden Angle Modulation: Approaching the AWGN Capacity | In this work, targeting, e.g., future generation cellular, microwave-links,
or optical fiber systems, we propose a new geometric shaping design for golden
angle modulation (GAM) based on a (double) truncated Gaussian input
distribution. The design improves the mutual information (MI), and the
peak-to-average power ratio, over the full signal-to-noise ratio (SNR) range
relative to two key GAM schemes introduced in [1],[2]. Inspired by the proposed
geometric shaping, a simpler, SNR-dependent, design is also suggested. The
performance is numerically evaluated with respect to MI and compared with
classical modulation schemes. With the proposed design, the SNR can be
decreased relative to classical quadrature amplitude modulation, even for
relatively modest target spectral efficiencies. As the GAM design can approach
the Gaussian channel capacity, the power/energy efficiency is expected to
improve.
| cs.IT math.IT | in this work targeting eg future generation cellular microwavelinks or optical fiber systems we propose a new geometric shaping design for golden angle modulation gam based on a double truncated gaussian input distribution the design improves the mutual information mi and the peaktoaverage power ratio over the full signaltonoise ratio snr range relative to two key gam schemes introduced in 12 inspired by the proposed geometric shaping a simpler snrdependent design is also suggested the performance is numerically evaluated with respect to mi and compared with classical modulation schemes with the proposed design the snr can be decreased relative to classical quadrature amplitude modulation even for relatively modest target spectral efficiencies as the gam design can approach the gaussian channel capacity the powerenergy efficiency is expected to improve | [['in', 'this', 'work', 'targeting', 'eg', 'future', 'generation', 'cellular', 'microwavelinks', 'or', 'optical', 'fiber', 'systems', 'we', 'propose', 'a', 'new', 'geometric', 'shaping', 'design', 'for', 'golden', 'angle', 'modulation', 'gam', 'based', 'on', 'a', 'double', 'truncated', 'gaussian', 'input', 'distribution', 'the', 'design', 'improves', 'the', 'mutual', 'information', 'mi', 'and', 'the', 'peaktoaverage', 'power', 'ratio', 'over', 'the', 'full', 'signaltonoise', 'ratio', 'snr', 'range', 'relative', 'to', 'two', 'key', 'gam', 'schemes', 'introduced', 'in', '12', 'inspired', 'by', 'the', 'proposed', 'geometric', 'shaping', 'a', 'simpler', 'snrdependent', 'design', 'is', 'also', 'suggested', 'the', 'performance', 'is', 'numerically', 'evaluated', 'with', 'respect', 'to', 'mi', 'and', 'compared', 'with', 'classical', 'modulation', 'schemes', 'with', 'the', 'proposed', 'design', 'the', 'snr', 'can', 'be', 'decreased', 'relative', 'to', 'classical', 'quadrature', 'amplitude', 'modulation', 'even', 'for', 'relatively', 'modest', 'target', 'spectral', 'efficiencies', 'as', 'the', 'gam', 'design', 'can', 'approach', 'the', 'gaussian', 'channel', 'capacity', 'the', 'powerenergy', 'efficiency', 'is', 'expected', 'to', 'improve']] | [-0.1383266034774394, 0.05580091702671149, -0.05426612168946487, 0.04940929346512563, -0.07761045254576276, -0.1926243799503922, 0.06915761781196425, 0.40141064656062386, -0.2640642840011911, -0.2830391609110855, 0.09243816503609611, -0.15932428132097318, -0.16751018729002223, 0.2477612975786814, -0.13422043795338062, 0.08610931484718022, 0.03292828034902886, 0.004822308036286061, -0.07352368729225704, -0.24988680558763152, 0.2480567312968059, 0.18551976830647218, 0.3789856780217741, -0.009450157886136352, 0.08064721820978668, 0.03291878841201386, -0.04444740969077207, -0.026587034612307398, -0.1267666060431204, 0.12000789001628052, 0.2253562703024684, 0.11882625190599815, 0.235390826638084, -0.31059055049412365, -0.25456324840096506, 0.10668445354342226, 0.17635926704954147, 0.043839987492056816, -0.03425975523680067, -0.22958924714705034, 0.09618879962982023, -0.21982702478861774, -0.06614153947695856, -0.04274967914872517, -0.05150146921179954, 0.07034564693962539, -0.32622072002373814, 0.03154221062862871, 0.03538475707450636, 0.03102763507544525, 0.009271455222858101, -0.18856059367159808, 0.0228135829358765, 0.0722460461593431, -0.029155007937527077, 0.028057832295610385, 0.10930427296525308, -0.11243739921973622, -0.11928795640334838, 0.3510784123195555, -0.07644923662997812, -0.23335161208959782, 0.14819284331091995, -0.10598903233515407, -0.027210207159198294, 0.1746132565134271, 0.2129938808511796, 0.03710105236231049, -0.09079231114486988, -0.014958842145095718, 0.06231640918019015, 0.2369965238049333, 0.11213156120213644, 0.10225628625132202, 0.16548914258646977, 0.1949799945284649, 0.05209222667315227, 0.16061990568322665, -0.17788734966265699, -0.11002787262729304, -0.21659342136498042, -0.10638920501182515, -0.16383950420156648, 0.006774663741839683, -0.12632138726432574, -0.0784222446565377, 0.3702178369532889, 0.10634175686836683, 0.15596782277873533, 0.0690391568896016, 0.3891598602012533, 0.1694530143327351, 0.04236183328715366, 0.056689019193946144, 0.27429759209080945, 0.1575553681221094, 0.11065243691202312, -0.23734275521123854, 0.06865501820337115, 0.010951994459958762] |
1,802.10023 | Dual polarization nonlinear Fourier transform-based optical
communication system | New services and applications are causing an exponential increase in internet
traffic. In a few years, current fiber optic communication system
infrastructure will not be able to meet this demand because fiber nonlinearity
dramatically limits the information transmission rate. Eigenvalue communication
could potentially overcome these limitations. It relies on a mathematical
technique called "nonlinear Fourier transform (NFT)" to exploit the "hidden"
linearity of the nonlinear Schr\"odinger equation as the master model for
signal propagation in an optical fiber. We present here the theoretical tools
describing the NFT for the Manakov system and report on experimental
transmission results for dual polarization in fiber optic eigenvalue
communications. A transmission of up to 373.5 km with bit error rate less than
the hard-decision forward error correction threshold has been achieved. Our
results demonstrate that dual-polarization NFT can work in practice and enable
an increased spectral efficiency in NFT-based communication systems, which are
currently based on single polarization channels.
| cs.ET | new services and applications are causing an exponential increase in internet traffic in a few years current fiber optic communication system infrastructure will not be able to meet this demand because fiber nonlinearity dramatically limits the information transmission rate eigenvalue communication could potentially overcome these limitations it relies on a mathematical technique called nonlinear fourier transform nft to exploit the hidden linearity of the nonlinear schrodinger equation as the master model for signal propagation in an optical fiber we present here the theoretical tools describing the nft for the manakov system and report on experimental transmission results for dual polarization in fiber optic eigenvalue communications a transmission of up to 3735 km with bit error rate less than the harddecision forward error correction threshold has been achieved our results demonstrate that dualpolarization nft can work in practice and enable an increased spectral efficiency in nftbased communication systems which are currently based on single polarization channels | [['new', 'services', 'and', 'applications', 'are', 'causing', 'an', 'exponential', 'increase', 'in', 'internet', 'traffic', 'in', 'a', 'few', 'years', 'current', 'fiber', 'optic', 'communication', 'system', 'infrastructure', 'will', 'not', 'be', 'able', 'to', 'meet', 'this', 'demand', 'because', 'fiber', 'nonlinearity', 'dramatically', 'limits', 'the', 'information', 'transmission', 'rate', 'eigenvalue', 'communication', 'could', 'potentially', 'overcome', 'these', 'limitations', 'it', 'relies', 'on', 'a', 'mathematical', 'technique', 'called', 'nonlinear', 'fourier', 'transform', 'nft', 'to', 'exploit', 'the', 'hidden', 'linearity', 'of', 'the', 'nonlinear', 'schrodinger', 'equation', 'as', 'the', 'master', 'model', 'for', 'signal', 'propagation', 'in', 'an', 'optical', 'fiber', 'we', 'present', 'here', 'the', 'theoretical', 'tools', 'describing', 'the', 'nft', 'for', 'the', 'manakov', 'system', 'and', 'report', 'on', 'experimental', 'transmission', 'results', 'for', 'dual', 'polarization', 'in', 'fiber', 'optic', 'eigenvalue', 'communications', 'a', 'transmission', 'of', 'up', 'to', '3735', 'km', 'with', 'bit', 'error', 'rate', 'less', 'than', 'the', 'harddecision', 'forward', 'error', 'correction', 'threshold', 'has', 'been', 'achieved', 'our', 'results', 'demonstrate', 'that', 'dualpolarization', 'nft', 'can', 'work', 'in', 'practice', 'and', 'enable', 'an', 'increased', 'spectral', 'efficiency', 'in', 'nftbased', 'communication', 'systems', 'which', 'are', 'currently', 'based', 'on', 'single', 'polarization', 'channels']] | [-0.1619933080438885, 0.03636472402093557, -0.0580215867488615, -0.0019419129344544583, -0.09180881563694246, -0.2021405739619607, 0.0482677215785389, 0.41153366723127904, -0.2865998992846618, -0.25151453774061894, 0.15084757577597854, -0.27004367271363133, -0.1650553697900426, 0.2857143863660073, -0.11694785476391835, 0.1339198233800069, 0.08126045763567691, 0.009416802810324776, -0.01784444629710408, -0.22635522051864573, 0.2257743926313255, 0.09271726240253737, 0.3507293440972365, 0.06433219708382122, 0.0895228655708413, 0.009235974426020779, -0.02412488263160471, -0.10819669052838318, -0.10298854840131694, 0.14120122879262895, 0.28732175552436423, 0.11534429454364845, 0.2804512094135486, -0.44903321152012193, -0.2582961978090386, 0.08298121656801911, 0.18983805375474114, 0.11245468509638862, -0.045107054076487976, -0.2664126896689976, 0.06071187533858803, -0.18260032882643562, -0.10089223211736328, -0.05489668278999987, -0.025719313596886013, 0.038040839703453164, -0.2538928447546618, 0.029744664943146128, 0.013625619680650772, 0.04710762576076142, 0.011512113299461143, -0.06809826691019079, 0.024960567223869506, 0.07658494177965387, -0.02733839127881032, -0.016656282451754857, 0.10996236508832344, -0.13005264302445274, -0.12387120612491404, 0.35312318065834625, -0.04968776887990609, -0.17388196604386452, 0.11916963348856136, -0.1014198350695698, -0.07910459999055151, 0.17663645362556582, 0.24648056226527137, 0.028760948044157797, -0.1828013310449258, 0.019838483441215488, 0.05763188683457913, 0.23890066739592342, 0.0910728172143741, 0.129687414226693, 0.14044217655375119, 0.1985406614359348, 0.09591889441794445, 0.07855565993550924, -0.1123485992587502, -0.08107050197619585, -0.2481027296203519, -0.14656663492111668, -0.1872170595301976, 0.04872584605764132, -0.06367333700191305, -0.08821719757491542, 0.37500273322145783, 0.1495336099888288, 0.1139832749752508, 0.07587166133171488, 0.36331249295223145, 0.15711076581069539, 0.09443364711778779, 0.07255006052132118, 0.2923110818850898, 0.13747638427321948, 0.1534186125402489, -0.21326137985433302, 0.038249901760249366, 0.009679347117461504] |
1,802.10024 | On optimal designs for non-regular models | Classically, Fisher information is the relevant object in defining optimal
experimental designs. However, for models that lack certain regularity, the
Fisher information does not exist and, hence, there is no notion of design
optimality available in the literature. This article seeks to fill the gap by
proposing a so-called Hellinger information, which generalizes Fisher
information in the sense that the two measures agree in regular problems, but
the former also exists for certain types of non-regular problems. We derive a
Hellinger information inequality, showing that Hellinger information defines a
lower bound on the local minimax risk of estimators. This provides a connection
between features of the underlying model---in particular, the design---and the
performance of estimators, motivating the use of this new Hellinger information
for non-regular optimal design problems. Hellinger optimal designs are derived
for several non-regular regression problems, with numerical results empirically
demonstrating the efficiency of these designs compared to alternatives.
| math.ST stat.ME stat.TH | classically fisher information is the relevant object in defining optimal experimental designs however for models that lack certain regularity the fisher information does not exist and hence there is no notion of design optimality available in the literature this article seeks to fill the gap by proposing a socalled hellinger information which generalizes fisher information in the sense that the two measures agree in regular problems but the former also exists for certain types of nonregular problems we derive a hellinger information inequality showing that hellinger information defines a lower bound on the local minimax risk of estimators this provides a connection between features of the underlying modelin particular the designand the performance of estimators motivating the use of this new hellinger information for nonregular optimal design problems hellinger optimal designs are derived for several nonregular regression problems with numerical results empirically demonstrating the efficiency of these designs compared to alternatives | [['classically', 'fisher', 'information', 'is', 'the', 'relevant', 'object', 'in', 'defining', 'optimal', 'experimental', 'designs', 'however', 'for', 'models', 'that', 'lack', 'certain', 'regularity', 'the', 'fisher', 'information', 'does', 'not', 'exist', 'and', 'hence', 'there', 'is', 'no', 'notion', 'of', 'design', 'optimality', 'available', 'in', 'the', 'literature', 'this', 'article', 'seeks', 'to', 'fill', 'the', 'gap', 'by', 'proposing', 'a', 'socalled', 'hellinger', 'information', 'which', 'generalizes', 'fisher', 'information', 'in', 'the', 'sense', 'that', 'the', 'two', 'measures', 'agree', 'in', 'regular', 'problems', 'but', 'the', 'former', 'also', 'exists', 'for', 'certain', 'types', 'of', 'nonregular', 'problems', 'we', 'derive', 'a', 'hellinger', 'information', 'inequality', 'showing', 'that', 'hellinger', 'information', 'defines', 'a', 'lower', 'bound', 'on', 'the', 'local', 'minimax', 'risk', 'of', 'estimators', 'this', 'provides', 'a', 'connection', 'between', 'features', 'of', 'the', 'underlying', 'modelin', 'particular', 'the', 'designand', 'the', 'performance', 'of', 'estimators', 'motivating', 'the', 'use', 'of', 'this', 'new', 'hellinger', 'information', 'for', 'nonregular', 'optimal', 'design', 'problems', 'hellinger', 'optimal', 'designs', 'are', 'derived', 'for', 'several', 'nonregular', 'regression', 'problems', 'with', 'numerical', 'results', 'empirically', 'demonstrating', 'the', 'efficiency', 'of', 'these', 'designs', 'compared', 'to', 'alternatives']] | [-0.0893684594007209, 0.005732331658558299, -0.09340735093535235, 0.16695570682175456, -0.10364887926727534, -0.18003644222859294, 0.06730080469317423, 0.3666944371210411, -0.2879077416984364, -0.2865477699413896, 0.1450589914340526, -0.28992457952350376, -0.2030514396354556, 0.2172144206132119, -0.17196448173684378, 0.11474292111272613, 0.07503384241368621, 0.048986574740459525, -0.15080358914254854, -0.27596212109550833, 0.33671230838634075, 0.06433852797839791, 0.3327335274343689, 0.04872445236891508, 0.10674291050216804, -0.010966909288739165, -0.0372872171488901, 0.041824672315269706, -0.21971479142002256, 0.19623970675592622, 0.3138873587532483, 0.218643339353924, 0.3466680021956563, -0.32293574883913, -0.20184502697860202, 0.1668470931518823, 0.09409285422569762, 0.07823184484848753, -0.0375539612576055, -0.23671289695426823, 0.052152916057190545, -0.12001811460902294, -0.0650369154382497, -0.07407580308713174, -0.036276298382629954, 0.017612105023581535, -0.3211911935545504, 0.11320479706841677, 0.10713550643995404, 0.04190668728047361, -0.035594576904550194, -0.13287215450778603, 0.023671803687078257, 0.11233775389535973, 0.04076745948754251, -0.03319506775510187, 0.09583211828023196, -0.1101810779220735, -0.1781282345415093, 0.29350251495217283, 0.00024589160767694314, -0.25740745482500643, 0.15038156491859506, -0.10804270697912823, -0.11344162278498213, 0.07215609253694613, 0.11980231525065999, 0.08453885292013487, -0.18393124553064505, 0.08109193860203959, -0.07806045235134661, 0.1350159843886892, 0.08409031396110853, 0.10865306848892942, 0.14365979767249276, 0.13833078236474344, 0.156044061674426, 0.15225318598405768, -0.04087951396980012, -0.142997830711926, -0.31711527408411105, -0.12903791311701449, -0.21441165026277303, -0.013848419277831757, -0.1589345349742992, -0.17418406929199895, 0.3403304526271919, 0.19905807577228796, 0.1568853626679629, 0.11304659010609612, 0.2796572051717279, 0.05619126801999907, 0.026144994720816613, 0.13754894054184358, 0.25412496527812134, 0.12101310120274623, 0.05797294788993895, -0.1660561300018647, 0.12235124020837247, 0.05221511050127447] |
1,802.10025 | On the one-dimensional family of Riemann surfaces of genus $q$ with $4q$
automorphisms | Bujalance, Costa and Izquierdo have recently proved that all those Riemann
surfaces of genus $g \ge 2$ different from $3, 6, 12, 15$ and 30, with exactly
$4g$ automorphisms form an equisymmetric one-dimensional family, denoted by
$\mathcal{F}_g.$ In this paper, for every prime number $q \ge 5,$ we explore
further properties of each Riemann surface $S$ in $\mathcal{F}_q$ as well as of
its Jacobian variety $JS.$
| math.AG | bujalance costa and izquierdo have recently proved that all those riemann surfaces of genus g ge 2 different from 3 6 12 15 and 30 with exactly 4g automorphisms form an equisymmetric onedimensional family denoted by mathcalf_g in this paper for every prime number q ge 5 we explore further properties of each riemann surface s in mathcalf_q as well as of its jacobian variety js | [['bujalance', 'costa', 'and', 'izquierdo', 'have', 'recently', 'proved', 'that', 'all', 'those', 'riemann', 'surfaces', 'of', 'genus', 'g', 'ge', '2', 'different', 'from', '3', '6', '12', '15', 'and', '30', 'with', 'exactly', '4g', 'automorphisms', 'form', 'an', 'equisymmetric', 'onedimensional', 'family', 'denoted', 'by', 'mathcalf_g', 'in', 'this', 'paper', 'for', 'every', 'prime', 'number', 'q', 'ge', '5', 'we', 'explore', 'further', 'properties', 'of', 'each', 'riemann', 'surface', 's', 'in', 'mathcalf_q', 'as', 'well', 'as', 'of', 'its', 'jacobian', 'variety', 'js']] | [-0.15659554660177002, 0.13914369079127656, 0.01788518185225817, 0.003961053682276262, -0.010694819448802333, -0.17829161056389028, -0.0339678041332473, 0.30043685416189525, -0.26876615381871277, -0.3490085600087276, 0.08795978276130671, -0.31345004150643946, -0.16298220622030876, 0.2093496107353041, -0.07014213159966927, 0.026112567822341448, -0.02808824168661466, 0.046393305532043225, -0.07707460741602028, -0.3384449805491246, 0.33423388541604465, -0.07827582665934013, 0.16608641597155768, 0.07010098265107864, 0.03160450129698102, 0.013577472576155112, 0.023971660839071353, -0.00040797038147082694, -0.1607470523034303, 0.04276556410432721, 0.25985382514504285, 0.09031433256056447, 0.22491562448155422, -0.361746857262915, -0.20373193059259884, 0.14846736929164484, 0.1305049824456756, -0.04692543209172212, -0.013607552762214955, -0.18970842285511585, 0.1769195314640036, -0.21720390858558508, -0.1715387850928192, -0.0023656236437650828, 0.12133794411157187, 0.017031931569083378, -0.16764055364407027, -0.03126197662204504, 0.08888718208047347, 0.14607438296796038, -0.007696854654484643, -0.2362836091994093, -0.09951132262627092, 0.06438942255738836, -0.005815967817146044, 0.1294836208761598, 0.004436807308453494, -0.08084609202252557, -0.08931818600170888, 0.326397745407079, -0.06647334687698346, -0.17212716138993317, 0.15072616547919238, -0.16759658424327006, -0.1722629572551411, 0.1434659879296445, 0.10175123107082282, 0.16275206730486108, -0.07043886103022556, 0.168430002218184, -0.08212922454739992, 0.08724976665868711, 0.15905494526467429, -0.04557846595998853, 0.11613689746994238, 0.09558514959465425, 0.04107613735832274, 0.08153415762174587, -0.10316984280943871, 0.0744586929320716, -0.30160409967379215, -0.22457488482961288, -0.1746810371002469, 0.17155404050046436, -0.13323009879856657, -0.10190615238478551, 0.38271487281801037, 0.03275343824464541, 0.1901345533820299, 0.10561311557315863, 0.15493184038652824, 0.007844242306712728, 0.043078143944820534, 0.14953746947531515, 0.10796777138916346, 0.1750641272080919, -0.05011942151289147, -0.09051098434899289, -0.031245615190038316, 0.1268275449768855] |
1,802.10026 | Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs | The loss functions of deep neural networks are complex and their geometric
properties are not well understood. We show that the optima of these complex
loss functions are in fact connected by simple curves over which training and
test accuracy are nearly constant. We introduce a training procedure to
discover these high-accuracy pathways between modes. Inspired by this new
geometric insight, we also propose a new ensembling method entitled Fast
Geometric Ensembling (FGE). Using FGE we can train high-performing ensembles in
the time required to train a single model. We achieve improved performance
compared to the recent state-of-the-art Snapshot Ensembles, on CIFAR-10,
CIFAR-100, and ImageNet.
| stat.ML cs.AI cs.LG | the loss functions of deep neural networks are complex and their geometric properties are not well understood we show that the optima of these complex loss functions are in fact connected by simple curves over which training and test accuracy are nearly constant we introduce a training procedure to discover these highaccuracy pathways between modes inspired by this new geometric insight we also propose a new ensembling method entitled fast geometric ensembling fge using fge we can train highperforming ensembles in the time required to train a single model we achieve improved performance compared to the recent stateoftheart snapshot ensembles on cifar10 cifar100 and imagenet | [['the', 'loss', 'functions', 'of', 'deep', 'neural', 'networks', 'are', 'complex', 'and', 'their', 'geometric', 'properties', 'are', 'not', 'well', 'understood', 'we', 'show', 'that', 'the', 'optima', 'of', 'these', 'complex', 'loss', 'functions', 'are', 'in', 'fact', 'connected', 'by', 'simple', 'curves', 'over', 'which', 'training', 'and', 'test', 'accuracy', 'are', 'nearly', 'constant', 'we', 'introduce', 'a', 'training', 'procedure', 'to', 'discover', 'these', 'highaccuracy', 'pathways', 'between', 'modes', 'inspired', 'by', 'this', 'new', 'geometric', 'insight', 'we', 'also', 'propose', 'a', 'new', 'ensembling', 'method', 'entitled', 'fast', 'geometric', 'ensembling', 'fge', 'using', 'fge', 'we', 'can', 'train', 'highperforming', 'ensembles', 'in', 'the', 'time', 'required', 'to', 'train', 'a', 'single', 'model', 'we', 'achieve', 'improved', 'performance', 'compared', 'to', 'the', 'recent', 'stateoftheart', 'snapshot', 'ensembles', 'on', 'cifar10', 'cifar100', 'and', 'imagenet']] | [-0.05879944250697181, 0.043902362523866555, -0.0667433303736505, 0.09377722742279902, -0.0899408947410328, -0.1588089367507824, 0.06443481498087446, 0.5011444319926557, -0.2694314770577919, -0.33771069642333756, 0.04293778521075312, -0.2209799141578731, -0.23623961075430824, 0.23298923624402268, -0.14615724251295129, 0.10165157181521257, 0.16182917769820918, -0.009284596606379463, -0.11620106769758942, -0.34820651419327725, 0.26906618857091025, 0.02770033910000209, 0.308989950021108, 0.014165947738192266, 0.13143562965449831, -0.07609636972968777, 0.008828373013862542, -0.006736895576163772, -0.08556048391377165, 0.16699787075853065, 0.21716597150523392, 0.18273440902343108, 0.27978243601198, -0.43015083969526346, -0.23004680228907437, 0.11183379804715514, 0.12220612257009461, 0.12361853141448505, -0.02157879585865885, -0.2964651807610478, 0.10179412971649851, -0.14847193371415848, -0.028526763549251925, -0.23448961906667268, -0.06955244236936171, 0.052021233613292375, -0.2798406347942849, 0.07440163556769092, 0.056462074533504034, 0.05463374571963435, -0.017183446263273557, -0.1267844233218403, 0.03214673635195054, 0.13094972777845604, -0.0316276634211785, 0.05611808119519126, 0.09772725444996641, -0.1449633770112303, -0.1596832183766223, 0.31460541647282386, -0.08934296752725329, -0.21307840872378575, 0.2202119469642639, -0.029693406112935573, -0.12704591549312075, 0.08545213347478282, 0.2619526215429817, 0.16541555921236675, -0.14046729068670954, 0.005504511077777438, -0.0300364154790129, 0.1555407988173621, 0.06779024907432142, 0.015708100746962286, 0.1482275074813515, 0.24402646186451118, 0.011309245552512861, 0.14346996967215092, -0.10571871547338864, -0.07337893915495702, -0.23031826914687242, -0.08387996300478422, -0.185805384686128, 0.0619905675474521, -0.09759134197388665, -0.14653704047557853, 0.4106936995117437, 0.16685952306059854, 0.2592392887121865, 0.14833455634680354, 0.3023169743163245, 0.017362251540734654, 0.11070616718470341, 0.10903020855926332, 0.2347212929899494, 0.03517807983305483, 0.06338001518798549, -0.15324076530301856, 0.032908070015366234, 0.06777621581263485] |
1,802.10027 | GRB 170817A-GW170817-AT 2017gfo and the observations of NS-NS, NS-WD and
WD-WD mergers | The LIGO-Virgo Collaboration has announced the detection of GW170817 and has
associated it with GRB 170817A. These signals have been followed after 11 hours
by the optical and infrared emission of AT 2017gfo. The origin of this complex
phenomenon has been attributed to a neutron star-neutron star (NS-NS) merger.
In order to probe this association we confront our current understanding of the
gravitational waves and associated electromagnetic radiation with four observed
GRBs originating in binaries composed of different combinations NSs and white
dwarfs (WDs). We consider 1) GRB 090510 the prototype of NS-NS merger leading
to a black hole (BH); 2) GRB 130603B the prototype of a NS-NS merger leading to
massive NS (MNS) with an associated kilonova; 3) GRB 060614 the prototype of a
NS-WD merger leading to a MNS with an associated kilonova candidate; 4) GRB
170817A the prototype of a WD-WD merger leading to massive WD with an
associated AT 2017gfo-like emission. None of these systems support the above
mentioned association. The clear association between GRB 170817A and AT 2017gfo
has led to introduce a new model based on on a new subfamily of GRBs
originating from WD-WD mergers. We show how this novel model is in agreement
with the exceptional observations in the optical, infrared, X- and gamma-rays
of GRB 170817A-AT 2017gfo.
| astro-ph.HE gr-qc | the ligovirgo collaboration has announced the detection of gw170817 and has associated it with grb 170817a these signals have been followed after 11 hours by the optical and infrared emission of at 2017gfo the origin of this complex phenomenon has been attributed to a neutron starneutron star nsns merger in order to probe this association we confront our current understanding of the gravitational waves and associated electromagnetic radiation with four observed grbs originating in binaries composed of different combinations nss and white dwarfs wds we consider 1 grb 090510 the prototype of nsns merger leading to a black hole bh 2 grb 130603b the prototype of a nsns merger leading to massive ns mns with an associated kilonova 3 grb 060614 the prototype of a nswd merger leading to a mns with an associated kilonova candidate 4 grb 170817a the prototype of a wdwd merger leading to massive wd with an associated at 2017gfolike emission none of these systems support the above mentioned association the clear association between grb 170817a and at 2017gfo has led to introduce a new model based on on a new subfamily of grbs originating from wdwd mergers we show how this novel model is in agreement with the exceptional observations in the optical infrared x and gammarays of grb 170817aat 2017gfo | [['the', 'ligovirgo', 'collaboration', 'has', 'announced', 'the', 'detection', 'of', 'gw170817', 'and', 'has', 'associated', 'it', 'with', 'grb', '170817a', 'these', 'signals', 'have', 'been', 'followed', 'after', '11', 'hours', 'by', 'the', 'optical', 'and', 'infrared', 'emission', 'of', 'at', '2017gfo', 'the', 'origin', 'of', 'this', 'complex', 'phenomenon', 'has', 'been', 'attributed', 'to', 'a', 'neutron', 'starneutron', 'star', 'nsns', 'merger', 'in', 'order', 'to', 'probe', 'this', 'association', 'we', 'confront', 'our', 'current', 'understanding', 'of', 'the', 'gravitational', 'waves', 'and', 'associated', 'electromagnetic', 'radiation', 'with', 'four', 'observed', 'grbs', 'originating', 'in', 'binaries', 'composed', 'of', 'different', 'combinations', 'nss', 'and', 'white', 'dwarfs', 'wds', 'we', 'consider', '1', 'grb', '090510', 'the', 'prototype', 'of', 'nsns', 'merger', 'leading', 'to', 'a', 'black', 'hole', 'bh', '2', 'grb', '130603b', 'the', 'prototype', 'of', 'a', 'nsns', 'merger', 'leading', 'to', 'massive', 'ns', 'mns', 'with', 'an', 'associated', 'kilonova', '3', 'grb', '060614', 'the', 'prototype', 'of', 'a', 'nswd', 'merger', 'leading', 'to', 'a', 'mns', 'with', 'an', 'associated', 'kilonova', 'candidate', '4', 'grb', '170817a', 'the', 'prototype', 'of', 'a', 'wdwd', 'merger', 'leading', 'to', 'massive', 'wd', 'with', 'an', 'associated', 'at', '2017gfolike', 'emission', 'none', 'of', 'these', 'systems', 'support', 'the', 'above', 'mentioned', 'association', 'the', 'clear', 'association', 'between', 'grb', '170817a', 'and', 'at', '2017gfo', 'has', 'led', 'to', 'introduce', 'a', 'new', 'model', 'based', 'on', 'on', 'a', 'new', 'subfamily', 'of', 'grbs', 'originating', 'from', 'wdwd', 'mergers', 'we', 'show', 'how', 'this', 'novel', 'model', 'is', 'in', 'agreement', 'with', 'the', 'exceptional', 'observations', 'in', 'the', 'optical', 'infrared', 'x', 'and', 'gammarays', 'of', 'grb', '170817aat', '2017gfo']] | [-0.1118737669339595, 0.11792279410176795, -0.037088023452958634, 0.14221911394650935, -0.1551789358676037, -0.0952699791344109, 0.045432123331631595, 0.42411060308358656, -0.11770378921067268, -0.29005144949062406, 0.04171613058745513, -0.3564813848493499, -0.05075078428870885, 0.22683243163769942, -0.004894074287578882, -0.02433025846736523, 0.1230389766055638, -0.021057043901577192, -0.09260461127350682, -0.23411874212901257, 0.3245054106119254, 0.10619930589147822, 0.12362493495100556, -0.046427679415705185, 0.12174415181904474, -0.04551642145673205, -0.05516974232594753, -0.11417955269593154, -0.11027008564555234, -0.0012931238411638504, 0.23173417145099107, 0.15679880912376515, 0.16793642729133473, -0.38098095603304627, -0.24309214053101072, 0.10306938688344731, 0.13954837739284837, 0.010798794839196081, -0.11971884917698487, -0.32187434673966475, 0.0947833724965115, -0.3282326573123024, -0.15949300816609027, 0.11382145714014769, 0.04351665073636893, 0.05268292760946483, -0.17671941450599007, 0.09738183917181793, 0.006340617547899693, -0.036969505069847, -0.08508590926746969, 0.003135078984843654, -0.014480600672095108, 0.012105737881360698, 0.10640800250291597, 0.12466757441218072, 0.07482657518464132, -0.12597706116503105, -0.14811274103894306, 0.4022448961908611, -0.04562532255550081, 0.03567001368627703, 0.24386879421414798, -0.2037043244443033, -0.21881009191144082, 0.2143637553563507, 0.14212891967775665, 0.09714380931870785, -0.19132921589477528, -0.03941199734369641, 0.037084996169345956, 0.17429911861822844, 0.0636255178376423, 0.06466246142552455, 0.38203459185609057, 0.2041211586280195, -0.05283863049448755, 0.09579290459520036, -0.22641557978306218, 0.040006350003461415, -0.2794917271411042, -0.09231481223288819, -0.11193743488908023, 0.1847076282293044, -0.10988612307697179, -0.1216031732467421, 0.39022073593582507, 0.09127554477292557, 0.1636318438392672, 0.00030253041387648784, 0.23281247822119566, 0.08028325850522651, 0.08639189289778332, 0.08043648316046205, 0.3597980038933108, 0.16063994206227014, 0.08517289756161865, -0.22191595546052592, 0.07644619906286353, 0.015652703177880183] |
1,802.10028 | Spin-polaron ladder spectrum of the spin-orbit-induced Mott insulator
Sr$_2$IrO$_{4}$ probed by scanning tunneling spectroscopy | The motion of doped electrons or holes in an antiferromagnetic lattice with
strong on-site Coulomb interactions touches one of the most fundamental open
problems in contemporary condensed matter physics. The doped charge may
strongly couple to elementary spin excitations resulting in a dressed
quasiparticle which is subject to confinement. This 'spin-polaron' possesses
internal degrees of freedom with a characteristic 'ladder' excitation spectrum.
Despite its fundamental importance for understanding high-temperature
superconductivity, clear experimental spectroscopic signatures of these
internal degrees of freedom are scarce. Here we present scanning tunneling
spectroscopy results of the spin-orbit-induced Mott insulator Sr$_2$IrO$_{4}$.
Our spectroscopy data reveal distinct shoulder-like features for occupied and
unoccupied states beyond a measured Mott gap of $\Delta\approx620$~meV. Using
the self-consistent Born approximation we assign the anomalies in the
unoccupied states to the spin-polaronic ladder spectrum with excellent
quantitative agreement and estimate the Coulomb repulsion $U$ = 2.05 ...2.28 eV
in this material. These results confirm the strongly correlated electronic
structure of this compound and underpin the previously conjectured paradigm of
emergent unconventional superconductivity in doped Sr$_2$IrO$_{4}$.
| cond-mat.str-el | the motion of doped electrons or holes in an antiferromagnetic lattice with strong onsite coulomb interactions touches one of the most fundamental open problems in contemporary condensed matter physics the doped charge may strongly couple to elementary spin excitations resulting in a dressed quasiparticle which is subject to confinement this spinpolaron possesses internal degrees of freedom with a characteristic ladder excitation spectrum despite its fundamental importance for understanding hightemperature superconductivity clear experimental spectroscopic signatures of these internal degrees of freedom are scarce here we present scanning tunneling spectroscopy results of the spinorbitinduced mott insulator sr_2iro_4 our spectroscopy data reveal distinct shoulderlike features for occupied and unoccupied states beyond a measured mott gap of deltaapprox620mev using the selfconsistent born approximation we assign the anomalies in the unoccupied states to the spinpolaronic ladder spectrum with excellent quantitative agreement and estimate the coulomb repulsion u 205 228 ev in this material these results confirm the strongly correlated electronic structure of this compound and underpin the previously conjectured paradigm of emergent unconventional superconductivity in doped sr_2iro_4 | [['the', 'motion', 'of', 'doped', 'electrons', 'or', 'holes', 'in', 'an', 'antiferromagnetic', 'lattice', 'with', 'strong', 'onsite', 'coulomb', 'interactions', 'touches', 'one', 'of', 'the', 'most', 'fundamental', 'open', 'problems', 'in', 'contemporary', 'condensed', 'matter', 'physics', 'the', 'doped', 'charge', 'may', 'strongly', 'couple', 'to', 'elementary', 'spin', 'excitations', 'resulting', 'in', 'a', 'dressed', 'quasiparticle', 'which', 'is', 'subject', 'to', 'confinement', 'this', 'spinpolaron', 'possesses', 'internal', 'degrees', 'of', 'freedom', 'with', 'a', 'characteristic', 'ladder', 'excitation', 'spectrum', 'despite', 'its', 'fundamental', 'importance', 'for', 'understanding', 'hightemperature', 'superconductivity', 'clear', 'experimental', 'spectroscopic', 'signatures', 'of', 'these', 'internal', 'degrees', 'of', 'freedom', 'are', 'scarce', 'here', 'we', 'present', 'scanning', 'tunneling', 'spectroscopy', 'results', 'of', 'the', 'spinorbitinduced', 'mott', 'insulator', 'sr_2iro_4', 'our', 'spectroscopy', 'data', 'reveal', 'distinct', 'shoulderlike', 'features', 'for', 'occupied', 'and', 'unoccupied', 'states', 'beyond', 'a', 'measured', 'mott', 'gap', 'of', 'deltaapprox620mev', 'using', 'the', 'selfconsistent', 'born', 'approximation', 'we', 'assign', 'the', 'anomalies', 'in', 'the', 'unoccupied', 'states', 'to', 'the', 'spinpolaronic', 'ladder', 'spectrum', 'with', 'excellent', 'quantitative', 'agreement', 'and', 'estimate', 'the', 'coulomb', 'repulsion', 'u', '205', '228', 'ev', 'in', 'this', 'material', 'these', 'results', 'confirm', 'the', 'strongly', 'correlated', 'electronic', 'structure', 'of', 'this', 'compound', 'and', 'underpin', 'the', 'previously', 'conjectured', 'paradigm', 'of', 'emergent', 'unconventional', 'superconductivity', 'in', 'doped', 'sr_2iro_4']] | [-0.1695790324935361, 0.21221589208726072, -0.04856398699647638, 0.07423639394315508, -0.044739411482313536, -0.1620518175556379, 0.12026061555918525, 0.3676365721094258, -0.25176625448768714, -0.2986182923483498, -0.0639092611902229, -0.38625965511481114, -0.10466053852989503, 0.0996026432593627, 0.060370536140330576, -0.01577451504736553, -0.0021727640469394187, -0.04127990242833381, -0.09430149385486455, -0.20036415407405858, 0.2639939989155049, 0.03204539200729307, 0.2870089283582809, 0.12555406284244622, 0.009141008860623355, 0.03554030237308539, 0.10011643982108902, -0.02156457463707364, -0.16235312674030222, 0.10075947067303145, 0.30679337184410543, -0.10025059035636813, 0.20439852345050039, -0.43514656299615606, -0.22850182445938974, -0.035096690968117294, 0.17769283603582367, 0.13853677305981846, -0.09532138990950496, -0.30390624418745144, -0.029767921506701146, -0.15501742084127137, -0.17528697108226718, -0.11611421658000087, -0.022385994903743267, -0.035479986478629356, -0.1972962872717557, 0.13675661059644292, 0.027499793306239608, 0.08590937949073336, -0.1290119171341169, -0.14149983636213137, -0.06499727707328823, 0.0672239576890955, 0.02759559980203288, 0.05614075730280841, 0.11382981744485304, -0.1492650178329581, -0.13068901092800148, 0.3805115782381857, -0.018570169765735046, -0.06245902794522836, 0.21945130473605412, -0.21197305008878603, -0.11959513120716164, 0.17679562828527517, 0.055954992342808776, 0.07864175597445437, -0.13116339901496438, 0.09881905699319973, -0.04883548569153337, 0.18294534543734592, -0.003690565821221646, 0.1894373973882466, 0.2922327071976136, 0.1975905745570986, 0.007456422514994355, 0.08752520844162277, -0.09976022760726183, -0.09138822099467848, -0.2294617909445044, -0.13127646657110958, -0.24830648362198296, 0.06641057805664947, -0.033769800593162314, -0.1941408980939099, 0.42413041176555183, 0.16338705317843158, 0.14489966660570752, -0.11476145902689656, 0.2194633781346056, 0.08830076909884263, 0.04342756339841906, 0.021197502487613, 0.2824743578415912, 0.18799130658701282, 0.08020961773307884, -0.31576076453168167, 0.013467055085279485, 0.0107231553281] |
1,802.10029 | Global phase diagram of the one-dimensional Sachdev-Ye-Kitaev model at
finite $N$ | Many key features of the higher-dimensional Sachdev-Ye-Kitaev (SYK) model at
{\it finite} $N$ remain unknown. Here we study the SYK chain consisting of $N$
($N$$\ge$$2$) fermions per site with random interactions and hoppings between
neighboring sites. In the limit of vanishing SYK interactions, from both
supersymmetric field theory analysis and numerical calculations we find that
the random hopping model exhibits Anderson localization at finite $N$,
irrespective of the parity of $N$. Moreover, the localization length scales
linearly with N, implying no Anderson localization \textit{only} at
$N\!=\!\infty$. For finite SYK interaction $J$ , from the exact diagonalization
we show that there is a dynamic phase transition between many-body localization
and thermal diffusion as $J$ exceeds a critical value $J_c$. In addition, we
find that the critical value $J_c$ decreases with the increase of $N$,
qualitatively consistent with the analytical result of $J_c/t \!\propto\!
\frac{1}{N^{5/2}\log N}$ derived from the weakly interacting limit.
| cond-mat.str-el | many key features of the higherdimensional sachdevyekitaev syk model at it finite n remain unknown here we study the syk chain consisting of n nge2 fermions per site with random interactions and hoppings between neighboring sites in the limit of vanishing syk interactions from both supersymmetric field theory analysis and numerical calculations we find that the random hopping model exhibits anderson localization at finite n irrespective of the parity of n moreover the localization length scales linearly with n implying no anderson localization textitonly at ninfty for finite syk interaction j from the exact diagonalization we show that there is a dynamic phase transition between manybody localization and thermal diffusion as j exceeds a critical value j_c in addition we find that the critical value j_c decreases with the increase of n qualitatively consistent with the analytical result of j_ct propto frac1n52log n derived from the weakly interacting limit | [['many', 'key', 'features', 'of', 'the', 'higherdimensional', 'sachdevyekitaev', 'syk', 'model', 'at', 'it', 'finite', 'n', 'remain', 'unknown', 'here', 'we', 'study', 'the', 'syk', 'chain', 'consisting', 'of', 'n', 'nge2', 'fermions', 'per', 'site', 'with', 'random', 'interactions', 'and', 'hoppings', 'between', 'neighboring', 'sites', 'in', 'the', 'limit', 'of', 'vanishing', 'syk', 'interactions', 'from', 'both', 'supersymmetric', 'field', 'theory', 'analysis', 'and', 'numerical', 'calculations', 'we', 'find', 'that', 'the', 'random', 'hopping', 'model', 'exhibits', 'anderson', 'localization', 'at', 'finite', 'n', 'irrespective', 'of', 'the', 'parity', 'of', 'n', 'moreover', 'the', 'localization', 'length', 'scales', 'linearly', 'with', 'n', 'implying', 'no', 'anderson', 'localization', 'textitonly', 'at', 'ninfty', 'for', 'finite', 'syk', 'interaction', 'j', 'from', 'the', 'exact', 'diagonalization', 'we', 'show', 'that', 'there', 'is', 'a', 'dynamic', 'phase', 'transition', 'between', 'manybody', 'localization', 'and', 'thermal', 'diffusion', 'as', 'j', 'exceeds', 'a', 'critical', 'value', 'j_c', 'in', 'addition', 'we', 'find', 'that', 'the', 'critical', 'value', 'j_c', 'decreases', 'with', 'the', 'increase', 'of', 'n', 'qualitatively', 'consistent', 'with', 'the', 'analytical', 'result', 'of', 'j_ct', 'propto', 'frac1n52log', 'n', 'derived', 'from', 'the', 'weakly', 'interacting', 'limit']] | [-0.17322056804393493, 0.25305771231777163, 0.004604602872073096, 0.038946682891676306, 0.046878072209782094, -0.2339799522290107, 0.05593067356558341, 0.31226796849404237, -0.20924667121427185, -0.25551580262961926, 0.008831448421964573, -0.376119750111389, -0.1541423333314801, 0.10678259607851254, 0.08338851987925433, -0.0030457307962146966, 0.012427764795280087, 0.06807404183908491, -0.0821421077188633, -0.22707912760056756, 0.25394650646862954, 0.026015627706058423, 0.2652506972368133, 0.06719926218942714, 0.0423121021689243, 0.06383423433588767, 0.06497967415615111, 0.010875909394156691, -0.14738624824152596, 0.03996317485428802, 0.22838068008147544, -0.036024544551666524, 0.2071959131485405, -0.40020763984176555, -0.2052669718443114, 0.10742629693374289, 0.20044111445974055, 0.1295802243167182, -0.0022615075278146243, -0.2523536683576232, 0.05065963624951404, -0.18533011554501247, -0.17357314234234494, -0.03016799985670258, 0.05979790743456122, 0.0018808873719535768, -0.30366081208292695, 0.13178576698772157, 0.050449439047558886, 0.072305366863696, -0.032831493626675895, -0.10561146188332271, -0.038791792589944564, 0.11639655037543963, 0.07079043566891169, 0.027720968655902088, 0.10103453421411482, -0.14482808741740882, -0.09240710360746882, 0.33142754993703516, -0.10403732355130282, -0.1448861730373087, 0.21844018938970072, -0.18059749326612046, -0.1470560295117163, 0.13427558722528252, 0.05937528399423369, 0.08033725864732184, -0.052899890296110835, 0.1909627839848179, -0.07658014282256968, 0.20169155837219158, 0.007691444534921666, 0.06087339591672267, 0.18824209106104398, 0.16365693264791892, 0.06995477548106636, 0.13343983923236058, -0.06377882154098384, -0.15116054765137568, -0.3222534880042076, -0.08290516302804463, -0.2829618966584471, 0.11764921405513117, -0.17408534986050753, -0.20083609420957194, 0.3449875829691017, 0.21569749119600135, 0.24112523585004178, 0.12101919084277658, 0.17203300662426832, 0.12099535648972173, -0.0037885633347606337, 0.08642088398463219, 0.16157912139818575, 0.13493513703311644, 0.06041559342387749, -0.2979478162880106, -0.014299008325119881, 0.13767209787368523] |
1,802.1003 | Plasma ramps caused by outflow in gas-filled capillaries | Plasma confinement inside capillaries has been developed in the past years
for plasma-based acceleration to ensure a stable and repeatable plasma density
distribution during the interaction with either particles or laser beams. In
particular, gas-filled capillaries allow a stable and almost predictable plasma
distribution along the interaction with the particles. However, the plasma
ejected through the ends of the capillary interacts with the beam before the
inner plasma, affecting the quality of the beam. In this article we report the
measurements on the evolution of the plasma flow at the two ends of a 1 cm
long, 1 mm diameter capillary filled with hydrogen. In particular, we measured
the longitudinal density distribution and the expansion velocity of the plasma
outside the capillary. This study will allow a better understanding of the
beam-plasma interaction for future plasma-based experiments.
| physics.acc-ph physics.plasm-ph | plasma confinement inside capillaries has been developed in the past years for plasmabased acceleration to ensure a stable and repeatable plasma density distribution during the interaction with either particles or laser beams in particular gasfilled capillaries allow a stable and almost predictable plasma distribution along the interaction with the particles however the plasma ejected through the ends of the capillary interacts with the beam before the inner plasma affecting the quality of the beam in this article we report the measurements on the evolution of the plasma flow at the two ends of a 1 cm long 1 mm diameter capillary filled with hydrogen in particular we measured the longitudinal density distribution and the expansion velocity of the plasma outside the capillary this study will allow a better understanding of the beamplasma interaction for future plasmabased experiments | [['plasma', 'confinement', 'inside', 'capillaries', 'has', 'been', 'developed', 'in', 'the', 'past', 'years', 'for', 'plasmabased', 'acceleration', 'to', 'ensure', 'a', 'stable', 'and', 'repeatable', 'plasma', 'density', 'distribution', 'during', 'the', 'interaction', 'with', 'either', 'particles', 'or', 'laser', 'beams', 'in', 'particular', 'gasfilled', 'capillaries', 'allow', 'a', 'stable', 'and', 'almost', 'predictable', 'plasma', 'distribution', 'along', 'the', 'interaction', 'with', 'the', 'particles', 'however', 'the', 'plasma', 'ejected', 'through', 'the', 'ends', 'of', 'the', 'capillary', 'interacts', 'with', 'the', 'beam', 'before', 'the', 'inner', 'plasma', 'affecting', 'the', 'quality', 'of', 'the', 'beam', 'in', 'this', 'article', 'we', 'report', 'the', 'measurements', 'on', 'the', 'evolution', 'of', 'the', 'plasma', 'flow', 'at', 'the', 'two', 'ends', 'of', 'a', '1', 'cm', 'long', '1', 'mm', 'diameter', 'capillary', 'filled', 'with', 'hydrogen', 'in', 'particular', 'we', 'measured', 'the', 'longitudinal', 'density', 'distribution', 'and', 'the', 'expansion', 'velocity', 'of', 'the', 'plasma', 'outside', 'the', 'capillary', 'this', 'study', 'will', 'allow', 'a', 'better', 'understanding', 'of', 'the', 'beamplasma', 'interaction', 'for', 'future', 'plasmabased', 'experiments']] | [-0.1102935312244443, 0.2476370044521661, -0.08186796985831737, -0.017792168649484533, 0.008696663093134544, -0.09327496193947583, -0.045591274476916036, 0.41399332133196565, -0.21661090979991604, -0.27934026174641546, 0.06760424672945464, -0.27265005710663914, 0.002456924121786099, 0.16114077933071466, 0.02635413970471951, 0.06629325938920905, 0.07861505059974037, 0.003807006692717763, -0.027393033218155376, -0.1618362443188518, 0.270046950110581, 0.1312437946202886, 0.2753444300814919, 0.10265226388540473, 0.11055295774968082, -0.007822916802209224, -0.0061715738236034, 0.009678757226053816, -0.16862801426754379, 0.0796746857613869, 0.1687889370475012, 0.04074037505354542, 0.28081462559473774, -0.5134632285296863, -0.25872226416330485, 0.032649831334596334, 0.17776934750867587, 0.06765444130793105, -0.07957763387056843, -0.23181506983228845, 0.009574868296099704, -0.15961274802412864, -0.20085789673846133, 0.06417110508195648, 0.030798212244399707, 0.09302567105135288, -0.25547155481593237, 0.04307720847988678, 0.017495705081612196, 0.02605564477615548, -0.04723047750940832, -0.048908900150036724, -0.002022964064113415, 0.08620277865803426, 0.06966176543411982, 0.0350702781566711, 0.21736853902846792, -0.15661392838823318, -0.018062292825920086, 0.3803244892127105, -0.08156752178231322, -0.12756610459165416, 0.21004641829670345, -0.24386945435009136, -0.04904548040706746, 0.20942719795326464, 0.1894689500297889, 0.07881848537278137, -0.09618153288131104, -0.00026351267286664704, -0.004989560623823182, 0.1438592132712021, 0.164054425185152, -0.026547250535040007, 0.2734996874537999, 0.23215752901478814, 0.030745710966850283, 0.11703441440158381, -0.12363730264100226, -0.036218240078756195, -0.2978175712450251, -0.16451778150687035, -0.125084716364415, 0.0072428543293971, -0.04370495291517276, -0.16537320347720363, 0.43077186157886127, 0.11988555622716429, 0.15880101252632745, -0.03213162601068888, 0.33431966855686945, 0.04131581089000496, 0.028707877059813834, 0.07748215179890394, 0.3054174468954549, 0.1612474768725054, 0.1626703290771829, -0.23633320709812816, 0.05173372828748322, -0.0054039119685027935] |
1,802.10031 | The Mirage of Action-Dependent Baselines in Reinforcement Learning | Policy gradient methods are a widely used class of model-free reinforcement
learning algorithms where a state-dependent baseline is used to reduce gradient
estimator variance. Several recent papers extend the baseline to depend on both
the state and action and suggest that this significantly reduces variance and
improves sample efficiency without introducing bias into the gradient
estimates. To better understand this development, we decompose the variance of
the policy gradient estimator and numerically show that learned
state-action-dependent baselines do not in fact reduce variance over a
state-dependent baseline in commonly tested benchmark domains. We confirm this
unexpected result by reviewing the open-source code accompanying these prior
papers, and show that subtle implementation decisions cause deviations from the
methods presented in the papers and explain the source of the previously
observed empirical gains. Furthermore, the variance decomposition highlights
areas for improvement, which we demonstrate by illustrating a simple change to
the typical value function parameterization that can significantly improve
performance.
| cs.LG stat.ML | policy gradient methods are a widely used class of modelfree reinforcement learning algorithms where a statedependent baseline is used to reduce gradient estimator variance several recent papers extend the baseline to depend on both the state and action and suggest that this significantly reduces variance and improves sample efficiency without introducing bias into the gradient estimates to better understand this development we decompose the variance of the policy gradient estimator and numerically show that learned stateactiondependent baselines do not in fact reduce variance over a statedependent baseline in commonly tested benchmark domains we confirm this unexpected result by reviewing the opensource code accompanying these prior papers and show that subtle implementation decisions cause deviations from the methods presented in the papers and explain the source of the previously observed empirical gains furthermore the variance decomposition highlights areas for improvement which we demonstrate by illustrating a simple change to the typical value function parameterization that can significantly improve performance | [['policy', 'gradient', 'methods', 'are', 'a', 'widely', 'used', 'class', 'of', 'modelfree', 'reinforcement', 'learning', 'algorithms', 'where', 'a', 'statedependent', 'baseline', 'is', 'used', 'to', 'reduce', 'gradient', 'estimator', 'variance', 'several', 'recent', 'papers', 'extend', 'the', 'baseline', 'to', 'depend', 'on', 'both', 'the', 'state', 'and', 'action', 'and', 'suggest', 'that', 'this', 'significantly', 'reduces', 'variance', 'and', 'improves', 'sample', 'efficiency', 'without', 'introducing', 'bias', 'into', 'the', 'gradient', 'estimates', 'to', 'better', 'understand', 'this', 'development', 'we', 'decompose', 'the', 'variance', 'of', 'the', 'policy', 'gradient', 'estimator', 'and', 'numerically', 'show', 'that', 'learned', 'stateactiondependent', 'baselines', 'do', 'not', 'in', 'fact', 'reduce', 'variance', 'over', 'a', 'statedependent', 'baseline', 'in', 'commonly', 'tested', 'benchmark', 'domains', 'we', 'confirm', 'this', 'unexpected', 'result', 'by', 'reviewing', 'the', 'opensource', 'code', 'accompanying', 'these', 'prior', 'papers', 'and', 'show', 'that', 'subtle', 'implementation', 'decisions', 'cause', 'deviations', 'from', 'the', 'methods', 'presented', 'in', 'the', 'papers', 'and', 'explain', 'the', 'source', 'of', 'the', 'previously', 'observed', 'empirical', 'gains', 'furthermore', 'the', 'variance', 'decomposition', 'highlights', 'areas', 'for', 'improvement', 'which', 'we', 'demonstrate', 'by', 'illustrating', 'a', 'simple', 'change', 'to', 'the', 'typical', 'value', 'function', 'parameterization', 'that', 'can', 'significantly', 'improve', 'performance']] | [-0.02319323739547069, 0.0017032878070025687, -0.10153685053543537, 0.0967041457318078, -0.10621138951136096, -0.1218482085984129, 0.06683222144014635, 0.4304074592840899, -0.2649318050610934, -0.3366311336659892, 0.09594402042481526, -0.22899276418552086, -0.1722175599117378, 0.23900300801871047, -0.15107527215057498, 0.03967611922490986, 0.12244526265859366, -0.021419937953732576, -0.10063788523767025, -0.316232557795574, 0.25501351616090273, 0.09334728294971642, 0.3598216957513504, 0.03545660619879035, 0.10153432601801814, -0.03303898830310839, -0.07967771163394165, 0.049131959002720084, -0.10474922669889067, 0.11096749624984849, 0.2582519412171214, 0.15549915615813273, 0.320481191834162, -0.37999036692202076, -0.2638813844662468, 0.12057731574650403, 0.15081804289903705, 0.10908283458082421, -0.0254009845258763, -0.27294742002576045, 0.050110317503063564, -0.18553519937814847, -0.07250602668222443, -0.1188168492817741, -0.04931112141889716, 0.049302232062450026, -0.2942383610406167, 0.08964873196047013, 0.07626284546942515, 0.04142475982380521, -0.025844506246103034, -0.20973918960981403, 0.06247482767364212, 0.10490240475495055, 0.10031258333904466, 0.052216771103228164, 0.15700376165473157, -0.10866402488373884, -0.15117924167199215, 0.2897516922182908, -0.12057659360075927, -0.1866803381853043, 0.1617692845612527, -0.08099998604909629, -0.12309377822597885, 0.10101476064319634, 0.2190036057897956, 0.08888598322085324, -0.1470428807216038, 0.02518190694809743, 0.00458563536636911, 0.18317715476925492, 0.0294445785219265, -0.011246766426428488, 0.09322599094556823, 0.163922402186165, 0.09253284001091175, 0.13617336981971362, -0.07833893367409658, -0.12125546064681617, -0.2558287154389308, -0.12213017728927124, -0.1614612712714655, -0.019515242328133973, -0.10997676061244628, -0.11115418458772693, 0.3937035790187823, 0.25621330824378097, 0.18559442053898978, 0.109994068675805, 0.3286719527421816, 0.08220669850973994, 0.09131305284537138, 0.12122683404280454, 0.25495543198179527, 0.05119818301313812, 0.08664095323387486, -0.25256970632305237, 0.13824606217684188, 0.032901970634035244] |
1,802.10032 | First laboratory detection of vibration-rotation transitions of CH$^+$
and $^{13}$CH$^+$ and improved measurement of their rotational transition
frequencies | The long-searched C-H stretches of the fundamental ions CH$^+$ and
$^{13}$CH$^+$ have been observed for the first time in the laboratory. For
this, the state-dependent attachment of He atoms to these ions at cryogenic
temperatures has been exploited to obtain high-resolution rovibrational data.
In addition, the lowest rotational transitions of CH$^+$, $^{13}$CH$^+$ and
CD$^+$ have been revisited and their rest frequency values improved
substantially.
| astro-ph.GA | the longsearched ch stretches of the fundamental ions ch and 13ch have been observed for the first time in the laboratory for this the statedependent attachment of he atoms to these ions at cryogenic temperatures has been exploited to obtain highresolution rovibrational data in addition the lowest rotational transitions of ch 13ch and cd have been revisited and their rest frequency values improved substantially | [['the', 'longsearched', 'ch', 'stretches', 'of', 'the', 'fundamental', 'ions', 'ch', 'and', '13ch', 'have', 'been', 'observed', 'for', 'the', 'first', 'time', 'in', 'the', 'laboratory', 'for', 'this', 'the', 'statedependent', 'attachment', 'of', 'he', 'atoms', 'to', 'these', 'ions', 'at', 'cryogenic', 'temperatures', 'has', 'been', 'exploited', 'to', 'obtain', 'highresolution', 'rovibrational', 'data', 'in', 'addition', 'the', 'lowest', 'rotational', 'transitions', 'of', 'ch', '13ch', 'and', 'cd', 'have', 'been', 'revisited', 'and', 'their', 'rest', 'frequency', 'values', 'improved', 'substantially']] | [-0.02618684610795407, 0.1546760477376954, 0.00897889177034062, -0.004802139278220397, 0.025548366711489738, -0.14759981210920073, 0.06317807385136211, 0.44613932226858444, -0.20381801939081579, -0.30381743598078925, 0.03394528968806659, -0.25331129971152494, 0.03941447710588811, 0.12803708520230084, 0.038278974958562424, 0.062431218936191205, 0.012216926419309207, 0.02308190868528087, -0.01490961481624889, -0.2028817910117112, 0.20281595458823537, 0.13662408485949512, 0.272404226755339, 0.06587529419699595, 0.06906691360073017, -0.12975921567588572, -0.005470594686884728, -0.0403619199872963, -0.14743451454809733, 0.11135124894125122, 0.28474143204382724, 0.05671181944051078, 0.2150509510307558, -0.4420552042623361, -0.26804213718112024, 0.08597320190349979, 0.17569292856690785, 0.1687627419356316, -0.03316983443108343, -0.2865489661870968, 0.005452566203616914, -0.10977903899869748, -0.1035045049345446, -0.05606068114912699, 0.12284525526717069, 0.06312487539022214, -0.20715053234663275, 0.06454298354034858, 0.03988810835613145, 0.13567808353238636, -0.134191543129938, -0.20483229800112665, -0.06260498256851284, 0.1374620119412799, 0.011359731208473917, 0.014392277255417809, 0.09507859779137467, -0.03628702628396688, -0.05725146711818756, 0.41962336080651436, -0.11235501763543912, -0.05470889800834277, 0.24539094721336688, -0.18059339226474838, -0.22541692056175736, 0.20573301134364946, 0.12299913164996912, 0.11216214203297914, -0.15091994838486056, 0.05407274795034605, 0.0006154264131235698, 0.12442818958134878, 0.16675461306133205, 0.08238154765041102, 0.1598227523001177, 0.0705855234215657, -0.017767208288349802, 0.08846999160827153, -0.18798843911656785, -0.03976964970518436, -0.15518838749636735, -0.20407869857514188, -0.13570138041876137, -0.00036992341102588745, -0.007051938367935474, -0.027365151811243285, 0.36265070656580584, 0.08457791255343527, 0.1949000492218941, -0.05752874733806248, 0.24541084834980587, 0.17239210804894803, 0.08092300730964376, 0.030486176514791116, 0.3500079097492354, 0.17962704303245697, 0.15966775590583446, -0.2831319697082989, 0.08391137281432748, 0.01300002532708089] |
1,802.10033 | Improving OCR Accuracy on Early Printed Books using Deep Convolutional
Networks | This paper proposes a combination of a convolutional and a LSTM network to
improve the accuracy of OCR on early printed books. While the standard model of
line based OCR uses a single LSTM layer, we utilize a CNN- and Pooling-Layer
combination in advance of an LSTM layer. Due to the higher amount of trainable
parameters the performance of the network relies on a high amount of training
examples to unleash its power. Hereby, the error is reduced by a factor of up
to 44%, yielding a CER of 1% and below. To further improve the results we use a
voting mechanism to achieve character error rates (CER) below $0.5%$. The
runtime of the deep model for training and prediction of a book behaves very
similar to a shallow network.
| cs.CV cs.DL | this paper proposes a combination of a convolutional and a lstm network to improve the accuracy of ocr on early printed books while the standard model of line based ocr uses a single lstm layer we utilize a cnn and poolinglayer combination in advance of an lstm layer due to the higher amount of trainable parameters the performance of the network relies on a high amount of training examples to unleash its power hereby the error is reduced by a factor of up to 44 yielding a cer of 1 and below to further improve the results we use a voting mechanism to achieve character error rates cer below 05 the runtime of the deep model for training and prediction of a book behaves very similar to a shallow network | [['this', 'paper', 'proposes', 'a', 'combination', 'of', 'a', 'convolutional', 'and', 'a', 'lstm', 'network', 'to', 'improve', 'the', 'accuracy', 'of', 'ocr', 'on', 'early', 'printed', 'books', 'while', 'the', 'standard', 'model', 'of', 'line', 'based', 'ocr', 'uses', 'a', 'single', 'lstm', 'layer', 'we', 'utilize', 'a', 'cnn', 'and', 'poolinglayer', 'combination', 'in', 'advance', 'of', 'an', 'lstm', 'layer', 'due', 'to', 'the', 'higher', 'amount', 'of', 'trainable', 'parameters', 'the', 'performance', 'of', 'the', 'network', 'relies', 'on', 'a', 'high', 'amount', 'of', 'training', 'examples', 'to', 'unleash', 'its', 'power', 'hereby', 'the', 'error', 'is', 'reduced', 'by', 'a', 'factor', 'of', 'up', 'to', '44', 'yielding', 'a', 'cer', 'of', '1', 'and', 'below', 'to', 'further', 'improve', 'the', 'results', 'we', 'use', 'a', 'voting', 'mechanism', 'to', 'achieve', 'character', 'error', 'rates', 'cer', 'below', '05', 'the', 'runtime', 'of', 'the', 'deep', 'model', 'for', 'training', 'and', 'prediction', 'of', 'a', 'book', 'behaves', 'very', 'similar', 'to', 'a', 'shallow', 'network']] | [-0.059234797053017416, -0.006916168635749879, -0.024847041575469134, 0.014163577788357818, -0.08629369031811177, -0.1620280788164557, 0.132180181397811, 0.3842960960238941, -0.27643253909701, -0.3483715563463841, 0.07609933124613305, -0.27053500701088545, -0.14321033129028168, 0.21053902164837995, -0.14117859947935554, 0.05852509748737523, 0.12184116679655257, 0.08337517214087091, -0.09505457890602623, -0.3101966346383037, 0.2678904925985623, 0.12706071683977255, 0.3073990753555829, 0.03181460059009666, 0.1556298515562901, -0.07011417090141958, -0.002119396293405877, -0.05037760075683482, -0.05786208607718464, 0.20488122371639045, 0.21530890146400347, 0.09150070775762316, 0.3269310447409056, -0.41366459863159316, -0.21300868824297606, 0.03950231592712361, 0.11848281704560788, 0.1184786737069863, 0.017960952795218935, -0.27413037200386153, 0.14239702665413073, -0.22785502584116865, -0.012379366496592298, -0.07148819920686326, -0.020838662314178177, -0.0029284172269963306, -0.2962547688882134, 0.053360890986960986, 0.12442967910030785, 0.06198464704735219, -0.031466814906827296, -0.10011150799836069, 0.025726428250926584, 0.16280177912075622, 0.006671860391750585, 0.09531285968255396, 0.12259098840516436, -0.22465199444175865, -0.1030362633439575, 0.3601609075644104, -0.13237980815993491, -0.17665791249465804, 0.14470286851265113, -0.02590464050304, -0.08522600498656895, 0.13219653345038032, 0.26127759700770986, 0.06512227698857355, -0.1292783271615184, -0.005892742190567791, -0.010296201759357323, 0.2497255177374265, 0.04989969048129265, -0.0005950873876495879, 0.15487224949964198, 0.3154762016984728, 0.0019487133610618208, 0.15209961186033175, -0.15237510273622912, -0.03166177078121334, -0.22756191065116216, -0.14334031840057163, -0.17061185384306393, 0.030249690342795593, -0.09214570393827347, -0.175515853597732, 0.4535454217517792, 0.18391185936828455, 0.2448143174568581, 0.14074718062007843, 0.3066796137438726, 0.06017539627099222, 0.14338499437223456, 0.08405511877355129, 0.2117991105241831, 0.06195556219169047, 0.1370515022083915, -0.1571747930828742, 0.08062416371391264, 0.06208252840018434] |
1,802.10034 | Coding Theory using Linear Complexity of Finite Sequences | We define a metric on $\mathbb{F}_q^n$ using the linear complexity of finite
sequences. We will then develop a coding theory for this metric. We will give a
Singleton-like bound and we will give constructions of subspaces of
$\mathbb{F}_q^n$ achieving this bound. We will compute the size of balls with
respect to this metric. In other words we will count how many finite sequences
have linear complexity bounded by some integer $r$. The paper is motivated in
part by the desire to design new code based cryptographic systems.
| cs.IT math.IT | we define a metric on mathbbf_qn using the linear complexity of finite sequences we will then develop a coding theory for this metric we will give a singletonlike bound and we will give constructions of subspaces of mathbbf_qn achieving this bound we will compute the size of balls with respect to this metric in other words we will count how many finite sequences have linear complexity bounded by some integer r the paper is motivated in part by the desire to design new code based cryptographic systems | [['we', 'define', 'a', 'metric', 'on', 'mathbbf_qn', 'using', 'the', 'linear', 'complexity', 'of', 'finite', 'sequences', 'we', 'will', 'then', 'develop', 'a', 'coding', 'theory', 'for', 'this', 'metric', 'we', 'will', 'give', 'a', 'singletonlike', 'bound', 'and', 'we', 'will', 'give', 'constructions', 'of', 'subspaces', 'of', 'mathbbf_qn', 'achieving', 'this', 'bound', 'we', 'will', 'compute', 'the', 'size', 'of', 'balls', 'with', 'respect', 'to', 'this', 'metric', 'in', 'other', 'words', 'we', 'will', 'count', 'how', 'many', 'finite', 'sequences', 'have', 'linear', 'complexity', 'bounded', 'by', 'some', 'integer', 'r', 'the', 'paper', 'is', 'motivated', 'in', 'part', 'by', 'the', 'desire', 'to', 'design', 'new', 'code', 'based', 'cryptographic', 'systems']] | [-0.1809216038773543, 0.1284220098790809, -0.1042269008855025, 0.05341882569897363, -0.08348316849134434, -0.14780765056246142, 0.04799384421176523, 0.3542694104514245, -0.3081139685350588, -0.23763665413797094, 0.12173317858531814, -0.2704401199770128, -0.18575397362911153, 0.18865223348892732, -0.19051598923430704, 0.07288541626078131, 0.0185292428305865, 0.08011223220576842, -0.1116174454693736, -0.34767302136397227, 0.3668688429631935, 0.0607833585691178, 0.18778202868462807, 0.04864632256928532, 0.08033183391537817, -0.017458755255344956, -0.03979189286072706, 0.03190434074307653, -0.22126551996180574, 0.20055038408087245, 0.31426486339495013, 0.226427234661091, 0.29652022998565913, -0.37911553618875493, -0.1462359482358242, 0.1654968847916729, 0.15470817178787513, 0.13540766458294687, -0.06607101305425381, -0.20328034319508093, 0.14920312912342534, -0.17060772931181836, -0.08816450069947489, -0.08883533331875999, 0.02097725240385224, 0.0380739352783595, -0.25293193689825805, -0.07208757241117372, 0.078853915113656, 0.05187465881008184, -0.027101032922965014, -0.11582849082676158, 0.09227065057975464, 0.0996077139915406, -0.020045897219565578, 0.041371388591012394, 0.04213867391842342, -0.02601074984420262, -0.14499982065874442, 0.3483621491997064, -0.09408014765458889, -0.26662591617854164, 0.1413152230202338, -0.11964369322248232, -0.1470084291583077, 0.0535675300520727, 0.22736042630912243, 0.11980617525933802, -0.09424227138916993, 0.14811789152485416, -0.09286088237924309, 0.18430802502251906, 0.07829941949143407, 0.09610644213041697, 0.1388282784603365, 0.12759969222905307, 0.12329290694511634, 0.2161153321557186, -0.034819391398187516, -0.0159026969267034, -0.3241120379460954, -0.15475715672859558, -0.1682529295634093, 0.07004590418682187, -0.10419221605617826, -0.18440136083283987, 0.37655831712844046, 0.1431803534920702, 0.16213429021252984, 0.16751434725719963, 0.2638803702356272, 0.07693853902619803, 0.025030816265585266, 0.0978238796975849, 0.14215724238351085, 0.11473944257602267, 0.022983333941591882, -0.14662176849127845, 0.021569886689085042, 0.16234174694102552] |
1,802.10035 | Category-valued traces for bimodule categories: a
representation-theoretic realization | The category-valued trace assigns to a bimodule category over a linear
monoidal category a linear category. It generalizes Drinfeld centers of
monoidal categories and the relative Deligne product of bimodule categories. In
this article, we study bimodule categories that are given as categories of
bicomodules over a Hopf algebra. Our main result is a representation-theoretic
realization of the category-valued trace as a category of generalized Hopf
bimodules.
| math.QA math.CT math.RT | the categoryvalued trace assigns to a bimodule category over a linear monoidal category a linear category it generalizes drinfeld centers of monoidal categories and the relative deligne product of bimodule categories in this article we study bimodule categories that are given as categories of bicomodules over a hopf algebra our main result is a representationtheoretic realization of the categoryvalued trace as a category of generalized hopf bimodules | [['the', 'categoryvalued', 'trace', 'assigns', 'to', 'a', 'bimodule', 'category', 'over', 'a', 'linear', 'monoidal', 'category', 'a', 'linear', 'category', 'it', 'generalizes', 'drinfeld', 'centers', 'of', 'monoidal', 'categories', 'and', 'the', 'relative', 'deligne', 'product', 'of', 'bimodule', 'categories', 'in', 'this', 'article', 'we', 'study', 'bimodule', 'categories', 'that', 'are', 'given', 'as', 'categories', 'of', 'bicomodules', 'over', 'a', 'hopf', 'algebra', 'our', 'main', 'result', 'is', 'a', 'representationtheoretic', 'realization', 'of', 'the', 'categoryvalued', 'trace', 'as', 'a', 'category', 'of', 'generalized', 'hopf', 'bimodules']] | [-0.14966596841965038, -0.08048264155470168, -0.05979768594435013, 0.08566150879626398, -0.1389246409786726, -0.13286163617592694, -0.05968430495139823, 0.3839989417474091, -0.501629328515047, -0.1422605715386236, 0.06204041117044694, -0.13579195236036581, -0.12179270381135728, 0.14315059170849734, -0.31309574948095564, -0.19584100126678042, 0.13471672752065889, 0.16952382559095747, -0.10384285303680643, -0.2567067776820553, 0.5731975246054023, 0.027722162602872434, 0.24744035627470531, -0.003543225686941574, 0.11568735380754319, -0.01545836770934845, -0.028879254917377858, -0.012685879891210082, -0.09552226455783586, 0.12971764067604916, 0.41550775639601606, 0.03211572362846737, 0.1950547832008729, -0.2797209177611034, 0.012950564977893634, 0.16259117542640933, 0.09337719191393967, 0.04623444489578703, 0.015029764984414648, -0.39502732654505257, 0.059759828637340175, -0.4095135696454724, 0.015928528396718537, -0.04541693397088727, 0.1466792598922751, -0.0242485367074442, -0.277977924807859, -0.09986367748021635, 0.07474350979008257, 0.15225351514266944, -0.16367195948346783, -0.06354142669171317, -0.11946503614742698, 0.09801485514574086, -0.1097865567730267, 0.05089202955879493, 0.21048676120395313, -0.09627111521162919, -0.1878650699978444, 0.31546021202829344, -0.059407911833320094, -0.18158809101181245, 0.12287015416798418, -0.10908684085832158, -0.16149324121704298, 0.10931065446460869, -0.062345135164683436, 0.14660830726263238, 0.009679083934804397, 0.195143626404252, -0.26860006709597006, -0.024038267627692046, 0.14873681902023617, 0.04700674819273513, 0.15535055595769812, 0.16271370073168803, 0.011131685901322026, 0.15836821044725713, 0.052325815643503595, -0.06181553057603427, -0.40270134061574936, -0.2801587434568957, -0.0015030687035464528, 0.17168411605560513, -0.08238377258743666, -0.2017263087874918, 0.4369043452081396, 0.13164355297253202, 0.19603252431739177, 0.22197502424745863, 0.19063480334606633, -0.0266297839029428, 0.15736735145102687, -0.04358566608696954, 0.07093214741282498, 0.4051282081419407, 0.01635853421123726, 0.01912972875245249, -0.05812336594637817, 0.2935062081678145] |
1,802.10036 | Generating High Quality Visible Images from SAR Images Using CNNs | We propose a novel approach for generating high quality visible-like images
from Synthetic Aperture Radar (SAR) images using Deep Convolutional Generative
Adversarial Network (GAN) architectures. The proposed approach is based on a
cascaded network of convolutional neural nets (CNNs) for despeckling and image
colorization. The cascaded structure results in faster convergence during
training and produces high quality visible images from the corresponding SAR
images. Experimental results on both simulated and real SAR images show that
the proposed method can produce visible-like images better compared to the
recent state-of-the-art deep learning-based methods.
| cs.CV | we propose a novel approach for generating high quality visiblelike images from synthetic aperture radar sar images using deep convolutional generative adversarial network gan architectures the proposed approach is based on a cascaded network of convolutional neural nets cnns for despeckling and image colorization the cascaded structure results in faster convergence during training and produces high quality visible images from the corresponding sar images experimental results on both simulated and real sar images show that the proposed method can produce visiblelike images better compared to the recent stateoftheart deep learningbased methods | [['we', 'propose', 'a', 'novel', 'approach', 'for', 'generating', 'high', 'quality', 'visiblelike', 'images', 'from', 'synthetic', 'aperture', 'radar', 'sar', 'images', 'using', 'deep', 'convolutional', 'generative', 'adversarial', 'network', 'gan', 'architectures', 'the', 'proposed', 'approach', 'is', 'based', 'on', 'a', 'cascaded', 'network', 'of', 'convolutional', 'neural', 'nets', 'cnns', 'for', 'despeckling', 'and', 'image', 'colorization', 'the', 'cascaded', 'structure', 'results', 'in', 'faster', 'convergence', 'during', 'training', 'and', 'produces', 'high', 'quality', 'visible', 'images', 'from', 'the', 'corresponding', 'sar', 'images', 'experimental', 'results', 'on', 'both', 'simulated', 'and', 'real', 'sar', 'images', 'show', 'that', 'the', 'proposed', 'method', 'can', 'produce', 'visiblelike', 'images', 'better', 'compared', 'to', 'the', 'recent', 'stateoftheart', 'deep', 'learningbased', 'methods']] | [0.05292258223811729, -0.10157055648048983, -0.05672453601028393, 0.06607239341410401, -0.05863895985622252, -0.18874924244840494, -0.059100125100086914, 0.5676385241278102, -0.21983286100073476, -0.3350914941912287, 0.045637571999771795, -0.2676655575214477, -0.2948654060032261, 0.24216569227616438, -0.2198701842447345, 0.1809828377464849, 0.21437128454844437, -0.04618195841203998, -0.07642538845277486, -0.30453501999890953, 0.263085420240826, 0.03702402293219053, 0.47565190707532207, -0.038314216833017514, 0.1963476141067117, -0.07474809000268579, -0.011456104455871528, -0.048393478520277346, 0.026520228572827476, 0.2030216809885388, 0.2881583832073538, 0.23695507634096266, 0.2703807645116336, -0.47179476424967975, -0.2806573532668225, 0.02734554595617431, 0.14193726264024048, 0.10581785203951798, -0.11133459442964849, -0.4283173660841886, 0.10603401320201628, -0.10595703459857556, 0.12036972858137295, -0.18444872443470056, -0.11249232623108736, -0.025574447180332846, -0.36144593545154596, 0.037011009504955804, 0.05108741018921137, 0.08024083660768994, -0.0886031479543347, -0.11069583687705663, 0.004007285366651047, 0.13577311635645253, -0.06417854579448114, 0.08584581673396437, 0.1077867582639198, -0.24672801272284364, -0.1458280734466703, 0.3359532513435972, -0.1139497933909297, -0.16505452485139, 0.180466360655833, -0.029766930785197557, -0.0770939818865965, 0.1848937301553807, 0.3091003996309605, 0.15772485525577506, -0.10906651067832653, -0.05208399563993777, -0.07633857944917478, 0.17439447220917162, 0.06263332352502628, -0.026059257541521545, 0.14357947735011242, 0.31635606130899, -0.029435759763432184, 0.18434340541324254, -0.3090535970195458, 0.011112870418288734, -0.1289630922478404, -0.03314729466029767, -0.26498913600664126, -0.041100418148039095, -0.14128392677851612, -0.11064745446018288, 0.44392017346252216, 0.29113482139753494, 0.2416207803978344, 0.17858851461388756, 0.4918714571702346, -0.01376822515484992, 0.20318423562128557, 0.032049424198110785, 0.1853333757719381, 0.001060876472110159, 0.16632973000909504, -0.1304211911347726, 0.03848216474040547, 0.07428630661177502] |
1,802.10037 | Tuneable hopping and nonlinear cross-Kerr interactions in a
high-coherence superconducting circuit | Analog quantum simulations offer rich opportunities for exploring complex
quantum systems and phenomena through the use of specially engineered,
well-controlled quantum systems. A critical element, increasing the scope and
flexibility of such experimental platforms, is the ability to access and tune
in situ different interaction regimes. Here, we present a superconducting
circuit building block of two highly coherent transmons featuring in situ
tuneable photon hopping and nonlinear cross-Kerr couplings. The interactions
are mediated via a nonlinear coupler, consisting of a large capacitor in
parallel with a tuneable superconducting quantum interference device (SQUID).
We demonstrate the working principle by experimentally characterising the
system in the single- and two-excitation manifolds, and derive a full
theoretical model that accurately describes our measurements. Both qubits have
high coherence properties, with typical relaxation times in the range of 15 to
40 microseconds at all bias points of the coupler. Our device could be used as
a scalable building block in analog quantum simulators of extended Bose-Hubbard
and Heisenberg XXZ models, and may also have applications in quantum computing
such as realising fast two-qubit gates and perfect state transfer protocols.
| quant-ph cond-mat.mes-hall | analog quantum simulations offer rich opportunities for exploring complex quantum systems and phenomena through the use of specially engineered wellcontrolled quantum systems a critical element increasing the scope and flexibility of such experimental platforms is the ability to access and tune in situ different interaction regimes here we present a superconducting circuit building block of two highly coherent transmons featuring in situ tuneable photon hopping and nonlinear crosskerr couplings the interactions are mediated via a nonlinear coupler consisting of a large capacitor in parallel with a tuneable superconducting quantum interference device squid we demonstrate the working principle by experimentally characterising the system in the single and twoexcitation manifolds and derive a full theoretical model that accurately describes our measurements both qubits have high coherence properties with typical relaxation times in the range of 15 to 40 microseconds at all bias points of the coupler our device could be used as a scalable building block in analog quantum simulators of extended bosehubbard and heisenberg xxz models and may also have applications in quantum computing such as realising fast twoqubit gates and perfect state transfer protocols | [['analog', 'quantum', 'simulations', 'offer', 'rich', 'opportunities', 'for', 'exploring', 'complex', 'quantum', 'systems', 'and', 'phenomena', 'through', 'the', 'use', 'of', 'specially', 'engineered', 'wellcontrolled', 'quantum', 'systems', 'a', 'critical', 'element', 'increasing', 'the', 'scope', 'and', 'flexibility', 'of', 'such', 'experimental', 'platforms', 'is', 'the', 'ability', 'to', 'access', 'and', 'tune', 'in', 'situ', 'different', 'interaction', 'regimes', 'here', 'we', 'present', 'a', 'superconducting', 'circuit', 'building', 'block', 'of', 'two', 'highly', 'coherent', 'transmons', 'featuring', 'in', 'situ', 'tuneable', 'photon', 'hopping', 'and', 'nonlinear', 'crosskerr', 'couplings', 'the', 'interactions', 'are', 'mediated', 'via', 'a', 'nonlinear', 'coupler', 'consisting', 'of', 'a', 'large', 'capacitor', 'in', 'parallel', 'with', 'a', 'tuneable', 'superconducting', 'quantum', 'interference', 'device', 'squid', 'we', 'demonstrate', 'the', 'working', 'principle', 'by', 'experimentally', 'characterising', 'the', 'system', 'in', 'the', 'single', 'and', 'twoexcitation', 'manifolds', 'and', 'derive', 'a', 'full', 'theoretical', 'model', 'that', 'accurately', 'describes', 'our', 'measurements', 'both', 'qubits', 'have', 'high', 'coherence', 'properties', 'with', 'typical', 'relaxation', 'times', 'in', 'the', 'range', 'of', '15', 'to', '40', 'microseconds', 'at', 'all', 'bias', 'points', 'of', 'the', 'coupler', 'our', 'device', 'could', 'be', 'used', 'as', 'a', 'scalable', 'building', 'block', 'in', 'analog', 'quantum', 'simulators', 'of', 'extended', 'bosehubbard', 'and', 'heisenberg', 'xxz', 'models', 'and', 'may', 'also', 'have', 'applications', 'in', 'quantum', 'computing', 'such', 'as', 'realising', 'fast', 'twoqubit', 'gates', 'and', 'perfect', 'state', 'transfer', 'protocols']] | [-0.17937215888979036, 0.19031307842131986, -0.014070711884731123, 0.0064605955963286206, -0.02058244490003942, -0.24066671830887967, 0.04260370322963749, 0.39473089971326536, -0.23525973814210613, -0.3103802292025648, 0.0470592916238314, -0.25966198093121184, -0.1409667001403843, 0.27418175629218633, 0.015671734050240204, 0.11166102293392886, 0.047929311374109995, -0.07280404975703593, -0.0777719110774342, -0.1834381692865661, 0.2417752522792991, 0.03363465610638504, 0.3222971441775925, 0.04203593668543086, 0.1195952923862142, 0.01077661969390212, 0.08470265599190378, -0.011901730057813795, -0.10488146270452726, 0.10534475350236196, 0.28306610670324517, 0.022263939214019996, 0.2289516527190521, -0.4816724712778207, -0.22939557776502942, 0.0627731145182422, 0.1586942006835433, 0.1748679553237035, -0.07021435842160946, -0.2975324654405046, 0.03224499871999876, -0.21862267818220932, -0.10772342358857555, -0.11459759404003664, -0.024001688564844106, 0.019777662356120898, -0.25751812679632363, 0.014245879185814967, 0.02270589222703363, 0.06171834120860971, 0.021472761966794242, -0.024118887753423263, 0.05630509049565855, 0.108937480401516, -0.12887541155973653, -0.028149241385424673, 0.1830244885413381, -0.11562220479422451, -0.1863142602264618, 0.35011081894576224, -0.046847706003894055, -0.16065849936263554, 0.2010360693751389, -0.09818735255090438, -0.06604510925598847, 0.05645105316374532, 0.16687348986591172, 0.06154535710052385, -0.16271548525369522, 0.08448202085001748, 0.041531475488622877, 0.18664240359414733, 0.01683891064274813, 0.13049081728272344, 0.23720456335096338, 0.2098238290257185, 0.04313065077471749, 0.16972546333905167, -0.05168436527057328, -0.13863269410997062, -0.25906729993407085, -0.18191664464282678, -0.20770587752960398, 0.07758646030687606, -0.10216464001978634, -0.15457901678873104, 0.4120233768860445, 0.161593014732479, 0.16396351607070994, -0.028199363850865706, 0.3030950975017217, 0.08708725998977847, 0.10530929784189262, 0.031517091552656064, 0.23524474703615694, 0.162609539082041, 0.10239891217940528, -0.2558590372835802, 0.02127390870895318, -0.039086056518894824] |
1,802.10038 | Improving OCR Accuracy on Early Printed Books by combining Pretraining,
Voting, and Active Learning | We combine three methods which significantly improve the OCR accuracy of OCR
models trained on early printed books: (1) The pretraining method utilizes the
information stored in already existing models trained on a variety of typesets
(mixed models) instead of starting the training from scratch. (2) Performing
cross fold training on a single set of ground truth data (line images and their
transcriptions) with a single OCR engine (OCRopus) produces a committee whose
members then vote for the best outcome by also taking the top-N alternatives
and their intrinsic confidence values into account. (3) Following the principle
of maximal disagreement we select additional training lines which the voters
disagree most on, expecting them to offer the highest information gain for a
subsequent training (active learning). Evaluations on six early printed books
yielded the following results: On average the combination of pretraining and
voting improved the character accuracy by 46% when training five folds starting
from the same mixed model. This number rose to 53% when using different models
for pretraining, underlining the importance of diverse voters. Incorporating
active learning improved the obtained results by another 16% on average
(evaluated on three of the six books). Overall, the proposed methods lead to an
average error rate of 2.5% when training on only 60 lines. Using a substantial
ground truth pool of 1,000 lines brought the error rate down even further to
less than 1% on average.
| cs.CV | we combine three methods which significantly improve the ocr accuracy of ocr models trained on early printed books 1 the pretraining method utilizes the information stored in already existing models trained on a variety of typesets mixed models instead of starting the training from scratch 2 performing cross fold training on a single set of ground truth data line images and their transcriptions with a single ocr engine ocropus produces a committee whose members then vote for the best outcome by also taking the topn alternatives and their intrinsic confidence values into account 3 following the principle of maximal disagreement we select additional training lines which the voters disagree most on expecting them to offer the highest information gain for a subsequent training active learning evaluations on six early printed books yielded the following results on average the combination of pretraining and voting improved the character accuracy by 46 when training five folds starting from the same mixed model this number rose to 53 when using different models for pretraining underlining the importance of diverse voters incorporating active learning improved the obtained results by another 16 on average evaluated on three of the six books overall the proposed methods lead to an average error rate of 25 when training on only 60 lines using a substantial ground truth pool of 1000 lines brought the error rate down even further to less than 1 on average | [['we', 'combine', 'three', 'methods', 'which', 'significantly', 'improve', 'the', 'ocr', 'accuracy', 'of', 'ocr', 'models', 'trained', 'on', 'early', 'printed', 'books', '1', 'the', 'pretraining', 'method', 'utilizes', 'the', 'information', 'stored', 'in', 'already', 'existing', 'models', 'trained', 'on', 'a', 'variety', 'of', 'typesets', 'mixed', 'models', 'instead', 'of', 'starting', 'the', 'training', 'from', 'scratch', '2', 'performing', 'cross', 'fold', 'training', 'on', 'a', 'single', 'set', 'of', 'ground', 'truth', 'data', 'line', 'images', 'and', 'their', 'transcriptions', 'with', 'a', 'single', 'ocr', 'engine', 'ocropus', 'produces', 'a', 'committee', 'whose', 'members', 'then', 'vote', 'for', 'the', 'best', 'outcome', 'by', 'also', 'taking', 'the', 'topn', 'alternatives', 'and', 'their', 'intrinsic', 'confidence', 'values', 'into', 'account', '3', 'following', 'the', 'principle', 'of', 'maximal', 'disagreement', 'we', 'select', 'additional', 'training', 'lines', 'which', 'the', 'voters', 'disagree', 'most', 'on', 'expecting', 'them', 'to', 'offer', 'the', 'highest', 'information', 'gain', 'for', 'a', 'subsequent', 'training', 'active', 'learning', 'evaluations', 'on', 'six', 'early', 'printed', 'books', 'yielded', 'the', 'following', 'results', 'on', 'average', 'the', 'combination', 'of', 'pretraining', 'and', 'voting', 'improved', 'the', 'character', 'accuracy', 'by', '46', 'when', 'training', 'five', 'folds', 'starting', 'from', 'the', 'same', 'mixed', 'model', 'this', 'number', 'rose', 'to', '53', 'when', 'using', 'different', 'models', 'for', 'pretraining', 'underlining', 'the', 'importance', 'of', 'diverse', 'voters', 'incorporating', 'active', 'learning', 'improved', 'the', 'obtained', 'results', 'by', 'another', '16', 'on', 'average', 'evaluated', 'on', 'three', 'of', 'the', 'six', 'books', 'overall', 'the', 'proposed', 'methods', 'lead', 'to', 'an', 'average', 'error', 'rate', 'of', '25', 'when', 'training', 'on', 'only', '60', 'lines', 'using', 'a', 'substantial', 'ground', 'truth', 'pool', 'of', '1000', 'lines', 'brought', 'the', 'error', 'rate', 'down', 'even', 'further', 'to', 'less', 'than', '1', 'on', 'average']] | [-0.023939517904518846, 0.02447510810347244, -0.030589176763958753, 0.07083903675591771, -0.07505088178540005, -0.18084845660611035, 0.14869306093488047, 0.3960339141236816, -0.19690885639791575, -0.38791717456138514, 0.08851802776854961, -0.3108959265370318, -0.055091525829258435, 0.23026626606947406, -0.07159250134984874, 0.03497091692066107, 0.15281256556392034, 0.0767543294843524, -0.0750585420324685, -0.3877459816575209, 0.2739427232940138, 0.04738567470117135, 0.3296275541364671, -0.03149631841137926, 0.12123036552071968, -0.02655269450290089, -0.047290492787006054, -0.0011408338628516117, -0.06294607401310288, 0.17301807095831695, 0.22899982877393957, 0.1703947634627842, 0.3232775187674672, -0.3998735116596552, -0.18212813007784018, 0.0784212584389334, 0.1293702110053694, 0.1126100394627119, 0.0004180962467526502, -0.32008716533425113, 0.07811506309576254, -0.1749091303431766, 0.00032633286801741476, -0.06876014782551755, -0.011934420788918246, -0.0036620288849511045, -0.2475923620402179, 0.024989396764554996, 0.066413643405317, 0.12217091594604736, -0.08548453481808463, -0.20540528727021623, -0.015285102274031081, 0.16044889782305233, 0.022878479216980965, 0.04475116136761263, 0.13371492255320575, -0.19321336621973426, -0.1296693865804279, 0.3596628884289493, -0.06324236288677872, -0.16142553394490686, 0.16198322202098814, -0.05294627623082673, -0.11080945250380071, 0.18222427240255823, 0.1921074077387915, 0.08407188707645587, -0.126549473436527, -0.04093309387222844, -0.018264694763514697, 0.232800507058013, 0.07843659524112306, -0.040282626829030825, 0.17213256815151173, 0.19239179448105712, -0.03529012491133936, 0.11166050539109261, -0.13308885902119305, -0.07180592937276084, -0.23496497454755802, -0.10127226965343382, -0.18081350548470274, 0.05336959561868075, -0.12973102153795327, -0.12723914391579147, 0.4047179563565457, 0.1812987203967381, 0.2003585616404072, 0.09195133423769569, 0.29603900770220826, 0.009745693652199561, 0.10378796124751581, 0.07210964646408374, 0.23257445948634375, -0.009597389789377438, 0.08575060467850021, -0.15026105759823893, 0.09131648092273068, 0.03873063521261545] |
1,802.10039 | Heterogeneous Nucleation of a Droplet Pinned at a Chemically
Inhomogeneous Substrate: A Simulation Study of the Two-dimensional Ising Case | Heterogeneous nucleation is studied by Monte Carlo simulations and
phenomenological theory, using the two-dimensional lattice gas model with
suitable boundary fields. A chemical inhomogeneity of length b at one boundary
favors the liquid phase, while elsewhere the vapor is favored. Switching on the
bulk field favoring the liquid, nucleation and growth of the liquid phase
starting from the region of the chemical inhomogeneity is analyzed. Three
regimes occur: for small fields, the critical droplet radius is so large that a
critical droplet having the contact angle required by Young's equation in the
region of the chemical inhomogeneity does not yet fit there, since the baseline
length of the circle-cut sphere droplet would exceed b. For an intermedium
regime of bulk fields, such droplets fit inside the inhomogeneity, and are
indeed found in simulations with large enough observation times, but these
droplets remain pinned to the chemical inhomogeneity when their baseline has
grown to the length b. On general grounds one can predict that the effective
contact angle as well as the excess density of the droplets, scaled by b^2, are
functions of the product b and the bulk field, but do not depend on both
variables separately. For larger fields the droplets nucleated at the chemical
inhomogeneity grow to the full system size.
| cond-mat.stat-mech | heterogeneous nucleation is studied by monte carlo simulations and phenomenological theory using the twodimensional lattice gas model with suitable boundary fields a chemical inhomogeneity of length b at one boundary favors the liquid phase while elsewhere the vapor is favored switching on the bulk field favoring the liquid nucleation and growth of the liquid phase starting from the region of the chemical inhomogeneity is analyzed three regimes occur for small fields the critical droplet radius is so large that a critical droplet having the contact angle required by youngs equation in the region of the chemical inhomogeneity does not yet fit there since the baseline length of the circlecut sphere droplet would exceed b for an intermedium regime of bulk fields such droplets fit inside the inhomogeneity and are indeed found in simulations with large enough observation times but these droplets remain pinned to the chemical inhomogeneity when their baseline has grown to the length b on general grounds one can predict that the effective contact angle as well as the excess density of the droplets scaled by b2 are functions of the product b and the bulk field but do not depend on both variables separately for larger fields the droplets nucleated at the chemical inhomogeneity grow to the full system size | [['heterogeneous', 'nucleation', 'is', 'studied', 'by', 'monte', 'carlo', 'simulations', 'and', 'phenomenological', 'theory', 'using', 'the', 'twodimensional', 'lattice', 'gas', 'model', 'with', 'suitable', 'boundary', 'fields', 'a', 'chemical', 'inhomogeneity', 'of', 'length', 'b', 'at', 'one', 'boundary', 'favors', 'the', 'liquid', 'phase', 'while', 'elsewhere', 'the', 'vapor', 'is', 'favored', 'switching', 'on', 'the', 'bulk', 'field', 'favoring', 'the', 'liquid', 'nucleation', 'and', 'growth', 'of', 'the', 'liquid', 'phase', 'starting', 'from', 'the', 'region', 'of', 'the', 'chemical', 'inhomogeneity', 'is', 'analyzed', 'three', 'regimes', 'occur', 'for', 'small', 'fields', 'the', 'critical', 'droplet', 'radius', 'is', 'so', 'large', 'that', 'a', 'critical', 'droplet', 'having', 'the', 'contact', 'angle', 'required', 'by', 'youngs', 'equation', 'in', 'the', 'region', 'of', 'the', 'chemical', 'inhomogeneity', 'does', 'not', 'yet', 'fit', 'there', 'since', 'the', 'baseline', 'length', 'of', 'the', 'circlecut', 'sphere', 'droplet', 'would', 'exceed', 'b', 'for', 'an', 'intermedium', 'regime', 'of', 'bulk', 'fields', 'such', 'droplets', 'fit', 'inside', 'the', 'inhomogeneity', 'and', 'are', 'indeed', 'found', 'in', 'simulations', 'with', 'large', 'enough', 'observation', 'times', 'but', 'these', 'droplets', 'remain', 'pinned', 'to', 'the', 'chemical', 'inhomogeneity', 'when', 'their', 'baseline', 'has', 'grown', 'to', 'the', 'length', 'b', 'on', 'general', 'grounds', 'one', 'can', 'predict', 'that', 'the', 'effective', 'contact', 'angle', 'as', 'well', 'as', 'the', 'excess', 'density', 'of', 'the', 'droplets', 'scaled', 'by', 'b2', 'are', 'functions', 'of', 'the', 'product', 'b', 'and', 'the', 'bulk', 'field', 'but', 'do', 'not', 'depend', 'on', 'both', 'variables', 'separately', 'for', 'larger', 'fields', 'the', 'droplets', 'nucleated', 'at', 'the', 'chemical', 'inhomogeneity', 'grow', 'to', 'the', 'full', 'system', 'size']] | [-0.12876493043847215, 0.23213192528254575, -0.08567359421252853, 0.027686128111661604, -0.019817236637397897, -0.13481348456885173, 0.05046040372635273, 0.3409225879531389, -0.2517288419953987, -0.2988167545354029, 0.0926875955000177, -0.2514547354273744, -0.0591406105668284, 0.14858659928530576, 0.02400377525356027, 0.015979303301856766, 0.0008990206373504029, 0.006791882523344303, -0.05970560471727161, -0.21898038086002553, 0.3093701597733669, 0.04937715235139893, 0.29439460363388414, 0.07814017352472358, 0.05548505675935028, -0.029563311099751306, 0.034664193460419074, 0.07682482875666125, -0.20353923409218727, -0.0048065268399439896, 0.17369327272776128, -0.014833187195142941, 0.18651851555683985, -0.4662820339369816, -0.2678217341473221, 0.08093142564153685, 0.1465218339723816, 0.1248813605337966, -0.03430506580164393, -0.23468112192700952, 0.03534208387927205, -0.11035641959323636, -0.1897146484443167, -0.03304906769541426, 0.054916535191158855, 0.03551567231377978, -0.2527583658427246, 0.11793736937685918, 0.019381673009912396, 0.05471717252259863, -0.05789795878589294, -0.13447148331060987, -0.07566473086228383, 0.10519286128541319, 0.06096716799645878, 0.06894663068902995, 0.233397279261998, -0.14322006094866907, -0.013616183128005842, 0.38477734189902274, -0.05597081257553139, -0.16225782645545583, 0.21092350594369905, -0.21164396897459156, -0.05435891317440865, 0.20136911379182185, 0.13067613889129376, 0.09530373564306295, -0.10210261708006037, 0.07580056705156271, -0.0165540833841078, 0.17525097823982952, 0.07342594416091605, -0.0158653090900702, 0.25919606833101494, 0.20554229208457125, 0.02795876287536713, 0.0895281613668216, -0.12392581387462516, -0.12651455990820773, -0.2792112062737908, -0.13851949588844842, -0.21281742781427038, 0.032087869781979916, -0.13804924315668615, -0.19221396007910613, 0.3272753003018223, 0.10401638432511322, 0.1820904059282873, -0.003197206162028278, 0.24196450828073793, 0.053217462311226454, 0.11925189769255735, 0.05380707852243674, 0.26994953366031627, 0.12189838013508497, 0.11715717445773441, -0.24490713511092835, 0.10734240906335027, 0.013779282531446233] |
1,802.1004 | Small amplitude traveling waves in the full-dispersion Whitham equation | In this article, we provide an alternative way to construct small amplitude
traveling waves for general Whitham type equations, in both periodic and whole
line contexts. More specifically, Fourier analysis techniques allow us to
reformulate the problem to the study of waves that are small and regular
perturbations of well-understood ODE's. In addition, rigorous stability of
these waves is established.
| math.AP | in this article we provide an alternative way to construct small amplitude traveling waves for general whitham type equations in both periodic and whole line contexts more specifically fourier analysis techniques allow us to reformulate the problem to the study of waves that are small and regular perturbations of wellunderstood odes in addition rigorous stability of these waves is established | [['in', 'this', 'article', 'we', 'provide', 'an', 'alternative', 'way', 'to', 'construct', 'small', 'amplitude', 'traveling', 'waves', 'for', 'general', 'whitham', 'type', 'equations', 'in', 'both', 'periodic', 'and', 'whole', 'line', 'contexts', 'more', 'specifically', 'fourier', 'analysis', 'techniques', 'allow', 'us', 'to', 'reformulate', 'the', 'problem', 'to', 'the', 'study', 'of', 'waves', 'that', 'are', 'small', 'and', 'regular', 'perturbations', 'of', 'wellunderstood', 'odes', 'in', 'addition', 'rigorous', 'stability', 'of', 'these', 'waves', 'is', 'established']] | [-0.1699055961779474, 0.06375116197765844, -0.08293196419641996, 0.11862147665427376, -0.14199626304519672, -0.09660083552201588, -0.008717455090178797, 0.30299116522073744, -0.290234365593642, -0.23912864554052551, 0.1261583543169157, -0.22572067242581398, -0.20675119316826265, 0.2217704212060198, -0.05214618742465973, 0.0799992345040664, 0.0579280317761004, -0.024656090395971355, -0.0698252943227999, -0.20416923485075433, 0.3243345212385369, 0.015607225770751635, 0.2683392455180486, -0.017643939206997552, 0.04646684674080461, 0.011097188526764511, -0.05962469984466831, 0.023471788875758647, -0.20045201839008467, 0.1199941634219916, 0.29923256187927716, 0.11021612090989948, 0.2482387180828179, -0.5090087776693205, -0.23767188818504412, 0.09008776969276369, 0.16610718621717144, 0.18813871045907338, -0.01248068957478002, -0.28062386976865433, 0.07399730000955364, -0.1156819629133679, -0.22703095241449772, -0.11372339706867933, 0.06213870740806063, 0.05021286952542141, -0.2411485599974791, 0.08955997033044696, 0.08885646015405654, 0.020620833352829018, -0.08516465604188853, -0.00914799027571765, 0.03233095984129856, 0.09200456905333947, 0.06937372939816365, -0.022695483069401234, 0.007359234499745071, -0.060491295508109034, -0.06227577311801724, 0.3710903409713258, -0.08729106247192249, -0.254779077336813, 0.22104837656952442, -0.12195506187854335, -0.1315536830186223, 0.1507656735756124, 0.2356192449418207, 0.15278668828929465, -0.16971717105867962, 0.06361944789726598, -0.042943021794781086, 0.1682126635258707, 0.145091227760228, 0.02542492201415977, 0.16970758522705484, 0.13581328125049671, 0.10133786817702155, 0.12693035116729637, -0.036521083263990776, -0.09290539294791718, -0.2866335317802926, -0.12234995630569756, -0.052855768442774814, 0.012027038061448062, -0.05658925693666485, -0.22346268220959853, 0.42854950098941724, 0.17269921861588955, 0.12789859836144993, 0.07083396486317119, 0.2666253421998893, 0.15931466015366216, -0.022452426174034677, 0.039663303371829293, 0.26388765629186917, 0.1738018802017905, 0.12219762999253968, -0.14507654730502206, -0.03031136402860284, 0.08336715299325685] |
1,802.10041 | Impact of the malicious input data modification on the efficiency of
quantum spatial search | In this paper we demonstrate that the efficiency of quantum algorithms can be
significantly altered by malicious manipulation of the input data. We exemplify
the possibility of attacks on quantum spatial search based on Szegedy walk. We
achieve this by proposing a framework suitable for analysing efficiency of
attacks on quantum search algorithms. We provide the analysis of proposed
attacks for different models of random graphs.
| quant-ph cs.CR | in this paper we demonstrate that the efficiency of quantum algorithms can be significantly altered by malicious manipulation of the input data we exemplify the possibility of attacks on quantum spatial search based on szegedy walk we achieve this by proposing a framework suitable for analysing efficiency of attacks on quantum search algorithms we provide the analysis of proposed attacks for different models of random graphs | [['in', 'this', 'paper', 'we', 'demonstrate', 'that', 'the', 'efficiency', 'of', 'quantum', 'algorithms', 'can', 'be', 'significantly', 'altered', 'by', 'malicious', 'manipulation', 'of', 'the', 'input', 'data', 'we', 'exemplify', 'the', 'possibility', 'of', 'attacks', 'on', 'quantum', 'spatial', 'search', 'based', 'on', 'szegedy', 'walk', 'we', 'achieve', 'this', 'by', 'proposing', 'a', 'framework', 'suitable', 'for', 'analysing', 'efficiency', 'of', 'attacks', 'on', 'quantum', 'search', 'algorithms', 'we', 'provide', 'the', 'analysis', 'of', 'proposed', 'attacks', 'for', 'different', 'models', 'of', 'random', 'graphs']] | [-0.12630577041118435, 0.05572771526534449, -0.08556498546209751, 0.05025402838575908, -0.03759868059194449, -0.1825649603340549, 0.12423335424814881, 0.38535606291737745, -0.20955545630193118, -0.3345237252387134, 0.08519586335663035, -0.21583941070870918, -0.21983048077108283, 0.2530793410895223, -0.10916871731310632, 0.11956099243428925, 0.0798229392843716, -0.023109702735162115, -0.03741275944930473, -0.3030564498692525, 0.343869584979433, 0.07441067248477008, 0.3066641129553318, 0.07266638983944149, 0.06997077821958528, 0.03732227072627707, -0.05537570017446397, 0.02417800214254495, -0.10433252888546893, 0.15875718160532415, 0.22995556850290802, 0.22194275637263094, 0.28441685689331003, -0.42860967869108374, -0.22917440324795968, 0.11615472727201202, 0.14057194627821445, 0.164921452517085, -0.08157403357715036, -0.39372932163038943, 0.1572882143822922, -0.1664845383246288, -0.0451785729577144, -0.15102477247516313, -0.05325438646656094, 0.030270317795150208, -0.2223915338346904, 0.0011624719058586793, 0.09533184459150741, 0.05042107884461681, 0.024913580763633505, -0.05217404374288338, 0.08222789151565821, 0.10224290465879621, -0.029074340681263217, -0.07790603673889894, 0.16650771846373877, -0.1276384216211172, -0.2804265876836849, 0.34370404893927503, -0.05718896823060332, -0.19011159224266355, 0.13819401353160202, -0.02178818298588422, -0.17557577760607906, 0.06038219614349531, 0.28191280376278993, 0.18481380805711856, -0.1365827275157878, 0.0817467571857075, -0.012633515902879562, 0.15716539910345367, 0.033118860400987396, 0.04138818026915418, 0.16447424361566929, 0.22059995919522463, 0.08477165569748843, 0.20073454831127133, -0.10168261588621659, -0.10088979201673558, -0.22906881745791796, -0.15627127144993705, -0.2221115314204133, 0.041622446188491515, -0.12255926602378939, -0.1153165832246569, 0.4630182347062862, 0.28107920519753615, 0.17165919063104826, 0.07990749684077772, 0.34246590832304774, 0.07825587021017616, 0.03334189466003216, 0.12255410642617127, 0.1985146906861866, 0.042615391913744985, 0.07357174559552787, -0.20473243479588718, 0.11786326198753985, 0.04214076352108157] |
1,802.10042 | Estimation on the neutrino masses by using neutrino oscillation
parameters | It has been shown that neutrino masses can be determined under the particle
ansatz. In this paper, we give the general formulas of neutrino masses related
to the neutrino oscillation parameters which show that there is a mass
hierarchy transition. Using the best fit values measured by electron and muon
neutrino oscillation experiments, the total neutrino mass is about 0.25 eV.
According to the standard neutrino cosmology, the neutrino energy density is
about 55 eV/cm$^3$ and $\Omega_m h^2>\Omega_\nu h^2\sim 0.0055$.
| hep-ph astro-ph.CO | it has been shown that neutrino masses can be determined under the particle ansatz in this paper we give the general formulas of neutrino masses related to the neutrino oscillation parameters which show that there is a mass hierarchy transition using the best fit values measured by electron and muon neutrino oscillation experiments the total neutrino mass is about 025 ev according to the standard neutrino cosmology the neutrino energy density is about 55 evcm3 and omega_m h2omega_nu h2sim 00055 | [['it', 'has', 'been', 'shown', 'that', 'neutrino', 'masses', 'can', 'be', 'determined', 'under', 'the', 'particle', 'ansatz', 'in', 'this', 'paper', 'we', 'give', 'the', 'general', 'formulas', 'of', 'neutrino', 'masses', 'related', 'to', 'the', 'neutrino', 'oscillation', 'parameters', 'which', 'show', 'that', 'there', 'is', 'a', 'mass', 'hierarchy', 'transition', 'using', 'the', 'best', 'fit', 'values', 'measured', 'by', 'electron', 'and', 'muon', 'neutrino', 'oscillation', 'experiments', 'the', 'total', 'neutrino', 'mass', 'is', 'about', '025', 'ev', 'according', 'to', 'the', 'standard', 'neutrino', 'cosmology', 'the', 'neutrino', 'energy', 'density', 'is', 'about', '55', 'evcm3', 'and', 'omega_m', 'h2omega_nu', 'h2sim', '00055']] | [-0.033782362453109005, 0.278729487564179, -0.005027242046132495, 0.20707961867704894, -0.052916592564669594, -0.09772702428524065, 0.04765755469952061, 0.3129973616686803, -0.17158337671580853, -0.3687391156637216, 0.04406001200587076, -0.2949258866660957, -0.003926470946473411, 0.2151116154560395, 0.03686032232720128, 0.03391287828772771, 0.062007631912025844, 0.033744020464158135, -0.13229059153884837, -0.23670711260453997, 0.2893190811818489, 0.1298448506837027, 0.2312879986100229, 0.09381155843206952, 0.14026574790477753, -0.10063612105949676, -0.01987093284466787, -0.076243926692239, -0.2000011093452163, -0.010279107732769055, 0.2042102215080699, 0.12259272135546596, 0.08619308600178625, -0.31421178070050254, -0.16691246354080078, 0.18714045095139573, 0.14099219320577722, 0.059276358075616764, -0.0597108208538988, -0.28017075470636915, 0.05961533983627075, -0.2103293833876901, -0.13700373038720293, -0.036157098233322554, -0.04479533385579722, -0.017635101823819967, -0.29325352480658623, 0.13472573905652743, -0.09129616730740364, -0.06659494108178571, -0.07350767432134363, -0.20356883356035274, -0.009152683370475527, 0.029293807276489236, 0.1664665466369, 0.03427563747980549, 0.12079927822445295, -0.07545934810562507, -0.05084671115479137, 0.43027254052554503, -0.06913776838079189, -0.13255679231730902, 0.05403369294974623, -0.19191720944393095, -0.07871398343881474, 0.13351665889915032, 0.09053435191347063, 0.0009133034161751784, -0.2195472545638869, 0.11740081751265245, -0.13859314976784673, 0.2434726327162566, 0.10256528929524313, -0.03308126908252487, 0.30351933021145533, 0.21335740661973582, 0.12167756101470205, -0.10039336372555906, -0.15379014736795915, 0.0056050761921119085, -0.2913189315343205, -0.06600983253432603, -0.12472298194335986, 0.13377814465261337, -0.07614978663350715, -0.07925487448913753, 0.44587161934262587, 0.14840622608773882, 0.20134248213158756, 0.0329739962589538, 0.27703499457433445, 0.1556898798274843, 0.06860875968432313, 0.05397959444907647, 0.3273236411564712, 0.1920131938561467, 0.11383036159780584, -0.26485142924622457, 0.019066382959909454, 0.05797875954628085] |
1,802.10043 | Finsler geometry as a model for relativistic gravity | We give an overview on the status and on the perspectives of Finsler gravity,
beginning with a discussion of various motivations for considering a Finslerian
modification of General Relativity. The subjects covered include Finslerian
versions of Maxwell's equations, of the Klein-Gordon equation and of the Dirac
equation, and several experimental tests of Finsler gravity.
| gr-qc | we give an overview on the status and on the perspectives of finsler gravity beginning with a discussion of various motivations for considering a finslerian modification of general relativity the subjects covered include finslerian versions of maxwells equations of the kleingordon equation and of the dirac equation and several experimental tests of finsler gravity | [['we', 'give', 'an', 'overview', 'on', 'the', 'status', 'and', 'on', 'the', 'perspectives', 'of', 'finsler', 'gravity', 'beginning', 'with', 'a', 'discussion', 'of', 'various', 'motivations', 'for', 'considering', 'a', 'finslerian', 'modification', 'of', 'general', 'relativity', 'the', 'subjects', 'covered', 'include', 'finslerian', 'versions', 'of', 'maxwells', 'equations', 'of', 'the', 'kleingordon', 'equation', 'and', 'of', 'the', 'dirac', 'equation', 'and', 'several', 'experimental', 'tests', 'of', 'finsler', 'gravity']] | [-0.16218508691182015, 0.06582238415015766, -0.10692696825221733, 0.07934069097111071, -0.19511818147643847, -0.16494118665448493, -0.08394628319095958, 0.25192741076117037, -0.17339193229391067, -0.32164792250841856, 0.0906346482310996, -0.30199818271729684, -0.14638387028955752, 0.21413784462061744, -0.07421177322113956, 0.025177857403091534, 0.060782870553709845, 0.05999885137296385, -0.16426456942119533, -0.23447722657066253, 0.4162886122034656, 0.06862626417919442, 0.2058113514342242, 0.0633577153224636, 0.14916196496536335, -0.014886181034078752, -0.06338766932970395, 0.07843426787466914, -0.20844600984343775, 0.08114285461811556, 0.17629845152367596, 0.1516643370570684, 0.27463989718644705, -0.46279210762845147, -0.22383673436491303, -0.009163119226556134, 0.027957451248463865, 0.1076706817580594, -0.1084248699221967, -0.39616400541530716, -0.03914539231401351, -0.11481875191546148, -0.16986671297086609, -0.01791928779264843, -0.021839375969850354, 0.016894685074307577, -0.13569102260387605, 0.05885651601581938, 0.03816227913247766, 0.05815442132384137, -0.15133353728042157, -0.14420500352409565, 0.05118291982647928, 0.023954009188822022, 0.11028975736849976, -0.008139617232329867, 0.0780248382318489, -0.11750010711451371, -0.15212222748367046, 0.46958052046183085, -0.07090525821183326, -0.2889976256906434, 0.10927325580269098, -0.1417938617437526, -0.15329928773765764, 0.005420045866803439, 0.1729692765166638, 0.14550906437000743, -0.16481349525835226, 0.13860804556235154, -0.0047988926332133515, 0.05698074345235472, 0.09109251501245631, 0.010146708828095277, 0.21213182797482996, 0.15884351628591065, 0.029270355434467394, 0.07092963266013949, 0.030774096156366997, -0.15003565061164814, -0.4736735114344844, -0.21160093513834807, -0.08987763267079438, 0.13375985205035518, -0.1530116035991577, -0.16773818720442554, 0.4606519821272404, 0.11361741693690419, 0.044116466099189386, 0.06435867424847351, 0.225616578909534, 0.03372207528877037, -0.038151933854721765, 0.03086026050840263, 0.27316277677676193, 0.22580317870058395, 0.1516180118908071, -0.18658944700534144, -0.06680901822013159, 0.09008681905214433] |
1,802.10044 | Discrete Crum's Theorems and Integrable Lattice Equations | In this paper, we develop discrete versions of Darboux transformations and
Crum's theorems for two second order difference equations. The difference
equations are discretised versions (using Darboux transformations) of the
spectral problems of the KdV quation, and of the modified KdV equation or
sine-Gordon equation. Considering the discrete dynamics created by Darboux
transformations for the difference equations, one obtains the lattice potential
KdV equation, the lattice potential modified KdV equation and the lattice
Schwarzian KdV equation, that are prototypes of integrable lattice equations.
It turns out that, along the discretisation processes using Darboux
transformations, two families of integrable systems (the KdV family, and the
modified KdV or sine-Gordon family), including their continuous, semi-discrete
and lattice versions, are explicitly constructed. As direct applications of the
discrete Crum's theorems, multi-soliton solutions of the lattice equations are
obtained.
| nlin.SI math-ph math.MP quant-ph | in this paper we develop discrete versions of darboux transformations and crums theorems for two second order difference equations the difference equations are discretised versions using darboux transformations of the spectral problems of the kdv quation and of the modified kdv equation or sinegordon equation considering the discrete dynamics created by darboux transformations for the difference equations one obtains the lattice potential kdv equation the lattice potential modified kdv equation and the lattice schwarzian kdv equation that are prototypes of integrable lattice equations it turns out that along the discretisation processes using darboux transformations two families of integrable systems the kdv family and the modified kdv or sinegordon family including their continuous semidiscrete and lattice versions are explicitly constructed as direct applications of the discrete crums theorems multisoliton solutions of the lattice equations are obtained | [['in', 'this', 'paper', 'we', 'develop', 'discrete', 'versions', 'of', 'darboux', 'transformations', 'and', 'crums', 'theorems', 'for', 'two', 'second', 'order', 'difference', 'equations', 'the', 'difference', 'equations', 'are', 'discretised', 'versions', 'using', 'darboux', 'transformations', 'of', 'the', 'spectral', 'problems', 'of', 'the', 'kdv', 'quation', 'and', 'of', 'the', 'modified', 'kdv', 'equation', 'or', 'sinegordon', 'equation', 'considering', 'the', 'discrete', 'dynamics', 'created', 'by', 'darboux', 'transformations', 'for', 'the', 'difference', 'equations', 'one', 'obtains', 'the', 'lattice', 'potential', 'kdv', 'equation', 'the', 'lattice', 'potential', 'modified', 'kdv', 'equation', 'and', 'the', 'lattice', 'schwarzian', 'kdv', 'equation', 'that', 'are', 'prototypes', 'of', 'integrable', 'lattice', 'equations', 'it', 'turns', 'out', 'that', 'along', 'the', 'discretisation', 'processes', 'using', 'darboux', 'transformations', 'two', 'families', 'of', 'integrable', 'systems', 'the', 'kdv', 'family', 'and', 'the', 'modified', 'kdv', 'or', 'sinegordon', 'family', 'including', 'their', 'continuous', 'semidiscrete', 'and', 'lattice', 'versions', 'are', 'explicitly', 'constructed', 'as', 'direct', 'applications', 'of', 'the', 'discrete', 'crums', 'theorems', 'multisoliton', 'solutions', 'of', 'the', 'lattice', 'equations', 'are', 'obtained']] | [-0.1471148190399011, 0.0893065656983742, -0.09538570611772162, 0.10715712078726264, -0.12772467300571777, -0.18261915025887665, -0.07354596150883784, 0.2948082355506442, -0.347276001782329, -0.16783700463948426, 0.13664739359497885, -0.34110322240050195, -0.18023173990831884, 0.16561968448330408, -0.002684158100574105, 0.15158015768285152, 0.07948824428711776, -0.022262861465828288, -0.17123846421018243, -0.29149892280585377, 0.35196002903911805, -0.09578132278251428, 0.22687740551169824, -0.03990468306604911, 0.18858774643115422, -0.011813655356807565, -0.01204236262926349, -0.08710773505132507, -0.17491308468344396, 0.05398085937162654, 0.20282564584372773, -0.011203642631018603, 0.17738821329548954, -0.41352440532710816, -0.24486816261239625, 0.10223847256490477, 0.17071848489663186, 0.14551611715168863, -0.03493284178828752, -0.3439045456272584, -0.01810323160348667, -0.10830840600861444, -0.25248575616558944, -0.09881775458515794, -0.006286804722966971, 0.153212496265769, -0.18254475167659284, 0.14530551759181198, 0.09150967859421615, -0.004961829489372947, -0.13586196331307293, -0.08545498229149315, -0.11899084719932741, -0.02250536402032055, 0.015056111106511068, -0.0412371974369442, -0.0015101631999843651, -0.0755586411010612, -0.11574294529380967, 0.4721734183141962, -0.08935340017994382, -0.34007755586256583, 0.09433475199707404, -0.02899064041191229, -0.1705933899929126, 0.10280052849126083, 0.11069230722884336, 0.11230389950796962, -0.2068705905539294, 0.15117685938861947, -0.028483339719888236, 0.12143651241505588, 0.19000278137348317, -0.01889206676709431, 0.11242463021297698, 0.06771172752465915, 0.026777031748659082, 0.13990925970590776, 0.05883286633931372, -0.252899645248221, -0.3387702409040045, -0.11773635534638607, -0.12272667534330307, 0.054302937551229086, -0.1363206126952449, -0.1750681794076054, 0.3893071558843884, 0.09270646351355094, 0.053370174324070964, 0.06988420675646652, 0.14609338384535578, 0.25201196358280464, 0.0356428314914444, 0.012755643617775704, 0.13749590902416794, 0.22024072208786727, 0.16142487541806919, -0.25166608069881075, -0.1583368306656161, 0.32820926901229003] |
1,802.10045 | A Shack-Hartmann sensor for single-shot multi-contrast imaging with hard
X-rays | An array of compound refractive X-ray lenses (CRL) with 20x20 lenslets, a
focal distance of 20 cm and a visibility of 0.93 is presented. It can be used
as a Shack-Hartmann sensor for hard X-rays (SHARX) for wavefront sensing and
permits for true single-shot multi-contrast imaging the dynamics of materials
with a spatial resolution in the micrometer range, sensitivity on nanosized
structures and temporal resolution on the microsecond scale. The object's
absorption and its induced wavefront shift can be assessed simultaneously
together with information from diffraction channels. This enables the imaging
of hierarchical materials. In contrast to the established Hartmann sensors the
SHARX has an increased flux efficiency through focusing of the beam rather than
blocking parts of it. We investigated the spatiotemporal behavior of a
cavitation bubble induced by laser pulses. Furthermore, we validated the SHARX
by measuring refraction angles of a single diamond CRL, where we obtained an
angular resolution better than 4 microrad.
| physics.app-ph | an array of compound refractive xray lenses crl with 20x20 lenslets a focal distance of 20 cm and a visibility of 093 is presented it can be used as a shackhartmann sensor for hard xrays sharx for wavefront sensing and permits for true singleshot multicontrast imaging the dynamics of materials with a spatial resolution in the micrometer range sensitivity on nanosized structures and temporal resolution on the microsecond scale the objects absorption and its induced wavefront shift can be assessed simultaneously together with information from diffraction channels this enables the imaging of hierarchical materials in contrast to the established hartmann sensors the sharx has an increased flux efficiency through focusing of the beam rather than blocking parts of it we investigated the spatiotemporal behavior of a cavitation bubble induced by laser pulses furthermore we validated the sharx by measuring refraction angles of a single diamond crl where we obtained an angular resolution better than 4 microrad | [['an', 'array', 'of', 'compound', 'refractive', 'xray', 'lenses', 'crl', 'with', '20x20', 'lenslets', 'a', 'focal', 'distance', 'of', '20', 'cm', 'and', 'a', 'visibility', 'of', '093', 'is', 'presented', 'it', 'can', 'be', 'used', 'as', 'a', 'shackhartmann', 'sensor', 'for', 'hard', 'xrays', 'sharx', 'for', 'wavefront', 'sensing', 'and', 'permits', 'for', 'true', 'singleshot', 'multicontrast', 'imaging', 'the', 'dynamics', 'of', 'materials', 'with', 'a', 'spatial', 'resolution', 'in', 'the', 'micrometer', 'range', 'sensitivity', 'on', 'nanosized', 'structures', 'and', 'temporal', 'resolution', 'on', 'the', 'microsecond', 'scale', 'the', 'objects', 'absorption', 'and', 'its', 'induced', 'wavefront', 'shift', 'can', 'be', 'assessed', 'simultaneously', 'together', 'with', 'information', 'from', 'diffraction', 'channels', 'this', 'enables', 'the', 'imaging', 'of', 'hierarchical', 'materials', 'in', 'contrast', 'to', 'the', 'established', 'hartmann', 'sensors', 'the', 'sharx', 'has', 'an', 'increased', 'flux', 'efficiency', 'through', 'focusing', 'of', 'the', 'beam', 'rather', 'than', 'blocking', 'parts', 'of', 'it', 'we', 'investigated', 'the', 'spatiotemporal', 'behavior', 'of', 'a', 'cavitation', 'bubble', 'induced', 'by', 'laser', 'pulses', 'furthermore', 'we', 'validated', 'the', 'sharx', 'by', 'measuring', 'refraction', 'angles', 'of', 'a', 'single', 'diamond', 'crl', 'where', 'we', 'obtained', 'an', 'angular', 'resolution', 'better', 'than', '4', 'microrad']] | [-0.09229215750327477, 0.14261365729749415, -0.05857179332218575, -0.003215712060083229, -0.03057422619074201, -0.10812924833795151, 0.009880992574975468, 0.4775786046655132, -0.24192513348922753, -0.34536356783997363, 0.09646258725432488, -0.27430933066166174, -0.08611924607211198, 0.22354668924041712, -0.07032488911854437, 0.07709496901430285, 0.0356788997633908, -0.03247292085628336, -0.030085825682199824, -0.1383627315547365, 0.23671717751914492, 0.1380484237616213, 0.265910774159681, 0.04349644647206729, 0.1647549249076595, 0.03980570684115474, -0.0029401492793112993, 0.053464973954340585, -0.11134425935317548, 0.12993633792174455, 0.2330601066350937, 0.06681733542548803, 0.18262027888797605, -0.40315284356713676, -0.24788303027311578, 0.03133516691069907, 0.14078113502966097, 0.03646362134112188, -0.058911960440663956, -0.3074522564808528, 0.07010865065221412, -0.11570746603851709, -0.12444258695289206, -0.0032476201557960264, -0.015939442070726402, 0.02303613041555927, -0.2654375593888406, 0.03718838927736028, 0.006185460781965118, 0.11105395866354975, -0.05355118468287401, -0.07281005484028122, 0.014525961769649234, 0.10021077252279681, -0.05883126420368894, 0.011140921788188653, 0.15852886656275353, -0.14788977266737044, -0.09576334883324587, 0.3750555315711655, -0.023299842501098914, -0.12028070759529677, 0.14452498918399215, -0.1887415010147752, -0.024485832825750828, 0.23003311328685436, 0.14309836105885318, 0.14670337546760073, -0.12239975075070293, -0.010926041031220498, 0.005711739391046695, 0.279543980199378, 0.1634801395098643, 0.06776789131645973, 0.19688219555731243, 0.22672216007739712, 0.06735965468658087, 0.14450809052393127, -0.24954062350130138, 0.022008544544522196, -0.20635646557620463, -0.13690083457951027, -0.18631053194463348, 0.04327931900610192, -0.12408583736582958, -0.11249936929939744, 0.37163566606856574, 0.1338399920421533, 0.15960385920241094, -0.008173597606424337, 0.33211512895277107, 0.0678538381747412, 0.11685597078385165, -0.02461098115115116, 0.27685739350421595, 0.15125809482877883, 0.14813220532587132, -0.20538741804342955, 0.026281108476746924, -0.030707552158930458] |
1,802.10046 | Duality Between Relaxation and First Passage in Reversible Markov
Dynamics: Rugged Energy Landscapes Disentangled | Relaxation and first passage processes are the pillars of kinetics in
condensed matter, polymeric and single-molecule systems. Yet, an explicit
connection between relaxation and first passage time-scales so far remained
elusive. Here we prove a duality between them in the form of an interlacing of
spectra. In the basic form the duality holds for reversible Markov processes to
effectively one-dimensional targets. The exploration of a triple-well potential
is analyzed to demonstrate how the duality allows for an intuitive
understanding of first passage trajectories in terms of relaxational
eigenmodes. More generally, we provide a comprehensive explanation of the full
statistics of reactive trajectories in rugged potentials, incl. the so-called
`few-encounter limit'. Our results are required for explaining quantitatively
the occurrence of diseases triggered by protein misfolding.
| cond-mat.stat-mech math-ph math.MP physics.bio-ph | relaxation and first passage processes are the pillars of kinetics in condensed matter polymeric and singlemolecule systems yet an explicit connection between relaxation and first passage timescales so far remained elusive here we prove a duality between them in the form of an interlacing of spectra in the basic form the duality holds for reversible markov processes to effectively onedimensional targets the exploration of a triplewell potential is analyzed to demonstrate how the duality allows for an intuitive understanding of first passage trajectories in terms of relaxational eigenmodes more generally we provide a comprehensive explanation of the full statistics of reactive trajectories in rugged potentials incl the socalled fewencounter limit our results are required for explaining quantitatively the occurrence of diseases triggered by protein misfolding | [['relaxation', 'and', 'first', 'passage', 'processes', 'are', 'the', 'pillars', 'of', 'kinetics', 'in', 'condensed', 'matter', 'polymeric', 'and', 'singlemolecule', 'systems', 'yet', 'an', 'explicit', 'connection', 'between', 'relaxation', 'and', 'first', 'passage', 'timescales', 'so', 'far', 'remained', 'elusive', 'here', 'we', 'prove', 'a', 'duality', 'between', 'them', 'in', 'the', 'form', 'of', 'an', 'interlacing', 'of', 'spectra', 'in', 'the', 'basic', 'form', 'the', 'duality', 'holds', 'for', 'reversible', 'markov', 'processes', 'to', 'effectively', 'onedimensional', 'targets', 'the', 'exploration', 'of', 'a', 'triplewell', 'potential', 'is', 'analyzed', 'to', 'demonstrate', 'how', 'the', 'duality', 'allows', 'for', 'an', 'intuitive', 'understanding', 'of', 'first', 'passage', 'trajectories', 'in', 'terms', 'of', 'relaxational', 'eigenmodes', 'more', 'generally', 'we', 'provide', 'a', 'comprehensive', 'explanation', 'of', 'the', 'full', 'statistics', 'of', 'reactive', 'trajectories', 'in', 'rugged', 'potentials', 'incl', 'the', 'socalled', 'fewencounter', 'limit', 'our', 'results', 'are', 'required', 'for', 'explaining', 'quantitatively', 'the', 'occurrence', 'of', 'diseases', 'triggered', 'by', 'protein', 'misfolding']] | [-0.116465939237969, 0.1499937532628997, -0.11779308678852694, 0.10169365936458381, -0.042537600616924465, -0.09895870783892009, 0.04946729835994061, 0.3846778667742206, -0.2760258899258089, -0.24015883537339827, 0.029566208377570635, -0.23137025901826658, -0.2041780478921869, 0.18836787632749147, -0.005880445302013428, 0.05358512028150501, 0.028465153683247344, -0.012983359330504637, -0.024308737493195242, -0.17991826775664044, 0.25568982739857726, 0.047152528184421, 0.24677173274704406, 0.0845880234105167, 0.10303094128105458, 0.007421049623629979, 0.016207950328656982, -0.057485323616175824, -0.17115249483463085, 0.12909698406198708, 0.2414225851966729, 0.09084531173463009, 0.258261954036331, -0.4997969589857084, -0.22020155941737035, 0.10222324381972994, 0.18075255528486694, 0.129035096796513, -0.056220726903003164, -0.25912996809629185, 0.015601980781573202, -0.12636911293732062, -0.14312931630505069, -0.10803047165034278, 0.07640385257470753, 0.038624230700905524, -0.2276554442303736, 0.09249544198129085, 0.10521760536733293, 0.0801247289449337, -0.08574192782895895, -0.04765418695563811, 0.01929888077974019, 0.1528754942269335, 0.036306960438753685, -0.05666098181128262, 0.13990767491275385, -0.141028345239559, -0.16922371027871005, 0.37811031638862447, -0.02598686149952212, -0.14269282923440538, 0.2384098239239275, -0.14818883108185424, -0.16997346177607053, 0.1513743863080538, 0.12656263504440204, 0.14304865153896953, -0.20919012586255709, 0.05364366485446226, -0.001119180312079768, 0.12281441480280914, 0.05460926030026449, 0.023397905672966096, 0.23227990782188793, 0.22402969366239925, 0.0329991772267667, 0.14441321622542735, -0.049173631162932815, -0.1803543309717732, -0.28078618133440614, -0.18668228417875304, -0.16950599107170297, 0.06482378473024696, -0.03473427216487189, -0.14360402457250823, 0.3665175087592234, 0.11759981872408741, 0.21218324418089562, 0.062806750623314, 0.25257262438836114, 0.0963595577998222, 0.0013609933892204877, 0.011745632513456287, 0.23777965386398137, 0.17436334895037656, 0.07505177102998019, -0.22772566315102122, 0.08695726376402402, 0.0520610832008383] |
1,802.10047 | Hierarchy of Relaxation times and Residual Entropy: A Nonequilibrium
Approach | We consider nonequilibrium (NEQ) states such as supercooled liquids and
glasses that are described with use of internal variables. We classify the
latter by state-dependent hierarchy of relaxation times to assess their
relevance for irreversible contributions. Given an observation time
{\tau}_{obs}, we determine the window of relaxation times that divide the
internal variables into active and inactive groups, the former playing a
central role in the NEQ thermodynamics. Using this thermodynamics, we determine
(i) a bound on the NEQ entropy and on the residual entropy, and (ii) the nature
of isothermal relaxation of the entropy and the enthalpy in accordance with the
second law. A theory that violates the second law such as the entropy loss view
is shown to be internally inconsistent if we require it to be consistent with
experiments. The inactive internal variables still play an indirect role in
determining the temperature T(t), the pressure P(t), of the system, which
deviate from their external values.
| cond-mat.stat-mech cond-mat.soft | we consider nonequilibrium neq states such as supercooled liquids and glasses that are described with use of internal variables we classify the latter by statedependent hierarchy of relaxation times to assess their relevance for irreversible contributions given an observation time tau_obs we determine the window of relaxation times that divide the internal variables into active and inactive groups the former playing a central role in the neq thermodynamics using this thermodynamics we determine i a bound on the neq entropy and on the residual entropy and ii the nature of isothermal relaxation of the entropy and the enthalpy in accordance with the second law a theory that violates the second law such as the entropy loss view is shown to be internally inconsistent if we require it to be consistent with experiments the inactive internal variables still play an indirect role in determining the temperature tt the pressure pt of the system which deviate from their external values | [['we', 'consider', 'nonequilibrium', 'neq', 'states', 'such', 'as', 'supercooled', 'liquids', 'and', 'glasses', 'that', 'are', 'described', 'with', 'use', 'of', 'internal', 'variables', 'we', 'classify', 'the', 'latter', 'by', 'statedependent', 'hierarchy', 'of', 'relaxation', 'times', 'to', 'assess', 'their', 'relevance', 'for', 'irreversible', 'contributions', 'given', 'an', 'observation', 'time', 'tau_obs', 'we', 'determine', 'the', 'window', 'of', 'relaxation', 'times', 'that', 'divide', 'the', 'internal', 'variables', 'into', 'active', 'and', 'inactive', 'groups', 'the', 'former', 'playing', 'a', 'central', 'role', 'in', 'the', 'neq', 'thermodynamics', 'using', 'this', 'thermodynamics', 'we', 'determine', 'i', 'a', 'bound', 'on', 'the', 'neq', 'entropy', 'and', 'on', 'the', 'residual', 'entropy', 'and', 'ii', 'the', 'nature', 'of', 'isothermal', 'relaxation', 'of', 'the', 'entropy', 'and', 'the', 'enthalpy', 'in', 'accordance', 'with', 'the', 'second', 'law', 'a', 'theory', 'that', 'violates', 'the', 'second', 'law', 'such', 'as', 'the', 'entropy', 'loss', 'view', 'is', 'shown', 'to', 'be', 'internally', 'inconsistent', 'if', 'we', 'require', 'it', 'to', 'be', 'consistent', 'with', 'experiments', 'the', 'inactive', 'internal', 'variables', 'still', 'play', 'an', 'indirect', 'role', 'in', 'determining', 'the', 'temperature', 'tt', 'the', 'pressure', 'pt', 'of', 'the', 'system', 'which', 'deviate', 'from', 'their', 'external', 'values']] | [-0.10064663285920455, 0.18509582719772277, -0.09313897386039044, 0.05987600866515355, -0.01669987463570277, -0.12294350272922475, 0.07456472032231866, 0.3158126555733193, -0.2835801518344243, -0.28151475736622217, 0.0877106104967048, -0.29562923278968045, -0.1037395877739901, 0.1412412506842594, -0.01541253228547277, -0.009099976264090858, -0.027166293283530908, 0.05431839112847878, -0.054834922729653256, -0.2021502631784648, 0.30075137742133634, 0.0604179484745974, 0.2546743578425828, 0.02801661021491382, 0.09280321043678767, 0.01577612127482915, -0.011442033660740467, 0.05467582015800038, -0.15457544702613707, 0.06404169644140134, 0.23010612675878606, 0.09258191050163761, 0.22383813886861703, -0.4344825054026523, -0.20752939617129304, 0.12475037901027566, 0.08460118618251009, 0.07159008835457194, -0.026132679237408717, -0.22088071069187798, 0.046795429432005355, -0.156503053423563, -0.12807584782042036, -0.09623430495426225, 0.04732464825449761, -0.008367375197826297, -0.23710885690228575, 0.15536887917199, 0.11686182537288138, 0.03851814673632194, -0.11026481365500267, -0.10762347719130835, -0.04331802167472946, 0.13113186326601609, 0.07597369380342732, 0.018967896260938068, 0.17505716753732056, -0.1274595296553152, -0.08639597212658472, 0.36809037258599403, -0.04609077720262205, -0.168703973572108, 0.189579291370027, -0.12457392007634518, -0.1500847909486835, 0.08676018697731672, 0.1447094158272431, 0.11747374630503128, -0.12561203438527646, 0.05325606189469642, -0.008066055471682624, 0.18045100604723782, 0.02632316380626504, 0.034674282259883206, 0.2308329330923356, 0.12748457065221386, 0.031525756184057674, 0.15601973910519415, -0.05396268819310483, -0.14583442222540546, -0.33979473465899374, -0.19265749196708795, -0.1867882159514839, 0.08008254201401316, -0.07971552644875182, -0.12045044050856707, 0.3358839210004184, 0.13591926619054595, 0.2079707387461072, 0.04789241560613203, 0.2363363514138255, 0.15122778961586225, 0.04664636601747316, 0.09457970402873815, 0.2625481624239285, 0.14468103249343764, 0.08870389673763969, -0.2912232930861728, 0.0978915994797068, 0.05138012781964651] |
1,802.10048 | Parameterized Complexity of Diameter | Diameter -- the task of computing the length of a longest shortest path -- is
a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis,
there is no $O(n^{1.99})$-time algorithm even in sparse graphs [Roditty and
Williams, 2013]. To circumvent this lower bound we aim for algorithms with
running time $f(k)(n+m)$ where $k$ is a parameter and $f$ is a function as
small as possible. We investigate which parameters allow for such running
times. To this end, we systematically explore a hierarchy of structural graph
parameters.
| cs.DS | diameter the task of computing the length of a longest shortest path is a fundamental graph problem assuming the strong exponential time hypothesis there is no on199time algorithm even in sparse graphs roditty and williams 2013 to circumvent this lower bound we aim for algorithms with running time fknm where k is a parameter and f is a function as small as possible we investigate which parameters allow for such running times to this end we systematically explore a hierarchy of structural graph parameters | [['diameter', 'the', 'task', 'of', 'computing', 'the', 'length', 'of', 'a', 'longest', 'shortest', 'path', 'is', 'a', 'fundamental', 'graph', 'problem', 'assuming', 'the', 'strong', 'exponential', 'time', 'hypothesis', 'there', 'is', 'no', 'on199time', 'algorithm', 'even', 'in', 'sparse', 'graphs', 'roditty', 'and', 'williams', '2013', 'to', 'circumvent', 'this', 'lower', 'bound', 'we', 'aim', 'for', 'algorithms', 'with', 'running', 'time', 'fknm', 'where', 'k', 'is', 'a', 'parameter', 'and', 'f', 'is', 'a', 'function', 'as', 'small', 'as', 'possible', 'we', 'investigate', 'which', 'parameters', 'allow', 'for', 'such', 'running', 'times', 'to', 'this', 'end', 'we', 'systematically', 'explore', 'a', 'hierarchy', 'of', 'structural', 'graph', 'parameters']] | [-0.18572921405841664, 0.11610537515271728, -0.07031964701486797, 0.07442677489243357, -0.11496279231363499, -0.13409733897779227, 0.10055138576185195, 0.4105014224059698, -0.292671688014596, -0.3694327659450653, 0.11499714645097123, -0.19819041641383636, -0.15189973333078186, 0.16659658853739795, -0.04945531247251826, 0.09388696075212664, 0.07902342662010796, 0.05551272969431721, -0.039372421622918014, -0.23402496061654102, 0.2466851766959469, 0.06371060020869553, 0.17061259320414648, 0.06640364776760135, 0.08149861358674015, 0.01105336097591534, -0.011204708384622524, 0.03197353039073145, -0.18577535527406214, 0.07069002041769237, 0.23462904510428992, 0.16620468066596403, 0.2952522381958438, -0.38443706239142067, -0.16408502201481565, 0.2139057986120262, 0.1013225377736068, 0.09409796634955876, 0.0204804137564923, -0.19159809908852343, 0.1240545640097613, -0.09910297564162714, -0.09653860097751021, 0.01983256918582611, 0.11443425476460195, -0.030021279422770733, -0.29204217911266334, 0.03565671115477637, 0.06352184828734253, 0.007147911385201463, 0.019049445436926694, -0.12235095928900125, 0.08105031300404268, 0.11243013163074488, 0.040540211016266814, 0.07983309805688517, 0.0301517193864395, -0.1076843820870059, -0.14227325290941248, 0.3641799763072191, -0.08338031359300835, -0.14200671324960706, 0.16881751672296627, -0.06738919675032176, -0.17606694225176442, 0.0869919670143778, 0.17949936336769565, 0.1477892636321485, -0.11953121143188782, 0.1487456412017686, -0.07581055198409935, 0.2212374978755578, 0.09440811515626747, 0.017916956005004665, 0.11298393311588414, 0.21164750638304325, 0.154491627509365, 0.16169583306238963, -0.04254970833568311, -0.039057351297432014, -0.24190008789073766, -0.16008136024849104, -0.21045294657304156, 0.04206306428830253, -0.15273347172123755, -0.16388103526608064, 0.40725789713764154, 0.1397480083879356, 0.24946512504503493, 0.1308456082479097, 0.28142015233766515, 0.12810622810147612, 0.05191037494961808, 0.17018630919314667, 0.15746298843778941, 0.10654909221495207, 0.028030248796113016, -0.1953362397758699, 0.08929659598847715, 0.09952369353892963] |
1,802.10049 | Interlacing Relaxation and First-Passage Phenomena in Reversible
Discrete and Continuous Space Markovian Dynamics | We uncover a duality between relaxation and first passage processes in
ergodic reversible Markovian dynamics in both discrete and continuous
state-space. The duality exists in the form of a spectral interlacing -- the
respective time scales of relaxation and first passage are shown to interlace.
Our canonical theory allows for the first time to determine the full first
passage time distribution analytically from the simpler relaxation
eigenspectrum. The duality is derived and proven rigorously for both discrete
state Markov processes in arbitrary dimension and effectively one-dimensional
diffusion processes, whereas we also discuss extensions to more complex
scenarios. We apply our theory to a simple discrete-state protein folding model
and to the Ornstein-Uhlenbeck process, for which we obtain the exact first
passage time distribution analytically in terms of a Newton series of
determinants of almost triangular matrices.
| cond-mat.stat-mech math-ph math.MP | we uncover a duality between relaxation and first passage processes in ergodic reversible markovian dynamics in both discrete and continuous statespace the duality exists in the form of a spectral interlacing the respective time scales of relaxation and first passage are shown to interlace our canonical theory allows for the first time to determine the full first passage time distribution analytically from the simpler relaxation eigenspectrum the duality is derived and proven rigorously for both discrete state markov processes in arbitrary dimension and effectively onedimensional diffusion processes whereas we also discuss extensions to more complex scenarios we apply our theory to a simple discretestate protein folding model and to the ornsteinuhlenbeck process for which we obtain the exact first passage time distribution analytically in terms of a newton series of determinants of almost triangular matrices | [['we', 'uncover', 'a', 'duality', 'between', 'relaxation', 'and', 'first', 'passage', 'processes', 'in', 'ergodic', 'reversible', 'markovian', 'dynamics', 'in', 'both', 'discrete', 'and', 'continuous', 'statespace', 'the', 'duality', 'exists', 'in', 'the', 'form', 'of', 'a', 'spectral', 'interlacing', 'the', 'respective', 'time', 'scales', 'of', 'relaxation', 'and', 'first', 'passage', 'are', 'shown', 'to', 'interlace', 'our', 'canonical', 'theory', 'allows', 'for', 'the', 'first', 'time', 'to', 'determine', 'the', 'full', 'first', 'passage', 'time', 'distribution', 'analytically', 'from', 'the', 'simpler', 'relaxation', 'eigenspectrum', 'the', 'duality', 'is', 'derived', 'and', 'proven', 'rigorously', 'for', 'both', 'discrete', 'state', 'markov', 'processes', 'in', 'arbitrary', 'dimension', 'and', 'effectively', 'onedimensional', 'diffusion', 'processes', 'whereas', 'we', 'also', 'discuss', 'extensions', 'to', 'more', 'complex', 'scenarios', 'we', 'apply', 'our', 'theory', 'to', 'a', 'simple', 'discretestate', 'protein', 'folding', 'model', 'and', 'to', 'the', 'ornsteinuhlenbeck', 'process', 'for', 'which', 'we', 'obtain', 'the', 'exact', 'first', 'passage', 'time', 'distribution', 'analytically', 'in', 'terms', 'of', 'a', 'newton', 'series', 'of', 'determinants', 'of', 'almost', 'triangular', 'matrices']] | [-0.08936031758612781, 0.10971834311192787, -0.12737004902144825, 0.11457249120496811, -0.03329629732502831, -0.10477733178478148, 0.05025415393454885, 0.39281897266153937, -0.3497226012249788, -0.19833343604372608, 0.10705444031239798, -0.19921551229856926, -0.1818230447773304, 0.15305430581275786, 0.018462360850362868, 0.08272606936041955, 0.010710223612410051, 0.021605203438688207, -0.07539091069872181, -0.21861260793413276, 0.26799308790100945, 0.026987473328632338, 0.23739049574705184, 0.028494047321793108, 0.1280507756880036, 0.03829397260194162, -0.010579948003093401, -0.06121439852372364, -0.1515821911946491, 0.09679385737550479, 0.24473290204036016, 0.08562953339165283, 0.21653141858125174, -0.4498589705917294, -0.20936107995609443, 0.11205550880619773, 0.15573338759390432, 0.11680479060461814, 0.003058916466047608, -0.27357449657801125, 0.028620156854352295, -0.14692971899208648, -0.12562815520084566, -0.09426341856381408, 0.06155690674721781, 0.015899282707660285, -0.29164442826252157, 0.10499928601892423, 0.09981483957316313, 0.0012836969630033882, -0.06789433173102292, -0.05609063749822477, 0.015353409204356096, 0.14934384129786243, 0.02045928804043258, -0.06318326884604715, 0.07645476719502498, -0.042651072485993306, -0.16537265025113743, 0.3456107629135389, -0.08178949128767407, -0.20096654635336664, 0.20443791718636123, -0.1854521212340505, -0.18021573215654052, 0.1361926453532996, 0.1636533326279648, 0.1566917540781476, -0.1835817103619101, 0.11560380966316357, -0.008465621710099555, 0.11397523171660766, 0.0577771230014386, -0.025392768273552604, 0.11296756238228194, 0.13940371845469432, 0.07649191635557347, 0.180740290304163, -0.04835124487505743, -0.2427537402138114, -0.29831335908836787, -0.17678196738146384, -0.2130422908122893, 0.08374741179006243, -0.11711691870392921, -0.15094584704062006, 0.404279494839203, 0.12749124783505167, 0.21083882682163407, 0.1568452019184069, 0.23836587655823677, 0.18746146105954217, -0.035699438139865244, 0.06688264063042071, 0.1494333917275071, 0.19792442499590968, 0.0774374836348687, -0.23162561586920033, 0.0538198960651816, 0.1199406509184175] |
1,802.1005 | Homodyne nonclassical area as a nonclassicality indicator | We propose a legitimate and easily computable nonclassicality indicator for
the states of electromagnetic fields based on the standard deviation in the
measurement of the homodyne rotated quadrature operator. The proposed
nonclassicality indicator is the nonclassical area projected by the optical
tomogram of the quantum state of light on the optical tomographic plane. If the
nonclassical area projected by the optical tomogram of a quantum state is
greater than zero, the state is nonclassical, and the area is zero for the pure
classical state. It is also noted that the nonclassical area of a quantum state
increases with an increase in the strength of nonclassicality inducing
operations on the state such as squeezing, photon addition, etc. We have tested
the validity of the nonclassical area measure by calculating the same for
certain well-known nonclassical states and found that essential features of the
nonclassicality shown by the states are captured in the nonclassical area. We
have also shown that the nonclassical area is robust against
environment-induced decoherence of the states. Nonclassical area projected by
the optical tomogram of a quantum state of light is experimentally tractable
using the balanced homodyne detection of the quadrature operator of the field,
avoiding the reconstruction of the density matrix or the quasiprobability
distribution of the state.
| quant-ph | we propose a legitimate and easily computable nonclassicality indicator for the states of electromagnetic fields based on the standard deviation in the measurement of the homodyne rotated quadrature operator the proposed nonclassicality indicator is the nonclassical area projected by the optical tomogram of the quantum state of light on the optical tomographic plane if the nonclassical area projected by the optical tomogram of a quantum state is greater than zero the state is nonclassical and the area is zero for the pure classical state it is also noted that the nonclassical area of a quantum state increases with an increase in the strength of nonclassicality inducing operations on the state such as squeezing photon addition etc we have tested the validity of the nonclassical area measure by calculating the same for certain wellknown nonclassical states and found that essential features of the nonclassicality shown by the states are captured in the nonclassical area we have also shown that the nonclassical area is robust against environmentinduced decoherence of the states nonclassical area projected by the optical tomogram of a quantum state of light is experimentally tractable using the balanced homodyne detection of the quadrature operator of the field avoiding the reconstruction of the density matrix or the quasiprobability distribution of the state | [['we', 'propose', 'a', 'legitimate', 'and', 'easily', 'computable', 'nonclassicality', 'indicator', 'for', 'the', 'states', 'of', 'electromagnetic', 'fields', 'based', 'on', 'the', 'standard', 'deviation', 'in', 'the', 'measurement', 'of', 'the', 'homodyne', 'rotated', 'quadrature', 'operator', 'the', 'proposed', 'nonclassicality', 'indicator', 'is', 'the', 'nonclassical', 'area', 'projected', 'by', 'the', 'optical', 'tomogram', 'of', 'the', 'quantum', 'state', 'of', 'light', 'on', 'the', 'optical', 'tomographic', 'plane', 'if', 'the', 'nonclassical', 'area', 'projected', 'by', 'the', 'optical', 'tomogram', 'of', 'a', 'quantum', 'state', 'is', 'greater', 'than', 'zero', 'the', 'state', 'is', 'nonclassical', 'and', 'the', 'area', 'is', 'zero', 'for', 'the', 'pure', 'classical', 'state', 'it', 'is', 'also', 'noted', 'that', 'the', 'nonclassical', 'area', 'of', 'a', 'quantum', 'state', 'increases', 'with', 'an', 'increase', 'in', 'the', 'strength', 'of', 'nonclassicality', 'inducing', 'operations', 'on', 'the', 'state', 'such', 'as', 'squeezing', 'photon', 'addition', 'etc', 'we', 'have', 'tested', 'the', 'validity', 'of', 'the', 'nonclassical', 'area', 'measure', 'by', 'calculating', 'the', 'same', 'for', 'certain', 'wellknown', 'nonclassical', 'states', 'and', 'found', 'that', 'essential', 'features', 'of', 'the', 'nonclassicality', 'shown', 'by', 'the', 'states', 'are', 'captured', 'in', 'the', 'nonclassical', 'area', 'we', 'have', 'also', 'shown', 'that', 'the', 'nonclassical', 'area', 'is', 'robust', 'against', 'environmentinduced', 'decoherence', 'of', 'the', 'states', 'nonclassical', 'area', 'projected', 'by', 'the', 'optical', 'tomogram', 'of', 'a', 'quantum', 'state', 'of', 'light', 'is', 'experimentally', 'tractable', 'using', 'the', 'balanced', 'homodyne', 'detection', 'of', 'the', 'quadrature', 'operator', 'of', 'the', 'field', 'avoiding', 'the', 'reconstruction', 'of', 'the', 'density', 'matrix', 'or', 'the', 'quasiprobability', 'distribution', 'of', 'the', 'state']] | [-0.12258713113494941, 0.19304520733632705, -0.11689322829186934, 0.06532577017125767, 0.01968145133018211, -0.14813815825287766, 0.055909927026258334, 0.3420231689641614, -0.23797084719728306, -0.23758967156341007, 0.06807970478181767, -0.2755900726287286, -0.10895654675330066, 0.23733065379077295, -0.06654010003794568, 0.14539945427928633, 0.04626264548485313, 0.07693956127628614, -0.05688802794314991, -0.2207999330458686, 0.3455605553772071, 0.03461362473375354, 0.33628605047496857, 0.02912945625641476, 0.12889862645409728, 0.028568242242895243, 0.00847919904119313, 0.027511955486054385, -0.050733012336457176, 0.11848080209434315, 0.22155731632506642, 0.15727206453199882, 0.24778236045338814, -0.3555475641571656, -0.21661008665419815, 0.130467614343818, 0.09134777725157792, 0.14599804444706413, -0.014303141001002837, -0.37825004415259966, -0.00618604805388916, -0.1412089882182372, -0.14219473695859172, -0.10102004799837361, 0.025774304150886197, -0.01066896077510305, -0.18814214349887665, 0.11059746976199193, 0.052632189184202156, 0.06569371943613647, 0.0060801836077159195, -0.07514339020714093, -0.031897343143432344, 0.08329500570441971, -0.06421027846716595, 0.01950867781283166, 0.14414557397268465, -0.17677983058554725, -0.13013971658529475, 0.3263283689242624, -0.06413931928287311, -0.1969075701817411, 0.10818864111303048, -0.14938683003866912, -0.024627770265918534, 0.11512182929147018, 0.10298598803562152, 0.08956181999931545, -0.08982951505224428, 0.027256580232146034, -0.05183753169360195, 0.19733000468127254, 0.06092430369584199, 0.15565779892798354, 0.19714001950176688, 0.08289315657231126, 0.09269360969973048, 0.22140077988328014, -0.1723066069620498, -0.12568144676092377, -0.32529047757091434, -0.22215556269467443, -0.274695618814674, 0.054024340832049815, -0.06340113915398196, -0.13644484838253434, 0.4581178252660268, 0.11476363237120732, 0.11249483457680404, 0.0035784143195333076, 0.3141125543837511, 0.18329425612012126, 0.05549256611776525, 0.02867307421261383, 0.3288640923692152, 0.18317362503810694, 0.05661628638301486, -0.29022605043407795, 0.09171574331502214, -0.003032120548285791] |
1,802.10051 | Privacy Preserving Controller Synthesis via Belief Abstraction | Privacy is a crucial concern in many systems in addition to their given
tasks. We consider a new notion of privacy based on beliefs of the system
states, which is closely related to opacity in discrete event systems. To
guarantee the privacy requirement, we propose to abstract the belief space
whose dynamics is shown to be mixed monotone where efficient abstraction
algorithm exists. Based on the abstraction, we propose two different approaches
to synthesize controllers of the system to preserve privacy with an
illustrative example.
| cs.CR cs.SY | privacy is a crucial concern in many systems in addition to their given tasks we consider a new notion of privacy based on beliefs of the system states which is closely related to opacity in discrete event systems to guarantee the privacy requirement we propose to abstract the belief space whose dynamics is shown to be mixed monotone where efficient abstraction algorithm exists based on the abstraction we propose two different approaches to synthesize controllers of the system to preserve privacy with an illustrative example | [['privacy', 'is', 'a', 'crucial', 'concern', 'in', 'many', 'systems', 'in', 'addition', 'to', 'their', 'given', 'tasks', 'we', 'consider', 'a', 'new', 'notion', 'of', 'privacy', 'based', 'on', 'beliefs', 'of', 'the', 'system', 'states', 'which', 'is', 'closely', 'related', 'to', 'opacity', 'in', 'discrete', 'event', 'systems', 'to', 'guarantee', 'the', 'privacy', 'requirement', 'we', 'propose', 'to', 'abstract', 'the', 'belief', 'space', 'whose', 'dynamics', 'is', 'shown', 'to', 'be', 'mixed', 'monotone', 'where', 'efficient', 'abstraction', 'algorithm', 'exists', 'based', 'on', 'the', 'abstraction', 'we', 'propose', 'two', 'different', 'approaches', 'to', 'synthesize', 'controllers', 'of', 'the', 'system', 'to', 'preserve', 'privacy', 'with', 'an', 'illustrative', 'example']] | [-0.14755305117407047, 0.00935812294637264, -0.07733701267125606, 0.09454144310507485, -0.09064396145370077, -0.16680898014456033, 0.036662120455602076, 0.3961366882219034, -0.3078754670041449, -0.31788483531597783, 0.10186913804123726, -0.23475497108062401, -0.16809180161970502, 0.16228551460868296, -0.17847703835543463, 0.1349511003231301, 0.009310114120735841, 0.0754788486780051, -0.023628457449376583, -0.2704950547311455, 0.40047621222979884, 0.021656544440809417, 0.2944567755850799, 0.04009721932165763, 0.13925680755911504, -0.027389597772237134, 0.018607376618584727, -0.00413385091780904, -0.09181805727455546, 0.17791832415044637, 0.31285724311190494, 0.22497850327259478, 0.3524370587485678, -0.42581003989805194, -0.1403454075622208, 0.09871223022175186, 0.11317278498455005, 0.1277494356060154, -0.05019330506432144, -0.2937763502383057, 0.10102196685586344, -0.1631136899594875, -0.06818996209870366, -0.10620348862618866, -0.029187536086229718, -0.0038674736823475753, -0.3021498694420135, -0.028263120983234222, 0.056944516191587725, 0.056069886289975224, -0.04821732606300536, -0.04551355570335599, -0.04181005900232669, 0.09425196304698201, 0.02207804989097092, -0.016736352104036248, 0.12869985428748323, -0.07980101355625425, -0.18051333659712007, 0.3985552277388599, -0.008776211371535765, -0.2463127991951564, 0.2053709252819638, -0.0629379423622809, -0.1919610100743525, 0.09541916705887107, 0.23848077205886298, 0.10960955504766282, -0.16815895577344825, 0.04153004297986627, -0.03176595418549636, 0.2023343483643497, -0.006758187331861871, 0.08575361300917232, 0.14939722303739367, 0.2022710821865236, 0.14633871256579262, 0.1531844599158777, 0.011052702628897832, -0.15379315934637014, -0.25896602655925294, -0.1607137268189998, -0.11648632284144268, 0.0031210748834864183, -0.01607125677195761, -0.19730528997469637, 0.3542514625662828, 0.2378074883017689, 0.20547037279671607, 0.0582404666374821, 0.33055990149184844, 0.1402568214956452, 0.043278009189731056, 0.10198034162578337, 0.1723043203846935, 0.07685590736458407, 0.10787254682029872, -0.16790558507885125, 0.13918125994010444, 0.06144307835630196] |
1,802.10052 | Open source Matrix Product States: Exact diagonalization and other
entanglement-accurate methods revisited in quantum systems | Tensor network methods as presented in our open source Matrix Product States
software have opened up the possibility to study many-body quantum physics in
one and quasi-one-dimensional systems in an easily accessible package similar
to density functional theory codes but for strongly correlated dynamics. Here,
we address methods which allow one to capture the full entanglement without
truncation of the Hilbert space. Such methods are suitable for validation of
and comparisons to tensor network algorithms, but especially useful in the case
of new kinds of quantum states with high entanglement violating the truncation
in tensor networks. Quantum cellular automata are one example for such a
system, characterized by tunable complexity, entanglement, and a large spread
over the Hilbert space. Beyond the evolution of pure states as a closed system,
we adapt the techniques for open quantum systems simulated via the Lindblad
master equation. We present three algorithms for solving closed-system
many-body time evolution without truncation of the Hilbert space. Exact
diagonalization methods have the advantage that they not only keep the full
entanglement but also require no approximations to the propagator. Seeking the
limits of a maximal number of qubits on a single core, we use Trotter
decompositions or Krylov approximation to the exponential of the Hamiltonian.
All three methods are also implemented for open systems represented via the
Lindblad master equation built from local channels. We show their convergence
parameters and focus on efficient schemes for their implementations including
Abelian symmetries, e.g., U(1) symmetry used for number conservation in the
Bose-Hubbard model or discrete Z2 symmetries in the quantum Ising model. We
present the thermalization timescale in the long-range quantum Ising model as a
key example of how exact diagonalization contributes to novel physics.
| cond-mat.quant-gas cond-mat.mtrl-sci physics.comp-ph | tensor network methods as presented in our open source matrix product states software have opened up the possibility to study manybody quantum physics in one and quasionedimensional systems in an easily accessible package similar to density functional theory codes but for strongly correlated dynamics here we address methods which allow one to capture the full entanglement without truncation of the hilbert space such methods are suitable for validation of and comparisons to tensor network algorithms but especially useful in the case of new kinds of quantum states with high entanglement violating the truncation in tensor networks quantum cellular automata are one example for such a system characterized by tunable complexity entanglement and a large spread over the hilbert space beyond the evolution of pure states as a closed system we adapt the techniques for open quantum systems simulated via the lindblad master equation we present three algorithms for solving closedsystem manybody time evolution without truncation of the hilbert space exact diagonalization methods have the advantage that they not only keep the full entanglement but also require no approximations to the propagator seeking the limits of a maximal number of qubits on a single core we use trotter decompositions or krylov approximation to the exponential of the hamiltonian all three methods are also implemented for open systems represented via the lindblad master equation built from local channels we show their convergence parameters and focus on efficient schemes for their implementations including abelian symmetries eg u1 symmetry used for number conservation in the bosehubbard model or discrete z2 symmetries in the quantum ising model we present the thermalization timescale in the longrange quantum ising model as a key example of how exact diagonalization contributes to novel physics | [['tensor', 'network', 'methods', 'as', 'presented', 'in', 'our', 'open', 'source', 'matrix', 'product', 'states', 'software', 'have', 'opened', 'up', 'the', 'possibility', 'to', 'study', 'manybody', 'quantum', 'physics', 'in', 'one', 'and', 'quasionedimensional', 'systems', 'in', 'an', 'easily', 'accessible', 'package', 'similar', 'to', 'density', 'functional', 'theory', 'codes', 'but', 'for', 'strongly', 'correlated', 'dynamics', 'here', 'we', 'address', 'methods', 'which', 'allow', 'one', 'to', 'capture', 'the', 'full', 'entanglement', 'without', 'truncation', 'of', 'the', 'hilbert', 'space', 'such', 'methods', 'are', 'suitable', 'for', 'validation', 'of', 'and', 'comparisons', 'to', 'tensor', 'network', 'algorithms', 'but', 'especially', 'useful', 'in', 'the', 'case', 'of', 'new', 'kinds', 'of', 'quantum', 'states', 'with', 'high', 'entanglement', 'violating', 'the', 'truncation', 'in', 'tensor', 'networks', 'quantum', 'cellular', 'automata', 'are', 'one', 'example', 'for', 'such', 'a', 'system', 'characterized', 'by', 'tunable', 'complexity', 'entanglement', 'and', 'a', 'large', 'spread', 'over', 'the', 'hilbert', 'space', 'beyond', 'the', 'evolution', 'of', 'pure', 'states', 'as', 'a', 'closed', 'system', 'we', 'adapt', 'the', 'techniques', 'for', 'open', 'quantum', 'systems', 'simulated', 'via', 'the', 'lindblad', 'master', 'equation', 'we', 'present', 'three', 'algorithms', 'for', 'solving', 'closedsystem', 'manybody', 'time', 'evolution', 'without', 'truncation', 'of', 'the', 'hilbert', 'space', 'exact', 'diagonalization', 'methods', 'have', 'the', 'advantage', 'that', 'they', 'not', 'only', 'keep', 'the', 'full', 'entanglement', 'but', 'also', 'require', 'no', 'approximations', 'to', 'the', 'propagator', 'seeking', 'the', 'limits', 'of', 'a', 'maximal', 'number', 'of', 'qubits', 'on', 'a', 'single', 'core', 'we', 'use', 'trotter', 'decompositions', 'or', 'krylov', 'approximation', 'to', 'the', 'exponential', 'of', 'the', 'hamiltonian', 'all', 'three', 'methods', 'are', 'also', 'implemented', 'for', 'open', 'systems', 'represented', 'via', 'the', 'lindblad', 'master', 'equation', 'built', 'from', 'local', 'channels', 'we', 'show', 'their', 'convergence', 'parameters', 'and', 'focus', 'on', 'efficient', 'schemes', 'for', 'their', 'implementations', 'including', 'abelian', 'symmetries', 'eg', 'u1', 'symmetry', 'used', 'for', 'number', 'conservation', 'in', 'the', 'bosehubbard', 'model', 'or', 'discrete', 'z2', 'symmetries', 'in', 'the', 'quantum', 'ising', 'model', 'we', 'present', 'the', 'thermalization', 'timescale', 'in', 'the', 'longrange', 'quantum', 'ising', 'model', 'as', 'a', 'key', 'example', 'of', 'how', 'exact', 'diagonalization', 'contributes', 'to', 'novel', 'physics']] | [-0.1224763216377285, 0.11568791437449889, -0.07374048293813279, 0.10056950873777008, -0.019240849392423244, -0.18854881939069743, 0.032362821330152974, 0.35333285547727555, -0.2653289972657436, -0.2664053911310539, 0.10355490961912693, -0.24305565376651653, -0.12782499168002814, 0.20187848755321874, 0.012320664513594749, 0.12310824311223992, 0.07514260561050226, 0.013966970358926214, -0.11190737430996817, -0.2643406631331074, 0.3207397999184762, 0.02046477826508252, 0.2533363171820447, 0.02608453736297394, 0.08575228602511056, 0.011802065274433086, 0.009846493549514236, -0.00913731184851362, -0.11768813510356459, 0.11114053245829908, 0.2674205659267803, 0.1185923457113013, 0.2590648552239464, -0.47076116388238837, -0.22588220325445657, 0.09089690758213564, 0.17528755853964595, 0.174040635227095, -0.02606969713968666, -0.3057249302918647, 0.014028256370179485, -0.2175690686411894, -0.1314984714417318, -0.1532519844319802, -0.011833880193686733, -0.018442878211243897, -0.22651900544991357, 0.06932310103418371, 0.04199392577784397, 0.05665919281289047, -0.03476509818268057, -0.07980766142391714, 0.007634436952669108, 0.13035951779926555, -0.036831273063159496, -0.02042773616451182, 0.11106102331002803, -0.1348603792145456, -0.16324079791329016, 0.3717684720038322, -0.051248565351533326, -0.24528479479057225, 0.20669325967401006, -0.09650225284562462, -0.1569296485237908, 0.09542365329275765, 0.16227984410677954, 0.10542541277725577, -0.14444151599809787, 0.14249088767295082, -0.0071041149875606625, 0.14845135300542767, -0.005922435181574863, 0.09020222238011724, 0.15943904109952742, 0.13318680748670247, 0.07380632708143246, 0.13453049980463427, -0.019346971075885865, -0.17741272364857427, -0.29037757764259975, -0.15725416487589347, -0.21074156459674173, 0.060002037275862355, -0.0756924415544378, -0.18509792044611745, 0.4096319199735789, 0.1565982464623327, 0.14084139135972548, 0.03980326940869226, 0.27667829705761715, 0.11101105807822917, 0.08783808502842459, 0.10394893380567705, 0.18443944316823035, 0.15231030378000518, 0.06098515009303299, -0.25374984989931254, 0.010749128978830158, 0.10123367886418444] |
1,802.10053 | Time regularity of flows of non-Newtonian fluids with critical power-law
growth | We deal with the flows of non-Newtonian fluids in three dimensional setting
subjected to the homogeneous Dirichlet boundary condition. Under the natural
monotonicity, coercivity and growth condition on the Cauchy stress tensor
expressed by a power index $p\ge 11/5$ we establish regularity properties of a
solution with respect to time variable. Consequently, we can use this better
information for showing the uniqueness of the solution provided that the
initial data are good enough for all power--law indexes $p\ge 11/5$. Such a
result was available for $p\ge 12/5$ and therefore the paper fills the gap and
extends the uniqueness result to the whole range of $p$'s for which the energy
equality holds.
| math.AP | we deal with the flows of nonnewtonian fluids in three dimensional setting subjected to the homogeneous dirichlet boundary condition under the natural monotonicity coercivity and growth condition on the cauchy stress tensor expressed by a power index pge 115 we establish regularity properties of a solution with respect to time variable consequently we can use this better information for showing the uniqueness of the solution provided that the initial data are good enough for all powerlaw indexes pge 115 such a result was available for pge 125 and therefore the paper fills the gap and extends the uniqueness result to the whole range of ps for which the energy equality holds | [['we', 'deal', 'with', 'the', 'flows', 'of', 'nonnewtonian', 'fluids', 'in', 'three', 'dimensional', 'setting', 'subjected', 'to', 'the', 'homogeneous', 'dirichlet', 'boundary', 'condition', 'under', 'the', 'natural', 'monotonicity', 'coercivity', 'and', 'growth', 'condition', 'on', 'the', 'cauchy', 'stress', 'tensor', 'expressed', 'by', 'a', 'power', 'index', 'pge', '115', 'we', 'establish', 'regularity', 'properties', 'of', 'a', 'solution', 'with', 'respect', 'to', 'time', 'variable', 'consequently', 'we', 'can', 'use', 'this', 'better', 'information', 'for', 'showing', 'the', 'uniqueness', 'of', 'the', 'solution', 'provided', 'that', 'the', 'initial', 'data', 'are', 'good', 'enough', 'for', 'all', 'powerlaw', 'indexes', 'pge', '115', 'such', 'a', 'result', 'was', 'available', 'for', 'pge', '125', 'and', 'therefore', 'the', 'paper', 'fills', 'the', 'gap', 'and', 'extends', 'the', 'uniqueness', 'result', 'to', 'the', 'whole', 'range', 'of', 'ps', 'for', 'which', 'the', 'energy', 'equality', 'holds']] | [-0.1308232283823796, 0.08232836706484123, -0.08455646291232526, 0.055997984252056224, -0.06468722160679062, -0.14054123491367643, -0.004994854208308499, 0.32838434316133996, -0.2812056478431767, -0.30264890942196065, 0.14856619734279308, -0.2516902479896876, -0.06333993900533733, 0.17880247387330275, -0.07341540988895472, 0.10144762705743045, 0.06732734979910625, 0.04345521585059327, -0.05896179875367329, -0.23325196656960626, 0.3361768821193543, 0.013162873173552053, 0.2813356667421423, 0.09153503316049758, 0.07984288232304, 0.011793897829127606, 0.021997671360401688, 0.03298845992901841, -0.2229735545653704, 0.09478010473665907, 0.22059420219345674, 0.06940404467519608, 0.26561937322588386, -0.38307014674258727, -0.21098262946717106, 0.13164046016597264, 0.07250536367011902, 0.01850059677884486, -0.0473926381033904, -0.2309475047639697, 0.14928845613817307, -0.1295451371603318, -0.19437752913700435, -0.06628159908493897, 0.006377094752482466, 0.038440517144097304, -0.3611276251817676, 0.1598314718964199, 0.12840668617974263, 0.053451374601069336, -0.1873945215893154, -0.08311971008089615, -0.014197463694087288, 0.08167058682941773, 0.07727750075293018, -0.003728330652397294, 0.04394615088329391, -0.11942396847289193, -0.041521864225836216, 0.3521741678569097, -0.07953157071821257, -0.2091444558589845, 0.19386058733253195, -0.14077221797275785, -0.11403373385116726, 0.09948941384366639, 0.1316967100106381, 0.11106256712731477, -0.12852536984887142, 0.11436449559164225, -0.059112086849127735, 0.1791817814296296, 0.13663000133106704, -0.005672716300699625, 0.1090932785457856, 0.12912921066320426, 0.1142932760554391, 0.16713096365030553, -0.03892369196553052, -0.05981045371752132, -0.3396881927425663, -0.19955293833789928, -0.1783899700967595, 0.09330507080901314, -0.14792405773200165, -0.13287704823085586, 0.3806791072291834, 0.12167355157424452, 0.1668493038401016, 0.11284947425634642, 0.20193255493450943, 0.12075611465686076, 0.023181453535987717, 0.11275297574497559, 0.20979288715328015, 0.15528954606427736, 0.17448362231418188, -0.14260277335389374, 0.058787187200610165, 0.04902418840861133] |
1,802.10054 | Domain Modelling in Computational Persuasion for Behaviour Change in
Healthcare | The aim of behaviour change is to help people to change aspects of their
behaviour for the better (e.g., to decrease calorie intake, to drink in
moderation, to take more exercise, to complete a course of antibiotics once
started, etc.). In current persuasion technology for behaviour change, the
emphasis is on helping people to explore their issues (e.g., through
questionnaires or game playing) or to remember to follow a behaviour change
plan (e.g., diaries and email reminders). However, recent developments in
computational persuasion are leading to an argument-centric approach to
persuasion that can potentially be harnessed in behaviour change applications.
In this paper, we review developments in computational persuasion, and then
focus on domain modelling as a key component. We present a multi-dimensional
approach to domain modelling. At the core of this proposal is an ontology which
provides a representation of key factors, in particular kinds of belief, which
we have identified in the behaviour change literature as being important in
diverse behaviour change initiatives. Our proposal for domain modelling is
intended to facilitate the acquisition and representation of the arguments that
can be used in persuasion dialogues, together with meta-level information about
them which can be used by the persuader to make strategic choices of argument
to present.
| cs.AI | the aim of behaviour change is to help people to change aspects of their behaviour for the better eg to decrease calorie intake to drink in moderation to take more exercise to complete a course of antibiotics once started etc in current persuasion technology for behaviour change the emphasis is on helping people to explore their issues eg through questionnaires or game playing or to remember to follow a behaviour change plan eg diaries and email reminders however recent developments in computational persuasion are leading to an argumentcentric approach to persuasion that can potentially be harnessed in behaviour change applications in this paper we review developments in computational persuasion and then focus on domain modelling as a key component we present a multidimensional approach to domain modelling at the core of this proposal is an ontology which provides a representation of key factors in particular kinds of belief which we have identified in the behaviour change literature as being important in diverse behaviour change initiatives our proposal for domain modelling is intended to facilitate the acquisition and representation of the arguments that can be used in persuasion dialogues together with metalevel information about them which can be used by the persuader to make strategic choices of argument to present | [['the', 'aim', 'of', 'behaviour', 'change', 'is', 'to', 'help', 'people', 'to', 'change', 'aspects', 'of', 'their', 'behaviour', 'for', 'the', 'better', 'eg', 'to', 'decrease', 'calorie', 'intake', 'to', 'drink', 'in', 'moderation', 'to', 'take', 'more', 'exercise', 'to', 'complete', 'a', 'course', 'of', 'antibiotics', 'once', 'started', 'etc', 'in', 'current', 'persuasion', 'technology', 'for', 'behaviour', 'change', 'the', 'emphasis', 'is', 'on', 'helping', 'people', 'to', 'explore', 'their', 'issues', 'eg', 'through', 'questionnaires', 'or', 'game', 'playing', 'or', 'to', 'remember', 'to', 'follow', 'a', 'behaviour', 'change', 'plan', 'eg', 'diaries', 'and', 'email', 'reminders', 'however', 'recent', 'developments', 'in', 'computational', 'persuasion', 'are', 'leading', 'to', 'an', 'argumentcentric', 'approach', 'to', 'persuasion', 'that', 'can', 'potentially', 'be', 'harnessed', 'in', 'behaviour', 'change', 'applications', 'in', 'this', 'paper', 'we', 'review', 'developments', 'in', 'computational', 'persuasion', 'and', 'then', 'focus', 'on', 'domain', 'modelling', 'as', 'a', 'key', 'component', 'we', 'present', 'a', 'multidimensional', 'approach', 'to', 'domain', 'modelling', 'at', 'the', 'core', 'of', 'this', 'proposal', 'is', 'an', 'ontology', 'which', 'provides', 'a', 'representation', 'of', 'key', 'factors', 'in', 'particular', 'kinds', 'of', 'belief', 'which', 'we', 'have', 'identified', 'in', 'the', 'behaviour', 'change', 'literature', 'as', 'being', 'important', 'in', 'diverse', 'behaviour', 'change', 'initiatives', 'our', 'proposal', 'for', 'domain', 'modelling', 'is', 'intended', 'to', 'facilitate', 'the', 'acquisition', 'and', 'representation', 'of', 'the', 'arguments', 'that', 'can', 'be', 'used', 'in', 'persuasion', 'dialogues', 'together', 'with', 'metalevel', 'information', 'about', 'them', 'which', 'can', 'be', 'used', 'by', 'the', 'persuader', 'to', 'make', 'strategic', 'choices', 'of', 'argument', 'to', 'present']] | [-0.05949426965749948, 0.058593533206826226, -0.12733537764422811, 0.06682677247702556, -0.17680798120608626, -0.11794166707281525, 0.08707461184698892, 0.40544843174463424, -0.25036880580927784, -0.33790746388527065, 0.12364433120707802, -0.2840733849712146, -0.16444471213169612, 0.16677789415832825, -0.15049091423861682, -0.006785427313074111, 0.03960124842426292, 0.052301284622024886, -0.014444369008952681, -0.26740465503490457, 0.30276425915340394, 0.06639671274919798, 0.28779920714441687, 0.07290132095491011, 0.041804431355978104, 0.016926895522584137, -0.047498080063703055, 0.008588682876926703, -0.10685106454890886, 0.16114289185218064, 0.3446535670317154, 0.1899450781482021, 0.3470966610744094, -0.4617270800428322, -0.22032513156927264, 0.08891093536378601, 0.1528516087638099, 0.1006664759843261, -0.005447711856924378, -0.28070237315618074, 0.07698241766928941, -0.20332813836061037, -0.1272391082804041, -0.09909486612573695, 0.019991116495265696, 0.012616604594558548, -0.23054223525552794, 0.0020514842964565526, 0.056913829959320046, 0.09078657551659629, -0.008045312994699298, -0.07614132876131827, 0.04580094389362225, 0.22020762118448217, 0.10294674279374214, 0.029084815868862697, 0.15794785447696297, -0.17892547009306817, -0.13460294759715907, 0.3789969010070378, -0.029942339999252, -0.1927532865460867, 0.200017945205148, -0.09374977209685872, -0.15118796770380308, 0.06087007088185951, 0.24023074278822884, 0.07282410675403438, -0.15981455374724016, -0.014966897087455995, 0.041550683115089596, 0.16596048785980272, 0.028758613951280355, 0.0153299839288453, 0.22639347843673582, 0.1921144019926522, 0.03291250181511994, 0.10893026785085497, 0.009049326889838154, -0.12658191176748146, -0.24240982241015166, -0.16111875333277006, -0.1108458566808482, 0.0453199711997653, -0.01086761992708209, -0.13813483046956557, 0.3699714874383062, 0.21555681190623616, 0.16624045087911116, 0.0038427027124306244, 0.2701250214416247, 0.05950885341007961, 0.06434813167907823, 0.013677834245474795, 0.18498776391676913, 0.02735958475946413, 0.18175651864797915, -0.17999676086317498, 0.15224425958373244, -0.006427810515071122] |
1,802.10055 | A Mathematical Framework for Deep Learning in Elastic Source Imaging | An inverse elastic source problem with sparse measurements is of concern. A
generic mathematical framework is proposed which incorporates a low-
dimensional manifold regularization in the conventional source reconstruction
algorithms thereby enhancing their performance with sparse datasets. It is
rigorously established that the proposed framework is equivalent to the
so-called \emph{deep convolutional framelet expansion} in machine learning
literature for inverse problems. Apposite numerical examples are furnished to
substantiate the efficacy of the proposed framework.
| math.OC cs.CV cs.LG | an inverse elastic source problem with sparse measurements is of concern a generic mathematical framework is proposed which incorporates a low dimensional manifold regularization in the conventional source reconstruction algorithms thereby enhancing their performance with sparse datasets it is rigorously established that the proposed framework is equivalent to the socalled emphdeep convolutional framelet expansion in machine learning literature for inverse problems apposite numerical examples are furnished to substantiate the efficacy of the proposed framework | [['an', 'inverse', 'elastic', 'source', 'problem', 'with', 'sparse', 'measurements', 'is', 'of', 'concern', 'a', 'generic', 'mathematical', 'framework', 'is', 'proposed', 'which', 'incorporates', 'a', 'low', 'dimensional', 'manifold', 'regularization', 'in', 'the', 'conventional', 'source', 'reconstruction', 'algorithms', 'thereby', 'enhancing', 'their', 'performance', 'with', 'sparse', 'datasets', 'it', 'is', 'rigorously', 'established', 'that', 'the', 'proposed', 'framework', 'is', 'equivalent', 'to', 'the', 'socalled', 'emphdeep', 'convolutional', 'framelet', 'expansion', 'in', 'machine', 'learning', 'literature', 'for', 'inverse', 'problems', 'apposite', 'numerical', 'examples', 'are', 'furnished', 'to', 'substantiate', 'the', 'efficacy', 'of', 'the', 'proposed', 'framework']] | [-0.04912273877778569, -0.026615932855772396, -0.06575798481149045, 0.0756828721071518, -0.12353311822359525, -0.16920902333348184, -0.03794124410991129, 0.41213565342430325, -0.29206120381383477, -0.26171271475912955, 0.13524861551657621, -0.2568817882848954, -0.21391576680833022, 0.2115098925911494, -0.11652655275286855, 0.14578954022176363, 0.10553569841274135, 0.007345783071139375, -0.08309070836135966, -0.2717825022928819, 0.301284272617006, 0.10091391045952568, 0.3805008416340963, 0.05546235703435298, 0.17081725516834775, -0.01997140491683338, -0.027287021490141145, 0.01851158567729431, -0.05403399303906701, 0.17370971396244508, 0.32292988511255466, 0.17529020569211728, 0.33071518062639077, -0.3675963660400059, -0.27114790962455243, 0.07436434975258906, 0.1352723689837935, 0.08102471866614241, -0.06171454136838784, -0.3046077948718055, 0.12013299863571553, -0.14851646523960438, -0.07473280462373451, -0.14563955069595091, -0.050752380346829024, -0.056820673339471627, -0.3306317558965167, 0.073589342709228, 0.07337115295986468, 0.018072423399300187, -0.07853900320116884, -0.11473718311990032, 0.09245253079004485, 0.07503654089177379, 0.05437694388013836, 0.02099808827168434, 0.09889544811527673, -0.11992584464167373, -0.15093735837050387, 0.3303300238755607, -0.027203007113515726, -0.2520244041162014, 0.17957156583842998, 0.012786620346879636, -0.12332857480096454, 0.1459306470886175, 0.1910942111579651, 0.11750994023640414, -0.16479000562449564, 0.11539669770698655, -0.05911333032889996, 0.11997436681711995, -0.0021334893032405023, -0.0279887227807194, 0.10361795833749646, 0.24672295471552658, 0.033746049298930006, 0.16208134257907955, -0.08135477977024543, -0.11075067544053938, -0.2649724811592416, -0.07639673698341122, -0.21560424883422014, -0.05370074781161305, -0.13623253288175408, -0.16455248602968012, 0.35783203209221764, 0.1597108289786627, 0.1442548775969929, 0.08297817886184045, 0.3628827540858372, 0.10391911049845402, 0.06412809621228056, 0.10424437322276267, 0.22287068779366342, 0.16113980641789935, 0.09223240548493089, -0.21121099647889668, 0.036254241458467534, 0.10493547517202191] |
1,802.10056 | Experimental study of nonclassical teleportation beyond average fidelity | Quantum teleportation establishes a correspondence between an entangled state
shared by two separate par- ties that can communicate classically and the
presence of a quantum channel connecting the two parties. The standard
benchmark for quantum teleportation, based on the average fidelity between the
input and output states, indicates that some entangled states do not lead to
channels which can be certified to be quantum. It was re- cently shown that if
one considers a finer-tuned witness, then all entangled states can be certified
to produce a non-classical teleportation channel. Here we experimentally
demonstrate a complete characterization of a new family of such witnesses, of
the type proposed in Phys. Rev. Lett. 119, 110501 (2017) under different con-
ditions of noise. Furthermore, we show non-classical teleportation using
quantum states that can not achieve average teleportation fidelity above the
classical limit. Our results have fundamental implications in quantum
information protocols and may also lead to new applications and quality
certification of quantum technologies.
| quant-ph | quantum teleportation establishes a correspondence between an entangled state shared by two separate par ties that can communicate classically and the presence of a quantum channel connecting the two parties the standard benchmark for quantum teleportation based on the average fidelity between the input and output states indicates that some entangled states do not lead to channels which can be certified to be quantum it was re cently shown that if one considers a finertuned witness then all entangled states can be certified to produce a nonclassical teleportation channel here we experimentally demonstrate a complete characterization of a new family of such witnesses of the type proposed in phys rev lett 119 110501 2017 under different con ditions of noise furthermore we show nonclassical teleportation using quantum states that can not achieve average teleportation fidelity above the classical limit our results have fundamental implications in quantum information protocols and may also lead to new applications and quality certification of quantum technologies | [['quantum', 'teleportation', 'establishes', 'a', 'correspondence', 'between', 'an', 'entangled', 'state', 'shared', 'by', 'two', 'separate', 'par', 'ties', 'that', 'can', 'communicate', 'classically', 'and', 'the', 'presence', 'of', 'a', 'quantum', 'channel', 'connecting', 'the', 'two', 'parties', 'the', 'standard', 'benchmark', 'for', 'quantum', 'teleportation', 'based', 'on', 'the', 'average', 'fidelity', 'between', 'the', 'input', 'and', 'output', 'states', 'indicates', 'that', 'some', 'entangled', 'states', 'do', 'not', 'lead', 'to', 'channels', 'which', 'can', 'be', 'certified', 'to', 'be', 'quantum', 'it', 'was', 're', 'cently', 'shown', 'that', 'if', 'one', 'considers', 'a', 'finertuned', 'witness', 'then', 'all', 'entangled', 'states', 'can', 'be', 'certified', 'to', 'produce', 'a', 'nonclassical', 'teleportation', 'channel', 'here', 'we', 'experimentally', 'demonstrate', 'a', 'complete', 'characterization', 'of', 'a', 'new', 'family', 'of', 'such', 'witnesses', 'of', 'the', 'type', 'proposed', 'in', 'phys', 'rev', 'lett', '119', '110501', '2017', 'under', 'different', 'con', 'ditions', 'of', 'noise', 'furthermore', 'we', 'show', 'nonclassical', 'teleportation', 'using', 'quantum', 'states', 'that', 'can', 'not', 'achieve', 'average', 'teleportation', 'fidelity', 'above', 'the', 'classical', 'limit', 'our', 'results', 'have', 'fundamental', 'implications', 'in', 'quantum', 'information', 'protocols', 'and', 'may', 'also', 'lead', 'to', 'new', 'applications', 'and', 'quality', 'certification', 'of', 'quantum', 'technologies']] | [-0.1306904672550445, 0.18096724544384415, -0.10575205125642242, 0.02430189817387145, -0.0001443050103262067, -0.2367814588913461, 0.08701168940315256, 0.362995853490429, -0.23240598593838513, -0.28420414769207125, 0.017115648145409067, -0.24326405721949412, -0.13538149097003044, 0.26271679236451745, -0.12461121345695574, 0.11653756157902535, 0.08701233472675085, 0.029638536320999265, -0.04389776224270463, -0.2863036559036118, 0.2514233244990464, 0.011060614941379754, 0.3332000381225953, 0.08354893080650072, 0.08661291856114986, -0.009005894910660572, 0.07143916283530416, -0.010052414001256694, -0.10211963142301102, 0.08161955839314032, 0.2873812053803704, 0.16798820252006408, 0.25947271392215043, -0.4082805878832005, -0.21627073743147776, 0.12320493390434421, 0.09400006515206769, 0.1768483176092559, -0.0049271796691755295, -0.3641925397911109, 0.06428592026786646, -0.20952006339794024, -0.031986736805993135, -0.1350164426898118, -0.018434186140075325, -0.03955046301707625, -0.28577519261452833, 0.0939840624383578, 0.04785346824064618, 0.007447829958982766, 0.044119293821859175, -0.024634239813894964, -0.006012118743092288, 0.11869038045988418, -0.12327546009764774, -0.004827573839429533, 0.10678207443270367, -0.11772339107410516, -0.24426667552033904, 0.30096013607217176, -0.028653913042217028, -0.20218640665989368, 0.20570290838732036, -0.07423508889914956, -0.12094769511404593, 0.03864694655057974, 0.15042620525928213, 0.09402766962302848, -0.12671301960363052, 0.021724036788509694, -0.06567330685793422, 0.2378230821224861, 0.10580342080793344, 0.17427398512954823, 0.17962062173028243, 0.03929321223986335, 0.06118663670786191, 0.17251959566419828, -0.05662730903040938, -0.1603713313314074, -0.3205973376519978, -0.25940286288387143, -0.2391480274796777, 0.11660500968155248, -0.02129127193002205, -0.09588404678997904, 0.38324068578658627, 0.1669530620234582, 0.15310987352277153, -0.005714335664379178, 0.24275254068197682, 0.06927040383743588, 0.012896823813207448, 0.1378426145936828, 0.29222214115816314, 0.14537099634035258, 0.034345795240369625, -0.20308480132953263, 0.08183037819690071, -0.0025666806381195784] |
1,802.10057 | Wave equations with initial data on compact Cauchy horizons | We study the following problem: Given initial data on a compact Cauchy
horizon, does there exist a unique solution to wave equations on the globally
hyperbolic region? Our main results apply to any spacetime satisfying the null
energy condition and containing a compact Cauchy horizon with surface gravity
that can be normalised to a non-zero constant. Examples include the Misner
spacetime and the Taub-NUT spacetime. We prove an energy estimate close to the
Cauchy horizon for wave equations acting on sections of vector bundles. Using
this estimate we prove that if a linear wave equation can be solved up to any
order at the Cauchy horizon, then there exists a unique solution on the
globally hyperbolic region. As a consequence, we prove several existence and
uniqueness results for linear and non-linear wave equations without assuming
analyticity or symmetry of the spacetime and without assuming that the
generators close. We overcome in particular the essential remaining difficulty
in proving that vacuum spacetimes with a compact Cauchy horizon with constant
non-zero surface gravity necessarily admits a Killing vector field. This work
is therefore related to the strong cosmic censorship conjecture.
| math.AP math-ph math.DG math.MP | we study the following problem given initial data on a compact cauchy horizon does there exist a unique solution to wave equations on the globally hyperbolic region our main results apply to any spacetime satisfying the null energy condition and containing a compact cauchy horizon with surface gravity that can be normalised to a nonzero constant examples include the misner spacetime and the taubnut spacetime we prove an energy estimate close to the cauchy horizon for wave equations acting on sections of vector bundles using this estimate we prove that if a linear wave equation can be solved up to any order at the cauchy horizon then there exists a unique solution on the globally hyperbolic region as a consequence we prove several existence and uniqueness results for linear and nonlinear wave equations without assuming analyticity or symmetry of the spacetime and without assuming that the generators close we overcome in particular the essential remaining difficulty in proving that vacuum spacetimes with a compact cauchy horizon with constant nonzero surface gravity necessarily admits a killing vector field this work is therefore related to the strong cosmic censorship conjecture | [['we', 'study', 'the', 'following', 'problem', 'given', 'initial', 'data', 'on', 'a', 'compact', 'cauchy', 'horizon', 'does', 'there', 'exist', 'a', 'unique', 'solution', 'to', 'wave', 'equations', 'on', 'the', 'globally', 'hyperbolic', 'region', 'our', 'main', 'results', 'apply', 'to', 'any', 'spacetime', 'satisfying', 'the', 'null', 'energy', 'condition', 'and', 'containing', 'a', 'compact', 'cauchy', 'horizon', 'with', 'surface', 'gravity', 'that', 'can', 'be', 'normalised', 'to', 'a', 'nonzero', 'constant', 'examples', 'include', 'the', 'misner', 'spacetime', 'and', 'the', 'taubnut', 'spacetime', 'we', 'prove', 'an', 'energy', 'estimate', 'close', 'to', 'the', 'cauchy', 'horizon', 'for', 'wave', 'equations', 'acting', 'on', 'sections', 'of', 'vector', 'bundles', 'using', 'this', 'estimate', 'we', 'prove', 'that', 'if', 'a', 'linear', 'wave', 'equation', 'can', 'be', 'solved', 'up', 'to', 'any', 'order', 'at', 'the', 'cauchy', 'horizon', 'then', 'there', 'exists', 'a', 'unique', 'solution', 'on', 'the', 'globally', 'hyperbolic', 'region', 'as', 'a', 'consequence', 'we', 'prove', 'several', 'existence', 'and', 'uniqueness', 'results', 'for', 'linear', 'and', 'nonlinear', 'wave', 'equations', 'without', 'assuming', 'analyticity', 'or', 'symmetry', 'of', 'the', 'spacetime', 'and', 'without', 'assuming', 'that', 'the', 'generators', 'close', 'we', 'overcome', 'in', 'particular', 'the', 'essential', 'remaining', 'difficulty', 'in', 'proving', 'that', 'vacuum', 'spacetimes', 'with', 'a', 'compact', 'cauchy', 'horizon', 'with', 'constant', 'nonzero', 'surface', 'gravity', 'necessarily', 'admits', 'a', 'killing', 'vector', 'field', 'this', 'work', 'is', 'therefore', 'related', 'to', 'the', 'strong', 'cosmic', 'censorship', 'conjecture']] | [-0.18141770263653287, 0.08688429521529581, -0.08388375331390094, 0.09347436035440819, -0.14201415269363157, -0.12516373847462633, -0.03952232089408852, 0.3037787822342696, -0.24647748999872265, -0.20739700231314737, 0.16232961885543773, -0.28717066668979624, -0.11946424071743907, 0.17978768769349468, -0.060302951762346214, 0.06484785481811838, 0.059749375795945525, 0.0742516135846443, -0.11487385634570679, -0.2189158405724695, 0.43308209387605334, 0.011895911235540629, 0.23728833373814345, 0.07597428072055683, 0.19718931453919256, -0.001156824440299038, 0.029201300876670853, 0.06457060944051185, -0.1784411294683331, 0.03775779990927673, 0.24629265937008002, 0.11931654761986252, 0.2441155181492077, -0.4279385232168468, -0.22465525999259045, 0.17184817774389732, 0.12520588785806236, 0.12511008201870433, -0.0842189748079189, -0.3001908467527717, 0.12285906560917167, -0.1014015559748588, -0.24343557263466906, -0.05420305104084075, 0.02007149510454644, -0.02564600471560744, -0.24606538762120492, 0.08125083269848626, 0.09400172934352242, -0.03289145426923766, -0.17638348030332635, -0.0021811707680326627, -0.045740338950170246, 0.04582459737541788, 0.11090443219910277, 0.059743878165349124, 0.05058385939845082, -0.07911360563531994, -0.08681731205928991, 0.3364938820930237, -0.10275424494559163, -0.2940444549981584, 0.13565627428668334, -0.18401741517764675, -0.09850393137349649, 0.12495943377639088, 0.1777566572430821, 0.1528433310561516, -0.10570936148213421, 0.16276171559095134, -0.07325683350574493, 0.1634487062890796, 0.15073738289759198, -0.017756964406989355, 0.22573524085864266, 0.07564585501243895, 0.14751275865598878, 0.09733288962904245, -0.02127918406350023, -0.08090149369332296, -0.42443877290141707, -0.18763066622387728, -0.1596495774376424, 0.14171813880780743, -0.13260076616782673, -0.20986791622473244, 0.30824282331184105, 0.09664375039202686, 0.1509877213659607, 0.0918782694027462, 0.2286362299426865, 0.14452682921670357, 0.0338884084460702, 0.17171843079206078, 0.2306959499664446, 0.13558844901234943, 0.08369295083808694, -0.19207656519466446, -0.02447285478379815, 0.10301067857963449] |
1,802.10058 | Effect of Transducer Positioning in Active Noise Control | Research in traditional Active Noise Control(ANC) often abstracts acoustic
channels with band-limited filter coefficients. This is a limitation in
exploring structural and positional aspects of ANC. As a solution to this, we
propose the use of room acoustic models in ANC research. As a use case, we
demonstrate anti-noise source position optimization using room acoustics models
in achieving better noise control. Using numerical simulations, we show that
level of cancellation can be improved up to 7.34 dB. All the codes and results
are available in the Github repository https://github.com/cksajil/ancram in the
spirit of reproducible research.
| cs.SD eess.AS | research in traditional active noise controlanc often abstracts acoustic channels with bandlimited filter coefficients this is a limitation in exploring structural and positional aspects of anc as a solution to this we propose the use of room acoustic models in anc research as a use case we demonstrate antinoise source position optimization using room acoustics models in achieving better noise control using numerical simulations we show that level of cancellation can be improved up to 734 db all the codes and results are available in the github repository httpsgithubcomcksajilancram in the spirit of reproducible research | [['research', 'in', 'traditional', 'active', 'noise', 'controlanc', 'often', 'abstracts', 'acoustic', 'channels', 'with', 'bandlimited', 'filter', 'coefficients', 'this', 'is', 'a', 'limitation', 'in', 'exploring', 'structural', 'and', 'positional', 'aspects', 'of', 'anc', 'as', 'a', 'solution', 'to', 'this', 'we', 'propose', 'the', 'use', 'of', 'room', 'acoustic', 'models', 'in', 'anc', 'research', 'as', 'a', 'use', 'case', 'we', 'demonstrate', 'antinoise', 'source', 'position', 'optimization', 'using', 'room', 'acoustics', 'models', 'in', 'achieving', 'better', 'noise', 'control', 'using', 'numerical', 'simulations', 'we', 'show', 'that', 'level', 'of', 'cancellation', 'can', 'be', 'improved', 'up', 'to', '734', 'db', 'all', 'the', 'codes', 'and', 'results', 'are', 'available', 'in', 'the', 'github', 'repository', 'httpsgithubcomcksajilancram', 'in', 'the', 'spirit', 'of', 'reproducible', 'research']] | [-0.1006170090247867, 0.0439795668722601, -0.05831750292050582, 0.01670401345472783, -0.08126643265006683, -0.14474769932548365, 0.06219711212781809, 0.4377933815922788, -0.2726857801436156, -0.30914824992738743, 0.11197739915521089, -0.28975867394418003, -0.18399466190647373, 0.24006355083197034, -0.09913049056445078, 0.0769151984463616, 0.08707858673146655, 0.0008872574125166221, -0.07210327413493908, -0.24406405868789843, 0.2165291108221056, 0.13213862568861054, 0.3421581684741923, 0.04368056090528606, 0.0960658940396482, -0.04112103551886575, -0.0296749003301625, -0.018938844390113348, -0.09854009583373667, 0.12272105810623016, 0.3532607706088569, 0.12527531445006368, 0.2736010945912811, -0.36871862541746486, -0.2685165704273048, 0.029319354017535524, 0.14710648453003297, 0.1710695199147668, -0.06994209740991875, -0.26401713005547484, 0.10743015200420412, -0.16520890504402178, -0.048664138697448275, -0.09162236168800343, -0.06409624250986243, 0.018592107894590065, -0.2543463232997124, 0.08172653038655558, 0.05233481924940822, 0.10583804843206239, -0.058680375301910025, -0.1637597909317382, 0.06801144232703073, 0.16515214421025287, 0.0025172263912115527, 0.0205495727804905, 0.12299614032337403, -0.13961525277925596, -0.1406035686652827, 0.37586846863550527, -0.09266076844075434, -0.2078432798565876, 0.16979526994769933, -0.09586794808587079, -0.09492517473496577, 0.08925935879389765, 0.22166876712193093, 0.09062370665932215, -0.18971554490347062, 0.06142644070324198, -0.006518134937411354, 0.22541450727130136, 0.09184652149817475, 0.04876209352846428, 0.13954504783345406, 0.1980629341216177, 0.03520370809040883, 0.17720800828093522, -0.10555070103897203, -0.029398569650697693, -0.2646285020796362, -0.09088870317184476, -0.14061678393859095, 0.020037891021529114, -0.04147560640096774, -0.1358186108415686, 0.3753193961356276, 0.22840733228812135, 0.14261458240329258, 0.014077017143849404, 0.34524192953337063, 0.056899415342868256, 0.07022819108760325, 0.1156334074224115, 0.2291072204618925, 0.08242636214020432, 0.11131398006671256, -0.1685272687194889, 0.025137816225328753, -0.0035426769786143816] |
1,802.10059 | Vector field controlled vortex lattice symmetry in LiFeAs | We utilize a combination of vector magnetic field and scanning tunneling
microscopy to elucidate the 3D field-based electronic phase diagram of a
correlated iron-based superconductor, LiFeAs. We observe, under a
zero-field-cooled method, an ordered hexagonal vortex lattice ground-state in
contrast to the disordered lattice observed under a field-cooled method. It
transforms into a four-fold-symmetric state by increasing c-axis field and
distorts elliptically upon tilting the field in-plane. The vortex lattice
transformations correlate with the field dependent superconducting gap that
characterizes the Cooper pairing strength. The anisotropy of the vortex lattice
agrees with the field enhanced Bogoliubov quasiparticle scattering channel that
is determined by the pairing symmetry with respect to its Fermi surface
structure. Our systematic tuning of the vortex lattice symmetry and study of
its correlation with Cooper pairing demonstrates the many-body interplay
between the superconducting order parameter and emergent vortex matter.
| cond-mat.supr-con | we utilize a combination of vector magnetic field and scanning tunneling microscopy to elucidate the 3d fieldbased electronic phase diagram of a correlated ironbased superconductor lifeas we observe under a zerofieldcooled method an ordered hexagonal vortex lattice groundstate in contrast to the disordered lattice observed under a fieldcooled method it transforms into a fourfoldsymmetric state by increasing caxis field and distorts elliptically upon tilting the field inplane the vortex lattice transformations correlate with the field dependent superconducting gap that characterizes the cooper pairing strength the anisotropy of the vortex lattice agrees with the field enhanced bogoliubov quasiparticle scattering channel that is determined by the pairing symmetry with respect to its fermi surface structure our systematic tuning of the vortex lattice symmetry and study of its correlation with cooper pairing demonstrates the manybody interplay between the superconducting order parameter and emergent vortex matter | [['we', 'utilize', 'a', 'combination', 'of', 'vector', 'magnetic', 'field', 'and', 'scanning', 'tunneling', 'microscopy', 'to', 'elucidate', 'the', '3d', 'fieldbased', 'electronic', 'phase', 'diagram', 'of', 'a', 'correlated', 'ironbased', 'superconductor', 'lifeas', 'we', 'observe', 'under', 'a', 'zerofieldcooled', 'method', 'an', 'ordered', 'hexagonal', 'vortex', 'lattice', 'groundstate', 'in', 'contrast', 'to', 'the', 'disordered', 'lattice', 'observed', 'under', 'a', 'fieldcooled', 'method', 'it', 'transforms', 'into', 'a', 'fourfoldsymmetric', 'state', 'by', 'increasing', 'caxis', 'field', 'and', 'distorts', 'elliptically', 'upon', 'tilting', 'the', 'field', 'inplane', 'the', 'vortex', 'lattice', 'transformations', 'correlate', 'with', 'the', 'field', 'dependent', 'superconducting', 'gap', 'that', 'characterizes', 'the', 'cooper', 'pairing', 'strength', 'the', 'anisotropy', 'of', 'the', 'vortex', 'lattice', 'agrees', 'with', 'the', 'field', 'enhanced', 'bogoliubov', 'quasiparticle', 'scattering', 'channel', 'that', 'is', 'determined', 'by', 'the', 'pairing', 'symmetry', 'with', 'respect', 'to', 'its', 'fermi', 'surface', 'structure', 'our', 'systematic', 'tuning', 'of', 'the', 'vortex', 'lattice', 'symmetry', 'and', 'study', 'of', 'its', 'correlation', 'with', 'cooper', 'pairing', 'demonstrates', 'the', 'manybody', 'interplay', 'between', 'the', 'superconducting', 'order', 'parameter', 'and', 'emergent', 'vortex', 'matter']] | [-0.2388180108028398, 0.26356601300791765, -0.08487936438239635, 0.04459871636812595, -0.09187312765667836, -0.13688676355485904, 0.09939117231596169, 0.41401832446403114, -0.2776342786993858, -0.23479323784518552, -0.06973783745255374, -0.28785957220994624, -0.12437805745763876, 0.13729793543379146, 0.07396029977042043, 0.017603762703782593, -0.0540740844225577, -0.01906430620224552, -0.16172544618553303, -0.23600295596055898, 0.36201633325388244, 0.00845122027891219, 0.41861325197569127, 0.06334505572581518, 0.04192575395226161, 0.0684280520278617, 0.09895341184835696, 0.04632799213435104, -0.1779496753065069, 0.06258911928095927, 0.1956832336711017, -0.13500026469482174, 0.12173750011930705, -0.4452714546854403, -0.2042802199325029, 0.009664916167537688, 0.15801275631161868, 0.1701415608280358, -0.03673762779233726, -0.3182383370915996, 0.01748307294324569, -0.13928988247825796, -0.14166867492575172, -0.1464415682208929, -0.052523604500873664, 0.017143251848281593, -0.23115911024848845, 0.08561983655028521, 0.05409620196644402, 0.14937569545119578, -0.1105192435627922, -0.0487184765028721, -0.08198234445996688, -0.014704825987804893, 0.0760769726318829, 0.152673257453737, 0.15998858739357733, -0.1551467722607116, -0.08982692517592829, 0.3550619798917191, -0.03491469250177859, -0.07689358697975457, 0.08717437107685676, -0.1650462758294736, -0.023629574197615293, 0.19927750326732688, 0.05076319798298761, 0.017003883607685566, -0.07014623662318162, 0.09403539581574394, -0.0624313114197753, 0.19910139356680373, 0.02368940438097673, 0.0690961416620028, 0.2609357396801207, 0.1940427280802293, 0.06664414954015073, 0.16255443073571363, -0.15717955945465872, -0.09373832704723938, -0.24794272647787494, -0.14142088249907003, -0.24602905230874078, 0.013468991055199546, -0.04788402454384292, -0.21682402261380926, 0.40627967150438515, 0.1418167689306569, 0.19731363807830296, -0.09191082674285053, 0.21034547789616787, 0.0791608343992369, 0.08980437084794679, 0.004514818432318139, 0.21817315749639105, 0.23975102428069456, 0.09868187999603807, -0.4252949813149658, 0.0053397736277642615, 0.03871537056414688] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.