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.0826
Signature of Planetary Mergers on Stellar Spins
One of the predictions of high eccentricity planetary migration is that many planets will end up plunging into their host stars. We investigate the consequence of planetary mergers on their stellar hosts' spin-period. Energy and angular momentum conservation yield that a planet consumption by a star will spin-up the star. We find that our calculations align with the observed bifurcation in the stellar spin-period in young clusters. For example, after a Sun-like star has eaten a Jupiter-mass planet it will spin up by ~60% (i.e., spin-period is reduced by ~60%), causing an apparent gap in the stellar spin period, between stars that consumed a planet and those that did not. The spun-up star will later spin down due to magnetic braking, consistent with the disappearance of this bifurcation in clusters (>300Myr). The agreement between the calculations presented here, and the observed spin-period color diagram of stars in young clusters provides circumstantial evidence that planetary accretion onto their host stars is a generic feature of planetary-system evolution.
astro-ph.SR astro-ph.EP
one of the predictions of high eccentricity planetary migration is that many planets will end up plunging into their host stars we investigate the consequence of planetary mergers on their stellar hosts spinperiod energy and angular momentum conservation yield that a planet consumption by a star will spinup the star we find that our calculations align with the observed bifurcation in the stellar spinperiod in young clusters for example after a sunlike star has eaten a jupitermass planet it will spin up by 60 ie spinperiod is reduced by 60 causing an apparent gap in the stellar spin period between stars that consumed a planet and those that did not the spunup star will later spin down due to magnetic braking consistent with the disappearance of this bifurcation in clusters 300myr the agreement between the calculations presented here and the observed spinperiod color diagram of stars in young clusters provides circumstantial evidence that planetary accretion onto their host stars is a generic feature of planetarysystem evolution
[['one', 'of', 'the', 'predictions', 'of', 'high', 'eccentricity', 'planetary', 'migration', 'is', 'that', 'many', 'planets', 'will', 'end', 'up', 'plunging', 'into', 'their', 'host', 'stars', 'we', 'investigate', 'the', 'consequence', 'of', 'planetary', 'mergers', 'on', 'their', 'stellar', 'hosts', 'spinperiod', 'energy', 'and', 'angular', 'momentum', 'conservation', 'yield', 'that', 'a', 'planet', 'consumption', 'by', 'a', 'star', 'will', 'spinup', 'the', 'star', 'we', 'find', 'that', 'our', 'calculations', 'align', 'with', 'the', 'observed', 'bifurcation', 'in', 'the', 'stellar', 'spinperiod', 'in', 'young', 'clusters', 'for', 'example', 'after', 'a', 'sunlike', 'star', 'has', 'eaten', 'a', 'jupitermass', 'planet', 'it', 'will', 'spin', 'up', 'by', '60', 'ie', 'spinperiod', 'is', 'reduced', 'by', '60', 'causing', 'an', 'apparent', 'gap', 'in', 'the', 'stellar', 'spin', 'period', 'between', 'stars', 'that', 'consumed', 'a', 'planet', 'and', 'those', 'that', 'did', 'not', 'the', 'spunup', 'star', 'will', 'later', 'spin', 'down', 'due', 'to', 'magnetic', 'braking', 'consistent', 'with', 'the', 'disappearance', 'of', 'this', 'bifurcation', 'in', 'clusters', '300myr', 'the', 'agreement', 'between', 'the', 'calculations', 'presented', 'here', 'and', 'the', 'observed', 'spinperiod', 'color', 'diagram', 'of', 'stars', 'in', 'young', 'clusters', 'provides', 'circumstantial', 'evidence', 'that', 'planetary', 'accretion', 'onto', 'their', 'host', 'stars', 'is', 'a', 'generic', 'feature', 'of', 'planetarysystem', 'evolution']]
[-0.12846798291542086, 0.2245877869105484, -0.08363814644392085, 0.09814418652179056, -0.12526758795699486, -0.028907920435878885, 0.08829422599175968, 0.37447052423741267, -0.15428314492645034, -0.367054556877947, 0.02936152288204912, -0.26813209152230655, -0.05701406902061349, 0.2074083334300667, -0.07906660809201267, -0.03371201324590807, 0.15908527126849956, -0.02081727286441678, -0.05751901131448706, -0.27432462711627764, 0.3017553044819688, 0.03642844650049341, 0.05731857043174825, -0.012870723796806422, 0.022510075787396496, -0.08364420578427927, -0.016090765708520256, -0.06533569967618257, -0.20451161273078733, 0.010961044854302162, 0.22487123230337558, 0.11865563208590744, 0.21523141922676062, -0.3879556719281049, -0.17654710642643504, 0.029454725121248918, 0.21372123975979995, 0.05895571925408061, -0.1187958923899232, -0.22050305011020188, 0.09161902492282441, -0.26020078615745507, -0.19294610440012921, 0.02969797898970365, 0.09463089078956519, 0.003528036819546517, -0.21265261155814044, 0.12600171739966273, 0.1081312827608851, 0.08947527306412097, -0.15357590292816062, -0.07036249309284501, -0.15300655315366887, 0.07951978876266673, 0.054618848309605325, 0.08363717416559446, 0.16086106790869262, -0.11129263464322156, -0.053310487322587835, 0.39650882261031006, -0.056106699394280965, -0.04024811172913984, 0.24860042800666787, -0.24556485413719553, -0.136249144505485, 0.13090060942480902, 0.14222005858781736, 0.10630537019986434, -0.16383812344543278, -0.04573547783558796, 0.006821761524910669, 0.17641571337491813, 0.08161449622003789, 0.009568011359736275, 0.44377344284004655, 0.14012790147035595, 0.06026250177942474, 0.07794071914745966, -0.21650719447468172, -0.08266692802293159, -0.15834024822316975, -0.11463870543492846, -0.15357099459485532, 0.09427856945817384, -0.13025407501503738, -0.09209847658401332, 0.35115849089258944, 0.09627937100524733, 0.1873856881038701, 0.024543099893616086, 0.2610478268442563, 0.09671836279975025, 0.12688891528321905, 0.13116158630435232, 0.32966609203525965, 0.18527392594070813, 0.11800155238001551, -0.31947319576494304, 0.10509549789074583, -0.02831655751958669]
1,802.08261
Pomeranchuk Instability of Composite Fermi Liquids
Nematicity in quantum Hall systems has been experimentally well established at excited Landau levels. The mechanism of the symmetry breaking, however, is still unknown. Pomeranchuk instability of Fermi liquid parameter $F_{\ell} \le -1$ in the angular momentum $\ell=2$ channel has been argued to be the relevant mechanism, yet there are no definitive theoretical proofs. Here we calculate, using the variational Monte Carlo technique, Fermi liquid parameters $F_\ell$ of the composite fermion Fermi liquid with a finite layer width. We consider $F_{\ell}$ in different Landau levels $n=0,1,2$ as a function of layer width parameter $\eta$. We find that unlike the lowest Landau level, which shows no sign of Pomeranchuk instability, higher Landau levels show nematic instability below critical values of $\eta$. Furthermore, the critical value $\eta_c$ is higher for the $n=2$ Landau level, which is consistent with observation of nematic order in ambient conditions only in the $n=2$ Landau levels. The picture emerging from our work is that approaching the true 2D limit brings half-filled higher Landau-level systems to the brink of nematic Pomeranchuk instability.
cond-mat.str-el
nematicity in quantum hall systems has been experimentally well established at excited landau levels the mechanism of the symmetry breaking however is still unknown pomeranchuk instability of fermi liquid parameter f_ell le 1 in the angular momentum ell2 channel has been argued to be the relevant mechanism yet there are no definitive theoretical proofs here we calculate using the variational monte carlo technique fermi liquid parameters f_ell of the composite fermion fermi liquid with a finite layer width we consider f_ell in different landau levels n012 as a function of layer width parameter eta we find that unlike the lowest landau level which shows no sign of pomeranchuk instability higher landau levels show nematic instability below critical values of eta furthermore the critical value eta_c is higher for the n2 landau level which is consistent with observation of nematic order in ambient conditions only in the n2 landau levels the picture emerging from our work is that approaching the true 2d limit brings halffilled higher landaulevel systems to the brink of nematic pomeranchuk instability
[['nematicity', 'in', 'quantum', 'hall', 'systems', 'has', 'been', 'experimentally', 'well', 'established', 'at', 'excited', 'landau', 'levels', 'the', 'mechanism', 'of', 'the', 'symmetry', 'breaking', 'however', 'is', 'still', 'unknown', 'pomeranchuk', 'instability', 'of', 'fermi', 'liquid', 'parameter', 'f_ell', 'le', '1', 'in', 'the', 'angular', 'momentum', 'ell2', 'channel', 'has', 'been', 'argued', 'to', 'be', 'the', 'relevant', 'mechanism', 'yet', 'there', 'are', 'no', 'definitive', 'theoretical', 'proofs', 'here', 'we', 'calculate', 'using', 'the', 'variational', 'monte', 'carlo', 'technique', 'fermi', 'liquid', 'parameters', 'f_ell', 'of', 'the', 'composite', 'fermion', 'fermi', 'liquid', 'with', 'a', 'finite', 'layer', 'width', 'we', 'consider', 'f_ell', 'in', 'different', 'landau', 'levels', 'n012', 'as', 'a', 'function', 'of', 'layer', 'width', 'parameter', 'eta', 'we', 'find', 'that', 'unlike', 'the', 'lowest', 'landau', 'level', 'which', 'shows', 'no', 'sign', 'of', 'pomeranchuk', 'instability', 'higher', 'landau', 'levels', 'show', 'nematic', 'instability', 'below', 'critical', 'values', 'of', 'eta', 'furthermore', 'the', 'critical', 'value', 'eta_c', 'is', 'higher', 'for', 'the', 'n2', 'landau', 'level', 'which', 'is', 'consistent', 'with', 'observation', 'of', 'nematic', 'order', 'in', 'ambient', 'conditions', 'only', 'in', 'the', 'n2', 'landau', 'levels', 'the', 'picture', 'emerging', 'from', 'our', 'work', 'is', 'that', 'approaching', 'the', 'true', '2d', 'limit', 'brings', 'halffilled', 'higher', 'landaulevel', 'systems', 'to', 'the', 'brink', 'of', 'nematic', 'pomeranchuk', 'instability']]
[-0.19191738766157765, 0.26397078945943764, -0.06258638954758858, 0.10533329705579271, -0.021213619275307603, -0.16429165092928485, 0.08389115223698532, 0.30981118639866856, -0.21035332367327278, -0.2807136209167797, 0.012818830651793116, -0.2734532542954916, -0.11438223101926603, 0.11668107164863112, 0.032290347600248695, 0.07731591704264404, -0.034921154010527096, -0.0057543135440812025, -0.10476240211690979, -0.19658685947270615, 0.3302254890159961, 0.05996943473141512, 0.3085990405090196, 0.07775249214101604, 0.05847524742103428, -0.036519337907144477, 0.12167998690736191, -0.03999250109746367, -0.20804595195826467, -0.02855921210821493, 0.2689169980598956, -0.07198484736861362, 0.23892353819522621, -0.38174964171759357, -0.21668576561289185, 0.019121962786791312, 0.1814333041139675, 0.1458228521153395, -0.005057002369571349, -0.2444003510112264, 0.06352577735311968, -0.19547329969495406, -0.16812158304523547, -0.07711596113774155, -0.01836301748983391, -0.09797582860575084, -0.23373347677654405, 0.1552452781403587, 0.07327733363423647, 0.08831383134291947, -0.08071773788984062, -0.19474164977798175, -0.08859550347752419, 0.05418787326867125, 0.09911528597960527, 0.08245360742800804, 0.11141158874887952, -0.18023234120591533, -0.11124787826208804, 0.3686582359817179, -0.03745228146475836, -0.17289142684754114, 0.1662228919071247, -0.24587743000352177, -0.13503447931257195, 0.2232285830641872, 0.07447960194066132, 0.04299508769268534, -0.04954374899509652, 0.11541834737752275, -0.03529049865847946, 0.1979922699051556, 0.06350050734733392, 0.04111967479205294, 0.21030166665702288, 0.18596936219596658, 0.05681088416611016, 0.10966233634483605, -0.12592284209309038, -0.1024908172916728, -0.2830265185142728, -0.14249836101669058, -0.18283866184239073, 0.025472518934429377, -0.01863631121974824, -0.15334414767807927, 0.3515502616078004, 0.14214209840236897, 0.17798779315004745, -0.026317826982041628, 0.23196674926452682, 0.20170334469387843, 0.051060776456376945, 0.04947583058891797, 0.2852726563993285, 0.12240462440424653, 0.05760325214707817, -0.2671736406534375, 0.020605986025291442, 0.08661175453928353]
1,802.08262
From Dynamical Localization to Bunching in interacting Floquet Systems
We show that a quantum many-body system may be controlled by means of Floquet engineering, i.e., their properties may be controlled and manipulated by employing periodic driving. We present a concrete driving scheme that allows control over the nature of mobile units and the amount of diffusion in generic many-body systems. We demonstrate these ideas for the Fermi-Hubbard model, where the drive renders doubly occupied sites (doublons) the mobile excitations in the system. In particular, we show that the amount of diffusion in the system and the level of fermion-pairing may be controlled and understood solely in terms of the doublon dynamics. We find that under certain circumstances the diffusion in the system may be eliminated completely. We conclude our work by generalizing these ideas to generic many-body systems.
cond-mat.str-el
we show that a quantum manybody system may be controlled by means of floquet engineering ie their properties may be controlled and manipulated by employing periodic driving we present a concrete driving scheme that allows control over the nature of mobile units and the amount of diffusion in generic manybody systems we demonstrate these ideas for the fermihubbard model where the drive renders doubly occupied sites doublons the mobile excitations in the system in particular we show that the amount of diffusion in the system and the level of fermionpairing may be controlled and understood solely in terms of the doublon dynamics we find that under certain circumstances the diffusion in the system may be eliminated completely we conclude our work by generalizing these ideas to generic manybody systems
[['we', 'show', 'that', 'a', 'quantum', 'manybody', 'system', 'may', 'be', 'controlled', 'by', 'means', 'of', 'floquet', 'engineering', 'ie', 'their', 'properties', 'may', 'be', 'controlled', 'and', 'manipulated', 'by', 'employing', 'periodic', 'driving', 'we', 'present', 'a', 'concrete', 'driving', 'scheme', 'that', 'allows', 'control', 'over', 'the', 'nature', 'of', 'mobile', 'units', 'and', 'the', 'amount', 'of', 'diffusion', 'in', 'generic', 'manybody', 'systems', 'we', 'demonstrate', 'these', 'ideas', 'for', 'the', 'fermihubbard', 'model', 'where', 'the', 'drive', 'renders', 'doubly', 'occupied', 'sites', 'doublons', 'the', 'mobile', 'excitations', 'in', 'the', 'system', 'in', 'particular', 'we', 'show', 'that', 'the', 'amount', 'of', 'diffusion', 'in', 'the', 'system', 'and', 'the', 'level', 'of', 'fermionpairing', 'may', 'be', 'controlled', 'and', 'understood', 'solely', 'in', 'terms', 'of', 'the', 'doublon', 'dynamics', 'we', 'find', 'that', 'under', 'certain', 'circumstances', 'the', 'diffusion', 'in', 'the', 'system', 'may', 'be', 'eliminated', 'completely', 'we', 'conclude', 'our', 'work', 'by', 'generalizing', 'these', 'ideas', 'to', 'generic', 'manybody', 'systems']]
[-0.1785564200429235, 0.19926961930468678, -0.05527510092360899, 0.02086432176474773, 0.02481508980054059, -0.13093256799766095, 0.06899130594138114, 0.35838204457832035, -0.3303592035190377, -0.2731696332557476, 0.07539294822890952, -0.23059552244933457, -0.19884347464540042, 0.2279254312102239, -0.05000134874990181, 0.01722707206499763, 0.058385513142638956, -0.011151167527714279, -0.031119048104301328, -0.24302406211791094, 0.337033938733839, 0.01885684350691008, 0.2461154576521949, 0.07869354856620703, 0.05226256557216402, 0.017814928563893773, 0.03453288359742146, 0.03294013725826517, -0.08799822484820652, 0.12662541432007401, 0.2219216988341941, 0.06326513916428667, 0.2701480733558128, -0.4768767303903587, -0.2362225527089663, 0.06887141309925937, 0.1905864046102579, 0.17964553737692768, -0.04629957191355061, -0.33181983872054843, 0.06033282383577898, -0.20599575848973473, -0.15023234960608534, -0.1433018395509862, -0.035455338802421466, 0.04287330127408495, -0.2539496062818216, 0.06290983752478496, 0.06049889339192305, 0.0442060438945191, -0.07671484471075019, -0.012936837614688557, -0.010994989524988341, 0.13954080392250034, -0.010168346094360459, -0.04752172080293349, 0.16314350793254562, -0.13958028858178295, -0.12747143498199875, 0.3805552224512212, -0.05723671377199935, -0.21919101570529165, 0.21627019342486165, -0.136534873778146, -0.10586914135637926, 0.08366028768068645, 0.16492541701381924, 0.10571316310961265, -0.17415978820349665, 0.08208155672218709, -0.009076978138182312, 0.1800664245711232, -0.007218353850475978, 0.06904980558601892, 0.23860919344588183, 0.15304594137523964, 0.0667022883426398, 0.14597949104427244, -0.03302281965443399, -0.14751146606067778, -0.2659566488355267, -0.14363782457985508, -0.20843966802294744, 0.06606580392690375, -0.021464209107307397, -0.12200967833632603, 0.4047786813963228, 0.18821793029565015, 0.17786973615875468, -0.02269891190007911, 0.21694954447229975, 0.16549907871831238, 0.04535234287868661, 0.061181930595921585, 0.2328493950444681, 0.044620609918638365, 0.07654314535739104, -0.26935913546003576, 0.0764758403547603, 0.04928750643739477]
1,802.08263
Measuring the scale dependence of intrinsic alignments using multiple shear estimates
We present a new method for measuring the scale dependence of the intrinsic alignment (IA) contamination to the galaxy-galaxy lensing signal, which takes advantage of multiple shear estimation methods applied to the same source galaxy sample. By exploiting the resulting correlation of both shape noise and cosmic variance, our method can provide an increase in the signal-to-noise of the measured IA signal as compared to methods which rely on the difference of the lensing signal from multiple photometric redshift bins. For a galaxy-galaxy lensing measurement which uses LSST sources and DESI lenses, the signal-to-noise on the IA signal from our method is predicted to improve by a factor of $\sim 2$ relative to the method of Blazek et al. 2012, for pairs of shear estimates which yield substantially different measured IA amplitudes and highly correlated shape noise terms. We show that statistical error necessarily dominates the measurement of intrinsic alignments using our method. We also consider a physically motivated extension of the Blazek et al. 2012 method which assumes that all nearby galaxy pairs, rather than only excess pairs, are subject to IA. In this case, the signal-to-noise of the method of Blazek et al. 2012 is improved.
astro-ph.CO
we present a new method for measuring the scale dependence of the intrinsic alignment ia contamination to the galaxygalaxy lensing signal which takes advantage of multiple shear estimation methods applied to the same source galaxy sample by exploiting the resulting correlation of both shape noise and cosmic variance our method can provide an increase in the signaltonoise of the measured ia signal as compared to methods which rely on the difference of the lensing signal from multiple photometric redshift bins for a galaxygalaxy lensing measurement which uses lsst sources and desi lenses the signaltonoise on the ia signal from our method is predicted to improve by a factor of sim 2 relative to the method of blazek et al 2012 for pairs of shear estimates which yield substantially different measured ia amplitudes and highly correlated shape noise terms we show that statistical error necessarily dominates the measurement of intrinsic alignments using our method we also consider a physically motivated extension of the blazek et al 2012 method which assumes that all nearby galaxy pairs rather than only excess pairs are subject to ia in this case the signaltonoise of the method of blazek et al 2012 is improved
[['we', 'present', 'a', 'new', 'method', 'for', 'measuring', 'the', 'scale', 'dependence', 'of', 'the', 'intrinsic', 'alignment', 'ia', 'contamination', 'to', 'the', 'galaxygalaxy', 'lensing', 'signal', 'which', 'takes', 'advantage', 'of', 'multiple', 'shear', 'estimation', 'methods', 'applied', 'to', 'the', 'same', 'source', 'galaxy', 'sample', 'by', 'exploiting', 'the', 'resulting', 'correlation', 'of', 'both', 'shape', 'noise', 'and', 'cosmic', 'variance', 'our', 'method', 'can', 'provide', 'an', 'increase', 'in', 'the', 'signaltonoise', 'of', 'the', 'measured', 'ia', 'signal', 'as', 'compared', 'to', 'methods', 'which', 'rely', 'on', 'the', 'difference', 'of', 'the', 'lensing', 'signal', 'from', 'multiple', 'photometric', 'redshift', 'bins', 'for', 'a', 'galaxygalaxy', 'lensing', 'measurement', 'which', 'uses', 'lsst', 'sources', 'and', 'desi', 'lenses', 'the', 'signaltonoise', 'on', 'the', 'ia', 'signal', 'from', 'our', 'method', 'is', 'predicted', 'to', 'improve', 'by', 'a', 'factor', 'of', 'sim', '2', 'relative', 'to', 'the', 'method', 'of', 'blazek', 'et', 'al', '2012', 'for', 'pairs', 'of', 'shear', 'estimates', 'which', 'yield', 'substantially', 'different', 'measured', 'ia', 'amplitudes', 'and', 'highly', 'correlated', 'shape', 'noise', 'terms', 'we', 'show', 'that', 'statistical', 'error', 'necessarily', 'dominates', 'the', 'measurement', 'of', 'intrinsic', 'alignments', 'using', 'our', 'method', 'we', 'also', 'consider', 'a', 'physically', 'motivated', 'extension', 'of', 'the', 'blazek', 'et', 'al', '2012', 'method', 'which', 'assumes', 'that', 'all', 'nearby', 'galaxy', 'pairs', 'rather', 'than', 'only', 'excess', 'pairs', 'are', 'subject', 'to', 'ia', 'in', 'this', 'case', 'the', 'signaltonoise', 'of', 'the', 'method', 'of', 'blazek', 'et', 'al', '2012', 'is', 'improved']]
[-0.06306043298294146, 0.010479278830212255, -0.09371098437384147, 0.0749682137281681, -0.08241081722504036, -0.07005780333367345, 0.032264618752782956, 0.3631009834658618, -0.21356650917188763, -0.3624090858537591, 0.013510879704192506, -0.2847099149496191, -0.10661028124241516, 0.25069943698231284, -0.0574744453293864, 0.02754016808760964, 0.08196451448520288, -0.08245941285955875, -0.07683006338144575, -0.334528718177803, 0.28200530857106465, 0.12155602573454756, 0.3141771386697362, -0.046462450870265716, 0.1224542891117509, 0.007094977277735568, -0.12893894731509264, 0.04037447375447649, -0.12696034396386227, 0.08227161699647291, 0.1990334959265616, 0.14767157790871957, 0.20908160004388504, -0.29489666977737805, -0.2275461248895906, 0.14166368537163831, 0.17165068513243412, 0.13775001253140148, -0.040832123969625114, -0.31893138167791707, 0.08165109207656121, -0.16748563342755943, -0.038063147516257945, 0.001148093171944522, -0.025701680234774496, 0.05811524620477223, -0.3213305839201003, 0.1999754205702115, 0.05878205793443626, 0.03583423231229788, -0.029766306943128432, -0.1240806018891321, 0.00990204886425136, 0.07340571450332951, 0.013961606176283135, 0.05981516785745631, 0.11364335910713469, -0.11138522280544758, -0.052992717268573346, 0.37012582838492974, -0.07051308131742942, -0.1192388871891631, 0.164293356249203, -0.1374930625727325, -0.1348123767088647, 0.12800525292293216, 0.2094242705615482, 0.07968466346048647, -0.1574977411549877, 0.011912548198715097, 0.027860667283712615, 0.20972887046559893, 0.05851000719797807, 0.0612335336099748, 0.1951107004965477, 0.10569582073337803, 0.07736327603572246, 0.0745655526395304, -0.21472781238903413, 0.03878313236231351, -0.27282438174212315, -0.07604087584868374, -0.2075056090011412, 0.05336278446390284, -0.11525334754579224, -0.1402350194876275, 0.3740901351727621, 0.15249027178806224, 0.2398621154775034, 0.07179423279571112, 0.32892538021280987, 0.07677072708875957, 0.06820108541616737, 0.03318498200252464, 0.33307126671019377, 0.14096944686378154, 0.06140559842055099, -0.23499550878521847, 0.07047308166511357, 0.019528409014009127]
1,802.08264
Infinite Distances in Field Space and Massless Towers of States
It has been conjectured that in theories consistent with quantum gravity infinite distances in field space coincide with an infinite tower of states becoming massless exponentially fast in the proper field distance. The complex-structure moduli space of Calabi-Yau manifolds is a good testing ground for this conjecture since it is known to encode quantum gravity physics. We study infinite distances in this setting and present new evidence for the above conjecture. Points in moduli space which are at infinite proper distance along any path are characterised by an infinite order monodromy matrix. We utilise the nilpotent orbit theorem to show that for a large class of such points the monodromy matrix generates an infinite orbit within the spectrum of BPS states. We identify an infinite tower of states with this orbit. Further, the theorem gives the local metric on the moduli space which can be used to show that the mass of the states decreases exponentially fast upon approaching the point. We also propose a reason for why infinite distances are related to infinite towers of states. Specifically, we present evidence that the infinite distance itself is an emergent quantum phenomenon induced by integrating out at one-loop the states that become massless. Concretely, we show that the behaviour of the field space metric upon approaching infinite distance can be recovered from integrating out the BPS states. Similarly, at infinite distance the gauge couplings of closed-string Abelian gauge symmetries vanish in a way which can be matched onto integrating out the infinite tower of charged BPS states. This presents evidence towards the idea that also the gauge theory weak-coupling limit can be thought of as emergent.
hep-th
it has been conjectured that in theories consistent with quantum gravity infinite distances in field space coincide with an infinite tower of states becoming massless exponentially fast in the proper field distance the complexstructure moduli space of calabiyau manifolds is a good testing ground for this conjecture since it is known to encode quantum gravity physics we study infinite distances in this setting and present new evidence for the above conjecture points in moduli space which are at infinite proper distance along any path are characterised by an infinite order monodromy matrix we utilise the nilpotent orbit theorem to show that for a large class of such points the monodromy matrix generates an infinite orbit within the spectrum of bps states we identify an infinite tower of states with this orbit further the theorem gives the local metric on the moduli space which can be used to show that the mass of the states decreases exponentially fast upon approaching the point we also propose a reason for why infinite distances are related to infinite towers of states specifically we present evidence that the infinite distance itself is an emergent quantum phenomenon induced by integrating out at oneloop the states that become massless concretely we show that the behaviour of the field space metric upon approaching infinite distance can be recovered from integrating out the bps states similarly at infinite distance the gauge couplings of closedstring abelian gauge symmetries vanish in a way which can be matched onto integrating out the infinite tower of charged bps states this presents evidence towards the idea that also the gauge theory weakcoupling limit can be thought of as emergent
[['it', 'has', 'been', 'conjectured', 'that', 'in', 'theories', 'consistent', 'with', 'quantum', 'gravity', 'infinite', 'distances', 'in', 'field', 'space', 'coincide', 'with', 'an', 'infinite', 'tower', 'of', 'states', 'becoming', 'massless', 'exponentially', 'fast', 'in', 'the', 'proper', 'field', 'distance', 'the', 'complexstructure', 'moduli', 'space', 'of', 'calabiyau', 'manifolds', 'is', 'a', 'good', 'testing', 'ground', 'for', 'this', 'conjecture', 'since', 'it', 'is', 'known', 'to', 'encode', 'quantum', 'gravity', 'physics', 'we', 'study', 'infinite', 'distances', 'in', 'this', 'setting', 'and', 'present', 'new', 'evidence', 'for', 'the', 'above', 'conjecture', 'points', 'in', 'moduli', 'space', 'which', 'are', 'at', 'infinite', 'proper', 'distance', 'along', 'any', 'path', 'are', 'characterised', 'by', 'an', 'infinite', 'order', 'monodromy', 'matrix', 'we', 'utilise', 'the', 'nilpotent', 'orbit', 'theorem', 'to', 'show', 'that', 'for', 'a', 'large', 'class', 'of', 'such', 'points', 'the', 'monodromy', 'matrix', 'generates', 'an', 'infinite', 'orbit', 'within', 'the', 'spectrum', 'of', 'bps', 'states', 'we', 'identify', 'an', 'infinite', 'tower', 'of', 'states', 'with', 'this', 'orbit', 'further', 'the', 'theorem', 'gives', 'the', 'local', 'metric', 'on', 'the', 'moduli', 'space', 'which', 'can', 'be', 'used', 'to', 'show', 'that', 'the', 'mass', 'of', 'the', 'states', 'decreases', 'exponentially', 'fast', 'upon', 'approaching', 'the', 'point', 'we', 'also', 'propose', 'a', 'reason', 'for', 'why', 'infinite', 'distances', 'are', 'related', 'to', 'infinite', 'towers', 'of', 'states', 'specifically', 'we', 'present', 'evidence', 'that', 'the', 'infinite', 'distance', 'itself', 'is', 'an', 'emergent', 'quantum', 'phenomenon', 'induced', 'by', 'integrating', 'out', 'at', 'oneloop', 'the', 'states', 'that', 'become', 'massless', 'concretely', 'we', 'show', 'that', 'the', 'behaviour', 'of', 'the', 'field', 'space', 'metric', 'upon', 'approaching', 'infinite', 'distance', 'can', 'be', 'recovered', 'from', 'integrating', 'out', 'the', 'bps', 'states', 'similarly', 'at', 'infinite', 'distance', 'the', 'gauge', 'couplings', 'of', 'closedstring', 'abelian', 'gauge', 'symmetries', 'vanish', 'in', 'a', 'way', 'which', 'can', 'be', 'matched', 'onto', 'integrating', 'out', 'the', 'infinite', 'tower', 'of', 'charged', 'bps', 'states', 'this', 'presents', 'evidence', 'towards', 'the', 'idea', 'that', 'also', 'the', 'gauge', 'theory', 'weakcoupling', 'limit', 'can', 'be', 'thought', 'of', 'as', 'emergent']]
[-0.1654331759812141, 0.2323431673974582, -0.13360862443392926, 0.11080617842814801, -0.05739462565609508, -0.11135749521644109, 0.032442511235871774, 0.33745692779394715, -0.2570136583935131, -0.25649242474274203, 0.08753754895519127, -0.26308962427926336, -0.13526753381995316, 0.1679794465411793, -0.05432262972651436, 0.008378607655282725, 0.04475692921741442, 0.08784658402204513, -0.07918304708855099, -0.2515843515339392, 0.35667306899855084, 0.017084580698918383, 0.2514093108407476, 0.04542901779270985, 0.12276603529399091, 0.0037888757046312094, 0.02850837257606062, 0.03469903361676684, -0.103913117796262, 0.10225586403288286, 0.27070180668918925, 0.06978627867742696, 0.19789070058614017, -0.3861419807679274, -0.20095904525538738, 0.13064196179239926, 0.18857439501211049, 0.13790853843304582, -0.020832977391017433, -0.292673418068073, 0.08761489241807298, -0.16782112580639394, -0.2300832455448637, -0.08150056567974388, 0.0303083014737984, -0.07065966568633236, -0.20561847476288675, 0.02319225174692375, 0.04338508140295744, 0.04342671730301597, -0.05605280101849613, -0.0720924057124119, -0.04379559591243213, 0.11747206688265908, 0.06604027059860527, 0.051049087042496964, 0.07671914444051006, -0.10222289607394487, -0.13085302214095876, 0.32492726867849175, -0.08938223644752394, -0.18739526442902968, 0.15826270771890202, -0.11689359908754175, -0.14251491103829309, 0.13134835287505253, 0.11912419658111917, 0.1400987728623758, -0.07830302923748439, 0.18451799812451514, -0.08170263587920504, 0.13385226959584873, 0.09106095963496376, 0.06014792863533578, 0.26230211252592694, 0.08259685379622335, 0.1135161923667924, 0.1522246017916636, -0.0311520839008418, -0.12831357938830149, -0.3658346886763518, -0.17682827352969485, -0.15846072925847363, 0.11781366123563863, -0.1085298940786478, -0.2045286045392806, 0.3380002446049316, 0.13253751944581216, 0.20477336277402752, 0.08354574822693725, 0.1997406136371534, 0.11409897167362612, 0.09187890193509785, 0.09517557869030333, 0.23431375863242218, 0.13853280540386384, 0.0008724987828596072, -0.19950241825374013, -0.03820189546285705, 0.13986419320614502]
1,802.08265
Exponentially fast dynamics of chaotic many-body systems
We demonstrate analytically and numerically that in isolated quantum systems of many interacting particles, the number of many-body states participating in the evolution after a quench increases exponentially in time, provided the eigenstates are delocalized in the energy shell. The rate of the exponential growth is defined by the width $\Gamma$ of the local density of states (LDOS) and is associated with the Kolmogorov-Sinai entropy for systems with a well defined classical limit. In a finite system, the exponential growth eventually saturates due to the finite volume of the energy shell. We estimate the time scale for the saturation and show that it is much larger than $\hbar/\Gamma$. Numerical data obtained for a two-body random interaction model of bosons and for a dynamical model of interacting spin-1/2 particles show excellent agreement with the analytical predictions.
cond-mat.stat-mech hep-th quant-ph
we demonstrate analytically and numerically that in isolated quantum systems of many interacting particles the number of manybody states participating in the evolution after a quench increases exponentially in time provided the eigenstates are delocalized in the energy shell the rate of the exponential growth is defined by the width gamma of the local density of states ldos and is associated with the kolmogorovsinai entropy for systems with a well defined classical limit in a finite system the exponential growth eventually saturates due to the finite volume of the energy shell we estimate the time scale for the saturation and show that it is much larger than hbargamma numerical data obtained for a twobody random interaction model of bosons and for a dynamical model of interacting spin12 particles show excellent agreement with the analytical predictions
[['we', 'demonstrate', 'analytically', 'and', 'numerically', 'that', 'in', 'isolated', 'quantum', 'systems', 'of', 'many', 'interacting', 'particles', 'the', 'number', 'of', 'manybody', 'states', 'participating', 'in', 'the', 'evolution', 'after', 'a', 'quench', 'increases', 'exponentially', 'in', 'time', 'provided', 'the', 'eigenstates', 'are', 'delocalized', 'in', 'the', 'energy', 'shell', 'the', 'rate', 'of', 'the', 'exponential', 'growth', 'is', 'defined', 'by', 'the', 'width', 'gamma', 'of', 'the', 'local', 'density', 'of', 'states', 'ldos', 'and', 'is', 'associated', 'with', 'the', 'kolmogorovsinai', 'entropy', 'for', 'systems', 'with', 'a', 'well', 'defined', 'classical', 'limit', 'in', 'a', 'finite', 'system', 'the', 'exponential', 'growth', 'eventually', 'saturates', 'due', 'to', 'the', 'finite', 'volume', 'of', 'the', 'energy', 'shell', 'we', 'estimate', 'the', 'time', 'scale', 'for', 'the', 'saturation', 'and', 'show', 'that', 'it', 'is', 'much', 'larger', 'than', 'hbargamma', 'numerical', 'data', 'obtained', 'for', 'a', 'twobody', 'random', 'interaction', 'model', 'of', 'bosons', 'and', 'for', 'a', 'dynamical', 'model', 'of', 'interacting', 'spin12', 'particles', 'show', 'excellent', 'agreement', 'with', 'the', 'analytical', 'predictions']]
[-0.14604977769432245, 0.21839838767493214, -0.08251951903242756, 0.09945686461524693, 0.07036353531810972, -0.12058817133980079, 0.026966906496521982, 0.2971709108532027, -0.24073205512292958, -0.27621142263265536, 0.06022721092665085, -0.31657021762027093, -0.07131687363445828, 0.18330415713911255, 0.061442770637330356, 0.09141795685583795, 0.07778876364851992, 0.07573220609273347, -0.05745785351911629, -0.22709403303279369, 0.2977016577704085, 0.0676273904007825, 0.26071360859054105, 0.061259887008755294, 0.06319852042339605, 0.021046027967154428, 0.023263040264309556, 0.038181933291532376, -0.14645808883824094, 0.07695166679978785, 0.18339383631332398, 0.04546336437299572, 0.24742730699341606, -0.43336857738042317, -0.20731050355911806, 0.09425804414958866, 0.18858166865797507, 0.13723733109525507, -0.06240028224937204, -0.2675260610947454, 0.05602114640038323, -0.20224763587876052, -0.19220077884900902, -0.03662864179522903, 0.062406722049194355, 0.048418462154869404, -0.27070044190881565, 0.15308349959345327, 0.031967934044897214, 0.02617598551980875, -0.08188247347780918, -0.05267554425582704, -0.0528430313234114, 0.08150857720110151, 0.0448003028252936, 0.0019472418939349828, 0.13932038496627852, -0.152249205491885, -0.07481060424750602, 0.3576969480762879, -0.08707592272063873, -0.17333358774065144, 0.21289052356172491, -0.17377888249509313, -0.061512799613841776, 0.1630489000602177, 0.13439590807452245, 0.07909408684957911, -0.09275786684895003, 0.1265631114149949, -0.023549482620459188, 0.1698411372386747, 0.0027121941007121845, 0.058809730741227716, 0.17736355009730215, 0.1781937760266441, 0.057575820986164254, 0.16170579240855726, -0.04853718960010964, -0.1768780969945645, -0.29541188224598214, -0.1676289550114975, -0.24296371610835193, 0.06392770597918165, -0.10573826257648222, -0.16295336371080743, 0.3981795895775711, 0.10481523674248752, 0.23135700602498319, 0.10239543594178502, 0.2393452590952317, 0.1704758037088646, 0.04117432507789797, 0.09359261428072825, 0.24197833915068595, 0.1408826938606109, 0.05785912424325943, -0.2830435175293436, 0.03541743526649144, 0.04738621654644332]
1,802.08266
Lyapunov exponents and rigidity of Anosov automorphisms and skew products
In this paper we obtain local rigidity results for linear Anosov diffeomorphisms in terms of Lyapunov exponents. More specifically, we show that given an irreducible linear hyperbolic automorphism $L$ with simple real eigenvalues with distinct absolute values, any small perturbation preserving the volume and with the same Lyapunov exponents is smoothly conjugate to $L$. We also obtain rigidity results for skew products over Anosov diffeomorphisms. Given a volume preserving partially hyperbolic skew product diffeomorphism $f_0$ over an Anosov automorphism of the 2-torus, we show that for any volume preserving perturbation $f$ of $f_0$ with the same average stable and unstable Lyapunov exponents, the center foliation is smooth.
math.DS
in this paper we obtain local rigidity results for linear anosov diffeomorphisms in terms of lyapunov exponents more specifically we show that given an irreducible linear hyperbolic automorphism l with simple real eigenvalues with distinct absolute values any small perturbation preserving the volume and with the same lyapunov exponents is smoothly conjugate to l we also obtain rigidity results for skew products over anosov diffeomorphisms given a volume preserving partially hyperbolic skew product diffeomorphism f_0 over an anosov automorphism of the 2torus we show that for any volume preserving perturbation f of f_0 with the same average stable and unstable lyapunov exponents the center foliation is smooth
[['in', 'this', 'paper', 'we', 'obtain', 'local', 'rigidity', 'results', 'for', 'linear', 'anosov', 'diffeomorphisms', 'in', 'terms', 'of', 'lyapunov', 'exponents', 'more', 'specifically', 'we', 'show', 'that', 'given', 'an', 'irreducible', 'linear', 'hyperbolic', 'automorphism', 'l', 'with', 'simple', 'real', 'eigenvalues', 'with', 'distinct', 'absolute', 'values', 'any', 'small', 'perturbation', 'preserving', 'the', 'volume', 'and', 'with', 'the', 'same', 'lyapunov', 'exponents', 'is', 'smoothly', 'conjugate', 'to', 'l', 'we', 'also', 'obtain', 'rigidity', 'results', 'for', 'skew', 'products', 'over', 'anosov', 'diffeomorphisms', 'given', 'a', 'volume', 'preserving', 'partially', 'hyperbolic', 'skew', 'product', 'diffeomorphism', 'f_0', 'over', 'an', 'anosov', 'automorphism', 'of', 'the', '2torus', 'we', 'show', 'that', 'for', 'any', 'volume', 'preserving', 'perturbation', 'f', 'of', 'f_0', 'with', 'the', 'same', 'average', 'stable', 'and', 'unstable', 'lyapunov', 'exponents', 'the', 'center', 'foliation', 'is', 'smooth']]
[-0.2349384576201909, 0.14773940260410004, -0.09274988586657515, 0.021804362849906854, -0.06252136763846763, -0.14505828058381923, -0.026475451071746647, 0.33939240333976695, -0.311376295357107, -0.13079256637491912, 0.10429996526451939, -0.29866590521463726, -0.1658267444391326, 0.1959904857180038, -0.1428502677791865, 0.09601581996759927, 0.03856115125850818, 0.1120677235074968, -0.16236095074738296, -0.23627534661024252, 0.39077576225466815, -0.04951630208954633, 0.19432877694152156, 0.06903805378302236, 0.14018792053249396, -0.006984833057830545, -0.015174877855961567, 0.033053929915338336, -0.21049544287948307, 0.0785348560230232, 0.2633289573888216, 0.03513825241754824, 0.17633671885808913, -0.28185938568524666, -0.17600423301935683, 0.2187193323048615, 0.14259443960639986, 0.003349458676910846, -0.03666178489342728, -0.3064876257085076, 0.1569308925193743, -0.14783047208405822, -0.20202151363907017, -0.13123977140775908, 0.079096770092462, 0.010210735558001238, -0.2498444847710361, 0.08476302719421502, 0.12821614327971068, 0.1869397958583921, -0.10667679415445636, -0.05346107143456134, -0.10796965131205376, 0.1512530577090508, 0.05389949449155236, 0.031014587212284315, 0.16313192822369876, 0.026509012676618784, -0.06470184125741682, 0.33509841916438576, -0.11838107764129048, -0.319207533099471, 0.13806887089370568, -0.20583544352970948, -0.1805392203060475, 0.1814084233080742, 0.15212668554213282, 0.10383264212129271, -0.035853313578066426, 0.1812815877563259, -0.08582370432320043, 0.143329434645162, 0.09648471747777451, -0.047841172891660275, 0.08211555589799917, 0.024203107546510123, 0.2174806338517326, 0.11593758007000139, 0.0605685358222957, -0.06296567143611262, -0.35132475122461254, -0.158337736976655, -0.11659100999028604, 0.15423352917151473, -0.19555418894416218, -0.21212766790396978, 0.4031455274497237, 0.00447560112192252, 0.21206165889765474, 0.2151135018652427, 0.25223178747240627, 0.09054681506099302, 0.042850369152343165, 0.1630725868472777, 0.1435232430383145, 0.1752499710664014, -0.038570858253096446, -0.1765712110486717, -0.04849477089227778, 0.1972600333914857]
1,802.08267
TASI Lectures on Applications of Gauge/Gravity Duality
We introduce the gauge/gravity, or AdS/CFT, correspondence with an eye towards its application to strongly coupled systems. We provide an overview of the duality, including the AdS/CFT dictionary and holographic renormalization. We then discuss simple correlation functions in the context of renormalization group flow geometries, holographic thermodynamics and an application to the phase diagram of QCD, real-time correlators and the shear viscosity of strongly coupled field theories, holographic superconductors, and the application of holographic fermionic response to strange metals. These lectures were delivered at TASI 2017.
hep-th
we introduce the gaugegravity or adscft correspondence with an eye towards its application to strongly coupled systems we provide an overview of the duality including the adscft dictionary and holographic renormalization we then discuss simple correlation functions in the context of renormalization group flow geometries holographic thermodynamics and an application to the phase diagram of qcd realtime correlators and the shear viscosity of strongly coupled field theories holographic superconductors and the application of holographic fermionic response to strange metals these lectures were delivered at tasi 2017
[['we', 'introduce', 'the', 'gaugegravity', 'or', 'adscft', 'correspondence', 'with', 'an', 'eye', 'towards', 'its', 'application', 'to', 'strongly', 'coupled', 'systems', 'we', 'provide', 'an', 'overview', 'of', 'the', 'duality', 'including', 'the', 'adscft', 'dictionary', 'and', 'holographic', 'renormalization', 'we', 'then', 'discuss', 'simple', 'correlation', 'functions', 'in', 'the', 'context', 'of', 'renormalization', 'group', 'flow', 'geometries', 'holographic', 'thermodynamics', 'and', 'an', 'application', 'to', 'the', 'phase', 'diagram', 'of', 'qcd', 'realtime', 'correlators', 'and', 'the', 'shear', 'viscosity', 'of', 'strongly', 'coupled', 'field', 'theories', 'holographic', 'superconductors', 'and', 'the', 'application', 'of', 'holographic', 'fermionic', 'response', 'to', 'strange', 'metals', 'these', 'lectures', 'were', 'delivered', 'at', 'tasi', '2017']]
[-0.1345941282722146, 0.15939525980417762, -0.1654932600890048, 0.046670454586747775, -0.10102301275054383, -0.14393702910151765, -0.019656562062283587, 0.33398737287998936, -0.20811795980431314, -0.2191208487614816, 0.08958378204734736, -0.33748950374984116, -0.14846884646875308, 0.10825827863164852, -0.03160954500626124, 0.06923563802698736, -0.04756935492434084, 0.026754486940728045, -0.16211937996017378, -0.28110932880812217, 0.34357549246877084, 0.03721806753513425, 0.35417015458792883, 0.15144260248255936, 0.06966225926082062, 0.024631332914713165, -0.015837812130231152, 0.04808373748173201, -0.18949251176876036, 0.12490164269801489, 0.30353800999542135, 0.06160396541777435, 0.12499247471866913, -0.4713424519570761, -0.22295145361229432, 0.005935781456660046, 0.112052081898667, 0.13807248109464296, -0.07602106925468285, -0.28614244398357735, -0.016009476577299973, -0.22781896731967843, -0.14944383731317643, -0.12645743223080455, -0.03963780923892722, -0.06527457881155749, -0.21176559230052802, 0.0838801656595193, -0.05812447062736854, 0.10661125836114205, -0.03664429854333596, -0.018882239727454998, 0.016325796921845784, 0.07322372900332909, 0.07704176599982866, 0.07034090162947947, 0.14551927616581495, -0.25242940899591115, -0.10536133837385298, 0.3430942698858332, -0.054707261793272094, -0.11455924860959829, 0.25577935572648636, -0.10236157526716937, -0.14941595665309146, 0.015334710782003958, 0.1783075151575166, 0.16434224358716504, -0.1533532454415636, 0.09722674662128178, -0.017430294445867456, 0.11856354069137989, 0.03672062961904462, 0.053294035844331566, 0.30118828066245673, 0.1307297950599689, -0.03813125715092864, 0.20037724569353255, 0.004679728147768697, -0.09526658689516575, -0.4065285791144815, -0.1815586857562668, -0.15344874682121498, 0.03598167704754011, -0.13129723957823697, -0.15000338814502887, 0.3890118001375434, 0.15241026219392065, 0.1627854543486285, 0.029766752316919696, 0.22048406149152405, 0.10894995856337077, 0.012087833672372062, 0.05596758183741639, 0.23902122059642056, 0.19040802476635246, 0.15563454920413997, -0.302667539474706, -0.1361894528922993, 0.23165971210746225]
1,802.08268
Odd-frequency Pairing in the Edge States of Superconducting Pnictides in the Coexistence Phase with Antiferromagnetism
In several members of the pnictide materials, spin density wave order coexists with superconductivity over a range of dopings and temperature. In this paper we show that odd-frequency superconductivity emerges on the edges of pnictides in such a coexistence phase. In particular, the breaking of spin-rotation symmetry by SDW and translation symmetry by the edge can lead to the development of odd-frequency spin-triplet Cooper pairing on edges of superconducting pnictide samples. In this case, the odd-frequency pairing has even parity components, which are immune to disorder. Our results show that pnictides are a natural platform to realize odd frequency superconductivity, which is a new quantum phase and has been mainly searched for in heterostructures of magnetic and superconducting materials. The emergence of odd-frequency pairing on the edges and in the defects can be potentially detected in magnetic response measurements.
cond-mat.supr-con
in several members of the pnictide materials spin density wave order coexists with superconductivity over a range of dopings and temperature in this paper we show that oddfrequency superconductivity emerges on the edges of pnictides in such a coexistence phase in particular the breaking of spinrotation symmetry by sdw and translation symmetry by the edge can lead to the development of oddfrequency spintriplet cooper pairing on edges of superconducting pnictide samples in this case the oddfrequency pairing has even parity components which are immune to disorder our results show that pnictides are a natural platform to realize odd frequency superconductivity which is a new quantum phase and has been mainly searched for in heterostructures of magnetic and superconducting materials the emergence of oddfrequency pairing on the edges and in the defects can be potentially detected in magnetic response measurements
[['in', 'several', 'members', 'of', 'the', 'pnictide', 'materials', 'spin', 'density', 'wave', 'order', 'coexists', 'with', 'superconductivity', 'over', 'a', 'range', 'of', 'dopings', 'and', 'temperature', 'in', 'this', 'paper', 'we', 'show', 'that', 'oddfrequency', 'superconductivity', 'emerges', 'on', 'the', 'edges', 'of', 'pnictides', 'in', 'such', 'a', 'coexistence', 'phase', 'in', 'particular', 'the', 'breaking', 'of', 'spinrotation', 'symmetry', 'by', 'sdw', 'and', 'translation', 'symmetry', 'by', 'the', 'edge', 'can', 'lead', 'to', 'the', 'development', 'of', 'oddfrequency', 'spintriplet', 'cooper', 'pairing', 'on', 'edges', 'of', 'superconducting', 'pnictide', 'samples', 'in', 'this', 'case', 'the', 'oddfrequency', 'pairing', 'has', 'even', 'parity', 'components', 'which', 'are', 'immune', 'to', 'disorder', 'our', 'results', 'show', 'that', 'pnictides', 'are', 'a', 'natural', 'platform', 'to', 'realize', 'odd', 'frequency', 'superconductivity', 'which', 'is', 'a', 'new', 'quantum', 'phase', 'and', 'has', 'been', 'mainly', 'searched', 'for', 'in', 'heterostructures', 'of', 'magnetic', 'and', 'superconducting', 'materials', 'the', 'emergence', 'of', 'oddfrequency', 'pairing', 'on', 'the', 'edges', 'and', 'in', 'the', 'defects', 'can', 'be', 'potentially', 'detected', 'in', 'magnetic', 'response', 'measurements']]
[-0.2695548800925771, 0.2710207708602061, -0.041352163042149524, 0.04527286814924383, -0.07726512724707882, -0.14476616785479643, 0.074921501618676, 0.3751001480444194, -0.20217252759002868, -0.24345829087584245, -0.04046645388007164, -0.3469775391126172, -0.13713364530247535, 0.13593621420332316, 0.028949676840331593, 0.014944468899596509, -0.07403377783920267, -0.027142697838034562, -0.13123256965915558, -0.2551606462316976, 0.35814244924582167, -0.05898889119103685, 0.36185325798746065, 0.11238046871873436, -0.02437945002046742, -0.024812771513280894, 0.17392697183937905, 0.005576513546833889, -0.09232037847833591, 0.03891505026292029, 0.369147684565819, -0.0772031350044547, 0.17479923993148908, -0.4541300152622753, -0.2522666960177447, 0.04924510713505874, 0.15437788268879538, 0.1702845604912706, -0.08421747383691719, -0.32591525833591445, 0.0949122331577534, -0.18871274884629377, -0.09471270097620624, -0.12479037928843884, -0.016632791300364536, -0.04425493478708023, -0.24495262348448202, 0.06846046105710615, 0.09483403251539889, 0.11163342383643277, -0.08887889282442897, -0.09547303513148063, -0.07897316224256651, -0.020249523088443192, 0.09797789100658068, 0.062015094248269745, 0.07069838749037104, -0.14556898305313193, -0.14839651899264872, 0.34706325233719654, -0.0053324741185743285, -0.046178267029174366, 0.1421515163295507, -0.1496551820619715, -0.10399255949816258, 0.12386550654141272, 0.11863833265848082, 0.04094282057297101, -0.11447350746070926, 0.0690814905641634, -0.04199548702586104, 0.17303582105329998, 0.025701911945780403, 0.12985311821773113, 0.2645692723927175, 0.2163309813359846, 0.08927153848674234, 0.11243357094048301, -0.1167805216747517, -0.004137211348593449, -0.2571257751689648, -0.20901256206063487, -0.24645504801326412, 0.014591558161673216, -0.02974563820918657, -0.18645570468050326, 0.4546875199906046, 0.20110601591777136, 0.17886667355238425, -0.11711219790485426, 0.1978751269584562, 0.07650232900992679, 0.13290643071581562, 0.02236233166923157, 0.23224367280557698, 0.15061835328572623, 0.06295249983123939, -0.3260133476566068, 0.13569231691817157, 0.007942831657974304]
1,802.08269
Dirac cones and mass terms in bosonic spectra
The notion of Dirac cones, wherein two or more bands become degenerate at a certain momentum, is the starting point for the study of topological phases. Dirac cones have been thoroughly explored in fermionic systems such as graphene, Weyl semimetals, etc. The underlying mathematical structure in these systems is a Clifford algebra -- a rule for identifying sets of matrices that span the Hamiltonian. This structure allows for the identification of suitable `mass' terms to open band gaps. In this article, we extend these ideas to bosonic systems. Due to the pseudo-orthogonal nature of eigenvectors, the algebra of matrices takes a very different form. Taking the honeycomb XY ferromagnet as a prototype, we show that a Dirac cone emerges in the magnon spectrum. A gap can be opened by a suitable mass term involving next-nearest neighbour interactions. We next construct a one-dimensional ladder model with triplon excitations. Using the new Clifford algebra, we define winding number as a topological invariant. In analogy with the Su-Schrieffer-Heeger model, topological transitions occur when the band gap closes, leading to the appearance (or disappearance) of protected edge states. Our results suggest a new route to studying band touching and band topology in bosonic systems.
cond-mat.mes-hall
the notion of dirac cones wherein two or more bands become degenerate at a certain momentum is the starting point for the study of topological phases dirac cones have been thoroughly explored in fermionic systems such as graphene weyl semimetals etc the underlying mathematical structure in these systems is a clifford algebra a rule for identifying sets of matrices that span the hamiltonian this structure allows for the identification of suitable mass terms to open band gaps in this article we extend these ideas to bosonic systems due to the pseudoorthogonal nature of eigenvectors the algebra of matrices takes a very different form taking the honeycomb xy ferromagnet as a prototype we show that a dirac cone emerges in the magnon spectrum a gap can be opened by a suitable mass term involving nextnearest neighbour interactions we next construct a onedimensional ladder model with triplon excitations using the new clifford algebra we define winding number as a topological invariant in analogy with the suschriefferheeger model topological transitions occur when the band gap closes leading to the appearance or disappearance of protected edge states our results suggest a new route to studying band touching and band topology in bosonic systems
[['the', 'notion', 'of', 'dirac', 'cones', 'wherein', 'two', 'or', 'more', 'bands', 'become', 'degenerate', 'at', 'a', 'certain', 'momentum', 'is', 'the', 'starting', 'point', 'for', 'the', 'study', 'of', 'topological', 'phases', 'dirac', 'cones', 'have', 'been', 'thoroughly', 'explored', 'in', 'fermionic', 'systems', 'such', 'as', 'graphene', 'weyl', 'semimetals', 'etc', 'the', 'underlying', 'mathematical', 'structure', 'in', 'these', 'systems', 'is', 'a', 'clifford', 'algebra', 'a', 'rule', 'for', 'identifying', 'sets', 'of', 'matrices', 'that', 'span', 'the', 'hamiltonian', 'this', 'structure', 'allows', 'for', 'the', 'identification', 'of', 'suitable', 'mass', 'terms', 'to', 'open', 'band', 'gaps', 'in', 'this', 'article', 'we', 'extend', 'these', 'ideas', 'to', 'bosonic', 'systems', 'due', 'to', 'the', 'pseudoorthogonal', 'nature', 'of', 'eigenvectors', 'the', 'algebra', 'of', 'matrices', 'takes', 'a', 'very', 'different', 'form', 'taking', 'the', 'honeycomb', 'xy', 'ferromagnet', 'as', 'a', 'prototype', 'we', 'show', 'that', 'a', 'dirac', 'cone', 'emerges', 'in', 'the', 'magnon', 'spectrum', 'a', 'gap', 'can', 'be', 'opened', 'by', 'a', 'suitable', 'mass', 'term', 'involving', 'nextnearest', 'neighbour', 'interactions', 'we', 'next', 'construct', 'a', 'onedimensional', 'ladder', 'model', 'with', 'triplon', 'excitations', 'using', 'the', 'new', 'clifford', 'algebra', 'we', 'define', 'winding', 'number', 'as', 'a', 'topological', 'invariant', 'in', 'analogy', 'with', 'the', 'suschriefferheeger', 'model', 'topological', 'transitions', 'occur', 'when', 'the', 'band', 'gap', 'closes', 'leading', 'to', 'the', 'appearance', 'or', 'disappearance', 'of', 'protected', 'edge', 'states', 'our', 'results', 'suggest', 'a', 'new', 'route', 'to', 'studying', 'band', 'touching', 'and', 'band', 'topology', 'in', 'bosonic', 'systems']]
[-0.22599062837611172, 0.1737740969948761, -0.04731130214534702, 0.07804012625248888, -0.08590052037467084, -0.16661069952372706, 0.08678185878012648, 0.34868981989203535, -0.29664908822195313, -0.2584336997833496, 0.05145094057091105, -0.2976170951913985, -0.1797489614609685, 0.13221066968454676, 0.014570522504676152, 0.028180340482811234, 0.030273465054746176, -0.017243666279518125, -0.14821790054150338, -0.18916467149114827, 0.36782123817332163, -0.0045493596266187614, 0.24889222915803816, 0.045276036019198336, 0.027107786574405643, 0.01911072062805819, 0.07524731878691994, 0.0072144742460743564, -0.10375795911697158, 0.09561843255472757, 0.2550463693242183, -0.041465949103860394, 0.2059855394383621, -0.40898243678340584, -0.20233079076899058, 0.06391598116232072, 0.162854929211849, 0.11810036917420656, -0.046429978781066784, -0.31598919808827153, 0.042175325045814616, -0.20127566800167287, -0.16532860123950183, -0.09137808827358068, -0.006472418408831534, -0.08209027631802662, -0.20799606156724987, 0.043051154919006115, 0.06791043594648041, 0.06587477941557428, -0.06118558662892062, -0.10404533178582975, -0.09512678843609353, 0.08590213252870886, 0.0011647971090743665, -0.0040492108315475115, 0.07492726279455401, -0.09793438604943941, -0.17990285898301395, 0.42005073462364884, -0.028824434702251874, -0.1876746637784132, 0.18256522703859673, -0.13801025025127983, -0.13481703136659148, 0.11340707629432331, 0.13017012696185537, 0.057944343340800765, -0.124637976251136, 0.14107774664623307, -0.07013086008315148, 0.08584205033526704, 0.024456325593175152, 0.09426248575743269, 0.28607594046797885, 0.1597865564765025, 0.09037915295827666, 0.15324849088854114, -0.0671197426933608, -0.09487914422353795, -0.27565223794903176, -0.19535731045697727, -0.2286723103051322, 0.06970722811418263, -0.027810089397709233, -0.2146060873880683, 0.4805738593688019, 0.11771335828424567, 0.22776985623003287, 0.0026160141911788204, 0.19059362976657385, 0.1294008110001702, 0.08800326054213783, 0.05674843033646987, 0.20555106985579297, 0.15222817559693777, 0.06890705169234705, -0.1862917829857175, -0.053198937881251226, 0.10467488539578328]
1,802.0827
Super-Solar Metallicity Stars in the Galactic Center Nuclear Star Cluster: Unusual Sc, V, and Y Abundances
We present adaptive-optics assisted near-infrared high-spectral resolution observations of late-type giants in the nuclear star cluster of the Milky Way. The metallicity and elemental abundance measurements of these stars offer us an opportunity to understand the formation and evolution of the nuclear star cluster. In addition, their proximity to the supermassive black hole ($\sim 0.5$ pc) offers a unique probe of the star formation and chemical enrichment in this extreme environment. We observed two stars identified by medium spectral-resolution observations as potentially having very high metallicities. We use spectral-template fitting with the PHOENIX grid and Bayesian inference to simultaneously constrain the overall metallicity, [M/H], alpha-element abundance [$\alpha$/Fe], effective temperature, and surface gravity of these stars. We find that one of the stars has very high metallicity ([M/H] $> 0.6$) and the other is slightly above solar metallicity. Both Galactic center stars have lines from scandium (Sc), vanadium (V), and yttrium (Y) that are much stronger than allowed by the PHOENIX grid. We find, using the spectral synthesis code Spectroscopy Made Easy, that [Sc/Fe] may be an order of magnitude above solar. For comparison, we also observed an empirical calibrator in NGC6791, the highest metallicity cluster known ([M/H] $\sim 0.4$). Most lines are well matched between the calibrator and the Galactic center stars, except for Sc, V, and Y, which confirms that their abundances must be anomalously high in these stars. These unusual abundances, which may be a unique signature of nuclear star clusters, offer an opportunity to test models of chemical enrichment in this region.
astro-ph.GA astro-ph.SR
we present adaptiveoptics assisted nearinfrared highspectral resolution observations of latetype giants in the nuclear star cluster of the milky way the metallicity and elemental abundance measurements of these stars offer us an opportunity to understand the formation and evolution of the nuclear star cluster in addition their proximity to the supermassive black hole sim 05 pc offers a unique probe of the star formation and chemical enrichment in this extreme environment we observed two stars identified by medium spectralresolution observations as potentially having very high metallicities we use spectraltemplate fitting with the phoenix grid and bayesian inference to simultaneously constrain the overall metallicity mh alphaelement abundance alphafe effective temperature and surface gravity of these stars we find that one of the stars has very high metallicity mh 06 and the other is slightly above solar metallicity both galactic center stars have lines from scandium sc vanadium v and yttrium y that are much stronger than allowed by the phoenix grid we find using the spectral synthesis code spectroscopy made easy that scfe may be an order of magnitude above solar for comparison we also observed an empirical calibrator in ngc6791 the highest metallicity cluster known mh sim 04 most lines are well matched between the calibrator and the galactic center stars except for sc v and y which confirms that their abundances must be anomalously high in these stars these unusual abundances which may be a unique signature of nuclear star clusters offer an opportunity to test models of chemical enrichment in this region
[['we', 'present', 'adaptiveoptics', 'assisted', 'nearinfrared', 'highspectral', 'resolution', 'observations', 'of', 'latetype', 'giants', 'in', 'the', 'nuclear', 'star', 'cluster', 'of', 'the', 'milky', 'way', 'the', 'metallicity', 'and', 'elemental', 'abundance', 'measurements', 'of', 'these', 'stars', 'offer', 'us', 'an', 'opportunity', 'to', 'understand', 'the', 'formation', 'and', 'evolution', 'of', 'the', 'nuclear', 'star', 'cluster', 'in', 'addition', 'their', 'proximity', 'to', 'the', 'supermassive', 'black', 'hole', 'sim', '05', 'pc', 'offers', 'a', 'unique', 'probe', 'of', 'the', 'star', 'formation', 'and', 'chemical', 'enrichment', 'in', 'this', 'extreme', 'environment', 'we', 'observed', 'two', 'stars', 'identified', 'by', 'medium', 'spectralresolution', 'observations', 'as', 'potentially', 'having', 'very', 'high', 'metallicities', 'we', 'use', 'spectraltemplate', 'fitting', 'with', 'the', 'phoenix', 'grid', 'and', 'bayesian', 'inference', 'to', 'simultaneously', 'constrain', 'the', 'overall', 'metallicity', 'mh', 'alphaelement', 'abundance', 'alphafe', 'effective', 'temperature', 'and', 'surface', 'gravity', 'of', 'these', 'stars', 'we', 'find', 'that', 'one', 'of', 'the', 'stars', 'has', 'very', 'high', 'metallicity', 'mh', '06', 'and', 'the', 'other', 'is', 'slightly', 'above', 'solar', 'metallicity', 'both', 'galactic', 'center', 'stars', 'have', 'lines', 'from', 'scandium', 'sc', 'vanadium', 'v', 'and', 'yttrium', 'y', 'that', 'are', 'much', 'stronger', 'than', 'allowed', 'by', 'the', 'phoenix', 'grid', 'we', 'find', 'using', 'the', 'spectral', 'synthesis', 'code', 'spectroscopy', 'made', 'easy', 'that', 'scfe', 'may', 'be', 'an', 'order', 'of', 'magnitude', 'above', 'solar', 'for', 'comparison', 'we', 'also', 'observed', 'an', 'empirical', 'calibrator', 'in', 'ngc6791', 'the', 'highest', 'metallicity', 'cluster', 'known', 'mh', 'sim', '04', 'most', 'lines', 'are', 'well', 'matched', 'between', 'the', 'calibrator', 'and', 'the', 'galactic', 'center', 'stars', 'except', 'for', 'sc', 'v', 'and', 'y', 'which', 'confirms', 'that', 'their', 'abundances', 'must', 'be', 'anomalously', 'high', 'in', 'these', 'stars', 'these', 'unusual', 'abundances', 'which', 'may', 'be', 'a', 'unique', 'signature', 'of', 'nuclear', 'star', 'clusters', 'offer', 'an', 'opportunity', 'to', 'test', 'models', 'of', 'chemical', 'enrichment', 'in', 'this', 'region']]
[-0.02336376859427323, 0.12215592142258008, -0.06521386840369685, 0.09044377854841176, -0.10572173171276374, -0.08455576264118157, 0.09537988057150229, 0.45938929851008614, -0.1699774141930478, -0.40776093679447123, 0.008541198641065464, -0.29061236258839135, 0.01810707097501299, 0.18150850398127327, -0.048809432582087676, -0.0450164011459643, 0.05719303984283341, -0.0591084133620142, -0.06095072044714873, -0.2661542069431939, 0.2710382888726743, 0.09370665848181535, 0.14442026816499917, -0.0367920133593518, 0.011116842673023935, -0.1572288313165966, -0.02698414927079773, -0.0004394780835247205, -0.17446369598695563, 0.044971112693105955, 0.2646863296746743, 0.13041855212164816, 0.18206780543734905, -0.3417883670664293, -0.21040390452127095, 0.049959839454653265, 0.22064298439196683, 0.04919130302617775, -0.15808456439502802, -0.22275135703679366, 0.07256467565937841, -0.17261750419281807, -0.18756304229628074, 0.01968403517431171, 0.004788866459866876, 0.026734893959339544, -0.25182280394252343, 0.08603205356890475, 0.010793395632171172, 0.1290792959388861, -0.11223687562197004, -0.16457143487600176, -0.09639321162785024, 0.0992121947717599, -0.026314802404323764, 0.0691690509531485, 0.14046607107630832, -0.09284051578848994, 0.010498426747858053, 0.4030131097227747, -0.11015808561490342, 0.029759007465580235, 0.24803782368940208, -0.23386306133077078, -0.18090901382289562, 0.06866468235357065, 0.12581115749410607, 0.15020919451490045, -0.19964277105343348, 0.023425466190745665, 0.016740896726181738, 0.20048268807669106, 0.05904706756505202, 0.06712648298098106, 0.33108874583886494, 0.1330897760993466, 0.06020283046005507, 0.02045804972639823, -0.24162460066260322, -0.037870934057296086, -0.17494501977636231, -0.14400318518958308, -0.0788619288044573, 0.08262864721208726, -0.19939511298659127, -0.13482994333520648, 0.32341300376257015, 0.13385723719236223, 0.2279457865519175, -0.019232652537532063, 0.27799417648792063, 0.07983529708981367, 0.11322431399012095, 0.10522989557113631, 0.3052699823087089, 0.23163252489884262, 0.10725855744414385, -0.28838698649061145, 0.1054481417939192, -0.01961866259416602]
1,802.08271
Chaotic dynamics in spin-vortex pairs
We report on spin-vortex pair dynamics measured at temperatures low enough to suppress stochastic core motion, thereby uncovering the highly non-linear intrinsic dynamics of the system. Our analysis shows that the decoupling of the two vortex cores is resonant and can be enhanced by dynamic chaos. We detail the regions of the relevant parameter space, in which the various mechanisms of the resonant core-core dynamics are activated. We show that the presence of chaos can reduce the thermally-induced spread in the switching time by up to two orders of magnitude.
cond-mat.mes-hall
we report on spinvortex pair dynamics measured at temperatures low enough to suppress stochastic core motion thereby uncovering the highly nonlinear intrinsic dynamics of the system our analysis shows that the decoupling of the two vortex cores is resonant and can be enhanced by dynamic chaos we detail the regions of the relevant parameter space in which the various mechanisms of the resonant corecore dynamics are activated we show that the presence of chaos can reduce the thermallyinduced spread in the switching time by up to two orders of magnitude
[['we', 'report', 'on', 'spinvortex', 'pair', 'dynamics', 'measured', 'at', 'temperatures', 'low', 'enough', 'to', 'suppress', 'stochastic', 'core', 'motion', 'thereby', 'uncovering', 'the', 'highly', 'nonlinear', 'intrinsic', 'dynamics', 'of', 'the', 'system', 'our', 'analysis', 'shows', 'that', 'the', 'decoupling', 'of', 'the', 'two', 'vortex', 'cores', 'is', 'resonant', 'and', 'can', 'be', 'enhanced', 'by', 'dynamic', 'chaos', 'we', 'detail', 'the', 'regions', 'of', 'the', 'relevant', 'parameter', 'space', 'in', 'which', 'the', 'various', 'mechanisms', 'of', 'the', 'resonant', 'corecore', 'dynamics', 'are', 'activated', 'we', 'show', 'that', 'the', 'presence', 'of', 'chaos', 'can', 'reduce', 'the', 'thermallyinduced', 'spread', 'in', 'the', 'switching', 'time', 'by', 'up', 'to', 'two', 'orders', 'of', 'magnitude']]
[-0.19510468607768416, 0.19973170002922416, -0.06042226997669786, 0.054838678715491876, -0.015117830529602038, -0.05589709683424897, 0.042480409952501456, 0.3497846775584751, -0.31218534886009164, -0.31224673986434937, 0.09139422544329945, -0.25217391450165044, -0.156140039043708, 0.1928414308776458, 0.039854741017592864, 0.004391052501483096, 0.013140154495421384, -0.020077833176926813, -0.02847779637409581, -0.2043778656154043, 0.3215680751315732, 0.048993388832443294, 0.2799704878953182, 0.05076152443264922, 0.0897932902081973, -0.03542973338367624, 0.0014462765720155504, 0.01884081988795919, -0.09640125262424894, 0.07637300541003546, 0.20183219164609909, 0.013560498190215892, 0.24058942371565434, -0.45383392682092055, -0.22481293505471614, 0.07659107269201841, 0.17484965519688558, 0.13186673465210738, -0.011884806694514636, -0.27349863854340384, 0.09043348406751951, -0.11716004128878316, -0.13251840411168006, -0.11861732926012741, -0.0004591534742050701, 0.04069139576620526, -0.2339686132553551, 0.10160780648131751, 0.07928292602300643, 0.004140667438817521, -0.03354007861990896, -0.04276556502898327, -0.05310427748481743, 0.10718546230345964, 0.018959602245336604, -0.007750841183587908, 0.17939552488840288, -0.12969565189042542, -0.12733978438708518, 0.3398081258689571, -0.09241397457145568, -0.13687038891431358, 0.23303666691709723, -0.19675134061318306, -0.08616175613779989, 0.20372227238387697, 0.18390014872161878, 0.11464060411478082, -0.13434426927318174, 0.009873396615795274, 0.04955527511321836, 0.17876345724281337, 0.05217836804998418, 0.06953777686382333, 0.20877567012276915, 0.20621192610382827, 0.044215416784087816, 0.16655346346346456, -0.14370801663802316, -0.1559967446554866, -0.26051568594347274, -0.09500514777480729, -0.11248231003733558, -0.00024151181051921514, -0.11542976942000678, -0.10930503935863574, 0.41681017954833804, 0.18005817372144925, 0.20157433037044636, -0.03250531738287666, 0.2766616137284372, 0.16022702623288043, 0.059520454202882114, 0.03972082778087093, 0.2884742616675794, 0.10387973703133563, 0.09194690357997186, -0.3425241799249003, 0.09466042127460242, 0.006530908565036952]
1,802.08272
URAT South Parallax Results: Discovery of New Nearby Stars
We present 916 trigonometric parallaxes and proper motions of newly discovered nearby stars from the United States Naval Observatory (USNO) Robotic Astrometric Telescope (URAT). Observations were taken at the Cerro Tololo Interamerican Observatory (CTIO) over a 2 year period from Oct 2015 to Oct 2017 covering the entire sky south of about +25 deg declination. SPM4 and UCAC4 early epoch catalog data were added to extend the temporal coverage for the parallax and proper motion fit up to 48 years. Using these new URAT parallaxes, optical and near-IR photometry from the APASS and 2MASS catalogs, we identify possible new nearby dwarfs, young stars, low-metallicity subdwarfs and white dwarfs. Comparison to known trigonometric parallaxes show a high quality of the URAT-based results confirming the error in parallax of the URAT south parallaxes reported here to be between 2 and 13 mas. We also include additional 729 trigonometric parallaxes from the URAT north 25 pc sample published in Finch & Zacharias (2016) here after applying the same criterion as for the southern sample to have a complete URAT 25 pc sample presented in this paper.
astro-ph.SR
we present 916 trigonometric parallaxes and proper motions of newly discovered nearby stars from the united states naval observatory usno robotic astrometric telescope urat observations were taken at the cerro tololo interamerican observatory ctio over a 2 year period from oct 2015 to oct 2017 covering the entire sky south of about 25 deg declination spm4 and ucac4 early epoch catalog data were added to extend the temporal coverage for the parallax and proper motion fit up to 48 years using these new urat parallaxes optical and nearir photometry from the apass and 2mass catalogs we identify possible new nearby dwarfs young stars lowmetallicity subdwarfs and white dwarfs comparison to known trigonometric parallaxes show a high quality of the uratbased results confirming the error in parallax of the urat south parallaxes reported here to be between 2 and 13 mas we also include additional 729 trigonometric parallaxes from the urat north 25 pc sample published in finch zacharias 2016 here after applying the same criterion as for the southern sample to have a complete urat 25 pc sample presented in this paper
[['we', 'present', '916', 'trigonometric', 'parallaxes', 'and', 'proper', 'motions', 'of', 'newly', 'discovered', 'nearby', 'stars', 'from', 'the', 'united', 'states', 'naval', 'observatory', 'usno', 'robotic', 'astrometric', 'telescope', 'urat', 'observations', 'were', 'taken', 'at', 'the', 'cerro', 'tololo', 'interamerican', 'observatory', 'ctio', 'over', 'a', '2', 'year', 'period', 'from', 'oct', '2015', 'to', 'oct', '2017', 'covering', 'the', 'entire', 'sky', 'south', 'of', 'about', '25', 'deg', 'declination', 'spm4', 'and', 'ucac4', 'early', 'epoch', 'catalog', 'data', 'were', 'added', 'to', 'extend', 'the', 'temporal', 'coverage', 'for', 'the', 'parallax', 'and', 'proper', 'motion', 'fit', 'up', 'to', '48', 'years', 'using', 'these', 'new', 'urat', 'parallaxes', 'optical', 'and', 'nearir', 'photometry', 'from', 'the', 'apass', 'and', '2mass', 'catalogs', 'we', 'identify', 'possible', 'new', 'nearby', 'dwarfs', 'young', 'stars', 'lowmetallicity', 'subdwarfs', 'and', 'white', 'dwarfs', 'comparison', 'to', 'known', 'trigonometric', 'parallaxes', 'show', 'a', 'high', 'quality', 'of', 'the', 'uratbased', 'results', 'confirming', 'the', 'error', 'in', 'parallax', 'of', 'the', 'urat', 'south', 'parallaxes', 'reported', 'here', 'to', 'be', 'between', '2', 'and', '13', 'mas', 'we', 'also', 'include', 'additional', '729', 'trigonometric', 'parallaxes', 'from', 'the', 'urat', 'north', '25', 'pc', 'sample', 'published', 'in', 'finch', 'zacharias', '2016', 'here', 'after', 'applying', 'the', 'same', 'criterion', 'as', 'for', 'the', 'southern', 'sample', 'to', 'have', 'a', 'complete', 'urat', '25', 'pc', 'sample', 'presented', 'in', 'this', 'paper']]
[-0.012688098453468957, 0.06463565005154158, -0.09031549572702806, 0.03150158089094214, -0.18602834386720182, -0.03338408651658802, 0.1519245051782712, 0.4343016443372761, -0.1309475922360193, -0.42446042453221855, 0.12152681587513495, -0.356001645933775, -0.0018872931877470147, 0.26451901177289117, -0.14255509995829663, -0.01676677613781549, 0.20520350004376545, -0.1216623818180884, -0.021191161658771808, -0.33047102126215705, 0.1657804401143768, 0.08187215300842873, 0.10495136360231355, -0.13988074250467822, 0.13145518176400234, -0.09210216333589244, -0.19948810953032664, -0.05177201320885459, -0.19464279864258674, 0.020850220359077173, 0.2572472980631855, 0.11229527831136749, 0.20394608360658611, -0.2551402371957302, -0.11284042148238552, 0.005383698768188241, 0.10570743496823047, 0.010130793165585324, 0.025765739686179966, -0.4220866077677321, 0.02886119338835574, -0.19636519361565208, -0.22645586549731497, 0.044230249658283566, 0.1017681550496973, 0.04463937469032588, -0.19430335438282884, 0.11426722291662121, -0.05960261194004538, 0.24567485774882672, -0.18680150501779924, -0.22862281907318951, -0.03901872875294982, 0.1552798224031637, -0.10405612047967495, 0.1689612486204184, 0.03402373437301477, -0.052811756998928296, -0.06527220198977224, 0.3798098323364402, -0.07633034531953256, 0.07483438675958169, 0.18154826091386336, -0.24088438838535087, -0.2035442237582737, 0.1214049545139877, 0.19198628142990626, 0.11514254808181495, -0.30060184150625496, -0.0023127913585020156, -0.006411186077256393, 0.20638898213893092, 0.14257577524227166, 0.0560122338092747, 0.23907493666143706, 0.06594812344034197, 0.04737234732794745, 0.051654723046465845, -0.3977019871837197, -0.022005345626381734, -0.2503442825268419, -0.09254092826554294, -0.09583014581295872, 0.08362791826433981, -0.10362314967348855, -0.05291960095389854, 0.33850749872254404, 0.13589866161192074, 0.10524545011280403, 0.03628849857280967, 0.27429924550265566, -0.05483887346849895, 0.14421791316742316, 0.12411100987231781, 0.3579713502970848, 0.13218683399162282, 0.1551873399818172, -0.1560821700429554, -0.026342886945140132, 0.0188037289373412]
1,802.08273
The Spectra of 2H and 3He Secondary Cosmic Ray Isotopes from ~20-85 MeV/nuc as Measured Using the B-end HET Telescope on Voyager beyond the Heliopause and a Fit to These Interstellar Spectra Using a Leaky Box Propagation Model
We have measured the intensity and spectra of the cosmic ray secondary isotopes 2H and 3He and the primary isotopes H and 4He between 20-85 MeV/nuc during a 5 year time period after Voyager 1 (V1) crossed the heliopause. The data reported here is from the B-end high energy telescope. The ratios of the intensities of the secondary to primary spectra of these nuclei at low energies are sensitive indicators for determining the amount of matter traversed at these energies by their galactic cosmic ray progenitor nuclei, after acceleration, in this case mostly 4He nuclei. The measurements of secondary 3He abundances indicate that cosmic ray 4He of energies between 30-100 MeV/nuc have traversed between 7-9 g/cm2 of interstellar matter (90% H, 10% He) in a Leaky Box propagation model. This path length is also consistent with the production of secondary 2H nuclei between 20-50 MeV/nuc, which is also produced mainly by 4He in a LBM. The Boron abundance, studied in separate papers, is also consistent with this path length at energies >30 MeV/nuc. These secondary intensities imply that the interstellar cosmic ray path length may be described in a LBM in a manner consistent with a mean path length,gamma= 20.6 beta P-0.45 at rigidities above ~0.5 GV (30 MeV/nuc for A/Z=2 nuclei). Both 2H and Boron have an excess intensity vs. the predictions for path lengths of 9 g/cm2 below 30 MeV/nuc.
physics.space-ph
we have measured the intensity and spectra of the cosmic ray secondary isotopes 2h and 3he and the primary isotopes h and 4he between 2085 mevnuc during a 5 year time period after voyager 1 v1 crossed the heliopause the data reported here is from the bend high energy telescope the ratios of the intensities of the secondary to primary spectra of these nuclei at low energies are sensitive indicators for determining the amount of matter traversed at these energies by their galactic cosmic ray progenitor nuclei after acceleration in this case mostly 4he nuclei the measurements of secondary 3he abundances indicate that cosmic ray 4he of energies between 30100 mevnuc have traversed between 79 gcm2 of interstellar matter 90 h 10 he in a leaky box propagation model this path length is also consistent with the production of secondary 2h nuclei between 2050 mevnuc which is also produced mainly by 4he in a lbm the boron abundance studied in separate papers is also consistent with this path length at energies 30 mevnuc these secondary intensities imply that the interstellar cosmic ray path length may be described in a lbm in a manner consistent with a mean path lengthgamma 206 beta p045 at rigidities above 05 gv 30 mevnuc for az2 nuclei both 2h and boron have an excess intensity vs the predictions for path lengths of 9 gcm2 below 30 mevnuc
[['we', 'have', 'measured', 'the', 'intensity', 'and', 'spectra', 'of', 'the', 'cosmic', 'ray', 'secondary', 'isotopes', '2h', 'and', '3he', 'and', 'the', 'primary', 'isotopes', 'h', 'and', '4he', 'between', '2085', 'mevnuc', 'during', 'a', '5', 'year', 'time', 'period', 'after', 'voyager', '1', 'v1', 'crossed', 'the', 'heliopause', 'the', 'data', 'reported', 'here', 'is', 'from', 'the', 'bend', 'high', 'energy', 'telescope', 'the', 'ratios', 'of', 'the', 'intensities', 'of', 'the', 'secondary', 'to', 'primary', 'spectra', 'of', 'these', 'nuclei', 'at', 'low', 'energies', 'are', 'sensitive', 'indicators', 'for', 'determining', 'the', 'amount', 'of', 'matter', 'traversed', 'at', 'these', 'energies', 'by', 'their', 'galactic', 'cosmic', 'ray', 'progenitor', 'nuclei', 'after', 'acceleration', 'in', 'this', 'case', 'mostly', '4he', 'nuclei', 'the', 'measurements', 'of', 'secondary', '3he', 'abundances', 'indicate', 'that', 'cosmic', 'ray', '4he', 'of', 'energies', 'between', '30100', 'mevnuc', 'have', 'traversed', 'between', '79', 'gcm2', 'of', 'interstellar', 'matter', '90', 'h', '10', 'he', 'in', 'a', 'leaky', 'box', 'propagation', 'model', 'this', 'path', 'length', 'is', 'also', 'consistent', 'with', 'the', 'production', 'of', 'secondary', '2h', 'nuclei', 'between', '2050', 'mevnuc', 'which', 'is', 'also', 'produced', 'mainly', 'by', '4he', 'in', 'a', 'lbm', 'the', 'boron', 'abundance', 'studied', 'in', 'separate', 'papers', 'is', 'also', 'consistent', 'with', 'this', 'path', 'length', 'at', 'energies', '30', 'mevnuc', 'these', 'secondary', 'intensities', 'imply', 'that', 'the', 'interstellar', 'cosmic', 'ray', 'path', 'length', 'may', 'be', 'described', 'in', 'a', 'lbm', 'in', 'a', 'manner', 'consistent', 'with', 'a', 'mean', 'path', 'lengthgamma', '206', 'beta', 'p045', 'at', 'rigidities', 'above', '05', 'gv', '30', 'mevnuc', 'for', 'az2', 'nuclei', 'both', '2h', 'and', 'boron', 'have', 'an', 'excess', 'intensity', 'vs', 'the', 'predictions', 'for', 'path', 'lengths', 'of', '9', 'gcm2', 'below', '30', 'mevnuc']]
[-0.039600198984637985, 0.3083475061004515, -0.015575406240355787, 0.09564741331835991, 0.06520209545662699, -0.08282139619360819, 0.041994708821024275, 0.4379997487115428, -0.2335054072757046, -0.3766656021558069, -0.06787500051213066, -0.36373453501821595, 0.04686097280239259, 0.17987057193609768, 0.03863207243374867, -0.028637617976138636, 0.061565218898134474, 0.017781461867225633, -0.038797042356779825, -0.19869679307718296, 0.2037323469787965, 0.2009125513980141, 0.21349000195605736, 0.07937520746772507, 0.03724176136647538, -0.05051376184174444, -0.030430836657473405, -0.03836894571958553, -0.1747422272985669, 0.05884741983694947, 0.24646520025391147, 0.06862743335546224, 0.13780808608043632, -0.423933421980259, -0.23021457289865652, 0.10494986991700414, 0.1544759281531976, 0.025343647066935156, -0.04836303286367294, -0.20646558706527696, 0.08354501981788125, -0.16753562456762894, -0.1426527363619086, 0.10691222283602148, 0.07442968720126719, 0.052279982012313556, -0.17264062246948772, 0.09553320888388052, -0.021916919169913236, 0.113846829938158, -0.13074027347676778, -0.1918739883493213, -0.032364111256108365, 0.040857966966348504, 0.07619248882885539, 0.06709002891103878, 0.18127238254155562, -0.06026111672898488, -0.03222364539812718, 0.3980524778543484, -0.044915582358764555, 0.01008951324905023, 0.14372093144610718, -0.21062219840234037, -0.13700579995797438, 0.27437950156274293, 0.12268084657350273, 0.09105294147603117, -0.14466206228070252, 0.026695406352563154, 0.02129695468150821, 0.1874512271115, 0.1599438389696713, 0.004990608964591122, 0.2170562712859992, 0.1580427068190395, 0.01808493643408456, 4.240087620526939e-05, -0.2307664386936145, 0.02068862375839577, -0.27981621962296677, -0.13286195624039157, -0.09997083369069995, 0.0791725436244684, -0.1110899869502634, -0.06670794426589535, 0.34218973314058987, 0.03072625498470822, 0.24250951037617216, 0.015267720009055134, 0.27481067845863955, 0.03318110635469857, 0.028750715478396728, 0.10520052848770828, 0.34401168413178035, 0.18768554072407803, 0.12251486253392484, -0.19493340977338583, 0.06159430407229569, 0.02034850363736545]
1,802.08274
NLS in the modulation space $M_{2,q}(\mathbb R)$
We show the existence of weak solutions in the extended sense of the Cauchy problem for the cubic nonlinear Schr\"odinger equation in the modulation space $M_{2,q}^{s}(\mathbb R)$, $1\leq q\leq2$ and $s\geq0.$ In addition, for either $s\geq 0$ and $1\leq q\leq\frac32$ or $\frac32<q\leq 2$ and $s>\frac23-\frac1{q}$ we show that the Cauchy problem is unconditionally wellposed in $M_{2,q}^{s}(\mathbb R).$ It is done with the use of the differentiation by parts technique which had been previously used in the periodic setting.
math.AP
we show the existence of weak solutions in the extended sense of the cauchy problem for the cubic nonlinear schrodinger equation in the modulation space m_2qsmathbb r 1leq qleq2 and sgeq0 in addition for either sgeq 0 and 1leq qleqfrac32 or frac32qleq 2 and sfrac23frac1q we show that the cauchy problem is unconditionally wellposed in m_2qsmathbb r it is done with the use of the differentiation by parts technique which had been previously used in the periodic setting
[['we', 'show', 'the', 'existence', 'of', 'weak', 'solutions', 'in', 'the', 'extended', 'sense', 'of', 'the', 'cauchy', 'problem', 'for', 'the', 'cubic', 'nonlinear', 'schrodinger', 'equation', 'in', 'the', 'modulation', 'space', 'm_2qsmathbb', 'r', '1leq', 'qleq2', 'and', 'sgeq0', 'in', 'addition', 'for', 'either', 'sgeq', '0', 'and', '1leq', 'qleqfrac32', 'or', 'frac32qleq', '2', 'and', 'sfrac23frac1q', 'we', 'show', 'that', 'the', 'cauchy', 'problem', 'is', 'unconditionally', 'wellposed', 'in', 'm_2qsmathbb', 'r', 'it', 'is', 'done', 'with', 'the', 'use', 'of', 'the', 'differentiation', 'by', 'parts', 'technique', 'which', 'had', 'been', 'previously', 'used', 'in', 'the', 'periodic', 'setting']]
[-0.1435923821393501, 0.05753894605220774, -0.03938325280575333, 0.07124720230018972, -0.03597772331823836, -0.1429168040536948, -0.053771676693891955, 0.356185927710219, -0.29219119814602107, -0.21051973396459142, 0.18103399302502088, -0.280477507480395, -0.15255901797059482, 0.17393225235424029, -0.022888035563802398, 0.09251584628017971, 0.038703654276056064, 0.032147299485734186, -0.05633287812973297, -0.27122416306991837, 0.37134813610464334, -0.0770829633834797, 0.1862671797516177, 0.014186724026158854, 0.09840454173752584, 0.031239775361845624, 0.006148989362692511, 0.006896229215026078, -0.1774961298644878, 0.07123912256399824, 0.2503956843771645, 0.08644294415009082, 0.29766931810189745, -0.38930857819630893, -0.23247650366377187, 0.15584493705348387, 0.1697641078483414, 0.04283854766037768, -0.03335916101806671, -0.2704196705961147, 0.1371437611964506, -0.11271890626616173, -0.1811764956691076, -0.048540612556845754, 0.07141426318904033, 0.03612219647982636, -0.3227476262915376, 0.11304279582927355, 0.11936209600016072, 0.018464118317776435, -0.1530904478733302, -0.09008170426445636, -0.009118499347587695, 0.05058927133339583, 0.01849479105550091, 0.046719766203062355, -0.07016072974137559, -0.07401621158115214, -0.07030405919854152, 0.3551226815309476, -0.08633217973810797, -0.265393748174648, 0.12440497969352715, -0.1583322327697297, -0.12554682275230014, 0.08822679504550793, 0.10413010390727101, 0.198110916098026, -0.07516014032896508, 0.21318644789642202, -0.04823224497581455, 0.17892941643760815, 0.11883760413557694, -0.020908732508384698, 0.07620344766591852, 0.10064036634473784, 0.12706080897132288, 0.12555485547243342, -0.05342893982054414, -0.03441207493479188, -0.3129394634601635, -0.18393266255706958, -0.17693837140560956, 0.07263749632732691, -0.07552207679730821, -0.11999318421491094, 0.31052767178138113, 0.1401885515959883, 0.12269826227094273, 0.045878638791839114, 0.19946854232458044, 0.1472890355838211, 0.020346278853311733, 0.11048724025336874, 0.19704115472268313, 0.09556002654386936, 0.14298819755581585, -0.19583852158708348, 0.011520800287709446, 0.12718353341050395]
1,802.08275
SPLATNet: Sparse Lattice Networks for Point Cloud Processing
We present a network architecture for processing point clouds that directly operates on a collection of points represented as a sparse set of samples in a high-dimensional lattice. Naively applying convolutions on this lattice scales poorly, both in terms of memory and computational cost, as the size of the lattice increases. Instead, our network uses sparse bilateral convolutional layers as building blocks. These layers maintain efficiency by using indexing structures to apply convolutions only on occupied parts of the lattice, and allow flexible specifications of the lattice structure enabling hierarchical and spatially-aware feature learning, as well as joint 2D-3D reasoning. Both point-based and image-based representations can be easily incorporated in a network with such layers and the resulting model can be trained in an end-to-end manner. We present results on 3D segmentation tasks where our approach outperforms existing state-of-the-art techniques.
cs.CV cs.GR
we present a network architecture for processing point clouds that directly operates on a collection of points represented as a sparse set of samples in a highdimensional lattice naively applying convolutions on this lattice scales poorly both in terms of memory and computational cost as the size of the lattice increases instead our network uses sparse bilateral convolutional layers as building blocks these layers maintain efficiency by using indexing structures to apply convolutions only on occupied parts of the lattice and allow flexible specifications of the lattice structure enabling hierarchical and spatiallyaware feature learning as well as joint 2d3d reasoning both pointbased and imagebased representations can be easily incorporated in a network with such layers and the resulting model can be trained in an endtoend manner we present results on 3d segmentation tasks where our approach outperforms existing stateoftheart techniques
[['we', 'present', 'a', 'network', 'architecture', 'for', 'processing', 'point', 'clouds', 'that', 'directly', 'operates', 'on', 'a', 'collection', 'of', 'points', 'represented', 'as', 'a', 'sparse', 'set', 'of', 'samples', 'in', 'a', 'highdimensional', 'lattice', 'naively', 'applying', 'convolutions', 'on', 'this', 'lattice', 'scales', 'poorly', 'both', 'in', 'terms', 'of', 'memory', 'and', 'computational', 'cost', 'as', 'the', 'size', 'of', 'the', 'lattice', 'increases', 'instead', 'our', 'network', 'uses', 'sparse', 'bilateral', 'convolutional', 'layers', 'as', 'building', 'blocks', 'these', 'layers', 'maintain', 'efficiency', 'by', 'using', 'indexing', 'structures', 'to', 'apply', 'convolutions', 'only', 'on', 'occupied', 'parts', 'of', 'the', 'lattice', 'and', 'allow', 'flexible', 'specifications', 'of', 'the', 'lattice', 'structure', 'enabling', 'hierarchical', 'and', 'spatiallyaware', 'feature', 'learning', 'as', 'well', 'as', 'joint', '2d3d', 'reasoning', 'both', 'pointbased', 'and', 'imagebased', 'representations', 'can', 'be', 'easily', 'incorporated', 'in', 'a', 'network', 'with', 'such', 'layers', 'and', 'the', 'resulting', 'model', 'can', 'be', 'trained', 'in', 'an', 'endtoend', 'manner', 'we', 'present', 'results', 'on', '3d', 'segmentation', 'tasks', 'where', 'our', 'approach', 'outperforms', 'existing', 'stateoftheart', 'techniques']]
[-0.056381090517554966, 0.02457717857417135, -0.03390918889365691, 0.013135867498515705, -0.08490561977960169, -0.12393923903603406, 0.053491856783927816, 0.4629646148798721, -0.31611723073625136, -0.2977587525533246, 0.11458314525329374, -0.22860613832848944, -0.20057679155974517, 0.1770120768691413, -0.08578397587573688, 0.09490834960181799, 0.12329106471401506, 0.00047969105819772396, -0.07817210253737618, -0.259043428941264, 0.2891077195069686, 0.048343842782612355, 0.32320894312579185, -0.015584040185370083, 0.13143308355273411, 0.01693702499448721, -0.003928251281987676, 0.03718080235661806, -0.014950476331796381, 0.20202150965508606, 0.2979211450870415, 0.1372386509120198, 0.24954187853394874, -0.48231403258230005, -0.2550076625775546, 0.024174919709496732, 0.1861985660889851, 0.09467543008338128, 0.009382083569653333, -0.30509030602905635, 0.0689227791835687, -0.17580685760892395, 0.016146581157642816, -0.1796097318259334, -0.07392987173349996, 0.010094350890306357, -0.31982517654084536, 0.043846930187594675, 0.0635535118311444, 0.047817860686752416, -0.02874393773464752, -0.13313800140583357, 0.0002385617034243686, 0.166822808132773, -0.05060409617560383, 0.05527798449287989, 0.1554293067094737, -0.1555448733636045, -0.151920967579021, 0.3874235373256462, -0.04319946622958274, -0.2314830488026408, 0.21439173371264977, -0.022609011408141148, -0.1530766272661692, 0.0844235260239137, 0.23974730240713274, 0.10995735983763422, -0.11827649919557319, 0.047981821432560016, -0.056316277158579654, 0.21250516095419048, 0.053492862578215346, 0.0318529281665438, 0.1949628712185326, 0.28845602302047024, 0.049209316195836954, 0.16985636864722306, -0.12349020307551005, -0.07300937196372875, -0.2263740963768214, -0.10819287681286889, -0.23002213667911878, -0.03728605612746573, -0.13692355412671792, -0.1844784606747063, 0.38712821888205196, 0.1758989504920984, 0.2689627392417086, 0.1317965278668063, 0.3355844262854329, 0.039214177028978676, 0.171203616540879, 0.10991064357138904, 0.12043239612415034, 0.019631672811894013, 0.09843998750937837, -0.12873213484833415, 0.06423541601481182, 0.10383362626390798]
1,802.08276
Quantum entropy and polarization measurements of the two-photon system
We consider the bipartite state of a two-photon polarization system and obtain the exact analytical expression for the von Neumann entropy in the particular case of a 5-parameter polarization density matrix. We investigate and graphically illustrate the dependence of the entropy on these five parameters, in particular, the existence of exotic, transition from exotic to non-exotic, and non-exotic states, where the quantum conditional entropy is negative, both positive and negative, and positive, respectively. We study the "cooling" or "heating" effect that follows from the reduced density of photon 2 when a measurement is performed on photon 1.
quant-ph cs.IT math.IT
we consider the bipartite state of a twophoton polarization system and obtain the exact analytical expression for the von neumann entropy in the particular case of a 5parameter polarization density matrix we investigate and graphically illustrate the dependence of the entropy on these five parameters in particular the existence of exotic transition from exotic to nonexotic and nonexotic states where the quantum conditional entropy is negative both positive and negative and positive respectively we study the cooling or heating effect that follows from the reduced density of photon 2 when a measurement is performed on photon 1
[['we', 'consider', 'the', 'bipartite', 'state', 'of', 'a', 'twophoton', 'polarization', 'system', 'and', 'obtain', 'the', 'exact', 'analytical', 'expression', 'for', 'the', 'von', 'neumann', 'entropy', 'in', 'the', 'particular', 'case', 'of', 'a', '5parameter', 'polarization', 'density', 'matrix', 'we', 'investigate', 'and', 'graphically', 'illustrate', 'the', 'dependence', 'of', 'the', 'entropy', 'on', 'these', 'five', 'parameters', 'in', 'particular', 'the', 'existence', 'of', 'exotic', 'transition', 'from', 'exotic', 'to', 'nonexotic', 'and', 'nonexotic', 'states', 'where', 'the', 'quantum', 'conditional', 'entropy', 'is', 'negative', 'both', 'positive', 'and', 'negative', 'and', 'positive', 'respectively', 'we', 'study', 'the', 'cooling', 'or', 'heating', 'effect', 'that', 'follows', 'from', 'the', 'reduced', 'density', 'of', 'photon', '2', 'when', 'a', 'measurement', 'is', 'performed', 'on', 'photon', '1']]
[-0.10656891795854594, 0.17682858508982763, -0.06655211538105205, 0.08090535652842949, 0.0054271536130342905, -0.14853743120509477, 0.042126499277241915, 0.3038202493053083, -0.20664344326660192, -0.2567447119574879, 0.07907789803743746, -0.3360092143153714, -0.09504079195363543, 0.1594559987958943, 0.022770023597500372, 0.07344291975107237, 0.019092858740195784, 0.09441094049348582, -0.09150392005037632, -0.18040491419978746, 0.38601990750529946, -0.001672479742897924, 0.2786918490760259, 0.10026193560417934, 0.10115624680519872, 0.009194271257339218, -0.007643209914340801, 0.04456978702207202, -0.1736370115838711, 0.07824591523427613, 0.1858126597920644, 0.1096825029643387, 0.2043940203129938, -0.3928108925057441, -0.18961557762255682, 0.1325686488795027, 0.0818833674582624, 0.13762587958889216, -0.06657839869869124, -0.2733420393040845, 0.04865592153810118, -0.20868304883581154, -0.09263134942529243, -0.07456161777162444, 0.04050353578935118, -0.015220747782954389, -0.2888362900997253, 0.1441505207612957, 0.046954293766529445, 0.024427816166168022, -0.08275123317149881, -0.11152708392527876, -0.05288633132430235, 0.08320189582468394, 0.005482277807722003, -0.036422194706602504, 0.12338337739545506, -0.14483355344321155, -0.12442861007737745, 0.3068422461888686, -0.10541950582200181, -0.19166212229384588, 0.1373844747755619, -0.20089281441586226, -0.10518355922984708, 0.07521133327895065, 0.15596935754046612, 0.11657097070602719, -0.0617027295275997, 0.08016581221942108, -0.02368918419383543, 0.16387487335380205, 0.05967684151105506, 0.056783690422139675, 0.17183393197729416, 0.07425061660607528, 0.05274770272050783, 0.2124599266566874, -0.07246211861481064, -0.11056148174660492, -0.34649962574704407, -0.20178965205859548, -0.2029417845775786, 0.12011389678209713, -0.08784008820072542, -0.15391136755801968, 0.4060185360674238, 0.0950392547553194, 0.20101732471669764, 0.024336770215292566, 0.27900182387129085, 0.1599724540275704, -0.0351474902414976, 0.0596210054102709, 0.2475808230948817, 0.18684914458504656, 0.05841742831368729, -0.3037051635928759, 0.05515406690729955, 0.019056046712836346]
1,802.08277
The Envelope Kinematics and a Possible Disk Around the Class 0 Protostar within BHR7
We present a characterization of the protostar embedded within the BHR7 dark cloud, based on both photometric measurements from the near-infrared to millimeter and interferometric continuum and molecular line observations at millimeter wavelengths. We find that this protostar is a Class 0 system, the youngest class of protostars, measuring its bolometric temperature to be 50.5~K, with a bolometric luminosity of 9.3~L$_{\odot}$. The near-infrared and \textit{Spitzer} imaging show a prominent dark lane from dust extinction separating clear bipolar outflow cavities. Observations of $^{13}$CO ($J=2\rightarrow1$), C$^{18}$O ($J=2\rightarrow1$), and other molecular lines with the Submillimeter Array (SMA) exhibit a clear rotation signature on scales $<$1300~AU. The rotation can be traced to an inner radius of $\sim$170~AU and the rotation curve is consistent with an R$^{-1}$ profile, implying that angular momentum is being conserved. Observations of the 1.3~mm dust continuum with the SMA reveal a resolved continuum source, extended in the direction of the dark lane, orthogonal to the outflow. The deconvolved size of the continuum indicates a radius of $\sim$100~AU for the continuum source at the assumed distance of 400~pc. The visibility amplitude profile of the continuum emission cannot be reproduced by an envelope alone and needs a compact component. Thus, we posit that the resolved continuum source could be tracing a Keplerian disk in this very young system. If we assume that the continuum radius traces a Keplerian disk (R$\sim$120~AU) the observed rotation profile is consistent with a protostar mass of 1.0~$M_{\odot}$.
astro-ph.SR astro-ph.GA
we present a characterization of the protostar embedded within the bhr7 dark cloud based on both photometric measurements from the nearinfrared to millimeter and interferometric continuum and molecular line observations at millimeter wavelengths we find that this protostar is a class 0 system the youngest class of protostars measuring its bolometric temperature to be 505k with a bolometric luminosity of 93l_odot the nearinfrared and textitspitzer imaging show a prominent dark lane from dust extinction separating clear bipolar outflow cavities observations of 13co j2rightarrow1 c18o j2rightarrow1 and other molecular lines with the submillimeter array sma exhibit a clear rotation signature on scales 1300au the rotation can be traced to an inner radius of sim170au and the rotation curve is consistent with an r1 profile implying that angular momentum is being conserved observations of the 13mm dust continuum with the sma reveal a resolved continuum source extended in the direction of the dark lane orthogonal to the outflow the deconvolved size of the continuum indicates a radius of sim100au for the continuum source at the assumed distance of 400pc the visibility amplitude profile of the continuum emission cannot be reproduced by an envelope alone and needs a compact component thus we posit that the resolved continuum source could be tracing a keplerian disk in this very young system if we assume that the continuum radius traces a keplerian disk rsim120au the observed rotation profile is consistent with a protostar mass of 10m_odot
[['we', 'present', 'a', 'characterization', 'of', 'the', 'protostar', 'embedded', 'within', 'the', 'bhr7', 'dark', 'cloud', 'based', 'on', 'both', 'photometric', 'measurements', 'from', 'the', 'nearinfrared', 'to', 'millimeter', 'and', 'interferometric', 'continuum', 'and', 'molecular', 'line', 'observations', 'at', 'millimeter', 'wavelengths', 'we', 'find', 'that', 'this', 'protostar', 'is', 'a', 'class', '0', 'system', 'the', 'youngest', 'class', 'of', 'protostars', 'measuring', 'its', 'bolometric', 'temperature', 'to', 'be', '505k', 'with', 'a', 'bolometric', 'luminosity', 'of', '93l_odot', 'the', 'nearinfrared', 'and', 'textitspitzer', 'imaging', 'show', 'a', 'prominent', 'dark', 'lane', 'from', 'dust', 'extinction', 'separating', 'clear', 'bipolar', 'outflow', 'cavities', 'observations', 'of', '13co', 'j2rightarrow1', 'c18o', 'j2rightarrow1', 'and', 'other', 'molecular', 'lines', 'with', 'the', 'submillimeter', 'array', 'sma', 'exhibit', 'a', 'clear', 'rotation', 'signature', 'on', 'scales', '1300au', 'the', 'rotation', 'can', 'be', 'traced', 'to', 'an', 'inner', 'radius', 'of', 'sim170au', 'and', 'the', 'rotation', 'curve', 'is', 'consistent', 'with', 'an', 'r1', 'profile', 'implying', 'that', 'angular', 'momentum', 'is', 'being', 'conserved', 'observations', 'of', 'the', '13mm', 'dust', 'continuum', 'with', 'the', 'sma', 'reveal', 'a', 'resolved', 'continuum', 'source', 'extended', 'in', 'the', 'direction', 'of', 'the', 'dark', 'lane', 'orthogonal', 'to', 'the', 'outflow', 'the', 'deconvolved', 'size', 'of', 'the', 'continuum', 'indicates', 'a', 'radius', 'of', 'sim100au', 'for', 'the', 'continuum', 'source', 'at', 'the', 'assumed', 'distance', 'of', '400pc', 'the', 'visibility', 'amplitude', 'profile', 'of', 'the', 'continuum', 'emission', 'can', 'not', 'be', 'reproduced', 'by', 'an', 'envelope', 'alone', 'and', 'needs', 'a', 'compact', 'component', 'thus', 'we', 'posit', 'that', 'the', 'resolved', 'continuum', 'source', 'could', 'be', 'tracing', 'a', 'keplerian', 'disk', 'in', 'this', 'very', 'young', 'system', 'if', 'we', 'assume', 'that', 'the', 'continuum', 'radius', 'traces', 'a', 'keplerian', 'disk', 'rsim120au', 'the', 'observed', 'rotation', 'profile', 'is', 'consistent', 'with', 'a', 'protostar', 'mass', 'of', '10m_odot']]
[-0.09487781549559243, 0.06324498499619086, -0.09411035874321805, 0.030840917655180003, -0.08765672737243191, -0.09507037199623251, -0.011012928462705686, 0.47791116021699825, -0.1994474483225978, -0.2648641684495102, 0.09982167324939174, -0.22521307879676095, 0.0004797410022593656, 0.14641080212520863, -0.015993214868427395, -0.02475794884243041, 0.05005751294034565, -0.13273624859067565, -0.032762258379203185, -0.11174129080026725, 0.303941896711121, 0.0770867960034254, 0.1150170920379223, 0.015689401232274407, 0.07149345954185572, -0.15935370308875849, -0.0712926229030403, 0.0007310646795273079, -0.13421214977340967, 0.0743747130036354, 0.2067808214361953, 0.11523530075930342, 0.148420030022261, -0.34475556619157544, -0.24513585597249063, 0.050783122757003814, 0.17614902038190325, 0.044310793162213036, 0.024170683543947604, -0.28724278981986817, 0.04020192089561626, -0.15805900872633713, -0.23349715884719677, 0.1060106298290351, 0.08410283078743397, 0.01224845725553647, -0.23418262104357798, 0.11119888276078786, 0.013360706527946296, 0.09292543529726711, -0.1159528491991943, -0.10066130003690625, -0.0962508732750933, 0.060183922689155504, -0.012639211891297946, 0.1163150289064368, 0.2057559090919035, -0.13631933413532768, -0.03257208438077152, 0.3795605086192678, -0.1314593178532836, -0.049631600749631556, 0.21052731850314726, -0.22970793580131257, -0.16204278725712418, 0.23891066133327807, 0.09948918186372316, 0.11060743013759917, -0.12226838215299383, -0.004059142579612622, -0.0839170006116639, 0.315849519996229, 0.05866774674051173, 0.06730925810367452, 0.39275620642544357, 0.08462034873624916, 0.05087033318655597, 0.1557108184961026, -0.2919439950156799, -0.06710883484012842, -0.27739687911945127, -0.12002411445107516, -0.18528303731591994, 0.1175695539786213, -0.13187174595484483, -0.10528755214822999, 0.2942310183514225, 0.08014782697790583, 0.2391816777625058, 0.07808472811129986, 0.33669647989080337, 0.10741042080868067, 0.12727300634793148, 0.14708214383809118, 0.3010032167618747, 0.16968073788043744, 0.1280823313458221, -0.2694083286125718, 0.035041249805066926, -0.030214958342770906]
1,802.08278
Complete intersection P-partition rings
We present an alternate proof of a result of F\'eray and Reiner characterizing posets whose $P$-partition rings are complete intersections. This shortened proof relates the complete intersection property to a simple structural property of a graph associated to $P$.
math.CO
we present an alternate proof of a result of feray and reiner characterizing posets whose ppartition rings are complete intersections this shortened proof relates the complete intersection property to a simple structural property of a graph associated to p
[['we', 'present', 'an', 'alternate', 'proof', 'of', 'a', 'result', 'of', 'feray', 'and', 'reiner', 'characterizing', 'posets', 'whose', 'ppartition', 'rings', 'are', 'complete', 'intersections', 'this', 'shortened', 'proof', 'relates', 'the', 'complete', 'intersection', 'property', 'to', 'a', 'simple', 'structural', 'property', 'of', 'a', 'graph', 'associated', 'to', 'p']]
[-0.21627764308299774, 0.04629385530185969, -0.1492578430005755, 0.0790565807509642, -0.1492104422635375, -0.10511718935166033, 0.04257305700463267, 0.307587238936088, -0.3181848365526933, -0.2196066487723818, 0.07302597159137711, -0.22194525752312097, -0.16130433274576297, 0.13944135042719352, -0.19962193957792643, -0.012768671847879887, 0.049182624842685, 0.021813905499397945, -0.054824381899566225, -0.2551758760169972, 0.31958700659183353, 0.005063093888262908, 0.1934543334855101, 0.11819054912298153, 0.07083147874054237, 0.08346334050815457, -0.07026896831125785, 0.052136301540602475, -0.239135250950662, 0.1712236075112835, 0.2457732607682164, 0.14051308115132344, 0.2059711268505989, -0.3708895460630839, -0.07323558387370446, 0.16505905554797023, 0.1084774772111231, 0.09277052943332073, -0.00490589193904247, -0.22978174256590697, 0.13912537705917388, -0.16486794219758266, -0.20809953530820516, -0.0479493071922125, 0.09875870152161671, 0.028519218500990134, -0.2529189181394684, -0.036262107284691855, 0.268095176666975, 0.17512039011583114, 0.007094599682694444, -0.08546905495518914, -0.033618360853348024, 0.04577393549231765, -0.08188695216981265, 0.013899719879890863, 0.00976082956036314, -0.03476392622822179, -0.18213237256695253, 0.32456068848020947, 0.03268559446606117, -0.11336537641592515, 0.15545643916210303, -0.08241379681306008, -0.18347390529771263, 0.1527986210794785, 0.07049806282306328, 0.1834487475645848, -0.10493491883747853, 0.07949494499898253, -0.17269375418814328, 0.057439492896008186, 0.14455296391716752, 0.05038272446164718, 0.13988208616725528, 0.11972541778754348, 0.10720538318706438, 0.21471966373232695, 0.11504763235690263, -0.0062650604149661, -0.3311821043204803, -0.20473405284186205, -0.17651395798207092, 0.12763798813550517, -0.10494123249969935, -0.24571194420926845, 0.43702476891951686, 0.03046794107947976, 0.24372913129627705, 0.14223521014150137, 0.21192759903183636, 0.019389485558256123, 0.02705184382219345, 0.007794935041322158, 0.08365975950772946, 0.2723186092976576, -0.025159068154887512, -0.11913448710663196, 0.07764005974436608, 0.24699862230903444]
1,802.08279
Implementing a Concept Network Model
The same concept can mean different things or be instantiated in different forms depending on context, suggesting a degree of flexibility within the conceptual system. We propose that a compositional network model can be used to capture and predict this flexibility. We modeled individual concepts (e.g., BANANA, BOTTLE) as graph-theoretical networks, in which properties (e.g., YELLOW, SWEET) were represented as nodes and their associations as edges. In this framework, networks capture the within-concept statistics that reflect how properties correlate with each other across instances of a concept. We ran a classification analysis using graph eigendecomposition to validate these models, and find that these models can successfully discriminate between object concepts. We then computed formal measures from these concept networks and explored their relationship to conceptual structure. We find that diversity coefficients and core-periphery structure can be interpreted as network-based measures of conceptual flexibility and stability, respectively. These results support the feasibility of a concept network framework and highlight its ability to formally capture important characteristics of the conceptual system.
q-bio.NC
the same concept can mean different things or be instantiated in different forms depending on context suggesting a degree of flexibility within the conceptual system we propose that a compositional network model can be used to capture and predict this flexibility we modeled individual concepts eg banana bottle as graphtheoretical networks in which properties eg yellow sweet were represented as nodes and their associations as edges in this framework networks capture the withinconcept statistics that reflect how properties correlate with each other across instances of a concept we ran a classification analysis using graph eigendecomposition to validate these models and find that these models can successfully discriminate between object concepts we then computed formal measures from these concept networks and explored their relationship to conceptual structure we find that diversity coefficients and coreperiphery structure can be interpreted as networkbased measures of conceptual flexibility and stability respectively these results support the feasibility of a concept network framework and highlight its ability to formally capture important characteristics of the conceptual system
[['the', 'same', 'concept', 'can', 'mean', 'different', 'things', 'or', 'be', 'instantiated', 'in', 'different', 'forms', 'depending', 'on', 'context', 'suggesting', 'a', 'degree', 'of', 'flexibility', 'within', 'the', 'conceptual', 'system', 'we', 'propose', 'that', 'a', 'compositional', 'network', 'model', 'can', 'be', 'used', 'to', 'capture', 'and', 'predict', 'this', 'flexibility', 'we', 'modeled', 'individual', 'concepts', 'eg', 'banana', 'bottle', 'as', 'graphtheoretical', 'networks', 'in', 'which', 'properties', 'eg', 'yellow', 'sweet', 'were', 'represented', 'as', 'nodes', 'and', 'their', 'associations', 'as', 'edges', 'in', 'this', 'framework', 'networks', 'capture', 'the', 'withinconcept', 'statistics', 'that', 'reflect', 'how', 'properties', 'correlate', 'with', 'each', 'other', 'across', 'instances', 'of', 'a', 'concept', 'we', 'ran', 'a', 'classification', 'analysis', 'using', 'graph', 'eigendecomposition', 'to', 'validate', 'these', 'models', 'and', 'find', 'that', 'these', 'models', 'can', 'successfully', 'discriminate', 'between', 'object', 'concepts', 'we', 'then', 'computed', 'formal', 'measures', 'from', 'these', 'concept', 'networks', 'and', 'explored', 'their', 'relationship', 'to', 'conceptual', 'structure', 'we', 'find', 'that', 'diversity', 'coefficients', 'and', 'coreperiphery', 'structure', 'can', 'be', 'interpreted', 'as', 'networkbased', 'measures', 'of', 'conceptual', 'flexibility', 'and', 'stability', 'respectively', 'these', 'results', 'support', 'the', 'feasibility', 'of', 'a', 'concept', 'network', 'framework', 'and', 'highlight', 'its', 'ability', 'to', 'formally', 'capture', 'important', 'characteristics', 'of', 'the', 'conceptual', 'system']]
[-0.0648474642723505, 0.039073735321705626, -0.09774570230261556, 0.11664872881443616, -0.09098779104117836, -0.1426235635465543, 0.05040837419662802, 0.42515435901337434, -0.3204571395735478, -0.36228958077706575, 0.0615914565160416, -0.23935056656288603, -0.2515616881580735, 0.1513708735060174, -0.09368861134446758, 0.018404691385512706, 0.061483772147247304, 0.033846057028443156, -0.05378302671791365, -0.19300434182323875, 0.3105421778579642, 0.03987827955279499, 0.302392309058459, 0.061205037932571336, 0.08687190614485492, -0.04974343109643087, -0.022113661650413025, 0.08280464061023113, -0.09597828305534979, 0.1675779447985059, 0.27611613131761087, 0.20957237694667474, 0.2825534279885081, -0.4416001089405091, -0.2567668020547855, 0.09919539007768478, 0.12858621286380054, 0.05089952823514717, 0.02363105375982178, -0.3059467266208403, 0.10685051491046102, -0.20304874418564264, -0.10362569900219872, -0.13860158013301857, -0.02147772932602536, 0.07374264121643223, -0.20630753934840737, 0.018137927768596757, 0.06548063821918775, 0.046013824812169854, -0.0529703014187925, -0.10339402724154449, -0.05494656784728812, 0.19766184199640216, -0.012146873896459251, -0.04008922521080378, 0.14509750958642967, -0.11174939200351391, -0.16713928277437975, 0.36847238964401186, -0.037882548629394955, -0.22121377249381372, 0.23512785713232698, -0.06853761863229531, -0.1546261833088162, 0.033516936284112966, 0.2432737425357724, 0.07567828334590775, -0.15704875845265287, -0.018266321543446144, -0.03444997423295198, 0.1720944586046417, 0.05824145301206348, 0.05976669439336374, 0.23906993271694296, 0.2019238730759493, -0.014443206866937024, 0.1323171783016213, -0.07388957893653285, -0.1022560822644404, -0.23183293556351037, -0.12775363564391487, -0.15774524005939297, -0.018240910335970556, -0.10260465426498351, -0.13532071108264582, 0.43743209351807655, 0.1927700728383137, 0.23122406924639585, 0.06167604098109656, 0.2690168346688595, 0.050687177650009595, 0.09854840333130033, 0.051318814717454926, 0.180481423890645, 0.09631852988137066, 0.07862282595929823, -0.14943499227714105, 0.1250189291105406, 0.030014712843001775]
1,802.0828
Probing Evolutionary Population Synthesis Models in the Near Infrared with Early Type Galaxies
We performed a near-infrared (NIR, $\sim$1.0$\mu$m-2.4$\mu$m) stellar population study in a sample of early type galaxies. The synthesis was performed using five different evolutionary population synthesis libraries of models. Our main results can be summarized as follows: low spectral resolution libraries are not able to produce reliable results when applied to the NIR alone, with each library finding a different dominant population. The two newest higher resolution models, on the other hand, perform considerably better, finding consistent results to each other and to literature values. We also found that optical results are consistent with each other even for lower resolution models. We also compared optical and NIR results, and found out that lower resolution models tend to disagree in the optical and in the NIR, with higher fraction of young populations in the NIR and dust extinction $\sim$1 magnitude higher than optical values. For higher resolution models, optical and NIR results tend do aggree much better, suggesting that a higher spectral resolution is fundamental to improve the quality of the results.
astro-ph.GA
we performed a nearinfrared nir sim10mum24mum stellar population study in a sample of early type galaxies the synthesis was performed using five different evolutionary population synthesis libraries of models our main results can be summarized as follows low spectral resolution libraries are not able to produce reliable results when applied to the nir alone with each library finding a different dominant population the two newest higher resolution models on the other hand perform considerably better finding consistent results to each other and to literature values we also found that optical results are consistent with each other even for lower resolution models we also compared optical and nir results and found out that lower resolution models tend to disagree in the optical and in the nir with higher fraction of young populations in the nir and dust extinction sim1 magnitude higher than optical values for higher resolution models optical and nir results tend do aggree much better suggesting that a higher spectral resolution is fundamental to improve the quality of the results
[['we', 'performed', 'a', 'nearinfrared', 'nir', 'sim10mum24mum', 'stellar', 'population', 'study', 'in', 'a', 'sample', 'of', 'early', 'type', 'galaxies', 'the', 'synthesis', 'was', 'performed', 'using', 'five', 'different', 'evolutionary', 'population', 'synthesis', 'libraries', 'of', 'models', 'our', 'main', 'results', 'can', 'be', 'summarized', 'as', 'follows', 'low', 'spectral', 'resolution', 'libraries', 'are', 'not', 'able', 'to', 'produce', 'reliable', 'results', 'when', 'applied', 'to', 'the', 'nir', 'alone', 'with', 'each', 'library', 'finding', 'a', 'different', 'dominant', 'population', 'the', 'two', 'newest', 'higher', 'resolution', 'models', 'on', 'the', 'other', 'hand', 'perform', 'considerably', 'better', 'finding', 'consistent', 'results', 'to', 'each', 'other', 'and', 'to', 'literature', 'values', 'we', 'also', 'found', 'that', 'optical', 'results', 'are', 'consistent', 'with', 'each', 'other', 'even', 'for', 'lower', 'resolution', 'models', 'we', 'also', 'compared', 'optical', 'and', 'nir', 'results', 'and', 'found', 'out', 'that', 'lower', 'resolution', 'models', 'tend', 'to', 'disagree', 'in', 'the', 'optical', 'and', 'in', 'the', 'nir', 'with', 'higher', 'fraction', 'of', 'young', 'populations', 'in', 'the', 'nir', 'and', 'dust', 'extinction', 'sim1', 'magnitude', 'higher', 'than', 'optical', 'values', 'for', 'higher', 'resolution', 'models', 'optical', 'and', 'nir', 'results', 'tend', 'do', 'aggree', 'much', 'better', 'suggesting', 'that', 'a', 'higher', 'spectral', 'resolution', 'is', 'fundamental', 'to', 'improve', 'the', 'quality', 'of', 'the', 'results']]
[0.038189034379974625, 0.06141003984241532, -0.08515943374110044, 0.10490552078417266, -0.08331478593358495, -0.14732248746079102, 0.03593399007005628, 0.4871014615950676, -0.1672823381218949, -0.35977228532253197, 0.10547117410591368, -0.2724977235072816, -0.06270715095427923, 0.2580397857481217, -0.08288025675126566, -0.0014638509640963362, 0.09680449301528485, -0.04658338165505839, -0.059222004133877314, -0.27677950905580845, 0.245793032286325, 0.088778189796756, 0.26715053876961126, -0.011757402036052484, 0.012653435299382407, -0.08642217122051402, -0.09466072184601303, 0.0343442853848786, -0.128568212776512, 0.14738452806655516, 0.24462391910098508, 0.0939843895977374, 0.21965309244046022, -0.38800675328799417, -0.2277850801477859, 0.09010593929553967, 0.19404249075116844, 0.10844504653018784, -0.043031467153062525, -0.19290581997523792, 0.11470449561275234, -0.14662118314506387, -0.12764040607209565, -0.004194291611486211, -0.03196811891221524, 0.04839339717594389, -0.2452634364399596, 0.07320632420710327, -0.0006603115023328707, 0.08766930848470278, -0.14993854870705606, -0.20130810830135934, -0.08318162983222782, 0.14342994757079983, -0.027624118965692245, 0.05265725914460535, 0.09651973485649074, -0.1725998765722843, -0.10286778452414909, 0.3662698019692707, -0.11539217342180683, -0.08488832630448528, 0.2848898309335311, -0.21585730340926956, -0.15292952911509478, 0.1421726148178768, 0.12848629697209454, 0.1258372859560923, -0.11697891873582032, -0.051642403905328156, 0.005119831191099279, 0.25671251782508203, 0.030074733496814436, 0.10217342904587029, 0.21155315851131398, 0.142977981837797, 0.012588755157362868, 0.08297861953432666, -0.14496712516524868, -0.04361586722947613, -0.20201738542992864, -0.07678384293620227, -0.10946478012580006, 0.04893089161874773, -0.13036061993599649, -0.07468203333696935, 0.3699679879923544, 0.19912125787989804, 0.21036413131273468, 0.10231402010475038, 0.33350561779631666, 0.10906492115739601, 0.12790755893120312, 0.048428990716974325, 0.2823609601287447, 0.08673047400823623, 0.1120781650423684, -0.2065829642353987, 0.03888372112545681, -0.00724568085871725]
1,802.08281
The Minimal Euclidean Function on the Gaussian Integers
The Minimal Euclidean Function on the Gaussian Integers
math.NT
the minimal euclidean function on the gaussian integers
[['the', 'minimal', 'euclidean', 'function', 'on', 'the', 'gaussian', 'integers']]
[-0.1331363634672016, 0.11572414170950651, -0.03909387392923236, 0.17555936006829143, -0.03801215684507042, -0.11269042920321226, 0.006010028999298811, 0.28473953559296206, -0.29895811155438423, -0.11621706932783127, -0.004659074358642101, -0.34442166378721595, -0.2028355235233903, 0.11773465108126402, -0.09341986244544387, 0.19139533978886902, -0.03743900766130537, 0.13958895998075604, -0.12835302064195275, -0.379442423582077, 0.3897412624210119, -0.04500257153995335, 0.22899029031395912, 0.025794848799705505, 0.15489503368735313, 0.16266180912498385, -0.0043634092435240746, -0.14625554345548153, -0.22973371017724276, 0.05324186844518408, 0.1361419577151537, 0.14099370659096166, 0.28804438654333353, -0.40712496265769005, -0.257058747112751, 0.3324508760124445, 0.13103616191074252, -0.0838973973877728, 0.02269716041337233, -0.2456565648317337, 0.10068373428657651, 0.025788594968616962, -0.1237853798083961, 0.05158140487037599, 0.010636863298714161, 0.006298265419900417, -0.30029820604249835, -0.0025050609256140888, 0.026056654402054846, 0.1273469142615795, -0.04810826759785414, -0.25622466020286083, 0.02176975319162011, -0.030338204465806484, -0.06192055041901767, 0.1688523176126182, 0.10687567910645157, 0.008965256158262491, -0.10851908870972693, 0.2576474267989397, -0.15149034466594458, -0.48036329075694084, 0.0883199836825952, -0.18799159000627697, -0.009139486239291728, 0.0452116709202528, 0.13362644705921412, 0.14548347890377045, -0.058380426838994026, 0.3086122563108802, -0.18061745748855174, 0.09027262171730399, 0.11289211665280163, 0.02567314635962248, 0.18786857975646853, -0.05008765961974859, 0.0987775141838938, 0.21600500494241714, -0.031744282314321026, -0.1672532195225358, -0.42571090161800385, -0.09245342668145895, -0.35656031279359013, 0.14312403975054622, -0.3348539434373379, -0.2998745609074831, 0.42939816042780876, -0.041683854535222054, 0.18978611752390862, 0.22868344094604254, 0.3543282188475132, 0.1049427444813773, 0.09293982107192278, 0.05029053706675768, 0.0030258463812060654, 0.11462481613853015, -0.09393980231834576, -0.15653142239898443, 0.019326329114846885, 0.14776058215647936]
1,802.08282
Testing dark decays of baryons in neutron stars
We demonstrate that the observation of neutron stars with masses greater than one solar mass places severe demands on any exotic neutron decay mode that could explain the discrepancy between beam and bottle measurements of the neutron lifetime. If the neutron can decay to a stable, feebly-interacting dark fermion, the maximum possible mass of a neutron star is 0.7 solar masses, while all well-measured neutron star masses exceed one solar mass. The survival of $2 M_\odot$ neutron stars therefore indicates that any explanation beyond the Standard Model for the neutron lifetime puzzle requires dark matter to be part of a multi-particle dark sector with highly constrained interactions.
hep-ph astro-ph.HE nucl-th
we demonstrate that the observation of neutron stars with masses greater than one solar mass places severe demands on any exotic neutron decay mode that could explain the discrepancy between beam and bottle measurements of the neutron lifetime if the neutron can decay to a stable feeblyinteracting dark fermion the maximum possible mass of a neutron star is 07 solar masses while all wellmeasured neutron star masses exceed one solar mass the survival of 2 m_odot neutron stars therefore indicates that any explanation beyond the standard model for the neutron lifetime puzzle requires dark matter to be part of a multiparticle dark sector with highly constrained interactions
[['we', 'demonstrate', 'that', 'the', 'observation', 'of', 'neutron', 'stars', 'with', 'masses', 'greater', 'than', 'one', 'solar', 'mass', 'places', 'severe', 'demands', 'on', 'any', 'exotic', 'neutron', 'decay', 'mode', 'that', 'could', 'explain', 'the', 'discrepancy', 'between', 'beam', 'and', 'bottle', 'measurements', 'of', 'the', 'neutron', 'lifetime', 'if', 'the', 'neutron', 'can', 'decay', 'to', 'a', 'stable', 'feeblyinteracting', 'dark', 'fermion', 'the', 'maximum', 'possible', 'mass', 'of', 'a', 'neutron', 'star', 'is', '07', 'solar', 'masses', 'while', 'all', 'wellmeasured', 'neutron', 'star', 'masses', 'exceed', 'one', 'solar', 'mass', 'the', 'survival', 'of', '2', 'm_odot', 'neutron', 'stars', 'therefore', 'indicates', 'that', 'any', 'explanation', 'beyond', 'the', 'standard', 'model', 'for', 'the', 'neutron', 'lifetime', 'puzzle', 'requires', 'dark', 'matter', 'to', 'be', 'part', 'of', 'a', 'multiparticle', 'dark', 'sector', 'with', 'highly', 'constrained', 'interactions']]
[-0.08475086248022909, 0.28101706932702997, -0.059417975339972645, 0.17941278050640458, -0.13323915367155284, -0.08900386084503722, 0.0807464370846678, 0.2787895084376324, -0.1434738117024162, -0.39259776133903357, 0.01709471804195277, -0.31542340026430365, 0.0682525456847869, 0.22742310798735763, 0.001056228166902965, 0.007053253451748839, 0.12251571102291872, 0.0841232091232361, -0.09611037049611662, -0.2025617367087178, 0.3325767169590108, 0.021814337641633343, 0.13941519280878018, 0.07707444816072173, 0.05019937214916045, -0.06225302321221328, 0.033681082574404636, -0.10038098552536641, -0.14600445653353367, 0.006136433195041598, 0.16907606948659104, 0.1484160224790685, 0.1256227309020447, -0.42643621263428116, -0.225751957618895, 0.17744219754295387, 0.17533934477800153, 0.04028973635505744, -0.11002397728438121, -0.21956732166702594, 0.09275832292755609, -0.2406703599021366, -0.18685522614011787, 0.014820832398913379, 0.022128192646393798, -0.017601253368720447, -0.2776917000883259, 0.11217465776651395, -0.01088580667296038, -0.069200343592971, -0.11730289123820598, -0.15010861279267185, -0.03358871243753523, -0.0020827025148736416, 0.1266137715742071, 0.043698225521816396, 0.20115710566048775, -0.15576001387177352, -0.06930128999058825, 0.41954814480125624, -0.07419702468534936, -0.051577899304113155, 0.14451369219723176, -0.2649958862413494, -0.14213998570932812, 0.16336462888339498, 0.12822092614435363, 0.13669362023279494, -0.17863761441219808, -0.02180028564509725, -0.04280167337471865, 0.27805765349207057, 0.08349832038412679, 0.06592796498224279, 0.41231972416687124, 0.26943739939850037, 0.023063734933769085, -0.033806490370309646, -0.20593745861299126, -0.03875392370139038, -0.23939598423762704, -0.12478274492962058, -0.11358278119285319, 0.08852605337171622, -0.1126480311821687, -0.0865509893200448, 0.3113950340534156, 0.082266619248878, 0.16801898583840086, 0.015870082912580023, 0.32743124559056014, 0.07027103392547875, 0.13132489349622772, 0.0705253940365576, 0.3678878314775538, 0.22258931598713938, 0.0696647748206127, -0.31806304943220653, 0.04404002206975524, -0.02818760509110706]
1,802.08283
Steady-state coherences by composite system-bath interactions
We identify sufficient conditions on the structure of the interaction Hamiltonian between a two-level quantum system and a thermal bath which, without any external drive or coherent measurement, guarantee the generation of steady-state coherences (SSC). The SSC this way obtained remarkably turn out to be independent on the initial state of the system, which therefore could be even taken initially incoherent. We characterize in detail this phenomenon first analytically in the weak coupling regime for two paradigmatic models, and then numerically in more complex systems without any assumption on the coupling strength. In all these cases we find that SSC become increasingly significant as the bath is cooled down. These results can be therefore directly verified in many experimental platforms.
quant-ph
we identify sufficient conditions on the structure of the interaction hamiltonian between a twolevel quantum system and a thermal bath which without any external drive or coherent measurement guarantee the generation of steadystate coherences ssc the ssc this way obtained remarkably turn out to be independent on the initial state of the system which therefore could be even taken initially incoherent we characterize in detail this phenomenon first analytically in the weak coupling regime for two paradigmatic models and then numerically in more complex systems without any assumption on the coupling strength in all these cases we find that ssc become increasingly significant as the bath is cooled down these results can be therefore directly verified in many experimental platforms
[['we', 'identify', 'sufficient', 'conditions', 'on', 'the', 'structure', 'of', 'the', 'interaction', 'hamiltonian', 'between', 'a', 'twolevel', 'quantum', 'system', 'and', 'a', 'thermal', 'bath', 'which', 'without', 'any', 'external', 'drive', 'or', 'coherent', 'measurement', 'guarantee', 'the', 'generation', 'of', 'steadystate', 'coherences', 'ssc', 'the', 'ssc', 'this', 'way', 'obtained', 'remarkably', 'turn', 'out', 'to', 'be', 'independent', 'on', 'the', 'initial', 'state', 'of', 'the', 'system', 'which', 'therefore', 'could', 'be', 'even', 'taken', 'initially', 'incoherent', 'we', 'characterize', 'in', 'detail', 'this', 'phenomenon', 'first', 'analytically', 'in', 'the', 'weak', 'coupling', 'regime', 'for', 'two', 'paradigmatic', 'models', 'and', 'then', 'numerically', 'in', 'more', 'complex', 'systems', 'without', 'any', 'assumption', 'on', 'the', 'coupling', 'strength', 'in', 'all', 'these', 'cases', 'we', 'find', 'that', 'ssc', 'become', 'increasingly', 'significant', 'as', 'the', 'bath', 'is', 'cooled', 'down', 'these', 'results', 'can', 'be', 'therefore', 'directly', 'verified', 'in', 'many', 'experimental', 'platforms']]
[-0.1312081519543426, 0.17556586116940404, -0.07505329145739476, 0.08909395555868589, 0.001780304729860897, -0.17728823591799786, 0.034389489972575876, 0.39814900072912374, -0.27673513499321417, -0.2807278514956124, 0.09735995248095909, -0.21236905137484427, -0.11122038107714616, 0.2320297969020127, 0.03255255925081049, 0.008422227254292617, 0.08809452814457472, 0.02722871838292728, -0.012273349822498858, -0.22056642578875957, 0.30856753391756986, 0.036684568364338095, 0.27237555391620843, 0.05382517531397753, 0.061787775407234825, -0.014630118935989837, 0.06300517750011446, 0.03816038108451115, -0.06374286411088785, 0.032636442012153564, 0.22968407777167765, 0.05552079129890141, 0.25368404295489505, -0.4691472118565192, -0.21506808552270135, 0.14066891601542011, 0.15770416930342132, 0.16042822707871285, -0.012047257792073652, -0.2904816665570252, 0.034680428615926455, -0.1825872409894752, -0.12190408590249717, -0.11752368903253227, -0.018656548842166863, -0.023721437481193184, -0.27857254056580133, 0.0554703790267619, 0.08395087816170417, 0.016821299873602886, -0.08602213774186869, -0.03665188618275958, -0.004491226602112874, 0.1372654747159686, -0.007210530857658644, -0.014417578765035917, 0.14390431153733516, -0.1333438907090264, -0.060707524989265946, 0.3600320877255096, -0.07015813187754247, -0.20350313078415638, 0.23192847516620532, -0.13838342126303663, -0.12986883306099722, 0.09193024600390345, 0.15484719673889533, 0.09054709436216703, -0.19745752962505017, 0.05070919212400137, -0.017201319286444534, 0.1896861641803601, 0.027287837892072276, 0.05949751451068248, 0.2192355835577473, 0.12053197183801483, 0.05299981213126254, 0.1707611169530234, -0.04148063746397383, -0.11726829247005904, -0.2860822112183087, -0.10780754368461203, -0.17796979548196154, 0.09776301652891561, -0.07964295250882666, -0.12418583158675271, 0.38384909980231896, 0.2032741493661888, 0.17681099319985757, -0.01769271872472018, 0.312661910460641, 0.14855832922233578, 0.04820060815157679, 0.06729707141639665, 0.31404828833183274, 0.10405359313978503, 0.06812961708055809, -0.2604241682410551, 0.07182143729102487, -0.0268982355366461]
1,802.08284
Dynamo induced by time-periodic force
To understand the dynamo driven by time-dependent flow, e.g. turbulence, we investigate numerically the dynamo induced by time-periodic force in rotating magnetohydrodynamic flow and focus on the effect of force frequency on the dynamo action. It is found that the dynamo action depends on the force frequency. When the force frequency is near resonance the force can drive dynamo but when it is far away from resonance dynamo fails. In the frequency range near resonance to support dynamo, the force frequency at resonance induces a weak magnetic field and magnetic energy increases as the force frequency deviates from the resonant frequency. This is opposite to the intuition that a strong flow at resonance will induce a strong field. It is because magnetic field nonlinearly couples with fluid flow in the self-sustained dynamo and changes the resonance of driving force and inertial wave.
physics.flu-dyn astro-ph.EP astro-ph.SR physics.geo-ph physics.plasm-ph
to understand the dynamo driven by timedependent flow eg turbulence we investigate numerically the dynamo induced by timeperiodic force in rotating magnetohydrodynamic flow and focus on the effect of force frequency on the dynamo action it is found that the dynamo action depends on the force frequency when the force frequency is near resonance the force can drive dynamo but when it is far away from resonance dynamo fails in the frequency range near resonance to support dynamo the force frequency at resonance induces a weak magnetic field and magnetic energy increases as the force frequency deviates from the resonant frequency this is opposite to the intuition that a strong flow at resonance will induce a strong field it is because magnetic field nonlinearly couples with fluid flow in the selfsustained dynamo and changes the resonance of driving force and inertial wave
[['to', 'understand', 'the', 'dynamo', 'driven', 'by', 'timedependent', 'flow', 'eg', 'turbulence', 'we', 'investigate', 'numerically', 'the', 'dynamo', 'induced', 'by', 'timeperiodic', 'force', 'in', 'rotating', 'magnetohydrodynamic', 'flow', 'and', 'focus', 'on', 'the', 'effect', 'of', 'force', 'frequency', 'on', 'the', 'dynamo', 'action', 'it', 'is', 'found', 'that', 'the', 'dynamo', 'action', 'depends', 'on', 'the', 'force', 'frequency', 'when', 'the', 'force', 'frequency', 'is', 'near', 'resonance', 'the', 'force', 'can', 'drive', 'dynamo', 'but', 'when', 'it', 'is', 'far', 'away', 'from', 'resonance', 'dynamo', 'fails', 'in', 'the', 'frequency', 'range', 'near', 'resonance', 'to', 'support', 'dynamo', 'the', 'force', 'frequency', 'at', 'resonance', 'induces', 'a', 'weak', 'magnetic', 'field', 'and', 'magnetic', 'energy', 'increases', 'as', 'the', 'force', 'frequency', 'deviates', 'from', 'the', 'resonant', 'frequency', 'this', 'is', 'opposite', 'to', 'the', 'intuition', 'that', 'a', 'strong', 'flow', 'at', 'resonance', 'will', 'induce', 'a', 'strong', 'field', 'it', 'is', 'because', 'magnetic', 'field', 'nonlinearly', 'couples', 'with', 'fluid', 'flow', 'in', 'the', 'selfsustained', 'dynamo', 'and', 'changes', 'the', 'resonance', 'of', 'driving', 'force', 'and', 'inertial', 'wave']]
[-0.20731754777264375, 0.24516530138847065, -0.05057675509490597, 0.06693283879381776, -0.12306230227974518, -0.06336914646622896, -0.013553943840826166, 0.34085218319800537, -0.300222327132565, -0.28007779795099313, 0.03997113474752938, -0.2074080805661498, -0.13393522372049554, 0.25939183878961586, 0.020287912132375886, -0.030336778371555493, 0.016432033627110362, 0.10648759678793206, 0.08445481768018946, -0.051050958843429535, 0.341087603954677, 0.08400426253112374, 0.3041563843062121, 0.028098827959235077, 0.07760902280381447, -0.05205369283425504, 0.07288897730095285, 0.039439221129188656, -0.13309789108963843, -0.03957299323965472, 0.14616366252827812, -0.03606817701136247, 0.28847886335996675, -0.4648551660078302, -0.24011937130085179, 0.03398033398085497, 0.13773159704096927, 0.161396687902825, -0.03455572015799346, -0.254792196223591, 0.03685312591243903, -0.09442981754259115, -0.13303243919787272, -0.08626743631181635, 0.032487922560417055, 0.03120191028000603, -0.35860963108044275, 0.11343575042711806, 0.08866347293828575, 0.14361366011779492, -0.1339178866441165, 0.007568764244534181, -0.05198142480787257, 0.09120925176031167, 0.15534284776962087, 0.13814894267698932, 0.2958532853255337, -0.17217076802462286, -0.041942186442098885, 0.36427123956529844, -0.12052893443820133, -0.17107474691772334, 0.21844900309593535, -0.25158740598446044, -0.02213121822180102, 0.1837881112235113, 0.18227485332943, 0.05576821102868949, -0.08508798922002184, 0.05452115219709477, -0.007726762617481577, 0.1523012463003397, 0.09788789415181103, -0.06235885358428661, 0.2698370077660386, 0.1806692555251623, 0.1011903028817139, 0.08657726095202313, -0.14793673359861098, -0.06875614689099012, -0.24671241586608156, -0.014942113146133406, -0.1737246449551427, 0.07427597511088324, -0.011842773534918308, -0.15294120630437327, 0.394461950654505, 0.1769303642442896, 0.11429078163395465, -0.04513208684183552, 0.35723081038294124, 0.18776376710624212, 0.10350584569321551, 0.10728972796088374, 0.4017307155988586, 0.19115470573437257, 0.16571400964855623, -0.3752782955818193, -0.024462275574324836, 0.03625673474252067]
1,802.08285
Sites That Can Produce Left-Handed Amino Acids in the Supernova Neutrino Amino Acid Processing Model
The Supernova Neutrino Amino Acid Processing model, which uses electron anti-neutrinos and the magnetic field from a source object such as a supernova to selectively destroy one amino acid chirality, is studied for possible sites that would produce meteoroids having partially left-handed amino acids. Several sites appear to provide the requisite magnetic field intensities and electron anti-neutrino fluxes. These results have obvious implications for the origin of life on Earth.
physics.bio-ph astro-ph.EP physics.chem-ph physics.space-ph
the supernova neutrino amino acid processing model which uses electron antineutrinos and the magnetic field from a source object such as a supernova to selectively destroy one amino acid chirality is studied for possible sites that would produce meteoroids having partially lefthanded amino acids several sites appear to provide the requisite magnetic field intensities and electron antineutrino fluxes these results have obvious implications for the origin of life on earth
[['the', 'supernova', 'neutrino', 'amino', 'acid', 'processing', 'model', 'which', 'uses', 'electron', 'antineutrinos', 'and', 'the', 'magnetic', 'field', 'from', 'a', 'source', 'object', 'such', 'as', 'a', 'supernova', 'to', 'selectively', 'destroy', 'one', 'amino', 'acid', 'chirality', 'is', 'studied', 'for', 'possible', 'sites', 'that', 'would', 'produce', 'meteoroids', 'having', 'partially', 'lefthanded', 'amino', 'acids', 'several', 'sites', 'appear', 'to', 'provide', 'the', 'requisite', 'magnetic', 'field', 'intensities', 'and', 'electron', 'antineutrino', 'fluxes', 'these', 'results', 'have', 'obvious', 'implications', 'for', 'the', 'origin', 'of', 'life', 'on', 'earth']]
[-0.08868817428925208, 0.23143704133773488, 0.03431067844586713, 0.16530181976766992, -0.0573299854727728, -0.1544939204385238, 0.05655874872047986, 0.44905242780223487, -0.20463717454778296, -0.31237656824357274, 0.02015751600265503, -0.30889140218496325, -0.07099808752536774, 0.15188107958529146, 0.052538526277723055, -0.07106567879673094, 0.09110133373843772, 0.040358334404299964, 0.004175030542371262, -0.2106819538000439, 0.1945174379407295, 0.11615146095199244, 0.19619359860994987, 0.10590413307904133, 0.1319744878182454, -0.088902471939634, 0.018713559599460236, -0.11151073948879327, -0.06706787576019581, 0.092752149860358, 0.2502922119892901, 0.12121567811949976, 0.11872519427644355, -0.5281396915071777, -0.25555194352886507, 0.11953306072058954, 0.15223249795713595, 0.14414978054451888, -0.12335847462361146, -0.2831357127055526, 0.06974334436069642, -0.13842196012181895, -0.1343180394997554, 0.010835920380694525, -0.02150343407411128, 0.05484090522596879, -0.24718066097370217, 0.07590872561559081, 0.008824134777699198, 0.09495710803728019, -0.12616905061794179, -0.19091803265203322, -0.05982497988401779, 0.14761932820879986, 0.18406789476617372, -0.002535781976101654, 0.2436810738573383, -0.07756164538940148, -0.08802474208974413, 0.43031336569360323, -0.005262295945015337, -0.11077592557828342, 0.2109248426875898, -0.1396131979002218, -0.13514598595044974, 0.22046015887920345, 0.09541808839089104, 0.07269806506644402, -0.1947811941749283, -0.00039690516257126414, -0.05745092968323401, 0.1927328054660133, 0.14244251461766128, 0.059246404218928156, 0.3634303664522512, 0.12521643107756972, 0.0670524528682498, 0.035035916767083106, -0.19252283266812031, 0.006997605093056336, -0.17992569146943943, -0.17509346365529513, -0.13993177072011997, 0.11530730183751854, -0.04821646293317566, -0.19476954087481968, 0.40638289605932576, 0.1274839102689709, 0.10715735212766699, -0.07472469060116314, 0.23063704620248504, -0.056319446198176595, 0.11426647308814739, -0.021805999700778296, 0.20937146686815788, 0.15883383636828513, 0.12981737703750176, -0.24340526804527535, 0.12134824333230167, 0.0931558924860188]
1,802.08286
Reliability and Market Price of Energy in the Presence of Intermittent and Non-Dispatchable Renewable Energies
The intermittent nature of the renewable energies increases the operation costs of conventional generators. As the share of energy supplied by renewable sources increases, these costs also increase. In this paper, we quantify these costs by developing a market clearing price of energy in the presence of renewable energy and congestion constraints. We consider an electricity market where generators propose their asking price per unit of energy to an independent system operator (ISO). The ISO solve an optimization problem to dispatch energy from each generator to minimize the total cost of energy purchased on behalf of the consumers. To ensure that the generators are able to meet the load within a desired confidence level, we incorporate the notion of load variance using the Conditional Value-at-Risk (CVAR) measure in an electricity market and we derive the amount of committed power and market clearing price of energy as a function of CVAR. It is shown that a higher penetration of renewable energies may increase the committed power, market clearing price of energy and consumer cost of energy due to renewable generation uncertainties. We also obtain an upper-bound on the amount that congestion constraints can affect the committed power. We present descriptive simulations to illustrate the impact of renewable energy penetration and reliability levels on committed power by the non-renewable generators, difference between the dispatched and committed power, market price of energy and profit of renewable and non-renewable generators.
cs.SY stat.AP
the intermittent nature of the renewable energies increases the operation costs of conventional generators as the share of energy supplied by renewable sources increases these costs also increase in this paper we quantify these costs by developing a market clearing price of energy in the presence of renewable energy and congestion constraints we consider an electricity market where generators propose their asking price per unit of energy to an independent system operator iso the iso solve an optimization problem to dispatch energy from each generator to minimize the total cost of energy purchased on behalf of the consumers to ensure that the generators are able to meet the load within a desired confidence level we incorporate the notion of load variance using the conditional valueatrisk cvar measure in an electricity market and we derive the amount of committed power and market clearing price of energy as a function of cvar it is shown that a higher penetration of renewable energies may increase the committed power market clearing price of energy and consumer cost of energy due to renewable generation uncertainties we also obtain an upperbound on the amount that congestion constraints can affect the committed power we present descriptive simulations to illustrate the impact of renewable energy penetration and reliability levels on committed power by the nonrenewable generators difference between the dispatched and committed power market price of energy and profit of renewable and nonrenewable generators
[['the', 'intermittent', 'nature', 'of', 'the', 'renewable', 'energies', 'increases', 'the', 'operation', 'costs', 'of', 'conventional', 'generators', 'as', 'the', 'share', 'of', 'energy', 'supplied', 'by', 'renewable', 'sources', 'increases', 'these', 'costs', 'also', 'increase', 'in', 'this', 'paper', 'we', 'quantify', 'these', 'costs', 'by', 'developing', 'a', 'market', 'clearing', 'price', 'of', 'energy', 'in', 'the', 'presence', 'of', 'renewable', 'energy', 'and', 'congestion', 'constraints', 'we', 'consider', 'an', 'electricity', 'market', 'where', 'generators', 'propose', 'their', 'asking', 'price', 'per', 'unit', 'of', 'energy', 'to', 'an', 'independent', 'system', 'operator', 'iso', 'the', 'iso', 'solve', 'an', 'optimization', 'problem', 'to', 'dispatch', 'energy', 'from', 'each', 'generator', 'to', 'minimize', 'the', 'total', 'cost', 'of', 'energy', 'purchased', 'on', 'behalf', 'of', 'the', 'consumers', 'to', 'ensure', 'that', 'the', 'generators', 'are', 'able', 'to', 'meet', 'the', 'load', 'within', 'a', 'desired', 'confidence', 'level', 'we', 'incorporate', 'the', 'notion', 'of', 'load', 'variance', 'using', 'the', 'conditional', 'valueatrisk', 'cvar', 'measure', 'in', 'an', 'electricity', 'market', 'and', 'we', 'derive', 'the', 'amount', 'of', 'committed', 'power', 'and', 'market', 'clearing', 'price', 'of', 'energy', 'as', 'a', 'function', 'of', 'cvar', 'it', 'is', 'shown', 'that', 'a', 'higher', 'penetration', 'of', 'renewable', 'energies', 'may', 'increase', 'the', 'committed', 'power', 'market', 'clearing', 'price', 'of', 'energy', 'and', 'consumer', 'cost', 'of', 'energy', 'due', 'to', 'renewable', 'generation', 'uncertainties', 'we', 'also', 'obtain', 'an', 'upperbound', 'on', 'the', 'amount', 'that', 'congestion', 'constraints', 'can', 'affect', 'the', 'committed', 'power', 'we', 'present', 'descriptive', 'simulations', 'to', 'illustrate', 'the', 'impact', 'of', 'renewable', 'energy', 'penetration', 'and', 'reliability', 'levels', 'on', 'committed', 'power', 'by', 'the', 'nonrenewable', 'generators', 'difference', 'between', 'the', 'dispatched', 'and', 'committed', 'power', 'market', 'price', 'of', 'energy', 'and', 'profit', 'of', 'renewable', 'and', 'nonrenewable', 'generators']]
[-0.1368906772493235, 0.09821908110517158, -0.019289107744629354, 0.10733565384664147, -0.05976765608549181, -0.08005318040880612, 0.16254349528531686, 0.36721017026989644, -0.3160941946799709, -0.36078152040777317, 0.08032663406604917, -0.3353026499813896, -0.007024184486955025, 0.1740215021369079, -0.18429826811386146, 0.04303230915684253, 0.023866327992005085, 0.008794325775806239, 0.05674174124171752, -0.2678738105716578, 0.27510519710199716, 0.21668252757340037, 0.3380222495376937, 0.08420552078622662, 0.13072947440747867, -0.049100285813607515, -0.02105728658389742, -0.01567464002696166, -0.10634746958579452, 0.19035636265199804, 0.282199930720785, 0.1283933234776129, 0.3914540972781636, -0.5031117768484658, -0.16443467702838924, 0.1786698419230761, -0.01150208525310302, -0.04098209295563905, -0.0020898394350759623, -0.17102319949653821, 0.029864196335083915, -0.31397406656642335, -0.09424018993543587, -0.06423165428183847, -0.030232666794336952, 0.1104857230734601, -0.3063558950897906, 0.041919118000373984, -0.021769790628025212, 0.025748153418397247, -0.09630603834363174, -0.10810468266708224, -0.14011253943662869, 0.11749802944615435, 0.11717594643192508, -0.0770374237656173, 0.17197681894359154, -0.14898819604916183, -0.14564757680488846, 0.38741652216067757, 0.016524416950957504, -0.1616675630448607, 0.054392100318721735, -0.08246408931524256, -0.10776998021889486, 0.12246929637898328, 0.2636237120003266, -0.01147463971746975, -0.1802613132956864, 0.05214648499248265, 0.045407742952485966, 0.20439978447048215, 0.049005567162273986, 0.06606253399020377, 0.18325869461533345, 0.15498759909296186, 0.19958064935004372, 0.14250016085985037, -0.05906832326791581, -0.14117861581646632, -0.28030689383099266, -0.14688063034850915, -0.19165171821743754, 0.07257906629475054, -0.10813370231742245, -0.10669091207942613, 0.3949502332972647, 0.18379397711260798, 0.0992057704318895, 0.10808532240394092, 0.35427553427674, 0.22530381283347922, 0.025999435871569204, 0.15404789232238494, 0.1566156543045447, -0.042439292824306224, 0.17292832947628162, -0.23657557186206912, 0.12078279672956126, 0.0012748931274133718]
1,802.08287
Quantum receiver for large alphabet communication
Quantum mechanics allows measurements that surpass the fundamental sensitivity limits of classical methods. To benefit from the quantum advantage in a practical setting, the receiver should use communication channels resources optimally; this can be done employing large communication alphabets. Here we show the fundamental sensitivity potential of a quantum receiver for coherent communication with frequency shift keying. We introduce an adaptive quantum protocol for this receiver, show that its sensitivity outperforms other receivers for alphabet sizes above 4 and scales favorably, whereas quantum receivers explored to date suffer from degraded sensitivity with the alphabet size. In addition, we show that the quantum measurement advantage allows the much better use of the frequency space in comparison to classical frequency keying protocols and orthogonal frequency division multiplexing.
quant-ph
quantum mechanics allows measurements that surpass the fundamental sensitivity limits of classical methods to benefit from the quantum advantage in a practical setting the receiver should use communication channels resources optimally this can be done employing large communication alphabets here we show the fundamental sensitivity potential of a quantum receiver for coherent communication with frequency shift keying we introduce an adaptive quantum protocol for this receiver show that its sensitivity outperforms other receivers for alphabet sizes above 4 and scales favorably whereas quantum receivers explored to date suffer from degraded sensitivity with the alphabet size in addition we show that the quantum measurement advantage allows the much better use of the frequency space in comparison to classical frequency keying protocols and orthogonal frequency division multiplexing
[['quantum', 'mechanics', 'allows', 'measurements', 'that', 'surpass', 'the', 'fundamental', 'sensitivity', 'limits', 'of', 'classical', 'methods', 'to', 'benefit', 'from', 'the', 'quantum', 'advantage', 'in', 'a', 'practical', 'setting', 'the', 'receiver', 'should', 'use', 'communication', 'channels', 'resources', 'optimally', 'this', 'can', 'be', 'done', 'employing', 'large', 'communication', 'alphabets', 'here', 'we', 'show', 'the', 'fundamental', 'sensitivity', 'potential', 'of', 'a', 'quantum', 'receiver', 'for', 'coherent', 'communication', 'with', 'frequency', 'shift', 'keying', 'we', 'introduce', 'an', 'adaptive', 'quantum', 'protocol', 'for', 'this', 'receiver', 'show', 'that', 'its', 'sensitivity', 'outperforms', 'other', 'receivers', 'for', 'alphabet', 'sizes', 'above', '4', 'and', 'scales', 'favorably', 'whereas', 'quantum', 'receivers', 'explored', 'to', 'date', 'suffer', 'from', 'degraded', 'sensitivity', 'with', 'the', 'alphabet', 'size', 'in', 'addition', 'we', 'show', 'that', 'the', 'quantum', 'measurement', 'advantage', 'allows', 'the', 'much', 'better', 'use', 'of', 'the', 'frequency', 'space', 'in', 'comparison', 'to', 'classical', 'frequency', 'keying', 'protocols', 'and', 'orthogonal', 'frequency', 'division', 'multiplexing']]
[-0.17725304993242025, 0.1212041501152562, -0.06616791927441955, 0.02018277476076037, -0.07309746187925338, -0.24484639615565537, 0.11891823915019631, 0.40307006280124186, -0.2928953512907028, -0.23503762386739255, 0.07697510255221278, -0.21523757588514128, -0.13961246171407402, 0.25125382679514585, -0.1354375064149499, 0.08417175683332608, 0.0660469259917736, 0.04214948986843228, -0.07267099160514771, -0.22426726563088595, 0.23883781650848687, 0.10978934731706977, 0.35516019401419907, -0.020325930401682853, 0.10650438647344708, 0.03035282148467377, 0.00038237078953534367, -0.05954943487443961, -0.11843072597117862, 0.06835846861591563, 0.35240751106664536, 0.15915529431775213, 0.24185081614553927, -0.36776257087290287, -0.2507055754289031, 0.1198178139925003, 0.15579115162813104, 0.16669849452748894, -0.023355460543185474, -0.2933885278850794, 0.05356055831257254, -0.20371152137592435, -0.04269508873298764, -0.03184169472754002, -0.06693828021362423, 0.00947719399165362, -0.27047854123264553, 0.030825404717121273, 0.0178438391238451, 0.054880919963121416, 0.012685849288478494, -0.13674692399799823, 0.11915918431989848, 0.164283237317577, -0.08938532524183393, -0.018080108222551645, 0.11804933555936441, -0.06122980585321784, -0.1932122018225491, 0.37268320624530316, -0.06606403416395187, -0.20772149331867695, 0.16511746634170413, -0.14817208111658692, -0.10495482026785612, 0.12318133438006043, 0.18140457066893578, 0.022350514709949493, -0.07965867847669869, 0.08803166847955436, 0.04834112621843815, 0.2841756837889552, 0.12530632029473782, 0.20277613651379942, 0.1333332456946373, 0.14902741786837578, 0.12374707623571157, 0.1520342821474187, -0.13953985387086867, -0.14896449778974055, -0.21292197110503913, -0.1389369325041771, -0.22686915488541126, 0.056386596634984014, -0.09301729020825587, -0.04962905135564506, 0.3360844151340425, 0.2282240500403568, 0.08783236459456384, 0.12115752010792494, 0.4138857189118862, 0.09061766222771257, 0.0992857310064137, 0.06365563882142306, 0.24792750232294203, 0.13442762620560825, 0.09504205345362425, -0.2381082279421389, 0.014830918919295073, -0.05710301364213228]
1,802.08288
Confidential Boosting with Random Linear Classifiers for Outsourced User-generated Data
User-generated data is crucial to predictive modeling in many applications. With a web/mobile/wearable interface, a data owner can continuously record data generated by distributed users and build various predictive models from the data to improve their operations, services, and revenue. Due to the large size and evolving nature of users data, data owners may rely on public cloud service providers (Cloud) for storage and computation scalability. Exposing sensitive user-generated data and advanced analytic models to Cloud raises privacy concerns. We present a confidential learning framework, SecureBoost, for data owners that want to learn predictive models from aggregated user-generated data but offload the storage and computational burden to Cloud without having to worry about protecting the sensitive data. SecureBoost allows users to submit encrypted or randomly masked data to designated Cloud directly. Our framework utilizes random linear classifiers (RLCs) as the base classifiers in the boosting framework to dramatically simplify the design of the proposed confidential boosting protocols, yet still preserve the model quality. A Cryptographic Service Provider (CSP) is used to assist the Cloud's processing, reducing the complexity of the protocol constructions. We present two constructions of SecureBoost: HE+GC and SecSh+GC, using combinations of homomorphic encryption, garbled circuits, and random masking to achieve both security and efficiency. For a boosted model, Cloud learns only the RLCs and the CSP learns only the weights of the RLCs. Finally, the data owner collects the two parts to get the complete model. We conduct extensive experiments to understand the quality of the RLC-based boosting and the cost distribution of the constructions. Our results show that SecureBoost can efficiently learn high-quality boosting models from protected user-generated data.
cs.CR cs.LG
usergenerated data is crucial to predictive modeling in many applications with a webmobilewearable interface a data owner can continuously record data generated by distributed users and build various predictive models from the data to improve their operations services and revenue due to the large size and evolving nature of users data data owners may rely on public cloud service providers cloud for storage and computation scalability exposing sensitive usergenerated data and advanced analytic models to cloud raises privacy concerns we present a confidential learning framework secureboost for data owners that want to learn predictive models from aggregated usergenerated data but offload the storage and computational burden to cloud without having to worry about protecting the sensitive data secureboost allows users to submit encrypted or randomly masked data to designated cloud directly our framework utilizes random linear classifiers rlcs as the base classifiers in the boosting framework to dramatically simplify the design of the proposed confidential boosting protocols yet still preserve the model quality a cryptographic service provider csp is used to assist the clouds processing reducing the complexity of the protocol constructions we present two constructions of secureboost hegc and secshgc using combinations of homomorphic encryption garbled circuits and random masking to achieve both security and efficiency for a boosted model cloud learns only the rlcs and the csp learns only the weights of the rlcs finally the data owner collects the two parts to get the complete model we conduct extensive experiments to understand the quality of the rlcbased boosting and the cost distribution of the constructions our results show that secureboost can efficiently learn highquality boosting models from protected usergenerated data
[['usergenerated', 'data', 'is', 'crucial', 'to', 'predictive', 'modeling', 'in', 'many', 'applications', 'with', 'a', 'webmobilewearable', 'interface', 'a', 'data', 'owner', 'can', 'continuously', 'record', 'data', 'generated', 'by', 'distributed', 'users', 'and', 'build', 'various', 'predictive', 'models', 'from', 'the', 'data', 'to', 'improve', 'their', 'operations', 'services', 'and', 'revenue', 'due', 'to', 'the', 'large', 'size', 'and', 'evolving', 'nature', 'of', 'users', 'data', 'data', 'owners', 'may', 'rely', 'on', 'public', 'cloud', 'service', 'providers', 'cloud', 'for', 'storage', 'and', 'computation', 'scalability', 'exposing', 'sensitive', 'usergenerated', 'data', 'and', 'advanced', 'analytic', 'models', 'to', 'cloud', 'raises', 'privacy', 'concerns', 'we', 'present', 'a', 'confidential', 'learning', 'framework', 'secureboost', 'for', 'data', 'owners', 'that', 'want', 'to', 'learn', 'predictive', 'models', 'from', 'aggregated', 'usergenerated', 'data', 'but', 'offload', 'the', 'storage', 'and', 'computational', 'burden', 'to', 'cloud', 'without', 'having', 'to', 'worry', 'about', 'protecting', 'the', 'sensitive', 'data', 'secureboost', 'allows', 'users', 'to', 'submit', 'encrypted', 'or', 'randomly', 'masked', 'data', 'to', 'designated', 'cloud', 'directly', 'our', 'framework', 'utilizes', 'random', 'linear', 'classifiers', 'rlcs', 'as', 'the', 'base', 'classifiers', 'in', 'the', 'boosting', 'framework', 'to', 'dramatically', 'simplify', 'the', 'design', 'of', 'the', 'proposed', 'confidential', 'boosting', 'protocols', 'yet', 'still', 'preserve', 'the', 'model', 'quality', 'a', 'cryptographic', 'service', 'provider', 'csp', 'is', 'used', 'to', 'assist', 'the', 'clouds', 'processing', 'reducing', 'the', 'complexity', 'of', 'the', 'protocol', 'constructions', 'we', 'present', 'two', 'constructions', 'of', 'secureboost', 'hegc', 'and', 'secshgc', 'using', 'combinations', 'of', 'homomorphic', 'encryption', 'garbled', 'circuits', 'and', 'random', 'masking', 'to', 'achieve', 'both', 'security', 'and', 'efficiency', 'for', 'a', 'boosted', 'model', 'cloud', 'learns', 'only', 'the', 'rlcs', 'and', 'the', 'csp', 'learns', 'only', 'the', 'weights', 'of', 'the', 'rlcs', 'finally', 'the', 'data', 'owner', 'collects', 'the', 'two', 'parts', 'to', 'get', 'the', 'complete', 'model', 'we', 'conduct', 'extensive', 'experiments', 'to', 'understand', 'the', 'quality', 'of', 'the', 'rlcbased', 'boosting', 'and', 'the', 'cost', 'distribution', 'of', 'the', 'constructions', 'our', 'results', 'show', 'that', 'secureboost', 'can', 'efficiently', 'learn', 'highquality', 'boosting', 'models', 'from', 'protected', 'usergenerated', 'data']]
[-0.10590233440254729, -0.028623084823313587, -0.07158565881585416, 0.08086714525291606, -0.1449661748146216, -0.21566808018591047, 0.14883102548869542, 0.393092765088529, -0.32139486358864544, -0.35781591934702434, 0.1072880312311701, -0.33647869117121987, -0.07003588656346109, 0.1805481656576112, -0.14470115230497937, 0.09759088698558191, 0.07777658531543553, 0.002802836255613562, -0.016870389616534073, -0.32923272346513394, 0.30314655471021884, 0.09006599957799279, 0.3723317328251926, 0.032607841457769994, 0.05713110130492747, -0.004568363275018877, -0.07679955068617353, -0.0686337354655298, -0.03820743507708442, 0.19363190147867357, 0.33140411576738477, 0.263702460356943, 0.29002154876433006, -0.45696913801327516, -0.18278237741412837, 0.09023651855497458, 0.12937959319034237, 0.09543281175511228, -0.06323853200792723, -0.32213750827908655, 0.10606270281210209, -0.2003082574542515, -0.05584498704151427, -0.1411117923915123, -0.05970898235790591, 0.011310709384508037, -0.3144352044514207, -0.026757366326464457, -0.0013433139231125218, 0.03807953086449699, -0.02604956555956642, -0.05672824550264249, -0.044013849981077234, 0.2008316692304157, 0.02230618171719315, -0.006865799053551345, 0.1816285621209527, -0.16260342949440487, -0.12315541117358607, 0.40196034857885543, -0.0029624340889999666, -0.15314863642528792, 0.16456905242356862, -0.02121862744285853, -0.15299320738010894, 0.09682953610953955, 0.2800774900259997, 0.04119495876292702, -0.1816750706284269, 0.02902430679790198, -0.015540334558786069, 0.21805059039778316, 0.03176594521074822, 0.05349122230690596, 0.1703845516511942, 0.16845217827001246, 0.046132016639427724, 0.1355268399527151, -0.060903585586025204, -0.08308290754060597, -0.17012848826315682, -0.10483814885607855, -0.1865764414168008, -0.010335548033030724, -0.11969863434286908, -0.11917746691416246, 0.3581803796162005, 0.2515342111104656, 0.1839668265921254, 0.07930399632586865, 0.4086004025424003, 0.0029270694453483897, 0.13555806033143628, 0.17259869192204122, 0.1133894572176427, 0.005062702744177865, 0.17407289108903698, -0.13428671110411033, 0.15197081995788672, -0.034098763249946075]
1,802.08289
Design of a cw, low energy, high power superconducting linac for environmental applications
The treatment of flue gases from power plants and municipal or industrial wastewater using electron beam irradiation technology has been successfully demonstrated in small-scale pilot plants. The beam energy requirement is rather modest, on the order of a few MeV, however the adoption of the technology at an industrial scale requires the availability of high beam power, of the order of 1 MW, in a cost effective way. In this article we present the design of a compact superconducting accelerator capable of delivering a cw electron beam with a current of 1 A and an energy of 1 MeV. The main components are an rf-gridded thermionic gun and a conduction cooled beta= 0.5 elliptical Nb3Sn cavity with dual coaxial power couplers. An engineering and cost analysis shows that the proposed design would result in a processing cost competitive with alternative treatment methods.
physics.acc-ph
the treatment of flue gases from power plants and municipal or industrial wastewater using electron beam irradiation technology has been successfully demonstrated in smallscale pilot plants the beam energy requirement is rather modest on the order of a few mev however the adoption of the technology at an industrial scale requires the availability of high beam power of the order of 1 mw in a cost effective way in this article we present the design of a compact superconducting accelerator capable of delivering a cw electron beam with a current of 1 a and an energy of 1 mev the main components are an rfgridded thermionic gun and a conduction cooled beta 05 elliptical nb3sn cavity with dual coaxial power couplers an engineering and cost analysis shows that the proposed design would result in a processing cost competitive with alternative treatment methods
[['the', 'treatment', 'of', 'flue', 'gases', 'from', 'power', 'plants', 'and', 'municipal', 'or', 'industrial', 'wastewater', 'using', 'electron', 'beam', 'irradiation', 'technology', 'has', 'been', 'successfully', 'demonstrated', 'in', 'smallscale', 'pilot', 'plants', 'the', 'beam', 'energy', 'requirement', 'is', 'rather', 'modest', 'on', 'the', 'order', 'of', 'a', 'few', 'mev', 'however', 'the', 'adoption', 'of', 'the', 'technology', 'at', 'an', 'industrial', 'scale', 'requires', 'the', 'availability', 'of', 'high', 'beam', 'power', 'of', 'the', 'order', 'of', '1', 'mw', 'in', 'a', 'cost', 'effective', 'way', 'in', 'this', 'article', 'we', 'present', 'the', 'design', 'of', 'a', 'compact', 'superconducting', 'accelerator', 'capable', 'of', 'delivering', 'a', 'cw', 'electron', 'beam', 'with', 'a', 'current', 'of', '1', 'a', 'and', 'an', 'energy', 'of', '1', 'mev', 'the', 'main', 'components', 'are', 'an', 'rfgridded', 'thermionic', 'gun', 'and', 'a', 'conduction', 'cooled', 'beta', '05', 'elliptical', 'nb3sn', 'cavity', 'with', 'dual', 'coaxial', 'power', 'couplers', 'an', 'engineering', 'and', 'cost', 'analysis', 'shows', 'that', 'the', 'proposed', 'design', 'would', 'result', 'in', 'a', 'processing', 'cost', 'competitive', 'with', 'alternative', 'treatment', 'methods']]
[-0.11637561570139641, 0.12889214758373177, -0.03995331168894702, -0.021370246740560053, -0.016628954122387903, -0.16087177176035095, 0.02180901287100443, 0.3898089106280542, -0.19380381422328716, -0.34750217582422793, 0.07408610869740657, -0.2718599017293371, -0.030384656135983606, 0.26193377132369006, -0.05111603310054287, 0.08609735138106642, 0.015689332021651327, -0.028357501676742065, -0.02885638300043775, -0.18549885579668884, 0.2523153607563466, 0.16313484862301472, 0.3339116384295073, 0.08625341361018678, 0.1367736301906671, -0.0534025202901598, 0.023048527709684, -0.051783042675848545, -0.07290039207171839, 0.12772196685855694, 0.27887330669744587, 0.0868071974040478, 0.32077652428642656, -0.45273007642055024, -0.21701020641080665, 0.0642148757383148, 0.10622339709232567, 0.056448088602182714, -0.12509994880636455, -0.17812193579086705, 0.04643382609603887, -0.23050844942463944, -0.1536656626275615, -0.008282330592248774, -0.03713472657803948, 0.047596583023158744, -0.2816001463760721, 0.0045383959166055005, 0.03836327503313119, 0.08804725677250548, -0.014596477411819476, -0.14161092282358742, 0.019873849776778238, 0.047446178049443566, 0.00956301968247491, 0.03864687691436063, 0.20348146099742528, -0.1548197676612606, -0.09850735331931752, 0.37838142780019035, -0.010290913330060793, -0.1043869849452947, 0.16659402505144583, -0.1378010909150665, -0.07103635941414123, 0.1732732272337039, 0.17355503705297168, 0.06008165341583972, -0.159092444061229, 0.042844732643719366, 0.04484268436241393, 0.22268270093168244, 0.09387021280696338, 0.007166913489262897, 0.2222597089510226, 0.26683378857989787, 0.10235247558682739, 0.11745844103382728, -0.11643793199918108, -0.0018532286061251418, -0.25443975462624474, -0.15669941684521788, -0.15274134975963716, 0.08473651337599157, -0.041291701518649776, -0.10247703306277857, 0.4282851713901082, 0.09585858131791894, 0.11135765505914992, -0.02008108560702638, 0.37956311228084016, 0.08784485639218267, 0.0932045683515727, 0.05683905556996135, 0.22599290793510615, 0.09883014081997123, 0.16186841903914903, -0.22838081181848566, 0.01697412490554101, -0.06227860436609662]
1,802.0829
Locally Adaptive Learning Loss for Semantic Image Segmentation
We propose a novel locally adaptive learning estimator for enhancing the inter- and intra- discriminative capabilities of Deep Neural Networks, which can be used as improved loss layer for semantic image segmentation tasks. Most loss layers compute pixel-wise cost between feature maps and ground truths, ignoring spatial layouts and interactions between neighboring pixels with same object category, and thus networks cannot be effectively sensitive to intra-class connections. Stride by stride, our method firstly conducts adaptive pooling filter operating over predicted feature maps, aiming to merge predicted distributions over a small group of neighboring pixels with same category, and then it computes cost between the merged distribution vector and their category label. Such design can make groups of neighboring predictions from same category involved into estimations on predicting correctness with respect to their category, and hence train networks to be more sensitive to regional connections between adjacent pixels based on their categories. In the experiments on Pascal VOC 2012 segmentation datasets, the consistently improved results show that our proposed approach achieves better segmentation masks against previous counterparts.
cs.CV cs.LG
we propose a novel locally adaptive learning estimator for enhancing the inter and intra discriminative capabilities of deep neural networks which can be used as improved loss layer for semantic image segmentation tasks most loss layers compute pixelwise cost between feature maps and ground truths ignoring spatial layouts and interactions between neighboring pixels with same object category and thus networks cannot be effectively sensitive to intraclass connections stride by stride our method firstly conducts adaptive pooling filter operating over predicted feature maps aiming to merge predicted distributions over a small group of neighboring pixels with same category and then it computes cost between the merged distribution vector and their category label such design can make groups of neighboring predictions from same category involved into estimations on predicting correctness with respect to their category and hence train networks to be more sensitive to regional connections between adjacent pixels based on their categories in the experiments on pascal voc 2012 segmentation datasets the consistently improved results show that our proposed approach achieves better segmentation masks against previous counterparts
[['we', 'propose', 'a', 'novel', 'locally', 'adaptive', 'learning', 'estimator', 'for', 'enhancing', 'the', 'inter', 'and', 'intra', 'discriminative', 'capabilities', 'of', 'deep', 'neural', 'networks', 'which', 'can', 'be', 'used', 'as', 'improved', 'loss', 'layer', 'for', 'semantic', 'image', 'segmentation', 'tasks', 'most', 'loss', 'layers', 'compute', 'pixelwise', 'cost', 'between', 'feature', 'maps', 'and', 'ground', 'truths', 'ignoring', 'spatial', 'layouts', 'and', 'interactions', 'between', 'neighboring', 'pixels', 'with', 'same', 'object', 'category', 'and', 'thus', 'networks', 'can', 'not', 'be', 'effectively', 'sensitive', 'to', 'intraclass', 'connections', 'stride', 'by', 'stride', 'our', 'method', 'firstly', 'conducts', 'adaptive', 'pooling', 'filter', 'operating', 'over', 'predicted', 'feature', 'maps', 'aiming', 'to', 'merge', 'predicted', 'distributions', 'over', 'a', 'small', 'group', 'of', 'neighboring', 'pixels', 'with', 'same', 'category', 'and', 'then', 'it', 'computes', 'cost', 'between', 'the', 'merged', 'distribution', 'vector', 'and', 'their', 'category', 'label', 'such', 'design', 'can', 'make', 'groups', 'of', 'neighboring', 'predictions', 'from', 'same', 'category', 'involved', 'into', 'estimations', 'on', 'predicting', 'correctness', 'with', 'respect', 'to', 'their', 'category', 'and', 'hence', 'train', 'networks', 'to', 'be', 'more', 'sensitive', 'to', 'regional', 'connections', 'between', 'adjacent', 'pixels', 'based', 'on', 'their', 'categories', 'in', 'the', 'experiments', 'on', 'pascal', 'voc', '2012', 'segmentation', 'datasets', 'the', 'consistently', 'improved', 'results', 'show', 'that', 'our', 'proposed', 'approach', 'achieves', 'better', 'segmentation', 'masks', 'against', 'previous', 'counterparts']]
[-0.0159610704575418, 0.0017025910533627884, -0.05486830339884112, 0.0860632277642361, -0.0928868417240716, -0.19056026534950835, 0.047004710135739404, 0.5248840005258045, -0.2945958444944683, -0.35880892094136557, 0.027701581911825823, -0.2730512414548525, -0.16962720013498514, 0.1446672613906153, -0.15388754792879783, 0.03426975591172659, 0.15179745613539455, 0.029856682220989535, -0.08311320813096491, -0.2855461232316822, 0.2980673057461252, 0.0795143369444196, 0.3738778332540355, 0.014940956936235603, 0.1446318236392749, -0.016586649651234013, -0.06298539295955692, 0.01471820215847196, -0.02136846364030679, 0.18635621540627237, 0.3151381838577405, 0.13172256321933037, 0.2770434206668656, -0.41791807832248973, -0.19900574294013618, 0.10321894556147146, 0.135076465353496, 0.04421737660151725, 0.01781904577081273, -0.39735705846931135, 0.10147263174370132, -0.16009444561865876, 0.07240560461732817, -0.1406379369887297, -0.006650527774443124, 0.01343117181756297, -0.29498729542539703, 0.03748921986990266, 0.042071133718489126, 0.024196761644492717, -0.07701535566741506, -0.11773348657419579, -0.06681099772390167, 0.2212074306467285, -0.02730418091881915, 0.05436572979209618, 0.15883393319439418, -0.18470435102054544, -0.11575754977352286, 0.3248967812580746, -0.05666679563526969, -0.24157259221278174, 0.22028662089263695, -0.046758016898615105, -0.09233777731457084, 0.12477885261552914, 0.20959689342390514, 0.09210226376472556, -0.1012414951656161, -0.04281700554265677, -0.01812569640766261, 0.18748062944939456, 0.09166322686393104, 0.039294683513899815, 0.1905716663071265, 0.23002477794738307, 0.08156068000901691, 0.13490273170686184, -0.18376310707575058, -0.051087934383727863, -0.21102817497863355, -0.08990613596992683, -0.16860131439779186, -0.06425439522824958, -0.1455134355304743, -0.1284119105624235, 0.3918263464061133, 0.243446313764237, 0.24706076563856863, 0.1443993055207739, 0.3268713003003412, -0.024072647109853976, 0.17095120963219573, 0.09100719594914929, 0.1727626717328436, 0.07215981162153184, 0.0650046237466178, -0.12444264595896679, 0.10036050248101859, 0.1326569639235777]
1,802.08291
Optical lattice clocks with weakly bound molecules
Optical molecular clocks promise unparalleled sensitivity to the temporal variation of the electron-to-proton mass ratio and insight into possible new physics beyond the Standard Model. We propose to realize a molecular clock with bosonic $^{174}$Yb$_2$ molecules, where the forbidden $^1$S$_0$$\rightarrow$$^3$P$_0$ clock transition would be induced magnetically. The use of a bosonic species avoids possible complications due to hyperfine structure present in fermionic species. While direct clock line photoassociation would be challenging, weakly bound ground state molecules could be produced by STIRAP and used instead. The recent scattering measurements [L. Franchi, et al. New J. Phys 19, 103037 (2017)] enable us to determine the positions of target $^1$S$_0$+$^3$P$_0$ vibrational levels and calculate the Franck-Condon factors for clock transitions between ground and excited molecular states. The resulting magnetically induced Rabi frequencies are similar to those for atoms hinting that an experimental realization is feasible. A successful observation could pave the way towards Hz-level molecular spectroscopy.
physics.atom-ph physics.atm-clus
optical molecular clocks promise unparalleled sensitivity to the temporal variation of the electrontoproton mass ratio and insight into possible new physics beyond the standard model we propose to realize a molecular clock with bosonic 174yb_2 molecules where the forbidden 1s_0rightarrow3p_0 clock transition would be induced magnetically the use of a bosonic species avoids possible complications due to hyperfine structure present in fermionic species while direct clock line photoassociation would be challenging weakly bound ground state molecules could be produced by stirap and used instead the recent scattering measurements l franchi et al new j phys 19 103037 2017 enable us to determine the positions of target 1s_03p_0 vibrational levels and calculate the franckcondon factors for clock transitions between ground and excited molecular states the resulting magnetically induced rabi frequencies are similar to those for atoms hinting that an experimental realization is feasible a successful observation could pave the way towards hzlevel molecular spectroscopy
[['optical', 'molecular', 'clocks', 'promise', 'unparalleled', 'sensitivity', 'to', 'the', 'temporal', 'variation', 'of', 'the', 'electrontoproton', 'mass', 'ratio', 'and', 'insight', 'into', 'possible', 'new', 'physics', 'beyond', 'the', 'standard', 'model', 'we', 'propose', 'to', 'realize', 'a', 'molecular', 'clock', 'with', 'bosonic', '174yb_2', 'molecules', 'where', 'the', 'forbidden', '1s_0rightarrow3p_0', 'clock', 'transition', 'would', 'be', 'induced', 'magnetically', 'the', 'use', 'of', 'a', 'bosonic', 'species', 'avoids', 'possible', 'complications', 'due', 'to', 'hyperfine', 'structure', 'present', 'in', 'fermionic', 'species', 'while', 'direct', 'clock', 'line', 'photoassociation', 'would', 'be', 'challenging', 'weakly', 'bound', 'ground', 'state', 'molecules', 'could', 'be', 'produced', 'by', 'stirap', 'and', 'used', 'instead', 'the', 'recent', 'scattering', 'measurements', 'l', 'franchi', 'et', 'al', 'new', 'j', 'phys', '19', '103037', '2017', 'enable', 'us', 'to', 'determine', 'the', 'positions', 'of', 'target', '1s_03p_0', 'vibrational', 'levels', 'and', 'calculate', 'the', 'franckcondon', 'factors', 'for', 'clock', 'transitions', 'between', 'ground', 'and', 'excited', 'molecular', 'states', 'the', 'resulting', 'magnetically', 'induced', 'rabi', 'frequencies', 'are', 'similar', 'to', 'those', 'for', 'atoms', 'hinting', 'that', 'an', 'experimental', 'realization', 'is', 'feasible', 'a', 'successful', 'observation', 'could', 'pave', 'the', 'way', 'towards', 'hzlevel', 'molecular', 'spectroscopy']]
[-0.09871752305721111, 0.22992131381693823, -0.0037664411904055946, 0.005013090079582438, -0.05573834559651992, -0.16113553740799624, 0.13398721760959173, 0.3906500121109829, -0.219069979184412, -0.31524559344775627, -0.023386940351588687, -0.22325362997832676, -0.06446807318681616, 0.1578890363491504, 0.011804046871451201, 0.030592597046533956, 0.048721599267697, -0.048506466477541935, -0.013566740263493991, -0.13886710862468754, 0.21285580475552512, 0.10983429072094797, 0.2622672847053113, 0.06843648603284694, 0.04689120271533037, -0.050680251028965034, 0.03207538226798226, -0.08020648695158446, -0.14740088653145705, 0.13298698239736198, 0.2669228424521669, 0.07139470017999287, 0.18685288933438823, -0.44529383455631355, -0.19575520532070012, 0.1226309720035149, 0.14263082274531835, 0.213003735890649, -0.006431011625701278, -0.36059344464925347, -0.05384339913664176, -0.1509851487291767, -0.16604956988837347, -0.14990590758381153, 0.04429025760241198, -0.006879030418850555, -0.27192430664432105, 0.08407046475959633, 0.0011237390737962101, 0.053472016904108376, -0.05817120920038714, -0.12990144174546003, 0.006691440805948543, 0.09282116411216804, -0.06890034154543209, 0.049944859590159346, 0.18337719234027314, -0.08710979591879303, -0.15170490951277316, 0.4168761536318636, -0.10660722841268146, -0.07182485504779003, 0.23577850744967035, -0.1350594732574255, -0.1492754326969854, 0.17409766147018021, 0.10234346544826466, 0.08686971924705617, -0.13324006476064848, 0.03573598723322005, 0.0029469189702052106, 0.2060921663566437, 0.10675161407137944, 0.12004584151502107, 0.26339947585238527, 0.12874990200010183, 0.03528412987188195, 0.10777486171897205, -0.14250606034160745, -0.10708376673776471, -0.20375970984802932, -0.15005373714618161, -0.1577337018795472, 0.07825648812006616, 0.01749311567462259, -0.07527603342857779, 0.34219776618214237, 0.14563663243331534, 0.21139255186715564, -0.05658307057860869, 0.2759685987292092, 0.09965330833763451, 0.03615925285602081, 0.0041812171231313845, 0.2890127940744852, 0.1753803322227388, 0.041208464302282956, -0.2984678557401659, 0.036259824038091554, 0.03033803201077]
1,802.08292
Titanium-hydrogen interaction at megabar pressure
The process of transport of metal particles ($\mathit{ejecta}$) in gases is the subject of recent works in the field of nuclear energetics. We studied the process of dissolution of titanium ejecta in warm dense hydrogen at megabar pressure. Thermodynamic and kinetic properties of the process were investigated using classical and quantum molecular dynamics methods. We estimated the dissolution time of ejecta, the saturation limit of titanium atoms with hydrogen and the heat of dissolution. It was found that particles with a radius of 1 $\mu m$ dissolve in hydrogen in time of $1.5 \cdot 10^{-2} \ \mu s$, while the process of mixing can be described by diffusion law. The presented approach demonstrates the final state of the titanium-hydrogen system as a homogenized fluid with completely dissolved titanium particles. This result can be generalized to all external conditions under which titanium and hydrogen are atomic fluids.
cond-mat.mtrl-sci
the process of transport of metal particles mathitejecta in gases is the subject of recent works in the field of nuclear energetics we studied the process of dissolution of titanium ejecta in warm dense hydrogen at megabar pressure thermodynamic and kinetic properties of the process were investigated using classical and quantum molecular dynamics methods we estimated the dissolution time of ejecta the saturation limit of titanium atoms with hydrogen and the heat of dissolution it was found that particles with a radius of 1 mu m dissolve in hydrogen in time of 15 cdot 102 mu s while the process of mixing can be described by diffusion law the presented approach demonstrates the final state of the titaniumhydrogen system as a homogenized fluid with completely dissolved titanium particles this result can be generalized to all external conditions under which titanium and hydrogen are atomic fluids
[['the', 'process', 'of', 'transport', 'of', 'metal', 'particles', 'mathitejecta', 'in', 'gases', 'is', 'the', 'subject', 'of', 'recent', 'works', 'in', 'the', 'field', 'of', 'nuclear', 'energetics', 'we', 'studied', 'the', 'process', 'of', 'dissolution', 'of', 'titanium', 'ejecta', 'in', 'warm', 'dense', 'hydrogen', 'at', 'megabar', 'pressure', 'thermodynamic', 'and', 'kinetic', 'properties', 'of', 'the', 'process', 'were', 'investigated', 'using', 'classical', 'and', 'quantum', 'molecular', 'dynamics', 'methods', 'we', 'estimated', 'the', 'dissolution', 'time', 'of', 'ejecta', 'the', 'saturation', 'limit', 'of', 'titanium', 'atoms', 'with', 'hydrogen', 'and', 'the', 'heat', 'of', 'dissolution', 'it', 'was', 'found', 'that', 'particles', 'with', 'a', 'radius', 'of', '1', 'mu', 'm', 'dissolve', 'in', 'hydrogen', 'in', 'time', 'of', '15', 'cdot', '102', 'mu', 's', 'while', 'the', 'process', 'of', 'mixing', 'can', 'be', 'described', 'by', 'diffusion', 'law', 'the', 'presented', 'approach', 'demonstrates', 'the', 'final', 'state', 'of', 'the', 'titaniumhydrogen', 'system', 'as', 'a', 'homogenized', 'fluid', 'with', 'completely', 'dissolved', 'titanium', 'particles', 'this', 'result', 'can', 'be', 'generalized', 'to', 'all', 'external', 'conditions', 'under', 'which', 'titanium', 'and', 'hydrogen', 'are', 'atomic', 'fluids']]
[-0.06637716637207912, 0.21805755205296137, -0.03960417306630293, -0.016816235886358777, 0.07726360064071532, -0.0930305595763705, 0.06598754950238953, 0.36570860380371967, -0.25039573125150444, -0.3031757503383226, 0.04190726630663226, -0.27778618374409586, -0.0462211270692882, 0.12432930855100023, 0.02897643131835686, 0.052332517954722775, 0.03161715887245963, -0.02827551278572243, -0.04770821246800462, -0.2505317795744908, 0.2755384658059509, 0.08548082235607911, 0.2194043914233888, 0.07197225325817398, 0.07476932980393718, -0.08471889761146288, 0.016251244489429193, -8.285335440944125e-05, -0.17010277932880397, 0.045467299917204815, 0.17952899032246347, 0.03414152861878901, 0.2067984919062933, -0.4840793756937439, -0.26180243020603705, 0.062213171664234644, 0.12032804624796227, 0.08056478178978513, -0.05477410207105266, -0.24762209329324272, 0.027229991865220602, -0.15829184125470636, -0.1619013820569702, -0.010691479231081122, 0.05191258595478102, 0.066121021031249, -0.2577053978453045, 0.13618832594109373, 0.07256399824648731, 0.024420371415888095, -0.1022837922901853, -0.13584355286312766, -0.06414316225653657, 0.04938446387153614, 0.032311908113509674, 0.0020629658080455098, 0.2623222528474887, -0.11699666182992498, 0.00630881093520593, 0.445030141726032, -0.11372388603973325, -0.11348940796785421, 0.22801174501517227, -0.17583850288268674, -0.09518689980691337, 0.19618595675141973, 0.11775955543169504, 0.12411206992371765, -0.20006709478769477, 0.07606781924871436, -0.016646319501251765, 0.15270357397287251, 0.09339727600385155, 0.015173406973546306, 0.19073161699034116, 0.2219486090621644, -0.012754271640540002, 0.12400931226565028, -0.09856840754513974, -0.06906198022457269, -0.2384990949730773, -0.22556264726510206, -0.1714227025965359, 0.09060774225630908, -0.08010889462747292, -0.14869008247473545, 0.29167315278892647, 0.09225399845069718, 0.16295403642136233, -0.05959281114897189, 0.24180840742220724, 0.09205483947961976, 0.0043840682088443035, 0.06077471538609662, 0.25079221663983553, 0.21130840907889334, 0.14429267742866456, -0.25482543513107186, 0.09944557960037716, 0.04522552786043266]
1,802.08293
Temperature- and field-driven spin reorientations in triple-layer ruthenate Sr$_4$Ru$_3$O$_{10}$
Sr$_4$Ru$_3$O$_{10}$, the $n$ = 3 member of the Ruddlesden-Popper type ruthenate Sr$_{n+1}$Ru$_n$O$_{3n+1}$, is known to exhibit a peculiar metamagnetic transition in an in-plane magnetic field. However, the nature of both the temperature- and field-dependent phase transitions remains as a topic of debate. Here, we have investigated the magnetic transitions of Sr$_4$Ru$_3$O$_{10}$ via single-crystal neutron diffraction measurements. At zero field, we find that the system undergoes a ferromagnetic transition with both in-plane and out-of-plane magnetic components at $T_{c}$ ~ 100 K. Below $T^{*}$ ~ 50 K, the magnetic moments incline continuously toward the out-of-plane direction. At $T$ ~ 1.5 K, where the spins are nearly aligned along the $c$ axis, a spin reorientation occurs above a critical field $B_c$, giving rise to a spin component perpendicular to the plane defined by the field direction and the $c$ axis. We suggest that both the temperature- and field-driven spin reorientations are associated with a change in the magnetocrystalline anisotropy, which is strongly coupled to the lattice degrees of freedom. This study elucidates the long-standing puzzles on the zero-field magnetic orders of Sr$_4$Ru$_3$O$_{10}$ and provides new insights into the nature of the field-induced metamagnetic transition.
cond-mat.str-el
sr_4ru_3o_10 the n 3 member of the ruddlesdenpopper type ruthenate sr_n1ru_no_3n1 is known to exhibit a peculiar metamagnetic transition in an inplane magnetic field however the nature of both the temperature and fielddependent phase transitions remains as a topic of debate here we have investigated the magnetic transitions of sr_4ru_3o_10 via singlecrystal neutron diffraction measurements at zero field we find that the system undergoes a ferromagnetic transition with both inplane and outofplane magnetic components at t_c 100 k below t 50 k the magnetic moments incline continuously toward the outofplane direction at t 15 k where the spins are nearly aligned along the c axis a spin reorientation occurs above a critical field b_c giving rise to a spin component perpendicular to the plane defined by the field direction and the c axis we suggest that both the temperature and fielddriven spin reorientations are associated with a change in the magnetocrystalline anisotropy which is strongly coupled to the lattice degrees of freedom this study elucidates the longstanding puzzles on the zerofield magnetic orders of sr_4ru_3o_10 and provides new insights into the nature of the fieldinduced metamagnetic transition
[['sr_4ru_3o_10', 'the', 'n', '3', 'member', 'of', 'the', 'ruddlesdenpopper', 'type', 'ruthenate', 'sr_n1ru_no_3n1', 'is', 'known', 'to', 'exhibit', 'a', 'peculiar', 'metamagnetic', 'transition', 'in', 'an', 'inplane', 'magnetic', 'field', 'however', 'the', 'nature', 'of', 'both', 'the', 'temperature', 'and', 'fielddependent', 'phase', 'transitions', 'remains', 'as', 'a', 'topic', 'of', 'debate', 'here', 'we', 'have', 'investigated', 'the', 'magnetic', 'transitions', 'of', 'sr_4ru_3o_10', 'via', 'singlecrystal', 'neutron', 'diffraction', 'measurements', 'at', 'zero', 'field', 'we', 'find', 'that', 'the', 'system', 'undergoes', 'a', 'ferromagnetic', 'transition', 'with', 'both', 'inplane', 'and', 'outofplane', 'magnetic', 'components', 'at', 't_c', '100', 'k', 'below', 't', '50', 'k', 'the', 'magnetic', 'moments', 'incline', 'continuously', 'toward', 'the', 'outofplane', 'direction', 'at', 't', '15', 'k', 'where', 'the', 'spins', 'are', 'nearly', 'aligned', 'along', 'the', 'c', 'axis', 'a', 'spin', 'reorientation', 'occurs', 'above', 'a', 'critical', 'field', 'b_c', 'giving', 'rise', 'to', 'a', 'spin', 'component', 'perpendicular', 'to', 'the', 'plane', 'defined', 'by', 'the', 'field', 'direction', 'and', 'the', 'c', 'axis', 'we', 'suggest', 'that', 'both', 'the', 'temperature', 'and', 'fielddriven', 'spin', 'reorientations', 'are', 'associated', 'with', 'a', 'change', 'in', 'the', 'magnetocrystalline', 'anisotropy', 'which', 'is', 'strongly', 'coupled', 'to', 'the', 'lattice', 'degrees', 'of', 'freedom', 'this', 'study', 'elucidates', 'the', 'longstanding', 'puzzles', 'on', 'the', 'zerofield', 'magnetic', 'orders', 'of', 'sr_4ru_3o_10', 'and', 'provides', 'new', 'insights', 'into', 'the', 'nature', 'of', 'the', 'fieldinduced', 'metamagnetic', 'transition']]
[-0.238594326531134, 0.27083182125297556, -0.009358403582115888, -0.046793155057320714, -0.08185176845509759, -0.10990406269387852, 0.07345921634752754, 0.39951267977175053, -0.28728558888886707, -0.3024916562041448, 0.02003976176317621, -0.30551215913647445, -0.05795599193367306, 0.15975189027163672, 0.11782841198146343, -0.06179157193619958, -0.0739391380370224, 0.04359364116649514, -0.11733744808307459, -0.17655145086570873, 0.2562061128536238, -0.02028066843437652, 0.2950770106036416, 0.07958719543662042, 0.06831148829466353, -0.010872733445946216, 0.14818415300850507, 0.039122188759226635, -0.16252275023858817, -0.0013467488918072915, 0.21586137759669494, -0.0647401847270748, 0.17513071640985467, -0.36703775009460826, -0.16304938272342726, 0.018322502711652627, 0.14062133540214108, 0.11772367457160726, -0.049749707976501356, -0.2510969634668561, 0.052762770947376865, -0.05601070599689308, -0.16388382930158368, -0.09741175817375783, 0.014171360568794351, -0.028048360707133166, -0.2535853915777738, 0.11817094599778052, 0.1320283483483538, 0.15539912141418905, -0.09041674631167083, -0.14265155013568037, -0.06293457939529852, 0.04018243653599613, 0.11009120865805094, 0.17449535347986966, 0.16530509723941245, -0.11301222403054326, -0.13486202254200413, 0.34542231785974675, -0.05052632578368228, -0.036018361169744724, 0.13603537741382557, -0.23074944053372237, -0.10561393194591566, 0.21448795147170063, 0.1308999252806027, 0.11213167682189935, -0.10496496592688384, 0.07290630667659415, 0.02021710617562896, 0.16559370002278717, 0.03031986551634687, 0.007794742590136906, 0.30917927005418366, 0.1538269202918395, 0.03154057596639764, 0.16574046942555615, -0.14968839684352328, -0.0787492479292816, -0.23111988044023435, -0.16205238090247237, -0.16607705257289732, 0.08210717047995297, -0.0875104724335508, -0.1753637067578052, 0.39223963677162127, 0.14970200105948295, 0.2203186853896446, -0.054175069384772574, 0.22429677492298025, 0.0729262174385029, 0.05900560779451963, 0.07208114405355406, 0.25493942484039295, 0.2622057252666182, 0.15701104708451538, -0.30873521647330937, 0.06716630212719782, -0.0331753546507248]
1,802.08294
Unicorn: Continual Learning with a Universal, Off-policy Agent
Some real-world domains are best characterized as a single task, but for others this perspective is limiting. Instead, some tasks continually grow in complexity, in tandem with the agent's competence. In continual learning, also referred to as lifelong learning, there are no explicit task boundaries or curricula. As learning agents have become more powerful, continual learning remains one of the frontiers that has resisted quick progress. To test continual learning capabilities we consider a challenging 3D domain with an implicit sequence of tasks and sparse rewards. We propose a novel agent architecture called Unicorn, which demonstrates strong continual learning and outperforms several baseline agents on the proposed domain. The agent achieves this by jointly representing and learning multiple policies efficiently, using a parallel off-policy learning setup.
cs.LG
some realworld domains are best characterized as a single task but for others this perspective is limiting instead some tasks continually grow in complexity in tandem with the agents competence in continual learning also referred to as lifelong learning there are no explicit task boundaries or curricula as learning agents have become more powerful continual learning remains one of the frontiers that has resisted quick progress to test continual learning capabilities we consider a challenging 3d domain with an implicit sequence of tasks and sparse rewards we propose a novel agent architecture called unicorn which demonstrates strong continual learning and outperforms several baseline agents on the proposed domain the agent achieves this by jointly representing and learning multiple policies efficiently using a parallel offpolicy learning setup
[['some', 'realworld', 'domains', 'are', 'best', 'characterized', 'as', 'a', 'single', 'task', 'but', 'for', 'others', 'this', 'perspective', 'is', 'limiting', 'instead', 'some', 'tasks', 'continually', 'grow', 'in', 'complexity', 'in', 'tandem', 'with', 'the', 'agents', 'competence', 'in', 'continual', 'learning', 'also', 'referred', 'to', 'as', 'lifelong', 'learning', 'there', 'are', 'no', 'explicit', 'task', 'boundaries', 'or', 'curricula', 'as', 'learning', 'agents', 'have', 'become', 'more', 'powerful', 'continual', 'learning', 'remains', 'one', 'of', 'the', 'frontiers', 'that', 'has', 'resisted', 'quick', 'progress', 'to', 'test', 'continual', 'learning', 'capabilities', 'we', 'consider', 'a', 'challenging', '3d', 'domain', 'with', 'an', 'implicit', 'sequence', 'of', 'tasks', 'and', 'sparse', 'rewards', 'we', 'propose', 'a', 'novel', 'agent', 'architecture', 'called', 'unicorn', 'which', 'demonstrates', 'strong', 'continual', 'learning', 'and', 'outperforms', 'several', 'baseline', 'agents', 'on', 'the', 'proposed', 'domain', 'the', 'agent', 'achieves', 'this', 'by', 'jointly', 'representing', 'and', 'learning', 'multiple', 'policies', 'efficiently', 'using', 'a', 'parallel', 'offpolicy', 'learning', 'setup']]
[-0.069338489396845, 0.03495747976049888, -0.05519494028495891, 0.05667570191490952, -0.18208742634733283, -0.2161636740885793, 0.04916843718993256, 0.4990259494543785, -0.27565232754522373, -0.3025136450009923, 0.07556300328227707, -0.21125206779614683, -0.19793221758981605, 0.20151685027679103, -0.1853617073835007, 0.0867229751976473, 0.12132370755046842, 0.05855612122705058, -0.016750600534520807, -0.290783475611418, 0.3008597793634094, 0.02559195882603822, 0.31504264255867354, -0.01937768242824527, 0.17946198848556608, -0.014813707749699317, 0.012561516410353342, 0.006963101948337954, -0.039705755445278816, 0.16819974875432395, 0.39018090093500973, 0.24631248724587734, 0.45969660356936476, -0.4257700654515435, -0.2272373433021592, 0.11396937267411322, 0.16052989999482792, 0.10624576324046338, -0.08060704073131857, -0.31380185093878515, 0.043052601319412506, -0.18506923347752216, 0.014438895460602546, -0.16633846194645951, -0.01904228504281491, -0.01962393498240364, -0.2816334735114305, -0.010118481306043188, 0.10397562220330453, 0.08083989663374802, -0.05156562440208204, -0.11286824558758074, 0.09442121086324314, 0.18837377740373273, 0.06738336876289741, 0.08196816487341291, 0.1589232719252034, -0.2130831288384451, -0.21332529502447753, 0.3350054406900964, -0.016367161061636926, -0.19170590042920102, 0.2672302442610205, -0.0018965282970817671, -0.1718762360904957, 0.08526278795704009, 0.2377128536546869, 0.13572191860940722, -0.16651825067986334, 0.03929618596781178, -0.046300296952563616, 0.15613026319751663, 0.040446506813168526, -0.03963154671244353, 0.1822239745496994, 0.2902316269261526, 0.1024723162852405, 0.1204234922659539, -0.04707736481491122, -0.14917430039384358, -0.1778552819764988, -0.11931224590322624, -0.18438177953644228, -0.025455157191211743, -0.08516054209804491, -0.15445833044156196, 0.3322306160319833, 0.17684064619243145, 0.21650027431961563, 0.123644345017272, 0.3448787677205271, 0.025239043116074292, 0.08359577111338103, 0.16408855409919476, 0.17682042488013394, -0.026339402098933026, 0.17752202352673363, -0.18146197282383958, 0.13285460260452792, 0.01192583709249332]
1,802.08295
Large magnetoresistance by Pauli blockade in hydrogenated graphene
We report the observation of a giant positive magnetoresistance in millimetre scale hydrogenated graphene with magnetic field oriented in the plane of the graphene sheet. A positive magnetoresistance in excess of 200\% at a temperature of 300 mK was observed in this configuration, reverting to negative magnetoresistance with the magnetic field oriented normal to the graphene plane. We attribute the observed positive, in-plane, magnetoresistance to Pauli-blockade of hopping conduction induced by spin polarization. Our work shows that spin polarization in concert with electron-electron interaction can play a dominant role in magnetotransport within an atomic monolayer.
cond-mat.mes-hall
we report the observation of a giant positive magnetoresistance in millimetre scale hydrogenated graphene with magnetic field oriented in the plane of the graphene sheet a positive magnetoresistance in excess of 200 at a temperature of 300 mk was observed in this configuration reverting to negative magnetoresistance with the magnetic field oriented normal to the graphene plane we attribute the observed positive inplane magnetoresistance to pauliblockade of hopping conduction induced by spin polarization our work shows that spin polarization in concert with electronelectron interaction can play a dominant role in magnetotransport within an atomic monolayer
[['we', 'report', 'the', 'observation', 'of', 'a', 'giant', 'positive', 'magnetoresistance', 'in', 'millimetre', 'scale', 'hydrogenated', 'graphene', 'with', 'magnetic', 'field', 'oriented', 'in', 'the', 'plane', 'of', 'the', 'graphene', 'sheet', 'a', 'positive', 'magnetoresistance', 'in', 'excess', 'of', '200', 'at', 'a', 'temperature', 'of', '300', 'mk', 'was', 'observed', 'in', 'this', 'configuration', 'reverting', 'to', 'negative', 'magnetoresistance', 'with', 'the', 'magnetic', 'field', 'oriented', 'normal', 'to', 'the', 'graphene', 'plane', 'we', 'attribute', 'the', 'observed', 'positive', 'inplane', 'magnetoresistance', 'to', 'pauliblockade', 'of', 'hopping', 'conduction', 'induced', 'by', 'spin', 'polarization', 'our', 'work', 'shows', 'that', 'spin', 'polarization', 'in', 'concert', 'with', 'electronelectron', 'interaction', 'can', 'play', 'a', 'dominant', 'role', 'in', 'magnetotransport', 'within', 'an', 'atomic', 'monolayer']]
[-0.23642688934156236, 0.20613504975598845, -0.0034021499165472514, -0.0390596922469682, -0.058928594508386674, -0.1006278456609815, 0.03594432245355417, 0.4489055541443064, -0.2475186210878669, -0.31871140036890483, -0.07681612430407883, -0.3084807146063193, -0.13656694500984506, 0.18460274533556892, 0.06860167599293067, -0.05548661831330429, -0.029075406997048473, -0.05376176438987889, -0.035253719032860974, -0.21640313599640107, 0.2798403329401713, 0.045233719179684176, 0.27635371540375847, 0.11234169769437706, 0.046891174120630354, -0.008418262059344574, 0.12120064458948501, 0.0933491190835992, -0.1185277803794653, 0.03745879971996901, 0.25589442868442075, -0.19313549913312408, 0.19122270466957955, -0.43163221742601154, -0.1576917697774603, -0.005416809383066411, 0.12185214016527096, 0.1471441760560141, -0.0897304017884419, -0.25008239226534645, 0.05662531633564132, -0.09068834929766649, -0.138342912838933, -0.013255283835918662, 0.006274089685324183, -0.06653727688133082, -0.23852860063631484, 0.13056101385959762, 0.07972311803159561, 0.14992024664311332, -0.10838650540508171, -0.15435136906663946, -0.0904194040129833, 0.023378997942076086, 0.07303783646289339, 0.10882650672562143, 0.205096741202919, -0.08062834594091599, -0.1578681413480576, 0.30767490317490187, -0.15644954085508558, -0.056584412410379724, 0.11000382809087317, -0.3008307848730065, -0.05430650313761323, 0.18203281995622403, 0.158093788968201, 0.08717517576061506, -0.13754582001847473, 0.0676807916049469, -0.02332174946910682, 0.1390181547080345, 0.07963886156807, 0.027907872459841297, 0.3274827630437435, 0.1992684463125733, 0.062322279641484006, 0.1587835533793352, -0.1979788041059324, 0.01726949583501258, -0.1910352847202027, -0.17877398300829264, -0.2156443877809463, 0.17637077941184, -0.07707681308842283, -0.23932509697934098, 0.4036327272237457, 0.17078222618735533, 0.21562096417108748, -0.05539081470069892, 0.24968158318958383, 0.09232994074502246, 0.11246470666114003, 0.04244796848023667, 0.27870070477551284, 0.22345420688717685, 0.19470133539289236, -0.2930716974858908, 0.08894322085828382, -0.07748974013412273]
1,802.08296
Future DUNE constraints on EFT
In the near future, fundamental interactions at high-energy scales may be most efficiently studied via precision measurements at low energies. A universal language to assemble and interpret precision measurements is the so-called SMEFT, which is an effective field theory (EFT) where the Standard Model (SM) Lagrangian is extended by higher-dimensional operators. In this paper we investigate the possible impact of the DUNE neutrino experiment on constraining the SMEFT. The unprecedented neutrino flux offers an opportunity to greatly improve the current limits via precision measurements of the trident production and neutrino scattering off electrons and nuclei in the DUNE near detector. We quantify the DUNE sensitivity to dimension-6 operators in the SMEFT Lagrangian, and find that in some cases operators suppressed by an O(30) TeV scale can be probed. We also compare the DUNE reach to that of future experiments involving atomic parity violation and polarization asymmetry in electron scattering, which are sensitive to an overlapping set of SMEFT parameters.
hep-ph
in the near future fundamental interactions at highenergy scales may be most efficiently studied via precision measurements at low energies a universal language to assemble and interpret precision measurements is the socalled smeft which is an effective field theory eft where the standard model sm lagrangian is extended by higherdimensional operators in this paper we investigate the possible impact of the dune neutrino experiment on constraining the smeft the unprecedented neutrino flux offers an opportunity to greatly improve the current limits via precision measurements of the trident production and neutrino scattering off electrons and nuclei in the dune near detector we quantify the dune sensitivity to dimension6 operators in the smeft lagrangian and find that in some cases operators suppressed by an o30 tev scale can be probed we also compare the dune reach to that of future experiments involving atomic parity violation and polarization asymmetry in electron scattering which are sensitive to an overlapping set of smeft parameters
[['in', 'the', 'near', 'future', 'fundamental', 'interactions', 'at', 'highenergy', 'scales', 'may', 'be', 'most', 'efficiently', 'studied', 'via', 'precision', 'measurements', 'at', 'low', 'energies', 'a', 'universal', 'language', 'to', 'assemble', 'and', 'interpret', 'precision', 'measurements', 'is', 'the', 'socalled', 'smeft', 'which', 'is', 'an', 'effective', 'field', 'theory', 'eft', 'where', 'the', 'standard', 'model', 'sm', 'lagrangian', 'is', 'extended', 'by', 'higherdimensional', 'operators', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'possible', 'impact', 'of', 'the', 'dune', 'neutrino', 'experiment', 'on', 'constraining', 'the', 'smeft', 'the', 'unprecedented', 'neutrino', 'flux', 'offers', 'an', 'opportunity', 'to', 'greatly', 'improve', 'the', 'current', 'limits', 'via', 'precision', 'measurements', 'of', 'the', 'trident', 'production', 'and', 'neutrino', 'scattering', 'off', 'electrons', 'and', 'nuclei', 'in', 'the', 'dune', 'near', 'detector', 'we', 'quantify', 'the', 'dune', 'sensitivity', 'to', 'dimension6', 'operators', 'in', 'the', 'smeft', 'lagrangian', 'and', 'find', 'that', 'in', 'some', 'cases', 'operators', 'suppressed', 'by', 'an', 'o30', 'tev', 'scale', 'can', 'be', 'probed', 'we', 'also', 'compare', 'the', 'dune', 'reach', 'to', 'that', 'of', 'future', 'experiments', 'involving', 'atomic', 'parity', 'violation', 'and', 'polarization', 'asymmetry', 'in', 'electron', 'scattering', 'which', 'are', 'sensitive', 'to', 'an', 'overlapping', 'set', 'of', 'smeft', 'parameters']]
[-0.07021386026838244, 0.23126831220546387, -0.04265811694705414, 0.14767747913170956, -0.05596671486273408, -0.10835432932044398, 0.016193656578115275, 0.2985463259220358, -0.2645098855169841, -0.31424015052265153, 0.03920794033691428, -0.31347391730373575, -0.04260629849543549, 0.18322078165533784, 0.03632306146476441, 0.04290725342393414, 0.03762118292843583, 0.008383277677725884, -0.07994597767364034, -0.2306211274702969, 0.26709668319408764, 0.18711269360310953, 0.22350695498475115, 0.13575334289351348, 0.06134014612842796, 0.0033581187895868185, -0.054561233430231025, -0.021875605831258516, -0.11964176951641431, 0.08524764599219996, 0.2817696324731194, 0.08872550318702915, 0.11735567772678984, -0.44384709838192044, -0.1522871570444941, 0.12974570925587658, 0.182576088958168, 0.1078341884110943, -0.030293827733675123, -0.3081239821248741, 0.037402960725872535, -0.17160511238547335, -0.16358237618978763, -0.10715000266092098, -0.0599494193520971, -0.05076548734785251, -0.3153869690975385, 0.03116372840533197, -0.057388662840913304, 0.04392993281033101, -0.00011794296028853962, -0.10912560428486867, -0.0007634445199004884, 0.04225623851595153, 0.0733715792914337, 0.03890996331600882, 0.16730884428475779, -0.17302237661649128, -0.12372286102014049, 0.36973610867119433, -0.128383430220339, -0.1668185557798137, 0.15672721096121198, -0.21454596549928565, -0.12717370147318593, 0.10268926622679914, 0.22287952929951907, 0.07437007839691902, -0.17719610660108473, 0.16623599899170552, -0.021727821966867497, 0.16311474007249768, 0.061612851889921154, 0.06602179014223551, 0.2506439640016863, 0.22263736605758444, 0.09437185703885138, -0.008037616898534152, -0.12888863177109017, -0.027622517611635203, -0.3526021661559038, -0.08880695125378035, -0.07030595786014349, 0.024227772382492165, -0.07046778958959654, -0.05681315314833005, 0.39411405036401637, 0.2099921601515486, 0.2158017973093398, -0.006735197231817826, 0.2876550700104028, 0.09052386317036405, 0.10221464418419549, -0.00029489658948666646, 0.3461905135430832, 0.11072296899327505, 0.1033843590591671, -0.2714475231309591, 0.010433000826522848, 0.038953437944347004]
1,802.08297
On the quotient set of the distance set
Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{\Delta(E)}{\Delta(E)}=\left\{ \frac{a}{b}: a \in \Delta(E), b \in \Delta(E) \backslash \{0\} \right\},$$ where $$ \Delta(E)=\{||x-y||: x,y \in E\}, \ ||x||=x_1^2+x_2^2+\cdots+x_d^2.$$ If the dimension $d$ is odd and $E\subset \mathbb F_q^d$ with $|E|\ge 6q^{\frac{d}{2}},$ then $$ \{0\}\cup\mathbb F_q^+ \subset \frac{\Delta(E)}{\Delta(E)},$$ where $\mathbb F_q^+$ denotes the set of nonzero quadratic residues in $\mathbb F_q.$ Both results are, in general, best possible, including the conclusion about the nonzero quadratic residues in odd dimensions.
math.CA math.CO math.NT
let bbb f_q be a finite field of order q we prove that if dge 2 is even and e subset bbb f_qd with e ge 9qfracd2 then bbb f_qfracdeltaedeltaeleft fracab a in deltae b in deltae backslash 0 right where deltaexy xy in e xx_12x_22cdotsx_d2 if the dimension d is odd and esubset mathbb f_qd with ege 6qfracd2 then 0cupmathbb f_q subset fracdeltaedeltae where mathbb f_q denotes the set of nonzero quadratic residues in mathbb f_q both results are in general best possible including the conclusion about the nonzero quadratic residues in odd dimensions
[['let', 'bbb', 'f_q', 'be', 'a', 'finite', 'field', 'of', 'order', 'q', 'we', 'prove', 'that', 'if', 'dge', '2', 'is', 'even', 'and', 'e', 'subset', 'bbb', 'f_qd', 'with', 'e', 'ge', '9qfracd2', 'then', 'bbb', 'f_qfracdeltaedeltaeleft', 'fracab', 'a', 'in', 'deltae', 'b', 'in', 'deltae', 'backslash', '0', 'right', 'where', 'deltaexy', 'xy', 'in', 'e', 'xx_12x_22cdotsx_d2', 'if', 'the', 'dimension', 'd', 'is', 'odd', 'and', 'esubset', 'mathbb', 'f_qd', 'with', 'ege', '6qfracd2', 'then', '0cupmathbb', 'f_q', 'subset', 'fracdeltaedeltae', 'where', 'mathbb', 'f_q', 'denotes', 'the', 'set', 'of', 'nonzero', 'quadratic', 'residues', 'in', 'mathbb', 'f_q', 'both', 'results', 'are', 'in', 'general', 'best', 'possible', 'including', 'the', 'conclusion', 'about', 'the', 'nonzero', 'quadratic', 'residues', 'in', 'odd', 'dimensions']]
[-0.24935365185400554, 0.16409058282361105, 0.04081239830702543, -0.05692171474154829, 0.0179773888032716, -0.2178154434443692, -0.0642764361580478, 0.3086699962699681, -0.2859625571062056, -0.11829737934357162, 0.006168876400510414, -0.36183797819225977, -0.07597398356105504, 0.14648772555853376, -0.06649990225985145, -0.03144904295129053, -0.047898339607302894, 0.16334115861381374, -0.04404315907113108, -0.3515342586592698, 0.2709363261708634, -0.16327859781515064, 0.12792568792997117, 0.06832633622702253, 0.05526824634040842, 0.03607726882321739, 0.08203168561828605, -0.02134076614989742, -0.2317037749437915, -0.003154141901667868, 0.2991685638978575, 0.0979326114560781, 0.24747972958459613, -0.36202070398486397, -0.1563935571172264, 0.34229574938503543, 0.21803843462839723, -0.12870447535402654, 0.01978175294732026, -0.21070617037626466, 0.24170472501282347, -0.10665001948311757, -0.1462366762152465, -0.011092561747083503, 0.23792574357560553, 0.013850199393509479, -0.43389834379881953, 0.0033613725910695753, 0.12640741127909402, 0.16947581057091443, -0.035328261117356714, -0.24016115899077417, -0.06451552439470555, 0.0024056386168564807, -0.04576163427653105, 0.2787982735238718, -0.0047200563837240415, -0.014913622216645921, -0.06746165477409122, 0.4024308702196884, -0.09758006348575497, -0.2782071402500478, 0.018309928246595886, -0.3168791284931175, -0.10006020099364138, 0.1166490247274299, 0.13829083049021076, 0.16233521576949886, 0.058184117354777, 0.38199555300296484, -0.1292183587796531, 0.1185050696301996, 0.09914922998339105, -0.04300641820810505, 0.08906789379340879, -0.01678051874355486, 0.05893555626513834, 0.0712697699448889, -0.024524438707681184, 0.0607263979526875, -0.4351573843990317, -0.12721461285784674, -0.1849517651278986, 0.22575081720587856, -0.16090010022816478, -0.07570250981142011, 0.2831612566271483, 0.05522044152387658, 0.18027501849436692, 0.09325202478205764, 0.18022076047308158, 0.02773022936023327, 8.715536730531393e-05, 0.1351936452961893, 0.004418352043277092, 0.15096952193782906, -0.10768864235809344, -0.16101569730495469, -0.0427434531542776, 0.15118207428813651]
1,802.08298
Conflict and Convention in Dynamic Networks
An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioral strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models.
cs.SI cs.GT physics.soc-ph
an important way to resolve games of conflict snowdrift hawkdove chicken involves adopting a convention a correlated equilibrium that avoids any conflict between aggressive strategies dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy exploring how behavioral strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions here we model the emergence of conventions as correlated equilibria in dynamic networks our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way rather than the correlated equilibrium associated with ownership norms play aggressive at home not away we usually see the opposite hostguest norm play aggressive away not at home evolve on dynamic networks a phenomenon common to human interaction we also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models
[['an', 'important', 'way', 'to', 'resolve', 'games', 'of', 'conflict', 'snowdrift', 'hawkdove', 'chicken', 'involves', 'adopting', 'a', 'convention', 'a', 'correlated', 'equilibrium', 'that', 'avoids', 'any', 'conflict', 'between', 'aggressive', 'strategies', 'dynamic', 'networks', 'allow', 'individuals', 'to', 'resolve', 'conflict', 'via', 'their', 'network', 'connections', 'rather', 'than', 'changing', 'their', 'strategy', 'exploring', 'how', 'behavioral', 'strategies', 'coevolve', 'with', 'social', 'networks', 'reveals', 'new', 'dynamics', 'that', 'can', 'help', 'explain', 'the', 'origins', 'and', 'robustness', 'of', 'conventions', 'here', 'we', 'model', 'the', 'emergence', 'of', 'conventions', 'as', 'correlated', 'equilibria', 'in', 'dynamic', 'networks', 'our', 'results', 'show', 'that', 'networks', 'have', 'the', 'tendency', 'to', 'break', 'the', 'symmetry', 'between', 'the', 'two', 'conventional', 'solutions', 'in', 'a', 'strongly', 'biased', 'way', 'rather', 'than', 'the', 'correlated', 'equilibrium', 'associated', 'with', 'ownership', 'norms', 'play', 'aggressive', 'at', 'home', 'not', 'away', 'we', 'usually', 'see', 'the', 'opposite', 'hostguest', 'norm', 'play', 'aggressive', 'away', 'not', 'at', 'home', 'evolve', 'on', 'dynamic', 'networks', 'a', 'phenomenon', 'common', 'to', 'human', 'interaction', 'we', 'also', 'show', 'that', 'learning', 'to', 'avoid', 'conflict', 'can', 'produce', 'realistic', 'network', 'structures', 'in', 'a', 'way', 'different', 'than', 'preferential', 'attachment', 'models']]
[-0.11291244897083977, 0.1078614286045008, -0.12097009930790265, 0.15330885748307294, -0.11282959348187806, -0.21997947578664678, 0.09783783359960534, 0.45047960478143817, -0.2919511554094079, -0.32163154423380125, 0.026181056879860803, -0.2557822228767551, -0.22827359925334653, 0.09051560565011385, -0.09868984026177667, -0.061901786791471146, 0.06002748820584458, -0.009848955930628551, -0.010294315524590321, -0.18436667065207774, 0.33898075269415784, 0.06171796106355032, 0.31901729290481085, 0.008149048841798318, 0.0505761020228816, -0.03421395641262046, -0.02186605927701562, 0.07139074814786465, -0.08390531493056094, 0.10872043599076091, 0.2658202034175795, 0.12737065195762673, 0.3654975978633723, -0.5094865649843063, -0.2236872331555694, 0.16505523732540986, 0.16874156488129535, 0.12021018540224013, -0.015443891843554014, -0.2750597299578098, 0.054420686700047016, -0.17952205802505025, -0.145977303055518, -0.07968794351491408, -0.030273216209398247, 0.022493016371766154, -0.23742673284589097, 0.06872680812058463, 0.04224581296185557, 0.056175457361416936, -0.03299166686468734, -0.08717432676945837, -0.051608561526219815, 0.1938120486566988, 0.02447137258385714, -0.010335460049995722, 0.1642882821712798, -0.15341043310950342, -0.20439041861428472, 0.36928963925068575, 0.008859836990524901, -0.18358626078770612, 0.24355011119340092, -0.07305749743868663, -0.1563263057778852, 0.0884132844945177, 0.1707414279703815, 0.07928009013919972, -0.13796947374402618, -0.043834430027159095, -0.021553209600731347, 0.1699127629220199, 0.06609296332447766, 0.04217723418230143, 0.22034954349510372, 0.1704341589431398, 0.13136362351435357, 0.058826352671111144, 0.0059562498611809974, -0.19977217971049518, -0.19058386044493184, -0.060238487425988585, -0.09752518641284834, 0.043436774939786676, -0.10255178525282342, -0.12691208099470083, 0.339302412317827, 0.20096504049471173, 0.17911589770422628, 0.07361969103415807, 0.2654344121812103, 0.00889501950587146, 0.10548554679217677, 0.0514052328444683, 0.224742032506933, 0.023053205261627834, 0.16945458466011004, -0.22475705023643036, 0.17206323277861932, -0.01273763159630247]
1,802.08299
Experimental study of the magnetic field distribution and shape of domains near the surface of type-I superconductors in the intermediate state
The importance of accounting for the inhomogeneity of the magnetic field distribution and roundness of domain walls near the surface of type-I superconductors in the intermediate state for forming the equilibrium flux structure was predicted by Landau eight decades ago. Further studies confirmed this prediction and extended it to all equilibrium properties of this state. Here we report on direct depth-resolved measurements of the field distribution and shape of domains near the surface of high-purity type-I (indium) films in a perpendicular field using Low-Energy Muon Spin Rotation spectroscopy. We find that at low applied fields (in about half of the field range of the intermediate state) the field distribution and domains' shape agrees with that proposed by Tinkham. However, for high fields our data suggest that reality differs from theoretical expectations. In particular, the width of the superconducting laminae can expand near the surface leading to formation of a maximum in the static magnetic field in the current-free space outside the sample. A possible interpretation of these experimental results is discussed.
cond-mat.supr-con
the importance of accounting for the inhomogeneity of the magnetic field distribution and roundness of domain walls near the surface of typei superconductors in the intermediate state for forming the equilibrium flux structure was predicted by landau eight decades ago further studies confirmed this prediction and extended it to all equilibrium properties of this state here we report on direct depthresolved measurements of the field distribution and shape of domains near the surface of highpurity typei indium films in a perpendicular field using lowenergy muon spin rotation spectroscopy we find that at low applied fields in about half of the field range of the intermediate state the field distribution and domains shape agrees with that proposed by tinkham however for high fields our data suggest that reality differs from theoretical expectations in particular the width of the superconducting laminae can expand near the surface leading to formation of a maximum in the static magnetic field in the currentfree space outside the sample a possible interpretation of these experimental results is discussed
[['the', 'importance', 'of', 'accounting', 'for', 'the', 'inhomogeneity', 'of', 'the', 'magnetic', 'field', 'distribution', 'and', 'roundness', 'of', 'domain', 'walls', 'near', 'the', 'surface', 'of', 'typei', 'superconductors', 'in', 'the', 'intermediate', 'state', 'for', 'forming', 'the', 'equilibrium', 'flux', 'structure', 'was', 'predicted', 'by', 'landau', 'eight', 'decades', 'ago', 'further', 'studies', 'confirmed', 'this', 'prediction', 'and', 'extended', 'it', 'to', 'all', 'equilibrium', 'properties', 'of', 'this', 'state', 'here', 'we', 'report', 'on', 'direct', 'depthresolved', 'measurements', 'of', 'the', 'field', 'distribution', 'and', 'shape', 'of', 'domains', 'near', 'the', 'surface', 'of', 'highpurity', 'typei', 'indium', 'films', 'in', 'a', 'perpendicular', 'field', 'using', 'lowenergy', 'muon', 'spin', 'rotation', 'spectroscopy', 'we', 'find', 'that', 'at', 'low', 'applied', 'fields', 'in', 'about', 'half', 'of', 'the', 'field', 'range', 'of', 'the', 'intermediate', 'state', 'the', 'field', 'distribution', 'and', 'domains', 'shape', 'agrees', 'with', 'that', 'proposed', 'by', 'tinkham', 'however', 'for', 'high', 'fields', 'our', 'data', 'suggest', 'that', 'reality', 'differs', 'from', 'theoretical', 'expectations', 'in', 'particular', 'the', 'width', 'of', 'the', 'superconducting', 'laminae', 'can', 'expand', 'near', 'the', 'surface', 'leading', 'to', 'formation', 'of', 'a', 'maximum', 'in', 'the', 'static', 'magnetic', 'field', 'in', 'the', 'currentfree', 'space', 'outside', 'the', 'sample', 'a', 'possible', 'interpretation', 'of', 'these', 'experimental', 'results', 'is', 'discussed']]
[-0.1241926404168252, 0.1555838160984741, -0.06794113725048016, 0.04169432570468852, -0.033192051932684076, -0.04929024864489224, 0.0653983780362627, 0.38372704521780127, -0.21963333521495787, -0.3268265641452363, 0.07422647535003046, -0.25132279239093874, -0.06849451869323153, 0.20246777012508516, 0.02101172680819505, 0.01583836470834083, 0.0010531005934316512, 0.014678575059028658, -0.09993281773576099, -0.19749145178064398, 0.3427365091956106, 0.04123625305974148, 0.3300180943078247, 0.05187903475275056, 0.04843548865653901, 0.0042166202737573995, 0.03767172121361159, 0.05175940259696769, -0.1540470436910744, 0.08782386535244902, 0.1960730361439048, 0.02817685028799532, 0.1976112680419822, -0.4357734243410598, -0.23752478399036223, 0.029623789219893733, 0.141455435830615, 0.11644837658917695, -0.08616562867782225, -0.26590890553371427, 0.07872953491213279, -0.11171330782524937, -0.17239880843131603, -0.0358922093921499, 0.011492294522154837, 0.007720887505079004, -0.22618825154614564, 0.10306584980333365, 0.04023032658869586, 0.08371091723354937, -0.13099478004358664, -0.1368624720755115, -0.053851325793344285, 0.08737942076162898, 0.07175872695689466, 0.06825630063713904, 0.15027245962502142, -0.18444903235479493, -0.11287640773947215, 0.31986309473037894, -0.07746591977598517, -0.09742519779305099, 0.1656867468794971, -0.23985496682403554, -0.07683042151178097, 0.1734823342262936, 0.13662029368862816, 0.11422278434113049, -0.12063865087775252, 0.0830247979326928, -0.031490412574773384, 0.15156963325755082, 0.03700043126526806, 0.016085782649311407, 0.25879135107545304, 0.17712471723605536, 0.020744475830150277, 0.12680156908150522, -0.1626710761134235, -0.08469582420170622, -0.2910853594089504, -0.16886118776233028, -0.19030014751274793, 0.02956133989116166, -0.0596681741511855, -0.17130906311849578, 0.40396788296676434, 0.16012966404914072, 0.18568692312232757, -0.032094860972281085, 0.24133693621349547, 0.07264908390086994, 0.07489618232571765, 0.04924050806504157, 0.307607412027816, 0.18263585757251763, 0.10734649046394996, -0.252380504772579, 0.053247912861788045, -0.03666649655905642]
1,802.083
Dimensionality and integrals of motion of the Trappist-1 planetary system
The number of isolating integrals of motion of the Trappist-1 system - a late M-dwarf orbited by seven Earth-sized planets - was determined numerically, using an adapted version of the correlation dimension method. It was found that over the investigated time-scales of up to 20 000 years the number of isolating integrals of motion is the same as one would find for a system of seven non-interacting planets - despite the fact that the planets in the Trappist-1 system are strongly interacting. Considering perturbed versions of the Trappist-1 system shows that the system may occupy an atypical part of phase-space with high stability. These findings are consistent with earlier studies.
astro-ph.EP nlin.CD
the number of isolating integrals of motion of the trappist1 system a late mdwarf orbited by seven earthsized planets was determined numerically using an adapted version of the correlation dimension method it was found that over the investigated timescales of up to 20 000 years the number of isolating integrals of motion is the same as one would find for a system of seven noninteracting planets despite the fact that the planets in the trappist1 system are strongly interacting considering perturbed versions of the trappist1 system shows that the system may occupy an atypical part of phasespace with high stability these findings are consistent with earlier studies
[['the', 'number', 'of', 'isolating', 'integrals', 'of', 'motion', 'of', 'the', 'trappist1', 'system', 'a', 'late', 'mdwarf', 'orbited', 'by', 'seven', 'earthsized', 'planets', 'was', 'determined', 'numerically', 'using', 'an', 'adapted', 'version', 'of', 'the', 'correlation', 'dimension', 'method', 'it', 'was', 'found', 'that', 'over', 'the', 'investigated', 'timescales', 'of', 'up', 'to', '20', '000', 'years', 'the', 'number', 'of', 'isolating', 'integrals', 'of', 'motion', 'is', 'the', 'same', 'as', 'one', 'would', 'find', 'for', 'a', 'system', 'of', 'seven', 'noninteracting', 'planets', 'despite', 'the', 'fact', 'that', 'the', 'planets', 'in', 'the', 'trappist1', 'system', 'are', 'strongly', 'interacting', 'considering', 'perturbed', 'versions', 'of', 'the', 'trappist1', 'system', 'shows', 'that', 'the', 'system', 'may', 'occupy', 'an', 'atypical', 'part', 'of', 'phasespace', 'with', 'high', 'stability', 'these', 'findings', 'are', 'consistent', 'with', 'earlier', 'studies']]
[-0.19612500211659156, 0.1418589126673923, -0.06778762690183297, 0.018651274934837543, -0.018341502031119904, -0.07871352190099587, 0.01632020160312129, 0.2997188636484756, -0.16915076816994173, -0.3587122534828208, 0.10160833966557076, -0.3033850063682995, -0.12694653890870303, 0.25524405846111126, -0.05715175996595454, 0.032981815512910066, 0.15338205441040484, 0.01611544999781404, -0.032499710918256194, -0.3344236182693009, 0.3051647776879248, 0.03596939194608027, 0.09216292900964618, -0.057184127520630575, 0.0615349096196016, -0.031601131665215734, -0.028964055669450452, 0.0030385466307732405, -0.09081976720947657, 0.06664010010241905, 0.19292237641611876, 0.09405671779249107, 0.25143608255050726, -0.3498872317978677, -0.20674818970924505, 0.050826552550299706, 0.19052056860881553, 0.03533451649943523, -0.0018535043400163963, -0.28669951359140816, 0.07404548985525644, -0.1967613932058633, -0.22184745307193598, -0.02969730145049882, 0.08923412895126041, 0.004203135744455296, -0.22154780770608476, 0.08119385181186355, 0.04895330340575392, 0.10272872016251644, -0.14668891922283533, -0.12687316905842033, -0.06388608927655721, 0.11447179310837603, 0.03199697315484007, -0.01211369812279661, 0.1486537513871477, -0.08437682213871, -0.07215093152225453, 0.3910613432657148, -0.0903779521201537, -0.11550825315165315, 0.2584220450806701, -0.21126760150279814, -0.12726158856753714, 0.18001122161458794, 0.11244810981867469, 0.15202822783422248, -0.19832579642708334, 0.018224960408460732, -0.04570079378122203, 0.174481823165666, 0.05935791805473583, 0.029869904223759878, 0.29623896166438535, 0.18390288530787993, 0.05221624322514111, 0.11916496559420478, -0.1353085879889256, -0.10997640728846053, -0.19641876440042647, -0.15570922584053146, -0.1799884672737985, 0.034201092112844236, -0.06810992210668242, -0.14161893426849742, 0.39643476549187834, 0.148380885097616, 0.17025536835350305, 0.025721868793871776, 0.2440116112599167, 0.11998322260431145, 0.10289216251765317, 0.08009233241291525, 0.30617794004556176, 0.11215414827750456, 0.0777871925242367, -0.2477294786084687, 0.06235667246298116, 0.02807310664380039]
1,802.08301
Content-Based Citation Recommendation
We present a content-based method for recommending citations in an academic paper draft. We embed a given query document into a vector space, then use its nearest neighbors as candidates, and rerank the candidates using a discriminative model trained to distinguish between observed and unobserved citations. Unlike previous work, our method does not require metadata such as author names which can be missing, e.g., during the peer review process. Without using metadata, our method outperforms the best reported results on PubMed and DBLP datasets with relative improvements of over 18% in F1@20 and over 22% in MRR. We show empirically that, although adding metadata improves the performance on standard metrics, it favors self-citations which are less useful in a citation recommendation setup. We release an online portal (http://labs.semanticscholar.org/citeomatic/) for citation recommendation based on our method, and a new dataset OpenCorpus of 7 million research articles to facilitate future research on this task.
cs.CL cs.DL cs.IR
we present a contentbased method for recommending citations in an academic paper draft we embed a given query document into a vector space then use its nearest neighbors as candidates and rerank the candidates using a discriminative model trained to distinguish between observed and unobserved citations unlike previous work our method does not require metadata such as author names which can be missing eg during the peer review process without using metadata our method outperforms the best reported results on pubmed and dblp datasets with relative improvements of over 18 in f120 and over 22 in mrr we show empirically that although adding metadata improves the performance on standard metrics it favors selfcitations which are less useful in a citation recommendation setup we release an online portal httplabssemanticscholarorgciteomatic for citation recommendation based on our method and a new dataset opencorpus of 7 million research articles to facilitate future research on this task
[['we', 'present', 'a', 'contentbased', 'method', 'for', 'recommending', 'citations', 'in', 'an', 'academic', 'paper', 'draft', 'we', 'embed', 'a', 'given', 'query', 'document', 'into', 'a', 'vector', 'space', 'then', 'use', 'its', 'nearest', 'neighbors', 'as', 'candidates', 'and', 'rerank', 'the', 'candidates', 'using', 'a', 'discriminative', 'model', 'trained', 'to', 'distinguish', 'between', 'observed', 'and', 'unobserved', 'citations', 'unlike', 'previous', 'work', 'our', 'method', 'does', 'not', 'require', 'metadata', 'such', 'as', 'author', 'names', 'which', 'can', 'be', 'missing', 'eg', 'during', 'the', 'peer', 'review', 'process', 'without', 'using', 'metadata', 'our', 'method', 'outperforms', 'the', 'best', 'reported', 'results', 'on', 'pubmed', 'and', 'dblp', 'datasets', 'with', 'relative', 'improvements', 'of', 'over', '18', 'in', 'f120', 'and', 'over', '22', 'in', 'mrr', 'we', 'show', 'empirically', 'that', 'although', 'adding', 'metadata', 'improves', 'the', 'performance', 'on', 'standard', 'metrics', 'it', 'favors', 'selfcitations', 'which', 'are', 'less', 'useful', 'in', 'a', 'citation', 'recommendation', 'setup', 'we', 'release', 'an', 'online', 'portal', 'httplabssemanticscholarorgciteomatic', 'for', 'citation', 'recommendation', 'based', 'on', 'our', 'method', 'and', 'a', 'new', 'dataset', 'opencorpus', 'of', '7', 'million', 'research', 'articles', 'to', 'facilitate', 'future', 'research', 'on', 'this', 'task']]
[-0.004807369360050199, -0.014679514707477088, -0.030968450037950037, 0.05381153717497842, -0.18364126772476022, -0.13594369279164445, 0.12518209947707545, 0.453078219204541, -0.18279226342116126, -0.38889102817469295, 0.02533304001573448, -0.3616681025932299, -0.16166220589825295, 0.23046621261633332, -0.10784203151628476, -0.0031292632494853098, 0.14477097346516163, 0.08694737530844723, -0.025742779006156444, -0.3959706216478633, 0.28299223476530194, 0.05240016240289047, 0.3307078565617761, 0.06250052697856555, 0.06602558251407822, 0.0005678200637984196, -0.1514134376955175, 0.008588768038453359, -0.101058388436762, 0.1588331922723118, 0.30523028263147145, 0.2367730511121152, 0.31816573382274016, -0.32815378616195195, -0.1917994604164722, 0.08318066940136604, 0.15827209793604308, 0.09563938992017108, -0.04478180048449727, -0.3558319848930876, 0.09116831148510499, -0.24739553394958677, 0.03952854415776846, -0.12103902296188143, 0.007774970091054304, 0.005388074520125285, -0.25820182151654925, 0.05558502723286304, 0.039214553772294096, 0.1042701710240553, -0.05429307566822863, -0.1545484402910775, 0.026375121179180557, 0.1530760187380666, 0.048862471197373955, 0.07311673419106277, 0.13323164185284067, -0.12049273803366048, -0.19973644795015005, 0.39406511396319677, -0.0935740715905324, -0.19288952117192015, 0.14396320028549323, -0.016180357942670184, -0.1916008065329652, 0.05608733029311035, 0.23565451533927415, 0.09976494654344283, -0.18053925148642702, -0.007955290543168608, -0.06780821260927408, 0.21947591159580238, 0.05695160394909498, -0.02139821417095302, 0.15411626092461406, 0.21927246167762018, 0.02256307623742911, 0.10839008081832513, -0.07533597051409767, -0.0498274963520211, -0.2332953220677106, -0.15188655409424398, -0.1982046341110996, -0.014795452828152611, -0.08643316645313902, -0.14672500523738563, 0.43265652108074937, 0.24255217247542568, 0.17503210833458693, 0.04943329089589967, 0.3016049937038814, -0.05334265561596234, 0.11564064844829443, 0.11294791391767849, 0.16551953634862857, -0.04464460726696123, 0.186728771911909, -0.0713781488609294, 0.10687650003214211, 0.037565442056851396]
1,802.08302
Gas-induced friction and diffusion of rigid rotors
We derive the Boltzmann equation for the rotranslational dynamics of an arbitrary convex rigid body in a rarefied gas. It yields as a limiting case the Fokker-Planck equation accounting for friction, diffusion, and nonconservative drift forces and torques. We provide the rotranslational friction and diffusion tensors for specular and diffuse reflection off particles with spherical, cylindrical, and cuboidal shape, and show that the theory describes thermalization, photophoresis, and the inverse Magnus effect in the free molecular regime.
cond-mat.stat-mech
we derive the boltzmann equation for the rotranslational dynamics of an arbitrary convex rigid body in a rarefied gas it yields as a limiting case the fokkerplanck equation accounting for friction diffusion and nonconservative drift forces and torques we provide the rotranslational friction and diffusion tensors for specular and diffuse reflection off particles with spherical cylindrical and cuboidal shape and show that the theory describes thermalization photophoresis and the inverse magnus effect in the free molecular regime
[['we', 'derive', 'the', 'boltzmann', 'equation', 'for', 'the', 'rotranslational', 'dynamics', 'of', 'an', 'arbitrary', 'convex', 'rigid', 'body', 'in', 'a', 'rarefied', 'gas', 'it', 'yields', 'as', 'a', 'limiting', 'case', 'the', 'fokkerplanck', 'equation', 'accounting', 'for', 'friction', 'diffusion', 'and', 'nonconservative', 'drift', 'forces', 'and', 'torques', 'we', 'provide', 'the', 'rotranslational', 'friction', 'and', 'diffusion', 'tensors', 'for', 'specular', 'and', 'diffuse', 'reflection', 'off', 'particles', 'with', 'spherical', 'cylindrical', 'and', 'cuboidal', 'shape', 'and', 'show', 'that', 'the', 'theory', 'describes', 'thermalization', 'photophoresis', 'and', 'the', 'inverse', 'magnus', 'effect', 'in', 'the', 'free', 'molecular', 'regime']]
[-0.10620335897191899, 0.15953543450393828, -0.11889980666266826, 0.04620744771771617, -0.06669911556248251, -0.11209648057770033, -0.06378468989195037, 0.3485403694454339, -0.3081682071591691, -0.22919652833567036, 0.021418011714039103, -0.2638310017306116, -0.12847883984531192, 0.16157985723262966, -0.001402103615011536, 0.04670312637826065, 0.03271732885729183, -0.0571464712050435, -0.014205431220932053, -0.13026954952095235, 0.302066429735875, 0.02348205062572832, 0.21263497276836402, 0.09888223071231858, 0.1829820833593764, 0.05526262820492704, 0.015606891276169713, 0.028457236657669017, -0.19024902055776668, 0.0547004878542132, 0.14519636341455308, -0.05865568776506108, 0.19175538343268556, -0.5124498411722771, -0.25376680527221074, 0.03138741310806824, 0.14319840447550833, 0.14586170407181437, -0.07869340767237273, -0.24169786017714673, -0.06614632050010871, -0.1889265308809745, -0.21678195314409285, -0.04960667783116269, 0.10454926084630288, 0.045138561971146955, -0.2800328213503802, 0.2012825735735816, 0.13109629419813681, 0.021317574038327514, -0.17297325413916018, -0.07821215492032178, 0.004236917540600354, 0.08585112546752026, 0.03865004159123093, -0.055122841621277396, 0.22709135632574945, -0.1599844942782558, -0.012880618635613423, 0.4410133737973966, -0.072377545502061, -0.301678844013965, 0.20173214150399163, -0.18437262400742863, -0.029029275762376846, 0.18540289176494948, 0.17492109227490116, 0.11486728264732504, -0.18231209101421492, 0.0807876226669117, -0.03141035647554831, 0.07859550687399777, 0.09238581150141242, -0.08929809572949231, 0.17028805078914414, 0.15069348314269024, 0.05786945458120582, 0.16480181271863448, -0.11239637366976807, -0.12418590615958568, -0.28226536079370357, -0.16893848996948113, -0.15853957498488438, 0.0853475301175729, -0.13167669891259579, -0.18201288413982114, 0.2336459487870142, 0.10086067712732724, 0.13179736190124766, 0.07805490280900683, 0.3130268621585005, 0.17377811678618724, -0.002933690914061743, 0.12141738546250219, 0.22872228211157822, 0.20344861822396323, 0.08918540819560165, -0.3227162065540815, 0.015083130811909576, 0.09055449226992084]
1,802.08303
The Quantum Abacus: Analog Computing using Surface Rydberg States
Recently, Rydberg atoms appeared as a viable alternative to the quantum gates built on atomic or molecular ions. The lifetimes of the circular Rydberg states can be in the millisecond range. That prevents inherent metastability of the Rydberg atoms to influence computation at the typical decoherence times, which are now being achieved in the range of 1 ms. The paper proposes to use a pinning potential of an image charge on a cryogenic substrate (liquid He, in particular) to confine large densities of Rydberg atoms to dielectric surfaces. The substrate can also act as a natural cooler medium. A design of the computer (quantum abacus) based on these ideas is briefly sketched in the paper.
quant-ph cond-mat.mes-hall physics.atm-clus
recently rydberg atoms appeared as a viable alternative to the quantum gates built on atomic or molecular ions the lifetimes of the circular rydberg states can be in the millisecond range that prevents inherent metastability of the rydberg atoms to influence computation at the typical decoherence times which are now being achieved in the range of 1 ms the paper proposes to use a pinning potential of an image charge on a cryogenic substrate liquid he in particular to confine large densities of rydberg atoms to dielectric surfaces the substrate can also act as a natural cooler medium a design of the computer quantum abacus based on these ideas is briefly sketched in the paper
[['recently', 'rydberg', 'atoms', 'appeared', 'as', 'a', 'viable', 'alternative', 'to', 'the', 'quantum', 'gates', 'built', 'on', 'atomic', 'or', 'molecular', 'ions', 'the', 'lifetimes', 'of', 'the', 'circular', 'rydberg', 'states', 'can', 'be', 'in', 'the', 'millisecond', 'range', 'that', 'prevents', 'inherent', 'metastability', 'of', 'the', 'rydberg', 'atoms', 'to', 'influence', 'computation', 'at', 'the', 'typical', 'decoherence', 'times', 'which', 'are', 'now', 'being', 'achieved', 'in', 'the', 'range', 'of', '1', 'ms', 'the', 'paper', 'proposes', 'to', 'use', 'a', 'pinning', 'potential', 'of', 'an', 'image', 'charge', 'on', 'a', 'cryogenic', 'substrate', 'liquid', 'he', 'in', 'particular', 'to', 'confine', 'large', 'densities', 'of', 'rydberg', 'atoms', 'to', 'dielectric', 'surfaces', 'the', 'substrate', 'can', 'also', 'act', 'as', 'a', 'natural', 'cooler', 'medium', 'a', 'design', 'of', 'the', 'computer', 'quantum', 'abacus', 'based', 'on', 'these', 'ideas', 'is', 'briefly', 'sketched', 'in', 'the', 'paper']]
[-0.08343357802571162, 0.23489391301346071, -0.03464496154743044, 0.008576716649669991, -0.012549184951121393, -0.15080539278443092, 0.07714801309022891, 0.3907941922545433, -0.23999670490865474, -0.28884681144162366, 0.023903656414831463, -0.2508958479470533, -0.061273375584784406, 0.19746832612537496, -0.05012791866775724, 0.04260290929966647, 0.019240331674075645, -0.011766639226318702, -0.051490948006571474, -0.24888753310331832, 0.2613065041500427, 0.08115107587781613, 0.2533512549960743, 0.1101140526285314, 0.10336467763004095, -0.05365724609354916, 0.08648117752290209, -0.03329182624330987, -0.11811079326846242, 0.14138591681232515, 0.2660029377626336, 0.027502584526234348, 0.25906360217410584, -0.5197450994311468, -0.19523902882457428, 0.04691048859436389, 0.15965708586508814, 0.19396345255714234, -0.07623815171562297, -0.3055654891685623, 0.015249117504319419, -0.16921582277054373, -0.12049665476155022, -0.0716639024225752, 0.04987781566122304, 0.034324526972815635, -0.20882271084448564, 0.013195145577344152, 0.05310270996845287, 0.061556692040808825, -0.023834259013402397, -0.08945231444971717, 0.04192875340661925, 0.05349742127734277, -0.026094602058520135, 0.023164546482123273, 0.2467225542737414, -0.10552716488828477, -0.10995698576469136, 0.4094700847145008, -0.06903719259628459, -0.11883832272142172, 0.22084452495302842, -0.10947994116450781, -0.08833933320179906, 0.11800469103795679, 0.16331276776997938, 0.10890788463875652, -0.1310381293134845, 0.06743088853747949, -0.027354362817562143, 0.1890470044657021, 0.11657128475970872, 0.09396602155478752, 0.24126269928301158, 0.17263301024415895, 0.051592485080270666, 0.14058335114817094, -0.1331780117308802, -0.11020929366147712, -0.23904057276718643, -0.183970697371937, -0.22423195273655913, 0.06651315854092979, -0.017360580761147583, -0.16446080401985216, 0.3740126338422946, 0.13015029749063695, 0.17738956794466662, -0.044134502338609945, 0.2904729919427115, 0.07520761184353868, 0.08060473275735326, -0.005113595181509205, 0.2429795704336594, 0.16290294884339623, 0.07993213248884548, -0.2357890086208025, 0.025829342501642913, 0.0028884853074408095]
1,802.08304
XMM-Newton Survey of Local OVII Absorption Lines in the Spectra of Galactic X-ray Sources
The detection of highly ionized metal absorption lines in the X-ray spectra of the Galactic X-ray binaries (XRBs) implies the distribution of hot gas along the sightline toward the background sources. However, the origin of this hot gas is still unclear: it can arise in the hot interstellar medium (ISM), or is intrinsic to the XRBs. In this paper, we present an XMM-Newton survey of the OVII absorption lines in the spectra of Galactic XRBs. A total of 33 XRBs were selected, with 29 low mass XRBs and 4 high mass XRBs. At more than 3$\sigma$ threshold, OVII absorption line was detected in 16 targets, among which 4 were newly discovered in this work. The average line equivalent width (EW) is centered around $\sim$ 20 m\AA. Additionally we do not find strong correlations between the OVII EWs and the Galactic neutral absorption N$_{\rm H}$, the Galactic coordinates or the distance of background targets. Such non-correlation may suggest the contamination of the circumstellar material, or the lack of constrains on the line Doppler-b parameter. We also find regardless the direction of the XRBs, the OVII absorption lines were always detected when the flux of the background XRBs reach a certain level, suggesting a uniform distribution of this hot gas. We estimate a ratio of 0.004 --- 0.4 between hot and neutral phase of the interstellar medium. This is the second paper in the series following Fang et al. 2015, in which we focused on the local OVII absorption lines detected in the background AGN spectra. Detailed modeling of the hot ISM distribution will be investigated in a future paper.
astro-ph.GA astro-ph.HE
the detection of highly ionized metal absorption lines in the xray spectra of the galactic xray binaries xrbs implies the distribution of hot gas along the sightline toward the background sources however the origin of this hot gas is still unclear it can arise in the hot interstellar medium ism or is intrinsic to the xrbs in this paper we present an xmmnewton survey of the ovii absorption lines in the spectra of galactic xrbs a total of 33 xrbs were selected with 29 low mass xrbs and 4 high mass xrbs at more than 3sigma threshold ovii absorption line was detected in 16 targets among which 4 were newly discovered in this work the average line equivalent width ew is centered around sim 20 maa additionally we do not find strong correlations between the ovii ews and the galactic neutral absorption n_rm h the galactic coordinates or the distance of background targets such noncorrelation may suggest the contamination of the circumstellar material or the lack of constrains on the line dopplerb parameter we also find regardless the direction of the xrbs the ovii absorption lines were always detected when the flux of the background xrbs reach a certain level suggesting a uniform distribution of this hot gas we estimate a ratio of 0004 04 between hot and neutral phase of the interstellar medium this is the second paper in the series following fang et al 2015 in which we focused on the local ovii absorption lines detected in the background agn spectra detailed modeling of the hot ism distribution will be investigated in a future paper
[['the', 'detection', 'of', 'highly', 'ionized', 'metal', 'absorption', 'lines', 'in', 'the', 'xray', 'spectra', 'of', 'the', 'galactic', 'xray', 'binaries', 'xrbs', 'implies', 'the', 'distribution', 'of', 'hot', 'gas', 'along', 'the', 'sightline', 'toward', 'the', 'background', 'sources', 'however', 'the', 'origin', 'of', 'this', 'hot', 'gas', 'is', 'still', 'unclear', 'it', 'can', 'arise', 'in', 'the', 'hot', 'interstellar', 'medium', 'ism', 'or', 'is', 'intrinsic', 'to', 'the', 'xrbs', 'in', 'this', 'paper', 'we', 'present', 'an', 'xmmnewton', 'survey', 'of', 'the', 'ovii', 'absorption', 'lines', 'in', 'the', 'spectra', 'of', 'galactic', 'xrbs', 'a', 'total', 'of', '33', 'xrbs', 'were', 'selected', 'with', '29', 'low', 'mass', 'xrbs', 'and', '4', 'high', 'mass', 'xrbs', 'at', 'more', 'than', '3sigma', 'threshold', 'ovii', 'absorption', 'line', 'was', 'detected', 'in', '16', 'targets', 'among', 'which', '4', 'were', 'newly', 'discovered', 'in', 'this', 'work', 'the', 'average', 'line', 'equivalent', 'width', 'ew', 'is', 'centered', 'around', 'sim', '20', 'maa', 'additionally', 'we', 'do', 'not', 'find', 'strong', 'correlations', 'between', 'the', 'ovii', 'ews', 'and', 'the', 'galactic', 'neutral', 'absorption', 'n_rm', 'h', 'the', 'galactic', 'coordinates', 'or', 'the', 'distance', 'of', 'background', 'targets', 'such', 'noncorrelation', 'may', 'suggest', 'the', 'contamination', 'of', 'the', 'circumstellar', 'material', 'or', 'the', 'lack', 'of', 'constrains', 'on', 'the', 'line', 'dopplerb', 'parameter', 'we', 'also', 'find', 'regardless', 'the', 'direction', 'of', 'the', 'xrbs', 'the', 'ovii', 'absorption', 'lines', 'were', 'always', 'detected', 'when', 'the', 'flux', 'of', 'the', 'background', 'xrbs', 'reach', 'a', 'certain', 'level', 'suggesting', 'a', 'uniform', 'distribution', 'of', 'this', 'hot', 'gas', 'we', 'estimate', 'a', 'ratio', 'of', '0004', '04', 'between', 'hot', 'and', 'neutral', 'phase', 'of', 'the', 'interstellar', 'medium', 'this', 'is', 'the', 'second', 'paper', 'in', 'the', 'series', 'following', 'fang', 'et', 'al', '2015', 'in', 'which', 'we', 'focused', 'on', 'the', 'local', 'ovii', 'absorption', 'lines', 'detected', 'in', 'the', 'background', 'agn', 'spectra', 'detailed', 'modeling', 'of', 'the', 'hot', 'ism', 'distribution', 'will', 'be', 'investigated', 'in', 'a', 'future', 'paper']]
[-0.08194811214343645, 0.10795267361232222, 0.0010517004709270665, 0.08494636053665842, -0.04327013347511481, -0.061816771845578364, 0.07516870905226797, 0.4631073603973745, -0.15932362866798008, -0.3453289756159249, 0.02225820116324112, -0.35886524757020233, 0.010116321451154965, 0.13090259094566764, -0.00380603228240533, -0.040680994080140864, -0.01577106472962585, -0.09265495164764527, -0.048791987674408836, -0.2506333417162873, 0.2975292949223037, 0.10929284824751653, 0.17992533280958833, 0.04425210997294214, 0.03195762878443163, -0.07736008946129114, -0.09625714147617494, -0.011267794865967804, -0.09778353827294309, 0.05536692801104067, 0.22383929733046912, 0.10773836207839563, 0.20328674419026793, -0.3195136572108289, -0.23609903076474548, 0.09262822114834492, 0.20995007843633456, 0.034767133769355155, -0.04144013062701779, -0.2505440037326425, 0.028698221814058917, -0.14276463967306832, -0.18414096311224917, 0.10143864077876526, 0.030154497930745042, 0.026938128157753385, -0.18257321985753575, 0.13472600367795098, 0.04179506740336748, 0.08944374803739033, -0.12000482504893291, -0.09611118465742531, -0.06683252594075725, 0.015072681582764778, 0.02934278951628708, 0.045279732985965576, 0.20841520988466428, -0.13300619854441234, -0.021193538723720054, 0.4047682691379485, -0.09967371345134636, 0.005505600057479302, 0.1903897625765294, -0.23166303464677185, -0.22385362748238713, 0.23060600931232766, 0.15889915360988616, 0.14002285813265025, -0.15768952988232776, 0.0038926770679321827, -0.07123905432907711, 0.2542362091817746, 0.043493418589311376, 0.08364639774181958, 0.3170213033252613, 0.058999627208883375, 0.024156868423657364, 0.1032355986907553, -0.2550584018130654, 0.020565044427863007, -0.2391665617545193, -0.1158461277338123, -0.0965065560299252, 0.10546380697616728, -0.08156437620406146, -0.13912213777688234, 0.34541199979008197, 0.12051300479395007, 0.2554175900120316, -0.036106024639456905, 0.3118378594128198, 0.12236409146720334, 0.008726750073352255, 0.14710612842617066, 0.3577735115637429, 0.17792292280539282, 0.1179862982187336, -0.2225279813358618, 0.10384496294804044, -0.009734396437617173]
1,802.08305
A perfectly matched layer approach for radiative transfer in highly scattering regimes
We consider the numerical approximation of boundary conditions in radiative transfer problems by a perfectly matched layer approach. The main idea is to extend the computational domain by an absorbing layer and to use an appropriate reflection boundary condition at the boundary of the extended domain. A careful analysis shows that the consistency error introduced by this approach can be made arbitrarily small by increasing the size of the extension domain or the magnitude of the artificial absorption in the surrounding layer. A particular choice of the reflection boundary condition allows us to circumvent the half-space integrals that arise in the variational treatment of the original vacuum boundary conditions and which destroy the sparse coupling observed in numerical approximation schemes based on truncated spherical harmonics expansions. A combination of the perfectly matched layer approach with a mixed variational formulation and a PN-finite element approximation leads to discretization schemes with optimal sparsity pattern and provable quasi-optimal convergence properties. As demonstrated in numerical tests these methods are accurate and very efficient for radiative transfer in the scattering regime.
math.NA
we consider the numerical approximation of boundary conditions in radiative transfer problems by a perfectly matched layer approach the main idea is to extend the computational domain by an absorbing layer and to use an appropriate reflection boundary condition at the boundary of the extended domain a careful analysis shows that the consistency error introduced by this approach can be made arbitrarily small by increasing the size of the extension domain or the magnitude of the artificial absorption in the surrounding layer a particular choice of the reflection boundary condition allows us to circumvent the halfspace integrals that arise in the variational treatment of the original vacuum boundary conditions and which destroy the sparse coupling observed in numerical approximation schemes based on truncated spherical harmonics expansions a combination of the perfectly matched layer approach with a mixed variational formulation and a pnfinite element approximation leads to discretization schemes with optimal sparsity pattern and provable quasioptimal convergence properties as demonstrated in numerical tests these methods are accurate and very efficient for radiative transfer in the scattering regime
[['we', 'consider', 'the', 'numerical', 'approximation', 'of', 'boundary', 'conditions', 'in', 'radiative', 'transfer', 'problems', 'by', 'a', 'perfectly', 'matched', 'layer', 'approach', 'the', 'main', 'idea', 'is', 'to', 'extend', 'the', 'computational', 'domain', 'by', 'an', 'absorbing', 'layer', 'and', 'to', 'use', 'an', 'appropriate', 'reflection', 'boundary', 'condition', 'at', 'the', 'boundary', 'of', 'the', 'extended', 'domain', 'a', 'careful', 'analysis', 'shows', 'that', 'the', 'consistency', 'error', 'introduced', 'by', 'this', 'approach', 'can', 'be', 'made', 'arbitrarily', 'small', 'by', 'increasing', 'the', 'size', 'of', 'the', 'extension', 'domain', 'or', 'the', 'magnitude', 'of', 'the', 'artificial', 'absorption', 'in', 'the', 'surrounding', 'layer', 'a', 'particular', 'choice', 'of', 'the', 'reflection', 'boundary', 'condition', 'allows', 'us', 'to', 'circumvent', 'the', 'halfspace', 'integrals', 'that', 'arise', 'in', 'the', 'variational', 'treatment', 'of', 'the', 'original', 'vacuum', 'boundary', 'conditions', 'and', 'which', 'destroy', 'the', 'sparse', 'coupling', 'observed', 'in', 'numerical', 'approximation', 'schemes', 'based', 'on', 'truncated', 'spherical', 'harmonics', 'expansions', 'a', 'combination', 'of', 'the', 'perfectly', 'matched', 'layer', 'approach', 'with', 'a', 'mixed', 'variational', 'formulation', 'and', 'a', 'pnfinite', 'element', 'approximation', 'leads', 'to', 'discretization', 'schemes', 'with', 'optimal', 'sparsity', 'pattern', 'and', 'provable', 'quasioptimal', 'convergence', 'properties', 'as', 'demonstrated', 'in', 'numerical', 'tests', 'these', 'methods', 'are', 'accurate', 'and', 'very', 'efficient', 'for', 'radiative', 'transfer', 'in', 'the', 'scattering', 'regime']]
[-0.08998581441418667, 0.047625337063634234, -0.08995565969763057, 0.04835814531759492, -0.08428461862195816, -0.11607150551663445, 0.062102065362435364, 0.3878397252729961, -0.2896135419447507, -0.28552289303924355, 0.1442087794866945, -0.21295465478548847, -0.12013080957345665, 0.14563458945236302, -0.06029821634758264, 0.1032643932636295, 0.0947197245008179, -0.036770317880436776, -0.09538414166441986, -0.19463623694942467, 0.33533770212770575, 0.03755668773714985, 0.30816769498267343, 0.03936464576582824, 0.08973992801670518, -0.010807682927697897, -0.018167604760133793, 0.01597349194011518, -0.1212523461962285, 0.13734403134589748, 0.22835032205496517, 0.03103456636890769, 0.2955770295352808, -0.462682574902262, -0.24012139682791062, 0.01837734173052013, 0.14210330264177173, 0.11062887528711664, -0.03753477069150124, -0.25407387616245874, 0.07270492865171815, -0.14601496477212225, -0.1773843600973487, -0.06435050969278173, -0.07872117051056453, -0.013241540394124708, -0.36666060911757603, 0.07218678844294378, 0.07002164835376398, 0.014562310704163143, -0.07534314091949325, -0.08161100690120032, 0.012938012186703938, 0.08930597754328379, 0.034296981214013485, -0.010967682275388921, 0.07541331867554359, -0.11716015590155231, -0.07015703520205405, 0.3539584413915873, -0.06473506000458396, -0.26717341378331183, 0.1971308987753998, -0.1116555122977921, -0.046702893118241, 0.16952861576474137, 0.15520721113043173, 0.152858208993982, -0.11341459272961531, 0.09870106283941173, -0.027554029922466725, 0.16617918653679745, 0.09896929850801825, -0.013519206737567272, 0.11539791787309306, 0.13575147619171601, 0.09449308930763177, 0.16100821888273847, -0.06671077777498535, -0.10602502541882651, -0.3324495034398777, -0.11607708888918361, -0.1990079556684941, -0.00968075695780239, -0.12922214504023682, -0.20405279385724237, 0.33633677568020565, 0.15710539974538343, 0.17816623018256256, 0.027575277323568508, 0.33047584468631874, 0.15085273593065462, 0.05715336244586589, 0.0731262873671949, 0.23397561318108015, 0.17461791988994393, 0.07563674559816719, -0.2516038918974144, 0.0633967762307397, 0.11457751881331206]
1,802.08306
Fluid analogs for rotating black holes
Fluid analog models for gravity are based on the idea that any spacetime geometry admits a reinterpretation in which space is thought of as a fluid flowing with a prescribed velocity. This fluid picture is a restatement of the ADM decomposition of the metric. Most of the literature has focused on flat spatial geometries and physical fluid flows, with a view toward possible laboratory realizations. Here we relax these conditions and consider fluid flows on curved and time-dependent spatial geometries, as a way of understanding and visualizing solutions to general relativity. We illustrate the utility of the approach with rotating black holes. For the Kerr black hole we develop a fluid description based on Doran coordinates. For spinning BTZ black holes we develop two different fluid descriptions. One involves static conical spatial slices, with the fluid orbiting the tip of the cone. The other resembles a cosmology, with the fluid flowing on a time-dependent cylindrical geometry.
gr-qc hep-th
fluid analog models for gravity are based on the idea that any spacetime geometry admits a reinterpretation in which space is thought of as a fluid flowing with a prescribed velocity this fluid picture is a restatement of the adm decomposition of the metric most of the literature has focused on flat spatial geometries and physical fluid flows with a view toward possible laboratory realizations here we relax these conditions and consider fluid flows on curved and timedependent spatial geometries as a way of understanding and visualizing solutions to general relativity we illustrate the utility of the approach with rotating black holes for the kerr black hole we develop a fluid description based on doran coordinates for spinning btz black holes we develop two different fluid descriptions one involves static conical spatial slices with the fluid orbiting the tip of the cone the other resembles a cosmology with the fluid flowing on a timedependent cylindrical geometry
[['fluid', 'analog', 'models', 'for', 'gravity', 'are', 'based', 'on', 'the', 'idea', 'that', 'any', 'spacetime', 'geometry', 'admits', 'a', 'reinterpretation', 'in', 'which', 'space', 'is', 'thought', 'of', 'as', 'a', 'fluid', 'flowing', 'with', 'a', 'prescribed', 'velocity', 'this', 'fluid', 'picture', 'is', 'a', 'restatement', 'of', 'the', 'adm', 'decomposition', 'of', 'the', 'metric', 'most', 'of', 'the', 'literature', 'has', 'focused', 'on', 'flat', 'spatial', 'geometries', 'and', 'physical', 'fluid', 'flows', 'with', 'a', 'view', 'toward', 'possible', 'laboratory', 'realizations', 'here', 'we', 'relax', 'these', 'conditions', 'and', 'consider', 'fluid', 'flows', 'on', 'curved', 'and', 'timedependent', 'spatial', 'geometries', 'as', 'a', 'way', 'of', 'understanding', 'and', 'visualizing', 'solutions', 'to', 'general', 'relativity', 'we', 'illustrate', 'the', 'utility', 'of', 'the', 'approach', 'with', 'rotating', 'black', 'holes', 'for', 'the', 'kerr', 'black', 'hole', 'we', 'develop', 'a', 'fluid', 'description', 'based', 'on', 'doran', 'coordinates', 'for', 'spinning', 'btz', 'black', 'holes', 'we', 'develop', 'two', 'different', 'fluid', 'descriptions', 'one', 'involves', 'static', 'conical', 'spatial', 'slices', 'with', 'the', 'fluid', 'orbiting', 'the', 'tip', 'of', 'the', 'cone', 'the', 'other', 'resembles', 'a', 'cosmology', 'with', 'the', 'fluid', 'flowing', 'on', 'a', 'timedependent', 'cylindrical', 'geometry']]
[-0.15944744017010984, 0.07214532083180995, -0.1281137317717553, 0.05036600826693197, -0.10066136424481953, -0.15262949964306197, -0.052006728403891124, 0.31578883930827334, -0.1700508455395697, -0.28224277373579426, 0.07359022968851675, -0.2546515953398716, -0.11710684821427537, 0.17919312300494847, -0.07738395813458528, 0.016737585738435604, 0.002032192900048521, 0.011401152821165921, -0.106839979275276, -0.13202130172001675, 0.38146269767700386, 0.06003462604414194, 0.28400501833918196, -0.032611070467212885, 0.15182321933762302, -0.009463993002636692, -0.021606325410688534, 0.11745325103681982, -0.19659090876298135, 0.11214791646060081, 0.1840811245189728, 0.09313369101847713, 0.21529618819029286, -0.46284858400646883, -0.2868886338128971, 0.02369632429252259, 0.12120560366206636, 0.1750427010037805, -0.10658773781361584, -0.2618332330304652, 0.010563818536376437, -0.15444158563891855, -0.18046395117058778, -0.04848893864963872, 0.03628059533926157, -0.022843928676313505, -0.17307227729365993, 0.09331235133159237, 0.07665148890242936, -0.007134459978447129, -0.1152444580131067, -0.03197793171364957, -0.037261736450884014, 0.06136882548423436, 0.07251471178292726, 0.02220544374535959, 0.1811716217601385, -0.11891559340382138, -0.09802089415144366, 0.4271172734741599, -0.05996101568094813, -0.301068387973385, 0.21959767992405269, -0.19179919514303598, -0.05853691536825723, 0.08213254663860425, 0.17754137591990188, 0.19659588323422492, -0.1261136889224872, 0.10837463454420988, -0.07756904377572191, 0.11585892004241498, 0.1290850980858056, -0.006111519304865327, 0.3533283147919111, 0.17717193716462368, 0.03520706589990415, 0.14836413038196603, -0.08075508437505984, -0.14514957531691136, -0.3343566831631156, -0.17564256021227592, -0.14106113564533493, 0.09347372633130409, -0.16772220218337727, -0.20716277146204495, 0.34340743609190655, 0.0684601608156346, 0.16028852831237975, 0.009229318782812558, 0.3024962034626533, 0.025063730243485995, -0.016227244703958813, 0.12729605066721353, 0.2638234372776097, 0.1562553977068418, 0.1517747854694533, -0.1924725594096041, -0.04804588324473932, 0.13191083843748158]
1,802.08307
Sensitive Information Tracking in Commodity IoT
Broadly defined as the Internet of Things (IoT), the growth of commodity devices that integrate physical processes with digital connectivity has had profound effects on society--smart homes, personal monitoring devices, enhanced manufacturing and other IoT apps have changed the way we live, play, and work. Yet extant IoT platforms provide few means of evaluating the use (and potential avenues for misuse) of sensitive information. Thus, consumers and organizations have little information to assess the security and privacy risks these devices present. In this paper, we present SainT, a static taint analysis tool for IoT applications. SainT operates in three phases; (a) translation of platform-specific IoT source code into an intermediate representation (IR), (b) identifying sensitive sources and sinks, and (c) performing static analysis to identify sensitive data flows. We evaluate SainT on 230 SmartThings market apps and find 138 (60%) include sensitive data flows. In addition, we demonstrate SainT on IoTBench, a novel open-source test suite containing 19 apps with 27 unique data leaks. Through this effort, we introduce a rigorously grounded framework for evaluating the use of sensitive information in IoT apps---and therein provide developers, markets, and consumers a means of identifying potential threats to security and privacy.
cs.CR cs.PL
broadly defined as the internet of things iot the growth of commodity devices that integrate physical processes with digital connectivity has had profound effects on societysmart homes personal monitoring devices enhanced manufacturing and other iot apps have changed the way we live play and work yet extant iot platforms provide few means of evaluating the use and potential avenues for misuse of sensitive information thus consumers and organizations have little information to assess the security and privacy risks these devices present in this paper we present saint a static taint analysis tool for iot applications saint operates in three phases a translation of platformspecific iot source code into an intermediate representation ir b identifying sensitive sources and sinks and c performing static analysis to identify sensitive data flows we evaluate saint on 230 smartthings market apps and find 138 60 include sensitive data flows in addition we demonstrate saint on iotbench a novel opensource test suite containing 19 apps with 27 unique data leaks through this effort we introduce a rigorously grounded framework for evaluating the use of sensitive information in iot appsand therein provide developers markets and consumers a means of identifying potential threats to security and privacy
[['broadly', 'defined', 'as', 'the', 'internet', 'of', 'things', 'iot', 'the', 'growth', 'of', 'commodity', 'devices', 'that', 'integrate', 'physical', 'processes', 'with', 'digital', 'connectivity', 'has', 'had', 'profound', 'effects', 'on', 'societysmart', 'homes', 'personal', 'monitoring', 'devices', 'enhanced', 'manufacturing', 'and', 'other', 'iot', 'apps', 'have', 'changed', 'the', 'way', 'we', 'live', 'play', 'and', 'work', 'yet', 'extant', 'iot', 'platforms', 'provide', 'few', 'means', 'of', 'evaluating', 'the', 'use', 'and', 'potential', 'avenues', 'for', 'misuse', 'of', 'sensitive', 'information', 'thus', 'consumers', 'and', 'organizations', 'have', 'little', 'information', 'to', 'assess', 'the', 'security', 'and', 'privacy', 'risks', 'these', 'devices', 'present', 'in', 'this', 'paper', 'we', 'present', 'saint', 'a', 'static', 'taint', 'analysis', 'tool', 'for', 'iot', 'applications', 'saint', 'operates', 'in', 'three', 'phases', 'a', 'translation', 'of', 'platformspecific', 'iot', 'source', 'code', 'into', 'an', 'intermediate', 'representation', 'ir', 'b', 'identifying', 'sensitive', 'sources', 'and', 'sinks', 'and', 'c', 'performing', 'static', 'analysis', 'to', 'identify', 'sensitive', 'data', 'flows', 'we', 'evaluate', 'saint', 'on', '230', 'smartthings', 'market', 'apps', 'and', 'find', '138', '60', 'include', 'sensitive', 'data', 'flows', 'in', 'addition', 'we', 'demonstrate', 'saint', 'on', 'iotbench', 'a', 'novel', 'opensource', 'test', 'suite', 'containing', '19', 'apps', 'with', '27', 'unique', 'data', 'leaks', 'through', 'this', 'effort', 'we', 'introduce', 'a', 'rigorously', 'grounded', 'framework', 'for', 'evaluating', 'the', 'use', 'of', 'sensitive', 'information', 'in', 'iot', 'appsand', 'therein', 'provide', 'developers', 'markets', 'and', 'consumers', 'a', 'means', 'of', 'identifying', 'potential', 'threats', 'to', 'security', 'and', 'privacy']]
[-0.15739654879143927, -0.004045089435266516, -0.04626823325845774, 0.07988632830662881, -0.12425309476770499, -0.199753297395453, 0.0960073768231324, 0.3649595548394041, -0.21890136627813003, -0.36262990092402514, 0.1507379516614102, -0.3547718945263448, -0.1341267236468634, 0.2100045992208797, -0.10279574092211467, 0.046315947138170985, 0.041861316341222546, -0.030824908859878115, 0.040824496879822064, -0.2602610014443172, 0.3083315778010506, 0.032117760811495234, 0.3436193785449604, 0.11429405530287447, 0.05242398186237551, -0.006087625954580512, -0.11718567616154192, -0.030400950637288458, -0.1295531834789379, 0.15430783832977926, 0.3384997820284465, 0.21345653484470914, 0.3611086929948734, -0.4548280303204926, -0.1793682833501537, 0.06469388230827314, 0.14116576378327575, 0.04518348931415691, -0.11043492514504671, -0.3415797959053319, 0.1082626292030612, -0.26318228020741397, -0.0962738091176125, -0.1342063118817703, 0.033458071452570244, 0.007464443372945035, -0.2044933402717199, -0.009233112906685517, -0.040149343150135665, 0.1474057528789022, -0.029325092637751664, -0.07447642480422344, -0.02242437144622625, 0.20684350716966984, 0.04081271677658114, -0.03917477214031815, 0.22586948865768025, -0.12241720359463439, -0.12558443175286663, 0.35916981864981923, 0.017236399617549792, -0.11686932532192797, 0.17890489562438344, -0.01803200999733681, -0.16993070595270518, 0.0457951524936385, 0.2556249828016081, 0.06085505751816898, -0.24054915610729355, 0.04118422868516657, 0.03786383559588789, 0.18191392341871004, 0.03965136969856424, 0.08631158131412325, 0.22240894199681602, 0.20808932808588962, 0.0729047535409039, 0.10483855533215208, -0.0638969719994395, -0.07658798097780127, -0.21213008236907405, -0.1892099919484225, -0.10672327160968312, 0.05441226576331989, -0.08947934765990571, -0.14339175961682413, 0.368285443469863, 0.24515473036444746, 0.09040636024485361, -0.0026455334463745964, 0.3565190470734687, -0.013279990816360568, 0.1306957709932657, 0.14207596528434138, 0.1664472097692517, -0.004879881640924711, 0.23013458508827098, -0.09581597977791846, 0.10681262849568751, -0.07350957674052737]
1,802.08308
A Bayesian Mark Interaction Model for Analysis of Tumor Pathology Images
With the advance of imaging technology, digital pathology imaging of tumor tissue slides is becoming a routine clinical procedure for cancer diagnosis. This process produces massive imaging data that capture histological details in high resolution. Recent developments in deep-learning methods have enabled us to identify and classify individual cells from digital pathology images at large scale. The randomly distributed cells can be considered from a marked point process, where each point is defined by its position and cell type. Reliable statistical approaches to model such marked spatial point patterns can provide new insight into tumor progression and shed light on the biological mechanisms of cancer. In this paper, we consider the problem of modeling spatial correlations among three commonly seen cells (i.e. lymphocyte, stromal, and tumor) observed in tumor pathology images. A novel marking model of marked point processes, with interpretable underlying parameters (some of which are clinically meaningful), is proposed in a Bayesian framework. We use Markov chain Monte Carlo (MCMC) sampling techniques, combined with the double Metropolis-Hastings (DMH) algorithm, to sample from the posterior distribution with an intractable normalizing constant. On the benchmark datasets, we demonstrate how this model-based analysis can lead to sharper inferences than ordinary exploratory analyses. Lastly, we conduct a case study on the pathology images of 188 lung cancer patients from the National Lung Screening Trial. The results show that the spatial correlation between tumor and stromal cells predicts patient prognosis. This statistical methodology not only presents a new model for characterizing spatial correlations in a multi-type spatial point pattern, but also provides a new perspective for understanding the role of cell-cell interactions in cancer progression.
stat.ME stat.AP
with the advance of imaging technology digital pathology imaging of tumor tissue slides is becoming a routine clinical procedure for cancer diagnosis this process produces massive imaging data that capture histological details in high resolution recent developments in deeplearning methods have enabled us to identify and classify individual cells from digital pathology images at large scale the randomly distributed cells can be considered from a marked point process where each point is defined by its position and cell type reliable statistical approaches to model such marked spatial point patterns can provide new insight into tumor progression and shed light on the biological mechanisms of cancer in this paper we consider the problem of modeling spatial correlations among three commonly seen cells ie lymphocyte stromal and tumor observed in tumor pathology images a novel marking model of marked point processes with interpretable underlying parameters some of which are clinically meaningful is proposed in a bayesian framework we use markov chain monte carlo mcmc sampling techniques combined with the double metropolishastings dmh algorithm to sample from the posterior distribution with an intractable normalizing constant on the benchmark datasets we demonstrate how this modelbased analysis can lead to sharper inferences than ordinary exploratory analyses lastly we conduct a case study on the pathology images of 188 lung cancer patients from the national lung screening trial the results show that the spatial correlation between tumor and stromal cells predicts patient prognosis this statistical methodology not only presents a new model for characterizing spatial correlations in a multitype spatial point pattern but also provides a new perspective for understanding the role of cellcell interactions in cancer progression
[['with', 'the', 'advance', 'of', 'imaging', 'technology', 'digital', 'pathology', 'imaging', 'of', 'tumor', 'tissue', 'slides', 'is', 'becoming', 'a', 'routine', 'clinical', 'procedure', 'for', 'cancer', 'diagnosis', 'this', 'process', 'produces', 'massive', 'imaging', 'data', 'that', 'capture', 'histological', 'details', 'in', 'high', 'resolution', 'recent', 'developments', 'in', 'deeplearning', 'methods', 'have', 'enabled', 'us', 'to', 'identify', 'and', 'classify', 'individual', 'cells', 'from', 'digital', 'pathology', 'images', 'at', 'large', 'scale', 'the', 'randomly', 'distributed', 'cells', 'can', 'be', 'considered', 'from', 'a', 'marked', 'point', 'process', 'where', 'each', 'point', 'is', 'defined', 'by', 'its', 'position', 'and', 'cell', 'type', 'reliable', 'statistical', 'approaches', 'to', 'model', 'such', 'marked', 'spatial', 'point', 'patterns', 'can', 'provide', 'new', 'insight', 'into', 'tumor', 'progression', 'and', 'shed', 'light', 'on', 'the', 'biological', 'mechanisms', 'of', 'cancer', 'in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'modeling', 'spatial', 'correlations', 'among', 'three', 'commonly', 'seen', 'cells', 'ie', 'lymphocyte', 'stromal', 'and', 'tumor', 'observed', 'in', 'tumor', 'pathology', 'images', 'a', 'novel', 'marking', 'model', 'of', 'marked', 'point', 'processes', 'with', 'interpretable', 'underlying', 'parameters', 'some', 'of', 'which', 'are', 'clinically', 'meaningful', 'is', 'proposed', 'in', 'a', 'bayesian', 'framework', 'we', 'use', 'markov', 'chain', 'monte', 'carlo', 'mcmc', 'sampling', 'techniques', 'combined', 'with', 'the', 'double', 'metropolishastings', 'dmh', 'algorithm', 'to', 'sample', 'from', 'the', 'posterior', 'distribution', 'with', 'an', 'intractable', 'normalizing', 'constant', 'on', 'the', 'benchmark', 'datasets', 'we', 'demonstrate', 'how', 'this', 'modelbased', 'analysis', 'can', 'lead', 'to', 'sharper', 'inferences', 'than', 'ordinary', 'exploratory', 'analyses', 'lastly', 'we', 'conduct', 'a', 'case', 'study', 'on', 'the', 'pathology', 'images', 'of', '188', 'lung', 'cancer', 'patients', 'from', 'the', 'national', 'lung', 'screening', 'trial', 'the', 'results', 'show', 'that', 'the', 'spatial', 'correlation', 'between', 'tumor', 'and', 'stromal', 'cells', 'predicts', 'patient', 'prognosis', 'this', 'statistical', 'methodology', 'not', 'only', 'presents', 'a', 'new', 'model', 'for', 'characterizing', 'spatial', 'correlations', 'in', 'a', 'multitype', 'spatial', 'point', 'pattern', 'but', 'also', 'provides', 'a', 'new', 'perspective', 'for', 'understanding', 'the', 'role', 'of', 'cellcell', 'interactions', 'in', 'cancer', 'progression']]
[-0.005424576831661826, 0.059804104297280204, -0.08955520803732832, 0.10078496686001284, -0.05830677388140055, -0.15921019478542697, 0.07310932738619158, 0.39727556003558945, -0.24287407886175275, -0.2803930547019905, 0.07674249069147182, -0.2814427793577231, -0.21539759165470435, 0.2067494312333806, -0.1321678992051816, 0.031589927829747254, 0.11442274520916673, -0.016546730053853348, 0.016443393161513515, -0.23193098774765317, 0.2588742950589649, 0.03400517932502279, 0.35202633244796955, -0.008079227376369732, 0.10135977918338647, -0.0021610013172903564, -0.08969323524155805, -0.0005724191860816278, -0.12384695715686309, 0.13816991279642987, 0.3203515426704304, 0.20946584194890044, 0.32442116607939275, -0.4508291759633026, -0.2609323017617605, 0.12430036256538347, 0.1912137980980333, 0.1259552532745896, -0.04670606243983938, -0.28344939863360624, 0.05002071360564407, -0.10131434375858482, -0.10506781399582156, -0.08060323728269021, -0.04442804196450572, -0.010530757086187618, -0.2968335433277603, 0.14029296748038392, -0.004486638708519475, 0.1367809635189855, -0.06487579141942072, -0.11504540240789271, 0.008098577281035593, 0.17032718352514647, 0.0342834747825691, 0.04829210260247825, 0.16855839657578411, -0.16349443671146324, -0.1395385446408267, 0.3132029811779777, 0.04574243172288227, -0.1871024515314596, 0.19380455065059804, -0.14450629044714494, -0.14918587101719288, 0.1600886691834175, 0.21509738071129986, 0.09517145400647731, -0.213090049859602, -0.0058702378585568276, 0.01940317764349268, 0.17922371535261097, 0.03371506711675251, -0.040843141032382846, 0.18531344724932056, 0.2721898442387636, -0.013258504396242857, 0.10931718578735052, -0.1827084375262904, -0.07920184380397105, -0.23650766849609414, -0.17283411820501307, -0.11530983461724485, 0.017381438186449112, -0.13396115518603705, -0.2119258641770798, 0.3840256964750177, 0.18827859738956262, 0.17574704531665808, 0.039486383381967353, 0.2808996751315563, 0.00387092908803264, 0.09771952956918326, -0.03661554395769011, 0.1327596167659923, 0.054892648053603756, 0.09402151747010923, -0.20259153341698144, 0.11340803999636966, 0.037407403357279045]
1,802.08309
Tautness for sets of multiples and applications to $\mathcal B$-free dynamics
For any set $\mathcal B\subseteq\mathbb N=\{1,2,\dots\}$ one can define its \emph{set of multiples} $\mathcal M_{\mathcal B}:=\bigcup_{b\in\mathcal B}b\mathbb Z$ and the set of \emph{$\mathcal B$-free numbers} $\mathcal F_{\mathcal B}:=\mathbb Z\setminus\mathcal M_{\mathcal B}$. Tautness of the set $\mathcal B$ is a basic property related to questions around the asymptotic density of $\mathcal M_{\mathcal B}\subseteq\mathbb Z$. From a dynamical systems point of view (originated by Sarnak) one studies $\eta$, the indicator function of $\mathcal F_{\mathcal B}\subseteq\mathbb Z$, its shift-orbit closure $X_\eta\subseteq\{0,1\}^{\mathbb Z}$ and the stationary probability measure $\nu_\eta$ defined on $X_\eta$ by the frequencies of finite blocks in $\eta$. In this paper we prove that tautness implies the following two properties of $\eta$: (1) The measure $\nu_\eta$ has full topological support in $X_\eta$. (2) If $X_\eta$ is proximal, i.e. if the one-point set $\{\dots000\dots\}$ is contained in $X_\eta$ and is the unique minimal subset of $X_\eta$, then $X_\eta$ is hereditary, i.e. if $x\in X_\eta$ and if $w$ is an arbitrary element of $\{0,1\}^{\mathbb Z}$, then also the coordinate-wise product $w\cdot x$ belongs to $X_\eta$. This strengthens two results from [Bartnicka et al. 2015] which need the stronger assumption that $\mathcal B$ has light tails for the same conclusions.
math.DS
for any set mathcal bsubseteqmathbb n12dots one can define its emphset of multiples mathcal m_mathcal bbigcup_binmathcal bbmathbb z and the set of emphmathcal bfree numbers mathcal f_mathcal bmathbb zsetminusmathcal m_mathcal b tautness of the set mathcal b is a basic property related to questions around the asymptotic density of mathcal m_mathcal bsubseteqmathbb z from a dynamical systems point of view originated by sarnak one studies eta the indicator function of mathcal f_mathcal bsubseteqmathbb z its shiftorbit closure x_etasubseteq01mathbb z and the stationary probability measure nu_eta defined on x_eta by the frequencies of finite blocks in eta in this paper we prove that tautness implies the following two properties of eta 1 the measure nu_eta has full topological support in x_eta 2 if x_eta is proximal ie if the onepoint set dots000dots is contained in x_eta and is the unique minimal subset of x_eta then x_eta is hereditary ie if xin x_eta and if w is an arbitrary element of 01mathbb z then also the coordinatewise product wcdot x belongs to x_eta this strengthens two results from bartnicka et al 2015 which need the stronger assumption that mathcal b has light tails for the same conclusions
[['for', 'any', 'set', 'mathcal', 'bsubseteqmathbb', 'n12dots', 'one', 'can', 'define', 'its', 'emphset', 'of', 'multiples', 'mathcal', 'm_mathcal', 'bbigcup_binmathcal', 'bbmathbb', 'z', 'and', 'the', 'set', 'of', 'emphmathcal', 'bfree', 'numbers', 'mathcal', 'f_mathcal', 'bmathbb', 'zsetminusmathcal', 'm_mathcal', 'b', 'tautness', 'of', 'the', 'set', 'mathcal', 'b', 'is', 'a', 'basic', 'property', 'related', 'to', 'questions', 'around', 'the', 'asymptotic', 'density', 'of', 'mathcal', 'm_mathcal', 'bsubseteqmathbb', 'z', 'from', 'a', 'dynamical', 'systems', 'point', 'of', 'view', 'originated', 'by', 'sarnak', 'one', 'studies', 'eta', 'the', 'indicator', 'function', 'of', 'mathcal', 'f_mathcal', 'bsubseteqmathbb', 'z', 'its', 'shiftorbit', 'closure', 'x_etasubseteq01mathbb', 'z', 'and', 'the', 'stationary', 'probability', 'measure', 'nu_eta', 'defined', 'on', 'x_eta', 'by', 'the', 'frequencies', 'of', 'finite', 'blocks', 'in', 'eta', 'in', 'this', 'paper', 'we', 'prove', 'that', 'tautness', 'implies', 'the', 'following', 'two', 'properties', 'of', 'eta', '1', 'the', 'measure', 'nu_eta', 'has', 'full', 'topological', 'support', 'in', 'x_eta', '2', 'if', 'x_eta', 'is', 'proximal', 'ie', 'if', 'the', 'onepoint', 'set', 'dots000dots', 'is', 'contained', 'in', 'x_eta', 'and', 'is', 'the', 'unique', 'minimal', 'subset', 'of', 'x_eta', 'then', 'x_eta', 'is', 'hereditary', 'ie', 'if', 'xin', 'x_eta', 'and', 'if', 'w', 'is', 'an', 'arbitrary', 'element', 'of', '01mathbb', 'z', 'then', 'also', 'the', 'coordinatewise', 'product', 'wcdot', 'x', 'belongs', 'to', 'x_eta', 'this', 'strengthens', 'two', 'results', 'from', 'bartnicka', 'et', 'al', '2015', 'which', 'need', 'the', 'stronger', 'assumption', 'that', 'mathcal', 'b', 'has', 'light', 'tails', 'for', 'the', 'same', 'conclusions']]
[-0.16387304549857495, 0.1135677982833427, -0.06503314988807163, 0.010258693479619083, -0.021862249856286826, -0.16176592731751244, 0.0480688909015165, 0.3058454145448292, -0.3224524678861633, -0.13834890184854282, 0.07182594531129817, -0.3069246379822931, -0.08743851384108159, 0.16971718316354895, -0.09781731554944527, 0.01450807143458449, 0.02638149582457176, 0.08811890935017304, -0.062048407757087025, -0.23854621946014823, 0.34887520461915966, -0.06492326675072552, 0.18885877496129608, 0.022091019406601804, 0.08486002834045632, 0.005313366753631894, 0.0023348921968135983, -0.011154003760075186, -0.19358624499529303, 0.05549947663962363, 0.21116474486593614, 0.1828602512832731, 0.26808116392028286, -0.27141644162708584, -0.1217853325434069, 0.2184799573917121, 0.12546870182244976, -0.08691779580381251, 0.0209989901787706, -0.25864858621791165, 0.21091024934209604, -0.15928837418416764, -0.15845976335638984, -0.008291516530222911, 0.1485202905776746, 0.02120728325161007, -0.3252446533026383, 0.012473034441942987, 0.11366061788263362, 0.05875339923565958, -0.0037333905774064083, -0.12364568001525925, -0.11743628418939636, 0.04434989501328711, -0.00044324306303007715, 0.15927062348218604, 0.08205863858329103, -0.04491905238788157, -0.0846892968884714, 0.35573389901241714, -0.06777136675443221, -0.18404393574163158, 0.1506679786841091, -0.2124448485786399, -0.17555302355119728, 0.1240458581521908, 0.07399323788835084, 0.14088572193196114, -0.07461279283158162, 0.2591220685517425, -0.13211556734893232, 0.12394530668105795, 0.07487309663830434, 0.03625425578339055, 0.12778357622577227, 0.08714142789874962, 0.05644789256060864, 0.06987616658474712, -0.029257324103385527, 0.040925516150231885, -0.35528053015092, -0.18296156157764362, -0.15439277696784307, 0.15612658075390654, -0.09256795444619159, -0.13583964606956206, 0.33467980988702195, 0.07486141080106484, 0.2171720227780366, 0.0672573807747676, 0.18787341478780625, 0.09003008414404766, 0.015868171178897654, 0.10339024792709213, 0.12983229265792326, 0.17565284416024737, -0.03167993862264078, -0.1513312812794976, 0.03378222370271217, 0.17055261369799588]
1,802.0831
Sleep-deprived Fatigue Pattern Analysis using Large-Scale Selfies from Social Med
The complexities of fatigue have drawn much attention from researchers across various disciplines. Short-term fatigue may cause safety issue while driving; thus, dynamic systems were designed to track driver fatigue. Long-term fatigue could lead to chronic syndromes, and eventually affect individuals physical and psychological health. Traditional methodologies of evaluating fatigue not only require sophisticated equipment but also consume enormous time. In this paper, we attempt to develop a novel and efficient method to predict individual's fatigue rate by scrutinizing human facial cues. Our goal is to predict fatigue rate based on a selfie. To associate the fatigue rate with user behaviors, we have collected nearly 1-million timeline posts from 10,480 users on Instagram. We first detect all the faces and identify their demographics using automatic algorithms. Next, we investigate the fatigue distribution by weekday over different age, gender, and ethnic groups. This work represents a promising way to assess sleep-deprived fatigue, and our study provides a viable and efficient computational framework for user fatigue modeling in large-scale via social media.
cs.CV
the complexities of fatigue have drawn much attention from researchers across various disciplines shortterm fatigue may cause safety issue while driving thus dynamic systems were designed to track driver fatigue longterm fatigue could lead to chronic syndromes and eventually affect individuals physical and psychological health traditional methodologies of evaluating fatigue not only require sophisticated equipment but also consume enormous time in this paper we attempt to develop a novel and efficient method to predict individuals fatigue rate by scrutinizing human facial cues our goal is to predict fatigue rate based on a selfie to associate the fatigue rate with user behaviors we have collected nearly 1million timeline posts from 10480 users on instagram we first detect all the faces and identify their demographics using automatic algorithms next we investigate the fatigue distribution by weekday over different age gender and ethnic groups this work represents a promising way to assess sleepdeprived fatigue and our study provides a viable and efficient computational framework for user fatigue modeling in largescale via social media
[['the', 'complexities', 'of', 'fatigue', 'have', 'drawn', 'much', 'attention', 'from', 'researchers', 'across', 'various', 'disciplines', 'shortterm', 'fatigue', 'may', 'cause', 'safety', 'issue', 'while', 'driving', 'thus', 'dynamic', 'systems', 'were', 'designed', 'to', 'track', 'driver', 'fatigue', 'longterm', 'fatigue', 'could', 'lead', 'to', 'chronic', 'syndromes', 'and', 'eventually', 'affect', 'individuals', 'physical', 'and', 'psychological', 'health', 'traditional', 'methodologies', 'of', 'evaluating', 'fatigue', 'not', 'only', 'require', 'sophisticated', 'equipment', 'but', 'also', 'consume', 'enormous', 'time', 'in', 'this', 'paper', 'we', 'attempt', 'to', 'develop', 'a', 'novel', 'and', 'efficient', 'method', 'to', 'predict', 'individuals', 'fatigue', 'rate', 'by', 'scrutinizing', 'human', 'facial', 'cues', 'our', 'goal', 'is', 'to', 'predict', 'fatigue', 'rate', 'based', 'on', 'a', 'selfie', 'to', 'associate', 'the', 'fatigue', 'rate', 'with', 'user', 'behaviors', 'we', 'have', 'collected', 'nearly', '1million', 'timeline', 'posts', 'from', '10480', 'users', 'on', 'instagram', 'we', 'first', 'detect', 'all', 'the', 'faces', 'and', 'identify', 'their', 'demographics', 'using', 'automatic', 'algorithms', 'next', 'we', 'investigate', 'the', 'fatigue', 'distribution', 'by', 'weekday', 'over', 'different', 'age', 'gender', 'and', 'ethnic', 'groups', 'this', 'work', 'represents', 'a', 'promising', 'way', 'to', 'assess', 'sleepdeprived', 'fatigue', 'and', 'our', 'study', 'provides', 'a', 'viable', 'and', 'efficient', 'computational', 'framework', 'for', 'user', 'fatigue', 'modeling', 'in', 'largescale', 'via', 'social', 'media']]
[-0.060469058677999246, 0.06295873717651429, -0.0971451853895012, 0.06784095147877986, -0.1760944898815497, -0.17489415403893765, 0.11314003116738817, 0.45873843790853724, -0.20019940361551777, -0.3446221464108128, 0.08448180451797431, -0.2785653530739878, -0.22056839411585208, 0.1942261600154726, -0.19655412841478692, 0.05080471908235375, 0.05829630633336766, 0.04461116026265218, 0.016965095014208655, -0.2694543591508751, 0.23763763941824437, 0.04792534811970066, 0.35896215672221254, 0.04508325538378866, 0.05314625503532999, -0.025393853700884126, -0.08156460006173481, -0.018377450656364945, -0.11634421429925543, 0.12865326471133706, 0.35022903248147275, 0.19508662905872745, 0.37658617361722624, -0.4824319917544284, -0.2408615599715096, 0.09418370143428226, 0.1122804222847609, 0.07928890353890465, -0.027558103833101033, -0.32003959186498404, 0.12296422548208605, -0.21873126009561342, -0.05537598324008286, -0.06578657621764304, 0.03162474327432659, -0.01777143281069584, -0.23299286474733996, 0.0529457269988009, -0.03330194672624416, 0.17060140536769347, -0.08549801473683842, -0.08781404061489465, 0.03734977970255868, 0.2820395600927227, 0.13595377642195672, -0.009183729644043043, 0.20946967603145716, -0.12195582137552692, -0.1431752676692079, 0.38780724787125914, 0.04695585765875876, -0.1518273414550897, 0.22530522925697047, -0.06521136813646401, -0.12098062653642366, 0.0987493255723487, 0.2979937208816409, 0.05504440333803787, -0.19648969058933505, -0.10442715512609164, 0.07352026775479317, 0.19185233455260886, 0.0524328119614545, -0.025535128342316433, 0.2059761788148214, 0.2156707474797526, 0.011539555201649338, 0.09775768231381388, -0.06864102704943541, -0.008797089499421418, -0.1813475125171381, -0.14792122190599055, -0.0868579015663058, 0.056320453792731685, -0.08850918254645555, -0.1427786269115613, 0.42435278826776673, 0.22864950617830104, 0.09467570378499872, 0.08540861503039623, 0.292908318744808, 0.002872479544021189, 0.09003062951515484, 0.051886173929361734, 0.17068599468946238, -0.019297349169466863, 0.16572891308528864, -0.22564165169537506, 0.24723076557822746, -0.02017148412517546]
1,802.08311
Structured Control Nets for Deep Reinforcement Learning
In recent years, Deep Reinforcement Learning has made impressive advances in solving several important benchmark problems for sequential decision making. Many control applications use a generic multilayer perceptron (MLP) for non-vision parts of the policy network. In this work, we propose a new neural network architecture for the policy network representation that is simple yet effective. The proposed Structured Control Net (SCN) splits the generic MLP into two separate sub-modules: a nonlinear control module and a linear control module. Intuitively, the nonlinear control is for forward-looking and global control, while the linear control stabilizes the local dynamics around the residual of global control. We hypothesize that this will bring together the benefits of both linear and nonlinear policies: improve training sample efficiency, final episodic reward, and generalization of learned policy, while requiring a smaller network and being generally applicable to different training methods. We validated our hypothesis with competitive results on simulations from OpenAI MuJoCo, Roboschool, Atari, and a custom 2D urban driving environment, with various ablation and generalization tests, trained with multiple black-box and policy gradient training methods. The proposed architecture has the potential to improve upon broader control tasks by incorporating problem specific priors into the architecture. As a case study, we demonstrate much improved performance for locomotion tasks by emulating the biological central pattern generators (CPGs) as the nonlinear part of the architecture.
cs.LG cs.AI cs.RO
in recent years deep reinforcement learning has made impressive advances in solving several important benchmark problems for sequential decision making many control applications use a generic multilayer perceptron mlp for nonvision parts of the policy network in this work we propose a new neural network architecture for the policy network representation that is simple yet effective the proposed structured control net scn splits the generic mlp into two separate submodules a nonlinear control module and a linear control module intuitively the nonlinear control is for forwardlooking and global control while the linear control stabilizes the local dynamics around the residual of global control we hypothesize that this will bring together the benefits of both linear and nonlinear policies improve training sample efficiency final episodic reward and generalization of learned policy while requiring a smaller network and being generally applicable to different training methods we validated our hypothesis with competitive results on simulations from openai mujoco roboschool atari and a custom 2d urban driving environment with various ablation and generalization tests trained with multiple blackbox and policy gradient training methods the proposed architecture has the potential to improve upon broader control tasks by incorporating problem specific priors into the architecture as a case study we demonstrate much improved performance for locomotion tasks by emulating the biological central pattern generators cpgs as the nonlinear part of the architecture
[['in', 'recent', 'years', 'deep', 'reinforcement', 'learning', 'has', 'made', 'impressive', 'advances', 'in', 'solving', 'several', 'important', 'benchmark', 'problems', 'for', 'sequential', 'decision', 'making', 'many', 'control', 'applications', 'use', 'a', 'generic', 'multilayer', 'perceptron', 'mlp', 'for', 'nonvision', 'parts', 'of', 'the', 'policy', 'network', 'in', 'this', 'work', 'we', 'propose', 'a', 'new', 'neural', 'network', 'architecture', 'for', 'the', 'policy', 'network', 'representation', 'that', 'is', 'simple', 'yet', 'effective', 'the', 'proposed', 'structured', 'control', 'net', 'scn', 'splits', 'the', 'generic', 'mlp', 'into', 'two', 'separate', 'submodules', 'a', 'nonlinear', 'control', 'module', 'and', 'a', 'linear', 'control', 'module', 'intuitively', 'the', 'nonlinear', 'control', 'is', 'for', 'forwardlooking', 'and', 'global', 'control', 'while', 'the', 'linear', 'control', 'stabilizes', 'the', 'local', 'dynamics', 'around', 'the', 'residual', 'of', 'global', 'control', 'we', 'hypothesize', 'that', 'this', 'will', 'bring', 'together', 'the', 'benefits', 'of', 'both', 'linear', 'and', 'nonlinear', 'policies', 'improve', 'training', 'sample', 'efficiency', 'final', 'episodic', 'reward', 'and', 'generalization', 'of', 'learned', 'policy', 'while', 'requiring', 'a', 'smaller', 'network', 'and', 'being', 'generally', 'applicable', 'to', 'different', 'training', 'methods', 'we', 'validated', 'our', 'hypothesis', 'with', 'competitive', 'results', 'on', 'simulations', 'from', 'openai', 'mujoco', 'roboschool', 'atari', 'and', 'a', 'custom', '2d', 'urban', 'driving', 'environment', 'with', 'various', 'ablation', 'and', 'generalization', 'tests', 'trained', 'with', 'multiple', 'blackbox', 'and', 'policy', 'gradient', 'training', 'methods', 'the', 'proposed', 'architecture', 'has', 'the', 'potential', 'to', 'improve', 'upon', 'broader', 'control', 'tasks', 'by', 'incorporating', 'problem', 'specific', 'priors', 'into', 'the', 'architecture', 'as', 'a', 'case', 'study', 'we', 'demonstrate', 'much', 'improved', 'performance', 'for', 'locomotion', 'tasks', 'by', 'emulating', 'the', 'biological', 'central', 'pattern', 'generators', 'cpgs', 'as', 'the', 'nonlinear', 'part', 'of', 'the', 'architecture']]
[-0.05643557813371964, -0.0018327805269759015, -0.05569913039531522, 0.036481440062613855, -0.11967362189482499, -0.2012978690555818, 0.03993364448043784, 0.44509529620492166, -0.29803649166257984, -0.30593479361518156, 0.09549247348903529, -0.1994549588312761, -0.22666538448850457, 0.23456583979506312, -0.1138183791148809, 0.1272884714994039, 0.11825701402787152, -0.004074067959403952, -0.045910970212259726, -0.2770706653869378, 0.28860492807039656, 0.0528898432976348, 0.3472528596155046, -0.022769790107434216, 0.1744440239854157, 0.0007356258603457329, 0.009693603888600981, 0.0005881013379881292, -0.0338713393953185, 0.1578204355469747, 0.30034032847366426, 0.17081880136434588, 0.39116733346600085, -0.43890037431560813, -0.2590670901881822, 0.07775445095778975, 0.1301706991260809, 0.0860366182459984, -0.06034322056023354, -0.3070399783594309, 0.08086942973646469, -0.19583225791471445, -0.017211779075296363, -0.13058524915634603, -0.037985406760916315, 0.005723006822725958, -0.32676695792335003, -0.013240409460585007, 0.08143876174913853, 0.05975672349930911, -0.08745433760798603, -0.12281612850035474, 0.001204881659629921, 0.15689509804620425, -0.005347685348429617, 0.04377727182873059, 0.1915342637865771, -0.19421809240884613, -0.17941850390863173, 0.3294122943188995, -0.04448462189014078, -0.20948746215539618, 0.2032617864408946, -0.005685043947388684, -0.1445069880605193, 0.0877193210783714, 0.28168925613447626, 0.09723888497891105, -0.16890254545225097, 0.02627537546712639, -0.051532185382321974, 0.1641654282746978, 0.004241907507613567, -0.02510094982634265, 0.15165896079218197, 0.31079762839674785, 0.08942077937094187, 0.16218347464018734, -0.05905517423681366, -0.13312109501826594, -0.21178542080373777, -0.09950139449626606, -0.13002974140441179, -0.02189312660734036, -0.12111990414840486, -0.11115519374457758, 0.42461654440765934, 0.18159468994632075, 0.17803744158300105, 0.12878417222964345, 0.3590792963680412, 0.06552170328515265, 0.1251454832942857, 0.09522153825050086, 0.2174716430308763, 0.047104963571265604, 0.13799563459386782, -0.2103004791580523, 0.09417881557757417, 0.03004611350895305]
1,802.08312
Eliciting Expertise without Verification
A central question of crowd-sourcing is how to elicit expertise from agents. This is even more difficult when answers cannot be directly verified. A key challenge is that sophisticated agents may strategically withhold effort or information when they believe their payoff will be based upon comparison with other agents whose reports will likely omit this information due to lack of effort or expertise. Our work defines a natural model for this setting based on the assumption that \emph{more sophisticated agents know the beliefs of less sophisticated agents}. We then provide a mechanism design framework for this setting. From this framework, we design several novel mechanisms, for both the single and multiple question settings, that (1) encourage agents to invest effort and provide their information honestly; (2) output a correct "hierarchy" of the information when agents are rational.
cs.GT
a central question of crowdsourcing is how to elicit expertise from agents this is even more difficult when answers cannot be directly verified a key challenge is that sophisticated agents may strategically withhold effort or information when they believe their payoff will be based upon comparison with other agents whose reports will likely omit this information due to lack of effort or expertise our work defines a natural model for this setting based on the assumption that emphmore sophisticated agents know the beliefs of less sophisticated agents we then provide a mechanism design framework for this setting from this framework we design several novel mechanisms for both the single and multiple question settings that 1 encourage agents to invest effort and provide their information honestly 2 output a correct hierarchy of the information when agents are rational
[['a', 'central', 'question', 'of', 'crowdsourcing', 'is', 'how', 'to', 'elicit', 'expertise', 'from', 'agents', 'this', 'is', 'even', 'more', 'difficult', 'when', 'answers', 'can', 'not', 'be', 'directly', 'verified', 'a', 'key', 'challenge', 'is', 'that', 'sophisticated', 'agents', 'may', 'strategically', 'withhold', 'effort', 'or', 'information', 'when', 'they', 'believe', 'their', 'payoff', 'will', 'be', 'based', 'upon', 'comparison', 'with', 'other', 'agents', 'whose', 'reports', 'will', 'likely', 'omit', 'this', 'information', 'due', 'to', 'lack', 'of', 'effort', 'or', 'expertise', 'our', 'work', 'defines', 'a', 'natural', 'model', 'for', 'this', 'setting', 'based', 'on', 'the', 'assumption', 'that', 'emphmore', 'sophisticated', 'agents', 'know', 'the', 'beliefs', 'of', 'less', 'sophisticated', 'agents', 'we', 'then', 'provide', 'a', 'mechanism', 'design', 'framework', 'for', 'this', 'setting', 'from', 'this', 'framework', 'we', 'design', 'several', 'novel', 'mechanisms', 'for', 'both', 'the', 'single', 'and', 'multiple', 'question', 'settings', 'that', '1', 'encourage', 'agents', 'to', 'invest', 'effort', 'and', 'provide', 'their', 'information', 'honestly', '2', 'output', 'a', 'correct', 'hierarchy', 'of', 'the', 'information', 'when', 'agents', 'are', 'rational']]
[-0.060165502738554276, 0.06865382650663165, -0.09825393763867064, 0.10339378286662926, -0.20334592957158376, -0.20169520916172515, 0.11286559267000153, 0.4323219704258181, -0.2741976054330071, -0.34489773009244323, 0.11359071458968585, -0.25148894553528217, -0.18458085694438675, 0.14568134517762402, -0.1536953077196096, 0.008855219062818826, 0.08362047350455593, 0.06231118136733077, 0.032439646412224174, -0.3180903004733914, 0.35147933849561824, 0.06339082222798989, 0.2602635654382897, 0.040056081470034095, 0.0646944960314155, 0.0066933572673864225, -0.027386233132386948, -0.01802729364878831, -0.10286569642152656, 0.18206620439895543, 0.34776555182561825, 0.2048555020426475, 0.4373878507065947, -0.48600072463987953, -0.1716456781651308, 0.1364414800964568, 0.1219166623951908, 0.12825845899808147, -0.01660691978663536, -0.2703423313558591, 0.08087153249525594, -0.18408501093840077, -0.06712972680718576, -0.11058886010662047, -0.036989739168109034, -0.019902655624327366, -0.3022844855143369, -0.04492539621636367, 0.09795814308331069, 0.05467430795508906, -0.02109869228281679, -0.080723824409044, 0.026104169940222462, 0.2059683252113657, 0.04115638952705683, 0.021888571710200016, 0.15506803988050805, -0.15528252884494073, -0.16042264585933871, 0.39643310567867146, 0.03502390844013243, -0.238427742425162, 0.19751013850412555, -0.08363152138317806, -0.14509030120076788, 0.09158079731991908, 0.2011073144835957, 0.11484361783920849, -0.17818712989999794, -0.0019463348435238004, -0.06099743366132687, 0.24110285884931848, -0.0012623158140774192, 0.03140904840394637, 0.22771773560747613, 0.1601967543625293, 0.1125601958109569, 0.04951285570052649, 0.056296677090929496, -0.09955862499892466, -0.2241062534175113, -0.11933815549807555, -0.15391019193700303, 0.05457810488247812, -0.024990914440263457, -0.08689213018816808, 0.321952040383701, 0.2191695383398107, 0.16588761485487657, 0.08455325888442623, 0.34689127936632963, 0.042721449779040674, 0.04193902237639919, 0.07211746523890944, 0.19871484020718094, -0.022982947557253667, 0.10757071505484246, -0.1361059786065271, 0.17811780648958617, -0.02597713453464047]
1,802.08313
Deep Learning and AdS/CFT
We present a deep neural network representation of the AdS/CFT correspondence, and demonstrate the emergence of the bulk metric function via the learning process for given data sets of response in boundary quantum field theories. The emergent radial direction of the bulk is identified with the depth of the layers, and the network itself is interpreted as a bulk geometry. Our network provides a data-driven holographic modeling of strongly coupled systems. With a scalar $\phi^4$ theory with unknown mass and coupling, in unknown curved spacetime with a black hole horizon, we demonstrate our deep learning (DL) framework can determine them which fit given response data. First, we show that, from boundary data generated by the AdS Schwarzschild spacetime, our network can reproduce the metric. Second, we demonstrate that our network with experimental data as an input can determine the bulk metric, the mass and the quadratic coupling of the holographic model. As an example we use the experimental data of magnetic response of a strongly correlated material Sm$_{0.6}$Sr$_{0.4}$MnO$_3$. This AdS/DL correspondence not only enables gravity modeling of strongly correlated systems, but also sheds light on a hidden mechanism of the emerging space in both AdS and DL.
hep-th
we present a deep neural network representation of the adscft correspondence and demonstrate the emergence of the bulk metric function via the learning process for given data sets of response in boundary quantum field theories the emergent radial direction of the bulk is identified with the depth of the layers and the network itself is interpreted as a bulk geometry our network provides a datadriven holographic modeling of strongly coupled systems with a scalar phi4 theory with unknown mass and coupling in unknown curved spacetime with a black hole horizon we demonstrate our deep learning dl framework can determine them which fit given response data first we show that from boundary data generated by the ads schwarzschild spacetime our network can reproduce the metric second we demonstrate that our network with experimental data as an input can determine the bulk metric the mass and the quadratic coupling of the holographic model as an example we use the experimental data of magnetic response of a strongly correlated material sm_06sr_04mno_3 this adsdl correspondence not only enables gravity modeling of strongly correlated systems but also sheds light on a hidden mechanism of the emerging space in both ads and dl
[['we', 'present', 'a', 'deep', 'neural', 'network', 'representation', 'of', 'the', 'adscft', 'correspondence', 'and', 'demonstrate', 'the', 'emergence', 'of', 'the', 'bulk', 'metric', 'function', 'via', 'the', 'learning', 'process', 'for', 'given', 'data', 'sets', 'of', 'response', 'in', 'boundary', 'quantum', 'field', 'theories', 'the', 'emergent', 'radial', 'direction', 'of', 'the', 'bulk', 'is', 'identified', 'with', 'the', 'depth', 'of', 'the', 'layers', 'and', 'the', 'network', 'itself', 'is', 'interpreted', 'as', 'a', 'bulk', 'geometry', 'our', 'network', 'provides', 'a', 'datadriven', 'holographic', 'modeling', 'of', 'strongly', 'coupled', 'systems', 'with', 'a', 'scalar', 'phi4', 'theory', 'with', 'unknown', 'mass', 'and', 'coupling', 'in', 'unknown', 'curved', 'spacetime', 'with', 'a', 'black', 'hole', 'horizon', 'we', 'demonstrate', 'our', 'deep', 'learning', 'dl', 'framework', 'can', 'determine', 'them', 'which', 'fit', 'given', 'response', 'data', 'first', 'we', 'show', 'that', 'from', 'boundary', 'data', 'generated', 'by', 'the', 'ads', 'schwarzschild', 'spacetime', 'our', 'network', 'can', 'reproduce', 'the', 'metric', 'second', 'we', 'demonstrate', 'that', 'our', 'network', 'with', 'experimental', 'data', 'as', 'an', 'input', 'can', 'determine', 'the', 'bulk', 'metric', 'the', 'mass', 'and', 'the', 'quadratic', 'coupling', 'of', 'the', 'holographic', 'model', 'as', 'an', 'example', 'we', 'use', 'the', 'experimental', 'data', 'of', 'magnetic', 'response', 'of', 'a', 'strongly', 'correlated', 'material', 'sm_06sr_04mno_3', 'this', 'adsdl', 'correspondence', 'not', 'only', 'enables', 'gravity', 'modeling', 'of', 'strongly', 'correlated', 'systems', 'but', 'also', 'sheds', 'light', 'on', 'a', 'hidden', 'mechanism', 'of', 'the', 'emerging', 'space', 'in', 'both', 'ads', 'and', 'dl']]
[-0.12637882446512005, 0.0936951440903776, -0.08927396965595201, 0.05495633859257699, -0.10004457742548906, -0.14396109357237433, 0.009226378418194752, 0.3574087351751633, -0.262872141914872, -0.2989971197831134, 0.06535240028543063, -0.2780072296802432, -0.20814388078888907, 0.16268005679266, -0.0477987518438544, 0.056031186324663654, 0.03376230905071283, 0.06164951126735944, -0.07877313294089758, -0.21298908461840488, 0.3781467497611466, 0.045164065482393385, 0.3180447863605924, 0.04566127076410712, 0.11450560442351092, 0.012884212856013806, -0.003890336935336773, 0.04426947866897815, -0.10007852352954125, 0.15062550059400306, 0.22540470242906266, 0.1297444886718996, 0.2089310374493018, -0.4291095783122075, -0.28872908496608335, 0.04270938621021998, 0.13727926765687956, 0.1215527168325841, -0.05818400745315907, -0.30079335577977007, 0.028102022801669173, -0.1605173124239231, -0.09523341916023921, -0.09788048393212449, -0.029819177356787407, -0.05056893843202255, -0.27095078797533345, 0.05920802062505689, 0.032279785703390074, 0.010465532609930214, -0.11088718575043365, -0.02603342795971399, -0.06473751608998729, 0.10840743232804995, 0.06551490046057062, 0.07890066697429388, 0.13621515453530428, -0.16428287300902109, -0.11609425934521148, 0.34706350018580756, -0.096832591003607, -0.19438837230778658, 0.181783638186514, -0.1365732317814269, -0.07982478980452587, 0.06188176139138448, 0.20353573369912994, 0.14845757371244522, -0.15381649776529044, 0.10055861520097376, -0.06294571744421354, 0.1816751279032383, -0.007317982523296124, 0.04130644491658761, 0.2575685466424777, 0.20386490168360372, 0.0038605535904375405, 0.16391550787270834, -0.09359233694834611, -0.07408510134197198, -0.33088668178384884, -0.14082726516569846, -0.19885728961000076, 0.025759346561748175, -0.16739470422236571, -0.18486772721203473, 0.38594095047611077, 0.16225660040926856, 0.22430533886192092, 0.06654222414960177, 0.25892548641333213, 0.09355492652334177, 0.07636125238660055, 0.09775702397410686, 0.2753747900183766, 0.10676894367266541, 0.12705422318062912, -0.2359768916215473, 0.009316587138873263, 0.03965633107253756]
1,802.08314
High Order Recurrent Neural Networks for Acoustic Modelling
Vanishing long-term gradients are a major issue in training standard recurrent neural networks (RNNs), which can be alleviated by long short-term memory (LSTM) models with memory cells. However, the extra parameters associated with the memory cells mean an LSTM layer has four times as many parameters as an RNN with the same hidden vector size. This paper addresses the vanishing gradient problem using a high order RNN (HORNN) which has additional connections from multiple previous time steps. Speech recognition experiments using British English multi-genre broadcast (MGB3) data showed that the proposed HORNN architectures for rectified linear unit and sigmoid activation functions reduced word error rates (WER) by 4.2% and 6.3% over the corresponding RNNs, and gave similar WERs to a (projected) LSTM while using only 20%--50% of the recurrent layer parameters and computation.
cs.CL cs.AI eess.AS stat.ML
vanishing longterm gradients are a major issue in training standard recurrent neural networks rnns which can be alleviated by long shortterm memory lstm models with memory cells however the extra parameters associated with the memory cells mean an lstm layer has four times as many parameters as an rnn with the same hidden vector size this paper addresses the vanishing gradient problem using a high order rnn hornn which has additional connections from multiple previous time steps speech recognition experiments using british english multigenre broadcast mgb3 data showed that the proposed hornn architectures for rectified linear unit and sigmoid activation functions reduced word error rates wer by 42 and 63 over the corresponding rnns and gave similar wers to a projected lstm while using only 2050 of the recurrent layer parameters and computation
[['vanishing', 'longterm', 'gradients', 'are', 'a', 'major', 'issue', 'in', 'training', 'standard', 'recurrent', 'neural', 'networks', 'rnns', 'which', 'can', 'be', 'alleviated', 'by', 'long', 'shortterm', 'memory', 'lstm', 'models', 'with', 'memory', 'cells', 'however', 'the', 'extra', 'parameters', 'associated', 'with', 'the', 'memory', 'cells', 'mean', 'an', 'lstm', 'layer', 'has', 'four', 'times', 'as', 'many', 'parameters', 'as', 'an', 'rnn', 'with', 'the', 'same', 'hidden', 'vector', 'size', 'this', 'paper', 'addresses', 'the', 'vanishing', 'gradient', 'problem', 'using', 'a', 'high', 'order', 'rnn', 'hornn', 'which', 'has', 'additional', 'connections', 'from', 'multiple', 'previous', 'time', 'steps', 'speech', 'recognition', 'experiments', 'using', 'british', 'english', 'multigenre', 'broadcast', 'mgb3', 'data', 'showed', 'that', 'the', 'proposed', 'hornn', 'architectures', 'for', 'rectified', 'linear', 'unit', 'and', 'sigmoid', 'activation', 'functions', 'reduced', 'word', 'error', 'rates', 'wer', 'by', '42', 'and', '63', 'over', 'the', 'corresponding', 'rnns', 'and', 'gave', 'similar', 'wers', 'to', 'a', 'projected', 'lstm', 'while', 'using', 'only', '2050', 'of', 'the', 'recurrent', 'layer', 'parameters', 'and', 'computation']]
[-0.0967097513979875, 0.07751151741612737, 0.04544716130213854, 0.06206959255890487, -0.06398551694740702, -0.2189660815178956, 0.06927873339255418, 0.446638221649411, -0.3187835957098724, -0.315120312415459, 0.10630803411262796, -0.25069631789495844, -0.1932014664241176, 0.16907700269983703, -0.12118491877716812, 0.10538160057888976, 0.1476075952116372, 0.07065087618022681, -0.06324047674915116, -0.3329550214742023, 0.19753531379891293, 0.08930641243976534, 0.3058924079921685, -0.05737269387491392, 0.18295559279456092, -0.07491520952601406, -0.015018185590134752, -0.07412488964785423, 0.0004451824349409873, 0.12833331850851024, 0.2405047455160142, 0.09059926990290082, 0.3504014818936138, -0.4812721994292355, -0.2898017458313082, 0.08502187445773778, 0.1453059452946501, 0.05367757476992289, 0.03374748671413364, -0.28897509085630674, 0.11353646562595789, -0.19229082337447576, 0.06679588490510639, -0.07291302986835178, 0.026748601000587967, 0.026443165349266388, -0.26878213246976185, 0.08274267226391073, 0.10848604804745182, 0.06985749482156191, -0.06981455492857087, -0.16193389102617012, -0.005941504469890624, 0.14702916936029828, 0.07034988227979581, 0.11989400531620459, 0.10086247812137288, -0.16732146105855086, -0.1643745806873461, 0.2778785385723625, -0.1279256756748318, -0.21483707764094934, 0.14858503848370305, 0.0062467179574506515, -0.11075762909363528, 0.08013522189243563, 0.22394504858867118, 0.04282034905382285, -0.1906499018861135, 0.027638763793274984, -0.04714516690351013, 0.23831433797941395, 0.11839123926111463, 0.0007760746884194756, 0.15082986015980518, 0.2591410088387871, -0.035094690495573296, 0.1154726566738078, -0.16612006896184198, -0.09724470316187332, -0.19827882167961994, -0.08485571621335987, -0.13814572366724784, 0.029329159186760847, -0.1477884378356866, -0.13336733881300106, 0.42444505282026485, 0.1356962090323126, 0.23750799938448167, 0.18071368042750746, 0.3051270073265734, 0.06668701032141602, 0.22676104761281968, 0.13942829537016332, 0.13734262627707025, 0.0703711958244947, 0.17344307207416645, -0.17382760371319614, 0.12268372263787385, 0.07486567658431743]
1,802.08315
Probing the loss origins of ultra-smooth $\mathrm{Si_3N_4}$ integrated photonic waveguides
On-chip optical waveguides with low propagation losses and precisely engineered group velocity dispersion (GVD) are important to nonlinear photonic devices such as soliton microcombs. Yet, despite intensive research efforts, nonlinear integrated photonic platforms still feature propagation losses orders of magnitude higher than in standard optical fiber. The tight confinement and high index contrast of integrated waveguides make them highly susceptible to fabrication induced surface roughness. Therefore, microresonators with ultra-high Q factors are, to date, only attainable in polished bulk crystalline, or chemically etched silica based devices, that pose however challenges for full photonic integration. Here, we demonstrate the fabrication of silicon nitride ($\mathrm{Si_3N_4}$) waveguides with unprecedentedly smooth sidewalls and tight confinement with record low propagation losses. This is achieved by combining the photonic Damascene process with a novel reflow process, which reduces etching roughness, while sufficiently preserving dimensional accuracy. This leads to previously unattainable \emph{mean} microresonator Q factors larger than $5\times10^6$ for tightly confining waveguides with anomalous dispersion. Via systematic process step variation and two independent characterization techniques we differentiate the scattering and absorption loss contributions, and reveal metal impurity related absorption to be an important loss origin. Although such impurities are known to limit optical fibers, this is the first time they are identified, and play a tangible role, in absorption of integrated microresonators. Taken together, our work provides new insights in the origins of propagation losses in $\mathrm{Si_3N_4}$ waveguides and provides the technological basis for integrated nonlinear photonics in the ultra-high Q regime.
physics.app-ph physics.optics
onchip optical waveguides with low propagation losses and precisely engineered group velocity dispersion gvd are important to nonlinear photonic devices such as soliton microcombs yet despite intensive research efforts nonlinear integrated photonic platforms still feature propagation losses orders of magnitude higher than in standard optical fiber the tight confinement and high index contrast of integrated waveguides make them highly susceptible to fabrication induced surface roughness therefore microresonators with ultrahigh q factors are to date only attainable in polished bulk crystalline or chemically etched silica based devices that pose however challenges for full photonic integration here we demonstrate the fabrication of silicon nitride mathrmsi_3n_4 waveguides with unprecedentedly smooth sidewalls and tight confinement with record low propagation losses this is achieved by combining the photonic damascene process with a novel reflow process which reduces etching roughness while sufficiently preserving dimensional accuracy this leads to previously unattainable emphmean microresonator q factors larger than 5times106 for tightly confining waveguides with anomalous dispersion via systematic process step variation and two independent characterization techniques we differentiate the scattering and absorption loss contributions and reveal metal impurity related absorption to be an important loss origin although such impurities are known to limit optical fibers this is the first time they are identified and play a tangible role in absorption of integrated microresonators taken together our work provides new insights in the origins of propagation losses in mathrmsi_3n_4 waveguides and provides the technological basis for integrated nonlinear photonics in the ultrahigh q regime
[['onchip', 'optical', 'waveguides', 'with', 'low', 'propagation', 'losses', 'and', 'precisely', 'engineered', 'group', 'velocity', 'dispersion', 'gvd', 'are', 'important', 'to', 'nonlinear', 'photonic', 'devices', 'such', 'as', 'soliton', 'microcombs', 'yet', 'despite', 'intensive', 'research', 'efforts', 'nonlinear', 'integrated', 'photonic', 'platforms', 'still', 'feature', 'propagation', 'losses', 'orders', 'of', 'magnitude', 'higher', 'than', 'in', 'standard', 'optical', 'fiber', 'the', 'tight', 'confinement', 'and', 'high', 'index', 'contrast', 'of', 'integrated', 'waveguides', 'make', 'them', 'highly', 'susceptible', 'to', 'fabrication', 'induced', 'surface', 'roughness', 'therefore', 'microresonators', 'with', 'ultrahigh', 'q', 'factors', 'are', 'to', 'date', 'only', 'attainable', 'in', 'polished', 'bulk', 'crystalline', 'or', 'chemically', 'etched', 'silica', 'based', 'devices', 'that', 'pose', 'however', 'challenges', 'for', 'full', 'photonic', 'integration', 'here', 'we', 'demonstrate', 'the', 'fabrication', 'of', 'silicon', 'nitride', 'mathrmsi_3n_4', 'waveguides', 'with', 'unprecedentedly', 'smooth', 'sidewalls', 'and', 'tight', 'confinement', 'with', 'record', 'low', 'propagation', 'losses', 'this', 'is', 'achieved', 'by', 'combining', 'the', 'photonic', 'damascene', 'process', 'with', 'a', 'novel', 'reflow', 'process', 'which', 'reduces', 'etching', 'roughness', 'while', 'sufficiently', 'preserving', 'dimensional', 'accuracy', 'this', 'leads', 'to', 'previously', 'unattainable', 'emphmean', 'microresonator', 'q', 'factors', 'larger', 'than', '5times106', 'for', 'tightly', 'confining', 'waveguides', 'with', 'anomalous', 'dispersion', 'via', 'systematic', 'process', 'step', 'variation', 'and', 'two', 'independent', 'characterization', 'techniques', 'we', 'differentiate', 'the', 'scattering', 'and', 'absorption', 'loss', 'contributions', 'and', 'reveal', 'metal', 'impurity', 'related', 'absorption', 'to', 'be', 'an', 'important', 'loss', 'origin', 'although', 'such', 'impurities', 'are', 'known', 'to', 'limit', 'optical', 'fibers', 'this', 'is', 'the', 'first', 'time', 'they', 'are', 'identified', 'and', 'play', 'a', 'tangible', 'role', 'in', 'absorption', 'of', 'integrated', 'microresonators', 'taken', 'together', 'our', 'work', 'provides', 'new', 'insights', 'in', 'the', 'origins', 'of', 'propagation', 'losses', 'in', 'mathrmsi_3n_4', 'waveguides', 'and', 'provides', 'the', 'technological', 'basis', 'for', 'integrated', 'nonlinear', 'photonics', 'in', 'the', 'ultrahigh', 'q', 'regime']]
[-0.1166896735184959, 0.1644238363329573, -0.016824995789068695, -0.020791743980010564, -0.08075661472406011, -0.19559115342871874, 0.013056465986954542, 0.52643785244044, -0.22610926521865993, -0.2963842842081676, 0.06327669995038637, -0.30310695301741364, -0.13715690643412573, 0.2412342984713994, -0.03936270552839399, 0.1236609666969399, 0.03736532503187808, -0.13586375323048203, -0.019772879519423813, -0.19969660888805543, 0.23789048033329296, 0.05729638436353024, 0.3668273537153644, 0.08859441009331115, 0.1037915541505327, -0.02439098509256633, 0.0160990924061257, -0.03743094092101923, -0.12154144036446399, 0.1794461300646487, 0.2703137963278485, -0.07399148277024269, 0.2560745775528556, -0.4635561237833938, -0.25997256506804606, 0.04158586502616883, 0.19264884933601228, 0.11004501724074005, -0.09920078973494927, -0.2523962630690741, 0.028252195224774127, -0.11449165815126379, -0.1558066366001612, -0.05844524964994314, 0.006928168345546844, -0.026368197396502126, -0.21049445157832636, 0.047762751893843616, 0.041135486482395504, 0.04877045288948076, -0.015834077082370047, -0.08254718964121172, -0.033117935781804275, 0.05389375740061802, -0.04205036329673318, -0.021986612268338663, 0.18769438361597, -0.13358310694958925, -0.1120674265387031, 0.38799302026591437, -0.06080970747867951, -0.13167109227815302, 0.17170222299078441, -0.14253402872068086, -0.013732041876967426, 0.18162178256149802, 0.22337789403426708, 0.04242278907830561, -0.1363739903027914, 0.011420722631024843, 0.07994311429674224, 0.1908523058632807, 0.1292236820309974, 0.1749615327566767, 0.202127991293614, 0.23975127388114983, 0.036460217280427414, 0.11727517422203126, -0.05793206776998348, 0.031057924539687073, -0.2437704171272641, -0.1704644059626937, -0.14394147958302375, 0.06863370138869089, -0.11500942078846678, -0.18937315523092235, 0.3278674585972818, 0.13256113269076475, 0.16471880049710827, -0.024953569650022808, 0.31114913269269223, 0.13298301353993616, 0.13738175477566464, 0.03920378075076305, 0.320250219949141, 0.1544240579987895, 0.0762216513396754, -0.2105760347758591, 0.04139622619461116, -0.04200380439394895]
1,802.08316
Platonic crystal with low-frequency locally resonant snail structures. Wave trapping, transmission amplification and shielding
We propose a new type of platonic crystal. The proposed microstructured plate includes snail resonators with low-frequency resonant vibrations. The particular dynamic effect of the resonators are highlighted by a comparative analysis of dispersion properties of homo- geneous and perforated plates. Analytical and numerical estimates of classes of standing waves are given and the analysis on a macrocell shows the possibility to obtain localization, wave trapping and edge waves. Applications include transmission amplification within two plates separated by a small ligament. Finally we proposed a design procedure to suppress low frequency flexural vibration in an elongated plate implementing a by-pass system re- routing waves within the mechanical system.
physics.class-ph
we propose a new type of platonic crystal the proposed microstructured plate includes snail resonators with lowfrequency resonant vibrations the particular dynamic effect of the resonators are highlighted by a comparative analysis of dispersion properties of homo geneous and perforated plates analytical and numerical estimates of classes of standing waves are given and the analysis on a macrocell shows the possibility to obtain localization wave trapping and edge waves applications include transmission amplification within two plates separated by a small ligament finally we proposed a design procedure to suppress low frequency flexural vibration in an elongated plate implementing a bypass system re routing waves within the mechanical system
[['we', 'propose', 'a', 'new', 'type', 'of', 'platonic', 'crystal', 'the', 'proposed', 'microstructured', 'plate', 'includes', 'snail', 'resonators', 'with', 'lowfrequency', 'resonant', 'vibrations', 'the', 'particular', 'dynamic', 'effect', 'of', 'the', 'resonators', 'are', 'highlighted', 'by', 'a', 'comparative', 'analysis', 'of', 'dispersion', 'properties', 'of', 'homo', 'geneous', 'and', 'perforated', 'plates', 'analytical', 'and', 'numerical', 'estimates', 'of', 'classes', 'of', 'standing', 'waves', 'are', 'given', 'and', 'the', 'analysis', 'on', 'a', 'macrocell', 'shows', 'the', 'possibility', 'to', 'obtain', 'localization', 'wave', 'trapping', 'and', 'edge', 'waves', 'applications', 'include', 'transmission', 'amplification', 'within', 'two', 'plates', 'separated', 'by', 'a', 'small', 'ligament', 'finally', 'we', 'proposed', 'a', 'design', 'procedure', 'to', 'suppress', 'low', 'frequency', 'flexural', 'vibration', 'in', 'an', 'elongated', 'plate', 'implementing', 'a', 'bypass', 'system', 're', 'routing', 'waves', 'within', 'the', 'mechanical', 'system']]
[-0.22231318085148274, 0.12177459598657421, -0.024133493957816863, -0.024857522040730582, -0.08444205673920267, -0.1528279674153223, 0.04502044988502921, 0.39333294344100134, -0.2364550320500577, -0.24347279670958719, 0.08212270156514866, -0.2909771723465787, -0.17249066944027114, 0.21943234339252943, -0.0200535467463649, 0.07394990656110975, 0.061444279470446485, -0.08711298010570721, -0.008666201315699491, -0.08404720349493867, 0.2688519063457433, 0.05262021144369134, 0.35611836495809257, 0.03935522591281268, 0.09071130505590527, 0.00699639101340263, 0.020847107835665898, 0.020523304606925835, -0.15789477851379802, 0.10591846247660686, 0.2520450165288316, -0.006755480788544648, 0.27953385876026005, -0.47881845517635896, -0.22722348623426147, -0.023504676530137658, 0.14499107406785092, 0.14106650650070082, -0.05259577830697203, -0.3013620086497179, 0.048520983688326344, -0.14826580828607636, -0.16283699810608393, -0.03725393071632694, 0.003235862665826938, 0.0652369660049401, -0.21658223866554047, 0.06345620772508145, 0.04394329052431405, 0.062353312115495406, -0.09941098257183546, -0.0776904628426699, -0.0005507376562390062, 0.06606069928427503, 0.025143126732911223, -0.07924158870311523, 0.15792320103867463, -0.06570651915346927, -0.08491295814100239, 0.38690093531018915, -0.028557385074910364, -0.1898963581641308, 0.18264525401388743, -0.11303486772467969, -0.004792779201158771, 0.16273325281993797, 0.21050416736775165, 0.06027669802790991, -0.12522345760953613, -0.021344896625561414, -0.0012836449053860702, 0.19521012155477097, 0.18812027742818896, 0.025199524614705565, 0.22371747197272876, 0.23425066765803085, 0.03756329307280895, 0.1953162479352344, -0.1307502068229951, 0.008373227518017369, -0.26516259908331213, -0.11413295490287796, -0.15715610349973388, -0.028797825985546095, -0.08456638551056299, -0.23113490661813152, 0.4166608179781448, 0.09173512263051062, 0.09695623519278511, 0.0011768931203901215, 0.30114078902880903, 0.0751746211597627, 0.06193541904428491, 0.05998192216200685, 0.3018802006090819, 0.1673856775785141, 0.09064854950540596, -0.2544564521457586, -0.03276824414799059, 0.025730532501324045]
1,802.08317
Lambda, the Fifth Foundational Constant Considered by Einstein
The cosmological constant, usually named Lambda, was introduced by Einstein in 1917 and abandoned by him as his biggest "blunder". It currently seems to make a spectacular comeback in the framework of the new cosmological standard model. One will explain why, together with the Planck's constant, the Boltzmann's constant, the celerity of light and the Newton's constant, also considered by Einstein, the cosmological constant may play a foundational role in the conceptual framework, an in the metrological framework a role comparable with the one attributed to Avogadro constant
physics.hist-ph astro-ph.CO hep-ph
the cosmological constant usually named lambda was introduced by einstein in 1917 and abandoned by him as his biggest blunder it currently seems to make a spectacular comeback in the framework of the new cosmological standard model one will explain why together with the plancks constant the boltzmanns constant the celerity of light and the newtons constant also considered by einstein the cosmological constant may play a foundational role in the conceptual framework an in the metrological framework a role comparable with the one attributed to avogadro constant
[['the', 'cosmological', 'constant', 'usually', 'named', 'lambda', 'was', 'introduced', 'by', 'einstein', 'in', '1917', 'and', 'abandoned', 'by', 'him', 'as', 'his', 'biggest', 'blunder', 'it', 'currently', 'seems', 'to', 'make', 'a', 'spectacular', 'comeback', 'in', 'the', 'framework', 'of', 'the', 'new', 'cosmological', 'standard', 'model', 'one', 'will', 'explain', 'why', 'together', 'with', 'the', 'plancks', 'constant', 'the', 'boltzmanns', 'constant', 'the', 'celerity', 'of', 'light', 'and', 'the', 'newtons', 'constant', 'also', 'considered', 'by', 'einstein', 'the', 'cosmological', 'constant', 'may', 'play', 'a', 'foundational', 'role', 'in', 'the', 'conceptual', 'framework', 'an', 'in', 'the', 'metrological', 'framework', 'a', 'role', 'comparable', 'with', 'the', 'one', 'attributed', 'to', 'avogadro', 'constant']]
[-0.07644070982827213, 0.10668373285327769, -0.08020229098408228, 0.08472992720701521, -0.12372745771162127, -0.19741738576505502, -0.010087387660116126, 0.26670758808243344, -0.2537866838710298, -0.33750809443352575, 0.07680948453542608, -0.22624886842359873, -0.1083901717422784, 0.18045503850655883, -0.08845868505093014, 0.03002968867076561, -0.007312954992151142, 0.07946670303036543, 0.02129761997440999, -0.29415873322762887, 0.32449229660084133, 0.1921415179650384, 0.2293978213565424, 0.07226979263677177, 0.12038650094340979, -0.05142868398053741, -0.06784098488490352, 0.04636841999176382, -0.16681852231902833, 0.08909829755099384, 0.20009004303508185, 0.11213130454680967, 0.3726361840540035, -0.3984585502714088, -0.21712235393087295, 0.06842218856962229, 0.09449177998414432, 0.13286485624055125, -0.03473708807988177, -0.2760988124117086, -0.005789588200224733, -0.16826169887049633, -0.1775315541043793, -0.0140328101829668, 0.028319654261312364, -0.06874955221163956, -0.1331258082487197, 0.07256432293764771, 0.03004975893682885, -0.04164719822901217, -0.0696125957395204, -0.12134403650204396, 0.10998699339953336, 0.09982791340338405, 0.10171470214713323, 0.0978819317983421, 0.08725120192089393, -0.10758354033301161, -0.09836345847526734, 0.4770382592006089, -0.1738987107740038, -0.16513624989469958, 0.08687591320432891, -0.11172466223995964, -0.1237668886751635, 0.05147319634587885, 0.06356546094387093, 0.05146665559996935, -0.1424392968024635, 0.1223857641968855, -0.014450167407630943, 0.1695017098470337, 0.09769207078286192, -0.020958761263913897, 0.2709133532890436, 0.08929677023975686, 0.001051359238441695, 0.026024876014244826, -0.004512722117149017, -0.1246928422518646, -0.33139729173853993, -0.20062872039323504, -0.15366968456444077, 0.09563371901888539, -0.1150275162439026, -0.13870161671233786, 0.3038298252504319, 0.1220703441292492, 0.17261517842152072, -0.02134094694999724, 0.27542540079395456, 0.04506677345621442, 0.10123854452765292, 0.0484874940699559, 0.3706500939919021, 0.14240217841473746, 0.18322794150497596, -0.201712103854251, 0.07973731637255034, 0.07436380395136605]
1,802.08318
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in $d$ dimensions. We study the $A$-optimal design variant where the objective is to minimize the average variance of the error in the maximum likelihood estimate of the vector being measured. The problem also finds applications in sensor placement in wireless networks, sparse least squares regression, feature selection for $k$-means clustering, and matrix approximation. In this paper, we introduce proportional volume sampling to obtain improved approximation algorithms for $A$-optimal design. Our main result is to obtain improved approximation algorithms for the $A$-optimal design problem by introducing the proportional volume sampling algorithm. Our results nearly optimal bounds in the asymptotic regime when the number of measurements done, $k$, is significantly more than the dimension $d$. We also give first approximation algorithms when $k$ is small including when $k=d$. The proportional volume-sampling algorithm also gives approximation algorithms for other optimal design objectives such as $D$-optimal design and generalized ratio objective matching or improving previous best known results. Interestingly, we show that a similar guarantee cannot be obtained for the $E$-optimal design problem. We also show that the $A$-optimal design problem is NP-hard to approximate within a fixed constant when $k=d$.
cs.DS cs.LG math.OC stat.CO stat.ML
we study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in d dimensions we study the aoptimal design variant where the objective is to minimize the average variance of the error in the maximum likelihood estimate of the vector being measured the problem also finds applications in sensor placement in wireless networks sparse least squares regression feature selection for kmeans clustering and matrix approximation in this paper we introduce proportional volume sampling to obtain improved approximation algorithms for aoptimal design our main result is to obtain improved approximation algorithms for the aoptimal design problem by introducing the proportional volume sampling algorithm our results nearly optimal bounds in the asymptotic regime when the number of measurements done k is significantly more than the dimension d we also give first approximation algorithms when k is small including when kd the proportional volumesampling algorithm also gives approximation algorithms for other optimal design objectives such as doptimal design and generalized ratio objective matching or improving previous best known results interestingly we show that a similar guarantee cannot be obtained for the eoptimal design problem we also show that the aoptimal design problem is nphard to approximate within a fixed constant when kd
[['we', 'study', 'the', 'optimal', 'design', 'problems', 'where', 'the', 'goal', 'is', 'to', 'choose', 'a', 'set', 'of', 'linear', 'measurements', 'to', 'obtain', 'the', 'most', 'accurate', 'estimate', 'of', 'an', 'unknown', 'vector', 'in', 'd', 'dimensions', 'we', 'study', 'the', 'aoptimal', 'design', 'variant', 'where', 'the', 'objective', 'is', 'to', 'minimize', 'the', 'average', 'variance', 'of', 'the', 'error', 'in', 'the', 'maximum', 'likelihood', 'estimate', 'of', 'the', 'vector', 'being', 'measured', 'the', 'problem', 'also', 'finds', 'applications', 'in', 'sensor', 'placement', 'in', 'wireless', 'networks', 'sparse', 'least', 'squares', 'regression', 'feature', 'selection', 'for', 'kmeans', 'clustering', 'and', 'matrix', 'approximation', 'in', 'this', 'paper', 'we', 'introduce', 'proportional', 'volume', 'sampling', 'to', 'obtain', 'improved', 'approximation', 'algorithms', 'for', 'aoptimal', 'design', 'our', 'main', 'result', 'is', 'to', 'obtain', 'improved', 'approximation', 'algorithms', 'for', 'the', 'aoptimal', 'design', 'problem', 'by', 'introducing', 'the', 'proportional', 'volume', 'sampling', 'algorithm', 'our', 'results', 'nearly', 'optimal', 'bounds', 'in', 'the', 'asymptotic', 'regime', 'when', 'the', 'number', 'of', 'measurements', 'done', 'k', 'is', 'significantly', 'more', 'than', 'the', 'dimension', 'd', 'we', 'also', 'give', 'first', 'approximation', 'algorithms', 'when', 'k', 'is', 'small', 'including', 'when', 'kd', 'the', 'proportional', 'volumesampling', 'algorithm', 'also', 'gives', 'approximation', 'algorithms', 'for', 'other', 'optimal', 'design', 'objectives', 'such', 'as', 'doptimal', 'design', 'and', 'generalized', 'ratio', 'objective', 'matching', 'or', 'improving', 'previous', 'best', 'known', 'results', 'interestingly', 'we', 'show', 'that', 'a', 'similar', 'guarantee', 'can', 'not', 'be', 'obtained', 'for', 'the', 'eoptimal', 'design', 'problem', 'we', 'also', 'show', 'that', 'the', 'aoptimal', 'design', 'problem', 'is', 'nphard', 'to', 'approximate', 'within', 'a', 'fixed', 'constant', 'when', 'kd']]
[-0.09666235637472033, 0.0230754404204903, -0.04905127464295473, 0.06687071612375507, -0.08172969292134566, -0.17870129424493847, 0.07652512120386196, 0.38171703367559023, -0.2647281296188445, -0.32344786750889104, 0.11976489327133222, -0.24522734082542186, -0.20101210993638824, 0.17733417605483082, -0.09553095536241525, 0.11124211092165476, 0.05496878358968642, 0.04583852683995352, -0.07200349910011472, -0.31311493854872274, 0.2520543714227198, 0.07309064454193293, 0.29385280369152855, 0.020103078909478215, 0.08817243153597554, 0.040743542098721795, -0.014584748334587054, 0.038814232970295515, -0.17028942480067408, 0.11921626568641946, 0.30608738904905525, 0.18028675969365204, 0.30730511296085666, -0.3426575418236817, -0.15022091442545832, 0.15353174037245904, 0.16027995909802442, 0.0988711575511843, -0.0020556889910949396, -0.18314580078301734, 0.1333650295557671, -0.10158169681306517, -0.10145560659273246, -0.0797671064182163, -0.024018540770508523, -0.0007726791444732699, -0.37653369810648785, 0.026371303887842874, 0.03806499437493987, -0.022252840349494023, -0.07166202494679669, -0.20395541645716442, 0.10973760031791793, 0.08352078448352945, 0.025406730974899865, 0.06536973209098675, 0.08342143959409103, -0.09378881516086673, -0.13439755874014525, 0.3707404914442017, -0.056309029983348476, -0.23880126811455676, 0.0954476470528387, -0.0773650052935578, -0.13048202776739937, 0.12282568383528743, 0.23613407443342513, 0.14150390086132428, -0.12922711842178994, 0.056611193421426724, -0.05772073566236771, 0.15796780974636676, 0.04897029616566765, 0.013697300186424061, 0.05216007494735857, 0.19568230184932175, 0.1994468453101987, 0.16660775768077868, -0.060510765094050144, -0.06717754032592788, -0.2773172434895884, -0.11544365728602929, -0.22659741888786558, -0.01070560079905865, -0.15673416562061648, -0.15156574329783665, 0.3402182758027731, 0.17733360463753342, 0.1914118945685237, 0.13406132675360802, 0.35044953169431103, 0.11961708457735747, 0.014450526892662395, 0.13867134673650874, 0.2347908250770943, 0.11466052814516738, 0.028519852283995513, -0.21907136179073605, 0.0985318657508943, 0.08943640445250758]
1,802.08319
Investigation of room temperature multispin-assisted bulk diamond 13C hyperpolarization at low magnetic fields
In this work we investigated the time behavior of the polarization of bulk 13C nuclei in diamond above the thermal equilibrium. This nonthermal nuclear hyperpolarization is achieved by cross relaxation between two nitrogen related paramagnetic defect species in diamond in combination with optical pumping. The decay of the hyperpolarization at four different magnetic fields is measured. Furthermore, we use the comparison with conventional nuclear resonance measurements to identify the involved distances of the nuclear spin with respect to the defects and therefore the coupling strengths. Also, a careful look at the linewidth of the signal give valuable information to piece together the puzzle of the hyperpolarization mechanism.
cond-mat.mes-hall
in this work we investigated the time behavior of the polarization of bulk 13c nuclei in diamond above the thermal equilibrium this nonthermal nuclear hyperpolarization is achieved by cross relaxation between two nitrogen related paramagnetic defect species in diamond in combination with optical pumping the decay of the hyperpolarization at four different magnetic fields is measured furthermore we use the comparison with conventional nuclear resonance measurements to identify the involved distances of the nuclear spin with respect to the defects and therefore the coupling strengths also a careful look at the linewidth of the signal give valuable information to piece together the puzzle of the hyperpolarization mechanism
[['in', 'this', 'work', 'we', 'investigated', 'the', 'time', 'behavior', 'of', 'the', 'polarization', 'of', 'bulk', '13c', 'nuclei', 'in', 'diamond', 'above', 'the', 'thermal', 'equilibrium', 'this', 'nonthermal', 'nuclear', 'hyperpolarization', 'is', 'achieved', 'by', 'cross', 'relaxation', 'between', 'two', 'nitrogen', 'related', 'paramagnetic', 'defect', 'species', 'in', 'diamond', 'in', 'combination', 'with', 'optical', 'pumping', 'the', 'decay', 'of', 'the', 'hyperpolarization', 'at', 'four', 'different', 'magnetic', 'fields', 'is', 'measured', 'furthermore', 'we', 'use', 'the', 'comparison', 'with', 'conventional', 'nuclear', 'resonance', 'measurements', 'to', 'identify', 'the', 'involved', 'distances', 'of', 'the', 'nuclear', 'spin', 'with', 'respect', 'to', 'the', 'defects', 'and', 'therefore', 'the', 'coupling', 'strengths', 'also', 'a', 'careful', 'look', 'at', 'the', 'linewidth', 'of', 'the', 'signal', 'give', 'valuable', 'information', 'to', 'piece', 'together', 'the', 'puzzle', 'of', 'the', 'hyperpolarization', 'mechanism']]
[-0.07223456003975176, 0.1850517958698568, -0.051827771280169764, 0.03477372964582989, 0.00897768699503112, -0.10657633720488052, 0.04695594009168655, 0.41480551282309486, -0.2764190592972788, -0.29130704847445155, 0.03464382871437087, -0.3084708777926514, 0.00479453677424691, 0.14965589495950213, 0.06814213296415929, -0.018642774781442866, 0.003044377681668674, 0.03958323315029668, -0.06518730681354755, -0.17021160933981153, 0.30025261216666377, 0.0806070186162942, 0.28701784446939965, 0.11365592404851847, 0.0603989885214751, 0.012189048159623815, 0.030854635536844765, -0.0133810752967947, -0.13032797140843957, 0.1272466968240164, 0.2619810724961702, 0.010808404056337949, 0.17722569775950409, -0.4588438005264953, -0.1715824489185813, 0.09661063164577027, 0.10922903038787647, 0.18105134440185588, -0.09345686290561109, -0.23903540105376148, 0.0180262677190895, -0.12000366269880644, -0.13456931525066704, -0.06666264928024367, -0.02010744315883249, -0.010352381755310659, -0.22972582287598994, 0.10088651930009207, 0.04673714775300506, 0.07606858768822433, -0.09876865585917764, -0.1378142139482721, -0.011979567051852104, 0.10328188377528269, 0.061418063721018976, 0.03384273431468407, 0.22862404112260196, -0.10219762069347237, -0.13069412741531558, 0.33428421791286045, -0.07289656977360702, -0.09182132353623197, 0.17663528115236174, -0.20378124194271932, -0.12556002656581036, 0.16764169045349706, 0.11991939049597099, 0.11913053293616693, -0.1820314237717365, 0.0018818220727485125, 0.031111348942618505, 0.17474013640519195, 0.05810358799628426, 0.1065433988800255, 0.21499205881155262, 0.19006802201832462, 0.03431489871310018, 0.1536335815647269, -0.15257832000606528, -0.05568662649629829, -0.24565416464808387, -0.12477046423635194, -0.16555787091987711, 0.06941680230252514, -0.08130208386320982, -0.08531982255403266, 0.40515656031180763, 0.10975380364215767, 0.1979100257245319, -0.06413319894486916, 0.295356672083106, 0.0698136261644747, 0.09374083904114282, 0.004338639866665145, 0.3257708111864941, 0.22995144169055204, 0.11434280488936004, -0.37216563043228096, 0.06225434757081496, -0.028993472718050545]
1,802.0832
Eyes on K2-3: A system of three likely sub-Neptunes characterized with HARPS-N and HARPS
M-dwarf stars are promising targets for identifying and characterizing potentially habitable planets. K2-3 is a nearby (45 pc), early-type M dwarf hosting three small transiting planets, the outermost of which orbits close to the inner edge of the stellar (optimistic) habitable zone. The K2-3 system is well suited for follow-up characterization studies aimed at determining accurate masses and bulk densities of the three planets. Using a total of 329 radial velocity measurements collected over 2.5 years with the HARPS-N and HARPS spectrographs and a proper treatment of the stellar activity signal, we aim to improve measurements of the masses and bulk densities of the K2-3 planets. We use our results to investigate the physical structure of the planets. We analyse radial velocity time series extracted with two independent pipelines by using Gaussian process regression. We adopt a quasi-periodic kernel to model the stellar magnetic activity jointly with the planetary signals. We use Monte Carlo simulations to investigate the robustness of our mass measurements of K2-3\,c and K2-3\,d, and to explore how additional high-cadence radial velocity observations might improve them. Despite the stellar activity component being the strongest signal present in the radial velocity time series, we are able to derive masses for both planet b ($M_{\rm b}=6.6\pm1.1$ $M_{\rm \oplus}$) and planet c ($M_{\rm c}=3.1^{+1.3}_{-1.2}$ $M_{\rm \oplus}$). The Doppler signal due to K2-3\,d remains undetected, likely because of its low amplitude compared to the radial velocity signal induced by the stellar activity. The closeness of the orbital period of K2-3\,d to the stellar rotation period could also make the detection of the planetary signal complicated. [...]
astro-ph.EP
mdwarf stars are promising targets for identifying and characterizing potentially habitable planets k23 is a nearby 45 pc earlytype m dwarf hosting three small transiting planets the outermost of which orbits close to the inner edge of the stellar optimistic habitable zone the k23 system is well suited for followup characterization studies aimed at determining accurate masses and bulk densities of the three planets using a total of 329 radial velocity measurements collected over 25 years with the harpsn and harps spectrographs and a proper treatment of the stellar activity signal we aim to improve measurements of the masses and bulk densities of the k23 planets we use our results to investigate the physical structure of the planets we analyse radial velocity time series extracted with two independent pipelines by using gaussian process regression we adopt a quasiperiodic kernel to model the stellar magnetic activity jointly with the planetary signals we use monte carlo simulations to investigate the robustness of our mass measurements of k23c and k23d and to explore how additional highcadence radial velocity observations might improve them despite the stellar activity component being the strongest signal present in the radial velocity time series we are able to derive masses for both planet b m_rm b66pm11 m_rm oplus and planet c m_rm c3113_12 m_rm oplus the doppler signal due to k23d remains undetected likely because of its low amplitude compared to the radial velocity signal induced by the stellar activity the closeness of the orbital period of k23d to the stellar rotation period could also make the detection of the planetary signal complicated
[['mdwarf', 'stars', 'are', 'promising', 'targets', 'for', 'identifying', 'and', 'characterizing', 'potentially', 'habitable', 'planets', 'k23', 'is', 'a', 'nearby', '45', 'pc', 'earlytype', 'm', 'dwarf', 'hosting', 'three', 'small', 'transiting', 'planets', 'the', 'outermost', 'of', 'which', 'orbits', 'close', 'to', 'the', 'inner', 'edge', 'of', 'the', 'stellar', 'optimistic', 'habitable', 'zone', 'the', 'k23', 'system', 'is', 'well', 'suited', 'for', 'followup', 'characterization', 'studies', 'aimed', 'at', 'determining', 'accurate', 'masses', 'and', 'bulk', 'densities', 'of', 'the', 'three', 'planets', 'using', 'a', 'total', 'of', '329', 'radial', 'velocity', 'measurements', 'collected', 'over', '25', 'years', 'with', 'the', 'harpsn', 'and', 'harps', 'spectrographs', 'and', 'a', 'proper', 'treatment', 'of', 'the', 'stellar', 'activity', 'signal', 'we', 'aim', 'to', 'improve', 'measurements', 'of', 'the', 'masses', 'and', 'bulk', 'densities', 'of', 'the', 'k23', 'planets', 'we', 'use', 'our', 'results', 'to', 'investigate', 'the', 'physical', 'structure', 'of', 'the', 'planets', 'we', 'analyse', 'radial', 'velocity', 'time', 'series', 'extracted', 'with', 'two', 'independent', 'pipelines', 'by', 'using', 'gaussian', 'process', 'regression', 'we', 'adopt', 'a', 'quasiperiodic', 'kernel', 'to', 'model', 'the', 'stellar', 'magnetic', 'activity', 'jointly', 'with', 'the', 'planetary', 'signals', 'we', 'use', 'monte', 'carlo', 'simulations', 'to', 'investigate', 'the', 'robustness', 'of', 'our', 'mass', 'measurements', 'of', 'k23c', 'and', 'k23d', 'and', 'to', 'explore', 'how', 'additional', 'highcadence', 'radial', 'velocity', 'observations', 'might', 'improve', 'them', 'despite', 'the', 'stellar', 'activity', 'component', 'being', 'the', 'strongest', 'signal', 'present', 'in', 'the', 'radial', 'velocity', 'time', 'series', 'we', 'are', 'able', 'to', 'derive', 'masses', 'for', 'both', 'planet', 'b', 'm_rm', 'b66pm11', 'm_rm', 'oplus', 'and', 'planet', 'c', 'm_rm', 'c3113_12', 'm_rm', 'oplus', 'the', 'doppler', 'signal', 'due', 'to', 'k23d', 'remains', 'undetected', 'likely', 'because', 'of', 'its', 'low', 'amplitude', 'compared', 'to', 'the', 'radial', 'velocity', 'signal', 'induced', 'by', 'the', 'stellar', 'activity', 'the', 'closeness', 'of', 'the', 'orbital', 'period', 'of', 'k23d', 'to', 'the', 'stellar', 'rotation', 'period', 'could', 'also', 'make', 'the', 'detection', 'of', 'the', 'planetary', 'signal', 'complicated']]
[-0.13314414034076605, 0.12732979247678372, -0.043496404683495735, 0.06060468232571742, -0.13185829965850887, -0.06860626078749582, 0.07867390816938488, 0.37496624506253506, -0.1713016081460434, -0.36548132781952736, 0.08277886669406617, -0.2791777848590779, -0.05677008380314114, 0.21296373938238855, -0.05719580541907228, 0.062281146886628266, 0.13077997558642215, -0.03239393791663764, -0.06109297117788744, -0.2556077859773019, 0.2681744727145495, 0.07617957476112577, 0.07638248716038562, -0.041686228615627895, 0.04199327653188301, -0.040331415665225336, -0.0861073456721566, -0.07948595220651264, -0.20478507359440784, 0.05410971103407357, 0.2323128601850164, 0.12800894514141828, 0.21347955199604376, -0.3576525983033109, -0.18776916262026433, 0.07904877702208678, 0.1627460867104074, 0.019915499352899976, -0.03365661196629883, -0.27833089262061533, 0.0805455891342327, -0.16499487841252053, -0.1884352548147812, -0.0012767181497145715, 0.07852886137070841, 0.007975779582614301, -0.2749745711376239, 0.1262503084043082, 0.014849644809536693, 0.13778283208308892, -0.13831561369691187, -0.13498556912364618, -0.0955735224350873, 0.106766799454563, 0.029809169254379018, 0.031462645176013083, 0.16809090404054042, -0.07774931430759557, -0.022607121569768195, 0.39857123423210733, -0.12774321951607234, -0.05973100849566446, 0.25848119533210423, -0.22085209490759905, -0.1273673746852611, 0.10219875800020108, 0.2134264248170822, 0.136466425133448, -0.17205171135429942, -0.014578014873463297, 0.0017817974736435889, 0.18482392181248058, 0.05555177877489406, 0.03771797926976948, 0.34806658453183154, 0.1309791612421016, 0.06228414701941955, 0.028651247133761357, -0.2788199254899719, -0.008457409781742828, -0.17102438807054834, -0.12803545257742777, -0.14274378283077788, 0.02531223974085388, -0.12144409156434766, -0.09457196810521842, 0.39779312640314357, 0.16751229385506375, 0.2178824443122108, 0.06719498959204032, 0.33715021224974356, 0.09006768628781825, 0.1071273723702612, 0.10778351964150694, 0.30471592401850156, 0.2000593633276778, 0.07362744637980871, -0.28698355898839134, 0.06557386120874079, -0.007485622626647239]
1,802.08321
Reduction approach to the dynamics of interacting front solutions in a bistable reaction-diffusion system and its application to heterogeneous media
The dynamics of pulse solutions in a bistable reaction-diffusion system are studied analytically by reducing partial differential equations (PDEs) to finite-dimensional ordinary differential equations (ODEs). For the reduction, we apply the multiple-scales method to the mixed ODE-PDE system obtained by taking a singular limit of the PDEs. The reduced equations describe the interface motion of a pulse solution formed by two interacting front solutions. This motion is in qualitatively good agreement with that observed for the original PDE system. Furthermore, it is found that the reduction not only facilitates the analytical study of the pulse solution, especially the specification of the onset of local bifurcations, but also allows us to elucidate the global bifurcation structure behind the pulse behavior. As an application, the pulse dynamics in a heterogeneous bump-type medium are explored numerically and analytically. The reduced ODEs clarify the transition mechanisms between four pulse behaviors that occur at different parameter values.
math.DS
the dynamics of pulse solutions in a bistable reactiondiffusion system are studied analytically by reducing partial differential equations pdes to finitedimensional ordinary differential equations odes for the reduction we apply the multiplescales method to the mixed odepde system obtained by taking a singular limit of the pdes the reduced equations describe the interface motion of a pulse solution formed by two interacting front solutions this motion is in qualitatively good agreement with that observed for the original pde system furthermore it is found that the reduction not only facilitates the analytical study of the pulse solution especially the specification of the onset of local bifurcations but also allows us to elucidate the global bifurcation structure behind the pulse behavior as an application the pulse dynamics in a heterogeneous bumptype medium are explored numerically and analytically the reduced odes clarify the transition mechanisms between four pulse behaviors that occur at different parameter values
[['the', 'dynamics', 'of', 'pulse', 'solutions', 'in', 'a', 'bistable', 'reactiondiffusion', 'system', 'are', 'studied', 'analytically', 'by', 'reducing', 'partial', 'differential', 'equations', 'pdes', 'to', 'finitedimensional', 'ordinary', 'differential', 'equations', 'odes', 'for', 'the', 'reduction', 'we', 'apply', 'the', 'multiplescales', 'method', 'to', 'the', 'mixed', 'odepde', 'system', 'obtained', 'by', 'taking', 'a', 'singular', 'limit', 'of', 'the', 'pdes', 'the', 'reduced', 'equations', 'describe', 'the', 'interface', 'motion', 'of', 'a', 'pulse', 'solution', 'formed', 'by', 'two', 'interacting', 'front', 'solutions', 'this', 'motion', 'is', 'in', 'qualitatively', 'good', 'agreement', 'with', 'that', 'observed', 'for', 'the', 'original', 'pde', 'system', 'furthermore', 'it', 'is', 'found', 'that', 'the', 'reduction', 'not', 'only', 'facilitates', 'the', 'analytical', 'study', 'of', 'the', 'pulse', 'solution', 'especially', 'the', 'specification', 'of', 'the', 'onset', 'of', 'local', 'bifurcations', 'but', 'also', 'allows', 'us', 'to', 'elucidate', 'the', 'global', 'bifurcation', 'structure', 'behind', 'the', 'pulse', 'behavior', 'as', 'an', 'application', 'the', 'pulse', 'dynamics', 'in', 'a', 'heterogeneous', 'bumptype', 'medium', 'are', 'explored', 'numerically', 'and', 'analytically', 'the', 'reduced', 'odes', 'clarify', 'the', 'transition', 'mechanisms', 'between', 'four', 'pulse', 'behaviors', 'that', 'occur', 'at', 'different', 'parameter', 'values']]
[-0.17403698784749436, 0.06349311526704793, -0.10322918270140985, 0.07487494693776062, -0.05413445281882505, -0.1408234831895556, -0.0032307445580472814, 0.3092711776100247, -0.2993254370321304, -0.2747814140331913, 0.10416526992000417, -0.26011072925381773, -0.17356749193816884, 0.19237448664887852, -0.008362637027876069, 0.07764309826270378, 0.07724277548559799, -0.0033848736765146846, -0.0648259448723263, -0.2078031980454157, 0.32093122958618875, -0.016130480801205563, 0.2610957704311767, -0.03419733671348123, 0.1554154904855304, -0.037214964148680994, 0.03783565712321722, 0.016868120571290026, -0.16064128190172422, 0.05164101110179199, 0.26901579300089684, 0.038188843785119025, 0.23109202613801208, -0.4576178423270879, -0.22751584557187282, 0.03382277259732665, 0.18158401492119625, 0.1471446252162784, -0.027174577720822546, -0.2941738689528001, 0.050215081743501276, -0.1461634142108459, -0.20963047531804235, -0.06545924530395411, 0.02084011669172011, 0.07380668974993441, -0.240096216992435, 0.07861912554104517, 0.052605120933904556, 0.023518895614731885, -0.10576809262926228, -0.02159376396251756, -0.058435259423903284, 0.09583061291459972, 0.03489276468891624, -0.04926436568227973, 0.10808705588508187, -0.1366506432574736, -0.06792551486148493, 0.3636751108639411, -0.0713050516016954, -0.23480245987237092, 0.16948108042633495, -0.15048315729452483, -0.07498793955892324, 0.22289293505473445, 0.1505230137159345, 0.12154135161036292, -0.18623501139219592, 0.05209082242568634, 3.7843053111966875e-05, 0.18552819139860718, 0.07920165221971638, -0.031774064597324084, 0.11442732146250344, 0.18817739392320829, 0.054906306362754065, 0.1380071182124662, -0.001286136896568443, -0.18154655517516843, -0.2921041091934883, -0.10725295903864286, -0.09008962999788785, 0.024963241093734198, -0.11134262185550328, -0.14590827171499562, 0.42174630299432586, 0.1519496420287336, 0.17110873840669083, 0.022194896571782252, 0.24608585944658282, 0.22071474712783015, -0.019617290188641664, 0.019690700624730217, 0.26233502261537983, 0.16312519794126468, 0.15866991519212525, -0.3120425929722456, 0.077538871886332, 0.09791661232142457]
1,802.08322
Feedback Control of an Exoskeleton for Paraplegics: Toward Robustly Stable Hands-free Dynamic Walking
This manuscript presents control of a high-DOF fully actuated lower-limb exoskeleton for paraplegic individuals. The key novelty is the ability for the user to walk without the use of crutches or other external means of stabilization. We harness the power of modern optimization techniques and supervised machine learning to develop a smooth feedback control policy that provides robust velocity regulation and perturbation rejection. Preliminary evaluation of the stability and robustness of the proposed approach is demonstrated through the Gazebo simulation environment. In addition, preliminary experimental results with (complete) paraplegic individuals are included for the previous version of the controller.
cs.RO
this manuscript presents control of a highdof fully actuated lowerlimb exoskeleton for paraplegic individuals the key novelty is the ability for the user to walk without the use of crutches or other external means of stabilization we harness the power of modern optimization techniques and supervised machine learning to develop a smooth feedback control policy that provides robust velocity regulation and perturbation rejection preliminary evaluation of the stability and robustness of the proposed approach is demonstrated through the gazebo simulation environment in addition preliminary experimental results with complete paraplegic individuals are included for the previous version of the controller
[['this', 'manuscript', 'presents', 'control', 'of', 'a', 'highdof', 'fully', 'actuated', 'lowerlimb', 'exoskeleton', 'for', 'paraplegic', 'individuals', 'the', 'key', 'novelty', 'is', 'the', 'ability', 'for', 'the', 'user', 'to', 'walk', 'without', 'the', 'use', 'of', 'crutches', 'or', 'other', 'external', 'means', 'of', 'stabilization', 'we', 'harness', 'the', 'power', 'of', 'modern', 'optimization', 'techniques', 'and', 'supervised', 'machine', 'learning', 'to', 'develop', 'a', 'smooth', 'feedback', 'control', 'policy', 'that', 'provides', 'robust', 'velocity', 'regulation', 'and', 'perturbation', 'rejection', 'preliminary', 'evaluation', 'of', 'the', 'stability', 'and', 'robustness', 'of', 'the', 'proposed', 'approach', 'is', 'demonstrated', 'through', 'the', 'gazebo', 'simulation', 'environment', 'in', 'addition', 'preliminary', 'experimental', 'results', 'with', 'complete', 'paraplegic', 'individuals', 'are', 'included', 'for', 'the', 'previous', 'version', 'of', 'the', 'controller']]
[-0.10487918329944274, 0.014433457805984179, -0.08844339367648472, -0.008830407254245817, -0.11856996364017226, -0.16415392542828103, 0.06248364770518882, 0.38898044678249527, -0.23079386777339542, -0.3007551459595561, 0.09961506047604453, -0.22686666162323435, -0.18019817171057648, 0.21957108253204471, -0.13915831219328909, 0.10579582178794152, 0.08705525764986416, 0.0036979807060858122, 0.03127579603401222, -0.2361410754015289, 0.28510045076777435, 0.07814599012977405, 0.3059547803868369, 0.025467552087858926, 0.13569292827950058, 0.03189587581199499, -0.04798271550739906, 0.006528841019180432, -0.0912982076493345, 0.16287083516600637, 0.2605705742714737, 0.15666232155445886, 0.36211048555085246, -0.39346855335241676, -0.2017841321435206, 0.0584750675016596, 0.12834138253570668, 0.11599019851668604, -0.10626932073916708, -0.3172652654501857, 0.1151636999257251, -0.18431064883741188, -0.11428763103500313, -0.13254344851795433, -0.05562632296196356, 0.03443680438819256, -0.30738015182088224, 0.03949437488573698, 0.056526620401905814, 0.09851254865394107, -0.07983962308178294, -0.07309659044448362, 0.01921562434706305, 0.1779345108305427, 0.010073128683796647, 0.022320253888563235, 0.19925504248608283, -0.12069667334791881, -0.16301574425923884, 0.3439036062253373, -0.020564031927390213, -0.21953812125970476, 0.18827091382664382, -0.04929256978995946, -0.11170723579101721, 0.08883598886848408, 0.21595201482616214, 0.08732047487924598, -0.16760493536498777, 0.02626420486936992, 0.011540261296821492, 0.18493674671971144, -0.02210125627889469, -0.030873665985252177, 0.11985441676236461, 0.2574927506764058, 0.0952471156309986, 0.15017226681752338, -0.0470744855505918, -0.12955154901446433, -0.29637860186987236, -0.11870287373253353, -0.12984479280730368, -0.00040337474712607814, -0.0616705362735214, -0.12913349012331088, 0.39990196464944405, 0.1949639072052526, 0.11989101795812271, 0.10751376575695312, 0.3871355630001243, 0.05184876284448012, 0.031463804094082844, 0.06651418676067676, 0.2408595480825467, 0.07995520163403481, 0.1351193166005292, -0.26582360444519176, 0.09707563994119742, 0.020085225347429514]
1,802.08323
Deep learning algorithm for data-driven simulation of noisy dynamical system
We present a deep learning model, DE-LSTM, for the simulation of a stochastic process with an underlying nonlinear dynamics. The deep learning model aims to approximate the probability density function of a stochastic process via numerical discretization and the underlying nonlinear dynamics is modeled by the Long Short-Term Memory (LSTM) network. It is shown that, when the numerical discretization is used, the function estimation problem can be solved by a multi-label classification problem. A penalized maximum log likelihood method is proposed to impose a smoothness condition in the prediction of the probability distribution. We show that the time evolution of the probability distribution can be computed by a high-dimensional integration of the transition probability of the LSTM internal states. A Monte Carlo algorithm to approximate the high-dimensional integration is outlined. The behavior of DE-LSTM is thoroughly investigated by using the Ornstein-Uhlenbeck process and noisy observations of nonlinear dynamical systems; Mackey-Glass time series and forced Van der Pol oscillator. It is shown that DE-LSTM makes a good prediction of the probability distribution without assuming any distributional properties of the stochastic process. For a multiple-step forecast of the Mackey-Glass time series, the prediction uncertainty, denoted by the 95\% confidence interval, first grows, then dynamically adjusts following the evolution of the system, while in the simulation of the forced Van der Pol oscillator, the prediction uncertainty does not grow in time even for a 3,000-step forecast.
physics.comp-ph cs.LG physics.data-an stat.ML
we present a deep learning model delstm for the simulation of a stochastic process with an underlying nonlinear dynamics the deep learning model aims to approximate the probability density function of a stochastic process via numerical discretization and the underlying nonlinear dynamics is modeled by the long shortterm memory lstm network it is shown that when the numerical discretization is used the function estimation problem can be solved by a multilabel classification problem a penalized maximum log likelihood method is proposed to impose a smoothness condition in the prediction of the probability distribution we show that the time evolution of the probability distribution can be computed by a highdimensional integration of the transition probability of the lstm internal states a monte carlo algorithm to approximate the highdimensional integration is outlined the behavior of delstm is thoroughly investigated by using the ornsteinuhlenbeck process and noisy observations of nonlinear dynamical systems mackeyglass time series and forced van der pol oscillator it is shown that delstm makes a good prediction of the probability distribution without assuming any distributional properties of the stochastic process for a multiplestep forecast of the mackeyglass time series the prediction uncertainty denoted by the 95 confidence interval first grows then dynamically adjusts following the evolution of the system while in the simulation of the forced van der pol oscillator the prediction uncertainty does not grow in time even for a 3000step forecast
[['we', 'present', 'a', 'deep', 'learning', 'model', 'delstm', 'for', 'the', 'simulation', 'of', 'a', 'stochastic', 'process', 'with', 'an', 'underlying', 'nonlinear', 'dynamics', 'the', 'deep', 'learning', 'model', 'aims', 'to', 'approximate', 'the', 'probability', 'density', 'function', 'of', 'a', 'stochastic', 'process', 'via', 'numerical', 'discretization', 'and', 'the', 'underlying', 'nonlinear', 'dynamics', 'is', 'modeled', 'by', 'the', 'long', 'shortterm', 'memory', 'lstm', 'network', 'it', 'is', 'shown', 'that', 'when', 'the', 'numerical', 'discretization', 'is', 'used', 'the', 'function', 'estimation', 'problem', 'can', 'be', 'solved', 'by', 'a', 'multilabel', 'classification', 'problem', 'a', 'penalized', 'maximum', 'log', 'likelihood', 'method', 'is', 'proposed', 'to', 'impose', 'a', 'smoothness', 'condition', 'in', 'the', 'prediction', 'of', 'the', 'probability', 'distribution', 'we', 'show', 'that', 'the', 'time', 'evolution', 'of', 'the', 'probability', 'distribution', 'can', 'be', 'computed', 'by', 'a', 'highdimensional', 'integration', 'of', 'the', 'transition', 'probability', 'of', 'the', 'lstm', 'internal', 'states', 'a', 'monte', 'carlo', 'algorithm', 'to', 'approximate', 'the', 'highdimensional', 'integration', 'is', 'outlined', 'the', 'behavior', 'of', 'delstm', 'is', 'thoroughly', 'investigated', 'by', 'using', 'the', 'ornsteinuhlenbeck', 'process', 'and', 'noisy', 'observations', 'of', 'nonlinear', 'dynamical', 'systems', 'mackeyglass', 'time', 'series', 'and', 'forced', 'van', 'der', 'pol', 'oscillator', 'it', 'is', 'shown', 'that', 'delstm', 'makes', 'a', 'good', 'prediction', 'of', 'the', 'probability', 'distribution', 'without', 'assuming', 'any', 'distributional', 'properties', 'of', 'the', 'stochastic', 'process', 'for', 'a', 'multiplestep', 'forecast', 'of', 'the', 'mackeyglass', 'time', 'series', 'the', 'prediction', 'uncertainty', 'denoted', 'by', 'the', '95', 'confidence', 'interval', 'first', 'grows', 'then', 'dynamically', 'adjusts', 'following', 'the', 'evolution', 'of', 'the', 'system', 'while', 'in', 'the', 'simulation', 'of', 'the', 'forced', 'van', 'der', 'pol', 'oscillator', 'the', 'prediction', 'uncertainty', 'does', 'not', 'grow', 'in', 'time', 'even', 'for', 'a', '3000step', 'forecast']]
[-0.10960098857096204, 0.0624693225099377, -0.1015441806300479, 0.08834697051362786, -0.04161173288255292, -0.13683635682110465, 0.05137021578185999, 0.36268667303475327, -0.31176719043789236, -0.27971351022655466, 0.10203079470676162, -0.2455944964774595, -0.18593366335322759, 0.17320144833627574, -0.04463912449086663, 0.1400747626783037, 0.10151520693787085, 0.02515249526637992, -0.04177500096205943, -0.2512505846228531, 0.2692139366970815, 0.11413582445474559, 0.27149536863374846, -0.03359061402092078, 0.15907915619980736, 0.00687450950349087, -0.01183327836594705, -0.0018812237224132143, -0.11024346600177147, 0.08578677577190383, 0.22336291973298447, 0.12146136670068292, 0.3672585872901154, -0.40456122507598125, -0.2576097616371859, 0.0932696821129929, 0.12649111834604088, 0.0961903785827072, 0.015713374901177555, -0.30324294742453717, 0.04221132304519415, -0.18357787179712462, -0.08668110608966251, -0.07110700715566054, 0.010695443621130082, 0.06010265248714232, -0.3259446148154454, 0.10201801570555885, 0.057506321135939474, -0.004184756929291701, -0.05143863483179553, -0.06227765772301013, -0.0328085682061822, 0.09694686681717124, 0.006865515962748885, 0.01560987527923787, 0.10852181189292079, -0.11847556549814883, -0.10390854784456113, 0.3430303611254705, -0.10414030377859458, -0.23239204696086557, 0.12569988645003016, -0.10261213299537335, -0.1167058361059954, 0.12356403102929672, 0.1864603915109283, 0.11017481910450191, -0.17211766469078832, 0.08883335749976987, 0.003958366367191173, 0.18281788934234947, 0.007651568972505629, -0.0701419598340651, 0.14816494740682237, 0.2543358873216644, 0.041802309292914536, 0.11911392742506999, -0.10493568156580922, -0.15755256983162513, -0.267650894981263, -0.12684214617936582, -0.2257528525138884, 0.04387919351581237, -0.12920399560927512, -0.18145172646272212, 0.3779036321572895, 0.168216131731932, 0.2045645531897176, 0.12231007051547028, 0.2883377794039853, 0.19120213339619083, 0.00034975645469565846, 0.06442239182270613, 0.2008880123150824, 0.11043026227933547, 0.08785993288620375, -0.2429213462867132, 0.134513532088649, 0.0843829668933879]
1,802.08324
Combining finite element and finite difference methods for isotropic elastic wave simulations in an energy-conserving manner
We consider numerical simulation of the isotropic elastic wave equations arising from seismic applications with non-trivial land topography. The more flexible finite element method is applied to the shallow region of the simulation domain to account for the topography, and combined with the more efficient finite difference method that is applied to the deep region of the simulation domain. We demonstrate that these two discretization methods, albeit starting from different formulations of the elastic wave equation, can be joined together smoothly via weakly imposed interface conditions. Discrete energy analysis is employed to derive the proper interface treatment, leading to an overall discretization that is energy-conserving. Numerical examples are presented to demonstrate the efficacy of the proposed interface treatment.
math.NA
we consider numerical simulation of the isotropic elastic wave equations arising from seismic applications with nontrivial land topography the more flexible finite element method is applied to the shallow region of the simulation domain to account for the topography and combined with the more efficient finite difference method that is applied to the deep region of the simulation domain we demonstrate that these two discretization methods albeit starting from different formulations of the elastic wave equation can be joined together smoothly via weakly imposed interface conditions discrete energy analysis is employed to derive the proper interface treatment leading to an overall discretization that is energyconserving numerical examples are presented to demonstrate the efficacy of the proposed interface treatment
[['we', 'consider', 'numerical', 'simulation', 'of', 'the', 'isotropic', 'elastic', 'wave', 'equations', 'arising', 'from', 'seismic', 'applications', 'with', 'nontrivial', 'land', 'topography', 'the', 'more', 'flexible', 'finite', 'element', 'method', 'is', 'applied', 'to', 'the', 'shallow', 'region', 'of', 'the', 'simulation', 'domain', 'to', 'account', 'for', 'the', 'topography', 'and', 'combined', 'with', 'the', 'more', 'efficient', 'finite', 'difference', 'method', 'that', 'is', 'applied', 'to', 'the', 'deep', 'region', 'of', 'the', 'simulation', 'domain', 'we', 'demonstrate', 'that', 'these', 'two', 'discretization', 'methods', 'albeit', 'starting', 'from', 'different', 'formulations', 'of', 'the', 'elastic', 'wave', 'equation', 'can', 'be', 'joined', 'together', 'smoothly', 'via', 'weakly', 'imposed', 'interface', 'conditions', 'discrete', 'energy', 'analysis', 'is', 'employed', 'to', 'derive', 'the', 'proper', 'interface', 'treatment', 'leading', 'to', 'an', 'overall', 'discretization', 'that', 'is', 'energyconserving', 'numerical', 'examples', 'are', 'presented', 'to', 'demonstrate', 'the', 'efficacy', 'of', 'the', 'proposed', 'interface', 'treatment']]
[-0.09333932863635216, 0.06727367906026657, -0.13150102475863265, 0.04378479317035842, -0.10881181673336206, -0.11103839453278204, -0.005050819331653795, 0.4056280132351538, -0.2906234492291302, -0.27371070964924865, 0.11270919098850277, -0.2527296847774316, -0.12905319561881912, 0.2279885506821733, -0.019047873817340834, 0.0699349987336387, 0.09740376856446392, -0.04982929325749372, -0.0822340519210892, -0.1858033520994329, 0.30879537312124494, 0.01480706874848446, 0.31262463733743306, 0.06262568144080372, 0.11786672991495263, -0.017640506231099747, -0.05204717005737189, 0.06195707131429749, -0.13331507269377668, 0.11648759130246432, 0.2840195598428027, 0.04471044137213632, 0.2512314049194698, -0.49374876106631455, -0.28425777535412017, 0.04173865148766061, 0.12211586161658673, 0.13465173826631854, -0.06377125086911, -0.29002513456300405, 0.08607773587178691, -0.15039908570253244, -0.15032258882755573, -0.0861386120382507, -0.045562761263543014, 0.02337370227264651, -0.2823092181223713, 0.09557316510275132, 0.009670399366167643, 0.0205644553821234, -0.1011596985784817, -0.10665825673899913, -0.05407097275068952, 0.10997125003644723, 0.048657537509995054, 0.005710119097414664, 0.09709012694163564, -0.07642162759922508, -0.032900159610277514, 0.38104602429321255, -0.04934882925097215, -0.26802305027968804, 0.24260551761835814, -0.09379724953007901, -0.026099445077322297, 0.17465191808829117, 0.20837502462505283, 0.11002032791799077, -0.15264718738084626, 0.05275009536150827, 0.0095798313931929, 0.16335227778497136, 0.02315593883395195, -0.07624573738045864, 0.12084724253706508, 0.18851814922576737, 0.08726087515637027, 0.16101120712859082, -0.10911743866054784, -0.1388297821000471, -0.33802613967998046, -0.10902713942815061, -0.1658476445689734, -0.03628423990572258, -0.09862195257621845, -0.18085508829108993, 0.3572594426272405, 0.17368009908645712, 0.10998322406262791, 0.034870230245514444, 0.30983813640551044, 0.15092644817590462, 0.03626266233544102, 0.05978030950557125, 0.20796057757116476, 0.13283204044988853, 0.0832986583483358, -0.26243345274874086, 0.031374192822298384, 0.07930116114301324]
1,802.08325
Chemical complexity in local diffuse and translucent clouds: ubiquitous l-C3H and CH3CN, a detection of HC3N and an upper limit on the abundance of CH2CN
We present Jansky Very Large Array observations of 20 - 37 GHz absorption lines from nearby Galactic diffuse molecular gas seen against four cosmologically-distant compact radio continuum sources. The main new observational results are that \linearC3H\ and \methCN\ are ubiqitous in the local diffuse molecular interstellar medium at \AV\ $\la 1$ while HC$_3$N was seen only toward B0415 at \AV\ $>$ 4 mag. The linear/cyclic ratio is much larger in C$_3$H than in C$_3$\HH\ and the ratio \methCN/HCN is enhanced compared to TMC-1, although not as much as toward the Horsehead Nebula. More consequentially, this work completes a long-term program assessing the abundances of small hydrocarbons (CH, \cch, linear and cyclic C$_3$H and C$_3$\HH, and \cfh\ and \cfhm) and the CN-bearing species (CN, HCN, HNC, HC$_3$N, HC$_5$N and CH$_3$CN): their systematics in diffuse molecular gas are presented in detail here. We also observed but did not strongly constrain the abundances of a few oxygen-bearing species, most prominently HNCO. We set limits on the column density of C\HH CN, such that the anion C\HH CN\m\ is only viable as a carrier of diffuse interstellar bands if the N(C\HH CN)/N(C\HH CN\m) abundance ratio is much smaller in this species than in any others for which the anion has been observed. We argue that complex organic molecules are not present in clouds meeting a reasonable definition of diffuse molecular gas, ie \AV\ $\la 1$ mag.
astro-ph.GA
we present jansky very large array observations of 20 37 ghz absorption lines from nearby galactic diffuse molecular gas seen against four cosmologicallydistant compact radio continuum sources the main new observational results are that linearc3h and methcn are ubiqitous in the local diffuse molecular interstellar medium at av la 1 while hc_3n was seen only toward b0415 at av 4 mag the linearcyclic ratio is much larger in c_3h than in c_3hh and the ratio methcnhcn is enhanced compared to tmc1 although not as much as toward the horsehead nebula more consequentially this work completes a longterm program assessing the abundances of small hydrocarbons ch cch linear and cyclic c_3h and c_3hh and cfh and cfhm and the cnbearing species cn hcn hnc hc_3n hc_5n and ch_3cn their systematics in diffuse molecular gas are presented in detail here we also observed but did not strongly constrain the abundances of a few oxygenbearing species most prominently hnco we set limits on the column density of chh cn such that the anion chh cnm is only viable as a carrier of diffuse interstellar bands if the nchh cnnchh cnm abundance ratio is much smaller in this species than in any others for which the anion has been observed we argue that complex organic molecules are not present in clouds meeting a reasonable definition of diffuse molecular gas ie av la 1 mag
[['we', 'present', 'jansky', 'very', 'large', 'array', 'observations', 'of', '20', '37', 'ghz', 'absorption', 'lines', 'from', 'nearby', 'galactic', 'diffuse', 'molecular', 'gas', 'seen', 'against', 'four', 'cosmologicallydistant', 'compact', 'radio', 'continuum', 'sources', 'the', 'main', 'new', 'observational', 'results', 'are', 'that', 'linearc3h', 'and', 'methcn', 'are', 'ubiqitous', 'in', 'the', 'local', 'diffuse', 'molecular', 'interstellar', 'medium', 'at', 'av', 'la', '1', 'while', 'hc_3n', 'was', 'seen', 'only', 'toward', 'b0415', 'at', 'av', '4', 'mag', 'the', 'linearcyclic', 'ratio', 'is', 'much', 'larger', 'in', 'c_3h', 'than', 'in', 'c_3hh', 'and', 'the', 'ratio', 'methcnhcn', 'is', 'enhanced', 'compared', 'to', 'tmc1', 'although', 'not', 'as', 'much', 'as', 'toward', 'the', 'horsehead', 'nebula', 'more', 'consequentially', 'this', 'work', 'completes', 'a', 'longterm', 'program', 'assessing', 'the', 'abundances', 'of', 'small', 'hydrocarbons', 'ch', 'cch', 'linear', 'and', 'cyclic', 'c_3h', 'and', 'c_3hh', 'and', 'cfh', 'and', 'cfhm', 'and', 'the', 'cnbearing', 'species', 'cn', 'hcn', 'hnc', 'hc_3n', 'hc_5n', 'and', 'ch_3cn', 'their', 'systematics', 'in', 'diffuse', 'molecular', 'gas', 'are', 'presented', 'in', 'detail', 'here', 'we', 'also', 'observed', 'but', 'did', 'not', 'strongly', 'constrain', 'the', 'abundances', 'of', 'a', 'few', 'oxygenbearing', 'species', 'most', 'prominently', 'hnco', 'we', 'set', 'limits', 'on', 'the', 'column', 'density', 'of', 'chh', 'cn', 'such', 'that', 'the', 'anion', 'chh', 'cnm', 'is', 'only', 'viable', 'as', 'a', 'carrier', 'of', 'diffuse', 'interstellar', 'bands', 'if', 'the', 'nchh', 'cnnchh', 'cnm', 'abundance', 'ratio', 'is', 'much', 'smaller', 'in', 'this', 'species', 'than', 'in', 'any', 'others', 'for', 'which', 'the', 'anion', 'has', 'been', 'observed', 'we', 'argue', 'that', 'complex', 'organic', 'molecules', 'are', 'not', 'present', 'in', 'clouds', 'meeting', 'a', 'reasonable', 'definition', 'of', 'diffuse', 'molecular', 'gas', 'ie', 'av', 'la', '1', 'mag']]
[-0.06557245117204995, 0.10678202145401768, 0.02647620550097396, 0.05674443820163982, 0.0005437441464709161, -0.09864165128493622, 0.04549733064558408, 0.4619679247798849, -0.16262530919311136, -0.28552345581539823, 0.036081364999214806, -0.2721930798313253, -0.054064760338642624, 0.11344625123512833, -0.02005695225830407, -0.07027520872461163, 0.0036495570667496283, -0.12498447355457058, 0.00906613458173358, -0.21574458136907929, 0.22302477095729553, 0.10857380913638565, 0.16712614305750106, 0.07724870570624869, 0.008858359830781443, -0.17910069997579744, -0.054688512186039255, -0.015718350873209674, -0.1074242797763856, 0.10654337517917156, 0.2883392678771474, 0.10288763015858454, 0.1511385701299054, -0.4002430930002231, -0.24485983652090357, 0.09769750322049407, 0.19434573357663285, 0.08693356674481353, -0.012486404605695157, -0.2674024554743478, 0.050584168442749294, -0.14496202156591956, -0.16119151540551352, 0.051554596121210314, 0.09919144269759388, 0.03206816682624992, -0.18211086279793418, 0.12626163460264836, -0.014261043620971988, 0.1318887949168478, -0.08957733302183139, -0.24185741696821433, -0.08262681670414965, 0.03356964382041058, -0.025135804180345035, 0.08720161782186393, 0.23222596690560518, -0.12282890121167585, 0.020983054891619918, 0.46515340498567787, -0.1308955808865708, -0.03327947558482182, 0.27438468491811663, -0.20501359545766082, -0.2819926590418452, 0.22729485352910614, 0.08540938627272504, 0.11390726762445277, -0.13046052697067867, 0.013762032059255188, -0.08824189464278842, 0.21967028771403785, 0.08928094183830503, 0.0815255579370665, 0.23106015774370361, 0.09034780088756829, 0.08987390697661567, 0.07554894491533651, -0.20546113383173772, -0.05080951657677792, -0.17891745060282552, -0.17006779462311705, -0.10915900103282183, 0.0807451281653899, -0.09147780728643361, -0.0648809547689435, 0.27935818587025824, 0.08742617237271069, 0.2163267802525754, 0.010082054165878747, 0.3124800204176065, 0.05886871253410578, 0.07675365909198341, 0.11314443427831207, 0.2709021013055728, 0.15596882407298338, 0.1025901920678834, -0.20247502609679144, 0.13106489480264724, -0.015416776625860534]
1,802.08326
A Comprehensive Review on Privacy-Preserving Metering in Smart Grid for Billing; Operation; and Rewarding Schemes, with Two Novel Solutions
In smart grid, the Utility Provider (UP) collects users power measurements' for two main reasons: billing and operation. Billing needs coarse-grained measurements where there are no, or minimal, privacy concerns. On the other hand, operation needs fine-grained measurements which can highly affect users' privacy. Hence, users might be reluctant to participate in operational metering to protect their privacy. To overcome this issue, UP might offer rewards to allure users to report their measurements which endangers their privacy. In this paper, we survey the literature on privacy-preserving metering in smart grid. We propose a new taxonomy to categorize the literature based on whether measurements need to be attributable to users or not. This categorization is highly effective because attribution is one of the main causes of privacy issues. Our survey shows that rewarding schemes and incentive-based demand response are new research topics with limited studies on it. Hence, we propose two privacy-preserving rewarding schemes for operational metering. First, a light-weight solution that utilizes an already established link of trust i.e. Banks. It is based on the assumption that banks will not leak a client account details. This solution is based on hash chains and blind signatures to assure users anonymity with minimal overhead for the UP and the smart meter. The bank in this approach is state-less in which is not required the bank to keep communications states of users and the UP. Second, we proposed another approach that does not rely on or banks or trusted third parties. It is based on Paillier homomorphic encryption and Pedersen commitments. It assumes that the smart meters are organized in a tree structure; which is widely used implementation in the literature. Security analysis for the proposed approaches is presented including unlinkability proof for measurements to users.
cs.CR
in smart grid the utility provider up collects users power measurements for two main reasons billing and operation billing needs coarsegrained measurements where there are no or minimal privacy concerns on the other hand operation needs finegrained measurements which can highly affect users privacy hence users might be reluctant to participate in operational metering to protect their privacy to overcome this issue up might offer rewards to allure users to report their measurements which endangers their privacy in this paper we survey the literature on privacypreserving metering in smart grid we propose a new taxonomy to categorize the literature based on whether measurements need to be attributable to users or not this categorization is highly effective because attribution is one of the main causes of privacy issues our survey shows that rewarding schemes and incentivebased demand response are new research topics with limited studies on it hence we propose two privacypreserving rewarding schemes for operational metering first a lightweight solution that utilizes an already established link of trust ie banks it is based on the assumption that banks will not leak a client account details this solution is based on hash chains and blind signatures to assure users anonymity with minimal overhead for the up and the smart meter the bank in this approach is stateless in which is not required the bank to keep communications states of users and the up second we proposed another approach that does not rely on or banks or trusted third parties it is based on paillier homomorphic encryption and pedersen commitments it assumes that the smart meters are organized in a tree structure which is widely used implementation in the literature security analysis for the proposed approaches is presented including unlinkability proof for measurements to users
[['in', 'smart', 'grid', 'the', 'utility', 'provider', 'up', 'collects', 'users', 'power', 'measurements', 'for', 'two', 'main', 'reasons', 'billing', 'and', 'operation', 'billing', 'needs', 'coarsegrained', 'measurements', 'where', 'there', 'are', 'no', 'or', 'minimal', 'privacy', 'concerns', 'on', 'the', 'other', 'hand', 'operation', 'needs', 'finegrained', 'measurements', 'which', 'can', 'highly', 'affect', 'users', 'privacy', 'hence', 'users', 'might', 'be', 'reluctant', 'to', 'participate', 'in', 'operational', 'metering', 'to', 'protect', 'their', 'privacy', 'to', 'overcome', 'this', 'issue', 'up', 'might', 'offer', 'rewards', 'to', 'allure', 'users', 'to', 'report', 'their', 'measurements', 'which', 'endangers', 'their', 'privacy', 'in', 'this', 'paper', 'we', 'survey', 'the', 'literature', 'on', 'privacypreserving', 'metering', 'in', 'smart', 'grid', 'we', 'propose', 'a', 'new', 'taxonomy', 'to', 'categorize', 'the', 'literature', 'based', 'on', 'whether', 'measurements', 'need', 'to', 'be', 'attributable', 'to', 'users', 'or', 'not', 'this', 'categorization', 'is', 'highly', 'effective', 'because', 'attribution', 'is', 'one', 'of', 'the', 'main', 'causes', 'of', 'privacy', 'issues', 'our', 'survey', 'shows', 'that', 'rewarding', 'schemes', 'and', 'incentivebased', 'demand', 'response', 'are', 'new', 'research', 'topics', 'with', 'limited', 'studies', 'on', 'it', 'hence', 'we', 'propose', 'two', 'privacypreserving', 'rewarding', 'schemes', 'for', 'operational', 'metering', 'first', 'a', 'lightweight', 'solution', 'that', 'utilizes', 'an', 'already', 'established', 'link', 'of', 'trust', 'ie', 'banks', 'it', 'is', 'based', 'on', 'the', 'assumption', 'that', 'banks', 'will', 'not', 'leak', 'a', 'client', 'account', 'details', 'this', 'solution', 'is', 'based', 'on', 'hash', 'chains', 'and', 'blind', 'signatures', 'to', 'assure', 'users', 'anonymity', 'with', 'minimal', 'overhead', 'for', 'the', 'up', 'and', 'the', 'smart', 'meter', 'the', 'bank', 'in', 'this', 'approach', 'is', 'stateless', 'in', 'which', 'is', 'not', 'required', 'the', 'bank', 'to', 'keep', 'communications', 'states', 'of', 'users', 'and', 'the', 'up', 'second', 'we', 'proposed', 'another', 'approach', 'that', 'does', 'not', 'rely', 'on', 'or', 'banks', 'or', 'trusted', 'third', 'parties', 'it', 'is', 'based', 'on', 'paillier', 'homomorphic', 'encryption', 'and', 'pedersen', 'commitments', 'it', 'assumes', 'that', 'the', 'smart', 'meters', 'are', 'organized', 'in', 'a', 'tree', 'structure', 'which', 'is', 'widely', 'used', 'implementation', 'in', 'the', 'literature', 'security', 'analysis', 'for', 'the', 'proposed', 'approaches', 'is', 'presented', 'including', 'unlinkability', 'proof', 'for', 'measurements', 'to', 'users']]
[-0.14685774839255933, 0.0012281055339399896, -0.05934701734079436, 0.05408541521664594, -0.16397134307334868, -0.2261717432969625, 0.12029987327800587, 0.3861142379397037, -0.24777052432629232, -0.31343112460340755, 0.14729550057972873, -0.3111985938753869, -0.11933737318548009, 0.18628509878478913, -0.19203570922447286, 0.04383897822216763, 0.032737485380643035, 0.006224745238492259, 0.020654920849860915, -0.3050610402105503, 0.3060450574014425, 0.07639040109548884, 0.3535254669340753, 0.095899511697629, 0.07577897363370951, -0.012804579937754282, -0.07380107180898812, -0.02558354576000683, -0.07751459236884646, 0.14526443568089303, 0.33986447127567726, 0.19358556176747457, 0.3496948912963843, -0.4386193201695998, -0.13642889560508595, 0.09042246392355921, 0.12176899466530099, 0.09007793436233755, -0.06583663837788722, -0.2894001131600767, 0.13365911741330966, -0.24079763177152938, -0.053902356316408606, -0.09757858636763596, -0.03539100376119894, 0.021753913055316668, -0.2725130899570113, -0.02230230970882315, 0.017309704337963586, 0.05117969270700227, -0.0013674978324158097, -0.05214592470841501, 0.0016714138854549301, 0.1742016994918827, 0.042038723542720535, -0.04746017664346729, 0.16054080356446448, -0.09142303880766581, -0.14161499837610503, 0.3930857108648447, 0.02606666535011941, -0.1943185480244763, 0.16046385747998787, -0.05231506974077164, -0.17554644969015448, 0.06399412089267446, 0.20729268033954604, 0.06661292117456755, -0.20784285514231662, 0.0027716385335510487, -0.025972159757396467, 0.2454792991409288, 0.048184636526553554, 0.06587453574258453, 0.17586270045948377, 0.16918070268032137, 0.15398521862173956, 0.05860329411368429, -0.03653686102670411, -0.10009253304610632, -0.24166192787952892, -0.13618596852677572, -0.16876120502480826, 0.023048470008350693, -0.012895075001681555, -0.12709763996504125, 0.36841593328990524, 0.23292792117248573, 0.12271119572966019, 0.03738952374265374, 0.4057326986177891, 0.05214639168046733, 0.1359620241364051, 0.13198339881744148, 0.19494235492073025, -0.007010475635836886, 0.18463061758835161, -0.12048837515128595, 0.1682446281188851, 0.011576736246556705]
1,802.08327
From Hazard Analysis to Hazard Mitigation Planning: The Automated Driving Case
Vehicle safety depends on (a) the range of identified hazards and (b) the operational situations for which mitigations of these hazards are acceptably decreasing risk. Moreover, with an increasing degree of autonomy, risk ownership is likely to increase for vendors towards regulatory certification. Hence, highly automated vehicles have to be equipped with verified controllers capable of reliably identifying and mitigating hazards in all possible operational situations. To this end, available methods for the design and verification of automated vehicle controllers have to be supported by models for hazard analysis and mitigation. In this paper, we describe (1) a framework for the analysis and design of planners (i.e., high-level controllers) capable of run-time hazard identification and mitigation, (2) an incremental algorithm for constructing planning models from hazard analysis, and (3) an exemplary application to the design of a fail-operational controller based on a given control system architecture. Our approach equips the safety engineer with concepts and steps to (2a) elaborate scenarios of endangerment and (2b) design operational strategies for mitigating such scenarios.
cs.SE cs.RO cs.SY
vehicle safety depends on a the range of identified hazards and b the operational situations for which mitigations of these hazards are acceptably decreasing risk moreover with an increasing degree of autonomy risk ownership is likely to increase for vendors towards regulatory certification hence highly automated vehicles have to be equipped with verified controllers capable of reliably identifying and mitigating hazards in all possible operational situations to this end available methods for the design and verification of automated vehicle controllers have to be supported by models for hazard analysis and mitigation in this paper we describe 1 a framework for the analysis and design of planners ie highlevel controllers capable of runtime hazard identification and mitigation 2 an incremental algorithm for constructing planning models from hazard analysis and 3 an exemplary application to the design of a failoperational controller based on a given control system architecture our approach equips the safety engineer with concepts and steps to 2a elaborate scenarios of endangerment and 2b design operational strategies for mitigating such scenarios
[['vehicle', 'safety', 'depends', 'on', 'a', 'the', 'range', 'of', 'identified', 'hazards', 'and', 'b', 'the', 'operational', 'situations', 'for', 'which', 'mitigations', 'of', 'these', 'hazards', 'are', 'acceptably', 'decreasing', 'risk', 'moreover', 'with', 'an', 'increasing', 'degree', 'of', 'autonomy', 'risk', 'ownership', 'is', 'likely', 'to', 'increase', 'for', 'vendors', 'towards', 'regulatory', 'certification', 'hence', 'highly', 'automated', 'vehicles', 'have', 'to', 'be', 'equipped', 'with', 'verified', 'controllers', 'capable', 'of', 'reliably', 'identifying', 'and', 'mitigating', 'hazards', 'in', 'all', 'possible', 'operational', 'situations', 'to', 'this', 'end', 'available', 'methods', 'for', 'the', 'design', 'and', 'verification', 'of', 'automated', 'vehicle', 'controllers', 'have', 'to', 'be', 'supported', 'by', 'models', 'for', 'hazard', 'analysis', 'and', 'mitigation', 'in', 'this', 'paper', 'we', 'describe', '1', 'a', 'framework', 'for', 'the', 'analysis', 'and', 'design', 'of', 'planners', 'ie', 'highlevel', 'controllers', 'capable', 'of', 'runtime', 'hazard', 'identification', 'and', 'mitigation', '2', 'an', 'incremental', 'algorithm', 'for', 'constructing', 'planning', 'models', 'from', 'hazard', 'analysis', 'and', '3', 'an', 'exemplary', 'application', 'to', 'the', 'design', 'of', 'a', 'failoperational', 'controller', 'based', 'on', 'a', 'given', 'control', 'system', 'architecture', 'our', 'approach', 'equips', 'the', 'safety', 'engineer', 'with', 'concepts', 'and', 'steps', 'to', '2a', 'elaborate', 'scenarios', 'of', 'endangerment', 'and', '2b', 'design', 'operational', 'strategies', 'for', 'mitigating', 'such', 'scenarios']]
[-0.11848123745219401, 0.029318992173342082, -0.046722201790459106, 0.040720372786881585, -0.061729774932916225, -0.2127675846632984, 0.0712639118595136, 0.39508041029262264, -0.20404559057015295, -0.3356262150204234, 0.17702082034924793, -0.23189833406522348, -0.14974018849625814, 0.2292828824676094, -0.17642953743976592, 0.10590267393258754, 0.04974066124199644, -0.025085980313277276, 0.004600423910009691, -0.21861109447703636, 0.2849848045618954, 0.0827660958190062, 0.2663126973985362, 0.03972248829307568, 0.10714589101561939, 0.016958212546602725, -0.01970588652980759, 0.0004071837389155438, -0.08276274158722824, 0.1519843194611937, 0.3662041849121863, 0.24596949577418684, 0.33863884203097844, -0.4167021629264393, -0.20313243017319524, 0.09900585504872343, 0.08955401034442959, 0.035261779091571466, -0.010196249168883596, -0.31688294649853954, 0.09120972603913506, -0.2528017561206879, -0.13255957571097937, -0.11698984309393716, 0.017519835380487396, 0.03215993194444628, -0.3217408095611728, -0.06280721638662119, 0.02826732407699813, 0.11387162513442729, -0.07400880992270963, -0.1116034033298438, 0.0014282853910372708, 0.16524494241865909, 0.04914134299812827, -0.020105632947899445, 0.18082765951120888, -0.11499957437218543, -0.17741788500288164, 0.3468480235216213, 0.0340891753402348, -0.199648897016519, 0.19815610381447823, 0.0016655046021367005, -0.15505792655878597, 0.10090014864064274, 0.24440610906577598, 0.06689465892016452, -0.19596622125463484, -0.008777201407499154, 0.09653669037197156, 0.16335023312736846, 0.024919643960979104, 0.0037581576715218046, 0.17629113650475003, 0.2628120146800726, 0.1547540336743825, 0.10614335166061656, -0.05708601105446268, -0.0656003276385198, -0.2894129480033764, -0.14591267295944238, -0.08649073429718854, -0.05198833452229938, -0.04679141594129356, -0.14359362287806315, 0.3714206819885481, 0.22414263490347835, 0.09621918804355357, 0.11244899516568481, 0.37177733814327474, 0.07459790010089654, 0.07525400769364426, 0.09524679165170119, 0.1729154953261979, 0.00017448552960410105, 0.0940096550021996, -0.2316560553705418, 0.1615970001899098, -0.02860814994282759]
1,802.08328
On Looking for Local Expansion Invariants in Argumentation Semantics: a Preliminary Report
We study invariant local expansion operators for conflict-free and admissible sets in Abstract Argumentation Frameworks (AFs). Such operators are directly applied on AFs, and are invariant with respect to a chosen "semantics" (that is w.r.t. each of the conflict free/admissible set of arguments). Accordingly, we derive a definition of robustness for AFs in terms of the number of times such operators can be applied without producing any change in the chosen semantics.
cs.AI
we study invariant local expansion operators for conflictfree and admissible sets in abstract argumentation frameworks afs such operators are directly applied on afs and are invariant with respect to a chosen semantics that is wrt each of the conflict freeadmissible set of arguments accordingly we derive a definition of robustness for afs in terms of the number of times such operators can be applied without producing any change in the chosen semantics
[['we', 'study', 'invariant', 'local', 'expansion', 'operators', 'for', 'conflictfree', 'and', 'admissible', 'sets', 'in', 'abstract', 'argumentation', 'frameworks', 'afs', 'such', 'operators', 'are', 'directly', 'applied', 'on', 'afs', 'and', 'are', 'invariant', 'with', 'respect', 'to', 'a', 'chosen', 'semantics', 'that', 'is', 'wrt', 'each', 'of', 'the', 'conflict', 'freeadmissible', 'set', 'of', 'arguments', 'accordingly', 'we', 'derive', 'a', 'definition', 'of', 'robustness', 'for', 'afs', 'in', 'terms', 'of', 'the', 'number', 'of', 'times', 'such', 'operators', 'can', 'be', 'applied', 'without', 'producing', 'any', 'change', 'in', 'the', 'chosen', 'semantics']]
[-0.15936984420872072, 0.10736943654794719, -0.06540297019019933, 0.086510769230917, -0.08203154436024038, -0.08775816809281077, 0.04272986615312771, 0.3762905057782019, -0.26145593396676575, -0.2961789933795726, 0.11174603380610458, -0.24866847301715275, -0.09041547604744703, 0.14218349801048533, -0.12030750927580915, 0.05398747684683283, 0.05120688213796263, 0.10686807997744452, -0.09568057957918606, -0.2008323265849547, 0.3608423824041662, -0.039273894851056625, 0.2518992589681711, 0.018134358106181026, 0.08324777167028105, -0.014262766111642122, -0.030272252719954287, 0.11223953599634935, -0.07116797685503884, 0.15191875428328633, 0.2897986200913577, 0.16765025063273561, 0.2371287020316846, -0.43206920687266637, -0.14474993367010439, 0.12658574881727322, 0.09501524186286499, 0.06694792365838945, 0.04649160658238902, -0.2873304318374311, 0.15172640142411414, -0.17693545719982506, -0.11876680472419715, -0.12854913486213698, 0.028260593420602907, 0.050275261331887415, -0.30538965488823366, -0.02040085527704845, 0.09271167142605277, 0.09658393641592751, -0.09016464724989189, -0.06828414070301912, -0.044448915144271205, 0.086515069184956, 0.022580256852859134, 0.05014295283455769, 0.11248865003474581, -0.05293246691810413, -0.17824724918677354, 0.38985881366780106, -0.06023757596185405, -0.27896825966923694, 0.192264528682744, -0.09025234866782393, -0.18033097760463265, 0.038106222946892004, 0.13484306226346746, 0.11604127531844965, -0.14427941560279578, 0.11599487872158086, -0.0469154405971648, 0.11553376712213258, 0.09490534529404741, 0.0898071559946197, 0.18168800818720754, 0.10643273906808504, 0.10273838962729968, 0.14385107790388849, 0.03334867213459187, -0.11464409267818423, -0.3597164643849705, -0.14626039788913978, -0.12001806430676033, -0.011406204387755461, -0.11917000248147712, -0.1909720410271482, 0.4173882449517997, 0.20441013071554856, 0.21872470483288797, 0.07496835564223814, 0.2188824620229048, 0.16553875219103925, 0.09482422035554765, 0.09197416067333289, 0.13524861354380846, 0.08980420940148999, 0.06689854297445903, -0.16169365231131375, 0.1289978182454869, 0.11622157257417558]
1,802.08329
Selmer groups of symmetric powers of ordinary modular Galois representations
Let $p$ be a fixed odd prime number, $\mu$ be a Hida family over the Iwasawa algebra of one variable, $\rho_{\mu}$ its Galois representation, $\mathbb{Q}_\infty/\mathbb{Q}$ the $p$-cyclotomic tower and $S$ the variable of the cyclotomic Iwasawa algebra. We compare, for $n\leq 4$ and under certain assumptions, the characteristic power series $L(S)$ of the dual of Selmer groups $\mathrm{Sel}(\mathbb{Q}_{\infty},\mathrm{Sym}^{2n}\otimes\mathrm{det}^{-n}\rho_{\mu})$ to certain congruence ideals. The case $n=1$ has been treated by H.Hida. In particular, we express the first term of the Taylor expansion at the trivial zero $S=0$ of $L(S)$ in terms of an $\mathcal{L}$-invariant and a congruence number. We conjecture the non-vanishing of this $\mathcal{L}$-invariant; this implies therefore that these Selmer groups are cotorsion. We also show that our $\mathcal{L}$-invariants coincide with Greenberg's $\mathcal{L}$-invariants calculated by R.Harron and A.Jorza.
math.NT
let p be a fixed odd prime number mu be a hida family over the iwasawa algebra of one variable rho_mu its galois representation mathbbq_inftymathbbq the pcyclotomic tower and s the variable of the cyclotomic iwasawa algebra we compare for nleq 4 and under certain assumptions the characteristic power series ls of the dual of selmer groups mathrmselmathbbq_inftymathrmsym2notimesmathrmdetnrho_mu to certain congruence ideals the case n1 has been treated by hhida in particular we express the first term of the taylor expansion at the trivial zero s0 of ls in terms of an mathcallinvariant and a congruence number we conjecture the nonvanishing of this mathcallinvariant this implies therefore that these selmer groups are cotorsion we also show that our mathcallinvariants coincide with greenbergs mathcallinvariants calculated by rharron and ajorza
[['let', 'p', 'be', 'a', 'fixed', 'odd', 'prime', 'number', 'mu', 'be', 'a', 'hida', 'family', 'over', 'the', 'iwasawa', 'algebra', 'of', 'one', 'variable', 'rho_mu', 'its', 'galois', 'representation', 'mathbbq_inftymathbbq', 'the', 'pcyclotomic', 'tower', 'and', 's', 'the', 'variable', 'of', 'the', 'cyclotomic', 'iwasawa', 'algebra', 'we', 'compare', 'for', 'nleq', '4', 'and', 'under', 'certain', 'assumptions', 'the', 'characteristic', 'power', 'series', 'ls', 'of', 'the', 'dual', 'of', 'selmer', 'groups', 'mathrmselmathbbq_inftymathrmsym2notimesmathrmdetnrho_mu', 'to', 'certain', 'congruence', 'ideals', 'the', 'case', 'n1', 'has', 'been', 'treated', 'by', 'hhida', 'in', 'particular', 'we', 'express', 'the', 'first', 'term', 'of', 'the', 'taylor', 'expansion', 'at', 'the', 'trivial', 'zero', 's0', 'of', 'ls', 'in', 'terms', 'of', 'an', 'mathcallinvariant', 'and', 'a', 'congruence', 'number', 'we', 'conjecture', 'the', 'nonvanishing', 'of', 'this', 'mathcallinvariant', 'this', 'implies', 'therefore', 'that', 'these', 'selmer', 'groups', 'are', 'cotorsion', 'we', 'also', 'show', 'that', 'our', 'mathcallinvariants', 'coincide', 'with', 'greenbergs', 'mathcallinvariants', 'calculated', 'by', 'rharron', 'and', 'ajorza']]
[-0.22809543082021116, 0.08343980484559273, -0.12799602419486253, 0.0805918673579619, -0.08872683988543363, -0.1411152604846208, -0.03957701297439029, 0.273894826783155, -0.3158404478742703, -0.23107386865781818, 0.07870590958433847, -0.2216246503318198, -0.10229652169788998, 0.17533209351860593, -0.10824028732221029, -0.02841211543692942, 0.003515257606116252, 0.15058599996221503, -0.06539348159288245, -0.35138819858193304, 0.3802948479457357, -0.01758057413229007, 0.18832819362273212, 0.004848865615639351, 0.06745447748817684, 0.026385985015762774, 0.018264746066273714, -0.04021939066829296, -0.14462066302135138, 0.11680095265354447, 0.30407889745750927, 0.045006054754527965, 0.23576115621859586, -0.35324386003374203, -0.10234084186462186, 0.22382894970809783, 0.12773722362878726, -0.04240143207863458, 0.015244412319204672, -0.2092029736320511, 0.17303585691559242, -0.2244403907741473, -0.16715461007372392, -0.0764244604795202, 0.048257762937223524, 0.02930698940734856, -0.26818373595644546, 0.014202216471407214, 0.08200483595785814, 0.1595099481973585, -0.08822131036057675, -0.16722284597382556, -0.022360259820366414, 0.046908536884267396, 0.056117118075035693, 0.02055416739644195, 0.046827458806820516, -0.091801772961711, -0.10561874190466554, 0.33910912775190366, -0.07837394966812032, -0.16448509776434764, 0.10606096623223124, -0.22261590687028035, -0.214044205212163, 0.127363968860146, 0.04053274966488645, 0.15243330960563287, 0.012535141349383971, 0.1981630774907677, -0.159463756954358, 0.07239773966243293, 0.1418029219934308, -0.017699673503061862, 0.1281861205721592, 0.017016523341625567, 0.022649877931831812, 0.15070450717651443, -0.02021122157073966, 0.02279035716764326, -0.37803690364902337, -0.21335633735861478, -0.13008383496066298, 0.11678783439962966, -0.1286469097339124, -0.1333496683216616, 0.40834497416588833, 0.09506839230217463, 0.15060368127272866, 0.14717904423795095, 0.17893196707894285, 0.10654832704874831, 0.07104832502612012, 0.05699052088524828, 0.12014264361913944, 0.22738435726264508, -0.04147319945911839, -0.20568065718573525, -0.03190066859436532, 0.18540681310270618]
1,802.0833
Kemeny's Function for Markov Chains and Markov Renewal Processes
Extensions of Kemeny's constant, as derived for irreducible finite Markov chains in discrete time, to Markov renewal processes and Markov chains in continuous time are discussed. Three alternative Kemeny's functions and their variants are considered. Typically, they lead to a constant if and only if the mean holding times between the states in the Markov renewal process are constant. However one particular variant leads to a constant, analogous to the discrete time Markov chain result. Specifically, if the state space is finite, the weighted sum of the mean first passage times (omitting the mean return time) with the stationary probabilities associated with the continuous time semi-Markov process is a constant for any Markov renewal process. Expressions for the Kemeny's functions and the relevant constants are derived for Markov renewal processes and special cases involving continuous time Markov chains and birth and death processes.
math.PR
extensions of kemenys constant as derived for irreducible finite markov chains in discrete time to markov renewal processes and markov chains in continuous time are discussed three alternative kemenys functions and their variants are considered typically they lead to a constant if and only if the mean holding times between the states in the markov renewal process are constant however one particular variant leads to a constant analogous to the discrete time markov chain result specifically if the state space is finite the weighted sum of the mean first passage times omitting the mean return time with the stationary probabilities associated with the continuous time semimarkov process is a constant for any markov renewal process expressions for the kemenys functions and the relevant constants are derived for markov renewal processes and special cases involving continuous time markov chains and birth and death processes
[['extensions', 'of', 'kemenys', 'constant', 'as', 'derived', 'for', 'irreducible', 'finite', 'markov', 'chains', 'in', 'discrete', 'time', 'to', 'markov', 'renewal', 'processes', 'and', 'markov', 'chains', 'in', 'continuous', 'time', 'are', 'discussed', 'three', 'alternative', 'kemenys', 'functions', 'and', 'their', 'variants', 'are', 'considered', 'typically', 'they', 'lead', 'to', 'a', 'constant', 'if', 'and', 'only', 'if', 'the', 'mean', 'holding', 'times', 'between', 'the', 'states', 'in', 'the', 'markov', 'renewal', 'process', 'are', 'constant', 'however', 'one', 'particular', 'variant', 'leads', 'to', 'a', 'constant', 'analogous', 'to', 'the', 'discrete', 'time', 'markov', 'chain', 'result', 'specifically', 'if', 'the', 'state', 'space', 'is', 'finite', 'the', 'weighted', 'sum', 'of', 'the', 'mean', 'first', 'passage', 'times', 'omitting', 'the', 'mean', 'return', 'time', 'with', 'the', 'stationary', 'probabilities', 'associated', 'with', 'the', 'continuous', 'time', 'semimarkov', 'process', 'is', 'a', 'constant', 'for', 'any', 'markov', 'renewal', 'process', 'expressions', 'for', 'the', 'kemenys', 'functions', 'and', 'the', 'relevant', 'constants', 'are', 'derived', 'for', 'markov', 'renewal', 'processes', 'and', 'special', 'cases', 'involving', 'continuous', 'time', 'markov', 'chains', 'and', 'birth', 'and', 'death', 'processes']]
[-0.08398672107646203, 0.23402482605949565, -0.027835582115954452, 0.11889285699221323, -0.041088656575656725, -0.15168198759804344, 0.09297540449859718, 0.4465862429485871, -0.3374369849476937, -0.17180045942899647, 0.19664395446286673, -0.2171044407389615, -0.05191090962217821, 0.16203180286981217, 0.00015097853265233808, 0.08073262363945792, 0.023082555532194935, 0.10008274363288722, -0.02274702928090872, -0.2313866154714064, 0.27180573670885533, 0.03532841534946452, 0.24339982271975988, -0.010255085085388404, 0.17461146817093234, 0.05357586998342686, -0.04537188703555718, -0.06330517841387474, -0.13975442375440697, 0.02363903665307818, 0.24441008770942585, 0.08767222608211678, 0.284985786811872, -0.4271677722633406, -0.22197106811608727, 0.21553771067215324, 0.09951643501831726, 0.09894623883537479, 0.027729591004667688, -0.2932746517992989, 0.028012285438867714, -0.1453469435918842, -0.09346506808122451, -0.01080400819916252, 0.05874018525213029, 0.10320749354851595, -0.3054234361490951, 0.10054977729564885, 0.08168021238969078, -0.0015498052116717908, -0.058631371191403193, -0.11200992774521164, 0.005914556657100891, 0.13891492587338378, 0.0950432750846217, -0.013758866881652104, 0.10473557227206501, -0.03648488260675352, -0.19550136346581645, 0.32428283127142, -0.1412308089454639, -0.23686536294701216, 0.18454497390820718, -0.13638378557964012, -0.19888214738974413, 0.15640210614692732, 0.12772530516596525, 0.15002483035717812, -0.1773485479667991, 0.12032781739050027, 0.012846686294419573, 0.10053344664222502, 0.05538593435829336, 0.014076183016014683, 0.11898074019700289, 0.10985402103962859, 0.09075793336305142, 0.13568674038340162, 0.0009941600073435039, -0.24755424842355656, -0.32190622513709993, -0.1781710573126907, -0.1722399402846146, 0.08423557796294091, -0.15262750074052875, -0.20928200309155054, 0.32962862519430114, 0.0763174375082459, 0.17597313780480853, 0.20693489489751263, 0.19043082925588725, 0.21682442191555132, -0.03301215709766725, 0.07775628961414308, 0.079782970661584, 0.180900706447192, 0.06403623420054784, -0.14050278027046967, 0.17410781242318088, 0.1062764398919718]
1,802.08331
Diverse Exploration for Fast and Safe Policy Improvement
We study an important yet under-addressed problem of quickly and safely improving policies in online reinforcement learning domains. As its solution, we propose a novel exploration strategy - diverse exploration (DE), which learns and deploys a diverse set of safe policies to explore the environment. We provide DE theory explaining why diversity in behavior policies enables effective exploration without sacrificing exploitation. Our empirical study shows that an online policy improvement algorithm framework implementing the DE strategy can achieve both fast policy improvement and safe online performance.
cs.LG
we study an important yet underaddressed problem of quickly and safely improving policies in online reinforcement learning domains as its solution we propose a novel exploration strategy diverse exploration de which learns and deploys a diverse set of safe policies to explore the environment we provide de theory explaining why diversity in behavior policies enables effective exploration without sacrificing exploitation our empirical study shows that an online policy improvement algorithm framework implementing the de strategy can achieve both fast policy improvement and safe online performance
[['we', 'study', 'an', 'important', 'yet', 'underaddressed', 'problem', 'of', 'quickly', 'and', 'safely', 'improving', 'policies', 'in', 'online', 'reinforcement', 'learning', 'domains', 'as', 'its', 'solution', 'we', 'propose', 'a', 'novel', 'exploration', 'strategy', 'diverse', 'exploration', 'de', 'which', 'learns', 'and', 'deploys', 'a', 'diverse', 'set', 'of', 'safe', 'policies', 'to', 'explore', 'the', 'environment', 'we', 'provide', 'de', 'theory', 'explaining', 'why', 'diversity', 'in', 'behavior', 'policies', 'enables', 'effective', 'exploration', 'without', 'sacrificing', 'exploitation', 'our', 'empirical', 'study', 'shows', 'that', 'an', 'online', 'policy', 'improvement', 'algorithm', 'framework', 'implementing', 'the', 'de', 'strategy', 'can', 'achieve', 'both', 'fast', 'policy', 'improvement', 'and', 'safe', 'online', 'performance']]
[-0.10551989384214668, -0.005924306741080192, -0.1640902443734162, 0.10440374392440871, -0.18326559047598173, -0.15987796354491043, 0.13487584664732874, 0.46858545414665165, -0.2426225194159676, -0.3787224437822314, 0.08154945200692643, -0.1872455654446693, -0.23249772727927742, 0.1818918157588033, -0.16210164145621306, 0.058206211983034495, 0.06894152450430042, -0.03963755205622874, -0.011622280427528655, -0.24821396261070142, 0.23629067617413752, 0.12527758948066656, 0.3828340501825818, 0.012812618029249065, 0.15968830558087896, 0.05081056480241172, -0.004902276226921993, 0.004018748535172027, -0.10193501759144162, 0.15571721792494989, 0.3890668001902454, 0.30086333942325677, 0.40076673510758315, -0.3705051381360082, -0.18512730998096658, 0.12902972166809965, 0.17026796102085534, 0.13229508652379188, -0.10566589345826823, -0.30834444713066606, 0.05450702661867527, -0.2123944118618965, -0.08686126398799174, -0.21696227757150635, -0.0821910881820847, -0.06948984390508164, -0.33453036246492585, -0.051201442559592095, 0.03318049734567895, 0.032341965967241454, -0.08052956736783552, -0.09693591823691831, 0.07749167275888955, 0.19498255418284852, 0.03278167003437, 0.04101885813014472, 0.15629068986677072, -0.15117727768169167, -0.2045069022980683, 0.33267273635548705, -0.05091159970444791, -0.1262804262651651, 0.19350541211007272, 0.021448788561803454, -0.1201108166400124, 0.09167023601339144, 0.2802749294623294, 0.15816553328186272, -0.1813267635400681, 0.0902816537875504, 0.009579399523927884, 0.15656216129222336, 0.007710074282744351, 0.026519853858660687, 0.15011615226428737, 0.3041773449629545, 0.16671021873240963, 0.12819153172895312, 0.023058563520145767, -0.14527058125857045, -0.19649469039457687, -0.14747622106943334, -0.08591899879221969, -0.041352637659977466, -0.15296116395089912, -0.14267266135224524, 0.3229463041157407, 0.22563889858805958, 0.1633867881315596, 0.12610234849511043, 0.32859245825778033, 0.013818907342091038, 0.0002950936829780831, 0.1809176874511382, 0.18366501187385223, -0.08222602983553182, 0.17883774272220976, -0.24696935252286495, 0.12555992336505475, 0.034231081298168965]
1,802.08332
Deep Multimodal Learning for Emotion Recognition in Spoken Language
In this paper, we present a novel deep multimodal framework to predict human emotions based on sentence-level spoken language. Our architecture has two distinctive characteristics. First, it extracts the high-level features from both text and audio via a hybrid deep multimodal structure, which considers the spatial information from text, temporal information from audio, and high-level associations from low-level handcrafted features. Second, we fuse all features by using a three-layer deep neural network to learn the correlations across modalities and train the feature extraction and fusion modules together, allowing optimal global fine-tuning of the entire structure. We evaluated the proposed framework on the IEMOCAP dataset. Our result shows promising performance, achieving 60.4% in weighted accuracy for five emotion categories.
cs.CL
in this paper we present a novel deep multimodal framework to predict human emotions based on sentencelevel spoken language our architecture has two distinctive characteristics first it extracts the highlevel features from both text and audio via a hybrid deep multimodal structure which considers the spatial information from text temporal information from audio and highlevel associations from lowlevel handcrafted features second we fuse all features by using a threelayer deep neural network to learn the correlations across modalities and train the feature extraction and fusion modules together allowing optimal global finetuning of the entire structure we evaluated the proposed framework on the iemocap dataset our result shows promising performance achieving 604 in weighted accuracy for five emotion categories
[['in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'deep', 'multimodal', 'framework', 'to', 'predict', 'human', 'emotions', 'based', 'on', 'sentencelevel', 'spoken', 'language', 'our', 'architecture', 'has', 'two', 'distinctive', 'characteristics', 'first', 'it', 'extracts', 'the', 'highlevel', 'features', 'from', 'both', 'text', 'and', 'audio', 'via', 'a', 'hybrid', 'deep', 'multimodal', 'structure', 'which', 'considers', 'the', 'spatial', 'information', 'from', 'text', 'temporal', 'information', 'from', 'audio', 'and', 'highlevel', 'associations', 'from', 'lowlevel', 'handcrafted', 'features', 'second', 'we', 'fuse', 'all', 'features', 'by', 'using', 'a', 'threelayer', 'deep', 'neural', 'network', 'to', 'learn', 'the', 'correlations', 'across', 'modalities', 'and', 'train', 'the', 'feature', 'extraction', 'and', 'fusion', 'modules', 'together', 'allowing', 'optimal', 'global', 'finetuning', 'of', 'the', 'entire', 'structure', 'we', 'evaluated', 'the', 'proposed', 'framework', 'on', 'the', 'iemocap', 'dataset', 'our', 'result', 'shows', 'promising', 'performance', 'achieving', '604', 'in', 'weighted', 'accuracy', 'for', 'five', 'emotion', 'categories']]
[-0.012629224397873475, -0.06785019558175641, -0.09596346421127791, 0.08228550427095073, -0.15268421448940822, -0.16122957320994366, 0.0063947383028265655, 0.47804247097791, -0.3070602242961147, -0.31241807583877346, -0.0018810166551147477, -0.29330316199368595, -0.22546733058673346, 0.1472364745134393, -0.10467829234045693, 0.07693278137841104, 0.14537113402196664, 0.08725305608773636, -0.036281899462248815, -0.21366919231230108, 0.35238774352849034, 0.008508093754999672, 0.3952330334222544, 0.0103563562082916, 0.1824888983480948, -0.02420501889250541, -0.07057326326493994, -0.07883247143245634, -0.019998857872343574, 0.24828776350773682, 0.3742313642919032, 0.23535136876813278, 0.3042737486125049, -0.4069279161823511, -0.24743851038461584, -0.0031890391206400373, 0.122525691496745, 0.10633693069369549, -0.022466247348840965, -0.4143643662396629, 0.10564053192797859, -0.17994555508544258, 0.1154805841397936, -0.1641302348323703, -0.03439830827637244, -0.02420002275730594, -0.2829943851457309, 0.03929580198364111, 0.09589212182593548, 0.10347583977568706, -0.09133019186832579, -0.10717821581475634, 0.005126214156053581, 0.21971171597508177, -0.02638120676580248, 0.047243693431097446, 0.14515600507927, -0.2058664489225721, -0.1360450398997735, 0.31736618073625583, -0.10914691595628984, -0.18301378864542409, 0.2041944272646491, -0.005709419131547339, -0.18330619188215017, 0.10086291611699735, 0.232196652595599, 0.10677541044966901, -0.21604600091074136, -0.04145272383742603, -0.044587756001974566, 0.26959339635036256, 0.05819307287397273, 0.03180237319636143, 0.21714814402897037, 0.3123310860601585, -0.06746321831340507, 0.1544043247911574, -0.18639407208696465, -0.0479667085475462, -0.1992492726254198, -0.07305858467737118, -0.13833053688167485, -0.07455900626383342, -0.10450651497783345, -0.09434391912706769, 0.48938641510903835, 0.24663652208144382, 0.23838653071325713, 0.11997104410779608, 0.3502082520211905, -0.028834916925515538, 0.14817054513684016, 0.10186540412369295, 0.1424790432132086, -0.03344572486821562, 0.17581915630075007, -0.14253861884319152, 0.07926935253870059, 0.08366886162301683]
1,802.08333
Off-Diagonal Series Expansion for Quantum Partition Functions
We derive an integral-free thermodynamic perturbation series expansion for quantum partition functions which enables an analytical term-by-term calculation of the series. The expansion is carried out around the partition function of the classical component of the Hamiltonian with the expansion parameter being the strength of the off-diagonal, or quantum, portion. To demonstrate the usefulness of the technique we analytically compute to third order the partition functions of the 1D Ising model with longitudinal and transverse fields, and the quantum 1D Heisenberg model.
cond-mat.stat-mech
we derive an integralfree thermodynamic perturbation series expansion for quantum partition functions which enables an analytical termbyterm calculation of the series the expansion is carried out around the partition function of the classical component of the hamiltonian with the expansion parameter being the strength of the offdiagonal or quantum portion to demonstrate the usefulness of the technique we analytically compute to third order the partition functions of the 1d ising model with longitudinal and transverse fields and the quantum 1d heisenberg model
[['we', 'derive', 'an', 'integralfree', 'thermodynamic', 'perturbation', 'series', 'expansion', 'for', 'quantum', 'partition', 'functions', 'which', 'enables', 'an', 'analytical', 'termbyterm', 'calculation', 'of', 'the', 'series', 'the', 'expansion', 'is', 'carried', 'out', 'around', 'the', 'partition', 'function', 'of', 'the', 'classical', 'component', 'of', 'the', 'hamiltonian', 'with', 'the', 'expansion', 'parameter', 'being', 'the', 'strength', 'of', 'the', 'offdiagonal', 'or', 'quantum', 'portion', 'to', 'demonstrate', 'the', 'usefulness', 'of', 'the', 'technique', 'we', 'analytically', 'compute', 'to', 'third', 'order', 'the', 'partition', 'functions', 'of', 'the', '1d', 'ising', 'model', 'with', 'longitudinal', 'and', 'transverse', 'fields', 'and', 'the', 'quantum', '1d', 'heisenberg', 'model']]
[-0.1345531362813057, 0.0979813857024632, -0.09124507701660438, 0.01621991623244135, -0.03849847748784757, -0.04967196477667951, 0.015957848739628567, 0.3035345336694906, -0.26030869979309146, -0.2328225408181003, 0.0566019399060368, -0.28827822152042487, -0.1249580075424846, 0.162080337378628, 0.11857817951226379, 0.08669601809006275, -0.0015938172355385088, 0.059029344003647566, -0.0988158665983597, -0.24157240098660313, 0.28738364697683877, 0.06256724642050203, 0.2724503097124398, 0.05718561700863264, 0.08229704604983874, 0.05840021688434318, 0.007781981824891551, -0.02544878622539705, -0.14944757747736465, 0.10599796921895, 0.16618368931387256, 0.04106342806707977, 0.23500337809460556, -0.4201202873004282, -0.19436131653989233, 0.07435601728502661, 0.1657001003168705, 0.1272463883520331, 0.048329861295159635, -0.2528755869262102, 0.02120471161381319, -0.23393642923385813, -0.1916117631580408, -0.14018644947308775, -0.027913508615910826, 0.0031748120644606833, -0.3063982511620696, 0.11150776429624273, 0.031085652385826973, 0.047705746551112434, -0.03739159279389352, -0.07197080927378521, 0.007554238809772381, 0.145086913997103, 0.03823470490254006, 0.037416069285671524, 0.0901572302881083, -0.1468263151203623, -0.10212442603689141, 0.3524895785149278, -0.07833287127673762, -0.22335515739169062, 0.11116473018134967, -0.1676033508464149, -0.10588557917124979, 0.07106084853592443, 0.10245659990838116, 0.11741360256493819, -0.12918963055012794, 0.14489835960557684, 0.015951557400091212, 0.1582054061568115, -0.004245913669853131, -0.01460758640953317, 0.20204684065609443, 0.06068392329928806, 0.011368963529537545, 0.2494398610036048, -0.09217997792563061, -0.19371242843931769, -0.3283924544002952, -0.1638941633878503, -0.24221399026673016, 0.06528843428780574, -0.16538783461501447, -0.26637452472251183, 0.4530291909170223, 0.14762844911128037, 0.175833448838647, 0.06948994719224595, 0.28425828903550054, 0.22022191548106693, 0.05354561863421667, 0.041215078672394156, 0.20770768513448717, 0.18996252470774713, 0.0484796065110259, -0.2664996748364235, -0.007091569316732447, 0.1600239667303224]
1,802.08334
Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification
We prove that the ordinary least-squares (OLS) estimator attains nearly minimax optimal performance for the identification of linear dynamical systems from a single observed trajectory. Our upper bound relies on a generalization of Mendelson's small-ball method to dependent data, eschewing the use of standard mixing-time arguments. Our lower bounds reveal that these upper bounds match up to logarithmic factors. In particular, we capture the correct signal-to-noise behavior of the problem, showing that more unstable linear systems are easier to estimate. This behavior is qualitatively different from arguments which rely on mixing-time calculations that suggest that unstable systems are more difficult to estimate. We generalize our technique to provide bounds for a more general class of linear response time-series.
cs.LG math.OC stat.ML
we prove that the ordinary leastsquares ols estimator attains nearly minimax optimal performance for the identification of linear dynamical systems from a single observed trajectory our upper bound relies on a generalization of mendelsons smallball method to dependent data eschewing the use of standard mixingtime arguments our lower bounds reveal that these upper bounds match up to logarithmic factors in particular we capture the correct signaltonoise behavior of the problem showing that more unstable linear systems are easier to estimate this behavior is qualitatively different from arguments which rely on mixingtime calculations that suggest that unstable systems are more difficult to estimate we generalize our technique to provide bounds for a more general class of linear response timeseries
[['we', 'prove', 'that', 'the', 'ordinary', 'leastsquares', 'ols', 'estimator', 'attains', 'nearly', 'minimax', 'optimal', 'performance', 'for', 'the', 'identification', 'of', 'linear', 'dynamical', 'systems', 'from', 'a', 'single', 'observed', 'trajectory', 'our', 'upper', 'bound', 'relies', 'on', 'a', 'generalization', 'of', 'mendelsons', 'smallball', 'method', 'to', 'dependent', 'data', 'eschewing', 'the', 'use', 'of', 'standard', 'mixingtime', 'arguments', 'our', 'lower', 'bounds', 'reveal', 'that', 'these', 'upper', 'bounds', 'match', 'up', 'to', 'logarithmic', 'factors', 'in', 'particular', 'we', 'capture', 'the', 'correct', 'signaltonoise', 'behavior', 'of', 'the', 'problem', 'showing', 'that', 'more', 'unstable', 'linear', 'systems', 'are', 'easier', 'to', 'estimate', 'this', 'behavior', 'is', 'qualitatively', 'different', 'from', 'arguments', 'which', 'rely', 'on', 'mixingtime', 'calculations', 'that', 'suggest', 'that', 'unstable', 'systems', 'are', 'more', 'difficult', 'to', 'estimate', 'we', 'generalize', 'our', 'technique', 'to', 'provide', 'bounds', 'for', 'a', 'more', 'general', 'class', 'of', 'linear', 'response', 'timeseries']]
[-0.07500083541644849, 0.03976726058361112, -0.1604171306560011, 0.12877632400546318, -0.10109546980780797, -0.18562684466954893, 0.0855397222950183, 0.3338391284307099, -0.22804781885292286, -0.30911476282864553, 0.11526264490372637, -0.2697642112437349, -0.19244605359824327, 0.28785233039201963, -0.07854342996341805, 0.08981978843927893, 0.06704597257408035, 0.030424805203080576, -0.10091522934400819, -0.2929311492014552, 0.2911183904203722, 0.04385525641692245, 0.28870248479338795, 0.0005108150753041363, 0.045557097564690195, -0.01550286279545508, 0.009360139067165362, -0.009874824983760333, -0.17534239462167114, 0.1720014133432912, 0.2465405290086682, 0.11833931763385797, 0.24905708920146918, -0.38060131199403197, -0.18395951986472067, 0.1008317260306456, 0.1304918427605373, 0.11563859230333255, -0.01195458818113125, -0.21875780020068344, 0.11674080338303207, -0.12177768852720913, -0.12506705701637727, -0.12295999756066972, -0.03368174297034613, 0.016614817556503236, -0.3364108157240682, 0.10155559512667167, 0.11054376753432174, 0.00867349615985474, -0.06150119073000442, -0.142241457227715, 0.029567142265936375, 0.09577558258036947, 0.042847158488793634, -0.03300284311318627, 0.11126186706237176, -0.0824625802357705, -0.1098381604314742, 0.31366777588796413, -0.11410749841652587, -0.2011300760966081, 0.20240714370758614, -0.14617585171855843, -0.15911280687970036, 0.15212320726818573, 0.2240132173626787, 0.15714060253678605, -0.12324389214348844, 0.03303281580392494, -0.09776198014847808, 0.19618314557159558, 0.040272341850094304, 0.05712020201220488, 0.11101360467628726, 0.1496124055622639, 0.15336310979910195, 0.12540250464191294, -0.04376966757779448, -0.10360572674176377, -0.27765732766009676, -0.07586891233222559, -0.17440167406940052, 0.026625073682039212, -0.12790463343421873, -0.1836763742294274, 0.3062689289008864, 0.21622516666976815, 0.2179043603121725, 0.17056340704429257, 0.29517796103102273, 0.1561146963449418, 0.02685742650945217, 0.10821591097559048, 0.27611176341644716, 0.12068975400020424, 0.027322682906260602, -0.21218572346927422, 0.10087702788301131, 0.0783295942685352]
1,802.08335
The Rise-Contact involution on Tamari intervals
We describe an involution on Tamari intervals and m-Tamari intervals. This involution switches two sets of statistics known as the "rises" and the "contacts" and so proves an open conjecture from Pr\'eville-Ratelle on intervals of the m-Tamari lattice.
math.CO
we describe an involution on tamari intervals and mtamari intervals this involution switches two sets of statistics known as the rises and the contacts and so proves an open conjecture from previlleratelle on intervals of the mtamari lattice
[['we', 'describe', 'an', 'involution', 'on', 'tamari', 'intervals', 'and', 'mtamari', 'intervals', 'this', 'involution', 'switches', 'two', 'sets', 'of', 'statistics', 'known', 'as', 'the', 'rises', 'and', 'the', 'contacts', 'and', 'so', 'proves', 'an', 'open', 'conjecture', 'from', 'previlleratelle', 'on', 'intervals', 'of', 'the', 'mtamari', 'lattice']]
[-0.20765094816880791, 0.1469530134873869, -0.07499865109198972, 0.12617100915859306, -0.04235193746066407, -0.1210262761206219, 0.12403832508349105, 0.3928485499008706, -0.3385743910544797, -0.2386134146149025, 0.09702729942326091, -0.33356224774309484, -0.09474590611889173, 0.21647523970980392, -0.15636103732609435, -0.0006919165730084243, 0.05223490689930163, 0.05655900033582982, -0.04899542933133872, -0.32500434078668294, 0.27918051509186625, -0.023883814255608933, 0.2531770433323752, 0.08596946906886603, 0.11009116311508574, 0.06656056281032138, -0.03153231704307377, -0.02465709777683706, -0.2059118161897028, 0.08848483197538085, 0.19821511199207684, 0.022855261561313744, 0.17530370484057226, -0.3753915830074172, -0.06817566388360176, 0.06815347262033213, 0.16722606093083558, 0.04410760237002059, 0.08796344183409881, -0.27453747369643106, -0.009334210674033352, -0.13469345818616843, -0.12766231828075097, -0.0265504862917097, 0.09341216240519364, 0.032720589863234444, -0.2330053509458115, -0.01010076123240747, 0.11679488351862681, 0.15274007660091707, -0.02223075793958024, -0.12910442798104332, -0.026732151347555612, 0.07978859612424123, 0.018126705024195344, 0.06342496988853734, 0.0152942839470741, 0.005774538578024428, -0.22054229225767286, 0.32203351745479986, 0.05895534738604175, -0.18104224495197596, 0.14902340370156852, -0.12359085806498402, -0.17179016895151059, 0.04549810773153838, 0.07122793006036725, 0.11480475032294635, -0.08950399036372178, 0.10383819764951784, -0.13065721403415265, 0.1369558015966935, 0.15284216435209505, -0.04236281813293891, 0.2079278006169357, 0.11841370415334639, 0.08214356304195367, 0.1707648107610447, -0.0014239161790005471, -0.04728520181226103, -0.3305794929129709, -0.10920908723614718, -0.17494511434587798, 0.08375588020211772, -0.09242101340733873, -0.2422229339809794, 0.3932806712232138, 0.15044241940823236, 0.248623967856953, 0.13954633031971753, 0.13808979483713446, 0.05918108174074931, 0.05561798645526563, 0.02412930425060423, 0.0543039654822726, 0.18087930553347656, -0.03952717609507473, -0.16275818809548295, -0.009436612066469695, 0.14729169192478844]
1,802.08336
Decameter Type III Bursts with Changing Frequency Drift-Rate Signs
We discuss properties of type III bursts which change sign of their drift rate from negative to positive and vice versa. Moreover such bursts may change sign of their drift rates more than once. These specific type III bursts were observed simultaneously by radio telescopes UTR-2, URAN-2 and NDA in frequency band 8-41 MHz. The negative drift rates of these bursts are close to those of usual decameter type III bursts and variate from -0.84 MHz/s to -5.56 MHz/s. The positive drift rates of specific type III bursts vary in the wider range from 0.44MHz/s to 12 MHz/s. Unlike inverted U-bursts these type III bursts still drift from the high frequencies to the low frequencies in spite of the change of the drift rates signs. Our basic explanation of the positive drift rate of these type III burst differs from the common assumption that positive drift rates of Type III bursts are connected with electron beam propagation towards the Sun. We propose that, even if electron beams move outward from the Sun, they can generate type III bursts with positive drift rates if in some regions of the solar corona the group velocities of type III radio emissions are lower than the velocities of the electron beams.
astro-ph.SR
we discuss properties of type iii bursts which change sign of their drift rate from negative to positive and vice versa moreover such bursts may change sign of their drift rates more than once these specific type iii bursts were observed simultaneously by radio telescopes utr2 uran2 and nda in frequency band 841 mhz the negative drift rates of these bursts are close to those of usual decameter type iii bursts and variate from 084 mhzs to 556 mhzs the positive drift rates of specific type iii bursts vary in the wider range from 044mhzs to 12 mhzs unlike inverted ubursts these type iii bursts still drift from the high frequencies to the low frequencies in spite of the change of the drift rates signs our basic explanation of the positive drift rate of these type iii burst differs from the common assumption that positive drift rates of type iii bursts are connected with electron beam propagation towards the sun we propose that even if electron beams move outward from the sun they can generate type iii bursts with positive drift rates if in some regions of the solar corona the group velocities of type iii radio emissions are lower than the velocities of the electron beams
[['we', 'discuss', 'properties', 'of', 'type', 'iii', 'bursts', 'which', 'change', 'sign', 'of', 'their', 'drift', 'rate', 'from', 'negative', 'to', 'positive', 'and', 'vice', 'versa', 'moreover', 'such', 'bursts', 'may', 'change', 'sign', 'of', 'their', 'drift', 'rates', 'more', 'than', 'once', 'these', 'specific', 'type', 'iii', 'bursts', 'were', 'observed', 'simultaneously', 'by', 'radio', 'telescopes', 'utr2', 'uran2', 'and', 'nda', 'in', 'frequency', 'band', '841', 'mhz', 'the', 'negative', 'drift', 'rates', 'of', 'these', 'bursts', 'are', 'close', 'to', 'those', 'of', 'usual', 'decameter', 'type', 'iii', 'bursts', 'and', 'variate', 'from', '084', 'mhzs', 'to', '556', 'mhzs', 'the', 'positive', 'drift', 'rates', 'of', 'specific', 'type', 'iii', 'bursts', 'vary', 'in', 'the', 'wider', 'range', 'from', '044mhzs', 'to', '12', 'mhzs', 'unlike', 'inverted', 'ubursts', 'these', 'type', 'iii', 'bursts', 'still', 'drift', 'from', 'the', 'high', 'frequencies', 'to', 'the', 'low', 'frequencies', 'in', 'spite', 'of', 'the', 'change', 'of', 'the', 'drift', 'rates', 'signs', 'our', 'basic', 'explanation', 'of', 'the', 'positive', 'drift', 'rate', 'of', 'these', 'type', 'iii', 'burst', 'differs', 'from', 'the', 'common', 'assumption', 'that', 'positive', 'drift', 'rates', 'of', 'type', 'iii', 'bursts', 'are', 'connected', 'with', 'electron', 'beam', 'propagation', 'towards', 'the', 'sun', 'we', 'propose', 'that', 'even', 'if', 'electron', 'beams', 'move', 'outward', 'from', 'the', 'sun', 'they', 'can', 'generate', 'type', 'iii', 'bursts', 'with', 'positive', 'drift', 'rates', 'if', 'in', 'some', 'regions', 'of', 'the', 'solar', 'corona', 'the', 'group', 'velocities', 'of', 'type', 'iii', 'radio', 'emissions', 'are', 'lower', 'than', 'the', 'velocities', 'of', 'the', 'electron', 'beams']]
[-0.08570865207765414, 0.2101728991860777, 0.05513795048664708, 0.10956552319083977, -0.1098844977242655, -0.17555973002488173, 0.09133530588983332, 0.4176773370867505, -0.26024999800906745, -0.28009162894992645, 0.1023659947197161, -0.28298751074025064, -0.05361476466647413, 0.23774576960221946, -0.03788976460094717, -0.07652793628009923, 0.03951236559982294, -0.012384602067612329, -0.0879349446628306, -0.15778189513253646, 0.2796982271953947, 0.09441526760392398, 0.26994296553933506, -0.06023830136067225, 0.058315558387283056, -0.09461688708052834, -0.06473436719484772, -0.024781357017752616, -0.10220214593721819, 0.0458581008503634, 0.20192486603825704, 0.12319248311393396, 0.2331507324684158, -0.4066073749603215, -0.2141640613316694, 0.11416670998323311, 0.13828481921532815, 0.0558522735637312, -0.06460364852972313, -0.2688213854155603, 0.0783108900961222, -0.17320737456767232, -0.1533197782666974, 0.09063006633693732, 0.07975425771934894, 0.15125113667200266, -0.24499539651193666, 0.1748819323482661, 0.06139612717110917, 0.028385231911105292, -0.09723368034815615, -0.12386108333814563, -3.0783062701303405e-05, 0.10025953575833113, 0.09091852832748329, -0.009897557779518182, 0.13503879505589386, -0.10875204260301667, -0.08719807140330232, 0.3209524198064526, -0.08244933749156895, -0.08938214308537036, 0.2467819767036629, -0.28135893912576204, -0.07911731374621825, 0.22636431968517745, 0.17298714835558412, 0.08117010879886417, -0.09878098446303907, -0.02338654883570395, 0.060373946962181874, 0.14672650780203272, 0.11239298687370729, 0.05358530464808194, 0.228149405088348, 0.03648810459355128, 0.06084432122885313, 0.027228841764933783, -0.2126885392404731, 0.0024938101770618512, -0.2918099045721832, -0.10229492526686777, -0.09655183627387708, 0.11135422897601989, -0.08232600118681502, -0.13828232742504679, 0.405474876410789, 0.08432580279573477, 0.1721574386730971, 0.0684669733593394, 0.19315819072003648, 0.1251960308319274, 0.08264915959330872, 0.08462831714231231, 0.2835268610892015, 0.10495924827127347, 0.15229580870115209, -0.23083717470256232, 0.11052337139438007, 0.03684428163321781]
1,802.08337
The left-curtain martingale coupling in the presence of atoms
Beiglb\"ock and Juillet ("On a problem of optimal transport under marginal martingale constraints") introduced the left-curtain martingale coupling of probability measures $\mu$ and $\nu$, and proved that, when the initial law $\mu$ is continuous, it is supported by the graphs of two functions. We extend the later result by constructing the generalised left-curtain martingale coupling and show that for an arbitrary starting law $\mu$ it is characterised by two appropriately defined lower and upper functions. As an application of this result we derive the model-independent upper bound of an American put option. This extends recent results of Hobson and Norgilas ("Robust bounds for the American Put") on the atom-free case.
math.PR
beiglbock and juillet on a problem of optimal transport under marginal martingale constraints introduced the leftcurtain martingale coupling of probability measures mu and nu and proved that when the initial law mu is continuous it is supported by the graphs of two functions we extend the later result by constructing the generalised leftcurtain martingale coupling and show that for an arbitrary starting law mu it is characterised by two appropriately defined lower and upper functions as an application of this result we derive the modelindependent upper bound of an american put option this extends recent results of hobson and norgilas robust bounds for the american put on the atomfree case
[['beiglbock', 'and', 'juillet', 'on', 'a', 'problem', 'of', 'optimal', 'transport', 'under', 'marginal', 'martingale', 'constraints', 'introduced', 'the', 'leftcurtain', 'martingale', 'coupling', 'of', 'probability', 'measures', 'mu', 'and', 'nu', 'and', 'proved', 'that', 'when', 'the', 'initial', 'law', 'mu', 'is', 'continuous', 'it', 'is', 'supported', 'by', 'the', 'graphs', 'of', 'two', 'functions', 'we', 'extend', 'the', 'later', 'result', 'by', 'constructing', 'the', 'generalised', 'leftcurtain', 'martingale', 'coupling', 'and', 'show', 'that', 'for', 'an', 'arbitrary', 'starting', 'law', 'mu', 'it', 'is', 'characterised', 'by', 'two', 'appropriately', 'defined', 'lower', 'and', 'upper', 'functions', 'as', 'an', 'application', 'of', 'this', 'result', 'we', 'derive', 'the', 'modelindependent', 'upper', 'bound', 'of', 'an', 'american', 'put', 'option', 'this', 'extends', 'recent', 'results', 'of', 'hobson', 'and', 'norgilas', 'robust', 'bounds', 'for', 'the', 'american', 'put', 'on', 'the', 'atomfree', 'case']]
[-0.11009335856876173, 0.10241014938820217, -0.10268512134517141, 0.10187521496245108, -0.05439564255877919, -0.14080283979227373, 0.10945006598795362, 0.30655722803684005, -0.2450713240904648, -0.26027152366047607, 0.13741861214784376, -0.21475583422553102, -0.11653612985984858, 0.23853016971319982, -0.0751590516435307, 0.05354060574409065, -0.005444360247582471, -0.031519641864771415, -0.0005736635938348727, -0.24208665807483667, 0.31619848450645804, 0.050308575845161164, 0.2733871890146525, 0.09139174496094961, 0.13372029180407796, 0.02694655617340169, -0.07134575174198649, -0.018796830796935688, -0.22238910763266542, 0.13162012829513656, 0.1873054769436974, 0.09955361882788599, 0.2599337768715319, -0.36857409356589166, -0.13771629699189727, 0.13253882912696774, 0.059280643207576436, 0.009069029126453017, -0.021291738429422908, -0.32323129992684296, 0.0525075443849446, -0.15958683459310358, -0.13986472244195025, -0.024354047928039635, 0.07176643195604786, 0.025938599809380503, -0.3592040312194496, 0.0564288257561419, 0.12073282918405778, 0.0004172526741050047, -0.0707989549691524, -0.15746163180815653, -0.003587275192380772, 0.07176100994580972, 0.08212083336521248, 0.04458678643637841, 0.06492634963483439, -0.06354553299024701, -0.13053549171228884, 0.30094282957938834, -0.12247950809691614, -0.2499611240324624, 0.1402630667979701, -0.14287554536339478, -0.15385712050926795, 0.03932235887650093, 0.1148252069326374, 0.12229989431309835, -0.17340075488508264, 0.18723473319070363, -0.10476466084386163, 0.09157215869011477, 0.10657520635254306, 0.009623491307805985, 0.12165166022589242, 0.12160876631702579, 0.1715367510573033, 0.15434516453901903, -0.01690853236044475, -0.09278178835125349, -0.29979797717559775, -0.12719112120989556, -0.21166440323764169, 0.08521533516073308, -0.12806081684619197, -0.12060138005485604, 0.30261510946369224, 0.10007328669064776, 0.17596904296052018, 0.13484312734916942, 0.21706155552785125, 0.2260718043934161, -0.04244378688873364, 0.07874942652095075, 0.20760189735868928, 0.13721129818340985, 0.04799966250093431, -0.1544077875169524, 0.082764538762228, 0.10889504161671898]
1,802.08338
Application of Multivariate Data Analysis to machine power measurements as a means of tool life Predictive Maintenance for reducing product waste
Modern manufacturing industries are increasingly looking to predictive analytics to gain decision making information from process data. This is driven by high levels of competition and a need to reduce operating costs. The presented work takes data in the form of a power measurement recorded during a medical device manufacturing process and uses multivariate data analysis (MVDA) to extract information leading to the proposal of a predictive maintenance scheduling algorithm. The proposed MVDA model was able to predict with 100 % accuracy the condition of a grinding tool.
eess.SP
modern manufacturing industries are increasingly looking to predictive analytics to gain decision making information from process data this is driven by high levels of competition and a need to reduce operating costs the presented work takes data in the form of a power measurement recorded during a medical device manufacturing process and uses multivariate data analysis mvda to extract information leading to the proposal of a predictive maintenance scheduling algorithm the proposed mvda model was able to predict with 100 accuracy the condition of a grinding tool
[['modern', 'manufacturing', 'industries', 'are', 'increasingly', 'looking', 'to', 'predictive', 'analytics', 'to', 'gain', 'decision', 'making', 'information', 'from', 'process', 'data', 'this', 'is', 'driven', 'by', 'high', 'levels', 'of', 'competition', 'and', 'a', 'need', 'to', 'reduce', 'operating', 'costs', 'the', 'presented', 'work', 'takes', 'data', 'in', 'the', 'form', 'of', 'a', 'power', 'measurement', 'recorded', 'during', 'a', 'medical', 'device', 'manufacturing', 'process', 'and', 'uses', 'multivariate', 'data', 'analysis', 'mvda', 'to', 'extract', 'information', 'leading', 'to', 'the', 'proposal', 'of', 'a', 'predictive', 'maintenance', 'scheduling', 'algorithm', 'the', 'proposed', 'mvda', 'model', 'was', 'able', 'to', 'predict', 'with', '100', 'accuracy', 'the', 'condition', 'of', 'a', 'grinding', 'tool']]
[-0.053715611117538704, 0.05127505460304433, -0.1234548957054985, 0.04019589393672128, -0.12472252304740679, -0.16297841866918164, 0.09185972139667506, 0.35298269267739923, -0.27071803188936294, -0.38472697524161176, 0.15154315327359738, -0.29362341261136976, -0.10309505119020569, 0.1925805075383135, -0.11352522062116313, 0.1173888015314594, 0.09701449354580635, 0.013297377785817644, 0.024423298115531605, -0.24972389807560663, 0.2312094402237228, 0.14436686993844208, 0.38580516918466007, 0.04433846419099076, 0.12393720925152676, 0.009544228530092829, -0.0900787435065227, -0.05493924882659025, -0.0753238286994312, 0.15825143937642375, 0.35403553773274365, 0.19211851706963845, 0.34828019388362597, -0.4374268263064582, -0.1796611225146843, 0.0968793294628033, 0.08742973445004773, 0.06111414317341372, -0.034937072783473064, -0.24888550379880886, 0.07368339844925821, -0.1939984372891914, -0.08634436349973254, -0.11117991225676205, -0.026024920930122507, -0.0420371470865847, -0.36283346274118317, 0.008974660958709389, 0.02453511523018623, 0.06132667649794241, -0.02883188825785771, -0.06008646067301475, -0.02399667842185189, 0.15226294471207877, 0.025023884785591744, 0.029488017383813, 0.19813528138844447, -0.13933136533335622, -0.14496850487829624, 0.3819417352734626, -0.0055627431265538796, -0.1495729011440671, 0.15088053994100198, -0.08802264173054831, -0.12518362310747133, 0.14908955453349085, 0.2528169459138794, 0.011795943389491489, -0.23900998752007538, -0.005165852425652075, 0.1177911364243248, 0.17992229781638103, 0.027125044415394466, -0.03398114295098288, 0.16232452484853993, 0.2859115792202881, 0.018520593418386477, 0.1435329756356947, -0.09414548435698039, -0.09715936229371562, -0.19103980281165447, -0.12338516294913388, -0.1511199358882832, 0.007216074026253973, -0.07920934120694914, -0.12194781827515569, 0.3560090177055534, 0.20929771539723052, 0.17150264133327245, 0.02297474466392706, 0.3615037081870197, 0.08510898501309834, 0.1122251804757478, 0.05922585236037086, 0.16406902763992548, 0.059792264998922574, 0.19473537337570185, -0.16085480106726888, 0.12665538222732386, -0.04155419896431695]
1,802.08339
A Class of Tests for Trend in Time Censored Recurrent Event Data
Statistical tests for trend in recurrent event data not following a Poisson process are generally constructed for event censored data. However, time censored data are more frequently encountered in practice. In this paper we contribute to filling an important gap in the literature on trend testing by presenting a class of statistical tests for trend in time censored recurrent event data, based on the null hypothesis of a renewal process. The class of tests is constructed by an adaption of a functional central limit theorem for renewal processes. By this approach a number of tests for time censored recurrent event data can be constructed, including among others a version of the classical Lewis-Robinson trend test and an Anderson-Darling type test. The latter test turns out to have attractive properties for general use by having good power properties against both monotonic and non-monotonic trends. Extensions to situations with several processes are considered. Properties of the tests are studied by simulations, and the approach is illustrated in two data examples.
stat.ME
statistical tests for trend in recurrent event data not following a poisson process are generally constructed for event censored data however time censored data are more frequently encountered in practice in this paper we contribute to filling an important gap in the literature on trend testing by presenting a class of statistical tests for trend in time censored recurrent event data based on the null hypothesis of a renewal process the class of tests is constructed by an adaption of a functional central limit theorem for renewal processes by this approach a number of tests for time censored recurrent event data can be constructed including among others a version of the classical lewisrobinson trend test and an andersondarling type test the latter test turns out to have attractive properties for general use by having good power properties against both monotonic and nonmonotonic trends extensions to situations with several processes are considered properties of the tests are studied by simulations and the approach is illustrated in two data examples
[['statistical', 'tests', 'for', 'trend', 'in', 'recurrent', 'event', 'data', 'not', 'following', 'a', 'poisson', 'process', 'are', 'generally', 'constructed', 'for', 'event', 'censored', 'data', 'however', 'time', 'censored', 'data', 'are', 'more', 'frequently', 'encountered', 'in', 'practice', 'in', 'this', 'paper', 'we', 'contribute', 'to', 'filling', 'an', 'important', 'gap', 'in', 'the', 'literature', 'on', 'trend', 'testing', 'by', 'presenting', 'a', 'class', 'of', 'statistical', 'tests', 'for', 'trend', 'in', 'time', 'censored', 'recurrent', 'event', 'data', 'based', 'on', 'the', 'null', 'hypothesis', 'of', 'a', 'renewal', 'process', 'the', 'class', 'of', 'tests', 'is', 'constructed', 'by', 'an', 'adaption', 'of', 'a', 'functional', 'central', 'limit', 'theorem', 'for', 'renewal', 'processes', 'by', 'this', 'approach', 'a', 'number', 'of', 'tests', 'for', 'time', 'censored', 'recurrent', 'event', 'data', 'can', 'be', 'constructed', 'including', 'among', 'others', 'a', 'version', 'of', 'the', 'classical', 'lewisrobinson', 'trend', 'test', 'and', 'an', 'andersondarling', 'type', 'test', 'the', 'latter', 'test', 'turns', 'out', 'to', 'have', 'attractive', 'properties', 'for', 'general', 'use', 'by', 'having', 'good', 'power', 'properties', 'against', 'both', 'monotonic', 'and', 'nonmonotonic', 'trends', 'extensions', 'to', 'situations', 'with', 'several', 'processes', 'are', 'considered', 'properties', 'of', 'the', 'tests', 'are', 'studied', 'by', 'simulations', 'and', 'the', 'approach', 'is', 'illustrated', 'in', 'two', 'data', 'examples']]
[-0.06519794434763514, 0.043875906572096515, -0.09620119465660014, 0.14992863368490886, -0.04685602524501835, -0.15861078222912406, 0.07403019805436029, 0.38906151455587257, -0.2213128575285573, -0.2912553008645773, 0.16348385442993577, -0.2910829115976875, -0.11517667732463625, 0.2582027136186461, -0.07691143145561664, 0.08811019429613552, 0.07781028146381506, 0.009883887870627606, -0.028992967153439287, -0.26114995376706057, 0.3098777218381623, 0.08932059875014656, 0.3090972111722131, -0.043171825074217095, 0.04340698765060993, 0.009888514329841037, -0.09215980050611326, 0.044337715911762623, -0.08645371843441696, 0.061269517289474607, 0.2746193053446219, 0.15307628688845829, 0.3111283601244945, -0.42523652257141237, -0.22291554372289224, 0.10289131343074723, 0.10071178815678922, 0.05255487950415557, -0.08290572149700326, -0.26522902997132547, 0.08829634307540708, -0.16528669799521878, -0.12484131558536145, -0.07059003074212881, 0.034370557163161654, 0.047219809107789154, -0.30747370944849167, 0.11693171778983788, 0.09143207300019389, 0.07767597897240368, -0.020349180654895875, -0.07368624697698693, 0.03958675526584426, 0.07184075532985773, 0.11809698313378456, -0.03599609488838849, 0.10363328545270654, -0.09623519861289931, -0.1644941244140535, 0.34590411843163166, -0.04546999607916955, -0.20143518954638145, 0.1929572875817825, -0.10922942078856383, -0.20393827493988467, 0.07911540757206653, 0.17801106258150481, 0.10074024048806754, -0.23086316724207454, 0.05573345370511218, -0.024368880143734867, 0.12013917684716781, 0.025674049837325148, -0.02261124390371222, 0.19164187554548867, 0.20045039255707386, 0.003201325258106261, 0.11728755511485688, -0.09707669632629251, -0.1285665900736467, -0.3077653241985126, -0.13230136266915116, -0.18341675881313127, 0.005940263372972122, -0.09478083047376246, -0.1718979470242194, 0.37215160134019787, 0.16385987173894165, 0.19652339918427392, 0.09222862966920523, 0.2373107268424805, 0.10817907778560155, 0.0564705598067693, 0.04251794075777386, 0.17655367348733508, 0.0939571507634807, 0.0922092179137611, -0.11749971477268821, 0.12394942178162272, 0.0181827650636903]
1,802.0834
Phonons and Thermal Conducting Properties of Borocarbonitride (BCN) Nanosheets
Hexagonal borocarbonitrides (BCN) are a class of 2D materials, which display excellent catalytic activity for water splitting. Here, we report analysis of thermal stability, phonons and thermal conductivity of BCN monolayers over a wide range of temperatures using classical molecular dynamics simulations. Our results show that in contrast to the case of graphene and boron nitride monolayers, the out-of-plane phonons in BCN monolayers induce an asymmetry in the phonon density of states at all temperatures. Despite possessing lower thermal conducting properties compared to graphene and BN monolayers, the BCN nanosheets do not lose thermal conductivity as much as graphene and BN in the studied temperature range of 200-1000 K, and thus, the BCN nanosheets are suitable for thermal interface device applications over a wide range of temperatures. Besides their promising role in water splitting, the above results highlight the possibility of expanding the use of BCN 2D materials in thermal management applications and thermoelectrics.
cond-mat.mes-hall
hexagonal borocarbonitrides bcn are a class of 2d materials which display excellent catalytic activity for water splitting here we report analysis of thermal stability phonons and thermal conductivity of bcn monolayers over a wide range of temperatures using classical molecular dynamics simulations our results show that in contrast to the case of graphene and boron nitride monolayers the outofplane phonons in bcn monolayers induce an asymmetry in the phonon density of states at all temperatures despite possessing lower thermal conducting properties compared to graphene and bn monolayers the bcn nanosheets do not lose thermal conductivity as much as graphene and bn in the studied temperature range of 2001000 k and thus the bcn nanosheets are suitable for thermal interface device applications over a wide range of temperatures besides their promising role in water splitting the above results highlight the possibility of expanding the use of bcn 2d materials in thermal management applications and thermoelectrics
[['hexagonal', 'borocarbonitrides', 'bcn', 'are', 'a', 'class', 'of', '2d', 'materials', 'which', 'display', 'excellent', 'catalytic', 'activity', 'for', 'water', 'splitting', 'here', 'we', 'report', 'analysis', 'of', 'thermal', 'stability', 'phonons', 'and', 'thermal', 'conductivity', 'of', 'bcn', 'monolayers', 'over', 'a', 'wide', 'range', 'of', 'temperatures', 'using', 'classical', 'molecular', 'dynamics', 'simulations', 'our', 'results', 'show', 'that', 'in', 'contrast', 'to', 'the', 'case', 'of', 'graphene', 'and', 'boron', 'nitride', 'monolayers', 'the', 'outofplane', 'phonons', 'in', 'bcn', 'monolayers', 'induce', 'an', 'asymmetry', 'in', 'the', 'phonon', 'density', 'of', 'states', 'at', 'all', 'temperatures', 'despite', 'possessing', 'lower', 'thermal', 'conducting', 'properties', 'compared', 'to', 'graphene', 'and', 'bn', 'monolayers', 'the', 'bcn', 'nanosheets', 'do', 'not', 'lose', 'thermal', 'conductivity', 'as', 'much', 'as', 'graphene', 'and', 'bn', 'in', 'the', 'studied', 'temperature', 'range', 'of', '2001000', 'k', 'and', 'thus', 'the', 'bcn', 'nanosheets', 'are', 'suitable', 'for', 'thermal', 'interface', 'device', 'applications', 'over', 'a', 'wide', 'range', 'of', 'temperatures', 'besides', 'their', 'promising', 'role', 'in', 'water', 'splitting', 'the', 'above', 'results', 'highlight', 'the', 'possibility', 'of', 'expanding', 'the', 'use', 'of', 'bcn', '2d', 'materials', 'in', 'thermal', 'management', 'applications', 'and', 'thermoelectrics']]
[-0.10964298302465988, 0.1454104767737376, -0.003547940101912793, -0.08007707077518313, 0.02104637035613064, -0.12946549593318812, 0.09241928578068326, 0.45898311904150674, -0.28407562645859835, -0.2633981141292192, 0.0054931221354838, -0.3213237425361096, -0.14525627236344602, 0.23649585241333163, 0.05272954585419867, 0.049092357850396166, 0.03205847919513806, -0.12239261313297427, -0.06546006905481074, -0.18595657728496767, 0.2071141101833847, 0.037238502751707155, 0.33797621458854066, 0.15511117184084225, 0.027843393994117872, -0.02362470819730482, 0.13049201350628697, 0.0352281176065113, -0.17056555845007168, 0.08299900831850976, 0.26453019658048804, -0.14649854438817678, 0.21090682858321208, -0.4467521435520277, -0.27695693260095283, 0.011625486100016442, 0.12448931508545392, 0.12031729002926404, -0.08160828160475088, -0.2028546809672311, 0.0924121517371508, -0.11299831761363772, -0.12931516106861332, -0.1108846541606742, 0.01241956839529688, 0.020495777899472444, -0.18431809683500794, 0.10500551472278008, 0.060565849431346054, 0.08728584731789002, -0.13993344415174006, -0.20540928941987016, -0.1388453669721273, 0.07769042352485331, -0.0011944987604187594, -0.0482029727130544, 0.23867527624969584, -0.1315811417656007, -0.07719720403353374, 0.43791526064179304, -0.08276546225590888, -0.09436419437140275, 0.23574692600032351, -0.15117030016304864, -0.0893508303922668, 0.1678286305844808, 0.1422840649523815, 0.13046225538672088, -0.13898104405619532, 0.07981703317575035, -0.026064717232894906, 0.1346807877915102, 0.09445055708703068, 0.14674302888425445, 0.2662632023866952, 0.2209524463518261, 0.02756353512290695, 0.15190339918412707, -0.08309079805279479, -0.01967631496969927, -0.1748480617245233, -0.2506421781202103, -0.2021173864574129, 0.0908474031397525, -0.09085348262424958, -0.21897720418919145, 0.41194902103564707, 0.13633256323454487, 0.15064111757974805, 0.004430437059555616, 0.2194479981960814, 0.0568573094099407, 0.07912465809613126, 0.008772369571565802, 0.2580718649916497, 0.18587700931318835, 0.14847429720776192, -0.2267097935774455, 0.036275942426394016, -0.06171740957207101]
1,802.08341
Embeddability on functions: order and chaos
We study the quasi-order of topological embeddability on definable functions between Polish zero-dimensional spaces. We first study the descriptive complexity of this quasi-order restricted to the space of continuous functions. Our main result is the following dichotomy: the embeddability quasi-order restricted to continuous functions from a given compact space to another is either an analytic complete quasi-order or a well-quasi-order. We then turn to the existence of maximal elements with respect to embeddability in a given Baire class. It is proved that the class of continuous functions is the only Baire class to admit a maximal element. We prove that no Baire class admits a maximal element, except for the class of continuous functions which admits a maximum element.
math.LO
we study the quasiorder of topological embeddability on definable functions between polish zerodimensional spaces we first study the descriptive complexity of this quasiorder restricted to the space of continuous functions our main result is the following dichotomy the embeddability quasiorder restricted to continuous functions from a given compact space to another is either an analytic complete quasiorder or a wellquasiorder we then turn to the existence of maximal elements with respect to embeddability in a given baire class it is proved that the class of continuous functions is the only baire class to admit a maximal element we prove that no baire class admits a maximal element except for the class of continuous functions which admits a maximum element
[['we', 'study', 'the', 'quasiorder', 'of', 'topological', 'embeddability', 'on', 'definable', 'functions', 'between', 'polish', 'zerodimensional', 'spaces', 'we', 'first', 'study', 'the', 'descriptive', 'complexity', 'of', 'this', 'quasiorder', 'restricted', 'to', 'the', 'space', 'of', 'continuous', 'functions', 'our', 'main', 'result', 'is', 'the', 'following', 'dichotomy', 'the', 'embeddability', 'quasiorder', 'restricted', 'to', 'continuous', 'functions', 'from', 'a', 'given', 'compact', 'space', 'to', 'another', 'is', 'either', 'an', 'analytic', 'complete', 'quasiorder', 'or', 'a', 'wellquasiorder', 'we', 'then', 'turn', 'to', 'the', 'existence', 'of', 'maximal', 'elements', 'with', 'respect', 'to', 'embeddability', 'in', 'a', 'given', 'baire', 'class', 'it', 'is', 'proved', 'that', 'the', 'class', 'of', 'continuous', 'functions', 'is', 'the', 'only', 'baire', 'class', 'to', 'admit', 'a', 'maximal', 'element', 'we', 'prove', 'that', 'no', 'baire', 'class', 'admits', 'a', 'maximal', 'element', 'except', 'for', 'the', 'class', 'of', 'continuous', 'functions', 'which', 'admits', 'a', 'maximum', 'element']]
[-0.13832253286568055, 0.09615173727039643, -0.07803918145393499, 0.10082245637964019, -0.14555603192978295, -0.0703295954276158, 0.05521993396975914, 0.38636291316639976, -0.32981280148217157, -0.1291296492715194, 0.08567977046785767, -0.2647804801739721, -0.09880251042004831, 0.19132954869693256, -0.1234452663568639, 0.03711595931364333, 0.03443360054755912, 0.04462003795539632, -0.12703498820735126, -0.25223128193159816, 0.4479462862163469, -0.10498424220102362, 0.22520232388452321, 0.03926308396734109, 0.12395435818197097, -0.015996346524094835, 0.0036416959150561263, 0.07567274763724305, -0.19015849071435978, 0.1308218048408064, 0.2944214313737109, 0.16582396103092664, 0.2947269019029033, -0.28901289371350986, -0.17229503685874598, 0.2588738254232316, 0.021824063833982943, -0.021013742348985325, -0.03127676037535416, -0.27553865260311533, 0.13322283743250676, -0.13840358602587416, -0.1405325318459703, -0.06280598967891782, 0.09796135791600878, 0.0027727806009352207, -0.28412415278965936, -0.037803674617610056, 0.17247739088322436, 0.051270066314384716, -0.08412831424571135, -0.011711699328533992, -0.06164949497857577, 0.09366437789843175, -0.03421113078145921, 0.10816118388021943, 0.017765133140780844, -0.03744658456622239, -0.11081012077003467, 0.3835923723923434, -0.0696386485497522, -0.2556461513887684, 0.20106624015176497, -0.20607387317156717, -0.1938383583049877, 0.10769249466365251, 0.08906716322956779, 0.16284520183729023, -0.0715081627879824, 0.21350693784090652, -0.17543896747862592, 0.18129832116777406, 0.06571642871351302, 0.05730621822221408, 0.08403120923321694, 0.1587302042132228, 0.16366691365368477, 0.2017805760671549, 0.09112575723194838, -0.05060121272406893, -0.3683541931462388, -0.17025807822326652, -0.16838522132548714, 0.10371921973756883, -0.08664307859530594, -0.28711917918926777, 0.4017772410268418, 0.04232776507797862, 0.1374211888682066, 0.16446005881024414, 0.19623765548957245, 0.10126679871884808, 0.025689843349440508, 0.07859999650478863, 0.15039753287780186, 0.1507770397598628, -0.07491377281306796, -0.1415168459218058, 0.05636379965620131, 0.21825404273455634]
1,802.08342
Wigner distributions for n arbitrary observables
We study a generalization of the Wigner function to arbitrary tuples of hermitian operators. We show that for any collection of hermitian operators A1...An , and any quantum state there is a unique joint distribution on R^n, with the property that the marginals of all linear combinations of the operators coincide with their quantum counterpart. In other words, we consider the inverse Radon transform of the exact quantum probability distributions of all linear combinations. We call it the Wigner distribution, because for position and momentum this property defines the standard Wigner function. We discuss the application to finite dimensional systems, establish many basic properties and illustrate these by examples. The properties include the support, the location of singularities, positivity, the behavior under symmetry groups, and informational completeness.
quant-ph
we study a generalization of the wigner function to arbitrary tuples of hermitian operators we show that for any collection of hermitian operators a1an and any quantum state there is a unique joint distribution on rn with the property that the marginals of all linear combinations of the operators coincide with their quantum counterpart in other words we consider the inverse radon transform of the exact quantum probability distributions of all linear combinations we call it the wigner distribution because for position and momentum this property defines the standard wigner function we discuss the application to finite dimensional systems establish many basic properties and illustrate these by examples the properties include the support the location of singularities positivity the behavior under symmetry groups and informational completeness
[['we', 'study', 'a', 'generalization', 'of', 'the', 'wigner', 'function', 'to', 'arbitrary', 'tuples', 'of', 'hermitian', 'operators', 'we', 'show', 'that', 'for', 'any', 'collection', 'of', 'hermitian', 'operators', 'a1an', 'and', 'any', 'quantum', 'state', 'there', 'is', 'a', 'unique', 'joint', 'distribution', 'on', 'rn', 'with', 'the', 'property', 'that', 'the', 'marginals', 'of', 'all', 'linear', 'combinations', 'of', 'the', 'operators', 'coincide', 'with', 'their', 'quantum', 'counterpart', 'in', 'other', 'words', 'we', 'consider', 'the', 'inverse', 'radon', 'transform', 'of', 'the', 'exact', 'quantum', 'probability', 'distributions', 'of', 'all', 'linear', 'combinations', 'we', 'call', 'it', 'the', 'wigner', 'distribution', 'because', 'for', 'position', 'and', 'momentum', 'this', 'property', 'defines', 'the', 'standard', 'wigner', 'function', 'we', 'discuss', 'the', 'application', 'to', 'finite', 'dimensional', 'systems', 'establish', 'many', 'basic', 'properties', 'and', 'illustrate', 'these', 'by', 'examples', 'the', 'properties', 'include', 'the', 'support', 'the', 'location', 'of', 'singularities', 'positivity', 'the', 'behavior', 'under', 'symmetry', 'groups', 'and', 'informational', 'completeness']]
[-0.11792498162388801, 0.10685399176925421, -0.07735989733040333, 0.09603545711934566, -0.059241131096147, -0.09129248578846455, 0.03252277213521302, 0.36368675830960273, -0.29325224648416043, -0.18221136744692923, 0.09783600365603343, -0.3059196935072541, -0.16532180477306246, 0.158143731654156, -0.052018597558140756, 0.12184683185070753, 0.028487011186778547, 0.0741517624668777, -0.15717963462043555, -0.23220222838036716, 0.40352998741716145, -0.012863098076544703, 0.28524595591425894, 0.02984974123677239, 0.12822838558629154, 0.0823173679637257, -0.010825183838605881, -0.019886339336633682, -0.11445886058791074, 0.09800285629183055, 0.22159815664123744, 0.1659264972321689, 0.2358460888825357, -0.3733798447549343, -0.1961235668361187, 0.1701360885053873, 0.07093110686540603, 0.06433867560396903, -0.04906720973271877, -0.28173950961977245, 0.08543040220998227, -0.1523884581848979, -0.18836072860192507, -0.1073082809895277, 0.011404389828443526, 0.07029090733453632, -0.23814007954858243, 0.05596576199308038, 0.1159027015734464, 0.048320338555262424, -0.07832079134136438, -0.11533749366551638, 0.007133748564869166, 0.11090653851628303, -0.002379956289194524, -0.05595764983259142, 0.08589887980930508, -0.10874735983350547, -0.13623152027465404, 0.3673897132202983, -0.032263597674667834, -0.2786460617482662, 0.16524421326629818, -0.19769532477110624, -0.12586918213404716, 0.05208287534117699, 0.13272363158036024, 0.11393999791517853, -0.11604648831486702, 0.15690784196881577, -0.08163606210425496, 0.12211360967904329, 0.06821421839296818, 0.12586548218876123, 0.1685546128693968, 0.02990244881808758, 0.09716587362391874, 0.17407314689876513, -0.026324428955093026, -0.1317607474476099, -0.3587615055590868, -0.22763079265784472, -0.19810825958289205, 0.07959862533956766, -0.10725113479746505, -0.20395228885300457, 0.41896813233196734, 0.1206701926398091, 0.23384100289642812, 0.1079320822712034, 0.21969694034010173, 0.16279087658971547, 0.054644307827576996, 0.0589753882214427, 0.13997588293813168, 0.1745422669276595, 0.029196607146412135, -0.2080981186358258, 0.04474275289848447, 0.09883922808617353]
1,802.08343
Properties of the Wigner distribution for n arbitrary operators
We study a generalization of the Wigner function to arbitrary tuples of hermitian operators, which is a distribution uniquely characterized by the property that the marginals for all linear combinations of the given operators agree with the quantum mechanical distributions. Its role as a joint quasi-probability distribution is underlined by the property that its support always lies in the set of expectation value tuples of the operators. We characterize the set of singularities and positivity, and provide some basic examples.
quant-ph
we study a generalization of the wigner function to arbitrary tuples of hermitian operators which is a distribution uniquely characterized by the property that the marginals for all linear combinations of the given operators agree with the quantum mechanical distributions its role as a joint quasiprobability distribution is underlined by the property that its support always lies in the set of expectation value tuples of the operators we characterize the set of singularities and positivity and provide some basic examples
[['we', 'study', 'a', 'generalization', 'of', 'the', 'wigner', 'function', 'to', 'arbitrary', 'tuples', 'of', 'hermitian', 'operators', 'which', 'is', 'a', 'distribution', 'uniquely', 'characterized', 'by', 'the', 'property', 'that', 'the', 'marginals', 'for', 'all', 'linear', 'combinations', 'of', 'the', 'given', 'operators', 'agree', 'with', 'the', 'quantum', 'mechanical', 'distributions', 'its', 'role', 'as', 'a', 'joint', 'quasiprobability', 'distribution', 'is', 'underlined', 'by', 'the', 'property', 'that', 'its', 'support', 'always', 'lies', 'in', 'the', 'set', 'of', 'expectation', 'value', 'tuples', 'of', 'the', 'operators', 'we', 'characterize', 'the', 'set', 'of', 'singularities', 'and', 'positivity', 'and', 'provide', 'some', 'basic', 'examples']]
[-0.12647697688662446, 0.1150278520071879, -0.08125373137299903, 0.06809283863112796, -0.0436009497687337, -0.08174676235648803, 0.050687597430078314, 0.3185380332171917, -0.27767386239866026, -0.20479780558962374, 0.10045934010267957, -0.2932694980641827, -0.1572831588971894, 0.1589987991261296, -0.05109131128992885, 0.1218315602032817, 0.04536459073424339, 0.07090508115688862, -0.12195793976425193, -0.23036736218491569, 0.427824598402367, 0.029691117878246586, 0.2502544918272179, 0.0470047140668612, 0.13991018795059063, 0.04198072302460787, -0.012162002676632255, 0.017176809906959533, -0.09304793846768007, 0.1268799174344167, 0.22621268134826095, 0.19669253195170314, 0.26722437629359774, -0.3334145572967827, -0.17915236370172352, 0.17176387197105214, 0.08557212756713853, 0.03688267792422266, -0.010791868185333443, -0.2649329035237315, 0.11044196537113748, -0.15615569114743266, -0.17971176628489047, -0.11530196465319023, 0.023941486398689447, 0.05998221614572685, -0.2933553477516398, 0.04860829380922951, 0.10543661923147737, 0.0505417730395493, -0.07055089124769438, -0.10938889650860802, -0.0289658899710048, 0.12347897497238591, -0.015521635703044013, -0.016665304240450495, 0.10996266564325197, -0.12190351980680134, -0.1279772462119581, 0.36092348739039154, -0.023933447408489884, -0.27936898775515145, 0.09987913792137988, -0.20244239699677563, -0.09089777528424747, 0.058459816058166324, 0.09242302081547678, 0.12242672257707454, -0.1303616289398633, 0.1296706467270269, -0.11677932221791706, 0.08070255598868244, 0.05628290923777968, 0.1261204257782083, 0.18507036208175123, 0.047489604097791016, 0.0694006206060294, 0.15419235705048778, 0.024653296859469265, -0.11673049908713437, -0.37932150153210387, -0.18025625818409025, -0.24913392339512938, 0.04873951768968254, -0.11503854926522764, -0.20328240753151477, 0.4563871754333377, 0.09928429501887877, 0.2820753660867922, 0.11204939232120523, 0.21715489143971353, 0.17694444221742742, 0.05516027297126129, 0.051982165616936984, 0.16710961906537705, 0.20407759863592217, 0.025470743188634515, -0.2068012160147191, 0.09478864184347913, 0.08468744527781383]
1,802.08344
On coadjoint orbits for $p$-Sylow subgroups of finite classical groups
Kirillov's orbit theory provides a powerful tool for the investigation of irreducible unitary representations of many classes of Lie groups. In a previous paper we used a modification hereof, called monomial linearisation, to construct a monomial basis of the regular representation of $p$-Sylow subgroups $U$ of the finite classical groups of untwisted type. In this sequel to this article we determine the stabilizers of special orbit generators and show, that for the groups of Lie type ${\mathfrak{B}}_n$ and ${\mathfrak{D}}_n$ a subclass of the orbit modules decompose the $U$-modules affording the Andr\'{e}-Neto supercharacters into a direct sum of submodules. Moreover these special orbit modules are either isomorphic or have no irreducible constituent in common, and each irreducible $U$ module is up to isomorphism constituent of precisely one of these.
math.RT
kirillovs orbit theory provides a powerful tool for the investigation of irreducible unitary representations of many classes of lie groups in a previous paper we used a modification hereof called monomial linearisation to construct a monomial basis of the regular representation of psylow subgroups u of the finite classical groups of untwisted type in this sequel to this article we determine the stabilizers of special orbit generators and show that for the groups of lie type mathfrakb_n and mathfrakd_n a subclass of the orbit modules decompose the umodules affording the andreneto supercharacters into a direct sum of submodules moreover these special orbit modules are either isomorphic or have no irreducible constituent in common and each irreducible u module is up to isomorphism constituent of precisely one of these
[['kirillovs', 'orbit', 'theory', 'provides', 'a', 'powerful', 'tool', 'for', 'the', 'investigation', 'of', 'irreducible', 'unitary', 'representations', 'of', 'many', 'classes', 'of', 'lie', 'groups', 'in', 'a', 'previous', 'paper', 'we', 'used', 'a', 'modification', 'hereof', 'called', 'monomial', 'linearisation', 'to', 'construct', 'a', 'monomial', 'basis', 'of', 'the', 'regular', 'representation', 'of', 'psylow', 'subgroups', 'u', 'of', 'the', 'finite', 'classical', 'groups', 'of', 'untwisted', 'type', 'in', 'this', 'sequel', 'to', 'this', 'article', 'we', 'determine', 'the', 'stabilizers', 'of', 'special', 'orbit', 'generators', 'and', 'show', 'that', 'for', 'the', 'groups', 'of', 'lie', 'type', 'mathfrakb_n', 'and', 'mathfrakd_n', 'a', 'subclass', 'of', 'the', 'orbit', 'modules', 'decompose', 'the', 'umodules', 'affording', 'the', 'andreneto', 'supercharacters', 'into', 'a', 'direct', 'sum', 'of', 'submodules', 'moreover', 'these', 'special', 'orbit', 'modules', 'are', 'either', 'isomorphic', 'or', 'have', 'no', 'irreducible', 'constituent', 'in', 'common', 'and', 'each', 'irreducible', 'u', 'module', 'is', 'up', 'to', 'isomorphism', 'constituent', 'of', 'precisely', 'one', 'of', 'these']]
[-0.1770823499416962, 0.06896270676294253, -0.10071816215003353, 0.03562659296597029, -0.11891268193721771, -0.12310928711667657, -0.0006615318494686295, 0.35897739247847643, -0.3515372166025733, -0.17965196991073235, 0.0908873001582891, -0.21415645372684275, -0.11813268693356169, 0.18715764345076408, -0.0894484397630015, -0.041396360526541394, 0.10634736092908988, 0.12300824552833561, -0.11174746434520035, -0.26262516461844954, 0.38290032121308504, -0.04018161225406128, 0.20419571845097437, -0.043129787937412775, 0.12372370229827033, 0.04763979243580252, -0.042583753645885736, -0.041435289928423505, -0.12067502870582208, 0.16393139004145588, 0.3169052710919271, 0.054376576883008794, 0.2137857340267002, -0.3576708766853526, -0.11641455357450814, 0.22497675883480245, 0.14869559095019386, 0.01922591226840658, -0.0118914052127077, -0.23755915183111995, 0.11577093262328869, -0.2689015412710548, -0.16351021076774314, -0.06403185000702266, 0.08490915818228609, 0.010165702196813765, -0.2255138154113887, -0.0016701224866130994, 0.12504573971483976, 0.11349830836323756, -0.06664928024180145, -0.11923208337513701, -0.044412673887101906, 0.1332666086243643, -0.038456439190278094, 0.005752927538687511, 0.0740979461088067, -0.0768848363760977, -0.12848113364140903, 0.41354054636839366, -0.019553841468656345, -0.20611801492937265, 0.18791689431583064, -0.15277679154782423, -0.20346029704096652, 0.11131490917233307, 0.10407682742908715, 0.11626601576923377, -0.08624435863679364, 0.16042081146761553, -0.13100310140067623, 0.052065497429649686, 0.07848886845795999, 0.010541684732454577, 0.1636011494149912, 0.10131742424582915, 0.051677426638817116, 0.1370487767197783, 0.053107025615486594, 0.02412377694799077, -0.34661846331483315, -0.2111334127285296, -0.06952343329543337, 0.08782935842302525, -0.0691832852468314, -0.19431858205805635, 0.4764480505375162, 0.08374479907693708, 0.14972435088369937, 0.08843163271907657, 0.2039985524874831, 0.038871764656274566, 0.1002199515582077, 0.04737962512964649, 0.1409368059978569, 0.23900352007458134, -0.11528377655509209, -0.14796428463333064, -0.046381971224152024, 0.2238228201555709]
1,802.08345
Web-Based VR Experiments Powered by the Crowd
We build on the increasing availability of Virtual Reality (VR) devices and Web technologies to conduct behavioral experiments in VR using crowdsourcing techniques. A new recruiting and validation method allows us to create a panel of eligible experiment participants recruited from Amazon Mechanical Turk. Using this panel, we ran three different crowdsourced VR experiments, each reproducing one of three VR illusions: place illusion, embodiment illusion, and plausibility illusion. Our experience and worker feedback on these experiments show that conducting Web-based VR experiments using crowdsourcing is already feasible, though some challenges---including scale---remain. Such crowdsourced VR experiments on the Web have the potential to finally support replicable VR experiments with diverse populations at a low cost.
cs.HC
we build on the increasing availability of virtual reality vr devices and web technologies to conduct behavioral experiments in vr using crowdsourcing techniques a new recruiting and validation method allows us to create a panel of eligible experiment participants recruited from amazon mechanical turk using this panel we ran three different crowdsourced vr experiments each reproducing one of three vr illusions place illusion embodiment illusion and plausibility illusion our experience and worker feedback on these experiments show that conducting webbased vr experiments using crowdsourcing is already feasible though some challengesincluding scaleremain such crowdsourced vr experiments on the web have the potential to finally support replicable vr experiments with diverse populations at a low cost
[['we', 'build', 'on', 'the', 'increasing', 'availability', 'of', 'virtual', 'reality', 'vr', 'devices', 'and', 'web', 'technologies', 'to', 'conduct', 'behavioral', 'experiments', 'in', 'vr', 'using', 'crowdsourcing', 'techniques', 'a', 'new', 'recruiting', 'and', 'validation', 'method', 'allows', 'us', 'to', 'create', 'a', 'panel', 'of', 'eligible', 'experiment', 'participants', 'recruited', 'from', 'amazon', 'mechanical', 'turk', 'using', 'this', 'panel', 'we', 'ran', 'three', 'different', 'crowdsourced', 'vr', 'experiments', 'each', 'reproducing', 'one', 'of', 'three', 'vr', 'illusions', 'place', 'illusion', 'embodiment', 'illusion', 'and', 'plausibility', 'illusion', 'our', 'experience', 'and', 'worker', 'feedback', 'on', 'these', 'experiments', 'show', 'that', 'conducting', 'webbased', 'vr', 'experiments', 'using', 'crowdsourcing', 'is', 'already', 'feasible', 'though', 'some', 'challengesincluding', 'scaleremain', 'such', 'crowdsourced', 'vr', 'experiments', 'on', 'the', 'web', 'have', 'the', 'potential', 'to', 'finally', 'support', 'replicable', 'vr', 'experiments', 'with', 'diverse', 'populations', 'at', 'a', 'low', 'cost']]
[-0.06511694093933329, 0.024967740805420493, -0.09297255077191428, 0.026569022091280203, -0.15343330702619692, -0.18995935985003598, 0.11171646953360843, 0.4854137397238186, -0.19354021238645405, -0.36813569996905116, 0.04448098492555021, -0.331265842061969, -0.18997671169095806, 0.24151451073339558, -0.09885669114009943, 0.05751130749350913, 0.1251305222519607, 0.01976232794653957, 0.034856328144607165, -0.30092085567386156, 0.2728258534053956, 0.019033749045255326, 0.3511501746667948, 0.06333677217376785, 0.10101788233025998, -0.021853598429255987, -0.04592600980790199, 0.036698604361195715, -0.055331767683583166, 0.16809933969956806, 0.2801717002564276, 0.27171160788845683, 0.4088969501400633, -0.4800952046477635, -0.1393301431006486, 0.04503177284745367, 0.1179577338999869, 0.03780546496688787, -0.14016337520505268, -0.37066486321522724, 0.04701027732413162, -0.23018064829063536, -0.0884213086500105, -0.11225562984223611, 0.030696112729076828, 0.034480929715316834, -0.2907645526076002, -0.03964629485770794, -0.1088881774714017, 0.18251798286135973, -0.09671466122186498, -0.06214928339094123, 0.0412428266655687, 0.21624383221413673, 0.030948185110381537, -0.017089435772504658, 0.19946715414153005, -0.13658226970281767, -0.18647341296725375, 0.40560694950753323, -0.005716260026279737, -0.1396880463407797, 0.2853183584000882, -0.07678550643218582, -0.08860576397481575, 0.031843398818247284, 0.26369881242447135, 0.03663042180206893, -0.13189824427744107, -0.010193204294929663, -0.08118971964826674, 0.18170419672865787, 0.03908505254938583, -0.01615076664477653, 0.18184060189897927, 0.20844076478325796, -0.019432825838781094, 0.06845945195319862, -0.04417065265131116, -0.05259933204589678, -0.243468284440626, -0.17451932062561223, -0.1610225987886744, 0.0027950384371381786, -0.08642454287317898, -0.12401737370029357, 0.3404993657854253, 0.2316926255173582, 0.14725870827637014, 0.029736660146487078, 0.3740692947592054, -0.027674044302589858, 0.14977814149044985, 0.01743496911616863, 0.1677795446950248, -0.10749094870074519, 0.2222637488697988, -0.18514847317107655, 0.03693674177546719, -0.04164146444652163]
1,802.08346
Enforcing energy balance in coherently superimposed optical vortices
The generation of optical beams with multiple, mutually-coherent orbital-angular-momentum (OAM) modes using phase gratings is analyzed from the perspective of energy distribution and radial mode composition. We show that phase gratings designed with equally-weighted Laguerre-Gauss (LG) modes will generate beams with uneven energy distribution among OAM components. This unwanted outcome cannot be corrected by adjusting the width of the illuminating beam. We propose a way to design phase gratings that will produce a uniform energy distribution among the constituent OAM states after illumination, while minimizing the content of high radial modes. This method is based on a generalized definition for the LG modes that takes advantage of the freedom to select their radial scales.
physics.optics
the generation of optical beams with multiple mutuallycoherent orbitalangularmomentum oam modes using phase gratings is analyzed from the perspective of energy distribution and radial mode composition we show that phase gratings designed with equallyweighted laguerregauss lg modes will generate beams with uneven energy distribution among oam components this unwanted outcome cannot be corrected by adjusting the width of the illuminating beam we propose a way to design phase gratings that will produce a uniform energy distribution among the constituent oam states after illumination while minimizing the content of high radial modes this method is based on a generalized definition for the lg modes that takes advantage of the freedom to select their radial scales
[['the', 'generation', 'of', 'optical', 'beams', 'with', 'multiple', 'mutuallycoherent', 'orbitalangularmomentum', 'oam', 'modes', 'using', 'phase', 'gratings', 'is', 'analyzed', 'from', 'the', 'perspective', 'of', 'energy', 'distribution', 'and', 'radial', 'mode', 'composition', 'we', 'show', 'that', 'phase', 'gratings', 'designed', 'with', 'equallyweighted', 'laguerregauss', 'lg', 'modes', 'will', 'generate', 'beams', 'with', 'uneven', 'energy', 'distribution', 'among', 'oam', 'components', 'this', 'unwanted', 'outcome', 'can', 'not', 'be', 'corrected', 'by', 'adjusting', 'the', 'width', 'of', 'the', 'illuminating', 'beam', 'we', 'propose', 'a', 'way', 'to', 'design', 'phase', 'gratings', 'that', 'will', 'produce', 'a', 'uniform', 'energy', 'distribution', 'among', 'the', 'constituent', 'oam', 'states', 'after', 'illumination', 'while', 'minimizing', 'the', 'content', 'of', 'high', 'radial', 'modes', 'this', 'method', 'is', 'based', 'on', 'a', 'generalized', 'definition', 'for', 'the', 'lg', 'modes', 'that', 'takes', 'advantage', 'of', 'the', 'freedom', 'to', 'select', 'their', 'radial', 'scales']]
[-0.14553038894968187, 0.22508376666709132, -0.17754323604395209, 0.010286754385932632, -0.07949569143516862, -0.12495022196646617, 0.028603066813767605, 0.459751560765764, -0.2331432715382265, -0.3219330972080807, 0.009970943085120424, -0.2444831610130875, -0.04572245046577376, 0.1572504016044347, -0.04353416302119908, 0.059150919759565074, 0.06553265473440938, -0.06785827989325575, -0.038212578296256454, -0.16147798000146513, 0.3122430603789247, 0.08189470228111452, 0.352224926772001, -0.029433204654766166, 0.11901143887282714, 0.049365799924682666, -0.012900013711465442, -0.036901705242369486, -0.08620653838500046, 0.10524392458154698, 0.19780732688655997, 0.09886085874320048, 0.2453753934768231, -0.4116163752325203, -0.22919204399475585, 0.09241057225786474, 0.16716614546983138, 0.11660037893680451, -0.06456339730698939, -0.23612661259653775, 0.03397156581606554, -0.1183248659433878, -0.188479680908115, -0.08855442076759494, -0.009166559625578963, 0.053019724214328046, -0.2747981927043799, 0.023783906460132287, 0.025674366562262824, 0.017923903279006483, -0.023871716723331937, -0.11294881357689915, -0.08942303801684276, 0.05872666456473424, 0.008520217640730349, -0.01690261931280079, 0.10702390521106755, -0.08923684334655738, -0.08204230979570876, 0.38588298784325953, -0.05850511179103152, -0.20526769065257647, 0.09240059055104528, -0.15349706190273812, -0.009947534541235021, 0.13786390277597568, 0.18618515529062438, 0.09325135462795911, -0.09286804709826475, -0.05541163377271479, 0.009074681997299194, 0.23350051343441008, 0.15734446764437723, 0.15601408656119653, 0.2715416261318909, 0.09962602669535124, 0.05586456446497164, 0.15819267964537215, -0.15884297376539072, -0.034731283540958946, -0.2761758960424113, -0.13779797278263647, -0.20569941763558586, -0.03155386434733847, -0.04633226904843468, -0.09745382353987382, 0.4522381405143634, 0.0873083011429433, 0.17024017044586007, 0.00205198819141673, 0.36235437177769514, 0.11601821391276368, 0.10872857416979968, 0.04808972286991775, 0.2600608843662169, 0.12155408509551426, 0.09958650147360142, -0.24934359465158829, 0.0025528673649482104, 0.00467876014907075]
1,802.08347
On the subspace of the $L^p$ space, which is an annihilator of an element not belonging to the dual space
Let $E$ be a Lebesgue measurable subset of ${\mathbb R}^n$, $p\in [1,\infty)$. We consider the subspace $Y\subset L^p(E)$, which is an annihilator of the Lebesgue measurable ${{\cal L}^{n}}$-a.e. finite function $g$ that does not belong to the dual space of $L^p(E)$. It is shown that the subspace $Y$ is dense in $L^p(E)$. Moreover, the Hahn-Banach theorem's extension $\bar T_g\in [L^p(E)]^*$ of the bounded on $Y$ functional $h\mapsto \int_E g(x)h(x)\,dx$, $h\in Y$, can not be represented in the form $\bar T_g(h)= \int_E g(x)h(x)\,dx$, $h\in L^p(E)$.
math.FA
let e be a lebesgue measurable subset of mathbb rn pin 1infty we consider the subspace ysubset lpe which is an annihilator of the lebesgue measurable cal lnae finite function g that does not belong to the dual space of lpe it is shown that the subspace y is dense in lpe moreover the hahnbanach theorems extension bar t_gin lpe of the bounded on y functional hmapsto int_e gxhxdx hin y can not be represented in the form bar t_gh int_e gxhxdx hin lpe
[['let', 'e', 'be', 'a', 'lebesgue', 'measurable', 'subset', 'of', 'mathbb', 'rn', 'pin', '1infty', 'we', 'consider', 'the', 'subspace', 'ysubset', 'lpe', 'which', 'is', 'an', 'annihilator', 'of', 'the', 'lebesgue', 'measurable', 'cal', 'lnae', 'finite', 'function', 'g', 'that', 'does', 'not', 'belong', 'to', 'the', 'dual', 'space', 'of', 'lpe', 'it', 'is', 'shown', 'that', 'the', 'subspace', 'y', 'is', 'dense', 'in', 'lpe', 'moreover', 'the', 'hahnbanach', 'theorems', 'extension', 'bar', 't_gin', 'lpe', 'of', 'the', 'bounded', 'on', 'y', 'functional', 'hmapsto', 'int_e', 'gxhxdx', 'hin', 'y', 'can', 'not', 'be', 'represented', 'in', 'the', 'form', 'bar', 't_gh', 'int_e', 'gxhxdx', 'hin', 'lpe']]
[-0.15021000712773985, 0.09443831267708447, -0.059289718600862386, 0.00445930102008949, -0.057018405109455314, -0.13901162083272503, -0.026934027966536298, 0.3718775867755654, -0.3804811239478332, -0.03857852105947235, 0.07281452767209068, -0.31641326730339964, -0.07826425939138178, 0.14866243490265518, -0.16068330105641693, 0.0498672978410238, -0.013164902733686038, 0.08314397220228668, -0.09740883262262126, -0.23843115273143956, 0.29399487557762033, -0.1479892540440152, 0.19643599713291926, 0.02162053702469868, 0.10370082737099898, -0.008153303255197367, 0.07652574910817644, 0.013032637421215612, -0.2221464325058277, 0.05523633250754468, 0.305721845642864, 0.13165986454821652, 0.2587085582037409, -0.32244860410065496, -0.174288466631706, 0.26856667794805916, 0.15412968781458425, -0.15180553184215073, 0.00021213138198975144, -0.27889517025102545, 0.18022030799743968, -0.1145468532709004, -0.11681916399953203, -0.08017089292760703, 0.12543315935549856, 4.191643004364605e-05, -0.3701417459457924, 0.007160567890711223, 0.15040858238463914, -0.006945195825935542, -0.06384635522159972, -0.16481597267704295, -0.12891623272289393, 0.001926403268700159, -0.08608551435850419, 0.25326280004073737, 0.10104470707098895, 0.026270823046282123, -0.03831483123682534, 0.34345939623404154, -0.09519177827581798, -0.32182136211025564, 0.08816381285697976, -0.2703410685651853, -0.1397021720185876, 0.08065096798199642, 0.06488617534360176, 0.16790791262601373, -0.08688138784911437, 0.3526988345540211, -0.146114712949073, 0.14078813613262736, 0.0714947949694116, 0.04375049515474069, 0.07932062788727941, 0.07244903823844145, 0.16586776713168697, 0.050612936936955476, -0.005264402122555088, 0.043150042672936297, -0.37570622695397726, -0.18593191364897957, -0.2238265941320341, 0.15740624042795204, -0.10248218535716776, -0.20555053612540028, 0.2817851988557443, 0.03404335473086449, 0.20978526021294955, 0.012946436454282626, 0.12328311872868976, 0.08694011934950382, 0.03441806316163532, 0.06844848884052053, 0.1050836032704462, 0.1791924915860018, -0.0360129969017698, -0.15032605117163325, 0.08531374267384975, 0.16246138402917334]
1,802.08348
On the integrality of factorial ratios and mirror maps
Landau has characterized the integrality of certain ratios of factorials. Delaygue has characterized the integrality of the Taylor coefficients of certain mirror maps constructed from series involving those ratios. Using the $A$-hypergeometric point of view, we express those characterizations in terms of the nonexistence of interior points in multiples of the associated lattice polytope.
math.NT math.AG
landau has characterized the integrality of certain ratios of factorials delaygue has characterized the integrality of the taylor coefficients of certain mirror maps constructed from series involving those ratios using the ahypergeometric point of view we express those characterizations in terms of the nonexistence of interior points in multiples of the associated lattice polytope
[['landau', 'has', 'characterized', 'the', 'integrality', 'of', 'certain', 'ratios', 'of', 'factorials', 'delaygue', 'has', 'characterized', 'the', 'integrality', 'of', 'the', 'taylor', 'coefficients', 'of', 'certain', 'mirror', 'maps', 'constructed', 'from', 'series', 'involving', 'those', 'ratios', 'using', 'the', 'ahypergeometric', 'point', 'of', 'view', 'we', 'express', 'those', 'characterizations', 'in', 'terms', 'of', 'the', 'nonexistence', 'of', 'interior', 'points', 'in', 'multiples', 'of', 'the', 'associated', 'lattice', 'polytope']]
[-0.23593211490309463, 0.035437177128668104, -0.08619098386393403, 0.03706188422610175, -0.015982677527474908, -0.07290897961213903, 0.0480267693956365, 0.258418530682629, -0.31411075180853315, -0.2773955668168162, 0.10988995173225566, -0.2636134792470707, -0.16181188635528088, 0.1854225594269217, -0.09620488324325602, 0.0874981504495976, -0.004754175414454262, 0.017071834167922444, -0.1654105255696571, -0.2519187349584481, 0.3709857122586021, -0.006563078111283622, 0.17752255241052722, 0.003284748924790688, 0.09130669554765776, -0.003734842900467931, -0.027753447938077856, 0.017861469929932424, -0.17733652454818477, 0.14229464024867652, 0.2569228100880348, 0.06249403146991752, 0.18758394744879794, -0.3961814562526514, -0.06635676679324429, 0.13086817951275492, 0.11636209001167203, -0.027019658073220612, 0.02527347685031171, -0.2189922543980603, 0.08439919415791079, -0.08473563278621098, -0.2114049440847253, -0.08952427441078536, -0.041586264054167946, 0.09286654055259137, -0.24019308093021502, 0.051257741725388564, 0.06487998327697223, 0.1485136069735196, -0.09257682405833928, -0.2276689766660192, -0.05276589109650198, 0.0864284171388959, 0.07294332500512027, -0.041686182059699074, 0.060490285072756826, -0.1473578265955988, -0.15366055767210024, 0.39053305285051465, -0.05041404110643099, -0.19053750615215526, 0.13186732032951318, -0.21929200198325627, -0.14692490487271603, 0.21437569401877107, 0.08759445716837808, 0.1191217759975566, -0.03930242605647951, 0.1442792876359989, -0.1293368145190882, 0.03270400341277292, 0.25531548361803563, 0.09145240893341461, 0.21674597973249993, 0.03654539258272018, 0.024166007578935264, 0.2084244721270395, -0.04250967449987448, -0.1084693693468031, -0.30989847929691366, -0.10310963871625234, -0.18314681720550893, 0.0910444497657975, -0.13572465794442115, -0.19348902471433832, 0.3995883604138211, 0.02374150685720005, 0.23376350189155004, 0.08504904026411614, 0.1466109836781573, 0.21162437802215792, 0.08451819314428095, 0.0006489524494786307, 0.18621045646240125, 0.1748505634484145, 0.07029200541206969, -0.18588891459896914, 0.048599210233902033, 0.23040416235771943]
1,802.08349
On a dynamical approach to some prime number sequences
In this paper we show how the cross-disciplinary transfer of techniques from Dynamical Systems Theory to Number Theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo $k$ are maximally chaotic and, while lacking forbidden patterns, display a non-trivial spectrum of Renyi entropies which suggest that every block of size $m>1$, while admissible, occurs with different probability. This non-uniform distribution of blocks for $m>1$ contrasts Dirichlet's theorem that guarantees equiprobability for $m=1$. We then explore in a similar fashion the sequence of prime gap residues. This sequence is again chaotic (positivity of Kolmogorov-Sinai entropy), however chaos is weaker as we find forbidden patterns for every block of size $m>1$. We relate the onset of these forbidden patterns with the divisibility properties of integers, and estimate the densities of gap block residues via Hardy-Littlewood $k$-tuple conjecture. We use this estimation to argue that the amount of admissible blocks is non-uniformly distributed, what supports the fact that the spectrum of Renyi entropies is again non-trivial in this case. We complete our analysis by applying the Chaos Game to these symbolic sequences, and comparing the IFS attractors found for the experimental sequences with appropriate null models.
math.NT math.DS
in this paper we show how the crossdisciplinary transfer of techniques from dynamical systems theory to number theory can be a fruitful avenue for research we illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence we show that the sequence formed by the residues of the primes modulo k are maximally chaotic and while lacking forbidden patterns display a nontrivial spectrum of renyi entropies which suggest that every block of size m1 while admissible occurs with different probability this nonuniform distribution of blocks for m1 contrasts dirichlets theorem that guarantees equiprobability for m1 we then explore in a similar fashion the sequence of prime gap residues this sequence is again chaotic positivity of kolmogorovsinai entropy however chaos is weaker as we find forbidden patterns for every block of size m1 we relate the onset of these forbidden patterns with the divisibility properties of integers and estimate the densities of gap block residues via hardylittlewood ktuple conjecture we use this estimation to argue that the amount of admissible blocks is nonuniformly distributed what supports the fact that the spectrum of renyi entropies is again nontrivial in this case we complete our analysis by applying the chaos game to these symbolic sequences and comparing the ifs attractors found for the experimental sequences with appropriate null models
[['in', 'this', 'paper', 'we', 'show', 'how', 'the', 'crossdisciplinary', 'transfer', 'of', 'techniques', 'from', 'dynamical', 'systems', 'theory', 'to', 'number', 'theory', 'can', 'be', 'a', 'fruitful', 'avenue', 'for', 'research', 'we', 'illustrate', 'this', 'idea', 'by', 'exploring', 'from', 'a', 'nonlinear', 'and', 'symbolic', 'dynamics', 'viewpoint', 'certain', 'patterns', 'emerging', 'in', 'some', 'residue', 'sequences', 'generated', 'from', 'the', 'prime', 'number', 'sequence', 'we', 'show', 'that', 'the', 'sequence', 'formed', 'by', 'the', 'residues', 'of', 'the', 'primes', 'modulo', 'k', 'are', 'maximally', 'chaotic', 'and', 'while', 'lacking', 'forbidden', 'patterns', 'display', 'a', 'nontrivial', 'spectrum', 'of', 'renyi', 'entropies', 'which', 'suggest', 'that', 'every', 'block', 'of', 'size', 'm1', 'while', 'admissible', 'occurs', 'with', 'different', 'probability', 'this', 'nonuniform', 'distribution', 'of', 'blocks', 'for', 'm1', 'contrasts', 'dirichlets', 'theorem', 'that', 'guarantees', 'equiprobability', 'for', 'm1', 'we', 'then', 'explore', 'in', 'a', 'similar', 'fashion', 'the', 'sequence', 'of', 'prime', 'gap', 'residues', 'this', 'sequence', 'is', 'again', 'chaotic', 'positivity', 'of', 'kolmogorovsinai', 'entropy', 'however', 'chaos', 'is', 'weaker', 'as', 'we', 'find', 'forbidden', 'patterns', 'for', 'every', 'block', 'of', 'size', 'm1', 'we', 'relate', 'the', 'onset', 'of', 'these', 'forbidden', 'patterns', 'with', 'the', 'divisibility', 'properties', 'of', 'integers', 'and', 'estimate', 'the', 'densities', 'of', 'gap', 'block', 'residues', 'via', 'hardylittlewood', 'ktuple', 'conjecture', 'we', 'use', 'this', 'estimation', 'to', 'argue', 'that', 'the', 'amount', 'of', 'admissible', 'blocks', 'is', 'nonuniformly', 'distributed', 'what', 'supports', 'the', 'fact', 'that', 'the', 'spectrum', 'of', 'renyi', 'entropies', 'is', 'again', 'nontrivial', 'in', 'this', 'case', 'we', 'complete', 'our', 'analysis', 'by', 'applying', 'the', 'chaos', 'game', 'to', 'these', 'symbolic', 'sequences', 'and', 'comparing', 'the', 'ifs', 'attractors', 'found', 'for', 'the', 'experimental', 'sequences', 'with', 'appropriate', 'null', 'models']]
[-0.17556023623176809, 0.1502057770844144, -0.11138414153626755, 0.09388121473552336, -0.0061760196249689096, -0.11915095916635397, 0.04958240643761161, 0.3282113263869415, -0.30586213961106967, -0.247966761984255, 0.07528389210647615, -0.26816799602491537, -0.1962307864423011, 0.17062805457364605, -0.08036120447549089, 0.057264806445607025, 0.06302607336445995, 0.048030426907960486, -0.04000360977167831, -0.234770921876897, 0.3453962423337583, 0.0021949149141816987, 0.24319267425402674, 0.0068568553573087505, 0.0226764777250102, 0.011991823596231964, -0.009685670236206574, 0.00013974101798932837, -0.15517369898459393, 0.154951998386937, 0.27061692942055665, 0.16121562077643592, 0.26525334612992796, -0.38604503525294487, -0.19582104004575346, 0.1475782476325074, 0.1600698246114442, 0.09623094555344837, -0.053802425791534755, -0.24293672879752906, 0.15542335096751744, -0.13945735071016394, -0.13730931429637838, -0.0791963187754964, 0.04352702793827199, 0.0426120944675463, -0.28601766014370417, 0.06689695451742686, 0.12633961431173427, 0.1024320784976463, -0.03472147832786583, -0.10057212327525991, -0.01572741839285616, 0.13153287889334656, 0.06911104556537517, -0.012289195324031069, 0.0918221850044337, -0.08332826212331977, -0.11562305938492974, 0.31275142235681413, -0.0251285957205413, -0.15521439470517773, 0.15223274009059304, -0.16825202402415806, -0.18213652126875746, 0.13570117288593042, 0.08797192170446658, 0.14650980269981792, -0.09240994194482008, 0.08714145772847469, -0.08272715091361138, 0.18824490545185932, 0.11955182689808957, 0.050168110501608285, 0.22433423041973424, 0.08509666492185636, 0.07733846071945584, 0.19140993530770925, -0.019633173635836852, -0.10357964644613474, -0.2991514322742739, -0.13625324065392108, -0.18844972675686458, 0.06286386394640431, -0.11244098725905845, -0.16461154828657923, 0.38633437543378574, 0.15286066268150614, 0.20460233042831533, 0.11130204064842394, 0.22887175496991563, 0.10762754923957603, 0.04274926178876068, 0.06626685254792075, 0.14143106012102774, 0.139447529087572, 0.039241800941121965, -0.20653729178365726, 0.03972776762371802, 0.12575057243179205]
1,802.0835
The geometry of $k$-free hyperbolic $3$-manifolds
We investigate the geometry of closed, orientable, hyperbolic $3$-manifolds whose fundamental groups are $k$-free for a given integer $k\ge 3$. We show that any such manifold $M$ contains a point $P$ of $M$ with the following property: If $S$ is the set of elements of $\pi_1(M,P)$ represented by loops of length $<\log(2k-1)$, then for every subset $T \subset S$, we have ${\rm rank}\ T \le k-3$. This generalizes to all $k\ge3$ results proved in [6] and [10], which have been used to relate the volume of a hyperbolic manifold to its topological properties, and it strictly improves on the result obtained in [11] for $k=5$. The proof avoids the use of results about ranks of joins and intersections in free groups that were used in [10] and [11].
math.GT
we investigate the geometry of closed orientable hyperbolic 3manifolds whose fundamental groups are kfree for a given integer kge 3 we show that any such manifold m contains a point p of m with the following property if s is the set of elements of pi_1mp represented by loops of length log2k1 then for every subset t subset s we have rm rank t le k3 this generalizes to all kge3 results proved in 6 and 10 which have been used to relate the volume of a hyperbolic manifold to its topological properties and it strictly improves on the result obtained in 11 for k5 the proof avoids the use of results about ranks of joins and intersections in free groups that were used in 10 and 11
[['we', 'investigate', 'the', 'geometry', 'of', 'closed', 'orientable', 'hyperbolic', '3manifolds', 'whose', 'fundamental', 'groups', 'are', 'kfree', 'for', 'a', 'given', 'integer', 'kge', '3', 'we', 'show', 'that', 'any', 'such', 'manifold', 'm', 'contains', 'a', 'point', 'p', 'of', 'm', 'with', 'the', 'following', 'property', 'if', 's', 'is', 'the', 'set', 'of', 'elements', 'of', 'pi_1mp', 'represented', 'by', 'loops', 'of', 'length', 'log2k1', 'then', 'for', 'every', 'subset', 't', 'subset', 's', 'we', 'have', 'rm', 'rank', 't', 'le', 'k3', 'this', 'generalizes', 'to', 'all', 'kge3', 'results', 'proved', 'in', '6', 'and', '10', 'which', 'have', 'been', 'used', 'to', 'relate', 'the', 'volume', 'of', 'a', 'hyperbolic', 'manifold', 'to', 'its', 'topological', 'properties', 'and', 'it', 'strictly', 'improves', 'on', 'the', 'result', 'obtained', 'in', '11', 'for', 'k5', 'the', 'proof', 'avoids', 'the', 'use', 'of', 'results', 'about', 'ranks', 'of', 'joins', 'and', 'intersections', 'in', 'free', 'groups', 'that', 'were', 'used', 'in', '10', 'and', '11']]
[-0.17448929356529363, 0.12660420096307506, -0.04747355910616794, 0.03647612696070047, -0.03337296556740526, -0.1434184097507525, 0.03936497835786126, 0.34597239550203085, -0.23576108405795243, -0.3000137376865106, 0.10804219477410827, -0.29949662937886184, -0.1242011087634305, 0.21908642441433454, -0.09875601088066423, 0.0020889615347158045, 0.03429269938847967, 0.12099523550372511, -0.06828742106592962, -0.29713548219112296, 0.35674524346425657, -0.0953728885811177, 0.16159100825935307, 0.0644886074920318, 0.10675548276464854, 0.012432663931533517, -0.026268301472540886, 0.05935912894912892, -0.17046542194847938, 0.10224768549706491, 0.26291014571925475, 0.13271588233986958, 0.20525980019010603, -0.3479674059243056, -0.192137654944663, 0.1512568520699879, 0.11309566603426541, 0.0026323329555683786, -0.0009604259218562335, -0.21585100819726313, 0.2054382570767923, -0.1025534707698084, -0.16911084711965588, -0.029387909357273388, 0.10700338481027367, -0.0008371320279640337, -0.23832797491922975, -0.005598285767648902, 0.1229176929826656, 0.08360653881367947, -0.03560724714308947, -0.16810437857676003, -0.05162289807949925, 0.13325980496371076, -0.013767690543780133, 0.06511762329203535, 0.04664000761205523, -0.039120455585477415, -0.10915401567324316, 0.3594095286366249, -0.06527972264984061, -0.2115790298252943, 0.16159587499102585, -0.1728201359251721, -0.1806265572751207, 0.15552560193094586, 0.10384006218223404, 0.16719193414748934, -0.037694333261618064, 0.17139244783071003, -0.11026959522952517, 0.14904886095471392, 0.12696270287288206, -0.01633690596218147, 0.11373335736921973, 0.1128471704913185, 0.09560036559409965, 0.10936670183409228, -0.04033672424321551, 0.02211984473517135, -0.3191707349264078, -0.20071644473466135, -0.1699137748487013, 0.14794617077882682, -0.1014418425144709, -0.13196380033956043, 0.3506378902506734, 0.06639090269463994, 0.21038367357548504, 0.10575132055803099, 0.17368579728321898, 0.02732718153129099, 0.06083208193174667, 0.15134089865854808, 0.12023437122208258, 0.1675998803481297, -0.017651836077372234, -0.13769939881823365, -0.020768979682572304, 0.14898437711351092]
1,802.08351
A Cut-And-Choose Mechanism to Prevent Gerrymandering
This paper presents a novel mechanism to endogenously determine the fair division of a state into electoral districts in a two-party setting. No geometric constraints are imposed on voter distributions or district shapes; instead, it is assumed that any partition of the population into districts of equal population is feasible. One party divides the map, then the other party chooses a minimum threshold level of support needed to win a district. Districts in which neither party meets this threshold are awarded randomly. Despite the inherent asymmetry, the equilibria of this mechanism always yield fair outcomes, up to integer rounding.
cs.GT
this paper presents a novel mechanism to endogenously determine the fair division of a state into electoral districts in a twoparty setting no geometric constraints are imposed on voter distributions or district shapes instead it is assumed that any partition of the population into districts of equal population is feasible one party divides the map then the other party chooses a minimum threshold level of support needed to win a district districts in which neither party meets this threshold are awarded randomly despite the inherent asymmetry the equilibria of this mechanism always yield fair outcomes up to integer rounding
[['this', 'paper', 'presents', 'a', 'novel', 'mechanism', 'to', 'endogenously', 'determine', 'the', 'fair', 'division', 'of', 'a', 'state', 'into', 'electoral', 'districts', 'in', 'a', 'twoparty', 'setting', 'no', 'geometric', 'constraints', 'are', 'imposed', 'on', 'voter', 'distributions', 'or', 'district', 'shapes', 'instead', 'it', 'is', 'assumed', 'that', 'any', 'partition', 'of', 'the', 'population', 'into', 'districts', 'of', 'equal', 'population', 'is', 'feasible', 'one', 'party', 'divides', 'the', 'map', 'then', 'the', 'other', 'party', 'chooses', 'a', 'minimum', 'threshold', 'level', 'of', 'support', 'needed', 'to', 'win', 'a', 'district', 'districts', 'in', 'which', 'neither', 'party', 'meets', 'this', 'threshold', 'are', 'awarded', 'randomly', 'despite', 'the', 'inherent', 'asymmetry', 'the', 'equilibria', 'of', 'this', 'mechanism', 'always', 'yield', 'fair', 'outcomes', 'up', 'to', 'integer', 'rounding']]
[-0.14138707084430738, 0.09472858700007576, -0.13996392044455114, 0.08434271826902687, -0.09710900720698062, -0.23338773709750085, 0.19486221795398365, 0.32956140622675345, -0.25211551335800175, -0.2624467411757602, 0.06595555624237867, -0.2954422062018303, -0.05683027506768327, 0.07670772716995668, -0.14014177080808263, 0.0016880243019473673, 0.05167691781646525, 0.048656193765275406, 0.08970209058948012, -0.3220816385847601, 0.30919102209648397, 0.02794603706629138, 0.3015835541629731, 0.01412335780068216, 0.10262641830915453, 0.0094037819418567, 0.016847133012065155, -0.001050038564235273, -0.10555612618808288, 0.06795797045483734, 0.2895915012176365, 0.18544683623776742, 0.37485368912475125, -0.3875109590966292, -0.1152356411503849, 0.2160510341025362, 0.07573239247766182, 0.07462177976537872, -0.0027223190603156886, -0.21541595141017678, 0.07976561439496399, -0.22626730621877042, -0.11303046428730165, -0.002085441111991502, 0.010863217141836731, -0.002194901443829741, -0.3239005736235266, 0.056739351387615454, 0.05809604575283675, 0.0349462034011429, -0.03584289513152055, -0.13402480429809804, -0.05299822655459396, 0.15226638747021706, -0.0266381673822932, 0.026115495557814478, 0.1662619928170861, -0.11170873960310762, -0.15646179849658198, 0.38910531704172946, 0.0910840631671946, -0.19983013848259085, 0.12168483364612165, -0.16623941860208757, -0.14162353868478664, 0.0908122822863398, 0.1709707612453988, 0.05324874557037321, -0.13888032098107905, -0.004486336194054045, -0.10196843248030002, 0.22332237093624743, 0.07799344499962348, -0.018715209893251986, 0.23304635512106348, 0.10216147070656521, 0.17641612499801798, 0.1465512117414472, 0.006283573554640617, -0.20080198189525894, -0.28733282963359597, -0.11845943426203001, -0.1881902647755024, 0.031997972714092646, -0.05372558400796896, -0.15251987542242113, 0.41176629255553987, 0.11714516630198693, 0.16412848168325544, 0.060959011315123525, 0.29720157200489383, 0.06032793777007045, 0.04440462752010184, 0.08434777621255078, 0.1983343421650881, 0.008575965509270176, 0.049859048060207356, -0.1646219222016181, 0.21104044549524634, 0.021411246215604772]
1,802.08352
Learning to Make Predictions on Graphs with Autoencoders
We examine two fundamental tasks associated with graph representation learning: link prediction and semi-supervised node classification. We present a novel autoencoder architecture capable of learning a joint representation of both local graph structure and available node features for the multi-task learning of link prediction and node classification. Our autoencoder architecture is efficiently trained end-to-end in a single learning stage to simultaneously perform link prediction and node classification, whereas previous related methods require multiple training steps that are difficult to optimize. We provide a comprehensive empirical evaluation of our models on nine benchmark graph-structured datasets and demonstrate significant improvement over related methods for graph representation learning. Reference code and data are available at https://github.com/vuptran/graph-representation-learning
cs.LG cs.AI stat.ML
we examine two fundamental tasks associated with graph representation learning link prediction and semisupervised node classification we present a novel autoencoder architecture capable of learning a joint representation of both local graph structure and available node features for the multitask learning of link prediction and node classification our autoencoder architecture is efficiently trained endtoend in a single learning stage to simultaneously perform link prediction and node classification whereas previous related methods require multiple training steps that are difficult to optimize we provide a comprehensive empirical evaluation of our models on nine benchmark graphstructured datasets and demonstrate significant improvement over related methods for graph representation learning reference code and data are available at httpsgithubcomvuptrangraphrepresentationlearning
[['we', 'examine', 'two', 'fundamental', 'tasks', 'associated', 'with', 'graph', 'representation', 'learning', 'link', 'prediction', 'and', 'semisupervised', 'node', 'classification', 'we', 'present', 'a', 'novel', 'autoencoder', 'architecture', 'capable', 'of', 'learning', 'a', 'joint', 'representation', 'of', 'both', 'local', 'graph', 'structure', 'and', 'available', 'node', 'features', 'for', 'the', 'multitask', 'learning', 'of', 'link', 'prediction', 'and', 'node', 'classification', 'our', 'autoencoder', 'architecture', 'is', 'efficiently', 'trained', 'endtoend', 'in', 'a', 'single', 'learning', 'stage', 'to', 'simultaneously', 'perform', 'link', 'prediction', 'and', 'node', 'classification', 'whereas', 'previous', 'related', 'methods', 'require', 'multiple', 'training', 'steps', 'that', 'are', 'difficult', 'to', 'optimize', 'we', 'provide', 'a', 'comprehensive', 'empirical', 'evaluation', 'of', 'our', 'models', 'on', 'nine', 'benchmark', 'graphstructured', 'datasets', 'and', 'demonstrate', 'significant', 'improvement', 'over', 'related', 'methods', 'for', 'graph', 'representation', 'learning', 'reference', 'code', 'and', 'data', 'are', 'available', 'at', 'httpsgithubcomvuptrangraphrepresentationlearning']]
[-0.058602083199990114, -0.09225355268322996, -0.05873443451959507, 0.0645844011419935, -0.1430728018832659, -0.25756906681428, 0.07112690168287372, 0.5099313604046724, -0.2719219528038853, -0.36079049615987707, 0.04308760794707008, -0.27180592405992293, -0.2109997022520734, 0.1579153740811827, -0.11112342517506997, 0.11182975336643201, 0.2533395652426407, 0.10574080483456783, -0.07143697904913486, -0.2855512749663051, 0.3232099714930103, 0.03698546893013242, 0.37331030124499065, -0.0061477670762022695, 0.14368967350726183, -0.0010177255026064813, -0.08533747527846051, -0.044232844867760183, -0.06748857439827459, 0.2076338052076088, 0.3642329360522711, 0.23198517577007546, 0.3153275654372659, -0.38848186052928213, -0.25578289962140843, 0.10357040076632984, 0.1424099384540958, 0.08780964755520212, -0.011884082248018655, -0.30880868004169315, 0.07594588662842787, -0.18879865126135492, 0.09113006280469042, -0.1906066157056817, -0.06942302180686966, -0.03341256838757545, -0.3169316929233901, 0.038048631769405414, 0.04773950421700387, 0.08773392959431346, -0.06947393025205072, -0.12667491209244222, 0.04183342452493629, 0.1838556836758341, -0.024037965468388784, 0.1025343695697042, 0.1117610213404987, -0.17138183555133374, -0.20239727816078812, 0.3297047486329185, -0.047454298669306026, -0.19012276930776092, 0.2085536495391612, 0.036161458202903826, -0.21979270137671847, 0.07461054859283779, 0.2871431996546952, 0.097578072512988, -0.15837106721768837, -0.03268863975764751, -0.03814634628361091, 0.15424303974058212, -0.005086958649501737, -0.03719749838429769, 0.16676000352370984, 0.31379618887357147, 0.01652345064212568, 0.13422327728351643, -0.1444393438687257, -0.06605400977423415, -0.22657697447877062, -0.08831733457502976, -0.21712612992684757, -0.058106214652070776, -0.1585182290325195, -0.13649338639100148, 0.44539504917546374, 0.20117446536564135, 0.22372274699487857, 0.16062121445845282, 0.3527109581544729, -0.010298825573824746, 0.11484412385782759, 0.15118753031544788, 0.12762603125468427, 0.026727805481641553, 0.08132920241145516, -0.16003169449894422, 0.0872349425252261, 0.046318560736835934]
1,802.08353
On $\ast $-Semi Homogeneous Domains
Let $\ast $ be a finite character star operation defined on an integral domain $D.$ Call a nonzero $\ast $-ideal $I$ of finite type a $\ast $ -homogeneous ($\ast $-homog) ideal, if $I\subsetneq D$ and $(J+K)^{\ast }\neq D$ for every pair $D\supsetneq J,K\supseteq I$ of proper $\ast $ -ideals of finite type$.$ Call an integral domain $D$ a $\ast $-Semi Homogeneous Domain ($\ast $-SHD) if every proper principal ideal $xD$ of $D$ is expressible as a $\ast $-product of finitely many $\ast $-homog ideals. We show that a $\ast $-SHD contains a family $\mathcal{F}$ of prime ideals such that (a) $D=\cap_{P\in \mathcal{F}}D_{P},$ a locally finite intersection and (b) no two members of $\mathcal{F}$ contain a common non zero prime ideal. The $\ast $-SHDs include h-local domains, independent rings of Krull type, Krull domains, UFDs etc. We show also that we can modify the definition of the $\ast $-homog ideals to get a theory of each special case of a $\ast $-SH domain.
math.AC
let ast be a finite character star operation defined on an integral domain d call a nonzero ast ideal i of finite type a ast homogeneous ast homog ideal if isubsetneq d and jkast neq d for every pair dsupsetneq jksupseteq i of proper ast ideals of finite type call an integral domain d a ast semi homogeneous domain ast shd if every proper principal ideal xd of d is expressible as a ast product of finitely many ast homog ideals we show that a ast shd contains a family mathcalf of prime ideals such that a dcap_pin mathcalfd_p a locally finite intersection and b no two members of mathcalf contain a common non zero prime ideal the ast shds include hlocal domains independent rings of krull type krull domains ufds etc we show also that we can modify the definition of the ast homog ideals to get a theory of each special case of a ast sh domain
[['let', 'ast', 'be', 'a', 'finite', 'character', 'star', 'operation', 'defined', 'on', 'an', 'integral', 'domain', 'd', 'call', 'a', 'nonzero', 'ast', 'ideal', 'i', 'of', 'finite', 'type', 'a', 'ast', 'homogeneous', 'ast', 'homog', 'ideal', 'if', 'isubsetneq', 'd', 'and', 'jkast', 'neq', 'd', 'for', 'every', 'pair', 'dsupsetneq', 'jksupseteq', 'i', 'of', 'proper', 'ast', 'ideals', 'of', 'finite', 'type', 'call', 'an', 'integral', 'domain', 'd', 'a', 'ast', 'semi', 'homogeneous', 'domain', 'ast', 'shd', 'if', 'every', 'proper', 'principal', 'ideal', 'xd', 'of', 'd', 'is', 'expressible', 'as', 'a', 'ast', 'product', 'of', 'finitely', 'many', 'ast', 'homog', 'ideals', 'we', 'show', 'that', 'a', 'ast', 'shd', 'contains', 'a', 'family', 'mathcalf', 'of', 'prime', 'ideals', 'such', 'that', 'a', 'dcap_pin', 'mathcalfd_p', 'a', 'locally', 'finite', 'intersection', 'and', 'b', 'no', 'two', 'members', 'of', 'mathcalf', 'contain', 'a', 'common', 'non', 'zero', 'prime', 'ideal', 'the', 'ast', 'shds', 'include', 'hlocal', 'domains', 'independent', 'rings', 'of', 'krull', 'type', 'krull', 'domains', 'ufds', 'etc', 'we', 'show', 'also', 'that', 'we', 'can', 'modify', 'the', 'definition', 'of', 'the', 'ast', 'homog', 'ideals', 'to', 'get', 'a', 'theory', 'of', 'each', 'special', 'case', 'of', 'a', 'ast', 'sh', 'domain']]
[-0.23073810100398184, 0.09150136242958554, -0.05559014707997248, -0.004499957170307201, -0.14127632985556765, -0.17404866706301736, -0.007182530503169718, 0.34130861466242507, -0.39196368633442885, -0.0572170230541862, 0.1141967488870073, -0.2641379932053508, -0.008645650631349002, 0.1775037341980965, -0.09363605740915548, -0.06441026981375725, 0.11244990156552234, 0.14480554702836876, -0.07293294459526947, -0.20014679241417485, 0.37951186515826296, -0.14813812593468345, 0.16239966742404097, -0.008610876470610693, 0.09265339918746068, 0.023374146769766683, 0.005907684138238237, 0.05497390376978445, -0.2327080644211598, 0.085593915802983, 0.30294475816311195, 0.1250387360239322, 0.28867987701487907, -0.34288112835938944, -0.07328485375475864, 0.22154750100974985, 0.1721853055422763, -0.08988296178429593, 0.00952510421040359, -0.19626336349265094, 0.18490414449630618, -0.27892852647157457, -0.13786039314559334, -0.04853847476823086, 0.1742865849806407, 0.02439326899392264, -0.37334251046700817, -0.027456925953806426, 0.18031562986033786, 0.12897963327803202, -0.0078392764160337, -0.13811115993114262, -0.05372591901800365, 0.018604944998325854, -0.13372712241116813, 0.10994407145212731, 0.02756923984950892, -0.08846416462393472, -0.10890739873450782, 0.36544380135125143, -0.07841722087257287, -0.21745411685800978, 0.1482682068130703, -0.15528429276309907, -0.14690316630098002, 0.08622481686428987, 0.028547334315424614, 0.174885294823484, -0.0590668103790709, 0.25243891953330416, -0.11360134299868693, 0.12231638431307171, 0.10765389999519888, -0.0008868525211409025, 0.1275885171126937, 0.11161273262348606, 0.08803494776525027, 0.10900257670172406, 0.001890029862535174, 0.08099071162015006, -0.3888349360181623, -0.19815743193877014, -0.14853168088888338, 0.14464933000045357, -0.09954652736434416, -0.23518947548801442, 0.3349612072448839, 0.00997849925520963, 0.12567489166205822, 0.019015376274655393, 0.18352293190939425, 0.02043563220876741, 0.07903698696520531, 0.1271808005887531, -0.0004227134647065556, 0.15713287916566646, -0.03477724664542195, -0.13455301838890685, -0.004335202237397626, 0.1628497591402454]
1,802.08354
Improved Selection Criteria for HII Regions, based on IRAS Sources
We present new criteria for selecting HII regions from the Infrared Astronomical Satellite (IRAS) Point Source catalogue (PSC), based on an HII region catalogue derived manually from the all-sky Wide-field Infrared Survey Explorer (WISE). The criteria are used to augment the number of HII region candidates in the Milky Way. The criteria are defined by the linear decision boundary of two samples: IRAS point sources associated with known HII regions, which serve as the HII region sample, and IRAS point sources at high Galactic latitudes, which serve as the non-HII region sample. A machine learning classifier, specifically a support vector machine (SVM), is used to determine the decision boundary. We investigate all combinations of four IRAS bands and suggest that the optimal criterion is log(F$_{\rm 60}$/F$_{\rm 12}$)$\ge$(-0.19$\times$log(F$_{\rm 100}$/F$_{\rm 25}$)+ 1.52), with detections at 60 and 100 micron. This selects 3041 HII region candidates from the IRAS PSC. We find that IRAS HII region candidates show evidence of evolution on the two-colour diagram. Merging the WISE HII catalogue with IRAS HII region candidates, we estimate a lower limit of approximately 10200 for the number of HII regions in the Milky Way.
astro-ph.GA astro-ph.SR
we present new criteria for selecting hii regions from the infrared astronomical satellite iras point source catalogue psc based on an hii region catalogue derived manually from the allsky widefield infrared survey explorer wise the criteria are used to augment the number of hii region candidates in the milky way the criteria are defined by the linear decision boundary of two samples iras point sources associated with known hii regions which serve as the hii region sample and iras point sources at high galactic latitudes which serve as the nonhii region sample a machine learning classifier specifically a support vector machine svm is used to determine the decision boundary we investigate all combinations of four iras bands and suggest that the optimal criterion is logf_rm 60f_rm 12ge019timeslogf_rm 100f_rm 25 152 with detections at 60 and 100 micron this selects 3041 hii region candidates from the iras psc we find that iras hii region candidates show evidence of evolution on the twocolour diagram merging the wise hii catalogue with iras hii region candidates we estimate a lower limit of approximately 10200 for the number of hii regions in the milky way
[['we', 'present', 'new', 'criteria', 'for', 'selecting', 'hii', 'regions', 'from', 'the', 'infrared', 'astronomical', 'satellite', 'iras', 'point', 'source', 'catalogue', 'psc', 'based', 'on', 'an', 'hii', 'region', 'catalogue', 'derived', 'manually', 'from', 'the', 'allsky', 'widefield', 'infrared', 'survey', 'explorer', 'wise', 'the', 'criteria', 'are', 'used', 'to', 'augment', 'the', 'number', 'of', 'hii', 'region', 'candidates', 'in', 'the', 'milky', 'way', 'the', 'criteria', 'are', 'defined', 'by', 'the', 'linear', 'decision', 'boundary', 'of', 'two', 'samples', 'iras', 'point', 'sources', 'associated', 'with', 'known', 'hii', 'regions', 'which', 'serve', 'as', 'the', 'hii', 'region', 'sample', 'and', 'iras', 'point', 'sources', 'at', 'high', 'galactic', 'latitudes', 'which', 'serve', 'as', 'the', 'nonhii', 'region', 'sample', 'a', 'machine', 'learning', 'classifier', 'specifically', 'a', 'support', 'vector', 'machine', 'svm', 'is', 'used', 'to', 'determine', 'the', 'decision', 'boundary', 'we', 'investigate', 'all', 'combinations', 'of', 'four', 'iras', 'bands', 'and', 'suggest', 'that', 'the', 'optimal', 'criterion', 'is', 'logf_rm', '60f_rm', '12ge019timeslogf_rm', '100f_rm', '25', '152', 'with', 'detections', 'at', '60', 'and', '100', 'micron', 'this', 'selects', '3041', 'hii', 'region', 'candidates', 'from', 'the', 'iras', 'psc', 'we', 'find', 'that', 'iras', 'hii', 'region', 'candidates', 'show', 'evidence', 'of', 'evolution', 'on', 'the', 'twocolour', 'diagram', 'merging', 'the', 'wise', 'hii', 'catalogue', 'with', 'iras', 'hii', 'region', 'candidates', 'we', 'estimate', 'a', 'lower', 'limit', 'of', 'approximately', '10200', 'for', 'the', 'number', 'of', 'hii', 'regions', 'in', 'the', 'milky', 'way']]
[-0.010308083119437199, 0.009272570267549364, -0.06093192844072709, 0.06744609328452497, -0.12983490942247414, -0.05245436833970047, 0.14803498107058977, 0.4526289000503115, -0.1341529440197691, -0.3350976794404355, 0.06053891543777207, -0.33385017940120115, -0.01100624493807806, 0.18630679868801964, -0.02927288532090323, -0.03178175305695952, 0.032656798926905754, -0.12402053874338398, 0.055555228957579146, -0.25070042403641385, 0.298830509986225, 0.08629994274847008, 0.21244162014509374, -0.1146143931996178, 0.09777218883198756, -0.16923830278620527, -0.12351603577467235, -0.058695115909181736, -0.1969269413014125, 0.035177008933513554, 0.3325653922215507, 0.139412808906589, 0.2306477899147147, -0.23658061507244507, -0.21510369008960756, 0.07931143089222747, 0.2072229754632792, 0.01445157821919467, -0.03645415126497077, -0.3522473125441654, 0.10271481653216069, -0.16481513081974275, -0.18718449974029855, 0.06508350457329101, 0.02059772747845666, 0.026762436788428476, -0.25259625932856183, 0.07701392998742695, -0.08223801851272583, 0.11698129308737211, -0.18800768044311553, -0.15830093133892562, -0.08454797712179857, 0.09563661357891318, -0.07675848710728256, 0.14502238830601846, 0.2170629191464065, -0.16613658060118355, -0.0695740453376611, 0.3427330085806347, -0.014663920455889122, 0.016721279234499543, 0.21700729761977453, -0.17633542808880273, -0.2149228100677499, 0.16578275413642563, 0.11505371942059012, 0.16020585368513254, -0.21261600316879717, 0.004223208775353694, -0.0349837547092623, 0.1898432958240281, 0.06275916731337437, 0.12714790448395386, 0.32655177458466306, 0.08713409961830522, 0.0943546515612586, 0.23915291698901234, -0.33451147015061783, -0.03222151685166299, -0.3317883865907788, -0.07114643548816643, -0.14271159758854254, -6.746497961717682e-05, -0.17643309645582858, -0.12739462354535086, 0.25993157587442045, 0.1292571084322156, 0.19224044763030032, -0.008994467132347259, 0.2942008106868613, 0.009265482920297496, 0.1147227350774424, 0.19018627355579992, 0.28494763866167616, 0.08447271139058914, 0.07212675143335316, -0.16677368838163847, 0.051882184405081175, 0.06681309885068519]
1,802.08355
The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution
This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all n,m.
math.CO
this paper completes the project started in 10 to solve the edgeisoperimetric problem on the generalized and extended sierpinski graph snm we prove that initial segments of lexicographic order are solutions of the eip for all nm
[['this', 'paper', 'completes', 'the', 'project', 'started', 'in', '10', 'to', 'solve', 'the', 'edgeisoperimetric', 'problem', 'on', 'the', 'generalized', 'and', 'extended', 'sierpinski', 'graph', 'snm', 'we', 'prove', 'that', 'initial', 'segments', 'of', 'lexicographic', 'order', 'are', 'solutions', 'of', 'the', 'eip', 'for', 'all', 'nm']]
[-0.10256018100709126, 0.04344371274566731, -0.02152129408676882, 0.07038039534126182, -0.08230511345774741, -0.062294514950465514, -0.018671621968088723, 0.3577391953283065, -0.2727750852905415, -0.2856437979970832, 0.15382316270276802, -0.32522569991950245, -0.09264612338990225, 0.12157552633937951, -0.05789784080273396, 0.08844446265012831, 0.09301572371072866, 0.04269639714746862, -0.04937012732104474, -0.2897964977144855, 0.35551061685121543, -0.02361212031777344, 0.22896552554054841, 0.07036541747338315, 0.08444149084892627, -0.0010707282486396867, -0.027150175345407146, 0.02192482543555466, -0.19751186339232624, 0.11787094492654039, 0.24483909296828346, 0.14246080806353004, 0.2568340341661226, -0.420519297992861, -0.12972352872728496, 0.16356111409746715, 0.14688604681224032, 0.06567486118827318, 0.046853657286437984, -0.2590526461450232, 0.16843594653481567, -0.14848841072337046, -0.14859761687851436, 0.032653618679457416, 0.029750328309632635, 0.023826415977767995, -0.25179314150198084, -0.0062800845181619795, 0.11845507146475988, -0.0005600696328926731, -0.08237479852411796, -0.1254427300866794, 0.04373479974330277, 0.09107857122010476, -0.04783621485772971, 0.03600677935960325, 0.0036722851564755313, -0.04869171022437513, -0.14030525350087397, 0.3881368375811222, -0.02149322159852631, -0.1447970142235627, 0.08075752441544791, -0.11110917649961807, -0.17880143979060892, 0.10492975632282528, 0.18451254758228725, 0.16628829087759997, -0.11775688844657428, 0.13476230352456253, -0.06886593135375832, 0.15685328594534784, 0.1536130691828156, -0.05819542223990366, 0.08323410585698848, 0.14226577561852094, 0.12142098546531555, 0.23421069300053893, -0.007989316983651873, -0.08548709877288423, -0.2706588654955094, -0.15953017949642664, -0.15374187961208155, 0.030964538253642416, -0.10351437841175515, -0.1646895443995458, 0.4538839620512885, 0.17301632969866734, 0.13874472904245597, 0.11784841193238625, 0.20663118977854783, 0.04988350955819761, 0.012617438271755, 0.10024827458216129, 0.16497802271230802, 0.12240313335850432, 0.1000138813302525, -0.15146200733913764, 0.014592593277779382, 0.1413916892346901]
1,802.08356
Polymorphism of stable collagen fibrils
Collagen fibrils are versatile self-assembled structures that provide mechanical integrity within mammalian tissues. The radius of collagen fibrils vary widely depending on experimental conditions \textit{in vitro} or anatomical location \textit{in vivo}. Here we explore the variety of thermodynamically stable fibril configurations that are available. We use a liquid crystal model of radial collagen fibril structure with a double-twist director field. Using a numerical relaxation method we show that two dimensionless parameters, the ratio of saddle-splay to twist elastic constants $ k_{24}/K_{22}$ and the ratio of surface tension to chiral strength $\hat{\gamma} \equiv \gamma/(K_{22}q)$, largely specify both the scaled fibril radius and the associated surface twist of equilibrium fibrils. We find that collagen fibrils are the stable phase with respect to the cholesteric phase only when the reduced surface tension is small, $\hat{\gamma} \lesssim 0.2$. Within this stable regime, collagen fibrils can access a wide range of radii and associated surface twists. Remarkably, we find a maximal equilibrium surface twist of $0.33$ rad ($19^{\text{o}}$). Our results are compatible with corneal collagen fibrils, and we show how the large surface twist is needed to explain the narrow distribution of corneal fibril radii. Conversely, we show how small surface twist is required for the thermodynamic stability of tendon fibrils in the face of considerable polydispersity of radius.
cond-mat.soft
collagen fibrils are versatile selfassembled structures that provide mechanical integrity within mammalian tissues the radius of collagen fibrils vary widely depending on experimental conditions textitin vitro or anatomical location textitin vivo here we explore the variety of thermodynamically stable fibril configurations that are available we use a liquid crystal model of radial collagen fibril structure with a doubletwist director field using a numerical relaxation method we show that two dimensionless parameters the ratio of saddlesplay to twist elastic constants k_24k_22 and the ratio of surface tension to chiral strength hatgamma equiv gammak_22q largely specify both the scaled fibril radius and the associated surface twist of equilibrium fibrils we find that collagen fibrils are the stable phase with respect to the cholesteric phase only when the reduced surface tension is small hatgamma lesssim 02 within this stable regime collagen fibrils can access a wide range of radii and associated surface twists remarkably we find a maximal equilibrium surface twist of 033 rad 19texto our results are compatible with corneal collagen fibrils and we show how the large surface twist is needed to explain the narrow distribution of corneal fibril radii conversely we show how small surface twist is required for the thermodynamic stability of tendon fibrils in the face of considerable polydispersity of radius
[['collagen', 'fibrils', 'are', 'versatile', 'selfassembled', 'structures', 'that', 'provide', 'mechanical', 'integrity', 'within', 'mammalian', 'tissues', 'the', 'radius', 'of', 'collagen', 'fibrils', 'vary', 'widely', 'depending', 'on', 'experimental', 'conditions', 'textitin', 'vitro', 'or', 'anatomical', 'location', 'textitin', 'vivo', 'here', 'we', 'explore', 'the', 'variety', 'of', 'thermodynamically', 'stable', 'fibril', 'configurations', 'that', 'are', 'available', 'we', 'use', 'a', 'liquid', 'crystal', 'model', 'of', 'radial', 'collagen', 'fibril', 'structure', 'with', 'a', 'doubletwist', 'director', 'field', 'using', 'a', 'numerical', 'relaxation', 'method', 'we', 'show', 'that', 'two', 'dimensionless', 'parameters', 'the', 'ratio', 'of', 'saddlesplay', 'to', 'twist', 'elastic', 'constants', 'k_24k_22', 'and', 'the', 'ratio', 'of', 'surface', 'tension', 'to', 'chiral', 'strength', 'hatgamma', 'equiv', 'gammak_22q', 'largely', 'specify', 'both', 'the', 'scaled', 'fibril', 'radius', 'and', 'the', 'associated', 'surface', 'twist', 'of', 'equilibrium', 'fibrils', 'we', 'find', 'that', 'collagen', 'fibrils', 'are', 'the', 'stable', 'phase', 'with', 'respect', 'to', 'the', 'cholesteric', 'phase', 'only', 'when', 'the', 'reduced', 'surface', 'tension', 'is', 'small', 'hatgamma', 'lesssim', '02', 'within', 'this', 'stable', 'regime', 'collagen', 'fibrils', 'can', 'access', 'a', 'wide', 'range', 'of', 'radii', 'and', 'associated', 'surface', 'twists', 'remarkably', 'we', 'find', 'a', 'maximal', 'equilibrium', 'surface', 'twist', 'of', '033', 'rad', '19texto', 'our', 'results', 'are', 'compatible', 'with', 'corneal', 'collagen', 'fibrils', 'and', 'we', 'show', 'how', 'the', 'large', 'surface', 'twist', 'is', 'needed', 'to', 'explain', 'the', 'narrow', 'distribution', 'of', 'corneal', 'fibril', 'radii', 'conversely', 'we', 'show', 'how', 'small', 'surface', 'twist', 'is', 'required', 'for', 'the', 'thermodynamic', 'stability', 'of', 'tendon', 'fibrils', 'in', 'the', 'face', 'of', 'considerable', 'polydispersity', 'of', 'radius']]
[-0.14533503080407778, 0.2075026045087725, -0.03336057912092656, 0.023519617226529156, -0.043315026810437085, -0.13220641544709602, -0.02216918334043363, 0.47716207603613536, -0.27758377118568334, -0.25488004635581524, 0.04838855435206954, -0.2114714800114078, -0.2003222180098029, 0.1398755029309541, -0.042937748226644805, 0.03190864317252168, 0.07098486632818267, -0.013145581461971492, -0.025845302334277048, -0.1345279579050839, 0.23473884443131585, 0.032433334234658454, 0.28335240835190884, 0.08112500165145667, 0.061427818544741185, -0.07139898540751477, 0.08724390722899919, 0.07649250467795701, -0.2900145292155988, 0.13044490837270306, 0.2114720039989888, 0.030197519864443512, 0.1726054059219591, -0.45684889059602507, -0.1958586356846527, 0.04536767409937013, 0.15124468699629817, 0.09151473224517845, 0.007118504414046626, -0.1959823809758139, 0.11671461417295394, -0.11131732150513146, -0.17413750537005918, -0.06785228680819273, 0.041423550159448666, 0.0623613426083466, -0.23121952467204426, 0.12802061477254723, -0.0256083653552369, 0.12293557905636374, -0.13451103023031638, -0.10365886099836123, -0.13004050632229164, 0.0971147010974597, 0.09654157386615961, 0.029301631133005556, 0.3030275526656104, -0.13147948576452542, 0.0013751751831954434, 0.35847778184383755, -0.012809587090409228, -0.14410691518403057, 0.13916831735321986, -0.16322290048535382, -0.10478225492739252, 0.2018958813433225, 0.11479391341202981, 0.10883892774859089, -0.08917911552520569, 0.016784570435993372, -0.04598231624168832, 0.2610111535210828, 0.12200886040615538, -0.042907273575907484, 0.25041145588315666, 0.17486484988392995, 0.0045444442668841, 0.10440855606159727, -0.16502243376591996, -0.0739951877444539, -0.28742920287019974, -0.1639746387178699, -0.10295086729539825, 0.033951719147374944, -0.16163421857608704, -0.22614219628850973, 0.3394671068925943, 0.06594866209973892, 0.21821532107091376, 0.05958309182675467, 0.18909871899079353, -0.03289479823239769, 0.10766837047634735, -0.0021493427776953294, 0.29224794218316674, 0.16996885501453757, 0.07995369790698446, -0.2715631811081299, 0.10280657632586856, 0.013389262317546776]
1,802.08357
Generalized Analysis of Elastic Wave Dispersion Asymmetries in Moving Periodic Media
This work presents a generalized physical interpretation of unconventional dispersion asymmetries associated moving elastic solids. By shifting the notion from systems with time-variant material fields to physically traveling materials, the newly adopted paradigm provides an eloquent take on the dispersion problem and, in the process, highlights discrepancies between both schemes. Equations governing the motion of an elastic rod with a prescribed moving velocity observed from a stationary reference frame are used to predict propagation patterns and asymmetries in wave velocities induced as a result of the induced linear momentum bias. Three distinct scenarios corresponding to a moving rod with a constant modulus, a spatially varying one, and one that varies in space and time are presented. These cases are utilized to extract and interpret correlations pertaining to directional velocities, dispersion patterns, as well as nature of band gaps between moving periodic media and their stationary counterparts with time-traveling material properties. A linear vertical shear transformation is derived and utilized to thoroughly neutralize the effect of the moving velocity on the resultant dispersion characteristics. Finally, dispersion contours associated with the transient response of a finite moving medium are used to validate the entirety of the presented framework.
physics.app-ph
this work presents a generalized physical interpretation of unconventional dispersion asymmetries associated moving elastic solids by shifting the notion from systems with timevariant material fields to physically traveling materials the newly adopted paradigm provides an eloquent take on the dispersion problem and in the process highlights discrepancies between both schemes equations governing the motion of an elastic rod with a prescribed moving velocity observed from a stationary reference frame are used to predict propagation patterns and asymmetries in wave velocities induced as a result of the induced linear momentum bias three distinct scenarios corresponding to a moving rod with a constant modulus a spatially varying one and one that varies in space and time are presented these cases are utilized to extract and interpret correlations pertaining to directional velocities dispersion patterns as well as nature of band gaps between moving periodic media and their stationary counterparts with timetraveling material properties a linear vertical shear transformation is derived and utilized to thoroughly neutralize the effect of the moving velocity on the resultant dispersion characteristics finally dispersion contours associated with the transient response of a finite moving medium are used to validate the entirety of the presented framework
[['this', 'work', 'presents', 'a', 'generalized', 'physical', 'interpretation', 'of', 'unconventional', 'dispersion', 'asymmetries', 'associated', 'moving', 'elastic', 'solids', 'by', 'shifting', 'the', 'notion', 'from', 'systems', 'with', 'timevariant', 'material', 'fields', 'to', 'physically', 'traveling', 'materials', 'the', 'newly', 'adopted', 'paradigm', 'provides', 'an', 'eloquent', 'take', 'on', 'the', 'dispersion', 'problem', 'and', 'in', 'the', 'process', 'highlights', 'discrepancies', 'between', 'both', 'schemes', 'equations', 'governing', 'the', 'motion', 'of', 'an', 'elastic', 'rod', 'with', 'a', 'prescribed', 'moving', 'velocity', 'observed', 'from', 'a', 'stationary', 'reference', 'frame', 'are', 'used', 'to', 'predict', 'propagation', 'patterns', 'and', 'asymmetries', 'in', 'wave', 'velocities', 'induced', 'as', 'a', 'result', 'of', 'the', 'induced', 'linear', 'momentum', 'bias', 'three', 'distinct', 'scenarios', 'corresponding', 'to', 'a', 'moving', 'rod', 'with', 'a', 'constant', 'modulus', 'a', 'spatially', 'varying', 'one', 'and', 'one', 'that', 'varies', 'in', 'space', 'and', 'time', 'are', 'presented', 'these', 'cases', 'are', 'utilized', 'to', 'extract', 'and', 'interpret', 'correlations', 'pertaining', 'to', 'directional', 'velocities', 'dispersion', 'patterns', 'as', 'well', 'as', 'nature', 'of', 'band', 'gaps', 'between', 'moving', 'periodic', 'media', 'and', 'their', 'stationary', 'counterparts', 'with', 'timetraveling', 'material', 'properties', 'a', 'linear', 'vertical', 'shear', 'transformation', 'is', 'derived', 'and', 'utilized', 'to', 'thoroughly', 'neutralize', 'the', 'effect', 'of', 'the', 'moving', 'velocity', 'on', 'the', 'resultant', 'dispersion', 'characteristics', 'finally', 'dispersion', 'contours', 'associated', 'with', 'the', 'transient', 'response', 'of', 'a', 'finite', 'moving', 'medium', 'are', 'used', 'to', 'validate', 'the', 'entirety', 'of', 'the', 'presented', 'framework']]
[-0.14350931406168418, 0.1297621887151392, -0.09608269163629525, 0.03687204545866159, -0.10522286545209662, -0.10286762089972214, 0.018138585576837483, 0.4082488626222677, -0.31996431609387604, -0.28424087025781103, 0.04868128714662483, -0.2740269328066034, -0.1306702237485965, 0.18909568825917206, -0.0022846590074216376, 0.07897806039545685, -0.006591111562352589, -0.0032460087986320866, -0.07274889641165809, -0.14271634742641365, 0.3031113150135177, 0.026125434176088785, 0.30440974507328805, -0.015264478855414734, 0.10714143236305526, 0.010093196302329247, -0.05221952228659612, 0.06991848333823049, -0.1299589375530002, 0.10530101138639872, 0.2018493055175914, 0.0058235128948284426, 0.22387128921073615, -0.4166211220625864, -0.2432041483627138, 0.043149580834825445, 0.13647215710703417, 0.11097076775183026, -0.05744322226382792, -0.304761099657614, 0.028901841087570906, -0.140297885573165, -0.20289048403311444, -0.02292050276312749, 0.04753158478231445, 0.06845437708947504, -0.22012604583216336, 0.11865253601114759, 0.015161697402339885, 0.04541752957002431, -0.11244130187325788, -0.07679176581512699, -0.041994507666867305, 0.1249395239105144, 0.0643417096549196, 0.0008992525482816356, 0.13654194977039433, -0.10419346772167566, -0.08576278846558867, 0.4498918178177686, -0.06428546486071986, -0.23083821330777826, 0.206701532915016, -0.10738463390292481, -0.034536976330409926, 0.15133654820846812, 0.22605173993019426, 0.07116196653122624, -0.15219579792429447, -0.007672886755875768, -0.007976677381520858, 0.13762452976531064, 0.09605652072623715, 0.04775193438162001, 0.23540626761351466, 0.12400949861063165, 0.019538923986945112, 0.12304697396490266, -0.1228367221590407, -0.07683484255554801, -0.3047500981436092, -0.1309638886180307, -0.12335517784409529, -0.01766774215480391, -0.06880862671207477, -0.17960503214865695, 0.37230683431475975, 0.11324934918808807, 0.21960883757410743, 0.022594588335926587, 0.26700756053810903, 0.1213248334260781, 0.05327433111070066, 0.08343131507376247, 0.24334655289790041, 0.1776107889802043, 0.12243900492036601, -0.22948884161911448, 0.06986057955049435, 0.02259658878355534]
1,802.08358
Time Consistent Stopping For The Mean-Standard Deviation Problem --- The Discrete Time Case
Inspired by Strotz's consistent planning strategy, we formulate the infinite horizon mean-variance stopping problem as a subgame perfect Nash equilibrium in order to determine time consistent strategies with no regret. Equilibria among stopping times or randomized stopping times may not exist. This motivates us to consider the notion of liquidation strategies, which lets the stopping right to be divisible. We then argue that the mean-standard deviation variant of this problem makes more sense for this type of strategies in terms of time consistency. It turns out that an equilibrium liquidation strategy always exists. We then analyze whether optimal equilibrium liquidation strategies exist and whether they are unique and observe that neither may hold.
q-fin.MF math.OC math.PR q-fin.EC
inspired by strotzs consistent planning strategy we formulate the infinite horizon meanvariance stopping problem as a subgame perfect nash equilibrium in order to determine time consistent strategies with no regret equilibria among stopping times or randomized stopping times may not exist this motivates us to consider the notion of liquidation strategies which lets the stopping right to be divisible we then argue that the meanstandard deviation variant of this problem makes more sense for this type of strategies in terms of time consistency it turns out that an equilibrium liquidation strategy always exists we then analyze whether optimal equilibrium liquidation strategies exist and whether they are unique and observe that neither may hold
[['inspired', 'by', 'strotzs', 'consistent', 'planning', 'strategy', 'we', 'formulate', 'the', 'infinite', 'horizon', 'meanvariance', 'stopping', 'problem', 'as', 'a', 'subgame', 'perfect', 'nash', 'equilibrium', 'in', 'order', 'to', 'determine', 'time', 'consistent', 'strategies', 'with', 'no', 'regret', 'equilibria', 'among', 'stopping', 'times', 'or', 'randomized', 'stopping', 'times', 'may', 'not', 'exist', 'this', 'motivates', 'us', 'to', 'consider', 'the', 'notion', 'of', 'liquidation', 'strategies', 'which', 'lets', 'the', 'stopping', 'right', 'to', 'be', 'divisible', 'we', 'then', 'argue', 'that', 'the', 'meanstandard', 'deviation', 'variant', 'of', 'this', 'problem', 'makes', 'more', 'sense', 'for', 'this', 'type', 'of', 'strategies', 'in', 'terms', 'of', 'time', 'consistency', 'it', 'turns', 'out', 'that', 'an', 'equilibrium', 'liquidation', 'strategy', 'always', 'exists', 'we', 'then', 'analyze', 'whether', 'optimal', 'equilibrium', 'liquidation', 'strategies', 'exist', 'and', 'whether', 'they', 'are', 'unique', 'and', 'observe', 'that', 'neither', 'may', 'hold']]
[-0.10425876916138674, 0.07175876003564734, -0.17928695867073025, 0.13168502542051813, -0.0945744243626659, -0.21046481645238158, 0.1517363622772029, 0.4250454099697841, -0.33036775841704896, -0.24549598181368532, 0.15093672049372364, -0.2306166688517273, -0.1102978782518557, 0.08706780953693564, -0.14861781327137807, 0.015252657164400024, 0.018016164593801304, 0.018740135974980688, -0.021766944820908747, -0.2890373147155687, 0.2948920211654056, 0.063433426852875, 0.2805324680348103, 0.013462144266897897, 0.1281865068369436, 0.01307152490866232, 0.010149772648137432, 0.10230025774086113, -0.2061159190928814, 0.0010858116637881812, 0.32731558482565387, 0.20900108066160936, 0.35669033111047904, -0.4221363672147597, -0.12129256596813935, 0.27153659881268805, 0.12230790932536931, 0.09236547179406861, 0.0014109678952147144, -0.17239975593648516, 0.07685871108284069, -0.14992671617231257, -0.14913971402246068, -0.07399266159480757, 0.023686606017453177, -0.02429257563172697, -0.36410436016163444, 0.04130166445267261, 0.06928812963300729, -0.0193585998605232, -0.0838761561181027, -0.10491457431333827, 0.04216797459190963, 0.10178911376971046, 0.09366085769101004, -0.07332265152184812, 0.10042045781019705, -0.08090990202329415, -0.2171673018764285, 0.37664646026888143, -0.009331490514120338, -0.18990679021698195, 0.15206368006650475, -0.08464777093330347, -0.10394922025849926, 0.12745516144813182, 0.13024529378424893, 0.18168281568717715, -0.1709074380614602, 0.0502583860988133, -0.10284808508816871, 0.17381385576109998, 0.12205942698779541, 0.022405314434378466, 0.18865867158993743, 0.11745137460361998, 0.26563553910635346, 0.1224022075808649, 0.033538962768910975, -0.21014520181510765, -0.31286289933062084, -0.1094816090656562, -0.07979644378353548, 0.10515120270547168, -0.07450872347957606, -0.16537936213887758, 0.2861981750591784, 0.1948768412148966, 0.11308341881948279, 0.12966607192317275, 0.21363565889879357, 0.11047341549026503, -0.05857094016916177, 0.1503327990261217, 0.21659775126960362, 0.004070117746622444, 0.08334835478196945, -0.2487683590440717, 0.15206263262384176, 0.06454557072169878]
1,802.08359
PIRT: A Runtime Framework to Enable Energy-Efficient Real-Time Robotic Applications on Heterogeneous Architectures
Enabling full robotic workloads with diverse behaviors on mobile systems with stringent resource and energy constraints remains a challenge. In recent years, attempts have been made to deploy single-accelerator-based computing platforms (such as GPU, DSP, or FPGA) to address this challenge, but with little success. The core problem is two-fold: firstly, different robotic tasks require different accelerators, and secondly, managing multiple accelerators simultaneously is overwhelming for developers. In this paper, we propose PIRT, the first robotic runtime framework to efficiently manage dynamic task executions on mobile systems with multiple accelerators as well as on the cloud to achieve better performance and energy savings. With PIRT, we enable a robot to simultaneously perform autonomous navigation with 25 FPS of localization, obstacle detection with 3 FPS, route planning, large map generation, and scene understanding, traveling at a max speed of 5 miles per hour, all within an 11W computing power envelope.
cs.RO
enabling full robotic workloads with diverse behaviors on mobile systems with stringent resource and energy constraints remains a challenge in recent years attempts have been made to deploy singleacceleratorbased computing platforms such as gpu dsp or fpga to address this challenge but with little success the core problem is twofold firstly different robotic tasks require different accelerators and secondly managing multiple accelerators simultaneously is overwhelming for developers in this paper we propose pirt the first robotic runtime framework to efficiently manage dynamic task executions on mobile systems with multiple accelerators as well as on the cloud to achieve better performance and energy savings with pirt we enable a robot to simultaneously perform autonomous navigation with 25 fps of localization obstacle detection with 3 fps route planning large map generation and scene understanding traveling at a max speed of 5 miles per hour all within an 11w computing power envelope
[['enabling', 'full', 'robotic', 'workloads', 'with', 'diverse', 'behaviors', 'on', 'mobile', 'systems', 'with', 'stringent', 'resource', 'and', 'energy', 'constraints', 'remains', 'a', 'challenge', 'in', 'recent', 'years', 'attempts', 'have', 'been', 'made', 'to', 'deploy', 'singleacceleratorbased', 'computing', 'platforms', 'such', 'as', 'gpu', 'dsp', 'or', 'fpga', 'to', 'address', 'this', 'challenge', 'but', 'with', 'little', 'success', 'the', 'core', 'problem', 'is', 'twofold', 'firstly', 'different', 'robotic', 'tasks', 'require', 'different', 'accelerators', 'and', 'secondly', 'managing', 'multiple', 'accelerators', 'simultaneously', 'is', 'overwhelming', 'for', 'developers', 'in', 'this', 'paper', 'we', 'propose', 'pirt', 'the', 'first', 'robotic', 'runtime', 'framework', 'to', 'efficiently', 'manage', 'dynamic', 'task', 'executions', 'on', 'mobile', 'systems', 'with', 'multiple', 'accelerators', 'as', 'well', 'as', 'on', 'the', 'cloud', 'to', 'achieve', 'better', 'performance', 'and', 'energy', 'savings', 'with', 'pirt', 'we', 'enable', 'a', 'robot', 'to', 'simultaneously', 'perform', 'autonomous', 'navigation', 'with', '25', 'fps', 'of', 'localization', 'obstacle', 'detection', 'with', '3', 'fps', 'route', 'planning', 'large', 'map', 'generation', 'and', 'scene', 'understanding', 'traveling', 'at', 'a', 'max', 'speed', 'of', '5', 'miles', 'per', 'hour', 'all', 'within', 'an', '11w', 'computing', 'power', 'envelope']]
[-0.14245343937057064, 0.037762262827663706, -0.008774987735538458, -0.005366577114276335, -0.11517181771579293, -0.19311788417462286, 0.0471253722793657, 0.45226329136766547, -0.2373660030065193, -0.4582620662744759, 0.11858614653089167, -0.23190608554120576, -0.10810637974091583, 0.2364632406851695, -0.12204480614532165, 0.1460617898114431, 0.1244059564152948, 0.013947269464304456, -0.032101361518155555, -0.26958307745624144, 0.20775957706504736, 0.07967814714742863, 0.3018110656832047, 0.06243045007347503, 0.12481772625932888, -0.020699280618252804, 0.0287053862485249, -0.07081504447423682, -0.028387473828038898, 0.1745075960540637, 0.349543418570542, 0.20057956522273623, 0.3490032227393113, -0.5006534130927048, -0.20149722128637693, 0.08330944331907698, 0.1420065541023097, 0.05054812798384248, -0.048342937948087195, -0.2784130061615486, 0.10626596655636443, -0.22180244633864585, -0.08846588065961794, -0.0786158294887377, 0.031864297850260216, 0.022012362327920844, -0.22423401835444226, -0.030068675174891035, -0.03150936167886747, 0.08111247111137221, -0.03828910678359015, -0.0752249099821055, 0.08658803860517536, 0.19046861297121512, 0.014740580734068236, 0.0565192652105981, 0.15212924017366591, -0.15835285780248137, -0.18420157021111144, 0.44126497197668163, 0.018506725150838392, -0.14704622883481516, 0.2401302651609896, -0.05410912292249197, -0.1833421611955681, 0.0972713309622902, 0.2728314874543283, 0.09889093601480634, -0.174464662337587, 0.01321977185446541, 0.04034107447729357, 0.19552328803126706, 0.06610572651237706, 0.028687289735416368, 0.22900997132195958, 0.29834804699128986, 0.12861735088319903, 0.10308610505129838, -0.08915098421243937, -0.09700120542971354, -0.16545656887057306, -0.13088405513058918, -0.13056093797825757, 0.014914300083806406, -0.049172267132061756, -0.09066330031396783, 0.3469814451595097, 0.21033506458118356, 0.15531599162254153, 0.11681513533512523, 0.43005258569075744, 0.04450978147147895, 0.12960281829368703, 0.14927216174617905, 0.1535001119066562, -0.05057176715396598, 0.2226636365632571, -0.17244296529224193, 0.021614778371920593, -0.022558625812838677]