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.0296 | Singular values of large non-central random matrices | We study largest singular values of large random matrices, each with mean of
a fixed rank $K$. Our main result is a limit theorem as the number of rows and
columns approach infinity, while their ratio approaches a positive constant. It
provides a decomposition of the largest $K$ singular values into the
deterministic rate of growth, random centered fluctuations given as explicit
linear combinations of the entries of the matrix, and a term negligible in
probability. We use this representation to establish asymptotic normality of
the largest singular values for random matrices with means that have block
structure. We also deduce asymptotic normality for the largest eigenvalues of
the normalized covariance matrix arising in a model of population genetics.
| math.PR | we study largest singular values of large random matrices each with mean of a fixed rank k our main result is a limit theorem as the number of rows and columns approach infinity while their ratio approaches a positive constant it provides a decomposition of the largest k singular values into the deterministic rate of growth random centered fluctuations given as explicit linear combinations of the entries of the matrix and a term negligible in probability we use this representation to establish asymptotic normality of the largest singular values for random matrices with means that have block structure we also deduce asymptotic normality for the largest eigenvalues of the normalized covariance matrix arising in a model of population genetics | [['we', 'study', 'largest', 'singular', 'values', 'of', 'large', 'random', 'matrices', 'each', 'with', 'mean', 'of', 'a', 'fixed', 'rank', 'k', 'our', 'main', 'result', 'is', 'a', 'limit', 'theorem', 'as', 'the', 'number', 'of', 'rows', 'and', 'columns', 'approach', 'infinity', 'while', 'their', 'ratio', 'approaches', 'a', 'positive', 'constant', 'it', 'provides', 'a', 'decomposition', 'of', 'the', 'largest', 'k', 'singular', 'values', 'into', 'the', 'deterministic', 'rate', 'of', 'growth', 'random', 'centered', 'fluctuations', 'given', 'as', 'explicit', 'linear', 'combinations', 'of', 'the', 'entries', 'of', 'the', 'matrix', 'and', 'a', 'term', 'negligible', 'in', 'probability', 'we', 'use', 'this', 'representation', 'to', 'establish', 'asymptotic', 'normality', 'of', 'the', 'largest', 'singular', 'values', 'for', 'random', 'matrices', 'with', 'means', 'that', 'have', 'block', 'structure', 'we', 'also', 'deduce', 'asymptotic', 'normality', 'for', 'the', 'largest', 'eigenvalues', 'of', 'the', 'normalized', 'covariance', 'matrix', 'arising', 'in', 'a', 'model', 'of', 'population', 'genetics']] | [-0.13730389054227785, 0.08977729529377167, -0.06256661186104312, 0.03761360205381232, -0.03381901469175555, -0.10524771643505126, 0.07115961615966648, 0.29059217417487454, -0.2643376584125667, -0.20716295691848802, 0.14035076285055018, -0.2976111439134957, -0.1661739089494931, 0.12345366751062958, -0.031180118026697085, 0.06712451969268986, 0.05498237133871357, 0.08362423322953973, -0.09182606615075263, -0.24546801700147197, 0.3142328969899471, 0.039929519517018515, 0.26289134405107245, -0.023897112524254294, 0.13065726280910894, 0.02248961100464358, -0.037436540395084046, 0.017818370479855593, -0.13375898465709105, 0.11638527154969443, 0.23834342213676257, 0.11985939623741042, 0.3233789181840697, -0.34265106240240467, -0.12817653457188055, 0.192309979584162, 0.11986485450771175, 0.09251213280147552, 0.011692591816404084, -0.21822908125473423, 0.15736888289968132, -0.15380934024808787, -0.18609840301072866, -0.03141133770925783, 0.036135142286574204, 0.03825180238785864, -0.34472315939106124, 0.09184562213530083, 0.08857745269485631, 0.06295089582137826, -0.03216009678225182, -0.2407486139162749, 0.023998362335039915, 0.13876587021391557, 0.09220876161717348, -0.06146726333790561, 0.0966295797941314, -0.08118104768189124, -0.05505765802735666, 0.30516655511269736, -0.10554217951794882, -0.208706228860787, 0.10675287163745956, -0.18691748562621094, -0.10997315473314531, 0.12237574836677488, 0.19270497442324871, 0.11424149407348752, -0.09543807979941196, 0.14305197023258334, -0.11011315885336459, 0.14113523239786385, 0.07362442227283947, 0.03340564708092383, 0.14543092314999143, 0.08923713590934121, 0.12151552738911402, 0.14027091233106723, -0.04862046670246901, -0.07961745737824871, -0.3204861186237364, -0.13974296626392282, -0.2672580916565616, 0.11475848745429466, -0.24968618707718648, -0.25095198564857496, 0.38573704634894845, 0.10943184073763985, 0.2856195308972432, 0.1446161626186613, 0.2551234263873917, 0.14130638486083535, 0.04641011808881489, 0.07601774300314328, 0.12310824234883826, 0.25129068249194814, 0.026438130169496442, -0.16965630108553195, 0.10240928823629222, 0.1263982133642465] |
1,802.02961 | Learning Sparse Wavelet Representations | In this work we propose a method for learning wavelet filters directly from
data. We accomplish this by framing the discrete wavelet transform as a
modified convolutional neural network. We introduce an autoencoder wavelet
transform network that is trained using gradient descent. We show that the
model is capable of learning structured wavelet filters from synthetic and real
data. The learned wavelets are shown to be similar to traditional wavelets that
are derived using Fourier methods. Our method is simple to implement and easily
incorporated into neural network architectures. A major advantage to our model
is that we can learn from raw audio data.
| cs.LG stat.ML | in this work we propose a method for learning wavelet filters directly from data we accomplish this by framing the discrete wavelet transform as a modified convolutional neural network we introduce an autoencoder wavelet transform network that is trained using gradient descent we show that the model is capable of learning structured wavelet filters from synthetic and real data the learned wavelets are shown to be similar to traditional wavelets that are derived using fourier methods our method is simple to implement and easily incorporated into neural network architectures a major advantage to our model is that we can learn from raw audio data | [['in', 'this', 'work', 'we', 'propose', 'a', 'method', 'for', 'learning', 'wavelet', 'filters', 'directly', 'from', 'data', 'we', 'accomplish', 'this', 'by', 'framing', 'the', 'discrete', 'wavelet', 'transform', 'as', 'a', 'modified', 'convolutional', 'neural', 'network', 'we', 'introduce', 'an', 'autoencoder', 'wavelet', 'transform', 'network', 'that', 'is', 'trained', 'using', 'gradient', 'descent', 'we', 'show', 'that', 'the', 'model', 'is', 'capable', 'of', 'learning', 'structured', 'wavelet', 'filters', 'from', 'synthetic', 'and', 'real', 'data', 'the', 'learned', 'wavelets', 'are', 'shown', 'to', 'be', 'similar', 'to', 'traditional', 'wavelets', 'that', 'are', 'derived', 'using', 'fourier', 'methods', 'our', 'method', 'is', 'simple', 'to', 'implement', 'and', 'easily', 'incorporated', 'into', 'neural', 'network', 'architectures', 'a', 'major', 'advantage', 'to', 'our', 'model', 'is', 'that', 'we', 'can', 'learn', 'from', 'raw', 'audio', 'data']] | [0.032257505407100186, -0.003724290692564234, -0.18497478324906508, 0.08367430741334549, -0.1369852919059877, -0.16990724106122237, -0.04759992488946479, 0.5352864959814514, -0.36835937368092486, -0.24723352250069952, 0.08145509749234546, -0.22666179077126658, -0.30749197941846573, 0.22398323027524525, -0.1441281710912545, 0.11482283241975193, 0.11850150897785519, 0.005201854841568722, -0.08093588664465082, -0.2517824644612399, 0.2928688006538253, 0.0434430024962729, 0.3507665107205797, -0.10768074852799495, 0.14970637873473328, -0.03205454201312163, -0.05155556537927343, -0.04759752701927657, -0.02228692004847779, 0.20367004265650535, 0.29222713441749176, 0.22639708992881843, 0.3050442800069085, -0.4452943065418647, -0.25480530283843666, 0.08794912566932347, 0.14538038881381418, 0.11018584913780125, -0.03510696214596884, -0.35999850674460715, 0.1104464531929877, -0.14282511338108003, 0.047631379237058215, -0.21090543678460213, -0.09189747369740732, -0.008809877336786415, -0.3354105755077818, 0.03662404662239938, 0.06660801578366843, 0.02992578995270798, -0.04555366400969573, -0.09473765306532957, 0.0014405839655619974, 0.11494296129631738, -0.019966896992767803, 0.06169939784852501, 0.11836537834964335, -0.055327027082407415, -0.1155351994944235, 0.34245469585920757, -0.11657859799631226, -0.2511813972199049, 0.14408876866666384, -0.003358933882107242, -0.1497385706215237, 0.09660397170899579, 0.2710858243875779, 0.08476194572778276, -0.20507328259722832, 0.009712417837223396, -0.07219678393672578, 0.1972264934805795, 0.011599094548728317, -0.05359406226601165, 0.12876128039631743, 0.21841812499154073, 0.020145137588350244, 0.19000796114358728, -0.17750010226266638, -0.010727299914623682, -0.21486669227194327, -0.08693422461286761, -0.2920677826399557, -0.04651978053152561, -0.09622838311854419, -0.12601344707875867, 0.43900394393131137, 0.23634163866518065, 0.21894298700723225, 0.15289403294893697, 0.36273753960043764, 0.09092544770660774, 0.1864924380161728, 0.10824327906056379, 0.15278001026196691, 0.05470890037115449, 0.13158948969346687, -0.10824514394670796, -0.0039022641856438266, 0.10298327083532618] |
1,802.02962 | Eight-cluster structure of chloroplast genomes differs from similar one
observed for bacteria | Previously, a seven-cluster pattern claiming to be a universal one in
bacterial genomes has been reported. Keeping in mind the most popular theory of
chloroplast origin, we checked whether a similar pattern is observed in
chloroplast genomes. Surprisingly, eight cluster structure has been found, for
chloroplasts. The pattern observed for chloroplasts differs rather
significantly, from bacterial one, and from that latter observed for
cyanobacteria. The structure is provided by clustering of the fragments of
equal length isolated within a genome so that each fragment is converted in
triplet frequency dictionary with non-overlapping triplets with no gaps in
frame tiling. The points in 63-dimensional space were clustered due to elastic
map technique. The eight cluster found in chloroplasts comprises the fragments
of a genome bearing tRNA genes and exhibiting excessively high
$\mathsf{GC}$-content, in comparison to the entire genome.
| q-bio.GN | previously a sevencluster pattern claiming to be a universal one in bacterial genomes has been reported keeping in mind the most popular theory of chloroplast origin we checked whether a similar pattern is observed in chloroplast genomes surprisingly eight cluster structure has been found for chloroplasts the pattern observed for chloroplasts differs rather significantly from bacterial one and from that latter observed for cyanobacteria the structure is provided by clustering of the fragments of equal length isolated within a genome so that each fragment is converted in triplet frequency dictionary with nonoverlapping triplets with no gaps in frame tiling the points in 63dimensional space were clustered due to elastic map technique the eight cluster found in chloroplasts comprises the fragments of a genome bearing trna genes and exhibiting excessively high mathsfgccontent in comparison to the entire genome | [['previously', 'a', 'sevencluster', 'pattern', 'claiming', 'to', 'be', 'a', 'universal', 'one', 'in', 'bacterial', 'genomes', 'has', 'been', 'reported', 'keeping', 'in', 'mind', 'the', 'most', 'popular', 'theory', 'of', 'chloroplast', 'origin', 'we', 'checked', 'whether', 'a', 'similar', 'pattern', 'is', 'observed', 'in', 'chloroplast', 'genomes', 'surprisingly', 'eight', 'cluster', 'structure', 'has', 'been', 'found', 'for', 'chloroplasts', 'the', 'pattern', 'observed', 'for', 'chloroplasts', 'differs', 'rather', 'significantly', 'from', 'bacterial', 'one', 'and', 'from', 'that', 'latter', 'observed', 'for', 'cyanobacteria', 'the', 'structure', 'is', 'provided', 'by', 'clustering', 'of', 'the', 'fragments', 'of', 'equal', 'length', 'isolated', 'within', 'a', 'genome', 'so', 'that', 'each', 'fragment', 'is', 'converted', 'in', 'triplet', 'frequency', 'dictionary', 'with', 'nonoverlapping', 'triplets', 'with', 'no', 'gaps', 'in', 'frame', 'tiling', 'the', 'points', 'in', '63dimensional', 'space', 'were', 'clustered', 'due', 'to', 'elastic', 'map', 'technique', 'the', 'eight', 'cluster', 'found', 'in', 'chloroplasts', 'comprises', 'the', 'fragments', 'of', 'a', 'genome', 'bearing', 'trna', 'genes', 'and', 'exhibiting', 'excessively', 'high', 'mathsfgccontent', 'in', 'comparison', 'to', 'the', 'entire', 'genome']] | [-0.0837902938550407, 0.12179825877494833, -0.07931051068309763, 0.09040672447170234, -0.018308032000506364, -0.11102815288015538, 0.039935009495766956, 0.3828351758282494, -0.23179103890520142, -0.29303324504031075, 0.031232026584998324, -0.2848116075620055, -0.13174077382794133, 0.13244711542157112, -0.049124916851589526, 0.014964142728907366, 0.07930735566618818, 0.07228566549580406, 0.03861916273556374, -0.21219691298212165, 0.24235453162756232, 0.05183687405488281, 0.28611321865443, -0.06387323487282696, 0.07900040172799318, -0.05268667587035991, -0.03971172301098704, 0.041736570610966604, -0.09848256033761169, 0.12218705737204463, 0.2886082861158583, 0.16754255863596443, 0.2369484196692981, -0.3964099392708805, -0.19553647063224128, 0.11031420362112974, 0.2117327174430506, 0.1544576611507822, -0.06210430104078518, -0.22707060740363819, 0.14032158325340047, -0.11533739061819183, -0.09486836401090303, 0.01584623675034554, 0.09911719966955759, 0.008068441323660039, -0.17648016941923372, 0.114644483579064, 0.010495160968491325, 0.10693284057218719, -0.08277301183487806, -0.15806594854220749, -0.07549706902527423, 0.1462533433024806, 0.078846833958394, 0.059530648644323704, 0.1444116629625636, -0.07712888464124666, -0.11001010712029205, 0.39112627016449414, -0.009236309549736756, -0.15230126521308665, 0.20157148576410555, -0.17495112775100602, -0.18804073271307128, 0.1952734671533108, 0.07818631084670347, 0.0716025407977954, -0.1983014301603867, 0.06528036371132152, -0.05437985394857134, 0.25702008722281017, 0.17115409089666273, -0.007402324873988551, 0.2099781486792145, 0.2073261265573954, 0.016637300762037437, 0.15090714905893912, -0.09499561899100188, -0.11484361718650217, -0.1467235444906961, -0.10766883772901363, -0.14000612607018814, -0.022688968536547487, -0.046727333890265545, -0.17010255567729474, 0.3997166745192199, 0.04561692767569588, 0.24260650953036492, 0.03527013024625679, 0.21067899966405498, -0.00920362900942564, 0.19894662933700064, 0.014651990981979503, 0.18357462380598816, 0.0803038993427806, 0.06115006353812297, -0.21463916763249372, 0.15128899853745545, 0.023218559816639214] |
1,802.02963 | Increasing the Lensing Figure of Merit through Higher Order Convergence
Moments | The unprecedented quality, the increased dataset, and the wide area of
ongoing and near future weak lensing surveys allows to move beyond the standard
two points statistics thus making worthwhile to investigate higher order
probes. As an interesting step towards this direction, we expolore the use of
higher order moments (HOM) of the convergence field as a way to increase the
lensing Figure of Merit (FoM). To this end, we rely on simulated convergence to
first show that HOM can be measured and calibrated so that it is indeed
possible to predict them for a given cosmological model provided suitable
nuisance parameters are introduced and then marginalized over. We then forecast
the accuracy on cosmological parameters from the use of HOM alone and in
combination with standard shear power spectra tomography. It turns out that HOM
allow to break some common degeneracies thus significantly boosting the overall
FoM. We also qualitatively discuss possible systematics and how they can be
dealt with.
| astro-ph.CO | the unprecedented quality the increased dataset and the wide area of ongoing and near future weak lensing surveys allows to move beyond the standard two points statistics thus making worthwhile to investigate higher order probes as an interesting step towards this direction we expolore the use of higher order moments hom of the convergence field as a way to increase the lensing figure of merit fom to this end we rely on simulated convergence to first show that hom can be measured and calibrated so that it is indeed possible to predict them for a given cosmological model provided suitable nuisance parameters are introduced and then marginalized over we then forecast the accuracy on cosmological parameters from the use of hom alone and in combination with standard shear power spectra tomography it turns out that hom allow to break some common degeneracies thus significantly boosting the overall fom we also qualitatively discuss possible systematics and how they can be dealt with | [['the', 'unprecedented', 'quality', 'the', 'increased', 'dataset', 'and', 'the', 'wide', 'area', 'of', 'ongoing', 'and', 'near', 'future', 'weak', 'lensing', 'surveys', 'allows', 'to', 'move', 'beyond', 'the', 'standard', 'two', 'points', 'statistics', 'thus', 'making', 'worthwhile', 'to', 'investigate', 'higher', 'order', 'probes', 'as', 'an', 'interesting', 'step', 'towards', 'this', 'direction', 'we', 'expolore', 'the', 'use', 'of', 'higher', 'order', 'moments', 'hom', 'of', 'the', 'convergence', 'field', 'as', 'a', 'way', 'to', 'increase', 'the', 'lensing', 'figure', 'of', 'merit', 'fom', 'to', 'this', 'end', 'we', 'rely', 'on', 'simulated', 'convergence', 'to', 'first', 'show', 'that', 'hom', 'can', 'be', 'measured', 'and', 'calibrated', 'so', 'that', 'it', 'is', 'indeed', 'possible', 'to', 'predict', 'them', 'for', 'a', 'given', 'cosmological', 'model', 'provided', 'suitable', 'nuisance', 'parameters', 'are', 'introduced', 'and', 'then', 'marginalized', 'over', 'we', 'then', 'forecast', 'the', 'accuracy', 'on', 'cosmological', 'parameters', 'from', 'the', 'use', 'of', 'hom', 'alone', 'and', 'in', 'combination', 'with', 'standard', 'shear', 'power', 'spectra', 'tomography', 'it', 'turns', 'out', 'that', 'hom', 'allow', 'to', 'break', 'some', 'common', 'degeneracies', 'thus', 'significantly', 'boosting', 'the', 'overall', 'fom', 'we', 'also', 'qualitatively', 'discuss', 'possible', 'systematics', 'and', 'how', 'they', 'can', 'be', 'dealt', 'with']] | [-0.05607309967490437, 0.05084014000685784, -0.09674765779491282, 0.09428911063805571, -0.12880674235348125, -0.11615382969612256, 0.044894776635919696, 0.40173985408619045, -0.2952392881328706, -0.3345989511362859, 0.07750248824231676, -0.25566068290654587, -0.11660414415964623, 0.24101926907751475, -0.05124291934731673, 0.055986127172946, 0.06099661300322623, 0.012817210717184935, -0.07375955304014496, -0.30109180241124706, 0.27429653805156706, 0.1508664424327435, 0.26710749265621414, 0.013346540636848658, 0.08136923298006878, -0.038878810111782514, -0.05455733684357256, 0.07444348592616734, -0.16815777326023634, 0.09758589248667704, 0.23534224298782647, 0.12336621416907292, 0.2409309346025111, -0.3654000968730543, -0.19067597590619698, 0.13092363172909244, 0.1670710663747741, 0.10996545813977718, 0.009043405895499745, -0.2804757084792072, 0.08652031325727876, -0.18365511490264907, -0.11759826483903453, -0.1449611647927668, -0.029890488593810004, 0.017063434720330405, -0.25545551397081, 0.06565760946959927, 0.02034892111842055, 0.004656487004831433, 0.00019294097110105212, -0.0972921960761596, -0.02421193846676033, 0.13460056198236997, 0.05305325024128251, 0.03256463105572038, 0.12792768140207045, -0.13797072401248442, -0.07734417911851779, 0.40316172180464493, -0.08705414264040882, -0.16868640304310248, 0.15813509325962513, -0.17428876828635112, -0.1450135440347367, 0.07736861254961695, 0.16565662485181748, 0.04946803494822234, -0.10728258994058706, 0.008322562513785669, 0.05028982505900785, 0.19258155877469108, 0.08499144229317608, 0.025066121922282036, 0.2341423944104463, 0.1294907357012562, 0.10616362328873948, 0.11744172623511986, -0.1329578499609852, -0.020374462204199518, -0.29122657400439494, -0.14102028499473818, -0.12694389537791723, 0.07021578609710559, -0.10412475236535101, -0.09753436910086748, 0.4005584123544395, 0.2462214266124647, 0.20552444269051193, 0.0477240957057802, 0.3355552056877059, 0.10113938300492009, 0.07328994509880431, -0.006771661624952685, 0.3166050439913306, 0.09992145636060741, 0.05984492736970424, -0.179323821493017, 0.030472207264392637, -0.020638766943011432] |
1,802.02964 | Photophysics of indole upon x-ray absorption | A photofragmentation study of gas-phase indole (C$_8$H$_7$N) upon
single-photon ionization at a photon energy of 420 eV is presented. Indole was
primarily inner-shell ionized at its nitrogen and carbon $1s$ orbitals.
Electrons and ions were measured in coincidence by means of velocity map
imaging. The angular relationship between ionic fragments is discussed along
with the possibility to use the angle-resolved coincidence detection to perform
experiments on molecules that are strongly oriented in their recoil-frame. The
coincident measurement of electrons and ions revealed
fragmentation-pathway-dependent electron spectra, linking the structural
fragmentation dynamics to different electronic excitations. Evidence for
photoelectron-impact self-ionization was observed.
| physics.atm-clus physics.atom-ph physics.chem-ph | a photofragmentation study of gasphase indole c_8h_7n upon singlephoton ionization at a photon energy of 420 ev is presented indole was primarily innershell ionized at its nitrogen and carbon 1s orbitals electrons and ions were measured in coincidence by means of velocity map imaging the angular relationship between ionic fragments is discussed along with the possibility to use the angleresolved coincidence detection to perform experiments on molecules that are strongly oriented in their recoilframe the coincident measurement of electrons and ions revealed fragmentationpathwaydependent electron spectra linking the structural fragmentation dynamics to different electronic excitations evidence for photoelectronimpact selfionization was observed | [['a', 'photofragmentation', 'study', 'of', 'gasphase', 'indole', 'c_8h_7n', 'upon', 'singlephoton', 'ionization', 'at', 'a', 'photon', 'energy', 'of', '420', 'ev', 'is', 'presented', 'indole', 'was', 'primarily', 'innershell', 'ionized', 'at', 'its', 'nitrogen', 'and', 'carbon', '1s', 'orbitals', 'electrons', 'and', 'ions', 'were', 'measured', 'in', 'coincidence', 'by', 'means', 'of', 'velocity', 'map', 'imaging', 'the', 'angular', 'relationship', 'between', 'ionic', 'fragments', 'is', 'discussed', 'along', 'with', 'the', 'possibility', 'to', 'use', 'the', 'angleresolved', 'coincidence', 'detection', 'to', 'perform', 'experiments', 'on', 'molecules', 'that', 'are', 'strongly', 'oriented', 'in', 'their', 'recoilframe', 'the', 'coincident', 'measurement', 'of', 'electrons', 'and', 'ions', 'revealed', 'fragmentationpathwaydependent', 'electron', 'spectra', 'linking', 'the', 'structural', 'fragmentation', 'dynamics', 'to', 'different', 'electronic', 'excitations', 'evidence', 'for', 'photoelectronimpact', 'selfionization', 'was', 'observed']] | [-0.06790688128391291, 0.20566189555635597, -0.0023505856273307777, 0.07183083004444295, 0.05412009895856803, -0.11644925043704764, 0.0634159775236185, 0.47200284292921424, -0.20612333866453506, -0.3375488651993995, -0.05861962725612102, -0.3902190671360586, 0.028265056646584224, 0.13217619882683115, 0.076477024059083, -0.0007891904406278627, 0.05405079337166777, -0.09044943483604584, -0.05269292498269351, -0.1332992527046978, 0.2530856830611204, 0.15690753780897163, 0.25233741989601793, 0.14214654776151292, 0.09361224996488697, -0.018259766164798446, -0.025499000902830932, -0.04643602771102451, -0.13367891124691292, 0.11117147489373262, 0.2557819780437664, 0.011799093035127347, 0.17340155438675234, -0.43262685218360275, -0.18803101840118566, -0.011303033185564951, 0.1580906105664326, 0.09690000974417974, -0.09515648200006883, -0.2794754501519492, -0.013916976701390619, -0.10507235642338249, -0.12792615275733019, -0.02669321507952797, 0.029046595280912395, 0.07478591873708258, -0.19570998846514462, 0.11715570177329937, -0.04258277478220407, 0.07927983733437334, -0.10725470987502679, -0.08513601809196795, -0.08624294762072775, 0.023009706048469525, 0.014202165887885107, 0.028630159715248737, 0.2360387189934651, -0.06042262338936174, -0.10530282297016431, 0.3679297645576298, -0.05157317473397901, -0.07038452868194629, 0.21668879711069167, -0.19892130423977505, -0.14952768831669042, 0.265503443525328, 0.06925827156434632, 0.1095316865418378, -0.13885097781409664, 0.01056608545150084, -0.020050658533970516, 0.2148184636995817, 0.1330405294696296, 0.07444484819522283, 0.24105235546691497, 0.12922008891837322, -0.018825336407947663, 0.10293862838564867, -0.1880802477511073, -0.028302126612591866, -0.17176826268799536, -0.18339465367413746, -0.18173591306064432, 0.05678114968274409, 0.012227991418058082, -0.08437133668727863, 0.36881325165813905, 0.053418872948289696, 0.16647814598642677, -0.09302425907662837, 0.2869649913664034, 0.07778049385524355, 0.024877068545417085, -0.017516602951218374, 0.2717444372343986, 0.19878695669952626, 0.0950913870134779, -0.3210233711773374, 0.10601396045725171, 0.024611894385695148] |
1,802.02965 | Search for heavy neutral leptons in events with three charged leptons in
proton-proton collisions at $\sqrt{s} =$ 13 TeV | A search for a heavy neutral lepton N of Majorana nature decaying into a W
boson and a charged lepton is performed using the CMS detector at the LHC. The
targeted signature consists of three prompt charged leptons in any flavor
combination of electrons and muons. The data were collected in proton-proton
collisions at a center-of-mass energy of 13 TeV, with an integrated luminosity
of 35.9 fb$^{-1}$. The search is performed in the N mass range between 1 GeV
and 1.2 TeV. The data are found to be consistent with the expected standard
model background. Upper limits are set on the values of
$|\mathrm{V}_\mathrm{eN}|^2$ and $|\mathrm{V}_{\mu\mathrm{N}}|^2$, where
$V_{\ell\mathrm{N}}$ is the matrix element describing the mixing of N with the
standard model neutrino of flavor $\ell$. These are the first direct limits for
N masses above 500 GeV and the first limits obtained at a hadron collider for N
masses below 40 GeV.
| hep-ex | a search for a heavy neutral lepton n of majorana nature decaying into a w boson and a charged lepton is performed using the cms detector at the lhc the targeted signature consists of three prompt charged leptons in any flavor combination of electrons and muons the data were collected in protonproton collisions at a centerofmass energy of 13 tev with an integrated luminosity of 359 fb1 the search is performed in the n mass range between 1 gev and 12 tev the data are found to be consistent with the expected standard model background upper limits are set on the values of mathrmv_mathrmen2 and mathrmv_mumathrmn2 where v_ellmathrmn is the matrix element describing the mixing of n with the standard model neutrino of flavor ell these are the first direct limits for n masses above 500 gev and the first limits obtained at a hadron collider for n masses below 40 gev | [['a', 'search', 'for', 'a', 'heavy', 'neutral', 'lepton', 'n', 'of', 'majorana', 'nature', 'decaying', 'into', 'a', 'w', 'boson', 'and', 'a', 'charged', 'lepton', 'is', 'performed', 'using', 'the', 'cms', 'detector', 'at', 'the', 'lhc', 'the', 'targeted', 'signature', 'consists', 'of', 'three', 'prompt', 'charged', 'leptons', 'in', 'any', 'flavor', 'combination', 'of', 'electrons', 'and', 'muons', 'the', 'data', 'were', 'collected', 'in', 'protonproton', 'collisions', 'at', 'a', 'centerofmass', 'energy', 'of', '13', 'tev', 'with', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'the', 'search', 'is', 'performed', 'in', 'the', 'n', 'mass', 'range', 'between', '1', 'gev', 'and', '12', 'tev', 'the', 'data', 'are', 'found', 'to', 'be', 'consistent', 'with', 'the', 'expected', 'standard', 'model', 'background', 'upper', 'limits', 'are', 'set', 'on', 'the', 'values', 'of', 'mathrmv_mathrmen2', 'and', 'mathrmv_mumathrmn2', 'where', 'v_ellmathrmn', 'is', 'the', 'matrix', 'element', 'describing', 'the', 'mixing', 'of', 'n', 'with', 'the', 'standard', 'model', 'neutrino', 'of', 'flavor', 'ell', 'these', 'are', 'the', 'first', 'direct', 'limits', 'for', 'n', 'masses', 'above', '500', 'gev', 'and', 'the', 'first', 'limits', 'obtained', 'at', 'a', 'hadron', 'collider', 'for', 'n', 'masses', 'below', '40', 'gev']] | [-0.056655449114955535, 0.27543025788620207, -0.00798868168232925, 0.13500678314180456, 0.004230044460261628, -0.13333707872618789, 0.020035560769435242, 0.3189577989705257, -0.1717891873254272, -0.39076648761312033, 0.013340134352551861, -0.38604680573155215, 0.14689520368783815, 0.17181097763753028, 0.14309170071485658, 0.08501989144025973, 0.11223512620433865, 0.021667223945635077, -0.06345904829768126, -0.22104027035924287, 0.2620336635182018, 0.07677601342520758, 0.19681612209685698, 0.07589544601669698, 0.09212673104668173, -0.013788105137083654, -0.04987251736073686, -0.10083946330322816, -0.07112478039808721, 0.06895237336667323, 0.2172140036162689, 0.0753676352378656, 0.11175632450554594, -0.34305825271962476, -0.06700423194233003, 0.18591397133462081, 0.13796020021752747, 0.029937798449544598, -0.08177202894749283, -0.33479504597267046, 0.16515439078711824, -0.20238461489195392, -0.1194021087358612, 0.05563049674840431, 0.018179266657305244, -0.06690096332622855, -0.35708516359879267, 0.08128975157863491, -0.06081590680217983, 0.05480566119498592, -0.01958787972076277, -0.22597736376493968, -0.06630789266817971, -0.022577768016681574, 0.09620459989922733, 0.02070308880389812, 0.1541592421825825, -0.14078821122236926, -0.1962068718201762, 0.36547739164014625, -0.049955717558291236, -0.13025544560045604, 0.19582600260290922, -0.18631314663153967, -0.1154046554068391, 0.19072295894108762, 0.26469250954062545, 0.0645282487103703, -0.21735189932604765, 0.15842767340567077, -0.06638230877497152, 0.20264539516049643, 0.058694992923871585, 0.041241090716606615, 0.24239071202151877, 0.26327759310003096, 0.03371787717215867, 0.028212229000098205, -0.16105002363449925, 0.004424632023769937, -0.45253587532913525, -0.11453992680290201, -0.12500390838581643, 0.07704525345376999, -0.07923933970611058, -0.026886396537434885, 0.37860728399640564, 0.08972329376073986, 0.32236509054474183, 0.02534609383765933, 0.25701324722648367, 0.09629195339709361, 0.044932268493716614, 0.08935724821552281, 0.3086950332801414, 0.12775026571986908, 0.16022733808026318, -0.1941715348855711, -0.04885582316466826, 0.06430374912842608] |
1,802.02966 | Uniqueness of $\mathcal{N}=2$ and $3$ pure supergravities in 4D | After proving the impossibility of consistent non-minimal coupling of a real
Rarita-Schwinger gauge field to electromagnetism, we re-derive the necessity of
introducing the graviton in order to couple a complex Rarita-Schwinger gauge
field to electromagnetism, with or without a cosmological term, thereby
obtaining ${\cal N}=2$ pure supergravity as the only possibility. These results
are obtained with the BRST-BV deformation method around the flat and (A)dS
backgrounds in 4 dimensions. The same method applied to $n_{v}$ vectors, ${\cal
N}$ real spin-3/2 gauge fields and at most one real spinor field also requires
gravity and yields ${\cal N}=3$ pure supergravity as well as ${\cal N}=1$ pure
supergravity coupled to a vector supermultiplet, with or without cosmological
terms. Independently from the matter content, we finally derive strong
necessary quadratic constraints on the possible gaugings for an arbitrary
number of spin-1 and spin-3/2 gauge fields, that are relevant for larger
supergravities.
| hep-th | after proving the impossibility of consistent nonminimal coupling of a real raritaschwinger gauge field to electromagnetism we rederive the necessity of introducing the graviton in order to couple a complex raritaschwinger gauge field to electromagnetism with or without a cosmological term thereby obtaining cal n2 pure supergravity as the only possibility these results are obtained with the brstbv deformation method around the flat and ads backgrounds in 4 dimensions the same method applied to n_v vectors cal n real spin32 gauge fields and at most one real spinor field also requires gravity and yields cal n3 pure supergravity as well as cal n1 pure supergravity coupled to a vector supermultiplet with or without cosmological terms independently from the matter content we finally derive strong necessary quadratic constraints on the possible gaugings for an arbitrary number of spin1 and spin32 gauge fields that are relevant for larger supergravities | [['after', 'proving', 'the', 'impossibility', 'of', 'consistent', 'nonminimal', 'coupling', 'of', 'a', 'real', 'raritaschwinger', 'gauge', 'field', 'to', 'electromagnetism', 'we', 'rederive', 'the', 'necessity', 'of', 'introducing', 'the', 'graviton', 'in', 'order', 'to', 'couple', 'a', 'complex', 'raritaschwinger', 'gauge', 'field', 'to', 'electromagnetism', 'with', 'or', 'without', 'a', 'cosmological', 'term', 'thereby', 'obtaining', 'cal', 'n2', 'pure', 'supergravity', 'as', 'the', 'only', 'possibility', 'these', 'results', 'are', 'obtained', 'with', 'the', 'brstbv', 'deformation', 'method', 'around', 'the', 'flat', 'and', 'ads', 'backgrounds', 'in', '4', 'dimensions', 'the', 'same', 'method', 'applied', 'to', 'n_v', 'vectors', 'cal', 'n', 'real', 'spin32', 'gauge', 'fields', 'and', 'at', 'most', 'one', 'real', 'spinor', 'field', 'also', 'requires', 'gravity', 'and', 'yields', 'cal', 'n3', 'pure', 'supergravity', 'as', 'well', 'as', 'cal', 'n1', 'pure', 'supergravity', 'coupled', 'to', 'a', 'vector', 'supermultiplet', 'with', 'or', 'without', 'cosmological', 'terms', 'independently', 'from', 'the', 'matter', 'content', 'we', 'finally', 'derive', 'strong', 'necessary', 'quadratic', 'constraints', 'on', 'the', 'possible', 'gaugings', 'for', 'an', 'arbitrary', 'number', 'of', 'spin1', 'and', 'spin32', 'gauge', 'fields', 'that', 'are', 'relevant', 'for', 'larger', 'supergravities']] | [-0.12135894519916805, 0.20948901624020053, 0.027304794962460896, 0.07263561920262873, -0.13694853855765798, -0.18840616264540486, -0.045989949485844596, 0.3124656989429222, -0.11521707556517731, -0.33662775989707405, 0.06062889468957524, -0.2578791256892641, -0.13034249930072347, 0.0956351359431841, -0.004683818048829226, 0.038720468227865595, -0.04930411015960331, 0.10685148653986097, -0.09101011358450173, -0.3234993993339515, 0.34084858162467985, -0.023282493331602643, 0.20749099109698796, -0.008808641016584675, 0.12223136572636106, 0.029576912854931185, 0.02077337937606942, -0.004428187594273869, -0.07066554616572261, 0.09042646444472326, 0.20620944560188673, 0.09570520898156172, 0.11159798913147478, -0.4502734493742995, -0.19923461810844081, 0.12344777964841143, 0.1674457900083567, 0.18201488894758885, -0.015117063257545487, -0.3057058930672629, 0.0550394432633469, -0.1478755411178786, -0.17734416699049627, -0.13146646869159778, 0.002185476296834749, -0.1459110767016707, -0.3104797217394637, 0.0861124531823277, 0.005314909437272165, 0.04581881344293048, -0.08180082332165468, -0.11572456744271425, -0.09458746974115723, 0.03542876755501948, 0.13900439176854176, 0.07485240763591818, 0.1172253088645485, -0.2057083178165869, -0.14976223176155162, 0.40036183199053316, -0.1262510650134709, -0.2574930018080132, 0.15894118385376776, -0.12703672098946206, -0.1506845633195219, 0.09434214058699605, 0.10745782787170337, 0.1705909220400412, -0.11346064889360041, 0.23111422483961344, -0.001427506655771412, 0.12680560465724694, 0.10390579201230386, 0.05649165951703884, 0.24561290175584302, 0.04482601474666474, 0.049621597566359935, 0.12690634528320713, 0.03405512778284852, -0.08958122353774312, -0.44526530399310343, -0.16082978706021292, -0.1091151680388697, 0.12359631944964102, -0.1859897967696437, -0.12845254763580707, 0.3418509232824301, 0.11721949520058372, 0.12823019937618452, 0.0817898366359525, 0.20389241549078704, 0.0817695997099449, 0.093221771812738, 0.045463845138335096, 0.2623363386358128, 0.2052457160031309, 0.08543321977648251, -0.23505152604498325, -0.18253746320854644, 0.10071375272015021] |
1,802.02967 | The chemical connection between 67P/C-G and IRAS 16293-2422 | The chemical evolution of a star- and planet-forming system begins in the
prestellar phase and proceeds across the subsequent evolutionary phases. The
chemical trail from cores to protoplanetary disks to planetary embryos can be
studied by comparing distant young protostars and comets in our Solar System.
One particularly chemically rich system that is thought to be analogous to our
own is the low-mass IRAS 16293-2422. ALMA-PILS observations have made the study
of chemistry on the disk scales (< 100 AU) of this system possible. Under the
assumption that comets are pristine tracers of the outer parts of the innate
protosolar disk, it is possible to compare the composition of our infant Solar
System to that of IRAS 16293-2422. The Rosetta mission has yielded a wealth of
unique in situ measurements on comet 67P/C-G, making it the best probe to date.
Herein, the initial comparisons in terms of the chemical composition and
isotopic ratios are summarized. Much work is still to be carried out in the
future as the analysis of both of these data sets is still ongoing.
| astro-ph.SR astro-ph.EP astro-ph.GA | the chemical evolution of a star and planetforming system begins in the prestellar phase and proceeds across the subsequent evolutionary phases the chemical trail from cores to protoplanetary disks to planetary embryos can be studied by comparing distant young protostars and comets in our solar system one particularly chemically rich system that is thought to be analogous to our own is the lowmass iras 162932422 almapils observations have made the study of chemistry on the disk scales 100 au of this system possible under the assumption that comets are pristine tracers of the outer parts of the innate protosolar disk it is possible to compare the composition of our infant solar system to that of iras 162932422 the rosetta mission has yielded a wealth of unique in situ measurements on comet 67pcg making it the best probe to date herein the initial comparisons in terms of the chemical composition and isotopic ratios are summarized much work is still to be carried out in the future as the analysis of both of these data sets is still ongoing | [['the', 'chemical', 'evolution', 'of', 'a', 'star', 'and', 'planetforming', 'system', 'begins', 'in', 'the', 'prestellar', 'phase', 'and', 'proceeds', 'across', 'the', 'subsequent', 'evolutionary', 'phases', 'the', 'chemical', 'trail', 'from', 'cores', 'to', 'protoplanetary', 'disks', 'to', 'planetary', 'embryos', 'can', 'be', 'studied', 'by', 'comparing', 'distant', 'young', 'protostars', 'and', 'comets', 'in', 'our', 'solar', 'system', 'one', 'particularly', 'chemically', 'rich', 'system', 'that', 'is', 'thought', 'to', 'be', 'analogous', 'to', 'our', 'own', 'is', 'the', 'lowmass', 'iras', '162932422', 'almapils', 'observations', 'have', 'made', 'the', 'study', 'of', 'chemistry', 'on', 'the', 'disk', 'scales', '100', 'au', 'of', 'this', 'system', 'possible', 'under', 'the', 'assumption', 'that', 'comets', 'are', 'pristine', 'tracers', 'of', 'the', 'outer', 'parts', 'of', 'the', 'innate', 'protosolar', 'disk', 'it', 'is', 'possible', 'to', 'compare', 'the', 'composition', 'of', 'our', 'infant', 'solar', 'system', 'to', 'that', 'of', 'iras', '162932422', 'the', 'rosetta', 'mission', 'has', 'yielded', 'a', 'wealth', 'of', 'unique', 'in', 'situ', 'measurements', 'on', 'comet', '67pcg', 'making', 'it', 'the', 'best', 'probe', 'to', 'date', 'herein', 'the', 'initial', 'comparisons', 'in', 'terms', 'of', 'the', 'chemical', 'composition', 'and', 'isotopic', 'ratios', 'are', 'summarized', 'much', 'work', 'is', 'still', 'to', 'be', 'carried', 'out', 'in', 'the', 'future', 'as', 'the', 'analysis', 'of', 'both', 'of', 'these', 'data', 'sets', 'is', 'still', 'ongoing']] | [-0.07118269088360565, 0.11952711939838165, -0.09992470435231966, 0.033256584664658556, -0.05070783870806653, -0.03195420903185467, 0.03591032137691483, 0.3802609699143266, -0.22894194304932503, -0.32551565392747184, 0.09441115160701553, -0.26219322277624585, -0.07433504972273526, 0.15984031750122085, -0.05014189344505708, 0.022230018268931995, 0.11262317013494215, -0.07945220710164656, -0.006206477729640689, -0.2711403436260298, 0.30153865753725934, 0.12932098634668032, 0.08910041350596161, -0.015694374423963545, 0.019146304308378603, -0.18370679003287063, -0.03406897156806239, -0.05416285848795352, -0.15687202291201174, 0.06702339350026291, 0.2435127384418262, 0.1581280281203693, 0.19010557903675362, -0.4248504973630505, -0.23436497378861532, 0.04263104859538461, 0.16041915998159145, 0.04207622786899182, -0.03825721223388841, -0.27471567193358415, 0.09005764413549597, -0.16342312891687139, -0.16844225718126504, 0.011769636158574443, 0.07083596293027354, 0.008325734558060172, -0.23059167885697784, 0.04922930022902702, 0.02811427463100038, 0.09453001482258762, -0.1520335600203411, -0.15763091323407769, -0.09236492709103251, 0.15427249987988034, 0.03880938162513881, 0.07924725257312688, 0.228322647513282, -0.09976539148456967, -0.02023325600814794, 0.4270347089411437, -0.046466279175629926, -0.052055294976360696, 0.30618281206989195, -0.2214073226007465, -0.20133165857193738, 0.13560268075302287, 0.12831381955633828, 0.14833116983804343, -0.19629080028574786, 0.009080773941770365, -0.051225109199136074, 0.1919392489269905, 0.04745634400751442, 0.046079999203687876, 0.3445007761269649, 0.19831501199223567, 0.02209913943806896, 0.14355710800803287, -0.140632080842889, -0.12000090041494166, -0.18170233233567243, -0.19290945467417425, -0.16286501957934393, 0.06277256895621329, -0.08129127398206037, -0.10008866362146694, 0.3213333285285361, 0.15020327483216533, 0.19346690427681262, -0.03181309349168838, 0.3134996123103933, 0.012771185919436075, 0.09630973177528093, 0.05380492744734511, 0.30957584593984805, 0.13257816949176646, 0.14025886634639886, -0.24695723321366875, 0.1716405117200669, -0.023637737228207036] |
1,802.02968 | Worldline quantization of field theory, effective actions and $L_\infty$
structure | We formulate the worldline quantization of a massive fermion model coupled to
external higher spin sources. We use the relations obtained in this way to show
that its regularized effective action is endowed with an $L_\infty$ symmetry.
The same result holds also for a massive scalar model.
| hep-th | we formulate the worldline quantization of a massive fermion model coupled to external higher spin sources we use the relations obtained in this way to show that its regularized effective action is endowed with an l_infty symmetry the same result holds also for a massive scalar model | [['we', 'formulate', 'the', 'worldline', 'quantization', 'of', 'a', 'massive', 'fermion', 'model', 'coupled', 'to', 'external', 'higher', 'spin', 'sources', 'we', 'use', 'the', 'relations', 'obtained', 'in', 'this', 'way', 'to', 'show', 'that', 'its', 'regularized', 'effective', 'action', 'is', 'endowed', 'with', 'an', 'l_infty', 'symmetry', 'the', 'same', 'result', 'holds', 'also', 'for', 'a', 'massive', 'scalar', 'model']] | [-0.1674390888990874, 0.14123246512912024, -0.06499601646940759, 0.1095555533080342, -0.11749279142377224, -0.1466040530519441, 0.0002786320574740146, 0.3740818118280236, -0.22941979718335131, -0.27942301430045924, 0.01742932237833342, -0.2628000043332577, -0.1980455959255391, 0.11266292081749503, -0.05052224824086149, -0.012950654162658734, 0.034524172633648556, 0.12754732017662931, -0.12529744619523434, -0.2519246675470408, 0.3300040819622735, 0.040920254665407094, 0.27104283102906923, 0.002231604251217969, 0.16522944213307283, 0.03803822730093243, 0.031423077502466264, 0.002126670462336946, -0.08626750427217128, 0.14633589894436497, 0.15840077898564173, 0.060819674877727284, 0.1929280337421818, -0.405289939307469, -0.2315844420264376, 0.08412089281309237, 0.15888996951361287, 0.14742386704707083, -0.07736733143633985, -0.2686343891744284, 0.12390120853570864, -0.2311337927871562, -0.21745581215524928, -0.0677471843231073, -0.05515212161426849, -0.11430948132530172, -0.3220257165326558, 0.08652686560650337, 0.04542182503327569, 0.010690519923066839, -0.1436277788573321, -0.0432363363240469, -0.027885706064865946, 0.09151159135743658, 0.07812032324479933, 0.08247948427030698, 0.08126829386480708, -0.1571471217544155, -0.11947496164282982, 0.3943463472768347, -0.13268100821036607, -0.2930180842968378, 0.17849336189039527, -0.11293553261760067, -0.17493600562769682, 0.018275257987663784, 0.13225077833742538, 0.157975811610355, -0.16113399886625243, 0.12580541770984519, -0.0593429770855669, 0.11953942293420117, 0.011202448998835492, 0.06905050906649929, 0.21945382069122601, 0.11908913547410926, 0.07615447577406118, 0.1769169290807653, -0.0292291975322556, -0.11457663571382774, -0.32124503567180734, -0.15458564462259095, -0.13560952058933834, 0.09908359095533477, -0.12992058364436665, -0.12268405891038438, 0.3212001676710838, 0.18170976644738557, 0.17343551363360057, 0.11302150369800151, 0.27875435602494536, 0.18532548941909632, 0.11667123951136749, 0.07201143791106471, 0.20834825101724647, 0.16421389060610153, 0.042493715208578614, -0.23776198948357016, -0.1173696232900182, 0.08626411960242276] |
1,802.02969 | Negative longitudinal magnetoresistance in the density wave phase of
Y$_2$Ir$_2$O$_7$ | The ground state of nanowires of single crystalline Pyrochlore
Y$_2$Ir$_2$O$_7$ is a density wave. Application of a {\it transverse} magnetic
field increases the threshold electric field for the collective de-pinning of
the density wave state at low temperature, leading to colossal
magnetoresistance for voltages around the de-pinning threshold. This is in
striking contrast to the case where even a vanishingly small {\it longitudinal}
magnetic field sharply reduces the de-pinning threshold voltage resulting in
{\it negative} magnetoresistance. Ruling out several other possibilities we
argue that this phenomenon is likely to be a consequence of the chiral anomaly
in the gapped out Weyl semimetal phase in Y$_2$Ir$_2$O$_7$.
| cond-mat.mes-hall cond-mat.str-el | the ground state of nanowires of single crystalline pyrochlore y_2ir_2o_7 is a density wave application of a it transverse magnetic field increases the threshold electric field for the collective depinning of the density wave state at low temperature leading to colossal magnetoresistance for voltages around the depinning threshold this is in striking contrast to the case where even a vanishingly small it longitudinal magnetic field sharply reduces the depinning threshold voltage resulting in it negative magnetoresistance ruling out several other possibilities we argue that this phenomenon is likely to be a consequence of the chiral anomaly in the gapped out weyl semimetal phase in y_2ir_2o_7 | [['the', 'ground', 'state', 'of', 'nanowires', 'of', 'single', 'crystalline', 'pyrochlore', 'y_2ir_2o_7', 'is', 'a', 'density', 'wave', 'application', 'of', 'a', 'it', 'transverse', 'magnetic', 'field', 'increases', 'the', 'threshold', 'electric', 'field', 'for', 'the', 'collective', 'depinning', 'of', 'the', 'density', 'wave', 'state', 'at', 'low', 'temperature', 'leading', 'to', 'colossal', 'magnetoresistance', 'for', 'voltages', 'around', 'the', 'depinning', 'threshold', 'this', 'is', 'in', 'striking', 'contrast', 'to', 'the', 'case', 'where', 'even', 'a', 'vanishingly', 'small', 'it', 'longitudinal', 'magnetic', 'field', 'sharply', 'reduces', 'the', 'depinning', 'threshold', 'voltage', 'resulting', 'in', 'it', 'negative', 'magnetoresistance', 'ruling', 'out', 'several', 'other', 'possibilities', 'we', 'argue', 'that', 'this', 'phenomenon', 'is', 'likely', 'to', 'be', 'a', 'consequence', 'of', 'the', 'chiral', 'anomaly', 'in', 'the', 'gapped', 'out', 'weyl', 'semimetal', 'phase', 'in', 'y_2ir_2o_7']] | [-0.2356604796080362, 0.24216369588282846, -0.0399519268462124, 0.02113470100864236, -0.08427305989455254, -0.13437543232880889, 0.09240226139358822, 0.3457734029740095, -0.23828904385390204, -0.26967517623589154, 0.007732636987098626, -0.2940060597267889, -0.15313353733647436, 0.17296440075373365, 0.05091760227722781, 0.028453271552210762, -0.057967785326763985, 0.06683032350792062, -0.07126474706899552, -0.18892784970812498, 0.28364658550847144, 0.0056102710614054346, 0.36150002351828986, 0.09985533025381821, 0.036231077655351586, -0.035573997268719335, 0.16707665032396715, 0.1010551819821731, -0.11554319435859466, -0.058365480231475975, 0.27293203606137206, -0.12491443146552358, 0.21272698624857833, -0.3867303897050165, -0.19891802707598322, 0.054129567054942956, 0.1254388526414654, 0.20501051532725492, -0.054261617096407075, -0.28526780381577, 0.09089075982393253, -0.15773977742175616, -0.16455709003799018, -0.08415874129249937, 0.022446957699555372, -0.041824682163340704, -0.24452868514649925, 0.1538226945381168, 0.05483005631138526, 0.08179784010918367, -0.07243453670913974, -0.10966712535314617, -0.05345607325878172, 0.009565391125700746, 0.10936164214009685, 0.1125361383715201, 0.1961371066359182, -0.19710553629944721, -0.09211785674449943, 0.31820404447969936, -0.04551780558235589, -0.0906834162099542, 0.13149121224747173, -0.23162830666239773, -0.0807080370520929, 0.21958081257485207, 0.11579030216255758, 0.08853959346666844, -0.08926612433666985, 0.060969499013264705, -0.0052513504885913186, 0.13418793886168195, 0.06984278138593904, 0.0054820340570239795, 0.29989308266279596, 0.1922232907021507, 0.09258563359755845, 0.1668149760209157, -0.15272043982875488, -0.05112525543109292, -0.2867375743952358, -0.15985512916397834, -0.2239521755836904, 0.10603908118542417, -0.06978305292847965, -0.2395316432895405, 0.41171713093561785, 0.18312216767732198, 0.1942188370085898, -0.0521929548521127, 0.2445951911842539, 0.1478433596236365, 0.08912809261431297, 0.03699506526865575, 0.2756179351270908, 0.18886279878428294, 0.18135466909124737, -0.290745530876198, 0.05384547258505509, -0.035785376001149415] |
1,802.0297 | A New Kalman Filter Model for Nonlinear Systems Based on Ellipsoidal
Bounding | In this paper, a new filter model called set-membership Kalman filter for
nonlinear state estimation problems was designed, where both random and unknown
but bounded uncertainties were considered simultaneously in the discrete-time
system. The main loop of this algorithm includes one prediction step and one
correction step with measurement information, and the key part in each loop is
to solve an optimization problem. The solution of the optimization problem
produces the optimal estimation for the state, which is bounded by ellipsoids.
The new filter was applied on a highly nonlinear benchmark example and a
two-dimensional simulated trajectory estimation problem, in which the new
filter behaved better compared with extended Kalman filter results. Sensitivity
of the algorithm was discussed in the end.
| math.OC | in this paper a new filter model called setmembership kalman filter for nonlinear state estimation problems was designed where both random and unknown but bounded uncertainties were considered simultaneously in the discretetime system the main loop of this algorithm includes one prediction step and one correction step with measurement information and the key part in each loop is to solve an optimization problem the solution of the optimization problem produces the optimal estimation for the state which is bounded by ellipsoids the new filter was applied on a highly nonlinear benchmark example and a twodimensional simulated trajectory estimation problem in which the new filter behaved better compared with extended kalman filter results sensitivity of the algorithm was discussed in the end | [['in', 'this', 'paper', 'a', 'new', 'filter', 'model', 'called', 'setmembership', 'kalman', 'filter', 'for', 'nonlinear', 'state', 'estimation', 'problems', 'was', 'designed', 'where', 'both', 'random', 'and', 'unknown', 'but', 'bounded', 'uncertainties', 'were', 'considered', 'simultaneously', 'in', 'the', 'discretetime', 'system', 'the', 'main', 'loop', 'of', 'this', 'algorithm', 'includes', 'one', 'prediction', 'step', 'and', 'one', 'correction', 'step', 'with', 'measurement', 'information', 'and', 'the', 'key', 'part', 'in', 'each', 'loop', 'is', 'to', 'solve', 'an', 'optimization', 'problem', 'the', 'solution', 'of', 'the', 'optimization', 'problem', 'produces', 'the', 'optimal', 'estimation', 'for', 'the', 'state', 'which', 'is', 'bounded', 'by', 'ellipsoids', 'the', 'new', 'filter', 'was', 'applied', 'on', 'a', 'highly', 'nonlinear', 'benchmark', 'example', 'and', 'a', 'twodimensional', 'simulated', 'trajectory', 'estimation', 'problem', 'in', 'which', 'the', 'new', 'filter', 'behaved', 'better', 'compared', 'with', 'extended', 'kalman', 'filter', 'results', 'sensitivity', 'of', 'the', 'algorithm', 'was', 'discussed', 'in', 'the', 'end']] | [-0.04839549971790599, 0.010542851635221246, -0.08715241006383102, 0.04271773011579389, -0.05917550441578092, -0.21521930754846655, -0.0290164009134924, 0.38872361420230434, -0.28933892805467953, -0.3102508988385358, 0.18231545662611323, -0.2306059477388982, -0.18187650599062813, 0.18453423447776124, -0.11645563571013448, 0.1601147532909493, 0.08324412926107891, 0.03940041173318755, -0.044988724304948095, -0.24575611384400775, 0.25794243072121104, 0.08695384255448772, 0.2610597396384894, -0.04117815309273433, 0.17098660581775996, 0.03912499579524021, -0.04399843604211534, 0.017487247235888292, -0.08836769652052605, 0.09900666437254187, 0.24690056181212594, 0.10291246768887624, 0.34458311286962723, -0.338161063988593, -0.2020773375560799, 0.0875218418149724, 0.16349725753900188, 0.11824791976404646, -0.044416201298032726, -0.32039920716307874, 0.04158040326789083, -0.131352045003725, -0.07513620123682806, -0.0019725956068920693, -0.06417336653579366, -0.018651260064014286, -0.33142320901417166, 0.0596829106557868, 0.04862962913322301, -0.020194184964461143, -0.0874034737579309, -0.14424783634772323, 0.0510288985092039, 0.11135492472686181, -0.023215978412142346, 0.037696733430974676, 0.11174680921056669, -0.11812721019464521, -0.14270970533979088, 0.368927182013954, -0.0578765077554921, -0.25875591271179765, 0.1024237749982656, -0.06256507110805058, -0.1294733010471052, 0.15574304458554372, 0.21770196535031905, 0.13457237838282565, -0.18369293347201196, 0.057158858482610465, -0.03388085454117414, 0.18632961860434574, -0.011484134553600688, -0.030628007028467397, 0.11562694662658513, 0.21762900127575172, 0.1519115044901817, 0.19171974266405903, -0.11511736117834456, -0.1445040265665859, -0.28018291771781345, -0.12805295355660332, -0.17362920585865818, -0.08136283037298905, -0.07564224054111353, -0.17904951514229794, 0.4248540592957134, 0.19788106579395118, 0.17505379023861664, 0.04401775131055947, 0.3336954507861317, 0.1615801374312521, 0.026456560999682282, 0.08046225979847234, 0.22608839441090822, 0.12580533479802186, 0.10265724368254878, -0.21494342164859975, 0.0700315888663215, 0.08238005786744516] |
1,802.02971 | Comment Generation for Source Code: State of the Art, Challenges and
Opportunities | Researches have shown that most effort of today's software development is
maintenance and evolution. Developers often use integrated development
environments, debuggers, and tools for code search, testing, and program
understanding to reduce the tedious tasks. One way to make software development
more efficient is to make the program more readable. There have been many
approaches proposed and developed for this purpose. Among these approaches,
comment generation for source code is gaining more and more attention and has
become a popular research area. In this paper, the state of art in comment
generation research area are summarized and the challenges and future
opportunities are discussed.
| cs.SE | researches have shown that most effort of todays software development is maintenance and evolution developers often use integrated development environments debuggers and tools for code search testing and program understanding to reduce the tedious tasks one way to make software development more efficient is to make the program more readable there have been many approaches proposed and developed for this purpose among these approaches comment generation for source code is gaining more and more attention and has become a popular research area in this paper the state of art in comment generation research area are summarized and the challenges and future opportunities are discussed | [['researches', 'have', 'shown', 'that', 'most', 'effort', 'of', 'todays', 'software', 'development', 'is', 'maintenance', 'and', 'evolution', 'developers', 'often', 'use', 'integrated', 'development', 'environments', 'debuggers', 'and', 'tools', 'for', 'code', 'search', 'testing', 'and', 'program', 'understanding', 'to', 'reduce', 'the', 'tedious', 'tasks', 'one', 'way', 'to', 'make', 'software', 'development', 'more', 'efficient', 'is', 'to', 'make', 'the', 'program', 'more', 'readable', 'there', 'have', 'been', 'many', 'approaches', 'proposed', 'and', 'developed', 'for', 'this', 'purpose', 'among', 'these', 'approaches', 'comment', 'generation', 'for', 'source', 'code', 'is', 'gaining', 'more', 'and', 'more', 'attention', 'and', 'has', 'become', 'a', 'popular', 'research', 'area', 'in', 'this', 'paper', 'the', 'state', 'of', 'art', 'in', 'comment', 'generation', 'research', 'area', 'are', 'summarized', 'and', 'the', 'challenges', 'and', 'future', 'opportunities', 'are', 'discussed']] | [-0.06776083461702981, 0.02877405166733437, -0.0542665818401684, 0.09084460139386535, -0.15461231510226542, -0.19917064850093225, -0.03811569763414669, 0.44259832648990244, -0.18555641105026902, -0.36388847259177753, 0.17600950579687308, -0.2660077886718612, -0.15650991402351513, 0.3009103440943783, -0.07462723347215125, 0.1043697015635329, 0.13442676001264212, -0.0417720610768391, -0.03176869458492057, -0.29847487970255315, 0.25544416600426373, 0.11600114603061229, 0.34990599036861497, 0.08796713981652059, -0.012187999126931222, -0.02703657842133767, -0.14314601451265985, -0.04558770014241768, -0.08709722608021436, 0.2216887153022421, 0.39624118025844485, 0.27098303763509296, 0.3871726027618234, -0.45443118132579213, -0.21957039904709047, 0.0740717629937885, 0.14853297448896158, 0.11529053755265732, -0.1227788386240718, -0.2418087775227972, 0.08448190968472492, -0.21767016826197505, -0.10012466011819644, -0.14373274124206475, 0.08934395151803844, -0.05684160223776976, -0.16828460204235923, -0.09374867284294361, 0.03605017524499159, 0.07685332879191265, 0.03072738933350103, -0.1609198922255578, 0.0336310747706403, 0.1861487509192487, 0.09845321697335188, 0.08525097288992793, 0.13372993171819522, -0.17005376061290287, -0.14946501677443919, 0.3955429822493058, 0.04504490565383234, -0.18285713646596727, 0.23191883969460692, -0.03209130545012438, -0.2136930117938811, 0.06717915028835145, 0.21384353213048038, 0.08733899380940084, -0.21965370544169743, 0.04386988146087298, 0.09601460756339993, 0.16677956696814641, 0.017471314694445867, 0.04356004274002491, 0.24863261684703714, 0.2673921962626852, 0.05368163591069438, 0.10552513132838962, -0.01493526015502329, -0.10850322463263112, -0.1889718817009662, -0.18430050117715907, -0.08929918906114136, -0.02849362136420006, 0.0614358542829555, -0.13682575893779778, 0.35870336030180067, 0.25384310843387187, 0.05744372425565066, 0.020476252154017296, 0.3417031949815842, 0.03446312766755, 0.12380713836934704, 0.14214812025266627, 0.18855192104372412, 0.03958289612917444, 0.18271389211384723, -0.12980190699902147, 0.11046604511284386, -0.006784454794867018] |
1,802.02972 | Infer\^encia Baseada em Magnitudes na investiga\c{c}\~ao em Ci\^encias
do Esporte. A necessidade de romper com os testes de hip\'otese nula e os
valores de p | Research in Sports Sciences is supported often by inferences based on the
declaration of the value of the statistic statistically significant or
nonsignificant on the bases of a P value derived from a null-hypothesis test.
Taking into account that studies are manly conducted in sample, the use of null
hypothesis testing only allows estimating the true values (population) of the
statistics used. However, evidence has grown in many areas of knowledge that
this approach often leads to confusion and misinterpretation. To overcome this
limitation they have recently emerged recommendations to support the
statistical analysis with approaches that make use of more intuitive
interpretations and more practical, especially based on the magnitudes
(certainty / uncertainty) of the true values found. With the intent to provide
alternative solutions to methodological designs recurrently used in research in
sports sciences, this paper will seek to i) briefly spell out some of the
weaknesses associated with the null hypothesis tests based in the P value; ii)
reflect on the implications of the use of practical/clinical significance as
opposed to statistical significance; iii) submit proposals for use the
inferences based on the magnitude, particularly in the visualization and
interpretation of results; iv) present and discuss the limitations of
magnitude-based inference. Thus, this update article discourages, in a
sustained-based, the use of significance tests based only on the concept of
null hypothesis. Alternatively, it is proposed to use methods of inference
based on magnitudes as they allow interpretations of the practical/clinical
effects results obtained. ----- As investiga\c{c}\~oes em ci\^encias do esporte
sustentam-se frequentemente em infer\^encias baseadas na declara\c{c}\~ao de um
valor estatisticamente significativo, ou n\~ao significativo, com base no valor
de p que deriva dos testes de hip\'otese nula. Considerando que os estudos
s\~ao iminentemente amostrais, o recurso aos testes de hip\'otese nula apenas
possibilita estimar os valores verdadeiros (popula\c{c}\~ao) das estat\'isticas
utilizadas. Contudo, tem crescido a evid\^encia, em diversas \'areas do
conhecimento, de que esta abordagem origina frequentemente interpreta\c{c}\~oes
confusas e at\'e erradas (7). Para ultrapassar esta limita\c{c}\~ao t\^em
surgido recentemente recomenda\c{c}\~oes no sentido de sustentar as an\'alises
estat\'isticas com abordagens que recorram a interpreta\c{c}\~oes mais
intuitivas e mais pr\'aticas, baseadas sobretudo nas magnitudes
(certezas/incertezas) dos valores verdadeiros encontrados. Com o intento de
fornecer pistas alternativas aos desenhos metodol\'ogicos recorrentemente
utilizados na investiga\c{c}\~ao em ci\^encias do esporte, neste trabalho
procuraremos i) enunciar sucintamente algumas das fragilidades associadas aos
testes de hip\'otese nula sustentados no valor de p; ii) refletir sobre as
implica\c{c}\~oes da utiliza\c{c}\~ao da signific\^ancia pr\'atica/clinica em
oposi\c{c}\~ao \`a signific\^ancia estat\'istica; iii) apresentar propostas de
utiliza\c{c}\~ao das t\'ecnicas de infer\^encias baseadas na magnitude,
particularmente na visualiza\c{c}\~ao e interpreta\c{c}\~ao dos resultados; iv)
apresentar as principais limita\c{c}\~oes do uso das infer\^encias baseadas em
magnitudes. Assim, neste artigo de atualiza\c{c}\~ao desencoraja-se, de forma
sustentada e fundamentada, o uso dos testes de signific\^ancia baseados apenas
no conceito de hip\'otese nula. Em alternativa, prop\~oe-se a utiliza\c{c}\~ao
de m\'etodos de infer\^encias baseados em magnitudes por possibilitarem
interpreta\c{c}\~oes dos efeitos pr\'aticos/cl\'inicos dos resultados obtidos.
| stat.AP | research in sports sciences is supported often by inferences based on the declaration of the value of the statistic statistically significant or nonsignificant on the bases of a p value derived from a nullhypothesis test taking into account that studies are manly conducted in sample the use of null hypothesis testing only allows estimating the true values population of the statistics used however evidence has grown in many areas of knowledge that this approach often leads to confusion and misinterpretation to overcome this limitation they have recently emerged recommendations to support the statistical analysis with approaches that make use of more intuitive interpretations and more practical especially based on the magnitudes certainty uncertainty of the true values found with the intent to provide alternative solutions to methodological designs recurrently used in research in sports sciences this paper will seek to i briefly spell out some of the weaknesses associated with the null hypothesis tests based in the p value ii reflect on the implications of the use of practicalclinical significance as opposed to statistical significance iii submit proposals for use the inferences based on the magnitude particularly in the visualization and interpretation of results iv present and discuss the limitations of magnitudebased inference thus this update article discourages in a sustainedbased the use of significance tests based only on the concept of null hypothesis alternatively it is proposed to use methods of inference based on magnitudes as they allow interpretations of the practicalclinical effects results obtained as investigaccoes em ciencias do esporte sustentamse frequentemente em inferencias baseadas na declaraccao de um valor estatisticamente significativo ou nao significativo com base no valor de p que deriva dos testes de hipotese nula considerando que os estudos sao iminentemente amostrais o recurso aos testes de hipotese nula apenas possibilita estimar os valores verdadeiros populaccao das estatisticas utilizadas contudo tem crescido a evidencia em diversas areas do conhecimento de que esta abordagem origina frequentemente interpretaccoes confusas e ate erradas 7 para ultrapassar esta limitaccao tem surgido recentemente recomendaccoes no sentido de sustentar as analises estatisticas com abordagens que recorram a interpretaccoes mais intuitivas e mais praticas baseadas sobretudo nas magnitudes certezasincertezas dos valores verdadeiros encontrados com o intento de fornecer pistas alternativas aos desenhos metodologicos recorrentemente utilizados na investigaccao em ciencias do esporte neste trabalho procuraremos i enunciar sucintamente algumas das fragilidades associadas aos testes de hipotese nula sustentados no valor de p ii refletir sobre as implicaccoes da utilizaccao da significancia praticaclinica em oposiccao a significancia estatistica iii apresentar propostas de utilizaccao das tecnicas de inferencias baseadas na magnitude particularmente na visualizaccao e interpretaccao dos resultados iv apresentar as principais limitaccoes do uso das inferencias baseadas em magnitudes assim neste artigo de atualizaccao desencorajase de forma sustentada e fundamentada o uso dos testes de significancia baseados apenas no conceito de hipotese nula em alternativa propoese a utilizaccao de metodos de inferencias baseados em magnitudes por possibilitarem interpretaccoes dos efeitos praticosclinicos dos resultados obtidos | [['research', 'in', 'sports', 'sciences', 'is', 'supported', 'often', 'by', 'inferences', 'based', 'on', 'the', 'declaration', 'of', 'the', 'value', 'of', 'the', 'statistic', 'statistically', 'significant', 'or', 'nonsignificant', 'on', 'the', 'bases', 'of', 'a', 'p', 'value', 'derived', 'from', 'a', 'nullhypothesis', 'test', 'taking', 'into', 'account', 'that', 'studies', 'are', 'manly', 'conducted', 'in', 'sample', 'the', 'use', 'of', 'null', 'hypothesis', 'testing', 'only', 'allows', 'estimating', 'the', 'true', 'values', 'population', 'of', 'the', 'statistics', 'used', 'however', 'evidence', 'has', 'grown', 'in', 'many', 'areas', 'of', 'knowledge', 'that', 'this', 'approach', 'often', 'leads', 'to', 'confusion', 'and', 'misinterpretation', 'to', 'overcome', 'this', 'limitation', 'they', 'have', 'recently', 'emerged', 'recommendations', 'to', 'support', 'the', 'statistical', 'analysis', 'with', 'approaches', 'that', 'make', 'use', 'of', 'more', 'intuitive', 'interpretations', 'and', 'more', 'practical', 'especially', 'based', 'on', 'the', 'magnitudes', 'certainty', 'uncertainty', 'of', 'the', 'true', 'values', 'found', 'with', 'the', 'intent', 'to', 'provide', 'alternative', 'solutions', 'to', 'methodological', 'designs', 'recurrently', 'used', 'in', 'research', 'in', 'sports', 'sciences', 'this', 'paper', 'will', 'seek', 'to', 'i', 'briefly', 'spell', 'out', 'some', 'of', 'the', 'weaknesses', 'associated', 'with', 'the', 'null', 'hypothesis', 'tests', 'based', 'in', 'the', 'p', 'value', 'ii', 'reflect', 'on', 'the', 'implications', 'of', 'the', 'use', 'of', 'practicalclinical', 'significance', 'as', 'opposed', 'to', 'statistical', 'significance', 'iii', 'submit', 'proposals', 'for', 'use', 'the', 'inferences', 'based', 'on', 'the', 'magnitude', 'particularly', 'in', 'the', 'visualization', 'and', 'interpretation', 'of', 'results', 'iv', 'present', 'and', 'discuss', 'the', 'limitations', 'of', 'magnitudebased', 'inference', 'thus', 'this', 'update', 'article', 'discourages', 'in', 'a', 'sustainedbased', 'the', 'use', 'of', 'significance', 'tests', 'based', 'only', 'on', 'the', 'concept', 'of', 'null', 'hypothesis', 'alternatively', 'it', 'is', 'proposed', 'to', 'use', 'methods', 'of', 'inference', 'based', 'on', 'magnitudes', 'as', 'they', 'allow', 'interpretations', 'of', 'the', 'practicalclinical', 'effects', 'results', 'obtained', 'as', 'investigaccoes', 'em', 'ciencias', 'do', 'esporte', 'sustentamse', 'frequentemente', 'em', 'inferencias', 'baseadas', 'na', 'declaraccao', 'de', 'um', 'valor', 'estatisticamente', 'significativo', 'ou', 'nao', 'significativo', 'com', 'base', 'no', 'valor', 'de', 'p', 'que', 'deriva', 'dos', 'testes', 'de', 'hipotese', 'nula', 'considerando', 'que', 'os', 'estudos', 'sao', 'iminentemente', 'amostrais', 'o', 'recurso', 'aos', 'testes', 'de', 'hipotese', 'nula', 'apenas', 'possibilita', 'estimar', 'os', 'valores', 'verdadeiros', 'populaccao', 'das', 'estatisticas', 'utilizadas', 'contudo', 'tem', 'crescido', 'a', 'evidencia', 'em', 'diversas', 'areas', 'do', 'conhecimento', 'de', 'que', 'esta', 'abordagem', 'origina', 'frequentemente', 'interpretaccoes', 'confusas', 'e', 'ate', 'erradas', '7', 'para', 'ultrapassar', 'esta', 'limitaccao', 'tem', 'surgido', 'recentemente', 'recomendaccoes', 'no', 'sentido', 'de', 'sustentar', 'as', 'analises', 'estatisticas', 'com', 'abordagens', 'que', 'recorram', 'a', 'interpretaccoes', 'mais', 'intuitivas', 'e', 'mais', 'praticas', 'baseadas', 'sobretudo', 'nas', 'magnitudes', 'certezasincertezas', 'dos', 'valores', 'verdadeiros', 'encontrados', 'com', 'o', 'intento', 'de', 'fornecer', 'pistas', 'alternativas', 'aos', 'desenhos', 'metodologicos', 'recorrentemente', 'utilizados', 'na', 'investigaccao', 'em', 'ciencias', 'do', 'esporte', 'neste', 'trabalho', 'procuraremos', 'i', 'enunciar', 'sucintamente', 'algumas', 'das', 'fragilidades', 'associadas', 'aos', 'testes', 'de', 'hipotese', 'nula', 'sustentados', 'no', 'valor', 'de', 'p', 'ii', 'refletir', 'sobre', 'as', 'implicaccoes', 'da', 'utilizaccao', 'da', 'significancia', 'praticaclinica', 'em', 'oposiccao', 'a', 'significancia', 'estatistica', 'iii', 'apresentar', 'propostas', 'de', 'utilizaccao', 'das', 'tecnicas', 'de', 'inferencias', 'baseadas', 'na', 'magnitude', 'particularmente', 'na', 'visualizaccao', 'e', 'interpretaccao', 'dos', 'resultados', 'iv', 'apresentar', 'as', 'principais', 'limitaccoes', 'do', 'uso', 'das', 'inferencias', 'baseadas', 'em', 'magnitudes', 'assim', 'neste', 'artigo', 'de', 'atualizaccao', 'desencorajase', 'de', 'forma', 'sustentada', 'e', 'fundamentada', 'o', 'uso', 'dos', 'testes', 'de', 'significancia', 'baseados', 'apenas', 'no', 'conceito', 'de', 'hipotese', 'nula', 'em', 'alternativa', 'propoese', 'a', 'utilizaccao', 'de', 'metodos', 'de', 'inferencias', 'baseados', 'em', 'magnitudes', 'por', 'possibilitarem', 'interpretaccoes', 'dos', 'efeitos', 'praticosclinicos', 'dos', 'resultados', 'obtidos']] | [-0.10943762751754976, 0.00849898942225777, -0.12431235734188437, 0.08730876014976506, -0.10027899601903069, -0.16026304661542834, 0.016999358218562716, 0.28607713205593766, -0.09834953440083921, -0.3084968491594362, 0.0446848643328207, -0.29945635589187897, -0.14468644154269486, 0.14910678773623087, -0.15127667039632797, -0.016584954304919082, 0.003923574898234459, -0.04969950312798734, 0.0172036021215129, -0.22271060101106474, 0.23240401335266037, 0.12758007820001713, 0.344474616833716, -0.05105610281302064, 0.06289919806009743, 0.08016845031570662, -0.03005049216182099, -0.025452835213418082, -0.16978122776357601, 0.07484089615493705, 0.30207291288146126, 0.21312483949769362, 0.27312073624103933, -0.3498894574716663, -0.10201725661275252, 0.09045825313945648, 0.1146093796543188, 0.04082917089787467, 0.0002658288859118543, -0.33242548587640713, 0.0786609515555171, -0.16524194823874744, -0.0799176594633786, -0.022390873870095033, 0.024036137065792777, 0.018117357634336632, -0.22524760409678315, 0.05821960113712075, 0.05346246547917105, 0.08670518691560217, -0.0574683365889987, -0.25099551013679994, -0.06748661683306244, 0.0026533028918921072, -0.033743022269096826, 0.04218949157203657, 0.07473090441107713, -0.027867317261338672, -0.14622560176626304, 0.30346536783583683, -0.10195481069996615, -0.09047642683235965, 0.1721841130618522, -0.07488940088203926, -0.1826151144381512, 0.08420045567960616, 0.08787870116151787, 0.1033441554994651, -0.04926056657688391, 0.1769515240106129, 0.05999907910853496, 0.1455955298945043, 0.1690399746174294, 0.004936926174160166, 0.15022462031201406, 0.0473731616557594, -0.005970549035969181, -0.09335193892212712, -0.12304882428511252, -0.01775415262319239, -0.19462222538034743, -0.23201718394856846, -0.10334681559527549, 0.04934828649257885, -0.027004587678461308, -0.21777914126755157, 0.22969315790368117, 0.15466141347489754, 0.15165305998879394, 0.02328810900108496, 0.20822504285252744, -0.009639994802954806, 0.0036451314871573785, 0.09617772563725856, 0.19396108471682608, 0.06625973914382413, 0.1869701708342915, -0.20545226465437022, 0.0946499418327328, 0.043925781110695374] |
1,802.02973 | A new mechanism of sterile neutrino dark matter production | We consider a scenario where the dark matter candidate is a sterile neutrino
with sizable self-interactions, described by a dimension-six operator, and with
negligible interactions with the Standard Model. The relic abundance is set by
the freeze-out of 4-to-2 annihilations in the dark sector plasma and reproduces
the observed dark matter abundance when the sterile neutrino mass is in the
range $\sim 500\,{\rm keV} - 20\,\,{\rm GeV}$. The feeble interactions with the
Standard Model may lead to observable signals from dark matter decay.
Furthermore, the self-interactions can affect the formation of small scale
structures. We also implement this mechanism in a concrete model where the
sterile neutrino self-interaction is due to the exchange of a singlet scalar,
and we discuss the relevance of the scalar portal interactions for constructing
a complete thermal history of the dark sector.
| hep-ph | we consider a scenario where the dark matter candidate is a sterile neutrino with sizable selfinteractions described by a dimensionsix operator and with negligible interactions with the standard model the relic abundance is set by the freezeout of 4to2 annihilations in the dark sector plasma and reproduces the observed dark matter abundance when the sterile neutrino mass is in the range sim 500rm kev 20rm gev the feeble interactions with the standard model may lead to observable signals from dark matter decay furthermore the selfinteractions can affect the formation of small scale structures we also implement this mechanism in a concrete model where the sterile neutrino selfinteraction is due to the exchange of a singlet scalar and we discuss the relevance of the scalar portal interactions for constructing a complete thermal history of the dark sector | [['we', 'consider', 'a', 'scenario', 'where', 'the', 'dark', 'matter', 'candidate', 'is', 'a', 'sterile', 'neutrino', 'with', 'sizable', 'selfinteractions', 'described', 'by', 'a', 'dimensionsix', 'operator', 'and', 'with', 'negligible', 'interactions', 'with', 'the', 'standard', 'model', 'the', 'relic', 'abundance', 'is', 'set', 'by', 'the', 'freezeout', 'of', '4to2', 'annihilations', 'in', 'the', 'dark', 'sector', 'plasma', 'and', 'reproduces', 'the', 'observed', 'dark', 'matter', 'abundance', 'when', 'the', 'sterile', 'neutrino', 'mass', 'is', 'in', 'the', 'range', 'sim', '500rm', 'kev', '20rm', 'gev', 'the', 'feeble', 'interactions', 'with', 'the', 'standard', 'model', 'may', 'lead', 'to', 'observable', 'signals', 'from', 'dark', 'matter', 'decay', 'furthermore', 'the', 'selfinteractions', 'can', 'affect', 'the', 'formation', 'of', 'small', 'scale', 'structures', 'we', 'also', 'implement', 'this', 'mechanism', 'in', 'a', 'concrete', 'model', 'where', 'the', 'sterile', 'neutrino', 'selfinteraction', 'is', 'due', 'to', 'the', 'exchange', 'of', 'a', 'singlet', 'scalar', 'and', 'we', 'discuss', 'the', 'relevance', 'of', 'the', 'scalar', 'portal', 'interactions', 'for', 'constructing', 'a', 'complete', 'thermal', 'history', 'of', 'the', 'dark', 'sector']] | [-0.11904971189762685, 0.26224445814595504, -0.06121585691674708, 0.1940807549870121, -0.09399222880636122, -0.11582086607300238, -0.009645399055443704, 0.2801250201424837, -0.21660510240369202, -0.3768131529624738, -0.016171732921707992, -0.3011239378932206, -0.00895126915523125, 0.11126896004519521, 0.08317563925212358, -0.033200759504004106, 0.014500364638960865, 0.03638541870682007, -0.005192582026425311, -0.23117451922221602, 0.31338699033607126, 0.07877492397229242, 0.15236450687242561, 0.11984419815844911, 0.06747590290272937, -0.04796841079437667, -0.02186735875575858, -0.10476601685342543, -0.11336843017692017, 0.02913223310486715, 0.151609881712562, 0.09008556547504508, 0.1283943835673306, -0.3931180504324028, -0.2282856039579629, 0.2436934073578895, 0.14878638706902755, 0.09367593417546767, -0.1161154673421098, -0.34252770390936776, 0.03329331804621581, -0.25942389814265293, -0.1172208004795453, -0.024841471787487322, -0.06065258925082162, -0.07422601323196432, -0.31854317178401875, 0.15149486811830737, -0.07876631965764853, -0.09417420071686673, -0.05961049140280332, -0.10994307437795214, -0.03806978341034504, -0.044307451589702396, 0.12998229311094345, -0.03995728583878885, 0.19664697538931197, -0.22903971801176393, -0.06957866777563193, 0.4706747422049589, -0.17853182896129405, -0.11123953708995353, 0.14457023886429585, -0.12942354728960814, -0.12232599809067324, 0.12169105155557833, 0.15340876119321098, 0.0486027478473261, -0.16716974357929276, 0.18139146759243457, -0.074714601806858, 0.2147908826437368, 0.022701218679739052, 0.019748666036107084, 0.34610745319856934, 0.22988648828879163, 0.058161331994650775, 0.007557637205429594, -0.08911218345918528, -0.07909072879427935, -0.37731756051610266, -0.10903075336040381, -0.07289460247985143, 0.021716908808979068, -0.09062158334146421, -0.1157685828357524, 0.41494985176798177, 0.1364052726635504, 0.21791534131968066, -0.015078961926252198, 0.31312100622145567, 0.07478301357129086, 0.06051387449791518, 0.020689583711507167, 0.33717402660370094, 0.16336087438428556, 0.10109284408613081, -0.25047003132503426, 0.003591119941762265, -0.007934886547231786] |
1,802.02974 | Putting in All the Stops: Execution Control for JavaScript | Scores of compilers produce JavaScript, enabling programmers to use many
languages on the Web, reuse existing code, and even use Web IDEs.
Unfortunately, most compilers inherit the browser's compromised execution
model, so long-running programs freeze the browser tab, infinite loops crash
IDEs, and so on. The few compilers that avoid these problems suffer poor
performance and are difficult to engineer.
This paper presents Stopify, a source-to-source compiler that extends
JavaScript with debugging abstractions and blocking operations, and easily
integrates with existing compilers. We apply Stopify to 10 programming
languages and develop a Web IDE that supports stopping, single-stepping,
breakpointing, and long-running computations. For nine languages, Stopify
requires no or trivial compiler changes. For eight, our IDE is the first that
provides these features. Two of our subject languages have compilers with
similar features. Stopify's performance is competitive with these compilers and
it makes them dramatically simpler.
Stopify's abstractions rely on first-class continuations, which it provides
by compiling JavaScript to JavaScript. We also identify sub-languages of
JavaScript that compilers implicitly use, and exploit these to improve
performance. Finally, Stopify needs to repeatedly interrupt and resume program
execution. We use a sampling-based technique to estimate program speed that
outperforms other systems.
| cs.PL | scores of compilers produce javascript enabling programmers to use many languages on the web reuse existing code and even use web ides unfortunately most compilers inherit the browsers compromised execution model so longrunning programs freeze the browser tab infinite loops crash ides and so on the few compilers that avoid these problems suffer poor performance and are difficult to engineer this paper presents stopify a sourcetosource compiler that extends javascript with debugging abstractions and blocking operations and easily integrates with existing compilers we apply stopify to 10 programming languages and develop a web ide that supports stopping singlestepping breakpointing and longrunning computations for nine languages stopify requires no or trivial compiler changes for eight our ide is the first that provides these features two of our subject languages have compilers with similar features stopifys performance is competitive with these compilers and it makes them dramatically simpler stopifys abstractions rely on firstclass continuations which it provides by compiling javascript to javascript we also identify sublanguages of javascript that compilers implicitly use and exploit these to improve performance finally stopify needs to repeatedly interrupt and resume program execution we use a samplingbased technique to estimate program speed that outperforms other systems | [['scores', 'of', 'compilers', 'produce', 'javascript', 'enabling', 'programmers', 'to', 'use', 'many', 'languages', 'on', 'the', 'web', 'reuse', 'existing', 'code', 'and', 'even', 'use', 'web', 'ides', 'unfortunately', 'most', 'compilers', 'inherit', 'the', 'browsers', 'compromised', 'execution', 'model', 'so', 'longrunning', 'programs', 'freeze', 'the', 'browser', 'tab', 'infinite', 'loops', 'crash', 'ides', 'and', 'so', 'on', 'the', 'few', 'compilers', 'that', 'avoid', 'these', 'problems', 'suffer', 'poor', 'performance', 'and', 'are', 'difficult', 'to', 'engineer', 'this', 'paper', 'presents', 'stopify', 'a', 'sourcetosource', 'compiler', 'that', 'extends', 'javascript', 'with', 'debugging', 'abstractions', 'and', 'blocking', 'operations', 'and', 'easily', 'integrates', 'with', 'existing', 'compilers', 'we', 'apply', 'stopify', 'to', '10', 'programming', 'languages', 'and', 'develop', 'a', 'web', 'ide', 'that', 'supports', 'stopping', 'singlestepping', 'breakpointing', 'and', 'longrunning', 'computations', 'for', 'nine', 'languages', 'stopify', 'requires', 'no', 'or', 'trivial', 'compiler', 'changes', 'for', 'eight', 'our', 'ide', 'is', 'the', 'first', 'that', 'provides', 'these', 'features', 'two', 'of', 'our', 'subject', 'languages', 'have', 'compilers', 'with', 'similar', 'features', 'stopifys', 'performance', 'is', 'competitive', 'with', 'these', 'compilers', 'and', 'it', 'makes', 'them', 'dramatically', 'simpler', 'stopifys', 'abstractions', 'rely', 'on', 'firstclass', 'continuations', 'which', 'it', 'provides', 'by', 'compiling', 'javascript', 'to', 'javascript', 'we', 'also', 'identify', 'sublanguages', 'of', 'javascript', 'that', 'compilers', 'implicitly', 'use', 'and', 'exploit', 'these', 'to', 'improve', 'performance', 'finally', 'stopify', 'needs', 'to', 'repeatedly', 'interrupt', 'and', 'resume', 'program', 'execution', 'we', 'use', 'a', 'samplingbased', 'technique', 'to', 'estimate', 'program', 'speed', 'that', 'outperforms', 'other', 'systems']] | [-0.0963229849958458, -0.03676238597060243, -0.06322908607992128, 0.08862094166867722, -0.21638560220599173, -0.24846754037082577, 0.0836476767811781, 0.4403101326049998, -0.27110711373209667, -0.3764647830158281, 0.11394050372764468, -0.27716028973496015, -0.09741221620396782, 0.27181527104754094, -0.11105872535099012, 0.07734922338456202, 0.13035752882178014, -0.045709840695445356, -0.05859110910111131, -0.3208967555027742, 0.26235481289287027, 0.03432459035912194, 0.22465906279663053, 0.028744465051791988, 0.023543628312360784, -0.019764634508353012, -0.0409321165852583, -0.027560777623110856, -0.02246328006037332, 0.13518111039022468, 0.384963340847156, 0.33184305627901967, 0.2984976197855595, -0.4777628310950091, -0.1100479439044228, -0.009609833605683002, 0.1141467987607496, 0.09640987654610608, -9.392200049777062e-05, -0.2730846804411461, 0.11064176472166601, -0.2622766090055498, 0.00039851112912098565, -0.18521159183329497, -0.025997304328932214, -0.005999928777321027, -0.18502384431373614, -0.10469812906947201, 0.08900676088956877, 0.07414174736656536, 0.048495007809012745, -0.09830635608508227, -0.02449300072681254, 0.13782707745424258, 0.04079793980162298, 0.028141297474025915, 0.20971867750661496, -0.0739880305261184, -0.18707395428314041, 0.36368607876296993, -0.0185803192993029, -0.17864705604107048, 0.3011862101773612, 0.029887467791111424, -0.22960495327670988, 0.09975738226621149, 0.19530805605702484, 0.08983218408404635, -0.1687100284350797, 0.11850516926676322, 0.03878656313396417, 0.2637943536090927, 0.11409607268153475, 0.00722681668598969, 0.18392317795958849, 0.16914807720712793, 0.04095411975599395, 0.14773001924234752, 0.04241180684736882, -0.06519782777684621, -0.22563615052853353, -0.17551186797686685, -0.055566194027853316, -0.053559894570842, -0.05842924154503868, -0.22843960301819233, 0.35176316186224516, 0.2884953661893423, 0.03276501788924902, 0.17492496881765338, 0.3858601960902795, 0.009794793331709045, 0.21128215732721564, 0.20448005269997968, 0.08823022336866229, -0.05493441950559664, 0.1902433699140182, -0.15042034200368784, 0.14818167007552124, 0.0030532956920349256] |
1,802.02975 | Practical Issues of Action-conditioned Next Image Prediction | The problem of action-conditioned image prediction is to predict the expected
next frame given the current camera frame the robot observes and an action
selected by the robot. We provide the first comparison of two recent popular
models, especially for image prediction on cars. Our major finding is that
action tiling encoding is the most important factor leading to the remarkable
performance of the CDNA model. We present a light-weight model by action tiling
encoding which has a single-decoder feedforward architecture same as
[action_video_prediction_honglak]. On a real driving dataset, the CDNA model
achieves ${0.3986} \times 10^{-3}$ MSE and ${0.9846}$ Structure SIMilarity
(SSIM) with a network size of about {\bfseries ${12.6}$ million} parameters.
With a small network of fewer than {\bfseries ${1}$ million} parameters, our
new model achieves a comparable performance to CDNA at ${0.3613} \times
10^{-3}$ MSE and ${0.9633}$ SSIM. Our model requires less memory, is more
computationally efficient and is advantageous to be used inside self-driving
vehicles.
| cs.CV | the problem of actionconditioned image prediction is to predict the expected next frame given the current camera frame the robot observes and an action selected by the robot we provide the first comparison of two recent popular models especially for image prediction on cars our major finding is that action tiling encoding is the most important factor leading to the remarkable performance of the cdna model we present a lightweight model by action tiling encoding which has a singledecoder feedforward architecture same as action_video_prediction_honglak on a real driving dataset the cdna model achieves 03986 times 103 mse and 09846 structure similarity ssim with a network size of about bfseries 126 million parameters with a small network of fewer than bfseries 1 million parameters our new model achieves a comparable performance to cdna at 03613 times 103 mse and 09633 ssim our model requires less memory is more computationally efficient and is advantageous to be used inside selfdriving vehicles | [['the', 'problem', 'of', 'actionconditioned', 'image', 'prediction', 'is', 'to', 'predict', 'the', 'expected', 'next', 'frame', 'given', 'the', 'current', 'camera', 'frame', 'the', 'robot', 'observes', 'and', 'an', 'action', 'selected', 'by', 'the', 'robot', 'we', 'provide', 'the', 'first', 'comparison', 'of', 'two', 'recent', 'popular', 'models', 'especially', 'for', 'image', 'prediction', 'on', 'cars', 'our', 'major', 'finding', 'is', 'that', 'action', 'tiling', 'encoding', 'is', 'the', 'most', 'important', 'factor', 'leading', 'to', 'the', 'remarkable', 'performance', 'of', 'the', 'cdna', 'model', 'we', 'present', 'a', 'lightweight', 'model', 'by', 'action', 'tiling', 'encoding', 'which', 'has', 'a', 'singledecoder', 'feedforward', 'architecture', 'same', 'as', 'action_video_prediction_honglak', 'on', 'a', 'real', 'driving', 'dataset', 'the', 'cdna', 'model', 'achieves', '03986', 'times', '103', 'mse', 'and', '09846', 'structure', 'similarity', 'ssim', 'with', 'a', 'network', 'size', 'of', 'about', 'bfseries', '126', 'million', 'parameters', 'with', 'a', 'small', 'network', 'of', 'fewer', 'than', 'bfseries', '1', 'million', 'parameters', 'our', 'new', 'model', 'achieves', 'a', 'comparable', 'performance', 'to', 'cdna', 'at', '03613', 'times', '103', 'mse', 'and', '09633', 'ssim', 'our', 'model', 'requires', 'less', 'memory', 'is', 'more', 'computationally', 'efficient', 'and', 'is', 'advantageous', 'to', 'be', 'used', 'inside', 'selfdriving', 'vehicles']] | [-0.10170961034983568, 0.01667251914066008, -0.032933348119657146, 0.04048286980756338, -0.05821130838653756, -0.18233853988778337, 0.0343490566240354, 0.4248822089652286, -0.20261878938732766, -0.3694210540668696, 0.09162225838602019, -0.28926934112525104, -0.16035059380565622, 0.20811601505633198, -0.12302361935450647, 0.06598566234568257, 0.12180986103761059, 0.10080336364722155, -0.039326879407446155, -0.27370614495808504, 0.21024196607667314, 0.09543798044691548, 0.297443615762811, -0.025813092636924825, 0.14616805879938366, -0.031286892117733306, -0.002622711521230246, -0.0294191919061919, -0.06180671538176715, 0.16187032353589434, 0.21510991182187927, 0.17074209094770545, 0.2851630550101522, -0.39761761947240876, -0.18511696454554208, 0.07416551035069126, 0.11926450994705144, 0.07189370608677181, -0.02833345559271325, -0.2975645474384931, 0.1267080525323859, -0.17832985896568157, -0.007775032917523181, -0.07477090779177256, 0.0489859163215825, -0.04261372789838597, -0.30266281338385614, 0.06628575692708469, 0.014963776081506359, 0.04008207971070844, -0.045502445389406364, -0.13503903797659164, 0.01379155231897082, 0.16937538156420678, 0.02289366088639087, 0.13306136901021665, 0.16114512017750376, -0.1693985535170405, -0.1126769449696631, 0.4332196815643999, -0.05401297629779085, -0.1758477006560976, 0.17418600985241173, -0.07476130005977068, -0.09141448081936687, 0.1383235463229204, 0.2018845382171046, 0.11614836473592349, -0.15146083963803617, -0.024862473067753996, -0.062353609981456476, 0.24801589044938355, 0.052244043308555296, -0.0112165345145561, 0.13683868125755047, 0.3034309404657075, 0.06266856614782132, 0.1276984743943965, -0.14215964145076118, -0.08742899964502278, -0.22742985646657057, -0.11746655851847639, -0.16677497292403132, 0.01595221225809502, -0.1670915061438695, -0.10320420175220964, 0.4166193628365076, 0.21974148852505573, 0.21021205655262365, 0.10719500220530838, 0.34336900573812035, 0.04973133306300856, 0.13007857786846885, 0.08161475512775053, 0.2005680971962743, 0.011673999524454734, 0.06571913308442545, -0.15845464708246781, 0.06642153187376128, 0.061683755358803626] |
1,802.02976 | A mixed finite element for weakly-symmetric elasticity | We develop a finite element discretization for the weakly symmetric equations
of linear elasticity on tetrahedral meshes. The finite element combines, for $r
\geq 0$, discontinuous polynomials of $r$ for the displacement,
$H(\mathrm{div})$-conforming polynomials of order $r+1$ for the stress, and
$H(\mathrm{curl})$-conforming polynomials of order $r+1$ for the vector
representation of the multiplier. We prove that this triplet is stable and has
optimal approximation properties. The lowest order case can be combined with
inexact quadrature to eliminate the stress and multiplier variables, leaving a
compact cell-centered finite volume scheme for the displacement.
| math.NA cs.CE | we develop a finite element discretization for the weakly symmetric equations of linear elasticity on tetrahedral meshes the finite element combines for r geq 0 discontinuous polynomials of r for the displacement hmathrmdivconforming polynomials of order r1 for the stress and hmathrmcurlconforming polynomials of order r1 for the vector representation of the multiplier we prove that this triplet is stable and has optimal approximation properties the lowest order case can be combined with inexact quadrature to eliminate the stress and multiplier variables leaving a compact cellcentered finite volume scheme for the displacement | [['we', 'develop', 'a', 'finite', 'element', 'discretization', 'for', 'the', 'weakly', 'symmetric', 'equations', 'of', 'linear', 'elasticity', 'on', 'tetrahedral', 'meshes', 'the', 'finite', 'element', 'combines', 'for', 'r', 'geq', '0', 'discontinuous', 'polynomials', 'of', 'r', 'for', 'the', 'displacement', 'hmathrmdivconforming', 'polynomials', 'of', 'order', 'r1', 'for', 'the', 'stress', 'and', 'hmathrmcurlconforming', 'polynomials', 'of', 'order', 'r1', 'for', 'the', 'vector', 'representation', 'of', 'the', 'multiplier', 'we', 'prove', 'that', 'this', 'triplet', 'is', 'stable', 'and', 'has', 'optimal', 'approximation', 'properties', 'the', 'lowest', 'order', 'case', 'can', 'be', 'combined', 'with', 'inexact', 'quadrature', 'to', 'eliminate', 'the', 'stress', 'and', 'multiplier', 'variables', 'leaving', 'a', 'compact', 'cellcentered', 'finite', 'volume', 'scheme', 'for', 'the', 'displacement']] | [-0.15953805786040093, 0.11965642154423727, -0.08660716203351816, -0.015340846689004038, -0.06779072049798238, -0.14896456689263385, -0.01668568399683055, 0.3510855393587715, -0.3244044442350666, -0.14737799650885994, 0.13420403530407282, -0.2579134255233738, -0.06999828018662002, 0.1166412067392634, -0.04246795734183656, 0.05982028900956114, -0.003922343657662471, 0.052171287747720875, -0.14844123393348935, -0.25500654069085915, 0.309778904563023, -0.025427845648179452, 0.21809153072535992, 0.013094433210790157, 0.17505394030983248, -0.01588119205294384, -0.018199004791677, 0.0262977902777493, -0.12062302893068086, 0.11802668578457087, 0.26773757226765155, 0.023616495958736373, 0.2796003782604304, -0.3810503227429258, -0.17550294845261508, 0.13222374222758743, 0.13814592179324892, 0.07793421412093772, -0.023901637726359896, -0.19977168819297933, 0.15703076152648363, -0.16967254082361857, -0.20338685452524158, -0.11726235705945227, 0.03665694062494569, 0.07025920632812711, -0.38819031024144757, 0.08753700743222402, 0.07620622588632008, 0.08801580356084741, -0.0569781116830806, -0.16909699013663662, -0.004435538738552067, 0.05307646413437194, -0.03870807076390419, 0.0012511154688480827, 0.035953483519713496, -0.05619310160012295, -0.03550413188317584, 0.3884854649504026, -0.07360990968041328, -0.3019213930186298, 0.11217307014804748, -0.13327323017227982, -0.09747783797016989, 0.14277163724828926, 0.16523763551247408, 0.1871184152706216, -0.028442202486459994, 0.14941172143250395, -0.023976535660525163, 0.168990455468237, 0.0881204886879358, -0.03420207460617854, 0.09734530782120096, 0.07909861724409792, 0.15995453995549017, 0.11480083395532953, -0.09288658339581969, -0.08495929966577226, -0.3844143411351575, -0.19728931706502206, -0.1809877237305045, -0.003319446628706323, -0.19936836748335432, -0.22546940837055446, 0.3584652469895647, 0.08141760997370713, 0.0834534756321874, 0.09875323845901424, 0.25151466795295063, 0.15908602927035342, 0.05317254087163342, 0.07159378864388499, 0.17371410793728298, 0.22437064215644367, 0.04472657508320278, -0.2469479284197506, 0.023251218754901656, 0.24079836797383097] |
1,802.02977 | The ALMA-PILS survey: The sulphur connection between protostars and
comets: IRAS 16293-2422 B and 67P/Churyumov-Gerasimenko | The evolutionary past of our Solar System can be pieced together by comparing
analogous low-mass protostars with remnants of our Protosolar Nebula - comets.
Sulphur-bearing molecules may be unique tracers of the joint evolution of the
volatile and refractory components. ALMA Band 7 data from the large unbiased
Protostellar Interferometric Line Survey (PILS) are used to search for
S-bearing molecules in the outer disc-like structure, 60 au from IRAS
16293-2422 B, and are compared with data on 67P/C-G stemming from the ROSINA
instrument aboard Rosetta. Species such as SO$_{2}$, SO, OCS, CS, H$_{2}$CS,
H$_{2}$S and CH$_{3}$SH are detected via at least one of their isotopologues
towards IRAS 16293-2422 B. The search reveals a first-time detection of
OC$^{33}$S towards this source and a tentative first-time detection of
C$^{36}$S towards a low-mass protostar. The data show that IRAS 16293-2422 B
contains much more OCS than H$_{2}$S in comparison to 67P/C-G; meanwhile, the
SO/SO$_{2}$ ratio is in close agreement between the two targets. IRAS
16293-2422 B has a CH$_{3}$SH/H$_{2}$CS ratio in range of that of our Solar
System (differences by a factor of 0.7-5.3). It is suggested that the levels of
UV radiation during the initial collapse of the systems may have varied and
have potentially been higher for IRAS 16293-2422 B due to its binary nature;
thereby, converting more H$_{2}$S into OCS. It remains to be conclusively
tested if this also promotes the formation of S-bearing complex organics.
Elevated UV levels of IRAS 16293-2422 B and a warmer birth cloud of our Solar
System may jointly explain the variations between the two low-mass systems.
| astro-ph.SR astro-ph.EP astro-ph.GA | the evolutionary past of our solar system can be pieced together by comparing analogous lowmass protostars with remnants of our protosolar nebula comets sulphurbearing molecules may be unique tracers of the joint evolution of the volatile and refractory components alma band 7 data from the large unbiased protostellar interferometric line survey pils are used to search for sbearing molecules in the outer disclike structure 60 au from iras 162932422 b and are compared with data on 67pcg stemming from the rosina instrument aboard rosetta species such as so_2 so ocs cs h_2cs h_2s and ch_3sh are detected via at least one of their isotopologues towards iras 162932422 b the search reveals a firsttime detection of oc33s towards this source and a tentative firsttime detection of c36s towards a lowmass protostar the data show that iras 162932422 b contains much more ocs than h_2s in comparison to 67pcg meanwhile the soso_2 ratio is in close agreement between the two targets iras 162932422 b has a ch_3shh_2cs ratio in range of that of our solar system differences by a factor of 0753 it is suggested that the levels of uv radiation during the initial collapse of the systems may have varied and have potentially been higher for iras 162932422 b due to its binary nature thereby converting more h_2s into ocs it remains to be conclusively tested if this also promotes the formation of sbearing complex organics elevated uv levels of iras 162932422 b and a warmer birth cloud of our solar system may jointly explain the variations between the two lowmass systems | [['the', 'evolutionary', 'past', 'of', 'our', 'solar', 'system', 'can', 'be', 'pieced', 'together', 'by', 'comparing', 'analogous', 'lowmass', 'protostars', 'with', 'remnants', 'of', 'our', 'protosolar', 'nebula', 'comets', 'sulphurbearing', 'molecules', 'may', 'be', 'unique', 'tracers', 'of', 'the', 'joint', 'evolution', 'of', 'the', 'volatile', 'and', 'refractory', 'components', 'alma', 'band', '7', 'data', 'from', 'the', 'large', 'unbiased', 'protostellar', 'interferometric', 'line', 'survey', 'pils', 'are', 'used', 'to', 'search', 'for', 'sbearing', 'molecules', 'in', 'the', 'outer', 'disclike', 'structure', '60', 'au', 'from', 'iras', '162932422', 'b', 'and', 'are', 'compared', 'with', 'data', 'on', '67pcg', 'stemming', 'from', 'the', 'rosina', 'instrument', 'aboard', 'rosetta', 'species', 'such', 'as', 'so_2', 'so', 'ocs', 'cs', 'h_2cs', 'h_2s', 'and', 'ch_3sh', 'are', 'detected', 'via', 'at', 'least', 'one', 'of', 'their', 'isotopologues', 'towards', 'iras', '162932422', 'b', 'the', 'search', 'reveals', 'a', 'firsttime', 'detection', 'of', 'oc33s', 'towards', 'this', 'source', 'and', 'a', 'tentative', 'firsttime', 'detection', 'of', 'c36s', 'towards', 'a', 'lowmass', 'protostar', 'the', 'data', 'show', 'that', 'iras', '162932422', 'b', 'contains', 'much', 'more', 'ocs', 'than', 'h_2s', 'in', 'comparison', 'to', '67pcg', 'meanwhile', 'the', 'soso_2', 'ratio', 'is', 'in', 'close', 'agreement', 'between', 'the', 'two', 'targets', 'iras', '162932422', 'b', 'has', 'a', 'ch_3shh_2cs', 'ratio', 'in', 'range', 'of', 'that', 'of', 'our', 'solar', 'system', 'differences', 'by', 'a', 'factor', 'of', '0753', 'it', 'is', 'suggested', 'that', 'the', 'levels', 'of', 'uv', 'radiation', 'during', 'the', 'initial', 'collapse', 'of', 'the', 'systems', 'may', 'have', 'varied', 'and', 'have', 'potentially', 'been', 'higher', 'for', 'iras', '162932422', 'b', 'due', 'to', 'its', 'binary', 'nature', 'thereby', 'converting', 'more', 'h_2s', 'into', 'ocs', 'it', 'remains', 'to', 'be', 'conclusively', 'tested', 'if', 'this', 'also', 'promotes', 'the', 'formation', 'of', 'sbearing', 'complex', 'organics', 'elevated', 'uv', 'levels', 'of', 'iras', '162932422', 'b', 'and', 'a', 'warmer', 'birth', 'cloud', 'of', 'our', 'solar', 'system', 'may', 'jointly', 'explain', 'the', 'variations', 'between', 'the', 'two', 'lowmass', 'systems']] | [-0.06192256629753293, 0.11026699467202475, -0.034982718177618104, 0.027087427973783492, -0.026431462125932427, -0.10305772724304102, 0.03883057209680759, 0.41818461936431056, -0.16691291979606923, -0.3435845666786592, 0.0762154389304609, -0.2694649908742378, -0.038636240708652576, 0.1339336090434908, -0.033449232634836124, -0.026345011484872637, 0.10248451827140162, -0.12110182709343267, -0.0036796278434403328, -0.19927487085874152, 0.26763582333255603, 0.12079967540808399, 0.09503367870406461, -0.0047510007010403196, 0.03942725629951616, -0.19499843498915687, -0.027272685387458088, -0.06711174757129255, -0.1140349727669078, 0.08139011925376285, 0.2834282779571481, 0.1519132167624549, 0.19630438766753888, -0.3662232151943538, -0.2318614560799086, 0.07136661880957651, 0.17583639611778165, 0.03485963574985716, -0.021577176496731697, -0.32066946777339356, 0.07627479049715971, -0.17354786515658077, -0.1292187551775737, 0.04009737841538534, 0.0941256636514506, 0.019146282430593256, -0.23175727818836186, 0.07076210366094988, -0.011939079308672175, 0.1009849360491718, -0.16554063299792213, -0.22255947653128103, -0.11317479340468284, 0.10908038512729326, 0.000785008358682147, 0.1038107983591325, 0.19525534208458106, -0.11097468956405794, -0.04295137788147343, 0.4240786183185165, -0.09669749901100226, -0.012093583468197399, 0.2847620150253742, -0.19591964053530028, -0.26706074229314747, 0.2146912386794013, 0.10762744245358566, 0.14611487256377528, -0.1420788317576779, -0.033418615101764144, -0.0463952899943124, 0.21173944072308679, 0.08018520517013822, 0.06677461516246057, 0.33887668543020516, 0.12706115312787344, 0.04539651431277252, 0.16213043977154043, -0.22708105079373092, -0.06572077180447368, -0.1649800033733459, -0.167630645084097, -0.1256762948566649, 0.0698442690215773, -0.08244921482797324, -0.06020894307092354, 0.26311216317660785, 0.12324899719672003, 0.20935705383054565, -0.028068220311257597, 0.30279052257356653, 0.036537221264626815, 0.09129067159625648, 0.07993425143695099, 0.29534837704492506, 0.14550986988397482, 0.13022564393232652, -0.23689386196314913, 0.1514132616213425, -0.040111798463309555] |
1,802.02978 | Uncertainty Quantification for Maxwell's Eigenproblem based on
Isogeometric Analysis and Mode Tracking | The electromagnetic field distribution as well as the resonating frequency of
various modes in superconducting cavities used in particle accelerators for
example are sensitive to small geometry deformations. The occurring variations
are motivated by measurements of an available set of resonators from which we
propose to extract a small number of relevant and independent deformations by
using a truncated Karhunen-Lo\`eve expansion. The random deformations are used
in an expressive uncertainty quantification workflow to determine the
sensitivity of the eigenmodes. For the propagation of uncertainty, a stochastic
collocation method based on sparse grids is employed. It requires the repeated
solution of Maxwell's eigenvalue problem at predefined collocation points,
i.e., for cavities with perturbed geometry. The main contribution of the paper
is ensuring the consistency of the solution, i.e., matching the eigenpairs,
among the various eigenvalue problems at the stochastic collocation points. To
this end, a classical eigenvalue tracking technique is proposed that is based
on homotopies between collocation points and a Newton-based eigenvalue solver.
The approach can be efficiently parallelized while tracking the eigenpairs. In
this paper, we propose the application of isogeometric analysis since it allows
for the exact description of the geometrical domains with respect to common
computer-aided design kernels, for a straightforward and convenient way of
handling geometrical variations and smooth solutions.
| cs.CE cs.NA math.NA physics.acc-ph physics.comp-ph | the electromagnetic field distribution as well as the resonating frequency of various modes in superconducting cavities used in particle accelerators for example are sensitive to small geometry deformations the occurring variations are motivated by measurements of an available set of resonators from which we propose to extract a small number of relevant and independent deformations by using a truncated karhunenloeve expansion the random deformations are used in an expressive uncertainty quantification workflow to determine the sensitivity of the eigenmodes for the propagation of uncertainty a stochastic collocation method based on sparse grids is employed it requires the repeated solution of maxwells eigenvalue problem at predefined collocation points ie for cavities with perturbed geometry the main contribution of the paper is ensuring the consistency of the solution ie matching the eigenpairs among the various eigenvalue problems at the stochastic collocation points to this end a classical eigenvalue tracking technique is proposed that is based on homotopies between collocation points and a newtonbased eigenvalue solver the approach can be efficiently parallelized while tracking the eigenpairs in this paper we propose the application of isogeometric analysis since it allows for the exact description of the geometrical domains with respect to common computeraided design kernels for a straightforward and convenient way of handling geometrical variations and smooth solutions | [['the', 'electromagnetic', 'field', 'distribution', 'as', 'well', 'as', 'the', 'resonating', 'frequency', 'of', 'various', 'modes', 'in', 'superconducting', 'cavities', 'used', 'in', 'particle', 'accelerators', 'for', 'example', 'are', 'sensitive', 'to', 'small', 'geometry', 'deformations', 'the', 'occurring', 'variations', 'are', 'motivated', 'by', 'measurements', 'of', 'an', 'available', 'set', 'of', 'resonators', 'from', 'which', 'we', 'propose', 'to', 'extract', 'a', 'small', 'number', 'of', 'relevant', 'and', 'independent', 'deformations', 'by', 'using', 'a', 'truncated', 'karhunenloeve', 'expansion', 'the', 'random', 'deformations', 'are', 'used', 'in', 'an', 'expressive', 'uncertainty', 'quantification', 'workflow', 'to', 'determine', 'the', 'sensitivity', 'of', 'the', 'eigenmodes', 'for', 'the', 'propagation', 'of', 'uncertainty', 'a', 'stochastic', 'collocation', 'method', 'based', 'on', 'sparse', 'grids', 'is', 'employed', 'it', 'requires', 'the', 'repeated', 'solution', 'of', 'maxwells', 'eigenvalue', 'problem', 'at', 'predefined', 'collocation', 'points', 'ie', 'for', 'cavities', 'with', 'perturbed', 'geometry', 'the', 'main', 'contribution', 'of', 'the', 'paper', 'is', 'ensuring', 'the', 'consistency', 'of', 'the', 'solution', 'ie', 'matching', 'the', 'eigenpairs', 'among', 'the', 'various', 'eigenvalue', 'problems', 'at', 'the', 'stochastic', 'collocation', 'points', 'to', 'this', 'end', 'a', 'classical', 'eigenvalue', 'tracking', 'technique', 'is', 'proposed', 'that', 'is', 'based', 'on', 'homotopies', 'between', 'collocation', 'points', 'and', 'a', 'newtonbased', 'eigenvalue', 'solver', 'the', 'approach', 'can', 'be', 'efficiently', 'parallelized', 'while', 'tracking', 'the', 'eigenpairs', 'in', 'this', 'paper', 'we', 'propose', 'the', 'application', 'of', 'isogeometric', 'analysis', 'since', 'it', 'allows', 'for', 'the', 'exact', 'description', 'of', 'the', 'geometrical', 'domains', 'with', 'respect', 'to', 'common', 'computeraided', 'design', 'kernels', 'for', 'a', 'straightforward', 'and', 'convenient', 'way', 'of', 'handling', 'geometrical', 'variations', 'and', 'smooth', 'solutions']] | [-0.11160499112088686, 0.030664580677354177, -0.07457758944533835, 0.04210763140777387, -0.09212927148942879, -0.10736283548415647, 0.0023326424720792847, 0.3610920993193427, -0.28546957750413043, -0.30309144062752763, 0.12590728125972325, -0.266262659609438, -0.13824459930194247, 0.19829148830895998, -0.06419026227036892, 0.14433620928429833, 0.08639185098609148, 0.019895277709578312, -0.0692563181706034, -0.17119512389736058, 0.3266712208800714, 0.060971482609024394, 0.28031223780414627, 0.004427962492015561, 0.11720137906132405, -0.018856296257037566, -0.018751227590783116, 0.025809292901289936, -0.08196936900935937, 0.17132509026239043, 0.28581325908596233, 0.10605588896119414, 0.2885490951441646, -0.42996831607317254, -0.17174409599876833, 0.09364777328185389, 0.16832143138897188, 0.11005347553655837, -0.026283986924137817, -0.26555518212371343, 0.07451185265177356, -0.11535770789215288, -0.15204772510713785, -0.11607460099246318, -0.021627763690422595, 0.04535534404730642, -0.3023066272606603, 0.06164458437570344, 0.033833118375917355, 0.0427908246692653, -0.02550830113920209, -0.08716443440633191, 0.04551649032047488, 0.09332153378881375, 0.020656508162931027, -0.021236995860681843, 0.10495100326555407, -0.07969695584583053, -0.08918609848642008, 0.4029556195698809, -0.007105199709887155, -0.26251999900685014, 0.15285359399075507, -0.0820668589335455, -0.11012343043531074, 0.13365480871914634, 0.1929168609149371, 0.16162497386560454, -0.1517073400204383, 0.08246251832471864, 0.003928722715806042, 0.15871462412178516, 0.09703707818277006, -0.0006336077795337851, 0.16563244813413439, 0.17827952189466734, 0.10162363473813389, 0.15337870811562654, -0.09036606405513518, -0.0925985772658257, -0.3147784638975825, -0.11127522133158033, -0.21160865529705813, -0.0038810711964041705, -0.13497575671240963, -0.23626493179091365, 0.42299682742733263, 0.16143629949395197, 0.17467454810209015, 0.033754135952570485, 0.31729769921713624, 0.1388377984178554, 0.07124640252691407, 0.07757978501651332, 0.2031527297815012, 0.15427408076465896, 0.08786032084923968, -0.22437867063323957, 0.03546264730872604, 0.10935252423128375] |
1,802.02979 | Erratum for Ricci-flat graphs with girth at least five | This erratum will correct the classification of Theorem 1 in Lin-Lu-Yau,
Comm. Anal. Geom., 2014, that misses the Triplex graph.
| math.CO | this erratum will correct the classification of theorem 1 in linluyau comm anal geom 2014 that misses the triplex graph | [['this', 'erratum', 'will', 'correct', 'the', 'classification', 'of', 'theorem', '1', 'in', 'linluyau', 'comm', 'anal', 'geom', '2014', 'that', 'misses', 'the', 'triplex', 'graph']] | [-0.08302627219818533, -0.08688101805746555, -0.126850196858868, -0.017266416019992903, -0.04137830268591643, -0.08526513129472732, 0.05572858327068388, 0.2576287412084639, -0.14962545298039914, -0.410045699775219, 0.10866835527704097, -0.3105431001633406, -0.18936121352016927, 0.05961775751784444, -0.3594042777083814, -0.04307992300018668, 0.14056688130367548, -0.10216991128399969, -0.06136252506403252, -0.3989362895328668, 0.1673562447540462, 0.0747251314111054, 0.1583741100737825, 0.11484352704137564, 0.030802842462435365, 0.1286458322778344, -0.185745401494205, -0.11578903514891863, -0.1616366628692049, 0.07671261602081358, 0.39086120016872883, 0.048569594603031875, 0.30949196591973305, -0.2740983976051211, -0.11628239259589464, 0.11084309965372086, -0.0012496991083025932, 0.06264582853764296, 0.15070830043405295, -0.3564196381019428, 0.1640414150431752, -0.15766841005533933, -0.09001171673298813, -0.03342204536311329, 0.2554738149046898, -0.034805631497874856, -0.22595007894560695, 0.23161225044168532, 0.3836730503477156, 0.08689220100641251, -0.019781875517219306, -0.15196697595529257, -0.11108457110822201, 0.02103913095779717, -0.08174126083031297, 0.145511889224872, 0.02325382602866739, -0.07010918649611994, -0.1964415915310383, 0.2897998343221843, 0.04812503883149475, -0.06636478614236693, 0.18308200244791806, -0.029551236238330603, -0.24786762812291271, 0.12345806136727333, 0.20485273702070117, 0.06232026945799589, -0.137862421607133, 0.19309124427381902, -0.17774655371904374, 0.17545156026026235, 0.2598781121894717, -0.150837667635642, -0.011230900289956481, 0.031157081201672553, 0.03882300131954253, 0.01962776267901063, -0.06430677932221443, 0.01013568015769124, -0.3892516098916531, -0.1920414104592055, -0.16909625045955182, 0.1572615161538124, 0.01630868874490261, -0.12756469361484052, 0.3357803118880838, 0.19725200694520026, 0.06916850877460093, 0.03502355265663937, 0.11668971050530672, 0.07033401629887522, -0.11382974251173436, 0.28470500819385053, 0.2491092022974044, 0.20467385854572057, 0.23845711797475816, -0.08745243474841118, -0.1214018615311943, 0.20467452215962112] |
1,802.0298 | Soft Gluon Resummation in Higgs Boson Plus Two Jet Production at the LHC | In this paper, the soft gluon resummation effect in the Higgs boson plus
two-jet production at the LHC is studied. By applying the transverse momentum
dependent factorization formalism, the large logarithms introduced by the small
total transverse momentum of the Higgs boson plus two-jet final state system,
are resummed to all orders in the expansion of the strong interaction coupling
at the accuracy of Next-to-Leading Logarithm. We also compare our result with
the prediction of the Monte Carlo event generator Pythia8, and found noticeable
difference in the distributions of the total transverse momentum and the
azimuthal angle correlations of the final state Higgs boson and two-jet system.
| hep-ph | in this paper the soft gluon resummation effect in the higgs boson plus twojet production at the lhc is studied by applying the transverse momentum dependent factorization formalism the large logarithms introduced by the small total transverse momentum of the higgs boson plus twojet final state system are resummed to all orders in the expansion of the strong interaction coupling at the accuracy of nexttoleading logarithm we also compare our result with the prediction of the monte carlo event generator pythia8 and found noticeable difference in the distributions of the total transverse momentum and the azimuthal angle correlations of the final state higgs boson and twojet system | [['in', 'this', 'paper', 'the', 'soft', 'gluon', 'resummation', 'effect', 'in', 'the', 'higgs', 'boson', 'plus', 'twojet', 'production', 'at', 'the', 'lhc', 'is', 'studied', 'by', 'applying', 'the', 'transverse', 'momentum', 'dependent', 'factorization', 'formalism', 'the', 'large', 'logarithms', 'introduced', 'by', 'the', 'small', 'total', 'transverse', 'momentum', 'of', 'the', 'higgs', 'boson', 'plus', 'twojet', 'final', 'state', 'system', 'are', 'resummed', 'to', 'all', 'orders', 'in', 'the', 'expansion', 'of', 'the', 'strong', 'interaction', 'coupling', 'at', 'the', 'accuracy', 'of', 'nexttoleading', 'logarithm', 'we', 'also', 'compare', 'our', 'result', 'with', 'the', 'prediction', 'of', 'the', 'monte', 'carlo', 'event', 'generator', 'pythia8', 'and', 'found', 'noticeable', 'difference', 'in', 'the', 'distributions', 'of', 'the', 'total', 'transverse', 'momentum', 'and', 'the', 'azimuthal', 'angle', 'correlations', 'of', 'the', 'final', 'state', 'higgs', 'boson', 'and', 'twojet', 'system']] | [-0.1156304055959787, 0.21655077968993894, -0.1221636193608604, 0.1700789852973039, -0.007791949710242938, -0.05166397801334926, -0.038522353442603394, 0.31879802716669636, -0.21249131428808948, -0.29990493081440434, -0.04875070909386344, -0.3090728008162195, 0.042400751158455825, 0.09222299578625744, 0.07878409625492364, 0.13435059771046182, 0.14109932332708736, -0.006943866564287308, -0.07551780503208393, -0.26075070560039415, 0.35782343450341825, 0.08748810123826299, 0.22857165624709608, 0.118903089001357, 0.13727449394640662, 0.1482527368945705, -0.07573952871564096, -0.04973144373186281, -0.11970722609173472, 0.035504232926694586, 0.17790888373959793, -0.040939847860380865, 0.15971570933089704, -0.2870341750823623, -0.06674215376864527, 0.06591267907713479, 0.15769725159533043, 0.10693372426871167, -0.007617073218451343, -0.2713536910155666, 0.06935119505962967, -0.33314084294948415, -0.11743942360071657, -0.08693969479836001, -0.042621020384341755, -0.026367446146557266, -0.30380931238112885, 0.1287463213353544, -0.01898481875710259, 0.01998462502096092, 0.03364162396195684, -0.1708841526937436, -0.1303611146438449, 0.017113552576205126, 0.1832506535368075, 0.10074181114889194, 0.15384027304858944, -0.22976709838530102, -0.21050762544847398, 0.325941163872447, -0.08863650671006224, -0.1703452225861566, 0.12006232986731508, -0.25462577594705277, -0.12633547694726943, 0.20371498230183235, 0.24272676919386765, 0.10655014489768683, -0.14932434592030455, 0.15481886768846329, 0.03356235132065262, 0.13657085888879808, 0.039854432212484775, 0.06406603367546591, 0.15943509543958667, 0.1428873844871245, -0.05187898184930053, 0.12718285887858996, -0.1311342888555237, -0.15150883377782096, -0.45593360296198143, -0.12011548422827635, -0.12251380843297517, 0.022338263686119676, -0.1311185893165568, -0.12065119658614222, 0.40089883943845595, 0.1240262652238152, 0.2669934420345926, 0.00854334897344288, 0.3619492787315084, 0.16165761139230786, 0.09270005553490787, 0.06589992962795023, 0.3261393848980699, 0.17008338823792674, 0.16534101071758806, -0.2906088138686789, 0.037182134088720675, 0.11441922794035245] |
1,802.02981 | NLO Higgs+jet at large transverse momenta including top quark mass
effects | We present a next-to-leading order calculation of H+jet in gluon fusion
including the effect of a finite top quark mass $m_t$ at large transverse
momenta. Using the recently published two-loop amplitudes in the high energy
expansion and our previous setup that includes finite $m_t$ effects in a low
energy expansion, we are able to obtain $m_t$-finite results for transverse
momenta below 225 GeV and above 500 GeV with negligible remaining top quark
mass uncertainty. The only remaining region that has to rely on the common
leading order rescaling approach is the threshold region $\sqrt{\hat s}\simeq
2m_t$. We demonstrate that this rescaling provides an excellent approximation
in the high $p_T$ region. Our calculation settles the issue of top quark mass
effects at large transverse momenta. It is implemented in the parton level
Monte Carlo code MCFM and is publicly available immediately in version 8.2.
| hep-ph | we present a nexttoleading order calculation of hjet in gluon fusion including the effect of a finite top quark mass m_t at large transverse momenta using the recently published twoloop amplitudes in the high energy expansion and our previous setup that includes finite m_t effects in a low energy expansion we are able to obtain m_tfinite results for transverse momenta below 225 gev and above 500 gev with negligible remaining top quark mass uncertainty the only remaining region that has to rely on the common leading order rescaling approach is the threshold region sqrthat ssimeq 2m_t we demonstrate that this rescaling provides an excellent approximation in the high p_t region our calculation settles the issue of top quark mass effects at large transverse momenta it is implemented in the parton level monte carlo code mcfm and is publicly available immediately in version 82 | [['we', 'present', 'a', 'nexttoleading', 'order', 'calculation', 'of', 'hjet', 'in', 'gluon', 'fusion', 'including', 'the', 'effect', 'of', 'a', 'finite', 'top', 'quark', 'mass', 'm_t', 'at', 'large', 'transverse', 'momenta', 'using', 'the', 'recently', 'published', 'twoloop', 'amplitudes', 'in', 'the', 'high', 'energy', 'expansion', 'and', 'our', 'previous', 'setup', 'that', 'includes', 'finite', 'm_t', 'effects', 'in', 'a', 'low', 'energy', 'expansion', 'we', 'are', 'able', 'to', 'obtain', 'm_tfinite', 'results', 'for', 'transverse', 'momenta', 'below', '225', 'gev', 'and', 'above', '500', 'gev', 'with', 'negligible', 'remaining', 'top', 'quark', 'mass', 'uncertainty', 'the', 'only', 'remaining', 'region', 'that', 'has', 'to', 'rely', 'on', 'the', 'common', 'leading', 'order', 'rescaling', 'approach', 'is', 'the', 'threshold', 'region', 'sqrthat', 'ssimeq', '2m_t', 'we', 'demonstrate', 'that', 'this', 'rescaling', 'provides', 'an', 'excellent', 'approximation', 'in', 'the', 'high', 'p_t', 'region', 'our', 'calculation', 'settles', 'the', 'issue', 'of', 'top', 'quark', 'mass', 'effects', 'at', 'large', 'transverse', 'momenta', 'it', 'is', 'implemented', 'in', 'the', 'parton', 'level', 'monte', 'carlo', 'code', 'mcfm', 'and', 'is', 'publicly', 'available', 'immediately', 'in', 'version', '82']] | [-0.07827800402129201, 0.21816937126062275, -0.09199950020616009, 0.1138215500084211, -0.055218395188411463, -0.06398665639047156, 0.05422408346736043, 0.375377674350961, -0.14495178363220373, -0.3182875677733354, 0.021453294848931402, -0.3074895163578257, 0.06003763468306459, 0.1696234788748921, 0.02754089802369954, 0.07802946959346743, 0.11810614441728062, 0.0005995926453771306, -0.07458710397407577, -0.23786745114911112, 0.28961632194154907, 0.09593179313675829, 0.24805452126983396, 0.18453352183142913, 0.12312134292671903, 0.03476259025456515, -0.041542759873497655, -0.06144405292793059, -0.14601525676211885, 0.017333840433193345, 0.2152287715469638, -0.023719025762672995, 0.20063020636714524, -0.2803531080143343, -0.11610944069344813, 0.04888819994299974, 0.1521827273306922, 0.1218720596860832, -0.04598000124965886, -0.21080895180774617, 0.1346487803647006, -0.27768930897090427, -0.1619869922878037, -0.09235105766508152, -0.04099465993521604, -0.060392823478561154, -0.29946731924223646, 0.1339913741865812, -0.023723033952041412, 0.020930140108709604, 0.027568371897615806, -0.20722399097473793, -0.06977688376857362, 0.05353627836948235, 0.06912007582993705, 0.10673420187057173, 0.13978929575335916, -0.14346298356835638, -0.11012295771941123, 0.3573635678171036, -0.06590258314202106, -0.16661186698614291, 0.12951657753175413, -0.22708420541045637, -0.14290720768745097, 0.18025210618310358, 0.2116945434433841, 0.11801197729688334, -0.1808161253903166, 0.1380667750119858, -0.00884476010556477, 0.18624030871474198, 0.07360977381402233, 0.016756045477937014, 0.15932903237621182, 0.1888008968745568, -0.013961252956454394, 0.10566170265550502, -0.1296382332860138, -0.11860906103999734, -0.39125509505015865, -0.06270683618446052, -0.1226103093731709, 0.023397566098883802, -0.11701343358056963, -0.1190419369348502, 0.35832322401348765, 0.1717781369692423, 0.24328455434043064, 0.046411101862912814, 0.3462138044701981, 0.11793412869094386, 0.12624237800843385, 0.15086343039652542, 0.26829202031851157, 0.1377665351807389, 0.13586340042185302, -0.19666724066368083, -0.012398292215436067, 0.08343883167827686] |
1,802.02982 | Ricci-flat cubic graphs with girth five | We classify all connected, simple, 3-regular graphs with girth at least 5
that are Ricci-flat. We use the definition of Ricci curvature on graphs given
in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct.
Anal., 2009. A graph is Ricci-flat, if it has vanishing Ricci curvature on all
edges. We show, that the only Ricci-flat cubic graphs with girth at least 5 are
the Petersen graph, the Triplex and the dodecahedral graph. This will correct
the classification in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the
Triplex.
| math.CO | we classify all connected simple 3regular graphs with girth at least 5 that are ricciflat we use the definition of ricci curvature on graphs given in linluyau tohoku math 2011 which is a variation of ollivier j funct anal 2009 a graph is ricciflat if it has vanishing ricci curvature on all edges we show that the only ricciflat cubic graphs with girth at least 5 are the petersen graph the triplex and the dodecahedral graph this will correct the classification in linluyau comm anal geom 2014 that misses the triplex | [['we', 'classify', 'all', 'connected', 'simple', '3regular', 'graphs', 'with', 'girth', 'at', 'least', '5', 'that', 'are', 'ricciflat', 'we', 'use', 'the', 'definition', 'of', 'ricci', 'curvature', 'on', 'graphs', 'given', 'in', 'linluyau', 'tohoku', 'math', '2011', 'which', 'is', 'a', 'variation', 'of', 'ollivier', 'j', 'funct', 'anal', '2009', 'a', 'graph', 'is', 'ricciflat', 'if', 'it', 'has', 'vanishing', 'ricci', 'curvature', 'on', 'all', 'edges', 'we', 'show', 'that', 'the', 'only', 'ricciflat', 'cubic', 'graphs', 'with', 'girth', 'at', 'least', '5', 'are', 'the', 'petersen', 'graph', 'the', 'triplex', 'and', 'the', 'dodecahedral', 'graph', 'this', 'will', 'correct', 'the', 'classification', 'in', 'linluyau', 'comm', 'anal', 'geom', '2014', 'that', 'misses', 'the', 'triplex']] | [-0.18355209231990707, 0.06428145162075512, -0.04104451101355173, -0.004117335647006857, -0.14446994927353585, -0.12623637629120232, -0.0650147840196451, 0.4004108240561826, -0.15367845695588614, -0.3381083292252087, 0.14659024367318743, -0.3675283030248605, -0.19550309259608223, 0.0625035337346432, -0.1824515915813518, -0.03134087004422487, 0.1354260004309753, 0.033225234904950794, 0.004521831396742017, -0.36962847819949685, 0.30030970120863926, 0.014074339152692439, 0.168059242867857, 0.1309060946536752, 0.11025307213396325, 0.0006217186001467181, -0.013809374835505917, 0.05062949789462836, -0.2174064003552053, 0.06445440022622818, 0.25696177525793784, 0.07175484388698261, 0.20657419108345612, -0.306335948243901, -0.20203070847604138, 0.20549584278366068, 0.005956677003548696, 0.04529533971607644, 0.08425981466719819, -0.28024162472850017, 0.14853614239229382, -0.08583948216759242, -0.0874608737419124, -0.051451819037998114, 0.1394954004048646, -0.029940235060076793, -0.1845737168217426, 0.10659986467274664, 0.18157016981270288, 0.08160444305042971, 0.047370421121940835, -0.1782042849604245, -0.14105455239129427, 0.03057865414686583, -0.08192363264202908, 0.07669153144828729, -0.0212700402077574, -0.04630575978176689, -0.18659175321418833, 0.3090037104141499, -0.03594088717107917, -0.12507031606651003, 0.15758586010721687, -0.11800063671646538, -0.22981416435712682, 0.1263293107910143, 0.17980889500640743, 0.17396216654054986, -0.08887704696946337, 0.17790279572683765, -0.09878299713830699, 0.12036856728002102, 0.26196134392335846, -0.10785336648676913, 0.04793644207273866, 0.08338824008683582, 0.1549767996286871, 0.07967590144579555, -0.0030567189013319357, -0.00013201509776351216, -0.3406026119437928, -0.1443980528416872, -0.2333151821973273, 0.16734367300971195, -0.17904112189685142, -0.15537830831094102, 0.42938698343113885, 0.0404897965490818, 0.13289610542111344, 0.13610796049457288, 0.1310865269707782, -0.005380087434877078, 0.0012551167734212929, 0.3396775106295616, 0.23681612506222266, 0.22668361741599147, 0.08833529936804713, -0.08767071035230062, -0.07048215922531109, 0.1747920956964103] |
1,802.02983 | A third-order class-D amplifier with and without ripple compensation | We analyse the nonlinear behaviour of a third-order class-D amplifier, and
demonstrate the remarkable effectiveness of the recently introduced ripple
compensation (RC) technique in reducing the audio distortion of the device. The
amplifier converts an input audio signal to a high-frequency train of
rectangular pulses, whose widths are modulated according to the input signal
(pulse-width modulation) and employs negative feedback. After determining the
steady-state operating point for constant input and calculating its stability,
we derive a small-signal model (SSM), which yields in closed form the transfer
function relating (infinitesimal) input and output disturbances. This SSM shows
how the RC technique is able to linearise the small-signal response of the
device. We extend this SSM through a fully nonlinear perturbation calculation
of the dynamics of the amplifier, based on the disparity in time scales between
the pulse train and the audio signal. We obtain the nonlinear response of the
amplifier to a general audio signal, avoiding the linearisation inherent in the
SSM; we thereby more precisely quantify the reduction in distortion achieved
through RC. Finally, simulations corroborate our theoretical predictions and
illustrate the dramatic deterioration in performance that occurs when the
amplifier is operated in an unstable regime. The perturbation calculation is
rather general, and may be adapted to quantify the way in which other nonlinear
negative-feedback pulse-modulated devices track a time-varying input signal
that slowly modulates the system parameters.
| eess.SP | we analyse the nonlinear behaviour of a thirdorder classd amplifier and demonstrate the remarkable effectiveness of the recently introduced ripple compensation rc technique in reducing the audio distortion of the device the amplifier converts an input audio signal to a highfrequency train of rectangular pulses whose widths are modulated according to the input signal pulsewidth modulation and employs negative feedback after determining the steadystate operating point for constant input and calculating its stability we derive a smallsignal model ssm which yields in closed form the transfer function relating infinitesimal input and output disturbances this ssm shows how the rc technique is able to linearise the smallsignal response of the device we extend this ssm through a fully nonlinear perturbation calculation of the dynamics of the amplifier based on the disparity in time scales between the pulse train and the audio signal we obtain the nonlinear response of the amplifier to a general audio signal avoiding the linearisation inherent in the ssm we thereby more precisely quantify the reduction in distortion achieved through rc finally simulations corroborate our theoretical predictions and illustrate the dramatic deterioration in performance that occurs when the amplifier is operated in an unstable regime the perturbation calculation is rather general and may be adapted to quantify the way in which other nonlinear negativefeedback pulsemodulated devices track a timevarying input signal that slowly modulates the system parameters | [['we', 'analyse', 'the', 'nonlinear', 'behaviour', 'of', 'a', 'thirdorder', 'classd', 'amplifier', 'and', 'demonstrate', 'the', 'remarkable', 'effectiveness', 'of', 'the', 'recently', 'introduced', 'ripple', 'compensation', 'rc', 'technique', 'in', 'reducing', 'the', 'audio', 'distortion', 'of', 'the', 'device', 'the', 'amplifier', 'converts', 'an', 'input', 'audio', 'signal', 'to', 'a', 'highfrequency', 'train', 'of', 'rectangular', 'pulses', 'whose', 'widths', 'are', 'modulated', 'according', 'to', 'the', 'input', 'signal', 'pulsewidth', 'modulation', 'and', 'employs', 'negative', 'feedback', 'after', 'determining', 'the', 'steadystate', 'operating', 'point', 'for', 'constant', 'input', 'and', 'calculating', 'its', 'stability', 'we', 'derive', 'a', 'smallsignal', 'model', 'ssm', 'which', 'yields', 'in', 'closed', 'form', 'the', 'transfer', 'function', 'relating', 'infinitesimal', 'input', 'and', 'output', 'disturbances', 'this', 'ssm', 'shows', 'how', 'the', 'rc', 'technique', 'is', 'able', 'to', 'linearise', 'the', 'smallsignal', 'response', 'of', 'the', 'device', 'we', 'extend', 'this', 'ssm', 'through', 'a', 'fully', 'nonlinear', 'perturbation', 'calculation', 'of', 'the', 'dynamics', 'of', 'the', 'amplifier', 'based', 'on', 'the', 'disparity', 'in', 'time', 'scales', 'between', 'the', 'pulse', 'train', 'and', 'the', 'audio', 'signal', 'we', 'obtain', 'the', 'nonlinear', 'response', 'of', 'the', 'amplifier', 'to', 'a', 'general', 'audio', 'signal', 'avoiding', 'the', 'linearisation', 'inherent', 'in', 'the', 'ssm', 'we', 'thereby', 'more', 'precisely', 'quantify', 'the', 'reduction', 'in', 'distortion', 'achieved', 'through', 'rc', 'finally', 'simulations', 'corroborate', 'our', 'theoretical', 'predictions', 'and', 'illustrate', 'the', 'dramatic', 'deterioration', 'in', 'performance', 'that', 'occurs', 'when', 'the', 'amplifier', 'is', 'operated', 'in', 'an', 'unstable', 'regime', 'the', 'perturbation', 'calculation', 'is', 'rather', 'general', 'and', 'may', 'be', 'adapted', 'to', 'quantify', 'the', 'way', 'in', 'which', 'other', 'nonlinear', 'negativefeedback', 'pulsemodulated', 'devices', 'track', 'a', 'timevarying', 'input', 'signal', 'that', 'slowly', 'modulates', 'the', 'system', 'parameters']] | [-0.12400940516320254, 0.07564938905061194, -0.0786918445241131, 0.03722237237257344, -0.06860715729029228, -0.15585522168201574, 0.04184913859940583, 0.3772099089661711, -0.28224490487768333, -0.2814895787752201, 0.08051896031962283, -0.2543495439264613, -0.18486131471581757, 0.21656339416451947, -0.07257837484276183, 0.08188462018912551, 0.03825000128434017, 0.019910507638869285, -0.05544738639595412, -0.16791068524757416, 0.24686881733227015, 0.08466404120094682, 0.33345329539805424, -0.011396014985317985, 0.13643898323827766, 0.002734854818411629, -0.02307108264383778, -0.04885985007272291, -0.08587790131429772, 0.062103210966789016, 0.23139913649535165, 0.08354876298874028, 0.2593115561993041, -0.43332501609703494, -0.23025812142428517, 0.06230435158808209, 0.11679735089848309, 0.1465099777029664, -0.05303973058781004, -0.2616092212796375, 0.08410547179651953, -0.14990949556190653, -0.07930761354758656, -0.060716479628657304, -0.008227702034147162, 0.03553883161527681, -0.3129054572879492, 0.04494348949581189, 0.09006964436348266, 0.016420928326337354, -0.03963536882994895, -0.03433258418111731, -0.016936233452022924, 0.1316262662489623, -0.004947195247759258, 0.005449284840244473, 0.1514778856592449, -0.12624367758766503, -0.06171487877579414, 0.3386026132451534, -0.12613787293549536, -0.1997691464463347, 0.11595581060177401, -0.11934101900388078, -0.0346232559225571, 0.1502281764048364, 0.20599466464135044, 0.054274047417397685, -0.1380570461647917, 0.031175678496079502, 0.035733204841483054, 0.2318688304672322, 0.09236864124837316, 0.021357856234923627, 0.15314334953916586, 0.21026626540441884, 0.03618325717265211, 0.20086471883865, -0.10559286067674341, -0.06335587878333683, -0.2890896444217089, -0.07668717235343106, -0.13878495831822715, 0.023930344584075277, -0.09731015643640269, -0.15192154622248685, 0.46822571291551485, 0.197835252594431, 0.19757288562852823, 0.04783719978111453, 0.3749270090769993, 0.1860766065528559, 0.046759595324514076, 0.02566029888418454, 0.2717037766828741, 0.15787635040734976, 0.11734819211670312, -0.27709101678562564, 0.059226306322798655, 0.015211649290122614] |
1,802.02984 | Distribution of velocity gradient orientations: Mapping magnetization
with the Velocity Gradient Technique | Recent developments of the Velocity Gradient Technique (VGT) show that the
velocity gradients provide a reliable tracing of magnetic field direction in
turbulent plasmas. In this paper, we explore the ability of velocity gradients
to measure the magnetization of interstellar medium. We demonstrate that the
distribution of velocity gradient orientations provides a reliable estimation
of the magnetization of the media. In particular, we determine the relation
between Alfvenic Mach number $M_A$ in the range of $M_A \in [0.2,1.7]$ and
properties of the velocity gradient distribution, namely, with the dispersion
of velocity gradient orientation as well as with the peak to base ratio of the
amplitudes. We apply our technique for a selected GALFA-HI region and find the
results consistent with the expected behavior of $M_A$. Using 3D MHD
simulations we successfully compare the results with our new measure of
magnetization that is based on the dispersion of starlight polarization. We
demonstrate that, combined with the velocity dispersion along the line of sight
direction, our technique is capable to delivering the magnetic field strength.
The new technique opens a way to measure magnetization using other gradient
measures such as synchrotron intensity gradients (SIGs) and synchrotron
polarization gradients (SPGs).
| astro-ph.GA astro-ph.IM | recent developments of the velocity gradient technique vgt show that the velocity gradients provide a reliable tracing of magnetic field direction in turbulent plasmas in this paper we explore the ability of velocity gradients to measure the magnetization of interstellar medium we demonstrate that the distribution of velocity gradient orientations provides a reliable estimation of the magnetization of the media in particular we determine the relation between alfvenic mach number m_a in the range of m_a in 0217 and properties of the velocity gradient distribution namely with the dispersion of velocity gradient orientation as well as with the peak to base ratio of the amplitudes we apply our technique for a selected galfahi region and find the results consistent with the expected behavior of m_a using 3d mhd simulations we successfully compare the results with our new measure of magnetization that is based on the dispersion of starlight polarization we demonstrate that combined with the velocity dispersion along the line of sight direction our technique is capable to delivering the magnetic field strength the new technique opens a way to measure magnetization using other gradient measures such as synchrotron intensity gradients sigs and synchrotron polarization gradients spgs | [['recent', 'developments', 'of', 'the', 'velocity', 'gradient', 'technique', 'vgt', 'show', 'that', 'the', 'velocity', 'gradients', 'provide', 'a', 'reliable', 'tracing', 'of', 'magnetic', 'field', 'direction', 'in', 'turbulent', 'plasmas', 'in', 'this', 'paper', 'we', 'explore', 'the', 'ability', 'of', 'velocity', 'gradients', 'to', 'measure', 'the', 'magnetization', 'of', 'interstellar', 'medium', 'we', 'demonstrate', 'that', 'the', 'distribution', 'of', 'velocity', 'gradient', 'orientations', 'provides', 'a', 'reliable', 'estimation', 'of', 'the', 'magnetization', 'of', 'the', 'media', 'in', 'particular', 'we', 'determine', 'the', 'relation', 'between', 'alfvenic', 'mach', 'number', 'm_a', 'in', 'the', 'range', 'of', 'm_a', 'in', '0217', 'and', 'properties', 'of', 'the', 'velocity', 'gradient', 'distribution', 'namely', 'with', 'the', 'dispersion', 'of', 'velocity', 'gradient', 'orientation', 'as', 'well', 'as', 'with', 'the', 'peak', 'to', 'base', 'ratio', 'of', 'the', 'amplitudes', 'we', 'apply', 'our', 'technique', 'for', 'a', 'selected', 'galfahi', 'region', 'and', 'find', 'the', 'results', 'consistent', 'with', 'the', 'expected', 'behavior', 'of', 'm_a', 'using', '3d', 'mhd', 'simulations', 'we', 'successfully', 'compare', 'the', 'results', 'with', 'our', 'new', 'measure', 'of', 'magnetization', 'that', 'is', 'based', 'on', 'the', 'dispersion', 'of', 'starlight', 'polarization', 'we', 'demonstrate', 'that', 'combined', 'with', 'the', 'velocity', 'dispersion', 'along', 'the', 'line', 'of', 'sight', 'direction', 'our', 'technique', 'is', 'capable', 'to', 'delivering', 'the', 'magnetic', 'field', 'strength', 'the', 'new', 'technique', 'opens', 'a', 'way', 'to', 'measure', 'magnetization', 'using', 'other', 'gradient', 'measures', 'such', 'as', 'synchrotron', 'intensity', 'gradients', 'sigs', 'and', 'synchrotron', 'polarization', 'gradients', 'spgs']] | [-0.11871596338253393, 0.11592493984383781, -0.09248870385451441, 0.00831041922367315, -0.0900748280056653, -0.016415641082895133, 0.012604269856790336, 0.44527130367395085, -0.2628380620880478, -0.3199227896263719, 0.010003316371588198, -0.22437657591258056, -0.07432599676605126, 0.2525506246040769, 0.014511231698070979, 0.03014376108445402, -0.0016762013807136394, -0.03151552461966432, -0.047457623133568216, -0.1684906627642473, 0.3001743105292169, 0.05782612150317521, 0.3126709207722227, 0.037620855013126044, 0.1184144261973286, -0.031016157228537473, -0.02378006946404233, 0.07101125334895353, -0.12578416713658214, 0.11744843605849041, 0.15265660321926178, 0.08505269535462641, 0.22017609354505685, -0.37293907242169994, -0.23562937129943673, 0.03340473404593841, 0.16005888652188827, 0.10725902638937049, -0.08579786109967337, -0.24753481796871737, 0.06352821206153952, -0.12119097412956245, -0.20536427173130026, -0.055080382980708845, -0.004892472041827546, 0.10192101027669981, -0.28169081944423885, 0.13436708440720505, -0.005359760821834774, 0.09195008023930383, -0.07277757780824973, -0.10780596976088086, -0.05705200567094581, 0.07529567193469212, 0.07610865750203505, 0.09148193542375159, 0.1700946666249476, -0.13923508854615999, -0.05555974010869785, 0.37118220722969375, -0.137675493807877, -0.1409862627355656, 0.15198914186679166, -0.1992849924845082, -0.09541641674500885, 0.10852704991629054, 0.19897553253786515, 0.12810180503118612, -0.08898804387370796, 0.007149813172282169, -0.04273483998775671, 0.17037905224830593, 0.025717677087593958, 0.005750410439006909, 0.22140460655206654, 0.10990302121919121, 0.09696055054759162, 0.12230354124180226, -0.2291411427570611, -0.030743149989686414, -0.2751951111092937, -0.17711650809098206, -0.14070651342390283, 0.004994105044185056, -0.13106985775693875, -0.14075152605398544, 0.3768043138186074, 0.22872460884784307, 0.23003244147692728, 0.06784268502656579, 0.34886224976821145, 0.10976995347625562, 0.04974160087353971, 0.12216766218555533, 0.2828567592382223, 0.2361891435572717, 0.14527916223482054, -0.2706181285335555, 0.07061387375198058, 0.019291018860338984] |
1,802.02985 | Gauged And Ungauged: A Nonperturbative Test | We study the thermodynamics of the `ungauged' D0-brane matrix model by Monte
Carlo simulation. Our results appear to be consistent with the conjecture by
Maldacena and Milekhin.
| hep-th hep-lat | we study the thermodynamics of the ungauged d0brane matrix model by monte carlo simulation our results appear to be consistent with the conjecture by maldacena and milekhin | [['we', 'study', 'the', 'thermodynamics', 'of', 'the', 'ungauged', 'd0brane', 'matrix', 'model', 'by', 'monte', 'carlo', 'simulation', 'our', 'results', 'appear', 'to', 'be', 'consistent', 'with', 'the', 'conjecture', 'by', 'maldacena', 'and', 'milekhin']] | [-0.0318916764540168, 0.11964701959648384, -0.09618525056598279, 0.08048699137109977, 0.0351791914839011, -0.12951617207951271, 0.008830234909859987, 0.3076829888786261, -0.1571655608713627, -0.3223656047708713, 0.11159610373970981, -0.33824151911092204, -0.17251959185187632, 0.13671243562398908, -0.021814541031534854, 0.08120418848613134, 0.10764196081660114, -0.07672682476158325, -0.10161501387707315, -0.29346134370336163, 0.2927430826239288, 0.16797316332276052, 0.2576963903668981, 0.056091384460719734, 0.05324159184685694, 0.04877649625548376, -0.024036773623755343, 0.038979457619671636, -0.20551982966180032, 0.09493450552690774, 0.2223660397486618, 0.12185142719401763, 0.12117378284724858, -0.4701495978694696, -0.24402556741216147, 0.05753057836913145, 0.12041856201652151, 0.19355388000034368, -0.05300021554844884, -0.344196199439466, 0.09910220201485433, -0.2481593951367988, -0.19801885613168663, -0.11288527486165269, -0.11619431668749222, -0.06301735464232759, -0.24505663534196523, 0.13543615995261532, -0.010825431260925073, -0.0064222067952729184, -0.03413493947412532, -0.06994285387918353, -0.07193057592779112, 0.02889648538369399, 0.13374923526918372, 0.06407664838927583, 0.08586425235709892, -0.08628581507274738, -0.23060859223971, 0.28034481778740883, -0.035416095660856135, -0.21928195465499392, 0.15055926837241992, -0.19320080769606507, -0.15974602710384017, 0.09505587773254284, 0.052818960402734004, 0.19735183462930414, -0.14064036435089433, 0.1533146089350339, -0.12737110264312762, 0.10361751244188501, -0.04501158045604825, -0.10807992675556587, 0.24276559413052523, 0.13950750095626482, -0.09039624139236715, 0.19348650214781699, -0.004171783471694932, -0.24706670613243029, -0.32988413910453135, -0.15103475450394818, -0.20027436595410109, 0.10004278447908851, -0.15848538635887402, -0.1258657555310772, 0.29876952797461015, 0.23657882360454935, 0.13965156789009386, 0.134941022305821, 0.21602953830733895, 0.09842579591965589, 0.016898901345065005, 0.07942349442209189, 0.24294135622823468, 0.2226226883761298, 0.06360236662798203, -0.31188652420846313, -0.05331714409448278, 0.20047418579745752] |
1,802.02986 | Cognitive Business Process Management for Adaptive Cyber-Physical
Processes | In the era of Big Data and Internet-of-Things (IoT), all real-world
environments are gradually becoming cyber-physical (e.g., emergency management,
healthcare, smart manufacturing, etc.), with the presence of connected devices
and embedded ICT systems (e.g., smartphones, sensors, actuators) producing huge
amounts of data and events that influence the enactment of the Cyber Physical
Processes (CPPs) enacted in such environments. A Process Management System
(PMS) employed for executing CPPs is required to automatically adapt its
running processes to anomalous situations and exogenous events by minimising
any human intervention at run-time. In this paper, we tackle this issue by
introducing an approach and an adaptive Cognitive PMS that combines process
execution monitoring, unanticipated exception detection and automated
resolution strategies leveraging on well-established action-based formalisms in
Artificial Intelligence, which allow to interpret the ever-changing knowledge
of cyber-physical environments and to adapt CPPs by preserving their base
structure.
| cs.SE | in the era of big data and internetofthings iot all realworld environments are gradually becoming cyberphysical eg emergency management healthcare smart manufacturing etc with the presence of connected devices and embedded ict systems eg smartphones sensors actuators producing huge amounts of data and events that influence the enactment of the cyber physical processes cpps enacted in such environments a process management system pms employed for executing cpps is required to automatically adapt its running processes to anomalous situations and exogenous events by minimising any human intervention at runtime in this paper we tackle this issue by introducing an approach and an adaptive cognitive pms that combines process execution monitoring unanticipated exception detection and automated resolution strategies leveraging on wellestablished actionbased formalisms in artificial intelligence which allow to interpret the everchanging knowledge of cyberphysical environments and to adapt cpps by preserving their base structure | [['in', 'the', 'era', 'of', 'big', 'data', 'and', 'internetofthings', 'iot', 'all', 'realworld', 'environments', 'are', 'gradually', 'becoming', 'cyberphysical', 'eg', 'emergency', 'management', 'healthcare', 'smart', 'manufacturing', 'etc', 'with', 'the', 'presence', 'of', 'connected', 'devices', 'and', 'embedded', 'ict', 'systems', 'eg', 'smartphones', 'sensors', 'actuators', 'producing', 'huge', 'amounts', 'of', 'data', 'and', 'events', 'that', 'influence', 'the', 'enactment', 'of', 'the', 'cyber', 'physical', 'processes', 'cpps', 'enacted', 'in', 'such', 'environments', 'a', 'process', 'management', 'system', 'pms', 'employed', 'for', 'executing', 'cpps', 'is', 'required', 'to', 'automatically', 'adapt', 'its', 'running', 'processes', 'to', 'anomalous', 'situations', 'and', 'exogenous', 'events', 'by', 'minimising', 'any', 'human', 'intervention', 'at', 'runtime', 'in', 'this', 'paper', 'we', 'tackle', 'this', 'issue', 'by', 'introducing', 'an', 'approach', 'and', 'an', 'adaptive', 'cognitive', 'pms', 'that', 'combines', 'process', 'execution', 'monitoring', 'unanticipated', 'exception', 'detection', 'and', 'automated', 'resolution', 'strategies', 'leveraging', 'on', 'wellestablished', 'actionbased', 'formalisms', 'in', 'artificial', 'intelligence', 'which', 'allow', 'to', 'interpret', 'the', 'everchanging', 'knowledge', 'of', 'cyberphysical', 'environments', 'and', 'to', 'adapt', 'cpps', 'by', 'preserving', 'their', 'base', 'structure']] | [-0.15648200258391198, 0.09948273614831302, -0.02888675238872012, 0.03996917845733106, -0.1241541334152348, -0.14658623004423363, 0.066517485664682, 0.3887205327945677, -0.2496266787826129, -0.38491800915892727, 0.11801441696104496, -0.28123554929934597, -0.1830282174050808, 0.18317149672331615, -0.19811592339635728, 0.08436866959848383, 0.05847475837942187, -0.032233726983837835, 0.06572807824582683, -0.22365808532690512, 0.3026621455613237, 0.06244007932426004, 0.30943774176155825, 0.019460409117693252, 0.09829543058278521, 0.021748334226374337, -0.06665257043270328, -0.061101146529174664, -0.02349528917947937, 0.1582603035755195, 0.39114179219269046, 0.2392966065887961, 0.3398803999823342, -0.5072007903868293, -0.23320854726814097, 0.12526504267528132, 0.14621185034312392, 0.0049158824677741925, -0.049417106544605446, -0.34137589599077517, 0.09246742581440644, -0.23870627024337987, -0.133128554600847, -0.09667712633035608, 0.01587885145384532, 0.010263442757484092, -0.2524137996040265, -0.0425364859727817, 0.02863830441635076, 0.12214052147505532, -0.06857492869373466, -0.034017860497856, 0.015413131776519796, 0.20145437461030963, 0.02712985595575879, -0.034845858248979684, 0.26086211158939593, -0.18047955299327084, -0.1705757748511444, 0.369963570786119, 0.05192872752285712, -0.1301830576902086, 0.22381964465440413, 7.488307057899403e-05, -0.1816107636721401, 0.08228154852009424, 0.267557022818755, 0.06605878604862553, -0.23517769814177475, 0.04993492907110172, 0.14973028676284778, 0.16967973638923475, 0.027918196343523743, 0.03744067278384537, 0.19952274761260388, 0.2423988550736966, 0.09078353916464205, 0.07334793673606811, -0.03220333754397616, -0.11306621770250734, -0.18407676741480827, -0.13718711032200007, -0.12419864738936426, 0.02426499321933028, -0.09830420530086523, -0.15423113084886667, 0.29852401088008174, 0.24014284298266772, 0.12744869622792657, 0.023864672026740245, 0.41082681146274497, 0.037568546796601814, 0.12596079753549, 0.11036159952783345, 0.11521350786210383, -0.02084839613489494, 0.23370174561477416, -0.18678052291287095, 0.16638347320584254, -0.07580306752050829] |
1,802.02987 | A Generalization Method of Partitioned Activation Function for Complex
Number | A method to convert real number partitioned activation function into complex
number one is provided. The method has 4em variations; 1 has potential to get
holomorphic activation, 2 has potential to conserve complex angle, and the last
1 guarantees interaction between real and imaginary parts. The method has been
applied to LReLU and SELU as examples. The complex number activation function
is an building block of complex number ANN, which has potential to properly
deal with complex number problems. But the complex activation is not well
established yet. Therefore, we propose a way to extend the partitioned real
activation to complex number.
| cs.NE cs.AI math.CV | a method to convert real number partitioned activation function into complex number one is provided the method has 4em variations 1 has potential to get holomorphic activation 2 has potential to conserve complex angle and the last 1 guarantees interaction between real and imaginary parts the method has been applied to lrelu and selu as examples the complex number activation function is an building block of complex number ann which has potential to properly deal with complex number problems but the complex activation is not well established yet therefore we propose a way to extend the partitioned real activation to complex number | [['a', 'method', 'to', 'convert', 'real', 'number', 'partitioned', 'activation', 'function', 'into', 'complex', 'number', 'one', 'is', 'provided', 'the', 'method', 'has', '4em', 'variations', '1', 'has', 'potential', 'to', 'get', 'holomorphic', 'activation', '2', 'has', 'potential', 'to', 'conserve', 'complex', 'angle', 'and', 'the', 'last', '1', 'guarantees', 'interaction', 'between', 'real', 'and', 'imaginary', 'parts', 'the', 'method', 'has', 'been', 'applied', 'to', 'lrelu', 'and', 'selu', 'as', 'examples', 'the', 'complex', 'number', 'activation', 'function', 'is', 'an', 'building', 'block', 'of', 'complex', 'number', 'ann', 'which', 'has', 'potential', 'to', 'properly', 'deal', 'with', 'complex', 'number', 'problems', 'but', 'the', 'complex', 'activation', 'is', 'not', 'well', 'established', 'yet', 'therefore', 'we', 'propose', 'a', 'way', 'to', 'extend', 'the', 'partitioned', 'real', 'activation', 'to', 'complex', 'number']] | [-0.09980971307726577, 0.05893944263123558, -0.046788658224977554, 0.04158413639175706, -0.1255734953400679, -0.1520001305732876, -0.019533952912315727, 0.39833764303475616, -0.3001545909931883, -0.3537226905953139, 0.06700862717349082, -0.25844537544995544, -0.21232405442860908, 0.1950573953439016, -0.042036858685314656, 0.06810389267280698, 0.008915976998396217, 0.07262261400930584, 0.019928337819874287, -0.2796238947659731, 0.30351033485494555, -0.00821912968531251, 0.2079072213731706, 0.09113020482938737, 0.11039516624063253, 0.00848141497001052, 0.017886674697510898, 0.027825855910778047, -0.017366378091974184, 0.11443308891030028, 0.2546230559895048, 0.13700401448411867, 0.3113043280132115, -0.4271097787283361, -0.27036991209723055, 0.21012989774346352, 0.17775531413033605, 0.04877948833513074, -0.026611413934733718, -0.21339567746035754, 0.11790355444769375, -0.14038318038219585, -0.1157873657066375, -0.15629900119267404, 0.07640761227346957, 0.011265095341950655, -0.2789600078156218, -0.0015421925019472838, -0.014415389233035966, 0.0316429849807173, -0.040478063558693975, -0.13997562507167458, -0.017618620556313545, 0.16873829800169915, 0.0325022351113148, 0.08541711962781846, 0.12307813108898699, -0.0579579235962592, -0.06600587873253971, 0.33239914271049203, 0.016359971491619944, -0.2795092685893178, 0.22557426996529104, -0.08700540030840784, -0.10987007272429765, 0.16838197068776936, 0.19323398272506892, 0.07131673198193311, -0.10294159586541354, 0.0987391583371209, -0.004597432808950543, 0.1567116062436253, 0.05381392127834261, -0.05781881207600236, 0.1096044911351055, 0.1746278748102486, 0.09206042625941337, 0.13357308273669333, -0.07486900962889194, -0.09791858002310619, -0.2363259798195213, -0.16838283588178457, -0.22283933132421224, 0.05445801832494908, -0.039965433184552236, -0.18940612231381238, 0.4331100831925869, 0.07983012626878917, 0.26978821551427246, 0.0650242540158797, 0.30360230228863655, 0.15061387736233883, 0.12958848189562558, 0.022005608794279395, 0.1586918062879704, 0.15879942909348757, 0.09372405591420829, -0.14419939586427064, 0.05658662931062281, 0.05158832278102636] |
1,802.02988 | Stochastic subgradient method converges at the rate $O(k^{-1/4})$ on
weakly convex functions | We prove that the proximal stochastic subgradient method, applied to a weakly
convex problem, drives the gradient of the Moreau envelope to zero at the rate
$O(k^{-1/4})$. As a consequence, we resolve an open question on the convergence
rate of the proximal stochastic gradient method for minimizing the sum of a
smooth nonconvex function and a convex proximable function.
| math.OC cs.LG | we prove that the proximal stochastic subgradient method applied to a weakly convex problem drives the gradient of the moreau envelope to zero at the rate ok14 as a consequence we resolve an open question on the convergence rate of the proximal stochastic gradient method for minimizing the sum of a smooth nonconvex function and a convex proximable function | [['we', 'prove', 'that', 'the', 'proximal', 'stochastic', 'subgradient', 'method', 'applied', 'to', 'a', 'weakly', 'convex', 'problem', 'drives', 'the', 'gradient', 'of', 'the', 'moreau', 'envelope', 'to', 'zero', 'at', 'the', 'rate', 'ok14', 'as', 'a', 'consequence', 'we', 'resolve', 'an', 'open', 'question', 'on', 'the', 'convergence', 'rate', 'of', 'the', 'proximal', 'stochastic', 'gradient', 'method', 'for', 'minimizing', 'the', 'sum', 'of', 'a', 'smooth', 'nonconvex', 'function', 'and', 'a', 'convex', 'proximable', 'function']] | [-0.10937815877782592, -0.03365908557390281, -0.09349880348575318, 0.09223222186378503, -0.05071814192490558, -0.11309211121840497, 0.0831080485387879, 0.38478492440308554, -0.4404602483925173, -0.16692647517863976, 0.12768643309946281, -0.2263198724742663, -0.15714607589830787, 0.19950238769968687, -0.11973485755497369, 0.07830256817199416, 0.04209927283227444, 0.0019166222378864126, -0.1481075540650636, -0.2652848199704441, 0.28590457905399597, -0.011519651725825112, 0.2074154553208816, 0.10842961100545728, 0.20595457569017248, -0.010482615925434787, 0.05098539398257005, 0.02508250332705803, -0.09680052241372138, 0.12171866098947634, 0.23038919705708147, 0.1918350546897026, 0.4353201761841774, -0.38171049654168093, -0.16512672699616937, 0.15193173975952096, 0.1424166487867281, 0.05619802813724441, -0.09225074317842974, -0.1852681060179563, 0.07628042362156813, -0.08966838524250662, -0.13821159090878346, -0.04085149278201289, -0.08028016523536989, 0.092848753414543, -0.3465405140640372, 0.11516390376234964, 0.07974644325736721, 0.006456501845080974, -0.108289205859873, -0.11868798945856801, 0.02181861522781142, 0.020487676358829112, 0.08243728053393, 0.18138494056065457, 0.16705092252626763, -0.07901108842658794, -0.058345178734132294, 0.27607431741020944, -0.1519112486581681, -0.2807704826532784, 0.16365437661060842, -0.06951366746956009, -0.1047639260226387, 0.1437462615007061, 0.23559031895977461, 0.2776015844132941, -0.17082009699700748, 0.08150289927400112, -0.05137232356404854, 0.08252284524891274, 0.033187681130307206, -0.05103730374031653, 0.11662085709493544, 0.14359425014611019, 0.294318213316975, 0.1965754723523633, -0.04926097804633111, -0.1457356498226468, -0.29883358861177656, -0.13514619637122852, -0.2129149857150801, 0.04109469949567722, -0.1072417245543921, -0.20936255229605458, 0.3636157844626045, 0.058716622544294696, 0.2100686403228191, 0.15099650993943214, 0.3163660725231393, 0.17437797661483984, 0.022114689635523294, 0.1187351385952305, 0.20958249572806564, 0.1902648783288896, 0.06809022909788004, -0.3183400059568743, 0.06466330788335052, 0.2030084393287109] |
1,802.02989 | Adaptive generalized multiscale finite element methods for
H(curl)-elliptic problems with heterogeneous coefficients | In this paper, we construct an adaptive multiscale method for solving
H(curl)-elliptic problems in highly heterogeneous media. Our method is based on
the generalized multiscale finite element method. We will first construct a
suitable snapshot space, and a dimensional reduction procedure to identify
important modes of the solution. We next develop and analyze an a posteriori
error indicator, and the corresponding adaptive algorithm. In addition, we will
construct a coupled offline-online adaptive algorithm, which provides an
adaptive strategy to the selection of offline and online basis functions. Our
theory shows that the convergence is robust with respect to the heterogeneities
and contrast of the media. We present several numerical results to illustrate
the performance of our method.
| math.NA | in this paper we construct an adaptive multiscale method for solving hcurlelliptic problems in highly heterogeneous media our method is based on the generalized multiscale finite element method we will first construct a suitable snapshot space and a dimensional reduction procedure to identify important modes of the solution we next develop and analyze an a posteriori error indicator and the corresponding adaptive algorithm in addition we will construct a coupled offlineonline adaptive algorithm which provides an adaptive strategy to the selection of offline and online basis functions our theory shows that the convergence is robust with respect to the heterogeneities and contrast of the media we present several numerical results to illustrate the performance of our method | [['in', 'this', 'paper', 'we', 'construct', 'an', 'adaptive', 'multiscale', 'method', 'for', 'solving', 'hcurlelliptic', 'problems', 'in', 'highly', 'heterogeneous', 'media', 'our', 'method', 'is', 'based', 'on', 'the', 'generalized', 'multiscale', 'finite', 'element', 'method', 'we', 'will', 'first', 'construct', 'a', 'suitable', 'snapshot', 'space', 'and', 'a', 'dimensional', 'reduction', 'procedure', 'to', 'identify', 'important', 'modes', 'of', 'the', 'solution', 'we', 'next', 'develop', 'and', 'analyze', 'an', 'a', 'posteriori', 'error', 'indicator', 'and', 'the', 'corresponding', 'adaptive', 'algorithm', 'in', 'addition', 'we', 'will', 'construct', 'a', 'coupled', 'offlineonline', 'adaptive', 'algorithm', 'which', 'provides', 'an', 'adaptive', 'strategy', 'to', 'the', 'selection', 'of', 'offline', 'and', 'online', 'basis', 'functions', 'our', 'theory', 'shows', 'that', 'the', 'convergence', 'is', 'robust', 'with', 'respect', 'to', 'the', 'heterogeneities', 'and', 'contrast', 'of', 'the', 'media', 'we', 'present', 'several', 'numerical', 'results', 'to', 'illustrate', 'the', 'performance', 'of', 'our', 'method']] | [-0.06466072241791748, -0.011263142293344196, -0.14514358782466372, 0.035452132736501316, -0.06766036225498878, -0.10936344534576196, 0.03709296853249443, 0.4247182027822168, -0.2716422969684133, -0.25474383713976595, 0.13680481109547366, -0.2158518941302238, -0.25161763197132225, 0.20347579015852435, -0.08973898289018664, 0.06854462538492577, 0.08138899397755299, 0.001321230356677853, -0.0766909700770188, -0.25858115721172814, 0.3151789816810974, 0.08709197661915698, 0.3136505902311283, -0.002394810913066412, 0.15264212869806215, -0.00759023091763836, -0.10151288197937838, 0.061657290251128746, -0.1469747742966288, 0.18905278732839587, 0.26043047052647533, 0.13048432396467904, 0.3656160485256335, -0.37818424868525874, -0.17069580392301853, 0.07848843782819037, 0.1590836554412441, 0.16625820692720952, -0.07997736463158649, -0.25882798150294173, 0.0977442207011587, -0.16967853854419382, -0.13604219258233005, -0.15288404588876614, -0.0713655778632403, 0.002646231570216859, -0.37417653336286033, 0.03675422514989522, 0.004170395241215311, 0.021525374685960084, -0.08235366294834891, -0.06273903868739204, 0.07186334812411524, 0.09495044070504734, -0.021199861593576598, 0.008947737480850955, 0.05656524655280699, -0.054656485281094354, -0.13813494006171823, 0.3627801381196056, -0.07060936664166892, -0.238376474168537, 0.1960308719647181, -0.02372489113296414, -0.14035885726454958, 0.12277921569405188, 0.2616682775270451, 0.17750774849816386, -0.14018639516695564, 0.0296961471658192, -0.040865254708854805, 0.18632774804076502, -0.0341678070233621, -0.000980977856168716, 0.08546351481847272, 0.2449624576477398, 0.12686591161463154, 0.1704640778460026, -0.10608720138131095, -0.06806840943092288, -0.3085801770653704, -0.1840309444333202, -0.16395081172432302, -0.04323011671658605, -0.13531243439363858, -0.2130609049686584, 0.3957478566424407, 0.2291209440982443, 0.13856436107066814, 0.06633889268589976, 0.30174617828191097, 0.12311658703075753, 0.003363767490272635, 0.10577335852551563, 0.19385856383576475, 0.09004245144274921, 0.09884363064815387, -0.24340798329272917, 0.020417771013132458, 0.13782975165141298] |
1,802.0299 | Comparing an analytical spacetime metric for a merging binary to a fully
nonlinear numerical evolution using curvature scalars | We introduce a new geometrically invariant prescription for comparing two
different spacetimes based on geodesic deviation. We use this method to compare
a family of recently introduced analytical spacetime representing inspiraling
black-hole binaries to fully nonlinear numerical solutions to the Einstein
equations. Our method can be used to improve analytical spacetime models by
providing a local measure of the effects that violations of the Einstein
equations will have on timelike geodesics, and indirectly, gas dynamics. We
also discuss the advantages and limitations of this method.
| gr-qc astro-ph.HE | we introduce a new geometrically invariant prescription for comparing two different spacetimes based on geodesic deviation we use this method to compare a family of recently introduced analytical spacetime representing inspiraling blackhole binaries to fully nonlinear numerical solutions to the einstein equations our method can be used to improve analytical spacetime models by providing a local measure of the effects that violations of the einstein equations will have on timelike geodesics and indirectly gas dynamics we also discuss the advantages and limitations of this method | [['we', 'introduce', 'a', 'new', 'geometrically', 'invariant', 'prescription', 'for', 'comparing', 'two', 'different', 'spacetimes', 'based', 'on', 'geodesic', 'deviation', 'we', 'use', 'this', 'method', 'to', 'compare', 'a', 'family', 'of', 'recently', 'introduced', 'analytical', 'spacetime', 'representing', 'inspiraling', 'blackhole', 'binaries', 'to', 'fully', 'nonlinear', 'numerical', 'solutions', 'to', 'the', 'einstein', 'equations', 'our', 'method', 'can', 'be', 'used', 'to', 'improve', 'analytical', 'spacetime', 'models', 'by', 'providing', 'a', 'local', 'measure', 'of', 'the', 'effects', 'that', 'violations', 'of', 'the', 'einstein', 'equations', 'will', 'have', 'on', 'timelike', 'geodesics', 'and', 'indirectly', 'gas', 'dynamics', 'we', 'also', 'discuss', 'the', 'advantages', 'and', 'limitations', 'of', 'this', 'method']] | [-0.11433576583821217, 0.03545513768844745, -0.14956828847198803, 0.11817147626596339, -0.14471188301549237, -0.12359800216577509, -0.0036999158698188908, 0.33257629400228755, -0.19481668859062826, -0.26486374871695745, 0.07442409197306808, -0.28004036386880804, -0.15335488114506007, 0.24013570769525627, -0.06626648969729157, 0.11099750979200881, 0.04884009158019634, -0.038728494788793956, -0.13474434267674737, -0.24725088348666974, 0.39956066002521445, 0.04778673339854268, 0.23789887762464146, 0.020618308697114972, 0.17417711645693462, -0.054933568780474805, -0.031279642310212644, 0.08693654784823165, -0.18420993363911026, 0.13687479914001682, 0.1879685775122198, 0.14856420425588593, 0.22007325360661043, -0.4206522399888319, -0.2638185773811796, 0.07988258304950946, 0.17520165748017677, 0.17690923805348574, -0.05981717163368183, -0.3387235803420053, 0.07680433880099478, -0.20764014543417622, -0.1910722838687327, -0.14140027868835364, -0.00031428660320885043, 0.007178412284702063, -0.20545211390537374, 0.07918376036447144, 0.03264796082478236, -0.011210935957291546, -0.09906123529790956, -0.036383399520726764, 0.03898800951428712, 0.08236623926855186, 0.0745646130238824, -0.00698646319043987, 0.10258135795045425, -0.01635333439883064, -0.13822040185880136, 0.3646375972907716, -0.11333245895802975, -0.32115417446406996, 0.18146689803996946, -0.1406083745580605, -0.12168110991444658, 0.08996496962739484, 0.21060363616903915, 0.18263598911683349, -0.20273400432813693, 0.0721870563527131, 0.0008683333419920767, 0.10953629328047527, 0.07497557181426708, 0.017033939112854356, 0.24427334160050926, 0.10443227909067097, 0.012406719106194727, 0.13469148577218326, -0.06339080804301535, -0.09829123317852945, -0.31552874119404484, -0.14895502820830134, -0.11598964883014559, 0.06553206689765348, -0.12682517264278004, -0.15209378018317854, 0.36035204076153393, 0.1872284744071829, 0.13753726083566162, 0.07306141992577228, 0.29687132016646073, 0.09389205587726525, 0.02329634944223525, 0.10257480908185243, 0.2877831446773866, 0.1439213162753731, 0.07087490901570109, -0.24371078275691938, -0.02390067848541281, 0.13194293200093157] |
1,802.02991 | Existence of two-step replica symmetry breaking for the spherical mixed
p-spin glass at zero temperature | We provide the first examples of two-step replica symmetry breaking (2-RSB)
models for the spherical mixed p-spin glass at zero temperature. Precisely, we
show that for a certain class of mixtures, the Parisi measure at zero
temperature is purely atomic and has exactly three distinct points in its
support. We then derive a few consequences for the topology of the random
landscape in these cases. Our main result also provides a negative answer to a
question raised in 2011 by Auffinger and Ben Arous about the classification of
pure-like and full mixture models.
| math.PR math-ph math.MP | we provide the first examples of twostep replica symmetry breaking 2rsb models for the spherical mixed pspin glass at zero temperature precisely we show that for a certain class of mixtures the parisi measure at zero temperature is purely atomic and has exactly three distinct points in its support we then derive a few consequences for the topology of the random landscape in these cases our main result also provides a negative answer to a question raised in 2011 by auffinger and ben arous about the classification of purelike and full mixture models | [['we', 'provide', 'the', 'first', 'examples', 'of', 'twostep', 'replica', 'symmetry', 'breaking', '2rsb', 'models', 'for', 'the', 'spherical', 'mixed', 'pspin', 'glass', 'at', 'zero', 'temperature', 'precisely', 'we', 'show', 'that', 'for', 'a', 'certain', 'class', 'of', 'mixtures', 'the', 'parisi', 'measure', 'at', 'zero', 'temperature', 'is', 'purely', 'atomic', 'and', 'has', 'exactly', 'three', 'distinct', 'points', 'in', 'its', 'support', 'we', 'then', 'derive', 'a', 'few', 'consequences', 'for', 'the', 'topology', 'of', 'the', 'random', 'landscape', 'in', 'these', 'cases', 'our', 'main', 'result', 'also', 'provides', 'a', 'negative', 'answer', 'to', 'a', 'question', 'raised', 'in', '2011', 'by', 'auffinger', 'and', 'ben', 'arous', 'about', 'the', 'classification', 'of', 'purelike', 'and', 'full', 'mixture', 'models']] | [-0.06950483958074904, 0.14115071089422007, -0.10231813621383322, 0.076829338391848, -0.0328200021961137, -0.13942246287352528, 0.07624014316167196, 0.3503797777482997, -0.225224361033685, -0.27483023805341317, 0.11093244327449887, -0.25448812704290386, -0.144284211696409, 0.14113683382595849, -0.04451026897130878, 0.03815157987296318, -0.018433328981146864, 0.028035442380591438, -0.07330875819974134, -0.26401473039194295, 0.3394203647647215, 0.006716929279956157, 0.2731127488431926, 0.10322133757923123, 0.10722324532031527, 0.008662510926470808, 0.03621692932717016, 0.00263189137598127, -0.17238691253734703, 0.07021238153759876, 0.22400136921485525, 0.08477809213534625, 0.2598760319119522, -0.36091405486323586, -0.23588480817346388, 0.12407128816551488, 0.06981677641464479, 0.14886230353073662, -0.0507093747905658, -0.26267011686349695, 0.10565560114185285, -0.16492935696758493, -0.17535906682378086, -0.10152954722339612, 0.025976495903349765, -0.029462214842762634, -0.262127627638857, 0.07750771470486854, 0.13923309012518628, 0.11711839370874931, -0.07692543829857047, -0.142450962815454, -0.007831605341103252, 0.09133930398029802, 0.036011892700265016, -0.01975085827997764, 0.04399047632646018, -0.0875110687971439, -0.1203785166068448, 0.3351983198410143, -0.05250854634315423, -0.15226608245512066, 0.22186247444124488, -0.13004067977991604, -0.17971485468518475, 0.09895003881588903, 0.13352354531399097, 0.10817316993210546, -0.10349680706048789, 0.1143314311282112, -0.08460393473607204, 0.12209627739882664, 0.08015675715211293, -0.05568986808698948, 0.19770572633158578, 0.14260498085059226, 0.048903379410900095, 0.1730374375803639, -0.04352139831905294, -0.10741613826046334, -0.3036579837536682, -0.1545349387782588, -0.20777307861768032, 0.06198293860981484, -0.08476933125237575, -0.14645229637339388, 0.43116927731012844, 0.12840915104986736, 0.22472820319640247, 0.08021983854047468, 0.21719315203929157, 0.09148719142135435, -0.02685104865636474, 0.05485120148944628, 0.1729498067567044, 0.15311620880738305, 0.0736081921191805, -0.17463979282183573, 0.020709998799366473, 0.07862533068628577] |
1,802.02992 | Texture Segmentation Based Video Compression Using Convolutional Neural
Networks | There has been a growing interest in using different approaches to improve
the coding efficiency of modern video codec in recent years as demand for
web-based video consumption increases. In this paper, we propose a model-based
approach that uses texture analysis/synthesis to reconstruct blocks in texture
regions of a video to achieve potential coding gains using the AV1 codec
developed by the Alliance for Open Media (AOM). The proposed method uses
convolutional neural networks to extract texture regions in a frame, which are
then reconstructed using a global motion model. Our preliminary results show an
increase in coding efficiency while maintaining satisfactory visual quality.
| cs.CV | there has been a growing interest in using different approaches to improve the coding efficiency of modern video codec in recent years as demand for webbased video consumption increases in this paper we propose a modelbased approach that uses texture analysissynthesis to reconstruct blocks in texture regions of a video to achieve potential coding gains using the av1 codec developed by the alliance for open media aom the proposed method uses convolutional neural networks to extract texture regions in a frame which are then reconstructed using a global motion model our preliminary results show an increase in coding efficiency while maintaining satisfactory visual quality | [['there', 'has', 'been', 'a', 'growing', 'interest', 'in', 'using', 'different', 'approaches', 'to', 'improve', 'the', 'coding', 'efficiency', 'of', 'modern', 'video', 'codec', 'in', 'recent', 'years', 'as', 'demand', 'for', 'webbased', 'video', 'consumption', 'increases', 'in', 'this', 'paper', 'we', 'propose', 'a', 'modelbased', 'approach', 'that', 'uses', 'texture', 'analysissynthesis', 'to', 'reconstruct', 'blocks', 'in', 'texture', 'regions', 'of', 'a', 'video', 'to', 'achieve', 'potential', 'coding', 'gains', 'using', 'the', 'av1', 'codec', 'developed', 'by', 'the', 'alliance', 'for', 'open', 'media', 'aom', 'the', 'proposed', 'method', 'uses', 'convolutional', 'neural', 'networks', 'to', 'extract', 'texture', 'regions', 'in', 'a', 'frame', 'which', 'are', 'then', 'reconstructed', 'using', 'a', 'global', 'motion', 'model', 'our', 'preliminary', 'results', 'show', 'an', 'increase', 'in', 'coding', 'efficiency', 'while', 'maintaining', 'satisfactory', 'visual', 'quality']] | [-0.05939400427115078, -0.016978998998568456, -0.08713377044310058, -0.004662904343254363, -0.03939953935332596, -0.15743196067454007, 0.01833924951251202, 0.44912700458231625, -0.26776028539125735, -0.31760451811938906, 0.07748152896573839, -0.26183544631707123, -0.19361458013568503, 0.17418563557349934, -0.20073349269715926, 0.11055490786048512, 0.10031827152236544, 0.023001542820845947, -0.058924265879725754, -0.29485467277789634, 0.23902097442903772, 0.07065227253434177, 0.4080376754013392, 0.042031190143181726, 0.14732495058510373, -0.01950495058330349, -0.06913065448260078, -0.015456803747488616, -0.0672290123523523, 0.2029130372729224, 0.33576022670828165, 0.21814304303440551, 0.2946289025891859, -0.41366552350182945, -0.2900803255705306, 0.027856844732573684, 0.20471713405836803, 0.10431342545220665, -0.14892458078975324, -0.29477685462468517, 0.17013153909311557, -0.21438271342776716, 0.0028047380530132125, -0.11529594595664933, 0.0009439679834031267, -0.014743947890215518, -0.31153366558898526, 0.04203183557435226, 0.008319335673989441, 0.05294929616950238, -0.05463790997432975, -0.08161730147437013, 0.04885399444342161, 0.2052869443790629, 0.03170315968656304, 0.11389130804981015, 0.1183100822650326, -0.1770395672568926, -0.15302101314927524, 0.3527687777890466, -0.0775177160394378, -0.21096915382300863, 0.15791622089902654, -0.009108643029601527, -0.13967771737421011, 0.13365005614021078, 0.2582581157867725, 0.07742320196904565, -0.17418645322322845, 0.007449701379160755, -0.04010393215307536, 0.23412652362402206, 0.09516868607561964, 0.03725516977451312, 0.18352000291745824, 0.29071473903380907, 0.03414994140621275, 0.15066346572040437, -0.11777090594506053, -0.05025973073721756, -0.16641971984734902, -0.10631955509038213, -0.17517498403321952, -0.08875685084897739, -0.09575627627782524, -0.1104539631274887, 0.42273704684339464, 0.21312692582320708, 0.17134005719652542, 0.07649002299093319, 0.3861192806552236, 0.009090841353799287, 0.12171334004065451, 0.10908900547880106, 0.20910929314469776, 0.032711016889572, 0.1976604948185223, -0.12694067627531835, 0.04508668008649973, 0.08533012018261406] |
1,802.02993 | Lagrangian pairs of pants | We construct a Lagrangian submanifold, inside the cotangent bundle of a real
torus, which we call a Lagrangian pair of pants. It is given as the graph of
the differential of a smooth function defined on the real blow up of a
Lagrangian coamoeba. Lagrangian pairs of pants are the main building blocks in
a construction of smooth Lagrangian submanifolds of $(\mathbb{C}^*)^n$ which
lift tropical subvarieties in $\mathbb{R}^n$. As an example we explain how to
lift tropical curves in $\mathbb{R}^2$ to Lagrangian submanifolds of
$(\mathbb{C}^*)^2$. We also give several new examples of Lagrangian
submanifolds inside toric varieties, some of which are monotone.
| math.SG math.AG | we construct a lagrangian submanifold inside the cotangent bundle of a real torus which we call a lagrangian pair of pants it is given as the graph of the differential of a smooth function defined on the real blow up of a lagrangian coamoeba lagrangian pairs of pants are the main building blocks in a construction of smooth lagrangian submanifolds of mathbbcn which lift tropical subvarieties in mathbbrn as an example we explain how to lift tropical curves in mathbbr2 to lagrangian submanifolds of mathbbc2 we also give several new examples of lagrangian submanifolds inside toric varieties some of which are monotone | [['we', 'construct', 'a', 'lagrangian', 'submanifold', 'inside', 'the', 'cotangent', 'bundle', 'of', 'a', 'real', 'torus', 'which', 'we', 'call', 'a', 'lagrangian', 'pair', 'of', 'pants', 'it', 'is', 'given', 'as', 'the', 'graph', 'of', 'the', 'differential', 'of', 'a', 'smooth', 'function', 'defined', 'on', 'the', 'real', 'blow', 'up', 'of', 'a', 'lagrangian', 'coamoeba', 'lagrangian', 'pairs', 'of', 'pants', 'are', 'the', 'main', 'building', 'blocks', 'in', 'a', 'construction', 'of', 'smooth', 'lagrangian', 'submanifolds', 'of', 'mathbbcn', 'which', 'lift', 'tropical', 'subvarieties', 'in', 'mathbbrn', 'as', 'an', 'example', 'we', 'explain', 'how', 'to', 'lift', 'tropical', 'curves', 'in', 'mathbbr2', 'to', 'lagrangian', 'submanifolds', 'of', 'mathbbc2', 'we', 'also', 'give', 'several', 'new', 'examples', 'of', 'lagrangian', 'submanifolds', 'inside', 'toric', 'varieties', 'some', 'of', 'which', 'are', 'monotone']] | [-0.24691368679643846, 0.027399200376713256, -0.07703283601257876, 0.08505966751402536, -0.11660243053783607, -0.0943064797788347, -0.07275757233740068, 0.29870637173892234, -0.30383300587680995, -0.18577990814239956, 0.0697986810233024, -0.24577255080928842, -0.21622159198730015, 0.1814696721860445, -0.20610054218274193, 0.022378687363337067, 0.04524631226690961, 0.06082494689754265, -0.12462496914097346, -0.2895572858057373, 0.460170046115915, -0.11085955731972467, 0.12867054174307221, 0.10946640488235097, 0.16239642361452913, -0.03641450329793289, 0.052232671949419524, -0.015226794402777017, -0.16756090681484043, 0.14831071911270127, 0.28533446208537355, 0.13097139612963313, 0.13684868701167552, -0.42494209218478085, -0.15794684813904586, 0.2286465819514192, 0.14647187419034832, 0.0044498441994245, 0.014263707489304828, -0.25922782348432377, 0.03480564938018135, -0.09405957682825186, -0.2341847046661903, -0.11272192114562381, 0.02443724624155199, 0.05266723630255928, -0.2039973854279036, -0.08613832907861911, 0.11664931510812511, 0.1397709095047093, -0.0244331985036386, -0.06642058149308842, -0.1349251960477262, 0.019331563323480534, 0.0009605615815220802, 0.15135586327946216, 0.1634876258150839, -0.05384811730233624, -0.07712509462098573, 0.40010911308448105, -0.09840898880022853, -0.33157175843713477, 0.09214789445018944, -0.09873436843775504, -0.1407336495478875, 0.18493111824215042, 0.1927188612137209, 0.19926871129256837, -0.0860582149459743, 0.15891930688282146, -0.17449112287631222, -0.017936708442136354, 0.12364166020415723, -0.05020297038387142, 0.15642787089717447, 0.1319975183966259, 0.1292492362588425, 0.13499624386324785, -0.029112678151303792, -0.12463745901215018, -0.4557111519662773, -0.23805369755199554, -0.1204180660675846, 0.15662994331625454, -0.12161866478695005, -0.21928960112763532, 0.4169133768654337, 0.0034239740823121634, 0.2868459716110545, 0.11340894056661009, 0.2720335810399596, -0.004183025807530309, 0.04799439002047567, 0.05445853034125678, 0.14001499037583606, 0.20176428290969675, -0.04179729560536204, -0.091503129842892, -0.12409263347759478, 0.24307888415276857] |
1,802.02994 | Relaxation of Functionals in the Space of Vector-Valued Functions of
Bounded Hessian | In this paper it is shown that if $\Omega \subset \mathbb{R}^N$ is an open,
bounded Lipschitz set, and if $f: \Omega \times \mathbb{R}^{d \times N \times
N} \rightarrow [0, \infty)$ is a continuous function with $f(x, \cdot)$ of
linear growth for all $x \in \Omega$, then the relaxed functional in the space
of functions of Bounded Hessian of the energy \[ F[u] = \int_{\Omega} f(x,
\nabla^2u(x)) dx \] for bounded sequences in $W^{2,1}$ is given by \[ {\cal
F}[u] = \int_\Omega {\cal Q}_2f(x, \nabla^2u) dx + \int_\Omega ({\cal
Q}_2f)^{\infty}\bigg(x, \frac{d D_s(\nabla u)}{d |D_s(\nabla u)|} \bigg) d
|D_s(\nabla u) |. \] This result is obtained using blow-up techniques and
establishes a second order version of the $BV$ relaxation theorems of Ambrosio
and Dal Maso and Fonseca and M\"uller. The use of the blow-up method is
intended to facilitate future study of integrands which include lower order
terms and applications in the field of second order structured deformations.
| math.AP | in this paper it is shown that if omega subset mathbbrn is an open bounded lipschitz set and if f omega times mathbbrd times n times n rightarrow 0 infty is a continuous function with fx cdot of linear growth for all x in omega then the relaxed functional in the space of functions of bounded hessian of the energy fu int_omega fx nabla2ux dx for bounded sequences in w21 is given by cal fu int_omega cal q_2fx nabla2u dx int_omega cal q_2finftybiggx fracd d_snabla ud d_snabla u bigg d d_snabla u this result is obtained using blowup techniques and establishes a second order version of the bv relaxation theorems of ambrosio and dal maso and fonseca and muller the use of the blowup method is intended to facilitate future study of integrands which include lower order terms and applications in the field of second order structured deformations | [['in', 'this', 'paper', 'it', 'is', 'shown', 'that', 'if', 'omega', 'subset', 'mathbbrn', 'is', 'an', 'open', 'bounded', 'lipschitz', 'set', 'and', 'if', 'f', 'omega', 'times', 'mathbbrd', 'times', 'n', 'times', 'n', 'rightarrow', '0', 'infty', 'is', 'a', 'continuous', 'function', 'with', 'fx', 'cdot', 'of', 'linear', 'growth', 'for', 'all', 'x', 'in', 'omega', 'then', 'the', 'relaxed', 'functional', 'in', 'the', 'space', 'of', 'functions', 'of', 'bounded', 'hessian', 'of', 'the', 'energy', 'fu', 'int_omega', 'fx', 'nabla2ux', 'dx', 'for', 'bounded', 'sequences', 'in', 'w21', 'is', 'given', 'by', 'cal', 'fu', 'int_omega', 'cal', 'q_2fx', 'nabla2u', 'dx', 'int_omega', 'cal', 'q_2finftybiggx', 'fracd', 'd_snabla', 'ud', 'd_snabla', 'u', 'bigg', 'd', 'd_snabla', 'u', 'this', 'result', 'is', 'obtained', 'using', 'blowup', 'techniques', 'and', 'establishes', 'a', 'second', 'order', 'version', 'of', 'the', 'bv', 'relaxation', 'theorems', 'of', 'ambrosio', 'and', 'dal', 'maso', 'and', 'fonseca', 'and', 'muller', 'the', 'use', 'of', 'the', 'blowup', 'method', 'is', 'intended', 'to', 'facilitate', 'future', 'study', 'of', 'integrands', 'which', 'include', 'lower', 'order', 'terms', 'and', 'applications', 'in', 'the', 'field', 'of', 'second', 'order', 'structured', 'deformations']] | [-0.15567897106181286, 0.07099345513749238, -0.005684951657409935, 0.016896595690114837, -0.03534209185616217, -0.11650179175517729, -0.0012463511496510666, 0.31510281358108233, -0.31766661623906756, -0.1548365887235074, 0.10203706584555523, -0.32696173961610636, -0.09428426163180524, 0.1523887873214941, -0.10523968838000049, 0.0904071064659446, -0.0008097875397652388, 0.05581703742306369, -0.07918491424546421, -0.25156295731560224, 0.2965478693529601, -0.13907186794030066, 0.1417573813167918, 0.08388659390362187, 0.09534943324656019, -0.003032482324569072, 0.04883258537867934, -0.05568176535780367, -0.24160027730173775, 0.08594491089509877, 0.24637139111776682, 0.13100478823374337, 0.3098613348362657, -0.3717326111962191, -0.14318599378586644, 0.1793259535948487, 0.12412200698559496, -0.09451270466686562, 0.05544786757996513, -0.29915580483308685, 0.14707420097086774, -0.09380503429565579, -0.13917173218053197, -0.04894013830279517, 0.14582779840647062, 0.06134752300446659, -0.40422154349895817, 0.10268354904837906, 0.1006352114701359, -0.000489127421234217, -0.06646342931910315, -0.16272156995708226, -0.06070336186449923, 0.021840126877779968, 0.017490643804194406, 0.2600708554301592, 0.024112903267248638, -0.06624671830084278, -0.029032919817836955, 0.35260881314752623, -0.11278163107393387, -0.22925255013008913, 0.0832620623599117, -0.19457112831231724, -0.14914452224588282, 0.08359091648728484, 0.10517282702171037, 0.22214828454889357, -0.11784783266355386, 0.31184765257461955, -0.038735424695510626, 0.15407120485178893, 0.13313048010200468, 0.03057314006663445, -0.01441262797096796, 0.13138410456789038, 0.12747233370383684, 0.08602771051098695, -0.004055874305777252, 0.01449994934672658, -0.40393712462133, -0.1336090329504158, -0.15976071723546031, 0.15357462684753248, -0.09118834031788639, -0.12140089834166348, 0.2717713110970281, 0.03551148828895142, 0.19093021708411267, 0.10804144853884484, 0.17459731045528315, 0.1569827953605151, -0.028435145554087486, 0.11309558267950909, 0.07844002369044271, 0.13965804122805517, 0.10366798447082853, -0.2133109868765233, 0.011299599346885871, 0.15946616966064336] |
1,802.02995 | The muon $g-2$ and $\alpha(M_Z^2)$: a new data-based analysis | This work presents a complete re-evaluation of the hadronic vacuum
polarisation contributions to the anomalous magnetic moment of the muon,
$a_{\mu}^{\rm had, \, VP}$ and the hadronic contributions to the effective QED
coupling at the mass of the $Z$ boson, $\Delta\alpha_{\rm had}(M_Z^2)$, from
the combination of $e^+e^-\rightarrow {\rm hadrons}$ cross section data. Focus
has been placed on the development of a new data combination method, which
fully incorporates all correlated statistical and systematic uncertainties in a
bias free approach. All available $e^+e^-\rightarrow {\rm hadrons}$ cross
section data have been analysed and included, where the new data compilation
has yielded the full hadronic $R$-ratio and its covariance matrix in the energy
range $m_{\pi}\leq\sqrt{s}\leq 11.2$ GeV. Using these combined data and pQCD
above that range results in estimates of the hadronic vacuum polarisation
contributions to $g-2$ of the muon of $a_{\mu}^{\rm had, \, LO \, VP} = (693.27
\pm 2.46)\times 10^{-10}$ and $a_{\mu}^{\rm had, \, NLO \, VP} = (-9.82 \pm
0.04)\times 10^{-10}$. The new estimate for the Standard Model prediction is
found to be $a_{\mu}^{\rm SM} = (11\ 659 \ 182.05 \pm 3.56) \times 10^{-10}$,
which is $3.7\sigma$ below the current experimental measurement. The prediction
for the five-flavour hadronic contribution to the QED coupling at the $Z$ boson
mass is $\Delta\alpha_{\rm had}^{(5)}(M_Z^2)= (276.11 \pm 1.11)\times 10^{-4}$,
resulting in $\alpha^{-1}(M_Z^2) = 128.946 \pm 0.015$. Detailed comparisons
with results from similar related works are given.
| hep-ph | this work presents a complete reevaluation of the hadronic vacuum polarisation contributions to the anomalous magnetic moment of the muon a_murm had vp and the hadronic contributions to the effective qed coupling at the mass of the z boson deltaalpha_rm hadm_z2 from the combination of eerightarrow rm hadrons cross section data focus has been placed on the development of a new data combination method which fully incorporates all correlated statistical and systematic uncertainties in a bias free approach all available eerightarrow rm hadrons cross section data have been analysed and included where the new data compilation has yielded the full hadronic rratio and its covariance matrix in the energy range m_pileqsqrtsleq 112 gev using these combined data and pqcd above that range results in estimates of the hadronic vacuum polarisation contributions to g2 of the muon of a_murm had lo vp 69327 pm 246times 1010 and a_murm had nlo vp 982 pm 004times 1010 the new estimate for the standard model prediction is found to be a_murm sm 11 659 18205 pm 356 times 1010 which is 37sigma below the current experimental measurement the prediction for the fiveflavour hadronic contribution to the qed coupling at the z boson mass is deltaalpha_rm had5m_z2 27611 pm 111times 104 resulting in alpha1m_z2 128946 pm 0015 detailed comparisons with results from similar related works are given | [['this', 'work', 'presents', 'a', 'complete', 'reevaluation', 'of', 'the', 'hadronic', 'vacuum', 'polarisation', 'contributions', 'to', 'the', 'anomalous', 'magnetic', 'moment', 'of', 'the', 'muon', 'a_murm', 'had', 'vp', 'and', 'the', 'hadronic', 'contributions', 'to', 'the', 'effective', 'qed', 'coupling', 'at', 'the', 'mass', 'of', 'the', 'z', 'boson', 'deltaalpha_rm', 'hadm_z2', 'from', 'the', 'combination', 'of', 'eerightarrow', 'rm', 'hadrons', 'cross', 'section', 'data', 'focus', 'has', 'been', 'placed', 'on', 'the', 'development', 'of', 'a', 'new', 'data', 'combination', 'method', 'which', 'fully', 'incorporates', 'all', 'correlated', 'statistical', 'and', 'systematic', 'uncertainties', 'in', 'a', 'bias', 'free', 'approach', 'all', 'available', 'eerightarrow', 'rm', 'hadrons', 'cross', 'section', 'data', 'have', 'been', 'analysed', 'and', 'included', 'where', 'the', 'new', 'data', 'compilation', 'has', 'yielded', 'the', 'full', 'hadronic', 'rratio', 'and', 'its', 'covariance', 'matrix', 'in', 'the', 'energy', 'range', 'm_pileqsqrtsleq', '112', 'gev', 'using', 'these', 'combined', 'data', 'and', 'pqcd', 'above', 'that', 'range', 'results', 'in', 'estimates', 'of', 'the', 'hadronic', 'vacuum', 'polarisation', 'contributions', 'to', 'g2', 'of', 'the', 'muon', 'of', 'a_murm', 'had', 'lo', 'vp', '69327', 'pm', '246times', '1010', 'and', 'a_murm', 'had', 'nlo', 'vp', '982', 'pm', '004times', '1010', 'the', 'new', 'estimate', 'for', 'the', 'standard', 'model', 'prediction', 'is', 'found', 'to', 'be', 'a_murm', 'sm', '11', '659', '18205', 'pm', '356', 'times', '1010', 'which', 'is', '37sigma', 'below', 'the', 'current', 'experimental', 'measurement', 'the', 'prediction', 'for', 'the', 'fiveflavour', 'hadronic', 'contribution', 'to', 'the', 'qed', 'coupling', 'at', 'the', 'z', 'boson', 'mass', 'is', 'deltaalpha_rm', 'had5m_z2', '27611', 'pm', '111times', '104', 'resulting', 'in', 'alpha1m_z2', '128946', 'pm', '0015', 'detailed', 'comparisons', 'with', 'results', 'from', 'similar', 'related', 'works', 'are', 'given']] | [-0.05692070648433188, 0.1640983228386754, -0.04642926565824059, 0.08673473629800202, -0.03102952019076481, -0.07127827302787766, 0.033882986362229285, 0.32962147354052584, -0.13902742270745824, -0.3354392946528045, 0.01753135824958994, -0.34938584030475295, 0.06727017674711533, 0.1738354138992988, 0.022521567419342692, 0.08286291181526548, 0.06550950569940608, 0.0017114681557308291, -0.08051678045733318, -0.20829738633028258, 0.21483325219830654, 0.04425144818977009, 0.23358233196760972, 0.1205876224595949, 0.08777947207150119, -0.01672332142952995, -0.05856327947760088, -0.08974780601440607, -0.16291842316446645, 0.06649684222963438, 0.20551808690978648, 0.04841053542228433, 0.12463174729116226, -0.3093946245237837, -0.08971966928410753, 0.0913759174204005, 0.1217875039056988, 0.06960846536855918, -0.021109726476356838, -0.30433248140126745, 0.11471294879774067, -0.20705797109822524, -0.08194591954380935, -0.042460815714472015, -0.0012500197090813455, -0.09244767478210242, -0.3276782561415615, 0.13708701412447524, -0.05101730884270412, 0.04315535196268531, -0.02140551245342679, -0.2721529894216839, -0.019995521562539528, 0.050403836633679325, 0.10757504388196046, 0.17357887244113138, 0.13676118438195212, -0.1042131554981624, -0.14169656118230076, 0.3981280656548861, -0.09429168148688694, -0.11632277131370033, 0.10061084643326194, -0.20413198534434088, -0.17213373064550638, 0.20814916472665793, 0.2070660234133008, 0.04136204056778518, -0.2249075744940821, 0.12943142507645242, 0.01794127999831026, 0.19284537257670173, 0.004128540774685479, 0.023760769961219036, 0.16693725272856444, 0.16338917597253572, -0.05981731793743114, -0.010009502376773543, -0.1400158426979509, -0.01919919922028529, -0.3617665340044649, -0.09474859434554231, -0.07780018064876687, 0.09555507555144847, -0.09829577843717922, -0.0722714345815165, 0.35242775487757033, 0.1369397529242038, 0.2191074508607875, 0.018456045983176433, 0.32033090893762345, 0.1089342501877794, 0.08316370855285743, 0.04954365410224021, 0.3500116104825844, 0.20023783705214682, 0.10635339492871035, -0.2418809287254394, 0.03503711448039747, 0.02309707562693734] |
1,802.02996 | A Longitudinal Study of Google Play | The difficulty of large scale monitoring of app markets affects our
understanding of their dynamics. This is particularly true for dimensions such
as app update frequency, control and pricing, the impact of developer actions
on app popularity, as well as coveted membership in top app lists. In this
paper we perform a detailed temporal analysis on two datasets we have collected
from the Google Play Store, one consisting of 160,000 apps and the other of
87,223 newly released apps. We have monitored and collected data about these
apps over more than 6 months. Our results show that a high number of these apps
have not been updated over the monitoring interval. Moreover, these apps are
controlled by a few developers that dominate the total number of app downloads.
We observe that infrequently updated apps significantly impact the median app
price. However, a changing app price does not correlate with the download
count. Furthermore, we show that apps that attain higher ranks have better
stability in top app lists. We show that app market analytics can help detect
emerging threat vectors, and identify search rank fraud and even malware.
Further, we discuss the research implications of app market analytics on
improving developer and user experiences.
| cs.SI cs.CY | the difficulty of large scale monitoring of app markets affects our understanding of their dynamics this is particularly true for dimensions such as app update frequency control and pricing the impact of developer actions on app popularity as well as coveted membership in top app lists in this paper we perform a detailed temporal analysis on two datasets we have collected from the google play store one consisting of 160000 apps and the other of 87223 newly released apps we have monitored and collected data about these apps over more than 6 months our results show that a high number of these apps have not been updated over the monitoring interval moreover these apps are controlled by a few developers that dominate the total number of app downloads we observe that infrequently updated apps significantly impact the median app price however a changing app price does not correlate with the download count furthermore we show that apps that attain higher ranks have better stability in top app lists we show that app market analytics can help detect emerging threat vectors and identify search rank fraud and even malware further we discuss the research implications of app market analytics on improving developer and user experiences | [['the', 'difficulty', 'of', 'large', 'scale', 'monitoring', 'of', 'app', 'markets', 'affects', 'our', 'understanding', 'of', 'their', 'dynamics', 'this', 'is', 'particularly', 'true', 'for', 'dimensions', 'such', 'as', 'app', 'update', 'frequency', 'control', 'and', 'pricing', 'the', 'impact', 'of', 'developer', 'actions', 'on', 'app', 'popularity', 'as', 'well', 'as', 'coveted', 'membership', 'in', 'top', 'app', 'lists', 'in', 'this', 'paper', 'we', 'perform', 'a', 'detailed', 'temporal', 'analysis', 'on', 'two', 'datasets', 'we', 'have', 'collected', 'from', 'the', 'google', 'play', 'store', 'one', 'consisting', 'of', '160000', 'apps', 'and', 'the', 'other', 'of', '87223', 'newly', 'released', 'apps', 'we', 'have', 'monitored', 'and', 'collected', 'data', 'about', 'these', 'apps', 'over', 'more', 'than', '6', 'months', 'our', 'results', 'show', 'that', 'a', 'high', 'number', 'of', 'these', 'apps', 'have', 'not', 'been', 'updated', 'over', 'the', 'monitoring', 'interval', 'moreover', 'these', 'apps', 'are', 'controlled', 'by', 'a', 'few', 'developers', 'that', 'dominate', 'the', 'total', 'number', 'of', 'app', 'downloads', 'we', 'observe', 'that', 'infrequently', 'updated', 'apps', 'significantly', 'impact', 'the', 'median', 'app', 'price', 'however', 'a', 'changing', 'app', 'price', 'does', 'not', 'correlate', 'with', 'the', 'download', 'count', 'furthermore', 'we', 'show', 'that', 'apps', 'that', 'attain', 'higher', 'ranks', 'have', 'better', 'stability', 'in', 'top', 'app', 'lists', 'we', 'show', 'that', 'app', 'market', 'analytics', 'can', 'help', 'detect', 'emerging', 'threat', 'vectors', 'and', 'identify', 'search', 'rank', 'fraud', 'and', 'even', 'malware', 'further', 'we', 'discuss', 'the', 'research', 'implications', 'of', 'app', 'market', 'analytics', 'on', 'improving', 'developer', 'and', 'user', 'experiences']] | [-0.10972050016265389, 0.033163992464404754, -0.0637106163578631, 0.10833612191341725, -0.12057770426233708, -0.19268602657096295, 0.13825837090746798, 0.44564655354347427, -0.20584095478645098, -0.3896293441989812, 0.15857547149922369, -0.3695507174142145, -0.1125381195165327, 0.22105193104516954, -0.09529910921325604, 0.01424052604368608, 0.10667315855383726, 0.04966287807621098, 0.008297389954686384, -0.3620540244468107, 0.2871036117258734, 0.06383951316160962, 0.2614896498354418, 0.0862848853068472, 0.012650548918585618, -6.908785868344343e-05, -0.1178736529241917, -0.01476063433830429, -0.08303528109195774, 0.12551378982205844, 0.3107574555398942, 0.20584081848418073, 0.3417400308687405, -0.4093852425039989, -0.13867806132396526, 0.07561884282427506, 0.1416743596553518, 0.046584886309000886, -0.06172632151709129, -0.31199542206845116, 0.15979205506046307, -0.29980867061066657, -0.05124171181029085, -0.10095389075451094, 0.047122808235807556, 0.04137900752575123, -0.21610538553666744, -0.019945724981979197, -0.009712004111368631, 0.13789077659637616, -0.02313445678801996, -0.11108950997147654, -0.0683769852191375, 0.2215517401658549, 0.09681118550146081, -0.05890382725855547, 0.22901292135617857, -0.12087491001725069, -0.16338801285793336, 0.3109182636849949, -0.028259746724951282, -0.10607056279570379, 0.16796663270235576, -0.08883478318162152, -0.1682596696681788, 0.10282407097720307, 0.2724254174029519, 0.09187932938966427, -0.14278616712788772, 0.003980655471445635, -0.05799377961955928, 0.2534227438060007, 0.07881938765947179, 0.0217930871657534, 0.18722915974230014, 0.18270849208508072, 0.07603169522096812, 0.08335025874775114, -0.06644261848718258, -0.04986933122384431, -0.2054133371701189, -0.173560153266009, -0.13209166202529016, 0.03788501659856669, -0.10610074997295195, -0.14414347103324357, 0.40427610130402547, 0.274979384556376, 0.12869059585328466, 0.03745575126700947, 0.27614447607525755, 0.01018957172467699, 0.10478966260957417, 0.1505750429683498, 0.16357755657340506, -0.09463125333222079, 0.22002323234816235, -0.1342295918778833, 0.15171680743163773, -0.032957758480371] |
1,802.02997 | The Random Fractional Matching Problem | We consider two formulations of the random-link fractional matching problem,
a relaxed version of the more standard random-link (integer) matching problem.
In one formulation, we allow each node to be linked to itself in the optimal
matching configuration. In the other one, on the contrary, such a link is
forbidden. Both problems have the same asymptotic average optimal cost of the
random-link matching problem on the complete graph. Using a replica approach
and previous results of W\"{a}stlund [Acta Mathematica 204, 91-150 (2010)], we
analytically derive the finite-size corrections to the asymptotic optimal cost.
We compare our results with numerical simulations and we discuss the main
differences between random-link fractional matching problems and the
random-link matching problem.
| cond-mat.dis-nn | we consider two formulations of the randomlink fractional matching problem a relaxed version of the more standard randomlink integer matching problem in one formulation we allow each node to be linked to itself in the optimal matching configuration in the other one on the contrary such a link is forbidden both problems have the same asymptotic average optimal cost of the randomlink matching problem on the complete graph using a replica approach and previous results of wastlund acta mathematica 204 91150 2010 we analytically derive the finitesize corrections to the asymptotic optimal cost we compare our results with numerical simulations and we discuss the main differences between randomlink fractional matching problems and the randomlink matching problem | [['we', 'consider', 'two', 'formulations', 'of', 'the', 'randomlink', 'fractional', 'matching', 'problem', 'a', 'relaxed', 'version', 'of', 'the', 'more', 'standard', 'randomlink', 'integer', 'matching', 'problem', 'in', 'one', 'formulation', 'we', 'allow', 'each', 'node', 'to', 'be', 'linked', 'to', 'itself', 'in', 'the', 'optimal', 'matching', 'configuration', 'in', 'the', 'other', 'one', 'on', 'the', 'contrary', 'such', 'a', 'link', 'is', 'forbidden', 'both', 'problems', 'have', 'the', 'same', 'asymptotic', 'average', 'optimal', 'cost', 'of', 'the', 'randomlink', 'matching', 'problem', 'on', 'the', 'complete', 'graph', 'using', 'a', 'replica', 'approach', 'and', 'previous', 'results', 'of', 'wastlund', 'acta', 'mathematica', '204', '91150', '2010', 'we', 'analytically', 'derive', 'the', 'finitesize', 'corrections', 'to', 'the', 'asymptotic', 'optimal', 'cost', 'we', 'compare', 'our', 'results', 'with', 'numerical', 'simulations', 'and', 'we', 'discuss', 'the', 'main', 'differences', 'between', 'randomlink', 'fractional', 'matching', 'problems', 'and', 'the', 'randomlink', 'matching', 'problem']] | [-0.10574266420900012, -0.009586061326705891, -0.09208167029301757, 0.1006834368110108, -0.08590381313925204, -0.10694369174054136, 0.08155177935512493, 0.3732457887219346, -0.2519237792018153, -0.3369440328410786, 0.14425400907436953, -0.29087675540485297, -0.14753402268271085, 0.15069077370242903, -0.08837224334559363, 0.10243971234025515, 0.06681293132714927, 0.01245358642798079, -0.07801245723385364, -0.25408273641369306, 0.2762135570241219, 0.008473668134082919, 0.2572725709365762, 0.05305461139296708, 0.07544056833013082, 0.0243953934830168, -0.045268781300958086, 0.044784008577951916, -0.18558822185934887, 0.12312739084818927, 0.21262808378340434, 0.10772955326930336, 0.265108618269796, -0.4044048609454995, -0.13042986925650873, 0.11409595798620063, 0.10337188116720189, 0.1281508094995566, -0.001323551648807631, -0.22722093577942123, 0.10110177775318532, -0.14810419482806617, -0.08374522390329968, 0.021804158798540415, -0.03233382986129626, -0.004114443551668006, -0.2997642958050837, 0.07931631782456584, 0.012380361816157466, -0.01180948199623305, -0.056699695543426534, -0.1630800945988006, 0.02190241261952273, 0.1275686526397729, 0.013541032744504501, 0.0180205761535984, 0.040402835895023914, -0.10540188362255044, -0.19234195234173018, 0.38774923040815024, -0.042750515337304576, -0.22145094293291154, 0.1584440109360477, -0.07270177533121212, -0.17815619272220393, 0.07781376610105128, 0.1641174440069691, 0.16340894514046933, -0.116728147532305, 0.08186699096771444, -0.10157154886983336, 0.13539163644992463, 0.09929165588286908, -0.0012229677856616353, 0.11890890288936055, 0.14143410659516636, 0.11749335749115308, 0.20245902821290024, -0.02075928273894217, -0.12375161131115063, -0.2837451659142971, -0.11883853861819142, -0.17325440492561978, -0.028354511304717996, -0.1528689997616153, -0.14437310241628437, 0.38140275305056054, 0.17616465617396423, 0.1599299280377834, 0.10819884832624509, 0.28288556719603747, 0.17656235475113372, -0.0157346713964058, 0.1369539440771484, 0.21146997168012288, 0.1163859407538953, 0.06707773313493184, -0.27228759347015746, 0.01592297090176979, 0.11963172898344372] |
1,802.02998 | Approximation of fractals by manifolds and other graph-like spaces | We define a distance between energy forms on a graph-like metric measure
space and on a discrete weighted graph using the concept of quasi-unitary
equivalence. We apply this result to metric graphs and graph-like manifolds
(e.g. a small neighbourhood of an embedded metric graph) as metric measure
spaces with energy forms associated with canonical Laplacians, e.g., the
Kirchhoff Laplacian on a metric graph resp. the (Neumann) Laplacian on a
manifold (with boundary) and express the distance of the associated energy
forms in terms of geometric quantities. We showed in arXiv:1704.00064 that the
approximating sequence of energy forms on weighted graphs used in the
definition of an energy form on a pcf fractal converge in the sense that the
distance in the quasi-unitary equivalence tends to 0. By transitivity of
quasi-unitary equivalence, we conclude that we can approximate the energy form
on a pcf fractal by a sequence of energy forms on metric graphs and graph-like
manifolds. In particular, we show that there is a sequence of domains
converging to a pcf fractal such that the corresponding (Neumann) energy forms
converge to the fractal energy form. Quasi-unitary equivalence of energy forms
implies a norm estimate for the difference of the resolvents of the associated
Laplace operators. As a consequence, suitable functions of the Laplacians are
close resp. converge as well in operator norm, e.g. the corresponding heat
operators and spectral projections. The same is true for the spectra and the
eigenfunctions in all above examples.
| math.SP math-ph math.FA math.MP | we define a distance between energy forms on a graphlike metric measure space and on a discrete weighted graph using the concept of quasiunitary equivalence we apply this result to metric graphs and graphlike manifolds eg a small neighbourhood of an embedded metric graph as metric measure spaces with energy forms associated with canonical laplacians eg the kirchhoff laplacian on a metric graph resp the neumann laplacian on a manifold with boundary and express the distance of the associated energy forms in terms of geometric quantities we showed in arxiv170400064 that the approximating sequence of energy forms on weighted graphs used in the definition of an energy form on a pcf fractal converge in the sense that the distance in the quasiunitary equivalence tends to 0 by transitivity of quasiunitary equivalence we conclude that we can approximate the energy form on a pcf fractal by a sequence of energy forms on metric graphs and graphlike manifolds in particular we show that there is a sequence of domains converging to a pcf fractal such that the corresponding neumann energy forms converge to the fractal energy form quasiunitary equivalence of energy forms implies a norm estimate for the difference of the resolvents of the associated laplace operators as a consequence suitable functions of the laplacians are close resp converge as well in operator norm eg the corresponding heat operators and spectral projections the same is true for the spectra and the eigenfunctions in all above examples | [['we', 'define', 'a', 'distance', 'between', 'energy', 'forms', 'on', 'a', 'graphlike', 'metric', 'measure', 'space', 'and', 'on', 'a', 'discrete', 'weighted', 'graph', 'using', 'the', 'concept', 'of', 'quasiunitary', 'equivalence', 'we', 'apply', 'this', 'result', 'to', 'metric', 'graphs', 'and', 'graphlike', 'manifolds', 'eg', 'a', 'small', 'neighbourhood', 'of', 'an', 'embedded', 'metric', 'graph', 'as', 'metric', 'measure', 'spaces', 'with', 'energy', 'forms', 'associated', 'with', 'canonical', 'laplacians', 'eg', 'the', 'kirchhoff', 'laplacian', 'on', 'a', 'metric', 'graph', 'resp', 'the', 'neumann', 'laplacian', 'on', 'a', 'manifold', 'with', 'boundary', 'and', 'express', 'the', 'distance', 'of', 'the', 'associated', 'energy', 'forms', 'in', 'terms', 'of', 'geometric', 'quantities', 'we', 'showed', 'in', 'arxiv170400064', 'that', 'the', 'approximating', 'sequence', 'of', 'energy', 'forms', 'on', 'weighted', 'graphs', 'used', 'in', 'the', 'definition', 'of', 'an', 'energy', 'form', 'on', 'a', 'pcf', 'fractal', 'converge', 'in', 'the', 'sense', 'that', 'the', 'distance', 'in', 'the', 'quasiunitary', 'equivalence', 'tends', 'to', '0', 'by', 'transitivity', 'of', 'quasiunitary', 'equivalence', 'we', 'conclude', 'that', 'we', 'can', 'approximate', 'the', 'energy', 'form', 'on', 'a', 'pcf', 'fractal', 'by', 'a', 'sequence', 'of', 'energy', 'forms', 'on', 'metric', 'graphs', 'and', 'graphlike', 'manifolds', 'in', 'particular', 'we', 'show', 'that', 'there', 'is', 'a', 'sequence', 'of', 'domains', 'converging', 'to', 'a', 'pcf', 'fractal', 'such', 'that', 'the', 'corresponding', 'neumann', 'energy', 'forms', 'converge', 'to', 'the', 'fractal', 'energy', 'form', 'quasiunitary', 'equivalence', 'of', 'energy', 'forms', 'implies', 'a', 'norm', 'estimate', 'for', 'the', 'difference', 'of', 'the', 'resolvents', 'of', 'the', 'associated', 'laplace', 'operators', 'as', 'a', 'consequence', 'suitable', 'functions', 'of', 'the', 'laplacians', 'are', 'close', 'resp', 'converge', 'as', 'well', 'in', 'operator', 'norm', 'eg', 'the', 'corresponding', 'heat', 'operators', 'and', 'spectral', 'projections', 'the', 'same', 'is', 'true', 'for', 'the', 'spectra', 'and', 'the', 'eigenfunctions', 'in', 'all', 'above', 'examples']] | [-0.12916423773599994, 0.07768791572129978, -0.08557768838423584, 0.1266678805475472, -0.05793665608567466, -0.05326225501849266, 0.007802357103334502, 0.372522299961712, -0.30606505530790534, -0.24731125305655868, 0.10154774731385365, -0.3159236000935114, -0.14826191114017417, 0.17382945073768497, -0.08902030696502193, 0.052652190285619856, 0.08487289861791265, 0.13343335581759427, -0.10132367472972054, -0.13951939442125533, 0.4490220520047494, 0.015918039250160748, 0.2368601310247011, 0.060838277581523444, 0.11361540078641578, -0.038161081060721184, 0.011954066709619123, 0.06056958029739877, -0.16003520817018843, 0.1581095812301853, 0.2119715545554511, 0.10141719617869382, 0.25450848299845164, -0.38097257829757997, -0.18594913824304263, 0.18557464669232446, 0.08158094946295262, -0.026996789189676445, 0.003999779621760051, -0.269543812851663, 0.0806050590141135, -0.09501684700098624, -0.13665838274384232, -0.07304670590257709, 0.01961495908534867, 0.06938301581782078, -0.2492974806086394, 0.058721176977173536, 0.09928599373703831, 0.026686361021220437, -0.11469780506351542, -0.07375905489158115, -0.05122140017644705, 0.08922324296845882, -0.019014118413667007, 0.035855814461009924, 0.06757472451477323, -0.06113322158420742, -0.10502887063481511, 0.3488484083985289, -0.08691899406622114, -0.27175000217195155, 0.150437105320578, -0.11741692944594617, -0.12462920707568081, 0.05769146641106977, 0.15652449558577175, 0.12037680752732534, -0.08530173814230801, 0.14677655013180396, -0.04538437749360738, 0.11240337174309134, 0.14526558280951218, 0.04398448190962275, 0.11086906489644031, 0.10898854358240563, 0.15773249161908778, 0.1628421898892939, -0.010615306297257742, -0.0965447901705483, -0.3239276722426154, -0.1964444683446959, -0.2294036004114551, 0.10476196993816904, -0.18351395246479374, -0.2461141882035038, 0.4028211422599929, 0.04944519060683042, 0.24497698083014033, 0.12217345513276939, 0.21263291482399735, 0.13748946889646643, 0.0692102854674751, 0.11402227580279051, 0.15770980579310975, 0.191919860660018, 0.06747225900429757, -0.1438316877954352, 0.006455352164827931, 0.16964967999561334] |
1,802.02999 | Topologically Protected Helical States in Minimally Twisted Bilayer
Graphene | In minimally twisted bilayer graphene, a moir{\'e} pattern consisting of AB
and BA stacking regions separated by domain walls forms. These domain walls are
predicted to support counterpropogating topologically protected helical (TPH)
edge states when the AB and BA regions are gapped. We fabricate designer
moir{\'e} crystals with wavelengths longer than 50 nm and demonstrate the
emergence of TPH states on the domain wall network by scanning tunneling
spectroscopy measurements. We observe a double-line profile of the TPH states
on the domain walls, only occurring when the AB and BA regions are gapped. Our
results demonstrate a practical and flexible method for TPH state network
construction.
| cond-mat.mes-hall | in minimally twisted bilayer graphene a moire pattern consisting of ab and ba stacking regions separated by domain walls forms these domain walls are predicted to support counterpropogating topologically protected helical tph edge states when the ab and ba regions are gapped we fabricate designer moire crystals with wavelengths longer than 50 nm and demonstrate the emergence of tph states on the domain wall network by scanning tunneling spectroscopy measurements we observe a doubleline profile of the tph states on the domain walls only occurring when the ab and ba regions are gapped our results demonstrate a practical and flexible method for tph state network construction | [['in', 'minimally', 'twisted', 'bilayer', 'graphene', 'a', 'moire', 'pattern', 'consisting', 'of', 'ab', 'and', 'ba', 'stacking', 'regions', 'separated', 'by', 'domain', 'walls', 'forms', 'these', 'domain', 'walls', 'are', 'predicted', 'to', 'support', 'counterpropogating', 'topologically', 'protected', 'helical', 'tph', 'edge', 'states', 'when', 'the', 'ab', 'and', 'ba', 'regions', 'are', 'gapped', 'we', 'fabricate', 'designer', 'moire', 'crystals', 'with', 'wavelengths', 'longer', 'than', '50', 'nm', 'and', 'demonstrate', 'the', 'emergence', 'of', 'tph', 'states', 'on', 'the', 'domain', 'wall', 'network', 'by', 'scanning', 'tunneling', 'spectroscopy', 'measurements', 'we', 'observe', 'a', 'doubleline', 'profile', 'of', 'the', 'tph', 'states', 'on', 'the', 'domain', 'walls', 'only', 'occurring', 'when', 'the', 'ab', 'and', 'ba', 'regions', 'are', 'gapped', 'our', 'results', 'demonstrate', 'a', 'practical', 'and', 'flexible', 'method', 'for', 'tph', 'state', 'network', 'construction']] | [-0.19322144856922469, 0.19086002202194957, -0.03089410641096381, -0.011748902014245824, -0.031165531344430626, -0.1792453507110828, 0.10375155299190292, 0.4636232119475333, -0.24786412448815578, -0.2762990083615735, 0.03363831585848634, -0.3003311617791934, -0.12931531863528709, 0.13758510142072755, 0.013813321959701771, -0.007456053962122719, 0.07037509158956555, -0.09839894291329777, -0.05791137046246561, -0.16771311063389732, 0.2771036723312342, -0.07970950846507582, 0.34418486490986255, 0.019234413940037758, -0.041800775780465524, -0.03184033666280502, 0.06592860916313135, 0.02430741803254932, -0.17924353897676998, 0.08092409809051908, 0.22144347306270645, -0.0711578788710231, 0.1703463678142794, -0.49833220022045216, -0.21804480937958634, -0.02987914955032603, 0.1868446318054888, 0.1247634739243812, -0.04307281916284547, -0.3561885766157845, 0.12236914926050406, -0.08564045700191888, -0.088275690975968, -0.07341502033138894, -0.0017991221042016063, -0.04802735669995254, -0.2424081342716543, 0.07209661162956969, -0.010899817464512965, 0.10874442240434154, -0.10813571138412885, -0.10199979607912027, -0.11552815892259186, 0.046154730736370254, -0.05324511849409286, 0.05719080882340248, 0.18073726848277422, -0.12529981631965745, -0.1417332966372652, 0.33122972618647906, -0.017194034591704863, -0.14851444764150623, 0.20716601010974287, -0.18700416526704464, -0.034306367239826975, 0.1352220202602868, 0.05288473982363939, 0.1441210199165035, -0.08099529656108231, 0.04409300366291372, -0.01365774313321794, 0.1997888433441678, 0.1283432450980159, 0.05249946053965755, 0.2781433757078254, 0.17650665422321632, 0.0581305360867431, 0.1518747658613753, -0.17007850034092115, -0.051337615061850056, -0.22110935645880844, -0.14743583473922764, -0.2132173978354571, -0.000647198448379366, -0.044614463323427424, -0.22582196767600077, 0.43251484673786555, 0.06825697892960512, 0.16691787540034023, -0.013634869020502522, 0.24676633790082667, 0.00913446382970883, 0.09168107111340845, 0.04480394047140231, 0.1973496975096048, 0.12126848429775322, 0.06806420056667742, -0.2111512972525198, 0.003961585354464094, -0.0344532784513848] |
1,802.03 | Hadwiger numbers of self-complementary graphs | The Hadwiger number of a graph $G$, denoted by $h(G)$, is the order of the
largest complete minor of $G$. A graph is said to be self-complementary if it
is isomorphic to its complement. We prove that for all $n\equiv 0,1 (\text{mod
4})$ and for all $ \lfloor \dfrac{n+1}{2} \rfloor \le h \le \lfloor
\dfrac{3n}{5}\rfloor $, there exists a self-complementary graph $G$ with $n$
vertices whose Hadwiger number is $h$.
| math.CO | the hadwiger number of a graph g denoted by hg is the order of the largest complete minor of g a graph is said to be selfcomplementary if it is isomorphic to its complement we prove that for all nequiv 01 textmod 4 and for all lfloor dfracn12 rfloor le h le lfloor dfrac3n5rfloor there exists a selfcomplementary graph g with n vertices whose hadwiger number is h | [['the', 'hadwiger', 'number', 'of', 'a', 'graph', 'g', 'denoted', 'by', 'hg', 'is', 'the', 'order', 'of', 'the', 'largest', 'complete', 'minor', 'of', 'g', 'a', 'graph', 'is', 'said', 'to', 'be', 'selfcomplementary', 'if', 'it', 'is', 'isomorphic', 'to', 'its', 'complement', 'we', 'prove', 'that', 'for', 'all', 'nequiv', '01', 'textmod', '4', 'and', 'for', 'all', 'lfloor', 'dfracn12', 'rfloor', 'le', 'h', 'le', 'lfloor', 'dfrac3n5rfloor', 'there', 'exists', 'a', 'selfcomplementary', 'graph', 'g', 'with', 'n', 'vertices', 'whose', 'hadwiger', 'number', 'is', 'h']] | [-0.23763082953960155, 0.19434962005382686, 0.014913969496829492, -0.0157884494851301, -0.10454368618119395, -0.1773945365919534, -0.008222156237796738, 0.3775150164623152, -0.25405820783679234, -0.3215293756714373, 0.07162206276376365, -0.4139010731243726, -0.12815833796224924, 0.0867106568978422, -0.09119963681212429, -0.05266894073252898, 0.0840795011908719, 0.17721113409480135, 0.06545089385966121, -0.3100749762357516, 0.2289213461406303, -0.1363860322726947, 0.0671798710757161, 0.07838245601901277, 0.057150107568525, 0.029214172489997563, 0.08121644086063359, 0.04694687338037924, -0.2547400099350797, 0.010638369275539211, 0.27389369570565497, 0.19861269109021645, 0.2517571782880237, -0.2918429941954938, -0.07783684033590059, 0.3234076535780773, 0.14021436242160923, -0.09340603648205147, 0.03529116957603643, -0.14886426522086063, 0.24182616909401436, -0.10781438264882925, -0.09431067314422266, 0.05280438357625495, 0.22167928070958817, -0.04273724238472906, -0.32390033335170965, -0.05683922117477226, 0.16265664266591723, 0.034666560124605894, 0.18574017293179745, -0.26028202193309413, -0.13378123857193824, 0.07374197068962861, -0.11122528312614921, 0.15311744561503557, -0.041401088019042756, -0.05712571726039504, -0.09983886265421682, 0.40449974155335716, -0.014984658561209499, -0.12650147929194977, 0.05692743798223973, -0.18751028917419413, -0.2059694116116699, 0.19451662850086437, 0.008375777292795565, 0.2059430059638213, -0.001386046197942712, 0.23307737188720654, -0.1636504684574902, 0.16377335818569091, 0.14852014271485986, -0.024790686745704574, 0.06130240166164709, 0.1061974969360921, 0.18083035192896865, 0.1259280941149248, 0.04513989914751922, 0.16961955126713624, -0.325767171710278, -0.14034454957723166, -0.3007638323805154, 0.1448740285228599, -0.2057957630249527, -0.16341304132065765, 0.3386393663275874, 0.060381780240938744, 0.15195038839892455, 0.11265233695281274, 0.1669017886936975, 0.027895844033495945, 0.030747534848298088, 0.2269034959150083, 0.08300546212404063, 0.2501759534652317, -0.15231054874532152, -0.15040963854302059, 0.018851744388512365, 0.16919585671558074] |
1,802.03001 | Statistical Learnability of Generalized Additive Models based on Total
Variation Regularization | A generalized additive model (GAM, Hastie and Tibshirani (1987)) is a
nonparametric model by the sum of univariate functions with respect to each
explanatory variable, i.e., $f({\mathbf x}) = \sum f_j(x_j)$, where
$x_j\in\mathbb{R}$ is $j$-th component of a sample ${\mathbf x}\in
\mathbb{R}^p$. In this paper, we introduce the total variation (TV) of a
function as a measure of the complexity of functions in $L^1_{\rm
c}(\mathbb{R})$-space. Our analysis shows that a GAM based on TV-regularization
exhibits a Rademacher complexity of $O(\sqrt{\frac{\log p}{m}})$, which is
tight in terms of both $m$ and $p$ in the agnostic case of the classification
problem. In result, we obtain generalization error bounds for finite samples
according to work by Bartlett and Mandelson (2002).
| stat.ML cs.LG | a generalized additive model gam hastie and tibshirani 1987 is a nonparametric model by the sum of univariate functions with respect to each explanatory variable ie fmathbf x sum f_jx_j where x_jinmathbbr is jth component of a sample mathbf xin mathbbrp in this paper we introduce the total variation tv of a function as a measure of the complexity of functions in l1_rm cmathbbrspace our analysis shows that a gam based on tvregularization exhibits a rademacher complexity of osqrtfraclog pm which is tight in terms of both m and p in the agnostic case of the classification problem in result we obtain generalization error bounds for finite samples according to work by bartlett and mandelson 2002 | [['a', 'generalized', 'additive', 'model', 'gam', 'hastie', 'and', 'tibshirani', '1987', 'is', 'a', 'nonparametric', 'model', 'by', 'the', 'sum', 'of', 'univariate', 'functions', 'with', 'respect', 'to', 'each', 'explanatory', 'variable', 'ie', 'fmathbf', 'x', 'sum', 'f_jx_j', 'where', 'x_jinmathbbr', 'is', 'jth', 'component', 'of', 'a', 'sample', 'mathbf', 'xin', 'mathbbrp', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'total', 'variation', 'tv', 'of', 'a', 'function', 'as', 'a', 'measure', 'of', 'the', 'complexity', 'of', 'functions', 'in', 'l1_rm', 'cmathbbrspace', 'our', 'analysis', 'shows', 'that', 'a', 'gam', 'based', 'on', 'tvregularization', 'exhibits', 'a', 'rademacher', 'complexity', 'of', 'osqrtfraclog', 'pm', 'which', 'is', 'tight', 'in', 'terms', 'of', 'both', 'm', 'and', 'p', 'in', 'the', 'agnostic', 'case', 'of', 'the', 'classification', 'problem', 'in', 'result', 'we', 'obtain', 'generalization', 'error', 'bounds', 'for', 'finite', 'samples', 'according', 'to', 'work', 'by', 'bartlett', 'and', 'mandelson', '2002']] | [-0.08057454488500282, 0.02565476603529139, -0.08991310754706999, 0.041136470575070194, -0.040616825558580795, -0.11943711864401226, 0.09673174709052283, 0.3065674377286488, -0.2500549569235158, -0.26862662799734, 0.0837974215108851, -0.2840725678598156, -0.16375107331692265, 0.1691080149418364, -0.15210047544521355, 0.048270707681506604, 0.00613643806679426, 0.04312701753198026, -0.07408558509547498, -0.2731981889013335, 0.27278647433572056, 0.013884785739277062, 0.2671161655856817, -0.012072707314530874, 0.13282510467756725, 0.044296594525410515, -0.05597821717897245, 0.00685565846363609, -0.13457570345014352, 0.11205902125850017, 0.23465870757092228, 0.13038242944130288, 0.33299347038405974, -0.2764247553776357, -0.18113578711258801, 0.15299677369310646, 0.10956834532689673, -0.03319166912718231, 0.02698700725172252, -0.2296785613037394, 0.0975966359916571, -0.17268021718959684, -0.054099592980131644, -0.029943466199108877, 0.07476714133444401, 0.06149850450120531, -0.3801115097159201, 0.12636665810163863, 0.11016515743088078, 0.0479820554438603, -0.044250808798850655, -0.18067267368052592, 0.017506802372785436, 0.02720490333766819, 0.04169954829387837, 0.11853072110475418, 0.023859895652512442, -0.07493966767304316, -0.11423436818363329, 0.3618322777612185, -0.1338816913985857, -0.245483425940882, 0.11374015944196028, -0.13753908993424596, -0.14046899174751193, 0.07314314785086222, 0.20921853167919424, 0.12444142322685267, -0.11479465658398899, 0.1576790128197932, -0.10504717243885672, 0.15872928089470612, 0.04203937709675514, 0.006096631519261513, 0.07350033578706218, 0.15075472526269051, 0.07606916202374876, 0.17105509311397066, -0.07630604538346299, -0.014583262988273893, -0.3227920127248073, -0.16686950835004985, -0.22254882580684582, 0.04706371788812281, -0.1260199672412725, -0.19728612140353835, 0.38664455726105085, 0.07090404685922302, 0.23914683690747698, 0.13553747664906318, 0.2567761117709918, 0.14790362648263172, -0.0124923466266393, 0.10228880360168782, 0.12849844594880402, 0.18350794424537803, 0.01848193961573211, -0.16957226141905496, 0.094298003933619, 0.10625441355613975] |
1,802.03002 | CP violating phases and a solution to the strong CP problem | We present a solution to the strong CP problem based on the identification of
the theta angle with twice the CP violating phase present in the CKM quark
matrix. This solution washes out all the unwanted issues stemming form the
strong CP phase and is strongly justified by general theoretical arguments
based on the partition function associated to the $\theta$ vacuum.
Phenomenological consequences on the quark mass matrices are discussed for this
case.
| hep-ph | we present a solution to the strong cp problem based on the identification of the theta angle with twice the cp violating phase present in the ckm quark matrix this solution washes out all the unwanted issues stemming form the strong cp phase and is strongly justified by general theoretical arguments based on the partition function associated to the theta vacuum phenomenological consequences on the quark mass matrices are discussed for this case | [['we', 'present', 'a', 'solution', 'to', 'the', 'strong', 'cp', 'problem', 'based', 'on', 'the', 'identification', 'of', 'the', 'theta', 'angle', 'with', 'twice', 'the', 'cp', 'violating', 'phase', 'present', 'in', 'the', 'ckm', 'quark', 'matrix', 'this', 'solution', 'washes', 'out', 'all', 'the', 'unwanted', 'issues', 'stemming', 'form', 'the', 'strong', 'cp', 'phase', 'and', 'is', 'strongly', 'justified', 'by', 'general', 'theoretical', 'arguments', 'based', 'on', 'the', 'partition', 'function', 'associated', 'to', 'the', 'theta', 'vacuum', 'phenomenological', 'consequences', 'on', 'the', 'quark', 'mass', 'matrices', 'are', 'discussed', 'for', 'this', 'case']] | [-0.16289790834568135, 0.15131823101387143, -0.04656995845677918, 0.0850452938968673, -0.10723498899311032, -0.11698479379514513, 0.13200528406193607, 0.2904235443023786, -0.24248194505702958, -0.23422384382646583, 0.1219746554126861, -0.26008445012370407, -0.1288646290027728, 0.1204978121119258, 0.016090801100514522, 0.09206809386394102, 0.01955312254124206, -0.007134329872078275, -0.17135014277819086, -0.17572419494007752, 0.3594657337318545, -0.004878317911739219, 0.24058314216999363, 0.12596165506194715, 0.04966178893634718, 0.007245485020214564, -0.05351027670916017, -0.02323061846553871, -0.11560320566657115, 0.026904850817055837, 0.16278529141500134, 0.11628753988531558, 0.15747593246298294, -0.38186983516669437, -0.1347451249762655, 0.12949589750895354, 0.0770502673168603, 0.0913619502728218, -0.09829855461011654, -0.3159823067811611, 0.054805715306827874, -0.14161202141517543, -0.161988402429764, -0.08708628042192798, -0.02555329653383424, -0.07126986487985473, -0.3135695158669802, 0.10071793707623465, -0.021233511731436807, -0.012352630846865782, 0.0432726007619911, -0.21872102943000268, 0.02515199322457591, 0.04283239032231169, 0.15542612299769606, 0.04150303813586193, 0.10102136551134594, -0.13984883075248297, -0.06371411812262073, 0.42941153161738016, -0.0252615264425539, -0.24691291852560762, 0.11622898881196057, -0.17092533804450746, -0.16572131804024723, 0.10515127175133548, 0.1261704703027459, 0.11230869519154299, -0.1612252564845632, 0.11648251895381342, -0.07780747918080386, 0.18065800992389247, 0.043464379519071075, 0.02987202169287516, 0.24412165576438993, 0.13489662023414284, 0.06509036713675277, 0.12008150480687618, -0.03907376803754357, -0.11629333215357404, -0.3812017566843392, -0.09151359809537048, -0.13789108132286482, 0.046211634226755734, -0.11853618066329732, -0.1613367769025164, 0.42115788135919974, 0.1296074729514857, 0.2033669859145398, 0.01674361446591681, 0.2971954908961915, 0.1434293812705357, 0.024532485242984067, 0.010096738217015788, 0.31522500964698114, 0.16800723476526774, 0.13443433300094448, -0.3019331108383222, 0.08878020227134023, 0.13417478779343608] |
1,802.03003 | Room-Temperature Quantum-Confined Stark Effect in Atomically Thin
Semiconductor | Electric field-controlled, two-dimensional (2D) exciton dynamics in
transition metal dichalcogenide monolayers is a current research focus in
condensed matter physics. We have experimentally investigated the spectral and
temporal properties of the A-exciton in a molybdenum diselenide (MoSe2)
monolayer under controlled variation of a vertical, electric dc field at room
temperature. By using steady-state and time-resolved photoluminescence
spectroscopies, we have observed dc field-induced spectral shifts and linewidth
broadenings that are consistent with the shortening of the exciton's
non-radiative lifetime due to field-induced dissociation. We discuss the
implications of the results for future developments in nanoscale metrology and
exploratory, optoelectronics technologies based on layered, 2D semiconductors.
| cond-mat.mes-hall | electric fieldcontrolled twodimensional 2d exciton dynamics in transition metal dichalcogenide monolayers is a current research focus in condensed matter physics we have experimentally investigated the spectral and temporal properties of the aexciton in a molybdenum diselenide mose2 monolayer under controlled variation of a vertical electric dc field at room temperature by using steadystate and timeresolved photoluminescence spectroscopies we have observed dc fieldinduced spectral shifts and linewidth broadenings that are consistent with the shortening of the excitons nonradiative lifetime due to fieldinduced dissociation we discuss the implications of the results for future developments in nanoscale metrology and exploratory optoelectronics technologies based on layered 2d semiconductors | [['electric', 'fieldcontrolled', 'twodimensional', '2d', 'exciton', 'dynamics', 'in', 'transition', 'metal', 'dichalcogenide', 'monolayers', 'is', 'a', 'current', 'research', 'focus', 'in', 'condensed', 'matter', 'physics', 'we', 'have', 'experimentally', 'investigated', 'the', 'spectral', 'and', 'temporal', 'properties', 'of', 'the', 'aexciton', 'in', 'a', 'molybdenum', 'diselenide', 'mose2', 'monolayer', 'under', 'controlled', 'variation', 'of', 'a', 'vertical', 'electric', 'dc', 'field', 'at', 'room', 'temperature', 'by', 'using', 'steadystate', 'and', 'timeresolved', 'photoluminescence', 'spectroscopies', 'we', 'have', 'observed', 'dc', 'fieldinduced', 'spectral', 'shifts', 'and', 'linewidth', 'broadenings', 'that', 'are', 'consistent', 'with', 'the', 'shortening', 'of', 'the', 'excitons', 'nonradiative', 'lifetime', 'due', 'to', 'fieldinduced', 'dissociation', 'we', 'discuss', 'the', 'implications', 'of', 'the', 'results', 'for', 'future', 'developments', 'in', 'nanoscale', 'metrology', 'and', 'exploratory', 'optoelectronics', 'technologies', 'based', 'on', 'layered', '2d', 'semiconductors']] | [-0.11306633196699505, 0.2126768358821909, -0.014024055594256004, -0.017465970213659324, -0.005080452869431331, -0.15623306091247985, 0.0678073051564682, 0.5221477069963629, -0.22655263156943525, -0.24228511937410355, -0.023317382858994488, -0.3008372783034037, -0.14936435380234167, 0.24479757644943534, 0.058343247756755985, 0.08255526493079603, -0.048239232546900615, -0.1439346051416718, -0.09009193197674065, -0.11648758426935484, 0.22435812257194462, 0.020513346205496837, 0.38725604124080676, 0.17468713488723062, 0.002432996595206742, -0.025381174108658273, 0.10911545667868967, 0.0016887775496937907, -0.21544659689138476, 0.08917876733287883, 0.2691480524170821, -0.10761521274420935, 0.23963865025255543, -0.47462078010161907, -0.2671780838953474, -0.0058745605037984205, 0.14528925312557617, 0.15780150391331588, -0.184118982651853, -0.2895405314853773, 0.043994709074188273, -0.09789499646509424, -0.06209174723055465, -0.0931882895842696, 0.00520988744616401, 0.03415538686721657, -0.18715831186944762, 0.10217426578478458, -0.00822237120099509, 0.12555428561217225, -0.12161824692157097, -0.13061352250308397, -0.06462780875545622, 0.028880268102511764, 0.0049394174331190204, 0.0037430736298959414, 0.2675435328632235, -0.1531059566500167, -0.1816899876217716, 0.3832224191820177, -0.12091097004639988, -0.019746402117352072, 0.1271404179804869, -0.227399905198791, -0.0720327301353861, 0.16202691413659173, 0.1438003498299692, 0.14278511869577834, -0.13246117131068155, 0.09934944922973116, 0.022969414363615215, 0.16956923053098413, 0.0702371251245495, 0.17166930579920658, 0.30929772772539693, 0.24996148300572082, -0.00884191500237928, 0.13142519638775133, -0.13999821269401133, -0.027440028208030317, -0.13352461769961968, -0.19264621180124009, -0.19251988478488505, 0.11496523942780466, -0.0158631172643464, -0.17796803812066522, 0.440481622201892, 0.15196928520722744, 0.14979541211281544, -0.09067450238329072, 0.2842460892100532, 0.11803653471780798, 0.05677450645061281, -0.03476431691804184, 0.2787092097658807, 0.23386135759378354, 0.19634401751234412, -0.31366608673796204, 0.03823433854939559, -0.038531531857398264] |
1,802.03004 | Random matrix products: Universality and least singular values | We establish, under a moment matching hypothesis, the local universality of
the correlation functions associated with products of $M$ independent iid
random matrices, as $M$ is fixed, and the sizes of the matrices tend to
infinity. This generalizes an earlier result of Tao and the third author for
the case $M=1$.
We also prove Gaussian limits for the centered linear spectral statistics of
products of $M$ independent iid random matrices. This is done in two steps.
First, we establish the result for product random matrices with Gaussian
entries, and then extend to the general case of non-Gaussian entries by another
moment matching argument. Prior to our result, Gaussian limits were known only
for the case $M=1$. In a similar fashion, we establish Gaussian limits for the
centered linear spectral statistics of products of independent truncated random
unitary matrices. In both cases, we are able to obtain explicit expressions for
the limiting variances.
The main difficulty in our study is that the entries of the product matrix
are no longer independent. Our key technical lemma is a lower bound on the
least singular value of the translated linearization matrix associated with the
product of $M$ normalized independent random matrices with independent and
identically distributed subgaussian entries. This lemma is of independent
interest.
| math.PR math-ph math.MP | we establish under a moment matching hypothesis the local universality of the correlation functions associated with products of m independent iid random matrices as m is fixed and the sizes of the matrices tend to infinity this generalizes an earlier result of tao and the third author for the case m1 we also prove gaussian limits for the centered linear spectral statistics of products of m independent iid random matrices this is done in two steps first we establish the result for product random matrices with gaussian entries and then extend to the general case of nongaussian entries by another moment matching argument prior to our result gaussian limits were known only for the case m1 in a similar fashion we establish gaussian limits for the centered linear spectral statistics of products of independent truncated random unitary matrices in both cases we are able to obtain explicit expressions for the limiting variances the main difficulty in our study is that the entries of the product matrix are no longer independent our key technical lemma is a lower bound on the least singular value of the translated linearization matrix associated with the product of m normalized independent random matrices with independent and identically distributed subgaussian entries this lemma is of independent interest | [['we', 'establish', 'under', 'a', 'moment', 'matching', 'hypothesis', 'the', 'local', 'universality', 'of', 'the', 'correlation', 'functions', 'associated', 'with', 'products', 'of', 'm', 'independent', 'iid', 'random', 'matrices', 'as', 'm', 'is', 'fixed', 'and', 'the', 'sizes', 'of', 'the', 'matrices', 'tend', 'to', 'infinity', 'this', 'generalizes', 'an', 'earlier', 'result', 'of', 'tao', 'and', 'the', 'third', 'author', 'for', 'the', 'case', 'm1', 'we', 'also', 'prove', 'gaussian', 'limits', 'for', 'the', 'centered', 'linear', 'spectral', 'statistics', 'of', 'products', 'of', 'm', 'independent', 'iid', 'random', 'matrices', 'this', 'is', 'done', 'in', 'two', 'steps', 'first', 'we', 'establish', 'the', 'result', 'for', 'product', 'random', 'matrices', 'with', 'gaussian', 'entries', 'and', 'then', 'extend', 'to', 'the', 'general', 'case', 'of', 'nongaussian', 'entries', 'by', 'another', 'moment', 'matching', 'argument', 'prior', 'to', 'our', 'result', 'gaussian', 'limits', 'were', 'known', 'only', 'for', 'the', 'case', 'm1', 'in', 'a', 'similar', 'fashion', 'we', 'establish', 'gaussian', 'limits', 'for', 'the', 'centered', 'linear', 'spectral', 'statistics', 'of', 'products', 'of', 'independent', 'truncated', 'random', 'unitary', 'matrices', 'in', 'both', 'cases', 'we', 'are', 'able', 'to', 'obtain', 'explicit', 'expressions', 'for', 'the', 'limiting', 'variances', 'the', 'main', 'difficulty', 'in', 'our', 'study', 'is', 'that', 'the', 'entries', 'of', 'the', 'product', 'matrix', 'are', 'no', 'longer', 'independent', 'our', 'key', 'technical', 'lemma', 'is', 'a', 'lower', 'bound', 'on', 'the', 'least', 'singular', 'value', 'of', 'the', 'translated', 'linearization', 'matrix', 'associated', 'with', 'the', 'product', 'of', 'm', 'normalized', 'independent', 'random', 'matrices', 'with', 'independent', 'and', 'identically', 'distributed', 'subgaussian', 'entries', 'this', 'lemma', 'is', 'of', 'independent', 'interest']] | [-0.12251471503862837, 0.12182897452318266, -0.04852166605983106, 0.036485743414284, -0.019089664492570747, -0.1201762191562856, 0.05854461803840323, 0.344776520876311, -0.24431206930817162, -0.21411285677403918, 0.14391261775055414, -0.2645807693760966, -0.12730378999377015, 0.15381341907350232, -0.08289224154567479, 0.07763753011955116, 0.03837451269194678, 0.07695699852595539, -0.10268834567302176, -0.2976764372033531, 0.3474693109476674, 0.02703006940417133, 0.24929301124684053, -0.024228421860028024, 0.07389264967501101, 0.061687579957803634, -0.10423083202604434, -0.06537038937449971, -0.09193349728638431, 0.11549313009111872, 0.22409324355476418, 0.0930279776695975, 0.25556187125991026, -0.3655072591263112, -0.12915897019807762, 0.17462211050660353, 0.12193917041264862, 0.058148002437364434, 0.0010001913471129763, -0.2633785057020643, 0.12487573439467221, -0.13380967065337737, -0.15279791348556418, -0.03241682349443789, 0.018088900479730836, 0.05540351055328562, -0.3721143711684934, 0.08499870414090326, 0.1477137369664289, 0.018355600414488693, -0.020681397938632995, -0.23292880721326248, 0.06463309247443956, 0.1293097057829995, 0.065063950553276, -0.025046831695362926, 0.09639925267370815, -0.02856821463204991, -0.0884612747487365, 0.2987676880276051, -0.0924466712606113, -0.24082821312854816, 0.14030994633565794, -0.17731779757710572, -0.18199454043810895, 0.09494779423823783, 0.1477808623190669, 0.1109435797682235, -0.13818899151798497, 0.12158761811177843, -0.12286354641549253, 0.1312951873016866, 0.09611828419958104, 0.013070173474123604, 0.13652903026618698, 0.045949339559875534, 0.1315572419688238, 0.1658327134626242, -0.018200001007903772, -0.08607203905775225, -0.3276574947204776, -0.13166413023864842, -0.28670505694250503, 0.09307556373830797, -0.2016717539656073, -0.1958346131315093, 0.36558768505857314, 0.11308805084394477, 0.23619602538724715, 0.13982426936151152, 0.25176043713121055, 0.15333624647254945, 0.009462129249639139, 0.0802010020872322, 0.14384465273999347, 0.25511655169296393, 0.05426239337268952, -0.08978880163926578, 0.07769688156155331, 0.08714985512903234] |
1,802.03005 | Collider Tests of the Renormalizable Coloron Model | The coloron, a massive version of the gluon present in gauge extensions of
QCD, has been searched for at the LHC as a dijet or top quark pair resonance.
We point out that in the Renormalizable Coloron Model (ReCoM) with a minimal
field content to break the gauge symmetry, a color-octet scalar and a singlet
scalar are naturally lighter than the coloron because they are pseudo
Nambu-Goldstone bosons. Consequently, the coloron may predominantly decay into
scalar pairs, leading to novel signatures at the LHC. When the color-octet
scalar is lighter than the singlet, or when the singlet mass is above roughly 1
TeV, the signatures consist of multi-jet resonances of multiplicity up to 12,
including topologies with multi-prong jet substructure, slightly displaced
vertices, and sometimes a top quark pair. When the singlet is the lightest
ReCoM boson and lighter than about 1 TeV, its main decays ($W^+W^-$, $\gamma
Z$, $ZZ$) arise at three loops. The LHC signatures then involve two or four
boosted electroweak bosons, often originating from highly displaced vertices,
plus one or two pairs of prompt jets or top quarks.
| hep-ph hep-ex | the coloron a massive version of the gluon present in gauge extensions of qcd has been searched for at the lhc as a dijet or top quark pair resonance we point out that in the renormalizable coloron model recom with a minimal field content to break the gauge symmetry a coloroctet scalar and a singlet scalar are naturally lighter than the coloron because they are pseudo nambugoldstone bosons consequently the coloron may predominantly decay into scalar pairs leading to novel signatures at the lhc when the coloroctet scalar is lighter than the singlet or when the singlet mass is above roughly 1 tev the signatures consist of multijet resonances of multiplicity up to 12 including topologies with multiprong jet substructure slightly displaced vertices and sometimes a top quark pair when the singlet is the lightest recom boson and lighter than about 1 tev its main decays ww gamma z zz arise at three loops the lhc signatures then involve two or four boosted electroweak bosons often originating from highly displaced vertices plus one or two pairs of prompt jets or top quarks | [['the', 'coloron', 'a', 'massive', 'version', 'of', 'the', 'gluon', 'present', 'in', 'gauge', 'extensions', 'of', 'qcd', 'has', 'been', 'searched', 'for', 'at', 'the', 'lhc', 'as', 'a', 'dijet', 'or', 'top', 'quark', 'pair', 'resonance', 'we', 'point', 'out', 'that', 'in', 'the', 'renormalizable', 'coloron', 'model', 'recom', 'with', 'a', 'minimal', 'field', 'content', 'to', 'break', 'the', 'gauge', 'symmetry', 'a', 'coloroctet', 'scalar', 'and', 'a', 'singlet', 'scalar', 'are', 'naturally', 'lighter', 'than', 'the', 'coloron', 'because', 'they', 'are', 'pseudo', 'nambugoldstone', 'bosons', 'consequently', 'the', 'coloron', 'may', 'predominantly', 'decay', 'into', 'scalar', 'pairs', 'leading', 'to', 'novel', 'signatures', 'at', 'the', 'lhc', 'when', 'the', 'coloroctet', 'scalar', 'is', 'lighter', 'than', 'the', 'singlet', 'or', 'when', 'the', 'singlet', 'mass', 'is', 'above', 'roughly', '1', 'tev', 'the', 'signatures', 'consist', 'of', 'multijet', 'resonances', 'of', 'multiplicity', 'up', 'to', '12', 'including', 'topologies', 'with', 'multiprong', 'jet', 'substructure', 'slightly', 'displaced', 'vertices', 'and', 'sometimes', 'a', 'top', 'quark', 'pair', 'when', 'the', 'singlet', 'is', 'the', 'lightest', 'recom', 'boson', 'and', 'lighter', 'than', 'about', '1', 'tev', 'its', 'main', 'decays', 'ww', 'gamma', 'z', 'zz', 'arise', 'at', 'three', 'loops', 'the', 'lhc', 'signatures', 'then', 'involve', 'two', 'or', 'four', 'boosted', 'electroweak', 'bosons', 'often', 'originating', 'from', 'highly', 'displaced', 'vertices', 'plus', 'one', 'or', 'two', 'pairs', 'of', 'prompt', 'jets', 'or', 'top', 'quarks']] | [-0.06287155307542819, 0.3435348815663339, -0.05855236670954132, 0.20495706867710636, -0.08971793895873886, -0.2229212217818393, -0.02184473615265093, 0.3210923143580638, -0.1810283949138126, -0.2680657153800744, -0.014815343717870477, -0.35747628551805494, 0.06071727246859694, 0.07130092013739868, 0.13220121185960515, 0.02975862644386355, 0.1025216259870801, 0.05576107067895214, -0.04171797947876237, -0.26527251070429275, 0.3389501195288376, -0.04171591286117641, 0.11963346240668465, 0.09993773864346792, 0.015994730371528352, 0.02550155827826769, -0.004452461310902835, -0.13121763790271931, -0.026434600370071615, 0.03447791855912758, 0.14078699738992337, 0.031518597714858806, 0.14532980386058705, -0.30000781040679625, -0.09492687026171812, 0.19191223140652444, 0.20894145800803715, 0.085993971793329, -0.06020525573742586, -0.33375935833952336, 0.17330706694322015, -0.23124332528847275, -0.1036310141361165, 0.0026191523046601196, -0.07633876882283692, -0.15444702045623582, -0.3425722798015308, 0.09410132895157274, -0.04195091693283438, 0.0294605151885752, 0.06545957207492972, -0.22664929154216423, -0.1724728007933923, -0.059657633880436024, 0.17033224265605396, 0.0729569095278998, 0.1999692934914492, -0.2428286010501804, -0.2292101687935928, 0.40537996791753467, -0.08990057473891903, -0.16369590521303956, 0.23003739502746612, -0.15490101560807, -0.1554364095836018, 0.18914290443753598, 0.20888055122654456, 0.0855768528459261, -0.17352020969110027, 0.1318270103001051, -0.01624975986215849, 0.16957920488142178, 0.09271646213236746, 0.10142839239695324, 0.3026173953341121, 0.1532225011922112, 0.024723457149485803, 0.07926744082942605, -0.06959290766594727, -0.09592640885806919, -0.4258717632146327, -0.11941452090024621, -0.047646061467405944, 0.06374959869740102, -0.06095826557677835, -0.10412297209476602, 0.41616399563685225, 0.0493965003937534, 0.2891018745568734, -0.021592030308726192, 0.2988153838010116, 0.05977272435416375, 0.1367917152474747, 0.09122929163021291, 0.3155543649429871, 0.158211760391778, 0.10433222019883732, -0.14768945952688067, -0.06394736701878463, 0.09546350165536362] |
1,802.03006 | Learning and Querying Fast Generative Models for Reinforcement Learning | A key challenge in model-based reinforcement learning (RL) is to synthesize
computationally efficient and accurate environment models. We show that
carefully designed generative models that learn and operate on compact state
representations, so-called state-space models, substantially reduce the
computational costs for predicting outcomes of sequences of actions. Extensive
experiments establish that state-space models accurately capture the dynamics
of Atari games from the Arcade Learning Environment from raw pixels. The
computational speed-up of state-space models while maintaining high accuracy
makes their application in RL feasible: We demonstrate that agents which query
these models for decision making outperform strong model-free baselines on the
game MSPACMAN, demonstrating the potential of using learned environment models
for planning.
| cs.LG | a key challenge in modelbased reinforcement learning rl is to synthesize computationally efficient and accurate environment models we show that carefully designed generative models that learn and operate on compact state representations socalled statespace models substantially reduce the computational costs for predicting outcomes of sequences of actions extensive experiments establish that statespace models accurately capture the dynamics of atari games from the arcade learning environment from raw pixels the computational speedup of statespace models while maintaining high accuracy makes their application in rl feasible we demonstrate that agents which query these models for decision making outperform strong modelfree baselines on the game mspacman demonstrating the potential of using learned environment models for planning | [['a', 'key', 'challenge', 'in', 'modelbased', 'reinforcement', 'learning', 'rl', 'is', 'to', 'synthesize', 'computationally', 'efficient', 'and', 'accurate', 'environment', 'models', 'we', 'show', 'that', 'carefully', 'designed', 'generative', 'models', 'that', 'learn', 'and', 'operate', 'on', 'compact', 'state', 'representations', 'socalled', 'statespace', 'models', 'substantially', 'reduce', 'the', 'computational', 'costs', 'for', 'predicting', 'outcomes', 'of', 'sequences', 'of', 'actions', 'extensive', 'experiments', 'establish', 'that', 'statespace', 'models', 'accurately', 'capture', 'the', 'dynamics', 'of', 'atari', 'games', 'from', 'the', 'arcade', 'learning', 'environment', 'from', 'raw', 'pixels', 'the', 'computational', 'speedup', 'of', 'statespace', 'models', 'while', 'maintaining', 'high', 'accuracy', 'makes', 'their', 'application', 'in', 'rl', 'feasible', 'we', 'demonstrate', 'that', 'agents', 'which', 'query', 'these', 'models', 'for', 'decision', 'making', 'outperform', 'strong', 'modelfree', 'baselines', 'on', 'the', 'game', 'mspacman', 'demonstrating', 'the', 'potential', 'of', 'using', 'learned', 'environment', 'models', 'for', 'planning']] | [0.012937078379244278, 0.002374946736381389, -0.07423787992281307, 0.11172292163038426, -0.10969922250868487, -0.19810122064414568, 0.06752526146426265, 0.5100131126985487, -0.27366257163313484, -0.35161977873316835, 0.0804011342427527, -0.21909261674071395, -0.1745924193445327, 0.20556500542235362, -0.14421852817758918, 0.09802409518410318, 0.16495677393894376, -0.007439591051869294, -0.0482199879770308, -0.27765689112337505, 0.26548554868453983, 0.05386040580093062, 0.3071595441350447, -0.06126721992248869, 0.19974045423025796, -0.045502417745800425, 0.003403910726774484, -0.009291792828922294, -0.02885591092100575, 0.16220563686718897, 0.3549880882656972, 0.23289649103285878, 0.35916304086692563, -0.44654015326107455, -0.2581967543207741, 0.14280695665053958, 0.10214484008195411, 0.0999721878168722, -0.036238098928671594, -0.3567469378135034, 0.03842381923875239, -0.17312080579826475, 0.005042351690852749, -0.19299376120657794, -0.023843866404994123, -0.011755294815624697, -0.3377853743233053, -0.004818600242807796, 0.06722168654544346, 0.032985757263044695, -0.0819057336359817, -0.11557399448481322, 0.018538670892926996, 0.17789536047244578, -0.01257033871661406, 0.00025857882324739227, 0.1883445899875369, -0.234115002560949, -0.2196794908793111, 0.3498465043791969, -0.0376499321448916, -0.18305326532364624, 0.2367139581640783, -0.02815150488251155, -0.15025694883765287, 0.121410233725328, 0.2911683243333495, 0.14458662045737064, -0.12060147118089455, 0.06083128333869224, -0.004819839194949184, 0.20161976289715053, -0.03427574219988726, -0.02109316467041416, 0.1708815410654227, 0.2965122644839409, 0.05544464900542932, 0.10720878986259257, -0.029785865198521475, -0.176059730977743, -0.18304393807193264, -0.07915379030587896, -0.16053928577457555, -0.031326165792831616, -0.13857111273656691, -0.12741693746816704, 0.34857116945204325, 0.30705539300938006, 0.15843798334546072, 0.20069964766506537, 0.35201410634908825, 0.030380871377669143, 0.0610056407157182, 0.12385567643962402, 0.20489566985218385, 0.017022099125564898, 0.10240374769325301, -0.22338795826570795, 0.1533881390267717, 0.00931900114768983] |
1,802.03007 | Sensor-less adaptive optics for Brillouin micro-spectroscopy | Brillouin spectroscopy is a powerful optical technique for viscoelastic
characterization of samples without contact. However, like all optical systems,
Brillouin spectroscopy performances are degraded by optical aberrations, and
have therefore been limited to homogenous transparent samples. To correct for
aberrations, adaptive optics (AO) methods have been previously integrated into
a variety of optical modalities ranging from ground-based telescopes to
super-resolution microscopes. In this work, we developed an adaptive optics
configuration designed for Brillouin scattering spectral analysis. Our
configuration doesn't require direct wave-front sensing and the injection of a
'guide-star'; hence, it can be implemented without the need for sample
pre-treatment. We used our AO-Brillouin spectrometer in aberrated phantoms and
biological samples; consistent with previous AO systems, we demonstrate
effective correction of optical aberrations yielding 2.5-fold enhancement in
Brillouin signal strength and 1.4-fold improvement in axial resolution.
| physics.optics | brillouin spectroscopy is a powerful optical technique for viscoelastic characterization of samples without contact however like all optical systems brillouin spectroscopy performances are degraded by optical aberrations and have therefore been limited to homogenous transparent samples to correct for aberrations adaptive optics ao methods have been previously integrated into a variety of optical modalities ranging from groundbased telescopes to superresolution microscopes in this work we developed an adaptive optics configuration designed for brillouin scattering spectral analysis our configuration doesnt require direct wavefront sensing and the injection of a guidestar hence it can be implemented without the need for sample pretreatment we used our aobrillouin spectrometer in aberrated phantoms and biological samples consistent with previous ao systems we demonstrate effective correction of optical aberrations yielding 25fold enhancement in brillouin signal strength and 14fold improvement in axial resolution | [['brillouin', 'spectroscopy', 'is', 'a', 'powerful', 'optical', 'technique', 'for', 'viscoelastic', 'characterization', 'of', 'samples', 'without', 'contact', 'however', 'like', 'all', 'optical', 'systems', 'brillouin', 'spectroscopy', 'performances', 'are', 'degraded', 'by', 'optical', 'aberrations', 'and', 'have', 'therefore', 'been', 'limited', 'to', 'homogenous', 'transparent', 'samples', 'to', 'correct', 'for', 'aberrations', 'adaptive', 'optics', 'ao', 'methods', 'have', 'been', 'previously', 'integrated', 'into', 'a', 'variety', 'of', 'optical', 'modalities', 'ranging', 'from', 'groundbased', 'telescopes', 'to', 'superresolution', 'microscopes', 'in', 'this', 'work', 'we', 'developed', 'an', 'adaptive', 'optics', 'configuration', 'designed', 'for', 'brillouin', 'scattering', 'spectral', 'analysis', 'our', 'configuration', 'doesnt', 'require', 'direct', 'wavefront', 'sensing', 'and', 'the', 'injection', 'of', 'a', 'guidestar', 'hence', 'it', 'can', 'be', 'implemented', 'without', 'the', 'need', 'for', 'sample', 'pretreatment', 'we', 'used', 'our', 'aobrillouin', 'spectrometer', 'in', 'aberrated', 'phantoms', 'and', 'biological', 'samples', 'consistent', 'with', 'previous', 'ao', 'systems', 'we', 'demonstrate', 'effective', 'correction', 'of', 'optical', 'aberrations', 'yielding', '25fold', 'enhancement', 'in', 'brillouin', 'signal', 'strength', 'and', '14fold', 'improvement', 'in', 'axial', 'resolution']] | [-0.0613953432775344, 0.08814838491822162, -0.0971430911725663, -0.018062322083170768, -0.089222283595828, -0.17165540414344932, 0.01401022545027512, 0.5269211869307414, -0.21777641216155003, -0.32796552457191325, 0.10478060246117551, -0.27408905942682865, -0.13978960738879526, 0.28390035960409377, -0.10868531709054002, 0.153319355238367, 0.09038988824036938, -0.10700111236009333, -0.04215549947284335, -0.19715464648928632, 0.2266956625144101, 0.11499094881324304, 0.30988188188316096, -0.01209845733138974, 0.11531462764919356, 0.08423085770121327, -0.034245673492895784, 0.01681962829704086, -0.07987688455678936, 0.09497681488455445, 0.325528747678079, 0.03962309384304616, 0.22410166568847167, -0.4213522556028221, -0.3003730776547282, 0.06845984162624788, 0.19760436402219866, 0.11859899824636091, -0.10375826845324977, -0.2789716941787413, 0.019540472241566964, -0.10864315749042563, -0.13247959976325985, -0.10589746993242038, -0.05524090561946785, -0.0003909236001264718, -0.2992842819541693, 0.0026537353351832956, -0.00350425548127128, 0.1561978096211398, -0.07973567532478935, -0.09433423354014478, 0.03874706923099304, 0.12587858698572274, -0.09929539019207435, 0.013285652229872843, 0.14188742886676833, -0.13196043682422626, -0.08533459820405201, 0.3500239870476502, -0.02317242083243198, -0.11752999188999334, 0.17795534804722088, -0.15014773273357637, -0.06033988023452737, 0.2405877978834151, 0.18108156704542192, 0.11387515108239044, -0.16289066547458922, 0.029778098427104178, 0.05177705167206349, 0.2157688998306791, 0.10069671007632106, 0.12304707909071887, 0.1637534916918311, 0.17471052943556398, 0.0398514059376019, 0.09406915276604533, -0.22839236218068334, 0.03422478337047829, -0.19124303357330738, -0.14065161543311896, -0.18701356513063527, 0.0296338773617107, -0.053160246949927464, -0.11272892228983067, 0.30082978434446783, 0.19881641706451775, 0.10676018824904329, -0.023418588605191974, 0.4005471457209852, 0.05202062836572252, 0.17675312680916655, -0.044418388777584944, 0.340288759826648, 0.12664456985097516, 0.1431735162243799, -0.20337870971782615, 0.008449068817275541, -0.009717604745593337] |
1,802.03008 | A deep learning approach to identify local structures in
atomic-resolution transmission electron microscopy images | Recording atomic-resolution transmission electron microscopy (TEM) images is
becoming increasingly routine. A new bottleneck is then analyzing this
information, which often involves time-consuming manual structural
identification. We have developed a deep learning-based algorithm for
recognition of the local structure in TEM images, which is stable to microscope
parameters and noise. The neural network is trained entirely from simulation
but is capable of making reliable predictions on experimental images. We apply
the method to single sheets of defected graphene, and to metallic nanoparticles
on an oxide support.
| cond-mat.mtrl-sci | recording atomicresolution transmission electron microscopy tem images is becoming increasingly routine a new bottleneck is then analyzing this information which often involves timeconsuming manual structural identification we have developed a deep learningbased algorithm for recognition of the local structure in tem images which is stable to microscope parameters and noise the neural network is trained entirely from simulation but is capable of making reliable predictions on experimental images we apply the method to single sheets of defected graphene and to metallic nanoparticles on an oxide support | [['recording', 'atomicresolution', 'transmission', 'electron', 'microscopy', 'tem', 'images', 'is', 'becoming', 'increasingly', 'routine', 'a', 'new', 'bottleneck', 'is', 'then', 'analyzing', 'this', 'information', 'which', 'often', 'involves', 'timeconsuming', 'manual', 'structural', 'identification', 'we', 'have', 'developed', 'a', 'deep', 'learningbased', 'algorithm', 'for', 'recognition', 'of', 'the', 'local', 'structure', 'in', 'tem', 'images', 'which', 'is', 'stable', 'to', 'microscope', 'parameters', 'and', 'noise', 'the', 'neural', 'network', 'is', 'trained', 'entirely', 'from', 'simulation', 'but', 'is', 'capable', 'of', 'making', 'reliable', 'predictions', 'on', 'experimental', 'images', 'we', 'apply', 'the', 'method', 'to', 'single', 'sheets', 'of', 'defected', 'graphene', 'and', 'to', 'metallic', 'nanoparticles', 'on', 'an', 'oxide', 'support']] | [-0.07111576186807089, 0.03868379315708596, -0.094869936773077, 0.040076005740935894, -0.08610646171917663, -0.21219573992975924, 0.02854774916628484, 0.4919615679009016, -0.2667922310877678, -0.3067645672654603, 0.07489447325311038, -0.304719197986171, -0.20939280811242414, 0.2343195862201757, -0.09184103938859216, 0.12694144416791672, 0.11625232842079429, -0.042162568384218356, -0.024128837007379462, -0.2254458757924176, 0.2571131173456304, 0.11266647349348627, 0.39125545214601726, 0.03413476826904645, 0.10008748587583689, 0.02832679446721666, -0.002516591434128756, -0.014401089834579982, -0.08721769106747626, 0.16764267406231442, 0.29115714147946864, 0.08978792447813375, 0.2697250761530297, -0.5080217062603942, -0.227257615735018, -0.006531042534164911, 0.17469198141940112, 0.1344320307198782, -0.07796656166008392, -0.2936811989693101, 0.10996081133719621, -0.06010871119580643, -0.019434680620771506, -0.1653751211219229, -0.034454390245522264, -0.0600742839011472, -0.3062396413832091, 0.07261600396271016, -0.008839778420731945, 0.12894169233609423, -0.09634962048500689, -0.0324328406064143, -0.0012104454731871916, 0.14266606574596533, 0.0010658595034159547, 0.03269285694452349, 0.22401192874192846, -0.15544289063261604, -0.06607610533598723, 0.3356361884602107, 0.028091625973777196, -0.13966277926932846, 0.20969665202117244, -0.062365278125155806, -0.11452490746498455, 0.21577575842871569, 0.12940921574062125, 0.13562667765113157, -0.2169797543475545, -0.011847935526274405, -0.023287573217435978, 0.258549326332286, 0.07291998464051028, -0.017753071866409724, 0.19748187104245474, 0.29099298262059, 0.021630041363519117, 0.11433768574538272, -0.18464316502700798, 0.003960733518524225, -0.11873674054825029, -0.1624201373657385, -0.22984508942639412, 0.04184998897564879, -0.04127725599797952, -0.23464150815324988, 0.36848118156194687, 0.195174771166125, 0.1629814560116312, 0.00633247904100477, 0.4049514458003064, 0.007956823970997966, 0.12760614177623633, -0.01909310866125621, 0.18107795316135772, 0.07399627103451314, 0.13097083628134326, -0.17090736094423634, 0.10995526367332786, 0.026324460023017818] |
1,802.03009 | Pair density wave, charge density wave and vortex in high Tc cuprates | A recent scanning tunneling microscopy (STM) experiment reports the
observation of charge density wave (CDW) with period of approximately 8a in the
halo region surrounding the vortex core, in striking contrast to the
approximately period 4a CDW that are commonly observed in the cuprates.
Inspired by this work, we study a model where a bi-directional pair density
wave (PDW) with period 8 is at play. This further divides into two classes, (1)
where the PDW is a competing state of the d wave superconductor and can exist
only near the vortex core where the d wave order is suppressed, and (2) where
the PDW is the primary order, the so called mother state that persists with
strong phase fluctuations to high temperature and high magnetic field and lies
behind the pseudogap phenomenology. We study the charge density wave structures
near the vortex core in these models. We emphasize the importance of the phase
winding of the d-wave order parameter. The PDW can be pinned by the vortex core
due to this winding and become static. Furthermore, the period 8 CDW inherits
the properties of this winding, which gives rise to a special feature of the
Fourier transform peak, namely, it is split in certain directions. There are
also a line of zeros in the inverse Fourier transform of filtered data. We
propose that these are key experimental signatures that can distinguish between
the PDW-driven scenario from the more mundane option that the period 8 CDW is
primary. We discuss the pros and cons of the options considered above. Finally
we attempt to place the STM experiment in the broader context of pseudogap
physics of underdoped cuprates and relate this observation to the unusual
properties of X ray scattering data on CDW carried out to very high magnetic
field.
| cond-mat.str-el | a recent scanning tunneling microscopy stm experiment reports the observation of charge density wave cdw with period of approximately 8a in the halo region surrounding the vortex core in striking contrast to the approximately period 4a cdw that are commonly observed in the cuprates inspired by this work we study a model where a bidirectional pair density wave pdw with period 8 is at play this further divides into two classes 1 where the pdw is a competing state of the d wave superconductor and can exist only near the vortex core where the d wave order is suppressed and 2 where the pdw is the primary order the so called mother state that persists with strong phase fluctuations to high temperature and high magnetic field and lies behind the pseudogap phenomenology we study the charge density wave structures near the vortex core in these models we emphasize the importance of the phase winding of the dwave order parameter the pdw can be pinned by the vortex core due to this winding and become static furthermore the period 8 cdw inherits the properties of this winding which gives rise to a special feature of the fourier transform peak namely it is split in certain directions there are also a line of zeros in the inverse fourier transform of filtered data we propose that these are key experimental signatures that can distinguish between the pdwdriven scenario from the more mundane option that the period 8 cdw is primary we discuss the pros and cons of the options considered above finally we attempt to place the stm experiment in the broader context of pseudogap physics of underdoped cuprates and relate this observation to the unusual properties of x ray scattering data on cdw carried out to very high magnetic field | [['a', 'recent', 'scanning', 'tunneling', 'microscopy', 'stm', 'experiment', 'reports', 'the', 'observation', 'of', 'charge', 'density', 'wave', 'cdw', 'with', 'period', 'of', 'approximately', '8a', 'in', 'the', 'halo', 'region', 'surrounding', 'the', 'vortex', 'core', 'in', 'striking', 'contrast', 'to', 'the', 'approximately', 'period', '4a', 'cdw', 'that', 'are', 'commonly', 'observed', 'in', 'the', 'cuprates', 'inspired', 'by', 'this', 'work', 'we', 'study', 'a', 'model', 'where', 'a', 'bidirectional', 'pair', 'density', 'wave', 'pdw', 'with', 'period', '8', 'is', 'at', 'play', 'this', 'further', 'divides', 'into', 'two', 'classes', '1', 'where', 'the', 'pdw', 'is', 'a', 'competing', 'state', 'of', 'the', 'd', 'wave', 'superconductor', 'and', 'can', 'exist', 'only', 'near', 'the', 'vortex', 'core', 'where', 'the', 'd', 'wave', 'order', 'is', 'suppressed', 'and', '2', 'where', 'the', 'pdw', 'is', 'the', 'primary', 'order', 'the', 'so', 'called', 'mother', 'state', 'that', 'persists', 'with', 'strong', 'phase', 'fluctuations', 'to', 'high', 'temperature', 'and', 'high', 'magnetic', 'field', 'and', 'lies', 'behind', 'the', 'pseudogap', 'phenomenology', 'we', 'study', 'the', 'charge', 'density', 'wave', 'structures', 'near', 'the', 'vortex', 'core', 'in', 'these', 'models', 'we', 'emphasize', 'the', 'importance', 'of', 'the', 'phase', 'winding', 'of', 'the', 'dwave', 'order', 'parameter', 'the', 'pdw', 'can', 'be', 'pinned', 'by', 'the', 'vortex', 'core', 'due', 'to', 'this', 'winding', 'and', 'become', 'static', 'furthermore', 'the', 'period', '8', 'cdw', 'inherits', 'the', 'properties', 'of', 'this', 'winding', 'which', 'gives', 'rise', 'to', 'a', 'special', 'feature', 'of', 'the', 'fourier', 'transform', 'peak', 'namely', 'it', 'is', 'split', 'in', 'certain', 'directions', 'there', 'are', 'also', 'a', 'line', 'of', 'zeros', 'in', 'the', 'inverse', 'fourier', 'transform', 'of', 'filtered', 'data', 'we', 'propose', 'that', 'these', 'are', 'key', 'experimental', 'signatures', 'that', 'can', 'distinguish', 'between', 'the', 'pdwdriven', 'scenario', 'from', 'the', 'more', 'mundane', 'option', 'that', 'the', 'period', '8', 'cdw', 'is', 'primary', 'we', 'discuss', 'the', 'pros', 'and', 'cons', 'of', 'the', 'options', 'considered', 'above', 'finally', 'we', 'attempt', 'to', 'place', 'the', 'stm', 'experiment', 'in', 'the', 'broader', 'context', 'of', 'pseudogap', 'physics', 'of', 'underdoped', 'cuprates', 'and', 'relate', 'this', 'observation', 'to', 'the', 'unusual', 'properties', 'of', 'x', 'ray', 'scattering', 'data', 'on', 'cdw', 'carried', 'out', 'to', 'very', 'high', 'magnetic', 'field']] | [-0.19461002142046285, 0.19331074571562304, -0.08369458949833054, 0.07896375803077775, -0.07996078819641686, -0.1023416230643187, 0.05190959279264734, 0.3605469332612825, -0.25984234061140743, -0.2585548884125571, 0.052035147239930725, -0.3066996143486426, -0.12749854356100665, 0.13563894675903473, 0.029827622569660792, 0.0063659324936305335, -0.028373994585440217, 0.023355541004476323, -0.1040925315274741, -0.21860699263959496, 0.3391903326666353, 0.02476021104652171, 0.30120808035072555, 0.05070461715831851, 0.04224444072151099, -0.010238114450446735, 0.03455010745413711, -0.009904561037517558, -0.15096533312115867, 0.04960697824417642, 0.28538956103418645, 0.0366050567283328, 0.20600036402022848, -0.44415012896311806, -0.2107715004532181, 0.0612600694985426, 0.15826266087115012, 0.09001999340445016, -0.03275937751008657, -0.27197325773661024, 0.08827969410867502, -0.14305202428075903, -0.13773891696179605, -0.04752575618102017, 0.02631003698506565, 0.003305110944002265, -0.22489613757754115, 0.10738793280991249, 0.05581632685637484, 0.02913859795266684, -0.07865375784807446, -0.08546341830779883, -0.04514497244003094, 0.027511423989904648, 0.09204893357705275, 0.11512088404987196, 0.09133481823365747, -0.13399116054368565, -0.09890811728558155, 0.3411990111609074, -0.024759988595852284, -0.08305540715457138, 0.1632873250158999, -0.21611642716640625, -0.09602399137002801, 0.16661991928084768, 0.10789687551698343, 0.06244199633008803, -0.06787483921660242, 0.038794824818458085, -0.054330144545699545, 0.19098298261859314, 0.08064290081693318, 0.06076057323941378, 0.26888711229343004, 0.19154895222761514, 0.04830569607089666, 0.11994987244361867, -0.19056849336402135, -0.08495931254436422, -0.305370349803883, -0.15081474064145337, -0.1902517729285189, -0.00188361638869819, -0.033686195692701676, -0.13188669050274252, 0.43209930848148387, 0.18050279904012678, 0.22529798411640342, -0.06957300283016342, 0.25429105162871407, 0.1130547108448515, 0.05652184564756858, 0.041981936993723365, 0.23213256896482876, 0.13050304855430117, 0.1214054738005203, -0.2527977222878947, 0.03179353316940104, 0.02186378539909894] |
1,802.0301 | Algorithmic Bidding for Virtual Trading in Electricity Markets | We consider the problem of optimal bidding for virtual trading in
two-settlement electricity markets. A virtual trader aims to arbitrage on the
differences between day-ahead and real-time market prices; both prices,
however, are random and unknown to market participants. An online learning
algorithm is proposed to maximize the cumulative payoff over a finite number of
trading sessions by allocating the trader's budget among his bids for K options
in each session. It is shown that the proposed algorithm converges, with an
almost optimal convergence rate, to the global optimal corresponding to the
case when the underlying price distribution is known. The proposed algorithm is
also generalized for trading strategies with a risk measure. By using both
cumulative payoff and Sharpe ratio as performance metrics, evaluations were
performed based on historical data spanning ten year period of NYISO and PJM
markets. It was shown that the proposed strategy outperforms standard
benchmarks and the S&P 500 index over the same period.
| cs.GT cs.CR cs.LG | we consider the problem of optimal bidding for virtual trading in twosettlement electricity markets a virtual trader aims to arbitrage on the differences between dayahead and realtime market prices both prices however are random and unknown to market participants an online learning algorithm is proposed to maximize the cumulative payoff over a finite number of trading sessions by allocating the traders budget among his bids for k options in each session it is shown that the proposed algorithm converges with an almost optimal convergence rate to the global optimal corresponding to the case when the underlying price distribution is known the proposed algorithm is also generalized for trading strategies with a risk measure by using both cumulative payoff and sharpe ratio as performance metrics evaluations were performed based on historical data spanning ten year period of nyiso and pjm markets it was shown that the proposed strategy outperforms standard benchmarks and the sp 500 index over the same period | [['we', 'consider', 'the', 'problem', 'of', 'optimal', 'bidding', 'for', 'virtual', 'trading', 'in', 'twosettlement', 'electricity', 'markets', 'a', 'virtual', 'trader', 'aims', 'to', 'arbitrage', 'on', 'the', 'differences', 'between', 'dayahead', 'and', 'realtime', 'market', 'prices', 'both', 'prices', 'however', 'are', 'random', 'and', 'unknown', 'to', 'market', 'participants', 'an', 'online', 'learning', 'algorithm', 'is', 'proposed', 'to', 'maximize', 'the', 'cumulative', 'payoff', 'over', 'a', 'finite', 'number', 'of', 'trading', 'sessions', 'by', 'allocating', 'the', 'traders', 'budget', 'among', 'his', 'bids', 'for', 'k', 'options', 'in', 'each', 'session', 'it', 'is', 'shown', 'that', 'the', 'proposed', 'algorithm', 'converges', 'with', 'an', 'almost', 'optimal', 'convergence', 'rate', 'to', 'the', 'global', 'optimal', 'corresponding', 'to', 'the', 'case', 'when', 'the', 'underlying', 'price', 'distribution', 'is', 'known', 'the', 'proposed', 'algorithm', 'is', 'also', 'generalized', 'for', 'trading', 'strategies', 'with', 'a', 'risk', 'measure', 'by', 'using', 'both', 'cumulative', 'payoff', 'and', 'sharpe', 'ratio', 'as', 'performance', 'metrics', 'evaluations', 'were', 'performed', 'based', 'on', 'historical', 'data', 'spanning', 'ten', 'year', 'period', 'of', 'nyiso', 'and', 'pjm', 'markets', 'it', 'was', 'shown', 'that', 'the', 'proposed', 'strategy', 'outperforms', 'standard', 'benchmarks', 'and', 'the', 'sp', '500', 'index', 'over', 'the', 'same', 'period']] | [-0.08472380634110258, 0.02885628431693522, -0.11173025979631164, 0.12819772350540348, -0.08458843050852606, -0.15132463791073775, 0.1684481014304285, 0.46717604969001414, -0.2523058446668932, -0.2996577222204808, 0.13688100820343937, -0.31749634097371277, -0.13439069015307809, 0.19685100297789154, -0.16333078024264588, 0.055317678715764255, 0.035842697090709454, 0.04156817255084807, 0.06119561905287347, -0.39708165918277727, 0.23477950769987235, 0.10666483653117698, 0.3471266409651663, 0.009586435848109002, 0.1495843953335857, 0.027432821556316607, -0.04005870326684272, -0.00880207480548269, -0.10377411190729732, 0.11707165841900585, 0.30728007612146624, 0.1809821694350945, 0.3843770889131903, -0.36507437588740727, -0.10493467044694431, 0.14939731281789229, 0.01836785702503421, -0.02969229030979317, 0.02617487906911791, -0.21762669157769834, 0.06434602678882298, -0.23286915011191447, -0.031549930377752056, -0.05684737929724356, 0.020212097102249006, 0.03476867206766616, -0.3576366288950608, 0.001157567339016523, -0.04055463649191946, 0.028285431060588586, -0.08675213129575944, -0.1408839695208337, -0.02665644192646416, 0.154907076425723, 0.14465090846745357, -0.05569742812406061, 0.12850522404864617, -0.09625565926595621, -0.2335639898958118, 0.38560710908880214, -0.0827643940772176, -0.13853153979124608, 0.08115860472913573, -0.08646840889756598, -0.05677337021605, 0.14437019038775573, 0.20999208352171211, 0.07727598434360991, -0.19106449245274984, 0.031313317153184035, -0.081419234755654, 0.18489890257716649, 0.09073612276968435, -0.0338473804060768, 0.13703934018465005, 0.1791987730667534, 0.187252100953926, 0.09772454373796219, -0.04790479453967345, -0.20806161171329096, -0.22050479883855245, -0.10526016298037186, -0.17875034639497622, 0.009565459284638552, -0.14753960705544938, -0.11640729436631836, 0.3830737675768587, 0.13387268538873806, 0.09189303565196365, 0.16039955474029197, 0.3110191068500749, 0.10819617686895712, -0.0161683277544381, 0.1746997413102467, 0.16372380303160386, -0.0359422188100651, 0.16374768279112126, -0.21617932086034367, 0.18004717470187717, 0.03764101694215019] |
1,802.03011 | The gluon condensate in an effective SU(2) Yang-Mills theory | We make progress towards a derivation of a low energy effective theory for
SU(2) Yang-Mills theory. This low energy action is computed to 1-loop using the
renormalization group technique, taking proper care of the Slavnov-Taylor
identities in the Maximal Abelian Gauge. After that, we perform the Spin-Charge
decomposition in a way proposed by L.D. Faddeev and A.J. Niemi. The resulting
action describes a pair of non-linear O(3) nonlinear sigma models interacting
with a scalar field. The potential of the scalar field is a Mexican hat and the
location of the minima sets the energy scale of solitonic configurations of the
sigma model fields whose excitations correspond to glueball states.
| hep-th math-ph math.MP | we make progress towards a derivation of a low energy effective theory for su2 yangmills theory this low energy action is computed to 1loop using the renormalization group technique taking proper care of the slavnovtaylor identities in the maximal abelian gauge after that we perform the spincharge decomposition in a way proposed by ld faddeev and aj niemi the resulting action describes a pair of nonlinear o3 nonlinear sigma models interacting with a scalar field the potential of the scalar field is a mexican hat and the location of the minima sets the energy scale of solitonic configurations of the sigma model fields whose excitations correspond to glueball states | [['we', 'make', 'progress', 'towards', 'a', 'derivation', 'of', 'a', 'low', 'energy', 'effective', 'theory', 'for', 'su2', 'yangmills', 'theory', 'this', 'low', 'energy', 'action', 'is', 'computed', 'to', '1loop', 'using', 'the', 'renormalization', 'group', 'technique', 'taking', 'proper', 'care', 'of', 'the', 'slavnovtaylor', 'identities', 'in', 'the', 'maximal', 'abelian', 'gauge', 'after', 'that', 'we', 'perform', 'the', 'spincharge', 'decomposition', 'in', 'a', 'way', 'proposed', 'by', 'ld', 'faddeev', 'and', 'aj', 'niemi', 'the', 'resulting', 'action', 'describes', 'a', 'pair', 'of', 'nonlinear', 'o3', 'nonlinear', 'sigma', 'models', 'interacting', 'with', 'a', 'scalar', 'field', 'the', 'potential', 'of', 'the', 'scalar', 'field', 'is', 'a', 'mexican', 'hat', 'and', 'the', 'location', 'of', 'the', 'minima', 'sets', 'the', 'energy', 'scale', 'of', 'solitonic', 'configurations', 'of', 'the', 'sigma', 'model', 'fields', 'whose', 'excitations', 'correspond', 'to', 'glueball', 'states']] | [-0.1599480802569231, 0.16294452486508484, -0.13844632282383193, 0.09301190499596537, -0.06617859532894275, -0.11024672650185269, 0.02679630881389005, 0.3222740238293185, -0.19561139625334822, -0.26579008274925275, 0.03810931424345445, -0.265919890186382, -0.14729101499200825, 0.10428770918424728, 0.021058939483361568, 0.03592022616040269, 0.01114048159450566, 0.08274467721786521, -0.08797639876672435, -0.20244983670840022, 0.30735272662970453, 0.016919308717986314, 0.25585468388547045, 0.048594665380382755, 0.13209651170700037, 0.03411800235108293, -0.006870212708386259, -0.005468400159995969, -0.09324237006032089, 0.1324521317654033, 0.20899753354494743, 0.04218579536739634, 0.22588115622644064, -0.3953452420959232, -0.20987438451532925, 0.0927202056221869, 0.1147822961894744, 0.134722420732825, -0.012708043389090705, -0.28552927876557777, 0.06103213476401608, -0.18862788108339823, -0.1937643733834677, -0.09279947282763523, 0.027857155301992637, -0.07251550571634136, -0.28517900244226047, 0.08969095247074611, -0.005205147441502216, 0.052808086328003385, -0.08067118797724673, -0.11033481565398087, -0.08303491646475201, 0.07123888030631143, 0.07672095908292083, 0.0930872953522506, 0.1291438269326378, -0.2244472847866971, -0.0976770491992901, 0.40399600920874046, -0.11360434618769982, -0.22375980501678353, 0.11343738268377311, -0.09603832246000887, -0.13059549554413474, 0.12336973015885425, 0.1208582434565544, 0.11597802166169116, -0.14379094106170837, 0.2072084449320271, -0.046696396619337825, 0.1327283900303749, 0.04427746249311561, 0.02229422379558513, 0.215945679549162, 0.12294013983860544, 0.03088459440019973, 0.10739837907716085, -0.024624130267803686, -0.11743802841701502, -0.3690278220819224, -0.11983960933359596, -0.12254234047504056, 0.08490495446112452, -0.09801617014374575, -0.16231992777966714, 0.44646493411289717, 0.10338915798838737, 0.16028532460161032, 0.043142883045120387, 0.2234784177196887, 0.1623968715488979, 0.09006528301301216, 0.04917437075466396, 0.22062443049385325, 0.19527934308573947, 0.052792649451267284, -0.2881878114587397, -0.14831397014695707, 0.1679997372274381] |
1,802.03012 | Resource Allocation in Heterogenous Full-duplex OFDMA Networks: Design
and Analysis | Recent studies indicate the feasibility of full-duplex (FD) bidirectional
wireless communications. Due to its potential to increase the capacity,
analyzing the performance of a cellular network that contains full-duplex
devices is crucial. In this paper, we consider maximizing the weighted sum-rate
of downlink and uplink of an FD heterogeneous OFDMA network where each cell
consists of an imperfect FD base-station (BS) and a mixture of half-duplex and
imperfect full-duplex mobile users. To this end, first, the joint problem of
sub-channel assignment and power allocation for a single cell network is
investigated. Then, the proposed algorithms are extended for solving the
optimization problem for an FD heterogeneous network in which intra-cell and
inter-cell interferences are taken into account. Simulation results demonstrate
that in a single cell network, when all the users and the BSs are perfect FD
nodes, the network throughput could be doubled. Otherwise, the performance
improvement is limited by the inter-cell interference, inter-node interference,
and self-interference. We also investigate the effect of the percentage of FD
users on the network performance in both indoor and outdoor scenarios, and
analyze the effect of the self-interference cancellation capability of the FD
nodes on the network performance.
| cs.NI | recent studies indicate the feasibility of fullduplex fd bidirectional wireless communications due to its potential to increase the capacity analyzing the performance of a cellular network that contains fullduplex devices is crucial in this paper we consider maximizing the weighted sumrate of downlink and uplink of an fd heterogeneous ofdma network where each cell consists of an imperfect fd basestation bs and a mixture of halfduplex and imperfect fullduplex mobile users to this end first the joint problem of subchannel assignment and power allocation for a single cell network is investigated then the proposed algorithms are extended for solving the optimization problem for an fd heterogeneous network in which intracell and intercell interferences are taken into account simulation results demonstrate that in a single cell network when all the users and the bss are perfect fd nodes the network throughput could be doubled otherwise the performance improvement is limited by the intercell interference internode interference and selfinterference we also investigate the effect of the percentage of fd users on the network performance in both indoor and outdoor scenarios and analyze the effect of the selfinterference cancellation capability of the fd nodes on the network performance | [['recent', 'studies', 'indicate', 'the', 'feasibility', 'of', 'fullduplex', 'fd', 'bidirectional', 'wireless', 'communications', 'due', 'to', 'its', 'potential', 'to', 'increase', 'the', 'capacity', 'analyzing', 'the', 'performance', 'of', 'a', 'cellular', 'network', 'that', 'contains', 'fullduplex', 'devices', 'is', 'crucial', 'in', 'this', 'paper', 'we', 'consider', 'maximizing', 'the', 'weighted', 'sumrate', 'of', 'downlink', 'and', 'uplink', 'of', 'an', 'fd', 'heterogeneous', 'ofdma', 'network', 'where', 'each', 'cell', 'consists', 'of', 'an', 'imperfect', 'fd', 'basestation', 'bs', 'and', 'a', 'mixture', 'of', 'halfduplex', 'and', 'imperfect', 'fullduplex', 'mobile', 'users', 'to', 'this', 'end', 'first', 'the', 'joint', 'problem', 'of', 'subchannel', 'assignment', 'and', 'power', 'allocation', 'for', 'a', 'single', 'cell', 'network', 'is', 'investigated', 'then', 'the', 'proposed', 'algorithms', 'are', 'extended', 'for', 'solving', 'the', 'optimization', 'problem', 'for', 'an', 'fd', 'heterogeneous', 'network', 'in', 'which', 'intracell', 'and', 'intercell', 'interferences', 'are', 'taken', 'into', 'account', 'simulation', 'results', 'demonstrate', 'that', 'in', 'a', 'single', 'cell', 'network', 'when', 'all', 'the', 'users', 'and', 'the', 'bss', 'are', 'perfect', 'fd', 'nodes', 'the', 'network', 'throughput', 'could', 'be', 'doubled', 'otherwise', 'the', 'performance', 'improvement', 'is', 'limited', 'by', 'the', 'intercell', 'interference', 'internode', 'interference', 'and', 'selfinterference', 'we', 'also', 'investigate', 'the', 'effect', 'of', 'the', 'percentage', 'of', 'fd', 'users', 'on', 'the', 'network', 'performance', 'in', 'both', 'indoor', 'and', 'outdoor', 'scenarios', 'and', 'analyze', 'the', 'effect', 'of', 'the', 'selfinterference', 'cancellation', 'capability', 'of', 'the', 'fd', 'nodes', 'on', 'the', 'network', 'performance']] | [-0.3037266012090139, -0.019254150687648245, 0.0535143063021585, -0.014201797282872483, -0.05183120144960972, -0.22944757090881468, 0.14739211691865842, 0.39125364823983266, -0.26150537482821024, -0.24780287164239548, 0.025948781849673162, -0.2607040151523856, -0.2372217331212969, 0.08821796411887194, -0.13976628597682486, 0.025980847555463416, 0.08806841791165658, 0.0503373164158219, 0.023751899327796238, -0.27019118471877074, 0.2904274777616732, 0.1315748102413729, 0.411468868326539, 0.06458338093108092, 0.03799941909905428, 0.013634837948932098, -0.02014856141251631, -0.020817856977765378, -0.021866665708083207, 0.07304977179648212, 0.3383879119864641, 0.18064249007938765, 0.29408905361898435, -0.4518756947360742, -0.30228691315517214, 0.11846568351133893, 0.19078217085498647, 0.029465752820938062, -0.016166547570640268, -0.28928750998173386, 0.16494612221259816, -0.2517291016637897, 0.02144999554364357, 0.059359488397454606, -0.10541454567932165, 0.060267932197222346, -0.38519455891562243, -0.0043443783838600395, -0.012828926826851108, 0.03515492984308646, -0.054783426787934075, -0.12149142294477384, 0.02817515763095938, 0.22783436041328317, 0.00933725689478123, -0.060299980033260696, 0.07452461564650711, -0.11707913924399643, -0.12194611862636147, 0.4014860522384063, 0.03827370068249412, -0.2253409346852165, 0.12839206812354043, -0.0695520644983611, -0.0733621186368486, 0.16540839801757382, 0.2826836519728367, 0.030515057541047916, -0.21283483812025783, 0.015260359809363785, -0.01723534728233249, 0.11958806722974166, 0.07382494756856407, 0.12068328657306922, 0.1291150896750295, 0.27325785882078496, 0.14134376970812296, 0.13442722259937093, -0.17185839807781844, -0.10546056555631833, -0.18750299063917153, -0.14454801472990464, -0.23598566566629764, 0.0006366355249132865, -0.10924872950082108, -0.05314589004294994, 0.3912772529620643, 0.11045288696455267, 0.09093706481254253, 0.11698017154569523, 0.450575248312014, 0.08498590160161257, 0.06630682338458987, 0.12100215470657134, 0.21078129190860542, 0.08985829566462109, 0.16506751004508727, -0.3090508996914977, 0.03061636367466492, -0.05067151358637672] |
1,802.03013 | D2.4 Report on the final prototype of programming abstractions for
energy-efficient inter-process communication | Work package 2 (WP2) aims to develop libraries for energy-efficient
inter-process communication and data sharing on the EXCESS platforms. The
Deliverable D2.4 reports on the final prototype of programming abstractions for
energy-efficient inter- process communication. Section 1 is the updated
overview of the prototype of programming abstraction and devised power/energy
models. The Section 2-6 contain the latest results of the four studies: i)
GreenBST, a energy-efficient and concurrent search tree (cf. Section 2) ii)
Customization methodology for implementation of streaming aggregation in
embedded systems (cf. Section 3) iii) Energy Model on CPU for Lock-free
Data-structures in Dynamic Environments (cf. Section 4.10) iv) A General and
Validated Energy Complexity Model for Multithreaded Algorithms (cf. Section 5)
| cs.DC | work package 2 wp2 aims to develop libraries for energyefficient interprocess communication and data sharing on the excess platforms the deliverable d24 reports on the final prototype of programming abstractions for energyefficient inter process communication section 1 is the updated overview of the prototype of programming abstraction and devised powerenergy models the section 26 contain the latest results of the four studies i greenbst a energyefficient and concurrent search tree cf section 2 ii customization methodology for implementation of streaming aggregation in embedded systems cf section 3 iii energy model on cpu for lockfree datastructures in dynamic environments cf section 410 iv a general and validated energy complexity model for multithreaded algorithms cf section 5 | [['work', 'package', '2', 'wp2', 'aims', 'to', 'develop', 'libraries', 'for', 'energyefficient', 'interprocess', 'communication', 'and', 'data', 'sharing', 'on', 'the', 'excess', 'platforms', 'the', 'deliverable', 'd24', 'reports', 'on', 'the', 'final', 'prototype', 'of', 'programming', 'abstractions', 'for', 'energyefficient', 'inter', 'process', 'communication', 'section', '1', 'is', 'the', 'updated', 'overview', 'of', 'the', 'prototype', 'of', 'programming', 'abstraction', 'and', 'devised', 'powerenergy', 'models', 'the', 'section', '26', 'contain', 'the', 'latest', 'results', 'of', 'the', 'four', 'studies', 'i', 'greenbst', 'a', 'energyefficient', 'and', 'concurrent', 'search', 'tree', 'cf', 'section', '2', 'ii', 'customization', 'methodology', 'for', 'implementation', 'of', 'streaming', 'aggregation', 'in', 'embedded', 'systems', 'cf', 'section', '3', 'iii', 'energy', 'model', 'on', 'cpu', 'for', 'lockfree', 'datastructures', 'in', 'dynamic', 'environments', 'cf', 'section', '410', 'iv', 'a', 'general', 'and', 'validated', 'energy', 'complexity', 'model', 'for', 'multithreaded', 'algorithms', 'cf', 'section', '5']] | [-0.16777646589387013, -0.01548407286846716, -0.004589303835242039, 0.06687674019442631, -0.058804863753418125, -0.22640638849126143, 0.09225528000184056, 0.3946952209072678, -0.21663482642830595, -0.3729518813963391, 0.08943154825216257, -0.24720646636642254, -0.07556330853370591, 0.18600175707200706, -0.026208120095441444, 0.07625447558402493, 0.091084391127847, -0.021919095700835448, 0.006655318506282607, -0.26526217085203124, 0.2433474215335752, 0.09005180692602471, 0.30668390446685645, 0.07752273426587253, 0.044885211826400144, 0.061622070528468804, -0.09897107623053894, -0.05058445335414849, -0.124810949854324, 0.15785402624067246, 0.31895679483954664, 0.23215842910066017, 0.22598386832243322, -0.4079227028986472, -0.11715545117132072, -0.0336642532789132, 0.14005012896826916, 0.04887960202534471, -0.06192070422101799, -0.2379936113863726, 0.09851425371067435, -0.25515177913761716, -0.04900061418792527, -0.004659268637432864, 0.05787356651649533, -0.001182750805910154, -0.24233195948283792, -0.02751487821111815, 0.04577639868907761, 0.09069243887962218, -0.06922778351591867, -0.18602224822429808, 0.016699648821693763, 0.01783180959816826, -0.07671047123828127, 0.0062969249056390765, 0.1653628124316272, -0.08540066945971105, -0.21058289647478154, 0.3590129042011604, -0.02117323914640828, -0.14427836100558603, 0.19116792296827362, 0.005412295905938535, -0.2053438373555413, 0.14147346626084886, 0.2823917965022765, 0.06442079303394023, -0.18360011596559433, 0.12936705297161416, 0.06176414251789091, 0.20380019253168843, 0.034373141939572076, -0.0003986619489488045, 0.10789233594806048, 0.2716053554853588, 0.03441090241335986, 0.07553867563776868, -0.07144904714445338, -0.10770114128102075, -0.2738139179143074, -0.20080427057926722, -0.0704476977923166, -0.02498525476058651, -0.068520607945015, -0.12625712029566466, 0.37183062958514745, 0.14466773208308345, 0.12213429715280143, 0.09512652756874511, 0.4100865283245711, 0.03917472299776579, 0.0921946512412672, 0.1511100309680363, 0.13211388655799328, 0.04551074969614938, 0.2025605175488939, -0.1417750920467242, 0.0663492555337909, 0.022313949909355296] |
1,802.03014 | On Some Ternary LCD Codes | The main aim of this paper is to study $LCD$ codes. Linear code with
complementary dual($LCD$) are those codes which have their intersection with
their dual code as $\{0\}$. In this paper we will give rather alternative proof
of Massey's theorem\cite{8}, which is one of the most important
characterization of $LCD$ codes. Let $LCD[n,k]_3$ denote the maximum of
possible values of $d$ among $[n,k,d]$ ternary $LCD$ codes. In \cite{4},
authors have given upper bound on $LCD[n,k]_2$ and extended this result for
$LCD[n,k]_q$, for any $q$, where $q$ is some prime power. We will discuss cases
when this bound is attained for $q=3$.
| cs.IT math.IT | the main aim of this paper is to study lcd codes linear code with complementary duallcd are those codes which have their intersection with their dual code as 0 in this paper we will give rather alternative proof of masseys theoremcite8 which is one of the most important characterization of lcd codes let lcdnk_3 denote the maximum of possible values of d among nkd ternary lcd codes in cite4 authors have given upper bound on lcdnk_2 and extended this result for lcdnk_q for any q where q is some prime power we will discuss cases when this bound is attained for q3 | [['the', 'main', 'aim', 'of', 'this', 'paper', 'is', 'to', 'study', 'lcd', 'codes', 'linear', 'code', 'with', 'complementary', 'duallcd', 'are', 'those', 'codes', 'which', 'have', 'their', 'intersection', 'with', 'their', 'dual', 'code', 'as', '0', 'in', 'this', 'paper', 'we', 'will', 'give', 'rather', 'alternative', 'proof', 'of', 'masseys', 'theoremcite8', 'which', 'is', 'one', 'of', 'the', 'most', 'important', 'characterization', 'of', 'lcd', 'codes', 'let', 'lcdnk_3', 'denote', 'the', 'maximum', 'of', 'possible', 'values', 'of', 'd', 'among', 'nkd', 'ternary', 'lcd', 'codes', 'in', 'cite4', 'authors', 'have', 'given', 'upper', 'bound', 'on', 'lcdnk_2', 'and', 'extended', 'this', 'result', 'for', 'lcdnk_q', 'for', 'any', 'q', 'where', 'q', 'is', 'some', 'prime', 'power', 'we', 'will', 'discuss', 'cases', 'when', 'this', 'bound', 'is', 'attained', 'for', 'q3']] | [-0.19132304003913747, 0.09059402538519917, -0.07825694694371912, 0.04656057233329524, -0.026824712391114898, -0.23963767468854033, 0.0016940454129280166, 0.33451854745208315, -0.25932444438380614, -0.2692476629157259, 0.13073262627556392, -0.26526631750730856, -0.14085255841715166, 0.24319709199621822, -0.12063571206773772, 0.04434086472949018, 0.031894678790874854, 0.09989510421086141, -0.10132071783476876, -0.3443247021335845, 0.3514176722677105, 0.11771289887602883, 0.1666429267838748, 0.05382232233938394, 0.015537040825519297, 0.001236727995083037, -0.02395393101103378, -0.03155464599145452, -0.24926196775314483, 0.15437178586073447, 0.3256893079737295, 0.18899000644909614, 0.19655660994238022, -0.3189384744436753, -0.16984964869069782, 0.16699981778116915, 0.1709312944416653, 0.10393415572770844, -0.03428427772237825, -0.1343660056026596, 0.17801223143540096, -0.17769564146345312, -0.07830647223469134, -0.00563434184049115, 0.07529244005604825, 0.04286315926877462, -0.2772656519793802, -0.05176704568844853, 0.12277569751622099, 0.11080195190534325, -0.04211941314155631, -0.20531787504583146, 0.0535465792301252, 0.098287240965139, 0.011965531159681504, 0.06778442157629991, -0.02962318828301222, -0.05934913537342741, -0.13359162480466896, 0.35163669133878717, -0.012237723147722356, -0.185258904773027, 0.12993426058756544, -0.13033443499318878, -0.11995231019888035, 0.06961280612670111, 0.19894053824034266, 0.15890592142393944, -0.07691102071663464, 0.1373038817793272, -0.119857382565511, 0.12285731137363297, 0.0868873133399345, 0.10824920758699076, 0.16784971041811836, 0.07839413520390864, 0.05614687782721688, 0.1961276550786664, -0.019735401870231286, -0.0022249105627498017, -0.32867391767789317, -0.160124983370417, -0.17243844345023837, 0.07550127768531592, -0.09153509144703599, -0.1497925819095337, 0.36315650314167897, 0.12973629522391342, 0.12653564291093686, 0.10751376087269322, 0.2498756126933402, 0.05262527074265021, 0.05840741588047357, 0.14220765976216457, 0.17872014265146455, 0.1551119913111883, -0.034508929705491874, -0.14306989340393833, 0.07887317069025353, 0.14429668792419964] |
1,802.03015 | Non-radial Pulsation in the First Overtone Cepheids of the Magellanic
Clouds | We have analysed photometric data for the first overtone Cepheids in the
Magellanic Clouds from the OGLE collection. In more than 500 stars, we have
detected additional variability with periods shorter than the first overtone
period and period ratios in the (0.60, 0.65) range. The sample includes double
periodic stars detected previously by the OGLE team as well as new discoveries.
In the Petersen diagram, these stars form three well-separated sequences. In
some stars, we have found simultaneously two close periodicities corresponding
to two sequences in the Petersen diagram. In a significant fraction of stars,
we have detected the power excess at half the frequency of the additional
variability. Interestingly, most of these stars form the middle sequence in the
Petersen diagram.
| astro-ph.SR | we have analysed photometric data for the first overtone cepheids in the magellanic clouds from the ogle collection in more than 500 stars we have detected additional variability with periods shorter than the first overtone period and period ratios in the 060 065 range the sample includes double periodic stars detected previously by the ogle team as well as new discoveries in the petersen diagram these stars form three wellseparated sequences in some stars we have found simultaneously two close periodicities corresponding to two sequences in the petersen diagram in a significant fraction of stars we have detected the power excess at half the frequency of the additional variability interestingly most of these stars form the middle sequence in the petersen diagram | [['we', 'have', 'analysed', 'photometric', 'data', 'for', 'the', 'first', 'overtone', 'cepheids', 'in', 'the', 'magellanic', 'clouds', 'from', 'the', 'ogle', 'collection', 'in', 'more', 'than', '500', 'stars', 'we', 'have', 'detected', 'additional', 'variability', 'with', 'periods', 'shorter', 'than', 'the', 'first', 'overtone', 'period', 'and', 'period', 'ratios', 'in', 'the', '060', '065', 'range', 'the', 'sample', 'includes', 'double', 'periodic', 'stars', 'detected', 'previously', 'by', 'the', 'ogle', 'team', 'as', 'well', 'as', 'new', 'discoveries', 'in', 'the', 'petersen', 'diagram', 'these', 'stars', 'form', 'three', 'wellseparated', 'sequences', 'in', 'some', 'stars', 'we', 'have', 'found', 'simultaneously', 'two', 'close', 'periodicities', 'corresponding', 'to', 'two', 'sequences', 'in', 'the', 'petersen', 'diagram', 'in', 'a', 'significant', 'fraction', 'of', 'stars', 'we', 'have', 'detected', 'the', 'power', 'excess', 'at', 'half', 'the', 'frequency', 'of', 'the', 'additional', 'variability', 'interestingly', 'most', 'of', 'these', 'stars', 'form', 'the', 'middle', 'sequence', 'in', 'the', 'petersen', 'diagram']] | [-0.1270120916382379, 0.1578083573258482, -0.06184666602276876, 0.09457935304304615, -0.09196540747280614, -0.05025395265871995, 0.1366069392977687, 0.39544028675824894, -0.18281667799875903, -0.3867639011214869, 0.04811040818935535, -0.3462040798490978, -0.05886103065501227, 0.22654856865477488, -0.058369402315650805, -0.027237146121419233, 0.11738762430480269, -0.01558883788186263, -0.002332951103482151, -0.30403371764438564, 0.25078254355094776, -0.07413352763310807, 0.14500626781191983, -0.13393688485499655, -0.04595016478274598, -0.10668085782490976, -0.06588836913769988, -0.04469268672840029, -0.15154064896699712, 0.0405030366277597, 0.2430056418124281, 0.09511698091919839, 0.19847521165454546, -0.305217591480466, -0.16115375870044846, 0.09981561572000873, 0.22968429056584042, 0.028706244818988393, -0.01761096516172268, -0.24976045778784595, 0.07050972413195328, -0.1562012602932003, -0.16708865904890488, 0.030914544578275232, 0.1111674940434941, 0.05968466940809224, -0.14592128564898482, 0.10124785604230205, 0.030801926912228408, 0.18399830815739182, -0.11179316941396807, -0.18654075485547303, -0.050060227431250034, 0.12426700366691487, 0.026804241489191524, 0.04443131647355183, -0.003297337269807448, -0.08515872221562218, -0.07658521508889608, 0.3767228642112163, -0.1400477344498943, -0.014982066084783464, 0.14832831700771407, -0.2492162750415565, -0.24563924806787954, 0.15619853810697307, 0.1267858106475018, 0.14697789353486457, -0.17069742373156468, -0.0431113141807384, 0.01115337890939268, 0.21664525599783804, 0.17123331982531723, 0.0909598756688418, 0.2940949313800599, 0.11185131467245214, -0.0073808407922443305, 0.1548799232820232, -0.2714863176625527, -0.0955750754782472, -0.23606334605300036, -0.0876625388990477, -0.11090719686882174, 0.007698620417628621, -0.14719988475923454, -0.10870653720282507, 0.3828022471193957, 0.06063478666101964, 0.18601834712756157, 0.025227064690476315, 0.24941408122340064, 0.08962079545303599, 0.1636678846335882, 0.09477436132958067, 0.342665280600233, 0.16417151154400628, 0.1317556000144801, -0.19725645590405605, 0.08842156131629694, 0.011004024097451666] |
1,802.03016 | Zeta-function Regularization of Holographic Wilson Loops | Using $\zeta$-function regularization, we study the one-loop effective action
of fundamental strings in $AdS_5\times S^5$ dual to the latitude
$\frac{1}{4}$-BPS Wilson loop in $\mathcal{N}=4$ Super-Yang-Mills theory. To
avoid certain ambiguities inherent to string theory on curved backgrounds we
subtract the effective action of the holographic $\frac{1}{2}$-BPS Wilson loop.
We find agreement with the expected field theory result at first order in the
small latitude angle expansion but discrepancies at higher order.
| hep-th | using zetafunction regularization we study the oneloop effective action of fundamental strings in ads_5times s5 dual to the latitude frac14bps wilson loop in mathcaln4 superyangmills theory to avoid certain ambiguities inherent to string theory on curved backgrounds we subtract the effective action of the holographic frac12bps wilson loop we find agreement with the expected field theory result at first order in the small latitude angle expansion but discrepancies at higher order | [['using', 'zetafunction', 'regularization', 'we', 'study', 'the', 'oneloop', 'effective', 'action', 'of', 'fundamental', 'strings', 'in', 'ads_5times', 's5', 'dual', 'to', 'the', 'latitude', 'frac14bps', 'wilson', 'loop', 'in', 'mathcaln4', 'superyangmills', 'theory', 'to', 'avoid', 'certain', 'ambiguities', 'inherent', 'to', 'string', 'theory', 'on', 'curved', 'backgrounds', 'we', 'subtract', 'the', 'effective', 'action', 'of', 'the', 'holographic', 'frac12bps', 'wilson', 'loop', 'we', 'find', 'agreement', 'with', 'the', 'expected', 'field', 'theory', 'result', 'at', 'first', 'order', 'in', 'the', 'small', 'latitude', 'angle', 'expansion', 'but', 'discrepancies', 'at', 'higher', 'order']] | [-0.1534729588442338, 0.17940849436997947, -0.07092591417743496, 0.16066025635621078, -0.09480239606370598, -0.09426557624214132, 0.0215848342426987, 0.3540904791894513, -0.1429849458517323, -0.2696884585360826, 0.061375708996423216, -0.3023097182978207, -0.16785171788028427, 0.06498971849050321, -0.11898619141167319, 0.04897925492481027, -0.020112676283633207, 0.08580045366305596, -0.12943594713865872, -0.2433256757721095, 0.29943314469485005, 0.07694969052107821, 0.2770195789897526, 0.09258023278236809, 0.10098790861403859, 0.004311304355800991, -0.04612923869338464, 0.051517368281181426, -0.1090279913927153, 0.13937457157364508, 0.24947614730073428, -0.01991205175184238, 0.07461484138604621, -0.4453954674880689, -0.1918196620445856, 0.01711345732894162, 0.18793245209840087, 0.1313285932049785, 0.058101869366971225, -0.2070611043452797, 0.02186119965684246, -0.16832325150075197, -0.2083397375183626, -0.08160403073096359, -0.012421805665723349, -0.17272261172388745, -0.2253701842757283, 0.050907242061852306, -0.09169364864872374, 0.06952393800020218, -0.0076204702277785875, -0.0800389355625695, 0.003955534272368106, 0.11591458055649845, 0.17759161757331499, 0.17948080240224135, 0.10554459663173578, -0.2112298357156171, -0.13689787550763766, 0.34537403044146553, -0.13274661943801797, -0.16097892833952332, 0.10565310029942594, -0.2678853927416281, -0.20831002380279168, 0.13185201532557494, 0.11748538648342373, 0.1721442627497542, -0.09647420419275131, 0.22392450084149, 0.02274075386927686, 0.13003129422874518, 0.1876267649390748, 0.021737326801370034, 0.2567156600162492, 0.031560161277245154, 0.014449792835389224, 0.13118609953934038, -0.07231503138384245, -0.1424986268262523, -0.42703050626835354, -0.03942758976940958, -0.03396885990309463, 0.07935808804935553, -0.19393044985620908, -0.2222928433010066, 0.317407043808153, 0.1939383224571045, 0.14567547071147974, 0.08618011215413121, 0.24379579843559734, 0.13629992753529632, 0.08255989809559894, 0.06446870841400724, 0.23334822027196347, 0.17288237280199226, 0.08789513124362894, -0.3263946469089436, -0.1626490939434775, 0.2615276577974289] |
1,802.03017 | Environmental Quenching of Low-Mass Field Galaxies | In the local Universe, there is a strong division in the star-forming
properties of low-mass galaxies, with star formation largely ubiquitous amongst
the field population while satellite systems are predominantly quenched. This
dichotomy implies that environmental processes play the dominant role in
suppressing star formation within this low-mass regime (${M}_{\star} \sim
10^{5.5-8}~{\rm M}_{\odot}$). As shown by observations of the Local Volume,
however, there is a non-negligible population of passive systems in the field,
which challenges our understanding of quenching at low masses. By applying the
satellite quenching models of Fillingham et al. (2015) to subhalo populations
in the Exploring the Local Volume In Simulations (ELVIS) suite, we investigate
the role of environmental processes in quenching star formation within the
nearby field. Using model parameters that reproduce the satellite quenched
fraction in the Local Group, we predict a quenched fraction -- due solely to
environmental effects -- of $\sim 0.52 \pm 0.26$ within $1< R/R_{\rm vir} < 2$
of the Milky Way and M31. This is in good agreement with current observations
of the Local Volume and suggests that the majority of the passive field systems
observed at these distances are quenched via environmental mechanisms. Beyond
$2~R_{\rm vir}$, however, dwarf galaxy quenching becomes difficult to explain
through an interaction with either the Milky Way or M31, such that more
isolated, field dwarfs may be self-quenched as a result of star-formation
feedback.
| astro-ph.GA | in the local universe there is a strong division in the starforming properties of lowmass galaxies with star formation largely ubiquitous amongst the field population while satellite systems are predominantly quenched this dichotomy implies that environmental processes play the dominant role in suppressing star formation within this lowmass regime m_star sim 10558rm m_odot as shown by observations of the local volume however there is a nonnegligible population of passive systems in the field which challenges our understanding of quenching at low masses by applying the satellite quenching models of fillingham et al 2015 to subhalo populations in the exploring the local volume in simulations elvis suite we investigate the role of environmental processes in quenching star formation within the nearby field using model parameters that reproduce the satellite quenched fraction in the local group we predict a quenched fraction due solely to environmental effects of sim 052 pm 026 within 1 rr_rm vir 2 of the milky way and m31 this is in good agreement with current observations of the local volume and suggests that the majority of the passive field systems observed at these distances are quenched via environmental mechanisms beyond 2r_rm vir however dwarf galaxy quenching becomes difficult to explain through an interaction with either the milky way or m31 such that more isolated field dwarfs may be selfquenched as a result of starformation feedback | [['in', 'the', 'local', 'universe', 'there', 'is', 'a', 'strong', 'division', 'in', 'the', 'starforming', 'properties', 'of', 'lowmass', 'galaxies', 'with', 'star', 'formation', 'largely', 'ubiquitous', 'amongst', 'the', 'field', 'population', 'while', 'satellite', 'systems', 'are', 'predominantly', 'quenched', 'this', 'dichotomy', 'implies', 'that', 'environmental', 'processes', 'play', 'the', 'dominant', 'role', 'in', 'suppressing', 'star', 'formation', 'within', 'this', 'lowmass', 'regime', 'm_star', 'sim', '10558rm', 'm_odot', 'as', 'shown', 'by', 'observations', 'of', 'the', 'local', 'volume', 'however', 'there', 'is', 'a', 'nonnegligible', 'population', 'of', 'passive', 'systems', 'in', 'the', 'field', 'which', 'challenges', 'our', 'understanding', 'of', 'quenching', 'at', 'low', 'masses', 'by', 'applying', 'the', 'satellite', 'quenching', 'models', 'of', 'fillingham', 'et', 'al', '2015', 'to', 'subhalo', 'populations', 'in', 'the', 'exploring', 'the', 'local', 'volume', 'in', 'simulations', 'elvis', 'suite', 'we', 'investigate', 'the', 'role', 'of', 'environmental', 'processes', 'in', 'quenching', 'star', 'formation', 'within', 'the', 'nearby', 'field', 'using', 'model', 'parameters', 'that', 'reproduce', 'the', 'satellite', 'quenched', 'fraction', 'in', 'the', 'local', 'group', 'we', 'predict', 'a', 'quenched', 'fraction', 'due', 'solely', 'to', 'environmental', 'effects', 'of', 'sim', '052', 'pm', '026', 'within', '1', 'rr_rm', 'vir', '2', 'of', 'the', 'milky', 'way', 'and', 'm31', 'this', 'is', 'in', 'good', 'agreement', 'with', 'current', 'observations', 'of', 'the', 'local', 'volume', 'and', 'suggests', 'that', 'the', 'majority', 'of', 'the', 'passive', 'field', 'systems', 'observed', 'at', 'these', 'distances', 'are', 'quenched', 'via', 'environmental', 'mechanisms', 'beyond', '2r_rm', 'vir', 'however', 'dwarf', 'galaxy', 'quenching', 'becomes', 'difficult', 'to', 'explain', 'through', 'an', 'interaction', 'with', 'either', 'the', 'milky', 'way', 'or', 'm31', 'such', 'that', 'more', 'isolated', 'field', 'dwarfs', 'may', 'be', 'selfquenched', 'as', 'a', 'result', 'of', 'starformation', 'feedback']] | [-0.11516467344751748, 0.1387411536619376, -0.06578661983491786, 0.10002243706549052, -0.02923390992613609, -0.013380614358798735, 0.04687685732746364, 0.37416630279871504, -0.1734695202113861, -0.3683517873204047, 0.03754975413851623, -0.25380086347286124, -0.08227040510860206, 0.19089702146551904, -0.04040949797594554, -0.05954090371129236, 0.021448979983688332, -0.08440929305860274, -0.013230561465856485, -0.2775772385284654, 0.3093748362828462, 0.07814650984073523, 0.18206148080311582, -0.04502399926215211, 0.028353244811764204, -0.03720931966173729, -0.05762259162396991, -0.020590860051015625, -0.15459156238557625, -0.019029409836678366, 0.23845242091083815, 0.07377226240974519, 0.27932747588160317, -0.40224476761483985, -0.22316640251093695, 0.11028964008645355, 0.20168546863715164, 0.05287950297029705, -0.15248168965451572, -0.24328582811410474, 0.09318446317255231, -0.1986629081366118, -0.16890214051818475, 0.0473512173713451, 0.0515456082154872, 0.02411867848693256, -0.2359965344866006, 0.1994235787424259, 0.04911145076039247, 0.07554609698958561, -0.07725978500629285, -0.0495788584984049, -0.08090331787129149, 0.11292947801276958, 0.021049501999966327, 0.10518656521994021, 0.24442506120249163, -0.18539963307245802, -0.02885296347761011, 0.4196724797033572, -0.07359819504615318, -0.013742546167382639, 0.27456621152149246, -0.2249968173107066, -0.19942925565659866, 0.09319811546863223, 0.14187347116655605, 0.07488149734854233, -0.17441574216354638, 0.03475388021264995, -0.0014944369468139485, 0.19304012958829325, -0.004475417868109487, 0.07135736598323612, 0.3280893307029536, 0.1638602022399677, 0.04905896392717425, 0.025326550760187923, -0.12311776706545581, -0.0948237427528511, -0.2060221317057897, -0.08004836317039528, -0.1256837812772054, 0.07909769946659903, -0.1178570679495741, -0.08460557594285742, 0.31207011258707745, 0.13074615008528262, 0.25298009412862094, 0.0324531938993979, 0.29244759579471846, 0.07184526968194405, 0.13834503371201987, 0.10134727753757033, 0.3050562337032586, 0.17838587164338346, 0.05046438588552909, -0.273155879177336, 0.09500905447930563, -0.017709754399090474] |
1,802.03018 | Spectral models for binary products: Unifying Subdwarfs and Wolf-Rayet
stars as a sequence of stripped-envelope stars | Stars stripped of their envelope through interaction in a binary are
generally not considered when accounting for ionizing radiation from stellar
populations, despite the expectation that stripped stars emit hard ionizing
radiation, form frequently and live 10-100 times longer than single massive
stars. We compute the first grid of spectral models specially made for stars
stripped in binaries for a range of progenitor masses (2-20$M_{\odot}$) and
metallicities covering a wide range.
For stripped stars with masses between 0.3-7$M_{\odot}$, we find high
effective temperatures (20-100 kK, increasing with mass), small radii
(0.2-1$R_{\odot}$) and high bolometric luminosities, comparable to that of
their progenitor before stripping. The spectra show a continuous sequence that
naturally bridges subdwarf-type stars and Wolf-Rayet like spectra. For
intermediate masses we find hybrid spectral classes showing a mixture of
absorption and emission lines. These appear for stars with mass loss rates of
$10^{-8}-10^{-6}M_{\odot}$/yr, which have semi-transparent atmospheres. At low
metallicity, substantial H-rich layers are left at the surface and we predict
spectra that resemble O-type stars instead. We obtain spectra undistinguishable
from subdwarfs for stripped stars with masses up to 1.7$M_{\odot}$, which
questions whether the widely adopted canonical value of 0.47$M_{\odot}$ is
uniformly valid.
Increasing the observed sample of stripped stars will provide necessary tests
for the physics of interaction, internal mixing and stellar winds. We
investigate the feasibility to detect stripped stars next to an optically
bright companion and recommend searches for their UV excess and possible
emission lines, most notably HeII4686 in the optical and HeII1640 in the UV.
Our models are publicly available for further investigations or inclusion in
spectral synthesis simulations.
| astro-ph.SR astro-ph.GA | stars stripped of their envelope through interaction in a binary are generally not considered when accounting for ionizing radiation from stellar populations despite the expectation that stripped stars emit hard ionizing radiation form frequently and live 10100 times longer than single massive stars we compute the first grid of spectral models specially made for stars stripped in binaries for a range of progenitor masses 220m_odot and metallicities covering a wide range for stripped stars with masses between 037m_odot we find high effective temperatures 20100 kk increasing with mass small radii 021r_odot and high bolometric luminosities comparable to that of their progenitor before stripping the spectra show a continuous sequence that naturally bridges subdwarftype stars and wolfrayet like spectra for intermediate masses we find hybrid spectral classes showing a mixture of absorption and emission lines these appear for stars with mass loss rates of 108106m_odotyr which have semitransparent atmospheres at low metallicity substantial hrich layers are left at the surface and we predict spectra that resemble otype stars instead we obtain spectra undistinguishable from subdwarfs for stripped stars with masses up to 17m_odot which questions whether the widely adopted canonical value of 047m_odot is uniformly valid increasing the observed sample of stripped stars will provide necessary tests for the physics of interaction internal mixing and stellar winds we investigate the feasibility to detect stripped stars next to an optically bright companion and recommend searches for their uv excess and possible emission lines most notably heii4686 in the optical and heii1640 in the uv our models are publicly available for further investigations or inclusion in spectral synthesis simulations | [['stars', 'stripped', 'of', 'their', 'envelope', 'through', 'interaction', 'in', 'a', 'binary', 'are', 'generally', 'not', 'considered', 'when', 'accounting', 'for', 'ionizing', 'radiation', 'from', 'stellar', 'populations', 'despite', 'the', 'expectation', 'that', 'stripped', 'stars', 'emit', 'hard', 'ionizing', 'radiation', 'form', 'frequently', 'and', 'live', '10100', 'times', 'longer', 'than', 'single', 'massive', 'stars', 'we', 'compute', 'the', 'first', 'grid', 'of', 'spectral', 'models', 'specially', 'made', 'for', 'stars', 'stripped', 'in', 'binaries', 'for', 'a', 'range', 'of', 'progenitor', 'masses', '220m_odot', 'and', 'metallicities', 'covering', 'a', 'wide', 'range', 'for', 'stripped', 'stars', 'with', 'masses', 'between', '037m_odot', 'we', 'find', 'high', 'effective', 'temperatures', '20100', 'kk', 'increasing', 'with', 'mass', 'small', 'radii', '021r_odot', 'and', 'high', 'bolometric', 'luminosities', 'comparable', 'to', 'that', 'of', 'their', 'progenitor', 'before', 'stripping', 'the', 'spectra', 'show', 'a', 'continuous', 'sequence', 'that', 'naturally', 'bridges', 'subdwarftype', 'stars', 'and', 'wolfrayet', 'like', 'spectra', 'for', 'intermediate', 'masses', 'we', 'find', 'hybrid', 'spectral', 'classes', 'showing', 'a', 'mixture', 'of', 'absorption', 'and', 'emission', 'lines', 'these', 'appear', 'for', 'stars', 'with', 'mass', 'loss', 'rates', 'of', '108106m_odotyr', 'which', 'have', 'semitransparent', 'atmospheres', 'at', 'low', 'metallicity', 'substantial', 'hrich', 'layers', 'are', 'left', 'at', 'the', 'surface', 'and', 'we', 'predict', 'spectra', 'that', 'resemble', 'otype', 'stars', 'instead', 'we', 'obtain', 'spectra', 'undistinguishable', 'from', 'subdwarfs', 'for', 'stripped', 'stars', 'with', 'masses', 'up', 'to', '17m_odot', 'which', 'questions', 'whether', 'the', 'widely', 'adopted', 'canonical', 'value', 'of', '047m_odot', 'is', 'uniformly', 'valid', 'increasing', 'the', 'observed', 'sample', 'of', 'stripped', 'stars', 'will', 'provide', 'necessary', 'tests', 'for', 'the', 'physics', 'of', 'interaction', 'internal', 'mixing', 'and', 'stellar', 'winds', 'we', 'investigate', 'the', 'feasibility', 'to', 'detect', 'stripped', 'stars', 'next', 'to', 'an', 'optically', 'bright', 'companion', 'and', 'recommend', 'searches', 'for', 'their', 'uv', 'excess', 'and', 'possible', 'emission', 'lines', 'most', 'notably', 'heii4686', 'in', 'the', 'optical', 'and', 'heii1640', 'in', 'the', 'uv', 'our', 'models', 'are', 'publicly', 'available', 'for', 'further', 'investigations', 'or', 'inclusion', 'in', 'spectral', 'synthesis', 'simulations']] | [-0.0056373108949628655, 0.19045465975477083, -0.025564616589018933, 0.14302126130351098, -0.0953389574907935, -0.08310479325278161, 0.07065804005340816, 0.4699271356373524, -0.1580380269460595, -0.36049668392023215, 0.02549588098862352, -0.30887380072918647, 0.03653849633858324, 0.2136163115270812, -0.03411661229060533, -0.0309493354235131, 0.12314173461032064, -0.0740146638755015, -0.07072633215351604, -0.25243160262650166, 0.32228661223690813, 0.029299737043822043, 0.11679251488083257, -0.01874992146085088, 0.024580398577605734, -0.10539047080397163, -0.027727466784059428, -0.0724005843548534, -0.14112613421849135, 0.023228092937712903, 0.24111142766366986, 0.1336113429744728, 0.20612810021266342, -0.36545803069409605, -0.235800489045393, 0.08829435526679914, 0.22335277686271673, 0.04401997299596237, -0.13141422485216306, -0.214643436816718, 0.09918200088784662, -0.2082715200542365, -0.17171972806995306, 0.01586848178770966, 0.05326487844174083, 0.041123038979891974, -0.25780112960268387, 0.09266030403433922, 0.018561109120491893, 0.07835947127135184, -0.11853505486282162, -0.13950307923682537, -0.08789571868345285, 0.07812525198824005, 0.03692737263896001, -0.005153613300017941, 0.16303473500749813, -0.14563591729563016, 0.026274549251852127, 0.41448894422501326, -0.10473843782366692, 0.001435126496765476, 0.27311076041525945, -0.1851008519064635, -0.1579263446583914, 0.17280720663973345, 0.17254719463884471, 0.1678831051569432, -0.17508394646468403, -0.03165025749868409, 0.016747380945330057, 0.1974269694769576, 0.07915631796484096, 0.1034437249163882, 0.352639083764874, 0.09540182156577849, -0.03639981589692, 0.07240966175047037, -0.17954966779350517, -0.03056401677917725, -0.20792070391212641, -0.08850630058866675, -0.11509479258675129, 0.07735497675295426, -0.11220214389065335, -0.1648923720107772, 0.30523612733769157, 0.1386834278948999, 0.19555268386074415, 0.0709439957599478, 0.29775528580380173, 0.09247733947614996, 0.1356596262471822, 0.1425423604507859, 0.32365380951937717, 0.19820582034567802, 0.06781956967539512, -0.22213015855701926, 0.043983129087540034, -0.018853573474692752] |
1,802.03019 | Reignition of Star Formation in Dwarf Galaxies | The Local Group hosts a number of star-forming dwarf galaxies that show
evidence of periods of little to no star formation. We use a suite of
cosmological simulations to study how star formation is reignited in such
galaxies. We focus on isolated galaxies at $z=0$ with halo masses between
9.2$\times$10$^8$ M$_\odot$ and 8.4$\times$10$^9$ M$_\odot$, where star
formation is typically shut off by reionization or by supernova feedback.
Nearly 20% of these simulated galaxies later restart star formation, due to
interactions with streams of gas in the intergalactic medium, indicating that
this mechanism is relatively common in this mass range and that many isolated
dwarfs at $z=0$ may not have been isolated throughout their histories. The
source of this gas is not necessarily cosmic filaments. Rather, the dwarfs
interact with gas thrown off by nearby galaxy mergers or streams extending from
neighboring galaxies. While high ram pressure interactions of this nature lead
to stripping, the encounters that reignite star formation are low density
and/or low velocity and thus low ram pressure, resulting in compression of the
hot gas in the halos of our dwarfs. The gas mass bound up in hot halos can be
substantial -- at least an order of magnitude greater than the mass contained
in HI. Consequently, we find that dwarfs that have experienced reignition tend
to be more HI-rich and have a higher M$_{HI}$/M$_{*}$ ratio at $z=0$ than
galaxies with continuous star formation. Using this fact, we identify galaxies
in the Local Volume that might have "gappy" star formation histories, and can
be studied by the Hubble Space Telescope or the James Webb Space Telescope.
| astro-ph.GA | the local group hosts a number of starforming dwarf galaxies that show evidence of periods of little to no star formation we use a suite of cosmological simulations to study how star formation is reignited in such galaxies we focus on isolated galaxies at z0 with halo masses between 92times108 m_odot and 84times109 m_odot where star formation is typically shut off by reionization or by supernova feedback nearly 20 of these simulated galaxies later restart star formation due to interactions with streams of gas in the intergalactic medium indicating that this mechanism is relatively common in this mass range and that many isolated dwarfs at z0 may not have been isolated throughout their histories the source of this gas is not necessarily cosmic filaments rather the dwarfs interact with gas thrown off by nearby galaxy mergers or streams extending from neighboring galaxies while high ram pressure interactions of this nature lead to stripping the encounters that reignite star formation are low density andor low velocity and thus low ram pressure resulting in compression of the hot gas in the halos of our dwarfs the gas mass bound up in hot halos can be substantial at least an order of magnitude greater than the mass contained in hi consequently we find that dwarfs that have experienced reignition tend to be more hirich and have a higher m_him_ ratio at z0 than galaxies with continuous star formation using this fact we identify galaxies in the local volume that might have gappy star formation histories and can be studied by the hubble space telescope or the james webb space telescope | [['the', 'local', 'group', 'hosts', 'a', 'number', 'of', 'starforming', 'dwarf', 'galaxies', 'that', 'show', 'evidence', 'of', 'periods', 'of', 'little', 'to', 'no', 'star', 'formation', 'we', 'use', 'a', 'suite', 'of', 'cosmological', 'simulations', 'to', 'study', 'how', 'star', 'formation', 'is', 'reignited', 'in', 'such', 'galaxies', 'we', 'focus', 'on', 'isolated', 'galaxies', 'at', 'z0', 'with', 'halo', 'masses', 'between', '92times108', 'm_odot', 'and', '84times109', 'm_odot', 'where', 'star', 'formation', 'is', 'typically', 'shut', 'off', 'by', 'reionization', 'or', 'by', 'supernova', 'feedback', 'nearly', '20', 'of', 'these', 'simulated', 'galaxies', 'later', 'restart', 'star', 'formation', 'due', 'to', 'interactions', 'with', 'streams', 'of', 'gas', 'in', 'the', 'intergalactic', 'medium', 'indicating', 'that', 'this', 'mechanism', 'is', 'relatively', 'common', 'in', 'this', 'mass', 'range', 'and', 'that', 'many', 'isolated', 'dwarfs', 'at', 'z0', 'may', 'not', 'have', 'been', 'isolated', 'throughout', 'their', 'histories', 'the', 'source', 'of', 'this', 'gas', 'is', 'not', 'necessarily', 'cosmic', 'filaments', 'rather', 'the', 'dwarfs', 'interact', 'with', 'gas', 'thrown', 'off', 'by', 'nearby', 'galaxy', 'mergers', 'or', 'streams', 'extending', 'from', 'neighboring', 'galaxies', 'while', 'high', 'ram', 'pressure', 'interactions', 'of', 'this', 'nature', 'lead', 'to', 'stripping', 'the', 'encounters', 'that', 'reignite', 'star', 'formation', 'are', 'low', 'density', 'andor', 'low', 'velocity', 'and', 'thus', 'low', 'ram', 'pressure', 'resulting', 'in', 'compression', 'of', 'the', 'hot', 'gas', 'in', 'the', 'halos', 'of', 'our', 'dwarfs', 'the', 'gas', 'mass', 'bound', 'up', 'in', 'hot', 'halos', 'can', 'be', 'substantial', 'at', 'least', 'an', 'order', 'of', 'magnitude', 'greater', 'than', 'the', 'mass', 'contained', 'in', 'hi', 'consequently', 'we', 'find', 'that', 'dwarfs', 'that', 'have', 'experienced', 'reignition', 'tend', 'to', 'be', 'more', 'hirich', 'and', 'have', 'a', 'higher', 'm_him_', 'ratio', 'at', 'z0', 'than', 'galaxies', 'with', 'continuous', 'star', 'formation', 'using', 'this', 'fact', 'we', 'identify', 'galaxies', 'in', 'the', 'local', 'volume', 'that', 'might', 'have', 'gappy', 'star', 'formation', 'histories', 'and', 'can', 'be', 'studied', 'by', 'the', 'hubble', 'space', 'telescope', 'or', 'the', 'james', 'webb', 'space', 'telescope']] | [-0.08423804334465872, 0.1712244933502384, -0.0781539327908694, 0.10011729849458514, -0.1037627556774203, -0.010608082132870858, 0.034455077570450125, 0.4341621459373888, -0.12258022002313497, -0.3588031494638549, 0.046531741181388496, -0.2818308685208838, -0.015908206216463786, 0.17511157258413731, -0.016131801859317525, -0.08955463739902765, 0.054824763957964574, -0.06851034945861068, -0.05453499104599205, -0.3678426450311716, 0.3376759816312565, 0.0972390896350778, 0.1210814244026002, -0.0324864288062771, 0.04403540846877424, -0.12622398573395638, -0.0656714956170686, -0.03461211678189805, -0.17144951325243246, -0.042194338665642546, 0.2416425299214063, 0.11468768803455498, 0.27061436517374976, -0.4173128092274913, -0.23538825457283066, 0.1118226478798842, 0.23680095644887397, 0.04773747906492988, -0.14874130380015935, -0.25470318421370014, 0.10854449778232934, -0.22635542189895685, -0.1335987739686696, 0.06140485875339265, 0.023851359296449513, 0.022885148568642558, -0.19787086475100193, 0.1754563720439965, 0.03085290828965745, 0.04146012223088446, -0.07439271044776828, -0.036492739484276414, -0.08946726737579085, 0.049544381088014906, 0.007105249636982269, 0.10558035350580401, 0.2329767755285468, -0.1670764037289323, 0.017416413784255538, 0.4338052713505502, -0.052718726504387615, -0.0018798397836398404, 0.3134589584983604, -0.25342423215613896, -0.16457382232161624, 0.14632268863980535, 0.18593415881524672, 0.0857680015450449, -0.14159272128698538, -0.020402174736351163, -0.005550605969345373, 0.1868066979291023, 0.09061857963262021, 0.044121446342724774, 0.3636756200431231, 0.10809284384221822, 0.07510840746569711, 0.04184221721645269, -0.13324951401314225, -0.04245151446446917, -0.16636519101711938, -0.10387992635303406, -0.13952044903450064, 0.10262222779785142, -0.1203972982565042, -0.08629514175590199, 0.2609243101176788, 0.09196944941177894, 0.2622066481038928, 0.05728673450297342, 0.3332726789111236, 0.06130153051498434, 0.15958700278369745, 0.14342552473382006, 0.2673473195102558, 0.16344318068762012, 0.04501550960978317, -0.25233628772757066, 0.0854975993323298, -0.01861181657603186] |
1,802.0302 | Predictability of subluminal and superluminal wave equations | It is sometimes claimed that Lorentz invariant wave equations which allow
superluminal propagation exhibit worse predictability than subluminal
equations. To investigate this, we study the Born-Infeld scalar in two
spacetime dimensions. This equation can be formulated in either a subluminal or
a superluminal form. Surprisingly, we find that the subluminal theory is less
predictive than the superluminal theory in the following sense. For the
subluminal theory, there can exist multiple maximal globally hyperbolic
developments arising from the same initial data. This problem does not arise in
the superluminal theory, for which there is a unique maximal globally
hyperbolic development. For a general quasilinear wave equation, we prove
theorems establishing why this lack of uniqueness occurs, and identify
conditions on the equation that ensure uniqueness. In particular, we prove that
superluminal equations always admit a unique maximal globally hyperbolic
development. In this sense, superluminal equations exhibit better
predictability than generic subluminal equations.
| gr-qc hep-th math.AP | it is sometimes claimed that lorentz invariant wave equations which allow superluminal propagation exhibit worse predictability than subluminal equations to investigate this we study the borninfeld scalar in two spacetime dimensions this equation can be formulated in either a subluminal or a superluminal form surprisingly we find that the subluminal theory is less predictive than the superluminal theory in the following sense for the subluminal theory there can exist multiple maximal globally hyperbolic developments arising from the same initial data this problem does not arise in the superluminal theory for which there is a unique maximal globally hyperbolic development for a general quasilinear wave equation we prove theorems establishing why this lack of uniqueness occurs and identify conditions on the equation that ensure uniqueness in particular we prove that superluminal equations always admit a unique maximal globally hyperbolic development in this sense superluminal equations exhibit better predictability than generic subluminal equations | [['it', 'is', 'sometimes', 'claimed', 'that', 'lorentz', 'invariant', 'wave', 'equations', 'which', 'allow', 'superluminal', 'propagation', 'exhibit', 'worse', 'predictability', 'than', 'subluminal', 'equations', 'to', 'investigate', 'this', 'we', 'study', 'the', 'borninfeld', 'scalar', 'in', 'two', 'spacetime', 'dimensions', 'this', 'equation', 'can', 'be', 'formulated', 'in', 'either', 'a', 'subluminal', 'or', 'a', 'superluminal', 'form', 'surprisingly', 'we', 'find', 'that', 'the', 'subluminal', 'theory', 'is', 'less', 'predictive', 'than', 'the', 'superluminal', 'theory', 'in', 'the', 'following', 'sense', 'for', 'the', 'subluminal', 'theory', 'there', 'can', 'exist', 'multiple', 'maximal', 'globally', 'hyperbolic', 'developments', 'arising', 'from', 'the', 'same', 'initial', 'data', 'this', 'problem', 'does', 'not', 'arise', 'in', 'the', 'superluminal', 'theory', 'for', 'which', 'there', 'is', 'a', 'unique', 'maximal', 'globally', 'hyperbolic', 'development', 'for', 'a', 'general', 'quasilinear', 'wave', 'equation', 'we', 'prove', 'theorems', 'establishing', 'why', 'this', 'lack', 'of', 'uniqueness', 'occurs', 'and', 'identify', 'conditions', 'on', 'the', 'equation', 'that', 'ensure', 'uniqueness', 'in', 'particular', 'we', 'prove', 'that', 'superluminal', 'equations', 'always', 'admit', 'a', 'unique', 'maximal', 'globally', 'hyperbolic', 'development', 'in', 'this', 'sense', 'superluminal', 'equations', 'exhibit', 'better', 'predictability', 'than', 'generic', 'subluminal', 'equations']] | [-0.19364821847330854, 0.17001734645605482, -0.11143116311275011, 0.13655288873197177, -0.16085160529049766, -0.21083303852105476, -0.05172734972429138, 0.3136196677196796, -0.23930350148939336, -0.22129524865539263, 0.08318415389132966, -0.23606428263449905, -0.1944248826683974, 0.19667750252996702, -0.09023621154714696, 0.033932056857754064, 0.07890354601253095, 0.06018992217214445, -0.10402766300908087, -0.18076698316742254, 0.28290786548511476, -0.05182070028813963, 0.3060348667636119, 0.03442204940373337, 0.16150958302958146, -0.025748880213089534, 0.009309196866283946, 0.050358177282976986, -0.1502549651332141, 0.06698684747306173, 0.26460678430446827, 0.13708640755900484, 0.28290122381084026, -0.42979200517401, -0.2720910347689757, 0.1665556488392122, 0.17397322972607338, 0.12685082668888795, -0.0431404572307126, -0.2876509085223572, 0.08525563959056968, -0.11561477012216848, -0.26514161942489695, -0.05603381081496594, 0.0039513877358608295, -0.04523390894431917, -0.2046731661986683, 0.15498482722739707, 0.08582641801716673, 0.00015872554384813403, -0.06699899836005457, 0.02087333670505847, -0.02672947459354602, 0.01843707477103376, 0.12207620078389415, -0.009585839481900959, 0.022451251215572832, -0.12440547179461561, -0.1144591752302506, 0.4012075958662475, -0.07298292133127207, -0.2887556272503359, 0.1854936300548694, -0.18448820723346374, -0.14518253553338004, 0.15506060956977308, 0.14752868473042569, 0.129108952113199, -0.13390976975715121, 0.08912171278455733, -0.1051251234250399, 0.14542688685931907, 0.1694321840668455, 0.07016466986519032, 0.14441814505192913, 0.06705555245311104, 0.14794386420954045, 0.018676145359201493, 0.0648074732763409, -0.11532787802869714, -0.3824935991857478, -0.14877326691843915, -0.05688092234353257, 0.14153407233069876, -0.10193519841943982, -0.19829117212851613, 0.31851854989311307, 0.16256956635228056, 0.07930683501878914, 0.04992609081438292, 0.22974087841290708, 0.18447178203438327, 0.004786174917063176, 0.17090109381701377, 0.32332283829567054, 0.11439164028509169, 0.12190601395887156, -0.2033201870813022, 0.05021425868563403, 0.09370102627905987] |
1,802.03021 | Direct photon production and PDF fits reloaded | Direct photon production in hadronic collisions provides a handle on the
gluon PDF by means of the QCD Compton scattering process. In this work we
revisit the impact of direct photon production on a global PDF analysis,
motivated by the recent availability of the next-to-next-to-leading (NNLO)
calculation for this process. We demonstrate that the inclusion of NNLO QCD and
leading-logarithmic electroweak corrections leads to a good quantitative
agreement with the ATLAS measurements at 8 TeV and 13 TeV, except for the most
forward rapidity region in the former case. By including the ATLAS 8 TeV direct
photon production data in the NNPDF3.1 NNLO global analysis, we assess its
impact on the medium-x gluon. We also study the constraining power of the
direct photon production measurements on PDF fits based on different datasets,
in particular on the NNPDF3.1 no-LHC and collider-only fits. We also present
updated NNLO theoretical predictions for direct photon production at 13 TeV
that include the constraints from the 8 TeV measurements.
| hep-ph hep-ex | direct photon production in hadronic collisions provides a handle on the gluon pdf by means of the qcd compton scattering process in this work we revisit the impact of direct photon production on a global pdf analysis motivated by the recent availability of the nexttonexttoleading nnlo calculation for this process we demonstrate that the inclusion of nnlo qcd and leadinglogarithmic electroweak corrections leads to a good quantitative agreement with the atlas measurements at 8 tev and 13 tev except for the most forward rapidity region in the former case by including the atlas 8 tev direct photon production data in the nnpdf31 nnlo global analysis we assess its impact on the mediumx gluon we also study the constraining power of the direct photon production measurements on pdf fits based on different datasets in particular on the nnpdf31 nolhc and collideronly fits we also present updated nnlo theoretical predictions for direct photon production at 13 tev that include the constraints from the 8 tev measurements | [['direct', 'photon', 'production', 'in', 'hadronic', 'collisions', 'provides', 'a', 'handle', 'on', 'the', 'gluon', 'pdf', 'by', 'means', 'of', 'the', 'qcd', 'compton', 'scattering', 'process', 'in', 'this', 'work', 'we', 'revisit', 'the', 'impact', 'of', 'direct', 'photon', 'production', 'on', 'a', 'global', 'pdf', 'analysis', 'motivated', 'by', 'the', 'recent', 'availability', 'of', 'the', 'nexttonexttoleading', 'nnlo', 'calculation', 'for', 'this', 'process', 'we', 'demonstrate', 'that', 'the', 'inclusion', 'of', 'nnlo', 'qcd', 'and', 'leadinglogarithmic', 'electroweak', 'corrections', 'leads', 'to', 'a', 'good', 'quantitative', 'agreement', 'with', 'the', 'atlas', 'measurements', 'at', '8', 'tev', 'and', '13', 'tev', 'except', 'for', 'the', 'most', 'forward', 'rapidity', 'region', 'in', 'the', 'former', 'case', 'by', 'including', 'the', 'atlas', '8', 'tev', 'direct', 'photon', 'production', 'data', 'in', 'the', 'nnpdf31', 'nnlo', 'global', 'analysis', 'we', 'assess', 'its', 'impact', 'on', 'the', 'mediumx', 'gluon', 'we', 'also', 'study', 'the', 'constraining', 'power', 'of', 'the', 'direct', 'photon', 'production', 'measurements', 'on', 'pdf', 'fits', 'based', 'on', 'different', 'datasets', 'in', 'particular', 'on', 'the', 'nnpdf31', 'nolhc', 'and', 'collideronly', 'fits', 'we', 'also', 'present', 'updated', 'nnlo', 'theoretical', 'predictions', 'for', 'direct', 'photon', 'production', 'at', '13', 'tev', 'that', 'include', 'the', 'constraints', 'from', 'the', '8', 'tev', 'measurements']] | [-0.040716790580602874, 0.11543133231429441, -0.10978784157044214, 0.1355361974971365, -0.02289522909819617, -0.025070637846307725, 0.046529870465114385, 0.34610336107311784, -0.14451712516341822, -0.2952065151647566, 0.03304022729544328, -0.3688546453157197, 0.05843186657586546, 0.18599755200123566, 0.08090180827153598, 0.13102452254236635, 0.1396422516091825, -0.04650500102940461, -0.03662565293120255, -0.2268653141127853, 0.3232262325444207, 0.13116406674514183, 0.22396180337520535, 0.21080029971596803, 0.06621590608467712, 0.08469158065106187, -0.16570959754269396, -0.08756612739323275, -0.17567710576317583, 0.10911616730024339, 0.21591415492563237, 0.06351788028039224, 0.11393786991385292, -0.3743587363141109, -0.1070224605905621, 0.08329614357131979, 0.13476886809188932, 0.10061121144361276, -0.08018406854670564, -0.26113801320974267, 0.09551710161736224, -0.27592535895116116, -0.10286771337449643, -0.06868209769393994, -0.0457714099367583, -0.04716642228206793, -0.3175331087774302, 0.09612275606783408, -0.08173566738068364, 0.04412203930717494, 0.0027385426371398826, -0.15446911602980973, -0.06801680718716349, 0.011126632258434844, 0.09176369273408912, 0.06236443390508663, 0.1625939978211424, -0.20922122690183118, -0.22322556009134337, 0.35747377478997716, -0.05618805427867803, -0.12704735544296156, 0.15075039145860658, -0.2133946059855939, -0.2119425139332086, 0.16875744963886205, 0.24025749703666763, 0.07653439018632406, -0.17896951903351901, 0.1361410447489615, 0.001051432192788361, 0.2104098326743505, 0.05691917520594893, 0.04693828270755605, 0.1407992630670576, 0.22749254120056814, -0.023377022847695196, 0.07838375017521267, -0.12385765838318198, -0.08190813490554043, -0.4635019749460846, -0.06647805262195028, -0.10127673479178863, 0.035877906513452434, -0.12456722730820961, -0.05493726500350496, 0.3789105225088341, 0.17536598386138863, 0.27978110908218284, 0.03954632561335699, 0.38276937187458415, 0.1196650432354788, 0.035464982175331866, 0.055465295387327855, 0.35344703747711564, 0.12556005748110297, 0.1643773638469786, -0.21194405041444145, 0.03491696364590493, 0.038231332103797] |
1,802.03022 | Supermassive Black Holes with High Accretion Rates in Active Galactic
Nuclei. IX 10 New Observations of Reverberation Mapping and Shortened
H$\beta$ Lags | As one of the series of papers reporting on a large reverberation mapping
campaign of super-Eddington accreting massive black holes (SEAMBHs) in active
galactic nuclei (AGNs), we present the results of 10 SEAMBHs monitored
spectroscopically during 2015-2017. Six of them are observed for the first
time, and have generally higher 5100 \AA\ luminosities than the SEAMBHs
monitored in our campaign from 2012 to 2015; the remaining four are repeat
observations to check if their previous lags change. Similar to the previous
SEAMBHs, the H$\beta$ time lags of the newly observed objects are shorter than
the values predicted by the canonical $R_{\mathrm{H\beta}}$-$L_{5100}$ relation
of sub-Eddington AGNs, by factors of $\sim2-6$, depending on the accretion
rate. The four previously observed objects have lags consistent with previous
measurements. We provide linear regressions for the
$R_{\mathrm{H\beta}}$-$L_{5100}$ relation, solely for the SEAMBH sample and for
low-accretion AGNs. We find that the relative strength of Fe II and the profile
of the H$\beta$ emission line can be used as proxies of accretion rate, showing
that the shortening of H$\beta$ lags depends on accretion rates. The recent
SDSS-RM discovery of shortened H$\beta$ lags in AGNs with low accretion rates
provides compelling evidence for retrograde accretion onto the black hole.
These evidences show that the canonical $R_{\mathrm{H\beta}}$-$L_{5100}$
relation holds only in AGNs with moderate accretion rates. At low accretion
rates, it should be revised to include the effects of black hole spin, whereas
the accretion rate itself becomes a key factor in the regime of high accretion
rates.
| astro-ph.GA | as one of the series of papers reporting on a large reverberation mapping campaign of supereddington accreting massive black holes seambhs in active galactic nuclei agns we present the results of 10 seambhs monitored spectroscopically during 20152017 six of them are observed for the first time and have generally higher 5100 aa luminosities than the seambhs monitored in our campaign from 2012 to 2015 the remaining four are repeat observations to check if their previous lags change similar to the previous seambhs the hbeta time lags of the newly observed objects are shorter than the values predicted by the canonical r_mathrmhbetal_5100 relation of subeddington agns by factors of sim26 depending on the accretion rate the four previously observed objects have lags consistent with previous measurements we provide linear regressions for the r_mathrmhbetal_5100 relation solely for the seambh sample and for lowaccretion agns we find that the relative strength of fe ii and the profile of the hbeta emission line can be used as proxies of accretion rate showing that the shortening of hbeta lags depends on accretion rates the recent sdssrm discovery of shortened hbeta lags in agns with low accretion rates provides compelling evidence for retrograde accretion onto the black hole these evidences show that the canonical r_mathrmhbetal_5100 relation holds only in agns with moderate accretion rates at low accretion rates it should be revised to include the effects of black hole spin whereas the accretion rate itself becomes a key factor in the regime of high accretion rates | [['as', 'one', 'of', 'the', 'series', 'of', 'papers', 'reporting', 'on', 'a', 'large', 'reverberation', 'mapping', 'campaign', 'of', 'supereddington', 'accreting', 'massive', 'black', 'holes', 'seambhs', 'in', 'active', 'galactic', 'nuclei', 'agns', 'we', 'present', 'the', 'results', 'of', '10', 'seambhs', 'monitored', 'spectroscopically', 'during', '20152017', 'six', 'of', 'them', 'are', 'observed', 'for', 'the', 'first', 'time', 'and', 'have', 'generally', 'higher', '5100', 'aa', 'luminosities', 'than', 'the', 'seambhs', 'monitored', 'in', 'our', 'campaign', 'from', '2012', 'to', '2015', 'the', 'remaining', 'four', 'are', 'repeat', 'observations', 'to', 'check', 'if', 'their', 'previous', 'lags', 'change', 'similar', 'to', 'the', 'previous', 'seambhs', 'the', 'hbeta', 'time', 'lags', 'of', 'the', 'newly', 'observed', 'objects', 'are', 'shorter', 'than', 'the', 'values', 'predicted', 'by', 'the', 'canonical', 'r_mathrmhbetal_5100', 'relation', 'of', 'subeddington', 'agns', 'by', 'factors', 'of', 'sim26', 'depending', 'on', 'the', 'accretion', 'rate', 'the', 'four', 'previously', 'observed', 'objects', 'have', 'lags', 'consistent', 'with', 'previous', 'measurements', 'we', 'provide', 'linear', 'regressions', 'for', 'the', 'r_mathrmhbetal_5100', 'relation', 'solely', 'for', 'the', 'seambh', 'sample', 'and', 'for', 'lowaccretion', 'agns', 'we', 'find', 'that', 'the', 'relative', 'strength', 'of', 'fe', 'ii', 'and', 'the', 'profile', 'of', 'the', 'hbeta', 'emission', 'line', 'can', 'be', 'used', 'as', 'proxies', 'of', 'accretion', 'rate', 'showing', 'that', 'the', 'shortening', 'of', 'hbeta', 'lags', 'depends', 'on', 'accretion', 'rates', 'the', 'recent', 'sdssrm', 'discovery', 'of', 'shortened', 'hbeta', 'lags', 'in', 'agns', 'with', 'low', 'accretion', 'rates', 'provides', 'compelling', 'evidence', 'for', 'retrograde', 'accretion', 'onto', 'the', 'black', 'hole', 'these', 'evidences', 'show', 'that', 'the', 'canonical', 'r_mathrmhbetal_5100', 'relation', 'holds', 'only', 'in', 'agns', 'with', 'moderate', 'accretion', 'rates', 'at', 'low', 'accretion', 'rates', 'it', 'should', 'be', 'revised', 'to', 'include', 'the', 'effects', 'of', 'black', 'hole', 'spin', 'whereas', 'the', 'accretion', 'rate', 'itself', 'becomes', 'a', 'key', 'factor', 'in', 'the', 'regime', 'of', 'high', 'accretion', 'rates']] | [-0.06015625301934779, 0.11189371483592549, -0.01651071345526725, 0.13558290362358094, -0.06827134269103408, -0.1387264765780419, 0.06723400379624218, 0.43070606226474045, -0.1358048924729228, -0.3325426451265812, 0.11872424404835329, -0.31374497622996567, 0.007160882400348782, 0.26998937604017553, -0.029953458679839968, -0.007504707521235105, 0.006385173391085118, -0.08719631313614082, -0.09877666117670014, -0.28679389123804866, 0.2915027596447617, 0.10803014162927865, 0.20047168909758328, -0.038297741922782735, 0.0489056427301839, -0.07597257470153272, -0.09898539667576552, -0.008184184815734625, -0.14571042966048117, 0.040764072514371946, 0.2643982224818319, 0.14157081679301337, 0.2191681768745184, -0.3455220288129931, -0.2205286889213603, 0.04903871515346691, 0.162573734969832, 0.06073089529946447, -0.05865733557520434, -0.21288117367122322, 0.051803138933959415, -0.2190435481313616, -0.09752201260253787, 0.05331758232600987, 0.10011308502964675, 0.030867977562127634, -0.2094895329363644, 0.17185259930044414, 0.06699055104763829, 0.060053663700819014, -0.14372643954586237, -0.047130731879035014, -0.06826525087375193, 0.0841783710597083, 0.13633933231979609, 0.03667488178052008, 0.19456316097825765, -0.08424771789088845, -0.09767465190310032, 0.3372201783629134, -0.08371029906312469, 0.009189138807356358, 0.2230454722288996, -0.2731427563903853, -0.15247072338033468, 0.17990739134792239, 0.17358102675899864, 0.17884655466926053, -0.0881086840685457, -0.03008591337269172, -0.038338140881154684, 0.24823776764422656, 0.007997353022918105, 0.07535001988336444, 0.32324518719222395, 0.07653018448874355, -0.02408265737257898, 0.09178732243925333, -0.17881646297883708, -0.025979639992117883, -0.23721047190763056, -0.08755314902111422, -0.10129189343564213, 0.09493884070310742, -0.1544505984383286, -0.07594038041494787, 0.32390007653087377, 0.08103917022095994, 0.2624458206258714, 0.0750541011961177, 0.2581319679979497, 0.12302279246971011, 0.08824920231755823, 0.13529085271432995, 0.3926922023985535, 0.11998040149081499, 0.11418478031828999, -0.26485969317052516, 0.11536777252750471, 0.06330837730597705] |
1,802.03023 | Quantum Oscillation from In-gap States and non-Hermitian Landau Level
Problem | Motivated by recent experiments on Kondo insulators, we theoretically study
quantum oscillations from disorder-induced in-gap states in small-gap
insulators. By solving a non-Hermitian Landau level problem that incorporates
the imaginary part of electron's self-energy, we show that the oscillation
period is determined by the Fermi surface area in the absence of the
hybridization gap, and derive an analytical formula for the oscillation
amplitude as a function of the indirect band gap, scattering rates, and
temperature. Over a wide parameter range, we find that the effective mass is
controlled by scattering rates, while the Dingle factor is controlled by the
indirect band gap. We also show the important effect of scattering rates in
reshaping the quasiparticle dispersion in connection with angle-resolved
photoemission measurements on heavy fermion materials.
| cond-mat.str-el cond-mat.mes-hall | motivated by recent experiments on kondo insulators we theoretically study quantum oscillations from disorderinduced ingap states in smallgap insulators by solving a nonhermitian landau level problem that incorporates the imaginary part of electrons selfenergy we show that the oscillation period is determined by the fermi surface area in the absence of the hybridization gap and derive an analytical formula for the oscillation amplitude as a function of the indirect band gap scattering rates and temperature over a wide parameter range we find that the effective mass is controlled by scattering rates while the dingle factor is controlled by the indirect band gap we also show the important effect of scattering rates in reshaping the quasiparticle dispersion in connection with angleresolved photoemission measurements on heavy fermion materials | [['motivated', 'by', 'recent', 'experiments', 'on', 'kondo', 'insulators', 'we', 'theoretically', 'study', 'quantum', 'oscillations', 'from', 'disorderinduced', 'ingap', 'states', 'in', 'smallgap', 'insulators', 'by', 'solving', 'a', 'nonhermitian', 'landau', 'level', 'problem', 'that', 'incorporates', 'the', 'imaginary', 'part', 'of', 'electrons', 'selfenergy', 'we', 'show', 'that', 'the', 'oscillation', 'period', 'is', 'determined', 'by', 'the', 'fermi', 'surface', 'area', 'in', 'the', 'absence', 'of', 'the', 'hybridization', 'gap', 'and', 'derive', 'an', 'analytical', 'formula', 'for', 'the', 'oscillation', 'amplitude', 'as', 'a', 'function', 'of', 'the', 'indirect', 'band', 'gap', 'scattering', 'rates', 'and', 'temperature', 'over', 'a', 'wide', 'parameter', 'range', 'we', 'find', 'that', 'the', 'effective', 'mass', 'is', 'controlled', 'by', 'scattering', 'rates', 'while', 'the', 'dingle', 'factor', 'is', 'controlled', 'by', 'the', 'indirect', 'band', 'gap', 'we', 'also', 'show', 'the', 'important', 'effect', 'of', 'scattering', 'rates', 'in', 'reshaping', 'the', 'quasiparticle', 'dispersion', 'in', 'connection', 'with', 'angleresolved', 'photoemission', 'measurements', 'on', 'heavy', 'fermion', 'materials']] | [-0.17642533618749845, 0.22434137709679486, -0.04747071483778575, 0.09825199112085448, -0.02648923077457954, -0.10556621257481831, 0.14488458584454503, 0.3598238428895702, -0.2709435855153032, -0.3189523292941943, -0.004311083165544366, -0.31280860683274647, -0.17785505381309324, 0.21820182501271898, 0.03699640311773807, 0.04711886176041195, 0.02739406837749162, -0.07735204235798428, -0.11277714472389706, -0.16337836972836936, 0.35677240043878555, 0.059933478263066345, 0.28339838318985017, 0.16076239600171527, 0.011639408401346632, 0.06480603302562875, 0.06177565560649363, -0.015297246746726275, -0.15899820781747362, 0.051350106871853186, 0.27368827082867186, -0.08822435326135111, 0.20552694739862568, -0.4007150654252323, -0.2362773813259241, 0.004901914347317957, 0.155729655379666, 0.14126621482945564, -0.10527513129082286, -0.3039028314958578, -0.0011208774263246192, -0.16621368894693517, -0.11653820104113528, -0.07260028516415447, 0.018145240348068966, -0.07215460387866073, -0.22757480032963767, 0.15546843891691728, -0.019253884556718052, 0.07137965373251409, -0.10960665542174071, -0.12172034955657428, -0.03015944306989984, 0.04103328929548817, 0.07929439107898534, -0.010526789756748632, 0.12255236876773692, -0.13524316882138096, -0.11686982705982195, 0.33193061668573626, -0.13331271385005306, -0.10407223661558607, 0.11544898670861527, -0.18891313924114145, -0.012992703396501758, 0.15434716400202542, 0.10882018729748708, 0.08146784733980894, -0.11404174790968971, 0.15229035794849521, -0.05367027654770821, 0.17249859433384643, 0.03626133788317915, 0.07861624547605595, 0.24463014391857008, 0.17585856075738632, 0.06828773054774732, 0.09472170356838476, -0.13633441748855163, -0.03425494996860387, -0.25601597544958904, -0.12189224397113162, -0.2571670096108897, 0.03817022919270491, -0.02858373734130827, -0.15125741808497833, 0.43711727399319883, 0.11343816287874703, 0.2198991310294895, 0.008374552948341246, 0.24851009698532936, 0.20508421383362027, 0.07941402793856844, 0.040941815616356, 0.2851449556922215, 0.14346263496693046, 0.06916716578508919, -0.3507935347549233, 0.0423516007539879, 0.03463632480374405] |
1,802.03024 | Frustration and anisotropic exchange in ytterbium magnets with
edge-shared octahedra | We consider the structure of anisotropic exchange interactions in
ytterbium-based insulating rare-earth magnets built from edge-sharing
octahedra. We argue the features of trivalent ytterbium and this structural
configuration allow for a qualitative determination of the different
anisotropic exchange regimes that may manifest in such compounds. The validity
of such super-exchange calculations is tested through comparison to the
well-characterized breathing pyrochlore compound Ba$_3$Yb$_2$Zn$_5$O$_{11}$.
With this in hand, we then consider application to three-dimensional pyrochlore
spinels as well as two-dimensional honeycomb and triangular lattice systems
built from such edge-sharing octahedra. We find an extended regime of robust
emergent weak anisotropy with dominant antiferromagnetic Heisenberg
interactions as well as smaller regions with strong anisotropy. We discuss the
implications of our results for known compounds with the above structures, such
as the spinels AYb$_2$X$_4$ (A = Cd, Mg, X = S, Se), the triangular compound
YbMgGaO$_4$, which have recently emerged as promising candidates for observing
unconventional magnetic phenomena. Finally, we speculate on implications for
the R$_2$M$_2$O$_7$ pyrochlore compounds and some little studied honeycomb
ytterbium magnets.
| cond-mat.str-el | we consider the structure of anisotropic exchange interactions in ytterbiumbased insulating rareearth magnets built from edgesharing octahedra we argue the features of trivalent ytterbium and this structural configuration allow for a qualitative determination of the different anisotropic exchange regimes that may manifest in such compounds the validity of such superexchange calculations is tested through comparison to the wellcharacterized breathing pyrochlore compound ba_3yb_2zn_5o_11 with this in hand we then consider application to threedimensional pyrochlore spinels as well as twodimensional honeycomb and triangular lattice systems built from such edgesharing octahedra we find an extended regime of robust emergent weak anisotropy with dominant antiferromagnetic heisenberg interactions as well as smaller regions with strong anisotropy we discuss the implications of our results for known compounds with the above structures such as the spinels ayb_2x_4 a cd mg x s se the triangular compound ybmggao_4 which have recently emerged as promising candidates for observing unconventional magnetic phenomena finally we speculate on implications for the r_2m_2o_7 pyrochlore compounds and some little studied honeycomb ytterbium magnets | [['we', 'consider', 'the', 'structure', 'of', 'anisotropic', 'exchange', 'interactions', 'in', 'ytterbiumbased', 'insulating', 'rareearth', 'magnets', 'built', 'from', 'edgesharing', 'octahedra', 'we', 'argue', 'the', 'features', 'of', 'trivalent', 'ytterbium', 'and', 'this', 'structural', 'configuration', 'allow', 'for', 'a', 'qualitative', 'determination', 'of', 'the', 'different', 'anisotropic', 'exchange', 'regimes', 'that', 'may', 'manifest', 'in', 'such', 'compounds', 'the', 'validity', 'of', 'such', 'superexchange', 'calculations', 'is', 'tested', 'through', 'comparison', 'to', 'the', 'wellcharacterized', 'breathing', 'pyrochlore', 'compound', 'ba_3yb_2zn_5o_11', 'with', 'this', 'in', 'hand', 'we', 'then', 'consider', 'application', 'to', 'threedimensional', 'pyrochlore', 'spinels', 'as', 'well', 'as', 'twodimensional', 'honeycomb', 'and', 'triangular', 'lattice', 'systems', 'built', 'from', 'such', 'edgesharing', 'octahedra', 'we', 'find', 'an', 'extended', 'regime', 'of', 'robust', 'emergent', 'weak', 'anisotropy', 'with', 'dominant', 'antiferromagnetic', 'heisenberg', 'interactions', 'as', 'well', 'as', 'smaller', 'regions', 'with', 'strong', 'anisotropy', 'we', 'discuss', 'the', 'implications', 'of', 'our', 'results', 'for', 'known', 'compounds', 'with', 'the', 'above', 'structures', 'such', 'as', 'the', 'spinels', 'ayb_2x_4', 'a', 'cd', 'mg', 'x', 's', 'se', 'the', 'triangular', 'compound', 'ybmggao_4', 'which', 'have', 'recently', 'emerged', 'as', 'promising', 'candidates', 'for', 'observing', 'unconventional', 'magnetic', 'phenomena', 'finally', 'we', 'speculate', 'on', 'implications', 'for', 'the', 'r_2m_2o_7', 'pyrochlore', 'compounds', 'and', 'some', 'little', 'studied', 'honeycomb', 'ytterbium', 'magnets']] | [-0.14403094417585652, 0.18840259704873047, 0.05189930800624571, 0.06128337762414751, -0.06696766682393002, -0.16699625280111313, 0.04632464935305991, 0.41948582587239447, -0.26498542896340865, -0.24094397079444932, 0.045298753559316125, -0.35525849980753876, -0.16825822475896088, 0.16784214047843335, 0.09902628876609047, -0.026571312612536067, -0.028367893920910214, -0.021950415347424486, -0.12824465543405336, -0.19605294237830703, 0.24769860076087857, 0.0587324600817487, 0.28941084879511847, 0.05672501629040002, 0.04038568172592692, 0.016871994531721793, 0.1800640322502234, 0.04594428845106842, -0.19910379270448741, 0.08856031300868103, 0.2519546337314173, -0.09196275637434896, 0.13248878070655207, -0.43102615213991996, -0.22392639336747835, 0.017208337249139512, 0.154248049181557, 0.15531061340087166, -0.11994000304626959, -0.3136950565312437, 0.020853641672299694, -0.1863652421245184, -0.12540242596826387, -0.16383659900974729, -0.04925271139750648, 0.0493068195556006, -0.26455759376874416, 0.08022450574103486, 0.09257104981852372, 0.16755652231331405, -0.11702350643602852, -0.2087938775305642, -0.07681617994435845, 0.04541694935868511, 0.08071139407160129, 0.01674461481579674, 0.08840084947299903, -0.06725757658024302, -0.16699707650922485, 0.4328402102238939, -0.04397479010380604, -0.05637665456830117, 0.19105596968368765, -0.14535977712743162, -0.19242859436031765, 0.06592403383490568, 0.11767518442628827, 0.08936818569764762, -0.10041131676086866, 0.09081006898233823, -0.06407827728366602, 0.16729547514881338, -0.01747907193455689, 0.12621689319867127, 0.25306797659855534, 0.2120138116896816, 0.023778370039225248, 0.19424467115707605, -0.09752331204673353, -0.07905190806169464, -0.17597899076174722, -0.1680444098645152, -0.194608394059347, 0.054398619893291394, -0.09951124273905947, -0.21717683935515628, 0.3309373016285147, 0.13835323002247954, 0.1801612552220243, -0.13804838833786703, 0.16602033361287866, -0.02085760509676138, 0.08245283961128778, 0.014206118265468025, 0.2509041935810889, 0.15652186808756324, 0.08227278083328626, -0.2273498936357607, 0.07827991988889114, 0.052890117227205796] |
1,802.03025 | Robust Constraints and Novel Gamma-Ray Signatures of Dark Matter That
Interacts Strongly With Nucleons | Due to shielding, direct detection experiments are in some cases insensitive
to dark matter candidates with very large scattering cross sections with
nucleons. In this paper, we revisit this class of models, and derive a simple
analytic criterion for conservative but robust direct detection limits. While
large spin-independent cross sections seem to be ruled out, we identify
potentially viable parameter space for dark matter with a spin-dependent cross
section with nucleons in the range of $10^{-27} {\rm cm}^2 < \sigma_{{\rm
DM}-p} < 10^{-24} \, {\rm cm}^{2}$. With these parameters, cosmic-ray
scattering with dark matter in the extended halo of the Milky Way could
generate a novel and distinctive gamma-ray signal at high galactic latitudes.
Such a signal could be observable by Fermi or future space-based gamma-ray
telescopes.
| hep-ph astro-ph.CO astro-ph.GA astro-ph.HE | due to shielding direct detection experiments are in some cases insensitive to dark matter candidates with very large scattering cross sections with nucleons in this paper we revisit this class of models and derive a simple analytic criterion for conservative but robust direct detection limits while large spinindependent cross sections seem to be ruled out we identify potentially viable parameter space for dark matter with a spindependent cross section with nucleons in the range of 1027 rm cm2 sigma_rm dmp 1024 rm cm2 with these parameters cosmicray scattering with dark matter in the extended halo of the milky way could generate a novel and distinctive gammaray signal at high galactic latitudes such a signal could be observable by fermi or future spacebased gammaray telescopes | [['due', 'to', 'shielding', 'direct', 'detection', 'experiments', 'are', 'in', 'some', 'cases', 'insensitive', 'to', 'dark', 'matter', 'candidates', 'with', 'very', 'large', 'scattering', 'cross', 'sections', 'with', 'nucleons', 'in', 'this', 'paper', 'we', 'revisit', 'this', 'class', 'of', 'models', 'and', 'derive', 'a', 'simple', 'analytic', 'criterion', 'for', 'conservative', 'but', 'robust', 'direct', 'detection', 'limits', 'while', 'large', 'spinindependent', 'cross', 'sections', 'seem', 'to', 'be', 'ruled', 'out', 'we', 'identify', 'potentially', 'viable', 'parameter', 'space', 'for', 'dark', 'matter', 'with', 'a', 'spindependent', 'cross', 'section', 'with', 'nucleons', 'in', 'the', 'range', 'of', '1027', 'rm', 'cm2', 'sigma_rm', 'dmp', '1024', 'rm', 'cm2', 'with', 'these', 'parameters', 'cosmicray', 'scattering', 'with', 'dark', 'matter', 'in', 'the', 'extended', 'halo', 'of', 'the', 'milky', 'way', 'could', 'generate', 'a', 'novel', 'and', 'distinctive', 'gammaray', 'signal', 'at', 'high', 'galactic', 'latitudes', 'such', 'a', 'signal', 'could', 'be', 'observable', 'by', 'fermi', 'or', 'future', 'spacebased', 'gammaray', 'telescopes']] | [-0.0831562842922135, 0.16936191366121714, -0.04089494631250178, 0.15177771593857137, -0.11520503136149098, -0.09909198376079721, 0.002757209211385118, 0.3648424308311434, -0.1807074444011725, -0.38177915354965314, -0.010527249468835972, -0.3033121138841154, 0.003880833408930489, 0.23699846551302942, 0.03734156218612747, 0.03173307277616151, 0.026268430255098087, -0.04003550639496215, -0.05065087241030509, -0.22113362434996112, 0.2571659938567468, 0.11180506551529341, 0.1824035730359385, 0.12084156260149734, 0.08901914094959436, -0.023744863985602053, -0.04953101355462305, -0.060552641175886934, -0.1507044645069043, 0.06409080585393484, 0.3474200158693601, 0.05331728817714799, 0.08341306914207375, -0.4130545879804319, -0.20041439815935108, 0.20472991918288772, 0.15475856193206122, 0.05757483442111181, -0.08787840875917144, -0.34876185712674934, 0.04633775911615005, -0.2525205056994192, -0.1437273493164309, -0.059274829946638595, 0.026939780676677343, 0.007827273963372253, -0.23294643666820541, 0.11285942514058983, -0.06250545345321898, -0.0397978346539481, -0.06016586190878203, -0.1327675299854168, 0.020104951435519804, -0.06611075733164926, 0.0630657810525595, 0.020524245502817774, 0.21447696791390977, -0.18292366055679704, -0.050716727435018025, 0.4251545447135164, -0.11063956334480955, -0.12701426911348057, 0.18470502445932419, -0.15995231250886835, -0.19084426696269563, 0.1987821431905632, 0.20310372392076156, 0.09139787926406209, -0.16077167103667894, 0.07772828379341762, -0.04232744470186111, 0.18531320132164947, 0.03879652036571755, 0.05685792861866855, 0.33421063873045626, 0.1863848927934023, 0.10630796895824343, -0.007114489482069808, -0.23567732614314846, 0.010725221236146266, -0.331865728265726, -0.11754094405126037, -0.06641869541753324, 0.0729902045530898, -0.07155824327703393, -0.09164255575066613, 0.2978494772650001, 0.12858872684920508, 0.2705735559199726, 0.03756568797924105, 0.34361265798384744, 0.10257291550477667, 0.07341441963123338, 0.04402626630279326, 0.35314738934961964, 0.14471799082821235, 0.019244159307075483, -0.1306465223409055, 0.04444364893190082, -0.05394824152632106] |
1,802.03026 | Convective dynamics and disequilibrium chemistry in the atmospheres of
giant planets and brown dwarfs | Disequilibrium chemical processes have a large effect upon the spectra of
substellar objects. To study these effects, dynamical disequilibrium has been
parameterized using the quench and eddy diffusion approximations, but little
work has been done to explore how these approximations perform under realistic
planetary conditions in different dynamical regimes. As a first step in
addressing this problem, we study the localized, small scale convective
dynamics of planetary atmospheres by direct numerical simulation of fully
compressible hydrodynamics with reactive tracers using the Dedalus code. Using
polytropically-stratified, plane parallel atmospheres in 2- and 3-D, we explore
the quenching behavior of different abstract chemical species as a function of
the dynamical conditions of the atmosphere as parameterized by the Rayleigh
number. We find that in both 2- and 3-D, chemical species quench deeper than
would be predicted based on simple mixing length arguments. Instead, it is
necessary to employ length scales based on the chemical equilibrium profile of
the reacting species in order to predict quench points and perform chemical
kinetics modeling in 1-D. Based on the results of our simulations, we provide a
new length scale, derived from the chemical scale height, which can be used to
perform these calculations. This length scale is simple to calculate from known
chemical data and makes reasonable predictions for our dynamical simulations.
| astro-ph.EP | disequilibrium chemical processes have a large effect upon the spectra of substellar objects to study these effects dynamical disequilibrium has been parameterized using the quench and eddy diffusion approximations but little work has been done to explore how these approximations perform under realistic planetary conditions in different dynamical regimes as a first step in addressing this problem we study the localized small scale convective dynamics of planetary atmospheres by direct numerical simulation of fully compressible hydrodynamics with reactive tracers using the dedalus code using polytropicallystratified plane parallel atmospheres in 2 and 3d we explore the quenching behavior of different abstract chemical species as a function of the dynamical conditions of the atmosphere as parameterized by the rayleigh number we find that in both 2 and 3d chemical species quench deeper than would be predicted based on simple mixing length arguments instead it is necessary to employ length scales based on the chemical equilibrium profile of the reacting species in order to predict quench points and perform chemical kinetics modeling in 1d based on the results of our simulations we provide a new length scale derived from the chemical scale height which can be used to perform these calculations this length scale is simple to calculate from known chemical data and makes reasonable predictions for our dynamical simulations | [['disequilibrium', 'chemical', 'processes', 'have', 'a', 'large', 'effect', 'upon', 'the', 'spectra', 'of', 'substellar', 'objects', 'to', 'study', 'these', 'effects', 'dynamical', 'disequilibrium', 'has', 'been', 'parameterized', 'using', 'the', 'quench', 'and', 'eddy', 'diffusion', 'approximations', 'but', 'little', 'work', 'has', 'been', 'done', 'to', 'explore', 'how', 'these', 'approximations', 'perform', 'under', 'realistic', 'planetary', 'conditions', 'in', 'different', 'dynamical', 'regimes', 'as', 'a', 'first', 'step', 'in', 'addressing', 'this', 'problem', 'we', 'study', 'the', 'localized', 'small', 'scale', 'convective', 'dynamics', 'of', 'planetary', 'atmospheres', 'by', 'direct', 'numerical', 'simulation', 'of', 'fully', 'compressible', 'hydrodynamics', 'with', 'reactive', 'tracers', 'using', 'the', 'dedalus', 'code', 'using', 'polytropicallystratified', 'plane', 'parallel', 'atmospheres', 'in', '2', 'and', '3d', 'we', 'explore', 'the', 'quenching', 'behavior', 'of', 'different', 'abstract', 'chemical', 'species', 'as', 'a', 'function', 'of', 'the', 'dynamical', 'conditions', 'of', 'the', 'atmosphere', 'as', 'parameterized', 'by', 'the', 'rayleigh', 'number', 'we', 'find', 'that', 'in', 'both', '2', 'and', '3d', 'chemical', 'species', 'quench', 'deeper', 'than', 'would', 'be', 'predicted', 'based', 'on', 'simple', 'mixing', 'length', 'arguments', 'instead', 'it', 'is', 'necessary', 'to', 'employ', 'length', 'scales', 'based', 'on', 'the', 'chemical', 'equilibrium', 'profile', 'of', 'the', 'reacting', 'species', 'in', 'order', 'to', 'predict', 'quench', 'points', 'and', 'perform', 'chemical', 'kinetics', 'modeling', 'in', '1d', 'based', 'on', 'the', 'results', 'of', 'our', 'simulations', 'we', 'provide', 'a', 'new', 'length', 'scale', 'derived', 'from', 'the', 'chemical', 'scale', 'height', 'which', 'can', 'be', 'used', 'to', 'perform', 'these', 'calculations', 'this', 'length', 'scale', 'is', 'simple', 'to', 'calculate', 'from', 'known', 'chemical', 'data', 'and', 'makes', 'reasonable', 'predictions', 'for', 'our', 'dynamical', 'simulations']] | [-0.07238932366750238, 0.1379005679326063, -0.10800113630722519, 0.08492416447714074, -0.03471414902876994, -0.09775752949752603, 0.04082399405888282, 0.35037813809941765, -0.2627742900362204, -0.3296386861259601, 0.06351288250772524, -0.20731849748537773, -0.11626877024860328, 0.18298621664871462, 0.02618842873036758, 0.07494185292334468, 0.06586397254701566, -0.058018018363159, -0.06012810180146954, -0.21215854895180436, 0.3304731977922428, 0.08685507074093309, 0.1979574026470935, 0.056883305122297584, 0.04168526530837106, -0.0665172604322261, -0.051163856131973225, 0.030859131995519554, -0.2148751908833017, 0.025016175390596293, 0.20482367648057537, 0.07761082230825667, 0.2176099271228951, -0.49674212665262596, -0.30426387500052376, 0.06813099357155065, 0.15376350701532188, 0.160168640593097, -0.045539233351721324, -0.20877275580574792, 0.07673392301054534, -0.14909591578395553, -0.14195767677544305, -0.08447232213317572, 0.024623328612910375, 0.03735736620243794, -0.27975282413643543, 0.08078336191505918, 0.010426819101903002, 0.13653488956855722, -0.051485082476035504, -0.11446097081460282, -0.04623993573585284, 0.1638746782781608, 0.010219911033615333, -0.013250461436756369, 0.1773247543843118, -0.09779640028460158, -0.06828437937872002, 0.42439214999063146, -0.10528447861165828, -0.19244754112743842, 0.2811682680169017, -0.12601579524710327, -0.1358194380645054, 0.12861477555890344, 0.18925380192511645, 0.14518974804215962, -0.16027192296961504, 0.04253657955403604, -0.03321508311718288, 0.18211885313805262, 0.0313983255462652, -0.016197791613026143, 0.221361355560711, 0.22040552271668007, 0.019884995369163033, 0.10105522735803216, -0.1118836051340353, -0.13100551131733315, -0.20863674380988986, -0.11447981386704163, -0.16034173726425419, 0.05956236936402059, -0.08421825546308052, -0.16208512061792943, 0.3715431801522047, 0.21273218442257968, 0.208477928801181, 0.054029446902051054, 0.30372258458562473, 0.10526616260136103, 0.0627288830044024, 0.05191411192235709, 0.2140915373823157, 0.1243084736752617, 0.10444010318153435, -0.26474424757691817, 0.08788543700184501, 0.0741332680519446] |
1,802.03027 | Star-disc interaction in galactic nuclei: formation of a central stellar
disc | We perform high resolution direct $N$-body simulations to study the effect of
an accretion disc on stellar dynamics in an active galactic nucleus (AGN). We
show that the interaction of the nuclear stellar cluster (NSC) with the gaseous
disc (AD) leads to formation of a stellar disc in the central part of the NSC.
The accretion of stars from the stellar disc onto the super-massive black hole
is balanced by the capture of stars from the NSC into the stellar disc,
yielding a stationary density profile. We derive the migration time through the
AD to be 3\% of the half-mass relaxation time of the NSC. The mass and size of
the stellar disc are 0.7\% of the mass and 5\% of the influence radius of the
super-massive black hole. An AD lifetime shorter than the migration time would
result in a less massive nuclear stellar disc. The detection of such a stellar
disc could point to past activity of the hosting galactic nucleus.
| astro-ph.GA astro-ph.HE astro-ph.SR | we perform high resolution direct nbody simulations to study the effect of an accretion disc on stellar dynamics in an active galactic nucleus agn we show that the interaction of the nuclear stellar cluster nsc with the gaseous disc ad leads to formation of a stellar disc in the central part of the nsc the accretion of stars from the stellar disc onto the supermassive black hole is balanced by the capture of stars from the nsc into the stellar disc yielding a stationary density profile we derive the migration time through the ad to be 3 of the halfmass relaxation time of the nsc the mass and size of the stellar disc are 07 of the mass and 5 of the influence radius of the supermassive black hole an ad lifetime shorter than the migration time would result in a less massive nuclear stellar disc the detection of such a stellar disc could point to past activity of the hosting galactic nucleus | [['we', 'perform', 'high', 'resolution', 'direct', 'nbody', 'simulations', 'to', 'study', 'the', 'effect', 'of', 'an', 'accretion', 'disc', 'on', 'stellar', 'dynamics', 'in', 'an', 'active', 'galactic', 'nucleus', 'agn', 'we', 'show', 'that', 'the', 'interaction', 'of', 'the', 'nuclear', 'stellar', 'cluster', 'nsc', 'with', 'the', 'gaseous', 'disc', 'ad', 'leads', 'to', 'formation', 'of', 'a', 'stellar', 'disc', 'in', 'the', 'central', 'part', 'of', 'the', 'nsc', 'the', 'accretion', 'of', 'stars', 'from', 'the', 'stellar', 'disc', 'onto', 'the', 'supermassive', 'black', 'hole', 'is', 'balanced', 'by', 'the', 'capture', 'of', 'stars', 'from', 'the', 'nsc', 'into', 'the', 'stellar', 'disc', 'yielding', 'a', 'stationary', 'density', 'profile', 'we', 'derive', 'the', 'migration', 'time', 'through', 'the', 'ad', 'to', 'be', '3', 'of', 'the', 'halfmass', 'relaxation', 'time', 'of', 'the', 'nsc', 'the', 'mass', 'and', 'size', 'of', 'the', 'stellar', 'disc', 'are', '07', 'of', 'the', 'mass', 'and', '5', 'of', 'the', 'influence', 'radius', 'of', 'the', 'supermassive', 'black', 'hole', 'an', 'ad', 'lifetime', 'shorter', 'than', 'the', 'migration', 'time', 'would', 'result', 'in', 'a', 'less', 'massive', 'nuclear', 'stellar', 'disc', 'the', 'detection', 'of', 'such', 'a', 'stellar', 'disc', 'could', 'point', 'to', 'past', 'activity', 'of', 'the', 'hosting', 'galactic', 'nucleus']] | [-0.07616895480949912, 0.09157988980962063, -0.07923399145069297, 0.11380984115237913, -0.0792768970588965, 0.015884959510316148, 0.01967816244870813, 0.3735478577758271, -0.1839304043257186, -0.3458531372980472, 0.058329530175278206, -0.2533462206073151, 0.014734803273291127, 0.198929314957246, -0.029937732467667823, -0.018966624130454898, 0.0376940581346205, -0.03127353218458365, -0.06988293630788045, -0.24032120587321376, 0.3541095729765876, 0.10353869493540799, 0.056124538491748595, -0.02731059022393132, 0.035364775989844575, -0.05965861809537089, -0.04546616037813318, -0.05926758581143947, -0.18771665420639794, 0.04776212870446177, 0.19610311717767714, 0.16586414976845398, 0.25934105905835614, -0.4409335356754211, -0.20981769803111538, 0.02027498590302842, 0.21338544795975273, 0.0829321253813369, -0.1354917011550839, -0.20028321072030697, 0.07546353704250343, -0.2810059209051399, -0.17555543873601942, 0.11995310689454064, 0.08169507846647611, 0.007865466644553228, -0.22636002312400777, 0.15616320149738777, 0.0914769054281931, 0.029212490695477263, -0.16367004302964527, -0.04231202143867232, -0.1096279714885025, 0.1046157251105021, 0.06988649990872417, 0.07148213203327924, 0.2986739328433902, -0.14290224896183956, -0.030780735637055585, 0.3847324639513083, -0.04002413788906433, -0.04298580035658702, 0.23618360750514306, -0.26641384806723956, -0.08185966920530412, 0.11036429874187598, 0.2178504742950521, 0.16083583593414238, -0.12888154280629077, 0.019835918798237078, -0.04324271954150379, 0.23442252439913122, 0.029141703846241616, 0.018041458663650634, 0.394954615141168, 0.1662410792289016, 0.06414841761686868, 0.07628837276315831, -0.22688944212252424, -0.09521000576348393, -0.1742864962427254, -0.10652365436080409, -0.12891110011085044, 0.1299725310431302, -0.20167022975957297, -0.1420986436141735, 0.3549532673658769, 0.0467811357058539, 0.2583612060428603, 0.039316517763708266, 0.29823728478292255, 0.08618160926285515, 0.12135481151346506, 0.15009106699080188, 0.33288887882479495, 0.17993839834302527, 0.061288973756500185, -0.3599714985620116, 0.060606284315577866, 0.028268662637008207] |
1,802.03028 | There is a Hyper-Greedoid lurking behind every Graphical Accessible
Computational Search Problem solvable in Polynomial Time: $P \not= NP$ | Consider $G[X]$, where $G$ is a connected, isthmus-less and labelled graph,
and $X$ is the edge-set or the vertex-set of the graph $G$. A Graphical Search
Problem (GSP), denoted $\Pi(G[X],\gamma)$, consists of finding $Y$, where $Y
\subseteq X$ and $Y$ satisfies the predicate $\gamma$ in $G$. The subset $Y$ is
a solution of the problem $\Pi(G[X],\gamma)$. A sub-solution of
$\Pi(G[X],\gamma)$ is a subset $Y'$ such that $Y'$ is not a solution of
$\Pi(G[X],\gamma)$, but $Y'$ is a solution of the problem $\Pi(H[X'],\gamma)$,
where $X' \subset X$ and $H[X']$ is a contraction-minor of $G[X]$. Solutions
and sub-solutions are the feasible sets of $\Pi(G[X],\gamma)$.
Let $\mathfrak{I}$ be the family of all the feasible sets of
$\Pi(G[X],\gamma)$. A Hyper-greedoid is a set system $(X, \mathfrak{I})$
satisfying the following axioms.
A1: Accessibility: if $I \in \mathfrak{I}$, there is an element $x \in I$
such that $I-x \in \mathfrak{I}$
A2: Augmentability: If $I$ is a sub-solution, there is a polynomial time
function $\kappa: \mathfrak{I} \rightarrow \mathfrak{I}$ and there is a element
$x \in X-\kappa(I)$ such that $\kappa(I) \cup x \in \mathfrak{I}$. That is,
every sub-solution can be augmented using a polynomial time algorithm akin to
Edmond Augmenting Path Algorithm.
Given a graph $G$, the GSP MISP consists of finding an independent set of
vertices of $G$. MISP satisfies axioms A1 and A2. Using the P-completeness of
the Decision Problem associated to MISP, we prove that every GSP that satisfies
A1 is solvable in Polynomial Time if and only if it satisfies A2. On the other
hand, let HCP be the GSP that consists of finding a Hamiltonian cycle of the
graph $G$. HCP satisfies A1, but does not satisfies A2. Since the Decision
Problem associated with HCP is NP-Complete, we get $P \not = NP$.
| cs.CC | consider gx where g is a connected isthmusless and labelled graph and x is the edgeset or the vertexset of the graph g a graphical search problem gsp denoted pigxgamma consists of finding y where y subseteq x and y satisfies the predicate gamma in g the subset y is a solution of the problem pigxgamma a subsolution of pigxgamma is a subset y such that y is not a solution of pigxgamma but y is a solution of the problem pihxgamma where x subset x and hx is a contractionminor of gx solutions and subsolutions are the feasible sets of pigxgamma let mathfraki be the family of all the feasible sets of pigxgamma a hypergreedoid is a set system x mathfraki satisfying the following axioms a1 accessibility if i in mathfraki there is an element x in i such that ix in mathfraki a2 augmentability if i is a subsolution there is a polynomial time function kappa mathfraki rightarrow mathfraki and there is a element x in xkappai such that kappai cup x in mathfraki that is every subsolution can be augmented using a polynomial time algorithm akin to edmond augmenting path algorithm given a graph g the gsp misp consists of finding an independent set of vertices of g misp satisfies axioms a1 and a2 using the pcompleteness of the decision problem associated to misp we prove that every gsp that satisfies a1 is solvable in polynomial time if and only if it satisfies a2 on the other hand let hcp be the gsp that consists of finding a hamiltonian cycle of the graph g hcp satisfies a1 but does not satisfies a2 since the decision problem associated with hcp is npcomplete we get p not np | [['consider', 'gx', 'where', 'g', 'is', 'a', 'connected', 'isthmusless', 'and', 'labelled', 'graph', 'and', 'x', 'is', 'the', 'edgeset', 'or', 'the', 'vertexset', 'of', 'the', 'graph', 'g', 'a', 'graphical', 'search', 'problem', 'gsp', 'denoted', 'pigxgamma', 'consists', 'of', 'finding', 'y', 'where', 'y', 'subseteq', 'x', 'and', 'y', 'satisfies', 'the', 'predicate', 'gamma', 'in', 'g', 'the', 'subset', 'y', 'is', 'a', 'solution', 'of', 'the', 'problem', 'pigxgamma', 'a', 'subsolution', 'of', 'pigxgamma', 'is', 'a', 'subset', 'y', 'such', 'that', 'y', 'is', 'not', 'a', 'solution', 'of', 'pigxgamma', 'but', 'y', 'is', 'a', 'solution', 'of', 'the', 'problem', 'pihxgamma', 'where', 'x', 'subset', 'x', 'and', 'hx', 'is', 'a', 'contractionminor', 'of', 'gx', 'solutions', 'and', 'subsolutions', 'are', 'the', 'feasible', 'sets', 'of', 'pigxgamma', 'let', 'mathfraki', 'be', 'the', 'family', 'of', 'all', 'the', 'feasible', 'sets', 'of', 'pigxgamma', 'a', 'hypergreedoid', 'is', 'a', 'set', 'system', 'x', 'mathfraki', 'satisfying', 'the', 'following', 'axioms', 'a1', 'accessibility', 'if', 'i', 'in', 'mathfraki', 'there', 'is', 'an', 'element', 'x', 'in', 'i', 'such', 'that', 'ix', 'in', 'mathfraki', 'a2', 'augmentability', 'if', 'i', 'is', 'a', 'subsolution', 'there', 'is', 'a', 'polynomial', 'time', 'function', 'kappa', 'mathfraki', 'rightarrow', 'mathfraki', 'and', 'there', 'is', 'a', 'element', 'x', 'in', 'xkappai', 'such', 'that', 'kappai', 'cup', 'x', 'in', 'mathfraki', 'that', 'is', 'every', 'subsolution', 'can', 'be', 'augmented', 'using', 'a', 'polynomial', 'time', 'algorithm', 'akin', 'to', 'edmond', 'augmenting', 'path', 'algorithm', 'given', 'a', 'graph', 'g', 'the', 'gsp', 'misp', 'consists', 'of', 'finding', 'an', 'independent', 'set', 'of', 'vertices', 'of', 'g', 'misp', 'satisfies', 'axioms', 'a1', 'and', 'a2', 'using', 'the', 'pcompleteness', 'of', 'the', 'decision', 'problem', 'associated', 'to', 'misp', 'we', 'prove', 'that', 'every', 'gsp', 'that', 'satisfies', 'a1', 'is', 'solvable', 'in', 'polynomial', 'time', 'if', 'and', 'only', 'if', 'it', 'satisfies', 'a2', 'on', 'the', 'other', 'hand', 'let', 'hcp', 'be', 'the', 'gsp', 'that', 'consists', 'of', 'finding', 'a', 'hamiltonian', 'cycle', 'of', 'the', 'graph', 'g', 'hcp', 'satisfies', 'a1', 'but', 'does', 'not', 'satisfies', 'a2', 'since', 'the', 'decision', 'problem', 'associated', 'with', 'hcp', 'is', 'npcomplete', 'we', 'get', 'p', 'not', 'np']] | [-0.196425563116348, 0.07525289657250667, -0.06917996100694414, -0.010562963782511259, -0.09744768827484632, -0.1867852131049083, 0.039588335689983635, 0.38074883422650346, -0.3279800641639027, -0.1736555820360491, 0.08720656284532824, -0.33163054230537686, -0.1005446329839121, 0.137020194493103, -0.09189758176134873, -0.024169251529342482, 0.08068040557278232, 0.12143099287600244, -0.02491524512141707, -0.22660287876013324, 0.3055688352061724, -0.12027025661877239, 0.16005099158197916, 0.015695513596653308, 0.15899801106539777, 0.021130021690213923, 0.06913952153949986, 0.06969546068059675, -0.13785314973382568, 0.046264670005897846, 0.2715300487528201, 0.2084866303289922, 0.2726330693545145, -0.3054119161759343, -0.11646803021629777, 0.2310299939790767, 0.08975494198802807, -0.0670302147340869, 0.012017603977550556, -0.204519498570245, 0.17159450688304276, -0.10201553054626139, -0.09980672272004214, 0.01194027442203074, 0.14543571049662332, 0.005036872585343433, -0.3689315078606252, -0.007631650827431553, 0.09363027028477108, 0.012869423080944766, -0.006827262454030012, -0.1301392307550102, -0.08754878782201558, 0.033043344007496735, -0.028305858807739948, 0.1871396646003606, 0.03436404710568317, -0.06725134085185422, -0.09835586766712368, 0.4290310228659532, -0.04008496599599824, -0.2038213486756972, 0.09189488280820332, -0.13182531739585102, -0.20366133394828198, 0.12445759149858544, 0.045519152253662876, 0.16278292005881667, -0.09606541312729258, 0.24483047939777952, -0.15007576935852446, 0.17136873725578713, 0.06719024297223807, -0.0397423654483159, 0.10886287269127472, 0.16976724964612439, 0.13679351925466235, 0.10890336630232206, 0.005521278230319272, 0.061440514805595536, -0.3640777341444308, -0.1584214195773058, -0.2147304010950521, 0.11683153729937261, -0.11197465757427828, -0.17496069483983684, 0.3131545307877159, 0.06082021963576012, 0.1671290232432665, 0.03871883876034728, 0.1916124390513623, 0.11291791621891169, -0.0126625954743387, 0.12913945180685324, 0.09636576706871496, 0.12005977828586868, 0.00804896494308093, -0.1596696655180725, 0.09950547559272079, 0.15699316201674482] |
1,802.03029 | Calculus without Limit Theory | This paper establishes calculus upon two physical facts: (1) any average
velocity is always between two instantaneous velocities, and (2) the motion of
an object is determined once its velocity has been determined. It directly
defines derivative and definite integral on an ordered field, proves the
fundamental theorem of calculus with no auxiliary conditions, easily reveals
the common properties of derivatives, and obtains differentiation formulas for
elementary functions. Further discussion shows that the new definitions are in
accord with the traditional concepts for continuously differentiable functions.
This is a result of the authors' research in the field of educational
mathematics, which hopes to provide a more elementary and effective way to
teach calculus.
| math.GM | this paper establishes calculus upon two physical facts 1 any average velocity is always between two instantaneous velocities and 2 the motion of an object is determined once its velocity has been determined it directly defines derivative and definite integral on an ordered field proves the fundamental theorem of calculus with no auxiliary conditions easily reveals the common properties of derivatives and obtains differentiation formulas for elementary functions further discussion shows that the new definitions are in accord with the traditional concepts for continuously differentiable functions this is a result of the authors research in the field of educational mathematics which hopes to provide a more elementary and effective way to teach calculus | [['this', 'paper', 'establishes', 'calculus', 'upon', 'two', 'physical', 'facts', '1', 'any', 'average', 'velocity', 'is', 'always', 'between', 'two', 'instantaneous', 'velocities', 'and', '2', 'the', 'motion', 'of', 'an', 'object', 'is', 'determined', 'once', 'its', 'velocity', 'has', 'been', 'determined', 'it', 'directly', 'defines', 'derivative', 'and', 'definite', 'integral', 'on', 'an', 'ordered', 'field', 'proves', 'the', 'fundamental', 'theorem', 'of', 'calculus', 'with', 'no', 'auxiliary', 'conditions', 'easily', 'reveals', 'the', 'common', 'properties', 'of', 'derivatives', 'and', 'obtains', 'differentiation', 'formulas', 'for', 'elementary', 'functions', 'further', 'discussion', 'shows', 'that', 'the', 'new', 'definitions', 'are', 'in', 'accord', 'with', 'the', 'traditional', 'concepts', 'for', 'continuously', 'differentiable', 'functions', 'this', 'is', 'a', 'result', 'of', 'the', 'authors', 'research', 'in', 'the', 'field', 'of', 'educational', 'mathematics', 'which', 'hopes', 'to', 'provide', 'a', 'more', 'elementary', 'and', 'effective', 'way', 'to', 'teach', 'calculus']] | [-0.1100346617827159, 0.1060084068379674, -0.14762604119878395, 0.06448968952991464, -0.14766452712237638, -0.11157137010889374, 0.006367641007651336, 0.3764240955357003, -0.2693818457820247, -0.3039332039456452, 0.07921338638299005, -0.22912016413813308, -0.15274434324366296, 0.2194307338429895, -0.09541966380956851, -0.014852598677822017, 0.015316056550183721, 0.10099367574666034, -0.10121704507165843, -0.22976468008967627, 0.318757265373504, -0.01450947936484178, 0.23615965845714432, 0.07579080911509825, 0.12875029154583417, 0.02142735206381937, -0.07879863379407773, -0.009158594183524889, -0.13163940815196581, 0.17285824728618682, 0.25414380328977004, 0.14315402286489848, 0.31324279450077924, -0.3918745077454147, -0.16894258710399138, 0.04747990280208466, 0.10613366341696376, 0.06418671469158797, -0.014233879863095997, -0.2760699545527784, 0.0608808562608716, -0.1358946060176642, -0.1833837599147408, -0.08185639602453572, 0.05900048397160012, 0.01686821877853368, -0.24300644313504474, 0.03515570341538333, 0.10735738033890328, 0.10890753650254842, -0.08086716802069605, -0.127629068544118, -0.006306254984893366, 0.11141001756212353, 0.05504178293914724, 0.06150426075637209, 0.10937306040123237, -0.10348860907318912, -0.12788159689923698, 0.3311205374291249, -0.028524367462233764, -0.22659712372320925, 0.19905602046807783, -0.13293507790390766, -0.13289269336408613, 0.10314031713106142, 0.06759471855068629, 0.10846493993185263, -0.17996680890251182, 0.0946450695267722, -0.03250577883893805, 0.1721425572764623, 0.07674144408294717, 0.023572943580287418, 0.2064289748256581, 0.11026447265928166, 0.08337265611172909, 0.10543655474315834, 0.005758758710565424, -0.1260414217367966, -0.32840757236395657, -0.22007731216407456, -0.15530179702858152, 0.02795242375191466, -0.07653485899904446, -0.1595525620731863, 0.3731924956252353, 0.14781484630296782, 0.14925293435870085, 0.06613385074141444, 0.29049885556497407, 0.17648209583228536, 0.08129210164770484, 0.05806041004927417, 0.21305616191239096, 0.16218032740237834, 0.1377474043674899, -0.11143542733867612, 0.08572585206989826, 0.10013502828397713] |
1,802.0303 | Production cross sections of cosmic antiprotons in the light of new data
from the NA61 and LHCb experiments | The cosmic-ray flux of antiprotons is measured with high precision by the
space-borne particle spectrometers AMS-02.Its interpretation requires a correct
description of the dominant production process for antiprotons in our Galaxy,
namely, the interaction of cosmic-ray proton and helium with the interstellar
medium. In the light of new cross section measurements by the NA61 experiment
of $p + p \rightarrow \bar{p} + X$ and the first ever measurement of $p +
\mathrm{He} \rightarrow \bar{p} + X$ by the LHCb experiment, we update the
parametrization of proton-proton and proton-nucleon cross sections.We find that
the LHCb $p$He data constrain a shape for the cross section at high energies
and show for the first time how well the rescaling from the $pp$ channel
applies to a helium target. By using $pp$, $p$He and $p$C data we estimate the
uncertainty on the Lorentz invariant cross section for $p + \mathrm{He}
\rightarrow \bar{p} + X$. We use these new cross sections to compute the source
term for all the production channels, considering also nuclei heavier than He
both in cosmic rays and the interstellar medium. The uncertainties on the total
source term are at the level of $\pm20$% and slightly increase below antiproton
energies of 5 GeV. This uncertainty is dominated by the $p+p \rightarrow
\bar{p} + X$ cross section, which translates into all channels since we derive
them using the $pp$ cross sections. The cross sections to calculate the source
spectra from all relevant cosmic-ray isotopes are provided in the Supplemental
Material. We finally quantify the necessity of new data on antiproton
production cross sections, and pin down the kinematic parameter space which
should be covered by future data.
| astro-ph.HE hep-ex hep-ph | the cosmicray flux of antiprotons is measured with high precision by the spaceborne particle spectrometers ams02its interpretation requires a correct description of the dominant production process for antiprotons in our galaxy namely the interaction of cosmicray proton and helium with the interstellar medium in the light of new cross section measurements by the na61 experiment of p p rightarrow barp x and the first ever measurement of p mathrmhe rightarrow barp x by the lhcb experiment we update the parametrization of protonproton and protonnucleon cross sectionswe find that the lhcb phe data constrain a shape for the cross section at high energies and show for the first time how well the rescaling from the pp channel applies to a helium target by using pp phe and pc data we estimate the uncertainty on the lorentz invariant cross section for p mathrmhe rightarrow barp x we use these new cross sections to compute the source term for all the production channels considering also nuclei heavier than he both in cosmic rays and the interstellar medium the uncertainties on the total source term are at the level of pm20 and slightly increase below antiproton energies of 5 gev this uncertainty is dominated by the pp rightarrow barp x cross section which translates into all channels since we derive them using the pp cross sections the cross sections to calculate the source spectra from all relevant cosmicray isotopes are provided in the supplemental material we finally quantify the necessity of new data on antiproton production cross sections and pin down the kinematic parameter space which should be covered by future data | [['the', 'cosmicray', 'flux', 'of', 'antiprotons', 'is', 'measured', 'with', 'high', 'precision', 'by', 'the', 'spaceborne', 'particle', 'spectrometers', 'ams02its', 'interpretation', 'requires', 'a', 'correct', 'description', 'of', 'the', 'dominant', 'production', 'process', 'for', 'antiprotons', 'in', 'our', 'galaxy', 'namely', 'the', 'interaction', 'of', 'cosmicray', 'proton', 'and', 'helium', 'with', 'the', 'interstellar', 'medium', 'in', 'the', 'light', 'of', 'new', 'cross', 'section', 'measurements', 'by', 'the', 'na61', 'experiment', 'of', 'p', 'p', 'rightarrow', 'barp', 'x', 'and', 'the', 'first', 'ever', 'measurement', 'of', 'p', 'mathrmhe', 'rightarrow', 'barp', 'x', 'by', 'the', 'lhcb', 'experiment', 'we', 'update', 'the', 'parametrization', 'of', 'protonproton', 'and', 'protonnucleon', 'cross', 'sectionswe', 'find', 'that', 'the', 'lhcb', 'phe', 'data', 'constrain', 'a', 'shape', 'for', 'the', 'cross', 'section', 'at', 'high', 'energies', 'and', 'show', 'for', 'the', 'first', 'time', 'how', 'well', 'the', 'rescaling', 'from', 'the', 'pp', 'channel', 'applies', 'to', 'a', 'helium', 'target', 'by', 'using', 'pp', 'phe', 'and', 'pc', 'data', 'we', 'estimate', 'the', 'uncertainty', 'on', 'the', 'lorentz', 'invariant', 'cross', 'section', 'for', 'p', 'mathrmhe', 'rightarrow', 'barp', 'x', 'we', 'use', 'these', 'new', 'cross', 'sections', 'to', 'compute', 'the', 'source', 'term', 'for', 'all', 'the', 'production', 'channels', 'considering', 'also', 'nuclei', 'heavier', 'than', 'he', 'both', 'in', 'cosmic', 'rays', 'and', 'the', 'interstellar', 'medium', 'the', 'uncertainties', 'on', 'the', 'total', 'source', 'term', 'are', 'at', 'the', 'level', 'of', 'pm20', 'and', 'slightly', 'increase', 'below', 'antiproton', 'energies', 'of', '5', 'gev', 'this', 'uncertainty', 'is', 'dominated', 'by', 'the', 'pp', 'rightarrow', 'barp', 'x', 'cross', 'section', 'which', 'translates', 'into', 'all', 'channels', 'since', 'we', 'derive', 'them', 'using', 'the', 'pp', 'cross', 'sections', 'the', 'cross', 'sections', 'to', 'calculate', 'the', 'source', 'spectra', 'from', 'all', 'relevant', 'cosmicray', 'isotopes', 'are', 'provided', 'in', 'the', 'supplemental', 'material', 'we', 'finally', 'quantify', 'the', 'necessity', 'of', 'new', 'data', 'on', 'antiproton', 'production', 'cross', 'sections', 'and', 'pin', 'down', 'the', 'kinematic', 'parameter', 'space', 'which', 'should', 'be', 'covered', 'by', 'future', 'data']] | [-0.03648535154972658, 0.17760429675263537, -0.06736906448532635, 0.10808496953977874, 0.004787031669267331, -0.07418758038336355, 0.034221376662146065, 0.34168740093694083, -0.23025557020773296, -0.3142906587853442, -0.05521613737212473, -0.377401112463702, 0.07505711645462589, 0.19020984481674819, 0.0629125213048208, 0.0770342459681218, 0.10726059443571985, 0.014379818025585753, -0.020238969388700435, -0.21606037259966918, 0.30476765962464086, 0.1386212952825684, 0.2153595642802351, 0.1394793128870316, 0.07847997357795009, 0.060667662947588644, -0.07145103043113567, -0.07459196985853149, -0.15940454769803822, 0.09010160896205081, 0.26536299136387925, 0.10319714560888513, 0.0749953742686673, -0.3719474043738976, -0.14520489625468821, 0.15238843711916258, 0.12431527953246113, 0.04576012069247803, -0.031852220092666396, -0.30293525046972414, 0.10049056280362909, -0.1969164935313863, -0.097376628958512, -0.010673963081105594, 0.060688825151516815, 0.019588410272699003, -0.27002412908316387, 0.05366686329649751, -0.013374379594907974, 0.04400285075929658, -0.07753547661752903, -0.200938272543691, -0.04571024263547978, 0.018675575807188333, 0.0635751781819261, 0.07028162270081963, 0.1919216465620038, -0.10217598629225924, -0.0908706645749, 0.3934143115504739, -0.06419428549485659, -0.12721794409056505, 0.1015772790395592, -0.21173006347563703, -0.1328043171574365, 0.2080535757327487, 0.2295490051881316, 0.07400047262844521, -0.18561417853968978, 0.1156254365729789, 0.022088135967610147, 0.1765755651185589, 0.09703041170985344, 0.009135617659227095, 0.1382684083805901, 0.17171351170326035, 0.01806850443604622, 0.0283266853092915, -0.18874352919960252, 0.004799371574785602, -0.41632700723697075, -0.15842591723155106, -0.07608091198509621, 0.0820305761227154, -0.04184354111431899, -0.02224031645006305, 0.292561115161603, 0.06597941617220021, 0.30390610641273164, -0.012558411012407155, 0.3308257701831141, 0.10429230108264177, 0.028799499800142726, 0.06188143204988333, 0.3069845641098135, 0.17131103568340647, 0.12681294603740678, -0.20097768793147658, 0.0849270792834963, 0.012565943006119143] |
1,802.03031 | Some remarks on metrics induced by a fuzzy metric | We introduce a crisp metric $d_M$ as the common limit of two different nets
$(\Delta_{M,\lambda})$ and $(\delta_{M,\lambda})$ of crisp metrics induced by a
fuzzy metric $M$ and prove that the existence of each of these limits is
equivalent to that of the other and it is characterized by another condition on
the original fuzzy metric $M$. We also derive some of the properties of these
approximate metrics $\Delta_\lambda$ and $\delta_\lambda$. On the other hand,
for a given a crisp metric $d$, establish that the fuzzy metric representing
$M_d$ with values in $\{0,1\}$ and $d$ are compatible with the same topology.
Further, we prove that if a crisp metric $d$ induces a fuzzy metric $M_d$, then
all the approximate crisp metrics $\Delta_{M,\lambda}$ and $\delta_{M,\lambda}$
induced by this fuzzy metric are equal to the original metric $d$.
| math.GM | we introduce a crisp metric d_m as the common limit of two different nets delta_mlambda and delta_mlambda of crisp metrics induced by a fuzzy metric m and prove that the existence of each of these limits is equivalent to that of the other and it is characterized by another condition on the original fuzzy metric m we also derive some of the properties of these approximate metrics delta_lambda and delta_lambda on the other hand for a given a crisp metric d establish that the fuzzy metric representing m_d with values in 01 and d are compatible with the same topology further we prove that if a crisp metric d induces a fuzzy metric m_d then all the approximate crisp metrics delta_mlambda and delta_mlambda induced by this fuzzy metric are equal to the original metric d | [['we', 'introduce', 'a', 'crisp', 'metric', 'd_m', 'as', 'the', 'common', 'limit', 'of', 'two', 'different', 'nets', 'delta_mlambda', 'and', 'delta_mlambda', 'of', 'crisp', 'metrics', 'induced', 'by', 'a', 'fuzzy', 'metric', 'm', 'and', 'prove', 'that', 'the', 'existence', 'of', 'each', 'of', 'these', 'limits', 'is', 'equivalent', 'to', 'that', 'of', 'the', 'other', 'and', 'it', 'is', 'characterized', 'by', 'another', 'condition', 'on', 'the', 'original', 'fuzzy', 'metric', 'm', 'we', 'also', 'derive', 'some', 'of', 'the', 'properties', 'of', 'these', 'approximate', 'metrics', 'delta_lambda', 'and', 'delta_lambda', 'on', 'the', 'other', 'hand', 'for', 'a', 'given', 'a', 'crisp', 'metric', 'd', 'establish', 'that', 'the', 'fuzzy', 'metric', 'representing', 'm_d', 'with', 'values', 'in', '01', 'and', 'd', 'are', 'compatible', 'with', 'the', 'same', 'topology', 'further', 'we', 'prove', 'that', 'if', 'a', 'crisp', 'metric', 'd', 'induces', 'a', 'fuzzy', 'metric', 'm_d', 'then', 'all', 'the', 'approximate', 'crisp', 'metrics', 'delta_mlambda', 'and', 'delta_mlambda', 'induced', 'by', 'this', 'fuzzy', 'metric', 'are', 'equal', 'to', 'the', 'original', 'metric', 'd']] | [-0.12802886542070796, 0.11066534754613208, -0.05838709426698861, 0.10953061210629703, -0.08079027189631705, -0.15868772925740038, 0.04389479265686263, 0.36332905743685034, -0.2414231888725664, -0.25152902154389906, 0.11925683464354801, -0.31092738075940696, -0.17889241856540106, 0.1370823367860996, -0.09589340098685137, 0.038379818855685664, 0.03638528723752609, 0.1481278596928826, -0.10508713262086665, -0.22110061000998096, 0.41145195036574644, -0.013240180957924437, 0.22504146255000873, 0.039812847409673315, 0.14907699962388035, -0.04234375191714477, -0.0336954644329294, 0.1469054031410013, -0.1609288286842423, 0.15302362732796204, 0.187396960567545, 0.19808328892104327, 0.2299902747626658, -0.3191259610466659, -0.15703114873591673, 0.12401230184154378, 0.0327019559978335, -0.055374786066305304, 0.05155521590711066, -0.33051472544946053, 0.17223681718869893, -0.10540492218677644, -0.08331171450619068, -0.06524982357880584, 0.04953654059381397, 0.009089820673344311, -0.28573006581928995, -0.019135081832064315, 0.11573360380544155, 0.024097780317619995, -0.09009796246472332, -0.10862181844109997, -0.0501772147844787, 0.08791756828281062, 0.022447798528743013, 0.06883519448477912, 0.0444312562217453, -0.07180361354732197, -0.12450182430998043, 0.3406832341173733, -0.07964345698279363, -0.29780891038201474, 0.1648875330126396, -0.11717120447299546, -0.0999203994801199, 0.03488275664599819, 0.10001473312710274, 0.15411355963183773, -0.1306530329640265, 0.14178871323130335, -0.08463858131457258, 0.14321226652849603, 0.12746131618817647, 0.04802676375127501, 0.14310587615602546, 0.11319175658109426, 0.10218475163327875, 0.13458035558341416, -0.05217946248680905, -0.053017183858901265, -0.29842172666556305, -0.15343788550752732, -0.1257179155057572, 0.06543337262959945, -0.212896781479638, -0.21292950419916046, 0.32983491627706424, 0.10914701343410545, 0.26616201001667866, 0.10091498932904668, 0.2550939295026991, 0.10430316689717412, 0.03814162695694163, 0.07109285379173579, 0.22654847604571843, 0.1225387606959514, 0.03224059289528264, -0.1458618642848537, 0.01564422346720541, 0.15253396513699383] |
1,802.03032 | Mixed Equilibrium Solution of Time-Inconsistent Stochastic LQ Problem | In this paper, we propose a novel equilibrium solution notion for the
time-inconsistent stochastic linear-quadratic optimal control problem. This
notion is called the mixed equilibrium solution, which consists of two parts: a
pure-feedback-strategy part and an open-loop-control part. When the
pure-feedback-strategy part is zero or the open-loop-control part does not
depend on the initial state, the mixed equilibrium solution reduces to the
open-loop equilibrium control and the feedback equilibrium strategy,
respectively. Using a maximum-principle-like methodology with forward-backward
stochastic difference equations, a necessary and sufficient condition is
established to characterize the existence of a mixed equilibrium solution.
Then, by decoupling the forward-backward stochastic difference equations, three
sets of difference equations, which together portray the existence of a mixed
equilibrium solution, are obtained. Moreover, the case with a fixed time-state
initial pair and the case with all the initial pairs are separately
investigated. Furthermore, an example is constructed to show that the mixed
equilibrium solution exists for all the initial pairs, although neither the
open-loop equilibrium control nor the feedback equilibrium strategy exists for
some initial pairs.
| math.OC | in this paper we propose a novel equilibrium solution notion for the timeinconsistent stochastic linearquadratic optimal control problem this notion is called the mixed equilibrium solution which consists of two parts a purefeedbackstrategy part and an openloopcontrol part when the purefeedbackstrategy part is zero or the openloopcontrol part does not depend on the initial state the mixed equilibrium solution reduces to the openloop equilibrium control and the feedback equilibrium strategy respectively using a maximumprinciplelike methodology with forwardbackward stochastic difference equations a necessary and sufficient condition is established to characterize the existence of a mixed equilibrium solution then by decoupling the forwardbackward stochastic difference equations three sets of difference equations which together portray the existence of a mixed equilibrium solution are obtained moreover the case with a fixed timestate initial pair and the case with all the initial pairs are separately investigated furthermore an example is constructed to show that the mixed equilibrium solution exists for all the initial pairs although neither the openloop equilibrium control nor the feedback equilibrium strategy exists for some initial pairs | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'equilibrium', 'solution', 'notion', 'for', 'the', 'timeinconsistent', 'stochastic', 'linearquadratic', 'optimal', 'control', 'problem', 'this', 'notion', 'is', 'called', 'the', 'mixed', 'equilibrium', 'solution', 'which', 'consists', 'of', 'two', 'parts', 'a', 'purefeedbackstrategy', 'part', 'and', 'an', 'openloopcontrol', 'part', 'when', 'the', 'purefeedbackstrategy', 'part', 'is', 'zero', 'or', 'the', 'openloopcontrol', 'part', 'does', 'not', 'depend', 'on', 'the', 'initial', 'state', 'the', 'mixed', 'equilibrium', 'solution', 'reduces', 'to', 'the', 'openloop', 'equilibrium', 'control', 'and', 'the', 'feedback', 'equilibrium', 'strategy', 'respectively', 'using', 'a', 'maximumprinciplelike', 'methodology', 'with', 'forwardbackward', 'stochastic', 'difference', 'equations', 'a', 'necessary', 'and', 'sufficient', 'condition', 'is', 'established', 'to', 'characterize', 'the', 'existence', 'of', 'a', 'mixed', 'equilibrium', 'solution', 'then', 'by', 'decoupling', 'the', 'forwardbackward', 'stochastic', 'difference', 'equations', 'three', 'sets', 'of', 'difference', 'equations', 'which', 'together', 'portray', 'the', 'existence', 'of', 'a', 'mixed', 'equilibrium', 'solution', 'are', 'obtained', 'moreover', 'the', 'case', 'with', 'a', 'fixed', 'timestate', 'initial', 'pair', 'and', 'the', 'case', 'with', 'all', 'the', 'initial', 'pairs', 'are', 'separately', 'investigated', 'furthermore', 'an', 'example', 'is', 'constructed', 'to', 'show', 'that', 'the', 'mixed', 'equilibrium', 'solution', 'exists', 'for', 'all', 'the', 'initial', 'pairs', 'although', 'neither', 'the', 'openloop', 'equilibrium', 'control', 'nor', 'the', 'feedback', 'equilibrium', 'strategy', 'exists', 'for', 'some', 'initial', 'pairs']] | [-0.16188074261059657, 0.0717940438663765, -0.12831329219317172, 0.06665433519930743, -0.04361353142680052, -0.15991983326316317, 0.03656277103445438, 0.30482696110711377, -0.31605441570281984, -0.25059259644819093, 0.16108357886550947, -0.25205604281440813, -0.11157089195296388, 0.10968098728506662, -0.032777850532575564, 0.04244196557658998, 0.08176158256280948, 0.019316043888273484, -0.06430696245036362, -0.20953960923327353, 0.3807960462729063, -0.03597420553183731, 0.27871496229816006, -0.006303442179170601, 0.16539882207837175, -0.010623198690112023, 0.02495893282843206, 0.06382810537675944, -0.13620679755305687, 0.05639005112667184, 0.22827431308516466, 0.12827191873015287, 0.33294574124190734, -0.3703324157415944, -0.14727453271694044, 0.17616665065562462, 0.09197598996466053, 0.14316238196950187, -0.08284949360565995, -0.2032341090578805, 0.11901457937269964, -0.13405560800148283, -0.16629825312069016, -0.04706108565716183, -0.0067129967994440124, 0.04105268390260736, -0.3537050222498639, 0.050284295090857675, 0.07471870768075699, 0.0056521969998036235, -0.14755773978746112, -0.10604523846003062, -0.05566017749233117, 0.10197458129516557, -0.023429642632767995, -0.020087010832503437, 0.09757135804633008, -0.09509116404772024, -0.09867642216165276, 0.3254038305953145, -0.07724570791949244, -0.28293021919808403, 0.1764146253630957, -0.07787587878787343, -0.08491519174593336, 0.13018244335099177, 0.11017597945242683, 0.17519613015465438, -0.19750752773808714, 0.06740277817828909, -0.06768502914346755, 0.17232215762247935, 0.04772240093306584, -0.010313104084857246, 0.15537357140222893, 0.1261087159407051, 0.18796442210304495, 0.16674123474068064, -0.000762858396560392, -0.22274600393412744, -0.36545440282343944, -0.11387261153363129, -0.1251938367878799, 0.0512938349696068, -0.03762155379791854, -0.18819509445251348, 0.3512552828363636, 0.09265868722680298, 0.1478317906450042, 0.06205617045463227, 0.29352356164086174, 0.16589384231654764, -0.05682961718891474, 0.092748887105571, 0.2470112896149444, 0.12119584108620662, 0.1272162622114753, -0.2913151743633481, 0.1062607363852508, 0.09854198307730258] |
1,802.03033 | System-in-the-loop Design Space Exploration for Efficient Communication
in Large-scale IoT-based Warehouse Systems | Instead of treating inventory items as static resources, future intelligent
warehouses will transcend containers to Cyber Physical Systems (CPS) that
actively and autonomously participate in the optimization of the logistical
processes. Consequently, new challenges that are system-immanent for the
massive Internet of Things (IoT) context, such as channel access in a shared
communication medium, have to be addressed. In this paper, we present a
multi-methodological system model that brings together testbed experiments for
measuring real hardware properties and simulative evaluations for large-scale
considerations. As an example case study, we will particularly focus on
parametrization of the 802.15.4-based radio communication system, which has to
be energy-efficient due to scarce amount of harvested energy, but avoid
latencies for the maintenance of scalability of the overlaying warehouse
system. The results show, that a modification of the initial backoff time can
lead to both, energy and time savings in the order of 50% compared to the
standard.
| cs.NI | instead of treating inventory items as static resources future intelligent warehouses will transcend containers to cyber physical systems cps that actively and autonomously participate in the optimization of the logistical processes consequently new challenges that are systemimmanent for the massive internet of things iot context such as channel access in a shared communication medium have to be addressed in this paper we present a multimethodological system model that brings together testbed experiments for measuring real hardware properties and simulative evaluations for largescale considerations as an example case study we will particularly focus on parametrization of the 802154based radio communication system which has to be energyefficient due to scarce amount of harvested energy but avoid latencies for the maintenance of scalability of the overlaying warehouse system the results show that a modification of the initial backoff time can lead to both energy and time savings in the order of 50 compared to the standard | [['instead', 'of', 'treating', 'inventory', 'items', 'as', 'static', 'resources', 'future', 'intelligent', 'warehouses', 'will', 'transcend', 'containers', 'to', 'cyber', 'physical', 'systems', 'cps', 'that', 'actively', 'and', 'autonomously', 'participate', 'in', 'the', 'optimization', 'of', 'the', 'logistical', 'processes', 'consequently', 'new', 'challenges', 'that', 'are', 'systemimmanent', 'for', 'the', 'massive', 'internet', 'of', 'things', 'iot', 'context', 'such', 'as', 'channel', 'access', 'in', 'a', 'shared', 'communication', 'medium', 'have', 'to', 'be', 'addressed', 'in', 'this', 'paper', 'we', 'present', 'a', 'multimethodological', 'system', 'model', 'that', 'brings', 'together', 'testbed', 'experiments', 'for', 'measuring', 'real', 'hardware', 'properties', 'and', 'simulative', 'evaluations', 'for', 'largescale', 'considerations', 'as', 'an', 'example', 'case', 'study', 'we', 'will', 'particularly', 'focus', 'on', 'parametrization', 'of', 'the', '802154based', 'radio', 'communication', 'system', 'which', 'has', 'to', 'be', 'energyefficient', 'due', 'to', 'scarce', 'amount', 'of', 'harvested', 'energy', 'but', 'avoid', 'latencies', 'for', 'the', 'maintenance', 'of', 'scalability', 'of', 'the', 'overlaying', 'warehouse', 'system', 'the', 'results', 'show', 'that', 'a', 'modification', 'of', 'the', 'initial', 'backoff', 'time', 'can', 'lead', 'to', 'both', 'energy', 'and', 'time', 'savings', 'in', 'the', 'order', 'of', '50', 'compared', 'to', 'the', 'standard']] | [-0.1922960756762903, 0.05640233441694279, -0.03310923395363848, 0.035976309482692835, -0.08354859716807868, -0.14422818662796094, 0.08211836749024763, 0.3696867742680556, -0.26915789617607927, -0.34756872226601304, 0.12657199565025157, -0.27045990731559433, -0.12489037274457021, 0.21281001568056446, -0.10385730520926958, 0.05588322584019548, 0.09149629197743357, 0.0007413216498032804, 0.017526259614210206, -0.25525224024109194, 0.2958318286377505, 0.11236216359777956, 0.2994702222343806, 0.0710481366093289, 0.039212268270572975, -0.019200121691691018, -0.03453535618667571, -0.01147177282365005, -0.042680712288017356, 0.12591994775687376, 0.32702986015290614, 0.19163515757682997, 0.31830913805100597, -0.4903298592972045, -0.2248985662081877, 0.11117767119496469, 0.17098689769450204, 0.06983631880975495, -0.07259723165809541, -0.26897021732601456, 0.10374425790875545, -0.2489710333541233, -0.11883332250356082, -0.09555717619962448, 0.0035260965837942844, 0.04388565694086796, -0.26334616116522536, -0.008256374674830709, -0.013902918617580308, 0.026362023077325415, -0.08627256417850539, -0.07973345923962208, 0.02154706676324077, 0.17069515851727188, 0.03944872596705123, -0.006391868391536818, 0.157740046242437, -0.16072370710980072, -0.13364783621436319, 0.427537587847536, 0.018048063467953675, -0.17761824980982585, 0.20270841528965308, -0.051556933794590025, -0.13898522917810358, 0.06917401108835262, 0.2826222450971998, 0.04366148494196353, -0.20950631397030015, 0.041801945332958924, 0.0047266310765500495, 0.17326436509433762, 0.030499757821085733, 0.10402981752517405, 0.17957655994132135, 0.23446853909123416, 0.09777882246960522, 0.12383097070053417, -0.03516459380991954, -0.12303459277339526, -0.23085389083053992, -0.18489971797179355, -0.17779381341911507, 0.029380359805639314, -0.05607227949297984, -0.09159419378142385, 0.3518013444679808, 0.20380589185245582, 0.15486316425442104, 0.051502178542605845, 0.3781066536271192, 0.057649771140931505, 0.10844079070780056, 0.09154267446003046, 0.18719952028331083, -0.0066036493795004906, 0.20073701285476495, -0.19151780765429632, 0.08702297949090304, -0.050737695669792346] |
1,802.03034 | Steep Points of Gaussian Free Fields in Any Dimension | This work aims to extend the existing results on the Hausdorff dimension of
the classical thick point sets of a Gaussian free field (GFF) to a more general
class of exceptional sets. We adopt the circle or sphere averaging
regularization to treat a singular GFF in any dimension, and introduce the
notion of "$f-$steep point" of the GFF for certain test function $f$. Roughly
speaking, the $f-$steep points of a generic element of the GFF are locations
where, when weighted by the function $f$, the "steepness", or in other words,
the "rate of change" of the regularized field element becomes unusually large.
Different choices of $f$ lead to the study of various exceptional behaviors of
the GFF. We investigate the Hausdorff dimension of the set consisting of
$f-$steep points, from which we can recover the existing results on thick point
sets for both log-correlated and polynomial-correlated GFFs, and also obtain
new results on exceptional sets that, to our best knowledge, have not been
previously studied. Our method is inspired by the one used to study the thick
point sets of the classical 2D log-correlated GFF.
| math.PR | this work aims to extend the existing results on the hausdorff dimension of the classical thick point sets of a gaussian free field gff to a more general class of exceptional sets we adopt the circle or sphere averaging regularization to treat a singular gff in any dimension and introduce the notion of fsteep point of the gff for certain test function f roughly speaking the fsteep points of a generic element of the gff are locations where when weighted by the function f the steepness or in other words the rate of change of the regularized field element becomes unusually large different choices of f lead to the study of various exceptional behaviors of the gff we investigate the hausdorff dimension of the set consisting of fsteep points from which we can recover the existing results on thick point sets for both logcorrelated and polynomialcorrelated gffs and also obtain new results on exceptional sets that to our best knowledge have not been previously studied our method is inspired by the one used to study the thick point sets of the classical 2d logcorrelated gff | [['this', 'work', 'aims', 'to', 'extend', 'the', 'existing', 'results', 'on', 'the', 'hausdorff', 'dimension', 'of', 'the', 'classical', 'thick', 'point', 'sets', 'of', 'a', 'gaussian', 'free', 'field', 'gff', 'to', 'a', 'more', 'general', 'class', 'of', 'exceptional', 'sets', 'we', 'adopt', 'the', 'circle', 'or', 'sphere', 'averaging', 'regularization', 'to', 'treat', 'a', 'singular', 'gff', 'in', 'any', 'dimension', 'and', 'introduce', 'the', 'notion', 'of', 'fsteep', 'point', 'of', 'the', 'gff', 'for', 'certain', 'test', 'function', 'f', 'roughly', 'speaking', 'the', 'fsteep', 'points', 'of', 'a', 'generic', 'element', 'of', 'the', 'gff', 'are', 'locations', 'where', 'when', 'weighted', 'by', 'the', 'function', 'f', 'the', 'steepness', 'or', 'in', 'other', 'words', 'the', 'rate', 'of', 'change', 'of', 'the', 'regularized', 'field', 'element', 'becomes', 'unusually', 'large', 'different', 'choices', 'of', 'f', 'lead', 'to', 'the', 'study', 'of', 'various', 'exceptional', 'behaviors', 'of', 'the', 'gff', 'we', 'investigate', 'the', 'hausdorff', 'dimension', 'of', 'the', 'set', 'consisting', 'of', 'fsteep', 'points', 'from', 'which', 'we', 'can', 'recover', 'the', 'existing', 'results', 'on', 'thick', 'point', 'sets', 'for', 'both', 'logcorrelated', 'and', 'polynomialcorrelated', 'gffs', 'and', 'also', 'obtain', 'new', 'results', 'on', 'exceptional', 'sets', 'that', 'to', 'our', 'best', 'knowledge', 'have', 'not', 'been', 'previously', 'studied', 'our', 'method', 'is', 'inspired', 'by', 'the', 'one', 'used', 'to', 'study', 'the', 'thick', 'point', 'sets', 'of', 'the', 'classical', '2d', 'logcorrelated', 'gff']] | [-0.10388416325883515, 0.06511545899253257, -0.07730601326329634, 0.06327643433241578, -0.05335758672521004, -0.10445476650341373, 0.05833116590814746, 0.331459617874909, -0.27378590507483436, -0.2371090218252705, 0.08732498084756789, -0.2691016482270282, -0.125670894365454, 0.20459511682534154, -0.0868390339550704, 0.048721021081766354, 0.01789580460298685, 0.0781775028090519, -0.0729530881124684, -0.2620555543196489, 0.411175819949004, -0.010462881828931606, 0.27547266904224194, 0.01837230721772041, 0.08504492523017056, 0.008481114945860336, -0.022370352058003293, 0.03754886255963989, -0.14527484617575165, 0.15047787178975894, 0.20565491776063066, 0.08834522025173773, 0.2665553316170269, -0.3664528790092015, -0.23918776459860333, 0.1533095144474393, 0.10859015619296217, 0.05584333312214332, 0.02671858728148357, -0.2558459937420633, 0.11519351515048386, -0.09261269659138001, -0.18852633867620328, -0.04423799903420529, -0.009974181836815145, 0.03177811590823061, -0.2872994403068847, 0.022516595342534383, 0.08312399470267574, 0.08117219874048201, -0.04879439224327064, -0.12984558683503722, 0.007900022863633121, 0.11544249083042656, 0.04354411464705861, 0.06471279034714984, 0.12448214317429, -0.0941284685712004, -0.10603293716279871, 0.36190980069880857, -0.07113642824317692, -0.22655283460145534, 0.22181206367626463, -0.1885222535676566, -0.10760583726780328, 0.11842022148598715, 0.15047359247388237, 0.1473612581713773, -0.1024104830516792, 0.1438591392817097, -0.09297341632191092, 0.119607915110385, 0.09111718006138488, 0.012304257255100705, 0.1567700137700582, 0.11612926764206824, 0.09382009608595146, 0.16026085359961775, -0.09388838439000487, -0.09269090298229181, -0.3161158687713475, -0.13038940652546918, -0.19070792458850241, 0.07847658180988852, -0.1333718413975673, -0.25760410073638446, 0.3932061415246647, 0.1736180724382512, 0.2223172499747623, 0.07440036420935624, 0.24055168005440425, 0.09821546046924082, 0.06349946748662699, 0.06436417296366848, 0.1733912124713559, 0.09959365511768618, 0.016780182003023347, -0.13240213670550197, -0.005326510264042198, 0.11767178391607519] |
1,802.03035 | On the Lex-plus-powers Conjecture | Let $S$ be a polynomial ring over a field and $I\subseteq S$ a homogeneous
ideal containing a regular sequence of forms of degrees $d_1, \ldots, d_c$. In
this paper we prove the Lex-plus-powers Conjecture when the field has
characteristic 0 for all regular sequences such that $d_i \geq \sum_{j=1}^{i-1}
(d_j-1)+1$ for each $i$; that is, we show that the Betti table of $I$ is
bounded above by the Betti table of the lex-plus-powers ideal of $I$. As an
application, when the characteristic is 0, we obtain bounds for the Betti
numbers of any homogeneous ideal containing a regular sequence of known
degrees, which are sharper than the previously known ones from the
Bigatti-Hulett-Pardue Theorem.
| math.AC | let s be a polynomial ring over a field and isubseteq s a homogeneous ideal containing a regular sequence of forms of degrees d_1 ldots d_c in this paper we prove the lexpluspowers conjecture when the field has characteristic 0 for all regular sequences such that d_i geq sum_j1i1 d_j11 for each i that is we show that the betti table of i is bounded above by the betti table of the lexpluspowers ideal of i as an application when the characteristic is 0 we obtain bounds for the betti numbers of any homogeneous ideal containing a regular sequence of known degrees which are sharper than the previously known ones from the bigattihulettpardue theorem | [['let', 's', 'be', 'a', 'polynomial', 'ring', 'over', 'a', 'field', 'and', 'isubseteq', 's', 'a', 'homogeneous', 'ideal', 'containing', 'a', 'regular', 'sequence', 'of', 'forms', 'of', 'degrees', 'd_1', 'ldots', 'd_c', 'in', 'this', 'paper', 'we', 'prove', 'the', 'lexpluspowers', 'conjecture', 'when', 'the', 'field', 'has', 'characteristic', '0', 'for', 'all', 'regular', 'sequences', 'such', 'that', 'd_i', 'geq', 'sum_j1i1', 'd_j11', 'for', 'each', 'i', 'that', 'is', 'we', 'show', 'that', 'the', 'betti', 'table', 'of', 'i', 'is', 'bounded', 'above', 'by', 'the', 'betti', 'table', 'of', 'the', 'lexpluspowers', 'ideal', 'of', 'i', 'as', 'an', 'application', 'when', 'the', 'characteristic', 'is', '0', 'we', 'obtain', 'bounds', 'for', 'the', 'betti', 'numbers', 'of', 'any', 'homogeneous', 'ideal', 'containing', 'a', 'regular', 'sequence', 'of', 'known', 'degrees', 'which', 'are', 'sharper', 'than', 'the', 'previously', 'known', 'ones', 'from', 'the', 'bigattihulettpardue', 'theorem']] | [-0.1902043141141933, 0.14274179958439553, -0.035786284250207245, 0.01230882243544329, -0.0319267890881747, -0.15980652297314787, -0.02456672154221451, 0.29912884679755997, -0.32205619391918716, -0.19642563340104452, 0.11221583014516259, -0.2763057956118636, -0.10789414934281792, 0.20112295600951516, -0.048551929919215454, -0.06665574160745434, 0.01989947977043422, 0.15625391456913867, -0.04125266764354559, -0.2820241018863661, 0.35892331899542895, -0.07411309875481363, 0.15569039647899835, 0.010445330662020882, 0.08702781334951785, -0.02650432113607946, 0.044551184305289225, 0.03847069170816602, -0.2237584835456151, 0.09006619725343105, 0.24195337305510684, 0.1376311392876752, 0.21796703046753205, -0.3439997108154265, -0.11463908263457208, 0.20529002766332788, 0.1591658414025525, 0.049078781169165656, 0.00755555866843289, -0.200329533362362, 0.20168328187927337, -0.135988903416936, -0.20012479915333511, -0.033367713526656316, 0.1271532416816886, 0.08128572196333803, -0.3333188788133806, 0.027287405183804885, 0.1573030362820386, 0.13493509287114389, -0.029831071126474335, -0.18345861167680205, -0.02362041377013416, 0.08313698345539576, -0.04429051081076198, 0.055186393803783824, 0.0153706321226699, -0.12296972560787774, -0.09817677612383184, 0.35117356119943516, -0.0695709179590267, -0.18543173171513314, 0.10394195720852752, -0.18317754903858127, -0.10492468761679317, 0.13074522071318434, 0.043741019342892935, 0.1897148899484559, -0.016009868886872676, 0.15991022016169154, -0.16362566864284286, 0.14177058502433024, 0.11777312327259486, 0.027294432973056764, 0.1584827773102526, 0.09118657987814263, 0.08847145729175411, 0.14338520008667338, -0.053191906377573366, 0.0015245530999631488, -0.3602075684383245, -0.2211988536541217, -0.22749236197913497, 0.16945857999546984, -0.1228998929248389, -0.1616878606208567, 0.38198620792744414, 0.08387348818775665, 0.19710989838599094, 0.11654790492632726, 0.2579333906926747, 0.06972452485206304, 0.016000616269593593, 0.11332038776267186, 0.09050509692834956, 0.13889415132039826, 0.0029092539542554213, -0.10060858018238962, 0.04263049359516507, 0.12373656427410294] |
1,802.03036 | A new jet-stirred reactor for chemical kinetics investigations | A novel jet-stirred reactor was designed to study combustion processes at low
Damk\"ohler number (Da, ratio of residence time to chemical time), i.e.
chemical kinetics. In this new design, multiple impinging turbulent jets are
used to stir the mixture. The goal of this work is to identify an optimal
configuration of multiple pairs of impinging jets and outlet ports for as a
Jet-Stirred Reactor (JSR) for chemical kinetics experiments. With this
motivation, ANSYS-FLUENT computations using the RANS - Reynolds Stress Model
were used to simulate mixing and reaction in such geometries and their
performance was compared to classical JSR (4 Jets In Plus (+) Pattern (4JIPP)
introduced by Matras & Villermaux 1973; Dagaut et al. 1986; etc.). Results
showed that a configuration of 8 jets, each surrounded by a concentric annular
outlet (CIAO), at the corners of an imaginary cube circumscribed by a spherical
chamber provided far more uniform composition and temperature and thereby more
nearly match the idealizations assumed in well-stirred reactor theory, even at
values of Da higher than those accessible to other JSR experiments. Moreover,
the CIAO design yielded inferred reaction rate constants that were much to the
actual values than the classical JSR design.
| physics.flu-dyn | a novel jetstirred reactor was designed to study combustion processes at low damkohler number da ratio of residence time to chemical time ie chemical kinetics in this new design multiple impinging turbulent jets are used to stir the mixture the goal of this work is to identify an optimal configuration of multiple pairs of impinging jets and outlet ports for as a jetstirred reactor jsr for chemical kinetics experiments with this motivation ansysfluent computations using the rans reynolds stress model were used to simulate mixing and reaction in such geometries and their performance was compared to classical jsr 4 jets in plus pattern 4jipp introduced by matras villermaux 1973 dagaut et al 1986 etc results showed that a configuration of 8 jets each surrounded by a concentric annular outlet ciao at the corners of an imaginary cube circumscribed by a spherical chamber provided far more uniform composition and temperature and thereby more nearly match the idealizations assumed in wellstirred reactor theory even at values of da higher than those accessible to other jsr experiments moreover the ciao design yielded inferred reaction rate constants that were much to the actual values than the classical jsr design | [['a', 'novel', 'jetstirred', 'reactor', 'was', 'designed', 'to', 'study', 'combustion', 'processes', 'at', 'low', 'damkohler', 'number', 'da', 'ratio', 'of', 'residence', 'time', 'to', 'chemical', 'time', 'ie', 'chemical', 'kinetics', 'in', 'this', 'new', 'design', 'multiple', 'impinging', 'turbulent', 'jets', 'are', 'used', 'to', 'stir', 'the', 'mixture', 'the', 'goal', 'of', 'this', 'work', 'is', 'to', 'identify', 'an', 'optimal', 'configuration', 'of', 'multiple', 'pairs', 'of', 'impinging', 'jets', 'and', 'outlet', 'ports', 'for', 'as', 'a', 'jetstirred', 'reactor', 'jsr', 'for', 'chemical', 'kinetics', 'experiments', 'with', 'this', 'motivation', 'ansysfluent', 'computations', 'using', 'the', 'rans', 'reynolds', 'stress', 'model', 'were', 'used', 'to', 'simulate', 'mixing', 'and', 'reaction', 'in', 'such', 'geometries', 'and', 'their', 'performance', 'was', 'compared', 'to', 'classical', 'jsr', '4', 'jets', 'in', 'plus', 'pattern', '4jipp', 'introduced', 'by', 'matras', 'villermaux', '1973', 'dagaut', 'et', 'al', '1986', 'etc', 'results', 'showed', 'that', 'a', 'configuration', 'of', '8', 'jets', 'each', 'surrounded', 'by', 'a', 'concentric', 'annular', 'outlet', 'ciao', 'at', 'the', 'corners', 'of', 'an', 'imaginary', 'cube', 'circumscribed', 'by', 'a', 'spherical', 'chamber', 'provided', 'far', 'more', 'uniform', 'composition', 'and', 'temperature', 'and', 'thereby', 'more', 'nearly', 'match', 'the', 'idealizations', 'assumed', 'in', 'wellstirred', 'reactor', 'theory', 'even', 'at', 'values', 'of', 'da', 'higher', 'than', 'those', 'accessible', 'to', 'other', 'jsr', 'experiments', 'moreover', 'the', 'ciao', 'design', 'yielded', 'inferred', 'reaction', 'rate', 'constants', 'that', 'were', 'much', 'to', 'the', 'actual', 'values', 'than', 'the', 'classical', 'jsr', 'design']] | [-0.065022104206544, 0.15125941424400816, -0.0615129007167477, 0.01574172126741982, -0.04783170338058354, -0.1261843579943831, 0.03129754649217878, 0.34741203544759436, -0.22380336911515578, -0.3398804028432718, 0.059368049097247425, -0.26223257080112633, -0.06237456183880567, 0.21874785947637926, -0.041259010521906406, 0.08258195178549566, 0.04296278578817452, -0.025164828073282384, -0.03175626314416724, -0.21701056731766777, 0.2540366334816147, 0.14259968201482767, 0.2713332526771793, 0.026942893012279742, 0.08448842722849038, -0.06711596247715582, -0.03523433870930029, 0.003954270364422547, -0.1453806821934689, 0.05744777058104151, 0.24746842948646333, 0.07480269721341565, 0.20144249104349385, -0.44608333484318696, -0.21866068725817298, 0.06881243598342592, 0.10392125165518863, 0.0654791994682072, -0.04202076308750915, -0.21482554996190104, 0.10094478282783377, -0.17030586505700884, -0.14223458012320886, -0.010406490930012967, 0.023388506387556462, 0.014338724056908272, -0.30143830903413654, 0.04826127404200011, 0.026212081469987568, 0.09418780592172162, -0.057187355363643486, -0.1855426293554238, -0.016438883741533284, 0.10916978568819008, 0.01925288645277186, 0.03008407564423243, 0.17579306882291443, -0.09594647402654549, -0.09559774507621402, 0.37245079359333766, -0.0309086173290301, -0.18047296170537408, 0.23374157119174732, -0.1428296455378203, -0.07858602902852, 0.17941328707200133, 0.18268214234052912, 0.1224362227305966, -0.14313935347416096, -0.012539337845182193, -0.040176756540007005, 0.15246832561679186, 0.16923419539203965, -0.07679602023900339, 0.15879768038683229, 0.180412297617448, 0.03874056915979293, 0.12223174326078917, -0.10657466913352867, -0.09189403074775136, -0.24543597666902076, -0.13558742874056884, -0.1459764561805825, 0.03889723436196187, -0.0664523181967333, -0.12589659769284098, 0.32795721983757653, 0.0788287336429532, 0.21276343144280346, 0.01964038429156828, 0.29982721797362166, 0.021736804507465995, 0.06449824734958574, 0.1010243029333651, 0.2358717848546803, 0.15553996385638846, 0.17016552777005065, -0.19978448880199146, 0.07782216249045297, 0.05579024905976104] |
1,802.03037 | Dilations of partial representations of Hopf algebras | We introduce the notion of a dilation for a partial representation (i.e. a
partial module) of a Hopf algebra, which in case the partial representation
origins from a partial action (i.e.a partial module algebra) coincides with the
enveloping action (or globalization). This construction leads to categorical
equivalences between the category of partial $H$-modules, a category of
(global) $H$-modules endowed with a projection satisfying a suitable
commutation relation and the category of modules over a (global) smash product
constructed upon $H$, from which we deduce the structure of a Hopfish algebra
on this smash product. These equivalences are used to study the interactions
between partial and global representation theory.
| math.RT math.RA | we introduce the notion of a dilation for a partial representation ie a partial module of a hopf algebra which in case the partial representation origins from a partial action iea partial module algebra coincides with the enveloping action or globalization this construction leads to categorical equivalences between the category of partial hmodules a category of global hmodules endowed with a projection satisfying a suitable commutation relation and the category of modules over a global smash product constructed upon h from which we deduce the structure of a hopfish algebra on this smash product these equivalences are used to study the interactions between partial and global representation theory | [['we', 'introduce', 'the', 'notion', 'of', 'a', 'dilation', 'for', 'a', 'partial', 'representation', 'ie', 'a', 'partial', 'module', 'of', 'a', 'hopf', 'algebra', 'which', 'in', 'case', 'the', 'partial', 'representation', 'origins', 'from', 'a', 'partial', 'action', 'iea', 'partial', 'module', 'algebra', 'coincides', 'with', 'the', 'enveloping', 'action', 'or', 'globalization', 'this', 'construction', 'leads', 'to', 'categorical', 'equivalences', 'between', 'the', 'category', 'of', 'partial', 'hmodules', 'a', 'category', 'of', 'global', 'hmodules', 'endowed', 'with', 'a', 'projection', 'satisfying', 'a', 'suitable', 'commutation', 'relation', 'and', 'the', 'category', 'of', 'modules', 'over', 'a', 'global', 'smash', 'product', 'constructed', 'upon', 'h', 'from', 'which', 'we', 'deduce', 'the', 'structure', 'of', 'a', 'hopfish', 'algebra', 'on', 'this', 'smash', 'product', 'these', 'equivalences', 'are', 'used', 'to', 'study', 'the', 'interactions', 'between', 'partial', 'and', 'global', 'representation', 'theory']] | [-0.15202163299545646, 0.01306164192436176, -0.07831063916499804, 0.05979123242225533, -0.12951938012423359, -0.0762095308436133, -0.006157845498071374, 0.3305162922000495, -0.4358455737199739, -0.17951931950644912, 0.1423844545154841, -0.21454754931932188, -0.15749488909572154, 0.12866292981578856, -0.13258085227419109, -0.07166254823422495, 0.10868649028903135, 0.1554257236464628, -0.15621636995923854, -0.1647636540556135, 0.47547660479496157, -0.002029440548514651, 0.25476579743254685, -0.005389407029044684, 0.20986435251641217, 0.024490584290769196, -0.053322503343224525, 0.017749030349741332, -0.1341088682981034, 0.1595759232154238, 0.26436005160212517, 0.11126904239634348, 0.2196427710217241, -0.3716925029581952, -0.08071232109877856, 0.12373221313110858, 0.0664030542710326, 0.03403739584609866, -0.01775338824769856, -0.3388269374943469, 0.06426264717739737, -0.30737003046044403, -0.04328778774529765, -0.05917451288289974, 0.05304704704017282, -0.04604103139636464, -0.3140619981530227, -0.0013181567300877004, 0.07465098902939984, 0.12111490129745592, -0.13106735302657585, -0.021286499529868087, -0.08419833410418132, 0.09701315658906841, -0.06650515683169399, 0.03040762327472183, 0.10080655109763981, -0.13578453190433226, -0.13960961769465532, 0.36277128033618505, -0.06773036067313123, -0.24585499802482463, 0.16866429669839095, -0.15743740296391684, -0.1543390806111568, 0.09952054120530592, 0.05789069092406012, 0.08751740115128945, -0.04589625806863219, 0.16767327536102036, -0.14550459625147213, 0.07389928203807256, 0.08041228226464346, 0.037921259876027284, 0.14105109854766698, 0.12177817951496168, 0.08512297448501965, 0.12951445159563255, 0.050279495467880096, -0.06982097960138153, -0.3664124647381707, -0.20886427894583903, 0.011224560913951876, 0.1327917570265654, -0.08250278102888978, -0.1821959569319108, 0.417284254283888, 0.09467181001102255, 0.2308769051608995, 0.12252002781056842, 0.20884503514688707, 0.07134687474049697, 0.12036538060328045, -0.013455714429859246, 0.1028269053236625, 0.2794141105297848, 0.02012578150688314, -0.12523782403462905, 0.007084561313859352, 0.26181932868627467] |
1,802.03038 | X States of the Same Spectrum and Entanglement as All Two-Qubit States | We present an explicit family of two-qubit X states with
entanglement-preserving unitary (EPU) equivalence to the set of general states;
that is, for any spectrum-entanglement combination achievable by general
states, this family contains an X state of the same spectrum and entanglement.
This idea was originally conjectured by the author and supported with strong
numerical evidence in arXiv:1310.7038. Then, in Ann. Phys. 351 (2014) 79, the
authors proved the existence of such two-qubit unitary transformations, but
found the parameters to be transcendental, eluding explicit solution. Here, by
a different method, we prove the existence of such transformations, obtain a
compact implicit solution for them, and provide an exact, explicit form of the
desired X-state family.
| quant-ph | we present an explicit family of twoqubit x states with entanglementpreserving unitary epu equivalence to the set of general states that is for any spectrumentanglement combination achievable by general states this family contains an x state of the same spectrum and entanglement this idea was originally conjectured by the author and supported with strong numerical evidence in arxiv13107038 then in ann phys 351 2014 79 the authors proved the existence of such twoqubit unitary transformations but found the parameters to be transcendental eluding explicit solution here by a different method we prove the existence of such transformations obtain a compact implicit solution for them and provide an exact explicit form of the desired xstate family | [['we', 'present', 'an', 'explicit', 'family', 'of', 'twoqubit', 'x', 'states', 'with', 'entanglementpreserving', 'unitary', 'epu', 'equivalence', 'to', 'the', 'set', 'of', 'general', 'states', 'that', 'is', 'for', 'any', 'spectrumentanglement', 'combination', 'achievable', 'by', 'general', 'states', 'this', 'family', 'contains', 'an', 'x', 'state', 'of', 'the', 'same', 'spectrum', 'and', 'entanglement', 'this', 'idea', 'was', 'originally', 'conjectured', 'by', 'the', 'author', 'and', 'supported', 'with', 'strong', 'numerical', 'evidence', 'in', 'arxiv13107038', 'then', 'in', 'ann', 'phys', '351', '2014', '79', 'the', 'authors', 'proved', 'the', 'existence', 'of', 'such', 'twoqubit', 'unitary', 'transformations', 'but', 'found', 'the', 'parameters', 'to', 'be', 'transcendental', 'eluding', 'explicit', 'solution', 'here', 'by', 'a', 'different', 'method', 'we', 'prove', 'the', 'existence', 'of', 'such', 'transformations', 'obtain', 'a', 'compact', 'implicit', 'solution', 'for', 'them', 'and', 'provide', 'an', 'exact', 'explicit', 'form', 'of', 'the', 'desired', 'xstate', 'family']] | [-0.1284591393055702, 0.07788274458068502, -0.0700784780700425, 0.027239151194018114, -0.0353467319426792, -0.13243271911882662, 0.06912018524807147, 0.33562903357752866, -0.2211625389879503, -0.2934879755983794, 0.0643959602769298, -0.24097494295814872, -0.14889286154149367, 0.1793301969163232, -0.05003747188935189, 0.0834693920540823, 0.036464263903326355, 0.033970885758597955, -0.0985199436732468, -0.274327774322176, 0.3348201865197292, 0.005784655858795824, 0.2535399180362999, 0.0252089771030504, 0.13109177425836346, -0.008095445276272326, 0.014368329999602534, -0.04833212279481813, -0.16192006547843057, 0.10772159390918594, 0.26906520721968263, 0.1308215868422329, 0.21295920595262682, -0.38099132908973843, -0.175043130085604, 0.1233424145778242, 0.08037230250192806, 0.1467597521009988, -0.0702934476505886, -0.35130606195889413, 0.0703502438929198, -0.19539233347833423, -0.18613111208833288, -0.1407621983713138, 0.09041429727429724, -0.009433522724845846, -0.30341412203519474, 0.0660330836378437, 0.10564853308148615, 0.07470818114234135, -0.05314651857536644, -0.06731646508602093, -0.003252039944137713, 0.08231123996769643, -0.021138436595460268, 0.040903050441037134, 0.01986560895290625, -0.048140885276942366, -0.12118533212092839, 0.28566366778821767, -0.04840623915827434, -0.20167803755196342, 0.1817727352858388, -0.08783924444495435, -0.14914794778451324, 0.10843269755423535, 0.0942813862098514, 0.14838998587635746, -0.14423534711906022, 0.1286470295043338, -0.11818627545809639, 0.16555068009932125, 0.08826281023877007, 0.04003452694347028, 0.12030271425776716, 0.046078318156235455, 0.08477532169282702, 0.16694145200952853, 0.015525595108036734, -0.07175237558216654, -0.35132764406236155, -0.20783830827122074, -0.19839597009039217, 0.12512999938709463, -0.05374339382316456, -0.13261676795913704, 0.40506481795247445, 0.06971367719649736, 0.17759585470360303, 0.06071815960292172, 0.17995818904767344, 0.14134186354424724, -0.007781943954926517, 0.14502753725641274, 0.23490898256672413, 0.13918872220217185, -0.003789013409654477, -0.17823657005127252, 0.04807093529962003, 0.12044444002510447] |
1,802.03039 | Few-shot learning of neural networks from scratch by pseudo example
optimization | In this paper, we propose a simple but effective method for training neural
networks with a limited amount of training data. Our approach inherits the idea
of knowledge distillation that transfers knowledge from a deep or wide
reference model to a shallow or narrow target model. The proposed method
employs this idea to mimic predictions of reference estimators that are more
robust against overfitting than the network we want to train. Different from
almost all the previous work for knowledge distillation that requires a large
amount of labeled training data, the proposed method requires only a small
amount of training data. Instead, we introduce pseudo training examples that
are optimized as a part of model parameters. Experimental results for several
benchmark datasets demonstrate that the proposed method outperformed all the
other baselines, such as naive training of the target model and standard
knowledge distillation.
| stat.ML cs.LG cs.NE | in this paper we propose a simple but effective method for training neural networks with a limited amount of training data our approach inherits the idea of knowledge distillation that transfers knowledge from a deep or wide reference model to a shallow or narrow target model the proposed method employs this idea to mimic predictions of reference estimators that are more robust against overfitting than the network we want to train different from almost all the previous work for knowledge distillation that requires a large amount of labeled training data the proposed method requires only a small amount of training data instead we introduce pseudo training examples that are optimized as a part of model parameters experimental results for several benchmark datasets demonstrate that the proposed method outperformed all the other baselines such as naive training of the target model and standard knowledge distillation | [['in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'but', 'effective', 'method', 'for', 'training', 'neural', 'networks', 'with', 'a', 'limited', 'amount', 'of', 'training', 'data', 'our', 'approach', 'inherits', 'the', 'idea', 'of', 'knowledge', 'distillation', 'that', 'transfers', 'knowledge', 'from', 'a', 'deep', 'or', 'wide', 'reference', 'model', 'to', 'a', 'shallow', 'or', 'narrow', 'target', 'model', 'the', 'proposed', 'method', 'employs', 'this', 'idea', 'to', 'mimic', 'predictions', 'of', 'reference', 'estimators', 'that', 'are', 'more', 'robust', 'against', 'overfitting', 'than', 'the', 'network', 'we', 'want', 'to', 'train', 'different', 'from', 'almost', 'all', 'the', 'previous', 'work', 'for', 'knowledge', 'distillation', 'that', 'requires', 'a', 'large', 'amount', 'of', 'labeled', 'training', 'data', 'the', 'proposed', 'method', 'requires', 'only', 'a', 'small', 'amount', 'of', 'training', 'data', 'instead', 'we', 'introduce', 'pseudo', 'training', 'examples', 'that', 'are', 'optimized', 'as', 'a', 'part', 'of', 'model', 'parameters', 'experimental', 'results', 'for', 'several', 'benchmark', 'datasets', 'demonstrate', 'that', 'the', 'proposed', 'method', 'outperformed', 'all', 'the', 'other', 'baselines', 'such', 'as', 'naive', 'training', 'of', 'the', 'target', 'model', 'and', 'standard', 'knowledge', 'distillation']] | [-0.005395793935652667, 0.02631611760201243, -0.04741394556185696, 0.07008766014445832, -0.11589358520965713, -0.17951433313040374, 0.08763364945237602, 0.4248918916305734, -0.23688988563177796, -0.380939236531655, 0.053742787841959704, -0.25922356132004, -0.1614031698813455, 0.20213504408214553, -0.1119193781406567, 0.0939656784499271, 0.18910667811804968, 0.03464294763074981, -0.07179158648715303, -0.28714180785431787, 0.3311358762778885, 0.0384063847803999, 0.3591916670589449, -0.009070980656866191, 0.14642556022590725, -0.061254596500980876, -0.028737950715973664, -0.018131226489559695, -0.03257308714218096, 0.17358662794302088, 0.26347699676666203, 0.22369040759642506, 0.3373845602230479, -0.39887406151683535, -0.2628691146569003, 0.12646714310135898, 0.10542117752710409, 0.19759753021703041, -0.05436195884461389, -0.283326190792852, 0.09223203019549449, -0.20710841863830057, -0.03436781883970576, -0.18092280801566732, -0.057964114148894116, -0.022913563915709447, -0.3375064559060977, 0.03364950940623304, 0.10591754206042323, 0.0414898678750938, -0.05087799570982396, -0.13906547202431183, 0.009427325976301089, 0.12368032438098453, 0.03174810393102234, 0.04033360472062163, 0.10194202906697886, -0.1394564417524609, -0.09908247332593116, 0.3364196470421221, -0.09245916651111151, -0.21384393663740614, 0.18628175691830823, -0.022791763418354094, -0.1149464049958624, 0.11184682791483486, 0.221237161264273, 0.14283867153183868, -0.16127304666184095, -0.003433308473985461, -0.07218086785481621, 0.20294429769597222, 0.0017587990021436578, -0.010115458335753323, 0.1152686578894241, 0.2698310527743565, 0.021248720350235492, 0.15137450502152205, -0.15172077569554354, -0.09508865076350048, -0.29626690668131533, -0.07859178963634703, -0.2588638351331206, -0.012193913183485469, -0.07939069951266396, -0.14779431458575548, 0.3885755930912435, 0.2594962894961807, 0.23600355887578595, 0.13660464942869213, 0.38391550319890183, -0.0453401656810052, 0.16954617012136927, 0.10067174365718125, 0.2019160769543507, -0.0026534629675249257, 0.10174382809782401, -0.13858980039044078, 0.09889249494881369, 0.007594326320233651] |
1,802.0304 | Extended Effective Field Theory of Inflation | We present a general framework where the effective field theory of single
field inflation is extended by the inclusion of operators with mass dimension 3
and 4 in the unitary gauge. These higher dimensional operators introduce
quartic and sextic corrections to the dispersion relation. We study the regime
of validity of this extended effective field theory of inflation and the effect
of these higher dimensional operators on CMB observables associated with scalar
perturbations, such as the speed of sound, the amplitude of the power spectrum
and the tensor-to-scalar ratio. Tensor perturbations remain instead, unaltered.
| hep-th astro-ph.CO gr-qc | we present a general framework where the effective field theory of single field inflation is extended by the inclusion of operators with mass dimension 3 and 4 in the unitary gauge these higher dimensional operators introduce quartic and sextic corrections to the dispersion relation we study the regime of validity of this extended effective field theory of inflation and the effect of these higher dimensional operators on cmb observables associated with scalar perturbations such as the speed of sound the amplitude of the power spectrum and the tensortoscalar ratio tensor perturbations remain instead unaltered | [['we', 'present', 'a', 'general', 'framework', 'where', 'the', 'effective', 'field', 'theory', 'of', 'single', 'field', 'inflation', 'is', 'extended', 'by', 'the', 'inclusion', 'of', 'operators', 'with', 'mass', 'dimension', '3', 'and', '4', 'in', 'the', 'unitary', 'gauge', 'these', 'higher', 'dimensional', 'operators', 'introduce', 'quartic', 'and', 'sextic', 'corrections', 'to', 'the', 'dispersion', 'relation', 'we', 'study', 'the', 'regime', 'of', 'validity', 'of', 'this', 'extended', 'effective', 'field', 'theory', 'of', 'inflation', 'and', 'the', 'effect', 'of', 'these', 'higher', 'dimensional', 'operators', 'on', 'cmb', 'observables', 'associated', 'with', 'scalar', 'perturbations', 'such', 'as', 'the', 'speed', 'of', 'sound', 'the', 'amplitude', 'of', 'the', 'power', 'spectrum', 'and', 'the', 'tensortoscalar', 'ratio', 'tensor', 'perturbations', 'remain', 'instead', 'unaltered']] | [-0.1628042975740329, 0.19366983369864682, -0.03982136010172519, 0.08759812644603564, -0.043979097145332144, -0.1176141022377588, -0.035274794151847984, 0.2761955082000412, -0.22096607186137995, -0.2698743472153202, 0.08841288878775617, -0.24761405912168483, -0.163444983946318, 0.12899218394886702, 0.005263053608978999, 0.04423153214156628, -0.015077031752530565, 0.06883867734924276, -0.07689319565852588, -0.255896398775339, 0.40387385803463055, 0.0904065978891672, 0.2416829894324071, 0.04976911772478451, 0.07711472815061186, 0.012438346374225109, -0.020628605444142793, 0.0467869344147596, -0.10944772875828153, 0.14715513134712077, 0.1691888134559354, 0.07427023050741867, 0.18758566400155108, -0.38830107036343914, -0.2316725683358914, 0.12364480066846342, 0.11209542132874435, 0.12134613230715487, 0.00023676748659976935, -0.26269692578848375, 0.047746712728304434, -0.20545627650349063, -0.17728641091603192, -0.10289772613806293, 0.015560664255122475, -0.06489806614588312, -0.27543033022393887, 0.14855085703868795, 0.03140851741835, 0.06270806818328639, -0.058930824887245256, -0.07336935351300548, -0.029383861385484007, 0.03707073230984958, 0.08457975838818844, 0.024065163528962815, 0.125003390856325, -0.17609210365821554, -0.06987315199481561, 0.38204098238728623, -0.1721645832207906, -0.17800937845629264, 0.12578328621098178, -0.18650628206756045, -0.11005490412935615, 0.0666788109934869, 0.18368277064167915, 0.11695477535373512, -0.07954211233857464, 0.21293598957647114, 0.05021882540685065, 0.16322656711959777, 0.07438864291427617, 0.06064610182062445, 0.23403498520727883, 0.08109268983033427, 0.04609861009892948, 0.10923296156676209, -0.03350554505534014, -0.0666423336741455, -0.3722740429096875, -0.10246097393571696, -0.09762151843367858, 0.06054733277476849, -0.18505586126876222, -0.17897867616464166, 0.4462256702554828, 0.1641412093638482, 0.1942605189762346, 0.09326095304432068, 0.2934656924954516, 0.19024517597070836, 0.08850635057117076, 0.04638284998153277, 0.30096180651812476, 0.2017509847052118, 0.08775479814156573, -0.232895042435167, -0.10404240897797207, 0.08848847098093718] |
1,802.03041 | Detection of Adversarial Training Examples in Poisoning Attacks through
Anomaly Detection | Machine learning has become an important component for many systems and
applications including computer vision, spam filtering, malware and network
intrusion detection, among others. Despite the capabilities of machine learning
algorithms to extract valuable information from data and produce accurate
predictions, it has been shown that these algorithms are vulnerable to attacks.
Data poisoning is one of the most relevant security threats against machine
learning systems, where attackers can subvert the learning process by injecting
malicious samples in the training data. Recent work in adversarial machine
learning has shown that the so-called optimal attack strategies can
successfully poison linear classifiers, degrading the performance of the system
dramatically after compromising a small fraction of the training dataset. In
this paper we propose a defence mechanism to mitigate the effect of these
optimal poisoning attacks based on outlier detection. We show empirically that
the adversarial examples generated by these attack strategies are quite
different from genuine points, as no detectability constrains are considered to
craft the attack. Hence, they can be detected with an appropriate pre-filtering
of the training dataset.
| stat.ML cs.CR cs.LG | machine learning has become an important component for many systems and applications including computer vision spam filtering malware and network intrusion detection among others despite the capabilities of machine learning algorithms to extract valuable information from data and produce accurate predictions it has been shown that these algorithms are vulnerable to attacks data poisoning is one of the most relevant security threats against machine learning systems where attackers can subvert the learning process by injecting malicious samples in the training data recent work in adversarial machine learning has shown that the socalled optimal attack strategies can successfully poison linear classifiers degrading the performance of the system dramatically after compromising a small fraction of the training dataset in this paper we propose a defence mechanism to mitigate the effect of these optimal poisoning attacks based on outlier detection we show empirically that the adversarial examples generated by these attack strategies are quite different from genuine points as no detectability constrains are considered to craft the attack hence they can be detected with an appropriate prefiltering of the training dataset | [['machine', 'learning', 'has', 'become', 'an', 'important', 'component', 'for', 'many', 'systems', 'and', 'applications', 'including', 'computer', 'vision', 'spam', 'filtering', 'malware', 'and', 'network', 'intrusion', 'detection', 'among', 'others', 'despite', 'the', 'capabilities', 'of', 'machine', 'learning', 'algorithms', 'to', 'extract', 'valuable', 'information', 'from', 'data', 'and', 'produce', 'accurate', 'predictions', 'it', 'has', 'been', 'shown', 'that', 'these', 'algorithms', 'are', 'vulnerable', 'to', 'attacks', 'data', 'poisoning', 'is', 'one', 'of', 'the', 'most', 'relevant', 'security', 'threats', 'against', 'machine', 'learning', 'systems', 'where', 'attackers', 'can', 'subvert', 'the', 'learning', 'process', 'by', 'injecting', 'malicious', 'samples', 'in', 'the', 'training', 'data', 'recent', 'work', 'in', 'adversarial', 'machine', 'learning', 'has', 'shown', 'that', 'the', 'socalled', 'optimal', 'attack', 'strategies', 'can', 'successfully', 'poison', 'linear', 'classifiers', 'degrading', 'the', 'performance', 'of', 'the', 'system', 'dramatically', 'after', 'compromising', 'a', 'small', 'fraction', 'of', 'the', 'training', 'dataset', 'in', 'this', 'paper', 'we', 'propose', 'a', 'defence', 'mechanism', 'to', 'mitigate', 'the', 'effect', 'of', 'these', 'optimal', 'poisoning', 'attacks', 'based', 'on', 'outlier', 'detection', 'we', 'show', 'empirically', 'that', 'the', 'adversarial', 'examples', 'generated', 'by', 'these', 'attack', 'strategies', 'are', 'quite', 'different', 'from', 'genuine', 'points', 'as', 'no', 'detectability', 'constrains', 'are', 'considered', 'to', 'craft', 'the', 'attack', 'hence', 'they', 'can', 'be', 'detected', 'with', 'an', 'appropriate', 'prefiltering', 'of', 'the', 'training', 'dataset']] | [-0.08939582133388377, 0.02638245999075347, -0.07934788624452574, 0.09336185396367593, -0.10044467510665987, -0.243822710995374, 0.06151409641109679, 0.3839111575762626, -0.2638967972584958, -0.3478784354591972, 0.12984022205719054, -0.324657207066481, -0.19966863212437275, 0.23921796472303652, -0.1769250068274651, 0.13633204297897708, 0.09099862034422125, 0.04184659413098661, 0.0008205735141652103, -0.35018876156301415, 0.3384742766587336, 0.06530498602987382, 0.3509220823833949, 0.02314489416966445, 0.07365656314153496, -0.03110877549134488, -0.020875397358047828, -0.017211640330510255, -0.030361314476139024, 0.10314853298425507, 0.38114236387309064, 0.2605325374163666, 0.3671647905100011, -0.4037808692946067, -0.24435905546075506, 0.15601898408023995, 0.16267850508081486, 0.18307582405657413, -0.08306762515737288, -0.3711447559998193, 0.12937817522167658, -0.21849506913182024, -0.011478831991553307, -0.1716611441774189, -0.00672248402463921, 0.0031238422046279473, -0.24479777671022634, -0.028967398674007546, 0.08344749467750864, 0.0649433614283256, -0.005143370349767874, -0.09309848863304478, -0.006283267084613777, 0.15424003799215713, 0.09770634588952244, -0.02121743499471419, 0.2197789319168274, -0.18146936427357116, -0.17442738860217707, 0.3286142525488113, -0.012959000946210927, -0.15076024866966384, 0.19750368521219183, 0.04433717080418104, -0.1598309378539934, 0.13351339293288045, 0.2808016669462151, 0.09976538725712682, -0.17878716693814384, -0.01323259543082049, 0.012093162784101755, 0.17298820845290935, 0.03301376753141371, 0.01018429322238865, 0.15754186349078553, 0.2250733342586776, 0.06087205138840985, 0.12973132399839526, -0.15158085599724788, -0.040756529117306546, -0.17729200172078471, -0.06048902125760659, -0.19233055647431213, 0.0003371042640241428, -0.051038728137203004, -0.11800580111095484, 0.3555832347947727, 0.27063232030081197, 0.16998478404528808, 0.05081552044806343, 0.390591272142496, 0.010279658958158884, 0.1279256981326623, 0.1374758038790164, 0.24945761968141025, -0.013842104042074485, 0.09631284309245039, -0.1687716323727993, 0.19465344434072984, -0.04125038237739982] |
1,802.03042 | Deep Hedging | We present a framework for hedging a portfolio of derivatives in the presence
of market frictions such as transaction costs, market impact, liquidity
constraints or risk limits using modern deep reinforcement machine learning
methods.
We discuss how standard reinforcement learning methods can be applied to
non-linear reward structures, i.e. in our case convex risk measures. As a
general contribution to the use of deep learning for stochastic processes, we
also show that the set of constrained trading strategies used by our algorithm
is large enough to $\epsilon$-approximate any optimal solution.
Our algorithm can be implemented efficiently even in high-dimensional
situations using modern machine learning tools. Its structure does not depend
on specific market dynamics, and generalizes across hedging instruments
including the use of liquid derivatives. Its computational performance is
largely invariant in the size of the portfolio as it depends mainly on the
number of hedging instruments available.
We illustrate our approach by showing the effect on hedging under transaction
costs in a synthetic market driven by the Heston model, where we outperform the
standard "complete market" solution.
| q-fin.CP math.NA math.OC math.PR q-fin.RM | we present a framework for hedging a portfolio of derivatives in the presence of market frictions such as transaction costs market impact liquidity constraints or risk limits using modern deep reinforcement machine learning methods we discuss how standard reinforcement learning methods can be applied to nonlinear reward structures ie in our case convex risk measures as a general contribution to the use of deep learning for stochastic processes we also show that the set of constrained trading strategies used by our algorithm is large enough to epsilonapproximate any optimal solution our algorithm can be implemented efficiently even in highdimensional situations using modern machine learning tools its structure does not depend on specific market dynamics and generalizes across hedging instruments including the use of liquid derivatives its computational performance is largely invariant in the size of the portfolio as it depends mainly on the number of hedging instruments available we illustrate our approach by showing the effect on hedging under transaction costs in a synthetic market driven by the heston model where we outperform the standard complete market solution | [['we', 'present', 'a', 'framework', 'for', 'hedging', 'a', 'portfolio', 'of', 'derivatives', 'in', 'the', 'presence', 'of', 'market', 'frictions', 'such', 'as', 'transaction', 'costs', 'market', 'impact', 'liquidity', 'constraints', 'or', 'risk', 'limits', 'using', 'modern', 'deep', 'reinforcement', 'machine', 'learning', 'methods', 'we', 'discuss', 'how', 'standard', 'reinforcement', 'learning', 'methods', 'can', 'be', 'applied', 'to', 'nonlinear', 'reward', 'structures', 'ie', 'in', 'our', 'case', 'convex', 'risk', 'measures', 'as', 'a', 'general', 'contribution', 'to', 'the', 'use', 'of', 'deep', 'learning', 'for', 'stochastic', 'processes', 'we', 'also', 'show', 'that', 'the', 'set', 'of', 'constrained', 'trading', 'strategies', 'used', 'by', 'our', 'algorithm', 'is', 'large', 'enough', 'to', 'epsilonapproximate', 'any', 'optimal', 'solution', 'our', 'algorithm', 'can', 'be', 'implemented', 'efficiently', 'even', 'in', 'highdimensional', 'situations', 'using', 'modern', 'machine', 'learning', 'tools', 'its', 'structure', 'does', 'not', 'depend', 'on', 'specific', 'market', 'dynamics', 'and', 'generalizes', 'across', 'hedging', 'instruments', 'including', 'the', 'use', 'of', 'liquid', 'derivatives', 'its', 'computational', 'performance', 'is', 'largely', 'invariant', 'in', 'the', 'size', 'of', 'the', 'portfolio', 'as', 'it', 'depends', 'mainly', 'on', 'the', 'number', 'of', 'hedging', 'instruments', 'available', 'we', 'illustrate', 'our', 'approach', 'by', 'showing', 'the', 'effect', 'on', 'hedging', 'under', 'transaction', 'costs', 'in', 'a', 'synthetic', 'market', 'driven', 'by', 'the', 'heston', 'model', 'where', 'we', 'outperform', 'the', 'standard', 'complete', 'market', 'solution']] | [-0.0466067024383673, 0.0035615797112748195, -0.10747213398493576, 0.12343976389240013, -0.13153135494245322, -0.14219525498808938, 0.09404363918112947, 0.43869925434753465, -0.3193896349723545, -0.27101161630478887, 0.18935656202943954, -0.25967514413157794, -0.18247043709872354, 0.2312974732871471, -0.1756770617918509, 0.07178680269045001, 0.06890953306809822, -0.020873184083029628, 0.017297311387910363, -0.32689962655324173, 0.294038111035937, 0.04681630197191726, 0.29921403145051323, 0.04942399232871988, 0.13180570132615765, 0.004493795047524605, -0.006952099664283268, 0.051682716920930016, -0.10603056079205263, 0.15743153550651637, 0.3201280926390854, 0.17498630479114194, 0.37693538185695624, -0.44368003160180003, -0.17661141755917434, 0.14633257205864897, 0.05356578202901821, 0.07045680605754089, 0.006388634195410008, -0.2636034589501495, -0.012886409273664102, -0.21999044898960196, -0.05175528863151924, -0.16380623409529793, -0.04993094045543269, 0.019915777457233132, -0.3140954487512982, 0.03499292854721307, 0.018273193135418083, 0.03314558837008191, -0.049964382759232616, -0.14499476224150026, 0.016270077427629422, 0.09128599446868586, 0.1020040601626656, -0.03923254347343542, 0.1912041973254612, -0.15306923662481065, -0.21965682137236942, 0.37807504816524934, -0.11475718519755043, -0.2332593479685569, 0.1400352609945524, -0.07959693454446669, -0.14341010064870285, 0.09313591965735796, 0.2520504978359834, 0.11380881179134582, -0.16246638105942846, 0.11746772549480064, -0.013602233395043217, 0.163342600468588, 0.016889835786325542, -0.0133820128050931, 0.1395087016084535, 0.24736145328929166, 0.12699083912283118, 0.13444706259080827, -0.055774375494161435, -0.16736098795899013, -0.259669387059056, -0.10722092843256116, -0.18769668243574292, 0.013410538928194124, -0.15348780187613034, -0.16819884512165373, 0.344395724038876, 0.2042533799266381, 0.08878904781003451, 0.12916155899413784, 0.334082325198426, 0.11051924363750862, 0.038817829376588876, 0.13487297994492764, 0.20187597835091142, -0.012134566069894543, 0.12378897236953124, -0.21768857902857694, 0.17852255441196097, 0.004520196840428653] |
1,802.03043 | PoTrojan: powerful neural-level trojan designs in deep learning models | With the popularity of deep learning (DL), artificial intelligence (AI) has
been applied in many areas of human life. Neural network or artificial neural
network (NN), the main technique behind DL, has been extensively studied to
facilitate computer vision and natural language recognition. However, the more
we rely on information technology, the more vulnerable we are. That is,
malicious NNs could bring huge threat in the so-called coming AI era. In this
paper, for the first time in the literature, we propose a novel approach to
design and insert powerful neural-level trojans or PoTrojan in pre-trained NN
models. Most of the time, PoTrojans remain inactive, not affecting the normal
functions of their host NN models. PoTrojans could only be triggered in very
rare conditions. Once activated, however, the PoTrojans could cause the host NN
models to malfunction, either falsely predicting or classifying, which is a
significant threat to human society of the AI era. We would explain the
principles of PoTrojans and the easiness of designing and inserting them in
pre-trained deep learning models. PoTrojans doesn't modify the existing
architecture or parameters of the pre-trained models, without re-training.
Hence, the proposed method is very efficient.
| cs.CR cs.LG | with the popularity of deep learning dl artificial intelligence ai has been applied in many areas of human life neural network or artificial neural network nn the main technique behind dl has been extensively studied to facilitate computer vision and natural language recognition however the more we rely on information technology the more vulnerable we are that is malicious nns could bring huge threat in the socalled coming ai era in this paper for the first time in the literature we propose a novel approach to design and insert powerful neurallevel trojans or potrojan in pretrained nn models most of the time potrojans remain inactive not affecting the normal functions of their host nn models potrojans could only be triggered in very rare conditions once activated however the potrojans could cause the host nn models to malfunction either falsely predicting or classifying which is a significant threat to human society of the ai era we would explain the principles of potrojans and the easiness of designing and inserting them in pretrained deep learning models potrojans doesnt modify the existing architecture or parameters of the pretrained models without retraining hence the proposed method is very efficient | [['with', 'the', 'popularity', 'of', 'deep', 'learning', 'dl', 'artificial', 'intelligence', 'ai', 'has', 'been', 'applied', 'in', 'many', 'areas', 'of', 'human', 'life', 'neural', 'network', 'or', 'artificial', 'neural', 'network', 'nn', 'the', 'main', 'technique', 'behind', 'dl', 'has', 'been', 'extensively', 'studied', 'to', 'facilitate', 'computer', 'vision', 'and', 'natural', 'language', 'recognition', 'however', 'the', 'more', 'we', 'rely', 'on', 'information', 'technology', 'the', 'more', 'vulnerable', 'we', 'are', 'that', 'is', 'malicious', 'nns', 'could', 'bring', 'huge', 'threat', 'in', 'the', 'socalled', 'coming', 'ai', 'era', 'in', 'this', 'paper', 'for', 'the', 'first', 'time', 'in', 'the', 'literature', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'design', 'and', 'insert', 'powerful', 'neurallevel', 'trojans', 'or', 'potrojan', 'in', 'pretrained', 'nn', 'models', 'most', 'of', 'the', 'time', 'potrojans', 'remain', 'inactive', 'not', 'affecting', 'the', 'normal', 'functions', 'of', 'their', 'host', 'nn', 'models', 'potrojans', 'could', 'only', 'be', 'triggered', 'in', 'very', 'rare', 'conditions', 'once', 'activated', 'however', 'the', 'potrojans', 'could', 'cause', 'the', 'host', 'nn', 'models', 'to', 'malfunction', 'either', 'falsely', 'predicting', 'or', 'classifying', 'which', 'is', 'a', 'significant', 'threat', 'to', 'human', 'society', 'of', 'the', 'ai', 'era', 'we', 'would', 'explain', 'the', 'principles', 'of', 'potrojans', 'and', 'the', 'easiness', 'of', 'designing', 'and', 'inserting', 'them', 'in', 'pretrained', 'deep', 'learning', 'models', 'potrojans', 'doesnt', 'modify', 'the', 'existing', 'architecture', 'or', 'parameters', 'of', 'the', 'pretrained', 'models', 'without', 'retraining', 'hence', 'the', 'proposed', 'method', 'is', 'very', 'efficient']] | [-0.07557565976323118, 0.06217001320088532, -0.07365742263374563, 0.08878245008221261, -0.13490052605599895, -0.22700352467039658, 0.026339444865294992, 0.40201161972717525, -0.2671084952301864, -0.32900077628797475, 0.07636975477264772, -0.26192390833280443, -0.2263165095715409, 0.18646774748754302, -0.13640133452784156, 0.07035797348392397, 0.08806437055505908, 0.056621651261199994, -0.007975030812247628, -0.2866819333513123, 0.28281172812129035, 0.05426095514384233, 0.28497190247337845, 0.03817148849466508, 0.04613725011916255, -0.04499160772016675, -0.00913846530932357, -0.05330541711324615, -0.040586501191504906, 0.16240843720542095, 0.3188463613509926, 0.21562294078601965, 0.35651250412332414, -0.5022414453308454, -0.24151933817288926, 0.17125405633303614, 0.16963279990661775, 0.13748040557154886, -0.04611457787293907, -0.3058836071580389, 0.12047003575399057, -0.20098547142037412, -0.050920935546902496, -0.10108364938119829, 0.022976612183445412, -0.021545968851981897, -0.21281302848665198, -0.017299214553222367, 0.09640918700408536, 0.07173281771937366, -0.04423075990352933, -0.1255396729426401, 0.007900003775877436, 0.17226858887360574, 0.04960847845914313, 0.05015428429025408, 0.16643855077998843, -0.22033940848880015, -0.12473655205229585, 0.3606358114653987, -0.02750785933440244, -0.1513604609266922, 0.22829700092372207, -0.021539123330418904, -0.1704184965917015, 0.06744664308816656, 0.24976336403711477, 0.07237978259908016, -0.1869554344934325, 0.04387359162696551, 0.04019982095798189, 0.17660361800112367, 0.029928019154485622, -0.0034976241937310425, 0.22777254917639664, 0.25477219179762317, -0.006927115157709851, 0.06397012547894679, -0.12109489471320971, -0.0813313874451458, -0.16059228336227307, -0.09553703459306169, -0.18294571176262514, 0.028785462337669068, -0.053004318138658905, -0.13388733931615487, 0.3697442855372708, 0.21309856583181883, 0.1711765660342674, 0.03544552975691874, 0.3190328848941885, 0.0414570643081685, 0.1832577640217124, 0.08330710284104667, 0.2560743653574315, 0.0003706892261031977, 0.15763694365969716, -0.13853530870683337, 0.17356044642348803, 0.012649570910989777] |
1,802.03044 | Manipulating Anomalous Hall Antiferromagnets with Magnetic Fields | The symmetry considerations that imply a non-zero anomalous Hall effect (AHE)
in certain non-collinear antiferromagnets also imply both non-zero orbital
magnetization and a net spin magnetization. We have explicitly evaluated the
orbital magnetizations of several anomalous Hall effect antiferromagnets and
find that they tend to dominate over spin magnetizations, especially so when
spin-orbit interactions are weak. Because of the greater relative importance of
orbital magnetization the coupling between magnetic order and an external
magnetic field is unusual. We explain how magnetic fields can be used to
manipulate magnetic configurations in these systems, pointing in particular to
the important role played by the response of orbital magnetization to the
Zeeman-like spin exchange fields.
| cond-mat.mes-hall cond-mat.mtrl-sci | the symmetry considerations that imply a nonzero anomalous hall effect ahe in certain noncollinear antiferromagnets also imply both nonzero orbital magnetization and a net spin magnetization we have explicitly evaluated the orbital magnetizations of several anomalous hall effect antiferromagnets and find that they tend to dominate over spin magnetizations especially so when spinorbit interactions are weak because of the greater relative importance of orbital magnetization the coupling between magnetic order and an external magnetic field is unusual we explain how magnetic fields can be used to manipulate magnetic configurations in these systems pointing in particular to the important role played by the response of orbital magnetization to the zeemanlike spin exchange fields | [['the', 'symmetry', 'considerations', 'that', 'imply', 'a', 'nonzero', 'anomalous', 'hall', 'effect', 'ahe', 'in', 'certain', 'noncollinear', 'antiferromagnets', 'also', 'imply', 'both', 'nonzero', 'orbital', 'magnetization', 'and', 'a', 'net', 'spin', 'magnetization', 'we', 'have', 'explicitly', 'evaluated', 'the', 'orbital', 'magnetizations', 'of', 'several', 'anomalous', 'hall', 'effect', 'antiferromagnets', 'and', 'find', 'that', 'they', 'tend', 'to', 'dominate', 'over', 'spin', 'magnetizations', 'especially', 'so', 'when', 'spinorbit', 'interactions', 'are', 'weak', 'because', 'of', 'the', 'greater', 'relative', 'importance', 'of', 'orbital', 'magnetization', 'the', 'coupling', 'between', 'magnetic', 'order', 'and', 'an', 'external', 'magnetic', 'field', 'is', 'unusual', 'we', 'explain', 'how', 'magnetic', 'fields', 'can', 'be', 'used', 'to', 'manipulate', 'magnetic', 'configurations', 'in', 'these', 'systems', 'pointing', 'in', 'particular', 'to', 'the', 'important', 'role', 'played', 'by', 'the', 'response', 'of', 'orbital', 'magnetization', 'to', 'the', 'zeemanlike', 'spin', 'exchange', 'fields']] | [-0.2668848530572307, 0.2555929244399522, -0.03380030105940283, 0.09620996945990815, -0.11527971064580404, -0.10065215838507616, -0.009218122897436842, 0.41616809398068916, -0.2653469157521613, -0.3289462535675349, 0.013092171626340132, -0.24804253999276885, -0.12876090894237027, 0.2233901772248958, 0.06620699591335974, -0.04936613062246969, -0.060754394420655444, -0.002626323457142072, -0.08222121249959205, -0.23730834650008806, 0.2825984837088202, -0.0265530571175207, 0.26113780170063755, 0.09142573528307756, 0.0842311964079272, 0.023693996665575208, 0.14168510347397906, 0.09096184143813194, -0.09078389242871968, 0.02911942422984534, 0.20069489619345404, -0.15284107039250167, 0.1608638282341417, -0.48416898713912815, -0.12716502051002213, 0.07959757959387, 0.14586422723368742, 0.18161392426866638, -0.0279305693090594, -0.24671231536194682, 0.02779370908475747, -0.17756731678049878, -0.1273014818572327, -0.1919622522213363, 0.03508741830280217, -0.003430834838322231, -0.2741104593899633, 0.08148704650245366, 0.15090906386395936, 0.15017831435294024, -0.10525415367945763, -0.1536915604998025, -0.13946219598957604, 0.10672960661057525, 0.1630880763924714, 0.08652922957220913, 0.1403493209644304, -0.1356670516293629, -0.17818043829642452, 0.3251842763607523, -0.026569021043542307, -0.16476605395187757, 0.12321223916660529, -0.26174196419222945, -0.09619011704593763, 0.12428024351122856, 0.16989155148309823, 0.07181653579963106, -0.10221054021492039, 0.06657632963210094, 0.025421103953184292, 0.12795437667019932, 0.011214537458727136, 0.11559211672699478, 0.35105860309808384, 0.07300883107693933, 0.05282788676517417, 0.12139361010278142, -0.1615293483357943, -0.09787168049453092, -0.20214877078043564, -0.14174325126805343, -0.21941136823235347, 0.11567118348154638, -0.09062380808050616, -0.13482557366036677, 0.3644850426478245, 0.2649487983892738, 0.1436028104341988, -0.11873449604900088, 0.254056294968385, 0.11172560630490937, 0.09481377309566597, 0.054948099152950035, 0.28893391179320005, 0.25319055404855006, 0.1301291190227078, -0.38377003044505337, 0.11027186567246515, -0.029429000132950023] |
1,802.03045 | Algorithmic aspects of branched coverings III/V. Erasing maps,
orbispaces, and the Birman exact sequence | Let $\tilde f\colon(S^2,\tilde A)\to(S^2,\tilde A)$ be a Thurston map and let
$M(\tilde f)$ be its mapping class biset: isotopy classes rel $\tilde A$ of
maps obtained by pre- and post-composing $\tilde f$ by the mapping class group
of $(S^2,\tilde A)$. Let $A\subseteq\tilde A$ be an $\tilde f$-invariant
subset, and let $f\colon(S^2,A)\to(S^2,A)$ be the induced map. We give an
analogue of the Birman short exact sequence: just as the mapping class group
$\mathrm{Mod}(S^2,\tilde A)$ is an iterated extension of $\mathrm{Mod}(S^2,A)$
by fundamental groups of punctured spheres, $M(\tilde f)$ is an iterated
extension of $M(f)$ by the dynamical biset of $f$.
Thurston equivalence of Thurston maps classically reduces to a conjugacy
problem in mapping class bisets. Our short exact sequence of mapping class
bisets allows us to reduce in polynomial time the conjugacy problem in
$M(\tilde f)$ to that in $M(f)$. In case $\tilde f$ is geometric (either
expanding or doubly covered by a hyperbolic torus endomorphism) we show that
the dynamical biset $B(f)$ together with a "portrait of bisets" induced by
$\tilde A$ is a complete conjugacy invariant of $\tilde f$.
Along the way, we give a complete description of bisets of $(2,2,2,2)$-maps
as a crossed product of bisets of torus endomorphisms by the cyclic group of
order $2$, and we show that non-cyclic orbisphere bisets have no automorphism.
We finally give explicit, efficient algorithms that solve the conjugacy and
centralizer problems for bisets of expanding or torus maps.
| math.GR math.DS | let tilde fcolons2tilde atos2tilde a be a thurston map and let mtilde f be its mapping class biset isotopy classes rel tilde a of maps obtained by pre and postcomposing tilde f by the mapping class group of s2tilde a let asubseteqtilde a be an tilde finvariant subset and let fcolons2atos2a be the induced map we give an analogue of the birman short exact sequence just as the mapping class group mathrmmods2tilde a is an iterated extension of mathrmmods2a by fundamental groups of punctured spheres mtilde f is an iterated extension of mf by the dynamical biset of f thurston equivalence of thurston maps classically reduces to a conjugacy problem in mapping class bisets our short exact sequence of mapping class bisets allows us to reduce in polynomial time the conjugacy problem in mtilde f to that in mf in case tilde f is geometric either expanding or doubly covered by a hyperbolic torus endomorphism we show that the dynamical biset bf together with a portrait of bisets induced by tilde a is a complete conjugacy invariant of tilde f along the way we give a complete description of bisets of 2222maps as a crossed product of bisets of torus endomorphisms by the cyclic group of order 2 and we show that noncyclic orbisphere bisets have no automorphism we finally give explicit efficient algorithms that solve the conjugacy and centralizer problems for bisets of expanding or torus maps | [['let', 'tilde', 'fcolons2tilde', 'atos2tilde', 'a', 'be', 'a', 'thurston', 'map', 'and', 'let', 'mtilde', 'f', 'be', 'its', 'mapping', 'class', 'biset', 'isotopy', 'classes', 'rel', 'tilde', 'a', 'of', 'maps', 'obtained', 'by', 'pre', 'and', 'postcomposing', 'tilde', 'f', 'by', 'the', 'mapping', 'class', 'group', 'of', 's2tilde', 'a', 'let', 'asubseteqtilde', 'a', 'be', 'an', 'tilde', 'finvariant', 'subset', 'and', 'let', 'fcolons2atos2a', 'be', 'the', 'induced', 'map', 'we', 'give', 'an', 'analogue', 'of', 'the', 'birman', 'short', 'exact', 'sequence', 'just', 'as', 'the', 'mapping', 'class', 'group', 'mathrmmods2tilde', 'a', 'is', 'an', 'iterated', 'extension', 'of', 'mathrmmods2a', 'by', 'fundamental', 'groups', 'of', 'punctured', 'spheres', 'mtilde', 'f', 'is', 'an', 'iterated', 'extension', 'of', 'mf', 'by', 'the', 'dynamical', 'biset', 'of', 'f', 'thurston', 'equivalence', 'of', 'thurston', 'maps', 'classically', 'reduces', 'to', 'a', 'conjugacy', 'problem', 'in', 'mapping', 'class', 'bisets', 'our', 'short', 'exact', 'sequence', 'of', 'mapping', 'class', 'bisets', 'allows', 'us', 'to', 'reduce', 'in', 'polynomial', 'time', 'the', 'conjugacy', 'problem', 'in', 'mtilde', 'f', 'to', 'that', 'in', 'mf', 'in', 'case', 'tilde', 'f', 'is', 'geometric', 'either', 'expanding', 'or', 'doubly', 'covered', 'by', 'a', 'hyperbolic', 'torus', 'endomorphism', 'we', 'show', 'that', 'the', 'dynamical', 'biset', 'bf', 'together', 'with', 'a', 'portrait', 'of', 'bisets', 'induced', 'by', 'tilde', 'a', 'is', 'a', 'complete', 'conjugacy', 'invariant', 'of', 'tilde', 'f', 'along', 'the', 'way', 'we', 'give', 'a', 'complete', 'description', 'of', 'bisets', 'of', '2222maps', 'as', 'a', 'crossed', 'product', 'of', 'bisets', 'of', 'torus', 'endomorphisms', 'by', 'the', 'cyclic', 'group', 'of', 'order', '2', 'and', 'we', 'show', 'that', 'noncyclic', 'orbisphere', 'bisets', 'have', 'no', 'automorphism', 'we', 'finally', 'give', 'explicit', 'efficient', 'algorithms', 'that', 'solve', 'the', 'conjugacy', 'and', 'centralizer', 'problems', 'for', 'bisets', 'of', 'expanding', 'or', 'torus', 'maps']] | [-0.19366980195372252, 0.10242236551870551, -0.0911927283087974, 0.03646033876698072, -0.086521342439626, -0.1280115067687196, 0.02328273195777448, 0.3527396217870869, -0.36554439593588506, -0.23802363207326843, 0.09334833914232277, -0.2292915070154362, -0.14803591684087, 0.20697876040848265, -0.13399678399978338, -0.02532743633517448, 0.05052996565191598, 0.07627237112115325, -0.12301242014131787, -0.22872431028027726, 0.3611235228068963, -0.04104265917205913, 0.13663594029831552, 0.010378490044866084, 0.11740887688632172, -0.008005989575681988, -0.028892915028049367, 0.013402202722142664, -0.16576117380757574, 0.0819979647711622, 0.28598027463937015, 0.10706724491472797, 0.21623614497111066, -0.3228596820120226, -0.15402522593483395, 0.24243380530051103, 0.1332376284806646, -0.029850394738069122, -0.03535037499488936, -0.3063512131389998, 0.09783954383282546, -0.18007039946091377, -0.10974495126579872, -0.05236170831618406, 0.11671377204178848, -0.008137190580702992, -0.2718019882572423, -0.02408570569343538, 0.13761532800389545, 0.08561242569703609, -0.013655807341708345, -0.018618816275991042, -0.041128355363310366, 0.11374409469007923, -0.032988658021694345, 0.1456047713699375, 0.11290279724900693, -0.05769133412487511, -0.11576504383048271, 0.3945768689491639, -0.1263535597773673, -0.21090524638757893, 0.12045518478803467, -0.11426317184068785, -0.17388280911632537, 0.155710431738969, 0.0955340415321029, 0.1782578316133208, -0.06584920123905728, 0.25696763249493015, -0.15641935381082525, 0.09742942294657328, 0.07870253463063323, -0.057428452000941, 0.11215358087895111, 0.05051017217460627, 0.14365398065746648, 0.20259140775612505, 0.05408039197668826, 0.0054661707683025225, -0.3301119623019507, -0.19864831774560898, -0.12201384436788462, 0.17217160731946168, -0.10222054579214289, -0.18327032619160027, 0.416991465006089, 0.01065006375459856, 0.2184151176959603, 0.15188815037420186, 0.18102700321673693, 0.05552290217811037, 0.047722592865364025, 0.09144156989356832, 0.07094419942535624, 0.19551516048459075, -0.09919757329605586, -0.17022102732995623, -0.033201982020073684, 0.26323159314741035] |
1,802.03046 | Existence of augmented Lagrange multipliers: reduction to exact penalty
functions and localization principle | In this article, we present new general results on existence of augmented
Lagrange multipliers. We define a penalty function associated with an augmented
Lagrangian, and prove that, under a certain growth assumption on the augmenting
function, an augmented Lagrange multiplier exists if and only if this penalty
function is exact. We also develop a new general approach to the study of
augmented Lagrange multipliers called the localization principle. The
localization principle allows one to study the local behaviour of the augmented
Lagrangian near globally optimal solutions of the initial optimization problem
in order to prove the existence of augmented Lagrange multipliers.
| math.OC | in this article we present new general results on existence of augmented lagrange multipliers we define a penalty function associated with an augmented lagrangian and prove that under a certain growth assumption on the augmenting function an augmented lagrange multiplier exists if and only if this penalty function is exact we also develop a new general approach to the study of augmented lagrange multipliers called the localization principle the localization principle allows one to study the local behaviour of the augmented lagrangian near globally optimal solutions of the initial optimization problem in order to prove the existence of augmented lagrange multipliers | [['in', 'this', 'article', 'we', 'present', 'new', 'general', 'results', 'on', 'existence', 'of', 'augmented', 'lagrange', 'multipliers', 'we', 'define', 'a', 'penalty', 'function', 'associated', 'with', 'an', 'augmented', 'lagrangian', 'and', 'prove', 'that', 'under', 'a', 'certain', 'growth', 'assumption', 'on', 'the', 'augmenting', 'function', 'an', 'augmented', 'lagrange', 'multiplier', 'exists', 'if', 'and', 'only', 'if', 'this', 'penalty', 'function', 'is', 'exact', 'we', 'also', 'develop', 'a', 'new', 'general', 'approach', 'to', 'the', 'study', 'of', 'augmented', 'lagrange', 'multipliers', 'called', 'the', 'localization', 'principle', 'the', 'localization', 'principle', 'allows', 'one', 'to', 'study', 'the', 'local', 'behaviour', 'of', 'the', 'augmented', 'lagrangian', 'near', 'globally', 'optimal', 'solutions', 'of', 'the', 'initial', 'optimization', 'problem', 'in', 'order', 'to', 'prove', 'the', 'existence', 'of', 'augmented', 'lagrange', 'multipliers']] | [-0.16174923560333135, 0.012590631600849717, -0.11911337286243123, 0.0926248076185123, -0.10823514006368004, -0.10262068204747715, 0.019790199550680152, 0.31258178992418223, -0.34793307457008577, -0.2460418216293991, 0.11122137471563229, -0.19926340301019155, -0.21528300015938165, 0.13510405755426624, -0.10046404305070934, 0.04243775481118424, 0.052218608539735915, 0.04617581581137844, -0.16486347466476703, -0.20239109844707026, 0.35309912773347135, 0.017651247939482185, 0.1984790578244789, 0.04950443387554848, 0.16901754107473804, 0.08278754478929067, 0.026521528729855425, 0.025553160439254624, -0.15375842655685298, 0.1682684211934096, 0.1740695837663837, 0.14591643046864336, 0.35986885926363493, -0.42513664588701017, -0.17320192642141097, 0.14623928874140918, 0.12598100385748515, 0.04248909713552877, -0.09924129997887234, -0.2580478565656755, 0.1532261128638788, -0.15536600514545595, -0.21062809121933315, -0.07746753178647545, -0.0671600848159725, 0.04481542619270282, -0.3403848771761992, 0.008135745783352598, 0.034638250615484645, 0.04532163443578647, -0.15595143702455178, -0.06154250762296269, 0.010695626304512568, 0.005658774051151358, 0.0552787325220496, 0.04793272539512208, 0.07339103698804236, -0.058573345999500835, -0.08312592563210147, 0.33043726344620533, -0.06665186397385515, -0.32179658443408804, 0.18722468869078276, -0.04824374416050049, -0.14775222688360085, 0.08765644262000771, 0.16795859502923519, 0.20507334802521043, -0.16194860203800224, 0.13862209539228848, -0.1102799326919093, 0.13636356704674735, 0.05257988815186637, -0.006226967235261777, 0.10673045336803662, 0.10661455631108567, 0.2519885828571007, 0.14971829134720782, -0.06576716738100634, -0.09633260682262111, -0.3867704290712234, -0.18249436550298798, -0.17988659597306264, -0.007626572079808995, -0.08638059534103665, -0.2059385476375718, 0.4263268915364648, 0.1921175045934091, 0.12660668749767956, 0.09590845076496353, 0.2792852242479543, 0.19586729849365972, 0.04971603486723829, 0.0752970714186604, 0.24273377918352437, 0.10888873999431213, 0.06421437532189164, -0.21107709928793777, 0.01553330380045394, 0.2411610732076339] |
1,802.03047 | Revisiting the Phase Curves of WASP-43b: Confronting Reanalyzed Spitzer
Data with Cloudy Atmospheres | Recently acquired Hubble and Spitzer phase curves of the short-period hot
Jupiter WASP-43b make it an ideal target for confronting theory with data. On
the observational front, we re-analyze the 3.6 and 4.5 $\mu$m Spitzer phase
curves and demonstrate that our improved analysis better removes residual red
noise due to intra-pixel sensitivity, which leads to greater fluxes emanating
from the nightside of WASP-43b, thus reducing the tension between theory and
data. On the theoretical front, we construct cloudfree and cloudy atmospheres
of WASP-43b using our Global Circulation Model (GCM), THOR, which solves the
non-hydrostatic Euler equations (compared to GCMs that typically solve the
hydrostatic primitive equations). The cloudfree atmosphere produces a
reasonable fit to the dayside emission spectrum. The multi-phase emission
spectra constrain the cloud deck to be confined to the nightside and have a
finite cloud-top pressure. The multi-wavelength phase curves are naturally
consistent with our cloudy atmospheres, except for the 4.5 $\mu$m phase curve,
which requires the presence of enhanced carbon dioxide in the atmosphere of
WASP-43b. Multi-phase emission spectra at higher spectral resolution, as may be
obtained using the James Webb Space Telescope, and a reflected-light phase
curve at visible wavelengths would further constrain the properties of clouds
in WASP-43b.
| astro-ph.EP | recently acquired hubble and spitzer phase curves of the shortperiod hot jupiter wasp43b make it an ideal target for confronting theory with data on the observational front we reanalyze the 36 and 45 mum spitzer phase curves and demonstrate that our improved analysis better removes residual red noise due to intrapixel sensitivity which leads to greater fluxes emanating from the nightside of wasp43b thus reducing the tension between theory and data on the theoretical front we construct cloudfree and cloudy atmospheres of wasp43b using our global circulation model gcm thor which solves the nonhydrostatic euler equations compared to gcms that typically solve the hydrostatic primitive equations the cloudfree atmosphere produces a reasonable fit to the dayside emission spectrum the multiphase emission spectra constrain the cloud deck to be confined to the nightside and have a finite cloudtop pressure the multiwavelength phase curves are naturally consistent with our cloudy atmospheres except for the 45 mum phase curve which requires the presence of enhanced carbon dioxide in the atmosphere of wasp43b multiphase emission spectra at higher spectral resolution as may be obtained using the james webb space telescope and a reflectedlight phase curve at visible wavelengths would further constrain the properties of clouds in wasp43b | [['recently', 'acquired', 'hubble', 'and', 'spitzer', 'phase', 'curves', 'of', 'the', 'shortperiod', 'hot', 'jupiter', 'wasp43b', 'make', 'it', 'an', 'ideal', 'target', 'for', 'confronting', 'theory', 'with', 'data', 'on', 'the', 'observational', 'front', 'we', 'reanalyze', 'the', '36', 'and', '45', 'mum', 'spitzer', 'phase', 'curves', 'and', 'demonstrate', 'that', 'our', 'improved', 'analysis', 'better', 'removes', 'residual', 'red', 'noise', 'due', 'to', 'intrapixel', 'sensitivity', 'which', 'leads', 'to', 'greater', 'fluxes', 'emanating', 'from', 'the', 'nightside', 'of', 'wasp43b', 'thus', 'reducing', 'the', 'tension', 'between', 'theory', 'and', 'data', 'on', 'the', 'theoretical', 'front', 'we', 'construct', 'cloudfree', 'and', 'cloudy', 'atmospheres', 'of', 'wasp43b', 'using', 'our', 'global', 'circulation', 'model', 'gcm', 'thor', 'which', 'solves', 'the', 'nonhydrostatic', 'euler', 'equations', 'compared', 'to', 'gcms', 'that', 'typically', 'solve', 'the', 'hydrostatic', 'primitive', 'equations', 'the', 'cloudfree', 'atmosphere', 'produces', 'a', 'reasonable', 'fit', 'to', 'the', 'dayside', 'emission', 'spectrum', 'the', 'multiphase', 'emission', 'spectra', 'constrain', 'the', 'cloud', 'deck', 'to', 'be', 'confined', 'to', 'the', 'nightside', 'and', 'have', 'a', 'finite', 'cloudtop', 'pressure', 'the', 'multiwavelength', 'phase', 'curves', 'are', 'naturally', 'consistent', 'with', 'our', 'cloudy', 'atmospheres', 'except', 'for', 'the', '45', 'mum', 'phase', 'curve', 'which', 'requires', 'the', 'presence', 'of', 'enhanced', 'carbon', 'dioxide', 'in', 'the', 'atmosphere', 'of', 'wasp43b', 'multiphase', 'emission', 'spectra', 'at', 'higher', 'spectral', 'resolution', 'as', 'may', 'be', 'obtained', 'using', 'the', 'james', 'webb', 'space', 'telescope', 'and', 'a', 'reflectedlight', 'phase', 'curve', 'at', 'visible', 'wavelengths', 'would', 'further', 'constrain', 'the', 'properties', 'of', 'clouds', 'in', 'wasp43b']] | [-0.03878059912830811, 0.12635084658265033, -0.10876896407620366, 0.06480556809265405, -0.09417828116932966, -0.09765102480781343, 0.0632609628373757, 0.37954148148837974, -0.2067914508338192, -0.3433450761760397, 0.10172532537832783, -0.2883082431192817, -0.060526837642979, 0.19722597191816774, -0.08921751133143314, 0.027395402965608415, 0.10108318195329621, -0.14429196582997006, -0.031028557834880694, -0.22787044391614095, 0.24870066428465282, 0.11785920522877662, 0.15782421950125847, 0.02014134786311959, 0.03598441649916504, -0.10747436939605645, -0.06124382568156264, -0.04789556509467057, -0.16379517932077514, 0.04567904356096325, 0.203299318833662, 0.08193919967786578, 0.09045941279478499, -0.41650551546759573, -0.3212871973269752, 0.08420813767230276, 0.11234044577018014, 0.013383705502151158, 0.002647178895597167, -0.25173866326445854, 0.03369662138028988, -0.12725324354024392, -0.1962008181032656, -0.015462578873017005, -0.014419130113875044, -0.041279384376036156, -0.2801880920538105, 0.04953766246028061, -0.016461976443123753, 0.16323748597957818, -0.15491512508631633, -0.15142464429470412, -0.14648600580948382, 0.052447018635647345, -0.016486995996278824, 0.05193431816967617, 0.13074026494906307, -0.11855312825204677, 0.023878128976639122, 0.4269271538927784, -0.16293605300024372, -0.00624136936396654, 0.2100285646996548, -0.1898956754625651, -0.11527441317798212, 0.2563465280559263, 0.1309463418091147, 0.09508243161643594, -0.15086109319866953, 0.028605360897049178, -0.045285462266467326, 0.21968322685860062, 0.06596176304941621, 0.013722449740661042, 0.3117161898763639, 0.11124157567458053, 0.030795821155022298, 0.1092477916536871, -0.2571223729150714, -0.0853545763197222, -0.22274218763630801, -0.1275115224496654, -0.10718430600041899, 0.02537637083330123, -0.11856504749075746, -0.1356255694555137, 0.3362656517224983, 0.18047094318827642, 0.17616351768219604, 0.041241077116112516, 0.3652314075768875, 0.07019958667929646, 0.06651333038487416, 0.10207874844025068, 0.3036253789664599, 0.14450370938817653, 0.1430986254003468, -0.2588236154426403, 0.029836282638713643, 0.013986640036326324] |
1,802.03048 | A new product on 2x2 matrices | We study a bilinear multiplication rule on 2x2 matrices which is intermediate
between the ordinary matrix product and the Hadamard matrix product, and we
relate this to the hyperbolic motion group of the plane.
| math-ph math.MP math.RT | we study a bilinear multiplication rule on 2x2 matrices which is intermediate between the ordinary matrix product and the hadamard matrix product and we relate this to the hyperbolic motion group of the plane | [['we', 'study', 'a', 'bilinear', 'multiplication', 'rule', 'on', '2x2', 'matrices', 'which', 'is', 'intermediate', 'between', 'the', 'ordinary', 'matrix', 'product', 'and', 'the', 'hadamard', 'matrix', 'product', 'and', 'we', 'relate', 'this', 'to', 'the', 'hyperbolic', 'motion', 'group', 'of', 'the', 'plane']] | [-0.18138809778782375, 0.10682787494186093, -0.045745683012201506, 0.04058428327826893, -0.07632579177837162, -0.06745424969395732, 0.07112977336681284, 0.37474797638681007, -0.3494243135347086, -0.20888863214949036, 0.18364607765996718, -0.25874176702885, -0.24966394791708274, 0.12273283976623241, -0.01716441981603994, 0.0020671552594970256, 0.032339571810820526, 0.07570177401580355, -0.2531305204200394, -0.20600998171550386, 0.4266210137044682, -0.050614712568109524, 0.22879887677674346, -0.007078629808829111, 0.14422647241393433, 0.06506629512809656, -0.0750591454698759, -0.08143029515357579, -0.0369508011978777, 0.1475873039350571, 0.20538834701566136, 0.07823199229588841, 0.14426240781733, -0.3888967462870128, -0.048794545945437515, 0.17775146323530114, 0.09232257158659837, 0.010765741945600467, -0.020464150854797268, -0.27919748973320513, 0.05484744020299438, -0.21404030699940288, -0.11328672858722069, -0.04234018238425693, 0.020552431157899693, -0.02621427392724025, -0.32311099252718334, 0.05462804858517997, 0.05169954485095599, -0.008459204396999934, -0.00911854563609642, -0.15499969730701516, 0.06337516097461476, 0.1275878358659718, -0.03601194198435063, -0.04742047788493116, 0.10589157843359691, -0.01699382224914563, -0.06443129573017359, 0.3369179291321951, -0.049583421609200096, -0.2834587514619617, 0.1151020456215038, -0.20449700965272152, -0.10276728013859075, 0.08338590426480069, 0.19131604154758594, 0.1165917659561862, -0.09228659141808748, 0.11566559642019189, -0.17029005815001094, 0.1441089982879074, 0.04508101931937477, -0.04102105669238988, 0.10416589031228796, 0.07162159185527879, 0.0938122319879339, 0.15072675235569477, 0.027482729713322922, -0.15553100401645198, -0.27917350960128445, -0.2667448757873738, -0.1583718338275931, 0.13195920968428254, -0.16430431902870837, -0.2146244070985738, 0.4229662526837167, 0.033431677202529764, 0.20958342841442892, 0.047233588264241594, 0.24872187631862128, 0.14994564198594376, 0.0999335127280039, 0.026569858508403685, 0.15204947485643275, 0.28093119371025, 0.018873029813060865, -0.20999654833063044, -0.011970801100901821, 0.2062032040044227] |
1,802.03049 | Leveraging Coding Techniques for Speeding up Distributed Computing | Large scale clusters leveraging distributed computing frameworks such as
MapReduce routinely process data that are on the orders of petabytes or more.
The sheer size of the data precludes the processing of the data on a single
computer. The philosophy in these methods is to partition the overall job into
smaller tasks that are executed on different servers; this is called the map
phase. This is followed by a data shuffling phase where appropriate data is
exchanged between the servers. The final so-called reduce phase, completes the
computation.
One potential approach, explored in prior work for reducing the overall
execution time is to operate on a natural tradeoff between computation and
communication. Specifically, the idea is to run redundant copies of map tasks
that are placed on judiciously chosen servers. The shuffle phase exploits the
location of the nodes and utilizes coded transmission. The main drawback of
this approach is that it requires the original job to be split into a number of
map tasks that grows exponentially in the system parameters. This is
problematic, as we demonstrate that splitting jobs too finely can in fact
adversely affect the overall execution time.
In this work we show that one can simultaneously obtain low communication
loads while ensuring that jobs do not need to be split too finely. Our approach
uncovers a deep relationship between this problem and a class of combinatorial
structures called resolvable designs. Appropriate interpretation of resolvable
designs can allow for the development of coded distributed computing schemes
where the splitting levels are exponentially lower than prior work. We present
experimental results obtained on Amazon EC2 clusters for a widely known
distributed algorithm, namely TeraSort. We obtain over 4.69$\times$ improvement
in speedup over the baseline approach and more than 2.6$\times$ over current
state of the art.
| cs.IT math.IT | large scale clusters leveraging distributed computing frameworks such as mapreduce routinely process data that are on the orders of petabytes or more the sheer size of the data precludes the processing of the data on a single computer the philosophy in these methods is to partition the overall job into smaller tasks that are executed on different servers this is called the map phase this is followed by a data shuffling phase where appropriate data is exchanged between the servers the final socalled reduce phase completes the computation one potential approach explored in prior work for reducing the overall execution time is to operate on a natural tradeoff between computation and communication specifically the idea is to run redundant copies of map tasks that are placed on judiciously chosen servers the shuffle phase exploits the location of the nodes and utilizes coded transmission the main drawback of this approach is that it requires the original job to be split into a number of map tasks that grows exponentially in the system parameters this is problematic as we demonstrate that splitting jobs too finely can in fact adversely affect the overall execution time in this work we show that one can simultaneously obtain low communication loads while ensuring that jobs do not need to be split too finely our approach uncovers a deep relationship between this problem and a class of combinatorial structures called resolvable designs appropriate interpretation of resolvable designs can allow for the development of coded distributed computing schemes where the splitting levels are exponentially lower than prior work we present experimental results obtained on amazon ec2 clusters for a widely known distributed algorithm namely terasort we obtain over 469times improvement in speedup over the baseline approach and more than 26times over current state of the art | [['large', 'scale', 'clusters', 'leveraging', 'distributed', 'computing', 'frameworks', 'such', 'as', 'mapreduce', 'routinely', 'process', 'data', 'that', 'are', 'on', 'the', 'orders', 'of', 'petabytes', 'or', 'more', 'the', 'sheer', 'size', 'of', 'the', 'data', 'precludes', 'the', 'processing', 'of', 'the', 'data', 'on', 'a', 'single', 'computer', 'the', 'philosophy', 'in', 'these', 'methods', 'is', 'to', 'partition', 'the', 'overall', 'job', 'into', 'smaller', 'tasks', 'that', 'are', 'executed', 'on', 'different', 'servers', 'this', 'is', 'called', 'the', 'map', 'phase', 'this', 'is', 'followed', 'by', 'a', 'data', 'shuffling', 'phase', 'where', 'appropriate', 'data', 'is', 'exchanged', 'between', 'the', 'servers', 'the', 'final', 'socalled', 'reduce', 'phase', 'completes', 'the', 'computation', 'one', 'potential', 'approach', 'explored', 'in', 'prior', 'work', 'for', 'reducing', 'the', 'overall', 'execution', 'time', 'is', 'to', 'operate', 'on', 'a', 'natural', 'tradeoff', 'between', 'computation', 'and', 'communication', 'specifically', 'the', 'idea', 'is', 'to', 'run', 'redundant', 'copies', 'of', 'map', 'tasks', 'that', 'are', 'placed', 'on', 'judiciously', 'chosen', 'servers', 'the', 'shuffle', 'phase', 'exploits', 'the', 'location', 'of', 'the', 'nodes', 'and', 'utilizes', 'coded', 'transmission', 'the', 'main', 'drawback', 'of', 'this', 'approach', 'is', 'that', 'it', 'requires', 'the', 'original', 'job', 'to', 'be', 'split', 'into', 'a', 'number', 'of', 'map', 'tasks', 'that', 'grows', 'exponentially', 'in', 'the', 'system', 'parameters', 'this', 'is', 'problematic', 'as', 'we', 'demonstrate', 'that', 'splitting', 'jobs', 'too', 'finely', 'can', 'in', 'fact', 'adversely', 'affect', 'the', 'overall', 'execution', 'time', 'in', 'this', 'work', 'we', 'show', 'that', 'one', 'can', 'simultaneously', 'obtain', 'low', 'communication', 'loads', 'while', 'ensuring', 'that', 'jobs', 'do', 'not', 'need', 'to', 'be', 'split', 'too', 'finely', 'our', 'approach', 'uncovers', 'a', 'deep', 'relationship', 'between', 'this', 'problem', 'and', 'a', 'class', 'of', 'combinatorial', 'structures', 'called', 'resolvable', 'designs', 'appropriate', 'interpretation', 'of', 'resolvable', 'designs', 'can', 'allow', 'for', 'the', 'development', 'of', 'coded', 'distributed', 'computing', 'schemes', 'where', 'the', 'splitting', 'levels', 'are', 'exponentially', 'lower', 'than', 'prior', 'work', 'we', 'present', 'experimental', 'results', 'obtained', 'on', 'amazon', 'ec2', 'clusters', 'for', 'a', 'widely', 'known', 'distributed', 'algorithm', 'namely', 'terasort', 'we', 'obtain', 'over', '469times', 'improvement', 'in', 'speedup', 'over', 'the', 'baseline', 'approach', 'and', 'more', 'than', '26times', 'over', 'current', 'state', 'of', 'the', 'art']] | [-0.15325986811035133, 0.08632365353280044, -0.0815398611962444, 0.0369996643652552, -0.08081021234224572, -0.1379212325114305, 0.0925723484079181, 0.39502393914330186, -0.2830655179331424, -0.3589622163486601, 0.11613309999256824, -0.23871449988354185, -0.10932045199544567, 0.21526880754567118, -0.1085198257031838, 0.05231582966667635, 0.11410382118621709, 0.020990760261600568, -0.05235145529745337, -0.30693386251464333, 0.28608716197150386, 0.05453998167512653, 0.3239178034486343, 0.020669232954362075, 0.07166486506715655, -0.004993747075492836, -0.030809285089386133, -0.0030537875834068516, -0.05661070840107904, 0.12724096460349432, 0.2870251932651783, 0.193671245883636, 0.2914100968300895, -0.43589676325228055, -0.16617030182168177, 0.12444430018290298, 0.17274517912311035, 0.07891202573695844, -0.0027765906397261113, -0.24201614310046163, 0.11214625511954614, -0.15843233682045882, -0.025142155169048393, -0.07476377826452926, -0.011159829040424842, 0.0023677237290710288, -0.2747953161252318, 0.02575795052412671, 0.03568050891083747, 0.014927131769024713, -0.014448874948706215, -0.10134504553242603, 0.02911629181540248, 0.14636469190008938, 0.013165028702592327, 0.035859921740161046, 0.14190132711835282, -0.09482260461605031, -0.1249436025749986, 0.39014338295881695, -0.006949936318535025, -0.1791156253648878, 0.16315174545670988, -0.060586510709822426, -0.15809634011646462, 0.11508456190659191, 0.1957678330359786, 0.09664818374847724, -0.1253754784719962, 0.05938166368336053, -0.014985295066293267, 0.20673685973888006, 0.06060332225428687, 0.04069537967553218, 0.1563866070590471, 0.21720507606979214, 0.10894115449098701, 0.156320279231295, -0.06193972568839839, -0.12782766492896233, -0.24298393343785396, -0.14780826648926168, -0.21930766284860898, -0.0009747051032905244, -0.09884606929153349, -0.13320275637092263, 0.3692849154305027, 0.17718191339982428, 0.21351696485465374, 0.08739508352452506, 0.36950864933073674, 0.07144566854385201, 0.1406815565974759, 0.11990864429096079, 0.16800369989591013, 0.0065557170770623365, 0.10989434254137793, -0.19230792664543347, 0.08978793039441309, 0.009443590366254131] |
1,802.0305 | Thompson Sampling for Dynamic Pricing | In this paper we apply active learning algorithms for dynamic pricing in a
prominent e-commerce website. Dynamic pricing involves changing the price of
items on a regular basis, and uses the feedback from the pricing decisions to
update prices of the items. Most popular approaches to dynamic pricing use a
passive learning approach, where the algorithm uses historical data to learn
various parameters of the pricing problem, and uses the updated parameters to
generate a new set of prices. We show that one can use active learning
algorithms such as Thompson sampling to more efficiently learn the underlying
parameters in a pricing problem. We apply our algorithms to a real e-commerce
system and show that the algorithms indeed improve revenue compared to pricing
algorithms that use passive learning.
| stat.ML cs.LG | in this paper we apply active learning algorithms for dynamic pricing in a prominent ecommerce website dynamic pricing involves changing the price of items on a regular basis and uses the feedback from the pricing decisions to update prices of the items most popular approaches to dynamic pricing use a passive learning approach where the algorithm uses historical data to learn various parameters of the pricing problem and uses the updated parameters to generate a new set of prices we show that one can use active learning algorithms such as thompson sampling to more efficiently learn the underlying parameters in a pricing problem we apply our algorithms to a real ecommerce system and show that the algorithms indeed improve revenue compared to pricing algorithms that use passive learning | [['in', 'this', 'paper', 'we', 'apply', 'active', 'learning', 'algorithms', 'for', 'dynamic', 'pricing', 'in', 'a', 'prominent', 'ecommerce', 'website', 'dynamic', 'pricing', 'involves', 'changing', 'the', 'price', 'of', 'items', 'on', 'a', 'regular', 'basis', 'and', 'uses', 'the', 'feedback', 'from', 'the', 'pricing', 'decisions', 'to', 'update', 'prices', 'of', 'the', 'items', 'most', 'popular', 'approaches', 'to', 'dynamic', 'pricing', 'use', 'a', 'passive', 'learning', 'approach', 'where', 'the', 'algorithm', 'uses', 'historical', 'data', 'to', 'learn', 'various', 'parameters', 'of', 'the', 'pricing', 'problem', 'and', 'uses', 'the', 'updated', 'parameters', 'to', 'generate', 'a', 'new', 'set', 'of', 'prices', 'we', 'show', 'that', 'one', 'can', 'use', 'active', 'learning', 'algorithms', 'such', 'as', 'thompson', 'sampling', 'to', 'more', 'efficiently', 'learn', 'the', 'underlying', 'parameters', 'in', 'a', 'pricing', 'problem', 'we', 'apply', 'our', 'algorithms', 'to', 'a', 'real', 'ecommerce', 'system', 'and', 'show', 'that', 'the', 'algorithms', 'indeed', 'improve', 'revenue', 'compared', 'to', 'pricing', 'algorithms', 'that', 'use', 'passive', 'learning']] | [-0.02366846081622498, -0.03529904145398177, -0.10007764901820337, 0.1328682659941478, -0.2080105271670618, -0.16962193332437892, 0.14695427569040476, 0.47385737622971646, -0.30973918454856175, -0.279686235684494, 0.12254531255985057, -0.25393944110692246, -0.1913584169378737, 0.22289608980645426, -0.15381943023749045, 0.04832081267886679, 0.03249788461107528, 0.02486047249112744, -0.0026667421388992807, -0.3174146773526445, 0.2923597786866594, 0.030537811893736944, 0.27890141677926295, -0.030931951681850478, 0.13239481525397423, 0.030865910934153362, -0.04156326206793892, 0.006854861793726741, -0.1185939435526393, 0.19805516005544632, 0.3497336073924089, 0.2070523976253753, 0.3897765796864405, -0.4104071407346055, -0.16167551192484098, 0.12091434583271621, 0.07874309816361347, 0.09248859697254375, -0.06634984632057694, -0.24156635759209166, 0.031346610816399334, -0.22964277667779243, -0.01915169175117626, -0.1279972560587339, -0.03635920226224698, 0.0395160800109835, -0.38276607445732225, -0.04973032699035684, -0.015998899696569424, -0.026457810985448305, -0.04740346455946565, -0.12220017662821192, 0.03302532567158778, 0.16127233970473753, 0.0796745154002565, -0.04301904165549786, 0.1903661598735198, -0.13179237578833636, -0.2568282255815575, 0.40673029760364443, -0.04713292927954171, -0.16916033152665477, 0.15467475590776303, -0.008043749705393566, -0.17060926893827855, 0.12138393913119216, 0.28704886422201525, 0.11775496867630864, -0.17379304202040657, 0.042404340993471124, -0.07992492079938529, 0.1721381486422615, 0.01477546834939858, -0.03609584815058042, 0.09883327853822266, 0.2309547062177444, 0.14334789622807875, 0.11805565588565514, -0.032879369782676804, -0.14522116167790955, -0.18442417988262605, -0.10864048696384998, -0.18739692055532942, -0.012689101044088602, -0.14481099945317055, -0.15979742391141372, 0.3967542273167055, 0.26100631435997457, 0.15789075671636965, 0.09861524923326215, 0.3751938598434208, 0.0662025599477829, 0.036207540877512656, 0.20040980168414535, 0.13979571704294358, -0.029931969478639076, 0.18989181956203538, -0.1822584522797115, 0.1480599232509121, 0.06577373524487484] |
1,802.03051 | Caregiver Assessment Using Smart Gaming Technology: A Preliminary
Approach | As pre-diagnostic technologies are becoming increasingly accessible, using
them to improve the quality of care available to dementia patients and their
caregivers is of increasing interest. Specifically, we aim to develop a tool
for non-invasively assessing task performance in a simple gaming application.
To address this, we have developed Caregiver Assessment using Smart Gaming
Technology (CAST), a mobile application that personalizes a traditional word
scramble game. Its core functionality uses a Fuzzy Inference System (FIS)
optimized via a Genetic Algorithm (GA) to provide customized performance
measures for each user of the system. With CAST, we match the relative level of
difficulty of play using the individual's ability to solve the word scramble
tasks. We provide an analysis of the preliminary results for determining task
difficulty, with respect to our current participant cohort.
| cs.HC | as prediagnostic technologies are becoming increasingly accessible using them to improve the quality of care available to dementia patients and their caregivers is of increasing interest specifically we aim to develop a tool for noninvasively assessing task performance in a simple gaming application to address this we have developed caregiver assessment using smart gaming technology cast a mobile application that personalizes a traditional word scramble game its core functionality uses a fuzzy inference system fis optimized via a genetic algorithm ga to provide customized performance measures for each user of the system with cast we match the relative level of difficulty of play using the individuals ability to solve the word scramble tasks we provide an analysis of the preliminary results for determining task difficulty with respect to our current participant cohort | [['as', 'prediagnostic', 'technologies', 'are', 'becoming', 'increasingly', 'accessible', 'using', 'them', 'to', 'improve', 'the', 'quality', 'of', 'care', 'available', 'to', 'dementia', 'patients', 'and', 'their', 'caregivers', 'is', 'of', 'increasing', 'interest', 'specifically', 'we', 'aim', 'to', 'develop', 'a', 'tool', 'for', 'noninvasively', 'assessing', 'task', 'performance', 'in', 'a', 'simple', 'gaming', 'application', 'to', 'address', 'this', 'we', 'have', 'developed', 'caregiver', 'assessment', 'using', 'smart', 'gaming', 'technology', 'cast', 'a', 'mobile', 'application', 'that', 'personalizes', 'a', 'traditional', 'word', 'scramble', 'game', 'its', 'core', 'functionality', 'uses', 'a', 'fuzzy', 'inference', 'system', 'fis', 'optimized', 'via', 'a', 'genetic', 'algorithm', 'ga', 'to', 'provide', 'customized', 'performance', 'measures', 'for', 'each', 'user', 'of', 'the', 'system', 'with', 'cast', 'we', 'match', 'the', 'relative', 'level', 'of', 'difficulty', 'of', 'play', 'using', 'the', 'individuals', 'ability', 'to', 'solve', 'the', 'word', 'scramble', 'tasks', 'we', 'provide', 'an', 'analysis', 'of', 'the', 'preliminary', 'results', 'for', 'determining', 'task', 'difficulty', 'with', 'respect', 'to', 'our', 'current', 'participant', 'cohort']] | [-0.05767858451034761, -0.015109396119056108, -0.0737737302005178, 0.09653936673897658, -0.13555288176532043, -0.1738832266119337, 0.09011893737018302, 0.4239597862417048, -0.22599355815768693, -0.3396182681533515, 0.10502136671813346, -0.27305450935664616, -0.1695837550091021, 0.21228916089360914, -0.15688242093363608, 0.0733411434934665, 0.11782267109676027, 0.06512742529483864, 0.007679703036873517, -0.276634723314959, 0.26422819839508244, 0.0739775651988263, 0.32950288703079533, 0.0347691121313608, 0.10078324912870867, 0.021033159757004767, -0.03149437087334015, 0.022457176269116728, -0.08616237232496188, 0.19768818220561088, 0.36983466729218367, 0.23325690239047012, 0.40044632316284784, -0.4248302652444126, -0.15175118755767913, 0.07603333756384073, 0.1326878877589479, 0.07414267503543559, -0.06901950639175167, -0.32419993367159006, 0.1196372797642129, -0.2378745123490014, -0.09152449345900536, -0.10010089205443916, -0.02778808888979256, -0.007611427604305473, -0.2665264919668323, -0.019473591533658855, -0.006555126877367112, 0.11805025204155369, -0.04853662656387314, -0.10199717029062219, 0.04070030378484675, 0.25951240372590045, 0.04283900786663942, 0.03560489588739019, 0.192896388894455, -0.14270201733752125, -0.15823987356888017, 0.3761272700009585, -0.014024434699394711, -0.21555204216080406, 0.18905169518918477, -0.023840396763813314, -0.13580583966210147, 0.06087528986884563, 0.24270061991763103, 0.06730063525592965, -0.1848807139816045, -0.007143538006472007, 0.03397110255547997, 0.19453343378986712, 0.015416524948016035, -0.0026912095508481743, 0.1975304304298444, 0.26404031922081206, 0.04910451701708195, 0.15072382232756354, -0.058902908587752434, -0.06016137677414173, -0.1709054316408142, -0.17925700861660793, -0.13925346676401343, -0.015143030528358368, -0.05233659757515963, -0.16146723435006358, 0.37457406455933145, 0.2309572180648419, 0.14051028090585588, 0.0730712060493798, 0.32020632095747825, 0.06525697019154023, 0.07590484316857658, 0.028239452721071288, 0.1509844053811817, 0.02333381036508151, 0.1712399738206648, -0.2068599149281385, 0.1101015117513298, 0.03676369038735037] |
1,802.03052 | WorldTree: A Corpus of Explanation Graphs for Elementary Science
Questions supporting Multi-Hop Inference | Developing methods of automated inference that are able to provide users with
compelling human-readable justifications for why the answer to a question is
correct is critical for domains such as science and medicine, where user trust
and detecting costly errors are limiting factors to adoption. One of the
central barriers to training question answering models on explainable inference
tasks is the lack of gold explanations to serve as training data. In this paper
we present a corpus of explanations for standardized science exams, a recent
challenge task for question answering. We manually construct a corpus of
detailed explanations for nearly all publicly available standardized elementary
science question (approximately 1,680 3rd through 5th grade questions) and
represent these as "explanation graphs" -- sets of lexically overlapping
sentences that describe how to arrive at the correct answer to a question
through a combination of domain and world knowledge. We also provide an
explanation-centered tablestore, a collection of semi-structured tables that
contain the knowledge to construct these elementary science explanations.
Together, these two knowledge resources map out a substantial portion of the
knowledge required for answering and explaining elementary science exams, and
provide both structured and free-text training data for the explainable
inference task.
| cs.CL cs.AI cs.IR | developing methods of automated inference that are able to provide users with compelling humanreadable justifications for why the answer to a question is correct is critical for domains such as science and medicine where user trust and detecting costly errors are limiting factors to adoption one of the central barriers to training question answering models on explainable inference tasks is the lack of gold explanations to serve as training data in this paper we present a corpus of explanations for standardized science exams a recent challenge task for question answering we manually construct a corpus of detailed explanations for nearly all publicly available standardized elementary science question approximately 1680 3rd through 5th grade questions and represent these as explanation graphs sets of lexically overlapping sentences that describe how to arrive at the correct answer to a question through a combination of domain and world knowledge we also provide an explanationcentered tablestore a collection of semistructured tables that contain the knowledge to construct these elementary science explanations together these two knowledge resources map out a substantial portion of the knowledge required for answering and explaining elementary science exams and provide both structured and freetext training data for the explainable inference task | [['developing', 'methods', 'of', 'automated', 'inference', 'that', 'are', 'able', 'to', 'provide', 'users', 'with', 'compelling', 'humanreadable', 'justifications', 'for', 'why', 'the', 'answer', 'to', 'a', 'question', 'is', 'correct', 'is', 'critical', 'for', 'domains', 'such', 'as', 'science', 'and', 'medicine', 'where', 'user', 'trust', 'and', 'detecting', 'costly', 'errors', 'are', 'limiting', 'factors', 'to', 'adoption', 'one', 'of', 'the', 'central', 'barriers', 'to', 'training', 'question', 'answering', 'models', 'on', 'explainable', 'inference', 'tasks', 'is', 'the', 'lack', 'of', 'gold', 'explanations', 'to', 'serve', 'as', 'training', 'data', 'in', 'this', 'paper', 'we', 'present', 'a', 'corpus', 'of', 'explanations', 'for', 'standardized', 'science', 'exams', 'a', 'recent', 'challenge', 'task', 'for', 'question', 'answering', 'we', 'manually', 'construct', 'a', 'corpus', 'of', 'detailed', 'explanations', 'for', 'nearly', 'all', 'publicly', 'available', 'standardized', 'elementary', 'science', 'question', 'approximately', '1680', '3rd', 'through', '5th', 'grade', 'questions', 'and', 'represent', 'these', 'as', 'explanation', 'graphs', 'sets', 'of', 'lexically', 'overlapping', 'sentences', 'that', 'describe', 'how', 'to', 'arrive', 'at', 'the', 'correct', 'answer', 'to', 'a', 'question', 'through', 'a', 'combination', 'of', 'domain', 'and', 'world', 'knowledge', 'we', 'also', 'provide', 'an', 'explanationcentered', 'tablestore', 'a', 'collection', 'of', 'semistructured', 'tables', 'that', 'contain', 'the', 'knowledge', 'to', 'construct', 'these', 'elementary', 'science', 'explanations', 'together', 'these', 'two', 'knowledge', 'resources', 'map', 'out', 'a', 'substantial', 'portion', 'of', 'the', 'knowledge', 'required', 'for', 'answering', 'and', 'explaining', 'elementary', 'science', 'exams', 'and', 'provide', 'both', 'structured', 'and', 'freetext', 'training', 'data', 'for', 'the', 'explainable', 'inference', 'task']] | [-0.044572236439133196, 0.018897666509520156, -0.023222757750331904, 0.13826126090810645, -0.1869766147209877, -0.1501807844915399, 0.10966772594515027, 0.39580678962396854, -0.24450486579514813, -0.41109925759438837, 0.08903469050754652, -0.2902175468872442, -0.12124759625411836, 0.224730707314618, -0.10047888324708876, 0.022327905973523028, 0.12692595011204236, 0.023866929186036518, 0.015315450431609695, -0.3042105678657089, 0.31000098572853446, 0.04553521947342564, 0.2751091093464632, 0.074970437099715, 0.09690705039526684, -0.04514233643104407, -0.08735853400389486, -0.039692105245635365, -0.10467930961892831, 0.2031607121021035, 0.4189109684286836, 0.26740583814821683, 0.3528006573518117, -0.4071345533328978, -0.17528589690254645, 0.07171531672403687, 0.1387119852385667, 0.10815700863704386, -0.05339221421463387, -0.28059651864447976, 0.07590976910609187, -0.15076004643218988, -0.043239440098687104, -0.16642100324459147, 0.04096419281194532, -0.03719668730510154, -0.2626724518306972, 0.017102124612640844, 0.11430414316286756, 0.14586941094015432, -0.03892198990738829, -0.11358741973761959, 0.0615616116515182, 0.21546397193316183, 0.03496169262175821, 0.032384874715441554, 0.09266329815874648, -0.17111721427786644, -0.1740941099370971, 0.39328263032560545, 0.005425953191018316, -0.16931655316383135, 0.17511104329399801, -0.06025369770206379, -0.16735414398899962, 0.06198882567813865, 0.21463112780151683, 0.06178291966771764, -0.18672957688316025, 0.004033211347320108, -0.052652230848454766, 0.20618887176746598, 0.08242135197382816, -0.03250721000508885, 0.2540816008912945, 0.20948050221465905, -0.0027298306284303017, 0.08317209468364264, -0.011780712620656223, -0.05500739248413028, -0.29333976861277616, -0.1594142639101718, -0.16460606629779148, 0.028824612086714066, -0.027859298876357956, -0.19204849659258294, 0.36126209562174, 0.23725936262200426, 0.18764694342907104, 0.05027809745521576, 0.3053089136333026, -0.01807695483692423, 0.04221284744738968, 0.0811592568190665, 0.11829302193023114, 0.031324624892963907, 0.1295239723997774, -0.07429031654134054, 0.10194865765927284, 0.010889416796889043] |
1,802.03053 | $p$-Harmonic Maps to $S^1$ and Stationary Varifolds of Codimension 2 | We study the asymptotics as $p\uparrow 2$ of stationary $p$-harmonic maps
$u_p\in W^{1,p}(M,S^1)$ from a compact manifold $M^n$ to $S^1$, satisfying the
natural energy growth condition $$\int_M|du_p|^p=O(\frac{1}{2-p}).$$ Along a
subsequence $p_j\to 2$, we show that the singular sets $Sing(u_{p_j})$ converge
to the support of a stationary, rectifiable $(n-2)$-varifold $V$ of density
$\Theta_{n-2}(\|V\|,\cdot)\geq 2\pi$, given by the concentrated part of the
measure $$\mu=\lim_{j\to\infty}(2-p_j)|du_{p_j}|^{p_j}dv_g.$$ When $n=2$, we
show moreover that the density of $\|V\|$ takes values in $2\pi\mathbb{N}$.
Finally, on every compact manifold of dimension $n\geq 2$ we produce examples
of nontrivial families $(1,2)\ni p\mapsto u_p\in W^{1,p}(M,S^1)$ of such maps
via natural min-max constructions.
| math.DG math.AP | we study the asymptotics as puparrow 2 of stationary pharmonic maps u_pin w1pms1 from a compact manifold mn to s1 satisfying the natural energy growth condition int_mdu_ppofrac12p along a subsequence p_jto 2 we show that the singular sets singu_p_j converge to the support of a stationary rectifiable n2varifold v of density theta_n2vcdotgeq 2pi given by the concentrated part of the measure mulim_jtoinfty2p_jdu_p_jp_jdv_g when n2 we show moreover that the density of v takes values in 2pimathbbn finally on every compact manifold of dimension ngeq 2 we produce examples of nontrivial families 12ni pmapsto u_pin w1pms1 of such maps via natural minmax constructions | [['we', 'study', 'the', 'asymptotics', 'as', 'puparrow', '2', 'of', 'stationary', 'pharmonic', 'maps', 'u_pin', 'w1pms1', 'from', 'a', 'compact', 'manifold', 'mn', 'to', 's1', 'satisfying', 'the', 'natural', 'energy', 'growth', 'condition', 'int_mdu_ppofrac12p', 'along', 'a', 'subsequence', 'p_jto', '2', 'we', 'show', 'that', 'the', 'singular', 'sets', 'singu_p_j', 'converge', 'to', 'the', 'support', 'of', 'a', 'stationary', 'rectifiable', 'n2varifold', 'v', 'of', 'density', 'theta_n2vcdotgeq', '2pi', 'given', 'by', 'the', 'concentrated', 'part', 'of', 'the', 'measure', 'mulim_jtoinfty2p_jdu_p_jp_jdv_g', 'when', 'n2', 'we', 'show', 'moreover', 'that', 'the', 'density', 'of', 'v', 'takes', 'values', 'in', '2pimathbbn', 'finally', 'on', 'every', 'compact', 'manifold', 'of', 'dimension', 'ngeq', '2', 'we', 'produce', 'examples', 'of', 'nontrivial', 'families', '12ni', 'pmapsto', 'u_pin', 'w1pms1', 'of', 'such', 'maps', 'via', 'natural', 'minmax', 'constructions']] | [-0.14995668820299946, 0.09379894597517265, -0.06129479127332241, 0.06969107220788578, -0.010443852410989475, -0.10822755917599731, 0.008294641667117294, 0.36806012581071845, -0.24438832739142927, -0.1829362707263739, 0.10304517659056768, -0.3144999707301894, -0.14031415259987526, 0.1763586743151421, -0.07694482024769289, 0.023265500751402036, 0.05603664386301087, 0.10608872467303997, -0.10602902222915993, -0.22268265974196186, 0.4107835748857194, -0.07722126925108279, 0.22349137051931614, 0.05789613435914801, 0.13540201081515668, -0.02727635757700837, 0.026076485090735523, 0.04024715187376017, -0.2084559761277198, 0.12435615881458743, 0.21174320177390024, 0.13919597785090926, 0.24520688415965536, -0.3789120668191642, -0.18314139680056782, 0.17650969931344082, 0.1202783086593007, 0.016059118220684947, -0.025829628945307825, -0.26915749315950244, 0.15646136991147483, -0.07433166498175034, -0.19691229966765905, -0.06815702183642885, 0.09740407811989496, 0.055258247771704634, -0.2983472586768055, 0.03049237499074949, 0.12495290136711856, 0.03897448159897557, -0.10031975986906788, -0.10784392434192801, -0.10021124297118449, 0.0842748870718124, 0.027246082918002054, 0.09303605219011533, 0.07899050652957777, -0.05908699873527819, -0.08152056931630595, 0.313666008072547, -0.13370173441688785, -0.22261545733436122, 0.14265599392436362, -0.18873325105408553, -0.1867486352029328, 0.16061744323143592, 0.14557502509713952, 0.15497139918587202, -0.03105121252595851, 0.166962827514898, -0.08724332800656967, 0.12462689748013413, 0.12587522491198647, 0.01120745510395084, 0.13126514696485395, 0.0990018028801737, 0.17936845674885663, 0.1418260459962127, -0.0738078825838434, -0.015572620627398674, -0.36170371863376966, -0.1721527344025262, -0.18666760861914564, 0.16284951771056833, -0.13882651364246568, -0.17512712772976566, 0.3586679617516123, 0.06568238729672445, 0.25411598934474716, 0.12314841290424158, 0.22041777631902432, 0.12547199873657958, 0.00326534687761463, 0.1333658784259479, 0.09334415094005866, 0.13218173165907982, 0.010847666510636662, -0.1434305855661508, -0.05129342075695724, 0.10296165183247936] |
1,802.03054 | On the closest stable/unstable nonnegative matrix and related stability
radii | We consider the problem of computing the closest stable/unstable non-negative
matrix to a given real matrix. This problem is important in the study of linear
dynamical systems, numerical methods, etc. The distance between matrices is
measured in the Frobenius norm. The problem is addressed for two types of
stability: the Schur stability (the matrix is stable if its spectral radius is
smaller than one) and the Hurwitz stability (the matrix is stable if its
spectral abscissa is negative). We show that the closest unstable matrix can
always be explicitly found. For the closest stable matrix, we present an
iterative algorithm which converges to a local minimum with a linear rate. It
is shown that the total number of local minima can be exponential in the
dimension. Numerical results and the complexity estimates are presented.
| math.DS | we consider the problem of computing the closest stableunstable nonnegative matrix to a given real matrix this problem is important in the study of linear dynamical systems numerical methods etc the distance between matrices is measured in the frobenius norm the problem is addressed for two types of stability the schur stability the matrix is stable if its spectral radius is smaller than one and the hurwitz stability the matrix is stable if its spectral abscissa is negative we show that the closest unstable matrix can always be explicitly found for the closest stable matrix we present an iterative algorithm which converges to a local minimum with a linear rate it is shown that the total number of local minima can be exponential in the dimension numerical results and the complexity estimates are presented | [['we', 'consider', 'the', 'problem', 'of', 'computing', 'the', 'closest', 'stableunstable', 'nonnegative', 'matrix', 'to', 'a', 'given', 'real', 'matrix', 'this', 'problem', 'is', 'important', 'in', 'the', 'study', 'of', 'linear', 'dynamical', 'systems', 'numerical', 'methods', 'etc', 'the', 'distance', 'between', 'matrices', 'is', 'measured', 'in', 'the', 'frobenius', 'norm', 'the', 'problem', 'is', 'addressed', 'for', 'two', 'types', 'of', 'stability', 'the', 'schur', 'stability', 'the', 'matrix', 'is', 'stable', 'if', 'its', 'spectral', 'radius', 'is', 'smaller', 'than', 'one', 'and', 'the', 'hurwitz', 'stability', 'the', 'matrix', 'is', 'stable', 'if', 'its', 'spectral', 'abscissa', 'is', 'negative', 'we', 'show', 'that', 'the', 'closest', 'unstable', 'matrix', 'can', 'always', 'be', 'explicitly', 'found', 'for', 'the', 'closest', 'stable', 'matrix', 'we', 'present', 'an', 'iterative', 'algorithm', 'which', 'converges', 'to', 'a', 'local', 'minimum', 'with', 'a', 'linear', 'rate', 'it', 'is', 'shown', 'that', 'the', 'total', 'number', 'of', 'local', 'minima', 'can', 'be', 'exponential', 'in', 'the', 'dimension', 'numerical', 'results', 'and', 'the', 'complexity', 'estimates', 'are', 'presented']] | [-0.1425530055404029, 0.07135242436860025, -0.08691154750356792, 0.08464693698820087, -0.020959606050138375, -0.1276352236111676, -0.01098573118719314, 0.3566662990331733, -0.33276212824258344, -0.22266155367703247, 0.16016762216537217, -0.27069268901067883, -0.19612656069446854, 0.1597838436753781, -0.06627926681496536, 0.08395757626849852, 0.08019246358368824, 0.10482834732688184, -0.14585568958462508, -0.28016230511242773, 0.3174411143356962, 0.05515079994672047, 0.2254978439652486, 0.048197092378942936, 0.07084341254780319, -0.03176681900400418, 0.0015795621464946377, 0.028474046873039942, -0.09830882989985211, 0.11433642753226154, 0.24034131344741405, 0.1512140250754362, 0.29732751033143767, -0.36205197854050947, -0.14492690262172733, 0.20352834554166713, 0.13492363047049338, 0.06738663779887885, -0.027721775112084613, -0.20872769608343048, 0.17829541995627946, -0.11853825985871033, -0.1568591643347224, -0.04796490868650822, 0.04905891968302234, 0.015670025649953134, -0.31477752063812603, 0.08301583087808494, 0.02335069732590224, -0.007815322442564056, -0.06959323637854697, -0.14171276397224683, -0.013162307969447392, 0.1055601014931158, 0.0366659655101917, -0.0195232451347801, 0.0914609767010074, -0.05119448856262963, -0.06833168595322102, 0.3646893030095067, -0.0357412395751453, -0.23470551854541608, 0.1504516052082181, -0.12113092558931059, -0.07802196899984977, 0.14350098899023525, 0.12243536910486978, 0.16170478686551326, -0.08136785921376588, 0.12046419835298447, -0.09307961810446247, 0.18368042598881607, 0.03307291807314909, -0.007706078818874128, 0.14668953436802126, 0.13896093863573397, 0.17017841595920052, 0.1433898165549235, -0.04708973704072744, -0.10988202538521988, -0.2665292212961992, -0.14918112965238128, -0.24384381150159595, 0.03706447250181948, -0.14566790400079013, -0.17720471187768358, 0.4084585787269718, 0.08768722073717126, 0.22279750113722993, 0.07559455801479158, 0.2996507438330619, 0.18135221789368608, 0.0268626752962817, 0.10271146653649882, 0.2484154094900213, 0.1920444247410146, 0.03501306182649264, -0.2549960096297202, 0.06622163577477878, 0.14532304996513387] |
1,802.03055 | Return of the grand unified theory baryogenesis: Source of helical
hypermagnetic fields for the baryon asymmetry of the universe | It has been considered that baryogenesis models without a generation of
$B$-$L$ asymmetry such as the GUT baryogenesis do not work since the asymmetry
is washed out by the electroweak sphalerons. Here, we point out that helical
hypermagnetic fields can be generated through the chiral magnetic effect with a
chiral asymmetry generated in such baryogenesis models. The helical
hypermagnetic fields then produce baryon asymmetry mainly at the electroweak
symmetry breaking, which remains until today. Therefore, the baryogenesis
models without $B$-$L$ asymmetry can still be the origin of the present baryon
asymmetry. In particular, if it can produce chiral asymmetry mainly carried by
right-handed electrons of order of $10^{-3}$ in terms of the chemical potential
to temperature ratio, the resultant present-day baryon asymmetry can be
consistent with our Universe, although simple realizations of the GUT
baryogenesis are hard to satisfy the condition. We also argue the way to
overcome the difficulty in the GUT baryogenesis. The intergalactic magnetic
fields with $B_0\sim 10^{-16 \sim 17}$ G and $\lambda_0 \sim 10^{-2\sim3}$ pc
are the smoking gun of the baryogenesis scenario as discussed before.
| hep-ph astro-ph.CO hep-th | it has been considered that baryogenesis models without a generation of bl asymmetry such as the gut baryogenesis do not work since the asymmetry is washed out by the electroweak sphalerons here we point out that helical hypermagnetic fields can be generated through the chiral magnetic effect with a chiral asymmetry generated in such baryogenesis models the helical hypermagnetic fields then produce baryon asymmetry mainly at the electroweak symmetry breaking which remains until today therefore the baryogenesis models without bl asymmetry can still be the origin of the present baryon asymmetry in particular if it can produce chiral asymmetry mainly carried by righthanded electrons of order of 103 in terms of the chemical potential to temperature ratio the resultant presentday baryon asymmetry can be consistent with our universe although simple realizations of the gut baryogenesis are hard to satisfy the condition we also argue the way to overcome the difficulty in the gut baryogenesis the intergalactic magnetic fields with b_0sim 1016 sim 17 g and lambda_0 sim 102sim3 pc are the smoking gun of the baryogenesis scenario as discussed before | [['it', 'has', 'been', 'considered', 'that', 'baryogenesis', 'models', 'without', 'a', 'generation', 'of', 'bl', 'asymmetry', 'such', 'as', 'the', 'gut', 'baryogenesis', 'do', 'not', 'work', 'since', 'the', 'asymmetry', 'is', 'washed', 'out', 'by', 'the', 'electroweak', 'sphalerons', 'here', 'we', 'point', 'out', 'that', 'helical', 'hypermagnetic', 'fields', 'can', 'be', 'generated', 'through', 'the', 'chiral', 'magnetic', 'effect', 'with', 'a', 'chiral', 'asymmetry', 'generated', 'in', 'such', 'baryogenesis', 'models', 'the', 'helical', 'hypermagnetic', 'fields', 'then', 'produce', 'baryon', 'asymmetry', 'mainly', 'at', 'the', 'electroweak', 'symmetry', 'breaking', 'which', 'remains', 'until', 'today', 'therefore', 'the', 'baryogenesis', 'models', 'without', 'bl', 'asymmetry', 'can', 'still', 'be', 'the', 'origin', 'of', 'the', 'present', 'baryon', 'asymmetry', 'in', 'particular', 'if', 'it', 'can', 'produce', 'chiral', 'asymmetry', 'mainly', 'carried', 'by', 'righthanded', 'electrons', 'of', 'order', 'of', '103', 'in', 'terms', 'of', 'the', 'chemical', 'potential', 'to', 'temperature', 'ratio', 'the', 'resultant', 'presentday', 'baryon', 'asymmetry', 'can', 'be', 'consistent', 'with', 'our', 'universe', 'although', 'simple', 'realizations', 'of', 'the', 'gut', 'baryogenesis', 'are', 'hard', 'to', 'satisfy', 'the', 'condition', 'we', 'also', 'argue', 'the', 'way', 'to', 'overcome', 'the', 'difficulty', 'in', 'the', 'gut', 'baryogenesis', 'the', 'intergalactic', 'magnetic', 'fields', 'with', 'b_0sim', '1016', 'sim', '17', 'g', 'and', 'lambda_0', 'sim', '102sim3', 'pc', 'are', 'the', 'smoking', 'gun', 'of', 'the', 'baryogenesis', 'scenario', 'as', 'discussed', 'before']] | [-0.1260472034597145, 0.30783977570771837, -0.03972396459274369, 0.13780040177191458, -0.11891583085850964, -0.11199503833708983, 0.009460787144463571, 0.34100400236065825, -0.23309167538764342, -0.3277784266545536, 0.06404013935393295, -0.21418023133889758, -0.04126997521750671, 0.10752560800024667, 0.051849663093706914, -0.01750019872717185, -0.04792508322683126, -0.017071363006265803, 0.010488708251202739, -0.25100599807250057, 0.25908016939985684, 0.0627917532533324, 0.2528952703363777, 0.10383607816294502, 0.05501094230453291, -0.1425087167048962, 0.023750471976174657, -0.03355490510461217, -0.09240476263196964, -0.02082716721316862, 0.18884695724041678, 0.07391965026218007, 0.15008242313838538, -0.4410277852299493, -0.22755640499325022, 0.2281123825593451, 0.19380161935702883, 0.15081660290750773, -0.1395208785939941, -0.29799746150702405, 0.13394208509974473, -0.17906556119257844, -0.14028750528586642, -0.07998899652430132, -0.026148428393829633, -0.09492332503126737, -0.3229142393989686, 0.15452104151771176, -0.019326742134946683, 0.021420987843218463, 0.00350179505799819, -0.06504190821387915, -0.11217971088484388, -0.012380393664222522, 0.1609720436286431, 0.04675755325923336, 0.1776793580531538, -0.18015794940787114, -0.11307869352629231, 0.4480578066708322, -0.05580539020967238, -0.09002374808756666, 0.08763100195405536, -0.17817230078043136, -0.16599907246860546, 0.09666075585436014, 0.11574797746699365, 0.07794344044868007, -0.133040951955127, 0.1199500893327855, -0.028480689340484377, 0.1417315995215644, 0.07620898838800133, 0.008205246898298824, 0.3551181684347005, 0.1471372578259266, 0.02738359960462045, 0.04517643114787822, -0.05700187728735072, -0.03334363135795353, -0.402452011733165, -0.06575549912981055, -0.14403321282930318, 0.0848453046309966, -0.06057223963787631, -0.09630951115682035, 0.4174753750710847, 0.19884654120984357, 0.23815259327019392, -0.04162639813880077, 0.3170730825747733, 0.09445516046789584, 0.13007558847116774, 0.010409727874706244, 0.3101824051154226, 0.15819190629607055, 0.1314268102193012, -0.24232834784506543, 0.047846186513278904, 0.034297378389060745] |
1,802.03056 | Oversampled Adaptive Sensing | We develop a Bayesian framework for sensing which adapts the sensing time
and/or basis functions to the instantaneous sensing quality measured in terms
of the expected posterior mean-squared error. For sparse Gaussian sources a
significant reduction in average sensing time and/or mean-squared error is
achieved in comparison to non-adaptive sensing. For compression ratio 3, a
sparse 10% Gaussian source and equal average sensing times, the proposed method
gains about 2 dB over the performance bound of optimum compressive sensing,
about 3 dB over non-adaptive 3-fold oversampled orthogonal sensing and about 6
to 7 dB to LASSO-based recovery schemes while enjoying polynomial time
complexity.
We utilize that in the presence of Gaussian noise the mean-squared error
conditioned on the current observation is proportional to the derivative of the
conditional mean estimate with respect to this observation.
| cs.IT math.IT | we develop a bayesian framework for sensing which adapts the sensing time andor basis functions to the instantaneous sensing quality measured in terms of the expected posterior meansquared error for sparse gaussian sources a significant reduction in average sensing time andor meansquared error is achieved in comparison to nonadaptive sensing for compression ratio 3 a sparse 10 gaussian source and equal average sensing times the proposed method gains about 2 db over the performance bound of optimum compressive sensing about 3 db over nonadaptive 3fold oversampled orthogonal sensing and about 6 to 7 db to lassobased recovery schemes while enjoying polynomial time complexity we utilize that in the presence of gaussian noise the meansquared error conditioned on the current observation is proportional to the derivative of the conditional mean estimate with respect to this observation | [['we', 'develop', 'a', 'bayesian', 'framework', 'for', 'sensing', 'which', 'adapts', 'the', 'sensing', 'time', 'andor', 'basis', 'functions', 'to', 'the', 'instantaneous', 'sensing', 'quality', 'measured', 'in', 'terms', 'of', 'the', 'expected', 'posterior', 'meansquared', 'error', 'for', 'sparse', 'gaussian', 'sources', 'a', 'significant', 'reduction', 'in', 'average', 'sensing', 'time', 'andor', 'meansquared', 'error', 'is', 'achieved', 'in', 'comparison', 'to', 'nonadaptive', 'sensing', 'for', 'compression', 'ratio', '3', 'a', 'sparse', '10', 'gaussian', 'source', 'and', 'equal', 'average', 'sensing', 'times', 'the', 'proposed', 'method', 'gains', 'about', '2', 'db', 'over', 'the', 'performance', 'bound', 'of', 'optimum', 'compressive', 'sensing', 'about', '3', 'db', 'over', 'nonadaptive', '3fold', 'oversampled', 'orthogonal', 'sensing', 'and', 'about', '6', 'to', '7', 'db', 'to', 'lassobased', 'recovery', 'schemes', 'while', 'enjoying', 'polynomial', 'time', 'complexity', 'we', 'utilize', 'that', 'in', 'the', 'presence', 'of', 'gaussian', 'noise', 'the', 'meansquared', 'error', 'conditioned', 'on', 'the', 'current', 'observation', 'is', 'proportional', 'to', 'the', 'derivative', 'of', 'the', 'conditional', 'mean', 'estimate', 'with', 'respect', 'to', 'this', 'observation']] | [-0.09387801892158609, 0.051159029067666444, -0.037339636613614856, 0.013054275172072704, 0.012499840999091114, -0.1643216403718624, 0.10702912666278684, 0.42381212835510573, -0.2871528846108251, -0.32128715282866593, 0.1463610662854518, -0.203357531061327, -0.1505937448293143, 0.15546459368843998, -0.16885143193519778, 0.11950013744127419, 0.03169781346977861, 0.08498037793087186, -0.13950904285431737, -0.293116989021224, 0.1571861628356769, 0.14313225936903445, 0.35273335908919023, -0.05645302914307211, 0.14489491550872724, 0.043586071620747034, -0.05471665980639281, -0.03842883646074269, -0.09542204873076925, 0.14417718287074455, 0.26138620155139103, 0.14258690799829815, 0.3133784533926734, -0.3616886196933963, -0.22157545444314128, 0.14142457162961364, 0.14910751380785195, 0.0709538729387094, -0.026063177968306397, -0.26718356648322056, 0.1367117066082924, -0.1498429961088631, -0.024547240417450666, -0.029502937509850773, -0.028024193606580847, -0.009106049293876385, -0.38120063886529315, 0.15264013697160408, 0.025034795211697065, 0.06537228317724333, -0.07877726433453737, -0.19395459861046185, 0.120623646542016, 0.09305677904092051, 0.012682485521805507, 0.05418998359668034, 0.1755265559863161, -0.12002743287529383, -0.12462062619074628, 0.32353818577334836, -0.10095266135995863, -0.21297502422498332, 0.12249272062132756, -0.13410178719571345, -0.04685527716107942, 0.2245769318131082, 0.22957031098366887, 0.04880131067087253, -0.09849113430137987, 0.029082826782811294, 0.0325176800834015, 0.225757746660599, 0.118301839367659, 0.12115585491820066, 0.05576710370800424, 0.13772234210175358, 0.16715102375105576, 0.09854966184314064, -0.18277672800856332, -0.07902396275765367, -0.25325081509848435, -0.11887609317027792, -0.23145120458384216, 0.06255407851465322, -0.19028723844201995, -0.10336277071274472, 0.3710803633969691, 0.16294146159456835, 0.15112632846252785, 0.15495936668529692, 0.3783236915866534, 0.10341960707058509, 0.017601949045503582, 0.1128819891527571, 0.22874814879701094, 0.1760077454149723, 0.061823895742633826, -0.19291730442394814, 0.06703379214913757, -0.013332994789299038] |
1,802.03057 | System G Distributed Graph Database | Motivated by the need to extract knowledge and value from interconnected
data, graph analytics on big data is a very active area of research in both
industry and academia. To support graph analytics efficiently a large number of
in memory graph libraries, graph processing systems and graph databases have
emerged. Projects in each of these categories focus on particular aspects such
as static versus dynamic graphs, off line versus on line processing, small
versus large graphs, etc. While there has been much advance in graph processing
in the past decades, there is still a need for a fast graph processing, using a
cluster of machines with distributed storage. In this paper, we discuss a novel
distributed graph database called System G designed for efficient graph data
storage and processing on modern computing architectures. In particular we
describe a single node graph database and a runtime and communication layer
that allows us to compose a distributed graph database from multiple single
node instances. From various industry requirements, we find that fast
insertions and large volume concurrent queries are critical parts of the graph
databases and we optimize our database for such features. We experimentally
show the efficiency of System G for storing data and processing graph queries
on state-of-the-art platforms.
| cs.DB | motivated by the need to extract knowledge and value from interconnected data graph analytics on big data is a very active area of research in both industry and academia to support graph analytics efficiently a large number of in memory graph libraries graph processing systems and graph databases have emerged projects in each of these categories focus on particular aspects such as static versus dynamic graphs off line versus on line processing small versus large graphs etc while there has been much advance in graph processing in the past decades there is still a need for a fast graph processing using a cluster of machines with distributed storage in this paper we discuss a novel distributed graph database called system g designed for efficient graph data storage and processing on modern computing architectures in particular we describe a single node graph database and a runtime and communication layer that allows us to compose a distributed graph database from multiple single node instances from various industry requirements we find that fast insertions and large volume concurrent queries are critical parts of the graph databases and we optimize our database for such features we experimentally show the efficiency of system g for storing data and processing graph queries on stateoftheart platforms | [['motivated', 'by', 'the', 'need', 'to', 'extract', 'knowledge', 'and', 'value', 'from', 'interconnected', 'data', 'graph', 'analytics', 'on', 'big', 'data', 'is', 'a', 'very', 'active', 'area', 'of', 'research', 'in', 'both', 'industry', 'and', 'academia', 'to', 'support', 'graph', 'analytics', 'efficiently', 'a', 'large', 'number', 'of', 'in', 'memory', 'graph', 'libraries', 'graph', 'processing', 'systems', 'and', 'graph', 'databases', 'have', 'emerged', 'projects', 'in', 'each', 'of', 'these', 'categories', 'focus', 'on', 'particular', 'aspects', 'such', 'as', 'static', 'versus', 'dynamic', 'graphs', 'off', 'line', 'versus', 'on', 'line', 'processing', 'small', 'versus', 'large', 'graphs', 'etc', 'while', 'there', 'has', 'been', 'much', 'advance', 'in', 'graph', 'processing', 'in', 'the', 'past', 'decades', 'there', 'is', 'still', 'a', 'need', 'for', 'a', 'fast', 'graph', 'processing', 'using', 'a', 'cluster', 'of', 'machines', 'with', 'distributed', 'storage', 'in', 'this', 'paper', 'we', 'discuss', 'a', 'novel', 'distributed', 'graph', 'database', 'called', 'system', 'g', 'designed', 'for', 'efficient', 'graph', 'data', 'storage', 'and', 'processing', 'on', 'modern', 'computing', 'architectures', 'in', 'particular', 'we', 'describe', 'a', 'single', 'node', 'graph', 'database', 'and', 'a', 'runtime', 'and', 'communication', 'layer', 'that', 'allows', 'us', 'to', 'compose', 'a', 'distributed', 'graph', 'database', 'from', 'multiple', 'single', 'node', 'instances', 'from', 'various', 'industry', 'requirements', 'we', 'find', 'that', 'fast', 'insertions', 'and', 'large', 'volume', 'concurrent', 'queries', 'are', 'critical', 'parts', 'of', 'the', 'graph', 'databases', 'and', 'we', 'optimize', 'our', 'database', 'for', 'such', 'features', 'we', 'experimentally', 'show', 'the', 'efficiency', 'of', 'system', 'g', 'for', 'storing', 'data', 'and', 'processing', 'graph', 'queries', 'on', 'stateoftheart', 'platforms']] | [-0.1478709348006192, 0.013893143817532861, -0.036560654301534996, 0.02147405158614731, -0.121321516557102, -0.15327261815417967, 0.07736270209945935, 0.4425316841328187, -0.29566893681135187, -0.38014208361880775, 0.13193618553037795, -0.32248554515445427, -0.119968299405275, 0.20217275867265377, -0.11356558334572535, 0.10263510268965834, 0.1478055554852068, 0.06949466126515938, 0.017067055317069712, -0.2219318138664136, 0.2864333479537107, 0.006893879760716235, 0.307971913527929, 0.04379168854643141, 0.05005688818422832, 0.025954428772802986, -0.055485844859434516, 0.042111007937867394, -0.076991451062325, 0.16668133804286078, 0.33805739837498117, 0.2490004520678367, 0.2907061810008112, -0.47514415541262717, -0.19157146664256114, 0.13641659993651595, 0.1420152155954266, 0.07754773694607452, -0.08050841605569276, -0.24871702518082406, 0.11165291770989673, -0.16356074411876537, 0.030754322518091026, -0.10473293101450687, 0.1058949921798166, 0.013498822543224204, -0.24428065856874132, -0.059031944991530555, 0.012719063264313355, 0.09116642229909604, 0.03597716380854284, -0.10264359846038289, 0.03645616614328849, 0.16189739109868068, -0.05434917288934857, 0.04196732306772727, 0.14906837771152054, -0.14331149651098588, -0.16888210416379335, 0.38420436315630613, -0.00897308514714152, -0.11221967087211934, 0.16103619137114922, -0.052311059392756966, -0.23720564199032254, 0.07170797772727835, 0.25986454515934043, 0.08276437370732659, -0.16458772502518726, 0.10605248106553322, -0.010778320483132556, 0.19833012589177731, 0.054935992659742465, 0.03274665386571981, 0.1976814764021544, 0.24369121799646526, 0.08170695748524384, 0.17589228933773998, -0.05146815858304536, -0.07764252049750403, -0.19317304395817658, -0.1308470332179593, -0.23042550448854074, -0.035327590475054946, -0.15292534757004192, -0.19187055598792918, 0.38554215537268294, 0.1724513475872291, 0.1804277046191457, 0.06000330942041245, 0.33890660002417683, 0.01003144397823648, 0.15682235217105117, 0.19756533495154963, 0.09087571841508649, 0.05786419228169372, 0.1810722678496489, -0.12681989870190122, 0.0655140043826747, -0.015577842282024369] |
1,802.03058 | Doppler Spread Estimation in MIMO Frequency-selective Fading Channels | One of the main challenges in high-speed mobile communications is the
presence of large Doppler spreads. Thus, accurate estimation of maximum Doppler
spread (MDS) plays an important role in improving the performance of the
communication link. In this paper, we derive the data-aided (DA) and
non-data-aided (NDA) Cramer-Rao lower bounds (CRLBs) and maximum likelihood
estimators (MLEs) for the MDS in multiple-input multiple-output (MIMO)
frequency-selective fading channel. Moreover, a lowcomplexity NDA-moment-based
estimator (MBE) is proposed. The proposed NDA-MBE relies on the second- and
fourth-order moments of the received signal, which are employed to estimate the
normalized squared autocorrelation function of the fading channel. Then, the
problem of MDS estimation is formulated as a non-linear regression problem, and
the least-squares curvefitting optimization technique is applied to determine
the estimate of the MDS. This is the first time in the literature when DAand
NDA-MDS estimation is investigated for MIMO frequency-selective fading channel.
Simulation results show that there is no significant performance gap between
the derived NDA-MLE and NDA-CRLB even when the observation window is relatively
small. Furthermore, the significant reduced-complexity in the NDA-MBE leads to
low root-mean-square error (NRMSE) over a wide range of MDSs when the
observation window is selected large enough.
| eess.SP cs.IT math.IT | one of the main challenges in highspeed mobile communications is the presence of large doppler spreads thus accurate estimation of maximum doppler spread mds plays an important role in improving the performance of the communication link in this paper we derive the dataaided da and nondataaided nda cramerrao lower bounds crlbs and maximum likelihood estimators mles for the mds in multipleinput multipleoutput mimo frequencyselective fading channel moreover a lowcomplexity ndamomentbased estimator mbe is proposed the proposed ndambe relies on the second and fourthorder moments of the received signal which are employed to estimate the normalized squared autocorrelation function of the fading channel then the problem of mds estimation is formulated as a nonlinear regression problem and the leastsquares curvefitting optimization technique is applied to determine the estimate of the mds this is the first time in the literature when daand ndamds estimation is investigated for mimo frequencyselective fading channel simulation results show that there is no significant performance gap between the derived ndamle and ndacrlb even when the observation window is relatively small furthermore the significant reducedcomplexity in the ndambe leads to low rootmeansquare error nrmse over a wide range of mdss when the observation window is selected large enough | [['one', 'of', 'the', 'main', 'challenges', 'in', 'highspeed', 'mobile', 'communications', 'is', 'the', 'presence', 'of', 'large', 'doppler', 'spreads', 'thus', 'accurate', 'estimation', 'of', 'maximum', 'doppler', 'spread', 'mds', 'plays', 'an', 'important', 'role', 'in', 'improving', 'the', 'performance', 'of', 'the', 'communication', 'link', 'in', 'this', 'paper', 'we', 'derive', 'the', 'dataaided', 'da', 'and', 'nondataaided', 'nda', 'cramerrao', 'lower', 'bounds', 'crlbs', 'and', 'maximum', 'likelihood', 'estimators', 'mles', 'for', 'the', 'mds', 'in', 'multipleinput', 'multipleoutput', 'mimo', 'frequencyselective', 'fading', 'channel', 'moreover', 'a', 'lowcomplexity', 'ndamomentbased', 'estimator', 'mbe', 'is', 'proposed', 'the', 'proposed', 'ndambe', 'relies', 'on', 'the', 'second', 'and', 'fourthorder', 'moments', 'of', 'the', 'received', 'signal', 'which', 'are', 'employed', 'to', 'estimate', 'the', 'normalized', 'squared', 'autocorrelation', 'function', 'of', 'the', 'fading', 'channel', 'then', 'the', 'problem', 'of', 'mds', 'estimation', 'is', 'formulated', 'as', 'a', 'nonlinear', 'regression', 'problem', 'and', 'the', 'leastsquares', 'curvefitting', 'optimization', 'technique', 'is', 'applied', 'to', 'determine', 'the', 'estimate', 'of', 'the', 'mds', 'this', 'is', 'the', 'first', 'time', 'in', 'the', 'literature', 'when', 'daand', 'ndamds', 'estimation', 'is', 'investigated', 'for', 'mimo', 'frequencyselective', 'fading', 'channel', 'simulation', 'results', 'show', 'that', 'there', 'is', 'no', 'significant', 'performance', 'gap', 'between', 'the', 'derived', 'ndamle', 'and', 'ndacrlb', 'even', 'when', 'the', 'observation', 'window', 'is', 'relatively', 'small', 'furthermore', 'the', 'significant', 'reducedcomplexity', 'in', 'the', 'ndambe', 'leads', 'to', 'low', 'rootmeansquare', 'error', 'nrmse', 'over', 'a', 'wide', 'range', 'of', 'mdss', 'when', 'the', 'observation', 'window', 'is', 'selected', 'large', 'enough']] | [-0.19629624780023788, 0.03083634410794508, -0.05549897549558103, 0.06892289785991562, -0.03839097739260045, -0.19177759191687244, 0.04733273408790674, 0.3695652832975611, -0.2510439451347187, -0.2874231571717661, 0.1494360857370546, -0.2394597827471368, -0.17711820219911228, 0.19855744329310104, -0.11822931426504887, 0.11356611239332995, 0.08074473961343304, 0.0059357151917514865, -0.10040448679603212, -0.26422705548607933, 0.2622680962333031, 0.12910838008597686, 0.34481997730046354, 0.029676124892665624, 0.10544064513605493, 0.05119194853037518, -0.04329754807383131, -0.04869109597732675, -0.1372179418425344, 0.07654445546852917, 0.30495143717473344, 0.16056960186477112, 0.30244373259438595, -0.2995440889912334, -0.24498509652816106, 0.11889047501307136, 0.1912235376724269, 0.07566815597147541, -0.05373724048216513, -0.24797542888786972, 0.11464753537559448, -0.18975878969544227, -0.015856607351452112, 0.035846112795425045, -0.02339709138044113, 0.01436969328797157, -0.37130045972600423, 0.08989625968343043, 0.02292363689199013, 0.03909443176491427, -0.03494829214974234, -0.17413200193852033, 0.0645188525176747, 0.13647218628462593, 0.05807280976088824, 0.008751722360319347, 0.053046258883623146, -0.11096739974699268, -0.03804015178580822, 0.33839365617984934, -0.07340256259125208, -0.2106763590561525, 0.10680062692447136, -0.12049255477158362, -0.06914834620749549, 0.17346323083198287, 0.26183673564267435, 0.08291199734106351, -0.1670909606648212, 0.04381995804476976, -0.029631586033619282, 0.17082816316779953, 0.03797964252763153, 0.08986197382518105, 0.12000600415296428, 0.1920710979307003, 0.141697196309199, 0.15002136854720277, -0.2139987434071146, -0.09897632526904537, -0.2418322987755558, -0.13381693263559594, -0.2426159763949986, -0.02490104740085032, -0.14527154474727594, -0.14221543269750658, 0.3447214974563356, 0.16473743114005196, 0.11355903989772935, 0.1256990267785382, 0.36301485181742693, 0.1548331113219621, 0.05047636817362029, 0.14020368361174868, 0.26880886114004593, 0.19935787369079713, 0.07698015464105465, -0.24143982650799595, 0.09377472376802404, -0.024390325446038898] |
1,802.03059 | On the structure of hypersurfaces in $\mathbb{H}^n\times \mathbb{R}$
with finite strong total curvature | We prove that if $X:M^n\to\mathbb{H}^n\times \mathbb{R}$, $n\geq 3$, is a an
orientable, complete immersion with finite strong total curvature, then $X$ is
proper and $M$ is diffeomorphic to a compact manifold $\bar M$ minus a finite
number of points $q_1, \dots q_k$. Adding some extra hypothesis, including
$H_r=0,$ where $H_r$ is a higher order mean curvature, we obtain more
information about the geometry of a neighbourhood of each puncture.
The reader will also find in this paper a classification result for the
hypersurfaces of $\mathbb{H}^n\times \mathbb{R}$ which satisfy $H_r=0$ and are
invariant by hyperbolic translations and a maximum principle in a half space
for these hypersurfaces.
| math.DG | we prove that if xmntomathbbhntimes mathbbr ngeq 3 is a an orientable complete immersion with finite strong total curvature then x is proper and m is diffeomorphic to a compact manifold bar m minus a finite number of points q_1 dots q_k adding some extra hypothesis including h_r0 where h_r is a higher order mean curvature we obtain more information about the geometry of a neighbourhood of each puncture the reader will also find in this paper a classification result for the hypersurfaces of mathbbhntimes mathbbr which satisfy h_r0 and are invariant by hyperbolic translations and a maximum principle in a half space for these hypersurfaces | [['we', 'prove', 'that', 'if', 'xmntomathbbhntimes', 'mathbbr', 'ngeq', '3', 'is', 'a', 'an', 'orientable', 'complete', 'immersion', 'with', 'finite', 'strong', 'total', 'curvature', 'then', 'x', 'is', 'proper', 'and', 'm', 'is', 'diffeomorphic', 'to', 'a', 'compact', 'manifold', 'bar', 'm', 'minus', 'a', 'finite', 'number', 'of', 'points', 'q_1', 'dots', 'q_k', 'adding', 'some', 'extra', 'hypothesis', 'including', 'h_r0', 'where', 'h_r', 'is', 'a', 'higher', 'order', 'mean', 'curvature', 'we', 'obtain', 'more', 'information', 'about', 'the', 'geometry', 'of', 'a', 'neighbourhood', 'of', 'each', 'puncture', 'the', 'reader', 'will', 'also', 'find', 'in', 'this', 'paper', 'a', 'classification', 'result', 'for', 'the', 'hypersurfaces', 'of', 'mathbbhntimes', 'mathbbr', 'which', 'satisfy', 'h_r0', 'and', 'are', 'invariant', 'by', 'hyperbolic', 'translations', 'and', 'a', 'maximum', 'principle', 'in', 'a', 'half', 'space', 'for', 'these', 'hypersurfaces']] | [-0.1980147617857992, 0.12970575634958334, -0.07679205302681241, 0.061231457596156925, -0.10402901566010855, -0.14646406701899, -0.011532502589259475, 0.3575028457457111, -0.2259407337001037, -0.23696586158947044, 0.11740842687099108, -0.3083975203246588, -0.10975237981017147, 0.14155760835412712, -0.13563629516533443, -0.014844780190226932, 0.05505028374138333, 0.1292224731296301, -0.10980560914142101, -0.2717963018310478, 0.35357479359067623, -0.08956371831397215, 0.16131362127406257, 0.05950064840525599, 0.1475290886969084, -0.020138872215258223, 0.03067666071555799, 0.056085195170903934, -0.1938746794551705, 0.10712647499694002, 0.20341363961675338, 0.08273658734258442, 0.26069672076430705, -0.34481745048293044, -0.19626704300975517, 0.20188154297925176, 0.13566016443849852, 0.0033606870421430185, 0.00016023770703690215, -0.26048629299870557, 0.1609758897773212, -0.09384001880618079, -0.16713022129787575, -0.029842921563734612, 0.08593148640135215, -0.018403474684982074, -0.2842842776749638, 0.01389867755379306, 0.1293249943027539, 0.09189449274424641, -0.03085011963821238, -0.10628218031266616, -0.08593036012191857, 0.07770489179750993, 0.004444792338957389, 0.14072281159349673, 0.07027863871217484, -0.04118785413558639, -0.059780656098432486, 0.3627272515956845, -0.08207536377345345, -0.2920480423385189, 0.07807576833292842, -0.184770020882466, -0.1401830089145473, 0.13732463116979315, 0.13234596306546814, 0.16973665867089516, -0.0747640963754661, 0.15534550376247525, -0.07894286000214162, 0.1343610426233638, 0.11262101668953187, -0.013866904675073568, 0.16003473140216165, 0.09406069107353687, 0.182471342511209, 0.09065832147552144, -0.053983441691490865, -0.0049553828646561925, -0.4061683524577391, -0.23396533526302804, -0.14733478174367476, 0.17698656638995522, -0.15346581722523772, -0.14112391055872042, 0.3246519174160702, 0.010130173646445785, 0.21606534358025306, 0.12040316523607111, 0.23880897980360757, 0.052487659516988236, 0.03206162227406388, 0.12495113281488773, 0.11021130223054483, 0.15626586803589904, -0.002694611060654833, -0.11805673528551346, -0.06486662107386759, 0.11057163634381834] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.