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.0566 | Fidelity based Measurement Induced Nonlocality over two-sided
measurements | In this paper, we introduce quantum fidelity based measurement induced
nonlocality for the bipartite state over two-sided von Neumann projective
measurements. While all the properties of this quantity are reflected from that
of one-sided measurement, the latter one is shown to set an upper bound for
arbitrary bipartite state. As an illustration, we have studied the nonlocality
of Bell diagonal state.
| quant-ph | in this paper we introduce quantum fidelity based measurement induced nonlocality for the bipartite state over twosided von neumann projective measurements while all the properties of this quantity are reflected from that of onesided measurement the latter one is shown to set an upper bound for arbitrary bipartite state as an illustration we have studied the nonlocality of bell diagonal state | [['in', 'this', 'paper', 'we', 'introduce', 'quantum', 'fidelity', 'based', 'measurement', 'induced', 'nonlocality', 'for', 'the', 'bipartite', 'state', 'over', 'twosided', 'von', 'neumann', 'projective', 'measurements', 'while', 'all', 'the', 'properties', 'of', 'this', 'quantity', 'are', 'reflected', 'from', 'that', 'of', 'onesided', 'measurement', 'the', 'latter', 'one', 'is', 'shown', 'to', 'set', 'an', 'upper', 'bound', 'for', 'arbitrary', 'bipartite', 'state', 'as', 'an', 'illustration', 'we', 'have', 'studied', 'the', 'nonlocality', 'of', 'bell', 'diagonal', 'state']] | [-0.13236193215955416, 0.17047648506332572, -0.06435171584217031, 0.01035089566960137, -0.012273362311000218, -0.17318782082102338, 0.013859244076855725, 0.3223767632152885, -0.2674734622547088, -0.23279823604055117, 0.10335803356930064, -0.284768716951252, -0.07126291907682526, 0.21959641523903511, -0.06283419105972422, 0.1280596807263181, 0.0724187052510984, 0.11380409971490259, -0.0699944874141976, -0.2483665522485666, 0.3678385487559145, 0.024537928957782198, 0.27930257423612914, 0.08338056597858667, 0.08227496988094243, 0.037118837428202885, 0.035160805846824024, 0.04230953714825579, -0.17063898360798016, 0.09883760253242294, 0.26329989761846967, 0.14881677711840535, 0.23685586238737966, -0.39418687057666113, -0.1559520375716393, 0.20030748734983508, 0.07387822100770522, 0.14103250303992726, -0.006461095385497711, -0.3500828476408955, -0.0016814110128850234, -0.2181166670300433, -0.09574353900646455, -0.06960284488550464, 0.01765409563897086, -0.09365551347832853, -0.25340084497984805, 0.1369322145388263, 0.11262069306275273, 0.0775314984097886, -0.022357471462827724, -0.06657700417715995, 0.017130568612092098, 0.10008545874114164, -0.08376473407871778, -0.01827335430950415, 0.06112748941742494, -0.10310255819320922, -0.18000158456871745, 0.2960333839425298, -0.05266552794052929, -0.23894552959770451, 0.1074368208952126, -0.1654472669556004, -0.11970485766708362, 0.015803413610661128, 0.10588794117259076, 0.10273745680441622, -0.14908126386676412, 0.060810117539568026, -0.12746018189631525, 0.15908141803668172, 0.06284730437929269, 0.16059262602834307, 0.10071350395923755, 0.06768122249756192, 0.13920514110368906, 0.23850908017427216, -0.062620182750655, -0.12426714450273602, -0.3555294853314513, -0.21652474582336506, -0.2741547228146314, 0.1464879753556652, -0.062160816837529664, -0.17716144720143945, 0.38705479071216015, 0.11859641373768205, 0.1757855505651993, 0.03607403399941862, 0.26438645685671786, 0.1306225487480005, -0.02422316157885018, 0.08922175225633823, 0.2616777226756342, 0.1977318970364381, -0.00499020419732408, -0.21915965857457553, 0.13290278312032583, 0.08108003008499985] |
1,802.05661 | LISA sources in Milky Way globular clusters | We explore the formation of double-compact-object binaries in Milky Way (MW)
globular clusters (GCs) that may be detectable by the Laser Interferometer
Space Antenna (LISA). We use a set of 137 fully evolved GC models that,
overall, effectively match the properties of the observed GCs in the MW. We
estimate that, in total, the MW GCs contain $\sim21$ sources that will be
detectable by LISA. These detectable sources contain all combinations of black
hole (BH), neutron star, and white dwarf components. We predict $\sim7$ of
these sources will be BH-BH binaries. Furthermore, we show that some of these
BH-BH binaries can have signal-to-noise ratios large enough to be detectable at
the distance of the Andromeda galaxy or even the Virgo cluster.
| astro-ph.HE astro-ph.GA | we explore the formation of doublecompactobject binaries in milky way mw globular clusters gcs that may be detectable by the laser interferometer space antenna lisa we use a set of 137 fully evolved gc models that overall effectively match the properties of the observed gcs in the mw we estimate that in total the mw gcs contain sim21 sources that will be detectable by lisa these detectable sources contain all combinations of black hole bh neutron star and white dwarf components we predict sim7 of these sources will be bhbh binaries furthermore we show that some of these bhbh binaries can have signaltonoise ratios large enough to be detectable at the distance of the andromeda galaxy or even the virgo cluster | [['we', 'explore', 'the', 'formation', 'of', 'doublecompactobject', 'binaries', 'in', 'milky', 'way', 'mw', 'globular', 'clusters', 'gcs', 'that', 'may', 'be', 'detectable', 'by', 'the', 'laser', 'interferometer', 'space', 'antenna', 'lisa', 'we', 'use', 'a', 'set', 'of', '137', 'fully', 'evolved', 'gc', 'models', 'that', 'overall', 'effectively', 'match', 'the', 'properties', 'of', 'the', 'observed', 'gcs', 'in', 'the', 'mw', 'we', 'estimate', 'that', 'in', 'total', 'the', 'mw', 'gcs', 'contain', 'sim21', 'sources', 'that', 'will', 'be', 'detectable', 'by', 'lisa', 'these', 'detectable', 'sources', 'contain', 'all', 'combinations', 'of', 'black', 'hole', 'bh', 'neutron', 'star', 'and', 'white', 'dwarf', 'components', 'we', 'predict', 'sim7', 'of', 'these', 'sources', 'will', 'be', 'bhbh', 'binaries', 'furthermore', 'we', 'show', 'that', 'some', 'of', 'these', 'bhbh', 'binaries', 'can', 'have', 'signaltonoise', 'ratios', 'large', 'enough', 'to', 'be', 'detectable', 'at', 'the', 'distance', 'of', 'the', 'andromeda', 'galaxy', 'or', 'even', 'the', 'virgo', 'cluster']] | [-0.11934935266229635, 0.1317731904719646, -0.06612077539709087, 0.16825494756922127, -0.11365369751001708, -0.020592513428224872, 0.05715868300758302, 0.43522201871188976, -0.13718374903546646, -0.37309982903922595, -0.003065734431341601, -0.3404416115566467, -0.06305356192606268, 0.24939674440926562, -0.04239371035558482, -0.048603870047372766, 0.1726564951473847, -0.06915517793628775, -0.04227811850141734, -0.3433479539361239, 0.29987896539484304, 0.053151320487571256, 0.05435276448260993, -0.13780352500810597, 0.06905235561425797, -0.12352571966669833, -0.0029717052976290384, -0.016580623912401886, -0.1362715993654395, 0.02510793249675771, 0.3105044002347919, 0.21120444277767092, 0.16379436851323892, -0.380531021549056, -0.20790987785439938, 0.1017191158219551, 0.2259411093313247, 0.07874150762024025, -0.08827309552192067, -0.28535793917253616, 0.15298706180183216, -0.2620216840102027, -0.19281903173929701, 0.04063137036282569, 0.028972889642075946, 0.11096462775021791, -0.16720803950447588, 0.11673004762269557, 0.02497527521336451, -0.062108832178637385, -0.1242374798282981, -0.09314307880825558, -0.03718244097932863, 0.0685908096745455, -0.03749504853428031, 0.07306787968457987, 0.21726715271749222, -0.07965331618712905, -0.043441947743607066, 0.3811460377459298, -0.07887924531629929, -0.007460893710958772, 0.19707727132675548, -0.27576132291772715, -0.2203947924465562, 0.063134473344932, 0.1892179635935463, 0.11661262560131339, -0.18876504776999353, 0.006297989321077087, 0.025148272306735938, 0.2713550437397013, 0.1458100290503353, 0.11439807288419009, 0.4164093749752889, 0.08451531655931224, 0.08041214296772523, 0.06048794563005989, -0.2552853127204192, 0.01411194186269616, -0.21311339975412313, -0.08151954783049102, -0.12854655210103375, 0.11150644030033921, -0.16422964601745965, -0.1042152325064914, 0.3004356829410729, 0.13623012744064908, 0.1724723081899962, 0.00780633000152496, 0.2780762347547958, 0.09555859908299075, 0.15813846047579622, 0.11104114432043086, 0.3542727369322771, 0.12411828913803523, 0.017067538267777613, -0.23022092410440867, 0.05674833127995953, -0.09193587031331844] |
1,802.05662 | List Heaps | This paper presents a simple extension of the binary heap, the List Heap. We
use List Heaps to demonstrate the idea of adaptive heaps: heaps whose
performance is a function of both the size of the problem instance and the
disorder of the problem instance. We focus on the presortedness of the input
sequence as a measure of disorder for the problem instance. A number of
practical applications that rely on heaps deal with input that is not random.
Even random input contains presorted subsequences. Devising heaps that exploit
this structure may provide a means for improving practical performance. We
present some basic empirical tests to support this claim. Additionally,
adaptive heaps may provide an interesting direction for theoretical
investigation.
| cs.DS | this paper presents a simple extension of the binary heap the list heap we use list heaps to demonstrate the idea of adaptive heaps heaps whose performance is a function of both the size of the problem instance and the disorder of the problem instance we focus on the presortedness of the input sequence as a measure of disorder for the problem instance a number of practical applications that rely on heaps deal with input that is not random even random input contains presorted subsequences devising heaps that exploit this structure may provide a means for improving practical performance we present some basic empirical tests to support this claim additionally adaptive heaps may provide an interesting direction for theoretical investigation | [['this', 'paper', 'presents', 'a', 'simple', 'extension', 'of', 'the', 'binary', 'heap', 'the', 'list', 'heap', 'we', 'use', 'list', 'heaps', 'to', 'demonstrate', 'the', 'idea', 'of', 'adaptive', 'heaps', 'heaps', 'whose', 'performance', 'is', 'a', 'function', 'of', 'both', 'the', 'size', 'of', 'the', 'problem', 'instance', 'and', 'the', 'disorder', 'of', 'the', 'problem', 'instance', 'we', 'focus', 'on', 'the', 'presortedness', 'of', 'the', 'input', 'sequence', 'as', 'a', 'measure', 'of', 'disorder', 'for', 'the', 'problem', 'instance', 'a', 'number', 'of', 'practical', 'applications', 'that', 'rely', 'on', 'heaps', 'deal', 'with', 'input', 'that', 'is', 'not', 'random', 'even', 'random', 'input', 'contains', 'presorted', 'subsequences', 'devising', 'heaps', 'that', 'exploit', 'this', 'structure', 'may', 'provide', 'a', 'means', 'for', 'improving', 'practical', 'performance', 'we', 'present', 'some', 'basic', 'empirical', 'tests', 'to', 'support', 'this', 'claim', 'additionally', 'adaptive', 'heaps', 'may', 'provide', 'an', 'interesting', 'direction', 'for', 'theoretical', 'investigation']] | [-0.12909253385087216, 0.07127078617749318, -0.1140681092838655, 0.0712512160970305, -0.15274744557936779, -0.16549575649311438, 0.10936941153725938, 0.37364112490302875, -0.28784146150495826, -0.30553201584442824, 0.10254241586046513, -0.23994228948580743, -0.18976144967678965, 0.18171395135832122, -0.12592605118905859, 0.08299810358053152, 0.06560892097166732, 0.0444393874847471, -0.01386897569177907, -0.2658047866244495, 0.3191607147670437, 0.05314301639137899, 0.26725793788757396, 0.02900591804919874, 0.07325559598980706, 0.06307656442386513, -0.027791871583605764, 0.04297609627246857, -0.10627670456676601, 0.13554119478868118, 0.23379092265562224, 0.18255892019922368, 0.3231983825216117, -0.39686472775774595, -0.16516922850615712, 0.08606037528042783, 0.14845097263758422, 0.1294358854165923, -0.1166631787831449, -0.20407064758268567, 0.10362603280208066, -0.15295647916153168, -0.11841368554707836, -0.0870106044624533, 0.02703718376001578, 0.06184689566970435, -0.2906896465192862, -0.04624184532122327, 0.16541728324123792, 0.052311712038554566, -0.018524052297399073, -0.13966234641133987, 0.09430784695320019, 0.12486510494911746, 0.02458146940173284, 0.005575180340346982, 0.07009723447576291, -0.10928788599572849, -0.16706652140651806, 0.3769308788028835, 0.022021702544063236, -0.20480963019869378, 0.16512166850362756, -0.0469782033176044, -0.1726603639985145, 0.07308526035836514, 0.18280297380034663, 0.09265436861319702, -0.08589609842131134, 0.071577388827959, -0.12000858740286291, 0.22140483702180766, 0.060440378200982796, 0.06681462203958581, 0.18306759159871133, 0.23944944916527813, 0.06005351694238161, 0.22731664467665577, -0.06638484767505101, -0.06586020484961913, -0.28021697636631104, -0.15865466292916225, -0.20364866174068771, 0.003509696590750353, -0.142231758964564, -0.23535564998869135, 0.38788239518571804, 0.1998352832063062, 0.2114207482888919, 0.1472186802831643, 0.30421701828878717, 0.07447206596511283, 0.03410293615693148, 0.06257677948427144, 0.1368477853230776, 0.078135566913108, 0.07142690601641265, -0.18824235000843262, 0.12622510245414215, 0.08533872417448198] |
1,802.05663 | Imaging the Developing Heart: Synchronized Timelapse Microscopy During
Developmental Changes | How do you use imaging to analyse the development of the heart, which not
only changes shape but also undergoes constant, high-speed, quasi-periodic
changes? We have integrated ideas from prospective and retrospective optical
gating to capture long-term, phase-locked developmental time-lapse videos. In
this paper we demonstrate the success of this approach over a key developmental
time period: heart looping, where large changes in heart shape prevent previous
prospective gating approaches from capturing phase-locked videos. We use the
comparison with other approaches to in vivo heart imaging to highlight the
importance of collecting the most appropriate data for the biological question.
| q-bio.TO | how do you use imaging to analyse the development of the heart which not only changes shape but also undergoes constant highspeed quasiperiodic changes we have integrated ideas from prospective and retrospective optical gating to capture longterm phaselocked developmental timelapse videos in this paper we demonstrate the success of this approach over a key developmental time period heart looping where large changes in heart shape prevent previous prospective gating approaches from capturing phaselocked videos we use the comparison with other approaches to in vivo heart imaging to highlight the importance of collecting the most appropriate data for the biological question | [['how', 'do', 'you', 'use', 'imaging', 'to', 'analyse', 'the', 'development', 'of', 'the', 'heart', 'which', 'not', 'only', 'changes', 'shape', 'but', 'also', 'undergoes', 'constant', 'highspeed', 'quasiperiodic', 'changes', 'we', 'have', 'integrated', 'ideas', 'from', 'prospective', 'and', 'retrospective', 'optical', 'gating', 'to', 'capture', 'longterm', 'phaselocked', 'developmental', 'timelapse', 'videos', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'success', 'of', 'this', 'approach', 'over', 'a', 'key', 'developmental', 'time', 'period', 'heart', 'looping', 'where', 'large', 'changes', 'in', 'heart', 'shape', 'prevent', 'previous', 'prospective', 'gating', 'approaches', 'from', 'capturing', 'phaselocked', 'videos', 'we', 'use', 'the', 'comparison', 'with', 'other', 'approaches', 'to', 'in', 'vivo', 'heart', 'imaging', 'to', 'highlight', 'the', 'importance', 'of', 'collecting', 'the', 'most', 'appropriate', 'data', 'for', 'the', 'biological', 'question']] | [-0.057660966392140835, 0.07863991698250175, -0.05838768260087818, 0.047897220280719924, -0.09528591284062714, -0.1515571796381846, 0.019886092011583967, 0.43866996083408594, -0.30045103368000126, -0.26194521747500404, 0.1146475492848549, -0.23390638422220944, -0.2424287680722773, 0.24523781890631655, -0.17213473522337153, 0.035319285300793125, 0.11218304418958723, 0.012483696676790714, -0.009847021708264948, -0.21014668587595225, 0.22403368799947201, 0.021298502036370338, 0.32784399586729707, 0.0260165551956743, 0.12681473588687367, 0.020247835599802783, -0.060414215704950036, -0.03447047310182825, -0.13791905569843949, 0.16639056768581212, 0.33219834729563447, 0.16962797059677542, 0.33591676913900304, -0.4875120262056589, -0.2396660987008363, 0.08961640746099875, 0.14273031044751405, 0.1332294565520715, -0.058966914964839814, -0.28209063651040195, 0.06432940898579545, -0.12585174817591904, -0.09332210147753357, -0.09953265306539834, 0.05221395359374583, 0.024089574245736003, -0.2000064564216882, 0.07051873940537917, 0.0026925649121403695, 0.12406574041582644, -0.08347961851162836, -0.02101412448566407, 0.02940087774535641, 0.24300459776073693, 0.07139869921840727, 0.03180965767125599, 0.1989393313974142, -0.15985584970097988, -0.1539728400018066, 0.32176721933763475, -0.05854595203883946, -0.11406478346791118, 0.2328326965915039, -0.18238685784162953, -0.14202178528066725, 0.12879518911242485, 0.19864074198529125, 0.08104325540363788, -0.14380712199956178, -0.018443874447257258, 0.0684906495269388, 0.21600414587184788, 0.10189764601876959, 0.0485862760944292, 0.1958409804292023, 0.23019068498164416, -0.01781223381171003, 0.0831505722278962, -0.1699161016754806, -0.0986908811610192, -0.23445008377311752, -0.10363538824021816, -0.13850670775398613, 0.04667994193048799, -0.03296628489144496, -0.14272816208656877, 0.43027032842859625, 0.26734838939271865, 0.19438793156296014, 0.009830341563792899, 0.31363424176350235, 0.018819875549525023, 0.0985936349882104, 0.0029228877322748305, 0.19824271543649957, 0.01989379396662116, 0.19208812428521924, -0.2562742145080119, 0.09643312907312065, 0.0021743826707825067] |
1,802.05664 | DeepMatch: Balancing Deep Covariate Representations for Causal Inference
Using Adversarial Training | We study optimal covariate balance for causal inferences from observational
data when rich covariates and complex relationships necessitate flexible
modeling with neural networks. Standard approaches such as propensity weighting
and matching/balancing fail in such settings due to miscalibrated propensity
nets and inappropriate covariate representations, respectively. We propose a
new method based on adversarial training of a weighting and a discriminator
network that effectively addresses this methodological gap. This is
demonstrated through new theoretical characterizations of the method as well as
empirical results using both fully connected architectures to learn complex
relationships and convolutional architectures to handle image confounders,
showing how this new method can enable strong causal analyses in these
challenging settings.
| stat.ML | we study optimal covariate balance for causal inferences from observational data when rich covariates and complex relationships necessitate flexible modeling with neural networks standard approaches such as propensity weighting and matchingbalancing fail in such settings due to miscalibrated propensity nets and inappropriate covariate representations respectively we propose a new method based on adversarial training of a weighting and a discriminator network that effectively addresses this methodological gap this is demonstrated through new theoretical characterizations of the method as well as empirical results using both fully connected architectures to learn complex relationships and convolutional architectures to handle image confounders showing how this new method can enable strong causal analyses in these challenging settings | [['we', 'study', 'optimal', 'covariate', 'balance', 'for', 'causal', 'inferences', 'from', 'observational', 'data', 'when', 'rich', 'covariates', 'and', 'complex', 'relationships', 'necessitate', 'flexible', 'modeling', 'with', 'neural', 'networks', 'standard', 'approaches', 'such', 'as', 'propensity', 'weighting', 'and', 'matchingbalancing', 'fail', 'in', 'such', 'settings', 'due', 'to', 'miscalibrated', 'propensity', 'nets', 'and', 'inappropriate', 'covariate', 'representations', 'respectively', 'we', 'propose', 'a', 'new', 'method', 'based', 'on', 'adversarial', 'training', 'of', 'a', 'weighting', 'and', 'a', 'discriminator', 'network', 'that', 'effectively', 'addresses', 'this', 'methodological', 'gap', 'this', 'is', 'demonstrated', 'through', 'new', 'theoretical', 'characterizations', 'of', 'the', 'method', 'as', 'well', 'as', 'empirical', 'results', 'using', 'both', 'fully', 'connected', 'architectures', 'to', 'learn', 'complex', 'relationships', 'and', 'convolutional', 'architectures', 'to', 'handle', 'image', 'confounders', 'showing', 'how', 'this', 'new', 'method', 'can', 'enable', 'strong', 'causal', 'analyses', 'in', 'these', 'challenging', 'settings']] | [-0.01579129100181498, -0.010580145572479983, -0.06744075274548016, 0.15264834001081418, -0.17726104732116196, -0.21111617072460218, 0.09176216876922964, 0.4831002074721697, -0.2957339464175003, -0.31442559038095913, 0.04258415506322037, -0.2253058704606316, -0.2640743037803216, 0.18119227879487718, -0.15915410260476912, 0.10596880622140996, 0.12064312992046948, -0.045354196711586, -0.050614257399747904, -0.24533695575093162, 0.3320972320984478, 0.03053054660516749, 0.3414502459214287, 0.023204952511969988, 0.12204555920975467, -0.005750338844787162, -0.057643302196116596, 0.055974183686975355, -0.0894810015838179, 0.1716460695554217, 0.3491484427736518, 0.20519502119681388, 0.3669809369340975, -0.43962966900755157, -0.26636982529826864, 0.10071994978431109, 0.12019800877215357, 0.10548232443345425, -0.012655893069071075, -0.32321159476162614, 0.04647178185247892, -0.18015952008096753, 0.021726535331155802, -0.22050375639888886, -0.06883940106123551, 0.019439155670084262, -0.3404028779189396, 0.08006479401930093, 0.07673431928416395, 0.07453962176333408, -0.030124043450095096, -0.12231709396973701, 0.022394963356599143, 0.13543333254071782, 0.05347607647874267, 0.007740263443289173, 0.08707511200997475, -0.14183865317042815, -0.14409954111754625, 0.31391171546787155, -0.017682991628241433, -0.2550446760278564, 0.21578340508622695, -0.027527439265369293, -0.1643197624440733, 0.031132871726620104, 0.2789874831214547, 0.08524570205492212, -0.192071800810932, -0.007311662464499104, -0.008610642095608217, 0.15252838832187793, -0.0024656451093284667, -0.0063825299406711535, 0.18239522617528434, 0.24811469271636424, 0.04474274615488678, 0.10173089589361471, -0.11937783552891668, -0.06852534894940553, -0.2407590696453914, -0.08625007960274145, -0.14807905712970407, -0.006976946422763102, -0.13751461438198578, -0.19324608093616868, 0.3749941652514846, 0.2448675627652388, 0.23911907684964104, 0.10704488355901327, 0.34200081415474415, 0.004127176106185862, 0.12633601671739206, 0.07232545891373947, 0.15477922106547667, 0.09094233080107081, 0.07977539515500334, -0.14123189624877194, 0.14449229915961959, -0.01154645227801961] |
1,802.05665 | Solar-System Studies with Pulsar Timing Arrays | High-precision pulsar timing is central to a wide range of astrophysics and
fundamental physics applications. When timing an ensemble of millisecond
pulsars in different sky positions, known as a pulsar timing array (PTA), one
can search for ultra-low-frequency gravitational waves (GWs) through the
spatial correlations that spacetime deformations by passing GWs are predicted
to induce on the pulses' times-of-arrival (TOAs). A pulsar-timing model,
requires the use of a solar-system ephemeris (SSE) to properly predict the
position of the solar-system barycentre, the (quasi-)inertial frame where all
TOAs are referred. Here, I discuss how while errors in SSEs can introduce
correlations in the TOAs that may interfere with GW searches, one can make use
of PTAs to study the solar system. I discuss work done within the context of
the European Pulsar Timing Array and the International Pulsar Timing Array
collaborations. These include new updates on the masses of planets from PTA
data, first limits on masses of the most massive asteroids, and comparisons
between SSEs from independent groups. Finally, I discuss a new approach in
setting limits on the masses of unknown bodies in the solar system and
calculate mass sensitivity curves for PTA data.
| astro-ph.IM astro-ph.EP | highprecision pulsar timing is central to a wide range of astrophysics and fundamental physics applications when timing an ensemble of millisecond pulsars in different sky positions known as a pulsar timing array pta one can search for ultralowfrequency gravitational waves gws through the spatial correlations that spacetime deformations by passing gws are predicted to induce on the pulses timesofarrival toas a pulsartiming model requires the use of a solarsystem ephemeris sse to properly predict the position of the solarsystem barycentre the quasiinertial frame where all toas are referred here i discuss how while errors in sses can introduce correlations in the toas that may interfere with gw searches one can make use of ptas to study the solar system i discuss work done within the context of the european pulsar timing array and the international pulsar timing array collaborations these include new updates on the masses of planets from pta data first limits on masses of the most massive asteroids and comparisons between sses from independent groups finally i discuss a new approach in setting limits on the masses of unknown bodies in the solar system and calculate mass sensitivity curves for pta data | [['highprecision', 'pulsar', 'timing', 'is', 'central', 'to', 'a', 'wide', 'range', 'of', 'astrophysics', 'and', 'fundamental', 'physics', 'applications', 'when', 'timing', 'an', 'ensemble', 'of', 'millisecond', 'pulsars', 'in', 'different', 'sky', 'positions', 'known', 'as', 'a', 'pulsar', 'timing', 'array', 'pta', 'one', 'can', 'search', 'for', 'ultralowfrequency', 'gravitational', 'waves', 'gws', 'through', 'the', 'spatial', 'correlations', 'that', 'spacetime', 'deformations', 'by', 'passing', 'gws', 'are', 'predicted', 'to', 'induce', 'on', 'the', 'pulses', 'timesofarrival', 'toas', 'a', 'pulsartiming', 'model', 'requires', 'the', 'use', 'of', 'a', 'solarsystem', 'ephemeris', 'sse', 'to', 'properly', 'predict', 'the', 'position', 'of', 'the', 'solarsystem', 'barycentre', 'the', 'quasiinertial', 'frame', 'where', 'all', 'toas', 'are', 'referred', 'here', 'i', 'discuss', 'how', 'while', 'errors', 'in', 'sses', 'can', 'introduce', 'correlations', 'in', 'the', 'toas', 'that', 'may', 'interfere', 'with', 'gw', 'searches', 'one', 'can', 'make', 'use', 'of', 'ptas', 'to', 'study', 'the', 'solar', 'system', 'i', 'discuss', 'work', 'done', 'within', 'the', 'context', 'of', 'the', 'european', 'pulsar', 'timing', 'array', 'and', 'the', 'international', 'pulsar', 'timing', 'array', 'collaborations', 'these', 'include', 'new', 'updates', 'on', 'the', 'masses', 'of', 'planets', 'from', 'pta', 'data', 'first', 'limits', 'on', 'masses', 'of', 'the', 'most', 'massive', 'asteroids', 'and', 'comparisons', 'between', 'sses', 'from', 'independent', 'groups', 'finally', 'i', 'discuss', 'a', 'new', 'approach', 'in', 'setting', 'limits', 'on', 'the', 'masses', 'of', 'unknown', 'bodies', 'in', 'the', 'solar', 'system', 'and', 'calculate', 'mass', 'sensitivity', 'curves', 'for', 'pta', 'data']] | [-0.14355436108103886, 0.15162102450664963, -0.02519878247223516, 0.1111636565879381, -0.11744847471739367, -0.07640263241158855, 0.06575828023523707, 0.35558893951136117, -0.22093746878900422, -0.3285839813905432, 0.13152493044767605, -0.2917705258455358, -0.08356833274082578, 0.27177600808124797, -0.042778544749622956, 0.024815127531669017, 0.13380286411007808, -0.018490093844203453, -0.057319958070197054, -0.17592092188280412, 0.24301522261146263, 0.10626648947807778, 0.14517128980987387, -0.0502834995277226, 0.09361619093772217, -0.0013291673655573702, -0.06088143562329165, -0.042420764085860714, -0.1007005535477932, 0.08258490573096368, 0.24752998736101328, 0.1842964490231342, 0.1727303950759323, -0.44082254060956927, -0.19987897745804073, 0.07807888851330626, 0.11531069479401454, 0.09200161374558109, -0.023235954826736113, -0.33942102891460213, 0.03318017951126412, -0.21812837146529832, -0.1338545783943756, -0.00792050111280351, 0.03966844209980522, 0.11411116101398594, -0.19724014950628133, 0.02628579287856971, 0.00551817758991767, 4.030980131368047e-05, -0.07208681819461209, -0.1265002466244959, 0.04943598904190873, 0.1108402888017248, 0.0621583010724112, 0.006825771168973681, 0.11412653357712264, -0.07579855874334414, -0.14405554526043846, 0.41132337622195675, -0.07997924060297928, -0.11125807948506523, 0.1590209152746331, -0.2322191518380969, -0.1933795210410908, 0.09366946237513701, 0.2422504857777781, 0.07151768600433758, -0.2026188955201975, 0.06445986733018161, 0.024765836000538517, 0.2463198288322244, 0.0938776492815676, 0.06721969494612925, 0.36149006904842157, 0.16279316935976296, 0.07407705288754833, 0.056564177607891834, -0.21233413105508908, -0.027676205085974532, -0.2689530663576323, -0.04611384056834984, -0.14669817042856276, 0.039540220588399455, -0.11308657032042771, -0.10683492996113929, 0.39760411078033525, 0.2122904403602042, 0.10626879328208946, 0.056670114527619685, 0.3006283623027164, 0.06444060222063329, 0.035182169254523575, 0.04734178516442513, 0.3451451549772173, 0.11911113780353713, 0.07256621006544986, -0.21040540696217766, 0.05998757868505938, 0.007126273854981302] |
1,802.05666 | Adversarial Risk and the Dangers of Evaluating Against Weak Attacks | This paper investigates recently proposed approaches for defending against
adversarial examples and evaluating adversarial robustness. We motivate
'adversarial risk' as an objective for achieving models robust to worst-case
inputs. We then frame commonly used attacks and evaluation metrics as defining
a tractable surrogate objective to the true adversarial risk. This suggests
that models may optimize this surrogate rather than the true adversarial risk.
We formalize this notion as 'obscurity to an adversary,' and develop tools and
heuristics for identifying obscured models and designing transparent models. We
demonstrate that this is a significant problem in practice by repurposing
gradient-free optimization techniques into adversarial attacks, which we use to
decrease the accuracy of several recently proposed defenses to near zero. Our
hope is that our formulations and results will help researchers to develop more
powerful defenses.
| cs.LG cs.CR stat.ML | this paper investigates recently proposed approaches for defending against adversarial examples and evaluating adversarial robustness we motivate adversarial risk as an objective for achieving models robust to worstcase inputs we then frame commonly used attacks and evaluation metrics as defining a tractable surrogate objective to the true adversarial risk this suggests that models may optimize this surrogate rather than the true adversarial risk we formalize this notion as obscurity to an adversary and develop tools and heuristics for identifying obscured models and designing transparent models we demonstrate that this is a significant problem in practice by repurposing gradientfree optimization techniques into adversarial attacks which we use to decrease the accuracy of several recently proposed defenses to near zero our hope is that our formulations and results will help researchers to develop more powerful defenses | [['this', 'paper', 'investigates', 'recently', 'proposed', 'approaches', 'for', 'defending', 'against', 'adversarial', 'examples', 'and', 'evaluating', 'adversarial', 'robustness', 'we', 'motivate', 'adversarial', 'risk', 'as', 'an', 'objective', 'for', 'achieving', 'models', 'robust', 'to', 'worstcase', 'inputs', 'we', 'then', 'frame', 'commonly', 'used', 'attacks', 'and', 'evaluation', 'metrics', 'as', 'defining', 'a', 'tractable', 'surrogate', 'objective', 'to', 'the', 'true', 'adversarial', 'risk', 'this', 'suggests', 'that', 'models', 'may', 'optimize', 'this', 'surrogate', 'rather', 'than', 'the', 'true', 'adversarial', 'risk', 'we', 'formalize', 'this', 'notion', 'as', 'obscurity', 'to', 'an', 'adversary', 'and', 'develop', 'tools', 'and', 'heuristics', 'for', 'identifying', 'obscured', 'models', 'and', 'designing', 'transparent', 'models', 'we', 'demonstrate', 'that', 'this', 'is', 'a', 'significant', 'problem', 'in', 'practice', 'by', 'repurposing', 'gradientfree', 'optimization', 'techniques', 'into', 'adversarial', 'attacks', 'which', 'we', 'use', 'to', 'decrease', 'the', 'accuracy', 'of', 'several', 'recently', 'proposed', 'defenses', 'to', 'near', 'zero', 'our', 'hope', 'is', 'that', 'our', 'formulations', 'and', 'results', 'will', 'help', 'researchers', 'to', 'develop', 'more', 'powerful', 'defenses']] | [-0.03458565448709666, -0.043578568755417935, -0.07789638613606108, 0.1817078844082903, -0.11610080821981737, -0.227730797669753, 0.0904578565725876, 0.43070189935613923, -0.2159840733285493, -0.30672340803265347, 0.08035131039553141, -0.2651890570318688, -0.2690219668143276, 0.19873163319165027, -0.24085226080922492, 0.14263987994002206, 0.02551013534304811, -0.05586057698090019, -0.03653674416848695, -0.3262115805965862, 0.32220535591911914, 0.10850513756358579, 0.28926741301560766, 0.050022855592168756, 0.06752310351836982, -0.0331842358929536, 0.026287696763887, 0.038751671909973195, -0.11249663243490512, 0.171451175115384, 0.36987969507743457, 0.2586545885172186, 0.4288327235506097, -0.4199063332630634, -0.23880612446384422, 0.1510117889204716, 0.12112426007889322, 0.15674952404667386, -0.07251120378046537, -0.3319062986133148, 0.12727667267587203, -0.20926407841555497, -0.06069297938774437, -0.18732438034920104, -0.041740502029268156, -0.056751736731671575, -0.3213794209591266, -0.03767214641114002, 0.09263221777058137, 0.0335382830017983, -0.04706047736316808, -0.10843509865174097, 0.049510683893893306, 0.10276669198855647, 0.12131787602678497, 0.051711139130169774, 0.1441418906624269, -0.1341569325882323, -0.19231404343606043, 0.31437372569161565, -0.034388655230751325, -0.2254658314510624, 0.1951296184726282, 0.05733540266015525, -0.14789249342622987, 0.062420524837476996, 0.27330766774630594, 0.14954084351853425, -0.1712317613036886, -0.03752290694400974, 0.015198642547840058, 0.161315453805224, 0.020575191771764475, 0.0033992650317472978, 0.1321922568065712, 0.19023295078051292, 0.10882052639499307, 0.19035007089633607, -0.061942442014479814, -0.0718871246564633, -0.23514720765220473, -0.11091303571523514, -0.14635087386878737, 0.001394452826022657, -0.06460442311593519, -0.14133090891444416, 0.38957329600382207, 0.29152181925714266, 0.15068530443180075, 0.15754002494191918, 0.413324869291704, 0.04182911214484736, 0.05765036801432273, 0.13431205015295922, 0.2446655216566009, 0.020940971493012092, 0.05092396986073078, -0.12389487497518951, 0.1794883243256568, 0.015138015846040711] |
1,802.05667 | Calculating the similarity between words and sentences using a lexical
database and corpus statistics | Calculating the semantic similarity between sentences is a long dealt problem
in the area of natural language processing. The semantic analysis field has a
crucial role to play in the research related to the text analytics. The
semantic similarity differs as the domain of operation differs. In this paper,
we present a methodology which deals with this issue by incorporating semantic
similarity and corpus statistics. To calculate the semantic similarity between
words and sentences, the proposed method follows an edge-based approach using a
lexical database. The methodology can be applied in a variety of domains. The
methodology has been tested on both benchmark standards and mean human
similarity dataset. When tested on these two datasets, it gives highest
correlation value for both word and sentence similarity outperforming other
similar models. For word similarity, we obtained Pearson correlation
coefficient of 0.8753 and for sentence similarity, the correlation obtained is
0.8794.
| cs.CL | calculating the semantic similarity between sentences is a long dealt problem in the area of natural language processing the semantic analysis field has a crucial role to play in the research related to the text analytics the semantic similarity differs as the domain of operation differs in this paper we present a methodology which deals with this issue by incorporating semantic similarity and corpus statistics to calculate the semantic similarity between words and sentences the proposed method follows an edgebased approach using a lexical database the methodology can be applied in a variety of domains the methodology has been tested on both benchmark standards and mean human similarity dataset when tested on these two datasets it gives highest correlation value for both word and sentence similarity outperforming other similar models for word similarity we obtained pearson correlation coefficient of 08753 and for sentence similarity the correlation obtained is 08794 | [['calculating', 'the', 'semantic', 'similarity', 'between', 'sentences', 'is', 'a', 'long', 'dealt', 'problem', 'in', 'the', 'area', 'of', 'natural', 'language', 'processing', 'the', 'semantic', 'analysis', 'field', 'has', 'a', 'crucial', 'role', 'to', 'play', 'in', 'the', 'research', 'related', 'to', 'the', 'text', 'analytics', 'the', 'semantic', 'similarity', 'differs', 'as', 'the', 'domain', 'of', 'operation', 'differs', 'in', 'this', 'paper', 'we', 'present', 'a', 'methodology', 'which', 'deals', 'with', 'this', 'issue', 'by', 'incorporating', 'semantic', 'similarity', 'and', 'corpus', 'statistics', 'to', 'calculate', 'the', 'semantic', 'similarity', 'between', 'words', 'and', 'sentences', 'the', 'proposed', 'method', 'follows', 'an', 'edgebased', 'approach', 'using', 'a', 'lexical', 'database', 'the', 'methodology', 'can', 'be', 'applied', 'in', 'a', 'variety', 'of', 'domains', 'the', 'methodology', 'has', 'been', 'tested', 'on', 'both', 'benchmark', 'standards', 'and', 'mean', 'human', 'similarity', 'dataset', 'when', 'tested', 'on', 'these', 'two', 'datasets', 'it', 'gives', 'highest', 'correlation', 'value', 'for', 'both', 'word', 'and', 'sentence', 'similarity', 'outperforming', 'other', 'similar', 'models', 'for', 'word', 'similarity', 'we', 'obtained', 'pearson', 'correlation', 'coefficient', 'of', '08753', 'and', 'for', 'sentence', 'similarity', 'the', 'correlation', 'obtained', 'is', '08794']] | [-0.06232233396192797, -0.021937003595889928, -0.092146004670534, 0.12413681199343331, -0.11805837772165735, -0.11517762562868242, 0.0340242565579421, 0.4518442904563988, -0.2803125099095256, -0.3460651585281047, 0.000536753545787667, -0.33969576030868254, -0.1383534514275538, 0.20908085756094139, -0.08310111209775517, 0.08391192713182191, 0.09850496516189203, 0.11024839832086344, -0.08449382422377869, -0.23218504437023685, 0.3501879731335734, 0.031369014823695224, 0.38466519823766687, 0.0537903950752399, 0.11699682533373537, -0.04525207940070909, -0.12916863305798296, 0.036944191648662854, -0.06372896084549273, 0.2021681612561818, 0.34516156583242485, 0.21458515409399204, 0.3113105854741773, -0.3295257678952347, -0.21455394839677883, 0.0633742850389471, 0.1158772246075832, 0.06983239332649169, -0.02383047530386394, -0.35733740323153484, 0.07372207411400163, -0.1597906712167041, 0.07068556760355425, -0.09944854113495066, 0.05442271501120484, -0.03420071386206312, -0.23084282075002677, 0.09147145286072553, 0.094719456638634, 0.11650043949611535, -0.036344946537889083, -0.11933065705368814, 0.052982739095265664, 0.2079980609216648, 0.06644107604662249, 0.09950803664392557, 0.09373993658204088, -0.1554546430263491, -0.14162901729950364, 0.40672367844147744, -0.09717598242596501, -0.23921106947066428, 0.17496698919119832, -0.03954015936239996, -0.14405412338737425, 0.031404052788176304, 0.18091241848737408, 0.06689991120274374, -0.1875663586456818, 0.035423647915646686, -0.06654500868805006, 0.22285992657563009, 0.11167629775915891, -0.030326432491443595, 0.19336510789073802, 0.24834110150208735, -0.01865180619425286, 0.14096785573325227, -0.11431010961722658, -0.06439274142268209, -0.19807231078893706, -0.1588007885848685, -0.2173069667634966, -0.08648883815610078, -0.14029710993856162, -0.15972337610686996, 0.41772422316123026, 0.22512633403205648, 0.17244943561741993, 0.09367339404341037, 0.2546791935554978, 0.05867393984424495, 0.0955337378589221, 0.0334875678808308, 0.14831608510734576, 0.04246241099923393, 0.14873256551443922, -0.18083219837118575, 0.12473251524248294, 0.12333208484338362] |
1,802.05668 | Model compression via distillation and quantization | Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded
devices. This paper focuses on this problem, and proposes two new compression
methods, which jointly leverage weight quantization and distillation of larger
teacher networks into smaller student networks. The first method we propose is
called quantized distillation and leverages distillation during the training
process, by incorporating distillation loss, expressed with respect to the
teacher, into the training of a student network whose weights are quantized to
a limited set of levels. The second method, differentiable quantization,
optimizes the location of quantization points through stochastic gradient
descent, to better fit the behavior of the teacher model. We validate both
methods through experiments on convolutional and recurrent architectures. We
show that quantized shallow students can reach similar accuracy levels to
full-precision teacher models, while providing order of magnitude compression,
and inference speedup that is linear in the depth reduction. In sum, our
results enable DNNs for resource-constrained environments to leverage
architecture and accuracy advances developed on more powerful devices.
| cs.NE cs.LG | deep neural networks dnns continue to make significant advances solving tasks from image classification to translation or reinforcement learning one aspect of the field receiving considerable attention is efficiently executing deep models in resourceconstrained environments such as mobile or embedded devices this paper focuses on this problem and proposes two new compression methods which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks the first method we propose is called quantized distillation and leverages distillation during the training process by incorporating distillation loss expressed with respect to the teacher into the training of a student network whose weights are quantized to a limited set of levels the second method differentiable quantization optimizes the location of quantization points through stochastic gradient descent to better fit the behavior of the teacher model we validate both methods through experiments on convolutional and recurrent architectures we show that quantized shallow students can reach similar accuracy levels to fullprecision teacher models while providing order of magnitude compression and inference speedup that is linear in the depth reduction in sum our results enable dnns for resourceconstrained environments to leverage architecture and accuracy advances developed on more powerful devices | [['deep', 'neural', 'networks', 'dnns', 'continue', 'to', 'make', 'significant', 'advances', 'solving', 'tasks', 'from', 'image', 'classification', 'to', 'translation', 'or', 'reinforcement', 'learning', 'one', 'aspect', 'of', 'the', 'field', 'receiving', 'considerable', 'attention', 'is', 'efficiently', 'executing', 'deep', 'models', 'in', 'resourceconstrained', 'environments', 'such', 'as', 'mobile', 'or', 'embedded', 'devices', 'this', 'paper', 'focuses', 'on', 'this', 'problem', 'and', 'proposes', 'two', 'new', 'compression', 'methods', 'which', 'jointly', 'leverage', 'weight', 'quantization', 'and', 'distillation', 'of', 'larger', 'teacher', 'networks', 'into', 'smaller', 'student', 'networks', 'the', 'first', 'method', 'we', 'propose', 'is', 'called', 'quantized', 'distillation', 'and', 'leverages', 'distillation', 'during', 'the', 'training', 'process', 'by', 'incorporating', 'distillation', 'loss', 'expressed', 'with', 'respect', 'to', 'the', 'teacher', 'into', 'the', 'training', 'of', 'a', 'student', 'network', 'whose', 'weights', 'are', 'quantized', 'to', 'a', 'limited', 'set', 'of', 'levels', 'the', 'second', 'method', 'differentiable', 'quantization', 'optimizes', 'the', 'location', 'of', 'quantization', 'points', 'through', 'stochastic', 'gradient', 'descent', 'to', 'better', 'fit', 'the', 'behavior', 'of', 'the', 'teacher', 'model', 'we', 'validate', 'both', 'methods', 'through', 'experiments', 'on', 'convolutional', 'and', 'recurrent', 'architectures', 'we', 'show', 'that', 'quantized', 'shallow', 'students', 'can', 'reach', 'similar', 'accuracy', 'levels', 'to', 'fullprecision', 'teacher', 'models', 'while', 'providing', 'order', 'of', 'magnitude', 'compression', 'and', 'inference', 'speedup', 'that', 'is', 'linear', 'in', 'the', 'depth', 'reduction', 'in', 'sum', 'our', 'results', 'enable', 'dnns', 'for', 'resourceconstrained', 'environments', 'to', 'leverage', 'architecture', 'and', 'accuracy', 'advances', 'developed', 'on', 'more', 'powerful', 'devices']] | [-0.052594796311805206, 0.027458721849840457, -0.032715941131644444, 0.03252275536747935, -0.11723462974435182, -0.21740848430654572, 0.07002938540562571, 0.46388691655232517, -0.29404451008318794, -0.3340504629159852, 0.03936554776885202, -0.2368081645611059, -0.20834330739547985, 0.1761250204352312, -0.15765793824823676, 0.10999758872038065, 0.1418711163179221, 0.017135262430224774, -0.08457785896332887, -0.33309207148471764, 0.2907883086712171, 0.0859515461476808, 0.35629574069989667, -0.0012205700628780925, 0.15421564773485646, -0.04025551613046773, 0.007465277734652237, -0.02958134996768579, -0.014622465965972132, 0.20817781376787153, 0.3036250330874212, 0.1830279398555891, 0.38239369861814687, -0.4743550240965135, -0.24735803954329266, 0.10027527320080526, 0.14536728637826601, 0.11318064780331448, -0.010755385491813221, -0.3219843472573944, 0.09569274117167907, -0.19025301987655122, 0.04160751040500759, -0.16099926079316113, -0.065913636016962, -0.014977840505490732, -0.280023849170967, -0.005944464330887658, 0.0923075268392541, 0.05640610320633041, -0.04144002790376662, -0.14608965837042118, 0.04989645846405535, 0.15867565682176785, 0.0015222786618148444, 0.061580800290602415, 0.14728436014392807, -0.22348525148915685, -0.1498633537460402, 0.32458448045069194, -0.04404578735723354, -0.19914983167918163, 0.1672119480784661, -0.021157918658655912, -0.13359463689399664, 0.08237132847517124, 0.2967133187558289, 0.10236683359067074, -0.13285406474922287, -0.0043326809648944415, 0.02299727281309702, 0.1767226343736322, 0.024577774661758603, -0.014216496838436362, 0.16806286149823726, 0.2660230253610363, 0.058065305081040124, 0.16053117716302007, -0.10812966778595473, -0.11728943237883564, -0.20427347795073378, -0.11636758824044527, -0.20191472090265436, 0.019997417552131913, -0.08771904361943081, -0.12142154472752423, 0.38955903456068885, 0.21172109020869176, 0.21527378558450697, 0.15378761481609535, 0.37197961493662374, 0.0738091757492225, 0.1622256521102476, 0.13343584118174567, 0.18996203237752132, 0.07134017273240019, 0.14655472975410994, -0.16060510071938228, 0.10133353256762884, 0.06202926451037756] |
1,802.05669 | Minimum Energy Paths and Transition States by Curve Optimization | Transition states and minimum energy paths are essential to understand and
predict chemical reactivity. Double-ended methods represent a standard approach
for their determination. We introduce a new double-ended method that optimizes
reaction paths described by curves. Unlike other methods, our approach
optimizes the curve parameters rather than distinct structures along the path.
With molecular paths represented as continuous curves, the optimization can
benefit from the advantages of an integral-based formulation. We call this
approach ReaDuct and demonstrate its applicability for molecular paths
parametrized by B-spline curves.
| physics.chem-ph physics.comp-ph | transition states and minimum energy paths are essential to understand and predict chemical reactivity doubleended methods represent a standard approach for their determination we introduce a new doubleended method that optimizes reaction paths described by curves unlike other methods our approach optimizes the curve parameters rather than distinct structures along the path with molecular paths represented as continuous curves the optimization can benefit from the advantages of an integralbased formulation we call this approach readuct and demonstrate its applicability for molecular paths parametrized by bspline curves | [['transition', 'states', 'and', 'minimum', 'energy', 'paths', 'are', 'essential', 'to', 'understand', 'and', 'predict', 'chemical', 'reactivity', 'doubleended', 'methods', 'represent', 'a', 'standard', 'approach', 'for', 'their', 'determination', 'we', 'introduce', 'a', 'new', 'doubleended', 'method', 'that', 'optimizes', 'reaction', 'paths', 'described', 'by', 'curves', 'unlike', 'other', 'methods', 'our', 'approach', 'optimizes', 'the', 'curve', 'parameters', 'rather', 'than', 'distinct', 'structures', 'along', 'the', 'path', 'with', 'molecular', 'paths', 'represented', 'as', 'continuous', 'curves', 'the', 'optimization', 'can', 'benefit', 'from', 'the', 'advantages', 'of', 'an', 'integralbased', 'formulation', 'we', 'call', 'this', 'approach', 'readuct', 'and', 'demonstrate', 'its', 'applicability', 'for', 'molecular', 'paths', 'parametrized', 'by', 'bspline', 'curves']] | [-0.07969187855830087, 0.07966922271383844, -0.1225915207174908, 0.06056209557059714, -0.07927889545612475, -0.13807136366582093, 0.10098889656364918, 0.43020509898607784, -0.31235888797570677, -0.3068680060479571, -0.0007820541367811315, -0.24955709033152637, -0.18530105580301845, 0.2332340031314422, -0.06649341489571858, 0.04775925928329611, 0.10511415904278264, -0.04353507446015582, -0.08296898006023291, -0.18328701388912605, 0.2723023576281883, 0.002934622994678862, 0.270986817988074, 0.01808096940683968, 0.11934326134950798, 0.048792762684581034, -0.019473756175926504, 0.02471852853675099, -0.16780191364412209, 0.18857430527192157, 0.2234538053326747, 0.16345426534466884, 0.2201309446902836, -0.4197393881704877, -0.29154733048669773, 0.09932808032368913, 0.13240845704670337, 0.08143145854804007, 0.0026621226851335344, -0.21499762660002006, 0.05283235051833531, -0.12032772420960314, -0.1755678102511036, -0.11712669801953084, -0.03341113171704552, 0.08245687191648518, -0.22670570622910471, 0.014152520566302187, -0.004372252704685225, 0.04603586302084081, -0.08068750281133415, -0.15640008511596962, -0.03470140885671272, 0.09852100248202024, -0.029366554736214526, 0.03076270077110487, 0.1472292880253757, -0.07659154391080579, -0.18908813884481787, 0.4209527112324448, -0.05155600922213018, -0.19976368092877023, 0.1577038713347386, -0.009137810926939197, -0.08344149880987757, 0.1749476843897034, 0.1429375305552693, 0.17133980446002062, -0.16730203391874537, 0.0392959552578224, 0.04020698128048988, 0.10150266306146102, 0.041998144365189706, 0.005535265755401376, 0.18317410559915623, 0.16567300165839055, 0.07029398773961207, 0.12907329488011515, -0.06402425970882178, -0.15092329508898888, -0.2578034303205855, -0.16268254708060448, -0.1731504927005838, -0.02120580608025193, -0.09486932580800973, -0.15950122755020857, 0.41611184648731175, 0.13893554675776293, 0.2209390507367275, 0.0998876736006316, 0.3182204213705571, 0.10211695513194975, 0.062438577821697386, 0.08051829458597828, 0.1733253893223317, 0.08249978537616484, 0.03832483245059848, -0.22134736741016456, 0.11643404453883276, 0.09972464214900838] |
1,802.0567 | Breaking of Large Amplitude Relativistically Intense Electron Plasma
Waves in a Warm Plasma | In this paper, the effect of finite electron temperature on the space-time
evolution and breaking of a large amplitude relativistically intense electron
plasma wave has been studied, using a 1-D relativistic Particle-in-Cell (PIC)
code. We have found that for phase velocities for which $\gamma _\phi \ll 1 +
\frac{k_BT_e}{mc^2}$, the wave damps within a few plasma period and essentially
follows the relativistic Landau Damping rate predicted by Buti. In the opposite
regime (i.e. for $\gamma _\phi \gg 1 + \frac{k_BT_e}{mc^2}$) we have observed
that waves propagate through the system for a long period of time and in small
amplitude limit follow the relativistic warm plasma dispersion relation.
Further we have demonstrated that in the same regime (i.e. for $\gamma _\phi
\gg 1 + \frac{k_BT_e}{mc^2}$), for the phase velocities less than the velocity
of light $c$, like the cold plasma Akhiezer - Polovin wave, in a warm plasma
also, relativistically intense waves break via phase mixing when perturbed by
an arbitrarily small amplitude longitudinal perturbation. Using the simulation
results, we have also shown that the phase mixing time scale in a warm plasma
can be interpreted using Dawson's formula for phase mixing time for a
non-relativistic cold inhomogeneous plasma, which is based on out of phase
motion of neighbouring oscillators constituting the wave.
| physics.plasm-ph | in this paper the effect of finite electron temperature on the spacetime evolution and breaking of a large amplitude relativistically intense electron plasma wave has been studied using a 1d relativistic particleincell pic code we have found that for phase velocities for which gamma _phi ll 1 frack_bt_emc2 the wave damps within a few plasma period and essentially follows the relativistic landau damping rate predicted by buti in the opposite regime ie for gamma _phi gg 1 frack_bt_emc2 we have observed that waves propagate through the system for a long period of time and in small amplitude limit follow the relativistic warm plasma dispersion relation further we have demonstrated that in the same regime ie for gamma _phi gg 1 frack_bt_emc2 for the phase velocities less than the velocity of light c like the cold plasma akhiezer polovin wave in a warm plasma also relativistically intense waves break via phase mixing when perturbed by an arbitrarily small amplitude longitudinal perturbation using the simulation results we have also shown that the phase mixing time scale in a warm plasma can be interpreted using dawsons formula for phase mixing time for a nonrelativistic cold inhomogeneous plasma which is based on out of phase motion of neighbouring oscillators constituting the wave | [['in', 'this', 'paper', 'the', 'effect', 'of', 'finite', 'electron', 'temperature', 'on', 'the', 'spacetime', 'evolution', 'and', 'breaking', 'of', 'a', 'large', 'amplitude', 'relativistically', 'intense', 'electron', 'plasma', 'wave', 'has', 'been', 'studied', 'using', 'a', '1d', 'relativistic', 'particleincell', 'pic', 'code', 'we', 'have', 'found', 'that', 'for', 'phase', 'velocities', 'for', 'which', 'gamma', '_phi', 'll', '1', 'frack_bt_emc2', 'the', 'wave', 'damps', 'within', 'a', 'few', 'plasma', 'period', 'and', 'essentially', 'follows', 'the', 'relativistic', 'landau', 'damping', 'rate', 'predicted', 'by', 'buti', 'in', 'the', 'opposite', 'regime', 'ie', 'for', 'gamma', '_phi', 'gg', '1', 'frack_bt_emc2', 'we', 'have', 'observed', 'that', 'waves', 'propagate', 'through', 'the', 'system', 'for', 'a', 'long', 'period', 'of', 'time', 'and', 'in', 'small', 'amplitude', 'limit', 'follow', 'the', 'relativistic', 'warm', 'plasma', 'dispersion', 'relation', 'further', 'we', 'have', 'demonstrated', 'that', 'in', 'the', 'same', 'regime', 'ie', 'for', 'gamma', '_phi', 'gg', '1', 'frack_bt_emc2', 'for', 'the', 'phase', 'velocities', 'less', 'than', 'the', 'velocity', 'of', 'light', 'c', 'like', 'the', 'cold', 'plasma', 'akhiezer', 'polovin', 'wave', 'in', 'a', 'warm', 'plasma', 'also', 'relativistically', 'intense', 'waves', 'break', 'via', 'phase', 'mixing', 'when', 'perturbed', 'by', 'an', 'arbitrarily', 'small', 'amplitude', 'longitudinal', 'perturbation', 'using', 'the', 'simulation', 'results', 'we', 'have', 'also', 'shown', 'that', 'the', 'phase', 'mixing', 'time', 'scale', 'in', 'a', 'warm', 'plasma', 'can', 'be', 'interpreted', 'using', 'dawsons', 'formula', 'for', 'phase', 'mixing', 'time', 'for', 'a', 'nonrelativistic', 'cold', 'inhomogeneous', 'plasma', 'which', 'is', 'based', 'on', 'out', 'of', 'phase', 'motion', 'of', 'neighbouring', 'oscillators', 'constituting', 'the', 'wave']] | [-0.15325213771072724, 0.28722475814259923, -0.08722813036922672, 0.05291404227550695, -0.012913733774769133, -0.11206111524159601, -0.006602866637547487, 0.3757520837412364, -0.2179534792414178, -0.246755579099563, 0.048590342120823096, -0.23606751271403184, -0.04568620985328863, 0.20906191054227705, 0.06890849647610471, 0.04721023521390586, 0.021817834945485573, -0.009879419039080036, -0.041339799577307296, -0.12268643575447166, 0.2843529628927185, 0.07641177918370542, 0.21793348492451625, 0.018233964932803513, 0.08583682611503679, -0.029767685132281143, 0.010303011950013196, 0.013329694101559942, -0.11941594588518276, -0.06234282692939331, 0.17814844239453656, 0.007121377579579894, 0.24043152024654518, -0.4439992408587593, -0.28015349877566315, 0.030571340614758826, 0.20197033654259527, 0.10586687088899026, -0.07600076269731826, -0.2643769042957844, 0.011107756452553946, -0.1937314020919699, -0.16087442005710037, -0.00034624535887353664, 0.08416872794609427, 0.017101460649375465, -0.2758312224396977, 0.13161938209767152, 0.03322947239458273, 0.018924736757515277, -0.017789200782620657, -0.06988196215054678, -0.036409217326908605, 0.02415659630534482, 0.07305052245692642, 0.07734754753685984, 0.1084514026640316, -0.10439595022151058, -0.02254153470337787, 0.4172489197321848, -0.13700527268168594, -0.13236123475061667, 0.16068794823235918, -0.22515258231708682, -0.10525314979804094, 0.21438599204091166, 0.16449416598872, 0.09392372024209567, -0.09412784548258411, 0.05559463131017668, -0.043336960221337074, 0.16285067438237946, 0.13922933589865044, 0.03173954394794461, 0.22038467488013172, 0.1361250266402393, -0.013990227648187518, 0.08131058642203168, -0.1419285097832067, -0.05525489007055327, -0.292112393003263, -0.10934919409525855, -0.15593002057197877, 0.0281416814004359, -0.07121980451768689, -0.14129994236928825, 0.38518980914357925, 0.14201392001936528, 0.14687555184776802, 0.01581293196813316, 0.27352489160760735, 0.1676722458622234, 0.007850199719752603, 0.12989716564534584, 0.30220584854505256, 0.16161359899681835, 0.10702528281627753, -0.25231352852036554, 0.01189494771986372, 0.04795914151197398] |
1,802.05671 | Can a Fingerprint be Modelled by a Differential Equation ? | Some new directions to lay a rigorous mathematical foundation for the
phase-portrait-based modelling of fingerprints are discussed in the present
work. Couched in the language of dynamical systems, and preparing to a
preliminary modelling, a back-to-basics analogy between Poincar\'{e}'s
categories of equilibria of planar differential systems and the basic
fingerprint singularities according to Purkyn\v{e}-Galton's standards is first
investigated. Then, the problem of the global representation of a fingerprint's
flow-like pattern as a smooth deformation of the phase portrait of a
differential system is addressed. Unlike visualisation in fluid dynamics, where
similarity between integral curves of smooth vector fields and flow streamline
patterns is eye-catching, the case of an oriented texture like a fingerprint's
stream of ridges proved to be a hard problem since, on the one hand, not all
fingerprint singularities and nearby orientational behaviour can be modelled by
canonical phase portraits on the plane, and on the other hand, even if it were
the case, this should lead to a perplexing geometrical problem of connecting
local phase portraits, a question which will be formulated within
Poincar\'{e}'s index theory and addressed via a normal form approach as a
bivariate Hermite interpolation problem. To a certain extent, the material
presented herein is self-contained and provides a baseline for future work
where, starting from a normal form as a source image, a transport via large
deformation flows is envisaged to match the fingerprint as a target image.
| math.DS | some new directions to lay a rigorous mathematical foundation for the phaseportraitbased modelling of fingerprints are discussed in the present work couched in the language of dynamical systems and preparing to a preliminary modelling a backtobasics analogy between poincares categories of equilibria of planar differential systems and the basic fingerprint singularities according to purkynvegaltons standards is first investigated then the problem of the global representation of a fingerprints flowlike pattern as a smooth deformation of the phase portrait of a differential system is addressed unlike visualisation in fluid dynamics where similarity between integral curves of smooth vector fields and flow streamline patterns is eyecatching the case of an oriented texture like a fingerprints stream of ridges proved to be a hard problem since on the one hand not all fingerprint singularities and nearby orientational behaviour can be modelled by canonical phase portraits on the plane and on the other hand even if it were the case this should lead to a perplexing geometrical problem of connecting local phase portraits a question which will be formulated within poincares index theory and addressed via a normal form approach as a bivariate hermite interpolation problem to a certain extent the material presented herein is selfcontained and provides a baseline for future work where starting from a normal form as a source image a transport via large deformation flows is envisaged to match the fingerprint as a target image | [['some', 'new', 'directions', 'to', 'lay', 'a', 'rigorous', 'mathematical', 'foundation', 'for', 'the', 'phaseportraitbased', 'modelling', 'of', 'fingerprints', 'are', 'discussed', 'in', 'the', 'present', 'work', 'couched', 'in', 'the', 'language', 'of', 'dynamical', 'systems', 'and', 'preparing', 'to', 'a', 'preliminary', 'modelling', 'a', 'backtobasics', 'analogy', 'between', 'poincares', 'categories', 'of', 'equilibria', 'of', 'planar', 'differential', 'systems', 'and', 'the', 'basic', 'fingerprint', 'singularities', 'according', 'to', 'purkynvegaltons', 'standards', 'is', 'first', 'investigated', 'then', 'the', 'problem', 'of', 'the', 'global', 'representation', 'of', 'a', 'fingerprints', 'flowlike', 'pattern', 'as', 'a', 'smooth', 'deformation', 'of', 'the', 'phase', 'portrait', 'of', 'a', 'differential', 'system', 'is', 'addressed', 'unlike', 'visualisation', 'in', 'fluid', 'dynamics', 'where', 'similarity', 'between', 'integral', 'curves', 'of', 'smooth', 'vector', 'fields', 'and', 'flow', 'streamline', 'patterns', 'is', 'eyecatching', 'the', 'case', 'of', 'an', 'oriented', 'texture', 'like', 'a', 'fingerprints', 'stream', 'of', 'ridges', 'proved', 'to', 'be', 'a', 'hard', 'problem', 'since', 'on', 'the', 'one', 'hand', 'not', 'all', 'fingerprint', 'singularities', 'and', 'nearby', 'orientational', 'behaviour', 'can', 'be', 'modelled', 'by', 'canonical', 'phase', 'portraits', 'on', 'the', 'plane', 'and', 'on', 'the', 'other', 'hand', 'even', 'if', 'it', 'were', 'the', 'case', 'this', 'should', 'lead', 'to', 'a', 'perplexing', 'geometrical', 'problem', 'of', 'connecting', 'local', 'phase', 'portraits', 'a', 'question', 'which', 'will', 'be', 'formulated', 'within', 'poincares', 'index', 'theory', 'and', 'addressed', 'via', 'a', 'normal', 'form', 'approach', 'as', 'a', 'bivariate', 'hermite', 'interpolation', 'problem', 'to', 'a', 'certain', 'extent', 'the', 'material', 'presented', 'herein', 'is', 'selfcontained', 'and', 'provides', 'a', 'baseline', 'for', 'future', 'work', 'where', 'starting', 'from', 'a', 'normal', 'form', 'as', 'a', 'source', 'image', 'a', 'transport', 'via', 'large', 'deformation', 'flows', 'is', 'envisaged', 'to', 'match', 'the', 'fingerprint', 'as', 'a', 'target', 'image']] | [-0.1307947815151018, 0.06347926155969366, -0.15176035366663387, 0.07273360937111208, -0.09708098124849193, -0.13213836891699085, 0.016981982781074073, 0.33474913778602433, -0.30363883308118916, -0.2618016923500771, 0.1308599690508282, -0.2573881911631706, -0.17995267259338388, 0.20762700093548808, -0.07628029267452176, 0.04606447288774532, 0.0418846667403002, 0.03726388642801261, -0.07021549967888358, -0.18612413823901644, 0.3162457818107214, 0.012920610265453058, 0.27824111597548273, 0.022430894167788713, 0.09384181897420886, 0.004858648562041144, -0.024138018488883972, 0.052538364809246056, -0.1047290832140224, 0.11088405666543685, 0.28203913088333954, 0.10054136147714574, 0.227545166062994, -0.41342743014884664, -0.22154339146398908, 0.07189937782923467, 0.14594542989828463, 0.10254489421703479, -0.05663818451786687, -0.2780965597164046, 0.06389728183666162, -0.12210845772040493, -0.14237565862151377, -0.06882972512815694, 0.025211021699541217, 0.016120039019432594, -0.23414450012105276, 0.04446138865876429, 0.08214503010558788, 0.10227895512271688, -0.06081109315032493, -0.0555988703780368, -0.0236863603711064, 0.1410631232469439, 0.01746424345664905, 0.06330686643747774, 0.0999337035868064, -0.14789209947901263, -0.1087113459261359, 0.43035898009186674, -0.04434699839099455, -0.23480708871522502, 0.1691576852704045, -0.09628060175475248, -0.11549357576235518, 0.11015150830518969, 0.17244836390781185, 0.13767219261046257, -0.1582121105126009, 0.03366687321651061, -0.052795655866718555, 0.1513796053582939, 0.07036635730564113, -0.012120917626126701, 0.24333483749069273, 0.1657755714183842, 0.053162191151480735, 0.14646895836104423, -0.0698743212583238, -0.10839899416294366, -0.29906922645850814, -0.17805848859593268, -0.1602995137529496, 0.024793788269907337, -0.05053889625942874, -0.18964713736605862, 0.4033377664984136, 0.09221579472068697, 0.22816510048718994, -0.0038229645403495445, 0.2857240315863927, 0.07863935915520415, 0.027694094207555312, 0.017481503402889537, 0.1990361045590644, 0.11995553571614437, 0.1135751128754707, -0.1527662206780374, 0.06990876359210735, 0.10323995207376167] |
1,802.05672 | Event Nugget Detection with Forward-Backward Recurrent Neural Networks | Traditional event detection methods heavily rely on manually engineered rich
features. Recent deep learning approaches alleviate this problem by automatic
feature engineering. But such efforts, like tradition methods, have so far only
focused on single-token event mentions, whereas in practice events can also be
a phrase. We instead use forward-backward recurrent neural networks (FBRNNs) to
detect events that can be either words or phrases. To the best our knowledge,
this is one of the first efforts to handle multi-word events and also the first
attempt to use RNNs for event detection. Experimental results demonstrate that
FBRNN is competitive with the state-of-the-art methods on the ACE 2005 and the
Rich ERE 2015 event detection tasks.
| cs.CL | traditional event detection methods heavily rely on manually engineered rich features recent deep learning approaches alleviate this problem by automatic feature engineering but such efforts like tradition methods have so far only focused on singletoken event mentions whereas in practice events can also be a phrase we instead use forwardbackward recurrent neural networks fbrnns to detect events that can be either words or phrases to the best our knowledge this is one of the first efforts to handle multiword events and also the first attempt to use rnns for event detection experimental results demonstrate that fbrnn is competitive with the stateoftheart methods on the ace 2005 and the rich ere 2015 event detection tasks | [['traditional', 'event', 'detection', 'methods', 'heavily', 'rely', 'on', 'manually', 'engineered', 'rich', 'features', 'recent', 'deep', 'learning', 'approaches', 'alleviate', 'this', 'problem', 'by', 'automatic', 'feature', 'engineering', 'but', 'such', 'efforts', 'like', 'tradition', 'methods', 'have', 'so', 'far', 'only', 'focused', 'on', 'singletoken', 'event', 'mentions', 'whereas', 'in', 'practice', 'events', 'can', 'also', 'be', 'a', 'phrase', 'we', 'instead', 'use', 'forwardbackward', 'recurrent', 'neural', 'networks', 'fbrnns', 'to', 'detect', 'events', 'that', 'can', 'be', 'either', 'words', 'or', 'phrases', 'to', 'the', 'best', 'our', 'knowledge', 'this', 'is', 'one', 'of', 'the', 'first', 'efforts', 'to', 'handle', 'multiword', 'events', 'and', 'also', 'the', 'first', 'attempt', 'to', 'use', 'rnns', 'for', 'event', 'detection', 'experimental', 'results', 'demonstrate', 'that', 'fbrnn', 'is', 'competitive', 'with', 'the', 'stateoftheart', 'methods', 'on', 'the', 'ace', '2005', 'and', 'the', 'rich', 'ere', '2015', 'event', 'detection', 'tasks']] | [0.0006188776291570061, 0.00477883943780658, -0.05604562890948728, 0.128251689782441, -0.18997121102126716, -0.14528123660628417, 0.04837329416269703, 0.45428719258468064, -0.23736066180364496, -0.3449455591741883, 0.11743208042441568, -0.3397039165554036, -0.19257622582413855, 0.19210837743438397, -0.12996791798754462, 0.06835559764710654, 0.18153718540582173, 0.05682177198988419, -0.05525588098264832, -0.2808146067712057, 0.2752824477107164, 0.07171773384756566, 0.33849741268204525, 0.024111483774114668, 0.10563266720938762, -0.04795125317260889, -0.07551086464913428, -0.033927136034305604, -0.054130489957320345, 0.14515206859609212, 0.35316089605579953, 0.22510629268851648, 0.2820043274633853, -0.4341723765329724, -0.26427222515589427, 0.09674499828335163, 0.15879052897383059, 0.13549451102049456, -0.022293566188766687, -0.37106013145031674, 0.06357276048843882, -0.18469791882255646, 0.04689158045636889, -0.11560843306194458, 0.007510740833822638, 0.006947473664435425, -0.21921761656787048, 0.02944874023783736, 0.13029290936953788, 0.037969699096200724, 0.027586546703657535, -0.09120728207926732, 0.06891470552675726, 0.1341562727902783, 0.07758270533979937, 0.0593823418478548, 0.13505763716031133, -0.16253153065086476, -0.23929818704657788, 0.31585306364909876, -0.06290974003059091, -0.1774504561804601, 0.2512100236303273, -0.0362401024945679, -0.21739979242556728, 0.11020931878218627, 0.22752360201723473, 0.17137158250261564, -0.17867267996604955, 0.0040176431154707514, -0.0003146462009421417, 0.2232533905272638, 0.06413147323265937, -0.010558620935236311, 0.22057459206968946, 0.22957681077033548, 0.005312802870841031, 0.042696724974250956, -0.13568156194274447, -0.036311526516718526, -0.1757781225938483, -0.08402179293001868, -0.16539175900730438, -0.029463265782916487, -0.006691917814220817, -0.15176003600936383, 0.37024714698366423, 0.25210874439549763, 0.2125571337175123, 0.04451460390451497, 0.3523528757505119, 0.035889419873585994, 0.14810898259747773, 0.0656257882157141, 0.24555404573454456, -0.042681373414650024, 0.15676445397132607, -0.13086805825670517, 0.16192604443702813, 0.06781178555268395] |
1,802.05673 | Parallel magnetic field suppresses dissipation in superconducting
nanostrips | The motion of Abrikosov vortices in type-II superconductors results in a
finite resistance in the presence of an applied electric current. Elimination
or reduction of the resistance via immobilization of vortices is the "holy
grail" of superconductivity research. Common wisdom dictates that an increase
in the magnetic field escalates the loss of energy since the number of vortices
increases. Here we show that this is no longer true if the magnetic field and
the current are applied parallel to each other.Our experimental studies on the
resistive behavior of a superconducting Mo$_{0.79}$Ge$_{0.21}$ nanostrip reveal
the emergence of a dissipative state with increasing magnetic field, followed
by a pronounced resistance drop, signifying a reentrance to the superconducting
state. Large-scale simulations of the 3D time-dependent Ginzburg-Landau model
indicate that the intermediate resistive state is due to an unwinding of
twisted vortices. When the magnetic field increases, this instability is
suppressed due to a better accommodation of the vortex lattice to the pinning
configuration. Our findings show that magnetic field and geometrical
confinement can suppress the dissipation induced by vortex motion and thus
radically improve the performance of superconducting materials.
| cond-mat.mes-hall | the motion of abrikosov vortices in typeii superconductors results in a finite resistance in the presence of an applied electric current elimination or reduction of the resistance via immobilization of vortices is the holy grail of superconductivity research common wisdom dictates that an increase in the magnetic field escalates the loss of energy since the number of vortices increases here we show that this is no longer true if the magnetic field and the current are applied parallel to each otherour experimental studies on the resistive behavior of a superconducting mo_079ge_021 nanostrip reveal the emergence of a dissipative state with increasing magnetic field followed by a pronounced resistance drop signifying a reentrance to the superconducting state largescale simulations of the 3d timedependent ginzburglandau model indicate that the intermediate resistive state is due to an unwinding of twisted vortices when the magnetic field increases this instability is suppressed due to a better accommodation of the vortex lattice to the pinning configuration our findings show that magnetic field and geometrical confinement can suppress the dissipation induced by vortex motion and thus radically improve the performance of superconducting materials | [['the', 'motion', 'of', 'abrikosov', 'vortices', 'in', 'typeii', 'superconductors', 'results', 'in', 'a', 'finite', 'resistance', 'in', 'the', 'presence', 'of', 'an', 'applied', 'electric', 'current', 'elimination', 'or', 'reduction', 'of', 'the', 'resistance', 'via', 'immobilization', 'of', 'vortices', 'is', 'the', 'holy', 'grail', 'of', 'superconductivity', 'research', 'common', 'wisdom', 'dictates', 'that', 'an', 'increase', 'in', 'the', 'magnetic', 'field', 'escalates', 'the', 'loss', 'of', 'energy', 'since', 'the', 'number', 'of', 'vortices', 'increases', 'here', 'we', 'show', 'that', 'this', 'is', 'no', 'longer', 'true', 'if', 'the', 'magnetic', 'field', 'and', 'the', 'current', 'are', 'applied', 'parallel', 'to', 'each', 'otherour', 'experimental', 'studies', 'on', 'the', 'resistive', 'behavior', 'of', 'a', 'superconducting', 'mo_079ge_021', 'nanostrip', 'reveal', 'the', 'emergence', 'of', 'a', 'dissipative', 'state', 'with', 'increasing', 'magnetic', 'field', 'followed', 'by', 'a', 'pronounced', 'resistance', 'drop', 'signifying', 'a', 'reentrance', 'to', 'the', 'superconducting', 'state', 'largescale', 'simulations', 'of', 'the', '3d', 'timedependent', 'ginzburglandau', 'model', 'indicate', 'that', 'the', 'intermediate', 'resistive', 'state', 'is', 'due', 'to', 'an', 'unwinding', 'of', 'twisted', 'vortices', 'when', 'the', 'magnetic', 'field', 'increases', 'this', 'instability', 'is', 'suppressed', 'due', 'to', 'a', 'better', 'accommodation', 'of', 'the', 'vortex', 'lattice', 'to', 'the', 'pinning', 'configuration', 'our', 'findings', 'show', 'that', 'magnetic', 'field', 'and', 'geometrical', 'confinement', 'can', 'suppress', 'the', 'dissipation', 'induced', 'by', 'vortex', 'motion', 'and', 'thus', 'radically', 'improve', 'the', 'performance', 'of', 'superconducting', 'materials']] | [-0.2087133050891166, 0.21586354327621887, -0.03597665985960149, 0.010434269906355716, -0.07341451229497223, -0.09316930646562706, 0.05151200754714765, 0.322259662774108, -0.26403166949192225, -0.29460078971865383, 0.03429153088085434, -0.248644552108485, -0.12206367076420144, 0.19305881044609755, -0.022289015810794965, -0.011614389879548031, 0.005734895662222381, 0.03279814184719251, -0.0607887433902563, -0.22269306697454222, 0.3092127919637436, 0.039069897412960214, 0.3891891884167031, 0.08775353887746029, 0.042014246196587286, -0.04021505469522115, 0.08360055988937941, 0.0926595202282719, -0.1095716231839501, 0.049467931386417426, 0.17945272732622866, -0.04129863923425665, 0.2515204142900589, -0.4988783571828643, -0.22841319470646101, 0.051935248274315636, 0.15839099244508165, 0.16379065964998596, -0.05568939686813594, -0.2716766541656714, 0.08571409510256237, -0.11873764597998082, -0.13954946378488903, -0.0662746328895952, 0.010326385051840865, 0.022509835061614664, -0.26461049626168853, 0.08698775344173951, 0.09423129800352795, 0.09194116923532894, -0.10867974277378221, -0.05549763950504079, -0.053697821527274085, 0.035935632202618646, 0.08476413238436774, 0.1146967873804818, 0.18171049737999134, -0.22016304274059265, -0.13578417155329828, 0.3285467817306357, -0.04010464573714315, -0.1190405422340795, 0.15730370982023684, -0.15680701500462854, -0.021778637020400747, 0.1909524557362918, 0.11797959717375267, 0.060923564995628905, -0.07089515728535922, 0.017687253044404435, -0.012324705955309226, 0.16235861795038267, 0.02427631802414038, 0.02094999526731123, 0.26419482245641435, 0.2417123388516737, 0.05620056230564723, 0.15880979525062014, -0.13113544969794177, -0.08870847797168055, -0.26920211765125557, -0.1803310610032539, -0.1939388169684326, 0.061529583033204646, -0.05479687072250311, -0.21664658822777236, 0.38644243656080624, 0.20593307040247094, 0.174091559027147, -0.07134210084737076, 0.28404944285790884, 0.107635987541036, 0.10843466227600837, 0.0632317487059323, 0.276451876802046, 0.17160027209699721, 0.15215643692246647, -0.34524593645018403, 0.05687122654331767, -0.006455496725444074] |
1,802.05674 | Clustering and assembly dynamics of a one-dimensional microphase former | Both ordered and disordered microphases ubiquitously form in suspensions of
particles that interact through competing short-range attraction and long-range
repulsion (SALR). While ordered microphases are more appealing materials
targets, understanding the rich structural and dynamical properties of their
disordered counterparts is essential to controlling their mesoscale assembly.
Here, we study the disordered regime of a one-dimensional (1D) SALR model,
whose simplicity enables detailed analysis by transfer matrices and Monte Carlo
simulations. We first characterize the signature of the clustering process on
macroscopic observables, and then assess the equilibration dynamics of various
simulation algorithms. We notably find that cluster moves markedly accelerate
the mixing time, but that event chains are of limited help in the clustering
regime. These insights will guide further study of three-dimensional microphase
formers.
| cond-mat.soft | both ordered and disordered microphases ubiquitously form in suspensions of particles that interact through competing shortrange attraction and longrange repulsion salr while ordered microphases are more appealing materials targets understanding the rich structural and dynamical properties of their disordered counterparts is essential to controlling their mesoscale assembly here we study the disordered regime of a onedimensional 1d salr model whose simplicity enables detailed analysis by transfer matrices and monte carlo simulations we first characterize the signature of the clustering process on macroscopic observables and then assess the equilibration dynamics of various simulation algorithms we notably find that cluster moves markedly accelerate the mixing time but that event chains are of limited help in the clustering regime these insights will guide further study of threedimensional microphase formers | [['both', 'ordered', 'and', 'disordered', 'microphases', 'ubiquitously', 'form', 'in', 'suspensions', 'of', 'particles', 'that', 'interact', 'through', 'competing', 'shortrange', 'attraction', 'and', 'longrange', 'repulsion', 'salr', 'while', 'ordered', 'microphases', 'are', 'more', 'appealing', 'materials', 'targets', 'understanding', 'the', 'rich', 'structural', 'and', 'dynamical', 'properties', 'of', 'their', 'disordered', 'counterparts', 'is', 'essential', 'to', 'controlling', 'their', 'mesoscale', 'assembly', 'here', 'we', 'study', 'the', 'disordered', 'regime', 'of', 'a', 'onedimensional', '1d', 'salr', 'model', 'whose', 'simplicity', 'enables', 'detailed', 'analysis', 'by', 'transfer', 'matrices', 'and', 'monte', 'carlo', 'simulations', 'we', 'first', 'characterize', 'the', 'signature', 'of', 'the', 'clustering', 'process', 'on', 'macroscopic', 'observables', 'and', 'then', 'assess', 'the', 'equilibration', 'dynamics', 'of', 'various', 'simulation', 'algorithms', 'we', 'notably', 'find', 'that', 'cluster', 'moves', 'markedly', 'accelerate', 'the', 'mixing', 'time', 'but', 'that', 'event', 'chains', 'are', 'of', 'limited', 'help', 'in', 'the', 'clustering', 'regime', 'these', 'insights', 'will', 'guide', 'further', 'study', 'of', 'threedimensional', 'microphase', 'formers']] | [-0.1123837745805744, 0.22065257440720284, -0.10978847209526787, 0.10430792025029707, -0.03316122428735807, -0.13378202084485175, 0.018053957310113465, 0.416864552409462, -0.28209717349252766, -0.28050191080685527, 0.042829142527706504, -0.3012995769838906, -0.18877749585561335, 0.12335707323204372, 0.09448173765595706, 0.02542715551265116, 0.06693964247362659, -0.07349544537756296, -0.07964532883165197, -0.19395843529630274, 0.25412376316556234, 0.07379584313584639, 0.28796342515297946, 0.035364892880713185, 0.035860030660553585, 0.03482973027146525, -0.004724658744794036, 0.05078037806032669, -0.20267673935236488, 0.07870618647910536, 0.22400401816481635, 0.02071596431871137, 0.22643076791797603, -0.4808759955718877, -0.253030533071733, 0.09698058872128881, 0.21238769923839423, 0.12141218319205412, -0.06284904763777463, -0.2904884211039023, 0.0469047591711084, -0.16121989043451668, -0.12905326809009743, -0.15197232400348026, -0.004867981868012557, 0.0960295216826212, -0.22083415782877377, 0.10880705946317268, 0.10678765401202586, 0.05940244550121918, -0.0593225444752043, -0.059076045876339314, -0.03530770410240317, 0.13905357782052652, 0.00020808409802460423, -0.05609595796669878, 0.17654497341607653, -0.15940094253765272, -0.11167376839448624, 0.39607683938765337, 0.028758707470149688, -0.13715817225867852, 0.3243192795623419, -0.14820368876329637, -0.14102130954242534, 0.1658454774878919, 0.19328326017120928, 0.10547565287330173, -0.17970827366373252, 0.05307716008650863, 0.006655811154771419, 0.15662908222917135, -0.016091386998249663, 0.04483203247322568, 0.23264726780961076, 0.2369462170652927, 0.022006884476886913, 0.15058713586352365, -0.04896959292045, -0.20193200430182356, -0.19737143327467263, -0.15783176064816495, -0.18205992799134008, 0.011453855478773929, -0.12540829125807956, -0.1885808611820851, 0.3651435917949245, 0.2032502099782938, 0.15229126693226308, 0.023493663284055416, 0.22573149538994397, 0.01039042728879149, -0.0026471745703251118, -0.008769150965640115, 0.21517992485499393, 0.15805370595845733, 0.07694897356088318, -0.24230867511748025, 0.09048287903923276, 0.03310111828244454] |
1,802.05675 | Characterization of the X-ray Coherence Properties of an Undulator
Beamline at the Advanced Photon Source | In anticipation of the increased use of coherent x-ray methods and the need
to upgrade beamlines to match improved source quality, we have characterized
the coherence properties of the x-rays delivered by beamline 12ID-D at the
Advanced Photon Source. We compare the measured x-ray divergence, beam size,
brightness, and coherent flux at energies up to 26 keV to the calculated values
from the undulator source, and evaluate the effects of beamline optics such as
a mirror, monochromator, and compound refractive lenses. Diffraction patterns
from slits as a function of slit width are analyzed using wave propagation
theory to obtain the beam divergence and thus coherence length. Imaging of the
source using a compound refractive lens was found to be the most accurate
method for determining the vertical divergence. While the brightness and
coherent flux obtained without a monochromator ("pink beam") agree well with
those calculated for the source, those measured with the monochromator were a
factor of 3 to 6 lower than the source, primarily because of vertical
divergence introduced by the monochromator. The methods we describe should be
widely applicable for measuring the x-ray coherence properties of synchrotron
beamlines.
| physics.acc-ph | in anticipation of the increased use of coherent xray methods and the need to upgrade beamlines to match improved source quality we have characterized the coherence properties of the xrays delivered by beamline 12idd at the advanced photon source we compare the measured xray divergence beam size brightness and coherent flux at energies up to 26 kev to the calculated values from the undulator source and evaluate the effects of beamline optics such as a mirror monochromator and compound refractive lenses diffraction patterns from slits as a function of slit width are analyzed using wave propagation theory to obtain the beam divergence and thus coherence length imaging of the source using a compound refractive lens was found to be the most accurate method for determining the vertical divergence while the brightness and coherent flux obtained without a monochromator pink beam agree well with those calculated for the source those measured with the monochromator were a factor of 3 to 6 lower than the source primarily because of vertical divergence introduced by the monochromator the methods we describe should be widely applicable for measuring the xray coherence properties of synchrotron beamlines | [['in', 'anticipation', 'of', 'the', 'increased', 'use', 'of', 'coherent', 'xray', 'methods', 'and', 'the', 'need', 'to', 'upgrade', 'beamlines', 'to', 'match', 'improved', 'source', 'quality', 'we', 'have', 'characterized', 'the', 'coherence', 'properties', 'of', 'the', 'xrays', 'delivered', 'by', 'beamline', '12idd', 'at', 'the', 'advanced', 'photon', 'source', 'we', 'compare', 'the', 'measured', 'xray', 'divergence', 'beam', 'size', 'brightness', 'and', 'coherent', 'flux', 'at', 'energies', 'up', 'to', '26', 'kev', 'to', 'the', 'calculated', 'values', 'from', 'the', 'undulator', 'source', 'and', 'evaluate', 'the', 'effects', 'of', 'beamline', 'optics', 'such', 'as', 'a', 'mirror', 'monochromator', 'and', 'compound', 'refractive', 'lenses', 'diffraction', 'patterns', 'from', 'slits', 'as', 'a', 'function', 'of', 'slit', 'width', 'are', 'analyzed', 'using', 'wave', 'propagation', 'theory', 'to', 'obtain', 'the', 'beam', 'divergence', 'and', 'thus', 'coherence', 'length', 'imaging', 'of', 'the', 'source', 'using', 'a', 'compound', 'refractive', 'lens', 'was', 'found', 'to', 'be', 'the', 'most', 'accurate', 'method', 'for', 'determining', 'the', 'vertical', 'divergence', 'while', 'the', 'brightness', 'and', 'coherent', 'flux', 'obtained', 'without', 'a', 'monochromator', 'pink', 'beam', 'agree', 'well', 'with', 'those', 'calculated', 'for', 'the', 'source', 'those', 'measured', 'with', 'the', 'monochromator', 'were', 'a', 'factor', 'of', '3', 'to', '6', 'lower', 'than', 'the', 'source', 'primarily', 'because', 'of', 'vertical', 'divergence', 'introduced', 'by', 'the', 'monochromator', 'the', 'methods', 'we', 'describe', 'should', 'be', 'widely', 'applicable', 'for', 'measuring', 'the', 'xray', 'coherence', 'properties', 'of', 'synchrotron', 'beamlines']] | [-0.03287978392961637, 0.14607283215299643, -0.08855528997937365, 0.09067524290796389, -0.041757664165247683, -0.131890813445564, 0.008215650720534127, 0.469750195318493, -0.2324203029576758, -0.35832077364077564, 0.07539716759812402, -0.3300803171214524, 0.009292019617364363, 0.26389505847224165, -0.022797473425429964, 0.10401837906694575, 0.033740625664524494, -0.028602696479687457, -0.07427695719340431, -0.16071321866622876, 0.28398887539730855, 0.1529736856402701, 0.3131331200267942, 0.05414886591665289, 0.13283160838382269, 0.028875125714986728, -0.04434279047159685, -0.005609151419429552, -0.09265537040860013, 0.09799769614138222, 0.24677096953043942, 0.06368301983118284, 0.1616595087563077, -0.37957071985004753, -0.24867931862790432, 0.008302252246904625, 0.10450793900597895, 0.04075381713771513, -0.02786236279212904, -0.2532418200551537, 0.05294856021338433, -0.13334846560764446, -0.18503246942495621, 0.016029604774697746, -0.049801588301157586, 0.05905919393651414, -0.2233322515847191, 0.03348346106294128, -0.018916607939726895, 0.07977248128582404, -0.05249492438859922, -0.10565317405536204, 0.01766552001228014, 0.08290389204575192, 0.024761896964813037, 0.06773287338505267, 0.14685046830258908, -0.12866234552036207, -0.08963507502561524, 0.37050827802528463, -0.04705747356619064, -0.08508399086536239, 0.10649202323873483, -0.195105570472411, -0.03195800458785718, 0.2036112476012142, 0.14499726735126897, 0.09613040252958262, -0.1481535767264191, -0.032388385532487914, 0.03268372437002928, 0.2389926608952462, 0.1827873932505667, 0.07554356401500406, 0.19194185458340499, 0.12361222537660665, 0.02470872627211508, 0.171499922169402, -0.21089937442066098, 0.034496285771537155, -0.2683188260321027, -0.10669974203487284, -0.1580009517055399, 0.041838152383601356, -0.03956972092107337, -0.13633120573426366, 0.37354966651934085, 0.10101586878151884, 0.12806031252282163, -0.009119661618516874, 0.32669281697506825, 0.11982747086905259, 0.108251295478709, 0.03038483748222312, 0.2841326440758412, 0.1671393452927953, 0.12004267446642554, -0.25125746503250584, 0.052965409075594924, 0.012081501894586143] |
1,802.05676 | Actinium hydrides $AcH_{10}$, $AcH_{12}$, $AcH_{16}$ as high-temperature
conventional superconductors | Stability of numerous unexpected actinium hydrides was predicted via
evolutionary algorithm USPEX. Electron-phonon interaction was investigated for
the hydrogen-richest and most symmetric phases: R$\overline{3}$m-$AcH_{10}$,
I4/mmm-$AcH_{12}$ and P$\overline{6}$m2-$AcH_{16}$. Predicted structures of
actinium hydrides are consistent with all previously studied Ac-H phases and
demonstrate phonon-mediated high-temperature superconductivity with Tc in the
range 204-251 K for R$\overline{3}$m-$AcH_{10}$ at 200 GPa and 199-241 K for
P$\overline{6}$m2-$AcH_{16}$ at 150 GPa which was estimated by directly solving
of Eliashberg equation. Actinium belongs to the series of d1-elements
(Sc-Y-La-Ac) that form high-Tc superconducting (HTSC) hydrides. Combining this
observation with p0-HTSC hydrides ($MgH_{6}$ and $CaH_{6}$), we propose that
p0- and d1-atoms with low-lying empty orbitals tend to form phonon-mediated
HTSC metal polyhydrides.
| cond-mat.supr-con | stability of numerous unexpected actinium hydrides was predicted via evolutionary algorithm uspex electronphonon interaction was investigated for the hydrogenrichest and most symmetric phases roverline3mach_10 i4mmmach_12 and poverline6m2ach_16 predicted structures of actinium hydrides are consistent with all previously studied ach phases and demonstrate phononmediated hightemperature superconductivity with tc in the range 204251 k for roverline3mach_10 at 200 gpa and 199241 k for poverline6m2ach_16 at 150 gpa which was estimated by directly solving of eliashberg equation actinium belongs to the series of d1elements scylaac that form hightc superconducting htsc hydrides combining this observation with p0htsc hydrides mgh_6 and cah_6 we propose that p0 and d1atoms with lowlying empty orbitals tend to form phononmediated htsc metal polyhydrides | [['stability', 'of', 'numerous', 'unexpected', 'actinium', 'hydrides', 'was', 'predicted', 'via', 'evolutionary', 'algorithm', 'uspex', 'electronphonon', 'interaction', 'was', 'investigated', 'for', 'the', 'hydrogenrichest', 'and', 'most', 'symmetric', 'phases', 'roverline3mach_10', 'i4mmmach_12', 'and', 'poverline6m2ach_16', 'predicted', 'structures', 'of', 'actinium', 'hydrides', 'are', 'consistent', 'with', 'all', 'previously', 'studied', 'ach', 'phases', 'and', 'demonstrate', 'phononmediated', 'hightemperature', 'superconductivity', 'with', 'tc', 'in', 'the', 'range', '204251', 'k', 'for', 'roverline3mach_10', 'at', '200', 'gpa', 'and', '199241', 'k', 'for', 'poverline6m2ach_16', 'at', '150', 'gpa', 'which', 'was', 'estimated', 'by', 'directly', 'solving', 'of', 'eliashberg', 'equation', 'actinium', 'belongs', 'to', 'the', 'series', 'of', 'd1elements', 'scylaac', 'that', 'form', 'hightc', 'superconducting', 'htsc', 'hydrides', 'combining', 'this', 'observation', 'with', 'p0htsc', 'hydrides', 'mgh_6', 'and', 'cah_6', 'we', 'propose', 'that', 'p0', 'and', 'd1atoms', 'with', 'lowlying', 'empty', 'orbitals', 'tend', 'to', 'form', 'phononmediated', 'htsc', 'metal', 'polyhydrides']] | [-0.1121087299566716, 0.19894594688434153, -0.032263344335369766, 0.0041354756185319275, -0.04507897661664174, -0.1763706262409687, 0.14311911122407764, 0.40631165861152113, -0.21070345167652704, -0.2819336872547865, -0.022405366358580068, -0.3508750377502292, -0.1125294156651944, 0.1304074782691896, 0.11245226129889488, 0.02904197055264376, -0.05243400806095451, -0.04404353765770793, -0.11863813926931471, -0.2594897384615615, 0.2896171262656571, 0.018330536066787317, 0.28745394352823495, 0.04444290135288611, 0.004770984654314816, -0.095264490689151, 0.1611069236136973, 0.012693929546512663, -0.19176045833693933, 0.06003349319333211, 0.3770872190227965, -0.04600400493829511, 0.16895774819888174, -0.3944752816110849, -0.2655617849715054, 0.005508906869217753, 0.11887790011707694, 0.08959983337088488, -0.06338065751828253, -0.2879841895774007, 0.13086405001580714, -0.10083209985401481, -0.12129823353141546, -0.11391996796242893, 0.026384209049865603, -0.02501529369619675, -0.23279589738696813, 0.10047411384934093, -0.00701525560580194, 0.09630062237847596, -0.16911937641212715, -0.22607454176526517, -0.029144444102421403, -0.045909871807089074, 0.04733376568648964, 0.06521135429386049, 0.09881482164375484, -0.05782198832603171, -0.062178770480677485, 0.40520031308289617, -0.0390541893709451, 0.0883907266240567, 0.2050879567489028, -0.13461823180521607, -0.1171255652839318, 0.22824869041796775, 0.01830177175696008, 0.08954954656772315, -0.17114041600842028, 0.06908704477013089, 0.005371956760063768, 0.15805948225664906, 0.09432696723844856, 0.03452963806688786, 0.1811965238302946, 0.1915031192265451, -0.0428497485537082, 0.10067445342370775, -0.07178048364818096, -0.04954621324781328, -0.1678499048599042, -0.20021523209579756, -0.1584615014505107, 0.026270442926324904, -0.043275532137195115, -0.1429307128651999, 0.32689804026391356, 0.11958896176656708, 0.17080718810204418, -0.06029116365942173, 0.13500988251063972, 0.07563892495818436, 0.06191299841972068, 0.07067914097569883, 0.250965022444725, 0.207682109719608, 0.09392573919612915, -0.2836252939142287, 0.15457870468497276, 0.048378474581986665] |
1,802.05677 | Study of magnetized accretion flow with variable $\Gamma$ equation of
state | We present here the solutions of magnetized accretion flows on to a compact
object with hard surface such as neutron stars. The magnetic field of the
central star is assumed dipolar and the magnetic axis is assumed to be aligned
with the rotation axis of the star. We have used an equation of state for the
accreting fluid in which the adiabatic index is dependent on temperature and
composition of the flow. We have also included cooling processes like
bremsstrahlung and cyclotron processes in the accretion flow. We found all
possible accretion solutions. All accretion solutions terminate with a shock
very near to the star surface and the height of this primary shock do not vary
much with either the spin period or the Bernoulli parameter of the flow,
although the strength of the shock may vary with the period. For moderately
rotating central star there are possible formation of multiple sonic points in
the flow and therefore, a second shock far away from the star surface may also
form. However, the second shock is much weaker than the primary one near the
surface. We found that if rotation period is below a certain value $(\pmin)$,
then multiple critical points or multiple shocks are not possible and $\pmin$
depends upon the composition of the flow. We also found that cooling effect
dominates after the shock and that the cyclotron and the bremsstrahlung cooling
processes should be considered to obtain a consistent accretion solution.
| astro-ph.HE | we present here the solutions of magnetized accretion flows on to a compact object with hard surface such as neutron stars the magnetic field of the central star is assumed dipolar and the magnetic axis is assumed to be aligned with the rotation axis of the star we have used an equation of state for the accreting fluid in which the adiabatic index is dependent on temperature and composition of the flow we have also included cooling processes like bremsstrahlung and cyclotron processes in the accretion flow we found all possible accretion solutions all accretion solutions terminate with a shock very near to the star surface and the height of this primary shock do not vary much with either the spin period or the bernoulli parameter of the flow although the strength of the shock may vary with the period for moderately rotating central star there are possible formation of multiple sonic points in the flow and therefore a second shock far away from the star surface may also form however the second shock is much weaker than the primary one near the surface we found that if rotation period is below a certain value pmin then multiple critical points or multiple shocks are not possible and pmin depends upon the composition of the flow we also found that cooling effect dominates after the shock and that the cyclotron and the bremsstrahlung cooling processes should be considered to obtain a consistent accretion solution | [['we', 'present', 'here', 'the', 'solutions', 'of', 'magnetized', 'accretion', 'flows', 'on', 'to', 'a', 'compact', 'object', 'with', 'hard', 'surface', 'such', 'as', 'neutron', 'stars', 'the', 'magnetic', 'field', 'of', 'the', 'central', 'star', 'is', 'assumed', 'dipolar', 'and', 'the', 'magnetic', 'axis', 'is', 'assumed', 'to', 'be', 'aligned', 'with', 'the', 'rotation', 'axis', 'of', 'the', 'star', 'we', 'have', 'used', 'an', 'equation', 'of', 'state', 'for', 'the', 'accreting', 'fluid', 'in', 'which', 'the', 'adiabatic', 'index', 'is', 'dependent', 'on', 'temperature', 'and', 'composition', 'of', 'the', 'flow', 'we', 'have', 'also', 'included', 'cooling', 'processes', 'like', 'bremsstrahlung', 'and', 'cyclotron', 'processes', 'in', 'the', 'accretion', 'flow', 'we', 'found', 'all', 'possible', 'accretion', 'solutions', 'all', 'accretion', 'solutions', 'terminate', 'with', 'a', 'shock', 'very', 'near', 'to', 'the', 'star', 'surface', 'and', 'the', 'height', 'of', 'this', 'primary', 'shock', 'do', 'not', 'vary', 'much', 'with', 'either', 'the', 'spin', 'period', 'or', 'the', 'bernoulli', 'parameter', 'of', 'the', 'flow', 'although', 'the', 'strength', 'of', 'the', 'shock', 'may', 'vary', 'with', 'the', 'period', 'for', 'moderately', 'rotating', 'central', 'star', 'there', 'are', 'possible', 'formation', 'of', 'multiple', 'sonic', 'points', 'in', 'the', 'flow', 'and', 'therefore', 'a', 'second', 'shock', 'far', 'away', 'from', 'the', 'star', 'surface', 'may', 'also', 'form', 'however', 'the', 'second', 'shock', 'is', 'much', 'weaker', 'than', 'the', 'primary', 'one', 'near', 'the', 'surface', 'we', 'found', 'that', 'if', 'rotation', 'period', 'is', 'below', 'a', 'certain', 'value', 'pmin', 'then', 'multiple', 'critical', 'points', 'or', 'multiple', 'shocks', 'are', 'not', 'possible', 'and', 'pmin', 'depends', 'upon', 'the', 'composition', 'of', 'the', 'flow', 'we', 'also', 'found', 'that', 'cooling', 'effect', 'dominates', 'after', 'the', 'shock', 'and', 'that', 'the', 'cyclotron', 'and', 'the', 'bremsstrahlung', 'cooling', 'processes', 'should', 'be', 'considered', 'to', 'obtain', 'a', 'consistent', 'accretion', 'solution']] | [-0.1280828327737718, 0.1879882979894334, -0.07317733129490274, 0.06749958040455256, -0.10433276357520142, -0.08414405665203255, 0.016919408471672316, 0.38422169842193893, -0.25974419801170195, -0.2737089397247743, 0.11924962556313479, -0.2584708728923351, -0.0330481566718699, 0.23828929400793947, -0.0076316646108626094, -0.0020358183544796006, 0.03244652379104875, 0.057919159451108655, -0.06368240949179432, -0.19689743314177918, 0.3495859014437584, 0.06669981173266476, 0.1867102141944316, 0.046275855817184346, 0.04415863474501381, -0.06997103551824274, 0.02237643645475082, -0.0007717411025185828, -0.15112570379982265, 0.018274777082136137, 0.18177344769032466, 0.0749731299030468, 0.20029444235219876, -0.437204140664841, -0.23785216537104928, 0.07432006376147761, 0.17335351807958305, 0.07620829572937539, -0.04974444728793093, -0.19017169497707867, 0.06039047216107386, -0.17743913561882788, -0.1503256781356325, 0.028698444293635616, 0.04547957866404727, 0.05385299827165733, -0.2505366799355496, 0.09566892696836285, 0.10311811303417102, 0.025907995630584567, -0.12256071149705001, -0.05526021062952194, -0.09702159556725021, 0.08817693505243594, 0.11833167509099185, 0.08523340830138651, 0.1944960694541626, -0.14455085200134957, -0.04087176356740572, 0.4085050874960766, -0.06897693300753144, -0.1270826203717923, 0.24020213634063156, -0.22516828198718872, -0.10504184311271143, 0.19141587387739753, 0.14805527467188645, 0.14926523130114952, -0.09725767825902612, -0.02053092388098929, -0.024477092533874412, 0.17202838197151207, 0.08567131416289588, -0.023851296712104002, 0.30728349808427224, 0.12780379384867233, 0.05980008653338247, 0.10680848446007772, -0.16716903062544977, -0.07528334100220023, -0.27261066612372664, -0.11194407682359954, -0.1428254444521963, 0.0615040087985467, -0.09146816139310644, -0.17592880725200072, 0.3337913642689172, 0.11583668355055828, 0.18875899047824582, -0.01798908549615799, 0.2710604564336592, 0.16168342387627566, 0.06164367154853585, 0.17076753686879734, 0.3091944766119736, 0.15843997424211614, 0.11875928349892605, -0.2606289638496203, 0.0955819507616231, 0.015651932339770375] |
1,802.05678 | Maximum PBH Mass and Primordiality | In order to avoid unacceptable $\mu$-distortions inconsistent with
observational data on the Cosmic Microwave Background, Primordial Black Holes
(PBHs) must be less massive than $10^{12} M_{\odot}$, quite closely above the
highest black hole mass yet observed. This comparableness leads us to posit
that all supermassive black holes originate as PBHs.
| gr-qc astro-ph.GA hep-ph hep-th | in order to avoid unacceptable mudistortions inconsistent with observational data on the cosmic microwave background primordial black holes pbhs must be less massive than 1012 m_odot quite closely above the highest black hole mass yet observed this comparableness leads us to posit that all supermassive black holes originate as pbhs | [['in', 'order', 'to', 'avoid', 'unacceptable', 'mudistortions', 'inconsistent', 'with', 'observational', 'data', 'on', 'the', 'cosmic', 'microwave', 'background', 'primordial', 'black', 'holes', 'pbhs', 'must', 'be', 'less', 'massive', 'than', '1012', 'm_odot', 'quite', 'closely', 'above', 'the', 'highest', 'black', 'hole', 'mass', 'yet', 'observed', 'this', 'comparableness', 'leads', 'us', 'to', 'posit', 'that', 'all', 'supermassive', 'black', 'holes', 'originate', 'as', 'pbhs']] | [-0.11762632115515975, 0.17814049219750627, 0.029735266932165154, 0.2708090286469087, -0.15037068681867452, -0.09456609169553433, 0.007346590916740195, 0.27499440361802674, -0.045834909022158504, -0.41783061623573303, 0.04099930322738554, -0.3839380766968338, 0.024688093713959868, 0.23531230231176833, -0.10225028010579396, -0.02206744455105188, 0.006082606843995805, -0.015468953139319713, -0.04494217161222228, -0.2684407514871611, 0.35762343120438106, 0.2046218101239326, 0.20282051511873891, -0.07121913431316843, 0.02757097590876249, -0.16373704689345797, 0.01803112747527811, -0.020060411483353496, -0.1717956598560927, 0.01641101036125756, 0.2863561568439615, 0.20192424213627772, 0.1640575110000007, -0.46450768650642466, -0.24257249949614004, 0.14979616499372891, 0.2157693879336727, 0.1430806448987248, -0.14138668647501618, -0.23337821879101042, 0.15893694526534907, -0.27518016491465425, -0.11458764478982407, 0.035432801491637925, 0.014039488518800663, -0.11521344312599727, -0.1878054934192677, 0.22422045137619181, 0.032506010922774366, -0.21878771145580983, -0.12151989253351883, -0.029722416298273876, -0.08900789381480034, -0.011230795140549237, 0.20262931264480766, 0.09585720733074206, 0.2550545611171698, -0.026315535585293832, -0.04898966539042945, 0.3911861210909425, -0.0504310697175168, -0.001115943932411622, 0.19429786830228202, -0.34710758730617103, -0.1782933316972791, 0.16006931430679194, 0.14713888176317727, 0.15127760353403127, -0.1951469080997821, 0.04125728037407888, 0.07003976842768643, 0.26881859687213994, 0.18373566405961708, 0.1246453131244955, 0.5751191746747616, 0.061652904414400765, 0.03192004696370996, 0.026814914724257375, -0.022223979210937207, -0.008762900746066352, -0.1773729206500005, -0.016547951904334585, -0.1486914872918848, 0.1947723621483512, -0.22763370637002647, -0.1822941745536364, 0.21224713264679423, 0.18451298106157657, 0.2662020193564953, 0.014531796811177035, 0.25765025301445016, 0.04463260837032327, 0.0832665249163627, 0.09315174686418352, 0.3985836702798094, 0.13917910165096425, 0.11136433768694345, -0.19304882328273082, -0.010240688501876228, -0.03400975891521999] |
1,802.05679 | Experimental Demonstration of DDoS Mitigation over a Quantum Key
Distribution (QKD) Network Using Software Defined Networking (SDN) | We experimentally demonstrate, for the first time, DDoS mitigation of
QKD-based networks utilizing a software defined network application. Successful
quantum-secured link allocation is achieved after a DDoS attack based on
real-time monitoring of quantum parameters
| cs.CR | we experimentally demonstrate for the first time ddos mitigation of qkdbased networks utilizing a software defined network application successful quantumsecured link allocation is achieved after a ddos attack based on realtime monitoring of quantum parameters | [['we', 'experimentally', 'demonstrate', 'for', 'the', 'first', 'time', 'ddos', 'mitigation', 'of', 'qkdbased', 'networks', 'utilizing', 'a', 'software', 'defined', 'network', 'application', 'successful', 'quantumsecured', 'link', 'allocation', 'is', 'achieved', 'after', 'a', 'ddos', 'attack', 'based', 'on', 'realtime', 'monitoring', 'of', 'quantum', 'parameters']] | [-0.27509620817644254, -0.01971498306374997, -0.05126085305320365, 0.010068919473061605, -0.06139497545414737, -0.22162008421229465, 0.1515081895980984, 0.40288506959165843, -0.19805687168346983, -0.27400391713849137, 0.18307589796770896, -0.1584524123929441, -0.22891909405589103, 0.2823674159523632, -0.12280136527759689, 0.1829864947923592, 0.05640532358416489, -0.027228817796068533, -0.009879464895597526, -0.29253797004265447, 0.28080053310841324, 0.0875056974423517, 0.3973236690674509, 0.1034368530447994, 0.13177365084577883, 0.045346674815352477, -0.0456767488270998, -0.04525410198007843, -0.08646262932036604, 0.072615913754063, 0.32723065157021797, 0.23226043061752405, 0.3598495822932039, -0.4504767884633371, -0.26686242196176735, 0.06976110601265516, 0.11286599537457473, 0.08649454574499811, -0.07885573762136379, -0.359264603842582, 0.1356425145108785, -0.3258842496201396, -0.06663147642144135, -0.07953887919762305, -0.03382135118756976, 0.039218046968536716, -0.24981372058724186, -0.027530008368194102, -0.10433196124753781, 0.09983462688646146, -0.003725424062992845, -0.018928474028195655, 0.05451806778354304, 0.14757351389686976, -0.023858354167480555, -0.0717529745905527, 0.22136963761544654, -0.11150276460851144, -0.2345219091645309, 0.31922807543804604, -0.046063142269849776, -0.07968431926731552, 0.07198842388045575, 0.11722334184284722, -0.1734948850103787, 0.08345038850924798, 0.22970141752489975, 0.12988675707685096, -0.17285374742267387, -0.028159029143197196, 0.032967539437647374, 0.1926629790770156, 0.06641188567238195, 0.027575999764459475, 0.1451051080133766, 0.32474001731191365, 0.12527093599949565, 0.15203793501319263, -0.13062179218312459, -0.07572995655770813, -0.20847005676478148, -0.1208399983255991, -0.2344061979624842, 0.027240992350769894, -0.04666345816637788, -0.11051554594721114, 0.4587420514651707, 0.1777948195380824, 0.10034214798361063, 0.09336400540279491, 0.40064897154058726, 0.053373883212251325, 0.06371759884059429, 0.14806170585299178, 0.20279547848871776, -0.006534574526761259, 0.13840797832235693, -0.1896884304338268, 0.1927194781867521, 0.014404602907598018] |
1,802.0568 | Constraining the Dynamics of Deep Probabilistic Models | We introduce a novel generative formulation of deep probabilistic models
implementing "soft" constraints on their function dynamics. In particular, we
develop a flexible methodological framework where the modeled functions and
derivatives of a given order are subject to inequality or equality constraints.
We then characterize the posterior distribution over model and constraint
parameters through stochastic variational inference. As a result, the proposed
approach allows for accurate and scalable uncertainty quantification on the
predictions and on all parameters. We demonstrate the application of equality
constraints in the challenging problem of parameter inference in ordinary
differential equation models, while we showcase the application of inequality
constraints on the problem of monotonic regression of count data. The proposed
approach is extensively tested in several experimental settings, leading to
highly competitive results in challenging modeling applications, while offering
high expressiveness, flexibility and scalability.
| stat.ML | we introduce a novel generative formulation of deep probabilistic models implementing soft constraints on their function dynamics in particular we develop a flexible methodological framework where the modeled functions and derivatives of a given order are subject to inequality or equality constraints we then characterize the posterior distribution over model and constraint parameters through stochastic variational inference as a result the proposed approach allows for accurate and scalable uncertainty quantification on the predictions and on all parameters we demonstrate the application of equality constraints in the challenging problem of parameter inference in ordinary differential equation models while we showcase the application of inequality constraints on the problem of monotonic regression of count data the proposed approach is extensively tested in several experimental settings leading to highly competitive results in challenging modeling applications while offering high expressiveness flexibility and scalability | [['we', 'introduce', 'a', 'novel', 'generative', 'formulation', 'of', 'deep', 'probabilistic', 'models', 'implementing', 'soft', 'constraints', 'on', 'their', 'function', 'dynamics', 'in', 'particular', 'we', 'develop', 'a', 'flexible', 'methodological', 'framework', 'where', 'the', 'modeled', 'functions', 'and', 'derivatives', 'of', 'a', 'given', 'order', 'are', 'subject', 'to', 'inequality', 'or', 'equality', 'constraints', 'we', 'then', 'characterize', 'the', 'posterior', 'distribution', 'over', 'model', 'and', 'constraint', 'parameters', 'through', 'stochastic', 'variational', 'inference', 'as', 'a', 'result', 'the', 'proposed', 'approach', 'allows', 'for', 'accurate', 'and', 'scalable', 'uncertainty', 'quantification', 'on', 'the', 'predictions', 'and', 'on', 'all', 'parameters', 'we', 'demonstrate', 'the', 'application', 'of', 'equality', 'constraints', 'in', 'the', 'challenging', 'problem', 'of', 'parameter', 'inference', 'in', 'ordinary', 'differential', 'equation', 'models', 'while', 'we', 'showcase', 'the', 'application', 'of', 'inequality', 'constraints', 'on', 'the', 'problem', 'of', 'monotonic', 'regression', 'of', 'count', 'data', 'the', 'proposed', 'approach', 'is', 'extensively', 'tested', 'in', 'several', 'experimental', 'settings', 'leading', 'to', 'highly', 'competitive', 'results', 'in', 'challenging', 'modeling', 'applications', 'while', 'offering', 'high', 'expressiveness', 'flexibility', 'and', 'scalability']] | [-0.06873281687379165, -0.024369539961004428, -0.06540208270357882, 0.08677089813403223, -0.12121201512276483, -0.15871473374314232, 0.052078460396783384, 0.3751074205816006, -0.28708954699498285, -0.36369005198717763, 0.10364996704772088, -0.23402166774124997, -0.16290867913023588, 0.21882865919309447, -0.08139167689356497, 0.14569698177318244, 0.08176000732191496, -0.009366456519731944, -0.08923332911426965, -0.25129404566384744, 0.2715904713615025, 0.02158277194503956, 0.32370066165709666, 0.07512562667026365, 0.16625354965066658, 0.02396894944496721, -0.0249757754931347, 0.029185379676105416, -0.15586035434079604, 0.18877014937716796, 0.2464030624102745, 0.2061239102212109, 0.3196240198805178, -0.4357149668118293, -0.22912990221110502, 0.09360889217099376, 0.1014553080645822, 0.06859496649414998, -0.024763812190390748, -0.2743302135386591, 0.024390703903028756, -0.19606604605993563, -0.06475283842862135, -0.15902576893702042, -0.03178819530583221, 0.01724578912132051, -0.32746642295324757, 0.09408680885433883, 0.052326603625103725, 0.013475376496212088, -0.07791853646568539, -0.10212766559687343, 0.026762175292493574, 0.059659761438655444, 0.03495753028600899, -0.02889570270551087, 0.08972480305530828, -0.16235921629403027, -0.1315006469409886, 0.36923164686710713, -0.06696227051924057, -0.2720251589571293, 0.16849317985566722, -0.0627675117697004, -0.21614092484907174, 0.05029759439639747, 0.2509018833608293, 0.1605920640801133, -0.16273862983790233, 0.11258792057558023, 0.0067747429192481605, 0.1336773056955673, -0.0019577073918240107, 0.009711384632550984, 0.1463121923805623, 0.238689432679441, 0.07108688826518629, 0.16696651765185563, -0.060549413431904835, -0.14131483437054582, -0.2759302685819499, -0.10960639987160575, -0.14679893352201864, -0.0355030243559707, -0.12863884008229498, -0.1414734427247652, 0.38283974460239034, 0.21506710003110038, 0.19717105429807155, 0.117127864058766, 0.3493202650289741, 0.12833229942739732, 0.0193895417677654, 0.02883903717742764, 0.1850186905785122, 0.1282958360271622, 0.05848051691444577, -0.1550570738304192, 0.12574291106300067, 0.014169265412249797] |
1,802.05681 | Backward Differentiation Formula finite difference schemes for diffusion
equations with an obstacle term | Finite difference schemes, using Backward Differentiation Formula (BDF), are
studied for the approximation of one-dimensional diffusion equations with an
obstacle term, of the form $$\min(v_t - a(t,x) v_{xx} + b(t,x) v_x + r(t,x) v,
v- \varphi(t,x))= f(t,x).$$ For the scheme building on the second order BDF
formula (BDF2), we discuss unconditional stability, prove an $L^2$-error
estimate and show numerically second order convergence, in both space and time,
unconditionally on the ratio of the mesh steps. In the analysis, an equivalence
of the obstacle equation with a Hamilton-Jacobi-Bellman equation is mentioned,
and a Crank-Nicolson scheme is tested in this context. Two academic problems
for parabolic equations with an obstacle term with explicit solutions and the
American option problem in mathematical finance are used for numerical tests.
| math.NA cs.NA | finite difference schemes using backward differentiation formula bdf are studied for the approximation of onedimensional diffusion equations with an obstacle term of the form minv_t atx v_xx btx v_x rtx v v varphitx ftx for the scheme building on the second order bdf formula bdf2 we discuss unconditional stability prove an l2error estimate and show numerically second order convergence in both space and time unconditionally on the ratio of the mesh steps in the analysis an equivalence of the obstacle equation with a hamiltonjacobibellman equation is mentioned and a cranknicolson scheme is tested in this context two academic problems for parabolic equations with an obstacle term with explicit solutions and the american option problem in mathematical finance are used for numerical tests | [['finite', 'difference', 'schemes', 'using', 'backward', 'differentiation', 'formula', 'bdf', 'are', 'studied', 'for', 'the', 'approximation', 'of', 'onedimensional', 'diffusion', 'equations', 'with', 'an', 'obstacle', 'term', 'of', 'the', 'form', 'minv_t', 'atx', 'v_xx', 'btx', 'v_x', 'rtx', 'v', 'v', 'varphitx', 'ftx', 'for', 'the', 'scheme', 'building', 'on', 'the', 'second', 'order', 'bdf', 'formula', 'bdf2', 'we', 'discuss', 'unconditional', 'stability', 'prove', 'an', 'l2error', 'estimate', 'and', 'show', 'numerically', 'second', 'order', 'convergence', 'in', 'both', 'space', 'and', 'time', 'unconditionally', 'on', 'the', 'ratio', 'of', 'the', 'mesh', 'steps', 'in', 'the', 'analysis', 'an', 'equivalence', 'of', 'the', 'obstacle', 'equation', 'with', 'a', 'hamiltonjacobibellman', 'equation', 'is', 'mentioned', 'and', 'a', 'cranknicolson', 'scheme', 'is', 'tested', 'in', 'this', 'context', 'two', 'academic', 'problems', 'for', 'parabolic', 'equations', 'with', 'an', 'obstacle', 'term', 'with', 'explicit', 'solutions', 'and', 'the', 'american', 'option', 'problem', 'in', 'mathematical', 'finance', 'are', 'used', 'for', 'numerical', 'tests']] | [-0.13939993375679477, -0.012275624519194632, -0.07426300645650676, 0.07883002441667486, -0.0694242608267814, -0.12700861111904185, 0.0033297122611353797, 0.3415007786747689, -0.2936367618579728, -0.2244411808773293, 0.1634030803029115, -0.27204269129239644, -0.09025417945958907, 0.21430819822320094, -0.04708704700460657, 0.09759903553252419, 0.048087521881097925, 0.010535692082097132, -0.06108993973660593, -0.26708575244653426, 0.3109238448184139, -0.04987485222518444, 0.2515475093853335, 0.03768717970233411, 0.19154832181132708, -0.05018907739819648, -0.017298961562725406, -0.03764951061287623, -0.1747559301176807, 0.09786282744704901, 0.2593214289964332, 0.022417910790924603, 0.3297945193752336, -0.4166524929149697, -0.1771170359958584, 0.08615148701355793, 0.13827522207672396, 0.08882832877570764, -0.06803839210188016, -0.2864612997587149, 0.07328616166875387, -0.17547278630469615, -0.19164961707623054, -0.06526853271061554, 0.04777846955694258, 0.07643892841103177, -0.3285607108070205, 0.09707221704302356, 0.05303553068176067, 0.056505224578237784, -0.10697960954469939, -0.11585686057806015, 0.02611782003659755, 0.05318623053220411, 0.045300635998137294, -0.0012583522591739893, -0.017222149235506853, -0.07865066318578708, -0.12285515496041625, 0.39053729257235925, -0.11891126493816652, -0.3068712030367654, 0.08809406977573721, -0.08338804757028508, -0.07950227170561751, 0.11144238131528254, 0.1489156431169249, 0.18049439440170925, -0.12596805517872176, 0.1448753806645982, -0.011287315752512465, 0.14360762063855267, 0.08387784085934982, -0.05391798612351219, 0.00950301248036946, 0.14985295494940754, 0.13049327372185265, 0.08808504827320576, -0.03083532539118702, -0.15369629968481605, -0.3650124445315062, -0.21189957281264166, -0.12411037750522762, 0.004295104143481391, -0.14410453437158138, -0.17201383767436104, 0.30328677520465136, 0.11305875814675043, 0.10246048786987862, 0.09258514936470116, 0.2781215551270482, 0.25782225968432615, -0.04033370938850567, 0.08763768042238856, 0.16677712422097102, 0.17358718710796286, 0.12842418644577264, -0.24471664714753086, 0.08573790594721989, 0.22131045540445485] |
1,802.05682 | Spin and charge pumping by steady or pulse current-driven magnetic
domain wall: A self-consistent multiscale
time-dependent-quantum/time-dependent-classical approach | We introduce a multiscale framework which combines time-dependent
nonequilibrium Green function (TD-NEGF) algorithms, scaling linearly in the
number of time steps and describing quantum-mechanically conduction electrons
in the presence of time-dependent fields of arbitrary strength or frequency,
with classical time evolution of localized magnetic moments described by the
Landau-Lifshitz-Gilbert (LLG) equation. The TD-NEGF+LLG framework can be
applied to a variety of problems where current-driven spin torque induces
dynamics of magnetic moments as the key resource for next generation
spintronics. Using magnetic domain wall (DW) as an example, we predict that its
motion will pump time-dependent spin and charge currents (on the top of
unpolarized DC charge current injected through normal metal leads to drive the
DW motion). The conversion of AC components of spin current, whose amplitude
increases (decreases) as the DW approaches (distances from) the normal metal
lead, into AC voltage via the inverse spin Hall effect offers a tool to
precisely track the DW position along magnetic nanowire. We also quantify the
DW transient inertial displacement due to its acceleration and deceleration by
pulse current and the entailed spin and charge pumping. Finally, TD-NEGF+LLG as
a nonperturbative (i.e., numerically exact) framework allows us to establish
the limits of validity of the so-called spin-motive force (SMF) theory for
pumped charge current by time-dependent magnetic textures---the perturbative
analytical formula of SMF theory becomes inapplicable for large frequencies
(but unrealistic in magnetic system) and, more importantly, for increasing
noncollinearity when the angles between neighboring magnetic moments exceed
$\simeq 10^\circ$.
| cond-mat.mes-hall | we introduce a multiscale framework which combines timedependent nonequilibrium green function tdnegf algorithms scaling linearly in the number of time steps and describing quantummechanically conduction electrons in the presence of timedependent fields of arbitrary strength or frequency with classical time evolution of localized magnetic moments described by the landaulifshitzgilbert llg equation the tdnegfllg framework can be applied to a variety of problems where currentdriven spin torque induces dynamics of magnetic moments as the key resource for next generation spintronics using magnetic domain wall dw as an example we predict that its motion will pump timedependent spin and charge currents on the top of unpolarized dc charge current injected through normal metal leads to drive the dw motion the conversion of ac components of spin current whose amplitude increases decreases as the dw approaches distances from the normal metal lead into ac voltage via the inverse spin hall effect offers a tool to precisely track the dw position along magnetic nanowire we also quantify the dw transient inertial displacement due to its acceleration and deceleration by pulse current and the entailed spin and charge pumping finally tdnegfllg as a nonperturbative ie numerically exact framework allows us to establish the limits of validity of the socalled spinmotive force smf theory for pumped charge current by timedependent magnetic texturesthe perturbative analytical formula of smf theory becomes inapplicable for large frequencies but unrealistic in magnetic system and more importantly for increasing noncollinearity when the angles between neighboring magnetic moments exceed simeq 10circ | [['we', 'introduce', 'a', 'multiscale', 'framework', 'which', 'combines', 'timedependent', 'nonequilibrium', 'green', 'function', 'tdnegf', 'algorithms', 'scaling', 'linearly', 'in', 'the', 'number', 'of', 'time', 'steps', 'and', 'describing', 'quantummechanically', 'conduction', 'electrons', 'in', 'the', 'presence', 'of', 'timedependent', 'fields', 'of', 'arbitrary', 'strength', 'or', 'frequency', 'with', 'classical', 'time', 'evolution', 'of', 'localized', 'magnetic', 'moments', 'described', 'by', 'the', 'landaulifshitzgilbert', 'llg', 'equation', 'the', 'tdnegfllg', 'framework', 'can', 'be', 'applied', 'to', 'a', 'variety', 'of', 'problems', 'where', 'currentdriven', 'spin', 'torque', 'induces', 'dynamics', 'of', 'magnetic', 'moments', 'as', 'the', 'key', 'resource', 'for', 'next', 'generation', 'spintronics', 'using', 'magnetic', 'domain', 'wall', 'dw', 'as', 'an', 'example', 'we', 'predict', 'that', 'its', 'motion', 'will', 'pump', 'timedependent', 'spin', 'and', 'charge', 'currents', 'on', 'the', 'top', 'of', 'unpolarized', 'dc', 'charge', 'current', 'injected', 'through', 'normal', 'metal', 'leads', 'to', 'drive', 'the', 'dw', 'motion', 'the', 'conversion', 'of', 'ac', 'components', 'of', 'spin', 'current', 'whose', 'amplitude', 'increases', 'decreases', 'as', 'the', 'dw', 'approaches', 'distances', 'from', 'the', 'normal', 'metal', 'lead', 'into', 'ac', 'voltage', 'via', 'the', 'inverse', 'spin', 'hall', 'effect', 'offers', 'a', 'tool', 'to', 'precisely', 'track', 'the', 'dw', 'position', 'along', 'magnetic', 'nanowire', 'we', 'also', 'quantify', 'the', 'dw', 'transient', 'inertial', 'displacement', 'due', 'to', 'its', 'acceleration', 'and', 'deceleration', 'by', 'pulse', 'current', 'and', 'the', 'entailed', 'spin', 'and', 'charge', 'pumping', 'finally', 'tdnegfllg', 'as', 'a', 'nonperturbative', 'ie', 'numerically', 'exact', 'framework', 'allows', 'us', 'to', 'establish', 'the', 'limits', 'of', 'validity', 'of', 'the', 'socalled', 'spinmotive', 'force', 'smf', 'theory', 'for', 'pumped', 'charge', 'current', 'by', 'timedependent', 'magnetic', 'texturesthe', 'perturbative', 'analytical', 'formula', 'of', 'smf', 'theory', 'becomes', 'inapplicable', 'for', 'large', 'frequencies', 'but', 'unrealistic', 'in', 'magnetic', 'system', 'and', 'more', 'importantly', 'for', 'increasing', 'noncollinearity', 'when', 'the', 'angles', 'between', 'neighboring', 'magnetic', 'moments', 'exceed', 'simeq', '10circ']] | [-0.16430033299292685, 0.1992864786072905, -0.02776504354361369, 0.02812870296326523, -0.08358276051431134, -0.11912648366498095, 0.04646385619131734, 0.37260025949122344, -0.2894973662985983, -0.299710422388411, 0.002673430810207311, -0.21504157197344526, -0.07523947923244642, 0.23521064991530563, 0.04686682301582959, 0.011150528151513439, -0.024780012704241943, -0.010308539022558502, -0.05681560816794482, -0.12095849257988893, 0.25571434425228107, -0.0019091585156868916, 0.3334213536004631, 0.06483268175768304, 0.10872963330879504, 0.035286344335490494, 0.04549262648144243, 0.042860322810557426, -0.11951634027512283, 0.04488494364278657, 0.19267617450618393, -0.026768295152340922, 0.22950352973931906, -0.5124023490718432, -0.16716141299681966, 0.033608439711055586, 0.1543265815748244, 0.17527951990605845, -0.04320265348384166, -0.28964033140515794, 0.0315981495450726, -0.17692054515628486, -0.17466030619677383, -0.10965446993347486, 0.048144846955048184, 0.05661125698183872, -0.2875708033672857, 0.1430932077758575, 0.07266970119505589, 0.017936720276531783, -0.07842658143229213, -0.07335378480600004, -0.05687301393256199, 0.08124479681362722, 0.07762454635112033, 0.09647444517408707, 0.22522536412651215, -0.1598208761686098, -0.1310310563547727, 0.3175766737447405, -0.078656932221469, -0.18850918445089945, 0.12257901083639994, -0.18769350924091985, -0.0176858033173556, 0.13215990013119822, 0.15410468447905945, 0.1100769657860225, -0.14244826521471438, 0.0804238393898324, 0.04803551985806196, 0.13283235753781866, 0.06414660573841965, 0.029849018760462653, 0.26857907286636074, 0.1633283907119945, 0.07401994167496237, 0.13873805689996072, -0.14362772719041272, -0.0979930433226103, -0.25090249238953904, -0.13045935117045943, -0.1941614096623142, 0.08750247296173962, -0.08711830315961769, -0.16357252244476456, 0.4249304469142641, 0.19253431300190751, 0.12072767391230683, -0.00298671830607084, 0.32977455189755683, 0.18483129760953693, 0.04619167403089909, 0.044938820348672415, 0.22925612792581776, 0.21853505094934786, 0.15196705762658042, -0.3378667703440071, 0.048691220994924705, 0.04596141363667533] |
1,802.05683 | Quantum Optimal Control: Landscape Structure and Topology | The core problem in optimal control theory applied to quantum systems is to
determine the temporal shape of an applied field in order to maximize the
expectation of value of some physical observable. The functional which maps the
control field into a given value of the observable defines a Quantum Control
Landscape (QCL). Studying the topological and structural features of these
landscapes is of critical importance for understanding the process of finding
the optimal fields required to effectively control the system, specially when
external constraints are placed on both the field $\epsilon(t)$ and the
available control duration $T$. In this work we analyze the rich structure of
the $QCL$ of the paradigmatic Landau-Zener two-level model, studying several
features of the optimized solutions, such as their abundance, spatial
distribution and fidelities. We also inspect the optimization trajectories in
parameter space. We are able rationalize several geometrical and topological
aspects of the QCL of this simple model and the effects produced by the
constraints. Our study opens the door for a deeper understanding of the QCL of
general quantum systems.
| quant-ph | the core problem in optimal control theory applied to quantum systems is to determine the temporal shape of an applied field in order to maximize the expectation of value of some physical observable the functional which maps the control field into a given value of the observable defines a quantum control landscape qcl studying the topological and structural features of these landscapes is of critical importance for understanding the process of finding the optimal fields required to effectively control the system specially when external constraints are placed on both the field epsilont and the available control duration t in this work we analyze the rich structure of the qcl of the paradigmatic landauzener twolevel model studying several features of the optimized solutions such as their abundance spatial distribution and fidelities we also inspect the optimization trajectories in parameter space we are able rationalize several geometrical and topological aspects of the qcl of this simple model and the effects produced by the constraints our study opens the door for a deeper understanding of the qcl of general quantum systems | [['the', 'core', 'problem', 'in', 'optimal', 'control', 'theory', 'applied', 'to', 'quantum', 'systems', 'is', 'to', 'determine', 'the', 'temporal', 'shape', 'of', 'an', 'applied', 'field', 'in', 'order', 'to', 'maximize', 'the', 'expectation', 'of', 'value', 'of', 'some', 'physical', 'observable', 'the', 'functional', 'which', 'maps', 'the', 'control', 'field', 'into', 'a', 'given', 'value', 'of', 'the', 'observable', 'defines', 'a', 'quantum', 'control', 'landscape', 'qcl', 'studying', 'the', 'topological', 'and', 'structural', 'features', 'of', 'these', 'landscapes', 'is', 'of', 'critical', 'importance', 'for', 'understanding', 'the', 'process', 'of', 'finding', 'the', 'optimal', 'fields', 'required', 'to', 'effectively', 'control', 'the', 'system', 'specially', 'when', 'external', 'constraints', 'are', 'placed', 'on', 'both', 'the', 'field', 'epsilont', 'and', 'the', 'available', 'control', 'duration', 't', 'in', 'this', 'work', 'we', 'analyze', 'the', 'rich', 'structure', 'of', 'the', 'qcl', 'of', 'the', 'paradigmatic', 'landauzener', 'twolevel', 'model', 'studying', 'several', 'features', 'of', 'the', 'optimized', 'solutions', 'such', 'as', 'their', 'abundance', 'spatial', 'distribution', 'and', 'fidelities', 'we', 'also', 'inspect', 'the', 'optimization', 'trajectories', 'in', 'parameter', 'space', 'we', 'are', 'able', 'rationalize', 'several', 'geometrical', 'and', 'topological', 'aspects', 'of', 'the', 'qcl', 'of', 'this', 'simple', 'model', 'and', 'the', 'effects', 'produced', 'by', 'the', 'constraints', 'our', 'study', 'opens', 'the', 'door', 'for', 'a', 'deeper', 'understanding', 'of', 'the', 'qcl', 'of', 'general', 'quantum', 'systems']] | [-0.13332547951395507, 0.11475215278628996, -0.08825997603021227, 0.07408006574729534, -0.05291788335798015, -0.12140250469693976, 0.057499860887536045, 0.35285651849077887, -0.30119059550159955, -0.31207860721631, 0.08365307707179945, -0.22213500622971236, -0.1509435931828888, 0.21276238688602625, -0.029495523782091193, 0.11202585943706407, -0.0030318214093711686, 0.029479894665425666, -0.04563519814224349, -0.19088435125618314, 0.31526527851636865, 0.056017231798516275, 0.28834005800504864, 0.0464581851925952, 0.08954795774888624, 0.009671717347169106, 0.018241624240606522, 0.03635893423052039, -0.16405126129753175, 0.15077152594549875, 0.24659004693934589, 0.12264142972037845, 0.27073871668851984, -0.41858814285251866, -0.23650905092801439, 0.08395947768154104, 0.10951549725690751, 0.13484295509726835, -0.03583427034436171, -0.29330171608062605, 0.05427701035619117, -0.10663034698109697, -0.11622415589995347, -0.08213450713606363, -0.013213101615527582, 0.02967710661037375, -0.2510113857462191, -0.006918434594042359, 0.05565860242748978, 0.050302400599034985, -0.08435439669757328, -0.06164506715696221, -0.011573722592575915, 0.1750271588982818, 0.0011984365271192484, 0.011908448529835225, 0.16658044686499104, -0.1886024786816031, -0.13173864073423522, 0.3997613326698709, -0.033544814951189404, -0.16393741089955308, 0.1613286662679375, -0.13676111169389626, -0.10866873882308058, 0.10483948665074586, 0.18824553791318466, 0.12411782121170689, -0.15222784817381305, 0.09241523427118317, 0.019617711649056565, 0.17732079382044044, 0.0018045137835185179, 0.0765143989266833, 0.2223295243391558, 0.18871670439603916, 0.07420931188023408, 0.1776180736265365, -0.060388999699426585, -0.16419617851065954, -0.2957854259842902, -0.1463551378862545, -0.1474195851033993, 0.03263950663726003, -0.09283377725872659, -0.16225138048149562, 0.4630534412245151, 0.20813415821620754, 0.20854643430283523, 0.009991233452259867, 0.2645128033394674, 0.1532313680888436, 0.03593335813957821, 0.010548200128662788, 0.2367127377252432, 0.1343686179113391, 0.08035086392257572, -0.27467038808913713, 0.05289809995728514, 0.007366554419185673] |
1,802.05684 | Comparing Hecke Coefficients of Automorphic Representations | We prove a number of unconditional statistical results of the Hecke
coefficients for unitary cuspidal representations of $\operatorname{GL}(2)$
over number fields. Using partial bounds on the size of the Hecke coefficients,
instances of Langlands functoriality, and properties of Rankin-Selberg
$L$-functions, we obtain bounds on the set of places where linear combinations
of Hecke coefficients are negative. Under a mild functoriality assumption we
extend these methods to $\operatorname{GL}(n)$. As an application, we obtain a
result related to a question of Serre about the occurrence of large Hecke
eigenvalues of Maass forms. Furthermore, in the cases where the Ramanujan
conjecture is satisfied, we obtain distributional results of the Hecke
coefficients at places varying in certain congruence or Galois classes.
| math.NT | we prove a number of unconditional statistical results of the hecke coefficients for unitary cuspidal representations of operatornamegl2 over number fields using partial bounds on the size of the hecke coefficients instances of langlands functoriality and properties of rankinselberg lfunctions we obtain bounds on the set of places where linear combinations of hecke coefficients are negative under a mild functoriality assumption we extend these methods to operatornamegln as an application we obtain a result related to a question of serre about the occurrence of large hecke eigenvalues of maass forms furthermore in the cases where the ramanujan conjecture is satisfied we obtain distributional results of the hecke coefficients at places varying in certain congruence or galois classes | [['we', 'prove', 'a', 'number', 'of', 'unconditional', 'statistical', 'results', 'of', 'the', 'hecke', 'coefficients', 'for', 'unitary', 'cuspidal', 'representations', 'of', 'operatornamegl2', 'over', 'number', 'fields', 'using', 'partial', 'bounds', 'on', 'the', 'size', 'of', 'the', 'hecke', 'coefficients', 'instances', 'of', 'langlands', 'functoriality', 'and', 'properties', 'of', 'rankinselberg', 'lfunctions', 'we', 'obtain', 'bounds', 'on', 'the', 'set', 'of', 'places', 'where', 'linear', 'combinations', 'of', 'hecke', 'coefficients', 'are', 'negative', 'under', 'a', 'mild', 'functoriality', 'assumption', 'we', 'extend', 'these', 'methods', 'to', 'operatornamegln', 'as', 'an', 'application', 'we', 'obtain', 'a', 'result', 'related', 'to', 'a', 'question', 'of', 'serre', 'about', 'the', 'occurrence', 'of', 'large', 'hecke', 'eigenvalues', 'of', 'maass', 'forms', 'furthermore', 'in', 'the', 'cases', 'where', 'the', 'ramanujan', 'conjecture', 'is', 'satisfied', 'we', 'obtain', 'distributional', 'results', 'of', 'the', 'hecke', 'coefficients', 'at', 'places', 'varying', 'in', 'certain', 'congruence', 'or', 'galois', 'classes']] | [-0.20706724662171758, 0.027131566025807685, -0.12910594054619257, 0.06366149031293943, -0.1287223019434706, -0.10604560202716486, 0.02956158108604343, 0.2610206450457158, -0.3211542502329077, -0.24180697720983754, 0.08275681926220979, -0.2491109144570225, -0.14077815503671604, 0.27202975567551735, -0.1299329583492616, 0.06980935288998096, 0.05734402790422673, 0.13604550211204458, -0.14044711862326317, -0.35800061859190463, 0.41133032197983044, -0.027915764182967984, 0.19762969689808138, 0.06893003445432482, 0.060183447196512765, 0.018150021350416153, 0.025729501304095206, -0.13931709703796039, -0.15601253330672119, 0.17304682867682497, 0.32957611845846735, 0.0496026981804196, 0.24481949259365057, -0.4028210374162249, -0.07708153158385793, 0.18765146403128038, 0.10730655572336653, 0.030831810811777476, 0.014212923909982909, -0.31228462458669165, 0.11526575231843668, -0.1481129058920171, -0.14506556625356493, -0.10318381584694852, 0.010002017106212999, 0.057761672033887844, -0.3438099122241787, 0.06209217637129452, 0.10750793456403619, 0.2016079611286683, -0.12268345106959991, -0.1833323454970251, 0.03652257669271658, 0.08660251062727817, 0.07440060828002575, -0.09054767884637999, 0.09698002828366083, -0.17686900559650814, -0.08355378987591551, 0.3271635248001827, -0.06877278248253076, -0.19781939415666072, 0.12953807347170684, -0.20485488760244588, -0.21924673758001756, 0.039682154171168806, 0.1405975346170042, 0.12841877717848704, 0.004314212452458299, 0.1575870167135018, -0.18395659326494712, 0.07209530728160525, 0.19972060743476386, 3.1496863812208176e-05, 0.12742088206274355, -0.00734985335122632, 0.08289979558903723, 0.15322675026305344, -0.005014962615931163, 0.003455956421954476, -0.3652235093971957, -0.1747037483703183, -0.1363484653421556, 0.08870386543643216, -0.14260273430326892, -0.16568773188729488, 0.4154000739688459, 0.14584794452859332, 0.22679560574014548, 0.19821532843229564, 0.13897256935217783, 0.15314300218002325, 0.07179683092981577, 0.03645798028446734, 0.10294234345973287, 0.2600645653417577, -0.05002547826152295, -0.13658906071568314, 0.03911609904354681, 0.19457484112809534] |
1,802.05685 | Origin of spin reorientation transitions in antiferromagnetic MnPt-based
alloys | Antiferromagnetic MnPt exhibits a spin reorientation transition (SRT) as a
function of temperature, and off-stoichiometric Mn-Pt alloys also display SRTs
as a function of concentration. The magnetocrystalline anisotropy in these
alloys is studied using first-principles calculations based on the coherent
potential approximation and the disordered local moment method. The anisotropy
is fairly small and sensitive to the variations in composition and temperature
due to the cancellation of large contributions from different parts of the
Brillouin zone. Concentration and temperature-driven SRTs are found in
reasonable agreement with experimental data. Contributions from specific
band-structure features are identified and used to explain the origin of the
SRTs.
| cond-mat.mtrl-sci | antiferromagnetic mnpt exhibits a spin reorientation transition srt as a function of temperature and offstoichiometric mnpt alloys also display srts as a function of concentration the magnetocrystalline anisotropy in these alloys is studied using firstprinciples calculations based on the coherent potential approximation and the disordered local moment method the anisotropy is fairly small and sensitive to the variations in composition and temperature due to the cancellation of large contributions from different parts of the brillouin zone concentration and temperaturedriven srts are found in reasonable agreement with experimental data contributions from specific bandstructure features are identified and used to explain the origin of the srts | [['antiferromagnetic', 'mnpt', 'exhibits', 'a', 'spin', 'reorientation', 'transition', 'srt', 'as', 'a', 'function', 'of', 'temperature', 'and', 'offstoichiometric', 'mnpt', 'alloys', 'also', 'display', 'srts', 'as', 'a', 'function', 'of', 'concentration', 'the', 'magnetocrystalline', 'anisotropy', 'in', 'these', 'alloys', 'is', 'studied', 'using', 'firstprinciples', 'calculations', 'based', 'on', 'the', 'coherent', 'potential', 'approximation', 'and', 'the', 'disordered', 'local', 'moment', 'method', 'the', 'anisotropy', 'is', 'fairly', 'small', 'and', 'sensitive', 'to', 'the', 'variations', 'in', 'composition', 'and', 'temperature', 'due', 'to', 'the', 'cancellation', 'of', 'large', 'contributions', 'from', 'different', 'parts', 'of', 'the', 'brillouin', 'zone', 'concentration', 'and', 'temperaturedriven', 'srts', 'are', 'found', 'in', 'reasonable', 'agreement', 'with', 'experimental', 'data', 'contributions', 'from', 'specific', 'bandstructure', 'features', 'are', 'identified', 'and', 'used', 'to', 'explain', 'the', 'origin', 'of', 'the', 'srts']] | [-0.11727115918004599, 0.1463151310946649, -0.07036205123250301, 0.057190661768590174, -0.03567796157529721, -0.07337474199280572, 0.08218811906968207, 0.39157129702373195, -0.25686876022518845, -0.3100906321420692, 0.027784290500746395, -0.328143865076037, -0.1306157145031298, 0.1673073542837161, 0.03967992813522869, 0.01762020180019765, -0.035886722950426005, -0.03204608110424418, -0.11211644126496349, -0.1664515109687972, 0.2578066570344023, 0.055048764638531096, 0.30661395077521986, 0.12605049070239496, 0.04101709221028544, -0.020032866477357365, 0.08725595319321236, 0.0478776619106961, -0.1411106598500807, 0.049483007755882755, 0.2578478892794989, -0.05890526815514582, 0.14549249854798502, -0.40435005927709144, -0.197241283479553, -0.003031081916280807, 0.08844808536797735, 0.11970796314394996, -0.08913180668941305, -0.24452296731312975, 0.069490202380201, -0.12456410999920291, -0.11667779193745585, -0.12365498468100738, -0.007293186705702772, 0.05321104942749326, -0.27502923968803283, 0.13894524916647172, 0.027315076897279, 0.1088514401897975, -0.1289743071448846, -0.17694933839643803, -0.08138617556183957, 0.08550623242850773, 0.09796755815086026, 0.06335170168984824, 0.15509789728541643, -0.06300609261513902, -0.07525131239918455, 0.4015230676517464, -0.06762691126921429, -0.07887476253269526, 0.173049640714173, -0.18860330314894852, -0.10593706666706847, 0.1801881217935051, 0.13748549019846207, 0.09450534387780443, -0.1359636314267006, 0.06588212135718025, 0.05452961632797199, 0.1752006226989369, 0.031177256086196464, 0.049276312454332165, 0.19959570919253075, 0.16584295576187566, -0.001372770880922102, 0.13695779959044346, -0.1475517452949694, -0.09242652095361756, -0.24092447926075414, -0.11487278221354175, -0.2517762971468843, 0.02098022893859217, -0.12080047884424297, -0.18106453932929212, 0.3850431044478543, 0.15058013153065986, 0.2228954380396037, -0.025312834002901442, 0.22498650554245195, 0.07826967184351255, 0.09416728535255131, 0.007832607942243787, 0.24397160432999954, 0.18382354626485792, 0.13587107566637804, -0.26922727479653147, 0.1462912660969708, -0.01522822139892154] |
1,802.05686 | A Bio-inspired Redundant Sensing Architecture | Sensing is the process of deriving signals from the environment that allows
artificial systems to interact with the physical world. The Shannon theorem
specifies the maximum rate at which information can be acquired. However, this
upper bound is hard to achieve in many man-made systems. The biological visual
systems, on the other hand, have highly efficient signal representation and
processing mechanisms that allow precise sensing. In this work, we argue that
redundancy is one of the critical characteristics for such superior
performance. We show architectural advantages by utilizing redundant sensing,
including correction of mismatch error and significant precision enhancement.
For a proof-of-concept demonstration, we have designed a heuristic-based
analog-to-digital converter - a zero-dimensional quantizer. Through Monte Carlo
simulation with the error probabilistic distribution as a priori, the
performance approaching the Shannon limit is feasible. In actual measurements
without knowing the error distribution, we observe at least 2-bit extra
precision. The results may also help explain biological processes including the
dominance of binocular vision, the functional roles of the fixational eye
movements, and the structural mechanisms allowing hyperacuity.
| cs.NE cs.IT eess.SP math.IT | sensing is the process of deriving signals from the environment that allows artificial systems to interact with the physical world the shannon theorem specifies the maximum rate at which information can be acquired however this upper bound is hard to achieve in many manmade systems the biological visual systems on the other hand have highly efficient signal representation and processing mechanisms that allow precise sensing in this work we argue that redundancy is one of the critical characteristics for such superior performance we show architectural advantages by utilizing redundant sensing including correction of mismatch error and significant precision enhancement for a proofofconcept demonstration we have designed a heuristicbased analogtodigital converter a zerodimensional quantizer through monte carlo simulation with the error probabilistic distribution as a priori the performance approaching the shannon limit is feasible in actual measurements without knowing the error distribution we observe at least 2bit extra precision the results may also help explain biological processes including the dominance of binocular vision the functional roles of the fixational eye movements and the structural mechanisms allowing hyperacuity | [['sensing', 'is', 'the', 'process', 'of', 'deriving', 'signals', 'from', 'the', 'environment', 'that', 'allows', 'artificial', 'systems', 'to', 'interact', 'with', 'the', 'physical', 'world', 'the', 'shannon', 'theorem', 'specifies', 'the', 'maximum', 'rate', 'at', 'which', 'information', 'can', 'be', 'acquired', 'however', 'this', 'upper', 'bound', 'is', 'hard', 'to', 'achieve', 'in', 'many', 'manmade', 'systems', 'the', 'biological', 'visual', 'systems', 'on', 'the', 'other', 'hand', 'have', 'highly', 'efficient', 'signal', 'representation', 'and', 'processing', 'mechanisms', 'that', 'allow', 'precise', 'sensing', 'in', 'this', 'work', 'we', 'argue', 'that', 'redundancy', 'is', 'one', 'of', 'the', 'critical', 'characteristics', 'for', 'such', 'superior', 'performance', 'we', 'show', 'architectural', 'advantages', 'by', 'utilizing', 'redundant', 'sensing', 'including', 'correction', 'of', 'mismatch', 'error', 'and', 'significant', 'precision', 'enhancement', 'for', 'a', 'proofofconcept', 'demonstration', 'we', 'have', 'designed', 'a', 'heuristicbased', 'analogtodigital', 'converter', 'a', 'zerodimensional', 'quantizer', 'through', 'monte', 'carlo', 'simulation', 'with', 'the', 'error', 'probabilistic', 'distribution', 'as', 'a', 'priori', 'the', 'performance', 'approaching', 'the', 'shannon', 'limit', 'is', 'feasible', 'in', 'actual', 'measurements', 'without', 'knowing', 'the', 'error', 'distribution', 'we', 'observe', 'at', 'least', '2bit', 'extra', 'precision', 'the', 'results', 'may', 'also', 'help', 'explain', 'biological', 'processes', 'including', 'the', 'dominance', 'of', 'binocular', 'vision', 'the', 'functional', 'roles', 'of', 'the', 'fixational', 'eye', 'movements', 'and', 'the', 'structural', 'mechanisms', 'allowing', 'hyperacuity']] | [-0.1189740520110883, 0.06841038396603173, -0.10606814519533972, 0.058580625024133456, -0.07130643122350606, -0.17180500168945978, 0.0741752900503343, 0.38535446318035776, -0.2757319566709074, -0.3462484668485889, 0.11873132898406104, -0.2708074240324343, -0.18784454580533996, 0.21795238416895948, -0.11790404366117647, 0.10430624749741665, 0.08953887537989597, 0.04711539443947417, -0.05264605190049307, -0.20163594116142616, 0.24215849257333585, 0.11491842086384581, 0.3239941725359214, 0.023806662863617847, 0.1243562328772069, 0.006931067258516454, -0.005094601736345794, -0.04262172521637033, -0.07995102116741361, 0.13823196003795601, 0.2753976126482898, 0.15958500962799668, 0.27200367757838895, -0.42464942859475163, -0.2511540174150882, 0.10964769684968897, 0.15144792139538119, 0.10643523080546981, -0.0752547551310272, -0.258390187158842, 0.08175305694352243, -0.14286560541421006, -0.06687011280022985, -0.07715649580429519, -0.034192218286493284, 0.01751056590629477, -0.29194134936816146, 0.05847625028697869, 0.051186120574129745, 0.07260579605628498, -0.030571630027803953, -0.12233462945071304, 0.031959011957868905, 0.1824149793352593, -0.018112899007395423, -0.0036872972460431893, 0.18197682805310417, -0.14260863645639885, -0.15057195924402383, 0.3394407115093517, -0.03102994423368893, -0.20413151547704314, 0.2045243979241191, -0.1135612732045543, -0.1392302635001463, 0.14365467386431358, 0.1962587673862634, 0.06107842526134019, -0.15737629926826974, 0.05052828176419346, 0.030688809405546635, 0.20658400528455703, 0.05877810733297586, 0.10835795127522116, 0.19347265065880492, 0.2138590115540534, 0.04440354216917926, 0.12134144107370627, -0.1163029041953533, -0.09086240197277883, -0.2495867018677183, -0.15493651815664966, -0.19016004919698884, 0.01249955579855437, -0.11154850797480652, -0.10619165730663967, 0.3296037894668354, 0.2367355116221006, 0.15701294829275206, 0.05761454222043871, 0.3628074197562951, 0.08636783591910815, 0.08596681100210514, 0.05032396857859567, 0.25205115792083566, 0.07978506324500566, 0.10006255401425403, -0.21492312554751566, 0.11655388465971389, 0.011378791013901884] |
1,802.05687 | Effect of Hilbert space truncation on Anderson localization | The 1-D Anderson model possesses a completely localized spectrum of
eigenstates for all values of the disorder. We consider the effect of
projecting the Hamiltonian to a truncated Hilbert space, destroying time
reversal symmetry. We analyze the ensuing eigenstates using different measures
such as inverse participation ratio and sample-averaged moments of the position
operator. In addition, we examine amplitude fluctuations in detail to detect
the possibility of multifractal behavior (characteristic of mobility edges)
that may arise as a result of the truncation procedure.
| cond-mat.dis-nn cond-mat.other quant-ph | the 1d anderson model possesses a completely localized spectrum of eigenstates for all values of the disorder we consider the effect of projecting the hamiltonian to a truncated hilbert space destroying time reversal symmetry we analyze the ensuing eigenstates using different measures such as inverse participation ratio and sampleaveraged moments of the position operator in addition we examine amplitude fluctuations in detail to detect the possibility of multifractal behavior characteristic of mobility edges that may arise as a result of the truncation procedure | [['the', '1d', 'anderson', 'model', 'possesses', 'a', 'completely', 'localized', 'spectrum', 'of', 'eigenstates', 'for', 'all', 'values', 'of', 'the', 'disorder', 'we', 'consider', 'the', 'effect', 'of', 'projecting', 'the', 'hamiltonian', 'to', 'a', 'truncated', 'hilbert', 'space', 'destroying', 'time', 'reversal', 'symmetry', 'we', 'analyze', 'the', 'ensuing', 'eigenstates', 'using', 'different', 'measures', 'such', 'as', 'inverse', 'participation', 'ratio', 'and', 'sampleaveraged', 'moments', 'of', 'the', 'position', 'operator', 'in', 'addition', 'we', 'examine', 'amplitude', 'fluctuations', 'in', 'detail', 'to', 'detect', 'the', 'possibility', 'of', 'multifractal', 'behavior', 'characteristic', 'of', 'mobility', 'edges', 'that', 'may', 'arise', 'as', 'a', 'result', 'of', 'the', 'truncation', 'procedure']] | [-0.17763652779051126, 0.1670801314491644, -0.07797517452433884, 0.10156014408489847, -0.0034351943689117947, -0.09542881504980376, 0.04545089539634176, 0.3435432327439986, -0.2798707802052026, -0.2511785843084196, 0.07730919566757259, -0.30120098733354406, -0.15080160446779198, 0.08958153645732407, 0.004537043717117554, 0.035440097533689575, 0.010830491725130972, 6.016482969364488e-05, -0.12125007083488022, -0.16424008727309305, 0.34468109157295473, 0.06230122570217733, 0.2725129392873271, 0.037784031323011384, 0.042796236311410926, 0.047889311304203715, 0.012210269138800451, 0.024516991092416694, -0.10019563382860702, 0.04413988130975021, 0.189506593409993, 0.054682769599449205, 0.2224514473858009, -0.3945384087063462, -0.19324452092265149, 0.13604579632540784, 0.18393922368266497, 0.1133857857694019, -0.0002186426399163453, -0.29933625210570286, 0.024681411506832545, -0.16373440584010748, -0.20758778458259192, -0.0902608191364456, 0.03242233355181763, -0.034652655868488084, -0.26234393466982137, 0.13615042859329338, 0.07778916079326566, 0.057412687839143516, -0.07638577380812311, -0.062024867005017865, -0.05838923441268593, 0.1361094668608563, 0.06473727176156659, -0.07314374539664531, 0.130234752042522, -0.09580855773192415, -0.12570625444851727, 0.36731126601527253, -0.0711252305254127, -0.19218513009374041, 0.13694879272391638, -0.19908855341554407, -0.09607829395906035, 0.10287134620888405, 0.16786896313978247, 0.08948462218865304, -0.10440214443601196, 0.11051842536572479, -0.0365852166993925, 0.13427596803227193, 0.045435256021748104, 0.0908034264040951, 0.16107992854822112, 0.10579330004549709, 0.0721684719649065, 0.1683605654299798, -0.13041523674009256, -0.10428494066336608, -0.29201980464788807, -0.13572890993701406, -0.22277233567851853, 0.07668837824140687, -0.08257036953473727, -0.20749800651143474, 0.4864138555488583, 0.17855452901700578, 0.2558904078631965, 0.03903253342260618, 0.21874396168593183, 0.19076896449046052, 0.036603621510138, 0.027067570927474333, 0.1931204832445112, 0.11787890586777623, 0.06823182721756937, -0.28313341398768305, 0.03625375988994198, 0.10191347747928946] |
1,802.05688 | Simulation assisted machine learning | Motivation: In a predictive modeling setting, if sufficient details of the
system behavior are known, one can build and use a simulation for making
predictions. When sufficient system details are not known, one typically turns
to machine learning, which builds a black-box model of the system using a large
dataset of input sample features and outputs. We consider a setting which is
between these two extremes: some details of the system mechanics are known but
not enough for creating simulations that can be used to make high quality
predictions. In this context we propose using approximate simulations to build
a kernel for use in kernelized machine learning methods, such as support vector
machines. The results of multiple simulations (under various uncertainty
scenarios) are used to compute similarity measures between every pair of
samples: sample pairs are given a high similarity score if they behave
similarly under a wide range of simulation parameters. These similarity values,
rather than the original high dimensional feature data, are used to build the
kernel.
Results: We demonstrate and explore the simulation based kernel (SimKern)
concept using four synthetic complex systems--three biologically inspired
models and one network flow optimization model. We show that, when the number
of training samples is small compared to the number of features, the SimKern
approach dominates over no-prior-knowledge methods. This approach should be
applicable in all disciplines where predictive models are sought and
informative yet approximate simulations are available.
Availability: The Python SimKern software, the demonstration models (in
MATLAB, R), and the datasets are available at
https://github.com/davidcraft/SimKern.
| stat.ML cs.LG q-bio.QM | motivation in a predictive modeling setting if sufficient details of the system behavior are known one can build and use a simulation for making predictions when sufficient system details are not known one typically turns to machine learning which builds a blackbox model of the system using a large dataset of input sample features and outputs we consider a setting which is between these two extremes some details of the system mechanics are known but not enough for creating simulations that can be used to make high quality predictions in this context we propose using approximate simulations to build a kernel for use in kernelized machine learning methods such as support vector machines the results of multiple simulations under various uncertainty scenarios are used to compute similarity measures between every pair of samples sample pairs are given a high similarity score if they behave similarly under a wide range of simulation parameters these similarity values rather than the original high dimensional feature data are used to build the kernel results we demonstrate and explore the simulation based kernel simkern concept using four synthetic complex systemsthree biologically inspired models and one network flow optimization model we show that when the number of training samples is small compared to the number of features the simkern approach dominates over nopriorknowledge methods this approach should be applicable in all disciplines where predictive models are sought and informative yet approximate simulations are available availability the python simkern software the demonstration models in matlab r and the datasets are available at httpsgithubcomdavidcraftsimkern | [['motivation', 'in', 'a', 'predictive', 'modeling', 'setting', 'if', 'sufficient', 'details', 'of', 'the', 'system', 'behavior', 'are', 'known', 'one', 'can', 'build', 'and', 'use', 'a', 'simulation', 'for', 'making', 'predictions', 'when', 'sufficient', 'system', 'details', 'are', 'not', 'known', 'one', 'typically', 'turns', 'to', 'machine', 'learning', 'which', 'builds', 'a', 'blackbox', 'model', 'of', 'the', 'system', 'using', 'a', 'large', 'dataset', 'of', 'input', 'sample', 'features', 'and', 'outputs', 'we', 'consider', 'a', 'setting', 'which', 'is', 'between', 'these', 'two', 'extremes', 'some', 'details', 'of', 'the', 'system', 'mechanics', 'are', 'known', 'but', 'not', 'enough', 'for', 'creating', 'simulations', 'that', 'can', 'be', 'used', 'to', 'make', 'high', 'quality', 'predictions', 'in', 'this', 'context', 'we', 'propose', 'using', 'approximate', 'simulations', 'to', 'build', 'a', 'kernel', 'for', 'use', 'in', 'kernelized', 'machine', 'learning', 'methods', 'such', 'as', 'support', 'vector', 'machines', 'the', 'results', 'of', 'multiple', 'simulations', 'under', 'various', 'uncertainty', 'scenarios', 'are', 'used', 'to', 'compute', 'similarity', 'measures', 'between', 'every', 'pair', 'of', 'samples', 'sample', 'pairs', 'are', 'given', 'a', 'high', 'similarity', 'score', 'if', 'they', 'behave', 'similarly', 'under', 'a', 'wide', 'range', 'of', 'simulation', 'parameters', 'these', 'similarity', 'values', 'rather', 'than', 'the', 'original', 'high', 'dimensional', 'feature', 'data', 'are', 'used', 'to', 'build', 'the', 'kernel', 'results', 'we', 'demonstrate', 'and', 'explore', 'the', 'simulation', 'based', 'kernel', 'simkern', 'concept', 'using', 'four', 'synthetic', 'complex', 'systemsthree', 'biologically', 'inspired', 'models', 'and', 'one', 'network', 'flow', 'optimization', 'model', 'we', 'show', 'that', 'when', 'the', 'number', 'of', 'training', 'samples', 'is', 'small', 'compared', 'to', 'the', 'number', 'of', 'features', 'the', 'simkern', 'approach', 'dominates', 'over', 'nopriorknowledge', 'methods', 'this', 'approach', 'should', 'be', 'applicable', 'in', 'all', 'disciplines', 'where', 'predictive', 'models', 'are', 'sought', 'and', 'informative', 'yet', 'approximate', 'simulations', 'are', 'available', 'availability', 'the', 'python', 'simkern', 'software', 'the', 'demonstration', 'models', 'in', 'matlab', 'r', 'and', 'the', 'datasets', 'are', 'available', 'at', 'httpsgithubcomdavidcraftsimkern']] | [-0.0578662023056858, 0.043140525366418915, -0.08662841022345918, 0.09966823485543723, -0.084227905534171, -0.17530222802000534, 0.005718504356610563, 0.4300681786324549, -0.26187779783481074, -0.3445372983754388, 0.11014716030687936, -0.26912001744759356, -0.1535436747882795, 0.2449648968117098, -0.05002550014548681, 0.08906902819868451, 0.12042648277683515, 0.030207587682123005, -0.06489963239986493, -0.2737672148969967, 0.29180653210639174, 0.04346334511274288, 0.3067981499788377, -0.006877511208269583, 0.09917998257444678, -0.038778417131986855, -0.03524925898145811, 0.0302809935993526, -0.08964132845132353, 0.13437170376577837, 0.28853432656636613, 0.1826848167550599, 0.31296714909904794, -0.395080188684142, -0.22628274401686643, 0.12059782294182865, 0.11965893922438532, 0.1173058825894374, -0.014635088058416786, -0.24580525398519434, 0.10179243896344287, -0.16522992107641732, -0.058947898060996304, -0.15906080048625162, -0.027252827355962083, 0.026765856593301003, -0.31456725792996143, 0.03362068007497684, 0.014300311429438958, 0.05231065106515592, -0.0384172626886988, -0.11288167208915377, 0.001799006851136007, 0.14133534980169404, 0.008117309081728898, 0.011609773694081121, 0.14025528402239812, -0.1355385588239126, -0.10766789727483549, 0.3831158161141243, -0.04029182507317162, -0.23708558893530618, 0.2550282562215971, -0.07839260810411906, -0.1333742824386761, 0.0838693411580909, 0.21465142141878532, 0.12117045580155471, -0.16328745571173556, 0.03851783458049604, -0.04232105293417931, 0.1855691444044086, -0.004463835253118879, -0.000685954948228309, 0.18201043353077362, 0.19760297857507467, -0.012459101217979263, 0.13108887892720758, -0.08181896333383919, -0.09398471432040434, -0.277597150167408, -0.10340676027103493, -0.194322495926963, -0.012569663291424329, -0.08278130343252436, -0.1475233366377486, 0.3575059741978412, 0.2283810761786184, 0.21893342674927044, 0.09106330935872738, 0.3094646491021978, 0.057906092473088575, 0.0795144226994244, 0.10921400491693038, 0.18012877273073755, 0.06474120281047736, 0.06949848723607027, -0.12222729497883661, 0.09104558378605268, 0.030395588561480225] |
1,802.05689 | Strongly Correlated Bosons on a Dynamical Lattice | We study a one-dimensional system of strongly correlated bosons on a
dynamical lattice. To this end, we extend the standard Bose-Hubbard Hamiltonian
to include extra degrees of freedom on the bonds of the lattice. We show that
this minimal model exhibits phenomena reminiscent of fermion-phonon models. In
particular, we discover a bosonic analog of the Peierls transition, where the
translational symmetry of the underlying lattice is spontaneously broken. This
provides a dynamical mechanism to obtain a topological insulator in the
presence of interactions, analogous to the Su-Schrieffer-Heeger model for
electrons. We characterize the phase diagram numerically, showing different
types of bond order waves and topological solitons. Finally, we study the
possibility of implementing the model using atomic systems.
| cond-mat.quant-gas quant-ph | we study a onedimensional system of strongly correlated bosons on a dynamical lattice to this end we extend the standard bosehubbard hamiltonian to include extra degrees of freedom on the bonds of the lattice we show that this minimal model exhibits phenomena reminiscent of fermionphonon models in particular we discover a bosonic analog of the peierls transition where the translational symmetry of the underlying lattice is spontaneously broken this provides a dynamical mechanism to obtain a topological insulator in the presence of interactions analogous to the suschriefferheeger model for electrons we characterize the phase diagram numerically showing different types of bond order waves and topological solitons finally we study the possibility of implementing the model using atomic systems | [['we', 'study', 'a', 'onedimensional', 'system', 'of', 'strongly', 'correlated', 'bosons', 'on', 'a', 'dynamical', 'lattice', 'to', 'this', 'end', 'we', 'extend', 'the', 'standard', 'bosehubbard', 'hamiltonian', 'to', 'include', 'extra', 'degrees', 'of', 'freedom', 'on', 'the', 'bonds', 'of', 'the', 'lattice', 'we', 'show', 'that', 'this', 'minimal', 'model', 'exhibits', 'phenomena', 'reminiscent', 'of', 'fermionphonon', 'models', 'in', 'particular', 'we', 'discover', 'a', 'bosonic', 'analog', 'of', 'the', 'peierls', 'transition', 'where', 'the', 'translational', 'symmetry', 'of', 'the', 'underlying', 'lattice', 'is', 'spontaneously', 'broken', 'this', 'provides', 'a', 'dynamical', 'mechanism', 'to', 'obtain', 'a', 'topological', 'insulator', 'in', 'the', 'presence', 'of', 'interactions', 'analogous', 'to', 'the', 'suschriefferheeger', 'model', 'for', 'electrons', 'we', 'characterize', 'the', 'phase', 'diagram', 'numerically', 'showing', 'different', 'types', 'of', 'bond', 'order', 'waves', 'and', 'topological', 'solitons', 'finally', 'we', 'study', 'the', 'possibility', 'of', 'implementing', 'the', 'model', 'using', 'atomic', 'systems']] | [-0.2056444685558899, 0.21331121289502766, -0.07230287849344708, 0.07135864925547108, -0.03173690786095873, -0.14416907802500398, 0.08276426322931835, 0.3455166662036899, -0.2646737795567803, -0.22168058187748163, 0.04042103621611466, -0.27908113871117013, -0.20091298525616275, 0.0877241805329982, 0.02210224258626606, 0.017183272577467042, -0.0246064079534736, -0.01677267527468187, -0.1048668218752906, -0.20938639140735238, 0.308292680664651, -0.009443274269006768, 0.2646693085178228, 0.05690307258746697, 0.06844578132376675, 0.026480570023137508, 0.07795380581549163, -0.017058471667627664, -0.19791248597638036, 0.10553594215741476, 0.13640623379803202, -0.04099774105726915, 0.1523468521999795, -0.4325713122547683, -0.2542421442724891, 0.10162451383815604, 0.14137909012862435, 0.2035741419531405, -0.03732383758090121, -0.2935429429398629, 0.03155009668730831, -0.20738288490654175, -0.18561218992286063, -0.09857295020246658, -0.03901173799077712, -0.008977762814137643, -0.24066662279912665, 0.0857837612748588, 0.09142388357984108, 0.08657045889708956, -0.06233122790926846, -0.011550704894342729, -0.06732225980830647, 0.05424603782752055, 0.021969301629045947, -0.007499605068005621, 0.070761797358716, -0.13793098177737162, -0.15429084814327249, 0.45496347704428736, -0.06901358373974198, -0.1676565788062763, 0.23438831134028418, -0.12967865145765245, -0.1450163965168709, 0.10500648893194936, 0.16845060521894592, 0.06759601874056004, -0.1231429633147762, 0.1024103822414487, -0.06043040312005807, 0.1838935105644573, -0.026022849294704276, 0.06783729298355973, 0.23336872952532464, 0.19678800854776687, 0.039569703128062565, 0.2556633102249796, -0.050678514156754964, -0.1741099572124875, -0.3004388023104708, -0.16003751185706863, -0.17988373760639106, 0.0390781865186863, -0.0590337142189205, -0.16917140793718272, 0.46755943632826713, 0.18631436600314327, 0.18638817752095854, -0.004457356909416237, 0.21039051330900924, 0.11678090925186367, 0.04008653238652495, 0.0059206677399481, 0.2235355798778582, 0.13082996407480343, 0.03939381967716992, -0.26975282836089826, -0.03556087131116745, 0.10872886647170378] |
1,802.0569 | Learning DNFs under product distributions via {\mu}-biased quantum
Fourier sampling | We show that DNF formulae can be quantum PAC-learned in polynomial time under
product distributions using a quantum example oracle. The best classical
algorithm (without access to membership queries) runs in superpolynomial time.
Our result extends the work by Bshouty and Jackson (1998) that proved that DNF
formulae are efficiently learnable under the uniform distribution using a
quantum example oracle. Our proof is based on a new quantum algorithm that
efficiently samples the coefficients of a {\mu}-biased Fourier transform.
| quant-ph cs.DM cs.LG | we show that dnf formulae can be quantum paclearned in polynomial time under product distributions using a quantum example oracle the best classical algorithm without access to membership queries runs in superpolynomial time our result extends the work by bshouty and jackson 1998 that proved that dnf formulae are efficiently learnable under the uniform distribution using a quantum example oracle our proof is based on a new quantum algorithm that efficiently samples the coefficients of a mubiased fourier transform | [['we', 'show', 'that', 'dnf', 'formulae', 'can', 'be', 'quantum', 'paclearned', 'in', 'polynomial', 'time', 'under', 'product', 'distributions', 'using', 'a', 'quantum', 'example', 'oracle', 'the', 'best', 'classical', 'algorithm', 'without', 'access', 'to', 'membership', 'queries', 'runs', 'in', 'superpolynomial', 'time', 'our', 'result', 'extends', 'the', 'work', 'by', 'bshouty', 'and', 'jackson', '1998', 'that', 'proved', 'that', 'dnf', 'formulae', 'are', 'efficiently', 'learnable', 'under', 'the', 'uniform', 'distribution', 'using', 'a', 'quantum', 'example', 'oracle', 'our', 'proof', 'is', 'based', 'on', 'a', 'new', 'quantum', 'algorithm', 'that', 'efficiently', 'samples', 'the', 'coefficients', 'of', 'a', 'mubiased', 'fourier', 'transform']] | [-0.06667604349408444, 0.0570840553916135, -0.16137182165856484, 0.09840528788680042, -0.10903702753704864, -0.18225942034419482, 0.13149484765093, 0.38062245500358666, -0.26455478103492747, -0.2895314885369901, 0.08176886492753523, -0.19305578782525543, -0.18253148903513883, 0.28163484292854735, -0.08020939648925483, 0.15094324645235555, 0.08787672505139482, -0.0004285899461126076, -0.05335605514005988, -0.3531148323650145, 0.2602109933187338, 0.020259986129625665, 0.23977010075438332, 0.0009328213674560577, 0.09410008070869492, 0.044151319112241655, -0.00042112362752487134, -0.003179421466956665, -0.10548403859327475, 0.09512686683469779, 0.2588747665165113, 0.19021191143176772, 0.2700682464781423, -0.4141780325973576, -0.14716629612610324, 0.09221096870840176, 0.13051961624220787, 0.1067326521476755, -0.04886113994531092, -0.30468259580046325, 0.09415242579076197, -0.16062985499111282, -0.05746929418271432, -0.1082993174068533, 0.005552620566510535, 0.03864981173598147, -0.3428573017673833, 0.03845717817811029, 0.1417213679811397, 0.009636608696264494, -0.009016860965881255, -0.08465788821242266, 0.1455721258572847, 0.06843729797968423, -0.06654700551290887, 0.05525769259441982, 0.08004865760298131, -0.061402765695344315, -0.2153686678593422, 0.3077973168246545, -0.08452922517022529, -0.20770585473759898, 0.10693490797919887, -0.09789453452307877, -0.14490439478525674, 0.08736150440844623, 0.13868094824689936, 0.16516809943192579, -0.1475964972096217, 0.18160539981531124, -0.16647042929158581, 0.19040205093197426, 0.12432196491410012, 0.012622241850023145, 0.04620181120835341, 0.04265895139353423, 0.07704689622215637, 0.20489584835240157, -0.009270967138544112, -0.1332518290788806, -0.27662484700997153, -0.2154972462902789, -0.28510929400996343, 0.04021228931529762, -0.1563281999753906, -0.15471800385260737, 0.36468890282724586, 0.13289580334434528, 0.17892280484658557, 0.18886604782967986, 0.302486452092598, 0.15319574089999033, 0.06539159197384467, 0.18115791440759968, 0.09917285176622984, 0.11507135978295141, 0.05292527583033125, -0.15627121745137038, 0.16974187484494857, 0.1324521220446407] |
1,802.05691 | Landau level diagram and the continuous rotational symmetry breaking in
trilayer graphene | The sequence of the zeroth Landau levels (LLs) between filling factors
$\nu$=-6 to 6 in ABA-stacked trilayer graphene (TLG) is unknown because it
depends sensitively on the non-uniform charge distribution on the three layers
of ABA-stacked TLG. Using the sensitivity of quantum Hall data on the electric
field and magnetic field, in an ultraclean ABA-stacked TLG sample, we
quantitatively estimate the non-uniformity of the electric field and determine
the sequence of the zeroth LLs. We also observe anticrossings between some LLs
differing by 3 in LL index, which result from the breaking of the continuous
rotational to \textit{C}$_3$ symmetry by the trigonal warping.
| cond-mat.mes-hall | the sequence of the zeroth landau levels lls between filling factors nu6 to 6 in abastacked trilayer graphene tlg is unknown because it depends sensitively on the nonuniform charge distribution on the three layers of abastacked tlg using the sensitivity of quantum hall data on the electric field and magnetic field in an ultraclean abastacked tlg sample we quantitatively estimate the nonuniformity of the electric field and determine the sequence of the zeroth lls we also observe anticrossings between some lls differing by 3 in ll index which result from the breaking of the continuous rotational to textitc_3 symmetry by the trigonal warping | [['the', 'sequence', 'of', 'the', 'zeroth', 'landau', 'levels', 'lls', 'between', 'filling', 'factors', 'nu6', 'to', '6', 'in', 'abastacked', 'trilayer', 'graphene', 'tlg', 'is', 'unknown', 'because', 'it', 'depends', 'sensitively', 'on', 'the', 'nonuniform', 'charge', 'distribution', 'on', 'the', 'three', 'layers', 'of', 'abastacked', 'tlg', 'using', 'the', 'sensitivity', 'of', 'quantum', 'hall', 'data', 'on', 'the', 'electric', 'field', 'and', 'magnetic', 'field', 'in', 'an', 'ultraclean', 'abastacked', 'tlg', 'sample', 'we', 'quantitatively', 'estimate', 'the', 'nonuniformity', 'of', 'the', 'electric', 'field', 'and', 'determine', 'the', 'sequence', 'of', 'the', 'zeroth', 'lls', 'we', 'also', 'observe', 'anticrossings', 'between', 'some', 'lls', 'differing', 'by', '3', 'in', 'll', 'index', 'which', 'result', 'from', 'the', 'breaking', 'of', 'the', 'continuous', 'rotational', 'to', 'textitc_3', 'symmetry', 'by', 'the', 'trigonal', 'warping']] | [-0.18847694850581534, 0.17941631262282517, -0.014618261708129271, 0.03278956688340187, 0.002819617616706619, -0.09179256195385083, 0.08436075101524372, 0.37203335557498185, -0.2615537746380284, -0.3871436095979138, -0.040599893065233365, -0.25394010445212617, -0.14827644616632504, 0.1259539186607535, 0.0042702407923107056, -0.043125488519139006, -0.0796384965023939, -0.05404941209902366, -0.07154037910353794, -0.22256775720811942, 0.35298439229418543, -0.020041533778923766, 0.349881919835895, 0.051865085753995704, 0.05951705342044542, 0.012835215366281131, 0.08493221889925646, -0.002154292319627369, -0.12776270173216128, 0.05156454114316433, 0.16664971816855684, -0.12844406380135492, 0.22001105921762978, -0.42359134064513365, -0.07085076613607359, -0.061680898622737505, 0.12438164555294183, 0.13032376793710806, -0.012369637193806543, -0.270986180606426, 0.076149994046336, -0.11495786619272229, -0.08719686753865258, -0.04908821714914167, -0.024723575894456066, -0.016908459730592428, -0.2255221329921601, 0.11652283435978461, 0.05411230753102869, 0.09514865381232299, -0.09967719785202586, -0.1620836204680267, -0.12105236890641333, 0.12139568562555474, 0.06739174400675385, 0.02206320927807075, 0.15829265077128166, -0.1730688312421918, -0.11052600706142246, 0.3685737508257814, -0.06593178886481944, -0.15633321869045533, 0.12428633658690195, -0.26531988988612215, -0.12545988492795504, 0.14697308739756837, 0.10264953790693636, 0.07037865727518995, -0.06659818658212602, 0.12699276551275568, -0.027365746761800026, 0.17599335036642266, 0.09467221947167725, 0.06272025217813458, 0.2215288694144464, 0.10402232638158489, 0.062335394896246156, 0.11257074283910733, -0.17808430807381942, -0.01892966065583203, -0.23594932437089144, -0.1556414924834469, -0.22742122767821832, 0.10462355164025783, -0.10512168883738637, -0.24129288095305218, 0.4974321740697704, 0.13692235013506576, 0.20150809997108346, -0.05158677152883006, 0.2866223364858432, 0.19441427127001623, 0.06937473497408278, 0.009758425228224666, 0.21851215534301374, 0.1597498985984381, 0.04212557493855117, -0.31504182157097566, 0.0228164393988931, 0.008609869137324174] |
1,802.05692 | Asymptotics for scalar perturbations from a neighborhood of the
bifurcation sphere | In our previous work [Y. Angelopoulos, S. Aretakis, and D. Gajic, Late-time
asymptotics for the wave equation on spherically symmetric stationary
backgrounds, in Advances in Mathematics 323 (2018), 529-621] we showed that the
coefficient in the precise leading-order late-time asymptotics for solutions to
the wave equation with smooth, compactly supported initial data on
Schwarzschild backgrounds is proportional to the time-inverted Newman-Penrose
constant (TINP), that is the Newman-Penrose constant of the associated time
integral. The time integral (and hence the TINP constant) is canonically
defined in the domain of dependence of any Cauchy hypersurface along which the
stationary Killing field is non-vanishing. As a result, an explicit expression
of the late-time polynomial tails was obtained in terms of initial data on
Cauchy hypersurfaces intersecting the future event horizon to the future of the
bifurcation sphere.
In this paper, we extend the above result to Cauchy hypersurfaces
intersecting the bifurcation sphere via a novel geometric interpretation of the
TINP constant in terms of a modified gradient flux on Cauchy hypersurfaces. We
show, without appealing to the time integral construction, that a general
conservation law holds for these gradient fluxes. This allows us to express the
TINP constant in terms of initial data on Cauchy hypersurfaces for which the
time integral construction breaks down.
| gr-qc math.AP | in our previous work y angelopoulos s aretakis and d gajic latetime asymptotics for the wave equation on spherically symmetric stationary backgrounds in advances in mathematics 323 2018 529621 we showed that the coefficient in the precise leadingorder latetime asymptotics for solutions to the wave equation with smooth compactly supported initial data on schwarzschild backgrounds is proportional to the timeinverted newmanpenrose constant tinp that is the newmanpenrose constant of the associated time integral the time integral and hence the tinp constant is canonically defined in the domain of dependence of any cauchy hypersurface along which the stationary killing field is nonvanishing as a result an explicit expression of the latetime polynomial tails was obtained in terms of initial data on cauchy hypersurfaces intersecting the future event horizon to the future of the bifurcation sphere in this paper we extend the above result to cauchy hypersurfaces intersecting the bifurcation sphere via a novel geometric interpretation of the tinp constant in terms of a modified gradient flux on cauchy hypersurfaces we show without appealing to the time integral construction that a general conservation law holds for these gradient fluxes this allows us to express the tinp constant in terms of initial data on cauchy hypersurfaces for which the time integral construction breaks down | [['in', 'our', 'previous', 'work', 'y', 'angelopoulos', 's', 'aretakis', 'and', 'd', 'gajic', 'latetime', 'asymptotics', 'for', 'the', 'wave', 'equation', 'on', 'spherically', 'symmetric', 'stationary', 'backgrounds', 'in', 'advances', 'in', 'mathematics', '323', '2018', '529621', 'we', 'showed', 'that', 'the', 'coefficient', 'in', 'the', 'precise', 'leadingorder', 'latetime', 'asymptotics', 'for', 'solutions', 'to', 'the', 'wave', 'equation', 'with', 'smooth', 'compactly', 'supported', 'initial', 'data', 'on', 'schwarzschild', 'backgrounds', 'is', 'proportional', 'to', 'the', 'timeinverted', 'newmanpenrose', 'constant', 'tinp', 'that', 'is', 'the', 'newmanpenrose', 'constant', 'of', 'the', 'associated', 'time', 'integral', 'the', 'time', 'integral', 'and', 'hence', 'the', 'tinp', 'constant', 'is', 'canonically', 'defined', 'in', 'the', 'domain', 'of', 'dependence', 'of', 'any', 'cauchy', 'hypersurface', 'along', 'which', 'the', 'stationary', 'killing', 'field', 'is', 'nonvanishing', 'as', 'a', 'result', 'an', 'explicit', 'expression', 'of', 'the', 'latetime', 'polynomial', 'tails', 'was', 'obtained', 'in', 'terms', 'of', 'initial', 'data', 'on', 'cauchy', 'hypersurfaces', 'intersecting', 'the', 'future', 'event', 'horizon', 'to', 'the', 'future', 'of', 'the', 'bifurcation', 'sphere', 'in', 'this', 'paper', 'we', 'extend', 'the', 'above', 'result', 'to', 'cauchy', 'hypersurfaces', 'intersecting', 'the', 'bifurcation', 'sphere', 'via', 'a', 'novel', 'geometric', 'interpretation', 'of', 'the', 'tinp', 'constant', 'in', 'terms', 'of', 'a', 'modified', 'gradient', 'flux', 'on', 'cauchy', 'hypersurfaces', 'we', 'show', 'without', 'appealing', 'to', 'the', 'time', 'integral', 'construction', 'that', 'a', 'general', 'conservation', 'law', 'holds', 'for', 'these', 'gradient', 'fluxes', 'this', 'allows', 'us', 'to', 'express', 'the', 'tinp', 'constant', 'in', 'terms', 'of', 'initial', 'data', 'on', 'cauchy', 'hypersurfaces', 'for', 'which', 'the', 'time', 'integral', 'construction', 'breaks', 'down']] | [-0.17896803216381857, 0.0484993662198926, -0.10957803621847863, 0.07457295690255705, -0.11472921554769318, -0.08619210275803478, -0.035114752298306066, 0.288715577729118, -0.23156653488135467, -0.22402710836300124, 0.11925552620666097, -0.2700116574807488, -0.10320019870638274, 0.1785126065078657, -0.07925203459140343, 0.07396667198470543, 0.04571610600508463, 0.050412911301604114, -0.09923568196805158, -0.2553078506260555, 0.3704450440575154, 0.04360086066970745, 0.2566119318854852, 0.0541604213856492, 0.13639386606910892, 0.018727917244317584, -0.02320354738689135, 0.0027602393238339573, -0.19641377466482132, 0.08246172281892192, 0.23044609177570516, 0.10144239594788254, 0.18384636482761169, -0.42262036366782224, -0.20249530014412953, 0.1357635780586861, 0.15452817476426178, 0.09582803394606834, -0.007981007225820437, -0.28018171378733736, 0.037173743137547996, -0.09941612711498657, -0.23398506875058117, -0.04764714471037643, 0.08007267990223436, 0.027180956425651787, -0.252997141308487, 0.12764686741642295, 0.06622891514248644, 0.005756001560187612, -0.12860614049070415, -0.059357809625138404, -0.016804449899399724, 0.03750888324094166, 0.11005883416118405, 0.08261135839543735, 0.06785126984379111, -0.09256137365726037, -0.07950333891830479, 0.3149583502303218, -0.13073464453079325, -0.23860171847179748, 0.08502689484829226, -0.1827414526935452, -0.1193724198495217, 0.13787517179018602, 0.16017761972929853, 0.1749450599517891, -0.12510234931519684, 0.1825066191998373, -0.015046547881026457, 0.08940642917150399, 0.13768240802276593, -0.036470477060412614, 0.17914173655802956, 0.05961516188332238, 0.07766460727837582, 0.12066109460339738, -0.03854307726522585, -0.10949581897763822, -0.40976231316856754, -0.19019003744072577, -0.185985321696185, 0.12467012711497844, -0.16401075338483048, -0.19345584884901584, 0.3690983086618452, 0.08437729423887784, 0.1826188148250087, 0.11100945014130467, 0.2329721292704702, 0.12080456036402701, 0.018767775988985356, 0.10057245597664195, 0.217423259097044, 0.1258013798713084, 0.15619402442154331, -0.2163275112856914, 0.003824897967905809, 0.1200114281471962] |
1,802.05693 | Bandit Learning with Positive Externalities | In many platforms, user arrivals exhibit a self-reinforcing behavior: future
user arrivals are likely to have preferences similar to users who were
satisfied in the past. In other words, arrivals exhibit positive externalities.
We study multiarmed bandit (MAB) problems with positive externalities. We show
that the self-reinforcing preferences may lead standard benchmark algorithms
such as UCB to exhibit linear regret. We develop a new algorithm, Balanced
Exploration (BE), which explores arms carefully to avoid suboptimal convergence
of arrivals before sufficient evidence is gathered. We also introduce an
adaptive variant of BE which successively eliminates suboptimal arms. We
analyze their asymptotic regret, and establish optimality by showing that no
algorithm can perform better.
| cs.LG stat.ML | in many platforms user arrivals exhibit a selfreinforcing behavior future user arrivals are likely to have preferences similar to users who were satisfied in the past in other words arrivals exhibit positive externalities we study multiarmed bandit mab problems with positive externalities we show that the selfreinforcing preferences may lead standard benchmark algorithms such as ucb to exhibit linear regret we develop a new algorithm balanced exploration be which explores arms carefully to avoid suboptimal convergence of arrivals before sufficient evidence is gathered we also introduce an adaptive variant of be which successively eliminates suboptimal arms we analyze their asymptotic regret and establish optimality by showing that no algorithm can perform better | [['in', 'many', 'platforms', 'user', 'arrivals', 'exhibit', 'a', 'selfreinforcing', 'behavior', 'future', 'user', 'arrivals', 'are', 'likely', 'to', 'have', 'preferences', 'similar', 'to', 'users', 'who', 'were', 'satisfied', 'in', 'the', 'past', 'in', 'other', 'words', 'arrivals', 'exhibit', 'positive', 'externalities', 'we', 'study', 'multiarmed', 'bandit', 'mab', 'problems', 'with', 'positive', 'externalities', 'we', 'show', 'that', 'the', 'selfreinforcing', 'preferences', 'may', 'lead', 'standard', 'benchmark', 'algorithms', 'such', 'as', 'ucb', 'to', 'exhibit', 'linear', 'regret', 'we', 'develop', 'a', 'new', 'algorithm', 'balanced', 'exploration', 'be', 'which', 'explores', 'arms', 'carefully', 'to', 'avoid', 'suboptimal', 'convergence', 'of', 'arrivals', 'before', 'sufficient', 'evidence', 'is', 'gathered', 'we', 'also', 'introduce', 'an', 'adaptive', 'variant', 'of', 'be', 'which', 'successively', 'eliminates', 'suboptimal', 'arms', 'we', 'analyze', 'their', 'asymptotic', 'regret', 'and', 'establish', 'optimality', 'by', 'showing', 'that', 'no', 'algorithm', 'can', 'perform', 'better']] | [-0.15346188227912144, 0.02333057411838776, -0.1277458814646317, 0.16438059301019944, -0.2022383791294747, -0.25266146077774465, 0.12276867250745584, 0.49384371660250637, -0.2762220094446093, -0.33257068435861065, 0.07497273770630793, -0.2874409006908536, -0.20795547850554744, 0.12177094795593543, -0.1797595020242235, 0.03629920002692545, 0.06820915474340186, 0.026941173360683024, 0.0012349401284999268, -0.33477167147170156, 0.26099844262353145, 0.08025139470035876, 0.23424664410829013, -0.03207747921780018, 0.05813133719181808, -0.0272341741199073, -0.01006227669339361, 0.04689372552924657, -0.15823159898757563, 0.009895332074458045, 0.3357270401902497, 0.2070500692186345, 0.3939527051988989, -0.43670828219702734, -0.16570876245012706, 0.1703745481707821, 0.13917133813707291, 0.07849937986299795, -0.09303824202756264, -0.3144685467954592, 0.11021964122846839, -0.175447949580335, -0.028687845464446582, -0.09355019978413891, -0.08215879003650375, 0.06874011722123084, -0.34931117969141007, 0.03010114887911186, 0.050137949463013295, 0.02069848982916613, -0.04088111039683489, -0.12926405787168602, 0.08076762502813446, 0.14006564206543512, 0.12075580749348903, -0.06664862219726533, 0.1252931575623474, -0.08196890667646325, -0.25983805177799824, 0.3280041323679533, -0.02760340991413354, -0.15898769511841238, 0.17606211340587055, -0.08921164978528395, -0.155246493471038, 0.13586473554771925, 0.28935925773943644, 0.11281393066747114, -0.15581407678213768, 0.003246720083032934, -0.087304297992627, 0.14080060681694054, 0.11500438021279738, 0.06417570907069603, 0.13517129105665454, 0.15408921282505617, 0.19581594645101827, 0.15174459785599279, 0.01734351345138358, -0.15660484238261624, -0.20694249214804067, -0.10353573141037486, -0.08730361743489214, 0.008488449112129664, -0.12264805876254416, -0.1306692854019015, 0.28271221960624515, 0.18795200764205738, 0.1842203298833088, 0.15027001135812107, 0.2797776101090546, 0.09475627117509637, 0.021763033397811733, 0.17323376331894128, 0.18572599347472923, -0.033915969996347224, 0.11062455625506118, -0.21040289338894322, 0.19675271660006338, 0.00983071889952823] |
1,802.05694 | Multinomial Adversarial Networks for Multi-Domain Text Classification | Many text classification tasks are known to be highly domain-dependent.
Unfortunately, the availability of training data can vary drastically across
domains. Worse still, for some domains there may not be any annotated data at
all. In this work, we propose a multinomial adversarial network (MAN) to tackle
the text classification problem in this real-world multidomain setting (MDTC).
We provide theoretical justifications for the MAN framework, proving that
different instances of MANs are essentially minimizers of various f-divergence
metrics (Ali and Silvey, 1966) among multiple probability distributions. MANs
are thus a theoretically sound generalization of traditional adversarial
networks that discriminate over two distributions. More specifically, for the
MDTC task, MAN learns features that are invariant across multiple domains by
resorting to its ability to reduce the divergence among the feature
distributions of each domain. We present experimental results showing that MANs
significantly outperform the prior art on the MDTC task. We also show that MANs
achieve state-of-the-art performance for domains with no labeled data.
| cs.CL cs.LG stat.ML | many text classification tasks are known to be highly domaindependent unfortunately the availability of training data can vary drastically across domains worse still for some domains there may not be any annotated data at all in this work we propose a multinomial adversarial network man to tackle the text classification problem in this realworld multidomain setting mdtc we provide theoretical justifications for the man framework proving that different instances of mans are essentially minimizers of various fdivergence metrics ali and silvey 1966 among multiple probability distributions mans are thus a theoretically sound generalization of traditional adversarial networks that discriminate over two distributions more specifically for the mdtc task man learns features that are invariant across multiple domains by resorting to its ability to reduce the divergence among the feature distributions of each domain we present experimental results showing that mans significantly outperform the prior art on the mdtc task we also show that mans achieve stateoftheart performance for domains with no labeled data | [['many', 'text', 'classification', 'tasks', 'are', 'known', 'to', 'be', 'highly', 'domaindependent', 'unfortunately', 'the', 'availability', 'of', 'training', 'data', 'can', 'vary', 'drastically', 'across', 'domains', 'worse', 'still', 'for', 'some', 'domains', 'there', 'may', 'not', 'be', 'any', 'annotated', 'data', 'at', 'all', 'in', 'this', 'work', 'we', 'propose', 'a', 'multinomial', 'adversarial', 'network', 'man', 'to', 'tackle', 'the', 'text', 'classification', 'problem', 'in', 'this', 'realworld', 'multidomain', 'setting', 'mdtc', 'we', 'provide', 'theoretical', 'justifications', 'for', 'the', 'man', 'framework', 'proving', 'that', 'different', 'instances', 'of', 'mans', 'are', 'essentially', 'minimizers', 'of', 'various', 'fdivergence', 'metrics', 'ali', 'and', 'silvey', '1966', 'among', 'multiple', 'probability', 'distributions', 'mans', 'are', 'thus', 'a', 'theoretically', 'sound', 'generalization', 'of', 'traditional', 'adversarial', 'networks', 'that', 'discriminate', 'over', 'two', 'distributions', 'more', 'specifically', 'for', 'the', 'mdtc', 'task', 'man', 'learns', 'features', 'that', 'are', 'invariant', 'across', 'multiple', 'domains', 'by', 'resorting', 'to', 'its', 'ability', 'to', 'reduce', 'the', 'divergence', 'among', 'the', 'feature', 'distributions', 'of', 'each', 'domain', 'we', 'present', 'experimental', 'results', 'showing', 'that', 'mans', 'significantly', 'outperform', 'the', 'prior', 'art', 'on', 'the', 'mdtc', 'task', 'we', 'also', 'show', 'that', 'mans', 'achieve', 'stateoftheart', 'performance', 'for', 'domains', 'with', 'no', 'labeled', 'data']] | [-0.05357053880422644, 0.014544412298727941, -0.08459573981003618, 0.1121951366897581, -0.125013195278203, -0.18295426379626423, 0.052474375967039195, 0.44732095434850344, -0.25748521488079906, -0.3472268821763023, 0.06299638275222773, -0.2815174292894423, -0.15670859417449567, 0.21606142933200473, -0.18196492588456056, 0.07019357461492286, 0.14549210368501353, 0.027061826539650113, -0.05853272128444553, -0.3106228882229767, 0.32792005191722806, -0.016458583034380723, 0.3715255025822806, 0.032839299439584003, 0.05790965596679598, -0.05802134263894858, -0.000305509237583978, 0.006818737616859651, -0.07119471961429716, 0.1441630006927077, 0.3620751493301905, 0.2048509769895874, 0.30389657650040064, -0.3900083162781834, -0.24984011509415746, 0.13347201697039845, 0.13273431412001466, 0.1026039738779419, -0.012978195968856092, -0.3204675635460056, 0.12052953175406195, -0.14513667006805495, 0.011500995420490854, -0.16534282163676858, -0.01858633708071672, 0.0014994165008784803, -0.2669920248687953, 0.06274120970411323, 0.1060151765180146, 0.059507543678653275, -0.05356759610414459, -0.12837581340497806, 0.03990490965050948, 0.1642669665611469, 0.06188578093053053, 0.02559667189199866, 0.08536609232659949, -0.16913625531318524, -0.15828155522146176, 0.3447864435933119, -0.02139978922840688, -0.2578256512460716, 0.22368403411601767, -0.06127471824039482, -0.16308779949093796, 0.08382115698797325, 0.1753283410955883, 0.12564164273829365, -0.16218362134121403, 0.019853008559267922, -0.0719720605429422, 0.16360460065499496, 0.10854002605963704, 0.004663862233004458, 0.13060249486421036, 0.1882305376412364, 0.06318581828731826, 0.1187492555658693, -0.07835487831966734, -0.0978654135758503, -0.20943041675312707, -0.10553885499826787, -0.20106829972323487, -0.03848061641880691, -0.09371401252433231, -0.16202001113078893, 0.3692160060777803, 0.22090945600180606, 0.21748311993197475, 0.1394645249427502, 0.2940728707421868, 0.001222792792882473, 0.06417775309238971, 0.11012175425735697, 0.1691122311604869, -0.013198980105972272, 0.12475222202969223, -0.1379344503722365, 0.12393345646103102, -0.004193424309162492] |
1,802.05695 | Explainable Prediction of Medical Codes from Clinical Text | Clinical notes are text documents that are created by clinicians for each
patient encounter. They are typically accompanied by medical codes, which
describe the diagnosis and treatment. Annotating these codes is labor intensive
and error prone; furthermore, the connection between the codes and the text is
not annotated, obscuring the reasons and details behind specific diagnoses and
treatments. We present an attentional convolutional network that predicts
medical codes from clinical text. Our method aggregates information across the
document using a convolutional neural network, and uses an attention mechanism
to select the most relevant segments for each of the thousands of possible
codes. The method is accurate, achieving precision@8 of 0.71 and a Micro-F1 of
0.54, which are both better than the prior state of the art. Furthermore,
through an interpretability evaluation by a physician, we show that the
attention mechanism identifies meaningful explanations for each code assignment
| cs.CL cs.LG stat.ML | clinical notes are text documents that are created by clinicians for each patient encounter they are typically accompanied by medical codes which describe the diagnosis and treatment annotating these codes is labor intensive and error prone furthermore the connection between the codes and the text is not annotated obscuring the reasons and details behind specific diagnoses and treatments we present an attentional convolutional network that predicts medical codes from clinical text our method aggregates information across the document using a convolutional neural network and uses an attention mechanism to select the most relevant segments for each of the thousands of possible codes the method is accurate achieving precision8 of 071 and a microf1 of 054 which are both better than the prior state of the art furthermore through an interpretability evaluation by a physician we show that the attention mechanism identifies meaningful explanations for each code assignment | [['clinical', 'notes', 'are', 'text', 'documents', 'that', 'are', 'created', 'by', 'clinicians', 'for', 'each', 'patient', 'encounter', 'they', 'are', 'typically', 'accompanied', 'by', 'medical', 'codes', 'which', 'describe', 'the', 'diagnosis', 'and', 'treatment', 'annotating', 'these', 'codes', 'is', 'labor', 'intensive', 'and', 'error', 'prone', 'furthermore', 'the', 'connection', 'between', 'the', 'codes', 'and', 'the', 'text', 'is', 'not', 'annotated', 'obscuring', 'the', 'reasons', 'and', 'details', 'behind', 'specific', 'diagnoses', 'and', 'treatments', 'we', 'present', 'an', 'attentional', 'convolutional', 'network', 'that', 'predicts', 'medical', 'codes', 'from', 'clinical', 'text', 'our', 'method', 'aggregates', 'information', 'across', 'the', 'document', 'using', 'a', 'convolutional', 'neural', 'network', 'and', 'uses', 'an', 'attention', 'mechanism', 'to', 'select', 'the', 'most', 'relevant', 'segments', 'for', 'each', 'of', 'the', 'thousands', 'of', 'possible', 'codes', 'the', 'method', 'is', 'accurate', 'achieving', 'precision8', 'of', '071', 'and', 'a', 'microf1', 'of', '054', 'which', 'are', 'both', 'better', 'than', 'the', 'prior', 'state', 'of', 'the', 'art', 'furthermore', 'through', 'an', 'interpretability', 'evaluation', 'by', 'a', 'physician', 'we', 'show', 'that', 'the', 'attention', 'mechanism', 'identifies', 'meaningful', 'explanations', 'for', 'each', 'code', 'assignment']] | [-0.05153879304480267, 0.037381182513530654, -0.030760458118779813, 0.11457572068320587, -0.10184960457024304, -0.1947431545429512, 0.05468928832273726, 0.4499500408921748, -0.22760529601739157, -0.3132665763698416, 0.1000277360212313, -0.3016769668240457, -0.1672285144816931, 0.20989061862410505, -0.12925473904900558, 0.050078040139577416, 0.1435901650039428, 0.06317665727732524, -0.04625261512111349, -0.2973278967491415, 0.29562755247054956, 0.10064604599666718, 0.32260080821786635, 0.03285551627887388, 0.0839129709415393, -0.03146698721365569, -0.0910531789262154, -0.056335665118140615, -0.10303749034075786, 0.17136693732774727, 0.347259302398713, 0.23330779060440726, 0.340734185341567, -0.4142179592478261, -0.21861420985158175, 0.04037976760914779, 0.13038025821929108, 0.14572734175702837, -0.026405412949341005, -0.2927711928225033, 0.10053674598568924, -0.17559174999071617, 0.05816170236746436, -0.12032104401661033, 0.005367462781627905, -0.01588349203101431, -0.2899808327201754, 0.053274739208337786, 0.04951905017584715, 0.11652522434620824, -0.06837603110622309, -0.12318418197946189, 0.006057576880764777, 0.19639846501546618, 0.047756832030805926, 0.08372768482005173, 0.13496555504030294, -0.17960356564056892, -0.1204267567508433, 0.3764811982592083, 0.05806695865991458, -0.19193001427011538, 0.16499083346291765, -0.02039330065958457, -0.107762353443732, 0.1390846018768745, 0.18647679833261527, 0.11481473830794478, -0.17828006116826445, -0.06715391588051267, -0.014457771327838537, 0.21264753488932214, 0.04547952388912401, 0.016184736540372013, 0.21827786361594517, 0.20574747595604356, -0.06206475636740024, 0.11427098928555234, -0.11261126155487508, -0.039333154827321255, -0.25933583287764594, -0.1300411101163338, -0.15670873858002715, -0.040129813843160354, -0.1051909659267762, -0.1781836539185574, 0.4181695423943743, 0.23046051916733706, 0.17988152428504642, 0.055351934843650405, 0.2987303838758946, -0.023856929390952755, 0.12263322673891097, 0.11000801765755432, 0.12955952285189334, 0.020552833655479122, 0.07888186789334636, -0.16226792437732473, 0.15317093619713176, 0.05119294021378291] |
1,802.05696 | Identification of the Polaron measure I: Fixed coupling regime and the
central limit theorem for large times | We consider the Fr\"ohlich model of the Polaron whose path integral
formulation leads to the transformed path measure
$$
\widehat{\mathbb P}_{\alpha,T}(\mathrm d\omega)= Z_{\alpha,T}^{-1}\,\,
\exp\bigg\{\frac{\alpha}{2}\int_{-T}^T\int_{-T}^T\frac{e^{-|t-s|}}{|\omega(t)-\omega(s)|}
\, d s \, d t\bigg\}\,\mathbb P(\mathrm d\omega)
$$
with respect to $\mathbb P$ which governs the law of the increments of the
three dimensional Brownian motion on a finite interval $[-T,T]$, and $
Z_{\alpha,T}$ is the partition function or the normalizing constant and
$\alpha>0$ is a constant. The Polaron measure reflects a self attractive
interaction. According to a conjecture of Pekar that was proved in [DV83]
$$
g_0=\lim_{\alpha
\to\infty}\frac{1}{\alpha^2}\bigg[\lim_{T\to\infty}\frac{\log
Z_{\alpha,T}}{2T}\bigg]
$$
exists and has a variational formula. In this article we show that for any
$\alpha>0$, the infinite-volume limit $\widehat{\mathbb
P}_{\alpha}=\lim_{T\to\infty}\widehat{\mathbb P}_{\alpha,T}$ exists which is
also identified explicitly. As a corollary, we deduce the central limit theorem
(for any $\alpha>0$ and as $T\to\infty$) for the distribution of
$\frac{\omega(T)-\omega(-T)}{\sqrt{2T}}$ both under the finite-volume Polaron
measure $\widehat{\mathbb P}_{\alpha,T}$ and its infinite-volume counterpart
$\widehat{\mathbb P}_\alpha$, and obtain an expression for the limiting
variance.
| math.PR math-ph math.MP | we consider the frohlich model of the polaron whose path integral formulation leads to the transformed path measure widehatmathbb p_alphatmathrm domega z_alphat1 expbiggfracalpha2int_ttint_ttfracetsomegatomegas d s d tbiggmathbb pmathrm domega with respect to mathbb p which governs the law of the increments of the three dimensional brownian motion on a finite interval tt and z_alphat is the partition function or the normalizing constant and alpha0 is a constant the polaron measure reflects a self attractive interaction according to a conjecture of pekar that was proved in dv83 g_0lim_alpha toinftyfrac1alpha2bigglim_ttoinftyfraclog z_alphat2tbigg exists and has a variational formula in this article we show that for any alpha0 the infinitevolume limit widehatmathbb p_alphalim_ttoinftywidehatmathbb p_alphat exists which is also identified explicitly as a corollary we deduce the central limit theorem for any alpha0 and as ttoinfty for the distribution of fracomegatomegatsqrt2t both under the finitevolume polaron measure widehatmathbb p_alphat and its infinitevolume counterpart widehatmathbb p_alpha and obtain an expression for the limiting variance | [['we', 'consider', 'the', 'frohlich', 'model', 'of', 'the', 'polaron', 'whose', 'path', 'integral', 'formulation', 'leads', 'to', 'the', 'transformed', 'path', 'measure', 'widehatmathbb', 'p_alphatmathrm', 'domega', 'z_alphat1', 'expbiggfracalpha2int_ttint_ttfracetsomegatomegas', 'd', 's', 'd', 'tbiggmathbb', 'pmathrm', 'domega', 'with', 'respect', 'to', 'mathbb', 'p', 'which', 'governs', 'the', 'law', 'of', 'the', 'increments', 'of', 'the', 'three', 'dimensional', 'brownian', 'motion', 'on', 'a', 'finite', 'interval', 'tt', 'and', 'z_alphat', 'is', 'the', 'partition', 'function', 'or', 'the', 'normalizing', 'constant', 'and', 'alpha0', 'is', 'a', 'constant', 'the', 'polaron', 'measure', 'reflects', 'a', 'self', 'attractive', 'interaction', 'according', 'to', 'a', 'conjecture', 'of', 'pekar', 'that', 'was', 'proved', 'in', 'dv83', 'g_0lim_alpha', 'toinftyfrac1alpha2bigglim_ttoinftyfraclog', 'z_alphat2tbigg', 'exists', 'and', 'has', 'a', 'variational', 'formula', 'in', 'this', 'article', 'we', 'show', 'that', 'for', 'any', 'alpha0', 'the', 'infinitevolume', 'limit', 'widehatmathbb', 'p_alphalim_ttoinftywidehatmathbb', 'p_alphat', 'exists', 'which', 'is', 'also', 'identified', 'explicitly', 'as', 'a', 'corollary', 'we', 'deduce', 'the', 'central', 'limit', 'theorem', 'for', 'any', 'alpha0', 'and', 'as', 'ttoinfty', 'for', 'the', 'distribution', 'of', 'fracomegatomegatsqrt2t', 'both', 'under', 'the', 'finitevolume', 'polaron', 'measure', 'widehatmathbb', 'p_alphat', 'and', 'its', 'infinitevolume', 'counterpart', 'widehatmathbb', 'p_alpha', 'and', 'obtain', 'an', 'expression', 'for', 'the', 'limiting', 'variance']] | [-0.13508799857753392, 0.10946802660587247, -0.13016620994232952, 0.08013834699203758, -0.0249671599323772, -0.14317226157625754, 0.06384042641610443, 0.32618738134225755, -0.26781694797722444, -0.18344308212535035, 0.061862660506548844, -0.2961764009908633, -0.11375706060630053, 0.14367626230902206, -0.04285163698360732, 0.04100464680511186, 0.02283482293579217, 0.09789894444928568, -0.039999166048253085, -0.1638474399654501, 0.2950113182951224, -0.015666232278493987, 0.23901904619471107, 0.10606595254399533, 0.16387481214988925, 0.04962199951014928, 0.005976144843160698, 6.129250542558921e-05, -0.227780340932017, 0.07286453862556524, 0.16373558112217612, 0.06291425826780703, 0.25501588978230544, -0.3021249017671822, -0.1793225674829382, 0.1572493039763673, 0.14621787789367038, 0.04038631925773998, 0.03172845673593469, -0.24945285016262572, 0.06591156287890643, -0.15035074681987706, -0.19148538009684585, -0.06175940472804878, 0.12188908987844439, 0.016661694474288658, -0.3182439674218249, 0.10174368270046925, 0.12895675816203225, -0.0041919770229556785, -0.0946154977116823, -0.11595970934754467, -0.020089710369699774, 0.09663506302414844, 0.05687374921757983, 0.12431180412715225, 0.06718413757434599, -0.09385440387183598, -0.07024096770009523, 0.3919635570340165, -0.1250348415748816, -0.24090949901417918, 0.13230607889860563, -0.15382105325769685, -0.12156250469437609, 0.09566632170415139, 0.0655558398049261, 0.12143696686664592, -0.13415794358078442, 0.22851241841570996, -0.08055011965079259, 0.11876149438576747, 0.10064101678120732, 0.01466581007076606, 0.1112448068504893, 0.09385560135586724, 0.11814487352010423, 0.16527289843620502, -0.071411909004482, -0.1052666093631048, -0.3489832047066868, -0.18797541185830757, -0.24418247577874627, 0.1431270551832699, -0.14479969248549585, -0.20435948541056212, 0.2955326601250531, 0.07344844767565469, 0.19864720870319702, 0.1414590972485276, 0.18651110329824716, 0.21114174537966665, 0.00798919767520888, 0.07095695294324972, 0.15142700329346404, 0.15855572856994576, 0.03499886248426588, -0.22389094411133956, 0.02540211988715072, 0.14841037168971274] |
1,802.05697 | Non-equilibrium quantum transport in presence of a defect: the
non-interacting case | We study quantum transport after an inhomogeneous quantum quench in a free
fermion lattice system in the presence of a localised defect. Using a new
rigorous analytical approach for the calculation of large time and distance
asymptotics of physical observables, we derive the exact profiles of particle
density and current. Our analysis shows that the predictions of a semiclassical
approach that has been extensively applied in similar problems match exactly
with the correct asymptotics, except for possible finite distance corrections
close to the defect. We generalise our formulas to an arbitrary non-interacting
particle-conserving defect, expressing them in terms of its scattering
properties.
| cond-mat.stat-mech cond-mat.str-el math-ph math.MP | we study quantum transport after an inhomogeneous quantum quench in a free fermion lattice system in the presence of a localised defect using a new rigorous analytical approach for the calculation of large time and distance asymptotics of physical observables we derive the exact profiles of particle density and current our analysis shows that the predictions of a semiclassical approach that has been extensively applied in similar problems match exactly with the correct asymptotics except for possible finite distance corrections close to the defect we generalise our formulas to an arbitrary noninteracting particleconserving defect expressing them in terms of its scattering properties | [['we', 'study', 'quantum', 'transport', 'after', 'an', 'inhomogeneous', 'quantum', 'quench', 'in', 'a', 'free', 'fermion', 'lattice', 'system', 'in', 'the', 'presence', 'of', 'a', 'localised', 'defect', 'using', 'a', 'new', 'rigorous', 'analytical', 'approach', 'for', 'the', 'calculation', 'of', 'large', 'time', 'and', 'distance', 'asymptotics', 'of', 'physical', 'observables', 'we', 'derive', 'the', 'exact', 'profiles', 'of', 'particle', 'density', 'and', 'current', 'our', 'analysis', 'shows', 'that', 'the', 'predictions', 'of', 'a', 'semiclassical', 'approach', 'that', 'has', 'been', 'extensively', 'applied', 'in', 'similar', 'problems', 'match', 'exactly', 'with', 'the', 'correct', 'asymptotics', 'except', 'for', 'possible', 'finite', 'distance', 'corrections', 'close', 'to', 'the', 'defect', 'we', 'generalise', 'our', 'formulas', 'to', 'an', 'arbitrary', 'noninteracting', 'particleconserving', 'defect', 'expressing', 'them', 'in', 'terms', 'of', 'its', 'scattering', 'properties']] | [-0.09868296830202727, 0.09502886889722682, -0.12618194162096902, 0.09750811896725174, -0.004812600209797714, -0.12955697638201802, 0.04052887712924869, 0.3352314804991086, -0.20203675754943534, -0.2676750837332186, 0.04314202011343749, -0.2801261693695743, -0.11972597974589934, 0.1749815821417096, 0.005611308864757245, 0.10237410984529347, 0.04702440986190649, 0.05543759937042042, -0.12295385914473503, -0.2190023217688077, 0.28771219952214583, 0.05087374654078089, 0.28552280960138887, 0.09806374643984087, 0.07011953632201195, 0.0435276354558072, 0.0013150712703445962, 0.04367158410376778, -0.18823800259797638, 0.11828669286606942, 0.21889713178069203, 0.030342062887297395, 0.20166478958437403, -0.44633346430811227, -0.2133731081369607, 0.05842992358420994, 0.173254057198909, 0.20811823296232843, -0.0402647936168839, -0.26426521784571166, 0.07178276395265415, -0.18169403138716578, -0.21204151637742624, -0.08007056472877808, 0.03369394370226884, 0.001821092811559199, -0.24353242396290287, 0.10021776510128642, 0.024225220043102607, 0.037279084032657096, -0.07873413348501987, -0.0694142705227326, 0.02193535056750418, 0.1614040255217868, 0.03795534911035907, -0.013528384687150737, 0.09695790125988424, -0.1315274255660673, -0.13335794018691077, 0.3652731460409568, -0.09194622910809795, -0.18631550486144774, 0.17965680012917695, -0.13248178205799824, -0.1338986330756954, 0.1172441901164312, 0.1265654168297153, 0.14668435792840434, -0.15686307978980682, 0.1306852411978659, -0.054495025970562196, 0.11478965048331256, 0.04773177071383186, 0.042867354907131956, 0.1966433740476621, 0.10973645348499037, 0.0367277483638449, 0.16577819024450055, -0.06384183947418076, -0.14253871414557046, -0.3381455409541434, -0.14843424432796845, -0.2101332972319249, 0.07940276625552489, -0.12790181737948966, -0.2226811877518034, 0.40185211513958435, 0.18009849062518163, 0.1945074023039756, 0.05931693134719834, 0.2557469186414143, 0.18194971584450162, 0.032490667371152374, 0.05818650237165903, 0.20388474853198027, 0.16999515985576985, 0.0596860182362006, -0.2753656107074052, 0.020831399496790824, 0.07608356046280366] |
1,802.05698 | A Machine Learning Approach for Virtual Flow Metering and Forecasting | We are concerned with robust and accurate forecasting of multiphase flow
rates in wells and pipelines during oil and gas production. In practice, the
possibility to physically measure the rates is often limited; besides, it is
desirable to estimate future values of multiphase rates based on the previous
behavior of the system. In this work, we demonstrate that a Long Short-Term
Memory (LSTM) recurrent artificial network is able not only to accurately
estimate the multiphase rates at current time (i.e., act as a virtual flow
meter), but also to forecast the rates for a sequence of future time instants.
For a synthetic severe slugging case, LSTM forecasts compare favorably with the
results of hydrodynamical modeling. LSTM results for a realistic noizy dataset
of a variable rate well test show that the model can also successfully forecast
multiphase rates for a system with changing flow patterns.
| cs.NE | we are concerned with robust and accurate forecasting of multiphase flow rates in wells and pipelines during oil and gas production in practice the possibility to physically measure the rates is often limited besides it is desirable to estimate future values of multiphase rates based on the previous behavior of the system in this work we demonstrate that a long shortterm memory lstm recurrent artificial network is able not only to accurately estimate the multiphase rates at current time ie act as a virtual flow meter but also to forecast the rates for a sequence of future time instants for a synthetic severe slugging case lstm forecasts compare favorably with the results of hydrodynamical modeling lstm results for a realistic noizy dataset of a variable rate well test show that the model can also successfully forecast multiphase rates for a system with changing flow patterns | [['we', 'are', 'concerned', 'with', 'robust', 'and', 'accurate', 'forecasting', 'of', 'multiphase', 'flow', 'rates', 'in', 'wells', 'and', 'pipelines', 'during', 'oil', 'and', 'gas', 'production', 'in', 'practice', 'the', 'possibility', 'to', 'physically', 'measure', 'the', 'rates', 'is', 'often', 'limited', 'besides', 'it', 'is', 'desirable', 'to', 'estimate', 'future', 'values', 'of', 'multiphase', 'rates', 'based', 'on', 'the', 'previous', 'behavior', 'of', 'the', 'system', 'in', 'this', 'work', 'we', 'demonstrate', 'that', 'a', 'long', 'shortterm', 'memory', 'lstm', 'recurrent', 'artificial', 'network', 'is', 'able', 'not', 'only', 'to', 'accurately', 'estimate', 'the', 'multiphase', 'rates', 'at', 'current', 'time', 'ie', 'act', 'as', 'a', 'virtual', 'flow', 'meter', 'but', 'also', 'to', 'forecast', 'the', 'rates', 'for', 'a', 'sequence', 'of', 'future', 'time', 'instants', 'for', 'a', 'synthetic', 'severe', 'slugging', 'case', 'lstm', 'forecasts', 'compare', 'favorably', 'with', 'the', 'results', 'of', 'hydrodynamical', 'modeling', 'lstm', 'results', 'for', 'a', 'realistic', 'noizy', 'dataset', 'of', 'a', 'variable', 'rate', 'well', 'test', 'show', 'that', 'the', 'model', 'can', 'also', 'successfully', 'forecast', 'multiphase', 'rates', 'for', 'a', 'system', 'with', 'changing', 'flow', 'patterns']] | [-0.07759859099360573, 0.07923639234044699, -0.05319821364018363, 0.10018394860582283, -0.02886323731106061, -0.15402427572639776, 0.05566911243139994, 0.4261819386294672, -0.27468134472276884, -0.3031297870879094, 0.14568519645608258, -0.2527101320781178, -0.12034755054017907, 0.2621493167455562, -0.07983801117528334, 0.10192068138941748, 0.11876596400589141, 0.025971646283889985, -0.01823793539217302, -0.2583916309986498, 0.2386050945696571, 0.13148633890518255, 0.3174185828807262, 0.022407275036797968, 0.12203017458111257, -0.07289679093657622, -0.05117440665217273, -0.006068867286895174, -0.10021757777347604, 0.0699113727151579, 0.23562736864937664, 0.08171953405807172, 0.2833945804073677, -0.4652489450926261, -0.2901492896978255, 0.09882950291063611, 0.09988782483061867, 0.12601149531563263, -0.02396192016744322, -0.24274398195817806, 0.08540010218381543, -0.20450155985610025, -0.08689608757703246, -0.104099508449826, 0.03268120800294764, 0.0585592436230533, -0.33504624316025966, 0.12318069222293651, 0.023451504663082323, 0.006957468773739843, -0.09087860081800735, -0.05859883121618597, -0.024706801791981488, 0.14509705324181832, 0.05392700489822098, 0.02789922181021917, 0.13954583449953503, -0.15837049798004432, -0.0895661353589511, 0.36948563614404284, -0.11916564651146218, -0.1817140546725034, 0.21633751768052215, -0.12493909288432214, -0.11540886100668174, 0.0953585729296026, 0.26298010316994885, 0.11568299022184073, -0.17888627331410828, -0.0448799327018319, -0.04656534885720617, 0.19589307048143104, -0.013268727799421632, -0.004477120123451928, 0.20303730276035523, 0.24936408881697206, 0.029205993710124827, 0.10117046407690936, -0.1332444719680409, -0.11506453235601108, -0.23439686174237437, -0.1281319727047169, -0.12460774341207388, 0.008459750841427888, -0.09993820188705846, -0.11732244726035979, 0.3925917743985261, 0.22999265875628258, 0.22619058011210413, 0.10148345121553728, 0.35314427600144505, 0.06039326357853866, 0.06663111860495895, 0.08339375735201932, 0.2030152262195007, 0.03530885489540292, 0.15385342245739136, -0.1972090988061749, 0.12925309306531624, 0.02825076928707426] |
1,802.05699 | Analysis of The Tailored Coupled-Cluster Method in Quantum Chemistry | In quantum chemistry, one of the most important challenges is the static
correlation problem when solving the electronic Schr\"odinger equation for
molecules in the Born--Oppenheimer approximation. In this article, we analyze
the tailored coupled-cluster method (TCC), one particular and promising method
for treating molecular electronic-structure problems with static correlation.
The TCC method combines the single-reference coupled-cluster (CC) approach with
an approximate reference calculation in a subspace [complete active space
(CAS)] of the considered Hilbert space that covers the static correlation. A
one-particle spectral gap assumption is introduced, separating the CAS from the
remaining Hilbert space. This replaces the nonexisting or nearly nonexisting
gap between the highest occupied molecular orbital and the lowest unoccupied
molecular orbital usually encountered in standard single-reference quantum
chemistry. The analysis covers, in particular, CC methods tailored by
tensor-network states (TNS-TCC methods). The problem is formulated in a
nonlinear functional analysis framework, and, under certain conditions such as
the aforementioned gap, local uniqueness and existence are proved using
Zarantonello's lemma. From the Aubin--Nitsche-duality method, a quadratic error
bound valid for TNS-TCC methods is derived, e.g., for linear-tensor-network TCC
schemes using the density matrix renormalization group method.
| math.NA cond-mat.str-el cs.NA physics.chem-ph physics.comp-ph quant-ph | in quantum chemistry one of the most important challenges is the static correlation problem when solving the electronic schrodinger equation for molecules in the bornoppenheimer approximation in this article we analyze the tailored coupledcluster method tcc one particular and promising method for treating molecular electronicstructure problems with static correlation the tcc method combines the singlereference coupledcluster cc approach with an approximate reference calculation in a subspace complete active space cas of the considered hilbert space that covers the static correlation a oneparticle spectral gap assumption is introduced separating the cas from the remaining hilbert space this replaces the nonexisting or nearly nonexisting gap between the highest occupied molecular orbital and the lowest unoccupied molecular orbital usually encountered in standard singlereference quantum chemistry the analysis covers in particular cc methods tailored by tensornetwork states tnstcc methods the problem is formulated in a nonlinear functional analysis framework and under certain conditions such as the aforementioned gap local uniqueness and existence are proved using zarantonellos lemma from the aubinnitscheduality method a quadratic error bound valid for tnstcc methods is derived eg for lineartensornetwork tcc schemes using the density matrix renormalization group method | [['in', 'quantum', 'chemistry', 'one', 'of', 'the', 'most', 'important', 'challenges', 'is', 'the', 'static', 'correlation', 'problem', 'when', 'solving', 'the', 'electronic', 'schrodinger', 'equation', 'for', 'molecules', 'in', 'the', 'bornoppenheimer', 'approximation', 'in', 'this', 'article', 'we', 'analyze', 'the', 'tailored', 'coupledcluster', 'method', 'tcc', 'one', 'particular', 'and', 'promising', 'method', 'for', 'treating', 'molecular', 'electronicstructure', 'problems', 'with', 'static', 'correlation', 'the', 'tcc', 'method', 'combines', 'the', 'singlereference', 'coupledcluster', 'cc', 'approach', 'with', 'an', 'approximate', 'reference', 'calculation', 'in', 'a', 'subspace', 'complete', 'active', 'space', 'cas', 'of', 'the', 'considered', 'hilbert', 'space', 'that', 'covers', 'the', 'static', 'correlation', 'a', 'oneparticle', 'spectral', 'gap', 'assumption', 'is', 'introduced', 'separating', 'the', 'cas', 'from', 'the', 'remaining', 'hilbert', 'space', 'this', 'replaces', 'the', 'nonexisting', 'or', 'nearly', 'nonexisting', 'gap', 'between', 'the', 'highest', 'occupied', 'molecular', 'orbital', 'and', 'the', 'lowest', 'unoccupied', 'molecular', 'orbital', 'usually', 'encountered', 'in', 'standard', 'singlereference', 'quantum', 'chemistry', 'the', 'analysis', 'covers', 'in', 'particular', 'cc', 'methods', 'tailored', 'by', 'tensornetwork', 'states', 'tnstcc', 'methods', 'the', 'problem', 'is', 'formulated', 'in', 'a', 'nonlinear', 'functional', 'analysis', 'framework', 'and', 'under', 'certain', 'conditions', 'such', 'as', 'the', 'aforementioned', 'gap', 'local', 'uniqueness', 'and', 'existence', 'are', 'proved', 'using', 'zarantonellos', 'lemma', 'from', 'the', 'aubinnitscheduality', 'method', 'a', 'quadratic', 'error', 'bound', 'valid', 'for', 'tnstcc', 'methods', 'is', 'derived', 'eg', 'for', 'lineartensornetwork', 'tcc', 'schemes', 'using', 'the', 'density', 'matrix', 'renormalization', 'group', 'method']] | [-0.1008420184345754, 0.026267657371294183, -0.0986878921432198, 0.10695617470185464, -0.004992217244327311, -0.14864529319026548, 0.057371605104139155, 0.33357293371860264, -0.284128050692506, -0.2818590857862981, 0.033512434829153, -0.2476217860783673, -0.14472152755732406, 0.16210911392725236, 0.006100135149292486, 0.09883767291308765, 0.0680897358441776, -0.012497227264406241, -0.14301053973537384, -0.20848072234682902, 0.333112821681425, 0.03255119481827538, 0.26895243358170695, 0.035906379226577446, 0.062122404613309416, 0.05807602577387234, -0.012524888290183457, 0.0009036030812991237, -0.09894862191381633, 0.1542643303663404, 0.30703901222896884, 0.09635898789850256, 0.3109137832273162, -0.40810082704031275, -0.20973377573840402, 0.06083160011684927, 0.13332498860290798, 0.1563918298773427, -0.018183867051013058, -0.28158163873519265, 0.04511514526814647, -0.17568420518554098, -0.12708962769196977, -0.093406059084531, -0.03418385359691456, -0.00825267989927417, -0.22379023240848808, 0.12655055285406136, 0.007891555802653666, 0.04754774140335782, -0.12255565413278932, -0.15291607271849542, 0.0066460290842730065, 0.07649941911554577, -0.03529642729351864, 0.055320992776061124, 0.11112359760179812, -0.0851533111822589, -0.10006192622930267, 0.42187579429667926, -0.05039168928519559, -0.21523782855491963, 0.1726295978385125, -0.08163595482271732, -0.16402611703708078, 0.12523459127481582, 0.09094550101824848, 0.1681530572810595, -0.13843523383397754, 0.16029203399312278, -0.024248000224875083, 0.15273375687209648, 0.04311909364364312, 0.049304162131865385, 0.1174408686252402, 0.12275522247427548, 0.09297131007074115, 0.10302652232601996, -0.08438947074603714, -0.16572366537192187, -0.2605238981221033, -0.14860016302713042, -0.22506875373706545, 0.0009769173142874774, -0.07275900343634219, -0.19078174265071182, 0.37392446256252815, 0.10535145760070957, 0.0992775711663695, 0.003077769350847634, 0.2916854255815016, 0.12429538757082216, 0.03315738150748708, 0.11505522301202924, 0.20507014595458042, 0.16449510657010882, 0.061861969667243895, -0.2568222212152171, 0.0530323188185044, 0.13426151183438892] |
1,802.057 | Chang Palais-Smale condition and global inversion | Let f be local diffeomorphism between real Banach spaces. We prove that if
the locally Lipschitz functional F(x)=1/2|f(x)-y|^2 satisfies the Chang
Palais-Smale condition for all y in the target space of f, then f is a
norm-coercive global diffeomorphism. We also give a version of this fact for a
weighted Chang Palais-Smale condition. Finally, we study the relationship of
this criterion to some classical global inversion conditions.
| math.FA | let f be local diffeomorphism between real banach spaces we prove that if the locally lipschitz functional fx12fxy2 satisfies the chang palaissmale condition for all y in the target space of f then f is a normcoercive global diffeomorphism we also give a version of this fact for a weighted chang palaissmale condition finally we study the relationship of this criterion to some classical global inversion conditions | [['let', 'f', 'be', 'local', 'diffeomorphism', 'between', 'real', 'banach', 'spaces', 'we', 'prove', 'that', 'if', 'the', 'locally', 'lipschitz', 'functional', 'fx12fxy2', 'satisfies', 'the', 'chang', 'palaissmale', 'condition', 'for', 'all', 'y', 'in', 'the', 'target', 'space', 'of', 'f', 'then', 'f', 'is', 'a', 'normcoercive', 'global', 'diffeomorphism', 'we', 'also', 'give', 'a', 'version', 'of', 'this', 'fact', 'for', 'a', 'weighted', 'chang', 'palaissmale', 'condition', 'finally', 'we', 'study', 'the', 'relationship', 'of', 'this', 'criterion', 'to', 'some', 'classical', 'global', 'inversion', 'conditions']] | [-0.1874711679151425, 0.06860658457287802, -0.13764348823863726, 0.12648437646969865, -0.08990675553751107, -0.12107879287348344, 0.036793351015792446, 0.3480336476224833, -0.3493230178952217, -0.19723435501353098, 0.09671387266224393, -0.19424576614625177, -0.1777004507012092, 0.1364142500150662, -0.1488517143441221, 0.016302896265943462, 0.051214361591981006, 0.05527649453053107, -0.13834989430167927, -0.2960514333134947, 0.38870326922490045, -0.055604415394079225, 0.20905899266497446, 0.08672714109460895, 0.10839535585020292, 0.013787154796031806, 0.0341971976037782, 0.016085581418323832, -0.2343632226707996, 0.09587680062708946, 0.23439611801161217, 0.16303539455581742, 0.3346938245571577, -0.3732391194941906, -0.19309304007687247, 0.25336808754274476, 0.03736667324287387, -0.031202067907613058, -0.041827771891481604, -0.2997714363325101, 0.18451911951773442, -0.0583655790425837, -0.1662163481546136, -0.09341030141983468, 0.03989156483171078, 0.04580962737807288, -0.37947978208271355, 0.0616881808942148, 0.1631115143832106, 0.09626519506653915, -0.14688981037157087, -0.003910238521460157, -0.11405668183444784, 0.04243492504151968, 0.0016155912719953518, 0.11771307531386041, 0.049844052320202954, -0.015404456280744994, -0.025323864094053322, 0.31299544750497893, -0.09172415889960785, -0.28925602748775137, 0.13028178149117872, -0.16772240236974678, -0.20675046296718602, 0.024954653559969023, 0.06864067791746213, 0.13303234299214986, -0.11974660721249306, 0.23865175707122455, -0.15378496105281206, 0.10515206739879572, 0.0800719444711621, 0.017716638965962025, 0.054082332741325866, 0.051936210018511, 0.2390422975214628, 0.15728205422906635, -0.005838351039430843, 0.01754555623853006, -0.4172767686729248, -0.1984877204737411, -0.154376174403856, 0.1366828518346525, -0.10426478789349158, -0.17361945557193115, 0.34526085967484577, 0.08162402591148678, 0.17633116262821624, 0.14503173694874233, 0.19166575953937492, 0.10961706328850526, -0.051207940452373944, 0.09331785479847055, 0.13691352933439283, 0.18409075391693758, 0.039045060289880404, -0.1438335007772996, 0.01345801463064093, 0.24192998654280717] |
1,802.05701 | Inverting The Generator Of A Generative Adversarial Network (II) | Generative adversarial networks (GANs) learn a deep generative model that is
able to synthesise novel, high-dimensional data samples. New data samples are
synthesised by passing latent samples, drawn from a chosen prior distribution,
through the generative model. Once trained, the latent space exhibits
interesting properties, that may be useful for down stream tasks such as
classification or retrieval. Unfortunately, GANs do not offer an "inverse
model", a mapping from data space back to latent space, making it difficult to
infer a latent representation for a given data sample. In this paper, we
introduce a technique, inversion, to project data samples, specifically images,
to the latent space using a pre-trained GAN. Using our proposed inversion
technique, we are able to identify which attributes of a dataset a trained GAN
is able to model and quantify GAN performance, based on a reconstruction loss.
We demonstrate how our proposed inversion technique may be used to
quantitatively compare performance of various GAN models trained on three image
datasets. We provide code for all of our experiments,
https://github.com/ToniCreswell/InvertingGAN.
| cs.CV | generative adversarial networks gans learn a deep generative model that is able to synthesise novel highdimensional data samples new data samples are synthesised by passing latent samples drawn from a chosen prior distribution through the generative model once trained the latent space exhibits interesting properties that may be useful for down stream tasks such as classification or retrieval unfortunately gans do not offer an inverse model a mapping from data space back to latent space making it difficult to infer a latent representation for a given data sample in this paper we introduce a technique inversion to project data samples specifically images to the latent space using a pretrained gan using our proposed inversion technique we are able to identify which attributes of a dataset a trained gan is able to model and quantify gan performance based on a reconstruction loss we demonstrate how our proposed inversion technique may be used to quantitatively compare performance of various gan models trained on three image datasets we provide code for all of our experiments httpsgithubcomtonicreswellinvertinggan | [['generative', 'adversarial', 'networks', 'gans', 'learn', 'a', 'deep', 'generative', 'model', 'that', 'is', 'able', 'to', 'synthesise', 'novel', 'highdimensional', 'data', 'samples', 'new', 'data', 'samples', 'are', 'synthesised', 'by', 'passing', 'latent', 'samples', 'drawn', 'from', 'a', 'chosen', 'prior', 'distribution', 'through', 'the', 'generative', 'model', 'once', 'trained', 'the', 'latent', 'space', 'exhibits', 'interesting', 'properties', 'that', 'may', 'be', 'useful', 'for', 'down', 'stream', 'tasks', 'such', 'as', 'classification', 'or', 'retrieval', 'unfortunately', 'gans', 'do', 'not', 'offer', 'an', 'inverse', 'model', 'a', 'mapping', 'from', 'data', 'space', 'back', 'to', 'latent', 'space', 'making', 'it', 'difficult', 'to', 'infer', 'a', 'latent', 'representation', 'for', 'a', 'given', 'data', 'sample', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'technique', 'inversion', 'to', 'project', 'data', 'samples', 'specifically', 'images', 'to', 'the', 'latent', 'space', 'using', 'a', 'pretrained', 'gan', 'using', 'our', 'proposed', 'inversion', 'technique', 'we', 'are', 'able', 'to', 'identify', 'which', 'attributes', 'of', 'a', 'dataset', 'a', 'trained', 'gan', 'is', 'able', 'to', 'model', 'and', 'quantify', 'gan', 'performance', 'based', 'on', 'a', 'reconstruction', 'loss', 'we', 'demonstrate', 'how', 'our', 'proposed', 'inversion', 'technique', 'may', 'be', 'used', 'to', 'quantitatively', 'compare', 'performance', 'of', 'various', 'gan', 'models', 'trained', 'on', 'three', 'image', 'datasets', 'we', 'provide', 'code', 'for', 'all', 'of', 'our', 'experiments', 'httpsgithubcomtonicreswellinvertinggan']] | [0.049832345024401016, -0.011528133806487583, -0.12270506000861006, 0.12597430656937514, -0.15622836472480126, -0.1738349333741204, 0.06645334284105554, 0.4994578491896391, -0.30165908725520724, -0.359695982623867, 0.06917811449560293, -0.2704084733755566, -0.18873239972061467, 0.18659266920930836, -0.13028694958112008, 0.09753900804952177, 0.12301540576519857, -0.0012068469265169941, -0.07656243709349182, -0.2984627116279308, 0.320446569185574, 0.046536823359506235, 0.3717080402123027, -0.0831800583143567, 0.14810159597288666, -0.06661064809372345, 0.005357851562642514, -0.020664390334236803, -0.08047471478959439, 0.17681314745176108, 0.3126588059506735, 0.2181699742498093, 0.2857423430189577, -0.41640481541215324, -0.29602715028125015, 0.1012448545011995, 0.11346615321641831, 0.12392881269937958, -0.09246103943401385, -0.3464225525967777, 0.07978419744312157, -0.12860424126509232, 0.03706810759450851, -0.2008739406010136, -0.09094968884615218, -0.048960930212985636, -0.34552847838224193, -0.00018255513156006155, 0.06539186282417747, 0.02024308978958965, -0.059099711153553364, -0.09070839749129359, -0.049105175155577746, 0.163382000672945, 0.020151401872660013, 0.06729795014334106, 0.10358902773289226, -0.1347989949254254, -0.11326437487962743, 0.34705400688920257, -0.0934203488618233, -0.21811875916522017, 0.17355972751677254, -0.03528334950854958, -0.14460993143675718, 0.11682904704722988, 0.2911568695278622, 0.1338422400822733, -0.20160530564960005, -0.012244775680470454, -0.07811835428515752, 0.19825607261127728, -0.030064729161473902, -0.055009547583109074, 0.1654677700818527, 0.23998143732937616, -0.02254111425501706, 0.1957895886322191, -0.19889284263982243, -0.02499419637295136, -0.21058560735992762, -0.09663362171890777, -0.2618792854786883, 0.016291655244141258, -0.08794877021720696, -0.14808654889363193, 0.4023795381288564, 0.27893078073095745, 0.2787018808939624, 0.09246570590496345, 0.3097420567105156, -0.007608143944390725, 0.14105661316005902, 0.08042424319712661, 0.1297151606399999, 0.04702989613978452, 0.08309338845550841, -0.11866812098319209, 0.12303559528257654, -0.003195015134203226] |
1,802.05702 | Virtual Cartier divisors and blow-ups | We prove a universal property for blow-ups in regularly immersed subschemes,
based on a notion we call "virtual effective Cartier divisor". We also
construct blow-ups of quasi-smooth closed immersions in derived algebraic
geometry.
| math.AG | we prove a universal property for blowups in regularly immersed subschemes based on a notion we call virtual effective cartier divisor we also construct blowups of quasismooth closed immersions in derived algebraic geometry | [['we', 'prove', 'a', 'universal', 'property', 'for', 'blowups', 'in', 'regularly', 'immersed', 'subschemes', 'based', 'on', 'a', 'notion', 'we', 'call', 'virtual', 'effective', 'cartier', 'divisor', 'we', 'also', 'construct', 'blowups', 'of', 'quasismooth', 'closed', 'immersions', 'in', 'derived', 'algebraic', 'geometry']] | [-0.271493196148764, 0.032733258198608055, -0.16431757327959393, 0.16369311545382847, -0.09465098148917384, -0.20827703886298518, -0.00247187376248114, 0.3629688381245642, -0.33367253828680876, -0.07707602762137399, 0.008485248164189134, -0.22498107526564237, -0.18405346234441933, 0.21359322818391252, -0.2736771065374893, -0.018468292927454142, 0.036849880456980885, 0.033468164560018165, -0.11894512732485027, -0.2944379825511891, 0.5176230795455702, -0.1257486380636692, 0.2696993826239398, 0.12865859033031898, 0.16185501268641514, 0.03812002981871818, 0.021450448583698635, 0.0603386322177495, -0.2908629705621438, 0.17341057030540524, 0.34746324970866693, 0.0939484907695177, 0.1336214795257106, -0.42174057120626623, -0.1253950143176498, 0.21018866235108086, 0.17523215259566452, -0.0019685882567004724, -0.06567041124005547, -0.2352732608772137, 0.09649751180162032, -0.11405540923729088, -0.2794178925228841, -0.13868954066525807, 0.02665346223070766, 0.02297772937030955, -0.17257050063573953, -0.17762753581028487, 0.08480886053858382, 0.2268748436913346, -0.036460135668290386, -0.018148260910741308, -0.035731640848980256, -0.054756969453371836, -0.07066937073162108, 0.012796763711693611, 0.10994347488987401, -0.003996626840847911, -0.06492548293758635, 0.29383310410335206, -0.13866577156339632, -0.30983045640768425, 0.035205792649790194, -0.08010187287899581, -0.20019564214585858, 0.14514675722316359, 0.13368478154227365, 0.254487492906099, -0.0438575635127949, 0.2250617907354326, -0.14509819223630158, 0.012473035490874088, 0.1579830704087561, -0.014847691791752974, 0.08688980164218017, 0.09863846382182656, 0.07777850092812018, 0.19434418563138356, -0.038393119582906365, -0.07628542129797014, -0.3614495513170506, -0.24790006908447001, -0.06870353753876055, 0.28067509725577, -0.16411077142269773, -0.2600277144546536, 0.3563222386168711, 0.003357678030927976, 0.22162402256843494, 0.2150832779536193, 0.2264309169329477, -0.00823930295353586, 0.0065574091153614445, 0.12501770671400608, 0.07506606321443211, 0.19118428258507542, -0.09678943611850793, -0.0391736299815503, -0.049176179874462614, 0.35982837714254856] |
1,802.05703 | $\aleph_0$-categoricity of semigroups | In this paper we initiate the study of $\aleph_0$-categorical semigroups,
where a countable semigroup $S$ is $\aleph_0$-categorical if, for any natural
number $n$, the action of its group of automorphisms Aut $S$ on $S^n$ has only
finitely many orbits. We show that $\aleph_0$-categoricity transfers to certain
important substructures such as maximal subgroups and principal factors. We
examine the relationship between $\aleph_0$-categoricity and a number of
semigroup and monoid constructions, namely direct sums, 0-direct unions,
semidirect products and $\mathcal{P}$-semigroups. As a corollary, we determine
the $\aleph_0$-categoricity of an $E$-unitary inverse semigroup with finite
semilattice of idempotents in terms of that of the maximal group homomorphic
image.
| math.LO math.RA | in this paper we initiate the study of aleph_0categorical semigroups where a countable semigroup s is aleph_0categorical if for any natural number n the action of its group of automorphisms aut s on sn has only finitely many orbits we show that aleph_0categoricity transfers to certain important substructures such as maximal subgroups and principal factors we examine the relationship between aleph_0categoricity and a number of semigroup and monoid constructions namely direct sums 0direct unions semidirect products and mathcalpsemigroups as a corollary we determine the aleph_0categoricity of an eunitary inverse semigroup with finite semilattice of idempotents in terms of that of the maximal group homomorphic image | [['in', 'this', 'paper', 'we', 'initiate', 'the', 'study', 'of', 'aleph_0categorical', 'semigroups', 'where', 'a', 'countable', 'semigroup', 's', 'is', 'aleph_0categorical', 'if', 'for', 'any', 'natural', 'number', 'n', 'the', 'action', 'of', 'its', 'group', 'of', 'automorphisms', 'aut', 's', 'on', 'sn', 'has', 'only', 'finitely', 'many', 'orbits', 'we', 'show', 'that', 'aleph_0categoricity', 'transfers', 'to', 'certain', 'important', 'substructures', 'such', 'as', 'maximal', 'subgroups', 'and', 'principal', 'factors', 'we', 'examine', 'the', 'relationship', 'between', 'aleph_0categoricity', 'and', 'a', 'number', 'of', 'semigroup', 'and', 'monoid', 'constructions', 'namely', 'direct', 'sums', '0direct', 'unions', 'semidirect', 'products', 'and', 'mathcalpsemigroups', 'as', 'a', 'corollary', 'we', 'determine', 'the', 'aleph_0categoricity', 'of', 'an', 'eunitary', 'inverse', 'semigroup', 'with', 'finite', 'semilattice', 'of', 'idempotents', 'in', 'terms', 'of', 'that', 'of', 'the', 'maximal', 'group', 'homomorphic', 'image']] | [-0.1704029374240527, 0.12146424104640988, -0.036905914798234275, 0.05743196923104883, -0.09948646695832315, -0.03975595705645177, 0.030379028515031253, 0.37540856752436136, -0.38645432381302985, -0.17230822079028318, 0.14268995448494853, -0.3155575117584571, -0.11134579634741491, 0.21996578271783326, -0.12147409580557526, -0.010978207363435112, 0.06824470758980629, 0.13920937871528807, -0.08330981381513287, -0.22920676632626072, 0.400896486292765, -0.034887587366788424, 0.19054916506696457, 0.04467192135787415, 0.11535245708972035, 0.008018894414914754, -0.0580738880061228, -0.017036485096927987, -0.15906747218147396, 0.07179281692409399, 0.3017791593989846, 0.1302430410191272, 0.24184469712301365, -0.3847170465815704, -0.11432603199599486, 0.2545381019036602, 0.14454661541871583, -0.05068241538778309, -0.032587808137533515, -0.24257553084889083, 0.13465782418311348, -0.25980890533226786, -0.07414264456161017, -0.07570115938891196, 0.13556935495326242, 0.006819610508809824, -0.25049708841495144, -0.012410470130808145, 0.1544463057523069, 0.14318419922396397, -0.005076497156869223, -0.08016046150067586, -0.06341790817045037, 0.10636226620832548, 0.02519135398889702, -0.03616720452470687, 0.09539052015803393, -0.06096723181810411, -0.13611232357334743, 0.4112295369500095, -0.04037387617208172, -0.16994158504982887, 0.15397672975906035, -0.19869266152924414, -0.19215138283675737, 0.09728071410028101, 0.09084896059724891, 0.15092264803904062, -0.021374208762229067, 0.20673324458653705, -0.21295966239627992, 0.08765910342968639, 0.08246509225369947, 0.049960427610113205, 0.07405962785072986, 0.10403872810614134, 0.10670203185957874, 0.15684265185834714, 0.08133856542815354, 0.06021095769032293, -0.3594286205626807, -0.19120545821824989, -0.10488389132010922, 0.12363194506298932, -0.11632959969433306, -0.21546382366598232, 0.3966916365169206, 0.08543465902929384, 0.1450459205531922, 0.09791834692208512, 0.17453925224762518, 0.03395506664794119, 0.03804824657023893, 0.08048406658350553, 0.04660649882918857, 0.24133830284247698, -0.14188537762491304, -0.18222812434784996, 0.0015728795150457655, 0.22751997067656332] |
1,802.05704 | Dissipative flows, global attractors and shape theory | In this paper we study continuous parametrized families of dissipative flows,
which are those flows having a global attractor. The main motivation for this
study comes from the observation that, in general, global attractors are not
robust, in the sense that small perturbations of the flow can destroy their
globality. We give a necessary and sufficient condition for a global attractor
to be continued to a global attractor. We also study, using shape theoretical
methods and the Conley index, the bifurcation global to non-global.
| math.DS | in this paper we study continuous parametrized families of dissipative flows which are those flows having a global attractor the main motivation for this study comes from the observation that in general global attractors are not robust in the sense that small perturbations of the flow can destroy their globality we give a necessary and sufficient condition for a global attractor to be continued to a global attractor we also study using shape theoretical methods and the conley index the bifurcation global to nonglobal | [['in', 'this', 'paper', 'we', 'study', 'continuous', 'parametrized', 'families', 'of', 'dissipative', 'flows', 'which', 'are', 'those', 'flows', 'having', 'a', 'global', 'attractor', 'the', 'main', 'motivation', 'for', 'this', 'study', 'comes', 'from', 'the', 'observation', 'that', 'in', 'general', 'global', 'attractors', 'are', 'not', 'robust', 'in', 'the', 'sense', 'that', 'small', 'perturbations', 'of', 'the', 'flow', 'can', 'destroy', 'their', 'globality', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'a', 'global', 'attractor', 'to', 'be', 'continued', 'to', 'a', 'global', 'attractor', 'we', 'also', 'study', 'using', 'shape', 'theoretical', 'methods', 'and', 'the', 'conley', 'index', 'the', 'bifurcation', 'global', 'to', 'nonglobal']] | [-0.16671948414295912, 0.07411348612402521, -0.1542287523403675, 0.12316953072912015, -0.04829284311493948, -0.08851645853636521, 0.018796586158541254, 0.2999705255386375, -0.2940468317163842, -0.23054482706911153, 0.18036282013331184, -0.22296991377758482, -0.1954000590346931, 0.15118129765393123, -0.12104244424872809, 0.07744078981202274, 0.04744364902199734, -0.0016639634434665953, -0.04194736232360204, -0.1991427556578336, 0.37678781619511675, 0.010276565461286477, 0.23417984414845705, 0.016169175634526516, 0.04983868467665854, -0.07348897117688986, -0.033533908343607824, 0.06311842325210039, -0.20322122539125434, 0.11487426798391555, 0.20001519765684775, 0.1325118676565277, 0.24591235372991788, -0.414630146530856, -0.21010991483594157, 0.21016815208852113, 0.13990973357188827, 0.14886763419573462, -0.059917003758961244, -0.2661048112703221, 0.15869941135003632, -0.136233940078888, -0.18713397869751566, -0.1627255635823877, 0.020196466357447207, 0.05570887046633288, -0.2904292603211832, 0.06868194270057193, 0.1259663139824711, 0.06573619460132682, -0.10584675316100142, 0.037793859774302246, -0.09063532356438893, 0.16266678553628958, 0.08770579795929648, 0.007041226387844377, 0.09486802259371394, -0.10985460539259725, -0.08104586604167707, 0.3571266890170851, -0.08720009822753214, -0.20889769040790962, 0.22524974227140082, -0.15599726561811708, -0.18997182781874603, 0.12171961748390459, 0.20588586045916946, 0.10268056697566949, -0.14099706833006903, 0.06347863400393787, -0.08197062079506438, 0.12469987260798614, 0.04089349059254995, 0.017506322139524855, 0.1699767968745532, 0.13850777092877598, 0.15504241488607867, 0.1455712064842893, 0.0018015132428401905, -0.10840863743353457, -0.34729053111126024, -0.11141221070110555, -0.10607154621365703, 0.07336673849290708, -0.08439248424387881, -0.1874684798281773, 0.4554580224988361, 0.12745099008593352, 0.23105486664211466, 0.060741491234650655, 0.27217487243580674, 0.116192687676327, 0.002171882264693046, 0.10816555404813871, 0.27310353371181656, 0.10479397993046968, 0.12426847072007756, -0.17539531286040852, 0.028118519003674874, 0.1243586060646478] |
1,802.05705 | Relatively irreducible free subroups in Out($\mathbb{F}$) | We prove that given a finite rank free group $\mathbb{F}$ of rank $\geq 3$
and two exponentially growing outer automorphisms $\psi$ and $\phi$ with dual
lamination pairs $\Lambda^\pm_\psi$ and $\Lambda^\pm_\phi$ associated to them,
and given a free factor system $\mathcal{F}$ with co-edge number $\geq 2$,
$\phi, \psi $ each preserving $\mathcal{F}$, so that the pair $(\phi,
\Lambda^\pm_\phi), (\psi, \Lambda^\pm_\psi)$ is independent relative to
$\mathcal{F}$, then there $\exists$ $M\geq 1$, such that for any integer $m,n
\geq M$, the group $\langle \phi^m, \psi^n \rangle$ is a free group of rank 2,
all of whose non-trivial elements except perhaps the powers of $\phi, \psi$ and
their conjugates, are fully irreducible relative to $\mathcal{F}$ with a
lamination pair which fills relative to $\mathcal{F}$.
In addition if both $\Lambda^\pm_\phi, \Lambda^\pm_\psi$ are non-geometric
then this lamination pair is also non-geometric.
We also prove that the extension groups induced by such subgroups will be
relatively hyperbolic under some natural conditions.
| math.GR | we prove that given a finite rank free group mathbbf of rank geq 3 and two exponentially growing outer automorphisms psi and phi with dual lamination pairs lambdapm_psi and lambdapm_phi associated to them and given a free factor system mathcalf with coedge number geq 2 phi psi each preserving mathcalf so that the pair phi lambdapm_phi psi lambdapm_psi is independent relative to mathcalf then there exists mgeq 1 such that for any integer mn geq m the group langle phim psin rangle is a free group of rank 2 all of whose nontrivial elements except perhaps the powers of phi psi and their conjugates are fully irreducible relative to mathcalf with a lamination pair which fills relative to mathcalf in addition if both lambdapm_phi lambdapm_psi are nongeometric then this lamination pair is also nongeometric we also prove that the extension groups induced by such subgroups will be relatively hyperbolic under some natural conditions | [['we', 'prove', 'that', 'given', 'a', 'finite', 'rank', 'free', 'group', 'mathbbf', 'of', 'rank', 'geq', '3', 'and', 'two', 'exponentially', 'growing', 'outer', 'automorphisms', 'psi', 'and', 'phi', 'with', 'dual', 'lamination', 'pairs', 'lambdapm_psi', 'and', 'lambdapm_phi', 'associated', 'to', 'them', 'and', 'given', 'a', 'free', 'factor', 'system', 'mathcalf', 'with', 'coedge', 'number', 'geq', '2', 'phi', 'psi', 'each', 'preserving', 'mathcalf', 'so', 'that', 'the', 'pair', 'phi', 'lambdapm_phi', 'psi', 'lambdapm_psi', 'is', 'independent', 'relative', 'to', 'mathcalf', 'then', 'there', 'exists', 'mgeq', '1', 'such', 'that', 'for', 'any', 'integer', 'mn', 'geq', 'm', 'the', 'group', 'langle', 'phim', 'psin', 'rangle', 'is', 'a', 'free', 'group', 'of', 'rank', '2', 'all', 'of', 'whose', 'nontrivial', 'elements', 'except', 'perhaps', 'the', 'powers', 'of', 'phi', 'psi', 'and', 'their', 'conjugates', 'are', 'fully', 'irreducible', 'relative', 'to', 'mathcalf', 'with', 'a', 'lamination', 'pair', 'which', 'fills', 'relative', 'to', 'mathcalf', 'in', 'addition', 'if', 'both', 'lambdapm_phi', 'lambdapm_psi', 'are', 'nongeometric', 'then', 'this', 'lamination', 'pair', 'is', 'also', 'nongeometric', 'we', 'also', 'prove', 'that', 'the', 'extension', 'groups', 'induced', 'by', 'such', 'subgroups', 'will', 'be', 'relatively', 'hyperbolic', 'under', 'some', 'natural', 'conditions']] | [-0.2116570510215273, 0.23110509196933554, -0.041363610147719124, 0.020672724240667822, -0.05041689296730941, -0.19591370559187213, -0.02488655165851876, 0.3796338758530558, -0.32449822896160185, -0.20427773098919333, 0.04148354329472089, -0.32010708477250055, -0.09096908983912344, 0.15552733056890583, -0.08486248112718672, -0.009792198506674092, 0.039763697857300655, 0.16902605381543062, -0.08990118725494922, -0.25429011880126046, 0.35556611044356895, -0.092832027952873, 0.15539575252976073, 0.02523813189404073, 0.13207096432482726, -0.017665979686793627, 0.030116539079340567, 0.01582993010800381, -0.17704029408023894, 0.08240363199729472, 0.2548446726041699, 0.1260837135720354, 0.2295598225916221, -0.3060142841545473, -0.09193371228971764, 0.28366851929795783, 0.13313875604715003, -0.07378101281095664, -0.0403836592265993, -0.23094924279231285, 0.20943310700041415, -0.1704781118804883, -0.1362723004299608, -0.031156040931819007, 0.1395150409164336, -0.0018614481822097379, -0.285200447911752, -0.01617842273347043, 0.09895135502335363, 0.06480073285485177, 0.004637551690010648, -0.1549560799819454, -0.11638963768430251, 0.07591030705033948, 0.019627410969022957, 0.14079519723830008, 0.10254390892805532, -0.06966927603322179, -0.04398263206607417, 0.33313091349861534, -0.062085292336920055, -0.2684630597206323, 0.1201782560168986, -0.19058893760053539, -0.16995043128630832, 0.14082335698491844, 0.06526320541161112, 0.1428895672501025, -0.034896450276535596, 0.19340985382433773, -0.11555625085939507, 0.15943435027484634, 0.10703268586841755, 0.02210845945304946, 0.12870678045835934, 0.030319048471650796, 0.1263098091478337, 0.10446208313729394, 0.03116977899921231, 0.045968820809656266, -0.41397139831985297, -0.18531948110811705, -0.1039345382604025, 0.14105884371000635, -0.11943713661639777, -0.15412551033659838, 0.3178325143495673, 0.013046605219929725, 0.18138127214900268, 0.10987718232316088, 0.19670742010853964, 0.06231955731920224, 0.030131984200316334, 0.15030798669843198, 0.06656974556302118, 0.16654572834867346, -0.09936649592495278, -0.15769708429242632, -0.021080599157262202, 0.13689223996143005] |
1,802.05706 | Weak Lensing of Intensity Mapping: the Cosmic Infrared Background | Gravitational lensing deflects the paths of cosmic infrared background (CIB)
photons, leaving a measurable imprint on CIB maps. The resulting statistical
anisotropy can be used to reconstruct the matter distribution out to the
redshifts of CIB sources. To this end, we generalize the CMB lensing quadratic
estimator to any weakly non-Gaussian source field, by deriving the optimal
lensing weights. We point out the additional noise and bias caused by the
non-Gaussianity and the `self-lensing' of the source field. We propose methods
to reduce, subtract or model these non-Gaussianities. We show that CIB lensing
should be detectable with Planck data, and detectable at high significance for
future CMB experiments like CCAT-Prime. The CIB thus constitutes a new source
image for lensing studies, providing constraints on the amplitude of structure
at intermediate redshifts between galaxies and the CMB. CIB lensing
measurements will also give valuable information on the star formation history
in the universe, constraining CIB halo models beyond the CIB power spectrum. By
laying out a detailed treatment of lens reconstruction from a weakly
non-Gaussian source field, this work constitutes a stepping stone towards lens
reconstruction from continuum or line intensity mapping data, such as the
Lyman-alpha emission, absorption, and the 21cm radiation.
| astro-ph.CO | gravitational lensing deflects the paths of cosmic infrared background cib photons leaving a measurable imprint on cib maps the resulting statistical anisotropy can be used to reconstruct the matter distribution out to the redshifts of cib sources to this end we generalize the cmb lensing quadratic estimator to any weakly nongaussian source field by deriving the optimal lensing weights we point out the additional noise and bias caused by the nongaussianity and the selflensing of the source field we propose methods to reduce subtract or model these nongaussianities we show that cib lensing should be detectable with planck data and detectable at high significance for future cmb experiments like ccatprime the cib thus constitutes a new source image for lensing studies providing constraints on the amplitude of structure at intermediate redshifts between galaxies and the cmb cib lensing measurements will also give valuable information on the star formation history in the universe constraining cib halo models beyond the cib power spectrum by laying out a detailed treatment of lens reconstruction from a weakly nongaussian source field this work constitutes a stepping stone towards lens reconstruction from continuum or line intensity mapping data such as the lymanalpha emission absorption and the 21cm radiation | [['gravitational', 'lensing', 'deflects', 'the', 'paths', 'of', 'cosmic', 'infrared', 'background', 'cib', 'photons', 'leaving', 'a', 'measurable', 'imprint', 'on', 'cib', 'maps', 'the', 'resulting', 'statistical', 'anisotropy', 'can', 'be', 'used', 'to', 'reconstruct', 'the', 'matter', 'distribution', 'out', 'to', 'the', 'redshifts', 'of', 'cib', 'sources', 'to', 'this', 'end', 'we', 'generalize', 'the', 'cmb', 'lensing', 'quadratic', 'estimator', 'to', 'any', 'weakly', 'nongaussian', 'source', 'field', 'by', 'deriving', 'the', 'optimal', 'lensing', 'weights', 'we', 'point', 'out', 'the', 'additional', 'noise', 'and', 'bias', 'caused', 'by', 'the', 'nongaussianity', 'and', 'the', 'selflensing', 'of', 'the', 'source', 'field', 'we', 'propose', 'methods', 'to', 'reduce', 'subtract', 'or', 'model', 'these', 'nongaussianities', 'we', 'show', 'that', 'cib', 'lensing', 'should', 'be', 'detectable', 'with', 'planck', 'data', 'and', 'detectable', 'at', 'high', 'significance', 'for', 'future', 'cmb', 'experiments', 'like', 'ccatprime', 'the', 'cib', 'thus', 'constitutes', 'a', 'new', 'source', 'image', 'for', 'lensing', 'studies', 'providing', 'constraints', 'on', 'the', 'amplitude', 'of', 'structure', 'at', 'intermediate', 'redshifts', 'between', 'galaxies', 'and', 'the', 'cmb', 'cib', 'lensing', 'measurements', 'will', 'also', 'give', 'valuable', 'information', 'on', 'the', 'star', 'formation', 'history', 'in', 'the', 'universe', 'constraining', 'cib', 'halo', 'models', 'beyond', 'the', 'cib', 'power', 'spectrum', 'by', 'laying', 'out', 'a', 'detailed', 'treatment', 'of', 'lens', 'reconstruction', 'from', 'a', 'weakly', 'nongaussian', 'source', 'field', 'this', 'work', 'constitutes', 'a', 'stepping', 'stone', 'towards', 'lens', 'reconstruction', 'from', 'continuum', 'or', 'line', 'intensity', 'mapping', 'data', 'such', 'as', 'the', 'lymanalpha', 'emission', 'absorption', 'and', 'the', '21cm', 'radiation']] | [-0.06635542376206653, 0.07635684150944252, -0.11810510131613453, 0.15186159028141474, -0.1372597850674745, -0.0645124792550128, -0.008176170091264614, 0.37963154433539487, -0.23331015353496787, -0.2995467360689314, 0.048038805744467804, -0.3559899358067311, -0.050040636711873775, 0.21110408502345038, 0.02198684066888295, 0.02193975168404787, 0.03489151788589609, -0.11011447067981088, 0.010845358371688514, -0.2705487582232056, 0.32278592609700263, 0.21955633532523297, 0.22597318246849987, -0.006908156329277202, 0.12001258834817857, -0.04505397862579563, -0.17602318467538905, 0.012901472527128045, -0.1357477851567394, 0.06084151997111074, 0.2615681588104593, 0.1708549775049496, 0.16600808098443695, -0.3372945723130764, -0.2501860026542171, 0.16406729435179346, 0.1420279661456289, 0.1588721520285869, -0.05286941674623251, -0.33912971175487827, 0.030333964858667482, -0.0979797660596761, -0.08995465112453567, -0.032896964497274105, -0.0753056136597326, -0.030352763315238576, -0.2429354122374783, 0.15442145507800564, 0.02614155688754163, 0.05157090757632315, -0.03177928975506658, -0.07162945374551385, -0.05072703007389653, 0.06744332910091201, 0.012339932578074109, 0.09489643708560708, 0.23839515149777774, -0.1858257865671548, -0.039467884209191444, 0.3849283991851798, -0.13999145632346927, -0.07515146448691883, 0.09917086026617464, -0.2196929745738035, -0.2150093820130471, 0.12714711560678696, 0.1751185853154131, 0.016523494183473143, -0.1711781976337079, 0.06257610464218478, 0.08684270177497574, 0.24608425227858904, 0.09318049862349204, 0.06982901468780814, 0.41345734254337185, 0.05768883596796837, 0.14606495185220375, 0.11292057271152366, -0.22592608945900666, 0.06735436115667483, -0.30438233099619644, -0.039744641516578964, -0.17952706605325094, 0.13609780704240673, -0.15385869533562108, -0.13875128867134617, 0.36555309625490023, 0.19705835954369147, 0.178927169340469, 0.11234727451960455, 0.3740436312521227, 0.06713472592983266, 0.05390222498335608, 0.02417417188834325, 0.31904102353342245, 0.14603650118431796, 0.07202720428162282, -0.20714021682517952, 0.014376768948381195, -0.03984469630417476] |
1,802.05707 | 30-Fold Increase in Atom-Cavity Coupling Using a Parabolic Ring Cavity | Optical cavities are one of the best ways to increase atom-light coupling and
will be a key ingredient for future quantum technologies that rely on
light-matter interfaces. We demonstrate that traveling-wave "ring" cavities can
achieve a greatly reduced mode waist $w$, leading to larger atom-cavity
coupling strength, relative to conventional standing-wave cavities for given
mirror separation and stability. Additionally, ring cavities can achieve
arbitrary transverse-mode spacing simultaneously with the large mode-waist
reductions. Following these principles, we build a parabolic atom-ring cavity
system that achieves strong collective coupling $NC = 15(1)$ between $N=10^3$
Rb atoms and a ring cavity with a single-atom cooperativity $C$ that is a
factor of $35(5)$ times greater than what could be achieved with a
near-confocal standing-wave cavity with the same mirror separation and finesse.
By using parabolic mirrors, we eliminate astigmatism--which can otherwise
preclude stable operation--and increase optical access to the atoms. Cavities
based on these principles, with enhanced coupling and large mirror separation,
will be particularly useful for achieving strong coupling with ions, Rydberg
atoms, or other strongly interacting particles, which often have undesirable
interactions with nearby surfaces.
| physics.atom-ph quant-ph | optical cavities are one of the best ways to increase atomlight coupling and will be a key ingredient for future quantum technologies that rely on lightmatter interfaces we demonstrate that travelingwave ring cavities can achieve a greatly reduced mode waist w leading to larger atomcavity coupling strength relative to conventional standingwave cavities for given mirror separation and stability additionally ring cavities can achieve arbitrary transversemode spacing simultaneously with the large modewaist reductions following these principles we build a parabolic atomring cavity system that achieves strong collective coupling nc 151 between n103 rb atoms and a ring cavity with a singleatom cooperativity c that is a factor of 355 times greater than what could be achieved with a nearconfocal standingwave cavity with the same mirror separation and finesse by using parabolic mirrors we eliminate astigmatismwhich can otherwise preclude stable operationand increase optical access to the atoms cavities based on these principles with enhanced coupling and large mirror separation will be particularly useful for achieving strong coupling with ions rydberg atoms or other strongly interacting particles which often have undesirable interactions with nearby surfaces | [['optical', 'cavities', 'are', 'one', 'of', 'the', 'best', 'ways', 'to', 'increase', 'atomlight', 'coupling', 'and', 'will', 'be', 'a', 'key', 'ingredient', 'for', 'future', 'quantum', 'technologies', 'that', 'rely', 'on', 'lightmatter', 'interfaces', 'we', 'demonstrate', 'that', 'travelingwave', 'ring', 'cavities', 'can', 'achieve', 'a', 'greatly', 'reduced', 'mode', 'waist', 'w', 'leading', 'to', 'larger', 'atomcavity', 'coupling', 'strength', 'relative', 'to', 'conventional', 'standingwave', 'cavities', 'for', 'given', 'mirror', 'separation', 'and', 'stability', 'additionally', 'ring', 'cavities', 'can', 'achieve', 'arbitrary', 'transversemode', 'spacing', 'simultaneously', 'with', 'the', 'large', 'modewaist', 'reductions', 'following', 'these', 'principles', 'we', 'build', 'a', 'parabolic', 'atomring', 'cavity', 'system', 'that', 'achieves', 'strong', 'collective', 'coupling', 'nc', '151', 'between', 'n103', 'rb', 'atoms', 'and', 'a', 'ring', 'cavity', 'with', 'a', 'singleatom', 'cooperativity', 'c', 'that', 'is', 'a', 'factor', 'of', '355', 'times', 'greater', 'than', 'what', 'could', 'be', 'achieved', 'with', 'a', 'nearconfocal', 'standingwave', 'cavity', 'with', 'the', 'same', 'mirror', 'separation', 'and', 'finesse', 'by', 'using', 'parabolic', 'mirrors', 'we', 'eliminate', 'astigmatismwhich', 'can', 'otherwise', 'preclude', 'stable', 'operationand', 'increase', 'optical', 'access', 'to', 'the', 'atoms', 'cavities', 'based', 'on', 'these', 'principles', 'with', 'enhanced', 'coupling', 'and', 'large', 'mirror', 'separation', 'will', 'be', 'particularly', 'useful', 'for', 'achieving', 'strong', 'coupling', 'with', 'ions', 'rydberg', 'atoms', 'or', 'other', 'strongly', 'interacting', 'particles', 'which', 'often', 'have', 'undesirable', 'interactions', 'with', 'nearby', 'surfaces']] | [-0.17194150275114062, 0.19791028799625945, -0.019937962703051645, -0.02848974119090491, -0.044133046405168914, -0.27682036341373195, 0.04285186656821772, 0.4327146777288599, -0.2420697713962698, -0.3212970613533536, 0.025258533927575176, -0.24817280545251938, -0.057636711218967865, 0.22097516697463132, -0.018493843460876475, 0.019320711311305437, 0.08563771358451748, -0.048100557098017825, -0.025034686787274933, -0.1989079360892249, 0.276364317028336, 0.0673745889867798, 0.2960956491540465, 0.055579626656500465, 0.0889619383224323, -0.03519045338324024, 0.11096830160414937, 0.0005462824651119063, -0.08691313280954188, 0.15822268074830878, 0.2350541042127136, -0.009410558910356403, 0.24960783105027878, -0.45950426097655417, -0.1711340164450013, 0.09034928495306416, 0.2043115421550843, 0.16324444169554816, -0.044837521244429766, -0.281549732605953, 0.02376935017948949, -0.1521899905424081, -0.16973295944511343, -0.08009267515255569, -0.008083460315809412, 0.07549452238405745, -0.3026128384195226, 0.006490706005738785, 0.038487498155056095, 0.05850926467604241, 0.024870249613761733, -0.03949691878439659, 0.023491655855234397, 0.057165965144548796, -0.04977938535065511, 0.028898187526264937, 0.1953768033181096, -0.10571653049407621, -0.10594193206568601, 0.3807896441111794, -0.11976075778351268, -0.13135201794800405, 0.23956607706715896, -0.14725233173776564, -0.016479878057594186, 0.15827019044229665, 0.15714490225691202, 0.041490532728477705, -0.0771740820616652, 0.007337766664962963, -0.0010774516458438952, 0.27117466579038796, 0.15602580722852868, 0.15078107244466657, 0.2143656719754855, 0.15662971414930824, 0.0662328588462561, 0.13075371107611394, -0.06919059355474882, -0.061542049490999284, -0.2450716539396573, -0.1329821152231093, -0.13769648416348637, 0.06152950027052544, -0.11404126906978942, -0.09685578276955728, 0.3183487071576765, 0.10665140369128288, 0.14784044758706105, -0.03959085971003893, 0.27589547996130365, 0.10627601029335569, 0.1265462508226487, 0.012546244152034975, 0.3562564377930794, 0.13921414949868063, 0.03597326933881163, -0.28644228303189373, -0.026592446427981732, 0.012741559742828883] |
1,802.05708 | Kissing numbers and transference theorems from generalized tail bounds | We generalize Banaszczyk's seminal tail bound for the Gaussian mass of a
lattice to a wide class of test functions. From this we obtain quite general
transference bounds, as well as bounds on the number of lattice points
contained in certain bodies. As applications, we bound the lattice kissing
number in $\ell_p$ norms by $e^{(n+ o(n))/p}$ for $0 < p \leq 2$, and also give
a proof of a new transference bound in the $\ell_1$ norm.
| math.MG math.NT | we generalize banaszczyks seminal tail bound for the gaussian mass of a lattice to a wide class of test functions from this we obtain quite general transference bounds as well as bounds on the number of lattice points contained in certain bodies as applications we bound the lattice kissing number in ell_p norms by en onp for 0 p leq 2 and also give a proof of a new transference bound in the ell_1 norm | [['we', 'generalize', 'banaszczyks', 'seminal', 'tail', 'bound', 'for', 'the', 'gaussian', 'mass', 'of', 'a', 'lattice', 'to', 'a', 'wide', 'class', 'of', 'test', 'functions', 'from', 'this', 'we', 'obtain', 'quite', 'general', 'transference', 'bounds', 'as', 'well', 'as', 'bounds', 'on', 'the', 'number', 'of', 'lattice', 'points', 'contained', 'in', 'certain', 'bodies', 'as', 'applications', 'we', 'bound', 'the', 'lattice', 'kissing', 'number', 'in', 'ell_p', 'norms', 'by', 'en', 'onp', 'for', '0', 'p', 'leq', '2', 'and', 'also', 'give', 'a', 'proof', 'of', 'a', 'new', 'transference', 'bound', 'in', 'the', 'ell_1', 'norm']] | [-0.10755387715995311, 0.14623664340780426, -0.07293672565720044, 0.10168932079492758, -0.031989377103745935, -0.12730348229408264, 0.09068643951788545, 0.2665732152511676, -0.2802790652712186, -0.29640813410282135, 0.09860568290421118, -0.2594021414965391, -0.11625801302492618, 0.23617902962490916, -0.094912135998408, 0.07994670495390892, 0.01348183716336886, 0.04101515625913938, -0.0858164443448186, -0.27889875385910273, 0.2818404791255792, 0.005107410481820504, 0.18030263784031073, 0.12164984328982731, 0.024159539397805928, 0.06413146816194057, 0.06296253121768434, -0.03561499808914959, -0.2612966847109298, 0.1632124331779778, 0.22615021387736003, 0.1334829528319339, 0.2592225973556439, -0.3433241219818592, -0.17016822136007248, 0.15708522990345955, 0.14899590196087956, 0.08279687205484758, -0.0502636764322718, -0.23644654338558516, 0.08348092249284188, -0.1244073793788751, -0.14859226354087393, -0.07488185567160448, 0.03155479737867912, 0.07380875304030875, -0.33061583692828816, 0.07762533226011631, 0.11993063936786105, 0.06197724686004222, -0.08232765253943701, -0.24146951459813862, 0.06672559413127602, 0.05127904314547777, 0.04232868223761519, 0.05755551359150559, 0.0436183883746465, -0.07679208232400318, -0.10867721915245056, 0.3679064653192957, -0.08462988505450388, -0.21695956060662866, 0.13761572008331616, -0.1538944302437206, -0.159292866718024, 0.05527149678518375, 0.21992426662395398, 0.17500812017048398, -0.06040176256249348, 0.1622321495281843, -0.15146304121240972, 0.10386083759367466, 0.15163862494130928, 0.10306803888098026, 0.07214823943873247, 0.09638727814580003, 0.20079199509074291, 0.16922210482259592, -0.02513273592106998, -0.05118555514762799, -0.3572746140758197, -0.15726834060236192, -0.2738126862918337, 0.09453017226109903, -0.15244610670313705, -0.1652454103938847, 0.29576461573441826, 0.046945371919622024, 0.25666225905219714, 0.15217945589373508, 0.20327980225284895, 0.04807406397691617, 0.032759531208624446, 0.08972490172833204, 0.17427515064676602, 0.16171002091529468, 0.018617973408351342, -0.10971466336088875, 0.003746569976210594, 0.17617091708506147] |
1,802.05709 | A physical framework for the Earth System, the Anthropocene Equation and
the Great Acceleration | It is proposed, based on the Landau-Ginzburg Theory of phase transitions,
that the transition of the Earth System from the stable conditions of the
Holocene to the human driven condition of the Anthropocene is, actually, a
phase transition, a qualitative change away from its Holocene equilibrium
state. Based on this physical framework, one obtains the Anthropocene equation,
the so-called Great Acceleration and shows that (i) the Earth System
temperature on the new equilibrium state diverges from the average temperature
of the Holocene as the cubic root of the human intervention, described by a
parameter, $H$; (ii) the human induced departure from the Holocene can be as
drastic as the ones due to natural, astronomical and geophysical causes; (iii)
the susceptibility of the Earth System to human effects is much more relevant
near the phase transition. The procedure to obtain numerical predictions from
data is also exemplified through one of the existing proposals to account for
human impact on the Earth's Holocene equilibrium.
| physics.gen-ph physics.pop-ph | it is proposed based on the landauginzburg theory of phase transitions that the transition of the earth system from the stable conditions of the holocene to the human driven condition of the anthropocene is actually a phase transition a qualitative change away from its holocene equilibrium state based on this physical framework one obtains the anthropocene equation the socalled great acceleration and shows that i the earth system temperature on the new equilibrium state diverges from the average temperature of the holocene as the cubic root of the human intervention described by a parameter h ii the human induced departure from the holocene can be as drastic as the ones due to natural astronomical and geophysical causes iii the susceptibility of the earth system to human effects is much more relevant near the phase transition the procedure to obtain numerical predictions from data is also exemplified through one of the existing proposals to account for human impact on the earths holocene equilibrium | [['it', 'is', 'proposed', 'based', 'on', 'the', 'landauginzburg', 'theory', 'of', 'phase', 'transitions', 'that', 'the', 'transition', 'of', 'the', 'earth', 'system', 'from', 'the', 'stable', 'conditions', 'of', 'the', 'holocene', 'to', 'the', 'human', 'driven', 'condition', 'of', 'the', 'anthropocene', 'is', 'actually', 'a', 'phase', 'transition', 'a', 'qualitative', 'change', 'away', 'from', 'its', 'holocene', 'equilibrium', 'state', 'based', 'on', 'this', 'physical', 'framework', 'one', 'obtains', 'the', 'anthropocene', 'equation', 'the', 'socalled', 'great', 'acceleration', 'and', 'shows', 'that', 'i', 'the', 'earth', 'system', 'temperature', 'on', 'the', 'new', 'equilibrium', 'state', 'diverges', 'from', 'the', 'average', 'temperature', 'of', 'the', 'holocene', 'as', 'the', 'cubic', 'root', 'of', 'the', 'human', 'intervention', 'described', 'by', 'a', 'parameter', 'h', 'ii', 'the', 'human', 'induced', 'departure', 'from', 'the', 'holocene', 'can', 'be', 'as', 'drastic', 'as', 'the', 'ones', 'due', 'to', 'natural', 'astronomical', 'and', 'geophysical', 'causes', 'iii', 'the', 'susceptibility', 'of', 'the', 'earth', 'system', 'to', 'human', 'effects', 'is', 'much', 'more', 'relevant', 'near', 'the', 'phase', 'transition', 'the', 'procedure', 'to', 'obtain', 'numerical', 'predictions', 'from', 'data', 'is', 'also', 'exemplified', 'through', 'one', 'of', 'the', 'existing', 'proposals', 'to', 'account', 'for', 'human', 'impact', 'on', 'the', 'earths', 'holocene', 'equilibrium']] | [-0.07334824496187431, 0.15273036604264267, -0.10401818739828067, 0.0355049275576114, -0.048531469761072026, -0.09472365260561123, 0.08428391230358731, 0.29015602055293177, -0.25624882940340926, -0.2994424573801182, 0.11746610265245293, -0.29972641519558285, -0.16887542415542506, 0.19301999723078844, -0.05076749221548254, 0.028847211879537222, 0.05287666042065133, 0.09619155861466065, -0.08658515687537506, -0.19112964687914943, 0.292433992381794, 0.08970654502160341, 0.2801061401698439, 0.04817632035018853, 0.08361609462996439, -0.06991151322461205, 0.04381045159027929, 0.006656493678298078, -0.11836290227604619, 0.0649824238491509, 0.20521701936449074, 0.14964097343603677, 0.2518088316061982, -0.4361368979177909, -0.23893683959074594, 0.09232007071122895, 0.07451908245544743, 0.11118128258780932, -0.012212918044867736, -0.33040220489334543, 0.021498133227183126, -0.15114357120667896, -0.1345736130936945, -0.02970850113980518, 0.014430576343273308, -0.030411728761262365, -0.25794532158653494, 0.09090180925282587, 0.05427843423123345, 0.10042462229188302, -0.10466078773822153, -0.10208496244489158, -0.08209417491898309, 0.16460145734262044, 0.09071162271738788, 0.04034022756932694, 0.17838524328113567, -0.12131592308107855, -0.06032738661002598, 0.43326962516746587, -0.06903387755759198, -0.09565613486654596, 0.1821908536453352, -0.16555495419321054, -0.06981421736885368, 0.16796268830880706, 0.14524490517322663, 0.10040669200114077, -0.11719595365812657, 0.0415401377731429, 0.017518442486309342, 0.14663107671493228, 0.014829544100427517, -0.019767640598325267, 0.23044200883143479, 0.1932926729614674, 0.06853559052709628, 0.11215411644518077, -0.11068678540062665, -0.16118179859570514, -0.271934467362079, -0.12255431907136499, -0.17935735662324054, 0.04027831394162121, -0.1019664943377404, -0.1699352803154375, 0.40195594704997395, 0.20289474725435822, 0.17265289528065442, 0.0036341663806434767, 0.28951123716988036, 0.10554669025845619, 0.041571946541583284, 0.023727192889818532, 0.27962167790148085, 0.055408129552458295, 0.15164681252977455, -0.2733428079252603, 0.1342113076444761, 0.05513448824669108] |
1,802.0571 | Symmetry and decoherence-free subspaces in quantum neural networks | Evolution of quantum states of array of quantum dots is analyzed by means of
numerical solution of the von Neumann equation. For two qubit system with
dipole-dipole interaction and common phonon bath the evolution of the symmetric
state $\frac{\uparrow\downarrow+\downarrow\uparrow}{\sqrt{2}}$ leads to the
mixture of the triplet states, leaving the singlet decoupled. For three qubit
system ($D_{1/2}^{\otimes3}=D_{3/2}+2D_{1/2}$) with common phonon bath we
observed similar effects within the quartet state $D_{3/2}$ if all qubits were
symmetrically connected.
| quant-ph | evolution of quantum states of array of quantum dots is analyzed by means of numerical solution of the von neumann equation for two qubit system with dipoledipole interaction and common phonon bath the evolution of the symmetric state fracuparrowdownarrowdownarrowuparrowsqrt2 leads to the mixture of the triplet states leaving the singlet decoupled for three qubit system d_12otimes3d_322d_12 with common phonon bath we observed similar effects within the quartet state d_32 if all qubits were symmetrically connected | [['evolution', 'of', 'quantum', 'states', 'of', 'array', 'of', 'quantum', 'dots', 'is', 'analyzed', 'by', 'means', 'of', 'numerical', 'solution', 'of', 'the', 'von', 'neumann', 'equation', 'for', 'two', 'qubit', 'system', 'with', 'dipoledipole', 'interaction', 'and', 'common', 'phonon', 'bath', 'the', 'evolution', 'of', 'the', 'symmetric', 'state', 'fracuparrowdownarrowdownarrowuparrowsqrt2', 'leads', 'to', 'the', 'mixture', 'of', 'the', 'triplet', 'states', 'leaving', 'the', 'singlet', 'decoupled', 'for', 'three', 'qubit', 'system', 'd_12otimes3d_322d_12', 'with', 'common', 'phonon', 'bath', 'we', 'observed', 'similar', 'effects', 'within', 'the', 'quartet', 'state', 'd_32', 'if', 'all', 'qubits', 'were', 'symmetrically', 'connected']] | [-0.1565563974839042, 0.25315785612145514, -0.02421530894935131, -0.014319337373408042, 0.03613994801927307, -0.2406925489386059, 0.01092704788826355, 0.35128147412435956, -0.2423121264038531, -0.23053012308919776, 0.011458560251886, -0.3554520056110947, -0.015472750498415672, 0.12644154647339698, 0.076035194338159, 0.06937895927016866, 0.10952200024940507, 0.04469194776723034, -0.04223773810910444, -0.22499107694482967, 0.3837149501969553, -0.039071880233129616, 0.26570703608481444, 0.002117363455360883, 0.10130236644859184, 0.013131236389585554, 0.1181344886195578, -0.04790296377486562, -0.0652351338824589, 0.05717668350473404, 0.2551015582492205, 0.04026137877970117, 0.2272558692995816, -0.48035937193015665, -0.17169517626960393, 0.06607295885324886, 0.15094350395749692, 0.1634379165304493, 0.007534489188700506, -0.3474923332464205, -0.01740845775053109, -0.19644973816171493, -0.11614418096763834, -0.054377903568571154, -0.0009812029486853783, -0.028426020827195416, -0.2185744041551466, 0.14748063647787865, 0.055831635000873105, 0.011760069810058156, -0.08134592901149841, -0.11018951500970105, -0.051221952492958064, 0.11581015277475323, -0.043714790072368635, -0.05639922146187865, 0.14261730988063429, -0.07638555553371776, -0.10999983392834459, 0.3196830091908676, -0.08929816321533633, -0.16364873631870094, 0.1728044484474071, -0.129087905099692, -0.03041775134226231, 0.08541380133071583, 0.04682898072347249, 0.08415130379112208, -0.1800102179149191, 0.07998103997909324, -0.00011552410193859307, 0.18833158474434677, 0.018883918211093708, 0.11085212657432238, 0.1981780502996216, 0.13013118686639283, 0.05691960654285264, 0.20511820780955356, -0.05605306092024564, -0.20612595035783846, -0.2927254680799295, -0.1661434863783317, -0.23101265220870965, 0.09892282293701213, -0.06202853534650536, -0.1702247505293113, 0.43544247000133746, 0.07198498852523873, 0.12408373743129818, -0.05222312660492344, 0.21595656098670338, 0.1353331190623241, 0.0433989702915288, 0.0710004972459825, 0.2302071777465817, 0.253243953624281, -0.0010889372597002003, -0.3802228542363705, 0.005927735040193959, 0.008048589475299807] |
1,802.05711 | Modelling uncertainty using stochastic transport noise in a 2-layer
quasi-geostrophic model | The stochastic variational approach for geophysical fluid dynamics was
introduced by Holm (Proc Roy Soc A, 2015) as a framework for deriving
stochastic parameterisations for unresolved scales. This paper applies the
variational stochastic parameterisation in a two-layer quasi-geostrophic model
for a beta-plane channel flow configuration. We present a new method for
estimating the stochastic forcing (used in the parameterisation) to approximate
unresolved components using data from the high resolution deterministic
simulation, and describe a procedure for computing physically-consistent
initial conditions for the stochastic model. We also quantify uncertainty of
coarse grid simulations relative to the fine grid ones in homogeneous (teamed
with small-scale vortices) and heterogeneous (featuring horizontally elongated
large-scale jets) flows, and analyse how the spread of stochastic solutions
depends on different parameters of the model. The parameterisation is tested by
comparing it with the true eddy-resolving solution that has reached some
statistical equilibrium and the deterministic solution modelled on a
low-resolution grid. The results show that the proposed parameterisation
significantly depends on the resolution of the stochastic model and gives good
ensemble performance for both homogeneous and heterogeneous flows, and the
parameterisation lays solid foundations for data assimilation.
| physics.flu-dyn math-ph math.MP | the stochastic variational approach for geophysical fluid dynamics was introduced by holm proc roy soc a 2015 as a framework for deriving stochastic parameterisations for unresolved scales this paper applies the variational stochastic parameterisation in a twolayer quasigeostrophic model for a betaplane channel flow configuration we present a new method for estimating the stochastic forcing used in the parameterisation to approximate unresolved components using data from the high resolution deterministic simulation and describe a procedure for computing physicallyconsistent initial conditions for the stochastic model we also quantify uncertainty of coarse grid simulations relative to the fine grid ones in homogeneous teamed with smallscale vortices and heterogeneous featuring horizontally elongated largescale jets flows and analyse how the spread of stochastic solutions depends on different parameters of the model the parameterisation is tested by comparing it with the true eddyresolving solution that has reached some statistical equilibrium and the deterministic solution modelled on a lowresolution grid the results show that the proposed parameterisation significantly depends on the resolution of the stochastic model and gives good ensemble performance for both homogeneous and heterogeneous flows and the parameterisation lays solid foundations for data assimilation | [['the', 'stochastic', 'variational', 'approach', 'for', 'geophysical', 'fluid', 'dynamics', 'was', 'introduced', 'by', 'holm', 'proc', 'roy', 'soc', 'a', '2015', 'as', 'a', 'framework', 'for', 'deriving', 'stochastic', 'parameterisations', 'for', 'unresolved', 'scales', 'this', 'paper', 'applies', 'the', 'variational', 'stochastic', 'parameterisation', 'in', 'a', 'twolayer', 'quasigeostrophic', 'model', 'for', 'a', 'betaplane', 'channel', 'flow', 'configuration', 'we', 'present', 'a', 'new', 'method', 'for', 'estimating', 'the', 'stochastic', 'forcing', 'used', 'in', 'the', 'parameterisation', 'to', 'approximate', 'unresolved', 'components', 'using', 'data', 'from', 'the', 'high', 'resolution', 'deterministic', 'simulation', 'and', 'describe', 'a', 'procedure', 'for', 'computing', 'physicallyconsistent', 'initial', 'conditions', 'for', 'the', 'stochastic', 'model', 'we', 'also', 'quantify', 'uncertainty', 'of', 'coarse', 'grid', 'simulations', 'relative', 'to', 'the', 'fine', 'grid', 'ones', 'in', 'homogeneous', 'teamed', 'with', 'smallscale', 'vortices', 'and', 'heterogeneous', 'featuring', 'horizontally', 'elongated', 'largescale', 'jets', 'flows', 'and', 'analyse', 'how', 'the', 'spread', 'of', 'stochastic', 'solutions', 'depends', 'on', 'different', 'parameters', 'of', 'the', 'model', 'the', 'parameterisation', 'is', 'tested', 'by', 'comparing', 'it', 'with', 'the', 'true', 'eddyresolving', 'solution', 'that', 'has', 'reached', 'some', 'statistical', 'equilibrium', 'and', 'the', 'deterministic', 'solution', 'modelled', 'on', 'a', 'lowresolution', 'grid', 'the', 'results', 'show', 'that', 'the', 'proposed', 'parameterisation', 'significantly', 'depends', 'on', 'the', 'resolution', 'of', 'the', 'stochastic', 'model', 'and', 'gives', 'good', 'ensemble', 'performance', 'for', 'both', 'homogeneous', 'and', 'heterogeneous', 'flows', 'and', 'the', 'parameterisation', 'lays', 'solid', 'foundations', 'for', 'data', 'assimilation']] | [-0.08387390319503059, 0.04729291634805696, -0.08773536540531113, 0.08528876987187878, -0.04418515580289654, -0.13441694055340792, 0.004676073994855152, 0.32697411146211, -0.273402432197901, -0.3135547459076502, 0.10539032742687451, -0.2081852123885734, -0.1195247485069558, 0.21125964342683898, -0.04916625666052201, 0.08586893058872144, 0.10031110671544938, -0.08182686868270761, -0.02318706151196047, -0.19662452422045662, 0.31953580447129515, 0.10800954053104904, 0.3036173992202078, -0.022240405988046212, 0.16559009907987754, -0.026844773976450884, -0.08278242242032367, 0.05958734417493504, -0.16783902585348665, 0.10746711832226107, 0.18637782257712004, 0.10869822958606834, 0.24955156304847487, -0.4300928325380052, -0.25921479242143075, 0.05488686215279526, 0.11835701013562931, 0.1263810448887709, -0.015374402620363981, -0.2554657644053039, 0.06547729496868622, -0.16176198206253742, -0.13128462416904146, -0.0913346575536324, 0.004307918961306936, 0.062459550182776234, -0.3106350954965149, 0.1026642785908495, 0.04998634538577263, 0.07015609695134979, -0.09178143345971444, -0.11656049087300505, -0.01643676137992818, 0.07171586004980399, -0.011427601451348317, -0.000384644690999075, 0.10576142261392976, -0.1285252229053233, -0.07953496043521323, 0.37921618183486555, -0.09231757141747757, -0.2567613797780053, 0.180362934354803, -0.07152380413424812, -0.1485275600393499, 0.11156699470808043, 0.22418962709458642, 0.10762501215243614, -0.15899568157834246, 0.08790878250269758, -0.062016136532551364, 0.14902702239587118, 0.03464211480336656, -0.08054361577684942, 0.16507929935928825, 0.22803613350873714, 0.08459372173249569, 0.10165326623368616, -0.1271538948928202, -0.19222472281452563, -0.2619895500664011, -0.10260847481197408, -0.15504097041833265, 0.022400966428808476, -0.1237552453525591, -0.17842441565344894, 0.3835871505992193, 0.1805134163434176, 0.15400573499133124, 0.06741043040038723, 0.30172955138045116, 0.10810824491659571, -0.03490896296540373, 0.1310500409833989, 0.22409397127232392, 0.14058390563648, 0.14300443347984632, -0.2057328522922226, 0.07050273631772909, 0.0748057296352559] |
1,802.05712 | Gravitational waves from vacuum first-order phase transitions: from the
envelope to the lattice | We conduct large scale numerical simulations of gravitational wave production
at a first order vacuum phase transition. We find a power law for the
gravitational wave power spectrum at high wavenumber which falls off as
$k^{-1.5}$ rather than the $k^{-1}$ produced by the envelope approximation. The
peak of the power spectrum is shifted to slightly lower wave numbers from that
of the envelope approximation. The envelope approximation reproduces our
results for the peak power less well, agreeing only to within an order of
magnitude. After the bubbles finish colliding the scalar field oscillates
around the true vacuum. An additional feature is produced in the UV of the
gravitational wave power spectrum, and this continues to grow linearly until
the end of our simulation. The additional feature peaks at a length scale close
to the bubble wall thickness and is shown to have a negligible contribution to
the energy in gravitational waves, providing the scalar field mass is much
smaller than the Planck mass.
| astro-ph.CO hep-ph | we conduct large scale numerical simulations of gravitational wave production at a first order vacuum phase transition we find a power law for the gravitational wave power spectrum at high wavenumber which falls off as k15 rather than the k1 produced by the envelope approximation the peak of the power spectrum is shifted to slightly lower wave numbers from that of the envelope approximation the envelope approximation reproduces our results for the peak power less well agreeing only to within an order of magnitude after the bubbles finish colliding the scalar field oscillates around the true vacuum an additional feature is produced in the uv of the gravitational wave power spectrum and this continues to grow linearly until the end of our simulation the additional feature peaks at a length scale close to the bubble wall thickness and is shown to have a negligible contribution to the energy in gravitational waves providing the scalar field mass is much smaller than the planck mass | [['we', 'conduct', 'large', 'scale', 'numerical', 'simulations', 'of', 'gravitational', 'wave', 'production', 'at', 'a', 'first', 'order', 'vacuum', 'phase', 'transition', 'we', 'find', 'a', 'power', 'law', 'for', 'the', 'gravitational', 'wave', 'power', 'spectrum', 'at', 'high', 'wavenumber', 'which', 'falls', 'off', 'as', 'k15', 'rather', 'than', 'the', 'k1', 'produced', 'by', 'the', 'envelope', 'approximation', 'the', 'peak', 'of', 'the', 'power', 'spectrum', 'is', 'shifted', 'to', 'slightly', 'lower', 'wave', 'numbers', 'from', 'that', 'of', 'the', 'envelope', 'approximation', 'the', 'envelope', 'approximation', 'reproduces', 'our', 'results', 'for', 'the', 'peak', 'power', 'less', 'well', 'agreeing', 'only', 'to', 'within', 'an', 'order', 'of', 'magnitude', 'after', 'the', 'bubbles', 'finish', 'colliding', 'the', 'scalar', 'field', 'oscillates', 'around', 'the', 'true', 'vacuum', 'an', 'additional', 'feature', 'is', 'produced', 'in', 'the', 'uv', 'of', 'the', 'gravitational', 'wave', 'power', 'spectrum', 'and', 'this', 'continues', 'to', 'grow', 'linearly', 'until', 'the', 'end', 'of', 'our', 'simulation', 'the', 'additional', 'feature', 'peaks', 'at', 'a', 'length', 'scale', 'close', 'to', 'the', 'bubble', 'wall', 'thickness', 'and', 'is', 'shown', 'to', 'have', 'a', 'negligible', 'contribution', 'to', 'the', 'energy', 'in', 'gravitational', 'waves', 'providing', 'the', 'scalar', 'field', 'mass', 'is', 'much', 'smaller', 'than', 'the', 'planck', 'mass']] | [-0.14757175255421137, 0.166009938159559, -0.0821952733091233, 0.07931513669457789, -0.06265722181750862, -0.04751921320859731, 0.014603726874374173, 0.32559974031077205, -0.23442277850217522, -0.30812283020546555, 0.07248193649660818, -0.3100278395930865, -0.04156355118876083, 0.19936026283968356, 0.05429183980992829, 0.020176178332921003, -0.008440677169424716, 0.06314329377038438, -0.06361093196412262, -0.1812013018079262, 0.3161206722453785, 0.16484964536674365, 0.23551853051112015, 0.043380957062533296, 0.05146928567387895, -0.07678980851243107, -0.004522202497539596, -0.00727709882144182, -0.1126303982400379, 0.035962490187786474, 0.17459357143922544, 0.05988375767436953, 0.2636575340007666, -0.41396635881213734, -0.2196204198925739, 0.08430522267758114, 0.15756705438181118, 0.12063457022893866, -0.03742870884416111, -0.22565159860975537, 0.08642097992788246, -0.1755932879925597, -0.18595544609635428, 0.017142702768231096, 0.03666617075249873, -0.01584448186577829, -0.2730555316966107, 0.11665136526493024, 0.017879666667717276, -0.015732844627285206, -0.06293032613605763, -0.10192933292099578, -0.06259848279564247, 0.05161340078238992, 0.10787989461988759, 0.09165779311507026, 0.15314344597831825, -0.16518242903299446, -0.0011479143993186256, 0.38863551345842384, -0.11068203097921396, -0.0931835207642496, 0.14509935650197459, -0.2171558661363516, -0.056525651353377095, 0.23789455339975335, 0.1595197276789352, 0.10117694968451421, -0.05622298836113851, 0.03649953127612983, 0.023613207046859583, 0.22665773698862962, 0.14146659454327945, 0.027661776392966325, 0.25955463346683827, 0.14797638018670536, 0.07223645130463767, 0.13946403221490056, -0.1105256617294933, -0.08094993230252544, -0.3111225971723535, -0.08047737140048501, -0.20269273167784593, 0.03806157632083832, -0.10795224567663148, -0.13129067612562664, 0.4038150147449202, 0.117427863413468, 0.20244686522641064, 0.11353881497784557, 0.3347231869163003, 0.18781948617860914, 0.09157619314222522, 0.09773870411076678, 0.3364512619499597, 0.124280310789426, 0.1452032094478516, -0.22062737078325925, -0.016886222703336663, 0.012684019688128328] |
1,802.05713 | A Simple No-Scale Model of Modulus Fixing and Inflation | We construct a no-scale model of inflation with a single modulus whose real
and imaginary parts are fixed by simple power-law corrections to the no-scale
K{\" a}hler potential. Assuming an uplift of the minimum of the effective
potential, the model yields a suitable number of e-folds of expansion and
values of the tilt in the scalar cosmological density perturbations and of the
ratio of tensor and scalar perturbations that are compatible with measurements
of the cosmic microwave background radiation.
| hep-ph astro-ph.CO gr-qc hep-th | we construct a noscale model of inflation with a single modulus whose real and imaginary parts are fixed by simple powerlaw corrections to the noscale k ahler potential assuming an uplift of the minimum of the effective potential the model yields a suitable number of efolds of expansion and values of the tilt in the scalar cosmological density perturbations and of the ratio of tensor and scalar perturbations that are compatible with measurements of the cosmic microwave background radiation | [['we', 'construct', 'a', 'noscale', 'model', 'of', 'inflation', 'with', 'a', 'single', 'modulus', 'whose', 'real', 'and', 'imaginary', 'parts', 'are', 'fixed', 'by', 'simple', 'powerlaw', 'corrections', 'to', 'the', 'noscale', 'k', 'ahler', 'potential', 'assuming', 'an', 'uplift', 'of', 'the', 'minimum', 'of', 'the', 'effective', 'potential', 'the', 'model', 'yields', 'a', 'suitable', 'number', 'of', 'efolds', 'of', 'expansion', 'and', 'values', 'of', 'the', 'tilt', 'in', 'the', 'scalar', 'cosmological', 'density', 'perturbations', 'and', 'of', 'the', 'ratio', 'of', 'tensor', 'and', 'scalar', 'perturbations', 'that', 'are', 'compatible', 'with', 'measurements', 'of', 'the', 'cosmic', 'microwave', 'background', 'radiation']] | [-0.18305641853639595, 0.16744812168464612, -0.08889703383032657, 0.031581889048124416, -0.060259619515530674, -0.12475235435427932, -0.034218568907449426, 0.27708375572722077, -0.20289211910029378, -0.33010787233898914, 0.06684609233030366, -0.27893974952682665, -0.11697440282618508, 0.1293908740641384, 0.01850653952577069, 0.034880939663477724, -0.015264897760522516, 0.07122259193300447, -0.03856719043282674, -0.24443492774049974, 0.3549471554358172, 0.1205156014501294, 0.20148264317289938, 0.01267258621327862, 0.10066919910568226, -0.04478476525437605, -0.016434152616494443, 0.026424439223129537, -0.13317351383379958, 0.11926665552891791, 0.10649437966713787, 0.11071469903558115, 0.17472223385791236, -0.39188307226647306, -0.23607423550248902, 0.1873480527296285, 0.09158019746264702, 0.10459661404779062, -0.02957856452351884, -0.2254491154564238, 0.10307461650499815, -0.16352056662398803, -0.15400593589307576, -0.06110503167043664, 0.02596816998210889, -0.03476249096809026, -0.34136029620525205, 0.11148708755013391, -0.05887377764322335, 0.01844358827352901, -0.1122475181458683, -0.10089512363877855, -0.06424196976932543, 0.0292722830766977, 0.11450965326173301, 0.020279457683592468, 0.16535748228360014, -0.184823825837502, -0.05638135189508807, 0.382619031952529, -0.17863529562195646, -0.1536691028719084, 0.08126799462811102, -0.13053089228777004, -0.07896282194960344, 0.11931194694524136, 0.12531718748468387, 0.10518585013437874, -0.09560602915154982, 0.20231367468161957, 0.0531858490187604, 0.13627285724859448, 0.09110290962684003, -0.004431543288210147, 0.28566755465220045, 0.09665599063368915, 0.04260791900060788, 0.12330547447280982, -0.040262790343759555, -0.05151543283504965, -0.433828359068949, -0.08667856227618324, -0.1643450674821941, 0.07681589045479328, -0.2500786403941191, -0.2527241481857115, 0.43023328642254766, 0.0800449411750217, 0.24919682032136906, 0.09208108681619545, 0.29280003815700734, 0.10184615342199944, 0.07225365456948175, 0.05628196517877941, 0.27684651900530804, 0.16682654449751577, 0.09136434264268868, -0.22495146859083562, -0.04287955415423347, 0.0015753079235223653] |
1,802.05714 | The Experimental Nuclear Reaction Data (EXFOR): Extended Computer
Database and Web Retrieval System | The EXchange FORmat (EXFOR) experimental nuclear reaction database and the
associated Web interface provide access to the wealth of low- and
intermediate-energy nuclear reaction physics data. This resource is based on
numerical data sets and bibliographical information of $\sim$22,000 experiments
since the beginning of nuclear science. The principles of the Web and database
applications development are described. New capabilities for the data sets
uploads, renormalization, covariance matrix, and inverse reaction calculations
are presented.
The EXFOR database, updated monthly, provides an essential support for
nuclear data evaluation, application development, and research activities. It
is publicly available at the websites of the International Atomic Energy Agency
Nuclear Data Section, {\it http://www-nds.iaea.org/exfor}, the U.S. National
Nuclear Data Center, {\it http://www.nndc.bnl.gov/exfor}, and the mirror sites
in China, India and Russian Federation.
| physics.comp-ph math.NA | the exchange format exfor experimental nuclear reaction database and the associated web interface provide access to the wealth of low and intermediateenergy nuclear reaction physics data this resource is based on numerical data sets and bibliographical information of sim22000 experiments since the beginning of nuclear science the principles of the web and database applications development are described new capabilities for the data sets uploads renormalization covariance matrix and inverse reaction calculations are presented the exfor database updated monthly provides an essential support for nuclear data evaluation application development and research activities it is publicly available at the websites of the international atomic energy agency nuclear data section it httpwwwndsiaeaorgexfor the us national nuclear data center it httpwwwnndcbnlgovexfor and the mirror sites in china india and russian federation | [['the', 'exchange', 'format', 'exfor', 'experimental', 'nuclear', 'reaction', 'database', 'and', 'the', 'associated', 'web', 'interface', 'provide', 'access', 'to', 'the', 'wealth', 'of', 'low', 'and', 'intermediateenergy', 'nuclear', 'reaction', 'physics', 'data', 'this', 'resource', 'is', 'based', 'on', 'numerical', 'data', 'sets', 'and', 'bibliographical', 'information', 'of', 'sim22000', 'experiments', 'since', 'the', 'beginning', 'of', 'nuclear', 'science', 'the', 'principles', 'of', 'the', 'web', 'and', 'database', 'applications', 'development', 'are', 'described', 'new', 'capabilities', 'for', 'the', 'data', 'sets', 'uploads', 'renormalization', 'covariance', 'matrix', 'and', 'inverse', 'reaction', 'calculations', 'are', 'presented', 'the', 'exfor', 'database', 'updated', 'monthly', 'provides', 'an', 'essential', 'support', 'for', 'nuclear', 'data', 'evaluation', 'application', 'development', 'and', 'research', 'activities', 'it', 'is', 'publicly', 'available', 'at', 'the', 'websites', 'of', 'the', 'international', 'atomic', 'energy', 'agency', 'nuclear', 'data', 'section', 'it', 'httpwwwndsiaeaorgexfor', 'the', 'us', 'national', 'nuclear', 'data', 'center', 'it', 'httpwwwnndcbnlgovexfor', 'and', 'the', 'mirror', 'sites', 'in', 'china', 'india', 'and', 'russian', 'federation']] | [-0.046535888371328195, 0.04164371405638503, -0.0766933681450375, 0.10887899170648457, -0.1103463118779473, -0.08171908720396459, 0.04502030368518805, 0.3473196902702893, -0.26327614154246065, -0.3443062318293678, 0.14977010468963622, -0.3751383951504625, -0.0274893329328587, 0.23144925723505777, 0.029232182299658176, 0.04677365860721517, 0.12902217092097648, 0.029022491276273578, 0.01706361027261723, -0.23698385026786598, 0.2976147357614771, 0.1931440370653065, 0.37881319651440265, 0.11027079068439742, 0.06342092979391437, 0.030022056478511302, -0.1359528015562964, -0.09282464620416923, -0.12214101765364889, 0.19484898920305685, 0.4040481739737574, 0.24423721043257823, 0.22545048294799222, -0.45901543499841807, -0.1218403213621763, 0.024160035405187838, 0.02145374770606718, 0.0907482927469837, -0.12265926827169624, -0.31247009188612745, -0.02437122067391512, -0.23806898934285967, -0.09292245107222229, -0.10899984787571274, 0.04859388906568769, 0.03219085575866273, -0.2502577201418218, 0.005376867580062319, -0.07383168607784976, 0.1437621733765545, -0.09698895052743835, -0.17062747182940402, -0.01620582916638664, 0.17907140799422538, 0.02137514919177779, 0.03328729447915271, 0.2013197776095401, -0.0985032339681751, -0.11562342829992919, 0.40262792091966876, 0.022513378849027738, -0.05808003635836705, 0.14849856085587113, -0.11983360745662433, -0.18112128894520743, 0.09959835487027321, 0.22209478796820245, 0.014857818780001253, -0.2314003529552851, 0.11117680007132989, -0.025505410578672685, 0.18506377626721177, 0.014756681040331211, -0.004348230612043652, 0.1294917658951524, 0.22315863657727716, 0.007254034243223648, 0.04867905796310233, -0.11256435308877694, -0.13535051595517283, -0.2840576797288151, -0.10953253418988278, -0.18224959885100683, -0.007126992344931369, -0.05232876488439468, -0.09049556639060498, 0.3574539861311355, 0.11058809526354796, 0.0847462180132542, -0.09442018221354022, 0.3066577246007059, -0.02400020300410688, 0.11360668243780252, 0.11131404366554512, 0.15781419051270332, 0.0817007542918286, 0.21914903373802982, -0.1940058077415151, 0.07657747288730236, -0.014909698781857808] |
1,802.05715 | An image-based array trigger for Imaging Atmospheric Cherenkov Telescope
Arrays | It is anticipated that forthcoming, next generation, atmospheric Cherenkov
telescope arrays will include a number of medium-sized telescopes that are
constructed using a dual-mirror Schwarzschild-Couder configuration. These
telescopes will sample a wide ($8^{\circ}$) field of view using a densely
pixelated camera comprising over $10^{4}$ individual readout channels. A
readout frequency congruent with the expected single-telescope trigger rates
would result in substantial data rates. To ameliorate these data rates, a
novel, hardware-level Distributed Intelligent Array Trigger (DIAT) is
envisioned. A copy of the DIAT operates autonomously at each telescope and uses
reduced resolution imaging data from a limited subset of nearby telescopes to
veto events prior to camera readout {and any subsequent network transmission of
camera data that is required for centralized storage or aggregation}. We
present the results of Monte-Carlo simulations that evaluate the efficacy of a
"Parallax width" discriminator that can be used by the DIAT to efficiently
distinguish between genuine gamma-ray initiated events and unwanted background
events that are initiated by hadronic cosmic rays.
| astro-ph.IM astro-ph.HE | it is anticipated that forthcoming next generation atmospheric cherenkov telescope arrays will include a number of mediumsized telescopes that are constructed using a dualmirror schwarzschildcouder configuration these telescopes will sample a wide 8circ field of view using a densely pixelated camera comprising over 104 individual readout channels a readout frequency congruent with the expected singletelescope trigger rates would result in substantial data rates to ameliorate these data rates a novel hardwarelevel distributed intelligent array trigger diat is envisioned a copy of the diat operates autonomously at each telescope and uses reduced resolution imaging data from a limited subset of nearby telescopes to veto events prior to camera readout and any subsequent network transmission of camera data that is required for centralized storage or aggregation we present the results of montecarlo simulations that evaluate the efficacy of a parallax width discriminator that can be used by the diat to efficiently distinguish between genuine gammaray initiated events and unwanted background events that are initiated by hadronic cosmic rays | [['it', 'is', 'anticipated', 'that', 'forthcoming', 'next', 'generation', 'atmospheric', 'cherenkov', 'telescope', 'arrays', 'will', 'include', 'a', 'number', 'of', 'mediumsized', 'telescopes', 'that', 'are', 'constructed', 'using', 'a', 'dualmirror', 'schwarzschildcouder', 'configuration', 'these', 'telescopes', 'will', 'sample', 'a', 'wide', '8circ', 'field', 'of', 'view', 'using', 'a', 'densely', 'pixelated', 'camera', 'comprising', 'over', '104', 'individual', 'readout', 'channels', 'a', 'readout', 'frequency', 'congruent', 'with', 'the', 'expected', 'singletelescope', 'trigger', 'rates', 'would', 'result', 'in', 'substantial', 'data', 'rates', 'to', 'ameliorate', 'these', 'data', 'rates', 'a', 'novel', 'hardwarelevel', 'distributed', 'intelligent', 'array', 'trigger', 'diat', 'is', 'envisioned', 'a', 'copy', 'of', 'the', 'diat', 'operates', 'autonomously', 'at', 'each', 'telescope', 'and', 'uses', 'reduced', 'resolution', 'imaging', 'data', 'from', 'a', 'limited', 'subset', 'of', 'nearby', 'telescopes', 'to', 'veto', 'events', 'prior', 'to', 'camera', 'readout', 'and', 'any', 'subsequent', 'network', 'transmission', 'of', 'camera', 'data', 'that', 'is', 'required', 'for', 'centralized', 'storage', 'or', 'aggregation', 'we', 'present', 'the', 'results', 'of', 'montecarlo', 'simulations', 'that', 'evaluate', 'the', 'efficacy', 'of', 'a', 'parallax', 'width', 'discriminator', 'that', 'can', 'be', 'used', 'by', 'the', 'diat', 'to', 'efficiently', 'distinguish', 'between', 'genuine', 'gammaray', 'initiated', 'events', 'and', 'unwanted', 'background', 'events', 'that', 'are', 'initiated', 'by', 'hadronic', 'cosmic', 'rays']] | [-0.1458586169159915, 0.16201665161278503, -0.032031368164076326, 0.05171439819478329, -0.09269227154681975, -0.13658726058903162, 0.03336858598470508, 0.40772111024931973, -0.20936528448834565, -0.38121305038613906, 0.11181445062407348, -0.29528591773158547, -0.07410016342442123, 0.23847887808238213, -0.08194423083381458, 0.025201631747452678, 0.18541467908478107, -0.06908913958447435, -0.0032520164463511973, -0.2273373690143463, 0.21040116714703547, 0.1810083122116076, 0.26394492059564556, -0.04572986394548452, 0.1542327089644744, -0.012052162062286972, -0.08090041511192783, -0.00943787928449035, -0.06831661948409276, 0.06720054271513125, 0.3272834126977811, 0.18375779078299942, 0.19723067286772183, -0.4297218313242126, -0.17499518257717275, 0.1309516165035227, 0.12274622511965817, 0.020914929035310465, -0.05478370295001576, -0.3240072504222444, 0.1027955817990005, -0.19780435751427908, -0.12687882206806667, -0.016272376435921044, -0.039356336403632515, 0.05940299814690398, -0.29341854993253946, -0.029069043090005953, -0.04762395335423076, 0.010298868195933616, -0.038227638908583356, -0.06406876718041947, 0.011436291405067116, 0.11491733366631936, -0.05400846967984171, 0.06196142327396693, 0.1619431938557375, -0.12722950967982327, -0.12183633878131409, 0.3158300534123555, -0.03654251411467432, -0.11391612344298017, 0.17138097206332598, -0.1509994849652411, -0.11798453220188708, 0.22665721382833567, 0.23353717095851168, 0.09203861666147609, -0.216117879254491, 0.010213587726592591, 0.023900854496666825, 0.2377920854522521, 0.06825771058821231, 0.050825754002421106, 0.23072916318954204, 0.2264855751818248, 0.11161000315795641, 0.12049279722219602, -0.25660134842955923, -0.006604408274449587, -0.27384974019803915, -0.11421474348893951, -0.19042731944123753, 0.07547444154659892, -0.04486934883993032, -0.09170460253841727, 0.3481793050901089, 0.1695951940127121, 0.14298031323712812, 0.01695666738213545, 0.3486232487540917, -0.01963780038774081, 0.17251047136329384, 0.008984967816553741, 0.24216103037406903, 0.048154221749471794, 0.12989951280353826, -0.16489355201469677, 0.02177912771634488, 0.012977452481625578] |
1,802.05716 | Secular dynamics of hierarchical multiple systems composed of nested
binaries, with an arbitrary number of bodies and arbitrary hierarchical
structure. II. External perturbations: flybys and supernovae | We extend the formalism of a previous paper to include the effects of flybys
and instantaneous perturbations such as supernovae on the long-term secular
evolution of hierarchical multiple systems with an arbitrary number of bodies
and hierarchy, provided that the system is composed of nested binary orbits. To
model secular encounters, we expand the Hamiltonian in terms of the ratio of
the separation of the perturber with respect to the barycentre of the multiple
system, to the separation of the widest orbit. Subsequently, we integrate over
the perturber orbit numerically or analytically. We verify our method for
secular encounters, and illustrate it with an example. Furthermore, we describe
a method to compute instantaneous orbital changes to multiple systems, such as
asymmetric supernovae and impulsive encounters. The secular code, with
implementation of the extensions described in this paper, is publicly available
within AMUSE, and we provide a number of simple example scripts to illustrate
its usage for secular and impulsive encounters, and asymmetric supernovae. The
extensions presented in this paper are a next step toward efficiently modeling
the evolution of complex multiple systems embedded in star clusters.
| astro-ph.SR astro-ph.EP | we extend the formalism of a previous paper to include the effects of flybys and instantaneous perturbations such as supernovae on the longterm secular evolution of hierarchical multiple systems with an arbitrary number of bodies and hierarchy provided that the system is composed of nested binary orbits to model secular encounters we expand the hamiltonian in terms of the ratio of the separation of the perturber with respect to the barycentre of the multiple system to the separation of the widest orbit subsequently we integrate over the perturber orbit numerically or analytically we verify our method for secular encounters and illustrate it with an example furthermore we describe a method to compute instantaneous orbital changes to multiple systems such as asymmetric supernovae and impulsive encounters the secular code with implementation of the extensions described in this paper is publicly available within amuse and we provide a number of simple example scripts to illustrate its usage for secular and impulsive encounters and asymmetric supernovae the extensions presented in this paper are a next step toward efficiently modeling the evolution of complex multiple systems embedded in star clusters | [['we', 'extend', 'the', 'formalism', 'of', 'a', 'previous', 'paper', 'to', 'include', 'the', 'effects', 'of', 'flybys', 'and', 'instantaneous', 'perturbations', 'such', 'as', 'supernovae', 'on', 'the', 'longterm', 'secular', 'evolution', 'of', 'hierarchical', 'multiple', 'systems', 'with', 'an', 'arbitrary', 'number', 'of', 'bodies', 'and', 'hierarchy', 'provided', 'that', 'the', 'system', 'is', 'composed', 'of', 'nested', 'binary', 'orbits', 'to', 'model', 'secular', 'encounters', 'we', 'expand', 'the', 'hamiltonian', 'in', 'terms', 'of', 'the', 'ratio', 'of', 'the', 'separation', 'of', 'the', 'perturber', 'with', 'respect', 'to', 'the', 'barycentre', 'of', 'the', 'multiple', 'system', 'to', 'the', 'separation', 'of', 'the', 'widest', 'orbit', 'subsequently', 'we', 'integrate', 'over', 'the', 'perturber', 'orbit', 'numerically', 'or', 'analytically', 'we', 'verify', 'our', 'method', 'for', 'secular', 'encounters', 'and', 'illustrate', 'it', 'with', 'an', 'example', 'furthermore', 'we', 'describe', 'a', 'method', 'to', 'compute', 'instantaneous', 'orbital', 'changes', 'to', 'multiple', 'systems', 'such', 'as', 'asymmetric', 'supernovae', 'and', 'impulsive', 'encounters', 'the', 'secular', 'code', 'with', 'implementation', 'of', 'the', 'extensions', 'described', 'in', 'this', 'paper', 'is', 'publicly', 'available', 'within', 'amuse', 'and', 'we', 'provide', 'a', 'number', 'of', 'simple', 'example', 'scripts', 'to', 'illustrate', 'its', 'usage', 'for', 'secular', 'and', 'impulsive', 'encounters', 'and', 'asymmetric', 'supernovae', 'the', 'extensions', 'presented', 'in', 'this', 'paper', 'are', 'a', 'next', 'step', 'toward', 'efficiently', 'modeling', 'the', 'evolution', 'of', 'complex', 'multiple', 'systems', 'embedded', 'in', 'star', 'clusters']] | [-0.17307688037223953, 0.04604737829277417, -0.06732428016801996, 0.07912984939031703, -0.06201790592518024, -0.051964927156786286, 0.010717269180277463, 0.3685798880253588, -0.2658906436114702, -0.3165635469920998, 0.09114802789108287, -0.24339754036464978, -0.16625712446427793, 0.2173493899785543, -0.044766836879912314, 0.03288665662428254, 0.12639968095832976, 0.009549501306478745, -0.06247745879039529, -0.2663521844222741, 0.3438067589636131, 0.08130816373253061, 0.09933829431607318, -0.035521124016433474, 0.09523004369049143, 0.02117232683675504, -0.030944230417991356, -0.020420508406635736, -0.10985921550266256, 0.10886472583156466, 0.19813035194465067, 0.1461262672774053, 0.25261943846795787, -0.40727207794665327, -0.20166168948485247, 0.05887999513276642, 0.19298674055795756, 0.13543818745341513, -0.027799984425812038, -0.27345036513795473, 0.06648687873804261, -0.27454472504436006, -0.18052125701390367, -0.039253601774332986, 0.04840652770437901, 0.06536667788856892, -0.2682031406770631, 0.06220631267605049, 0.0836435790919769, 0.045579916452087706, -0.09946513740077956, -0.057796565549177746, -0.012230750277227852, 0.12776339225976738, 0.04021616302616753, -0.016817794183910054, 0.11602966939549773, -0.048162483332318165, -0.10021060438806652, 0.41531810764178273, -0.05366757013509551, -0.1659877241453937, 0.25565245122428465, -0.1408679620475478, -0.11698196216496409, 0.09551512719362333, 0.2469995849845951, 0.11909110471355899, -0.1522049613582391, 0.026888449984624224, 0.027649341283493764, 0.1547233058960848, 0.061543985317531295, 0.005122758386160938, 0.2514286183561849, 0.1590635850875368, 0.04038654248760913, 0.14154813984178646, -0.10391029085768687, -0.12879577033241751, -0.2677360391006455, -0.13057277483040775, -0.13030370136895666, -0.0074844125305272395, -0.06601825046238191, -0.17757577091348745, 0.37927777675651414, 0.16760507558337262, 0.1971867260102543, 0.04403069087301671, 0.3149884896032432, 0.10108031879457074, 0.049979025650749444, 0.08794984508616228, 0.23102800782409408, 0.12518436726093823, 0.07328267684344061, -0.2809384085253001, 0.03608630665437749, 0.012521552502788523] |
1,802.05717 | A model for AGN variability on multiple timescales | We present a framework to link and describe AGN variability on a wide range
of timescales, from days to billions of years. In particular, we concentrate on
the AGN variability features related to changes in black hole fuelling and
accretion rate. In our framework, the variability features observed in
different AGN at different timescales may be explained as realisations of the
same underlying statistical properties. In this context, we propose a model to
simulate the evolution of AGN light curves with time based on the probability
density function (PDF) and power spectral density (PSD) of the Eddington ratio
($L/L_{\rm Edd}$) distribution. Motivated by general galaxy population
properties, we propose that the PDF may be inspired by the $L/L_{\rm Edd}$
distribution function (ERDF), and that a single (or limited number of) ERDF+PSD
set may explain all observed variability features. After outlining the
framework and the model, we compile a set of variability measurements in terms
of structure function (SF) and magnitude difference. We then combine the
variability measurements on a SF plot ranging from days to Gyr. The proposed
framework enables constraints on the underlying PSD and the ability to link AGN
variability on different timescales, therefore providing new insights into AGN
variability and black hole growth phenomena.
| astro-ph.GA astro-ph.HE | we present a framework to link and describe agn variability on a wide range of timescales from days to billions of years in particular we concentrate on the agn variability features related to changes in black hole fuelling and accretion rate in our framework the variability features observed in different agn at different timescales may be explained as realisations of the same underlying statistical properties in this context we propose a model to simulate the evolution of agn light curves with time based on the probability density function pdf and power spectral density psd of the eddington ratio ll_rm edd distribution motivated by general galaxy population properties we propose that the pdf may be inspired by the ll_rm edd distribution function erdf and that a single or limited number of erdfpsd set may explain all observed variability features after outlining the framework and the model we compile a set of variability measurements in terms of structure function sf and magnitude difference we then combine the variability measurements on a sf plot ranging from days to gyr the proposed framework enables constraints on the underlying psd and the ability to link agn variability on different timescales therefore providing new insights into agn variability and black hole growth phenomena | [['we', 'present', 'a', 'framework', 'to', 'link', 'and', 'describe', 'agn', 'variability', 'on', 'a', 'wide', 'range', 'of', 'timescales', 'from', 'days', 'to', 'billions', 'of', 'years', 'in', 'particular', 'we', 'concentrate', 'on', 'the', 'agn', 'variability', 'features', 'related', 'to', 'changes', 'in', 'black', 'hole', 'fuelling', 'and', 'accretion', 'rate', 'in', 'our', 'framework', 'the', 'variability', 'features', 'observed', 'in', 'different', 'agn', 'at', 'different', 'timescales', 'may', 'be', 'explained', 'as', 'realisations', 'of', 'the', 'same', 'underlying', 'statistical', 'properties', 'in', 'this', 'context', 'we', 'propose', 'a', 'model', 'to', 'simulate', 'the', 'evolution', 'of', 'agn', 'light', 'curves', 'with', 'time', 'based', 'on', 'the', 'probability', 'density', 'function', 'pdf', 'and', 'power', 'spectral', 'density', 'psd', 'of', 'the', 'eddington', 'ratio', 'll_rm', 'edd', 'distribution', 'motivated', 'by', 'general', 'galaxy', 'population', 'properties', 'we', 'propose', 'that', 'the', 'pdf', 'may', 'be', 'inspired', 'by', 'the', 'll_rm', 'edd', 'distribution', 'function', 'erdf', 'and', 'that', 'a', 'single', 'or', 'limited', 'number', 'of', 'erdfpsd', 'set', 'may', 'explain', 'all', 'observed', 'variability', 'features', 'after', 'outlining', 'the', 'framework', 'and', 'the', 'model', 'we', 'compile', 'a', 'set', 'of', 'variability', 'measurements', 'in', 'terms', 'of', 'structure', 'function', 'sf', 'and', 'magnitude', 'difference', 'we', 'then', 'combine', 'the', 'variability', 'measurements', 'on', 'a', 'sf', 'plot', 'ranging', 'from', 'days', 'to', 'gyr', 'the', 'proposed', 'framework', 'enables', 'constraints', 'on', 'the', 'underlying', 'psd', 'and', 'the', 'ability', 'to', 'link', 'agn', 'variability', 'on', 'different', 'timescales', 'therefore', 'providing', 'new', 'insights', 'into', 'agn', 'variability', 'and', 'black', 'hole', 'growth', 'phenomena']] | [-0.0642335845442326, 0.07336065989186608, -0.10139054570627372, 0.13007032193720466, -0.0800667420070329, -0.07356458049701545, 0.07509743309245237, 0.4072352994721636, -0.22066186664589835, -0.3407830478515006, 0.08024319416947337, -0.2716835334815664, -0.08880007559392891, 0.2131568656576508, -0.07529801277904907, 0.01496367903598087, -0.008887146208525716, -0.0922217263831097, -0.06174809435717038, -0.23637107120108003, 0.3181924586765269, 0.059094012747699556, 0.242448309834287, 0.01295185799583865, 0.09589014637218427, -0.03145665262861955, -0.05857138182443467, -0.0013207433003823734, -0.14417324173389945, 0.07909468786305103, 0.2350002762328074, 0.18440155400126015, 0.2371449392544359, -0.3955137457662416, -0.2644113390842109, 0.08618596752255576, 0.14311307290731703, 0.02577149731929875, -0.03849988960640084, -0.2031023959014384, 0.056103204630170635, -0.2157690515199188, -0.09043003720891418, -0.0020942771496495357, 0.06103119193644091, 0.04156529021057192, -0.2192502480756957, 0.13614628524790762, 0.022570480052291335, 0.0447255005038262, -0.09784833128446514, -0.04995274481316124, -0.015466107964262512, 0.08572431683463487, 0.08481787805088335, 0.03782981139487922, 0.19266639467220284, -0.12524701917693198, -0.10257628077903347, 0.357574171427348, -0.06519496571317822, -0.06532825360038472, 0.1980328734351539, -0.20113319060900836, -0.16227807529559993, 0.12474764892221112, 0.24256558925590424, 0.12195226527271268, -0.1272483244993231, -0.002868523735336019, 0.004954244239590339, 0.26579826790839434, -0.020241072214913818, 0.08469307456806684, 0.29765273164053563, 0.1618964971049951, -0.011401090676019203, 0.1112227523727659, -0.16411780860745212, -0.06491135204554473, -0.2664974767271682, -0.04167909090728183, -0.1331939601997203, 0.10861333979528795, -0.12467771452270647, -0.11170634970145789, 0.46296102085684254, 0.13962657681668575, 0.2751516602951491, 0.08300999428362595, 0.2723026630238096, 0.12484838203224692, 0.05727501761041654, 0.0887712495711189, 0.24761700296313366, 0.11204447288595104, 0.06972278926286449, -0.23842626383406046, 0.11316715268072337, 0.031202667320454583] |
1,802.05718 | An Analytical Portrait of Binary Mergers in Hierarchical Triple Systems | With better statistics and precision, eccentricity could prove to be a useful
tool for understanding the origin and environment of binary black holes.
Hierarchical triples in particular, which might be abundant in globular
clusters and galactic nuclei, could generate observably large eccentricity at
LIGO and future gravitational wave detectors. Measuring the eccentricity
distribution accurately could help us probe the background and the formation of
the mergers. In this paper we continue our previous investigation and improve
our semi-analytical description of the eccentricity distribution of mergers
hierarchical triple systems. Our result, which further reduces the reliance on
numerical simulations, could be useful for statistically distinguishing
different formation channels of observed binary mergers.
| gr-qc astro-ph.HE hep-ph hep-th | with better statistics and precision eccentricity could prove to be a useful tool for understanding the origin and environment of binary black holes hierarchical triples in particular which might be abundant in globular clusters and galactic nuclei could generate observably large eccentricity at ligo and future gravitational wave detectors measuring the eccentricity distribution accurately could help us probe the background and the formation of the mergers in this paper we continue our previous investigation and improve our semianalytical description of the eccentricity distribution of mergers hierarchical triple systems our result which further reduces the reliance on numerical simulations could be useful for statistically distinguishing different formation channels of observed binary mergers | [['with', 'better', 'statistics', 'and', 'precision', 'eccentricity', 'could', 'prove', 'to', 'be', 'a', 'useful', 'tool', 'for', 'understanding', 'the', 'origin', 'and', 'environment', 'of', 'binary', 'black', 'holes', 'hierarchical', 'triples', 'in', 'particular', 'which', 'might', 'be', 'abundant', 'in', 'globular', 'clusters', 'and', 'galactic', 'nuclei', 'could', 'generate', 'observably', 'large', 'eccentricity', 'at', 'ligo', 'and', 'future', 'gravitational', 'wave', 'detectors', 'measuring', 'the', 'eccentricity', 'distribution', 'accurately', 'could', 'help', 'us', 'probe', 'the', 'background', 'and', 'the', 'formation', 'of', 'the', 'mergers', 'in', 'this', 'paper', 'we', 'continue', 'our', 'previous', 'investigation', 'and', 'improve', 'our', 'semianalytical', 'description', 'of', 'the', 'eccentricity', 'distribution', 'of', 'mergers', 'hierarchical', 'triple', 'systems', 'our', 'result', 'which', 'further', 'reduces', 'the', 'reliance', 'on', 'numerical', 'simulations', 'could', 'be', 'useful', 'for', 'statistically', 'distinguishing', 'different', 'formation', 'channels', 'of', 'observed', 'binary', 'mergers']] | [-0.1045423510929083, 0.11406459028178172, -0.12076067546516792, 0.13965789065276785, -0.11429363320296344, -0.03802864230028144, 0.012045720626751112, 0.3429122053858665, -0.19698562890475801, -0.3661049356105158, 0.038209929396314464, -0.2734237203022113, -0.10090848954125971, 0.23439102352236038, -0.02832361999563537, 0.0376263266714575, 0.1652014498621947, -0.061452204663608526, -0.030656253222611035, -0.2556279462233588, 0.30175545458841296, 0.15877866568798954, 0.16637169086449854, 0.0003009225673939999, 0.0051752749520043535, 0.007405409069211634, -0.04707173030689225, -0.024081807070713793, -0.15276262370490906, 0.08161789481580543, 0.2931226516092146, 0.1504550678668615, 0.20154671933132787, -0.4069746076590843, -0.24053994960965472, 0.12406993538627888, 0.22167472690679468, 0.13965482577505345, -0.10813468716396774, -0.29345502558390835, 0.08969846214450947, -0.25033441546733853, -0.17839715117169125, -0.06286151783419186, 0.03728627926158207, 0.044057383750007395, -0.27663326194207816, 0.10824684351514857, 0.07590587682464067, -0.05066515646375682, -0.07076441608201545, -0.09364296035497105, -0.028615556365751603, 0.12235071645055369, 0.013627049890724389, 0.06119531966108191, 0.17474506820996735, -0.06614293938299205, -0.10941147380969948, 0.35749490481910406, -0.02297078220693915, -0.1280479860987078, 0.24903137060847166, -0.22355789226387535, -0.20205225961635243, 0.08832447935600539, 0.26234160856603905, 0.10538793968556968, -0.13824209453420597, -0.020801804216184258, 0.060685149188544646, 0.20123114995658398, 0.09043659016213103, 0.06089287243682791, 0.4128443181917474, 0.18523487464004607, 0.00744566074698358, 0.0701707866806369, -0.12445920931284425, -0.03594911524287618, -0.1972559344879276, -0.11558479802716556, -0.13217121120206676, 0.06337461489510224, -0.16523871308969762, -0.1141369847396204, 0.3440613036153016, 0.16717824810981616, 0.1835490293435853, 0.023873428711332044, 0.2661327357496817, 0.06482229510590702, 0.042460021437019914, 0.04944380237678955, 0.3100297127825183, 0.1283801467753611, 0.04070967924151871, -0.23128232363242288, 0.11355381658267197, -0.02659719253193822] |
1,802.05719 | Generic emergence of objectivity of observables in infinite dimensions | Quantum Darwinism posits that information becomes objective whenever multiple
observers indirectly probe a quantum system by each measuring a fraction of the
environment. It was recently shown that objectivity of observables emerges
generically from the mathematical structure of quantum mechanics, whenever the
system of interest has finite dimensions and the number of environment
fragments is large [F. G. S. L. Brand\~ao, M. Piani, and P. Horodecki, Nature
Commun. 6, 7908 (2015)]. Despite the importance of this result, it necessarily
excludes many practical systems of interest that are infinite-dimensional,
including harmonic oscillators. Extending the study of Quantum Darwinism to
infinite dimensions is a nontrivial task: we tackle it here by using a modified
diamond norm, suitable to quantify the distinguishability of channels in
infinite dimensions. We prove two theorems that bound the emergence of
objectivity, first for finite energy systems, and then for systems that can
only be prepared in states with an exponential energy cut-off. We show that the
latter class of states includes any bounded-energy subset of single-mode
Gaussian states.
| quant-ph hep-th math-ph math.MP physics.hist-ph | quantum darwinism posits that information becomes objective whenever multiple observers indirectly probe a quantum system by each measuring a fraction of the environment it was recently shown that objectivity of observables emerges generically from the mathematical structure of quantum mechanics whenever the system of interest has finite dimensions and the number of environment fragments is large f g s l brandao m piani and p horodecki nature commun 6 7908 2015 despite the importance of this result it necessarily excludes many practical systems of interest that are infinitedimensional including harmonic oscillators extending the study of quantum darwinism to infinite dimensions is a nontrivial task we tackle it here by using a modified diamond norm suitable to quantify the distinguishability of channels in infinite dimensions we prove two theorems that bound the emergence of objectivity first for finite energy systems and then for systems that can only be prepared in states with an exponential energy cutoff we show that the latter class of states includes any boundedenergy subset of singlemode gaussian states | [['quantum', 'darwinism', 'posits', 'that', 'information', 'becomes', 'objective', 'whenever', 'multiple', 'observers', 'indirectly', 'probe', 'a', 'quantum', 'system', 'by', 'each', 'measuring', 'a', 'fraction', 'of', 'the', 'environment', 'it', 'was', 'recently', 'shown', 'that', 'objectivity', 'of', 'observables', 'emerges', 'generically', 'from', 'the', 'mathematical', 'structure', 'of', 'quantum', 'mechanics', 'whenever', 'the', 'system', 'of', 'interest', 'has', 'finite', 'dimensions', 'and', 'the', 'number', 'of', 'environment', 'fragments', 'is', 'large', 'f', 'g', 's', 'l', 'brandao', 'm', 'piani', 'and', 'p', 'horodecki', 'nature', 'commun', '6', '7908', '2015', 'despite', 'the', 'importance', 'of', 'this', 'result', 'it', 'necessarily', 'excludes', 'many', 'practical', 'systems', 'of', 'interest', 'that', 'are', 'infinitedimensional', 'including', 'harmonic', 'oscillators', 'extending', 'the', 'study', 'of', 'quantum', 'darwinism', 'to', 'infinite', 'dimensions', 'is', 'a', 'nontrivial', 'task', 'we', 'tackle', 'it', 'here', 'by', 'using', 'a', 'modified', 'diamond', 'norm', 'suitable', 'to', 'quantify', 'the', 'distinguishability', 'of', 'channels', 'in', 'infinite', 'dimensions', 'we', 'prove', 'two', 'theorems', 'that', 'bound', 'the', 'emergence', 'of', 'objectivity', 'first', 'for', 'finite', 'energy', 'systems', 'and', 'then', 'for', 'systems', 'that', 'can', 'only', 'be', 'prepared', 'in', 'states', 'with', 'an', 'exponential', 'energy', 'cutoff', 'we', 'show', 'that', 'the', 'latter', 'class', 'of', 'states', 'includes', 'any', 'boundedenergy', 'subset', 'of', 'singlemode', 'gaussian', 'states']] | [-0.1505327180130681, 0.18842742121307632, -0.10514479477441295, 0.04369136665379355, -0.01493613495327094, -0.1753315606373636, 0.03288307540830882, 0.3001556061263032, -0.2405857782043955, -0.2749155250542304, 0.05779028427992564, -0.26139117095564657, -0.14525271316113716, 0.1909835403333144, -0.0808233387357391, 0.06949362640049966, 0.07223337129963671, 0.044560584858717285, -0.02262488136150162, -0.2521379469832241, 0.3277452003114912, 0.024501807798686274, 0.26451909331714407, 0.049328886121785376, 0.12578556911184396, 0.02966690134421429, 0.02960340008002651, 0.02923576835104648, -0.11180219128034558, 0.09885105345268076, 0.2767498723436695, 0.1384285581736442, 0.30248830690021244, -0.3582466951735756, -0.24258333049878916, 0.14652394767686286, 0.10191586547435316, 0.1229592463494662, -0.0009908246759818319, -0.3005219693405225, 0.06899202754447127, -0.1756205822876997, -0.14211549082332675, -0.07572039224974372, 0.0794907889493248, -0.03481807477416142, -0.2399121397123535, 0.07030683884616284, 0.12542264830485425, 0.04254191870088963, -0.019121348231291288, -0.07139795295318917, -0.023680849580149002, 0.09128824629245655, -0.020783409109914348, 0.001499792839646997, 0.11311062498511198, -0.09818649225019138, -0.14530239159186534, 0.3540363593300914, -0.024495426314773368, -0.18847468195154388, 0.1991933457334252, -0.14329636571928858, -0.14966385342618999, 0.09219407904345323, 0.11950002461123993, 0.09015953999889248, -0.1398291827956735, 0.1590577436819919, -0.0658934016355916, 0.18473908637020298, 0.08255719706854399, 0.10279210637707044, 0.17856744677992537, 0.10314056246664703, 0.07593053895671961, 0.1614843745216015, -0.014767132674836937, -0.11965967552352916, -0.31779772615204016, -0.18948738403782686, -0.248230307962855, 0.10434166473158471, -0.05102849541863714, -0.12882300532912588, 0.3416465409812244, 0.11032119238310877, 0.1674445378484533, 0.019887205302331817, 0.22871979534187736, 0.10644188237561406, 0.026718301947146434, 0.08661983626640422, 0.21864573782693375, 0.1803864793769796, 0.046998912407605745, -0.2052532189676319, 0.029821034972829855, 0.05128883178181508] |
1,802.0572 | Obscured star-formation in bright z ~ 7 Lyman-break galaxies | We present Atacama Large Millimeter/Submillimeter Array observations of the
rest-frame far-infrared (FIR) dust continuum emission of six bright Lyman-break
galaxies (LBGs) at $z \simeq 7$. One LBG is detected ($5.2\sigma$ at peak
emission), while the others remain individually undetected at the $3\sigma$
level. The average FIR luminosity of the sample is found to be $L_{\rm FIR}
\simeq 2 \times 10^{11}\,{\rm L}_{\odot}$, corresponding to an obscured
star-formation rate (SFR) that is comparable to that inferred from the
unobscured UV emission. In comparison to the infrared excess (IRX$\,=L_{\rm
FIR}/L_{\rm UV}$)-$\beta$ relation, our results are consistent with a
Calzetti-like attenuation law (assuming a dust temperature of T = 40-50 K). We
find a physical offset of 3 kpc between the dust continuum emission and the
rest-frame UV light probed by Hubble Space Telescope imaging for galaxy ID65666
at $z = 7.17^{+0.09}_{-0.06}$. The offset is suggestive of an inhomogeneous
dust distribution, where 75% of the total star formation activity (SFR$
\,\simeq 70\,{\rm M}_{\odot}/{\rm yr}$) of the galaxy is completely obscured.
Our results provide direct evidence that dust obscuration plays a key role in
shaping the bright-end of the observed rest-frame UV luminosity function at $z
\simeq 7$, in agreement with cosmological galaxy formation simulations. The
existence of a heavily-obscured component of galaxy ID65666 indicates that
dusty star-forming regions, or even entire galaxies, that are "UV-dark" are
significant even in the $z \simeq 7$ galaxy population.
| astro-ph.GA | we present atacama large millimetersubmillimeter array observations of the restframe farinfrared fir dust continuum emission of six bright lymanbreak galaxies lbgs at z simeq 7 one lbg is detected 52sigma at peak emission while the others remain individually undetected at the 3sigma level the average fir luminosity of the sample is found to be l_rm fir simeq 2 times 1011rm l_odot corresponding to an obscured starformation rate sfr that is comparable to that inferred from the unobscured uv emission in comparison to the infrared excess irxl_rm firl_rm uvbeta relation our results are consistent with a calzettilike attenuation law assuming a dust temperature of t 4050 k we find a physical offset of 3 kpc between the dust continuum emission and the restframe uv light probed by hubble space telescope imaging for galaxy id65666 at z 717009_006 the offset is suggestive of an inhomogeneous dust distribution where 75 of the total star formation activity sfr simeq 70rm m_odotrm yr of the galaxy is completely obscured our results provide direct evidence that dust obscuration plays a key role in shaping the brightend of the observed restframe uv luminosity function at z simeq 7 in agreement with cosmological galaxy formation simulations the existence of a heavilyobscured component of galaxy id65666 indicates that dusty starforming regions or even entire galaxies that are uvdark are significant even in the z simeq 7 galaxy population | [['we', 'present', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'observations', 'of', 'the', 'restframe', 'farinfrared', 'fir', 'dust', 'continuum', 'emission', 'of', 'six', 'bright', 'lymanbreak', 'galaxies', 'lbgs', 'at', 'z', 'simeq', '7', 'one', 'lbg', 'is', 'detected', '52sigma', 'at', 'peak', 'emission', 'while', 'the', 'others', 'remain', 'individually', 'undetected', 'at', 'the', '3sigma', 'level', 'the', 'average', 'fir', 'luminosity', 'of', 'the', 'sample', 'is', 'found', 'to', 'be', 'l_rm', 'fir', 'simeq', '2', 'times', '1011rm', 'l_odot', 'corresponding', 'to', 'an', 'obscured', 'starformation', 'rate', 'sfr', 'that', 'is', 'comparable', 'to', 'that', 'inferred', 'from', 'the', 'unobscured', 'uv', 'emission', 'in', 'comparison', 'to', 'the', 'infrared', 'excess', 'irxl_rm', 'firl_rm', 'uvbeta', 'relation', 'our', 'results', 'are', 'consistent', 'with', 'a', 'calzettilike', 'attenuation', 'law', 'assuming', 'a', 'dust', 'temperature', 'of', 't', '4050', 'k', 'we', 'find', 'a', 'physical', 'offset', 'of', '3', 'kpc', 'between', 'the', 'dust', 'continuum', 'emission', 'and', 'the', 'restframe', 'uv', 'light', 'probed', 'by', 'hubble', 'space', 'telescope', 'imaging', 'for', 'galaxy', 'id65666', 'at', 'z', '717009_006', 'the', 'offset', 'is', 'suggestive', 'of', 'an', 'inhomogeneous', 'dust', 'distribution', 'where', '75', 'of', 'the', 'total', 'star', 'formation', 'activity', 'sfr', 'simeq', '70rm', 'm_odotrm', 'yr', 'of', 'the', 'galaxy', 'is', 'completely', 'obscured', 'our', 'results', 'provide', 'direct', 'evidence', 'that', 'dust', 'obscuration', 'plays', 'a', 'key', 'role', 'in', 'shaping', 'the', 'brightend', 'of', 'the', 'observed', 'restframe', 'uv', 'luminosity', 'function', 'at', 'z', 'simeq', '7', 'in', 'agreement', 'with', 'cosmological', 'galaxy', 'formation', 'simulations', 'the', 'existence', 'of', 'a', 'heavilyobscured', 'component', 'of', 'galaxy', 'id65666', 'indicates', 'that', 'dusty', 'starforming', 'regions', 'or', 'even', 'entire', 'galaxies', 'that', 'are', 'uvdark', 'are', 'significant', 'even', 'in', 'the', 'z', 'simeq', '7', 'galaxy', 'population']] | [-0.0288186599458714, 0.0994362427855397, -0.033146254369579756, 0.12662234748744994, -0.04886900441879782, -0.0630756218107459, 0.027284961310215294, 0.5190774329390895, -0.08267112804426406, -0.3191200352227942, 0.03619252012378532, -0.334368309168972, 0.03960135106661361, 0.16341649255644314, 0.023621704914886923, -0.07532580970735482, -0.024101874138533468, -0.19959681399775805, -0.018159753255621268, -0.2868270864793738, 0.25741107194870294, 0.11052617418732194, 0.15404673203441727, -0.017580716623799383, 0.07680613941809522, -0.1423852682255121, -0.123284048521933, -0.07820656801265405, -0.18256863243353888, -0.004565625100693093, 0.2696406852136546, 0.09762545401802612, 0.208147257628575, -0.2712548481374016, -0.18632019325336985, 0.10130551486906977, 0.2169689640252446, -0.0177504502460277, -0.037682884596204676, -0.23149401492297214, 0.05365584932760734, -0.15054019081360356, -0.18169490529136573, 0.1771253119859711, 0.0683138619757554, -0.03565338165149502, -0.2506693194828084, 0.2304488273095778, -0.028437852464833466, 0.12307312230541968, -0.10687488369693804, -0.08808881723877426, -0.12364024194761393, 0.012709749442308039, -0.007992213381028363, 0.1737397294947011, 0.2575306317731404, -0.18450044762685627, -0.006763995648048518, 0.37421127377916336, -0.09364994715130784, 0.11519214489618358, 0.20832222533013436, -0.261975874508326, -0.19651223197078224, 0.22798125504520242, 0.10501549588599882, 0.06536046082468838, -0.14429085204361325, 0.02053275803963324, -0.04376643447146956, 0.318387998103043, 0.032710858535088365, 0.12966572446229835, 0.36262495103271286, 0.08928853456576193, 0.04551563978679645, 0.06211760838885662, -0.26188457543928295, 0.0283277188573918, -0.2920546214432443, -0.055833756034116305, -0.13913712018553687, 0.18158586565697474, -0.21772079493761984, -0.0475086475750682, 0.26872787097022105, 0.11246264894804062, 0.25919875225068945, 0.15923786630844614, 0.280980165941315, 0.10211611055766938, 0.1230444036311399, 0.13301690071487107, 0.32713978596641413, 0.14884910033180507, 0.044749016485139397, -0.26042411194679915, 0.03345757928173655, -0.014530478940646043] |
1,802.05721 | Single lepton charge asymmetries in $t \bar t$ and $t \bar t \gamma$
production at the LHC | We discuss lepton charge asymmetries in $t \bar t$ and $t \bar t \gamma$
production at the LHC, which can be measured in the semileptonic decay channel
$t \bar t \to W^+ b \, W^- \bar b \to \ell^+ \nu b \, q \bar q' \bar b$ (or the
charge conjugate). Considering several variants of a new physics scenario with
a light colour octet, it is seen that for $t \bar t$ these asymmetries may have
a sensitivity competitive with the dilepton asymmetry already measured. For $t
\bar t \gamma$ the new leptonic asymmetries, as well as the $t \bar t$ charge
asymmetry, will reach their full potential with the high luminosity LHC
upgrade. These asymmetries can pinpoint deviations at the $3\sigma-4\sigma$
level for new physics scenarios where the charge asymmetries already measured
in $t \bar t$ production agree within $1\sigma$.
| hep-ph hep-ex | we discuss lepton charge asymmetries in t bar t and t bar t gamma production at the lhc which can be measured in the semileptonic decay channel t bar t to w b w bar b to ell nu b q bar q bar b or the charge conjugate considering several variants of a new physics scenario with a light colour octet it is seen that for t bar t these asymmetries may have a sensitivity competitive with the dilepton asymmetry already measured for t bar t gamma the new leptonic asymmetries as well as the t bar t charge asymmetry will reach their full potential with the high luminosity lhc upgrade these asymmetries can pinpoint deviations at the 3sigma4sigma level for new physics scenarios where the charge asymmetries already measured in t bar t production agree within 1sigma | [['we', 'discuss', 'lepton', 'charge', 'asymmetries', 'in', 't', 'bar', 't', 'and', 't', 'bar', 't', 'gamma', 'production', 'at', 'the', 'lhc', 'which', 'can', 'be', 'measured', 'in', 'the', 'semileptonic', 'decay', 'channel', 't', 'bar', 't', 'to', 'w', 'b', 'w', 'bar', 'b', 'to', 'ell', 'nu', 'b', 'q', 'bar', 'q', 'bar', 'b', 'or', 'the', 'charge', 'conjugate', 'considering', 'several', 'variants', 'of', 'a', 'new', 'physics', 'scenario', 'with', 'a', 'light', 'colour', 'octet', 'it', 'is', 'seen', 'that', 'for', 't', 'bar', 't', 'these', 'asymmetries', 'may', 'have', 'a', 'sensitivity', 'competitive', 'with', 'the', 'dilepton', 'asymmetry', 'already', 'measured', 'for', 't', 'bar', 't', 'gamma', 'the', 'new', 'leptonic', 'asymmetries', 'as', 'well', 'as', 'the', 't', 'bar', 't', 'charge', 'asymmetry', 'will', 'reach', 'their', 'full', 'potential', 'with', 'the', 'high', 'luminosity', 'lhc', 'upgrade', 'these', 'asymmetries', 'can', 'pinpoint', 'deviations', 'at', 'the', '3sigma4sigma', 'level', 'for', 'new', 'physics', 'scenarios', 'where', 'the', 'charge', 'asymmetries', 'already', 'measured', 'in', 't', 'bar', 't', 'production', 'agree', 'within', '1sigma']] | [-0.09810196663581318, 0.25717602114749255, -0.053108746862615186, 0.08944272956217927, -0.02225931676225268, -0.21368851930425642, 0.08057228169109164, 0.3088630869073405, -0.3004857310288244, -0.261977232577239, -0.04876243923505996, -0.3125952525372557, 0.08718433089574411, 0.09327135104250511, 0.07579339157057953, 0.05992938501746963, 0.03227052754863239, 0.0251980124162041, -0.07881771959866926, -0.19198768969169624, 0.18508388209257196, -0.006209949873180108, 0.12121904500686437, 0.08900967370316708, -0.03525774138175594, -0.03411738151724605, -0.06294865109840501, -0.022810538212279623, -0.1869324194370512, -0.08703787600715383, 0.23999285622895192, 0.09428599390874218, 0.0712861444586687, -0.28871534399272836, -0.07441503554582596, 0.16829676819603434, 0.17408487682478677, 0.013358546544047301, -0.051042941614998866, -0.26270433608442545, 0.15829631587718246, -0.19665993642892768, -0.1035173798395361, -0.04668367627954526, 0.1581040771021474, -0.06073412906190903, -0.3888017678794136, 0.09911744851659206, 0.006029402650390222, 0.04239033146178443, 0.0701525159039461, -0.27913417406681684, -0.09643996479626236, 0.01590408946106063, 0.07461300785418787, 0.21078569449508636, 0.22064625449719832, -0.16911532078608335, -0.1754789464996471, 0.3262554936432581, -0.1329686315847467, -0.14296420133277346, 0.1821494227406743, -0.3182088603573791, -0.1409452474816776, 0.09419704520431675, 0.2001330970163397, 0.07187067451987335, -0.1250476567543668, 0.19329605797572036, -0.006669758410333729, 0.06479004353097231, 0.13172047714729584, 0.0930044273041832, 0.2252157452460144, 0.1542850781128266, 0.010765819895757938, 0.014589454834650961, -0.1651154914368346, 0.011409596570184548, -0.45741494422570783, -0.12933877223714008, -0.026088385092322346, 0.10180569590210058, -0.038401050707421655, -0.008690608960154245, 0.3385098448304607, 0.027779140520552775, 0.3392777594958814, -0.01037310624056288, 0.2645643296971475, 0.06494969501923904, 0.12335626495559868, 0.10730044077746838, 0.23385995981223184, 0.1912805715562414, 0.17633684591906104, -0.31101341761662055, 0.07771016805174781, -0.040909497569844445] |
1,802.05722 | Seesaw roadmap to neutrino mass and dark matter | We describe the many pathways to generate Majorana and Dirac neutrino mass
through generalized dimension-5 operators a la Weinberg. The presence of new
scalars beyond the Standard Model Higgs doublet implies new possible field
contractions, which are required in the case of Dirac neutrinos. We also notice
that, in the Dirac neutrino case, the extra symmetries needed to ensure the
Dirac nature of neutrinos can also be made responsible for stability of dark
matter.
| hep-ph | we describe the many pathways to generate majorana and dirac neutrino mass through generalized dimension5 operators a la weinberg the presence of new scalars beyond the standard model higgs doublet implies new possible field contractions which are required in the case of dirac neutrinos we also notice that in the dirac neutrino case the extra symmetries needed to ensure the dirac nature of neutrinos can also be made responsible for stability of dark matter | [['we', 'describe', 'the', 'many', 'pathways', 'to', 'generate', 'majorana', 'and', 'dirac', 'neutrino', 'mass', 'through', 'generalized', 'dimension5', 'operators', 'a', 'la', 'weinberg', 'the', 'presence', 'of', 'new', 'scalars', 'beyond', 'the', 'standard', 'model', 'higgs', 'doublet', 'implies', 'new', 'possible', 'field', 'contractions', 'which', 'are', 'required', 'in', 'the', 'case', 'of', 'dirac', 'neutrinos', 'we', 'also', 'notice', 'that', 'in', 'the', 'dirac', 'neutrino', 'case', 'the', 'extra', 'symmetries', 'needed', 'to', 'ensure', 'the', 'dirac', 'nature', 'of', 'neutrinos', 'can', 'also', 'be', 'made', 'responsible', 'for', 'stability', 'of', 'dark', 'matter']] | [-0.13726356706103762, 0.2723056208782804, -0.007815087944067814, 0.20399807891934305, -0.1290935034567893, -0.17150908089998002, 0.03430435079074389, 0.28079935865527067, -0.20910307819753685, -0.297737847057146, -0.014040018392512826, -0.254774240361577, -0.133672722111884, 0.14169013409283818, 0.013776001608552964, 0.03306092146777775, 0.0026610517194746316, 0.011707226040999632, -0.08480562008618428, -0.2695941329820434, 0.36648935170189756, 0.0472294390878036, 0.1919925604393152, 0.06587158560727698, 0.05927730833708837, -0.023467285111798224, 0.0032932854484061936, -0.11907527211902512, -0.046590473720464834, 0.05924522998818272, 0.15540942555998224, 0.06065548733631904, 0.11369482745303193, -0.42141316748048, -0.20145081269328255, 0.2041517978634786, 0.18561994732590392, 0.10429438562100954, -0.10794335630143413, -0.33589338452706263, 0.07750461607970097, -0.1953562513627804, -0.1944795326279426, -0.09945012647910295, -0.12321825699748572, -0.11253731768984171, -0.30326563341392054, 0.07160274963747282, -0.016191836559792627, -0.050830827723886515, -0.028376985108479857, -0.14850245514330832, -0.09363276979609116, 0.04000092645150584, 0.16439936912502162, -0.10873320432556038, 0.0768718389869743, -0.15444195592961577, -0.12381326650722406, 0.46900025434159626, -0.12192169544790443, -0.19482202087591932, 0.13756540518354726, -0.13230625600428195, -0.13757483546017996, 0.11005138454807771, 0.1253799517714494, 0.06819290945281249, -0.17973243630321295, 0.17345426512199352, -0.08400030095583282, 0.1163981717010658, 0.06433066004899808, 0.07479038336817678, 0.32145814577469956, 0.1299180538217361, 0.12742955974425893, -0.022377112743482495, -0.06800583489490925, -0.04718189869733603, -0.4203306375813947, -0.21206897359366553, -0.1040273526387692, 0.05237179722737621, -0.05690785618542184, -0.13798490559329857, 0.4504086311050766, 0.19196503433851977, 0.15273374392072092, -0.05439557868049707, 0.20745010471374198, 0.0905137334799243, 0.1050811798085232, 0.04708415940655647, 0.3164975608485071, 0.1860141521319747, 0.13833338983130414, -0.2396111269733189, -0.07666622335720505, 0.11682904407230986] |
1,802.05723 | Relativistic properties of a molecule: energy, linear momentum, angular
momentum and boost momentum to order $1/c^2$ | We give an explicit and general description of the energy, linear momentum,
angular momentum and boost momentum of a molecule to order $1/c^2$, where it
necessary to take account of kinetic contributions made by the electrons and
nuclei as well as electromagnetic contributions made by the intramolecular
field. A wealth of interesting subtleties are encountered that are not seen at
order $1/c^0$, including relativistic Hall shifts, anomalous velocities and
hidden momenta. Some of these have well known analogues in solid state physics.
| physics.chem-ph quant-ph | we give an explicit and general description of the energy linear momentum angular momentum and boost momentum of a molecule to order 1c2 where it necessary to take account of kinetic contributions made by the electrons and nuclei as well as electromagnetic contributions made by the intramolecular field a wealth of interesting subtleties are encountered that are not seen at order 1c0 including relativistic hall shifts anomalous velocities and hidden momenta some of these have well known analogues in solid state physics | [['we', 'give', 'an', 'explicit', 'and', 'general', 'description', 'of', 'the', 'energy', 'linear', 'momentum', 'angular', 'momentum', 'and', 'boost', 'momentum', 'of', 'a', 'molecule', 'to', 'order', '1c2', 'where', 'it', 'necessary', 'to', 'take', 'account', 'of', 'kinetic', 'contributions', 'made', 'by', 'the', 'electrons', 'and', 'nuclei', 'as', 'well', 'as', 'electromagnetic', 'contributions', 'made', 'by', 'the', 'intramolecular', 'field', 'a', 'wealth', 'of', 'interesting', 'subtleties', 'are', 'encountered', 'that', 'are', 'not', 'seen', 'at', 'order', '1c0', 'including', 'relativistic', 'hall', 'shifts', 'anomalous', 'velocities', 'and', 'hidden', 'momenta', 'some', 'of', 'these', 'have', 'well', 'known', 'analogues', 'in', 'solid', 'state', 'physics']] | [-0.10892131320831207, 0.19902665811614276, -0.0592540488805531, 0.12116496448927536, -0.09406475965274362, -0.09106686356954458, -0.006382273717374518, 0.35407844987675186, -0.24862249175699927, -0.3382146783263945, 0.02143515908676086, -0.26010226938453296, -0.06241647343196702, 0.18356570126715957, 0.031364496490668234, 0.04194416428302846, -0.004095918271781468, 0.029740841184720035, -0.04958380581299979, -0.17602232217976096, 0.31321059192371803, 0.07232235126742502, 0.18172414373697304, 0.08231441201869308, 0.14116413766381944, 0.004526652256594744, -0.022535133277770222, 0.046037948060008445, -0.12835602858929013, 0.05252294921566073, 0.26275783063980135, -0.020900752182436606, 0.20246999950159522, -0.45856021062993424, -0.19429135518489268, 0.047754639829225023, 0.14212748194226948, 0.15511327177831313, -0.06251545484932339, -0.2579630671705051, -0.04729415610341764, -0.20113820571838537, -0.16611402186496957, -0.1791060131508857, 0.032584927909405585, 0.03642558833447898, -0.2263485211879015, 0.09410475732804072, 0.09562698196869616, 0.03487419567593351, -0.05204636580878642, -0.20430842172865551, -0.05280916471738459, 0.11061311571677102, 0.11905874607221383, 0.033132428808773796, 0.11632947809142401, -0.15719917598152078, -0.12098593293780052, 0.42894199086216894, 0.01094387155650865, -0.18131331486127725, 0.17130925974854064, -0.19185376452372932, -0.1018801490157252, 0.19751341956690316, 0.172020453414539, 0.07319893764130339, -0.13070898797226752, 0.0701157500393825, 0.000832995536123834, 0.09877809698171006, 0.0666962325169773, 0.14477384391754708, 0.22522527108922963, 0.06105626749283657, -0.009340974008210184, 0.09969260035900444, -0.07962294473460443, -0.1009485380178908, -0.34305013746602414, -0.17094220548141292, -0.15481747839054683, 0.09920841538103825, -0.017596217645183147, -0.10904201233714092, 0.3455006060213214, 0.09973936793167235, 0.22188230235947343, -0.027803856357023482, 0.28437394744194133, 0.11535151347960913, 0.07740962771676117, 0.08436105843553911, 0.2767947186086264, 0.18008769965140012, 0.11903223438506447, -0.22766805206221052, 0.019974344449753805, 0.04252046218323635] |
1,802.05724 | Dimension free properties of strong Muckenhoupt and Reverse H\"older
weights for Radon measures | In this paper we prove self-improvement properties of strong Muckenhoupt and
Reverse H\"older weights with respect to a general Radon measure on
$\mathbb{R}^n$. We derive our result via a Bellman function argument. An
important feature of our proof is that it uses only the Bellman function for
the one-dimensional problem for Lebesgue measure; with this function in hand,
we derive dimension free results for general measures and dimensions.
| math.CA | in this paper we prove selfimprovement properties of strong muckenhoupt and reverse holder weights with respect to a general radon measure on mathbbrn we derive our result via a bellman function argument an important feature of our proof is that it uses only the bellman function for the onedimensional problem for lebesgue measure with this function in hand we derive dimension free results for general measures and dimensions | [['in', 'this', 'paper', 'we', 'prove', 'selfimprovement', 'properties', 'of', 'strong', 'muckenhoupt', 'and', 'reverse', 'holder', 'weights', 'with', 'respect', 'to', 'a', 'general', 'radon', 'measure', 'on', 'mathbbrn', 'we', 'derive', 'our', 'result', 'via', 'a', 'bellman', 'function', 'argument', 'an', 'important', 'feature', 'of', 'our', 'proof', 'is', 'that', 'it', 'uses', 'only', 'the', 'bellman', 'function', 'for', 'the', 'onedimensional', 'problem', 'for', 'lebesgue', 'measure', 'with', 'this', 'function', 'in', 'hand', 'we', 'derive', 'dimension', 'free', 'results', 'for', 'general', 'measures', 'and', 'dimensions']] | [-0.033525359310100186, 0.026186164881330437, -0.1017749326865134, 0.0949972285392612, -0.08853191785815664, -0.13617066519937532, 0.048414011104100874, 0.37522019363720627, -0.3141754732042661, -0.17133702036174808, 0.10865809131920447, -0.27287874710472193, -0.1825893584994928, 0.21540605889715472, -0.12941859206458664, 0.08698299546342562, 0.054267717881456894, 0.021698430892737472, -0.08571226263815976, -0.23587368133046446, 0.4194270602482207, -0.0284760011743535, 0.25729659895467405, 0.10972443440079908, 0.14471928287692956, 0.05627240750746911, -0.017531555478104994, -0.029939812323872876, -0.22147661814629185, 0.170070203317343, 0.1946164436145302, 0.13323914261726552, 0.3229067734826137, -0.33871411874561624, -0.18501805949627476, 0.15440858216435813, 0.08726606909733485, 0.05593629155362792, -0.06560601578744621, -0.29528112608172435, 0.08767564259195591, -0.09783149924238815, -0.20076911788783036, -0.08490763837471604, 0.03417985765811275, 0.05149640444227878, -0.3567207898835049, 0.0913237823132316, 0.12440552465234171, 0.04208588576875627, -0.13393603770664947, -0.10606357314528021, 0.0599394824479104, 0.06571702053941622, 0.04719356238937882, 0.11300196517121923, 0.05670699532664217, -0.05380757059217157, -0.09375905705725446, 0.3065551027367987, -0.09415145871667739, -0.3047188977327417, 0.1824747033225482, -0.16131632012205527, -0.1748133149367812, 0.01322089195224073, 0.15513350966605632, 0.16363288747037158, -0.13910983239903169, 0.09845216943272937, -0.09889979455072213, 0.1591153062074548, 0.058854511500719714, 0.06761403163545765, 0.04493981720331837, 0.09070178424692987, 0.22772284050691216, 0.20303832604344385, -0.021695391531787154, -0.05331872001646415, -0.35099517225342636, -0.22832156787626445, -0.21724915898898067, 0.08996523030595306, -0.12474506079203873, -0.19570036977529526, 0.36724773333544897, 0.15216339691816008, 0.1744888467604623, 0.18730194952941553, 0.2421718115288326, 0.22059544301523334, 0.029856724263963234, 0.05857640320626909, 0.18032526526161852, 0.13476732528343907, 0.08070712584337932, -0.12490447061410283, 0.06497375435634133, 0.19833128989728935] |
1,802.05725 | A New Catalogue of Galactic Novae: Investigation of the MMRD relation &
Spatial Distribution | In this study, a new Galactic novae catalogue is introduced collecting
important parameters of these sources such as their light curve parameters,
classifications, full width half maximum (FWHM) of H$_\alpha$ line, distances
and interstellar reddening estimates. The catalogue is also published on a
website with a search option via a SQL query and an online tool to re-calculate
the distance/reddening of a nova from the derived reddening-distance relations.
Using the novae in the catalogue, the existence of a maximum magnitude-rate of
decline (MMRD) relation in the Galaxy is investigated. Although an MMRD
relation was obtained, a significant scattering in the resulting MMRD
distribution still exists. We suggest that the MMRD relation likely depends on
other parameters in addition to the decline time, as FWHM H$_\alpha$, the light
curve shapes. Using two different samples depending on the distances in the
catalogue and from the derived MMRD relation, the spatial distributions of
Galactic novae as a function of their spectral and speed classes were studied.
The investigation on the Galactic model parameters implies that best estimates
for the local outburst density are 3.6 and 4.2 $\times 10^{-10}$ pc$^{-3}$
yr$^{-1}$ with a scale height of 148 and 175 pc, while the space density
changes in the range of $0.4 - 16 \ \times 10^{-6}$ pc$^{-3}$. The local
outburst density and scale height obtained in this study infer that the disk
nova rate in the Galaxy is in the range of $\sim20$ to $\sim100$ yr$^{-1}$ with
an average estimate $67^{+21}_{-17}$ yr$^{-1}$.
| astro-ph.SR | in this study a new galactic novae catalogue is introduced collecting important parameters of these sources such as their light curve parameters classifications full width half maximum fwhm of h_alpha line distances and interstellar reddening estimates the catalogue is also published on a website with a search option via a sql query and an online tool to recalculate the distancereddening of a nova from the derived reddeningdistance relations using the novae in the catalogue the existence of a maximum magnituderate of decline mmrd relation in the galaxy is investigated although an mmrd relation was obtained a significant scattering in the resulting mmrd distribution still exists we suggest that the mmrd relation likely depends on other parameters in addition to the decline time as fwhm h_alpha the light curve shapes using two different samples depending on the distances in the catalogue and from the derived mmrd relation the spatial distributions of galactic novae as a function of their spectral and speed classes were studied the investigation on the galactic model parameters implies that best estimates for the local outburst density are 36 and 42 times 1010 pc3 yr1 with a scale height of 148 and 175 pc while the space density changes in the range of 04 16 times 106 pc3 the local outburst density and scale height obtained in this study infer that the disk nova rate in the galaxy is in the range of sim20 to sim100 yr1 with an average estimate 6721_17 yr1 | [['in', 'this', 'study', 'a', 'new', 'galactic', 'novae', 'catalogue', 'is', 'introduced', 'collecting', 'important', 'parameters', 'of', 'these', 'sources', 'such', 'as', 'their', 'light', 'curve', 'parameters', 'classifications', 'full', 'width', 'half', 'maximum', 'fwhm', 'of', 'h_alpha', 'line', 'distances', 'and', 'interstellar', 'reddening', 'estimates', 'the', 'catalogue', 'is', 'also', 'published', 'on', 'a', 'website', 'with', 'a', 'search', 'option', 'via', 'a', 'sql', 'query', 'and', 'an', 'online', 'tool', 'to', 'recalculate', 'the', 'distancereddening', 'of', 'a', 'nova', 'from', 'the', 'derived', 'reddeningdistance', 'relations', 'using', 'the', 'novae', 'in', 'the', 'catalogue', 'the', 'existence', 'of', 'a', 'maximum', 'magnituderate', 'of', 'decline', 'mmrd', 'relation', 'in', 'the', 'galaxy', 'is', 'investigated', 'although', 'an', 'mmrd', 'relation', 'was', 'obtained', 'a', 'significant', 'scattering', 'in', 'the', 'resulting', 'mmrd', 'distribution', 'still', 'exists', 'we', 'suggest', 'that', 'the', 'mmrd', 'relation', 'likely', 'depends', 'on', 'other', 'parameters', 'in', 'addition', 'to', 'the', 'decline', 'time', 'as', 'fwhm', 'h_alpha', 'the', 'light', 'curve', 'shapes', 'using', 'two', 'different', 'samples', 'depending', 'on', 'the', 'distances', 'in', 'the', 'catalogue', 'and', 'from', 'the', 'derived', 'mmrd', 'relation', 'the', 'spatial', 'distributions', 'of', 'galactic', 'novae', 'as', 'a', 'function', 'of', 'their', 'spectral', 'and', 'speed', 'classes', 'were', 'studied', 'the', 'investigation', 'on', 'the', 'galactic', 'model', 'parameters', 'implies', 'that', 'best', 'estimates', 'for', 'the', 'local', 'outburst', 'density', 'are', '36', 'and', '42', 'times', '1010', 'pc3', 'yr1', 'with', 'a', 'scale', 'height', 'of', '148', 'and', '175', 'pc', 'while', 'the', 'space', 'density', 'changes', 'in', 'the', 'range', 'of', '04', '16', 'times', '106', 'pc3', 'the', 'local', 'outburst', 'density', 'and', 'scale', 'height', 'obtained', 'in', 'this', 'study', 'infer', 'that', 'the', 'disk', 'nova', 'rate', 'in', 'the', 'galaxy', 'is', 'in', 'the', 'range', 'of', 'sim20', 'to', 'sim100', 'yr1', 'with', 'an', 'average', 'estimate', '6721_17', 'yr1']] | [-0.06420879417335706, 0.08026039446429153, -0.06812293024458846, 0.1090169432949939, -0.0600500208073769, -0.0459608532198262, 0.09486224357569285, 0.40331876568007663, -0.20067450732611058, -0.3699333610902464, 0.09007391499328717, -0.3123840740939114, -0.024708061209225217, 0.2462453379378784, -0.04465835324114525, 0.004836931379300115, 0.05294707580660393, -0.02431755195053096, -0.1103200740152283, -0.2586616655491048, 0.2468903595314468, 0.06017184515720325, 0.22950055331877264, -0.011866588958493266, 0.09003771319255409, -0.056931481935221274, -0.08036497734929816, -0.05947916638537894, -0.19319642884186236, 0.06517910995222098, 0.18960274250406894, 0.14019905906848107, 0.2066087231219395, -0.30868529548227297, -0.19731271306764178, 0.07493381483144447, 0.16520939879863691, 0.013728860520460016, -0.025281935601999036, -0.248627697911541, 0.0605715850478355, -0.17217189632547011, -0.15747534690165252, 0.09536281085504433, 0.09648003992548243, 0.06385805468684727, -0.20905594580967102, 0.14789167842834894, 0.014869273254708921, 0.10748407838209609, -0.1112732681060271, -0.10114378572611489, -0.049681801253502245, 0.07500619047367182, 0.03986286666753824, 0.11319728557699833, 0.1415340813185989, -0.12795553536566553, -0.03394555970243957, 0.3855913402054642, -0.10718423178129387, -0.020639919934481322, 0.15328937350795221, -0.18062764848296178, -0.12033444430992069, 0.13603250299233058, 0.16106383095602275, 0.09386269321641491, -0.2029750750924472, 0.019469771230999824, -0.04025644979861443, 0.24381259495686342, 0.043488201325507375, 0.06533046010664577, 0.22555588099525356, 0.11055758460921036, 0.035311843566291155, 0.0729683134592707, -0.22807428001075006, -0.05612761159541971, -0.26813229343655415, -0.09973156556952745, -0.14205376714750453, 0.08835942009902849, -0.18012846363132265, -0.10508780956643321, 0.3725483717442658, 0.11600925064107526, 0.2679025515814724, 0.0738536407942044, 0.24570792812146017, 0.11581320154001616, 0.08410454714302447, 0.13038172845568385, 0.30183851086442953, 0.1606668943413304, 0.08090239224982158, -0.20291624187738025, 0.10689775355839644, 0.029215789136675295] |
1,802.05726 | Fixed points, bounded orbits and attractors of planar flows | In this paper we provide a dynamical characterization of isolated invariant
continua which are global attractors for planar dissipative flows. As a
consequence, a sufficient condition for an isolated invariant continuum to be
either an attractor or a repeller is derived for general planar flows.
| math.DS | in this paper we provide a dynamical characterization of isolated invariant continua which are global attractors for planar dissipative flows as a consequence a sufficient condition for an isolated invariant continuum to be either an attractor or a repeller is derived for general planar flows | [['in', 'this', 'paper', 'we', 'provide', 'a', 'dynamical', 'characterization', 'of', 'isolated', 'invariant', 'continua', 'which', 'are', 'global', 'attractors', 'for', 'planar', 'dissipative', 'flows', 'as', 'a', 'consequence', 'a', 'sufficient', 'condition', 'for', 'an', 'isolated', 'invariant', 'continuum', 'to', 'be', 'either', 'an', 'attractor', 'or', 'a', 'repeller', 'is', 'derived', 'for', 'general', 'planar', 'flows']] | [-0.19615047603017755, 0.12039037248080907, -0.13610011430250274, 0.11502528108863366, -0.022564106269015206, -0.12635290485341102, -0.0410794228186003, 0.31554877683520316, -0.24640360636015732, -0.2119164644844002, 0.16973213801522635, -0.22190379049215053, -0.15383396080902054, 0.17544937963183554, -0.06862243202825387, 0.07442851610895661, 0.046412898915716344, 0.03296836804559765, -0.015833094343543054, -0.12240251224074099, 0.36675166255897945, -0.029389975799454585, 0.20245030396100547, 0.021702239176051484, 0.090834399457607, -0.05510657036470042, 0.030449397701563106, 0.12425183222318689, -0.21077627142270405, 0.05927328885429435, 0.20417952394475125, 0.06551664697730707, 0.1712545652149452, -0.4033376367141803, -0.24007314329759943, 0.16701465143511693, 0.1670901915989816, 0.13832491523224033, -0.08116462349684703, -0.25800214994491805, 0.12414613626897335, -0.12528663990346509, -0.25659286274264254, -0.08275756416842342, 0.07684528806971179, -0.0021012438875105646, -0.3484605329318179, 0.07607656673321293, 0.1902169011293962, 0.13476399057027366, -0.07882304100526703, 0.09151530655152681, -0.0866337925195694, 0.13895127003908986, -0.04884078761873146, 0.04134341833285159, 0.1072727570310235, -0.11577932341541682, -0.13260292760613893, 0.378128360129065, -0.09695563352304615, -0.26460406188335683, 0.2633196592279192, -0.07173025156888697, -0.1995111684418387, 0.18681418248969647, 0.182791765489512, 0.13755144151962465, -0.21682302432341707, 0.050889955792162156, -0.12742414110236697, 0.1096736987431844, 0.06820952992679344, 0.04645558584921269, 0.2330340454975764, 0.14326422369728486, 0.19459505687571235, 0.182843425970835, 0.022622539184521884, -0.06692001455359989, -0.3505436220930682, -0.14469963356128168, -0.1273318075678415, 0.1622259122836921, -0.04779820422538453, -0.2746579717430804, 0.3488618943012423, -0.013128522638645437, 0.2328631878313091, 0.06906747666135844, 0.27332893730037744, 0.1575073781229245, -0.01805194140308433, 0.1294676854689088, 0.23624582787354786, 0.13316027253038354, 0.03693437772906489, -0.11965815251072248, -0.033892547929038605, 0.13992742425244714] |
1,802.05727 | Long-range Coulomb Interaction effects on Topological Phase Transitions
between Semi-metals and Insulators | Topological states may be protected by a lattice symmetry in a class of
topological semi-metals. In three spatial dimensions, the Berry flux around
gapless excitations in momentum space defines a chirality concretely, so a
protecting symmetry may be referred to as a chiral symmetry. Prime examples
include Dirac semi-metal (DSM) in a distorted spinel, BiZnSiO$_4$, protected by
a mirror symmetry and DSM in Na$_3$Bi, protected by a rotational symmetry. In
these states, topology and a chiral symmetry are intrinsically tied. In this
work, we investigate characteristics interplay between a chiral symmetry order
parameter and instantaneous long-range Coulomb interaction with the standard
renormalization group method. We show that a topological transition associated
with a chiral symmetry is stable under the presence of the Coulomb interaction
and the electron velocity always becomes faster than one of a chiral symmetry
order parameter. Thus, the transition {\it must not} be relativistic, which
implies a supersymmetry is intrinsically forbidden by the long-range Coulomb
interaction. {Asymptotically exact} universal ratios of physical quantities
such as energy gap ratio are obtained, and connections with experiments and
recent theoretical proposals are also discussed.
| cond-mat.str-el | topological states may be protected by a lattice symmetry in a class of topological semimetals in three spatial dimensions the berry flux around gapless excitations in momentum space defines a chirality concretely so a protecting symmetry may be referred to as a chiral symmetry prime examples include dirac semimetal dsm in a distorted spinel biznsio_4 protected by a mirror symmetry and dsm in na_3bi protected by a rotational symmetry in these states topology and a chiral symmetry are intrinsically tied in this work we investigate characteristics interplay between a chiral symmetry order parameter and instantaneous longrange coulomb interaction with the standard renormalization group method we show that a topological transition associated with a chiral symmetry is stable under the presence of the coulomb interaction and the electron velocity always becomes faster than one of a chiral symmetry order parameter thus the transition it must not be relativistic which implies a supersymmetry is intrinsically forbidden by the longrange coulomb interaction asymptotically exact universal ratios of physical quantities such as energy gap ratio are obtained and connections with experiments and recent theoretical proposals are also discussed | [['topological', 'states', 'may', 'be', 'protected', 'by', 'a', 'lattice', 'symmetry', 'in', 'a', 'class', 'of', 'topological', 'semimetals', 'in', 'three', 'spatial', 'dimensions', 'the', 'berry', 'flux', 'around', 'gapless', 'excitations', 'in', 'momentum', 'space', 'defines', 'a', 'chirality', 'concretely', 'so', 'a', 'protecting', 'symmetry', 'may', 'be', 'referred', 'to', 'as', 'a', 'chiral', 'symmetry', 'prime', 'examples', 'include', 'dirac', 'semimetal', 'dsm', 'in', 'a', 'distorted', 'spinel', 'biznsio_4', 'protected', 'by', 'a', 'mirror', 'symmetry', 'and', 'dsm', 'in', 'na_3bi', 'protected', 'by', 'a', 'rotational', 'symmetry', 'in', 'these', 'states', 'topology', 'and', 'a', 'chiral', 'symmetry', 'are', 'intrinsically', 'tied', 'in', 'this', 'work', 'we', 'investigate', 'characteristics', 'interplay', 'between', 'a', 'chiral', 'symmetry', 'order', 'parameter', 'and', 'instantaneous', 'longrange', 'coulomb', 'interaction', 'with', 'the', 'standard', 'renormalization', 'group', 'method', 'we', 'show', 'that', 'a', 'topological', 'transition', 'associated', 'with', 'a', 'chiral', 'symmetry', 'is', 'stable', 'under', 'the', 'presence', 'of', 'the', 'coulomb', 'interaction', 'and', 'the', 'electron', 'velocity', 'always', 'becomes', 'faster', 'than', 'one', 'of', 'a', 'chiral', 'symmetry', 'order', 'parameter', 'thus', 'the', 'transition', 'it', 'must', 'not', 'be', 'relativistic', 'which', 'implies', 'a', 'supersymmetry', 'is', 'intrinsically', 'forbidden', 'by', 'the', 'longrange', 'coulomb', 'interaction', 'asymptotically', 'exact', 'universal', 'ratios', 'of', 'physical', 'quantities', 'such', 'as', 'energy', 'gap', 'ratio', 'are', 'obtained', 'and', 'connections', 'with', 'experiments', 'and', 'recent', 'theoretical', 'proposals', 'are', 'also', 'discussed']] | [-0.2192328897040195, 0.27454034623860435, -0.07051050389959106, 0.07799206106717409, -0.09460335915979466, -0.17299982334889186, 0.03357127315970392, 0.3724824816619601, -0.2289054860981802, -0.2747273925956481, 0.048272522338767804, -0.2928464522361348, -0.16938133038901038, 0.06747137248780721, 0.01257366613011624, 0.048080695190281186, -0.05391502190035223, 0.01206919726981817, -0.14035597106803188, -0.16728802470113735, 0.3207695166239403, -0.017204529923880524, 0.3133564014089564, 0.07851222206171586, 0.011894381150878111, -0.030996634364077222, 0.0853221099136672, 0.04236229488488078, -0.10024665753997873, 0.056124808976065386, 0.22020606980423693, -0.08254644628855924, 0.1560416572569498, -0.4165147555269342, -0.22553901960106332, 0.04466794739614745, 0.15130008494178002, 0.1466568300031034, -0.10482812790223016, -0.3559098434609061, 0.061518089637119584, -0.18981557854329098, -0.17372562101872924, -0.13131869202123478, -0.008355723151967663, -0.08174880891224075, -0.24423211995357028, 0.10145813529745451, 0.057841418626529924, 0.09272282027583467, -0.04007637189813162, -0.03357776374202425, -0.13557849942243408, 0.04157749045502822, 0.09806709294080164, 0.007887432667636057, 0.08426631530148837, -0.1444214386420192, -0.14866284262185378, 0.4515819684780442, 0.0063694768067280114, -0.19622506469467788, 0.15869518233936464, -0.0992302077369449, -0.14187020619521987, 0.1546618597699034, 0.10613888405203625, 0.09372856796978683, -0.0800264500732956, 0.1210895667515461, -0.03242796960622683, 0.141816866059299, 0.01134543718968625, 0.08180259208607137, 0.2686134421017245, 0.11711159868094602, 0.10240998184257517, 0.11174552005275452, -0.05469615762920343, -0.11267034241247698, -0.32750509916473936, -0.1555649180142107, -0.24082138547050394, 0.07665019236701284, -0.04274827623284992, -0.1409765314310789, 0.4278558193910498, 0.09905527126110195, 0.22059346797947307, -0.040979226228597836, 0.23181843714625702, 0.10856292179347998, 0.11981232545995077, 0.054283956577238, 0.25761682032403926, 0.13639353372187155, 0.03853975178907967, -0.2699144734082428, 0.006286531626348653, 0.09886876904835691] |
1,802.05728 | Synthesis of Insertion Functions to Enforce Decentralized and Joint
Opacity Properties of Discrete-event Systems | Opacity is a confidentiality property that characterizes the non-disclosure
of specified secret information of a system to an outside observer. In this
paper, we consider the enforcement of opacity within the discrete-event system
formalism in the presence of multiple intruders. We study two cases, one
without coordination among the intruders and the other with coordination. We
propose appropriate notions of opacity corresponding to the two cases,
respectively, and propose enforcement mechanisms for these opacity properties
based on the implementation of insertion functions, which manipulates the
output of the system by inserting fictitious observable events whenever
necessary. The insertion mechanism is adapted to the decentralized framework to
enforce opacity when no coordination exists. Furthermore, we present a
coordination and refinement procedure to synthesize appropriate insertion
functions to enforce opacity when intruders may coordinate with each other by
following an intersection-based coordination protocol. The effectiveness of the
proposed opacity-enforcement approaches is validated through illustrative
examples.
| cs.CR | opacity is a confidentiality property that characterizes the nondisclosure of specified secret information of a system to an outside observer in this paper we consider the enforcement of opacity within the discreteevent system formalism in the presence of multiple intruders we study two cases one without coordination among the intruders and the other with coordination we propose appropriate notions of opacity corresponding to the two cases respectively and propose enforcement mechanisms for these opacity properties based on the implementation of insertion functions which manipulates the output of the system by inserting fictitious observable events whenever necessary the insertion mechanism is adapted to the decentralized framework to enforce opacity when no coordination exists furthermore we present a coordination and refinement procedure to synthesize appropriate insertion functions to enforce opacity when intruders may coordinate with each other by following an intersectionbased coordination protocol the effectiveness of the proposed opacityenforcement approaches is validated through illustrative examples | [['opacity', 'is', 'a', 'confidentiality', 'property', 'that', 'characterizes', 'the', 'nondisclosure', 'of', 'specified', 'secret', 'information', 'of', 'a', 'system', 'to', 'an', 'outside', 'observer', 'in', 'this', 'paper', 'we', 'consider', 'the', 'enforcement', 'of', 'opacity', 'within', 'the', 'discreteevent', 'system', 'formalism', 'in', 'the', 'presence', 'of', 'multiple', 'intruders', 'we', 'study', 'two', 'cases', 'one', 'without', 'coordination', 'among', 'the', 'intruders', 'and', 'the', 'other', 'with', 'coordination', 'we', 'propose', 'appropriate', 'notions', 'of', 'opacity', 'corresponding', 'to', 'the', 'two', 'cases', 'respectively', 'and', 'propose', 'enforcement', 'mechanisms', 'for', 'these', 'opacity', 'properties', 'based', 'on', 'the', 'implementation', 'of', 'insertion', 'functions', 'which', 'manipulates', 'the', 'output', 'of', 'the', 'system', 'by', 'inserting', 'fictitious', 'observable', 'events', 'whenever', 'necessary', 'the', 'insertion', 'mechanism', 'is', 'adapted', 'to', 'the', 'decentralized', 'framework', 'to', 'enforce', 'opacity', 'when', 'no', 'coordination', 'exists', 'furthermore', 'we', 'present', 'a', 'coordination', 'and', 'refinement', 'procedure', 'to', 'synthesize', 'appropriate', 'insertion', 'functions', 'to', 'enforce', 'opacity', 'when', 'intruders', 'may', 'coordinate', 'with', 'each', 'other', 'by', 'following', 'an', 'intersectionbased', 'coordination', 'protocol', 'the', 'effectiveness', 'of', 'the', 'proposed', 'opacityenforcement', 'approaches', 'is', 'validated', 'through', 'illustrative', 'examples']] | [-0.15160623741095627, 0.06002710222529513, -0.04718952466670535, 0.042035460399636466, -0.05711889639188418, -0.1610273726389355, 0.08797582264585631, 0.38343477345361615, -0.28361098706993637, -0.31089493953036945, 0.08639621296866692, -0.2512974639435527, -0.11844004913301065, 0.11672763512253959, -0.09719407012137209, 0.05793628604798917, 0.003651776551484864, 0.004719717619286862, -0.037383284202363615, -0.2315189069266499, 0.360881860179839, 0.07051088611768028, 0.2747665707404349, 0.06731146894432358, 0.0862959920619892, 0.0441937194134892, -0.02045750681354066, 0.0019484241695182987, -0.0985243297816622, 0.1028354261109038, 0.23564118528676942, 0.17000259388398553, 0.2954035524266544, -0.4372569068846916, -0.19519052354446212, 0.08305440827686068, 0.11386633029096568, 0.09196378749761336, -0.05036152503376099, -0.2600486237950475, 0.09765130245829902, -0.19662130096100813, -0.12530246189955796, -0.05425464826950569, -0.024905425777029713, 0.027375399236820194, -0.32725575531135925, -0.01632155953530247, 0.06145926544270077, 0.07492933549381645, -0.07928378279212961, -0.03249675965180238, -0.018980582466731403, 0.14095070406783755, 0.02504042708484567, -0.04187927644897178, 0.13702475003565087, -0.08852438350356129, -0.11951142172437063, 0.40285557225988006, -0.006051160561673294, -0.2159354707152145, 0.19120948594402745, -0.04677381556764837, -0.13743117509644157, 0.09269811422718281, 0.17163025931800585, 0.10319156549402222, -0.17758840991477853, 0.02001017370509502, -0.030099133694920663, 0.20533847299270294, 0.04922796674967059, 0.04024778603073456, 0.1536428844833759, 0.12540973770117622, 0.07799443201507313, 0.18580832181032747, -0.07262517430411732, -0.1264842594380102, -0.3215664257869797, -0.15031556626271542, -0.13377817642924358, -0.019850694474961534, -0.09096245362166244, -0.14688489950625905, 0.3240395745398193, 0.21705641306933657, 0.16603308773618067, 0.04992583690177255, 0.36426549902824157, 0.09039121633395553, 0.09697716518780154, 0.09042588969852948, 0.20876872252722253, 0.033610055531492294, 0.09658910264415259, -0.2296611047781609, 0.14453503384489244, 0.08677730259072307] |
1,802.05729 | Linear discriminant analysis as an alternative method to investigate the
interaction of a 1064 nm CW laser light with a cold inductively-coupled
plasma | In this paper, the interaction of a 1064 nm continuum-wave laser with
inductively-coupled plasma generated in a fluorescent light bulb has been
studied both experimentally and theoretically. The absorption coefficients
pertaining to the plasma medium were obtained for different power measurements.
The results indicate that absorption coefficients decrease with the increase in
laser power. The UV-Vis spectra of mercury plasma were recorded by the
charge-coupled spectrometer device at different power levels of laser. The
linear discriminant analysis (LDA) of plasma spectra reveals the plasma ion and
electron oscillations. Fourier series modeling of electron oscillation results
the Whistler mode frequency of wpe= 0.16 kHz with a density of ne=3.9x1013
cm^(-3). 3D representation of LDA coefficients shows that the increase of laser
power leads the plasma species to form in Whistler mode structures. Plasma
electron temperatures ( e T ) was inferred from the SPARTAN non-local thermal
equilibrium (non-LTE) spectral code, and they were about 0.6 eV in the absence
of laser light. However, there was a 0.05 eV increase in electron temperature
when the laser power was absorbed by the plasma. Electron temperatures slightly
increased with the increase in the power levels, which in turn resulted in
smaller absorption coefficients since the absorption coefficients scales with
Te^(-3/2).
| physics.plasm-ph | in this paper the interaction of a 1064 nm continuumwave laser with inductivelycoupled plasma generated in a fluorescent light bulb has been studied both experimentally and theoretically the absorption coefficients pertaining to the plasma medium were obtained for different power measurements the results indicate that absorption coefficients decrease with the increase in laser power the uvvis spectra of mercury plasma were recorded by the chargecoupled spectrometer device at different power levels of laser the linear discriminant analysis lda of plasma spectra reveals the plasma ion and electron oscillations fourier series modeling of electron oscillation results the whistler mode frequency of wpe 016 khz with a density of ne39x1013 cm3 3d representation of lda coefficients shows that the increase of laser power leads the plasma species to form in whistler mode structures plasma electron temperatures e t was inferred from the spartan nonlocal thermal equilibrium nonlte spectral code and they were about 06 ev in the absence of laser light however there was a 005 ev increase in electron temperature when the laser power was absorbed by the plasma electron temperatures slightly increased with the increase in the power levels which in turn resulted in smaller absorption coefficients since the absorption coefficients scales with te32 | [['in', 'this', 'paper', 'the', 'interaction', 'of', 'a', '1064', 'nm', 'continuumwave', 'laser', 'with', 'inductivelycoupled', 'plasma', 'generated', 'in', 'a', 'fluorescent', 'light', 'bulb', 'has', 'been', 'studied', 'both', 'experimentally', 'and', 'theoretically', 'the', 'absorption', 'coefficients', 'pertaining', 'to', 'the', 'plasma', 'medium', 'were', 'obtained', 'for', 'different', 'power', 'measurements', 'the', 'results', 'indicate', 'that', 'absorption', 'coefficients', 'decrease', 'with', 'the', 'increase', 'in', 'laser', 'power', 'the', 'uvvis', 'spectra', 'of', 'mercury', 'plasma', 'were', 'recorded', 'by', 'the', 'chargecoupled', 'spectrometer', 'device', 'at', 'different', 'power', 'levels', 'of', 'laser', 'the', 'linear', 'discriminant', 'analysis', 'lda', 'of', 'plasma', 'spectra', 'reveals', 'the', 'plasma', 'ion', 'and', 'electron', 'oscillations', 'fourier', 'series', 'modeling', 'of', 'electron', 'oscillation', 'results', 'the', 'whistler', 'mode', 'frequency', 'of', 'wpe', '016', 'khz', 'with', 'a', 'density', 'of', 'ne39x1013', 'cm3', '3d', 'representation', 'of', 'lda', 'coefficients', 'shows', 'that', 'the', 'increase', 'of', 'laser', 'power', 'leads', 'the', 'plasma', 'species', 'to', 'form', 'in', 'whistler', 'mode', 'structures', 'plasma', 'electron', 'temperatures', 'e', 't', 'was', 'inferred', 'from', 'the', 'spartan', 'nonlocal', 'thermal', 'equilibrium', 'nonlte', 'spectral', 'code', 'and', 'they', 'were', 'about', '06', 'ev', 'in', 'the', 'absence', 'of', 'laser', 'light', 'however', 'there', 'was', 'a', '005', 'ev', 'increase', 'in', 'electron', 'temperature', 'when', 'the', 'laser', 'power', 'was', 'absorbed', 'by', 'the', 'plasma', 'electron', 'temperatures', 'slightly', 'increased', 'with', 'the', 'increase', 'in', 'the', 'power', 'levels', 'which', 'in', 'turn', 'resulted', 'in', 'smaller', 'absorption', 'coefficients', 'since', 'the', 'absorption', 'coefficients', 'scales', 'with', 'te32']] | [-0.06675169544424213, 0.21538742317989543, -0.05707726652377206, -0.016518143162627088, 0.02717071013821669, -0.14442086734795082, 0.013878791485287582, 0.4066120640592492, -0.21074299868057245, -0.3374858644990186, 0.006355024541326247, -0.34643648460678833, -0.0014294106096251688, 0.21775808135529434, 0.016176677091204704, 0.0602522443433232, 0.03253782719294934, -0.04668043434807558, -0.005258054987397694, -0.14498473610497306, 0.22093298985154844, 0.16321897028223728, 0.3165034370598805, 0.08038258948247527, 0.07223333602317085, -0.043827497198788534, -0.008721146580823395, -0.009689111169890978, -0.10313978320869747, 0.05069942113512488, 0.2671282944592082, -0.004751166948511159, 0.22856054192122804, -0.4438649747539219, -0.2801758221608925, 0.0010777764163236018, 0.12203724969720552, 0.049333468211040975, -0.053535742652764666, -0.19888433317343393, 0.02533234897027932, -0.15108998544023033, -0.11955272450589051, 0.006232052805152402, 0.006791964746705854, 0.06250699073080881, -0.3145706811966143, 0.11421986809463718, 0.0045059946323953454, 0.10940835843168532, -0.10166092802172721, -0.12616959649986073, -0.043672831249492824, 0.005017953465689224, 0.052521125925473165, 0.019552716168700093, 0.2228822422014614, -0.08715144426339487, -0.04017391428814747, 0.35916981750876825, -0.1392794972556685, -0.044579295375463596, 0.13900023856343915, -0.2537265314746055, -0.044011208086288466, 0.2555341501998256, 0.12459993573248535, 0.06776443449548673, -0.10846836489269948, 0.036168378953004156, -0.012285575181893328, 0.25288281808309365, 0.1752428075782862, 0.053528047345152395, 0.20634150320625821, 0.12312490590014008, -0.02711318019054719, 0.11032769385737133, -0.15677264048046066, 0.03497915117612192, -0.17114147431314436, -0.08640765580487673, -0.1440976644137559, 0.041629624325406754, -0.0820549839053596, -0.11106470576371645, 0.45150663505600236, 0.12512125989766235, 0.14797782412132443, -0.06051082591889936, 0.3151100280564927, 0.201970663584829, 0.030545251631636672, 0.05511052017354995, 0.2803377154056187, 0.18674328841560922, 0.17184060325252995, -0.29167961311498797, 0.013903368563873147, -0.006253790835483899] |
1,802.0573 | Pedestrian-Robot Interaction Experiments in an Exit Corridor | The study of human-robot interaction (HRI) has received increasing research
attention for robot navigation in pedestrian crowds. In this paper, we present
empirical study of pedestrian-robot interaction in an uni-directional exit
corridor. We deploy a mobile robot moving in a direction perpendicular to that
of the pedestrian flow, and install a pedestrian motion tracking system to
record the collective motion. We analyze both individual and collective motion
of pedestrians, and measure the effect of the robot motion on the overall
pedestrian flow. The experimental results show the effect of passive HRI, where
the pedestrians' overall speed is slowed down in the presence of the robot, and
the faster the robot moves, the lower the average pedestrian velocity becomes.
Experiment results show qualitative consistency of the collective HRI effect
with simulation results that was previously reported. The study can be used to
guide future design of robot-assisted pedestrian evacuation algorithms.
| cs.RO cs.SY | the study of humanrobot interaction hri has received increasing research attention for robot navigation in pedestrian crowds in this paper we present empirical study of pedestrianrobot interaction in an unidirectional exit corridor we deploy a mobile robot moving in a direction perpendicular to that of the pedestrian flow and install a pedestrian motion tracking system to record the collective motion we analyze both individual and collective motion of pedestrians and measure the effect of the robot motion on the overall pedestrian flow the experimental results show the effect of passive hri where the pedestrians overall speed is slowed down in the presence of the robot and the faster the robot moves the lower the average pedestrian velocity becomes experiment results show qualitative consistency of the collective hri effect with simulation results that was previously reported the study can be used to guide future design of robotassisted pedestrian evacuation algorithms | [['the', 'study', 'of', 'humanrobot', 'interaction', 'hri', 'has', 'received', 'increasing', 'research', 'attention', 'for', 'robot', 'navigation', 'in', 'pedestrian', 'crowds', 'in', 'this', 'paper', 'we', 'present', 'empirical', 'study', 'of', 'pedestrianrobot', 'interaction', 'in', 'an', 'unidirectional', 'exit', 'corridor', 'we', 'deploy', 'a', 'mobile', 'robot', 'moving', 'in', 'a', 'direction', 'perpendicular', 'to', 'that', 'of', 'the', 'pedestrian', 'flow', 'and', 'install', 'a', 'pedestrian', 'motion', 'tracking', 'system', 'to', 'record', 'the', 'collective', 'motion', 'we', 'analyze', 'both', 'individual', 'and', 'collective', 'motion', 'of', 'pedestrians', 'and', 'measure', 'the', 'effect', 'of', 'the', 'robot', 'motion', 'on', 'the', 'overall', 'pedestrian', 'flow', 'the', 'experimental', 'results', 'show', 'the', 'effect', 'of', 'passive', 'hri', 'where', 'the', 'pedestrians', 'overall', 'speed', 'is', 'slowed', 'down', 'in', 'the', 'presence', 'of', 'the', 'robot', 'and', 'the', 'faster', 'the', 'robot', 'moves', 'the', 'lower', 'the', 'average', 'pedestrian', 'velocity', 'becomes', 'experiment', 'results', 'show', 'qualitative', 'consistency', 'of', 'the', 'collective', 'hri', 'effect', 'with', 'simulation', 'results', 'that', 'was', 'previously', 'reported', 'the', 'study', 'can', 'be', 'used', 'to', 'guide', 'future', 'design', 'of', 'robotassisted', 'pedestrian', 'evacuation', 'algorithms']] | [-0.15381230922050876, 0.0994757785206398, -0.09827613490759521, -0.014071344511034407, -0.11962887241404403, -0.12204942407678007, 0.016316332363301725, 0.44712106156087406, -0.20145415662586488, -0.3379762771671537, 0.033840188511955624, -0.2666024201505541, -0.167184023488615, 0.18666322401573732, -0.12130177236866911, 0.06812370919804969, 0.13153175627214936, 0.09162833589928325, 0.04054218571242952, -0.20225075460542496, 0.18900122285845714, 0.04207015794550849, 0.3270656744685225, 0.07372295136588651, 0.14678719777588708, 0.021411722310428583, -0.016746548555061424, 0.03919934727742362, -0.11145766531901884, 0.10889766926600321, 0.2327965296107986, 0.09268409809462626, 0.3005520322743954, -0.4562850150380384, -0.197970291483216, 0.0697354161435411, 0.17233896938017318, 0.10848069756065269, -0.04522788508895885, -0.42005390782110597, 0.05238172185656023, -0.2047174364089261, -0.14288303375281897, -0.005018506605001922, 0.04160463928427497, 0.04686687506477323, -0.2271726756361376, 0.01420320650071812, 0.030892336868517403, 0.12691841241148477, -0.07578625204985508, -0.021841638852886203, 0.026570430478534184, 0.24012996232124498, 0.11418014134727167, 0.031137373120637257, 0.23622753176322156, -0.21911528007901349, -0.14143630066836202, 0.429390350671334, -0.009825125319342053, -0.1970623990495664, 0.21938565931742307, -0.12492269189789186, -0.06925683806007696, 0.11724739886719633, 0.2984643131746231, 0.10391307976317114, -0.15794149987600944, -0.05275731155730633, -0.08062301283526058, 0.12201095163205487, 0.019862572824569873, -0.06433941451423625, 0.17482332439740766, 0.27317739615367875, 0.11577643177195175, 0.1279266931413912, -0.15054230522710477, -0.14131805268619713, -0.23748541181762325, -0.15269271497665024, -0.11813977622345241, -0.048540476588469404, -0.07253472956260855, -0.06091286445263069, 0.3795745531852181, 0.2665986569780806, 0.179383918007433, 0.06355516437592136, 0.34769213677862204, 0.05010018327802017, 0.01674834157440912, 0.08583576281592753, 0.25627797857914875, -0.026501775473809323, 0.1875263297319966, -0.32885293063795745, 0.09305244367223585, 0.030736898232528287] |
1,802.05731 | Ghosts- and Tachyon-Free Regions of the Randall-Sundrum Model Parameter
Space | Model building within the Randall-Sundrum (RS) framework generally involves
placing the Standard Model fields in the bulk. Such fields may possess non-zero
values for their associated brane-localized kinetic terms (BLKTs) in addition
to possible bulk mass parameters. In this paper we clearly identify the regions
of the RS model parameter space where the presence of bulk mass terms and BLKTs
yield a setup which is free from both ghost and tachyon instabilities. Such
physically acceptable parameter space regions can then be used to construct
realistic and phenomenologically viable RS models.
| hep-ph | model building within the randallsundrum rs framework generally involves placing the standard model fields in the bulk such fields may possess nonzero values for their associated branelocalized kinetic terms blkts in addition to possible bulk mass parameters in this paper we clearly identify the regions of the rs model parameter space where the presence of bulk mass terms and blkts yield a setup which is free from both ghost and tachyon instabilities such physically acceptable parameter space regions can then be used to construct realistic and phenomenologically viable rs models | [['model', 'building', 'within', 'the', 'randallsundrum', 'rs', 'framework', 'generally', 'involves', 'placing', 'the', 'standard', 'model', 'fields', 'in', 'the', 'bulk', 'such', 'fields', 'may', 'possess', 'nonzero', 'values', 'for', 'their', 'associated', 'branelocalized', 'kinetic', 'terms', 'blkts', 'in', 'addition', 'to', 'possible', 'bulk', 'mass', 'parameters', 'in', 'this', 'paper', 'we', 'clearly', 'identify', 'the', 'regions', 'of', 'the', 'rs', 'model', 'parameter', 'space', 'where', 'the', 'presence', 'of', 'bulk', 'mass', 'terms', 'and', 'blkts', 'yield', 'a', 'setup', 'which', 'is', 'free', 'from', 'both', 'ghost', 'and', 'tachyon', 'instabilities', 'such', 'physically', 'acceptable', 'parameter', 'space', 'regions', 'can', 'then', 'be', 'used', 'to', 'construct', 'realistic', 'and', 'phenomenologically', 'viable', 'rs', 'models']] | [-0.10244625940156932, 0.16231880196507767, -0.03134047338971868, 0.09885579158170996, -0.09091759520180692, -0.144412486364176, 0.012555274055392312, 0.3168319401500577, -0.22896858477245338, -0.34355272227813577, 0.07834795708582863, -0.17539136462040583, -0.1347576621681748, 0.15941019024731676, -0.04598622178838758, 0.0030077039940475847, -0.018347699808972804, 0.04672153258103539, -0.07064366751331942, -0.19774461866737428, 0.3313389291076667, 0.0505873291827315, 0.2515454491896724, -0.003376050026748668, 0.0688422765233554, -0.0685255735879764, 0.014941891660617495, 0.03728114923036297, -0.17509647843888326, 0.049391619564796034, 0.22076156404351754, 0.05744546188824726, 0.15974116781514816, -0.39929929068735376, -0.29900732467120344, 0.16062324690971186, 0.18237946720116519, 0.09862244240453451, -0.023276896845676343, -0.2257206098134206, 0.05540709473213858, -0.20208552000324495, -0.1323536856904287, -0.08168428521920842, -0.042569094824350694, -0.09143057880415158, -0.3375256475780837, 0.12965520038481124, -0.04410108537889424, -0.04161363559648056, -0.11606716048184106, -0.10012494714994152, -0.08855071126229384, 0.07368086351991886, 0.11422541989833751, 0.03420492839226923, 0.1252100968691097, -0.16637874132853045, -0.05732224967902188, 0.40159705230458215, -0.06330574918485415, -0.2515035025055774, 0.22532373162245925, -0.10667488777967678, -0.08559368170310998, 0.10514573696259917, 0.14457133811348202, 0.11312064558362843, -0.16687669570092112, 0.16204754577285546, -0.013310712759531189, 0.13790807736487212, 0.04725682484885593, 0.10605387058405374, 0.27651142684573476, 0.1372359695484523, -0.03566076892258769, 0.11117115852671718, -0.11057530645749383, -0.12458036666463489, -0.3798492540690032, -0.13970318186858838, -0.0948301413921978, -0.0363441843920472, -0.14482311495868833, -0.17095274741719055, 0.40011722779705783, 0.1673716661766362, 0.2178297890561887, -0.008174075987137092, 0.2604305929589001, 0.09463835714003918, 0.11018661913377317, 0.06950927381297912, 0.28352855129659554, 0.07120187603074803, 0.04638890429950235, -0.18295078866834624, 0.0066479177727491005, 0.04413470221863298] |
1,802.05732 | Distality for the asymptotic couple of the field of logarithmic
transseries | We show that the theory $T_{\log}$ of the asymptotic couple of the field of
logarithmic transseries is distal. As distal theories are NIP (= the
non-independence property), this provides a new proof that $T_{\log}$ is NIP.
Finally, we show that $T_{\log}$ is not strongly dependent, and in particular,
it is not $\operatorname{dp}$-minimal and it does not have finite
$\operatorname{dp}$-rank.
| math.LO | we show that the theory t_log of the asymptotic couple of the field of logarithmic transseries is distal as distal theories are nip the nonindependence property this provides a new proof that t_log is nip finally we show that t_log is not strongly dependent and in particular it is not operatornamedpminimal and it does not have finite operatornamedprank | [['we', 'show', 'that', 'the', 'theory', 't_log', 'of', 'the', 'asymptotic', 'couple', 'of', 'the', 'field', 'of', 'logarithmic', 'transseries', 'is', 'distal', 'as', 'distal', 'theories', 'are', 'nip', 'the', 'nonindependence', 'property', 'this', 'provides', 'a', 'new', 'proof', 'that', 't_log', 'is', 'nip', 'finally', 'we', 'show', 'that', 't_log', 'is', 'not', 'strongly', 'dependent', 'and', 'in', 'particular', 'it', 'is', 'not', 'operatornamedpminimal', 'and', 'it', 'does', 'not', 'have', 'finite', 'operatornamedprank']] | [-0.12631475560400368, 0.14969271950290672, -0.17617109135192419, 0.07370677038021053, -0.12318894589718964, -0.12233142050016406, -0.022615869986371502, 0.4195236900621759, -0.2507490650085466, -0.17567516025155783, 0.09657388766312838, -0.2446920724053468, -0.22700891079979815, 0.18657464166504464, -0.13619179175917193, -0.04727292905694672, -0.006597617624460587, 0.12087216116820595, -0.016281590780376325, -0.29290241583450033, 0.3235255378115523, -0.034558890387415886, 0.27336813120304476, 0.17483352650223033, 0.07994873417607908, 0.0055086764706564805, 0.027989857181507562, 0.09916834336971599, -0.1355601234805103, 0.08181363500521652, 0.22376458449954434, 0.15011698819164718, 0.2859317492028432, -0.3818040659118976, -0.1989044328552804, 0.09762238205543586, 0.14110454111193707, 0.10573489820983793, -0.06837767454063785, -0.17085917170957796, 0.19435918879961328, -0.16028678783082537, -0.11394092791514206, -0.1405550416425935, 0.0031088547485913815, 0.02730530733242631, -0.24206987671121688, 0.03331248162430711, 0.17571259892013455, 0.04633264805722449, -0.02465554709280176, -0.01820935804114145, -0.025888193531760147, 0.09694900097487594, 0.05166303680744022, 0.03339473931347519, 0.10853004377401833, -0.10685128510314305, -0.06221446550625842, 0.30427689251622986, -0.10852174760761304, -0.192948866635561, 0.19790319738344156, -0.2071888959201585, -0.18831714687569598, 0.07381835466782961, 0.02358630415983498, 0.17669139823244354, -0.12501681345747784, 0.19779497396042903, -0.15829262822600348, 0.1922094370238483, 0.03507040493423119, 0.048058121656400284, 0.11756414675619453, 0.12570152016373218, 0.07455988263661441, 0.09223908962615367, 0.02686389928151454, -0.04916199576109648, -0.3757827541225457, -0.1884752009063959, -0.13238548846649273, 0.0625261639119604, -0.0545456765846341, -0.25162158866545986, 0.3463785277479993, 0.1577595922364188, 0.12448291014879942, 0.09422611032745667, 0.18502252861591323, 0.1161589051709078, 0.11063391588062846, 0.05143144801591656, 0.26518309560404824, 0.1449351318879053, -0.01533502310381404, -0.19787805208138057, 0.05082207689494161, 0.07723628221512106] |
1,802.05733 | Fair Clustering Through Fairlets | We study the question of fair clustering under the {\em disparate impact}
doctrine, where each protected class must have approximately equal
representation in every cluster. We formulate the fair clustering problem under
both the $k$-center and the $k$-median objectives, and show that even with two
protected classes the problem is challenging, as the optimum solution can
violate common conventions---for instance a point may no longer be assigned to
its nearest cluster center! En route we introduce the concept of fairlets,
which are minimal sets that satisfy fair representation while approximately
preserving the clustering objective. We show that any fair clustering problem
can be decomposed into first finding good fairlets, and then using existing
machinery for traditional clustering algorithms. While finding good fairlets
can be NP-hard, we proceed to obtain efficient approximation algorithms based
on minimum cost flow. We empirically quantify the value of fair clustering on
real-world datasets with sensitive attributes.
| cs.LG stat.ML | we study the question of fair clustering under the em disparate impact doctrine where each protected class must have approximately equal representation in every cluster we formulate the fair clustering problem under both the kcenter and the kmedian objectives and show that even with two protected classes the problem is challenging as the optimum solution can violate common conventionsfor instance a point may no longer be assigned to its nearest cluster center en route we introduce the concept of fairlets which are minimal sets that satisfy fair representation while approximately preserving the clustering objective we show that any fair clustering problem can be decomposed into first finding good fairlets and then using existing machinery for traditional clustering algorithms while finding good fairlets can be nphard we proceed to obtain efficient approximation algorithms based on minimum cost flow we empirically quantify the value of fair clustering on realworld datasets with sensitive attributes | [['we', 'study', 'the', 'question', 'of', 'fair', 'clustering', 'under', 'the', 'em', 'disparate', 'impact', 'doctrine', 'where', 'each', 'protected', 'class', 'must', 'have', 'approximately', 'equal', 'representation', 'in', 'every', 'cluster', 'we', 'formulate', 'the', 'fair', 'clustering', 'problem', 'under', 'both', 'the', 'kcenter', 'and', 'the', 'kmedian', 'objectives', 'and', 'show', 'that', 'even', 'with', 'two', 'protected', 'classes', 'the', 'problem', 'is', 'challenging', 'as', 'the', 'optimum', 'solution', 'can', 'violate', 'common', 'conventionsfor', 'instance', 'a', 'point', 'may', 'no', 'longer', 'be', 'assigned', 'to', 'its', 'nearest', 'cluster', 'center', 'en', 'route', 'we', 'introduce', 'the', 'concept', 'of', 'fairlets', 'which', 'are', 'minimal', 'sets', 'that', 'satisfy', 'fair', 'representation', 'while', 'approximately', 'preserving', 'the', 'clustering', 'objective', 'we', 'show', 'that', 'any', 'fair', 'clustering', 'problem', 'can', 'be', 'decomposed', 'into', 'first', 'finding', 'good', 'fairlets', 'and', 'then', 'using', 'existing', 'machinery', 'for', 'traditional', 'clustering', 'algorithms', 'while', 'finding', 'good', 'fairlets', 'can', 'be', 'nphard', 'we', 'proceed', 'to', 'obtain', 'efficient', 'approximation', 'algorithms', 'based', 'on', 'minimum', 'cost', 'flow', 'we', 'empirically', 'quantify', 'the', 'value', 'of', 'fair', 'clustering', 'on', 'realworld', 'datasets', 'with', 'sensitive', 'attributes']] | [-0.1047601387440227, 0.02315210413808624, -0.11737823870033026, 0.11104994399240241, -0.10116643330703179, -0.18182951767463237, 0.059366846275515854, 0.42250507317017766, -0.3106573316579064, -0.329497931888327, 0.0914835711576355, -0.26939293040893975, -0.1306882224107782, 0.14159155417233704, -0.0773982414106528, 0.06544567959654767, 0.09711526772007346, 0.04395454705692828, -0.043963739392735686, -0.2843390792189166, 0.2933278770535253, 0.04880072528573995, 0.3251819632404173, 0.043802447588338206, 0.09282767895841972, 0.022915380795796712, -0.0007852293364703655, 0.09705945561484744, -0.11164032227742912, 0.10831954049703199, 0.295641917445076, 0.22578697447975477, 0.3111725269506375, -0.3957884764071787, -0.1408153857921328, 0.21671719712593282, 0.14159492266364396, 0.08480733089701971, -0.032864107633940876, -0.2192602870054543, 0.14814884706710776, -0.1251048877912884, -0.05291278225835413, -0.08793252555032571, -0.030134094959745804, -0.0003791218646802008, -0.28155546193942427, 0.07228110228665173, 0.003629318350770821, -0.01867604727546374, -0.07980126172071322, -0.14868264130006234, 0.023604252498286467, 0.13779719409377625, 0.011425279693406386, 0.03327047705068253, 0.09363195718382485, -0.09026468014655013, -0.162430744615073, 0.4400044766565164, -0.016830639243125917, -0.20105077298668525, 0.17783575403814514, -0.05818457994610071, -0.19213274954818188, 0.07149974038824439, 0.16610122169057528, 0.12762565265720088, -0.128027049874266, 0.031025523030742384, -0.1065822781684498, 0.1485707483947044, 0.06896141300909221, 0.02698758807576572, 0.17955114632922536, 0.1622461025758336, 0.18846302778925747, 0.1532715513165264, -0.03532790918524067, -0.08734825242621204, -0.23723522247746587, -0.09154805591950814, -0.18871577044483273, -0.0045397361492117245, -0.12111499348005357, -0.12910632884129883, 0.35555540409560005, 0.16963554953613008, 0.19628525367937982, 0.10462120246840641, 0.2918576674411694, 0.09480000136963403, 0.04789774533982078, 0.14318660290678964, 0.1893454398214817, 0.027631702663687367, 0.011800482105463743, -0.20688821211534864, 0.09403816518218568, 0.06614737775176764] |
1,802.05734 | Reachability for infinite time Turing machines with long tapes | Infinite time Turing machine models with tape length $\alpha$, denoted
$T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape
length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$,
some cells cannot be halting positions of $T_\alpha$ given trivial input. The
main open question in [Rin14] asks about the size of the least such ordinal
$\delta$.
We answer this by providing various characterizations. For instance, $\delta$
is the least ordinal with any of the following properties: (a) For some
$\xi<\alpha$, there is a $T_\xi$-writable but not $T_\alpha$-writable subset of
$\omega$. (b) There is a gap in the $T_\alpha$-writable ordinals. (c) $\alpha$
is uncountable in $L_{\lambda_\alpha}$. Here $\lambda_\alpha$ denotes the
supremum of $T_\alpha$-writable ordinals, i.e. those with a $T_\alpha$-writable
code of length $\alpha$.
We further use the above characterizations, and an analogue to Welch's
submodel characterization of the ordinals $\lambda$, $\zeta$ and $\Sigma$, to
show that $\delta$ is large in the sense that it is a closure point of the
function $\alpha \mapsto \Sigma_\alpha$, where $\Sigma_\alpha$ denotes the
supremum of the $T_\alpha$-accidentally writable ordinals.
| math.LO cs.LO | infinite time turing machine models with tape length alpha denoted t_alpha strengthen the machines of hamkins and kidder hl00 with tape length omega a new phenomenon is that for some countable ordinals alpha some cells cannot be halting positions of t_alpha given trivial input the main open question in rin14 asks about the size of the least such ordinal delta we answer this by providing various characterizations for instance delta is the least ordinal with any of the following properties a for some xialpha there is a t_xiwritable but not t_alphawritable subset of omega b there is a gap in the t_alphawritable ordinals c alpha is uncountable in l_lambda_alpha here lambda_alpha denotes the supremum of t_alphawritable ordinals ie those with a t_alphawritable code of length alpha we further use the above characterizations and an analogue to welchs submodel characterization of the ordinals lambda zeta and sigma to show that delta is large in the sense that it is a closure point of the function alpha mapsto sigma_alpha where sigma_alpha denotes the supremum of the t_alphaaccidentally writable ordinals | [['infinite', 'time', 'turing', 'machine', 'models', 'with', 'tape', 'length', 'alpha', 'denoted', 't_alpha', 'strengthen', 'the', 'machines', 'of', 'hamkins', 'and', 'kidder', 'hl00', 'with', 'tape', 'length', 'omega', 'a', 'new', 'phenomenon', 'is', 'that', 'for', 'some', 'countable', 'ordinals', 'alpha', 'some', 'cells', 'can', 'not', 'be', 'halting', 'positions', 'of', 't_alpha', 'given', 'trivial', 'input', 'the', 'main', 'open', 'question', 'in', 'rin14', 'asks', 'about', 'the', 'size', 'of', 'the', 'least', 'such', 'ordinal', 'delta', 'we', 'answer', 'this', 'by', 'providing', 'various', 'characterizations', 'for', 'instance', 'delta', 'is', 'the', 'least', 'ordinal', 'with', 'any', 'of', 'the', 'following', 'properties', 'a', 'for', 'some', 'xialpha', 'there', 'is', 'a', 't_xiwritable', 'but', 'not', 't_alphawritable', 'subset', 'of', 'omega', 'b', 'there', 'is', 'a', 'gap', 'in', 'the', 't_alphawritable', 'ordinals', 'c', 'alpha', 'is', 'uncountable', 'in', 'l_lambda_alpha', 'here', 'lambda_alpha', 'denotes', 'the', 'supremum', 'of', 't_alphawritable', 'ordinals', 'ie', 'those', 'with', 'a', 't_alphawritable', 'code', 'of', 'length', 'alpha', 'we', 'further', 'use', 'the', 'above', 'characterizations', 'and', 'an', 'analogue', 'to', 'welchs', 'submodel', 'characterization', 'of', 'the', 'ordinals', 'lambda', 'zeta', 'and', 'sigma', 'to', 'show', 'that', 'delta', 'is', 'large', 'in', 'the', 'sense', 'that', 'it', 'is', 'a', 'closure', 'point', 'of', 'the', 'function', 'alpha', 'mapsto', 'sigma_alpha', 'where', 'sigma_alpha', 'denotes', 'the', 'supremum', 'of', 'the', 't_alphaaccidentally', 'writable', 'ordinals']] | [-0.1598004557170792, 0.19500318910757342, -0.02432799371863807, 0.0860400837644224, -0.09407621943203441, -0.1577273382175434, 0.07856009116482442, 0.34738909765388926, -0.32915630882250607, -0.1876997334957984, 0.061315353932881976, -0.31441419186458164, -0.07106324235876386, 0.1807582679576768, -0.06950185877995059, 0.03420601865664297, -0.0005614967919843045, 0.12168523839491856, -0.009798691470735851, -0.21554661414053053, 0.3286928762641407, -0.05242487947598525, 0.1446049092848909, 0.0371654243692971, 0.06236201765371024, -0.03744165488717959, 0.034043579195448426, 0.04755401329508837, -0.24184931036164126, 0.05142974803753122, 0.2439525503502404, 0.18954225243580652, 0.3195997108355423, -0.2907856270735491, -0.15503805144986063, 0.17724923277273774, 0.11358765580669863, -0.026114357922043155, 0.05198396387310817, -0.23289588309361497, 0.15117726978748994, -0.10260995822848289, -0.12266293407358617, -0.012129202629089614, 0.13401789880072365, 0.04256938992746476, -0.2795022431023505, 0.01358874923027406, 0.16300185121638927, 0.09170985185794231, -0.05486022574810925, -0.17008334108106146, 0.013824867533460647, 0.08653145493411948, 0.02365888603795043, 0.10441788207373523, 0.03895862876152286, -0.09433268506559032, -0.10132084631918246, 0.3610996598905394, -0.06771747685828908, -0.21379804878246317, 0.11423874714524845, -0.19470133380749063, -0.1541984532179171, 0.096467660126314, 0.03244886010100613, 0.12389412553001174, -0.046929102485213495, 0.18948634617424953, -0.10842290643206932, 0.23953430064717668, 0.13371233546277347, 0.03278334481598583, 0.10779429846200984, 0.17331467011695825, 0.06703604314465485, 0.129513863624192, -0.018130903801816176, 0.002210889630708736, -0.3448888186602234, -0.17916988850587365, -0.137257163838155, 0.11621580879635318, -0.10580936257804494, -0.21997682794907017, 0.29685746706790705, 0.1087790147651719, 0.1964583162519801, 0.13805632970721132, 0.2213666679343004, 0.11541782135434578, 0.05210678774905202, 0.08634571702895158, 0.10342588230433895, 0.12517606402879225, -0.013098983565140838, -0.16010614895568676, 0.08705838033498797, 0.11617566171678247] |
1,802.05735 | IBeaconMap: Automated Indoor Space Representation for Beacon-Based
Wayfinding | Traditionally, there have been few options for navigational aids for the
blind and visually impaired (BVI) in large indoor spaces. Some recent indoor
navigation systems allow users equipped with smartphones to interact with low
cost Bluetoothbased beacons deployed strategically within the indoor space of
interest to navigate their surroundings. A major challenge in deploying such
beacon-based navigation systems is the need to employ a time and
labor-expensive beacon planning process to identify potential beacon placement
locations and arrive at a topological structure representing the indoor space.
This work presents a technique called IBeaconMap for creating such topological
structures to use with beacon-based navigation that only needs the floor plans
of the indoor spaces of interest. IBeaconMap employs a combination of computer
vision and machine learning techniques to arrive at the required set of beacon
locations and a weighted connectivity graph (with directional orientations) for
subsequent navigational needs. Evaluations show IBeaconMap to be both fast and
reasonably accurate, potentially proving to be an essential tool to be utilized
before mass deployments of beacon-based indoor wayfinding systems of the
future.
| cs.HC | traditionally there have been few options for navigational aids for the blind and visually impaired bvi in large indoor spaces some recent indoor navigation systems allow users equipped with smartphones to interact with low cost bluetoothbased beacons deployed strategically within the indoor space of interest to navigate their surroundings a major challenge in deploying such beaconbased navigation systems is the need to employ a time and laborexpensive beacon planning process to identify potential beacon placement locations and arrive at a topological structure representing the indoor space this work presents a technique called ibeaconmap for creating such topological structures to use with beaconbased navigation that only needs the floor plans of the indoor spaces of interest ibeaconmap employs a combination of computer vision and machine learning techniques to arrive at the required set of beacon locations and a weighted connectivity graph with directional orientations for subsequent navigational needs evaluations show ibeaconmap to be both fast and reasonably accurate potentially proving to be an essential tool to be utilized before mass deployments of beaconbased indoor wayfinding systems of the future | [['traditionally', 'there', 'have', 'been', 'few', 'options', 'for', 'navigational', 'aids', 'for', 'the', 'blind', 'and', 'visually', 'impaired', 'bvi', 'in', 'large', 'indoor', 'spaces', 'some', 'recent', 'indoor', 'navigation', 'systems', 'allow', 'users', 'equipped', 'with', 'smartphones', 'to', 'interact', 'with', 'low', 'cost', 'bluetoothbased', 'beacons', 'deployed', 'strategically', 'within', 'the', 'indoor', 'space', 'of', 'interest', 'to', 'navigate', 'their', 'surroundings', 'a', 'major', 'challenge', 'in', 'deploying', 'such', 'beaconbased', 'navigation', 'systems', 'is', 'the', 'need', 'to', 'employ', 'a', 'time', 'and', 'laborexpensive', 'beacon', 'planning', 'process', 'to', 'identify', 'potential', 'beacon', 'placement', 'locations', 'and', 'arrive', 'at', 'a', 'topological', 'structure', 'representing', 'the', 'indoor', 'space', 'this', 'work', 'presents', 'a', 'technique', 'called', 'ibeaconmap', 'for', 'creating', 'such', 'topological', 'structures', 'to', 'use', 'with', 'beaconbased', 'navigation', 'that', 'only', 'needs', 'the', 'floor', 'plans', 'of', 'the', 'indoor', 'spaces', 'of', 'interest', 'ibeaconmap', 'employs', 'a', 'combination', 'of', 'computer', 'vision', 'and', 'machine', 'learning', 'techniques', 'to', 'arrive', 'at', 'the', 'required', 'set', 'of', 'beacon', 'locations', 'and', 'a', 'weighted', 'connectivity', 'graph', 'with', 'directional', 'orientations', 'for', 'subsequent', 'navigational', 'needs', 'evaluations', 'show', 'ibeaconmap', 'to', 'be', 'both', 'fast', 'and', 'reasonably', 'accurate', 'potentially', 'proving', 'to', 'be', 'an', 'essential', 'tool', 'to', 'be', 'utilized', 'before', 'mass', 'deployments', 'of', 'beaconbased', 'indoor', 'wayfinding', 'systems', 'of', 'the', 'future']] | [-0.14169974918034065, 0.05804358614386729, -0.043888572423549536, 0.03417694242577082, -0.13674425876657056, -0.1595914368570613, 0.07443961683549621, 0.46425278958420013, -0.23005383547950425, -0.34854650206133636, 0.11309576882608367, -0.2539934843741569, -0.15397346726967953, 0.22514622485455635, -0.1457424994904696, 0.0847725740512198, 0.07202447624215645, 0.04852315472486556, -0.00827180890883028, -0.22999595932411798, 0.23657627837233328, 0.0714527666462924, 0.2673385927601802, 0.023806123228330926, 0.11147819053377878, 0.03095448595823572, -0.022223037170161577, -0.017674647508515176, -0.054162024214788704, 0.14950651542643423, 0.3895401987604352, 0.18829041779942848, 0.30663188711134187, -0.44562935054537695, -0.2511468925460411, 0.12839327306631854, 0.16328968426255, 0.04559702250778421, -0.08767264492582233, -0.37500140819412825, 0.11321228008620726, -0.18873933058189737, -0.12546567270130088, -0.08133919716982002, 0.011684275441273878, 0.041322923059024935, -0.2793929231163268, -0.07561678134053099, -0.055047969759801745, 0.07915314706174699, -0.04415306679385884, -0.042725299866023386, 0.020696853792866354, 0.249630972506235, -0.009815598645053053, 0.05431059911709533, 0.15670802953668914, -0.11911612981004344, -0.1237727508652659, 0.4243397198151797, 0.04062216640688183, -0.2021236866996994, 0.23068771207776576, -0.0508229812582034, -0.13396298611240293, 0.11935191123748981, 0.25796826678296464, 0.10495630488466387, -0.1716338209824409, 0.011439824732984893, 0.03386442767838493, 0.13421930034581403, 0.06002444239592561, 0.055811179471096366, 0.23928224159383468, 0.24773635163331742, 0.15461669731170827, 0.07214144607595782, -0.11160218339699152, -0.05688395373594672, -0.19562029479261997, -0.12591488090592148, -0.17965855507116596, -0.02979823126357091, -0.07425458448497838, -0.14743197174340655, 0.33302944563117554, 0.21449296655059283, 0.16273577934705166, 0.0766034545522416, 0.3657151243691756, 0.017336520286417825, 0.08087048802223183, 0.09503530379151925, 0.14593593185434822, 0.0100650702661369, 0.1836815217975527, -0.13174378854058555, 0.07544730418422577, 0.027591661822622304] |
1,802.05736 | Impact of Gas Giant Instabilities on Habitable Planets | The detection of many extrasolar gas giants with high eccentricities
indicates that dynamical instabilities in planetary systems are common. These
instabilities can alter the orbits of gas giants as well as the orbits of
terrestrial planets and therefore eject or move a habitable planet out of the
habitable zone. In this work 423 simulations with 153 different hypothetical
planetary systems with gas giants and terrestrial planets have been modelled to
explore the orbital stability of habitable planets. The initial parameter
variations include the number, distances and masses of the giant planets and
the star type. Linear correlations between the initial number and the initial
distances of gas giants and the survival rate of habitable planets were found.
Planetary systems consisting of two giant planets are fairly benign to
terrestrial planets, whereas six giant planets very often lead to a complete
clearing of the habitable zone. Systems with initial distances of five Hill
Radii between the giant planets have a high chance to harbour a habitable
planet, although more compact systems are very destructive. The giant planet
masses have a smaller impact on the stability of habitable worlds.
Additionally, a link between the present-day orbit of an observed giant
exoplanet and the survival rate of habitable planets was established. As a rule
of thumb, observed gas giants with eccentricities higher than 0.4 and
inclinations higher than 20 degrees have experienced strong planet-planet
scatterings and are unlikely to have a habitable planet in its system.
Furthermore, it was found that habitable planets surrounding a K or M-star have
a higher survival rate than those surrounding a G-star.
| astro-ph.EP | the detection of many extrasolar gas giants with high eccentricities indicates that dynamical instabilities in planetary systems are common these instabilities can alter the orbits of gas giants as well as the orbits of terrestrial planets and therefore eject or move a habitable planet out of the habitable zone in this work 423 simulations with 153 different hypothetical planetary systems with gas giants and terrestrial planets have been modelled to explore the orbital stability of habitable planets the initial parameter variations include the number distances and masses of the giant planets and the star type linear correlations between the initial number and the initial distances of gas giants and the survival rate of habitable planets were found planetary systems consisting of two giant planets are fairly benign to terrestrial planets whereas six giant planets very often lead to a complete clearing of the habitable zone systems with initial distances of five hill radii between the giant planets have a high chance to harbour a habitable planet although more compact systems are very destructive the giant planet masses have a smaller impact on the stability of habitable worlds additionally a link between the presentday orbit of an observed giant exoplanet and the survival rate of habitable planets was established as a rule of thumb observed gas giants with eccentricities higher than 04 and inclinations higher than 20 degrees have experienced strong planetplanet scatterings and are unlikely to have a habitable planet in its system furthermore it was found that habitable planets surrounding a k or mstar have a higher survival rate than those surrounding a gstar | [['the', 'detection', 'of', 'many', 'extrasolar', 'gas', 'giants', 'with', 'high', 'eccentricities', 'indicates', 'that', 'dynamical', 'instabilities', 'in', 'planetary', 'systems', 'are', 'common', 'these', 'instabilities', 'can', 'alter', 'the', 'orbits', 'of', 'gas', 'giants', 'as', 'well', 'as', 'the', 'orbits', 'of', 'terrestrial', 'planets', 'and', 'therefore', 'eject', 'or', 'move', 'a', 'habitable', 'planet', 'out', 'of', 'the', 'habitable', 'zone', 'in', 'this', 'work', '423', 'simulations', 'with', '153', 'different', 'hypothetical', 'planetary', 'systems', 'with', 'gas', 'giants', 'and', 'terrestrial', 'planets', 'have', 'been', 'modelled', 'to', 'explore', 'the', 'orbital', 'stability', 'of', 'habitable', 'planets', 'the', 'initial', 'parameter', 'variations', 'include', 'the', 'number', 'distances', 'and', 'masses', 'of', 'the', 'giant', 'planets', 'and', 'the', 'star', 'type', 'linear', 'correlations', 'between', 'the', 'initial', 'number', 'and', 'the', 'initial', 'distances', 'of', 'gas', 'giants', 'and', 'the', 'survival', 'rate', 'of', 'habitable', 'planets', 'were', 'found', 'planetary', 'systems', 'consisting', 'of', 'two', 'giant', 'planets', 'are', 'fairly', 'benign', 'to', 'terrestrial', 'planets', 'whereas', 'six', 'giant', 'planets', 'very', 'often', 'lead', 'to', 'a', 'complete', 'clearing', 'of', 'the', 'habitable', 'zone', 'systems', 'with', 'initial', 'distances', 'of', 'five', 'hill', 'radii', 'between', 'the', 'giant', 'planets', 'have', 'a', 'high', 'chance', 'to', 'harbour', 'a', 'habitable', 'planet', 'although', 'more', 'compact', 'systems', 'are', 'very', 'destructive', 'the', 'giant', 'planet', 'masses', 'have', 'a', 'smaller', 'impact', 'on', 'the', 'stability', 'of', 'habitable', 'worlds', 'additionally', 'a', 'link', 'between', 'the', 'presentday', 'orbit', 'of', 'an', 'observed', 'giant', 'exoplanet', 'and', 'the', 'survival', 'rate', 'of', 'habitable', 'planets', 'was', 'established', 'as', 'a', 'rule', 'of', 'thumb', 'observed', 'gas', 'giants', 'with', 'eccentricities', 'higher', 'than', '04', 'and', 'inclinations', 'higher', 'than', '20', 'degrees', 'have', 'experienced', 'strong', 'planetplanet', 'scatterings', 'and', 'are', 'unlikely', 'to', 'have', 'a', 'habitable', 'planet', 'in', 'its', 'system', 'furthermore', 'it', 'was', 'found', 'that', 'habitable', 'planets', 'surrounding', 'a', 'k', 'or', 'mstar', 'have', 'a', 'higher', 'survival', 'rate', 'than', 'those', 'surrounding', 'a', 'gstar']] | [-0.1813383229803909, 0.18735880286236214, -0.06081041825829812, 0.09512674038974955, -0.10304580079918763, -0.027490684879012406, 0.12169299883029933, 0.30652827995846854, -0.1140666795824215, -0.3623635104242361, 0.08482402015240195, -0.28441788968190834, -0.0967969585261703, 0.20357301082145773, -0.07169696695329446, 0.042768342701393125, 0.18536461988718794, -0.04583164496821755, -0.02427889743824226, -0.31637458348523756, 0.2855332330923598, 0.05415316120774116, -0.01644730471197586, -0.05066930953026661, -0.0062846210837926506, -0.1329144339560408, 0.03597135561746809, -0.09054162647786006, -0.19872812934001283, 0.030445183594798985, 0.26443350710115343, 0.11349142795200196, 0.25573006120492825, -0.395719905542034, -0.2313612171746944, 0.0768195960442272, 0.1793376433750931, 0.016802880051985103, -0.01706884856899225, -0.26331244759736055, 0.08766835376901447, -0.2548219974925917, -0.2190503640785673, 0.042498871960835356, 0.11828743020722748, 0.030061671051706346, -0.2626143259382895, 0.0953783725370776, 0.07710182734947423, 0.16603189051537862, -0.13326459453256695, -0.19183953898335052, -0.11567850391345344, 0.10321710611087323, 0.017456684779651524, -0.023137631024813875, 0.2292249738238752, -0.06005386419436139, 0.007798575508443393, 0.4389091839609703, -0.09220528104820262, -0.04941124222153481, 0.3747313116492598, -0.27770596757390587, -0.05679634805188848, 0.1608350241205321, 0.20714062170810857, 0.16812196947230063, -0.17209896418213283, -0.03772107930260904, -0.002419051503376016, 0.14233904572133466, 0.15763194713882117, 0.07784335226356491, 0.46869996971854905, 0.1568548243255618, 0.110041350690112, 0.01792987387029911, -0.2132184405960494, -0.09217349971174527, -0.08707330906587951, -0.14322611027625654, -0.13688958112044997, -0.0009479246093487402, -0.09875268512443894, -0.14859055812242178, 0.28965743405377614, 0.12931341750125558, 0.19209341249288112, 0.028683595581173477, 0.28830218465541896, 0.06456374267801501, 0.13914116334767554, 0.10862588291320036, 0.3671021012360898, 0.14543139481881878, 0.049563514435540815, -0.2771964849271583, 0.13237855312291463, -0.05148208684832701] |
1,802.05737 | JU_KS@SAIL_CodeMixed-2017: Sentiment Analysis for Indian Code Mixed
Social Media Texts | This paper reports about our work in the NLP Tool Contest @ICON-2017, shared
task on Sentiment Analysis for Indian Languages (SAIL) (code mixed). To
implement our system, we have used a machine learning algo-rithm called
Multinomial Na\"ive Bayes trained using n-gram and SentiWordnet features. We
have also used a small SentiWordnet for English and a small SentiWordnet for
Bengali. But we have not used any SentiWordnet for Hindi language. We have
tested our system on Hindi-English and Bengali-English code mixed social media
data sets released for the contest. The performance of our system is very close
to the best system participated in the contest. For both Bengali-English and
Hindi-English runs, our system was ranked at the 3rd position out of all
submitted runs and awarded the 3rd prize in the contest.
| cs.CL | this paper reports about our work in the nlp tool contest icon2017 shared task on sentiment analysis for indian languages sail code mixed to implement our system we have used a machine learning algorithm called multinomial naive bayes trained using ngram and sentiwordnet features we have also used a small sentiwordnet for english and a small sentiwordnet for bengali but we have not used any sentiwordnet for hindi language we have tested our system on hindienglish and bengalienglish code mixed social media data sets released for the contest the performance of our system is very close to the best system participated in the contest for both bengalienglish and hindienglish runs our system was ranked at the 3rd position out of all submitted runs and awarded the 3rd prize in the contest | [['this', 'paper', 'reports', 'about', 'our', 'work', 'in', 'the', 'nlp', 'tool', 'contest', 'icon2017', 'shared', 'task', 'on', 'sentiment', 'analysis', 'for', 'indian', 'languages', 'sail', 'code', 'mixed', 'to', 'implement', 'our', 'system', 'we', 'have', 'used', 'a', 'machine', 'learning', 'algorithm', 'called', 'multinomial', 'naive', 'bayes', 'trained', 'using', 'ngram', 'and', 'sentiwordnet', 'features', 'we', 'have', 'also', 'used', 'a', 'small', 'sentiwordnet', 'for', 'english', 'and', 'a', 'small', 'sentiwordnet', 'for', 'bengali', 'but', 'we', 'have', 'not', 'used', 'any', 'sentiwordnet', 'for', 'hindi', 'language', 'we', 'have', 'tested', 'our', 'system', 'on', 'hindienglish', 'and', 'bengalienglish', 'code', 'mixed', 'social', 'media', 'data', 'sets', 'released', 'for', 'the', 'contest', 'the', 'performance', 'of', 'our', 'system', 'is', 'very', 'close', 'to', 'the', 'best', 'system', 'participated', 'in', 'the', 'contest', 'for', 'both', 'bengalienglish', 'and', 'hindienglish', 'runs', 'our', 'system', 'was', 'ranked', 'at', 'the', '3rd', 'position', 'out', 'of', 'all', 'submitted', 'runs', 'and', 'awarded', 'the', '3rd', 'prize', 'in', 'the', 'contest']] | [-0.015078765847003803, -0.02207165989630784, -0.08815610224309449, 0.09604313888658698, -0.11761711114802613, -0.1725441567814694, 0.07646226895202954, 0.3760570228672945, -0.19995630504921652, -0.3451045925120035, 0.07199925690835629, -0.3420112502447759, -0.11298970887795663, 0.24385368872362262, -0.08232089863516963, 0.07648142448698099, 0.15711994929095874, 0.065238792841466, 0.04749633016136403, -0.38036846932596885, 0.2848639443301811, 0.045865227396671586, 0.3468460548024338, 0.004686174792452501, 0.12425829710958239, -0.030954487333432413, -0.05286339344814993, -0.03448072710575966, -0.05736366729968442, 0.12828605432206622, 0.3311456651552222, 0.24247837606101083, 0.3154501231817099, -0.34208136217023893, -0.10015437176021245, 0.058290580541898424, 0.08746254650804286, 0.1164339717083539, -0.01637607594557966, -0.3292575952811883, 0.09141540096248858, -0.23991455484468202, 0.054079087841539426, -0.11230357190450797, 0.017984864939577305, -0.022279786490477047, -0.246065113613776, -0.0019313754462368356, 0.09265122059732675, 0.14707200589876335, -0.03461265420684448, -0.1928840531851165, 0.02857270413615669, 0.20414715857030108, 0.03395892875806357, 0.08275769667055172, 0.08436222829981349, -0.09693353931921032, -0.1879065936574569, 0.42971529616759374, -0.11252061522100121, -0.17966236643170794, 0.20888997855990266, -0.04034055990095322, -0.20480311482141797, 0.012334470547816286, 0.29180642023969156, 0.101121346365947, -0.1672185193317441, 0.013357232437164595, -0.09029671109926242, 0.2583912789642524, 0.10157524030297421, -0.11833393411137737, 0.17678936431811262, 0.23974373610690236, -0.07018209760650419, 0.15542916617571162, -0.06639310766074162, -0.04330428540437984, -0.20215082248726574, -0.1438531628308388, -0.17329526925101302, -0.0837689136789637, -0.019312879990656465, -0.14638303915719286, 0.3844865083237752, 0.21558139324188233, 0.06826276373691284, 0.10273974136664317, 0.2609664481921265, -0.0047982478433718475, 0.10160585104917677, 0.13767553352518008, 0.18716378974226805, -0.04958559986777031, 0.2370767282250409, -0.15196324366216477, 0.11894148931337091, 0.05250079125376383] |
1,802.05738 | The spin of the second-born black hole in coalescing binary black holes | Various binary black hole formation channels have been proposed since the
first gravitational event GW150914 was discovered by the Advanced Laser
Interferometer Gravitational-Wave Observatory (AdLIGO). For all evolutionary
channels based on the evolution of isolated binaries, the immediate progenitor
of the binary black hole is a close binary system composed of a black hole and
a helium star. We perform detailed binary evolution and systematically explore
the parameter space of initial binary properties, including initial black hole
and helium star masses, initial rotation of the helium star as well as
metallicity. We argue that the spin of the first-born black hole at its birth
is negligible ($\lesssim 0.1$), hence the second-born black hole's spin
dominates the measured effective spin, $\chi_{\rm eff}$, from gravitational
wave events of double black hole mergers. We find that tides can be important
only when orbital periods are shorter than 2 days. Upon core collapse, the
helium star produces a black hole (the second-born black hole in the system)
with a spin that can span the entire range from zero to maximally spinning. We
show that the bimodal distribution of the spin of the second-born black hole
obtained in recent papers is mainly due to oversimplifying assumptions. We find
an anti-correlation between the merging timescale of the two black holes,
T$_{\rm merger}$, and the effective spin $\chi_{\rm eff}$. Finally, we provide
new prescriptions for the tidal coefficient E$_2$ for both H-rich and the
helium-rich stars. We predict that, with future improvements to AdLIGO's
sensitivity, the sample of merging binary black hole systems will show an
overdensity of sources with positive but small $\chi_{\rm eff}$. originating
from lower mass black hole mergers born at low redshift.
| astro-ph.SR hep-ph | various binary black hole formation channels have been proposed since the first gravitational event gw150914 was discovered by the advanced laser interferometer gravitationalwave observatory adligo for all evolutionary channels based on the evolution of isolated binaries the immediate progenitor of the binary black hole is a close binary system composed of a black hole and a helium star we perform detailed binary evolution and systematically explore the parameter space of initial binary properties including initial black hole and helium star masses initial rotation of the helium star as well as metallicity we argue that the spin of the firstborn black hole at its birth is negligible lesssim 01 hence the secondborn black holes spin dominates the measured effective spin chi_rm eff from gravitational wave events of double black hole mergers we find that tides can be important only when orbital periods are shorter than 2 days upon core collapse the helium star produces a black hole the secondborn black hole in the system with a spin that can span the entire range from zero to maximally spinning we show that the bimodal distribution of the spin of the secondborn black hole obtained in recent papers is mainly due to oversimplifying assumptions we find an anticorrelation between the merging timescale of the two black holes t_rm merger and the effective spin chi_rm eff finally we provide new prescriptions for the tidal coefficient e_2 for both hrich and the heliumrich stars we predict that with future improvements to adligos sensitivity the sample of merging binary black hole systems will show an overdensity of sources with positive but small chi_rm eff originating from lower mass black hole mergers born at low redshift | [['various', 'binary', 'black', 'hole', 'formation', 'channels', 'have', 'been', 'proposed', 'since', 'the', 'first', 'gravitational', 'event', 'gw150914', 'was', 'discovered', 'by', 'the', 'advanced', 'laser', 'interferometer', 'gravitationalwave', 'observatory', 'adligo', 'for', 'all', 'evolutionary', 'channels', 'based', 'on', 'the', 'evolution', 'of', 'isolated', 'binaries', 'the', 'immediate', 'progenitor', 'of', 'the', 'binary', 'black', 'hole', 'is', 'a', 'close', 'binary', 'system', 'composed', 'of', 'a', 'black', 'hole', 'and', 'a', 'helium', 'star', 'we', 'perform', 'detailed', 'binary', 'evolution', 'and', 'systematically', 'explore', 'the', 'parameter', 'space', 'of', 'initial', 'binary', 'properties', 'including', 'initial', 'black', 'hole', 'and', 'helium', 'star', 'masses', 'initial', 'rotation', 'of', 'the', 'helium', 'star', 'as', 'well', 'as', 'metallicity', 'we', 'argue', 'that', 'the', 'spin', 'of', 'the', 'firstborn', 'black', 'hole', 'at', 'its', 'birth', 'is', 'negligible', 'lesssim', '01', 'hence', 'the', 'secondborn', 'black', 'holes', 'spin', 'dominates', 'the', 'measured', 'effective', 'spin', 'chi_rm', 'eff', 'from', 'gravitational', 'wave', 'events', 'of', 'double', 'black', 'hole', 'mergers', 'we', 'find', 'that', 'tides', 'can', 'be', 'important', 'only', 'when', 'orbital', 'periods', 'are', 'shorter', 'than', '2', 'days', 'upon', 'core', 'collapse', 'the', 'helium', 'star', 'produces', 'a', 'black', 'hole', 'the', 'secondborn', 'black', 'hole', 'in', 'the', 'system', 'with', 'a', 'spin', 'that', 'can', 'span', 'the', 'entire', 'range', 'from', 'zero', 'to', 'maximally', 'spinning', 'we', 'show', 'that', 'the', 'bimodal', 'distribution', 'of', 'the', 'spin', 'of', 'the', 'secondborn', 'black', 'hole', 'obtained', 'in', 'recent', 'papers', 'is', 'mainly', 'due', 'to', 'oversimplifying', 'assumptions', 'we', 'find', 'an', 'anticorrelation', 'between', 'the', 'merging', 'timescale', 'of', 'the', 'two', 'black', 'holes', 't_rm', 'merger', 'and', 'the', 'effective', 'spin', 'chi_rm', 'eff', 'finally', 'we', 'provide', 'new', 'prescriptions', 'for', 'the', 'tidal', 'coefficient', 'e_2', 'for', 'both', 'hrich', 'and', 'the', 'heliumrich', 'stars', 'we', 'predict', 'that', 'with', 'future', 'improvements', 'to', 'adligos', 'sensitivity', 'the', 'sample', 'of', 'merging', 'binary', 'black', 'hole', 'systems', 'will', 'show', 'an', 'overdensity', 'of', 'sources', 'with', 'positive', 'but', 'small', 'chi_rm', 'eff', 'originating', 'from', 'lower', 'mass', 'black', 'hole', 'mergers', 'born', 'at', 'low', 'redshift']] | [-0.1450749704590831, 0.1639073800787425, -0.05337247878343215, 0.15330822706823874, -0.07819859971369368, -0.08825021390401148, 0.04872609970407735, 0.3342685724035736, -0.13450422170303977, -0.33241556000078376, 0.06421477412855213, -0.3317638662255959, -0.04583017939112062, 0.23954702086353896, -0.0020101292656814988, -0.0004380092788202916, 0.09060539958224692, 0.006382524463948593, -0.15736771610320718, -0.2527385322588978, 0.36824805876776145, 0.09063608279089919, 0.12411742733993313, -0.048521209612033135, 0.08802891758742923, -0.0023153610234383304, 0.02407429827940014, -0.014478208160588162, -0.1728620999406074, -0.026115969660953222, 0.21967659700032083, 0.15489393435234353, 0.18838600827240312, -0.3711682501458762, -0.2290378973514458, 0.028333758009034846, 0.16332683894655955, 0.1580135805582378, -0.12218772977625737, -0.240217709751842, 0.07478021178750502, -0.32160557610847107, -0.12463115064354811, 0.041252760946911445, 0.11870092206815486, 0.019683818835363114, -0.21387992970638728, 0.1597176560285759, 0.09195733037082103, -0.08473884694449095, -0.12827043026885043, -0.09322228969205439, -0.11043359707034253, 0.06733007574583347, 0.08257867017402414, 0.08238711705456049, 0.19678618414025995, -0.07346711901398442, -0.07850047995724964, 0.3371514116444042, -0.0748841869341743, -0.044158225887448346, 0.20204374537779782, -0.2727087744052703, -0.1291055912579068, 0.11462695125101817, 0.16534982848669177, 0.1913735862132899, -0.142842243001187, 0.020297523175777446, 0.053819670003603076, 0.23460275935312305, 0.09806646456650506, 0.07942052532394464, 0.4762146533064866, 0.15167003170555296, -0.0005157051847497229, 0.10023056301991824, -0.17805444107143034, -0.04436281519412673, -0.1974131361407181, -0.09130230078661292, -0.1501607717481348, 0.1377321285441775, -0.1668432272344944, -0.14872221226017526, 0.29202388038878874, 0.10124925941248968, 0.18879824105931595, 0.004006523642313781, 0.2361860385098088, 0.08818857068708502, 0.034756453783191046, 0.1069270876005052, 0.3489178249833556, 0.16227936491172545, 0.09630606145758798, -0.2932324400975657, 0.02872098531957595, 0.030058389577324495] |
1,802.05739 | A Viscoelastic Catastrophe | We use a differential constitutive equation to model the flow of a
viscoelastic flow in a cross-slot geometry, which is known to exhibit
bistability above a critical flow rate. The novelty lies in two asymmetric
modifications to the geometry, which causes a change in the bifurcation diagram
such that one of the stable solutions becomes disconnected from the solution at
low flow speeds. First we show that it is possible to mirror one of the
modifications such that the system can be forced to the disconnected solution.
Then we show that a slow decrease of the flow rate, can cause the system to go
through a drastic change on a short time scale, also known as a catastrophe.
The short time scale could lead to a precise and simple experimental
measurement of the flow conditions at which the viscoelastic catastrophe
occurs. Since the phenomena is intrinsically related to the extensional
rheology of the fluid, we propose to exploit the phenomena for in-line
extensional rheometry.
| physics.flu-dyn cond-mat.soft cs.CE | we use a differential constitutive equation to model the flow of a viscoelastic flow in a crossslot geometry which is known to exhibit bistability above a critical flow rate the novelty lies in two asymmetric modifications to the geometry which causes a change in the bifurcation diagram such that one of the stable solutions becomes disconnected from the solution at low flow speeds first we show that it is possible to mirror one of the modifications such that the system can be forced to the disconnected solution then we show that a slow decrease of the flow rate can cause the system to go through a drastic change on a short time scale also known as a catastrophe the short time scale could lead to a precise and simple experimental measurement of the flow conditions at which the viscoelastic catastrophe occurs since the phenomena is intrinsically related to the extensional rheology of the fluid we propose to exploit the phenomena for inline extensional rheometry | [['we', 'use', 'a', 'differential', 'constitutive', 'equation', 'to', 'model', 'the', 'flow', 'of', 'a', 'viscoelastic', 'flow', 'in', 'a', 'crossslot', 'geometry', 'which', 'is', 'known', 'to', 'exhibit', 'bistability', 'above', 'a', 'critical', 'flow', 'rate', 'the', 'novelty', 'lies', 'in', 'two', 'asymmetric', 'modifications', 'to', 'the', 'geometry', 'which', 'causes', 'a', 'change', 'in', 'the', 'bifurcation', 'diagram', 'such', 'that', 'one', 'of', 'the', 'stable', 'solutions', 'becomes', 'disconnected', 'from', 'the', 'solution', 'at', 'low', 'flow', 'speeds', 'first', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'mirror', 'one', 'of', 'the', 'modifications', 'such', 'that', 'the', 'system', 'can', 'be', 'forced', 'to', 'the', 'disconnected', 'solution', 'then', 'we', 'show', 'that', 'a', 'slow', 'decrease', 'of', 'the', 'flow', 'rate', 'can', 'cause', 'the', 'system', 'to', 'go', 'through', 'a', 'drastic', 'change', 'on', 'a', 'short', 'time', 'scale', 'also', 'known', 'as', 'a', 'catastrophe', 'the', 'short', 'time', 'scale', 'could', 'lead', 'to', 'a', 'precise', 'and', 'simple', 'experimental', 'measurement', 'of', 'the', 'flow', 'conditions', 'at', 'which', 'the', 'viscoelastic', 'catastrophe', 'occurs', 'since', 'the', 'phenomena', 'is', 'intrinsically', 'related', 'to', 'the', 'extensional', 'rheology', 'of', 'the', 'fluid', 'we', 'propose', 'to', 'exploit', 'the', 'phenomena', 'for', 'inline', 'extensional', 'rheometry']] | [-0.1608043881048017, 0.13715297063505957, -0.141012885475747, 0.05569291720521727, -0.08779921100997343, -0.1266927751911259, 0.03070708197007728, 0.3152765179416392, -0.3488769037010171, -0.2446195708883063, 0.14291739334968465, -0.25943727615266676, -0.18087158358383287, 0.19541900018201686, -0.07985844295727453, 0.039199470806435294, 0.034038404848216464, 0.04892468995062589, -0.05624835272695835, -0.1609863592084588, 0.28761323555599805, 0.018256690665488927, 0.2824033830746463, 0.07772616616438893, 0.12189627458659433, -0.054457781558129484, 0.047644859766367564, 0.08037606837716317, -0.15326484425150272, 0.062475251255375217, 0.21128432952820908, 0.06144848355111984, 0.23077865261953642, -0.4368965778181829, -0.23395322828848913, 0.07844506896515491, 0.12732263328507543, 0.16173986833125195, -0.022901658266718875, -0.2025652612849116, 0.07042103391616299, -0.15556052915479351, -0.15974880238177208, -0.05282491244511997, 0.02116540964499752, 0.015254622524059036, -0.24362777433430538, 0.1143188158477154, 0.08522919276175543, 0.01533845275808722, -0.060267747567239696, 0.012705661653166228, -0.02370049867767659, 0.1175528930659156, 0.08122777445994249, 0.020835713910722604, 0.14640338118926327, -0.14625436810651657, -0.0578768491637098, 0.403722201360435, -0.07960807938389934, -0.1823502856394753, 0.23275152765350735, -0.14633761953403493, -0.08110923846763354, 0.17432324729132942, 0.20111086182920943, 0.10185674343417149, -0.11387464931098426, -0.011292704584243106, -0.025724181469541224, 0.1801549102784498, 0.06156189579846019, -0.030938221561926896, 0.18335810782410566, 0.19572334593479954, 0.0810768183479767, 0.15287878747572328, -0.07370842791804136, -0.1204879610964648, -0.32773861867125803, -0.15022872205576632, -0.1145242964848876, 0.054978617864501915, -0.08394588235609174, -0.18400328319871845, 0.38476485891335804, 0.1409823234056736, 0.23018184869561525, 0.019267343583079508, 0.28511091658459387, 0.11748163126020056, 0.08704374728315487, 0.07245381140979235, 0.2933205692040757, 0.09349857500140987, 0.14680874207420502, -0.25093257889469583, 0.08100681611700211, 0.06088542074487522] |
1,802.0574 | Domain size polydispersity effects on the structural and dynamical
properties in lipid monolayers with phase coexistence | Lipid monolayers with phase coexistence are a frequently used model for lipid
membranes. In these systems, domains of the liquid-condensed phase always
present size polydispersity. However, very few theoretical works consider size
distribution effects on the monolayer properties. Because of the difference in
surface densities, domains have excess dipolar density with respect to the
surrounding liquid expanded phase, originating a dipolar inter-domain
interaction. This interaction depends on the domain area, and hence the
presence of a domain size distribution is associated with interaction
polydispersity. Inter-domain interactions are fundamental to understanding the
structure and dynamics of the monolayer. For this reason, it is expected that
polydispersity significantly alters monolayer properties. By means of Brownian
dynamics simulations, we study the radial distribution function (RDF), the
average mean square displacement and the average time-dependent self-diffusion
coefficient, D(t), of lipid monolayers with normal distributed size domains. It
was found that polydispersity strongly affects the value of the interaction
strength obtained, which is greatly underestimated if polydispersity is not
considered. However, within a certain range of parameters, the RDF obtained
from a polydisperse model can be well approximated by that of a monodisperse
model, suitably fitting the interaction strength, even for 40%
polydispersities. For small interaction strengths or small polydispersities,
the polydisperse systems obtained from fitting the experimental RDF have an
average mean square displacement and D(t) in good agreement with that of the
monodisperse system.
| physics.bio-ph cond-mat.soft | lipid monolayers with phase coexistence are a frequently used model for lipid membranes in these systems domains of the liquidcondensed phase always present size polydispersity however very few theoretical works consider size distribution effects on the monolayer properties because of the difference in surface densities domains have excess dipolar density with respect to the surrounding liquid expanded phase originating a dipolar interdomain interaction this interaction depends on the domain area and hence the presence of a domain size distribution is associated with interaction polydispersity interdomain interactions are fundamental to understanding the structure and dynamics of the monolayer for this reason it is expected that polydispersity significantly alters monolayer properties by means of brownian dynamics simulations we study the radial distribution function rdf the average mean square displacement and the average timedependent selfdiffusion coefficient dt of lipid monolayers with normal distributed size domains it was found that polydispersity strongly affects the value of the interaction strength obtained which is greatly underestimated if polydispersity is not considered however within a certain range of parameters the rdf obtained from a polydisperse model can be well approximated by that of a monodisperse model suitably fitting the interaction strength even for 40 polydispersities for small interaction strengths or small polydispersities the polydisperse systems obtained from fitting the experimental rdf have an average mean square displacement and dt in good agreement with that of the monodisperse system | [['lipid', 'monolayers', 'with', 'phase', 'coexistence', 'are', 'a', 'frequently', 'used', 'model', 'for', 'lipid', 'membranes', 'in', 'these', 'systems', 'domains', 'of', 'the', 'liquidcondensed', 'phase', 'always', 'present', 'size', 'polydispersity', 'however', 'very', 'few', 'theoretical', 'works', 'consider', 'size', 'distribution', 'effects', 'on', 'the', 'monolayer', 'properties', 'because', 'of', 'the', 'difference', 'in', 'surface', 'densities', 'domains', 'have', 'excess', 'dipolar', 'density', 'with', 'respect', 'to', 'the', 'surrounding', 'liquid', 'expanded', 'phase', 'originating', 'a', 'dipolar', 'interdomain', 'interaction', 'this', 'interaction', 'depends', 'on', 'the', 'domain', 'area', 'and', 'hence', 'the', 'presence', 'of', 'a', 'domain', 'size', 'distribution', 'is', 'associated', 'with', 'interaction', 'polydispersity', 'interdomain', 'interactions', 'are', 'fundamental', 'to', 'understanding', 'the', 'structure', 'and', 'dynamics', 'of', 'the', 'monolayer', 'for', 'this', 'reason', 'it', 'is', 'expected', 'that', 'polydispersity', 'significantly', 'alters', 'monolayer', 'properties', 'by', 'means', 'of', 'brownian', 'dynamics', 'simulations', 'we', 'study', 'the', 'radial', 'distribution', 'function', 'rdf', 'the', 'average', 'mean', 'square', 'displacement', 'and', 'the', 'average', 'timedependent', 'selfdiffusion', 'coefficient', 'dt', 'of', 'lipid', 'monolayers', 'with', 'normal', 'distributed', 'size', 'domains', 'it', 'was', 'found', 'that', 'polydispersity', 'strongly', 'affects', 'the', 'value', 'of', 'the', 'interaction', 'strength', 'obtained', 'which', 'is', 'greatly', 'underestimated', 'if', 'polydispersity', 'is', 'not', 'considered', 'however', 'within', 'a', 'certain', 'range', 'of', 'parameters', 'the', 'rdf', 'obtained', 'from', 'a', 'polydisperse', 'model', 'can', 'be', 'well', 'approximated', 'by', 'that', 'of', 'a', 'monodisperse', 'model', 'suitably', 'fitting', 'the', 'interaction', 'strength', 'even', 'for', '40', 'polydispersities', 'for', 'small', 'interaction', 'strengths', 'or', 'small', 'polydispersities', 'the', 'polydisperse', 'systems', 'obtained', 'from', 'fitting', 'the', 'experimental', 'rdf', 'have', 'an', 'average', 'mean', 'square', 'displacement', 'and', 'dt', 'in', 'good', 'agreement', 'with', 'that', 'of', 'the', 'monodisperse', 'system']] | [-0.11912545472467015, 0.17573745433581517, -0.05498436038387413, 0.020612353346634495, 0.006577035092303287, -0.10787390627209907, 0.011189646483398975, 0.4083542147266638, -0.2669799289949562, -0.32895035363009967, 0.03333587185327855, -0.2888917455672408, -0.1320046837411254, 0.13780375172930728, 0.004941935706681207, 0.04943116244495563, 0.05156457744761492, -0.0060908937087768445, -0.047106534671342085, -0.20682526262396056, 0.260314370812747, 0.03420121012174565, 0.29224868973555124, 0.09826449593427874, 0.039362977611143955, 0.014758246504377735, 0.059916925760309984, 0.09305050843597754, -0.1833882653059529, 0.09453719106462338, 0.18583486573315103, -0.013066314944349552, 0.2241214368947903, -0.40192636248615127, -0.2517637364424603, 0.08392152345698813, 0.17346428378647114, 0.07651758198778186, -0.04418834264987432, -0.26403063244753233, 0.04378628800420657, -0.16001360198766318, -0.1431902144509165, -0.03601041597354671, 0.054267427428504045, 0.10338269986159107, -0.24684229775498945, 0.1484196653265668, 0.03402706443220782, 0.07922310689970365, -0.09687311498083823, -0.13480612332679573, -0.050866827379871644, 0.1103006883418066, 0.0545231148833409, 0.030532699844637967, 0.21539725559072712, -0.1678672518155983, -0.027641658450517317, 0.41177052780985834, -0.04267008569314266, -0.21412729742815312, 0.19486041477395463, -0.16834602401713314, -0.05539137515715202, 0.19239851214882472, 0.1552040353705904, 0.08610554386497192, -0.1415364839807254, 0.06612830901437479, -0.029467031744855415, 0.26409509461778014, 0.05481920225808964, 0.0020347540770118307, 0.22302812507538045, 0.2160950240952408, 0.023763272716947222, 0.14553024942186946, -0.09585092536846945, -0.14543774731092804, -0.21667535895400722, -0.11936927683975386, -0.23276538015950632, 0.011584641557736019, -0.14719696585721662, -0.19457846377804147, 0.3372152420793377, 0.12730345631058773, 0.1993403905739441, 0.07373600189786647, 0.23702286026825237, 0.08516223419700628, 0.07220319532991751, 0.010833797830602397, 0.2520515734167851, 0.12466651501599699, 0.09344925191658346, -0.23572378784276382, 0.1401548062046261, 0.009167221011391476] |
1,802.05741 | Implementation of an efficient linear-optical quantum router | In this paper, we report on experimental implementation of a linear-optical
quantum router. Our device allows single-photon polarization-encoded qubits to
be routed coherently into two spatial output modes depending on the state of
two identical control qubits. The polarization qubit state of the routed photon
is maintained during the routing operation. The success probability of our
scheme can be increased up to 25% making it the most efficient linear-optical
quantum router known to this date.
| quant-ph | in this paper we report on experimental implementation of a linearoptical quantum router our device allows singlephoton polarizationencoded qubits to be routed coherently into two spatial output modes depending on the state of two identical control qubits the polarization qubit state of the routed photon is maintained during the routing operation the success probability of our scheme can be increased up to 25 making it the most efficient linearoptical quantum router known to this date | [['in', 'this', 'paper', 'we', 'report', 'on', 'experimental', 'implementation', 'of', 'a', 'linearoptical', 'quantum', 'router', 'our', 'device', 'allows', 'singlephoton', 'polarizationencoded', 'qubits', 'to', 'be', 'routed', 'coherently', 'into', 'two', 'spatial', 'output', 'modes', 'depending', 'on', 'the', 'state', 'of', 'two', 'identical', 'control', 'qubits', 'the', 'polarization', 'qubit', 'state', 'of', 'the', 'routed', 'photon', 'is', 'maintained', 'during', 'the', 'routing', 'operation', 'the', 'success', 'probability', 'of', 'our', 'scheme', 'can', 'be', 'increased', 'up', 'to', '25', 'making', 'it', 'the', 'most', 'efficient', 'linearoptical', 'quantum', 'router', 'known', 'to', 'this', 'date']] | [-0.20051795550622045, 0.20700867502639692, -0.04435150345787406, -0.07431712521395335, -0.023143515636523563, -0.2605743129986028, 0.14046778678428382, 0.4524883443117142, -0.24051713836224128, -0.30873678089429935, 0.04342103559368601, -0.25045699428475926, -0.04748050518333912, 0.24609081936379273, -0.0529636974260211, 0.13379925525980071, 0.09176524745921294, 0.010604511002699534, 0.012995832599699497, -0.30141086553533875, 0.24726801300421358, 0.056986502008512616, 0.3728560255964597, 0.022246316727250814, 0.1604386581107974, -0.0019847198265294233, 0.015902768857777118, -0.10613665190835794, -0.028982659665246803, 0.10660759807564318, 0.3044140891109904, 0.12497676282965889, 0.23623790636658668, -0.4822681557883819, -0.15835675917565822, 0.06894905565616985, 0.14512896234790484, 0.19100272948543232, 0.0032891194988042115, -0.3129828612102816, 0.03774846853688359, -0.19904683458308378, -0.045834876966352266, -0.03924629554152489, -0.047195495944470166, -0.054928578113516174, -0.20209388891855876, -0.05264539662127694, 0.0028676038173337777, -0.047762673596541086, 0.06392923435429111, -0.004535031268994014, 0.005230465463052193, 0.14343675456320246, -0.11119936003349722, 0.03832748740911484, 0.209193158429116, -0.08300562120663622, -0.200354371642073, 0.30692750588059425, 0.0014105796068906785, -0.17166258307173848, 0.12275349104156097, -0.07487332448673745, -0.09112831903931995, 0.09717171411029994, 0.167273986749351, 0.10021128058433533, -0.14440417977049946, -0.02742237233867248, 0.031497079071899255, 0.2775400480379661, 0.06829648228983085, 0.1663653688505292, 0.1856439652790626, 0.19177332235500216, 0.10464390981942415, 0.20565164828362564, -0.085546418002729, -0.13471452075832835, -0.2928428508900106, -0.18340539411952098, -0.245606526384751, 0.1314183954273661, -0.05868324699501196, -0.08479145153115193, 0.4618221306910952, 0.19341564836290975, 0.13214840952927867, -0.010925961608688037, 0.3879474334915479, 0.10955124801956118, 0.07675456353152792, 0.09908035478244225, 0.26590594701468945, 0.1141253973916173, 0.05574110900362333, -0.25253564067805806, 0.08450625641892354, -0.04379753188540538] |
1,802.05742 | Subaru High-z Exploration of Low-Luminosity Quasars (SHELLQs) III. Star
formation properties of the host galaxies at $z \gtrsim 6$ studied with ALMA | We present our ALMA Cycle 4 measurements of the [CII] emission line and the
underlying far-infrared (FIR) continuum emission from four optically
low-luminosity ($M_{\rm 1450} > -25$) quasars at $z \gtrsim 6$ discovered by
the Subaru Hyper Suprime Cam (HSC) survey. The [CII] line and FIR continuum
luminosities lie in the ranges $L_{\rm [CII]} = (3.8-10.2) \times 10^8~L_\odot$
and $L_{\rm FIR} = (1.2-2.0) \times 10^{11}~L_\odot$, which are at least one
order of magnitude smaller than those of optically-luminous quasars at $z
\gtrsim 6$. We estimate the star formation rates (SFR) of our targets as
$\simeq 23-40~M_\odot ~{\rm yr}^{-1}$. Their line and continuum-emitting
regions are marginally resolved, and found to be comparable in size to those of
optically luminous quasars, indicating that their SFR or likely gas mass
surface densities (key controlling parameter of mass accretion) are accordingly
different. The $L_{\rm [CII]}/L_{\rm FIR}$ ratios of the hosts, $\simeq
(2.2-8.7) \times 10^{-3}$, are fully consistent with local star-forming
galaxies. Using the [CII] dynamics, we derived their dynamical masses within a
radius of 1.5-2.5 kpc as $\simeq (1.4-8.2) \times 10^{10}~M_\odot$. By
interpreting these masses as stellar ones, we suggest that these faint quasar
hosts are on or even below the star-forming main sequence at $z \sim 6$, i.e.,
they appear to be transforming into quiescent galaxies. This is in contrast to
the optically luminous quasars at those redshifts, which show starburst-like
properties. Finally, we find that the ratios of black hole mass to host galaxy
dynamical mass of the most of low-luminosity quasars including the HSC ones are
consistent with the local value. The mass ratios of the HSC quasars can be
reproduced by a semi-analytical model that assumes merger-induced black
hole-host galaxy evolution.
| astro-ph.GA | we present our alma cycle 4 measurements of the cii emission line and the underlying farinfrared fir continuum emission from four optically lowluminosity m_rm 1450 25 quasars at z gtrsim 6 discovered by the subaru hyper suprime cam hsc survey the cii line and fir continuum luminosities lie in the ranges l_rm cii 38102 times 108l_odot and l_rm fir 1220 times 1011l_odot which are at least one order of magnitude smaller than those of opticallyluminous quasars at z gtrsim 6 we estimate the star formation rates sfr of our targets as simeq 2340m_odot rm yr1 their line and continuumemitting regions are marginally resolved and found to be comparable in size to those of optically luminous quasars indicating that their sfr or likely gas mass surface densities key controlling parameter of mass accretion are accordingly different the l_rm ciil_rm fir ratios of the hosts simeq 2287 times 103 are fully consistent with local starforming galaxies using the cii dynamics we derived their dynamical masses within a radius of 1525 kpc as simeq 1482 times 1010m_odot by interpreting these masses as stellar ones we suggest that these faint quasar hosts are on or even below the starforming main sequence at z sim 6 ie they appear to be transforming into quiescent galaxies this is in contrast to the optically luminous quasars at those redshifts which show starburstlike properties finally we find that the ratios of black hole mass to host galaxy dynamical mass of the most of lowluminosity quasars including the hsc ones are consistent with the local value the mass ratios of the hsc quasars can be reproduced by a semianalytical model that assumes mergerinduced black holehost galaxy evolution | [['we', 'present', 'our', 'alma', 'cycle', '4', 'measurements', 'of', 'the', 'cii', 'emission', 'line', 'and', 'the', 'underlying', 'farinfrared', 'fir', 'continuum', 'emission', 'from', 'four', 'optically', 'lowluminosity', 'm_rm', '1450', '25', 'quasars', 'at', 'z', 'gtrsim', '6', 'discovered', 'by', 'the', 'subaru', 'hyper', 'suprime', 'cam', 'hsc', 'survey', 'the', 'cii', 'line', 'and', 'fir', 'continuum', 'luminosities', 'lie', 'in', 'the', 'ranges', 'l_rm', 'cii', '38102', 'times', '108l_odot', 'and', 'l_rm', 'fir', '1220', 'times', '1011l_odot', 'which', 'are', 'at', 'least', 'one', 'order', 'of', 'magnitude', 'smaller', 'than', 'those', 'of', 'opticallyluminous', 'quasars', 'at', 'z', 'gtrsim', '6', 'we', 'estimate', 'the', 'star', 'formation', 'rates', 'sfr', 'of', 'our', 'targets', 'as', 'simeq', '2340m_odot', 'rm', 'yr1', 'their', 'line', 'and', 'continuumemitting', 'regions', 'are', 'marginally', 'resolved', 'and', 'found', 'to', 'be', 'comparable', 'in', 'size', 'to', 'those', 'of', 'optically', 'luminous', 'quasars', 'indicating', 'that', 'their', 'sfr', 'or', 'likely', 'gas', 'mass', 'surface', 'densities', 'key', 'controlling', 'parameter', 'of', 'mass', 'accretion', 'are', 'accordingly', 'different', 'the', 'l_rm', 'ciil_rm', 'fir', 'ratios', 'of', 'the', 'hosts', 'simeq', '2287', 'times', '103', 'are', 'fully', 'consistent', 'with', 'local', 'starforming', 'galaxies', 'using', 'the', 'cii', 'dynamics', 'we', 'derived', 'their', 'dynamical', 'masses', 'within', 'a', 'radius', 'of', '1525', 'kpc', 'as', 'simeq', '1482', 'times', '1010m_odot', 'by', 'interpreting', 'these', 'masses', 'as', 'stellar', 'ones', 'we', 'suggest', 'that', 'these', 'faint', 'quasar', 'hosts', 'are', 'on', 'or', 'even', 'below', 'the', 'starforming', 'main', 'sequence', 'at', 'z', 'sim', '6', 'ie', 'they', 'appear', 'to', 'be', 'transforming', 'into', 'quiescent', 'galaxies', 'this', 'is', 'in', 'contrast', 'to', 'the', 'optically', 'luminous', 'quasars', 'at', 'those', 'redshifts', 'which', 'show', 'starburstlike', 'properties', 'finally', 'we', 'find', 'that', 'the', 'ratios', 'of', 'black', 'hole', 'mass', 'to', 'host', 'galaxy', 'dynamical', 'mass', 'of', 'the', 'most', 'of', 'lowluminosity', 'quasars', 'including', 'the', 'hsc', 'ones', 'are', 'consistent', 'with', 'the', 'local', 'value', 'the', 'mass', 'ratios', 'of', 'the', 'hsc', 'quasars', 'can', 'be', 'reproduced', 'by', 'a', 'semianalytical', 'model', 'that', 'assumes', 'mergerinduced', 'black', 'holehost', 'galaxy', 'evolution']] | [-0.03168803749711845, 0.11979096527719363, 0.034107027228244324, 0.12850532150065358, -0.04894670514559204, -0.07957716453227807, 0.02582053560043939, 0.4815197224644097, -0.06918436603324318, -0.33149940310892734, 0.06685865527569232, -0.3284224753589793, 0.04657798850273883, 0.18635624727739591, 0.0200447858908129, -0.0694234582874924, -0.04493213631297377, -0.16647616333243523, -0.05133671565616334, -0.2890025766274299, 0.294116434415125, 0.05692225173750723, 0.13574518356599252, -0.0653523116870995, 0.04474707097153772, -0.16782566228712148, -0.08076062268577516, -0.035310250622305, -0.19114754120533525, 0.006963297402994199, 0.2700163605766879, 0.10972828130491755, 0.19746795623478564, -0.27825030793774536, -0.14674504661720925, 0.08469399933025919, 0.2307720605927435, -6.002071144228632e-05, -0.001381856843575158, -0.27163673383437775, 0.09816461596024138, -0.17941223568240688, -0.16456637612628666, 0.11762813231801952, 0.041849078752777796, 0.033692009281367064, -0.21284312500872396, 0.21543618968179956, -0.004037187046752396, 0.07000956110994924, -0.1040992074620656, -0.12533660496754404, -0.14784343362362548, 0.009627503272230652, 0.0028477311456067997, 0.11553402321921154, 0.26172757094048643, -0.15477693156000566, -0.02104701707012613, 0.40016127814030783, -0.04461387234152591, 0.07186312291601842, 0.2367980570015921, -0.24498889554715292, -0.20098546624522318, 0.18067119146146896, 0.131870591157878, 0.134198941341178, -0.13483285415578972, -0.020979179304135457, -0.016029249471188948, 0.2851799512400546, 0.00902498568746854, 0.11918797422549687, 0.370932472741062, 0.07168244798667729, 0.024114665288308804, 0.018604361770928585, -0.22723165950314564, 0.00256608767604286, -0.23148426875302738, -0.056914921224074946, -0.1055974234293469, 0.17651231537065046, -0.19652460241325156, -0.036622541147622874, 0.28689057015348224, 0.11617574464275755, 0.2887363449255512, 0.14469651340464637, 0.28547811410643836, 0.11816900231367485, 0.1437817887703634, 0.143922747511586, 0.34005113008008764, 0.14936836355365812, 0.03653438077392903, -0.2234938338602131, 0.015116814834446731, 0.03334501478016715] |
1,802.05743 | A Multilevel Monte Carlo Ensemble Scheme for Solving Random Parabolic
PDEs | A first-order, Monte Carlo ensemble method has been recently introduced for
solving parabolic equations with random coefficients in [26], which is a
natural synthesis of the ensemble-based, Monte Carlo sampling algorithm and the
ensemble-based, first-order time stepping scheme. With the introduction of an
ensemble average of the diffusion function, this algorithm leads to a single
discrete system with multiple right-hand sides for a group of realizations,
which could be solved more efficiently than a sequence of linear systems. In
this paper, we pursue in the same direction and develop a new multilevel Monte
Carlo ensemble method for solving random parabolic partial differential
equations. Comparing with the approach in [26], this method possesses a
high-order accuracy in time and further reduces the computational cost by using
the multilevel Monte Carlo method. Rigorous numerical analysis shows the method
achieves the optimal rate of convergence. Several numerical experiments are
presented to illustrate the theoretical results.
| math.NA | a firstorder monte carlo ensemble method has been recently introduced for solving parabolic equations with random coefficients in 26 which is a natural synthesis of the ensemblebased monte carlo sampling algorithm and the ensemblebased firstorder time stepping scheme with the introduction of an ensemble average of the diffusion function this algorithm leads to a single discrete system with multiple righthand sides for a group of realizations which could be solved more efficiently than a sequence of linear systems in this paper we pursue in the same direction and develop a new multilevel monte carlo ensemble method for solving random parabolic partial differential equations comparing with the approach in 26 this method possesses a highorder accuracy in time and further reduces the computational cost by using the multilevel monte carlo method rigorous numerical analysis shows the method achieves the optimal rate of convergence several numerical experiments are presented to illustrate the theoretical results | [['a', 'firstorder', 'monte', 'carlo', 'ensemble', 'method', 'has', 'been', 'recently', 'introduced', 'for', 'solving', 'parabolic', 'equations', 'with', 'random', 'coefficients', 'in', '26', 'which', 'is', 'a', 'natural', 'synthesis', 'of', 'the', 'ensemblebased', 'monte', 'carlo', 'sampling', 'algorithm', 'and', 'the', 'ensemblebased', 'firstorder', 'time', 'stepping', 'scheme', 'with', 'the', 'introduction', 'of', 'an', 'ensemble', 'average', 'of', 'the', 'diffusion', 'function', 'this', 'algorithm', 'leads', 'to', 'a', 'single', 'discrete', 'system', 'with', 'multiple', 'righthand', 'sides', 'for', 'a', 'group', 'of', 'realizations', 'which', 'could', 'be', 'solved', 'more', 'efficiently', 'than', 'a', 'sequence', 'of', 'linear', 'systems', 'in', 'this', 'paper', 'we', 'pursue', 'in', 'the', 'same', 'direction', 'and', 'develop', 'a', 'new', 'multilevel', 'monte', 'carlo', 'ensemble', 'method', 'for', 'solving', 'random', 'parabolic', 'partial', 'differential', 'equations', 'comparing', 'with', 'the', 'approach', 'in', '26', 'this', 'method', 'possesses', 'a', 'highorder', 'accuracy', 'in', 'time', 'and', 'further', 'reduces', 'the', 'computational', 'cost', 'by', 'using', 'the', 'multilevel', 'monte', 'carlo', 'method', 'rigorous', 'numerical', 'analysis', 'shows', 'the', 'method', 'achieves', 'the', 'optimal', 'rate', 'of', 'convergence', 'several', 'numerical', 'experiments', 'are', 'presented', 'to', 'illustrate', 'the', 'theoretical', 'results']] | [-0.06769436426800798, 0.04433837216923788, -0.12720560881088636, 0.03589541450951641, -0.0416612687679988, -0.13799447823916317, 0.04398134046641644, 0.4051918046622488, -0.29059417427541984, -0.3290321618367575, 0.0975196929855309, -0.24385702186631725, -0.13571890974172243, 0.24540854102662324, -0.016793492433958147, 0.14266687192062627, 0.12231334661191795, -0.02912210178788212, -0.1294713529446438, -0.2708680100928943, 0.22841141069396767, 0.09853794278062292, 0.27571820406439274, -0.03885095442590108, 0.1592585370679827, 0.007598003389399597, -0.05270325915740901, 0.0354054013081814, -0.09126305471995454, 0.13794622537036622, 0.2302985672860431, 0.08069537691373721, 0.3578485539520012, -0.40233146741152986, -0.21688400685027437, 0.07685234799971927, 0.16776384194810434, 0.18264912229221264, -0.1014972764369304, -0.2729247799633365, 0.08147792761691992, -0.1791054859081908, -0.11515565161703546, -0.10296835044037404, -0.09371004106728115, 0.050317539089040735, -0.3250734374466303, 0.09001960058384084, 0.016900596668404575, 0.07036358765234534, -0.00012479766864041602, -0.13167172640264893, 0.05149380629192915, 0.044525215512533724, -0.0016685408481862396, 0.021550484902323468, 0.05040622160671965, -0.043733667252940665, -0.18884512402828, 0.34652397659068046, -0.08101618648049082, -0.2506316649994819, 0.15558694733159714, -0.08310739079330999, -0.14980686611287589, 0.19918843909123862, 0.18980714117826306, 0.2074844107325924, -0.17262347160814037, 0.08200378696729833, -0.03477983896032368, 0.1639565041696187, -0.01888271250094189, -0.058510217160035516, 0.0864814798850076, 0.22767748670211355, 0.08093818982658711, 0.16499028468708848, -0.08104688884754739, -0.20547564898151904, -0.25253687575375233, -0.18423336878645627, -0.17740038993284352, -0.006789879056190043, -0.12483260044619353, -0.16783138271229722, 0.3652913113742694, 0.21419339698714843, 0.14405617335394613, 0.10576606328648172, 0.31126806786816913, 0.1947326293386715, 0.00698032652718738, 0.06959548922321501, 0.1560817441756004, 0.14253346678053372, 0.07287312802088165, -0.27420281858710377, 0.0538333709180159, 0.15512721467224] |
1,802.05744 | Material Scaling and Frequency-Selective Enhancement of Near-Field
Radiative Heat Transfer for Lossy Metals in Two Dimensions via Inverse Design | The super-Planckian features of radiative heat transfer in the near-field are
known to depend strongly on both material and geometric design properties.
However, the relative importance and interplay of these two facets, and the
degree to which they can be used to ultimately control energy flow, remains an
open question. Recently derived bounds suggest that enhancements as large as
$|\chi|^4 \lambda^{2} / \left(\left(4\pi\right)^{2} \Im\left[\chi\right]^{2}
d^{2}\right)$ are possible between extended structures (compared to blackbody);
but neither geometries reaching this bound, nor designs revealing the predicted
material ($\chi$) scaling, have been previously reported. Here, exploiting
inverse techniques, in combination with fast computational approaches enabled
by the low-rank properties of elliptic operators for disjoint bodies, we
investigate this relation between material and geometry on an enlarged space
structures. Crucially, we find that the material proportionality given above
does indeed emerge in realistic structures. In reaching this result, we also
show that (in two dimensions) lossy metals such as tungsten, typically
considered to be poor candidate materials for strongly enhancing heat transfer
in the near infrared, can be structured to selectively realize flux rates that
come within $50\%$ of those exhibited by an ideal pair of resonant lossless
metals for separations as small as $2\%$ of a tunable design wavelength.
| physics.optics | the superplanckian features of radiative heat transfer in the nearfield are known to depend strongly on both material and geometric design properties however the relative importance and interplay of these two facets and the degree to which they can be used to ultimately control energy flow remains an open question recently derived bounds suggest that enhancements as large as chi4 lambda2 leftleft4piright2 imleftchiright2 d2right are possible between extended structures compared to blackbody but neither geometries reaching this bound nor designs revealing the predicted material chi scaling have been previously reported here exploiting inverse techniques in combination with fast computational approaches enabled by the lowrank properties of elliptic operators for disjoint bodies we investigate this relation between material and geometry on an enlarged space structures crucially we find that the material proportionality given above does indeed emerge in realistic structures in reaching this result we also show that in two dimensions lossy metals such as tungsten typically considered to be poor candidate materials for strongly enhancing heat transfer in the near infrared can be structured to selectively realize flux rates that come within 50 of those exhibited by an ideal pair of resonant lossless metals for separations as small as 2 of a tunable design wavelength | [['the', 'superplanckian', 'features', 'of', 'radiative', 'heat', 'transfer', 'in', 'the', 'nearfield', 'are', 'known', 'to', 'depend', 'strongly', 'on', 'both', 'material', 'and', 'geometric', 'design', 'properties', 'however', 'the', 'relative', 'importance', 'and', 'interplay', 'of', 'these', 'two', 'facets', 'and', 'the', 'degree', 'to', 'which', 'they', 'can', 'be', 'used', 'to', 'ultimately', 'control', 'energy', 'flow', 'remains', 'an', 'open', 'question', 'recently', 'derived', 'bounds', 'suggest', 'that', 'enhancements', 'as', 'large', 'as', 'chi4', 'lambda2', 'leftleft4piright2', 'imleftchiright2', 'd2right', 'are', 'possible', 'between', 'extended', 'structures', 'compared', 'to', 'blackbody', 'but', 'neither', 'geometries', 'reaching', 'this', 'bound', 'nor', 'designs', 'revealing', 'the', 'predicted', 'material', 'chi', 'scaling', 'have', 'been', 'previously', 'reported', 'here', 'exploiting', 'inverse', 'techniques', 'in', 'combination', 'with', 'fast', 'computational', 'approaches', 'enabled', 'by', 'the', 'lowrank', 'properties', 'of', 'elliptic', 'operators', 'for', 'disjoint', 'bodies', 'we', 'investigate', 'this', 'relation', 'between', 'material', 'and', 'geometry', 'on', 'an', 'enlarged', 'space', 'structures', 'crucially', 'we', 'find', 'that', 'the', 'material', 'proportionality', 'given', 'above', 'does', 'indeed', 'emerge', 'in', 'realistic', 'structures', 'in', 'reaching', 'this', 'result', 'we', 'also', 'show', 'that', 'in', 'two', 'dimensions', 'lossy', 'metals', 'such', 'as', 'tungsten', 'typically', 'considered', 'to', 'be', 'poor', 'candidate', 'materials', 'for', 'strongly', 'enhancing', 'heat', 'transfer', 'in', 'the', 'near', 'infrared', 'can', 'be', 'structured', 'to', 'selectively', 'realize', 'flux', 'rates', 'that', 'come', 'within', '50', 'of', 'those', 'exhibited', 'by', 'an', 'ideal', 'pair', 'of', 'resonant', 'lossless', 'metals', 'for', 'separations', 'as', 'small', 'as', '2', 'of', 'a', 'tunable', 'design', 'wavelength']] | [-0.0973107928475296, 0.14517284561797808, -0.028715748505869713, 0.057020597031344614, -0.06961041070188921, -0.15025093690863936, 0.03365750235533065, 0.4223159060878034, -0.296992065657004, -0.34102750367180695, 0.08963468509131471, -0.2559798955018309, -0.14422899135157907, 0.24416584993071744, -0.03846414366363557, 0.03810599803149995, 0.0023944710080493425, -0.03276394771430457, -0.0829958631896234, -0.18933608046142697, 0.3097071232696901, 0.07558879907252175, 0.28511065125954105, 0.08107652306605112, 0.04654872206634482, -0.04310800937536901, 0.004769372781462009, 0.038640137260294485, -0.12489533058836212, 0.112056493157484, 0.2622587584658747, 0.05086743161612476, 0.20146629210540767, -0.43116351292643806, -0.2428457510316431, 0.0888552845468385, 0.15942819563165944, 0.08584477493624747, -0.06253794621846795, -0.21428781921288348, 0.07477141055134402, -0.1367942410283336, -0.12903490966061443, -0.09266251828368767, 0.012800292450805554, 0.023199954067269286, -0.2460086516860762, 0.04317078639399883, 0.08395382464019205, 0.02365532849620253, -0.05753130096242542, -0.11876141939814765, -0.02201272824336544, 0.10637297383555681, 0.02249624044173351, -0.005560089936618241, 0.14253251336049289, -0.1560795880349279, -0.09714925558407708, 0.3656365900366143, -0.04833175815263818, -0.16927894735063362, 0.23398216380703143, -0.1424735353616012, -0.06561894377112609, 0.1421941379984232, 0.1703196668543272, 0.10492906491226046, -0.14013913854735321, 0.046819685701290054, -0.02991390941632303, 0.18250805674533424, 0.08460957098563229, 0.10973145853091806, 0.2222157113097313, 0.13962243748874875, 0.03532975182769414, 0.13429921650210175, -0.060845017426827054, -0.06196605543966756, -0.2544829970281018, -0.1483844817384944, -0.19031637455659486, 0.06485708790828675, -0.07566478694149403, -0.17210450451865753, 0.32433904367867894, 0.13578987661241967, 0.22967492668259984, -0.014575514007050839, 0.25195256255954357, 0.09176835432674016, 0.1089892727132693, 0.08237874978118216, 0.31444544903761107, 0.11905057099438907, 0.06375712764529813, -0.21147456254503497, 0.052566748590780296, 0.014584005338319642] |
1,802.05745 | Model reduction in chemical dynamics: slow invariant manifolds, singular
perturbations, thermodynamic estimates, and analysis of reaction graph | The paper has two goals:
It presents basic ideas, notions, and methods for reduction of reaction
kinetics models: quasi-steady-state, quasi-equilibrium, slow invariant
manifolds, and limiting steps.
It describes briefly the current state of the art and some latest
achievements in the broad area of model reduction in chemical and biochemical
kinetics, including new results in methods of invariant manifolds, computation
singular perturbation, bottleneck methods, asymptotology, tropical
equilibration, and reaction mechanism skeletonisation.
| physics.chem-ph | the paper has two goals it presents basic ideas notions and methods for reduction of reaction kinetics models quasisteadystate quasiequilibrium slow invariant manifolds and limiting steps it describes briefly the current state of the art and some latest achievements in the broad area of model reduction in chemical and biochemical kinetics including new results in methods of invariant manifolds computation singular perturbation bottleneck methods asymptotology tropical equilibration and reaction mechanism skeletonisation | [['the', 'paper', 'has', 'two', 'goals', 'it', 'presents', 'basic', 'ideas', 'notions', 'and', 'methods', 'for', 'reduction', 'of', 'reaction', 'kinetics', 'models', 'quasisteadystate', 'quasiequilibrium', 'slow', 'invariant', 'manifolds', 'and', 'limiting', 'steps', 'it', 'describes', 'briefly', 'the', 'current', 'state', 'of', 'the', 'art', 'and', 'some', 'latest', 'achievements', 'in', 'the', 'broad', 'area', 'of', 'model', 'reduction', 'in', 'chemical', 'and', 'biochemical', 'kinetics', 'including', 'new', 'results', 'in', 'methods', 'of', 'invariant', 'manifolds', 'computation', 'singular', 'perturbation', 'bottleneck', 'methods', 'asymptotology', 'tropical', 'equilibration', 'and', 'reaction', 'mechanism', 'skeletonisation']] | [-0.08269233520234555, 0.09174112914602311, -0.083454478998557, 0.07405834119032387, -0.012739586381530258, -0.15561992715401443, 0.015930907115418936, 0.30678967630464427, -0.2867940049093794, -0.26424042508006096, 0.08246694803139536, -0.2507161182994154, -0.18414980327730185, 0.19315464981228217, -0.09886051126645917, 0.12169645951641067, 0.11635138160667159, -0.035215602636757035, -0.07512807133804325, -0.25444109090702266, 0.3563626125638544, 0.04058467282611929, 0.3194981097755298, 0.10514882971650698, 0.13145169777743204, -0.05865190988800056, -0.06247023060839151, -0.04422891933575902, -0.19042616762535672, 0.11810405645519495, 0.28467957061801713, 0.16689541802125077, 0.2247192847319472, -0.4484618137210188, -0.23522963892819335, 0.06686993587342366, 0.13004912686547343, 0.16967149337378173, -0.016074015765490248, -0.20679060321196285, 0.00019789190674331827, -0.14892395125360977, -0.14084927314026674, -0.13522481541214904, 0.0336518010950949, 0.03972931433154244, -0.16776731864772212, 0.06399047666583473, 0.11008805866536855, 0.10186344661920423, -0.08931257317833026, -0.1757093529335, 0.02345057015149841, 0.08087686735900565, 0.06049448277794717, 0.002816583650534264, 0.20816962205818001, -0.12649245291594152, -0.16965475682379075, 0.33869832986637843, -0.08586504061142324, -0.17570232641456884, 0.20089421869242485, -0.06506664644349629, -0.2205828106634214, 0.15474480620100045, 0.12808251708850893, 0.13931700620721554, -0.17564829997390405, 0.10454592856653953, 0.08750434235577852, 0.04571849089378203, 0.034270333782048294, -0.010614702097651824, 0.11742542647350003, 0.26383995558922246, 0.04953890013128099, 0.060498259584485015, -0.04040872663075865, -0.22459933014822678, -0.2700451999955194, -0.1492073273197682, -0.09265780223953263, 0.06634882792935405, -0.0705678392532462, -0.1344631862577418, 0.41875040604614877, 0.1218064632988207, 0.15994385285744678, 0.029632592941044082, 0.3402478246831558, 0.04061494478431176, 0.0012527681152585527, 0.04437873511194763, 0.18729807112347924, 0.2068199799724028, 0.1637916413568695, -0.20109872474059673, 0.07298802379781091, 0.10615962876448028] |
1,802.05746 | Uniform boundedness in function spaces | We investigate several boundedness properties of function spaces considered
as uniform spaces.
| math.GN | we investigate several boundedness properties of function spaces considered as uniform spaces | [['we', 'investigate', 'several', 'boundedness', 'properties', 'of', 'function', 'spaces', 'considered', 'as', 'uniform', 'spaces']] | [-0.1520711126116415, 0.07626690180040896, -0.02945813280530274, 0.31593817728571594, -0.0666947237526377, 0.06455057432564597, -0.051949565298855305, 0.4624598106990258, -0.3562225252389908, -0.16364347253693268, 0.2058153470279649, -0.1763113751076162, -0.12571228171388307, 0.21516750438604504, -0.1176089000267287, 0.11735560062030952, -0.08022646714622776, -0.04211038056140145, -0.26481733346978825, -0.3219450892259677, 0.4893189159532388, -0.08923644518169264, 0.23950081644579768, 0.025566960064073403, 0.08363935413459937, 0.09654192999005318, -0.02378705609589815, 0.010905530924598375, -0.3402810165037711, 0.06401058752089739, 0.15562841265151897, 0.10169097528948139, 0.3824544933935006, -0.3543250175813834, -0.2763399037842949, 0.24755457664529482, 0.12926260172389448, -0.13919547743474445, -0.04721945780329406, -0.2834003437310457, 0.07730773118479799, -0.11707788830002148, -0.2201209906488657, -0.20944721220682064, -0.02405468886718154, 0.22186932930101952, -0.27061320437739295, -0.041405086095134415, 0.1367181222885847, 0.06575113139115274, -0.2636975183462103, -0.1444353866390884, -0.008410608085493246, 0.13488084364992878, 0.03708397760055959, -0.023186211784680683, 0.12131046445574611, -0.06923400734861691, -0.14329415063063303, 0.35176872244725627, -0.11157309481253226, -0.29770502789566916, 0.13160176536378762, -0.15834417256216207, -0.15149050927720964, -0.06703262686884652, 0.1703501349935929, 0.22542793241639933, -0.09729884068171184, 0.11748785463472207, -0.11072307219728827, 0.05870044510811567, 0.11642922701624532, 0.31083123572170734, 0.019796106964349747, 0.1440218836069107, 0.18830612829575935, 0.31369648159792024, 0.03756021141695479, -0.0441546621635401, -0.3400206007063389, -0.1534263053908944, -0.16243806201964617, 0.03695315991838773, -0.09355495714892943, -0.2779844369118412, 0.322789691388607, 0.06624023957798879, 0.20671692149092755, 0.10308185638859868, 0.18350693800797066, 0.035959718351174765, -0.0432765904503564, -0.02533083304297179, 0.19470099608103433, 0.29355491226306185, 0.10530912488078077, -0.05615725086924309, 0.05479757507176449, 0.24245025287382305] |
1,802.05747 | Systematic Weight Pruning of DNNs using Alternating Direction Method of
Multipliers | We present a systematic weight pruning framework of deep neural networks
(DNNs) using the alternating direction method of multipliers (ADMM). We first
formulate the weight pruning problem of DNNs as a constrained nonconvex
optimization problem, and then adopt the ADMM framework for systematic weight
pruning. We show that ADMM is highly suitable for weight pruning due to the
computational efficiency it offers. We achieve a much higher compression ratio
compared with prior work while maintaining the same test accuracy, together
with a faster convergence rate. Our models are released at
https://github.com/KaiqiZhang/admm-pruning
| cs.LG cs.CV | we present a systematic weight pruning framework of deep neural networks dnns using the alternating direction method of multipliers admm we first formulate the weight pruning problem of dnns as a constrained nonconvex optimization problem and then adopt the admm framework for systematic weight pruning we show that admm is highly suitable for weight pruning due to the computational efficiency it offers we achieve a much higher compression ratio compared with prior work while maintaining the same test accuracy together with a faster convergence rate our models are released at httpsgithubcomkaiqizhangadmmpruning | [['we', 'present', 'a', 'systematic', 'weight', 'pruning', 'framework', 'of', 'deep', 'neural', 'networks', 'dnns', 'using', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'we', 'first', 'formulate', 'the', 'weight', 'pruning', 'problem', 'of', 'dnns', 'as', 'a', 'constrained', 'nonconvex', 'optimization', 'problem', 'and', 'then', 'adopt', 'the', 'admm', 'framework', 'for', 'systematic', 'weight', 'pruning', 'we', 'show', 'that', 'admm', 'is', 'highly', 'suitable', 'for', 'weight', 'pruning', 'due', 'to', 'the', 'computational', 'efficiency', 'it', 'offers', 'we', 'achieve', 'a', 'much', 'higher', 'compression', 'ratio', 'compared', 'with', 'prior', 'work', 'while', 'maintaining', 'the', 'same', 'test', 'accuracy', 'together', 'with', 'a', 'faster', 'convergence', 'rate', 'our', 'models', 'are', 'released', 'at', 'httpsgithubcomkaiqizhangadmmpruning']] | [-0.08689020033925772, -0.029715660586953165, -0.07153278623397151, 0.037613816265689416, -0.10555551685392857, -0.1890796896794604, 0.10555561700991044, 0.4960833871530162, -0.3247101219733142, -0.29651842968952324, 0.07803887674171063, -0.19664835890548096, -0.16086398436843108, 0.15698800943791866, -0.08774074204266072, 0.13406491490184433, 0.14853213598641257, -0.017347250858114824, -0.12658836256143532, -0.33256790791638197, 0.22587319591806995, 0.13998098121664954, 0.3287696823788186, 0.016254403711193136, 0.12969835300722884, -0.02531573575300475, 0.001513360978828536, -0.012092694453895093, -0.05579740312766969, 0.19957296072971076, 0.24587805985603256, 0.15851332346598307, 0.38047202821407056, -0.4064647119285332, -0.2169494143480228, 0.11334167342477788, 0.18802376392090486, 0.09293787084882044, -0.05721803617957954, -0.21634940190447702, 0.16022040368213009, -0.17961013114286795, -0.024786925108896362, -0.1637451600490345, -0.09444013508812835, 0.012982562494127908, -0.30515898758959437, 0.07800905410743629, 0.058567828685045245, 0.006489435386740499, -0.07321901893657115, -0.20518546600101722, 0.05910970699818184, 0.00774787494705783, 0.07248577879379607, 0.11051621307463695, 0.12470084210443828, -0.14898196313426726, -0.11493499902620291, 0.3287704271160894, -0.028833100141491742, -0.2614082245777051, 0.14964335705671045, 0.02918865934221281, -0.1811465946957469, 0.1291858087371414, 0.2316559317625231, 0.1915952988434583, -0.12428327777112523, 0.012494235805934294, -0.007666649928109513, 0.14063255811213618, 0.0713686614866472, -0.02575443955655727, 0.086994619644247, 0.2710480896238652, 0.19097459761218893, 0.21889774890312563, -0.10723364773827294, -0.06704989233985544, -0.19493769132014777, -0.11685805483203796, -0.1614393803381568, -0.023134354827925564, -0.1393940470231529, -0.10292940243250794, 0.4395224850107398, 0.2009210757083363, 0.20940962858084175, 0.22182650737878348, 0.34459381277362505, 0.10961947194300592, 0.12099895175391187, 0.14521433799527586, 0.2216090026622017, 0.10074758716962404, 0.1109132441976625, -0.20403065770450565, 0.07749040457032, 0.11431399778100765] |
1,802.05748 | Effects of Sound Suppressors on Muzzle Velocity, Bullet Yaw, and Drag | Little has been published regarding whether and how sound suppressors impact
bullet flight, including velocity, bullet yaw, and drag. These parameters were
compared for four different bullets fired from a .300 Winchester Magnum under
four different muzzle conditions (no device and three different suppressors).
While effects were not observed in all cases, results indicate that sound
suppressors can have the effect of reducing bullet yaw and drag significantly,
and can also have small effects on muzzle velocity. Results further suggest
that bullets with a propensity to yaw demonstrate significant reductions in yaw
and drag when shot through a two stage symmetric suppressor versus unsuppressed
or with a conventional mouse-hole/K-baffle design.
| physics.pop-ph | little has been published regarding whether and how sound suppressors impact bullet flight including velocity bullet yaw and drag these parameters were compared for four different bullets fired from a 300 winchester magnum under four different muzzle conditions no device and three different suppressors while effects were not observed in all cases results indicate that sound suppressors can have the effect of reducing bullet yaw and drag significantly and can also have small effects on muzzle velocity results further suggest that bullets with a propensity to yaw demonstrate significant reductions in yaw and drag when shot through a two stage symmetric suppressor versus unsuppressed or with a conventional mouseholekbaffle design | [['little', 'has', 'been', 'published', 'regarding', 'whether', 'and', 'how', 'sound', 'suppressors', 'impact', 'bullet', 'flight', 'including', 'velocity', 'bullet', 'yaw', 'and', 'drag', 'these', 'parameters', 'were', 'compared', 'for', 'four', 'different', 'bullets', 'fired', 'from', 'a', '300', 'winchester', 'magnum', 'under', 'four', 'different', 'muzzle', 'conditions', 'no', 'device', 'and', 'three', 'different', 'suppressors', 'while', 'effects', 'were', 'not', 'observed', 'in', 'all', 'cases', 'results', 'indicate', 'that', 'sound', 'suppressors', 'can', 'have', 'the', 'effect', 'of', 'reducing', 'bullet', 'yaw', 'and', 'drag', 'significantly', 'and', 'can', 'also', 'have', 'small', 'effects', 'on', 'muzzle', 'velocity', 'results', 'further', 'suggest', 'that', 'bullets', 'with', 'a', 'propensity', 'to', 'yaw', 'demonstrate', 'significant', 'reductions', 'in', 'yaw', 'and', 'drag', 'when', 'shot', 'through', 'a', 'two', 'stage', 'symmetric', 'suppressor', 'versus', 'unsuppressed', 'or', 'with', 'a', 'conventional', 'mouseholekbaffle', 'design']] | [-0.07322049705975654, 0.18035852855623322, -0.08968612687938192, 0.0044250288305597175, -0.07522207071047483, -0.1777980952023494, 0.004860460650417264, 0.4134257001526378, -0.1945709821862962, -0.3437196336065729, 0.12118210037092299, -0.2877196372245197, -0.1329349521827815, 0.26852777298255304, -0.06589649932424503, 0.04797185531437949, 0.08923872043723585, -0.008698382190670128, -0.01195140726674624, -0.23705445268057734, 0.24047043110045638, 0.014627555551231597, 0.3139247033417363, 0.07406975076419595, 0.13044686781466697, -0.05735507807414116, -0.021185577795323398, 0.09102558213431554, -0.09253448676988935, -0.04587399051093531, 0.149820886308724, 0.08024909864912776, 0.2836825812873603, -0.46271689022304835, -0.23352352072834037, 0.05536098614404047, 0.16307830926315445, 0.10431294183514116, -0.07707024847816986, -0.2641768190682072, 0.059782294527933655, -0.18469840272424604, -0.07499003938735566, -0.02572861722567015, 0.061997166351863635, 0.07655050318323818, -0.2408682702893943, 0.1183562414325597, 0.05136262147290701, 0.08254819420269793, -0.08573468307171155, -0.18217992918841816, -0.06629850970650161, 0.13029850375783603, 0.07826264927172344, -0.009810485877096653, 0.17421728351877797, -0.148452499006116, -0.09422161664675784, 0.40937160286638474, -0.05212438699392671, -0.1984979393115888, 0.22150943562802342, -0.16879023641296145, -0.059599377555531206, 0.1398637187839658, 0.1788120206307482, 0.026221552029407274, -0.0909872387059699, -0.08378078556873973, -0.01201081362389097, 0.1739169258022836, 0.18302404056777488, 0.003961142246326845, 0.16803364282370442, 0.09193951497501177, 0.009955452184874081, 0.10249452752112928, -0.1792024185954317, -0.02566121796715177, -0.22903487085433746, -0.10388799754178359, -0.02663559073483123, -0.03352587635796495, -0.09471876756638435, -0.06903408068939354, 0.350240563456383, 0.16663707141695475, 0.17724110410307292, 0.0337535019692344, 0.33141110992679995, 0.03706486016529164, 0.10126326223662882, 0.0704226962428678, 0.30558488613718915, 0.03481870664162906, 0.0647244658256467, -0.2208896323157845, 0.1397113333137154, -0.03257016355982395] |
1,802.05749 | MHD stability of large scale liquid metal batteries | The aim of this paper is to develop a stability theory and a numerical model
for the three density-stratified electrically conductive liquid layers. Using
regular perturbation methods to reduce the full 3d problem to the shallow layer
model, the coupled wave and electric current equations are derived. The problem
set-up allows the weakly non-linear velocity field action and an arbitrary
vertical magnetic field. Further linearisation of the coupled equations is used
for the linear stability analysis in the case of uniform vertical magnetic
field. New analytical stability criteria accounting for the viscous damping are
derived for particular cases of practical interest and compared to the
numerical solutions for variety of materials used in the batteries. The new
criteria are equally applicable to the aluminium electrolysis cell MHD
stability estimates.
| physics.flu-dyn | the aim of this paper is to develop a stability theory and a numerical model for the three densitystratified electrically conductive liquid layers using regular perturbation methods to reduce the full 3d problem to the shallow layer model the coupled wave and electric current equations are derived the problem setup allows the weakly nonlinear velocity field action and an arbitrary vertical magnetic field further linearisation of the coupled equations is used for the linear stability analysis in the case of uniform vertical magnetic field new analytical stability criteria accounting for the viscous damping are derived for particular cases of practical interest and compared to the numerical solutions for variety of materials used in the batteries the new criteria are equally applicable to the aluminium electrolysis cell mhd stability estimates | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'develop', 'a', 'stability', 'theory', 'and', 'a', 'numerical', 'model', 'for', 'the', 'three', 'densitystratified', 'electrically', 'conductive', 'liquid', 'layers', 'using', 'regular', 'perturbation', 'methods', 'to', 'reduce', 'the', 'full', '3d', 'problem', 'to', 'the', 'shallow', 'layer', 'model', 'the', 'coupled', 'wave', 'and', 'electric', 'current', 'equations', 'are', 'derived', 'the', 'problem', 'setup', 'allows', 'the', 'weakly', 'nonlinear', 'velocity', 'field', 'action', 'and', 'an', 'arbitrary', 'vertical', 'magnetic', 'field', 'further', 'linearisation', 'of', 'the', 'coupled', 'equations', 'is', 'used', 'for', 'the', 'linear', 'stability', 'analysis', 'in', 'the', 'case', 'of', 'uniform', 'vertical', 'magnetic', 'field', 'new', 'analytical', 'stability', 'criteria', 'accounting', 'for', 'the', 'viscous', 'damping', 'are', 'derived', 'for', 'particular', 'cases', 'of', 'practical', 'interest', 'and', 'compared', 'to', 'the', 'numerical', 'solutions', 'for', 'variety', 'of', 'materials', 'used', 'in', 'the', 'batteries', 'the', 'new', 'criteria', 'are', 'equally', 'applicable', 'to', 'the', 'aluminium', 'electrolysis', 'cell', 'mhd', 'stability', 'estimates']] | [-0.12898260510216156, 0.07543416916270462, -0.011176495632344439, 0.036009453293910726, -0.06120131489488679, -0.13762644716617903, -0.008633746783602838, 0.32841069132898204, -0.2721488808368354, -0.28302317509940256, 0.11711552116501889, -0.22766763490433858, -0.11721454038331647, 0.2278199324658675, -0.014869265088652687, 0.1158873454357187, 0.033099595071069264, -0.017891118274063103, -0.04823568660780325, -0.20999004614229003, 0.300185387741139, 0.03434886787693168, 0.32830328904381095, 0.014681365301240553, 0.07580890165742978, -0.042495621285264115, 0.00942400390238956, 0.08171797856290465, -0.1689323786061344, 0.11030085345318671, 0.2213582694079265, 0.018646802962577157, 0.2522167246644349, -0.5075628727443459, -0.24734340863692206, 0.015629329545380072, 0.13760445256854675, 0.15890146830920562, -0.06611491422540718, -0.23210571629587243, 0.08983261696272349, -0.150315457821441, -0.17982017123609667, -0.08858456194776204, -0.022416947769585912, 0.047202642862423316, -0.3347046397510887, 0.07765377865284825, 0.06525580388811496, 0.04772347564693512, -0.16235560890288966, -0.08021099824285091, -0.029448322081837314, 0.11182012445069561, 0.04659542372962821, -0.01459620364530142, 0.13084710774538938, -0.15557132066270812, -0.05299370138646038, 0.3799694088655849, -0.08609090090635442, -0.2695243172491937, 0.20083912462357056, -0.08461040687249151, -0.04362494344895258, 0.14879241018274494, 0.19125050414252534, 0.15970478810427724, -0.16409985087685605, 0.07037786624480992, -0.031064170553387765, 0.13745151650045037, 0.031498330591116536, -0.03326117548037522, 0.2000588960512433, 0.1939083346014106, 0.07226842872404977, 0.13942323927993186, -0.09752459835738048, -0.09190744114678728, -0.2942200783609012, -0.156154232915462, -0.099925431572695, -0.00030334985712561176, -0.09297915193019435, -0.20525878048393614, 0.40969213913014346, 0.16656391663409592, 0.07475500422089483, 0.016314024235620055, 0.31994564753285676, 0.14741676014147756, 0.009827348812834754, 0.04536534918024558, 0.2798580353431649, 0.23530336180629657, 0.13394797485061857, -0.24446864957675743, 0.01639589063404489, 0.09367907216389801] |
1,802.0575 | Special subsets of the generalized Cantor space $2^\kappa$ and
generalized Baire space $\kappa^\kappa$ | In this paper, we are interested in parallels to the classical notions of
special subsets in $\R$ defined in the generalized Cantor and Baire spaces
($2^\kappa$ and $\kappa^\kappa$). We consider generalizations of the well-known
classes of special subsets, like Lusin sets, strongly null sets, concentrated
sets, perfectly meagre sets, $\sigma$-sets, $\gamma$-sets, sets with Menger,
Rothberger or Hurewicz property, but also of some less-know classes like
$X$-small sets, meagre additive sets, Ramsey null sets, Marczewski, Silver,
Miller and Laver-null sets. We notice that many classical theorems regarding
these classes can be relatively easy generalized to higher cardinals although
sometimes with some additional assumptions. This paper serves as a catalogue of
such results along with some other generalizations and open problems.
| math.LO | in this paper we are interested in parallels to the classical notions of special subsets in r defined in the generalized cantor and baire spaces 2kappa and kappakappa we consider generalizations of the wellknown classes of special subsets like lusin sets strongly null sets concentrated sets perfectly meagre sets sigmasets gammasets sets with menger rothberger or hurewicz property but also of some lessknow classes like xsmall sets meagre additive sets ramsey null sets marczewski silver miller and lavernull sets we notice that many classical theorems regarding these classes can be relatively easy generalized to higher cardinals although sometimes with some additional assumptions this paper serves as a catalogue of such results along with some other generalizations and open problems | [['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'parallels', 'to', 'the', 'classical', 'notions', 'of', 'special', 'subsets', 'in', 'r', 'defined', 'in', 'the', 'generalized', 'cantor', 'and', 'baire', 'spaces', '2kappa', 'and', 'kappakappa', 'we', 'consider', 'generalizations', 'of', 'the', 'wellknown', 'classes', 'of', 'special', 'subsets', 'like', 'lusin', 'sets', 'strongly', 'null', 'sets', 'concentrated', 'sets', 'perfectly', 'meagre', 'sets', 'sigmasets', 'gammasets', 'sets', 'with', 'menger', 'rothberger', 'or', 'hurewicz', 'property', 'but', 'also', 'of', 'some', 'lessknow', 'classes', 'like', 'xsmall', 'sets', 'meagre', 'additive', 'sets', 'ramsey', 'null', 'sets', 'marczewski', 'silver', 'miller', 'and', 'lavernull', 'sets', 'we', 'notice', 'that', 'many', 'classical', 'theorems', 'regarding', 'these', 'classes', 'can', 'be', 'relatively', 'easy', 'generalized', 'to', 'higher', 'cardinals', 'although', 'sometimes', 'with', 'some', 'additional', 'assumptions', 'this', 'paper', 'serves', 'as', 'a', 'catalogue', 'of', 'such', 'results', 'along', 'with', 'some', 'other', 'generalizations', 'and', 'open', 'problems']] | [-0.11427315335182858, 0.11092152565934471, -0.03692285202700516, 0.16888746045076225, -0.09673358209366942, -0.14473721886390883, 0.04840989213974761, 0.35384705177797326, -0.31899070631359416, -0.19013482647955995, 0.1273512290489603, -0.34067749696510746, -0.12096873948808182, 0.2511893195463425, -0.2041153252197044, 0.05067136694259684, 0.07234562656155723, 0.02929197843106271, -0.0337794556398876, -0.3024989498702906, 0.4150561585315856, -0.07591693130008684, 0.2247220320900067, 0.019730014216700762, 0.053498021716348314, -0.00925072451242033, -0.027746972049875505, 0.13155826779708651, -0.18720954164275788, 0.12562567249325843, 0.27078294768479877, 0.1681292905945909, 0.27147028476385204, -0.333242842863346, -0.1614938708411626, 0.21839833158823052, 0.0970211658779339, -0.006519411234907678, 0.03127353178770763, -0.30114040118321006, 0.08551923042074938, -0.11173938799063386, -0.16443580139733466, -0.10798802765503783, 0.034839483588163196, 0.09457819300085499, -0.2168563087290185, -0.022996456043419412, 0.14501723892794088, 0.08771838397911653, -0.05499551191841702, -0.15538880233813462, 0.011210764180226573, 0.023813507096151466, 0.046280828452115105, 0.029404520533842453, 0.046471331401021575, -0.031533074684657866, -0.14763207164902142, 0.3728878156057206, -0.0018971367690969131, -0.25023545248329576, 0.2518064554114344, -0.1715032785231697, -0.24806607998345562, 0.011236284508225348, 0.04754719857110417, 0.09243672093424689, -0.08664640128323488, 0.1713205197713627, -0.15048937087653783, 0.09950997091424331, 0.20562999978549137, 0.12716834665806, 0.13170142913767105, 0.05584557159454562, 0.08868016261388628, 0.21622585301470124, 0.02260539278082935, -0.04920141112033262, -0.3180626063910714, -0.09627825017729454, -0.11599846886759944, 0.07615105348542847, -0.11977729751228693, -0.2747614248174018, 0.30265857710639527, 0.08414657393085032, 0.15018558067446253, 0.10195631801214969, 0.21957103438386372, -0.00480358235252989, 0.010329050144405457, 0.10266482536199278, 0.10112512268598697, 0.15722288314959612, -0.007121576413769147, -0.022226471377633, 0.011166684779113737, 0.11775925061826048] |
1,802.05751 | Image Transformer | Image generation has been successfully cast as an autoregressive sequence
generation or transformation problem. Recent work has shown that self-attention
is an effective way of modeling textual sequences. In this work, we generalize
a recently proposed model architecture based on self-attention, the
Transformer, to a sequence modeling formulation of image generation with a
tractable likelihood. By restricting the self-attention mechanism to attend to
local neighborhoods we significantly increase the size of images the model can
process in practice, despite maintaining significantly larger receptive fields
per layer than typical convolutional neural networks. While conceptually
simple, our generative models significantly outperform the current state of the
art in image generation on ImageNet, improving the best published negative
log-likelihood on ImageNet from 3.83 to 3.77. We also present results on image
super-resolution with a large magnification ratio, applying an encoder-decoder
configuration of our architecture. In a human evaluation study, we find that
images generated by our super-resolution model fool human observers three times
more often than the previous state of the art.
| cs.CV | image generation has been successfully cast as an autoregressive sequence generation or transformation problem recent work has shown that selfattention is an effective way of modeling textual sequences in this work we generalize a recently proposed model architecture based on selfattention the transformer to a sequence modeling formulation of image generation with a tractable likelihood by restricting the selfattention mechanism to attend to local neighborhoods we significantly increase the size of images the model can process in practice despite maintaining significantly larger receptive fields per layer than typical convolutional neural networks while conceptually simple our generative models significantly outperform the current state of the art in image generation on imagenet improving the best published negative loglikelihood on imagenet from 383 to 377 we also present results on image superresolution with a large magnification ratio applying an encoderdecoder configuration of our architecture in a human evaluation study we find that images generated by our superresolution model fool human observers three times more often than the previous state of the art | [['image', 'generation', 'has', 'been', 'successfully', 'cast', 'as', 'an', 'autoregressive', 'sequence', 'generation', 'or', 'transformation', 'problem', 'recent', 'work', 'has', 'shown', 'that', 'selfattention', 'is', 'an', 'effective', 'way', 'of', 'modeling', 'textual', 'sequences', 'in', 'this', 'work', 'we', 'generalize', 'a', 'recently', 'proposed', 'model', 'architecture', 'based', 'on', 'selfattention', 'the', 'transformer', 'to', 'a', 'sequence', 'modeling', 'formulation', 'of', 'image', 'generation', 'with', 'a', 'tractable', 'likelihood', 'by', 'restricting', 'the', 'selfattention', 'mechanism', 'to', 'attend', 'to', 'local', 'neighborhoods', 'we', 'significantly', 'increase', 'the', 'size', 'of', 'images', 'the', 'model', 'can', 'process', 'in', 'practice', 'despite', 'maintaining', 'significantly', 'larger', 'receptive', 'fields', 'per', 'layer', 'than', 'typical', 'convolutional', 'neural', 'networks', 'while', 'conceptually', 'simple', 'our', 'generative', 'models', 'significantly', 'outperform', 'the', 'current', 'state', 'of', 'the', 'art', 'in', 'image', 'generation', 'on', 'imagenet', 'improving', 'the', 'best', 'published', 'negative', 'loglikelihood', 'on', 'imagenet', 'from', '383', 'to', '377', 'we', 'also', 'present', 'results', 'on', 'image', 'superresolution', 'with', 'a', 'large', 'magnification', 'ratio', 'applying', 'an', 'encoderdecoder', 'configuration', 'of', 'our', 'architecture', 'in', 'a', 'human', 'evaluation', 'study', 'we', 'find', 'that', 'images', 'generated', 'by', 'our', 'superresolution', 'model', 'fool', 'human', 'observers', 'three', 'times', 'more', 'often', 'than', 'the', 'previous', 'state', 'of', 'the', 'art']] | [-0.020938540940426468, -0.004854828038424413, -0.033735401936691015, 0.04561474695035607, -0.08801287213153035, -0.14671712579238697, 0.0065424409956731915, 0.45064420739089595, -0.23394188404733524, -0.3520037457457132, 0.035585980559285926, -0.27025612585863773, -0.19335479264666972, 0.19205187080350852, -0.147211764002296, 0.07082650968777401, 0.12349465509777414, 0.029172527289690352, -0.04984092920709997, -0.31332628208022434, 0.2660452878369933, 0.08436966423749835, 0.38246115259054675, -0.025894182730058328, 0.12631284919727218, -0.03764162605529177, -0.009767052621068157, -0.033149256938572465, -0.04582591863587077, 0.18170444595079163, 0.22086344625809545, 0.1852421021218461, 0.3049443900232484, -0.43209890444823623, -0.27444085289211667, 0.08340829759615766, 0.16099369269106867, 0.12925923694911573, -0.046023375587279564, -0.34296284433724306, 0.09788999154326125, -0.1852751377013859, 0.04287470132112503, -0.10165649838194515, -0.012515579117462039, -0.05141291901443054, -0.29735367353344283, 0.03643789282522819, 0.11371634175970644, 0.03986953728496147, -0.057772027557307974, -0.13536909538921874, 0.02334577482077982, 0.11417970756074336, 0.01942423384511959, 0.12125425798316988, 0.13741584842302698, -0.2199985729850768, -0.14760213820318852, 0.3203841025814326, -0.09967378893754852, -0.2114184985967827, 0.16722631489874565, -0.05975095143530672, -0.13936620757545856, 0.10577276415197101, 0.20929004519781064, 0.14421123251340975, -0.14673741630239953, -0.019156171547623693, -0.07794613645759207, 0.22939935688634772, 0.06701957224730469, -0.014045028246046436, 0.18164400495561225, 0.2766899603953552, 0.02537819218529752, 0.1641342884533041, -0.1360672904101349, -0.0800745178829636, -0.17341721351616657, -0.07031894372135522, -0.19762449965126172, 0.007218952781862452, -0.09512869342775827, -0.13450194035912313, 0.43440995353257517, 0.262995701371389, 0.23286416359003304, 0.13754629697540455, 0.35455664526120095, 0.05552375711605349, 0.14999438720664351, 0.06266537672818015, 0.20885866900255695, 0.030509184800727656, 0.1150294956682283, -0.1473846008316421, 0.09860554414721394, 0.07487374322506814] |
1,802.05752 | Field-induced Ferrohastatic Order in Cubic Non-Kramers Doublet Systems | Cubic Pr-based compounds with $\Gamma_3$ non-Kramers doublet ground states
can realize a novel heavy Fermi liquid with spinorial hybridization ('hastatic'
order) that breaks time reversal symmetry. Several Pr-"1-2-20" materials
exhibit a suggestive heavy Fermi liquid stabilized in intermediate magnetic
fields; these provide key insight into the quadrupolar Kondo lattice. We
develop a simple, yet realistic microscopic model of ferrohastatic order, and
elaborate its experimental signatures and behavior in field, where it is a good
candidate to explain the observed heavy Fermi liquids at intermediate fields in
Pr(Ir,Rh)$_2$Zn$_{20}$. In addition, we develop the Landau theory of
ferrohastatic order, which allows us to understand its behavior close to the
transition and explore thermodynamic signatures from magnetic susceptibility to
thermal expansion.
| cond-mat.str-el | cubic prbased compounds with gamma_3 nonkramers doublet ground states can realize a novel heavy fermi liquid with spinorial hybridization hastatic order that breaks time reversal symmetry several pr1220 materials exhibit a suggestive heavy fermi liquid stabilized in intermediate magnetic fields these provide key insight into the quadrupolar kondo lattice we develop a simple yet realistic microscopic model of ferrohastatic order and elaborate its experimental signatures and behavior in field where it is a good candidate to explain the observed heavy fermi liquids at intermediate fields in prirrh_2zn_20 in addition we develop the landau theory of ferrohastatic order which allows us to understand its behavior close to the transition and explore thermodynamic signatures from magnetic susceptibility to thermal expansion | [['cubic', 'prbased', 'compounds', 'with', 'gamma_3', 'nonkramers', 'doublet', 'ground', 'states', 'can', 'realize', 'a', 'novel', 'heavy', 'fermi', 'liquid', 'with', 'spinorial', 'hybridization', 'hastatic', 'order', 'that', 'breaks', 'time', 'reversal', 'symmetry', 'several', 'pr1220', 'materials', 'exhibit', 'a', 'suggestive', 'heavy', 'fermi', 'liquid', 'stabilized', 'in', 'intermediate', 'magnetic', 'fields', 'these', 'provide', 'key', 'insight', 'into', 'the', 'quadrupolar', 'kondo', 'lattice', 'we', 'develop', 'a', 'simple', 'yet', 'realistic', 'microscopic', 'model', 'of', 'ferrohastatic', 'order', 'and', 'elaborate', 'its', 'experimental', 'signatures', 'and', 'behavior', 'in', 'field', 'where', 'it', 'is', 'a', 'good', 'candidate', 'to', 'explain', 'the', 'observed', 'heavy', 'fermi', 'liquids', 'at', 'intermediate', 'fields', 'in', 'prirrh_2zn_20', 'in', 'addition', 'we', 'develop', 'the', 'landau', 'theory', 'of', 'ferrohastatic', 'order', 'which', 'allows', 'us', 'to', 'understand', 'its', 'behavior', 'close', 'to', 'the', 'transition', 'and', 'explore', 'thermodynamic', 'signatures', 'from', 'magnetic', 'susceptibility', 'to', 'thermal', 'expansion']] | [-0.15494166209426677, 0.2383258451129599, -0.0936603848099837, 0.1146513392139178, -0.08649577689758534, -0.1936151685578556, 0.069285916440502, 0.33990599383030023, -0.23883462813682854, -0.3097001201441062, -0.008208163070556676, -0.28086853103026255, -0.11255896938884438, 0.09001302275734407, 0.06032043430504614, -0.0071750103088561445, -0.07366040106541638, 0.006873447644967859, -0.11523249525986291, -0.18390137360206452, 0.2626358771271169, 0.014980915480229104, 0.2888452194446441, 0.08932487385604403, 0.06782414644539099, -0.04626767014771507, 0.1448757523823337, -0.0023452125044122083, -0.14315214585584382, 0.05370001970732119, 0.2519401921127955, -0.10083702336675648, 0.17000660977069418, -0.46939125962170036, -0.2074503898138887, 0.04644312530029405, 0.12352677892716922, 0.1616028399871068, -0.07950971947565418, -0.28681297818648405, 0.006639839997033364, -0.17797472148507448, -0.19026650317366525, -0.22586576971386013, -0.06167969682779773, -0.06736316151790529, -0.2551708974843395, 0.08938589758352088, 0.02838516684353416, 0.09464232475850089, -0.09366557549871905, -0.10803556662245557, -0.031637862880698184, 0.058801630463708066, 0.0878111715799856, 0.04353943739511908, 0.1055370724678706, -0.12740750503244586, -0.11341948766694886, 0.42419842706896876, -0.07492235376688267, -0.06135322684261563, 0.22276510522464504, -0.2010879216927449, -0.14849846939765046, 0.1886747572169607, 0.143025276928554, 0.05322384346950928, -0.11284754153919117, 0.06568551195056804, -0.01970956564463418, 0.15729756224378622, -0.024663228726867287, 0.07925964430163229, 0.2936737570301469, 0.19207321704718575, -0.0076349917036513315, 0.1552813750418738, -0.11810636039470034, -0.09722579035362036, -0.2656715855419893, -0.17583280662074685, -0.16631490896969778, 0.037764179719519675, -0.047472290658208356, -0.17404983488939188, 0.4335738711283895, 0.1725895220999895, 0.1991578693710396, -0.07133938439676121, 0.21139854994795187, 0.07571791379274961, 0.06575330359668567, 0.04399216656296129, 0.22742733349652303, 0.15452948955373422, 0.09252516332821085, -0.2918061891446243, 0.03315023641936995, 0.060817447105615305] |
1,802.05753 | Bayesian variable selection in linear dynamical systems | We develop a method for reconstructing regulatory interconnection networks
between variables evolving according to a linear dynamical system. The work is
motivated by the problem of gene regulatory network inference, that is, finding
causal effects between genes from gene expression time series data. In
biological applications, the typical problem is that the sampling frequency is
low, and consequentially the system identification problem is ill-posed. The
low sampling frequency also makes it impossible to estimate derivatives
directly from the data. We take a Bayesian approach to the problem, as it
offers a natural way to incorporate prior information to deal with the
ill-posedness, through the introduction of sparsity promoting prior for the
underlying dynamics matrix. It also provides a framework for modelling both the
process and measurement noises. We develop Markov Chain Monte Carlo samplers
for the discrete-valued zero-structure of the dynamics matrix, and for the
continuous-time trajectory of the system.
| stat.ME math.OC q-bio.QM | we develop a method for reconstructing regulatory interconnection networks between variables evolving according to a linear dynamical system the work is motivated by the problem of gene regulatory network inference that is finding causal effects between genes from gene expression time series data in biological applications the typical problem is that the sampling frequency is low and consequentially the system identification problem is illposed the low sampling frequency also makes it impossible to estimate derivatives directly from the data we take a bayesian approach to the problem as it offers a natural way to incorporate prior information to deal with the illposedness through the introduction of sparsity promoting prior for the underlying dynamics matrix it also provides a framework for modelling both the process and measurement noises we develop markov chain monte carlo samplers for the discretevalued zerostructure of the dynamics matrix and for the continuoustime trajectory of the system | [['we', 'develop', 'a', 'method', 'for', 'reconstructing', 'regulatory', 'interconnection', 'networks', 'between', 'variables', 'evolving', 'according', 'to', 'a', 'linear', 'dynamical', 'system', 'the', 'work', 'is', 'motivated', 'by', 'the', 'problem', 'of', 'gene', 'regulatory', 'network', 'inference', 'that', 'is', 'finding', 'causal', 'effects', 'between', 'genes', 'from', 'gene', 'expression', 'time', 'series', 'data', 'in', 'biological', 'applications', 'the', 'typical', 'problem', 'is', 'that', 'the', 'sampling', 'frequency', 'is', 'low', 'and', 'consequentially', 'the', 'system', 'identification', 'problem', 'is', 'illposed', 'the', 'low', 'sampling', 'frequency', 'also', 'makes', 'it', 'impossible', 'to', 'estimate', 'derivatives', 'directly', 'from', 'the', 'data', 'we', 'take', 'a', 'bayesian', 'approach', 'to', 'the', 'problem', 'as', 'it', 'offers', 'a', 'natural', 'way', 'to', 'incorporate', 'prior', 'information', 'to', 'deal', 'with', 'the', 'illposedness', 'through', 'the', 'introduction', 'of', 'sparsity', 'promoting', 'prior', 'for', 'the', 'underlying', 'dynamics', 'matrix', 'it', 'also', 'provides', 'a', 'framework', 'for', 'modelling', 'both', 'the', 'process', 'and', 'measurement', 'noises', 'we', 'develop', 'markov', 'chain', 'monte', 'carlo', 'samplers', 'for', 'the', 'discretevalued', 'zerostructure', 'of', 'the', 'dynamics', 'matrix', 'and', 'for', 'the', 'continuoustime', 'trajectory', 'of', 'the', 'system']] | [-0.08675243289228654, 0.04672387058084093, -0.08446134081822913, 0.09627355063213638, -0.10883691694881242, -0.13201929144514413, 0.07175233947955897, 0.3891835138451733, -0.3435654286763962, -0.3019208058421094, 0.12064219477677081, -0.23944261158041455, -0.21143731236615648, 0.17574531903752943, -0.06364775068851676, 0.0891541837270828, 0.10081383472171006, 0.003947479870707897, -0.020033921285426158, -0.1883877999268022, 0.2992977477585109, 0.09997969630155587, 0.27815711614519556, -0.03522203507170631, 0.16538165203895694, 0.04147577823191294, -0.03684908209912379, -0.03231276317946683, -0.09920209472822791, 0.13978711193452445, 0.2920428059195112, 0.2112029188089135, 0.3387898483607393, -0.4109222303775933, -0.25384887005358736, 0.13405039745864253, 0.10945150877142813, 0.1738299546738299, -0.015379532021564125, -0.2743704231368415, 0.04837531302024254, -0.15282439990219154, -0.06032103221650992, -0.0979289999294201, -0.01622059419376138, -0.02587576626546856, -0.3350374620445323, 0.11321734286643152, 0.03582713790077735, 0.03774243155056798, -0.04474894061915877, -0.07998674788946698, 0.01625108764500626, 0.14716586395598097, 0.055606248948509, 0.012550152621807018, 0.12846954650520628, -0.09076982672051245, -0.11364796407045734, 0.33555169911326954, -0.015596533477800155, -0.2609514221970942, 0.17232753633327733, -0.08752353274069677, -0.1675926153923091, 0.12573137491841443, 0.1886463857024608, 0.08824182610064996, -0.23150211032136225, 0.07977598348879349, 0.01276271192406948, 0.1576117828719618, -0.004643547719019471, -0.006958188673468845, 0.15093563177979133, 0.23644237844085933, 0.0986813642975293, 0.15268560097027015, -0.09127075796409341, -0.1434544911670605, -0.2215007213100591, -0.12898641442192482, -0.20178705535129013, 0.012832977985588197, -0.12597072046945862, -0.18417771075752207, 0.37875680286037244, 0.2167599533515459, 0.18998033894638486, 0.09718687200900042, 0.3018178452343849, 0.1205243374331973, 0.02623840962847595, 0.033644049708112675, 0.13763258131939743, 0.1624736949917079, 0.11062169343783151, -0.2240914617033813, 0.14008876399743378, 0.023878080345340225] |
1,802.05754 | Extended Mean Field Control Problems: stochastic maximum principle and
transport perspective | We study Mean Field stochastic control problems where the cost function and
the state dynamics depend upon the joint distribution of the controlled state
and the control process. We prove suitable versions of the Pontryagin
stochastic maximum principle, both in necessary and in sufficient form, which
extend the known conditions to this general framework. Furthermore, we suggest
a variational approach to study a weak formulation of these control problems.
We show a natural connection between this weak formulation and optimal
transport on path space, which inspires a novel discretization scheme.
| math.OC math.PR | we study mean field stochastic control problems where the cost function and the state dynamics depend upon the joint distribution of the controlled state and the control process we prove suitable versions of the pontryagin stochastic maximum principle both in necessary and in sufficient form which extend the known conditions to this general framework furthermore we suggest a variational approach to study a weak formulation of these control problems we show a natural connection between this weak formulation and optimal transport on path space which inspires a novel discretization scheme | [['we', 'study', 'mean', 'field', 'stochastic', 'control', 'problems', 'where', 'the', 'cost', 'function', 'and', 'the', 'state', 'dynamics', 'depend', 'upon', 'the', 'joint', 'distribution', 'of', 'the', 'controlled', 'state', 'and', 'the', 'control', 'process', 'we', 'prove', 'suitable', 'versions', 'of', 'the', 'pontryagin', 'stochastic', 'maximum', 'principle', 'both', 'in', 'necessary', 'and', 'in', 'sufficient', 'form', 'which', 'extend', 'the', 'known', 'conditions', 'to', 'this', 'general', 'framework', 'furthermore', 'we', 'suggest', 'a', 'variational', 'approach', 'to', 'study', 'a', 'weak', 'formulation', 'of', 'these', 'control', 'problems', 'we', 'show', 'a', 'natural', 'connection', 'between', 'this', 'weak', 'formulation', 'and', 'optimal', 'transport', 'on', 'path', 'space', 'which', 'inspires', 'a', 'novel', 'discretization', 'scheme']] | [-0.11953937329558863, 0.05840152721438143, -0.10539493129278223, 0.08331149973877877, -0.08824041242866466, -0.112203624089145, 0.08648617875555323, 0.35262432595094045, -0.3526043542557292, -0.29637658776094516, 0.10137287699876146, -0.14406743029442926, -0.21286771782777375, 0.17175360332346626, -0.10029960467169682, 0.08746045669411412, 0.07162297258101817, 0.007972874202662045, -0.0996023950613259, -0.1898254987369809, 0.33435907220183353, 0.00397542632288403, 0.337619499489665, 0.0703033733375681, 0.18538549959970016, 0.050717643529383676, 0.01117116218794965, 0.05040549020664508, -0.18750104705492657, 0.14416956996493455, 0.1788160728911559, 0.12646629667789158, 0.33588092998704977, -0.4343865397075812, -0.22389902292440336, 0.11284260443644598, 0.07038205715620684, 0.12062062095178085, -0.028340975938934004, -0.2607960391168793, 0.062099538264252865, -0.13183328091270394, -0.1160754903840522, -0.08591994830769384, -0.06378272941413646, 0.040365200772389975, -0.335442045579354, 0.062258341008176406, 0.05693479658932322, -0.00018737702113058832, -0.10915905059987886, -0.05818213298270065, 0.0454771749351898, 0.08291127933189273, 0.010247736408362268, 0.01495870664043145, 0.0846071152947843, -0.11269353576935828, -0.11281689068612953, 0.3386544189105431, -0.06644252316715817, -0.23984892181017334, 0.1694247602795561, -0.10369340253786909, -0.16121523285077677, 0.07462511139197482, 0.22404072189496624, 0.22423495061488616, -0.17662725834589865, 0.07328362339434938, -0.04006964090642416, 0.13020584475662972, -0.014420482961253988, 0.04102891116312498, 0.12566499524570343, 0.14924080048480795, 0.18852541073251308, 0.15939815720646747, -0.03761300626469569, -0.18024190350746114, -0.35546264946460726, -0.18031386103894975, -0.13661934359826974, 0.037662567431107165, -0.07692518085176643, -0.15332174092634684, 0.36629971165558445, 0.18106339976915883, 0.1722399598918855, 0.08491898035346013, 0.2602732840615014, 0.17427590628762524, -0.01729907289975219, 0.08699552177761992, 0.21595616208182442, 0.17073917818617904, 0.08709012112166319, -0.2690923946418075, 0.04973789784643385, 0.09586879133453799] |
1,802.05755 | Development of Highly Efficient Multi-invariable Wireless Sensor System
Design for Energy Harvesting | Capillary wireless sensor networks devoted to air quality monitoring have
provided vital information on dangerous air conditions. In adopting the
environmentally generated energy as the fundamental energy source the main
challenge is the implementation of capillary networks rather than replacing the
batteries on a set period of times that leads to functional dilemma of devices
management and high costs. In this paper we present a battery-less,
self-governing, multi-parametric sensing platform for air quality monitoring
that harvests environment energy for long run. Furthermore study on sensor
section with their results have also been described in the paper. A customized
process of calibration to check the sensors' sensitivity and a basic portfolio
of variant energy sources over the power recovery section could productively
improve air quality standards tracing in indoor and outdoor application, in a
kind of 'set and forget' scenario.
| eess.SP cs.CY cs.NI | capillary wireless sensor networks devoted to air quality monitoring have provided vital information on dangerous air conditions in adopting the environmentally generated energy as the fundamental energy source the main challenge is the implementation of capillary networks rather than replacing the batteries on a set period of times that leads to functional dilemma of devices management and high costs in this paper we present a batteryless selfgoverning multiparametric sensing platform for air quality monitoring that harvests environment energy for long run furthermore study on sensor section with their results have also been described in the paper a customized process of calibration to check the sensors sensitivity and a basic portfolio of variant energy sources over the power recovery section could productively improve air quality standards tracing in indoor and outdoor application in a kind of set and forget scenario | [['capillary', 'wireless', 'sensor', 'networks', 'devoted', 'to', 'air', 'quality', 'monitoring', 'have', 'provided', 'vital', 'information', 'on', 'dangerous', 'air', 'conditions', 'in', 'adopting', 'the', 'environmentally', 'generated', 'energy', 'as', 'the', 'fundamental', 'energy', 'source', 'the', 'main', 'challenge', 'is', 'the', 'implementation', 'of', 'capillary', 'networks', 'rather', 'than', 'replacing', 'the', 'batteries', 'on', 'a', 'set', 'period', 'of', 'times', 'that', 'leads', 'to', 'functional', 'dilemma', 'of', 'devices', 'management', 'and', 'high', 'costs', 'in', 'this', 'paper', 'we', 'present', 'a', 'batteryless', 'selfgoverning', 'multiparametric', 'sensing', 'platform', 'for', 'air', 'quality', 'monitoring', 'that', 'harvests', 'environment', 'energy', 'for', 'long', 'run', 'furthermore', 'study', 'on', 'sensor', 'section', 'with', 'their', 'results', 'have', 'also', 'been', 'described', 'in', 'the', 'paper', 'a', 'customized', 'process', 'of', 'calibration', 'to', 'check', 'the', 'sensors', 'sensitivity', 'and', 'a', 'basic', 'portfolio', 'of', 'variant', 'energy', 'sources', 'over', 'the', 'power', 'recovery', 'section', 'could', 'productively', 'improve', 'air', 'quality', 'standards', 'tracing', 'in', 'indoor', 'and', 'outdoor', 'application', 'in', 'a', 'kind', 'of', 'set', 'and', 'forget', 'scenario']] | [-0.13037453134202484, 0.06923866600448118, -0.0313760726377636, 0.0094241382460188, -0.04557227860740889, -0.1182648243496476, 0.0630687961326376, 0.4180073581850357, -0.2174916124547557, -0.35034734951399216, 0.14282264076290557, -0.27929208971720804, -0.11611052143568401, 0.22927293150431122, -0.14177088129917065, 0.0773397449189596, 0.10599052277142383, 0.009557019527197527, 0.028371983030207937, -0.21339180121171497, 0.2693782328349947, 0.13881532063292298, 0.3508744658433276, 0.11250001777017074, 0.11237983351318742, 0.00032743667218860964, -0.04030140276714362, -0.01460764826469713, -0.09454315381592371, 0.1296886526359741, 0.31552280403888056, 0.14332609381292202, 0.30022067086194915, -0.48186814068086287, -0.2565564053793096, 0.11702593566561721, 0.09765834148500865, 0.016072448164437356, -0.07854524257395203, -0.28213846802765086, 0.10441695049044127, -0.23150382304845527, -0.10720613051577314, -0.03584172395761493, -0.02075927553149007, 0.023418471627540405, -0.24801597567677175, 0.01063746706772723, -0.03870354019936255, 0.08048948175910352, -0.08265369528162933, -0.07020793705106639, 0.026005639795133536, 0.15691784881189358, 0.0297905426895792, -0.018290215410566857, 0.19627731379536953, -0.14409493577746982, -0.08564185755655652, 0.39296942822159464, -0.0354772609274955, -0.16334277031299987, 0.17119150808777847, -0.037125337460219, -0.12423332171554831, 0.11052251490596816, 0.2445860763730334, 0.06493422888307715, -0.20579253414498389, 0.018027818957798054, 0.045207864846096193, 0.1727082872589072, 0.0972352767875753, 0.05867908308416498, 0.1621242366118102, 0.25974972955815545, 0.13245977387133745, 0.11768745058953173, -0.08289200322963833, -0.035303100554955946, -0.2445657759596654, -0.16413447711819434, -0.1903873129710957, 0.07213208039220852, -0.047132842463404344, -0.11686530851603237, 0.3998397741694566, 0.1713503646805025, 0.10302146949693092, 0.0381107817893084, 0.369545352424113, 0.043107842233596476, 0.0540724884558062, 0.04994462743039719, 0.19637919108135451, 0.041952846653880084, 0.1869543928204091, -0.16383376625691468, 0.09295715938704155, 0.002754234306835871] |
1,802.05756 | Inferring relevant features: from QFT to PCA | In many-body physics, renormalization techniques are used to extract aspects
of a statistical or quantum state that are relevant at large scale, or for low
energy experiments. Recent works have proposed that these features can be
formally identified as those perturbations of the states whose
distinguishability most resist coarse-graining. Here, we examine whether this
same strategy can be used to identify important features of an unlabeled
dataset. This approach indeed results in a technique very similar to kernel PCA
(principal component analysis), but with a kernel function that is
automatically adapted to the data, or "learned". We test this approach on
handwritten digits, and find that the most relevant features are significantly
better for classification than those obtained from a simple gaussian kernel.
| cs.LG quant-ph stat.ML | in manybody physics renormalization techniques are used to extract aspects of a statistical or quantum state that are relevant at large scale or for low energy experiments recent works have proposed that these features can be formally identified as those perturbations of the states whose distinguishability most resist coarsegraining here we examine whether this same strategy can be used to identify important features of an unlabeled dataset this approach indeed results in a technique very similar to kernel pca principal component analysis but with a kernel function that is automatically adapted to the data or learned we test this approach on handwritten digits and find that the most relevant features are significantly better for classification than those obtained from a simple gaussian kernel | [['in', 'manybody', 'physics', 'renormalization', 'techniques', 'are', 'used', 'to', 'extract', 'aspects', 'of', 'a', 'statistical', 'or', 'quantum', 'state', 'that', 'are', 'relevant', 'at', 'large', 'scale', 'or', 'for', 'low', 'energy', 'experiments', 'recent', 'works', 'have', 'proposed', 'that', 'these', 'features', 'can', 'be', 'formally', 'identified', 'as', 'those', 'perturbations', 'of', 'the', 'states', 'whose', 'distinguishability', 'most', 'resist', 'coarsegraining', 'here', 'we', 'examine', 'whether', 'this', 'same', 'strategy', 'can', 'be', 'used', 'to', 'identify', 'important', 'features', 'of', 'an', 'unlabeled', 'dataset', 'this', 'approach', 'indeed', 'results', 'in', 'a', 'technique', 'very', 'similar', 'to', 'kernel', 'pca', 'principal', 'component', 'analysis', 'but', 'with', 'a', 'kernel', 'function', 'that', 'is', 'automatically', 'adapted', 'to', 'the', 'data', 'or', 'learned', 'we', 'test', 'this', 'approach', 'on', 'handwritten', 'digits', 'and', 'find', 'that', 'the', 'most', 'relevant', 'features', 'are', 'significantly', 'better', 'for', 'classification', 'than', 'those', 'obtained', 'from', 'a', 'simple', 'gaussian', 'kernel']] | [-0.010109266090184086, 0.07700708883966421, -0.15721123933610393, 0.11351813733903313, -0.07728296324868149, -0.1747915017990229, -0.002582593032582928, 0.38563075757063014, -0.2788616971745027, -0.3068030114035781, 0.11052389805417175, -0.29415688987791055, -0.1745392718197157, 0.23143044320253156, -0.04650706942647514, 0.08532130898627627, 0.10947148517016472, 0.06356749005002402, -0.047481483564053364, -0.2611562049061787, 0.3236407411050021, 0.07553353559176582, 0.2971068023916001, 0.0099673660706759, 0.051530899266793766, -0.061121518097106156, -0.03909231062100186, 0.03112411583826794, -0.07984090116886777, 0.1326363142537203, 0.32905294156736953, 0.1464305720140597, 0.2704721781372176, -0.39948870430935207, -0.23390778579097998, 0.09773157410157042, 0.1410441253356999, 0.14850175733170737, -0.013348408233624225, -0.2995964625199151, 0.1253028274930226, -0.14308727770377466, -0.07510869244749589, -0.1896594335945944, -0.0233615414216751, -0.032036967012402794, -0.2525856031248785, 0.06820770677716691, 0.06984058753738741, 0.030977125716872694, -0.03158626740805926, -0.13600038095733258, 0.03943894678590501, 0.12529958793855597, 0.03404289417771426, 0.022136127750381707, 0.14966864352364365, -0.15134398333115004, -0.12327938204313196, 0.3730313717804062, -0.06990720508717156, -0.2241968257064984, 0.2401834605943139, -0.0780303110557843, -0.17461120883926629, 0.09156420919476305, 0.1948402174256318, 0.12467182964574909, -0.16483492146026554, -0.0054423233356451755, -0.048285898195988525, 0.19330349732644675, 0.03841284664188761, 0.033273462402990193, 0.15678277489070486, 0.14486033041635907, 0.021451511160977852, 0.11555851547698665, -0.1076262212752145, -0.05413757465264904, -0.2646308555797772, -0.09891769295270608, -0.23415966918010536, 0.02504811947976004, -0.08785076035511759, -0.15749983047324467, 0.41213820336341134, 0.21270902886441567, 0.2409299462730807, 0.03685850126108503, 0.28785909344328614, 0.09361422086812222, 0.13013729958499715, 0.08138220045314269, 0.20375006091383444, 0.04334451111858877, 0.04622000860565198, -0.17139924048518052, 0.07411374007559919, 0.046600765003482016] |
1,802.05757 | Stochastic Wasserstein Barycenters | We present a stochastic algorithm to compute the barycenter of a set of
probability distributions under the Wasserstein metric from optimal transport.
Unlike previous approaches, our method extends to continuous input
distributions and allows the support of the barycenter to be adjusted in each
iteration. We tackle the problem without regularization, allowing us to recover
a sharp output whose support is contained within the support of the true
barycenter. We give examples where our algorithm recovers a more meaningful
barycenter than previous work. Our method is versatile and can be extended to
applications such as generating super samples from a given distribution and
recovering blue noise approximations.
| cs.LG math.OC stat.ML | we present a stochastic algorithm to compute the barycenter of a set of probability distributions under the wasserstein metric from optimal transport unlike previous approaches our method extends to continuous input distributions and allows the support of the barycenter to be adjusted in each iteration we tackle the problem without regularization allowing us to recover a sharp output whose support is contained within the support of the true barycenter we give examples where our algorithm recovers a more meaningful barycenter than previous work our method is versatile and can be extended to applications such as generating super samples from a given distribution and recovering blue noise approximations | [['we', 'present', 'a', 'stochastic', 'algorithm', 'to', 'compute', 'the', 'barycenter', 'of', 'a', 'set', 'of', 'probability', 'distributions', 'under', 'the', 'wasserstein', 'metric', 'from', 'optimal', 'transport', 'unlike', 'previous', 'approaches', 'our', 'method', 'extends', 'to', 'continuous', 'input', 'distributions', 'and', 'allows', 'the', 'support', 'of', 'the', 'barycenter', 'to', 'be', 'adjusted', 'in', 'each', 'iteration', 'we', 'tackle', 'the', 'problem', 'without', 'regularization', 'allowing', 'us', 'to', 'recover', 'a', 'sharp', 'output', 'whose', 'support', 'is', 'contained', 'within', 'the', 'support', 'of', 'the', 'true', 'barycenter', 'we', 'give', 'examples', 'where', 'our', 'algorithm', 'recovers', 'a', 'more', 'meaningful', 'barycenter', 'than', 'previous', 'work', 'our', 'method', 'is', 'versatile', 'and', 'can', 'be', 'extended', 'to', 'applications', 'such', 'as', 'generating', 'super', 'samples', 'from', 'a', 'given', 'distribution', 'and', 'recovering', 'blue', 'noise', 'approximations']] | [-0.019361648200488885, 0.008034462923027366, -0.14662652159388237, 0.08866007790778911, -0.09969600867567079, -0.12542655767664035, 0.07986848849572555, 0.3839254202408211, -0.28565801089525084, -0.2834192557504105, 0.08545382596252085, -0.2533129823338904, -0.1554852038900429, 0.20526140693261802, -0.15440694501875926, 0.1038341076400514, 0.06475547543143696, 0.04743282060861309, -0.08153632216625542, -0.224025943536294, 0.2906185897833137, 0.03735781252105659, 0.23307201032152522, -0.040717443240758586, 0.13168951402914442, 0.013021045730005358, -0.02754417299858738, 0.04105697097866056, -0.08855814533525747, 0.18210333118228259, 0.23160307733429092, 0.17977038284363311, 0.29512579231653535, -0.36244769401360893, -0.22461334063680233, 0.12338379714866474, 0.12200359420858489, 0.13513329456273082, -0.027508446940892186, -0.2734220880257819, 0.11349087065329479, -0.12991615341297377, -0.14688861949334495, -0.10535787731826862, -0.035464736885417285, 0.03513594272885924, -0.3570832171016068, 0.05373049957164189, 0.06525744950925391, -0.02397917942622694, -0.0937073520198682, -0.11485864753643417, 0.024576365878091793, 0.15163364724003683, 0.016944190413282018, 0.08419915603878517, 0.12084492620637763, -0.041538578884623874, -0.10513205406316947, 0.3850322523737483, -0.062038502419420744, -0.23124685242911366, 0.1849247540573581, -0.13302293709679464, -0.11734826289112985, 0.1311735423786618, 0.20043157692155453, 0.18289157927523705, -0.12583441495303518, 0.08638078292285606, -0.061823994265085905, 0.14203567350300672, 0.06590726653388136, 0.010070207851904088, 0.1348484270274639, 0.1521579168005803, 0.1513970004673177, 0.17895071958539852, -0.10894623539104806, -0.10482667663208618, -0.3007103369318854, -0.13301251894711716, -0.21469299450830043, 0.022272722506199345, -0.09955254721057614, -0.16205974772711781, 0.40314632850028925, 0.2269170840975837, 0.26696438332758493, 0.13505824817187875, 0.31579515698722727, 0.13043382917609714, 0.04458839237411445, 0.13720453727694454, 0.15345351616895506, 0.1364703472599248, 0.045378328187861174, -0.15760431283318968, 0.08745371828630358, 0.07291436067860678] |
1,802.05758 | Cross-topic Argument Mining from Heterogeneous Sources Using
Attention-based Neural Networks | Argument mining is a core technology for automating argument search in large
document collections. Despite its usefulness for this task, most current
approaches to argument mining are designed for use only with specific text
types and fall short when applied to heterogeneous texts. In this paper, we
propose a new sentential annotation scheme that is reliably applicable by crowd
workers to arbitrary Web texts. We source annotations for over 25,000 instances
covering eight controversial topics. The results of cross-topic experiments
show that our attention-based neural network generalizes best to unseen topics
and outperforms vanilla BiLSTM models by 6% in accuracy and 11% in F-score.
| cs.CL | argument mining is a core technology for automating argument search in large document collections despite its usefulness for this task most current approaches to argument mining are designed for use only with specific text types and fall short when applied to heterogeneous texts in this paper we propose a new sentential annotation scheme that is reliably applicable by crowd workers to arbitrary web texts we source annotations for over 25000 instances covering eight controversial topics the results of crosstopic experiments show that our attentionbased neural network generalizes best to unseen topics and outperforms vanilla bilstm models by 6 in accuracy and 11 in fscore | [['argument', 'mining', 'is', 'a', 'core', 'technology', 'for', 'automating', 'argument', 'search', 'in', 'large', 'document', 'collections', 'despite', 'its', 'usefulness', 'for', 'this', 'task', 'most', 'current', 'approaches', 'to', 'argument', 'mining', 'are', 'designed', 'for', 'use', 'only', 'with', 'specific', 'text', 'types', 'and', 'fall', 'short', 'when', 'applied', 'to', 'heterogeneous', 'texts', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'sentential', 'annotation', 'scheme', 'that', 'is', 'reliably', 'applicable', 'by', 'crowd', 'workers', 'to', 'arbitrary', 'web', 'texts', 'we', 'source', 'annotations', 'for', 'over', '25000', 'instances', 'covering', 'eight', 'controversial', 'topics', 'the', 'results', 'of', 'crosstopic', 'experiments', 'show', 'that', 'our', 'attentionbased', 'neural', 'network', 'generalizes', 'best', 'to', 'unseen', 'topics', 'and', 'outperforms', 'vanilla', 'bilstm', 'models', 'by', '6', 'in', 'accuracy', 'and', '11', 'in', 'fscore']] | [-0.03259944024911711, 0.02001731161218028, -0.01257289057592997, 0.10484040851786154, -0.18212980157198402, -0.18977262257390376, 0.09808105179131284, 0.44420572522195795, -0.2114592460854413, -0.36985503332418146, 0.06700677633086599, -0.29717033308505725, -0.12570385474856327, 0.23689269283289108, -0.1520254719387559, 0.030929597768846684, 0.15403197646068717, 0.047086940325561516, -0.02056081243564637, -0.34439385859566984, 0.30165029557430845, -0.010442049482168213, 0.3519509034660799, 0.04688098693935616, 0.10072020828741991, -0.033449957666588606, -0.09149638065521253, -0.021563397405117535, -0.05127236889112962, 0.1929002400302301, 0.4095019448250241, 0.22490210383814008, 0.3232617650013779, -0.35624117461186877, -0.19334434162716843, 0.04881365433588479, 0.15170713054305576, 0.1276328779804493, -0.011300698221091506, -0.34380973260668873, 0.14009519675023202, -0.21466977175921925, 0.017545694774649675, -0.14320966655623565, 0.05849785744031728, 0.011480986552077879, -0.24318141586970068, 0.05664049227523066, 0.09637209267165621, 0.08397049511990791, -0.0385586985000364, -0.10350218054485842, 0.12126846586747403, 0.14241973829633123, 0.05975418724119663, 0.06733323031023723, 0.1265456831010366, -0.1789077803564882, -0.18433140554619068, 0.37092634337475, -0.08404641919904976, -0.19012042084591263, 0.2037477712915505, -0.015928248549332318, -0.20761210395891255, 0.09504038818831582, 0.1926530920572633, 0.13446489374551163, -0.18396175501586132, 0.004605809984461956, -0.056804259434270046, 0.23112608154204864, 0.0951539630011556, -0.04526362028504152, 0.18801701143926497, 0.27336102223828507, -0.004450321472724629, 0.12906426492879547, -0.08868910491837242, -0.060298430963952855, -0.2207094388471428, -0.08743590559500712, -0.16897362743694228, -0.024936696158459826, -0.09786142878535598, -0.11962394534782009, 0.3831315552534293, 0.27278034112575006, 0.15385755014072344, 0.11381802267566757, 0.30160490074421015, -0.0476199778608381, 0.11131692471127343, 0.10084838239256817, 0.1079597844046007, -0.025707655177153284, 0.19465236539739972, -0.08004684119431067, 0.08020042527910069, 0.07571905988349932] |
1,802.05759 | A Krylov subspace method for the approximation of bivariate matrix
functions | Bivariate matrix functions provide a unified framework for various tasks in
numerical linear algebra, including the solution of linear matrix equations and
the application of the Fr\'echet derivative. In this work, we propose a novel
tensorized Krylov subspace method for approximating such bivariate matrix
functions and analyze its convergence. While this method is already known for
some instances, our analysis appears to result in new convergence estimates and
insights for all but one instance, Sylvester matrix equations.
| math.NA math.OA | bivariate matrix functions provide a unified framework for various tasks in numerical linear algebra including the solution of linear matrix equations and the application of the frechet derivative in this work we propose a novel tensorized krylov subspace method for approximating such bivariate matrix functions and analyze its convergence while this method is already known for some instances our analysis appears to result in new convergence estimates and insights for all but one instance sylvester matrix equations | [['bivariate', 'matrix', 'functions', 'provide', 'a', 'unified', 'framework', 'for', 'various', 'tasks', 'in', 'numerical', 'linear', 'algebra', 'including', 'the', 'solution', 'of', 'linear', 'matrix', 'equations', 'and', 'the', 'application', 'of', 'the', 'frechet', 'derivative', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'tensorized', 'krylov', 'subspace', 'method', 'for', 'approximating', 'such', 'bivariate', 'matrix', 'functions', 'and', 'analyze', 'its', 'convergence', 'while', 'this', 'method', 'is', 'already', 'known', 'for', 'some', 'instances', 'our', 'analysis', 'appears', 'to', 'result', 'in', 'new', 'convergence', 'estimates', 'and', 'insights', 'for', 'all', 'but', 'one', 'instance', 'sylvester', 'matrix', 'equations']] | [-0.04920788680191164, -0.04194693566094358, -0.0931661592164476, 0.08845320967322384, -0.0898170291639671, -0.14390327336943962, 0.0033470996619238483, 0.3392836978604606, -0.33311273459369295, -0.23860459218358065, 0.1675593567870001, -0.23436931238279907, -0.23085241998219258, 0.20520665921125705, -0.05561745740690982, 0.13776029758200703, 0.07859932284124872, -0.016269652846846852, -0.1781560059624736, -0.2468287647874155, 0.3025339363844364, -0.017120038509949462, 0.24171046075991706, 0.015541015241246719, 0.16244227619986837, 0.000774276370255204, -0.052009151450225284, -0.041106252580300554, -0.0996173538340183, 0.13372370906706368, 0.31420451010782996, 0.18463955425712894, 0.32810450950032705, -0.40136327185704335, -0.179478282241949, 0.11217211303490142, 0.16378984016414683, 0.12173268888689964, -0.08163366114793273, -0.2589415826112056, 0.07882599209665091, -0.19772382288590654, -0.1392220329831947, -0.17423018728410855, -0.01730303591504306, 0.02828949297303576, -0.34778059513441156, 0.0803205037683055, 0.08353478684658547, 0.027556024479691858, -0.07733117176262154, -0.18009129302672944, 0.10338174643194568, 0.04556440450734906, 0.02925715479673213, -0.0014971036572831791, 0.049175421525905656, -0.08305873774451675, -0.09371443685482848, 0.34484429746962986, -0.05646710366905703, -0.2917796309021386, 0.14459229093770704, -0.1201302120945864, -0.19384420181128692, 0.07393220714232472, 0.19943032853982665, 0.1628744146187923, -0.18453644785739773, 0.1237776959897019, -0.08722438265315512, 0.07917490756961626, 0.023652706627867053, 0.015378953114926042, 0.06189217186508725, 0.15455549559858325, 0.13771860510437423, 0.137616841606312, 0.014546189889577883, -0.10720731149875111, -0.29341039709843597, -0.18578901844607157, -0.19816652138856566, -0.004903125460259616, -0.19546890377869086, -0.2063663066788153, 0.44578437250736475, 0.1324444670085009, 0.17856780706916925, 0.13308066273616118, 0.2950967503877889, 0.17477910065352192, 0.02115122594737581, 0.0988771642887868, 0.13887132796067322, 0.18671326999334836, 0.09125027264008759, -0.15459625109086755, 0.07272198090976854, 0.20313368582880342] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.