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.0456 | Massive, wide binaries as tracers of massive star formation | Massive stars can be found in wide (hundreds to thousands AU) binaries with
other massive stars. We use $N$-body simulations to show that any bound cluster
should always have approximately one massive wide binary: one will probably
form if none are present initially; and probably only one will survive if more
than one are present initially. Therefore any region that contains many massive
wide binaries must have been composed of many individual subregions.
Observations of Cyg OB2 show that the massive wide binary fraction is at least
a half (38/74) which suggests that Cyg OB2 had at least 30 distinct massive
star formation sites. This is further evidence that Cyg OB2 has always been a
large, low-density association. That Cyg OB2 has a normal high-mass IMF for its
total mass suggests that however massive stars form they 'randomly sample' the
IMF (as the massive stars did not 'know' about each other).
| astro-ph.GA astro-ph.SR | massive stars can be found in wide hundreds to thousands au binaries with other massive stars we use nbody simulations to show that any bound cluster should always have approximately one massive wide binary one will probably form if none are present initially and probably only one will survive if more than one are present initially therefore any region that contains many massive wide binaries must have been composed of many individual subregions observations of cyg ob2 show that the massive wide binary fraction is at least a half 3874 which suggests that cyg ob2 had at least 30 distinct massive star formation sites this is further evidence that cyg ob2 has always been a large lowdensity association that cyg ob2 has a normal highmass imf for its total mass suggests that however massive stars form they randomly sample the imf as the massive stars did not know about each other | [['massive', 'stars', 'can', 'be', 'found', 'in', 'wide', 'hundreds', 'to', 'thousands', 'au', 'binaries', 'with', 'other', 'massive', 'stars', 'we', 'use', 'nbody', 'simulations', 'to', 'show', 'that', 'any', 'bound', 'cluster', 'should', 'always', 'have', 'approximately', 'one', 'massive', 'wide', 'binary', 'one', 'will', 'probably', 'form', 'if', 'none', 'are', 'present', 'initially', 'and', 'probably', 'only', 'one', 'will', 'survive', 'if', 'more', 'than', 'one', 'are', 'present', 'initially', 'therefore', 'any', 'region', 'that', 'contains', 'many', 'massive', 'wide', 'binaries', 'must', 'have', 'been', 'composed', 'of', 'many', 'individual', 'subregions', 'observations', 'of', 'cyg', 'ob2', 'show', 'that', 'the', 'massive', 'wide', 'binary', 'fraction', 'is', 'at', 'least', 'a', 'half', '3874', 'which', 'suggests', 'that', 'cyg', 'ob2', 'had', 'at', 'least', '30', 'distinct', 'massive', 'star', 'formation', 'sites', 'this', 'is', 'further', 'evidence', 'that', 'cyg', 'ob2', 'has', 'always', 'been', 'a', 'large', 'lowdensity', 'association', 'that', 'cyg', 'ob2', 'has', 'a', 'normal', 'highmass', 'imf', 'for', 'its', 'total', 'mass', 'suggests', 'that', 'however', 'massive', 'stars', 'form', 'they', 'randomly', 'sample', 'the', 'imf', 'as', 'the', 'massive', 'stars', 'did', 'not', 'know', 'about', 'each', 'other']] | [-0.11198773163961345, 0.17574342533703954, -0.05172003385617046, 0.08620411199933868, -0.13129236411599332, -0.16074845599417656, 0.03225459394951826, 0.4039169020753428, -0.12694214030002424, -0.3549336559379732, 0.06678664483151565, -0.3088675732446822, -0.07343777692229148, 0.18376805836223806, -0.031623709964024714, -0.0732647996609383, 0.21108695697841168, 0.06273043685629717, -0.03756269781976716, -0.34657237509154526, 0.3018246864813645, 0.010152136839136777, 0.0893916593701116, -0.059109954437894734, 0.02403253142333386, -0.09176350399444731, 0.020093586142421606, -0.03877963502783427, -0.06714917050183263, -0.005355583241040547, 0.2590009778189097, 0.19636842954768152, 0.32395332500289215, -0.3212880442434647, -0.26616527192565975, 0.11009380585877904, 0.29277977105600156, 0.04285690206833899, -0.08304911635444878, -0.17216144591748764, 0.18975849075023923, -0.2400752203539014, -0.17379650202832672, 0.03773427766975978, 0.0857131212043101, 0.012349155999023146, -0.20965680927469932, 0.09270243389556641, -0.008181321050737374, 0.02743902848416705, -0.09864410203927819, -0.15353156063730353, -0.06530461726673675, 0.0714176225249304, 0.0324129617884015, 0.1245096193893276, 0.1322131854864007, -0.10072714196720826, -0.028320389536104554, 0.3855608188029107, -0.0011811387245828557, -0.06693910019755955, 0.32515531807323755, -0.290518014549913, -0.26821653077391205, 0.16991770408110113, 0.14045936283223726, 0.16541124625896284, -0.2137737192139523, -0.022510628033636, -0.08500398668947796, 0.269199635111881, 0.061685938304459786, 0.08882111859113126, 0.3875940776867977, 0.09604517488882242, 0.007957627135637333, 0.09423674670794349, -0.2011673320886611, -0.10703129015110482, -0.16113553687217738, -0.10953050987087252, -0.12308350754655059, 0.10229060906056849, -0.1290419220935749, -0.13403450245413903, 0.24454160370487746, 0.06895617578820085, 0.14901231223137568, 0.00011076746795277129, 0.2544285762632599, 0.08213925154552801, 0.19088480588579118, 0.2158687184533931, 0.3184769534080332, 0.12225985880447737, 0.06020442983798609, -0.13380173050076855, 0.0938273578256196, -0.06219503272630102] |
1,802.04561 | Non-Maxwellian fast particle effects in gyrokinetic GENE simulations | Fast ions have recently been found to significantly impact and partially
suppress plasma turbulence both in experimental and numerical studies in a
number of scenarios. Understanding the underlying physics and identifying the
range of their beneficial effect is an essential task for future fusion
reactors, where highly energetic ions are generated through fusion reactions
and external heating schemes. However, in many of the gyrokinetic codes fast
ions are, for simplicity, treated as equivalent-Maxwellian-distributed particle
species, although it is well known that to rigorously model highly
non-thermalised particles, a non-Maxwellian background distribution function is
needed. To study the impact of this assumption, the gyrokinetic code GENE has
recently been extended to support arbitrary background distribution functions
which might be either analytic, e.g. slowing down and bi-Maxwellian, or
obtained from numerical fast ion models. A particular JET plasma with strong
fast-ion related turbulence suppression is revised with these new code
capabilities both with linear and nonlinear gyrokinetic simulations. It appears
that the fast ion stabilization tends to be less strong but still substantial
with more realistic distributions, and this improves the quantitative power
balance agreement with experiments.
| physics.plasm-ph | fast ions have recently been found to significantly impact and partially suppress plasma turbulence both in experimental and numerical studies in a number of scenarios understanding the underlying physics and identifying the range of their beneficial effect is an essential task for future fusion reactors where highly energetic ions are generated through fusion reactions and external heating schemes however in many of the gyrokinetic codes fast ions are for simplicity treated as equivalentmaxwelliandistributed particle species although it is well known that to rigorously model highly nonthermalised particles a nonmaxwellian background distribution function is needed to study the impact of this assumption the gyrokinetic code gene has recently been extended to support arbitrary background distribution functions which might be either analytic eg slowing down and bimaxwellian or obtained from numerical fast ion models a particular jet plasma with strong fastion related turbulence suppression is revised with these new code capabilities both with linear and nonlinear gyrokinetic simulations it appears that the fast ion stabilization tends to be less strong but still substantial with more realistic distributions and this improves the quantitative power balance agreement with experiments | [['fast', 'ions', 'have', 'recently', 'been', 'found', 'to', 'significantly', 'impact', 'and', 'partially', 'suppress', 'plasma', 'turbulence', 'both', 'in', 'experimental', 'and', 'numerical', 'studies', 'in', 'a', 'number', 'of', 'scenarios', 'understanding', 'the', 'underlying', 'physics', 'and', 'identifying', 'the', 'range', 'of', 'their', 'beneficial', 'effect', 'is', 'an', 'essential', 'task', 'for', 'future', 'fusion', 'reactors', 'where', 'highly', 'energetic', 'ions', 'are', 'generated', 'through', 'fusion', 'reactions', 'and', 'external', 'heating', 'schemes', 'however', 'in', 'many', 'of', 'the', 'gyrokinetic', 'codes', 'fast', 'ions', 'are', 'for', 'simplicity', 'treated', 'as', 'equivalentmaxwelliandistributed', 'particle', 'species', 'although', 'it', 'is', 'well', 'known', 'that', 'to', 'rigorously', 'model', 'highly', 'nonthermalised', 'particles', 'a', 'nonmaxwellian', 'background', 'distribution', 'function', 'is', 'needed', 'to', 'study', 'the', 'impact', 'of', 'this', 'assumption', 'the', 'gyrokinetic', 'code', 'gene', 'has', 'recently', 'been', 'extended', 'to', 'support', 'arbitrary', 'background', 'distribution', 'functions', 'which', 'might', 'be', 'either', 'analytic', 'eg', 'slowing', 'down', 'and', 'bimaxwellian', 'or', 'obtained', 'from', 'numerical', 'fast', 'ion', 'models', 'a', 'particular', 'jet', 'plasma', 'with', 'strong', 'fastion', 'related', 'turbulence', 'suppression', 'is', 'revised', 'with', 'these', 'new', 'code', 'capabilities', 'both', 'with', 'linear', 'and', 'nonlinear', 'gyrokinetic', 'simulations', 'it', 'appears', 'that', 'the', 'fast', 'ion', 'stabilization', 'tends', 'to', 'be', 'less', 'strong', 'but', 'still', 'substantial', 'with', 'more', 'realistic', 'distributions', 'and', 'this', 'improves', 'the', 'quantitative', 'power', 'balance', 'agreement', 'with', 'experiments']] | [-0.059289412598920295, 0.17406302632875653, -0.04318452718586702, 0.1070056171308312, -0.04557779633551431, -0.1608920755527873, -0.031681022657405425, 0.3857282892466806, -0.24338245893443894, -0.31481388968835666, 0.07034849962814327, -0.2536135367168438, -0.06944432917795063, 0.22562595836517058, -0.0026991891158420754, 0.09359081186045407, 0.09664805994164097, -0.04375344092714722, 0.0015097888956560105, -0.18125515912264667, 0.250883053446634, 0.19887526387522128, 0.29124231853664084, 0.08510536710357132, 0.06503375578904524, -0.058971417387036366, -0.05012817242000576, 0.04655741848071794, -0.08129117715701717, 0.052814864102085426, 0.24072039595377803, 0.10356169831483504, 0.26026167015231255, -0.4725185296974023, -0.2980490911798805, 0.07903663723371447, 0.18818690079894188, 0.14938761465410885, -0.12160050585581579, -0.22031618053986915, 0.0734479053173108, -0.19852002937366944, -0.11433837905971576, -0.10289038924992897, 0.022826914449662738, 0.07554658159737616, -0.32498652474833245, 0.0760671782937488, 0.0597866171567306, 0.06188022422745986, -0.042683110674261115, -0.1150401427585166, -0.029127059766324237, 0.08222180289537748, 0.08408732416232258, 0.060428340037343216, 0.1581397268354245, -0.14381733470414157, -0.06647541072933287, 0.3890842639628555, -0.012274854189498634, -0.22267662948402372, 0.26552897007153975, -0.17705346100125968, -0.11686144934830499, 0.17082946075875635, 0.16807239035235555, 0.09575863653267531, -0.15324767906808437, 0.03307962678303264, -0.013849987716758218, 0.16028018269781055, 0.03998051720808017, 0.03403740969157377, 0.1912458874285221, 0.16386287142623865, 0.005472120812160226, 0.08967002210572347, -0.07207584385532359, -0.10343235065659467, -0.24234855811253353, -0.09857511037451964, -0.12019257791056905, 0.012063364741270956, -0.04163550817397861, -0.15490222417587496, 0.35897003621136286, 0.15856562641799785, 0.14870947285311084, -0.027336917009644978, 0.3125454883569467, 0.11586750846333377, 0.04796062356605114, 0.10514593248112562, 0.2478645905022226, 0.15949932073936393, 0.0957990146657128, -0.2423050829561164, 0.09932848990581039, 0.015393296183269147] |
1,802.04562 | Gradient-flowed thermal correlators: how much flow is too much? | Gradient flow has been proposed in the lattice community as a tool to reduce
the sensitivity of operator correlation functions to noisy UV fluctuations. We
test perturbatively under what conditions doing so may contaminate the results.
To do so, we compute gradient-flowed electric field two-point correlators and
stress tensor one- and two-point correlators at finite temperature in QCD.
Gradient flow has almost no influence on the value of correlators until a
(temperature- and separation-dependent) level of flow is reached, after which
the correlator is rapidly compromised. We provide a prescription for how much
flow is "safe."
| hep-lat hep-th | gradient flow has been proposed in the lattice community as a tool to reduce the sensitivity of operator correlation functions to noisy uv fluctuations we test perturbatively under what conditions doing so may contaminate the results to do so we compute gradientflowed electric field twopoint correlators and stress tensor one and twopoint correlators at finite temperature in qcd gradient flow has almost no influence on the value of correlators until a temperature and separationdependent level of flow is reached after which the correlator is rapidly compromised we provide a prescription for how much flow is safe | [['gradient', 'flow', 'has', 'been', 'proposed', 'in', 'the', 'lattice', 'community', 'as', 'a', 'tool', 'to', 'reduce', 'the', 'sensitivity', 'of', 'operator', 'correlation', 'functions', 'to', 'noisy', 'uv', 'fluctuations', 'we', 'test', 'perturbatively', 'under', 'what', 'conditions', 'doing', 'so', 'may', 'contaminate', 'the', 'results', 'to', 'do', 'so', 'we', 'compute', 'gradientflowed', 'electric', 'field', 'twopoint', 'correlators', 'and', 'stress', 'tensor', 'one', 'and', 'twopoint', 'correlators', 'at', 'finite', 'temperature', 'in', 'qcd', 'gradient', 'flow', 'has', 'almost', 'no', 'influence', 'on', 'the', 'value', 'of', 'correlators', 'until', 'a', 'temperature', 'and', 'separationdependent', 'level', 'of', 'flow', 'is', 'reached', 'after', 'which', 'the', 'correlator', 'is', 'rapidly', 'compromised', 'we', 'provide', 'a', 'prescription', 'for', 'how', 'much', 'flow', 'is', 'safe']] | [-0.11319909699653324, 0.15948258949639765, -0.17282746968986956, 0.07602120580911441, -0.06011981507028012, -0.09487715146357292, 0.004389182995318582, 0.40907511973851607, -0.21203734341420624, -0.22081989316563858, 0.12869260877517885, -0.2931736934586967, -0.10731781554702473, 0.14698792396137786, -0.0017267452160778798, 0.0951815828975094, 0.019026417946933133, 0.0698674035678299, -0.08761275497779838, -0.24297206080273578, 0.2977922882639656, 0.08885009955173652, 0.30932189909447183, 0.1530381628232518, 0.09508870778066156, -0.03023814416343444, -0.009837514892416565, 0.09413318306109623, -0.11163493699247115, 0.010909061261305683, 0.22184578956251866, 0.10999472343460902, 0.2538170112983177, -0.4288292286966584, -0.20610847325358345, 0.137241149879992, 0.15591755161355986, 0.14298422932992444, 0.01435830797387385, -0.2005813630346797, 0.09448730963355813, -0.15684787441094064, -0.14159598059364056, -0.1394603120457185, 0.014359516073263398, -0.06830313755689484, -0.2904581222450361, 0.10297154286190083, -0.028828518536235942, 0.06273776574158355, -0.013853413268531624, -0.10685786098535908, -0.045620719863003804, 0.16071180914479652, 0.07806208091787994, 0.10197306532860047, 0.19922288806226693, -0.20650510887468332, -0.03683002611168807, 0.33497495058874943, -0.11457211736001466, -0.20297392099654596, 0.1247627306925623, -0.15976454770976775, -0.13063830148036543, 0.09346057294230713, 0.173297819740286, 0.11995743352331613, -0.17477094113434616, 0.07671612252199435, 0.005343570383755785, 0.1430903760618285, 0.06721455123471587, 0.013135165254291344, 0.2185216641935863, 0.07819085840724016, 0.11863413629808316, 0.15941878884883695, -0.05479042930773607, -0.08249668691699442, -0.30096719490462226, -0.08998823435364389, -0.18143575795632053, 0.07747426417803294, -0.07646564242237026, -0.18812850580403678, 0.4002300870849898, 0.20091657472014623, 0.16385730457014258, 0.06629167444832428, 0.30950663393657457, 0.15127052129859006, 0.13032515385237178, 0.11694032915279662, 0.2837843919908138, 0.14885431853564163, 0.1633106808178127, -0.23761423334087195, 0.043996506159831035, 0.10455375070634641] |
1,802.04563 | The minimal type-I seesaw model with maximally-restricted texture zeros | In the context of Standard Model (SM) extensions, the seesaw mechanism
provides the most natural explanation for the smallness of neutrino masses. In
this work we consider the most economical type-I seesaw realization in which
two right-handed neutrinos are added to the SM field content. For the sake of
predictability, we impose the maximum number of texture zeros in the lepton
Yukawa and mass matrices. All possible patterns are analyzed in the light of
the most recent neutrino oscillation data, and predictions for leptonic CP
violation are presented. We conclude that, in the charged-lepton mass basis,
eight different texture combinations are compatible with neutrino data at
$1\sigma$, all of them for an inverted-hierarchical neutrino mass spectrum.
Four of these cases predict a CP-violating Dirac phase close to $3\pi/2$, which
is around the current best-fit value from global analysis of neutrino
oscillation data. If one further reduces the number of free parameters by
considering three equal elements in the Dirac neutrino Yukawa coupling matrix,
several texture combinations are still compatible with data but only at
$3\sigma$. For all viable textures, the baryon asymmetry of the Universe is
computed in the context of thermal leptogenesis, assuming (mildly) hierarchical
heavy Majorana neutrino masses $M_{1,2}$. It is shown that the flavored regime
is ruled out, while the unflavored one requires $M_{1} \sim 10^{14}$ GeV.
| hep-ph | in the context of standard model sm extensions the seesaw mechanism provides the most natural explanation for the smallness of neutrino masses in this work we consider the most economical typei seesaw realization in which two righthanded neutrinos are added to the sm field content for the sake of predictability we impose the maximum number of texture zeros in the lepton yukawa and mass matrices all possible patterns are analyzed in the light of the most recent neutrino oscillation data and predictions for leptonic cp violation are presented we conclude that in the chargedlepton mass basis eight different texture combinations are compatible with neutrino data at 1sigma all of them for an invertedhierarchical neutrino mass spectrum four of these cases predict a cpviolating dirac phase close to 3pi2 which is around the current bestfit value from global analysis of neutrino oscillation data if one further reduces the number of free parameters by considering three equal elements in the dirac neutrino yukawa coupling matrix several texture combinations are still compatible with data but only at 3sigma for all viable textures the baryon asymmetry of the universe is computed in the context of thermal leptogenesis assuming mildly hierarchical heavy majorana neutrino masses m_12 it is shown that the flavored regime is ruled out while the unflavored one requires m_1 sim 1014 gev | [['in', 'the', 'context', 'of', 'standard', 'model', 'sm', 'extensions', 'the', 'seesaw', 'mechanism', 'provides', 'the', 'most', 'natural', 'explanation', 'for', 'the', 'smallness', 'of', 'neutrino', 'masses', 'in', 'this', 'work', 'we', 'consider', 'the', 'most', 'economical', 'typei', 'seesaw', 'realization', 'in', 'which', 'two', 'righthanded', 'neutrinos', 'are', 'added', 'to', 'the', 'sm', 'field', 'content', 'for', 'the', 'sake', 'of', 'predictability', 'we', 'impose', 'the', 'maximum', 'number', 'of', 'texture', 'zeros', 'in', 'the', 'lepton', 'yukawa', 'and', 'mass', 'matrices', 'all', 'possible', 'patterns', 'are', 'analyzed', 'in', 'the', 'light', 'of', 'the', 'most', 'recent', 'neutrino', 'oscillation', 'data', 'and', 'predictions', 'for', 'leptonic', 'cp', 'violation', 'are', 'presented', 'we', 'conclude', 'that', 'in', 'the', 'chargedlepton', 'mass', 'basis', 'eight', 'different', 'texture', 'combinations', 'are', 'compatible', 'with', 'neutrino', 'data', 'at', '1sigma', 'all', 'of', 'them', 'for', 'an', 'invertedhierarchical', 'neutrino', 'mass', 'spectrum', 'four', 'of', 'these', 'cases', 'predict', 'a', 'cpviolating', 'dirac', 'phase', 'close', 'to', '3pi2', 'which', 'is', 'around', 'the', 'current', 'bestfit', 'value', 'from', 'global', 'analysis', 'of', 'neutrino', 'oscillation', 'data', 'if', 'one', 'further', 'reduces', 'the', 'number', 'of', 'free', 'parameters', 'by', 'considering', 'three', 'equal', 'elements', 'in', 'the', 'dirac', 'neutrino', 'yukawa', 'coupling', 'matrix', 'several', 'texture', 'combinations', 'are', 'still', 'compatible', 'with', 'data', 'but', 'only', 'at', '3sigma', 'for', 'all', 'viable', 'textures', 'the', 'baryon', 'asymmetry', 'of', 'the', 'universe', 'is', 'computed', 'in', 'the', 'context', 'of', 'thermal', 'leptogenesis', 'assuming', 'mildly', 'hierarchical', 'heavy', 'majorana', 'neutrino', 'masses', 'm_12', 'it', 'is', 'shown', 'that', 'the', 'flavored', 'regime', 'is', 'ruled', 'out', 'while', 'the', 'unflavored', 'one', 'requires', 'm_1', 'sim', '1014', 'gev']] | [-0.11566502354947689, 0.24420722111796198, 0.04234982338270436, 0.17099204875866894, -0.07751045968876855, -0.16883086083354812, 0.046402365794260755, 0.31845620527574325, -0.20542773444016282, -0.3175038619165747, 0.06341484165218868, -0.30918348746663427, -0.03383413671418072, 0.17093720295483494, 0.04078354382011444, 0.030060588908943902, 0.03630997253301209, 0.0056518598089683545, -0.10500103838823642, -0.24940658663186888, 0.32185315181071694, 0.025728955345024188, 0.2430489858459324, 0.033104169065532485, 0.04938798213322311, -0.06621636041827057, -0.039138111224202396, -0.10755994606419228, -0.07033042966306569, 0.038801628435253845, 0.17848271740064636, 0.11641837272486866, 0.08765252951328477, -0.3744963239623259, -0.1651160443609912, 0.19031343918047064, 0.15287006051826066, 0.07503781331592499, -0.09135578616126759, -0.2587413378123653, 0.09750535400035752, -0.19263755620593315, -0.13679603565501297, -0.05400665347745055, -0.03887158596024904, -0.11539109488954495, -0.32654213093085105, 0.12150098171646465, -0.05746130184716966, -0.009357286793643345, -0.018388093234418326, -0.21581134006230068, -0.05815440014251359, 0.034437010056215876, 0.1785890837614616, -0.06770019566631752, 0.09616060478965748, -0.1522260588800033, -0.07886237152915908, 0.44978710298174485, -0.06309628523949994, -0.165845082792109, 0.11093713594579295, -0.1920563853303285, -0.15258691770268593, 0.10725503584973889, 0.11747606868162479, 0.04268534870852278, -0.20602784062136117, 0.13305552593766198, -0.1094087668350094, 0.15047527078037323, 0.06650610683809065, 0.034159924090759124, 0.3308760376910777, 0.2218539624615279, 0.07255634747298868, -0.05200251432552457, -0.10938514939328065, -0.0448558523692297, -0.3707599012206679, -0.08364284213538788, -0.12515806784953276, 0.0275817973869874, -0.12729672979354564, -0.09406242103751251, 0.46758489117672725, 0.16687938398958002, 0.2337179276369274, 0.01929384366115853, 0.283994955916519, 0.06890715155155147, 0.0881806171252541, 0.037374952710212364, 0.3191740206829761, 0.1390650134382676, 0.09969567371953329, -0.2427937456600147, 0.008311063293622781, 0.0614840578198535] |
1,802.04564 | Diversity-Driven Exploration Strategy for Deep Reinforcement Learning | Efficient exploration remains a challenging research problem in reinforcement
learning, especially when an environment contains large state spaces, deceptive
local optima, or sparse rewards. To tackle this problem, we present a
diversity-driven approach for exploration, which can be easily combined with
both off- and on-policy reinforcement learning algorithms. We show that by
simply adding a distance measure to the loss function, the proposed methodology
significantly enhances an agent's exploratory behaviors, and thus preventing
the policy from being trapped in local optima. We further propose an adaptive
scaling method for stabilizing the learning process. Our experimental results
in Atari 2600 show that our method outperforms baseline approaches in several
tasks in terms of mean scores and exploration efficiency.
| cs.AI stat.ML | efficient exploration remains a challenging research problem in reinforcement learning especially when an environment contains large state spaces deceptive local optima or sparse rewards to tackle this problem we present a diversitydriven approach for exploration which can be easily combined with both off and onpolicy reinforcement learning algorithms we show that by simply adding a distance measure to the loss function the proposed methodology significantly enhances an agents exploratory behaviors and thus preventing the policy from being trapped in local optima we further propose an adaptive scaling method for stabilizing the learning process our experimental results in atari 2600 show that our method outperforms baseline approaches in several tasks in terms of mean scores and exploration efficiency | [['efficient', 'exploration', 'remains', 'a', 'challenging', 'research', 'problem', 'in', 'reinforcement', 'learning', 'especially', 'when', 'an', 'environment', 'contains', 'large', 'state', 'spaces', 'deceptive', 'local', 'optima', 'or', 'sparse', 'rewards', 'to', 'tackle', 'this', 'problem', 'we', 'present', 'a', 'diversitydriven', 'approach', 'for', 'exploration', 'which', 'can', 'be', 'easily', 'combined', 'with', 'both', 'off', 'and', 'onpolicy', 'reinforcement', 'learning', 'algorithms', 'we', 'show', 'that', 'by', 'simply', 'adding', 'a', 'distance', 'measure', 'to', 'the', 'loss', 'function', 'the', 'proposed', 'methodology', 'significantly', 'enhances', 'an', 'agents', 'exploratory', 'behaviors', 'and', 'thus', 'preventing', 'the', 'policy', 'from', 'being', 'trapped', 'in', 'local', 'optima', 'we', 'further', 'propose', 'an', 'adaptive', 'scaling', 'method', 'for', 'stabilizing', 'the', 'learning', 'process', 'our', 'experimental', 'results', 'in', 'atari', '2600', 'show', 'that', 'our', 'method', 'outperforms', 'baseline', 'approaches', 'in', 'several', 'tasks', 'in', 'terms', 'of', 'mean', 'scores', 'and', 'exploration', 'efficiency']] | [-0.03725395654527168, 0.030528769888949946, -0.11415355863511308, 0.06092138278443164, -0.0934805567515616, -0.16057957257104352, 0.08722168308061858, 0.48806521207348913, -0.2991059706108565, -0.33259580454701543, 0.0763256165251717, -0.24180804810717574, -0.19352649348891443, 0.19837439672137874, -0.12981123849053064, 0.047876757730801515, 0.13026108579415605, -0.017508128769377358, -0.05671609827699379, -0.28945984123035884, 0.2719458564916928, 0.048283142698371515, 0.3161193777480696, 0.03820927028293507, 0.11328594708560497, 0.00405608368321107, 0.011531774695409445, 0.04699098829052642, -0.05828927482866869, 0.14572328213466984, 0.33256506490716153, 0.2097066898917795, 0.42081939234820187, -0.37599941760174227, -0.21749823188019168, 0.14244700437730068, 0.1734206938248478, 0.11627382307779044, -0.07324918900003545, -0.35764792456458777, 0.04305454612407101, -0.1524836317433092, -0.04778137806684583, -0.18103328686701053, -0.055003031946989335, -0.023086995559020176, -0.3308328672065439, 0.03863016665220643, 0.06105562091136399, 0.03677231340438255, -0.0925700902684122, -0.1270861358413648, 0.08984815325333267, 0.12699324513400476, 0.03884858759612633, 0.0669189776526764, 0.16649515441376078, -0.1977355814731429, -0.19298147269261953, 0.316585121373845, -0.06511234773052299, -0.19340354105871585, 0.21590764354914427, -0.01739238552414836, -0.11861015566919222, 0.1098261767377456, 0.24659607133581343, 0.1912397801772588, -0.13461713597805808, 0.036435685656331956, -0.023913129248743892, 0.1618178772718176, -0.012914520616714772, -0.029837258510355257, 0.1363569727867969, 0.250999411703366, 0.15180694432650557, 0.1517640646461509, -0.06337894422089697, -0.12750246345202845, -0.18327625712745974, -0.09403781616725983, -0.1764627364424304, -0.029650972429742545, -0.12308806603593836, -0.11249471851823549, 0.33648533503023476, 0.22979118502261037, 0.21094957707274672, 0.1261495302289995, 0.3687929912414561, 0.044328635256005146, 0.06719823022926243, 0.14873747610781565, 0.2134607888969123, -0.033322086012484424, 0.09936617056114806, -0.2400023311149711, 0.10467379809452747, 0.02780218726485713] |
1,802.04565 | Role of Triplet-State Shelving in Organic Photovoltaics: Single-Chain
Aggregates of Poly(3-hexylthiophene) versus Mesoscopic Multichain Aggregates | Triplet excitons have been the focus of considerable attention with regards
to the functioning of polymer solar cells, because these species are long-lived
and quench subsequently generated singlet excitons in their vicinity. The role
of triplets in poly(3-hexylthiophene) (P3HT) has been investigated extensively
with contrary conclusions regarding their importance. We probe the various
roles triplets can play in P3HT by analyzing the photoluminescence (PL) from
isolated single-chain aggregates and multi-chain mesoscopic aggregates. Solvent
vapor annealing allows deterministic growth of P3HT aggregates consisting of
~20 chains, which exhibit red-shifted and broadened PL compared to single-chain
aggregates. The multi-chain aggregates exhibit a decrease of photon
antibunching contrast compared to single-chain aggregates, implying rather weak
interchain excitonic coupling and energy transfer. Nevertheless, the influence
of triplet-quenching oxygen on PL and a photon correlation analysis of
aggregate PL reveal that triplets are quenched by intermolecular interactions
in the bulk state.
| physics.chem-ph | triplet excitons have been the focus of considerable attention with regards to the functioning of polymer solar cells because these species are longlived and quench subsequently generated singlet excitons in their vicinity the role of triplets in poly3hexylthiophene p3ht has been investigated extensively with contrary conclusions regarding their importance we probe the various roles triplets can play in p3ht by analyzing the photoluminescence pl from isolated singlechain aggregates and multichain mesoscopic aggregates solvent vapor annealing allows deterministic growth of p3ht aggregates consisting of 20 chains which exhibit redshifted and broadened pl compared to singlechain aggregates the multichain aggregates exhibit a decrease of photon antibunching contrast compared to singlechain aggregates implying rather weak interchain excitonic coupling and energy transfer nevertheless the influence of tripletquenching oxygen on pl and a photon correlation analysis of aggregate pl reveal that triplets are quenched by intermolecular interactions in the bulk state | [['triplet', 'excitons', 'have', 'been', 'the', 'focus', 'of', 'considerable', 'attention', 'with', 'regards', 'to', 'the', 'functioning', 'of', 'polymer', 'solar', 'cells', 'because', 'these', 'species', 'are', 'longlived', 'and', 'quench', 'subsequently', 'generated', 'singlet', 'excitons', 'in', 'their', 'vicinity', 'the', 'role', 'of', 'triplets', 'in', 'poly3hexylthiophene', 'p3ht', 'has', 'been', 'investigated', 'extensively', 'with', 'contrary', 'conclusions', 'regarding', 'their', 'importance', 'we', 'probe', 'the', 'various', 'roles', 'triplets', 'can', 'play', 'in', 'p3ht', 'by', 'analyzing', 'the', 'photoluminescence', 'pl', 'from', 'isolated', 'singlechain', 'aggregates', 'and', 'multichain', 'mesoscopic', 'aggregates', 'solvent', 'vapor', 'annealing', 'allows', 'deterministic', 'growth', 'of', 'p3ht', 'aggregates', 'consisting', 'of', '20', 'chains', 'which', 'exhibit', 'redshifted', 'and', 'broadened', 'pl', 'compared', 'to', 'singlechain', 'aggregates', 'the', 'multichain', 'aggregates', 'exhibit', 'a', 'decrease', 'of', 'photon', 'antibunching', 'contrast', 'compared', 'to', 'singlechain', 'aggregates', 'implying', 'rather', 'weak', 'interchain', 'excitonic', 'coupling', 'and', 'energy', 'transfer', 'nevertheless', 'the', 'influence', 'of', 'tripletquenching', 'oxygen', 'on', 'pl', 'and', 'a', 'photon', 'correlation', 'analysis', 'of', 'aggregate', 'pl', 'reveal', 'that', 'triplets', 'are', 'quenched', 'by', 'intermolecular', 'interactions', 'in', 'the', 'bulk', 'state']] | [-0.06925766062922775, 0.2033147367745124, -0.049731176555686596, 0.05769202636458493, 0.05333710848915808, -0.17104630291718861, 0.027124146497577575, 0.47081789171066263, -0.2230634897529822, -0.29025812069283285, -0.019651281544617538, -0.32952908930250296, -0.06807737430910869, 0.11112911347299814, 0.053236861742133726, -0.0032422260830885377, 0.03556801502689205, -0.06894426254057807, 0.029227912799326766, -0.19314433658783572, 0.2544039620215009, 0.06276413463377233, 0.3225549602688387, 0.08984396918034503, 0.023522787476921905, 0.004424017765719829, 0.030449371375464673, 0.010935428579626927, -0.12939967808724132, 0.1333616626159898, 0.22896175619279002, -0.05132496721625071, 0.23856383618609658, -0.47505720437600696, -0.21937280422847333, 0.08233596841676225, 0.20367813088674228, 0.1458179833455782, -0.07580462440743978, -0.2637679014162257, 0.02996846969592674, -0.1285315799783787, -0.04997217893712865, -0.06401098062573322, 0.011218098037201783, 0.06465761836513813, -0.19725356748134926, 0.12668359050153882, 0.06905869278767757, 0.1017372932092383, -0.05980526539858366, -0.11821131181485695, -0.13636774836381063, 0.09711693570435304, 0.041123442033080965, -0.05834348610088486, 0.2949480933490498, -0.11455827003409122, -0.10180698619264274, 0.3699697099256747, -0.07551335506783477, -0.09018657450756894, 0.2327057276691856, -0.13250799251334935, -0.0950943937236122, 0.22038483859585792, 0.10477440396789461, 0.12172934470762467, -0.14540304539660956, 0.044806849652628315, -0.0033971225011868982, 0.23908234221282704, 0.12047917695097818, 0.1546786931182804, 0.25432713681767727, 0.19910078095593328, -0.052269586803520035, 0.1785913501191756, -0.08194416060578077, -0.1684952027068056, -0.1081384490448821, -0.1931489856431967, -0.1667728104323534, 0.10509537188115466, -0.07762125302055962, -0.15666367714132728, 0.3548762471768363, 0.06788031605176692, 0.20484784593291838, -0.004543744897919482, 0.16673163128695612, 0.04331494082118673, 0.09469752000516345, -0.03424548537245598, 0.2727538299393551, 0.17303519638351583, 0.11667109310048922, -0.3017952883567918, 0.11676898785417193, -0.029778210301722945] |
1,802.04566 | Studying the bound state of the $B\bar{K}$ system in the Bethe-Salpeter
formalism | In this work, we study the $B\bar{K}$ molecule in the Bethe-Salpeter (BS)
equation approach. With the kernel containing one-particle-exchange diagrams
and introducing two different form factors (monopole form factor and dipole
form factor) in the vertex, we solve the BS equation numerically in the
covariant instantaneous approximation. We investigate the isoscalar and
isovector $B\bar{K}$ systems, and we find $X(5568)$ cannot be a $B\bar{K}$
molecule.
| hep-ph | in this work we study the bbark molecule in the bethesalpeter bs equation approach with the kernel containing oneparticleexchange diagrams and introducing two different form factors monopole form factor and dipole form factor in the vertex we solve the bs equation numerically in the covariant instantaneous approximation we investigate the isoscalar and isovector bbark systems and we find x5568 cannot be a bbark molecule | [['in', 'this', 'work', 'we', 'study', 'the', 'bbark', 'molecule', 'in', 'the', 'bethesalpeter', 'bs', 'equation', 'approach', 'with', 'the', 'kernel', 'containing', 'oneparticleexchange', 'diagrams', 'and', 'introducing', 'two', 'different', 'form', 'factors', 'monopole', 'form', 'factor', 'and', 'dipole', 'form', 'factor', 'in', 'the', 'vertex', 'we', 'solve', 'the', 'bs', 'equation', 'numerically', 'in', 'the', 'covariant', 'instantaneous', 'approximation', 'we', 'investigate', 'the', 'isoscalar', 'and', 'isovector', 'bbark', 'systems', 'and', 'we', 'find', 'x5568', 'can', 'not', 'be', 'a', 'bbark', 'molecule']] | [-0.1813421219412703, 0.0861298204108607, -0.08705164067214355, 0.08580215360962029, -0.07933239891644916, -0.11839584568951977, 0.09225328347747563, 0.364092913485365, -0.18969475445192074, -0.24095221294555813, -0.06712667534156935, -0.2704921852273401, -0.18842427650815807, 0.014494395931251347, 0.10161438329669181, 0.0030291943839984015, 0.0665952427443699, 0.05641976746846922, -0.08430808178491134, -0.1528113094973378, 0.3691440241818782, -0.04892358605138725, 0.20930119056720287, 0.10774796782061458, 0.033817708274000324, -0.014352884893014561, 0.020532501192064956, -0.039460683925426565, -0.1535032965039136, 0.07260358003986767, 0.21874146509799175, 0.09351225856516976, 0.17667272700055037, -0.4481732164276764, -0.12565934228769038, 0.12300528687046608, 0.20500814709157567, 0.14881555692409165, 0.038295820865187125, -0.31174137703783344, 0.05864371082861908, -0.2464371260975895, -0.16524791216215817, -0.12515891027578618, -0.027379093024137546, 0.00041072189560509287, -0.30942259729636135, 0.10343155222653877, -0.02676458767382428, -0.018327973841223866, -0.10041361417097505, -0.22194156780460617, 0.05852419379516505, 0.0558549591441988, 0.0233778072433779, 0.0780746485288546, 0.1424952126981225, -0.1703653025197127, -0.05855049302772386, 0.37131340810447, -0.11076920531922951, -0.28647695714607835, 0.07485697291849647, -0.18765062891179696, -0.13042796912486665, 0.09223401213239413, 0.17448262043762952, 0.10574370186441229, -0.23282922833459452, 0.09412875592170167, -0.014618074757891009, 0.1319314253560151, 0.10289394919527695, 0.036353515926748514, 0.11426515906350687, 0.1535109436372295, -0.022988041790085845, 0.13105802284371748, -0.059641811581968796, -0.13345326418493642, -0.2791550614638254, -0.12785075661668088, -0.14406197529024212, 0.07249266056555825, -0.0501060669985236, -0.0968800300906878, 0.3714422687662591, 0.02117646661645267, 0.16662836409659576, -0.03065196115130675, 0.29998471861472353, 0.21663377482036594, 0.08268118218711606, 0.12885592858219752, 0.25540222371228083, 0.18654129004789866, 0.05225569618596637, -0.3301487660064595, -0.013107242393743945, 0.0822493440064136] |
1,802.04567 | Generation of large-scale magnetic fields due to fluctuating $\alpha$ in
shearing systems | We explore the growth of large-scale magnetic fields in a shear flow, due to
helicity fluctuations with a finite correlation time, through a study of the
Kraichnan-Moffatt model of zero-mean stochastic fluctuations of the $\alpha$
parameter of dynamo theory. We derive a linear integro-differential equation
for the evolution of large-scale magnetic field, using the first-order
smoothing approximation and the Galilean invariance of the $\alpha$-statistics.
This enables construction of a model that is non-perturbative in the shearing
rate $S$ and the $\alpha$-correlation time $\tau_\alpha$. After a brief review
of the salient features of the exactly solvable white-noise limit, we consider
the case of small but non-zero $\tau_\alpha$. When the large-scale magnetic
field varies slowly, the evolution is governed by a partial differential
equation. We present modal solutions and conditions for the exponential growth
rate of the large-scale magnetic field, whose drivers are the Kraichnan
diffusivity, Moffatt drift, Shear and a non-zero correlation time. Of
particular interest is dynamo action when the $\alpha$-fluctuations are weak;
i.e. when the Kraichnan diffusivity is positive. We show that in the absence of
Moffatt drift, shear does not give rise to growing solutions. But shear and
Moffatt drift acting together can drive large scale dynamo action with growth
rate $\gamma \propto |S|$.
| astro-ph.GA physics.plasm-ph | we explore the growth of largescale magnetic fields in a shear flow due to helicity fluctuations with a finite correlation time through a study of the kraichnanmoffatt model of zeromean stochastic fluctuations of the alpha parameter of dynamo theory we derive a linear integrodifferential equation for the evolution of largescale magnetic field using the firstorder smoothing approximation and the galilean invariance of the alphastatistics this enables construction of a model that is nonperturbative in the shearing rate s and the alphacorrelation time tau_alpha after a brief review of the salient features of the exactly solvable whitenoise limit we consider the case of small but nonzero tau_alpha when the largescale magnetic field varies slowly the evolution is governed by a partial differential equation we present modal solutions and conditions for the exponential growth rate of the largescale magnetic field whose drivers are the kraichnan diffusivity moffatt drift shear and a nonzero correlation time of particular interest is dynamo action when the alphafluctuations are weak ie when the kraichnan diffusivity is positive we show that in the absence of moffatt drift shear does not give rise to growing solutions but shear and moffatt drift acting together can drive large scale dynamo action with growth rate gamma propto s | [['we', 'explore', 'the', 'growth', 'of', 'largescale', 'magnetic', 'fields', 'in', 'a', 'shear', 'flow', 'due', 'to', 'helicity', 'fluctuations', 'with', 'a', 'finite', 'correlation', 'time', 'through', 'a', 'study', 'of', 'the', 'kraichnanmoffatt', 'model', 'of', 'zeromean', 'stochastic', 'fluctuations', 'of', 'the', 'alpha', 'parameter', 'of', 'dynamo', 'theory', 'we', 'derive', 'a', 'linear', 'integrodifferential', 'equation', 'for', 'the', 'evolution', 'of', 'largescale', 'magnetic', 'field', 'using', 'the', 'firstorder', 'smoothing', 'approximation', 'and', 'the', 'galilean', 'invariance', 'of', 'the', 'alphastatistics', 'this', 'enables', 'construction', 'of', 'a', 'model', 'that', 'is', 'nonperturbative', 'in', 'the', 'shearing', 'rate', 's', 'and', 'the', 'alphacorrelation', 'time', 'tau_alpha', 'after', 'a', 'brief', 'review', 'of', 'the', 'salient', 'features', 'of', 'the', 'exactly', 'solvable', 'whitenoise', 'limit', 'we', 'consider', 'the', 'case', 'of', 'small', 'but', 'nonzero', 'tau_alpha', 'when', 'the', 'largescale', 'magnetic', 'field', 'varies', 'slowly', 'the', 'evolution', 'is', 'governed', 'by', 'a', 'partial', 'differential', 'equation', 'we', 'present', 'modal', 'solutions', 'and', 'conditions', 'for', 'the', 'exponential', 'growth', 'rate', 'of', 'the', 'largescale', 'magnetic', 'field', 'whose', 'drivers', 'are', 'the', 'kraichnan', 'diffusivity', 'moffatt', 'drift', 'shear', 'and', 'a', 'nonzero', 'correlation', 'time', 'of', 'particular', 'interest', 'is', 'dynamo', 'action', 'when', 'the', 'alphafluctuations', 'are', 'weak', 'ie', 'when', 'the', 'kraichnan', 'diffusivity', 'is', 'positive', 'we', 'show', 'that', 'in', 'the', 'absence', 'of', 'moffatt', 'drift', 'shear', 'does', 'not', 'give', 'rise', 'to', 'growing', 'solutions', 'but', 'shear', 'and', 'moffatt', 'drift', 'acting', 'together', 'can', 'drive', 'large', 'scale', 'dynamo', 'action', 'with', 'growth', 'rate', 'gamma', 'propto', 's']] | [-0.19744511501060105, 0.20307545852847397, -0.05726933717161563, 0.0488191290670668, -0.07165777930127018, -0.08378806579789586, -0.04252175373132523, 0.2920146148602476, -0.30321430015793144, -0.2504013581521006, 0.09935366877585229, -0.2303304198122693, -0.13743687371906538, 0.17602230039968467, 0.012578310484326827, 0.039695590055392437, 0.004959820046126112, 0.04671663404488023, -0.03759540168810453, -0.20960272084830292, 0.31143941533952657, 0.059820685339361135, 0.26847826358496996, 0.00828571030618988, 0.11648523752057158, -0.04751208892226785, -0.052715437541551446, 0.08012760613186687, -0.19163355598371423, 0.007989277624908616, 0.1532020821959675, 0.026176828439073527, 0.29134270648914845, -0.44198396544465246, -0.2265622481969402, 0.08260127554611102, 0.1496658659454232, 0.13478384402525775, -0.03669091387464683, -0.2256228199454627, 0.05464910583196245, -0.13605155679397285, -0.1346135085434927, -0.06251939748386469, 0.07672614198550125, 0.0572355882725199, -0.3384920576383022, 0.1806460931148453, 0.10020198666447244, 0.08113744692892556, -0.10846764430336371, -0.03509946907505247, -0.023244788482164342, 0.08756435803675855, 0.13053743872510762, 0.05231744075917602, 0.15062747057527304, -0.17987136431289472, -0.05661594180114038, 0.3546040763338918, -0.13967100057224718, -0.1992998073452755, 0.1600375252087628, -0.22409228529260658, -0.09994892036775127, 0.16202446870624507, 0.17955978094559052, 0.11478589250085254, -0.11094453713353598, 0.13307655058594595, -0.023199284969664672, 0.13666457890683567, 0.027699591607932804, -0.02969897862474717, 0.17136219796249827, 0.1539589448023916, 0.08189095570660178, 0.10087204507127513, -0.08986158767719661, -0.10672243443025532, -0.332737865396684, -0.1288828730148631, -0.13807088833338782, 0.10651028130379535, -0.12126465355807643, -0.20831693312399746, 0.384256979131012, 0.14176036711033507, 0.17657099994511216, 0.08460911816355828, 0.25450877060511096, 0.18235410155052795, 0.03933480434074334, 0.10199308392828457, 0.2266595484597572, 0.19241295458506977, 0.13180325241695506, -0.2916352347797239, 0.06012207382659921, 0.08530119228560258] |
1,802.04568 | Regularity of Solutions of the Parabolic Normalized p-Laplace Equation | The parabolic normalized p-Laplace equation is studied. We prove that a
viscosity solution has a time derivative in the sense of Sobolev belonging
locally to $L^2$.
| math.AP | the parabolic normalized plaplace equation is studied we prove that a viscosity solution has a time derivative in the sense of sobolev belonging locally to l2 | [['the', 'parabolic', 'normalized', 'plaplace', 'equation', 'is', 'studied', 'we', 'prove', 'that', 'a', 'viscosity', 'solution', 'has', 'a', 'time', 'derivative', 'in', 'the', 'sense', 'of', 'sobolev', 'belonging', 'locally', 'to', 'l2']] | [-0.18453303896463835, 0.0063829364147610385, -0.13197406869865239, 0.06878198642516509, -0.10913762285445745, -0.1225717977907222, -0.08414867348395862, 0.31413886466851604, -0.36065102368593216, -0.1218855341609854, 0.1495923470087851, -0.3284024749524318, -0.0787819750750294, 0.12690291603883871, -0.09751282403102288, 0.1127000673351666, 0.05961929490933052, 0.11813289672136307, -0.0869367095695522, -0.22973681363062218, 0.38191833898711663, -0.1130861106973428, 0.21912079813102117, 0.005954768222111922, 0.1395767547745401, -0.13123722091460457, 0.014095840814451758, 0.008774310278777894, -0.24784268737158316, 0.07462604798806402, 0.2667434371721286, -0.037430095101276845, 0.41463423749575246, -0.3323851473844395, -0.23597280165323845, 0.18616189094833457, 0.09744927337249884, -0.009094322565943003, -0.04634558544225561, -0.2806486694428783, 0.09557558680311419, -0.08249975314650398, -0.2561093208093483, -0.060500798030541494, 0.08223250558456549, 0.06050891260831402, -0.3218019481461782, 0.19107104397307223, 0.08845392972804032, -0.06848498541288651, -0.21445411128493455, -0.040960121290901534, -0.06701652419108611, 0.00273628500648416, 0.08187051188164893, 0.09032917420308177, -0.0011245434602292685, -0.07890273036005405, -0.042645984584501445, 0.36265585156014335, -0.19099185486825612, -0.3143446186127571, 0.0960435037716077, -0.20567796246793407, -0.06781294651759359, 0.0655082143843034, 0.16560466605453536, 0.21109860247144333, -0.15500086818176967, 0.23827873227687982, -0.07152578327804804, 0.16684827323143298, 0.138340573435506, -0.007779149463973367, -0.0350345136741033, 0.14082222019966978, 0.2384963184953309, 0.12945937809462732, -0.029301376171553366, -0.11640860398228352, -0.3214678070866145, -0.25447778016901934, -0.19217257376294583, 0.12893556742570722, -0.09786376704533513, -0.2132108240531614, 0.34353845989188325, 0.042803697574597135, 0.1363739210109298, 0.10494221843635806, 0.1483036928738539, 0.26002516821385, 0.02167899485749121, 0.16214555821968063, 0.22343796133421934, 0.1851294863736257, 0.1763190791422788, -0.19586013501080182, 0.06598587042222229, 0.27766633868360746] |
1,802.04569 | The Ces\`aro operator on duals of power series spaces of infinite type | A detailed investigation is made of the continuity, spectrum and mean ergodic
properties of the Ces\`aro operator $C$ when acting on the strong duals of
power series spaces of infinite type. There is a dramatic difference in the
nature of the spectrum of $C$ depending on whether or not the strong dual space
(which is always Schwartz) is nuclear.
| math.FA | a detailed investigation is made of the continuity spectrum and mean ergodic properties of the cesaro operator c when acting on the strong duals of power series spaces of infinite type there is a dramatic difference in the nature of the spectrum of c depending on whether or not the strong dual space which is always schwartz is nuclear | [['a', 'detailed', 'investigation', 'is', 'made', 'of', 'the', 'continuity', 'spectrum', 'and', 'mean', 'ergodic', 'properties', 'of', 'the', 'cesaro', 'operator', 'c', 'when', 'acting', 'on', 'the', 'strong', 'duals', 'of', 'power', 'series', 'spaces', 'of', 'infinite', 'type', 'there', 'is', 'a', 'dramatic', 'difference', 'in', 'the', 'nature', 'of', 'the', 'spectrum', 'of', 'c', 'depending', 'on', 'whether', 'or', 'not', 'the', 'strong', 'dual', 'space', 'which', 'is', 'always', 'schwartz', 'is', 'nuclear']] | [-0.1379697473830212, 0.1239186423215068, -0.10369557635542953, 0.07461364796953433, -0.08782128883936142, -0.07820958948804665, 0.025487403622118092, 0.37429058406565147, -0.2778768356321222, -0.18880654764124902, 0.1510628207756396, -0.27249593216673296, -0.10410539963345786, 0.1910202413189651, -0.05420802833543996, -0.000313146481827154, 0.022753206839374568, 0.104536769438093, -0.12236443614208345, -0.23036674545067598, 0.37711291785462425, 0.03479044074666197, 0.26440706798585795, 0.09505029366316148, 0.06404290640316272, 0.01328341014114982, -0.03637842352549404, 0.02460905607203732, -0.10987564930850166, 0.09732935727195088, 0.15728773921728134, 0.09410235174473817, 0.29788710972515203, -0.35007948343152717, -0.21022659488085468, 0.1916206941418981, 0.10017239005044419, -0.04114972075676324, -0.029962700730489598, -0.2382277456127991, 0.08189316392260587, -0.12483335851486456, -0.10581562726490074, -0.04722867389919899, 0.08926146325923628, 0.06737736841442726, -0.2666593126052896, 0.05844908990597321, 0.13045542412516425, 0.10100204967972586, -0.08189684902396747, -0.06586410356211965, -0.05583116610266142, 0.10834150325153734, 0.04282270966026679, 0.029791691877200443, 0.09037279646243837, -0.11307799806660515, -0.05985669423904964, 0.38530750465342556, -0.09307470962689338, -0.19945731089781907, 0.19270858804742663, -0.20635152595528103, -0.11806222575448327, 0.12852209944956763, 0.125733844320274, 0.13457282688626546, -0.06694782376649466, 0.1892607105980722, -0.07413909943000871, 0.1975365103364496, 0.039870123678849914, 0.09870857489689933, 0.16593683496812137, 0.09993398945257699, 0.114669419572515, 0.11381632446358769, 0.006536810177425712, -0.09932001502059748, -0.3453202159380761, -0.1733886939552376, -0.20032389998688535, 0.11164696390323255, -0.06957312925867697, -0.24094960806986032, 0.3856792079691254, 0.010431626401210235, 0.17478130723081403, -0.00557691515304969, 0.22681049851037688, 0.15081224447684521, 0.012652648103786475, 0.05680641520894685, 0.21358062061717956, 0.18759594439386817, 0.060271796896674876, -0.24241823709364665, 0.05092484706034094, 0.1564410991682592] |
1,802.0457 | Determining the True Optical Gap in a High-Performance Organic
Photovoltaic Polymer Using Single-Molecule Spectroscopy | Low-gap conjugated polymers have enabled an impressive increase in the
efficiencies of organic solar cells, primarily due to their red absorption
which allows harvesting of that part of the solar spectrum. Here, we report
that the true optical gap of one prototypical material, PTB7, is in fact at
significantly higher energy than has previously been reported, indicating that
the red absorption utilized in these materials in solar cells is entirely due
to chain aggregation. Using single-molecule spectroscopy we find that PL from
isolated nanoscale aggregates consists of multiple independently emitting
chromophores. At the single-molecule level, however, straight single chains
with a high degree of emission polarization are observed. The PL is found to be
~0.4 eV higher in energy, with a longer lifetime than the red aggregates, and
is attributed to single chromophores. Our findings indicate that the impressive
light-harvesting abilities of PTB7 in the red spectral region arises solely
from chain aggregation.
| physics.chem-ph physics.app-ph | lowgap conjugated polymers have enabled an impressive increase in the efficiencies of organic solar cells primarily due to their red absorption which allows harvesting of that part of the solar spectrum here we report that the true optical gap of one prototypical material ptb7 is in fact at significantly higher energy than has previously been reported indicating that the red absorption utilized in these materials in solar cells is entirely due to chain aggregation using singlemolecule spectroscopy we find that pl from isolated nanoscale aggregates consists of multiple independently emitting chromophores at the singlemolecule level however straight single chains with a high degree of emission polarization are observed the pl is found to be 04 ev higher in energy with a longer lifetime than the red aggregates and is attributed to single chromophores our findings indicate that the impressive lightharvesting abilities of ptb7 in the red spectral region arises solely from chain aggregation | [['lowgap', 'conjugated', 'polymers', 'have', 'enabled', 'an', 'impressive', 'increase', 'in', 'the', 'efficiencies', 'of', 'organic', 'solar', 'cells', 'primarily', 'due', 'to', 'their', 'red', 'absorption', 'which', 'allows', 'harvesting', 'of', 'that', 'part', 'of', 'the', 'solar', 'spectrum', 'here', 'we', 'report', 'that', 'the', 'true', 'optical', 'gap', 'of', 'one', 'prototypical', 'material', 'ptb7', 'is', 'in', 'fact', 'at', 'significantly', 'higher', 'energy', 'than', 'has', 'previously', 'been', 'reported', 'indicating', 'that', 'the', 'red', 'absorption', 'utilized', 'in', 'these', 'materials', 'in', 'solar', 'cells', 'is', 'entirely', 'due', 'to', 'chain', 'aggregation', 'using', 'singlemolecule', 'spectroscopy', 'we', 'find', 'that', 'pl', 'from', 'isolated', 'nanoscale', 'aggregates', 'consists', 'of', 'multiple', 'independently', 'emitting', 'chromophores', 'at', 'the', 'singlemolecule', 'level', 'however', 'straight', 'single', 'chains', 'with', 'a', 'high', 'degree', 'of', 'emission', 'polarization', 'are', 'observed', 'the', 'pl', 'is', 'found', 'to', 'be', '04', 'ev', 'higher', 'in', 'energy', 'with', 'a', 'longer', 'lifetime', 'than', 'the', 'red', 'aggregates', 'and', 'is', 'attributed', 'to', 'single', 'chromophores', 'our', 'findings', 'indicate', 'that', 'the', 'impressive', 'lightharvesting', 'abilities', 'of', 'ptb7', 'in', 'the', 'red', 'spectral', 'region', 'arises', 'solely', 'from', 'chain', 'aggregation']] | [-0.07936809904678585, 0.15397971079487344, -0.028046841100101767, -0.006507318223418753, -0.009110076712091374, -0.1296656329148248, 0.04941129188770063, 0.4605899373057231, -0.229207305006342, -0.3378872352049631, -0.006637896038287508, -0.30961850604654545, -0.12225174508209712, 0.19258458154836025, -0.043817775681792924, -0.018420251061625512, 0.07011836124401466, -0.036186748854602914, 0.04024134890565929, -0.15765892226002454, 0.22436709794538473, 0.08424758508739068, 0.29074161376779767, 0.06971342754215488, 0.07241545355531807, -0.06536455954625911, 0.039652568683807364, -0.021332472081150057, -0.09150574982644316, 0.1712499060702291, 0.25113808932665466, 0.002328972078044138, 0.23353660996285042, -0.43541675232643007, -0.24986518124039314, 0.08641303885235257, 0.2044588010294022, 0.09112125154344207, -0.05807753216880039, -0.19918120464650926, 0.09928814399823108, -0.1181321309026661, -0.11612410265632778, 0.028744865188700775, 0.005663658213783421, 0.060970715560198584, -0.18211090873646874, 0.10393408485962187, 0.024150155162822234, 0.06891469070398754, -0.07012903315716673, -0.14512046269183748, -0.10008212516930418, 0.09783189456751631, 0.013682831125942613, -0.007319653828839887, 0.20495177372632659, -0.09844392596658783, -0.09981873203555938, 0.3763492675193774, -0.06799946912032478, -0.057674675278998666, 0.2266395976523461, -0.2122962268349392, -0.12643590244065872, 0.246095172336532, 0.0878333537261081, 0.13411801657182912, -0.15725080602272762, 0.011828322868620721, 0.017017529254742696, 0.23590409525615327, 0.07696575273111389, 0.11740990142258846, 0.2628585791970098, 0.20228544541701576, 0.014755255973356125, 0.14534045190297773, -0.14292664413136472, -0.06763802108421825, -0.13764681209075064, -0.1586819375664288, -0.20204830964649814, 0.1038705351628558, -0.059381247621263206, -0.12593051481663303, 0.37463126509310374, 0.10765012669084516, 0.20334851321173844, 0.0068109515176331195, 0.25884291950881094, 0.11233618807768923, 0.14564983388317712, -0.002242948275570776, 0.3178031461258583, 0.11029763154235053, 0.12018511656160448, -0.24704763965888155, 0.07954026036134927, -0.046439989536903266] |
1,802.04571 | $CI$-property for decomposable Schur rings over an abelian group | A Schur ring over a finite group is said to be decomposable if it is the
generalized wreath product of Schur rings over smaller groups. In this paper we
establish a sufficient condition for a decomposable Schur ring over the direct
product of elementary abelian groups to be a $CI$-Schur ring. By using this
condition we reprove in a short way known results on the $CI$-property for
decomposable Schur rings over an elementary abelian group of rank at most $5$.
| math.CO math.GR | a schur ring over a finite group is said to be decomposable if it is the generalized wreath product of schur rings over smaller groups in this paper we establish a sufficient condition for a decomposable schur ring over the direct product of elementary abelian groups to be a cischur ring by using this condition we reprove in a short way known results on the ciproperty for decomposable schur rings over an elementary abelian group of rank at most 5 | [['a', 'schur', 'ring', 'over', 'a', 'finite', 'group', 'is', 'said', 'to', 'be', 'decomposable', 'if', 'it', 'is', 'the', 'generalized', 'wreath', 'product', 'of', 'schur', 'rings', 'over', 'smaller', 'groups', 'in', 'this', 'paper', 'we', 'establish', 'a', 'sufficient', 'condition', 'for', 'a', 'decomposable', 'schur', 'ring', 'over', 'the', 'direct', 'product', 'of', 'elementary', 'abelian', 'groups', 'to', 'be', 'a', 'cischur', 'ring', 'by', 'using', 'this', 'condition', 'we', 'reprove', 'in', 'a', 'short', 'way', 'known', 'results', 'on', 'the', 'ciproperty', 'for', 'decomposable', 'schur', 'rings', 'over', 'an', 'elementary', 'abelian', 'group', 'of', 'rank', 'at', 'most', '5']] | [-0.16406915795344573, 0.09051018654990446, -0.11747823293225314, 0.03493122400668187, -0.11245147390171695, -0.1360395367209537, -0.02277533720002677, 0.38773446768904346, -0.3539567450016665, -0.14084172659577468, 0.14843882863612798, -0.14247651423255986, -0.11646515037416695, 0.21333726152825433, -0.10980543088263427, -0.10503735465373701, 0.014606563840061426, 0.13759768176346254, -0.11753326364888404, -0.351386767358352, 0.3559548677637791, -0.00023769786229166083, 0.19510440883011773, 0.05376030134562498, 0.061164628815813325, 0.05619876294468458, -0.053683745910604604, 0.02670756422986205, -0.1409030262297258, 0.09043022227855638, 0.3244326669478025, 0.07131081264919768, 0.2416985590631763, -0.3630921646522788, -0.07785391916061202, 0.24897488658107483, 0.16023240878413886, -0.017301831585474502, -0.034069490166775025, -0.23924868434476546, 0.14197653603668398, -0.31539815722797543, -0.14437998062931, -0.03914100117981434, 0.08069655475451444, 0.0033069273624091577, -0.3048464770022875, -0.016644008218860015, 0.09995966891829784, 0.13125130652378386, -0.01913999063738932, -0.09090090913172716, 0.03788501677963023, 0.03344843808848124, -0.06138047947882651, -0.02395279897758976, 0.1003697159795616, -0.06168840625263655, -0.13185583045467353, 0.36901567928875106, -0.05822196555061218, -0.21803364839452583, 0.14372462526154825, -0.17707827157723025, -0.14415940761757204, 0.16788702905894473, 0.06101698504808622, 0.1735578972957461, -0.04650203780963635, 0.1494396665157416, -0.25519544212147593, 0.07986476697409764, 0.1103342702994362, 0.0010193765808183413, 0.16154775269425067, 0.0838855522004171, 0.12616519458727757, 0.18099914936539838, 0.09642933529073325, 0.01703851732114951, -0.3417126175780327, -0.2340487046764256, -0.14256472770984358, 0.15311457091369307, -0.08917346419818784, -0.1726982568999609, 0.46559297763861907, 0.02533668699936989, 0.1055607048388666, 0.12269787673050395, 0.23317326514575726, 0.04873984438017942, 0.15608663881460252, 0.043808549451522336, 0.09014857480397974, 0.30031942445128107, -0.09242500767159538, -0.08660643606279524, -0.009844157946272155, 0.21205927495462581] |
1,802.04572 | Homological analysis of multi-qubit entanglement | We propose the usage of persistent homologies to characterize multipartite
entanglement. On a multi-qubit data set we introduce metric-like measures
defined only in terms of bipartite entanglement and then we derive barcodes. We
show that they are able to provide a good classification of entangled states,
at least for a small number of qubit.
| quant-ph cs.CG | we propose the usage of persistent homologies to characterize multipartite entanglement on a multiqubit data set we introduce metriclike measures defined only in terms of bipartite entanglement and then we derive barcodes we show that they are able to provide a good classification of entangled states at least for a small number of qubit | [['we', 'propose', 'the', 'usage', 'of', 'persistent', 'homologies', 'to', 'characterize', 'multipartite', 'entanglement', 'on', 'a', 'multiqubit', 'data', 'set', 'we', 'introduce', 'metriclike', 'measures', 'defined', 'only', 'in', 'terms', 'of', 'bipartite', 'entanglement', 'and', 'then', 'we', 'derive', 'barcodes', 'we', 'show', 'that', 'they', 'are', 'able', 'to', 'provide', 'a', 'good', 'classification', 'of', 'entangled', 'states', 'at', 'least', 'for', 'a', 'small', 'number', 'of', 'qubit']] | [-0.17679114608714977, 0.1427370747551322, -0.060179850509114285, 0.1016255234092198, 0.016054585972731863, -0.19251329331934727, 0.07147306884225044, 0.39977532328554877, -0.21748191749038934, -0.26334210123038954, 0.05480964809302585, -0.2704267074802407, -0.1354891129389957, 0.16383381209043027, -0.13952491358267488, 0.07988287580061566, 0.10787164101471987, 0.09105026637930509, -0.06764973993887435, -0.2951991569932067, 0.35171673471039094, -0.039073748169121916, 0.2429472457755495, 0.0867540170955989, 0.1412306056827893, -0.0104690488876292, -0.001247521679572485, 0.04408346516666589, -0.17588067032826343, 0.167138629165021, 0.31566416451500523, 0.19824238974359576, 0.21607646577198197, -0.3983331197458837, -0.1446332074529319, 0.1880889494765412, 0.10144173695287598, 0.16759477645003548, 0.005488666470800699, -0.31280075334426427, 0.0875299436868065, -0.21241207687287694, -0.05846751099711077, -0.22921253416549275, 0.010973074887361791, -0.028308446588063682, -0.2415222183249339, 0.07024387284009545, 0.019111368908650346, 0.057651299310641155, 0.007833184053500494, -0.012222448881301615, -0.024591176481745032, 0.1402914278485157, -0.09310673448015694, -0.03809977792789815, 0.08009323729547085, -0.1092272749196531, -0.18035443986904015, 0.3257579636863536, -0.06470029720070737, -0.24482290150977118, 0.20894042522154954, -0.12948363501130156, -0.18210066868751137, 0.017246977081177412, 0.18036025901394034, 0.123491799691692, -0.12371933948317612, -0.015132556342804391, -0.0885945210336811, 0.1849133637216356, 0.06315468361221806, 0.1704509825428465, 0.1593286287970841, 0.08884373647850696, 0.14127707852188637, 0.28998374676814787, -0.08573968038911482, -0.0545451741889809, -0.32878405868110283, -0.22403853532375284, -0.24592716281336766, 0.09264239644700731, -0.07824714286915777, -0.16783426886562397, 0.4702246133238077, 0.13466437718037655, 0.17886641207668516, 0.12263950084646542, 0.22307083317665038, 0.07325279795272595, 0.06002070277032477, 0.12030601222930407, 0.1714050985907239, 0.13018375455781264, 0.006497383643700568, -0.19761717857586014, 0.025754352358894214, 0.0820891690199022] |
1,802.04573 | Donaldson-Thomas invariants, torus knots, and lattice paths | In this paper we find and explore the correspondence between quivers, torus
knots, and combinatorics of counting paths. Our first result pertains to quiver
representation theory -- we find explicit formulae for classical generating
functions and Donaldson-Thomas invariants of an arbitrary symmetric quiver. We
then focus on quivers corresponding to $(r,s)$ torus knots and show that their
classical generating functions, in the extremal limit and framing $rs$, are
generating functions of lattice paths under the line of the slope $r/s$.
Generating functions of such paths satisfy extremal A-polynomial equations,
which immediately follows after representing them in terms of the Duchon
grammar. Moreover, these extremal A-polynomial equations encode
Donaldson-Thomas invariants, which provides an interesting example of
algebraicity of generating functions of these invariants. We also find a
quantum generalization of these statements, i.e. a relation between motivic
quiver generating functions, quantum extremal knot invariants, and $q$-weighted
path counting. Finally, in the case of the unknot, we generalize this
correspondence to the full HOMFLY-PT invariants and counting of Schr\"oder
paths.
| hep-th math-ph math.CO math.MP math.QA math.RT | in this paper we find and explore the correspondence between quivers torus knots and combinatorics of counting paths our first result pertains to quiver representation theory we find explicit formulae for classical generating functions and donaldsonthomas invariants of an arbitrary symmetric quiver we then focus on quivers corresponding to rs torus knots and show that their classical generating functions in the extremal limit and framing rs are generating functions of lattice paths under the line of the slope rs generating functions of such paths satisfy extremal apolynomial equations which immediately follows after representing them in terms of the duchon grammar moreover these extremal apolynomial equations encode donaldsonthomas invariants which provides an interesting example of algebraicity of generating functions of these invariants we also find a quantum generalization of these statements ie a relation between motivic quiver generating functions quantum extremal knot invariants and qweighted path counting finally in the case of the unknot we generalize this correspondence to the full homflypt invariants and counting of schroder paths | [['in', 'this', 'paper', 'we', 'find', 'and', 'explore', 'the', 'correspondence', 'between', 'quivers', 'torus', 'knots', 'and', 'combinatorics', 'of', 'counting', 'paths', 'our', 'first', 'result', 'pertains', 'to', 'quiver', 'representation', 'theory', 'we', 'find', 'explicit', 'formulae', 'for', 'classical', 'generating', 'functions', 'and', 'donaldsonthomas', 'invariants', 'of', 'an', 'arbitrary', 'symmetric', 'quiver', 'we', 'then', 'focus', 'on', 'quivers', 'corresponding', 'to', 'rs', 'torus', 'knots', 'and', 'show', 'that', 'their', 'classical', 'generating', 'functions', 'in', 'the', 'extremal', 'limit', 'and', 'framing', 'rs', 'are', 'generating', 'functions', 'of', 'lattice', 'paths', 'under', 'the', 'line', 'of', 'the', 'slope', 'rs', 'generating', 'functions', 'of', 'such', 'paths', 'satisfy', 'extremal', 'apolynomial', 'equations', 'which', 'immediately', 'follows', 'after', 'representing', 'them', 'in', 'terms', 'of', 'the', 'duchon', 'grammar', 'moreover', 'these', 'extremal', 'apolynomial', 'equations', 'encode', 'donaldsonthomas', 'invariants', 'which', 'provides', 'an', 'interesting', 'example', 'of', 'algebraicity', 'of', 'generating', 'functions', 'of', 'these', 'invariants', 'we', 'also', 'find', 'a', 'quantum', 'generalization', 'of', 'these', 'statements', 'ie', 'a', 'relation', 'between', 'motivic', 'quiver', 'generating', 'functions', 'quantum', 'extremal', 'knot', 'invariants', 'and', 'qweighted', 'path', 'counting', 'finally', 'in', 'the', 'case', 'of', 'the', 'unknot', 'we', 'generalize', 'this', 'correspondence', 'to', 'the', 'full', 'homflypt', 'invariants', 'and', 'counting', 'of', 'schroder', 'paths']] | [-0.18228778146447133, 0.0875834423179817, -0.12231558445885689, 0.1506355564224305, -0.10241508091002435, -0.155149072421921, 0.03263695893284982, 0.31433029763378245, -0.31372985393255054, -0.2852442144990681, 0.0353747854346666, -0.23361450758020946, -0.24021390788424427, 0.18516778148721882, -0.1459363816720071, 0.04385815254373554, 0.04833310128546538, 0.02972284693850907, -0.12899299066034173, -0.27544767557905464, 0.36879833937154854, -0.050092919912289625, 0.21097587515226382, 0.0676763382078773, 0.10178094869479537, 0.06842489524683107, -0.05189933086059497, -0.028777335723025536, -0.2048552592808585, 0.15834974148275865, 0.2956737158429658, 0.1153950614737581, 0.07273981351305, -0.38772230423585385, -0.10728383896395587, 0.1601098869553583, 0.15834211144027507, 0.08298765740100808, 0.0041022427166773085, -0.21953442222006553, 0.07659667660342809, -0.1669236236589286, -0.16984377440879356, -0.0685788599542805, 0.07746268055069924, 0.08148389488101719, -0.20114783332669203, -0.002837937378392884, 0.06677032700421924, 0.08501119280701383, -0.04001586835323916, -0.07523181920865561, -0.05741257604468101, 0.13184467831230584, 0.028190382162365548, 0.04148339460085252, 0.05662318304303788, -0.19610424344790375, -0.21219731331245226, 0.3165358432351115, 0.020773615630574994, -0.23257627143541318, 0.11841714701965217, -0.11854999391557258, -0.21041709597049627, 0.10393656613751354, 0.051391169624012745, 0.18955172424924052, -0.0492118406360467, 0.12897722576612405, -0.12367096949510924, 0.056518687824105206, 0.17875761246241764, 0.04479873511998797, 0.20500929511284133, 0.0013596447614094098, 0.013473368503925708, 0.24241802381619276, -0.0014517474252086489, -0.12010764092775787, -0.367280202499496, -0.2095659839653014, -0.10103712551725169, 0.13402320899649295, -0.16473873104549133, -0.22019709543670768, 0.4228560059905766, 0.11534555529559332, 0.18367258699967742, 0.21110914346258697, 0.20249786563524363, 0.1335892825628614, 0.03993318159437131, 0.04572682188054223, 0.09610438959751122, 0.19749769305219195, -0.010536989118101516, -0.15873866259262612, -0.026224461675504455, 0.2546313492592402] |
1,802.04574 | The effect of noise intensity on stochastic parabolic equations | In the present paper, the effect of noise intensity on stochastic parabolic
equations is discussed. We focus on the effect of noise on the energy solutions
of the stochastic parabolic equations. By utilising It\^o's formula and the
energy estimate method, we obtain the excitation indices of the energy
solutions $u$ at any finite time $t$. Furthermore, we improve certain existing
results in the literature by presenting a comparably simple method to show
those existing results.
| math.PR | in the present paper the effect of noise intensity on stochastic parabolic equations is discussed we focus on the effect of noise on the energy solutions of the stochastic parabolic equations by utilising itos formula and the energy estimate method we obtain the excitation indices of the energy solutions u at any finite time t furthermore we improve certain existing results in the literature by presenting a comparably simple method to show those existing results | [['in', 'the', 'present', 'paper', 'the', 'effect', 'of', 'noise', 'intensity', 'on', 'stochastic', 'parabolic', 'equations', 'is', 'discussed', 'we', 'focus', 'on', 'the', 'effect', 'of', 'noise', 'on', 'the', 'energy', 'solutions', 'of', 'the', 'stochastic', 'parabolic', 'equations', 'by', 'utilising', 'itos', 'formula', 'and', 'the', 'energy', 'estimate', 'method', 'we', 'obtain', 'the', 'excitation', 'indices', 'of', 'the', 'energy', 'solutions', 'u', 'at', 'any', 'finite', 'time', 't', 'furthermore', 'we', 'improve', 'certain', 'existing', 'results', 'in', 'the', 'literature', 'by', 'presenting', 'a', 'comparably', 'simple', 'method', 'to', 'show', 'those', 'existing', 'results']] | [-0.09952875555803378, 0.04442434671024482, -0.07119420452664296, 0.07613961004496862, -0.061173916508754096, -0.09364686042691271, 0.050879711296098924, 0.3454272878170013, -0.2562053374697765, -0.28962110629926124, 0.1026386099215597, -0.279897881783545, -0.134186987663464, 0.23639269118430092, -0.06804500977819164, 0.053877091327061255, 0.07173056979974111, 0.04072177834808827, -0.07878131671498219, -0.2340556496133407, 0.3584154652804136, 0.016205646408100922, 0.2759564575801293, 0.054690228551626204, 0.12320141171415647, -0.0256726099892209, -0.08050128497183323, 0.026391683978339037, -0.1914402217666308, 0.09994505672405163, 0.20684201505035163, 0.03931454629947742, 0.285360270490249, -0.42585744567215444, -0.21000341388086477, 0.09340561404824257, 0.09232546874554828, 0.1456557627643148, -0.06384279490603754, -0.2820629133035739, 0.06454249173402786, -0.13556769132614135, -0.16353618806228043, -0.06819828291734059, -0.03902310195068518, 0.11020133407165607, -0.25926917475958666, 0.11059023058119541, 0.09254266033725192, 0.02133372979859511, -0.11748866389195124, -0.1395179037563503, 0.011400339671721061, 0.042643904580424226, 0.05143736983649433, -0.034345452083895604, 0.07955453181639313, -0.10522553681085507, -0.10990598415335019, 0.32545225316037735, -0.15179429199546576, -0.2537489295999209, 0.1443056739370028, -0.1418679942190647, -0.11429236583566914, 0.1298065680017074, 0.16791221963241695, 0.1655273830766479, -0.14103206317871808, 0.1410455723409541, -0.01817680316666762, 0.11716712886157135, 0.041685693835218744, 0.015416979764898617, 0.06564351125309864, 0.15662619384626547, 0.0869535531103611, 0.1385459951683879, -0.09201399971110126, -0.06938163898264368, -0.3072303443650405, -0.10317780842383703, -0.14840348484615484, 0.04764672563721736, -0.09623493670776952, -0.14204030945897103, 0.41909319058060646, 0.18523004125182826, 0.17875470827023188, 0.10058312381307284, 0.326595713198185, 0.2263811121384303, 0.008000021222978831, 0.07174845521881555, 0.21877831111351648, 0.1077064117603004, 0.14903083437432846, -0.26394629346517223, 0.04398210033774376, 0.13045073685236275] |
1,802.04575 | The solar wind in time: a change in the behaviour of older winds? | In the present paper, we model the wind of solar analogues at different ages
to investigate the evolution of the solar wind. Recently, it has been suggested
that winds of solar type stars might undergo a change in properties at old
ages, whereby stars older than the Sun would be less efficient in carrying away
angular momentum than what was traditionally believed. Adding to this, recent
observations suggest that old solar-type stars show a break in coronal
properties, with a steeper decay in X-ray luminosities and temperatures at
older ages. We use these X-ray observations to constrain the thermal
acceleration of winds of solar analogues. Our sample is based on the stars from
the `Sun in time' project with ages between 120-7000 Myr. The break in X-ray
properties leads to a break in wind mass-loss rates ($\dot{M}$) at roughly 2
Gyr, with $\dot{M}$ (t < 2 Gyr) $\propto t^{-0.74}$ and $\dot{M}$ (t > 2 Gyr)
$\propto$ $t^{-3.9}$. This steep decay in $\dot{M}$ at older ages could be the
reason why older stars are less efficient at carrying away angular momentum,
which would explain the anomalously rapid rotation observed in older stars. We
also show that none of the stars in our sample would have winds dense enough to
produce thermal emission above 1-2 GHz, explaining why their radio emissions
have not yet been detected. Combining our models with dynamo evolution models
for the magnetic field of the Earth we find that, at early ages ($\approx$100
Myr) our Earth had a magnetosphere that was 3 or more times smaller than its
current size.
| astro-ph.SR astro-ph.EP | in the present paper we model the wind of solar analogues at different ages to investigate the evolution of the solar wind recently it has been suggested that winds of solar type stars might undergo a change in properties at old ages whereby stars older than the sun would be less efficient in carrying away angular momentum than what was traditionally believed adding to this recent observations suggest that old solartype stars show a break in coronal properties with a steeper decay in xray luminosities and temperatures at older ages we use these xray observations to constrain the thermal acceleration of winds of solar analogues our sample is based on the stars from the sun in time project with ages between 1207000 myr the break in xray properties leads to a break in wind massloss rates dotm at roughly 2 gyr with dotm t 2 gyr propto t074 and dotm t 2 gyr propto t39 this steep decay in dotm at older ages could be the reason why older stars are less efficient at carrying away angular momentum which would explain the anomalously rapid rotation observed in older stars we also show that none of the stars in our sample would have winds dense enough to produce thermal emission above 12 ghz explaining why their radio emissions have not yet been detected combining our models with dynamo evolution models for the magnetic field of the earth we find that at early ages approx100 myr our earth had a magnetosphere that was 3 or more times smaller than its current size | [['in', 'the', 'present', 'paper', 'we', 'model', 'the', 'wind', 'of', 'solar', 'analogues', 'at', 'different', 'ages', 'to', 'investigate', 'the', 'evolution', 'of', 'the', 'solar', 'wind', 'recently', 'it', 'has', 'been', 'suggested', 'that', 'winds', 'of', 'solar', 'type', 'stars', 'might', 'undergo', 'a', 'change', 'in', 'properties', 'at', 'old', 'ages', 'whereby', 'stars', 'older', 'than', 'the', 'sun', 'would', 'be', 'less', 'efficient', 'in', 'carrying', 'away', 'angular', 'momentum', 'than', 'what', 'was', 'traditionally', 'believed', 'adding', 'to', 'this', 'recent', 'observations', 'suggest', 'that', 'old', 'solartype', 'stars', 'show', 'a', 'break', 'in', 'coronal', 'properties', 'with', 'a', 'steeper', 'decay', 'in', 'xray', 'luminosities', 'and', 'temperatures', 'at', 'older', 'ages', 'we', 'use', 'these', 'xray', 'observations', 'to', 'constrain', 'the', 'thermal', 'acceleration', 'of', 'winds', 'of', 'solar', 'analogues', 'our', 'sample', 'is', 'based', 'on', 'the', 'stars', 'from', 'the', 'sun', 'in', 'time', 'project', 'with', 'ages', 'between', '1207000', 'myr', 'the', 'break', 'in', 'xray', 'properties', 'leads', 'to', 'a', 'break', 'in', 'wind', 'massloss', 'rates', 'dotm', 'at', 'roughly', '2', 'gyr', 'with', 'dotm', 't', '2', 'gyr', 'propto', 't074', 'and', 'dotm', 't', '2', 'gyr', 'propto', 't39', 'this', 'steep', 'decay', 'in', 'dotm', 'at', 'older', 'ages', 'could', 'be', 'the', 'reason', 'why', 'older', 'stars', 'are', 'less', 'efficient', 'at', 'carrying', 'away', 'angular', 'momentum', 'which', 'would', 'explain', 'the', 'anomalously', 'rapid', 'rotation', 'observed', 'in', 'older', 'stars', 'we', 'also', 'show', 'that', 'none', 'of', 'the', 'stars', 'in', 'our', 'sample', 'would', 'have', 'winds', 'dense', 'enough', 'to', 'produce', 'thermal', 'emission', 'above', '12', 'ghz', 'explaining', 'why', 'their', 'radio', 'emissions', 'have', 'not', 'yet', 'been', 'detected', 'combining', 'our', 'models', 'with', 'dynamo', 'evolution', 'models', 'for', 'the', 'magnetic', 'field', 'of', 'the', 'earth', 'we', 'find', 'that', 'at', 'early', 'ages', 'approx100', 'myr', 'our', 'earth', 'had', 'a', 'magnetosphere', 'that', 'was', '3', 'or', 'more', 'times', 'smaller', 'than', 'its', 'current', 'size']] | [-0.026906010657350366, 0.2428737512948497, -0.08027244063399736, 0.14871440079314058, -0.10111359076379517, -0.067675232320533, 0.040795673004373215, 0.4449433287995499, -0.1577078954193943, -0.3908294472092575, 0.045939579960265625, -0.2736618922519779, 0.00407943858962701, 0.23381766072084564, -0.07232625962076203, -0.0797921482506551, 0.07429647418515135, -0.03545534151155942, -0.0731666496259525, -0.2472951270986435, 0.242819070237122, 0.08525046323021773, 0.11012850767236146, -0.04504907480982501, 0.007327222975555044, -0.18863758885359405, -0.016634099261272094, -0.06400970347963865, -0.14381907005908168, 0.021245908719494708, 0.21479985662393633, 0.12039521585269146, 0.23874021715722804, -0.4241364378291575, -0.25515297216556376, 0.06608852597726003, 0.24423346404246118, 0.020482602626240503, -0.07738758149799799, -0.19329926992275628, 0.10046491600889369, -0.1917585047330101, -0.18825428761801746, 0.06698970761612173, 0.09050172973332148, -0.008196361985620718, -0.22836163159741393, 0.15458282903087228, 0.03840583802134073, 0.12043097690866841, -0.12666432739572975, -0.13614348191840125, -0.053635952570981006, 0.05359953788177709, 0.09157158019131252, 0.07931310114768413, 0.15361773670658238, -0.10789564421017792, -0.04125001708378604, 0.35263543243180645, -0.06657824063462219, 0.013453029301883869, 0.2493272796119816, -0.26104491360507215, -0.17642885545095385, 0.13852925753661308, 0.14625961767408505, 0.13256778392052754, -0.1464364003433391, -0.03126422238812327, 0.00972577996187403, 0.2130639230680847, 0.07330281185094527, 0.04042250925653376, 0.32670962093614564, 0.13660713028326962, 0.009095762015226506, 0.04120504343430981, -0.1925132886173615, -0.061762579960853235, -0.1754960776090102, -0.09705701730820503, -0.08436225132850655, 0.1610335696601086, -0.10878708527065623, -0.08320845631403576, 0.3132723531010741, 0.18755540723168804, 0.2038084101401154, 0.07652271786016997, 0.2817213375377649, 0.0996057873667586, 0.15889356347421804, 0.20911911326052635, 0.33255953766232316, 0.1575161593175645, 0.14649746496078753, -0.23730244021185912, 0.10885071358688594, 0.0011011847586356565] |
1,802.04576 | Polar-Coded Forward Error Correction for MLC NAND Flash Memory Polar FEC
for NAND Flash Memory | With the ever-growing storage density, high-speed, and low-cost data access,
flash memory has inevitably become popular. Multi-level cell (MLC) NAND flash
memory, which can well balance the data density and memory stability, has
occupied the largest market share of flash memory. With the aggressive memory
scaling, however, the reliability decays sharply owing to multiple
interferences. Therefore, the control system should be embedded with a suitable
error correction code (ECC) to guarantee the data integrity and accuracy. We
proposed the pre-check scheme which is a multi-strategy polar code scheme to
strike a balance between reasonable frame error rate (FER) and decoding
latency. Three decoders namely binary-input, quantized-soft, and pure-soft
decoders are embedded in this scheme. Since the calculation of soft
log-likelihood ratio (LLR) inputs needs multiple sensing operations and
optional quantization boundaries, a 2-bit quantized hard-decision decoder is
proposed to outperform the hard-decoded LDPC bit-flipping decoder with fewer
sensing operations. We notice that polar codes have much lower computational
complexity compared to LDPC codes. The stepwise maximum mutual information
(SMMI) scheme is also proposed to obtain overlapped boundaries without
exhausting search. The mapping scheme using Gray code is employed and proved to
achieve better raw error performance compared to other alternatives. Hardware
architectures are also given in this paper.
| cs.AR | with the evergrowing storage density highspeed and lowcost data access flash memory has inevitably become popular multilevel cell mlc nand flash memory which can well balance the data density and memory stability has occupied the largest market share of flash memory with the aggressive memory scaling however the reliability decays sharply owing to multiple interferences therefore the control system should be embedded with a suitable error correction code ecc to guarantee the data integrity and accuracy we proposed the precheck scheme which is a multistrategy polar code scheme to strike a balance between reasonable frame error rate fer and decoding latency three decoders namely binaryinput quantizedsoft and puresoft decoders are embedded in this scheme since the calculation of soft loglikelihood ratio llr inputs needs multiple sensing operations and optional quantization boundaries a 2bit quantized harddecision decoder is proposed to outperform the harddecoded ldpc bitflipping decoder with fewer sensing operations we notice that polar codes have much lower computational complexity compared to ldpc codes the stepwise maximum mutual information smmi scheme is also proposed to obtain overlapped boundaries without exhausting search the mapping scheme using gray code is employed and proved to achieve better raw error performance compared to other alternatives hardware architectures are also given in this paper | [['with', 'the', 'evergrowing', 'storage', 'density', 'highspeed', 'and', 'lowcost', 'data', 'access', 'flash', 'memory', 'has', 'inevitably', 'become', 'popular', 'multilevel', 'cell', 'mlc', 'nand', 'flash', 'memory', 'which', 'can', 'well', 'balance', 'the', 'data', 'density', 'and', 'memory', 'stability', 'has', 'occupied', 'the', 'largest', 'market', 'share', 'of', 'flash', 'memory', 'with', 'the', 'aggressive', 'memory', 'scaling', 'however', 'the', 'reliability', 'decays', 'sharply', 'owing', 'to', 'multiple', 'interferences', 'therefore', 'the', 'control', 'system', 'should', 'be', 'embedded', 'with', 'a', 'suitable', 'error', 'correction', 'code', 'ecc', 'to', 'guarantee', 'the', 'data', 'integrity', 'and', 'accuracy', 'we', 'proposed', 'the', 'precheck', 'scheme', 'which', 'is', 'a', 'multistrategy', 'polar', 'code', 'scheme', 'to', 'strike', 'a', 'balance', 'between', 'reasonable', 'frame', 'error', 'rate', 'fer', 'and', 'decoding', 'latency', 'three', 'decoders', 'namely', 'binaryinput', 'quantizedsoft', 'and', 'puresoft', 'decoders', 'are', 'embedded', 'in', 'this', 'scheme', 'since', 'the', 'calculation', 'of', 'soft', 'loglikelihood', 'ratio', 'llr', 'inputs', 'needs', 'multiple', 'sensing', 'operations', 'and', 'optional', 'quantization', 'boundaries', 'a', '2bit', 'quantized', 'harddecision', 'decoder', 'is', 'proposed', 'to', 'outperform', 'the', 'harddecoded', 'ldpc', 'bitflipping', 'decoder', 'with', 'fewer', 'sensing', 'operations', 'we', 'notice', 'that', 'polar', 'codes', 'have', 'much', 'lower', 'computational', 'complexity', 'compared', 'to', 'ldpc', 'codes', 'the', 'stepwise', 'maximum', 'mutual', 'information', 'smmi', 'scheme', 'is', 'also', 'proposed', 'to', 'obtain', 'overlapped', 'boundaries', 'without', 'exhausting', 'search', 'the', 'mapping', 'scheme', 'using', 'gray', 'code', 'is', 'employed', 'and', 'proved', 'to', 'achieve', 'better', 'raw', 'error', 'performance', 'compared', 'to', 'other', 'alternatives', 'hardware', 'architectures', 'are', 'also', 'given', 'in', 'this', 'paper']] | [-0.17336473977388217, 0.02765750220008745, -0.06344903405873895, 0.08365947692058613, -0.03603895030470721, -0.2985233580143067, 0.11605209623133131, 0.43555414760622924, -0.28104490498677265, -0.3309183926436261, 0.13597254021743568, -0.22474937934400926, -0.1163958948796037, 0.16888896501026682, -0.1791399379646213, 0.14949619847562295, 0.1033732073159035, 0.02979625219231462, -0.10231083239144256, -0.3327323614250928, 0.18847994075794453, 0.19616221844819673, 0.35659024834141406, -0.015612616433115135, 0.07500347418921628, -0.049642240757058406, -0.010629328479302194, -0.06416253811534119, -0.05431703622287324, 0.09563710072692576, 0.27031822310900544, 0.1571297761296, 0.25849139693381235, -0.4431929422560804, -0.23547817393449214, 0.05328866895379985, 0.13175287812872527, 0.12339362762799587, -0.054990906457604814, -0.22061649672492073, 0.12883974996216485, -0.23318524888757927, 0.04434918004129394, -0.0791990412100966, -0.04711721382181853, 0.024747516745426166, -0.32319358642112117, -0.0018789180926634503, 0.025700140620003743, 0.019751529845119777, -0.010487971896204748, -0.12986628342995632, 0.026300232460621395, 0.1278032933481111, -0.016377072799675572, 0.06559688115224077, 0.11811420115357807, -0.06707020539341935, -0.11891295619107085, 0.34935041689520396, -0.007739356549782449, -0.21724403885266574, 0.1620982262762401, -0.045688722608955075, -0.07210099041287608, 0.1961567451637766, 0.2199363997465589, 0.03198398935884981, -0.13289536983050002, 0.03536232977387555, 0.05161962310756038, 0.24292704839204332, 0.10825916827459053, 0.15339975945624004, 0.13242191668219058, 0.18381346018555955, 0.0415145385209838, 0.16251716597133037, -0.14365275798530636, -0.12545769606425033, -0.21656523778887804, -0.14000259941498855, -0.19154040886747553, -0.04165072068847312, -0.11168374760562996, -0.1540951901138416, 0.3192446967836157, 0.16066773854003386, 0.1086950311620761, 0.12378710559385787, 0.4167094332867949, 0.057402237098241965, 0.15621994780560067, 0.20508408228513494, 0.15182062549966163, 0.10227060045248695, 0.09578841201974804, -0.2285101795752574, 0.0897234904068279, 0.05607395168015931] |
1,802.04577 | Selfinjective algebras having a generalized standard family of
quasi-tubes maximally saturated by simple and projective modules | We give a complete description of finite dimensional selfinjective algebras
over an algebraically closed field whose Auslander-Reiten quiver admits a
generalized standard family of quasi-tubes maximally saturated by simple and
projective modules. In particular, we show that these algebras are
selfinjective algebras of strictly canonical type.
| math.RT | we give a complete description of finite dimensional selfinjective algebras over an algebraically closed field whose auslanderreiten quiver admits a generalized standard family of quasitubes maximally saturated by simple and projective modules in particular we show that these algebras are selfinjective algebras of strictly canonical type | [['we', 'give', 'a', 'complete', 'description', 'of', 'finite', 'dimensional', 'selfinjective', 'algebras', 'over', 'an', 'algebraically', 'closed', 'field', 'whose', 'auslanderreiten', 'quiver', 'admits', 'a', 'generalized', 'standard', 'family', 'of', 'quasitubes', 'maximally', 'saturated', 'by', 'simple', 'and', 'projective', 'modules', 'in', 'particular', 'we', 'show', 'that', 'these', 'algebras', 'are', 'selfinjective', 'algebras', 'of', 'strictly', 'canonical', 'type']] | [-0.18396705399370855, 0.11112121562247113, -0.031242328012983003, 0.08139912763403521, -0.11074539266216259, -0.25040935133066444, -0.11474790195158373, 0.39008029765552943, -0.3600874610348708, -0.07467987570497725, 0.07661179952685618, -0.14055744944554235, -0.15050682231990828, 0.19252621997147798, -0.19407965424988005, -0.13136321113755306, 0.10581681531233092, 0.2067749019091328, -0.1235862999378393, -0.3626246262755659, 0.472535501089361, -0.1030325931471048, 0.2490848544985056, -0.005650218783153428, 0.1698095816704962, 0.08309527770098712, 0.019515601607660454, 0.11197380284882254, -0.21642008308505561, 0.11379297403101292, 0.37834844251887667, 0.09049794400731723, 0.1518513029648198, -0.3651584007673793, -0.08386563608008954, 0.27571858541212146, 0.2098049534070823, 0.06497216833134492, -0.03130701815502511, -0.21715865892668565, 0.09055891283755449, -0.29339226430488957, -0.1687858228157792, -0.12985769553730886, 0.10566064082344787, -0.02597273950357501, -0.25297260887713896, 0.03210382244239251, 0.14509590934548114, 0.2362559282531341, -0.12757608624589112, -0.061447771162622504, -0.11020524709795912, -0.03365353238251474, -0.174312654717101, -0.016559667429990238, 0.07513084997319514, -0.07656271623450771, -0.21440713773998948, 0.2815192664701802, -0.0463870568614867, -0.24263959431813822, 0.14294000938534737, -0.19648178953470455, -0.12710331500921812, 0.17287097949948577, -0.015724876067704625, 0.17553110631803673, -0.05076781372643179, 0.2629568282294915, -0.20672786588677103, -0.010668541873908706, 0.07078441904029913, 0.014635992246783441, 0.18389416344256865, 0.09756009896906713, 0.006355507247563865, 0.17375908634728857, 0.11676537543535233, -0.06133282281872299, -0.40521584434641733, -0.17250022979246246, 0.02224405503107442, 0.21327264284094175, -0.16688258470417672, -0.26232595356802146, 0.45570200524396365, 0.033266506689445426, 0.1328731455322769, 0.1914542968902323, 0.16222413902481397, 0.03586493515306049, 0.1158764677743117, 0.03989567657311757, 0.10155865860482056, 0.3271700660853336, -0.10566352412570268, -0.06339686287360059, -0.1347265362015201, 0.28831863664090635] |
1,802.04578 | Light emission from gold nanoparticles under ultrafast near-infrared
excitation: thermal emission, inelastic light scattering or multiphoton
luminescence? | Gold nanoparticles emit broad-band upconverted luminescence upon irradiation
with pulsed infrared laser radiation. Although the phenomenon is widely
observed, considerable disagreement still exists concerning the underlying
physics - most notably over the applicability of concepts such as multiphoton
absorption, inelastic scattering, and interband and intraband electronic
transitions. Here, we study single particles and small clusters of particles by
employing a spectrally resolved power-law analysis of the irradiation-dependent
emission as a sensitive probe of these physical models. Two regimes of emission
are identified: at low irradiance levels of kW/cm2, the emission follows a
well-defined integer-exponent power law suggestive of a multiphoton process.
However, at higher irradiance levels of several kW/cm2, the nonlinearity
exponent itself depends on the photon energy detected, a tell-tale signature of
a radiating heated electron gas. We show that in this regime, the experiments
are incompatible with both interband transitions and inelastic light scattering
as the cause the luminescence, while they are compatible with the notion of
luminescence linked to intraband transitions.
| cond-mat.mtrl-sci cond-mat.mes-hall | gold nanoparticles emit broadband upconverted luminescence upon irradiation with pulsed infrared laser radiation although the phenomenon is widely observed considerable disagreement still exists concerning the underlying physics most notably over the applicability of concepts such as multiphoton absorption inelastic scattering and interband and intraband electronic transitions here we study single particles and small clusters of particles by employing a spectrally resolved powerlaw analysis of the irradiationdependent emission as a sensitive probe of these physical models two regimes of emission are identified at low irradiance levels of kwcm2 the emission follows a welldefined integerexponent power law suggestive of a multiphoton process however at higher irradiance levels of several kwcm2 the nonlinearity exponent itself depends on the photon energy detected a telltale signature of a radiating heated electron gas we show that in this regime the experiments are incompatible with both interband transitions and inelastic light scattering as the cause the luminescence while they are compatible with the notion of luminescence linked to intraband transitions | [['gold', 'nanoparticles', 'emit', 'broadband', 'upconverted', 'luminescence', 'upon', 'irradiation', 'with', 'pulsed', 'infrared', 'laser', 'radiation', 'although', 'the', 'phenomenon', 'is', 'widely', 'observed', 'considerable', 'disagreement', 'still', 'exists', 'concerning', 'the', 'underlying', 'physics', 'most', 'notably', 'over', 'the', 'applicability', 'of', 'concepts', 'such', 'as', 'multiphoton', 'absorption', 'inelastic', 'scattering', 'and', 'interband', 'and', 'intraband', 'electronic', 'transitions', 'here', 'we', 'study', 'single', 'particles', 'and', 'small', 'clusters', 'of', 'particles', 'by', 'employing', 'a', 'spectrally', 'resolved', 'powerlaw', 'analysis', 'of', 'the', 'irradiationdependent', 'emission', 'as', 'a', 'sensitive', 'probe', 'of', 'these', 'physical', 'models', 'two', 'regimes', 'of', 'emission', 'are', 'identified', 'at', 'low', 'irradiance', 'levels', 'of', 'kwcm2', 'the', 'emission', 'follows', 'a', 'welldefined', 'integerexponent', 'power', 'law', 'suggestive', 'of', 'a', 'multiphoton', 'process', 'however', 'at', 'higher', 'irradiance', 'levels', 'of', 'several', 'kwcm2', 'the', 'nonlinearity', 'exponent', 'itself', 'depends', 'on', 'the', 'photon', 'energy', 'detected', 'a', 'telltale', 'signature', 'of', 'a', 'radiating', 'heated', 'electron', 'gas', 'we', 'show', 'that', 'in', 'this', 'regime', 'the', 'experiments', 'are', 'incompatible', 'with', 'both', 'interband', 'transitions', 'and', 'inelastic', 'light', 'scattering', 'as', 'the', 'cause', 'the', 'luminescence', 'while', 'they', 'are', 'compatible', 'with', 'the', 'notion', 'of', 'luminescence', 'linked', 'to', 'intraband', 'transitions']] | [-0.07635570833530358, 0.22223120815589192, -0.05169734212726077, 0.09834850046634597, -0.005216084328488742, -0.15555217335729496, 0.06042612022980585, 0.4367787821553879, -0.2302393229997873, -0.30902383110329784, 0.0015250624508903541, -0.3435969598394651, -0.08087489027992724, 0.20825200586656387, 0.023750966715609063, 0.017362222998108, -0.015573016295545035, -0.08705191609235655, 0.02202542375712453, -0.10950196710392046, 0.2976932926985626, 0.07959850729093887, 0.29098237449048747, 0.12487438107082932, 0.08354083624211435, -0.01876644992489391, -0.008148077302699133, -0.03418755387852651, -0.07819394994280714, 0.046851074841504005, 0.27096024120143075, -7.016402495712597e-05, 0.19760499831494407, -0.40834136321411835, -0.2617955500258549, 0.07149530686611621, 0.1601739575643879, 0.07512045840813014, -0.06860264163444062, -0.2400886054036514, -0.02556711782394729, -0.10803796875331065, -0.11102249439782608, -0.016185945932469938, -0.0008676717005762625, 0.018754612938255096, -0.23093774770740824, 0.09919212437350511, 0.04322924148739657, 0.06698266009551397, -0.08324273389486468, -0.05976793625224266, -0.05002836443726783, 0.026747920311790723, 0.05586670845966086, -0.02369794154811581, 0.22634786096262682, -0.12727027822875922, -0.1299162496268888, 0.38401658866577637, -0.08408366015863529, -0.018466544654549343, 0.204191206372343, -0.2238663422342922, -0.10257406420687572, 0.26912142427186975, 0.10722606654296288, 0.1156359799562824, -0.1228835017576536, 0.02278798508840347, 0.011293928292203948, 0.22357957601049763, 0.1273443074477547, 0.17202122785839374, 0.2584771283320874, 0.15774785574404118, -0.03930435857232313, 0.10488387473182094, -0.1508623460822548, -0.04049635397686814, -0.26593445576380315, -0.07484419296657585, -0.1842132515233496, 0.11036776234930878, -0.05031872385540133, -0.16138317735044297, 0.38222077308997787, 0.10630726086421181, 0.17737422679892237, -0.01672898477806727, 0.3028046972550718, 0.17249519813138373, 0.046191068016923964, 0.009743598443079994, 0.3109476872320686, 0.1578544773413042, 0.11021976193820954, -0.2763196645009545, 0.06555076854257202, -0.06864109133248744] |
1,802.04579 | Semi-modules and irreducible components of affine Deligne-Lusztig
varieties | Let $G$ be the Weil restriction of a general linear group. By extending the
method of semi-modules developed by de Jong, Oort, Viehmann and Hamacher, we
obtain a stratification of the affine Deligne-Lusztig varieties for $G$ (in the
affine Grassmannian) attached to a minuscule coweight and a basic element. As
an application, we verify a conjecture by Chen and Zhu on irreducible
components of affine Deligne-Lusztig varieties for $G$.
| math.AG math.RT | let g be the weil restriction of a general linear group by extending the method of semimodules developed by de jong oort viehmann and hamacher we obtain a stratification of the affine delignelusztig varieties for g in the affine grassmannian attached to a minuscule coweight and a basic element as an application we verify a conjecture by chen and zhu on irreducible components of affine delignelusztig varieties for g | [['let', 'g', 'be', 'the', 'weil', 'restriction', 'of', 'a', 'general', 'linear', 'group', 'by', 'extending', 'the', 'method', 'of', 'semimodules', 'developed', 'by', 'de', 'jong', 'oort', 'viehmann', 'and', 'hamacher', 'we', 'obtain', 'a', 'stratification', 'of', 'the', 'affine', 'delignelusztig', 'varieties', 'for', 'g', 'in', 'the', 'affine', 'grassmannian', 'attached', 'to', 'a', 'minuscule', 'coweight', 'and', 'a', 'basic', 'element', 'as', 'an', 'application', 'we', 'verify', 'a', 'conjecture', 'by', 'chen', 'and', 'zhu', 'on', 'irreducible', 'components', 'of', 'affine', 'delignelusztig', 'varieties', 'for', 'g']] | [-0.16767980213668468, 0.04132959432414888, -0.13862754067109115, -0.00948226797407952, -0.13430812524334676, -0.12838561064226256, -0.002745909845807414, 0.26465912303630856, -0.3351716002368409, -0.18361134870328766, 0.09074413528551172, -0.15924433429482515, -0.14705148130061402, 0.2204206677801583, -0.23758889327122681, -0.038271617812468954, 0.01016641625682351, 0.043521179702888796, -0.04928966774267779, -0.3584727174669936, 0.41470194788838644, -0.02793733044055061, 0.2180576272362816, 0.018808015757172867, 0.15048664883184043, 0.063563772301743, -0.017697967075999233, -0.030103707230528413, -0.13865945692025666, 0.18554052038361196, 0.36835051519607287, 0.06450277790292233, 0.20008022595952818, -0.3446659255583865, -0.1405819434625353, 0.1981915400997884, 0.11587427887201741, 0.01663675954341011, 0.011442893081803577, -0.31266596605596336, 0.08478328553905738, -0.21297679879311202, -0.2101464269588283, -0.04472140781581402, 0.10931413202290086, 0.030591016319796334, -0.2468906378886406, -0.041150921132361545, 0.10554481904778251, 0.20723422414258771, -0.05332054724862826, -0.15445061751297148, -0.07593321344018847, 0.012169920549174582, -0.1007942679081706, 0.07098203708512196, 0.08471386574640655, -0.04711228592213297, -0.1361087877303362, 0.3738270233506742, -0.11141023249027954, -0.19971415050921665, 0.07981165771480596, -0.1007593325946642, -0.17687643813036813, 0.1024642745775265, 0.10003566982197588, 0.13431665787230368, 0.040079910416102066, 0.23832442032838025, -0.16453563606879418, -0.04235533149103108, 0.1189765638091426, -0.11489253825477688, 0.10493940023951691, 0.04099801905871625, 0.041421148800219416, 0.11306284215348517, 0.028994951859467488, 0.07728848681933638, -0.346410036302995, -0.22228753418270228, -0.06743083178214189, 0.15233066327114037, -0.11157777998195725, -0.13928922782719566, 0.3722376419582229, 0.026428661609500432, 0.18860963676664708, 0.14541820868633795, 0.18810775819356026, 0.02201393559622322, 0.03348467656262759, 0.0734255971333039, 0.09389103867410534, 0.36235718497588043, -0.12495694648258496, -0.1864837637387108, -0.010679843052681805, 0.2772015262854056] |
1,802.0458 | Replication studies considered harmful | CONTEXT: There is growing interest in establishing software engineering as an
evidence-based discipline. To that end, replication is often used to gain
confidence in empirical findings, as opposed to reproduction where the goal is
showing the correctness, or validity of the published results. OBJECTIVE: To
consider what is required for a replication study to confirm the original
experiment and apply this understanding in software engineering. METHOD:
Simulation is used to demonstrate why the prediction interval for confirmation
can be surprisingly wide. This analysis is applied to three recent
replications. RESULTS: It is shown that because the prediction intervals are
wide, almost all replications are confirmatory, so in that sense there is no
'replication crisis', however, the contributions to knowledge are negligible.
CONCLUSIONS: Replicating empirical software engineering experiments,
particularly if they are under-powered or under-reported, is a waste of
scientific resources. By contrast, meta-analysis is strongly advocated so that
all relevant experiments are combined to estimate the population effect.
| cs.SE | context there is growing interest in establishing software engineering as an evidencebased discipline to that end replication is often used to gain confidence in empirical findings as opposed to reproduction where the goal is showing the correctness or validity of the published results objective to consider what is required for a replication study to confirm the original experiment and apply this understanding in software engineering method simulation is used to demonstrate why the prediction interval for confirmation can be surprisingly wide this analysis is applied to three recent replications results it is shown that because the prediction intervals are wide almost all replications are confirmatory so in that sense there is no replication crisis however the contributions to knowledge are negligible conclusions replicating empirical software engineering experiments particularly if they are underpowered or underreported is a waste of scientific resources by contrast metaanalysis is strongly advocated so that all relevant experiments are combined to estimate the population effect | [['context', 'there', 'is', 'growing', 'interest', 'in', 'establishing', 'software', 'engineering', 'as', 'an', 'evidencebased', 'discipline', 'to', 'that', 'end', 'replication', 'is', 'often', 'used', 'to', 'gain', 'confidence', 'in', 'empirical', 'findings', 'as', 'opposed', 'to', 'reproduction', 'where', 'the', 'goal', 'is', 'showing', 'the', 'correctness', 'or', 'validity', 'of', 'the', 'published', 'results', 'objective', 'to', 'consider', 'what', 'is', 'required', 'for', 'a', 'replication', 'study', 'to', 'confirm', 'the', 'original', 'experiment', 'and', 'apply', 'this', 'understanding', 'in', 'software', 'engineering', 'method', 'simulation', 'is', 'used', 'to', 'demonstrate', 'why', 'the', 'prediction', 'interval', 'for', 'confirmation', 'can', 'be', 'surprisingly', 'wide', 'this', 'analysis', 'is', 'applied', 'to', 'three', 'recent', 'replications', 'results', 'it', 'is', 'shown', 'that', 'because', 'the', 'prediction', 'intervals', 'are', 'wide', 'almost', 'all', 'replications', 'are', 'confirmatory', 'so', 'in', 'that', 'sense', 'there', 'is', 'no', 'replication', 'crisis', 'however', 'the', 'contributions', 'to', 'knowledge', 'are', 'negligible', 'conclusions', 'replicating', 'empirical', 'software', 'engineering', 'experiments', 'particularly', 'if', 'they', 'are', 'underpowered', 'or', 'underreported', 'is', 'a', 'waste', 'of', 'scientific', 'resources', 'by', 'contrast', 'metaanalysis', 'is', 'strongly', 'advocated', 'so', 'that', 'all', 'relevant', 'experiments', 'are', 'combined', 'to', 'estimate', 'the', 'population', 'effect']] | [-0.06244801289012915, 0.061341193060429705, -0.08004378470226745, 0.10676927789692071, -0.1087543177698397, -0.12892292622075993, 0.051977517749359714, 0.40971265060225165, -0.21373865553885227, -0.3315831858434868, 0.14584394617085758, -0.2799806686713584, -0.16765101238255553, 0.23616121426118608, -0.11326237918832634, 0.05093176690625805, 0.11907326559170703, -0.005734608367179768, 0.02056406906296063, -0.2871539140299929, 0.23889657362847577, 0.07568287185858935, 0.34892093011213443, 0.08295386509462908, -0.006690701579563084, -0.03518042983664082, -0.07394897332414985, 0.010808254992943021, -0.10570076226107217, 0.1114964085959688, 0.3650663650294035, 0.20770132443808678, 0.36599435210463743, -0.3863634542131773, -0.21751557706112537, 0.10209557907272696, 0.16900551828328828, 0.11095213314188243, -0.05018636100937294, -0.2106853426976389, 0.09835582530889306, -0.16751432797246718, -0.10271021780628664, -0.10966706228489646, 0.01757718359792157, 0.00396233084913685, -0.28410282324928837, 0.023342859061859265, 0.04438912498623227, 0.06846804463575724, -0.025714068784071956, -0.12070049964410218, 0.002767050572482374, 0.16028503989034532, 0.11559607071987694, 0.0440291118943663, 0.13532924077759462, -0.09995971792790143, -0.1320190177486231, 0.3883176193442903, -0.01084757197200309, -0.19424998418934927, 0.21832785944018182, -0.12129298108040437, -0.16530233687615092, 0.08614814723547123, 0.13634236349394144, 0.04444000320350663, -0.18457092196810282, 0.028842839537279775, -0.010891442437644434, 0.20040625122764819, 0.03183481982493584, -0.016103477276938297, 0.1880931646645635, 0.21236713750021166, 0.044087107145946616, 0.08827890858755601, -0.014008368629243083, -0.1254935776136957, -0.28026348355379477, -0.13244063470105913, -0.19317469874520704, 0.023432811434068303, -0.0033782506684877298, -0.14297888724518723, 0.31932687027309137, 0.2263596866182582, 0.14155286129013653, 0.04545692461572257, 0.2973904194593241, 0.07746922899232116, 0.0880148948263819, 0.058927743223521935, 0.24666706392765517, 0.062072772392708385, 0.08101091029260991, -0.1436189980764838, 0.17130776466669137, -0.039545710286997916] |
1,802.04581 | AKSZ constructions for topological membranes on $G_2$-manifolds | We consider AKSZ constructions of BV actions for closed topological
membranes, and their dimensional reductions to topological string sigma-models.
Two inequivalent AKSZ constructions for topological membranes on
$G_2$-manifolds are proposed, in each of which the two existing topological
membrane theories appear as different gauge fixed versions. Their dimensional
reductions give new AKSZ constructions for the topological A-model, which on
further dimensional reduction gives an AKSZ formulation of supersymmetric
quantum mechanics. We show that the two AKSZ membrane models originate through
worldvolume dimensional reduction of a single AKSZ threebrane theory, which
gives the standard 2-Courant bracket as the underlying derived bracket. Double
dimensional reduction of the twisted topological threebrane theory on a circle
yields the standard Courant sigma-model for string theory with NS-NS flux.
| hep-th math-ph math.MP math.QA math.SG | we consider aksz constructions of bv actions for closed topological membranes and their dimensional reductions to topological string sigmamodels two inequivalent aksz constructions for topological membranes on g_2manifolds are proposed in each of which the two existing topological membrane theories appear as different gauge fixed versions their dimensional reductions give new aksz constructions for the topological amodel which on further dimensional reduction gives an aksz formulation of supersymmetric quantum mechanics we show that the two aksz membrane models originate through worldvolume dimensional reduction of a single aksz threebrane theory which gives the standard 2courant bracket as the underlying derived bracket double dimensional reduction of the twisted topological threebrane theory on a circle yields the standard courant sigmamodel for string theory with nsns flux | [['we', 'consider', 'aksz', 'constructions', 'of', 'bv', 'actions', 'for', 'closed', 'topological', 'membranes', 'and', 'their', 'dimensional', 'reductions', 'to', 'topological', 'string', 'sigmamodels', 'two', 'inequivalent', 'aksz', 'constructions', 'for', 'topological', 'membranes', 'on', 'g_2manifolds', 'are', 'proposed', 'in', 'each', 'of', 'which', 'the', 'two', 'existing', 'topological', 'membrane', 'theories', 'appear', 'as', 'different', 'gauge', 'fixed', 'versions', 'their', 'dimensional', 'reductions', 'give', 'new', 'aksz', 'constructions', 'for', 'the', 'topological', 'amodel', 'which', 'on', 'further', 'dimensional', 'reduction', 'gives', 'an', 'aksz', 'formulation', 'of', 'supersymmetric', 'quantum', 'mechanics', 'we', 'show', 'that', 'the', 'two', 'aksz', 'membrane', 'models', 'originate', 'through', 'worldvolume', 'dimensional', 'reduction', 'of', 'a', 'single', 'aksz', 'threebrane', 'theory', 'which', 'gives', 'the', 'standard', '2courant', 'bracket', 'as', 'the', 'underlying', 'derived', 'bracket', 'double', 'dimensional', 'reduction', 'of', 'the', 'twisted', 'topological', 'threebrane', 'theory', 'on', 'a', 'circle', 'yields', 'the', 'standard', 'courant', 'sigmamodel', 'for', 'string', 'theory', 'with', 'nsns', 'flux']] | [-0.15266374212720232, 0.14534521339278472, -0.050827796135830584, 0.12997711152143654, -0.09759381093031376, -0.22008634919728168, -0.030003396583316452, 0.2979622138206099, -0.225405961191129, -0.26405065018897417, 0.013897988262975619, -0.21806463376298302, -0.22741425322506148, 0.1538319628166615, -0.1698500946103061, 0.010749756679183146, 0.005862047760289346, 0.0472449926396099, -0.17683054527962488, -0.30533962934010767, 0.35064176971963074, -0.05498105277341683, 0.323376062371936, -0.012369174235424057, 0.12694986816495657, -0.008539977166649015, 0.009363047282409961, 0.024784313514828682, -0.17990134558937423, 0.17751263106073878, 0.24047185114306827, -0.005171481745134368, 0.031452627776221175, -0.4934657926930756, -0.28623693185041615, 0.01692266161286379, 0.12331877742487495, 0.15281280660028493, 0.0038111574487898073, -0.2953727314034935, 0.05222249015226777, -0.1555835097364043, -0.09449490141524307, -0.10008962073012209, -0.021163308336475832, -0.10860680538176208, -0.16578596857849692, 0.04117687855900616, 0.04546622966309307, 0.05443533554627392, -0.09499754883982546, -0.09727368742746652, -0.12456239213342549, 0.03847424176781148, 0.042728085764569275, 0.062309589500340525, 0.13407035256339023, -0.14159747200917125, -0.2667996856330543, 0.3761121681509692, -0.05538955919414026, -0.29097555096062727, 0.18132744407182042, -0.04471140808509815, -0.2332730539921732, 0.0972980109089222, 0.061553046908840295, 0.10602656799963996, -0.09459262209196316, 0.232929506582937, -0.053772230197477046, 0.07440640498143544, 0.10916349473867382, 0.08687116936627837, 0.26025589994444953, 0.12377499831748791, 0.06699574054753193, 0.14169580592453235, -0.018160027495707522, -0.17264374667687005, -0.44381712584710514, -0.16519444424193352, -0.032230574584214904, 0.1951524266862448, -0.18291789338698317, -0.27725264545316336, 0.38352044149622566, 0.07492749840660463, 0.13492490393185957, 0.08329918543468459, 0.1885335834116721, 0.10811834480636372, 0.05921514100608889, -0.021245259638936795, 0.16163565471127142, 0.2301636283499662, 0.018797640879562157, -0.16484668202026456, -0.23384500885445272, 0.28804425515432946] |
1,802.04582 | The universal character of Zwanziger's horizon function in Euclidean
Yang-Mills theories | In light of the recently established BRST invariant formulation of the
Gribov-Zwanziger theory, we show that Zwanziger's horizon function displays a
universal character. More precisely, the correlation functions of local BRST
invariant operators evaluated with the Yang-Mills action supplemented with a
BRST invariant version of the Zwanziger's horizon function and quantized in an
arbitrary class of covariant, color invariant and renormalizable gauges which
reduce to the Landau gauge when all gauge parameters are set to zero, have a
unique, gauge parameters independent result, corresponding to that of the
Landau gauge when the restriction to the Gribov region $\Omega$ in the latter
gauge is imposed. As such, thanks to the BRST invariance, the cut-off at the
Gribov region $\Omega$ acquires a gauge independent meaning in the class of the
physical correlators.
| hep-th hep-lat | in light of the recently established brst invariant formulation of the gribovzwanziger theory we show that zwanzigers horizon function displays a universal character more precisely the correlation functions of local brst invariant operators evaluated with the yangmills action supplemented with a brst invariant version of the zwanzigers horizon function and quantized in an arbitrary class of covariant color invariant and renormalizable gauges which reduce to the landau gauge when all gauge parameters are set to zero have a unique gauge parameters independent result corresponding to that of the landau gauge when the restriction to the gribov region omega in the latter gauge is imposed as such thanks to the brst invariance the cutoff at the gribov region omega acquires a gauge independent meaning in the class of the physical correlators | [['in', 'light', 'of', 'the', 'recently', 'established', 'brst', 'invariant', 'formulation', 'of', 'the', 'gribovzwanziger', 'theory', 'we', 'show', 'that', 'zwanzigers', 'horizon', 'function', 'displays', 'a', 'universal', 'character', 'more', 'precisely', 'the', 'correlation', 'functions', 'of', 'local', 'brst', 'invariant', 'operators', 'evaluated', 'with', 'the', 'yangmills', 'action', 'supplemented', 'with', 'a', 'brst', 'invariant', 'version', 'of', 'the', 'zwanzigers', 'horizon', 'function', 'and', 'quantized', 'in', 'an', 'arbitrary', 'class', 'of', 'covariant', 'color', 'invariant', 'and', 'renormalizable', 'gauges', 'which', 'reduce', 'to', 'the', 'landau', 'gauge', 'when', 'all', 'gauge', 'parameters', 'are', 'set', 'to', 'zero', 'have', 'a', 'unique', 'gauge', 'parameters', 'independent', 'result', 'corresponding', 'to', 'that', 'of', 'the', 'landau', 'gauge', 'when', 'the', 'restriction', 'to', 'the', 'gribov', 'region', 'omega', 'in', 'the', 'latter', 'gauge', 'is', 'imposed', 'as', 'such', 'thanks', 'to', 'the', 'brst', 'invariance', 'the', 'cutoff', 'at', 'the', 'gribov', 'region', 'omega', 'acquires', 'a', 'gauge', 'independent', 'meaning', 'in', 'the', 'class', 'of', 'the', 'physical', 'correlators']] | [-0.1593839146868469, 0.20267498205212178, -0.14442558105533512, 0.10067997762593082, -0.11403138710078425, -0.11033532660311231, 0.007201498627770119, 0.3222034986918935, -0.2209743107167574, -0.24801009245789968, 0.03419762301357248, -0.2224747034935997, -0.13336499103774818, 0.05667431697500153, -0.08850387804111681, 0.07623607375157568, -0.01927711129403458, 0.09295985823353896, -0.11730553202617627, -0.24718463347436717, 0.3751841347700415, 0.01223298660479486, 0.27380811805621935, 0.06791281497392516, 0.17667360012777722, 0.05989729358563916, -0.018900313175534113, 0.006075870801802151, -0.08560239014343377, 0.05250484814079335, 0.20320823372592434, 0.02093045326529626, 0.179066082674007, -0.3397490661448011, -0.20183362839027094, 0.06650852976868359, 0.11352299998084513, 0.102609758269794, 0.015267320990432591, -0.3450663457839535, 0.07674820551362176, -0.16871423966322954, -0.17865267628266548, -0.09437174231100541, 0.02057839887431608, -0.1371072839014232, -0.28759477951277335, 0.08108100125637765, -0.006761690816627099, 0.061985334789810276, -0.08481462793066524, -0.06869849544376708, -0.093565191133306, 0.06698283174728903, 0.14260503504819308, 0.1141045714638984, 0.1638128454080568, -0.18292241633081666, -0.09553350237010118, 0.3846881995765636, -0.08194094389820328, -0.2842902947235136, 0.12217376708554534, -0.17544035455211998, -0.1981324024247722, 0.10511427730536804, 0.03938896385415529, 0.13926035538315773, -0.16501263618366255, 0.24172093411101603, -0.05690250489144371, 0.11593580705901751, 0.10720529320219961, 0.11851074271477186, 0.1781734610406252, 0.024159129343640347, 0.10811060009560046, 0.13862672787732802, 0.02211540243230187, -0.13220739469935114, -0.4701620379892679, -0.1048002705723495, -0.14734284405578643, 0.06823909387279015, -0.10721778852771072, -0.18142704061017587, 0.3863446834926995, 0.12550157634541392, 0.17209932719751334, 0.08562690451329287, 0.19450790237348814, 0.1963133985876294, 0.161082411561018, 0.03155574199313728, 0.19108616745529267, 0.16118307303493987, 0.06152116779793197, -0.29426999050908936, -0.12147223791465736, 0.16576074303056185] |
1,802.04583 | Effect of coherence of nonthermal reservoirs on heat transport in a
microscopic collision model | We investigate the heat transport between two nonthermal reservoirs based on
a microscopic collision model. We consider a bipartite system consisting of two
identical subsystems, and each subsystem interacts with its own local
reservoir, which consists of a large collection of initially uncorrelated
ancillas. Then a heat transport is formed between two reservoirs by a sequence
of pairwise collisions (inter-subsystem and subsystem-local reservoir). In this
paper we consider two kinds of reservoir's initial states, the thermal state,
and the state with coherence whose diagonal elements are the same as that of
the thermal state and the off-diaganal elements are nonzero. In this way, we
define the effective temperature of the reservoir with coherence according to
its diagonal elements. We find that for two reservoirs having coherence the
direction of the steady current of heat is different for different phase
differences between the two initial states of two reservoirs, especially the
heat can transfer from the "cold reservoir" to the "hot reservoir" in the
steady regime for particular phase difference. And in the limit of the
effective temperature difference between the two reservoirs $\Delta
T\rightarrow0$, for most of the phase differences, the steady heat current
increases with the increase of effective temperature until to the high
effective temperature limit; while for the thermal state or particular phase
difference the steady heat current decreases with the increase of temperature
at high temperatures, and in this case the conductance can be obtained.
| quant-ph | we investigate the heat transport between two nonthermal reservoirs based on a microscopic collision model we consider a bipartite system consisting of two identical subsystems and each subsystem interacts with its own local reservoir which consists of a large collection of initially uncorrelated ancillas then a heat transport is formed between two reservoirs by a sequence of pairwise collisions intersubsystem and subsystemlocal reservoir in this paper we consider two kinds of reservoirs initial states the thermal state and the state with coherence whose diagonal elements are the same as that of the thermal state and the offdiaganal elements are nonzero in this way we define the effective temperature of the reservoir with coherence according to its diagonal elements we find that for two reservoirs having coherence the direction of the steady current of heat is different for different phase differences between the two initial states of two reservoirs especially the heat can transfer from the cold reservoir to the hot reservoir in the steady regime for particular phase difference and in the limit of the effective temperature difference between the two reservoirs delta trightarrow0 for most of the phase differences the steady heat current increases with the increase of effective temperature until to the high effective temperature limit while for the thermal state or particular phase difference the steady heat current decreases with the increase of temperature at high temperatures and in this case the conductance can be obtained | [['we', 'investigate', 'the', 'heat', 'transport', 'between', 'two', 'nonthermal', 'reservoirs', 'based', 'on', 'a', 'microscopic', 'collision', 'model', 'we', 'consider', 'a', 'bipartite', 'system', 'consisting', 'of', 'two', 'identical', 'subsystems', 'and', 'each', 'subsystem', 'interacts', 'with', 'its', 'own', 'local', 'reservoir', 'which', 'consists', 'of', 'a', 'large', 'collection', 'of', 'initially', 'uncorrelated', 'ancillas', 'then', 'a', 'heat', 'transport', 'is', 'formed', 'between', 'two', 'reservoirs', 'by', 'a', 'sequence', 'of', 'pairwise', 'collisions', 'intersubsystem', 'and', 'subsystemlocal', 'reservoir', 'in', 'this', 'paper', 'we', 'consider', 'two', 'kinds', 'of', 'reservoirs', 'initial', 'states', 'the', 'thermal', 'state', 'and', 'the', 'state', 'with', 'coherence', 'whose', 'diagonal', 'elements', 'are', 'the', 'same', 'as', 'that', 'of', 'the', 'thermal', 'state', 'and', 'the', 'offdiaganal', 'elements', 'are', 'nonzero', 'in', 'this', 'way', 'we', 'define', 'the', 'effective', 'temperature', 'of', 'the', 'reservoir', 'with', 'coherence', 'according', 'to', 'its', 'diagonal', 'elements', 'we', 'find', 'that', 'for', 'two', 'reservoirs', 'having', 'coherence', 'the', 'direction', 'of', 'the', 'steady', 'current', 'of', 'heat', 'is', 'different', 'for', 'different', 'phase', 'differences', 'between', 'the', 'two', 'initial', 'states', 'of', 'two', 'reservoirs', 'especially', 'the', 'heat', 'can', 'transfer', 'from', 'the', 'cold', 'reservoir', 'to', 'the', 'hot', 'reservoir', 'in', 'the', 'steady', 'regime', 'for', 'particular', 'phase', 'difference', 'and', 'in', 'the', 'limit', 'of', 'the', 'effective', 'temperature', 'difference', 'between', 'the', 'two', 'reservoirs', 'delta', 'trightarrow0', 'for', 'most', 'of', 'the', 'phase', 'differences', 'the', 'steady', 'heat', 'current', 'increases', 'with', 'the', 'increase', 'of', 'effective', 'temperature', 'until', 'to', 'the', 'high', 'effective', 'temperature', 'limit', 'while', 'for', 'the', 'thermal', 'state', 'or', 'particular', 'phase', 'difference', 'the', 'steady', 'heat', 'current', 'decreases', 'with', 'the', 'increase', 'of', 'temperature', 'at', 'high', 'temperatures', 'and', 'in', 'this', 'case', 'the', 'conductance', 'can', 'be', 'obtained']] | [-0.16073118440928685, 0.23365535613793864, -0.05781786459132652, -0.012383291160369504, 0.04976703424914445, -0.1143315271710199, 0.06003655673973341, 0.34439897873214903, -0.28870211249140765, -0.29160493054871256, 0.08431163695611389, -0.34221945424025824, -0.019680944537618178, 0.1646370655574093, 0.031927679905094174, 0.0016641143128818161, 0.050357606207444984, 0.050189086801680945, -0.08783119373251429, -0.193094624590054, 0.37126876653922636, 0.008980704147274358, 0.28497775732677133, 0.060972893518250325, 0.11303955117802486, -0.05335643652429655, 0.04458847825556899, 0.03209840927445816, -0.07815742734575276, 0.07019408386387815, 0.22189937574388105, 0.009302913399908361, 0.2312602344310925, -0.44811596618454413, -0.215022637259278, 0.1348897412120667, 0.10174751760760314, 0.12801369856542, -0.028085056011062037, -0.19668851803717075, -0.014360605116210533, -0.17867862269182136, -0.10249690973813418, -0.02154698737878313, 0.03814593777708898, 0.033081979506289515, -0.2432912447438713, 0.12925170946086242, 0.05254198279318239, 0.023978539860418327, -0.055013089602860284, -0.13103716266842536, -0.056217571599644765, 0.1750633445448529, -0.007609243842160117, -0.018083558376595567, 0.16614867245409057, -0.1363737265120618, -0.02367463240887231, 0.31021373280552944, -0.134621674623753, -0.15612567933020868, 0.260479049504153, -0.15283452686637578, -0.06482915665214108, 0.09605219571866913, 0.12216087308307552, 0.07368526755505976, -0.19286465287239996, 0.01132598993877334, 0.0023360560463450628, 0.14017107673794943, 0.03392526530169485, 0.06849752639652179, 0.26721025719641384, 0.170302199005279, 0.0675629097231534, 0.21362163673227708, -0.08686889632003783, -0.13123513144570625, -0.2882951860952698, -0.18653030836373127, -0.20298072154818395, 0.0438530468598071, -0.09266027599685621, -0.14443496839273012, 0.4088226142909205, 0.16480751388867382, 0.2236752027040544, 0.013007808068496045, 0.29495611702257035, 0.14414463000998828, -0.0027220385455632512, 0.12512362867255816, 0.24106649763465618, 0.16476961397880271, 0.11449811694738829, -0.3278124259454729, 0.052698762586363884, 0.012817500952929887] |
1,802.04584 | Two-temperature Brownian dynamics of a particle in a confining potential | We consider the two dimensional motion of a particle into a confining
potential, subjected to Brownian forces, associated with two different
temperatures on the orthogonal directions. Exact solutions are obtained for an
asymmetric harmonic potential in the overdamped and underdamped regimes,
whereas perturbative approaches are used for more general potentials. The
resulting non equilibrium stationary state is characterized with a nonzero
orthoradial mean current, corresponding to a global rotation of the particle
around the center. The rotation is due to two symmetry breaking: two different
temperatures and a mismatch between the principal axes of the confining
asymmetric potential and the temperature axes. We confirm our predictions by
performing Brownian dynamics simulation. Finally, we propose to observe this
effect on a laser cooled atomic system.
| cond-mat.stat-mech | we consider the two dimensional motion of a particle into a confining potential subjected to brownian forces associated with two different temperatures on the orthogonal directions exact solutions are obtained for an asymmetric harmonic potential in the overdamped and underdamped regimes whereas perturbative approaches are used for more general potentials the resulting non equilibrium stationary state is characterized with a nonzero orthoradial mean current corresponding to a global rotation of the particle around the center the rotation is due to two symmetry breaking two different temperatures and a mismatch between the principal axes of the confining asymmetric potential and the temperature axes we confirm our predictions by performing brownian dynamics simulation finally we propose to observe this effect on a laser cooled atomic system | [['we', 'consider', 'the', 'two', 'dimensional', 'motion', 'of', 'a', 'particle', 'into', 'a', 'confining', 'potential', 'subjected', 'to', 'brownian', 'forces', 'associated', 'with', 'two', 'different', 'temperatures', 'on', 'the', 'orthogonal', 'directions', 'exact', 'solutions', 'are', 'obtained', 'for', 'an', 'asymmetric', 'harmonic', 'potential', 'in', 'the', 'overdamped', 'and', 'underdamped', 'regimes', 'whereas', 'perturbative', 'approaches', 'are', 'used', 'for', 'more', 'general', 'potentials', 'the', 'resulting', 'non', 'equilibrium', 'stationary', 'state', 'is', 'characterized', 'with', 'a', 'nonzero', 'orthoradial', 'mean', 'current', 'corresponding', 'to', 'a', 'global', 'rotation', 'of', 'the', 'particle', 'around', 'the', 'center', 'the', 'rotation', 'is', 'due', 'to', 'two', 'symmetry', 'breaking', 'two', 'different', 'temperatures', 'and', 'a', 'mismatch', 'between', 'the', 'principal', 'axes', 'of', 'the', 'confining', 'asymmetric', 'potential', 'and', 'the', 'temperature', 'axes', 'we', 'confirm', 'our', 'predictions', 'by', 'performing', 'brownian', 'dynamics', 'simulation', 'finally', 'we', 'propose', 'to', 'observe', 'this', 'effect', 'on', 'a', 'laser', 'cooled', 'atomic', 'system']] | [-0.1482600260238659, 0.18595580213467097, -0.08863233473722733, 0.013866980369540772, -0.010011730456514465, -0.16118984594340285, 0.011155292992630312, 0.40292638417093024, -0.2587337525891921, -0.23844558485753595, 0.06837166214057605, -0.2640284376909896, -0.08316157871271454, 0.17255529138867953, 0.010109176286571328, 0.037875101954165484, 0.010291891840977533, 0.03102384154373149, -0.07050011896588389, -0.1673705407041369, 0.2896507429296992, 0.0016171495573812976, 0.2812557112605822, 0.008513289822017654, 0.13458263830867626, -0.016388981708235318, 0.02841875128421722, 0.05194967907417806, -0.14995341657495667, 0.07427247777025425, 0.15295519955801748, -0.05062415315619399, 0.23317852108589104, -0.43064175332866367, -0.18377575826185244, 0.11441425403069344, 0.1302281229816858, 0.1570987574335548, -0.08033444418164905, -0.2857394904619263, 0.0001405143768586699, -0.12763243585809944, -0.19791292611344327, -0.07461945659240647, 0.026096439875301816, 0.04207900936354793, -0.2789961675767817, 0.11693978907855888, 0.05183537178409977, 0.06618952989998844, -0.10274227456595268, -0.1000680994325047, -0.03617426781772425, 0.08699726771503206, 0.07128770688770249, 0.009718140938334287, 0.17415318353854556, -0.0995794156181458, -0.11323588255477408, 0.400841545891918, -0.0790720126416061, -0.2379188713215802, 0.2519196014017648, -0.14281997401567717, -0.06979150306658759, 0.1349277620564305, 0.16232427698935592, 0.09052094771346499, -0.13772556299133407, 0.05374749052017221, 0.03201885064200108, 0.1125818258376732, 0.08306595867109154, -0.03798065742528472, 0.27250708825135184, 0.1283192608163752, 0.06432188792725003, 0.17319557075989583, -0.12091337765413036, -0.17929800237048296, -0.28779543345914255, -0.10184530728598006, -0.1513668932133324, 0.04524731935722934, -0.1016301827824669, -0.13986804518067547, 0.4047801942985144, 0.13814429599639674, 0.20122106455364114, 0.03587262258459363, 0.30703123132397814, 0.132221194732401, 0.007911949471059826, 0.05616440818900423, 0.2651107478661523, 0.15446150136901246, 0.08166711339952364, -0.28864556584026546, -0.03150769878336559, 0.03265091327710017] |
1,802.04585 | Pythagorean Triplets, Integral Apollonians and The Hofstadter Butterfly | Hierarchical sets such as the Pythagorean triplets ($\cal{PT}$) and the
integral Apollonian gaskets ($\cal{IAG}$) are iconic mathematical sets made up
of integers that resonate with a wide spectrum of inquisitive minds. Here we
show that these abstract objects are related with a quantum fractal made up of
integers, known as the {\it Hofstadter Butterfly}. The "butterfly fractal"
describes a {\it physical system} of electrons in a crystal in a magnetic
field, representing exotic states of matter known as {\it integer quantum Hall}
states. Integers of the butterfly are the quanta of Hall conductivity that
appear in a highly convoluted form in the integers of the $\cal{PT}$ and the
$\cal{IAG}$. Scaling properties of these integers, as we zoom into the
self-similar butterfly fractal are given by a class of quadratic irrationals
that lace the butterfly in a highly intricate and orderly pattern, some
describing a
{\it mathematical kaleidoscope}. The number theoretical aspects are all
concealed in Lorentz transformations along the light cone in abstract Minkowski
space where subset of these are related to the celebrated {\it Pell's
equation}.
| nlin.CD cond-mat.dis-nn quant-ph | hierarchical sets such as the pythagorean triplets calpt and the integral apollonian gaskets caliag are iconic mathematical sets made up of integers that resonate with a wide spectrum of inquisitive minds here we show that these abstract objects are related with a quantum fractal made up of integers known as the it hofstadter butterfly the butterfly fractal describes a it physical system of electrons in a crystal in a magnetic field representing exotic states of matter known as it integer quantum hall states integers of the butterfly are the quanta of hall conductivity that appear in a highly convoluted form in the integers of the calpt and the caliag scaling properties of these integers as we zoom into the selfsimilar butterfly fractal are given by a class of quadratic irrationals that lace the butterfly in a highly intricate and orderly pattern some describing a it mathematical kaleidoscope the number theoretical aspects are all concealed in lorentz transformations along the light cone in abstract minkowski space where subset of these are related to the celebrated it pells equation | [['hierarchical', 'sets', 'such', 'as', 'the', 'pythagorean', 'triplets', 'calpt', 'and', 'the', 'integral', 'apollonian', 'gaskets', 'caliag', 'are', 'iconic', 'mathematical', 'sets', 'made', 'up', 'of', 'integers', 'that', 'resonate', 'with', 'a', 'wide', 'spectrum', 'of', 'inquisitive', 'minds', 'here', 'we', 'show', 'that', 'these', 'abstract', 'objects', 'are', 'related', 'with', 'a', 'quantum', 'fractal', 'made', 'up', 'of', 'integers', 'known', 'as', 'the', 'it', 'hofstadter', 'butterfly', 'the', 'butterfly', 'fractal', 'describes', 'a', 'it', 'physical', 'system', 'of', 'electrons', 'in', 'a', 'crystal', 'in', 'a', 'magnetic', 'field', 'representing', 'exotic', 'states', 'of', 'matter', 'known', 'as', 'it', 'integer', 'quantum', 'hall', 'states', 'integers', 'of', 'the', 'butterfly', 'are', 'the', 'quanta', 'of', 'hall', 'conductivity', 'that', 'appear', 'in', 'a', 'highly', 'convoluted', 'form', 'in', 'the', 'integers', 'of', 'the', 'calpt', 'and', 'the', 'caliag', 'scaling', 'properties', 'of', 'these', 'integers', 'as', 'we', 'zoom', 'into', 'the', 'selfsimilar', 'butterfly', 'fractal', 'are', 'given', 'by', 'a', 'class', 'of', 'quadratic', 'irrationals', 'that', 'lace', 'the', 'butterfly', 'in', 'a', 'highly', 'intricate', 'and', 'orderly', 'pattern', 'some', 'describing', 'a', 'it', 'mathematical', 'kaleidoscope', 'the', 'number', 'theoretical', 'aspects', 'are', 'all', 'concealed', 'in', 'lorentz', 'transformations', 'along', 'the', 'light', 'cone', 'in', 'abstract', 'minkowski', 'space', 'where', 'subset', 'of', 'these', 'are', 'related', 'to', 'the', 'celebrated', 'it', 'pells', 'equation']] | [-0.18354342890238123, 0.18443166807559985, -0.09442516303488187, 0.0958315994856613, -0.08561828512698412, -0.1294296025192099, -0.0034164239642892166, 0.3211664305414472, -0.32091244831681254, -0.26458128480506793, 0.050976799502303556, -0.2931714579037258, -0.22561445366857308, 0.20856401348752635, -0.03164985604584217, 0.06423280573316983, -0.012810917843931487, 0.03842945380003324, -0.009588867814413139, -0.23924354962472405, 0.3305823334013777, -0.035786373707066686, 0.2080911445644285, -0.006985766246382679, 0.08286302803882531, -0.029977786741884692, 0.011272687297314406, 0.07229909880070148, -0.10783971365092189, 0.09752433427542981, 0.24262422169359135, 0.06733932966100319, 0.21678131754909244, -0.40463701869760244, -0.16812375869202828, 0.06184846943909569, 0.15804668201931885, 0.07903069647295134, -0.042457051186689305, -0.2859807086735964, 0.06305565569882414, -0.12807588582658874, -0.16861538539241466, -0.08771429457169558, 0.07940146371489391, 0.02134676321808781, -0.18372775120926754, 0.05187319591907518, 0.07569590261738215, 0.07396237423294223, -0.04691051150539092, -0.1258108605264819, -0.03384717204009316, 0.0872979475052229, -0.0052986752933689525, -0.00543845537584275, 0.08233586074518306, -0.1296807700329061, -0.14691232841195806, 0.41235045190900566, -0.0016903090623340436, -0.20413129745317357, 0.1618586854237531, -0.17985534214813795, -0.1308727778494358, 0.1332311061157712, 0.1087724089628942, 0.07970372699201107, -0.08775417417686965, 0.11900706873840786, -0.15634012696466276, 0.11893260709409202, 0.1075501170062593, 0.0798891019954213, 0.24116981432906218, 0.10150400752201677, 0.02602933869031923, 0.16813106357253024, -0.021489625397537435, -0.10708575994574598, -0.3012485263164022, -0.17598241954775792, -0.20007401838965183, 0.10633386982538338, -0.10967338714723675, -0.2667813715152442, 0.4085431765512164, 0.11063200062673006, 0.2011208562819021, 0.016874514549438443, 0.23128948573555266, 0.09296365302322167, 0.08191808179553066, 0.08163520248606801, 0.1483844600845727, 0.148799138216834, 0.09392472118671451, -0.1716420652850398, -0.0066663818650080685, 0.08037825415975282] |
1,802.04586 | Hamiltonicity in randomly perturbed hypergraphs | For integers $k\ge 3$ and $1\le \ell\le k-1$, we prove that for any
$\alpha>0$, there exist $\epsilon>0$ and $C>0$ such that for sufficiently large
$n\in (k-\ell)\mathbb{N}$, the union of a $k$-uniform hypergraph with minimum
vertex degree $\alpha n^{k-1}$ and a binomial random $k$-uniform hypergraph
$\mathbb{G}^{(k)}(n,p)$ with $p\ge n^{-(k-\ell)-\epsilon}$ for $\ell\ge 2$ and
$p\ge C n^{-(k-1)}$ for $\ell=1$ on the same vertex set contains a Hamiltonian
$\ell$-cycle with high probability. Our result is best possible up to the
values of $\epsilon$ and $C$ and answers a question of Krivelevich, Kwan and
Sudakov.
| math.CO | for integers kge 3 and 1le ellle k1 we prove that for any alpha0 there exist epsilon0 and c0 such that for sufficiently large nin kellmathbbn the union of a kuniform hypergraph with minimum vertex degree alpha nk1 and a binomial random kuniform hypergraph mathbbgknp with pge nkellepsilon for ellge 2 and pge c nk1 for ell1 on the same vertex set contains a hamiltonian ellcycle with high probability our result is best possible up to the values of epsilon and c and answers a question of krivelevich kwan and sudakov | [['for', 'integers', 'kge', '3', 'and', '1le', 'ellle', 'k1', 'we', 'prove', 'that', 'for', 'any', 'alpha0', 'there', 'exist', 'epsilon0', 'and', 'c0', 'such', 'that', 'for', 'sufficiently', 'large', 'nin', 'kellmathbbn', 'the', 'union', 'of', 'a', 'kuniform', 'hypergraph', 'with', 'minimum', 'vertex', 'degree', 'alpha', 'nk1', 'and', 'a', 'binomial', 'random', 'kuniform', 'hypergraph', 'mathbbgknp', 'with', 'pge', 'nkellepsilon', 'for', 'ellge', '2', 'and', 'pge', 'c', 'nk1', 'for', 'ell1', 'on', 'the', 'same', 'vertex', 'set', 'contains', 'a', 'hamiltonian', 'ellcycle', 'with', 'high', 'probability', 'our', 'result', 'is', 'best', 'possible', 'up', 'to', 'the', 'values', 'of', 'epsilon', 'and', 'c', 'and', 'answers', 'a', 'question', 'of', 'krivelevich', 'kwan', 'and', 'sudakov']] | [-0.1932705305728384, 0.14708164474458582, 0.03188568491234698, 0.016697257160558365, -0.020066417487793264, -0.2897054838143628, 0.059646785904822704, 0.3345876842001665, -0.21711108374769206, -0.2995186753634533, 0.04430980244863101, -0.373378246683966, -0.08985782763126983, 0.11195809529586272, -0.0653429092172618, 0.07228436718303949, 0.10119922939074141, 0.09191319372356785, 0.08504813050769205, -0.3114686234621331, 0.29069409430005844, -0.09817359821384096, 0.0804911720492369, 0.10852913281202993, 0.10490996932441538, 0.04270105929092758, 0.07623387291625311, 0.0352895103437318, -0.2572051779830376, 0.04724721055787417, 0.2762498313412917, 0.17809260444218208, 0.2964436899214475, -0.3000046042196283, -0.11853775504542599, 0.22009010501311754, 0.11506035320714793, 0.011897825747754805, 0.0013351454412755133, -0.15305553607388653, 0.21738479635942812, -0.08922320009961285, -0.15210665965092962, -0.041151305438357995, 0.180209136874923, 0.020111651667817074, -0.43564587888646533, 0.002511072967370803, 0.19619415562853895, 0.042100224105938236, 0.04436887104847384, -0.2830915383793498, -0.011875163536160471, 0.06573550130335869, -0.08091084204286082, 0.13708717268706427, -0.05839122800600969, -0.09844846961112291, -0.1353887999641963, 0.33180749803696846, -0.08278027222629382, -0.13317464793429032, 0.07927968550939113, -0.19475477212373252, -0.21729372527889526, 0.10015302445390262, 0.05260937238662419, 0.16726741649803112, 0.01252298704771833, 0.21990053486462618, -0.1139491323318163, 0.17614008987915108, 0.2081905118591914, 0.025454271235503256, 0.03975747121413323, 0.04413919505896047, 0.1816148640884256, 0.10120057252193378, 0.008152865796794438, 0.07834643456193259, -0.3550409438427199, -0.12435939114286819, -0.27483151345090434, 0.15349618742898616, -0.2608095810377232, -0.15827156326585365, 0.32709951945368876, 0.08161555542293089, 0.1844044778898189, 0.1604874483098022, 0.1552818043538454, 0.05755029058904752, -0.01591291462483985, 0.22010719960301436, 0.07163002452051098, 0.14451985522596675, -0.05455600569257513, -0.1266131140179244, 0.022645743664311754, 0.14047029284252363] |
1,802.04587 | Mobility as an Alternative Communication Channel: A Survey | We review the research literature investigating systems in which mobile
entities can carry data while they move. These entities can be either mobile by
nature (e.g., human beings and animals) or mobile by design (e.g., trains,
airplanes, and cars). The movements of such entities equipped with storage
capabilities create a communication channel which can help overcome the
limitations or the lack of conventional data networks. Common limitations
include the mismatch between the capacity offered by these networks and the
traffic demand or their limited deployment owing to environmental factors.
Application scenarios include offloading traffic off legacy networks for
capacity improvement, bridging connectivity gaps, or deploying ad hoc networks
in challenging environments for coverage enhancement.
| cs.NI | we review the research literature investigating systems in which mobile entities can carry data while they move these entities can be either mobile by nature eg human beings and animals or mobile by design eg trains airplanes and cars the movements of such entities equipped with storage capabilities create a communication channel which can help overcome the limitations or the lack of conventional data networks common limitations include the mismatch between the capacity offered by these networks and the traffic demand or their limited deployment owing to environmental factors application scenarios include offloading traffic off legacy networks for capacity improvement bridging connectivity gaps or deploying ad hoc networks in challenging environments for coverage enhancement | [['we', 'review', 'the', 'research', 'literature', 'investigating', 'systems', 'in', 'which', 'mobile', 'entities', 'can', 'carry', 'data', 'while', 'they', 'move', 'these', 'entities', 'can', 'be', 'either', 'mobile', 'by', 'nature', 'eg', 'human', 'beings', 'and', 'animals', 'or', 'mobile', 'by', 'design', 'eg', 'trains', 'airplanes', 'and', 'cars', 'the', 'movements', 'of', 'such', 'entities', 'equipped', 'with', 'storage', 'capabilities', 'create', 'a', 'communication', 'channel', 'which', 'can', 'help', 'overcome', 'the', 'limitations', 'or', 'the', 'lack', 'of', 'conventional', 'data', 'networks', 'common', 'limitations', 'include', 'the', 'mismatch', 'between', 'the', 'capacity', 'offered', 'by', 'these', 'networks', 'and', 'the', 'traffic', 'demand', 'or', 'their', 'limited', 'deployment', 'owing', 'to', 'environmental', 'factors', 'application', 'scenarios', 'include', 'offloading', 'traffic', 'off', 'legacy', 'networks', 'for', 'capacity', 'improvement', 'bridging', 'connectivity', 'gaps', 'or', 'deploying', 'ad', 'hoc', 'networks', 'in', 'challenging', 'environments', 'for', 'coverage', 'enhancement']] | [-0.2003289921813759, 0.0666261306767793, 0.035696218435636216, 0.05531855459782507, -0.12198286747004379, -0.2081796357841149, 0.13864264689108127, 0.4334928817524199, -0.2814764374774664, -0.371000703608029, 0.1351266677727261, -0.30958037952516687, -0.17219227386573166, 0.15109495497553757, -0.1594565119553488, 0.05473354995544804, 0.11107452812281911, 0.0045998896504834035, 0.03466826610434637, -0.2167269097472104, 0.2930652360235782, 0.06757150003441463, 0.37813131834723446, 0.07195710311766322, 0.012584735786444262, -0.012821119956737547, -0.043248135845683384, -0.015514343895279524, -0.012960564610630013, 0.18241564964614154, 0.3564117011009601, 0.18895437429136222, 0.306588857451029, -0.5613561385237661, -0.31744454615022333, 0.14405388761262752, 0.17504872687200795, 0.017719658173359278, -0.029913521829273617, -0.3584705554929219, 0.05782998657658729, -0.2254604264611803, -0.0797460360611838, -0.09000767166154426, -0.01971174931774537, 0.09465918408680234, -0.23694739157023528, -0.026354813519375103, -0.008501932494701785, 0.10583292820822528, -0.005112625331732265, -0.084813047165721, 0.03750975838218501, 0.25165911875420105, 0.04017009434245298, -0.05071901089283066, 0.19443590819923484, -0.21088648207175234, -0.16091843830062108, 0.4062365548064311, 0.06927449328890234, -0.19651607477939442, 0.24657503233276912, 0.008823516725546173, -0.07816063673358019, 0.09527291927339607, 0.24638236927536414, 0.007726219625686083, -0.2028622099427147, -0.00456222710597917, 0.08045479991032105, 0.12413489987222037, 0.08820088905805167, 0.10157485917341291, 0.23823304874863344, 0.22976002960645578, 0.08059384744908464, 0.05910499116483455, -0.08936007940945656, -0.11155795498767443, -0.14189412740565704, -0.09478070053043203, -0.17409383146941923, 0.04427750119857751, -0.05978257303381964, -0.06950709422266013, 0.29694176799405303, 0.18515594609759814, 0.1578661894891411, 0.06610934254141491, 0.3774766169096294, 0.005720473985236727, 0.16014312281020052, 0.12963946292732367, 0.15060187957511006, -0.01688007998337414, 0.22491064846000977, -0.15110592827049754, 0.111511429422535, -0.07286992623152114] |
1,802.04588 | Gaussian pseudo-Orthogonal Ensemble of Real Random Matrices | Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $ \altmathcal {N}=n(n+1)/2$ elements independently drawn from a Gaussian random population and investigate the statistical properties of the eigenvalues. When $\lambda \mu >0$, we show that the pseudo-symmetric matrix is similar to a real symmetric matrix, consequently, all the eigenvalues are real and so the spectral distributions satisfy Wigner's statistics. But when $\lambda \mu <0$ the eigenvalues are either real or complex conjugate pairs. We find that these real eigenvalues exhibit intermediate statistics. We show that the diagonalizing matrices ${ \cal D}$ of these pseudo-symmetric matrices are pseudo-orthogonal under a constant metric $\zeta$ as $ \altmathcal{D}^t \zeta \altmathcal{D}= \zeta$, and hence they belong to a pseudo-orthogonal group. These pseudo-symmetric matrices serve to represent the parity-time (PT)-symmetric quantum systems having exact (un-broken) or broken PT-symmetry. | quant-ph cond-mat.stat-mech cond-mat.str-el math-ph math.MP | here using two real nonzero parameters lambda and mu we construct gaussian pseudoorthogonal ensembles of a large number n of n times n n even and large real pseudosymmetric matrices under the metric eta using altmathcal nnn12 elements independently drawn from a gaussian random population and investigate the statistical properties of the eigenvalues when lambda mu 0 we show that the pseudosymmetric matrix is similar to a real symmetric matrix consequently all the eigenvalues are real and so the spectral distributions satisfy wigners statistics but when lambda mu 0 the eigenvalues are either real or complex conjugate pairs we find that these real eigenvalues exhibit intermediate statistics we show that the diagonalizing matrices cal d of these pseudosymmetric matrices are pseudoorthogonal under a constant metric zeta as altmathcaldt zeta altmathcald zeta and hence they belong to a pseudoorthogonal group these pseudosymmetric matrices serve to represent the paritytime ptsymmetric quantum systems having exact unbroken or broken ptsymmetry | [['here', 'using', 'two', 'real', 'nonzero', 'parameters', 'lambda', 'and', 'mu', 'we', 'construct', 'gaussian', 'pseudoorthogonal', 'ensembles', 'of', 'a', 'large', 'number', 'n', 'of', 'n', 'times', 'n', 'n', 'even', 'and', 'large', 'real', 'pseudosymmetric', 'matrices', 'under', 'the', 'metric', 'eta', 'using', 'altmathcal', 'nnn12', 'elements', 'independently', 'drawn', 'from', 'a', 'gaussian', 'random', 'population', 'and', 'investigate', 'the', 'statistical', 'properties', 'of', 'the', 'eigenvalues', 'when', 'lambda', 'mu', '0', 'we', 'show', 'that', 'the', 'pseudosymmetric', 'matrix', 'is', 'similar', 'to', 'a', 'real', 'symmetric', 'matrix', 'consequently', 'all', 'the', 'eigenvalues', 'are', 'real', 'and', 'so', 'the', 'spectral', 'distributions', 'satisfy', 'wigners', 'statistics', 'but', 'when', 'lambda', 'mu', '0', 'the', 'eigenvalues', 'are', 'either', 'real', 'or', 'complex', 'conjugate', 'pairs', 'we', 'find', 'that', 'these', 'real', 'eigenvalues', 'exhibit', 'intermediate', 'statistics', 'we', 'show', 'that', 'the', 'diagonalizing', 'matrices', 'cal', 'd', 'of', 'these', 'pseudosymmetric', 'matrices', 'are', 'pseudoorthogonal', 'under', 'a', 'constant', 'metric', 'zeta', 'as', 'altmathcaldt', 'zeta', 'altmathcald', 'zeta', 'and', 'hence', 'they', 'belong', 'to', 'a', 'pseudoorthogonal', 'group', 'these', 'pseudosymmetric', 'matrices', 'serve', 'to', 'represent', 'the', 'paritytime', 'ptsymmetric', 'quantum', 'systems', 'having', 'exact', 'unbroken', 'or', 'broken', 'ptsymmetry']] | [-0.17489116073212294, 0.1934942912316489, -0.04490046121645719, 0.07371714468938176, -0.04222749469274851, -0.21790419021118923, -0.007037393940232792, 0.3953745417590988, -0.24638291786571867, -0.22006870006015034, 0.08862902401444062, -0.30273332953220233, -0.19140391577169985, 0.09977376594906673, 0.01182036489358564, 0.07879024578601514, 0.050237964477243, 0.1021741687834851, -0.1196130816771122, -0.2395004770032277, 0.36740308567440433, -0.05845085104795687, 0.2025832181618745, -0.030590608315450435, 0.05961627947726811, -0.021484097971360347, 0.016955400478572732, -0.03256966451667004, -0.09120790801989642, 0.039582576643672505, 0.2440626369207166, 0.11502628979322158, 0.18505016003588312, -0.3490617890033479, -0.13815928210112216, 0.2618533438714956, 0.14429457271073357, 0.013308833874026803, 0.004836026713938305, -0.3189454997987731, 0.15639951361931467, -0.1338392462624286, -0.15985139950307234, -0.09768058485535316, 0.06760413733840515, 0.024805835598319965, -0.3463461290505764, 0.06104968863502635, 0.03399695577957716, 0.06358345233418636, 0.003595118363400137, -0.20071657098168016, -0.024012901357644677, 0.10299116210578511, 0.023987596558933882, -0.08014189887877651, 0.10461153488569452, -0.038381768850070476, -0.05155905935680494, 0.3775511387380232, -0.02823793448164667, -0.2855470021206297, 0.14884452563312248, -0.19238309140966617, -0.14598174569331795, 0.100351506020065, 0.1427255519880227, 0.12502245968330258, -0.04270204880652416, 0.1978319866416553, -0.08892171300478942, 0.1404669618158981, 0.10956429086294711, 0.02102789671564671, 0.14259118675621912, -0.020025908692715394, 0.05234474601763252, 0.09619241825758333, 0.01598812686585772, -0.08322347559672046, -0.32319515680673677, -0.1507049862281603, -0.26143643038736436, 0.18647718644321062, -0.170643231288762, -0.2014395788949179, 0.3397063266142811, 0.054950131944343936, 0.2817589358938245, 0.11731532120642155, 0.17850475052469655, 0.12907689121646782, 0.04768324960298885, 0.07796849625485361, 0.10921059015182484, 0.2116401548731741, 0.040292690890246854, -0.17211198853175647, -0.04230842252237428, 0.04098424368758539] |
1,802.04589 | When and when not to use optimal model averaging | Traditionally model averaging has been viewed as an alternative to model
selection with the ultimate goal to incorporate the uncertainty associated with
the model selection process in standard errors and confidence intervals by
using a weighted combination of candidate models. In recent years, a new class
of model averaging estimators has emerged in the literature, suggesting to
combine models such that the squared risk, or other risk functions, are
minimized. We argue that, contrary to popular belief, these estimators do not
necessarily address the challenges induced by model selection uncertainty, but
should be regarded as attractive complements for the machine learning and
forecasting literature, as well as tools to identify causal parameters. We
illustrate our point by means of several targeted simulation studies.
| stat.ME | traditionally model averaging has been viewed as an alternative to model selection with the ultimate goal to incorporate the uncertainty associated with the model selection process in standard errors and confidence intervals by using a weighted combination of candidate models in recent years a new class of model averaging estimators has emerged in the literature suggesting to combine models such that the squared risk or other risk functions are minimized we argue that contrary to popular belief these estimators do not necessarily address the challenges induced by model selection uncertainty but should be regarded as attractive complements for the machine learning and forecasting literature as well as tools to identify causal parameters we illustrate our point by means of several targeted simulation studies | [['traditionally', 'model', 'averaging', 'has', 'been', 'viewed', 'as', 'an', 'alternative', 'to', 'model', 'selection', 'with', 'the', 'ultimate', 'goal', 'to', 'incorporate', 'the', 'uncertainty', 'associated', 'with', 'the', 'model', 'selection', 'process', 'in', 'standard', 'errors', 'and', 'confidence', 'intervals', 'by', 'using', 'a', 'weighted', 'combination', 'of', 'candidate', 'models', 'in', 'recent', 'years', 'a', 'new', 'class', 'of', 'model', 'averaging', 'estimators', 'has', 'emerged', 'in', 'the', 'literature', 'suggesting', 'to', 'combine', 'models', 'such', 'that', 'the', 'squared', 'risk', 'or', 'other', 'risk', 'functions', 'are', 'minimized', 'we', 'argue', 'that', 'contrary', 'to', 'popular', 'belief', 'these', 'estimators', 'do', 'not', 'necessarily', 'address', 'the', 'challenges', 'induced', 'by', 'model', 'selection', 'uncertainty', 'but', 'should', 'be', 'regarded', 'as', 'attractive', 'complements', 'for', 'the', 'machine', 'learning', 'and', 'forecasting', 'literature', 'as', 'well', 'as', 'tools', 'to', 'identify', 'causal', 'parameters', 'we', 'illustrate', 'our', 'point', 'by', 'means', 'of', 'several', 'targeted', 'simulation', 'studies']] | [-0.022543104964344408, 0.02962323162826327, -0.0760313829490385, 0.13072282099598326, -0.08939480370410331, -0.1520251926201267, 0.06265533934309472, 0.4246578532748106, -0.27589074743351316, -0.32632128674370364, 0.14550658618194634, -0.26292378170703484, -0.1544447413918267, 0.20525555948374746, -0.12020814106458934, 0.10502239047905536, 0.04845387263912556, 0.019748551086779368, -0.03904699134390529, -0.2395261860323873, 0.2794616763476222, 0.10493749880602932, 0.30367456707815693, -0.020240949818909896, 0.08576127505162967, 0.013477322308543494, -0.07080187459241569, 0.06231515782287087, -0.11283820189170755, 0.12912715012510498, 0.28280682649494887, 0.17313582736930652, 0.36452466788572996, -0.3753720895061648, -0.3204098162430573, 0.14414041733550953, 0.1575638909807156, 0.0987714025517547, -0.01671036947575375, -0.2663737278795097, 0.044993680907504226, -0.21051998649666093, -0.10262810369211484, -0.10794630904049742, -0.050870840277757526, 0.02564530874928081, -0.2889855713394236, 0.07530030595399893, 0.04471442242800372, 0.04322391908191811, -0.035531561285999366, -0.1907721269398746, 0.009748460688984127, 0.10618509000689699, 0.11498690651596251, 0.04109002230310343, 0.11116044113139917, -0.10921324054309266, -0.2148886739988092, 0.3587861178211898, -0.07070729366647518, -0.20875770181069167, 0.19643181583624544, -0.049742899013577195, -0.1614602434077883, 0.052138134061048426, 0.194519473628777, 0.0810641547384846, -0.21117602147888848, 0.030544316917619992, -0.00955036592980226, 0.121275556316586, -0.019724440855557114, 0.02506333772221777, 0.22350982169249678, 0.1923984116041745, 0.04347587163120932, 0.10103317051018565, -0.08885849674839935, -0.13222293469040253, -0.28484440932610655, -0.09304615811300956, -0.14991331038754283, -0.0027781064972059984, -0.05385966571989636, -0.17465672320951292, 0.3314569467353082, 0.22638077391841546, 0.2152700074986229, 0.05755011513980666, 0.2862276697485912, 0.11476303623493277, 0.11903638318483907, 0.04837561174621427, 0.25506682678814824, 0.07730677372367098, -0.0051078490223887005, -0.11864958886753738, 0.1394209172491484, 0.032668289315803505] |
1,802.0459 | High-order implicit palindromic discontinuous Galerkin method for
kinetic-relaxation approximation | We construct a high order discontinuous Galerkin method for solving general
hyperbolic systems of conservation laws. The method is CFL-less, matrix-free,
has the complexity of an explicit scheme and can be of arbitrary order in space
and time. The construction is based on: (a) the representation of the system of
conservation laws by a kinetic vectorial representation with a stiff relaxation
term; (b) a matrix-free, CFL-less implicit discontinuous Galerkin transport
solver; and (c) a stiffly accurate composition method for time integration. The
method is validated on several one-dimensional test cases. It is then applied
on two-dimensional and three-dimensional test cases: flow past a cylinder,
magnetohydrodynamics and multifluid sedimentation.
| math.AP | we construct a high order discontinuous galerkin method for solving general hyperbolic systems of conservation laws the method is cflless matrixfree has the complexity of an explicit scheme and can be of arbitrary order in space and time the construction is based on a the representation of the system of conservation laws by a kinetic vectorial representation with a stiff relaxation term b a matrixfree cflless implicit discontinuous galerkin transport solver and c a stiffly accurate composition method for time integration the method is validated on several onedimensional test cases it is then applied on twodimensional and threedimensional test cases flow past a cylinder magnetohydrodynamics and multifluid sedimentation | [['we', 'construct', 'a', 'high', 'order', 'discontinuous', 'galerkin', 'method', 'for', 'solving', 'general', 'hyperbolic', 'systems', 'of', 'conservation', 'laws', 'the', 'method', 'is', 'cflless', 'matrixfree', 'has', 'the', 'complexity', 'of', 'an', 'explicit', 'scheme', 'and', 'can', 'be', 'of', 'arbitrary', 'order', 'in', 'space', 'and', 'time', 'the', 'construction', 'is', 'based', 'on', 'a', 'the', 'representation', 'of', 'the', 'system', 'of', 'conservation', 'laws', 'by', 'a', 'kinetic', 'vectorial', 'representation', 'with', 'a', 'stiff', 'relaxation', 'term', 'b', 'a', 'matrixfree', 'cflless', 'implicit', 'discontinuous', 'galerkin', 'transport', 'solver', 'and', 'c', 'a', 'stiffly', 'accurate', 'composition', 'method', 'for', 'time', 'integration', 'the', 'method', 'is', 'validated', 'on', 'several', 'onedimensional', 'test', 'cases', 'it', 'is', 'then', 'applied', 'on', 'twodimensional', 'and', 'threedimensional', 'test', 'cases', 'flow', 'past', 'a', 'cylinder', 'magnetohydrodynamics', 'and', 'multifluid', 'sedimentation']] | [-0.12564258863446567, 0.046067649073693415, -0.12427933190516548, 0.018618907230326307, -0.0822289172770842, -0.15333642577313167, -0.025429947525789996, 0.34156701510842397, -0.28038680057023774, -0.2740128246874039, 0.13805925794811216, -0.20680293984676026, -0.1039537316021281, 0.220389351512323, -0.016273845883332333, 0.12766929008154515, 0.06691128296672173, -0.04168248857714166, -0.12493504772296632, -0.21959269155291314, 0.3001351578793717, 0.003925620560657303, 0.27768261532984534, 0.016116738877311913, 0.19981275026176898, -0.08183587974438197, -0.02633275777839546, 0.07560796960350208, -0.09927029219754743, 0.10458635908050709, 0.19933072284725056, 0.038955794941669085, 0.2785156418828575, -0.4213266379094489, -0.25556206070342463, 0.03186954751628328, 0.12926221732269833, 0.13361932838309276, -0.07566934655187652, -0.24261830224356842, 0.056138115609943307, -0.20624150631439714, -0.13393141848105444, -0.15294481627643108, 0.025338634178657435, 0.048297868571507765, -0.31908083640320123, 0.10105926755218292, 0.05752287381592224, 0.06401381356079343, -0.09236323734183076, -0.05692905573122739, 0.00600083959552477, 0.06111274521692463, -0.0033618651499602733, 0.00813261058427534, 0.05133081539775649, -0.0642931830700276, -0.09396158071138176, 0.44832305088287816, -0.06179786352264994, -0.3277938012560865, 0.21040098711119015, -0.07994659389544911, -0.08717539678503461, 0.1664382373685685, 0.22903922408432612, 0.22370558859393844, -0.12883551208794397, 0.1306203033238043, -0.04394869628375537, 0.16347821068017576, 0.020186979578421364, -0.09917937815002657, 0.12409333421690565, 0.22157379128214605, 0.10361521016094694, 0.07841685935657225, -0.0725443692776849, -0.11998129604419447, -0.3282330299393748, -0.22889287271967954, -0.20230636166559393, 0.006133492572566951, -0.1302683677359315, -0.1957114373052598, 0.38164724947627, 0.11484446343614386, 0.0702901812586582, 0.07429789687410208, 0.3349945726892296, 0.19861055564691033, 0.026513094934173597, 0.11346944747931974, 0.1472574991859355, 0.16592882916480653, 0.141443852034292, -0.26118318460231543, 0.03268912095875251, 0.22211240403319024] |
1,802.04591 | First Order Generative Adversarial Networks | GANs excel at learning high dimensional distributions, but they can update
generator parameters in directions that do not correspond to the steepest
descent direction of the objective. Prominent examples of problematic update
directions include those used in both Goodfellow's original GAN and the
WGAN-GP. To formally describe an optimal update direction, we introduce a
theoretical framework which allows the derivation of requirements on both the
divergence and corresponding method for determining an update direction, with
these requirements guaranteeing unbiased mini-batch updates in the direction of
steepest descent. We propose a novel divergence which approximates the
Wasserstein distance while regularizing the critic's first order information.
Together with an accompanying update direction, this divergence fulfills the
requirements for unbiased steepest descent updates. We verify our method, the
First Order GAN, with image generation on CelebA, LSUN and CIFAR-10 and set a
new state of the art on the One Billion Word language generation task. Code to
reproduce experiments is available.
| cs.LG stat.ML | gans excel at learning high dimensional distributions but they can update generator parameters in directions that do not correspond to the steepest descent direction of the objective prominent examples of problematic update directions include those used in both goodfellows original gan and the wgangp to formally describe an optimal update direction we introduce a theoretical framework which allows the derivation of requirements on both the divergence and corresponding method for determining an update direction with these requirements guaranteeing unbiased minibatch updates in the direction of steepest descent we propose a novel divergence which approximates the wasserstein distance while regularizing the critics first order information together with an accompanying update direction this divergence fulfills the requirements for unbiased steepest descent updates we verify our method the first order gan with image generation on celeba lsun and cifar10 and set a new state of the art on the one billion word language generation task code to reproduce experiments is available | [['gans', 'excel', 'at', 'learning', 'high', 'dimensional', 'distributions', 'but', 'they', 'can', 'update', 'generator', 'parameters', 'in', 'directions', 'that', 'do', 'not', 'correspond', 'to', 'the', 'steepest', 'descent', 'direction', 'of', 'the', 'objective', 'prominent', 'examples', 'of', 'problematic', 'update', 'directions', 'include', 'those', 'used', 'in', 'both', 'goodfellows', 'original', 'gan', 'and', 'the', 'wgangp', 'to', 'formally', 'describe', 'an', 'optimal', 'update', 'direction', 'we', 'introduce', 'a', 'theoretical', 'framework', 'which', 'allows', 'the', 'derivation', 'of', 'requirements', 'on', 'both', 'the', 'divergence', 'and', 'corresponding', 'method', 'for', 'determining', 'an', 'update', 'direction', 'with', 'these', 'requirements', 'guaranteeing', 'unbiased', 'minibatch', 'updates', 'in', 'the', 'direction', 'of', 'steepest', 'descent', 'we', 'propose', 'a', 'novel', 'divergence', 'which', 'approximates', 'the', 'wasserstein', 'distance', 'while', 'regularizing', 'the', 'critics', 'first', 'order', 'information', 'together', 'with', 'an', 'accompanying', 'update', 'direction', 'this', 'divergence', 'fulfills', 'the', 'requirements', 'for', 'unbiased', 'steepest', 'descent', 'updates', 'we', 'verify', 'our', 'method', 'the', 'first', 'order', 'gan', 'with', 'image', 'generation', 'on', 'celeba', 'lsun', 'and', 'cifar10', 'and', 'set', 'a', 'new', 'state', 'of', 'the', 'art', 'on', 'the', 'one', 'billion', 'word', 'language', 'generation', 'task', 'code', 'to', 'reproduce', 'experiments', 'is', 'available']] | [-0.05310353956475949, 0.004227208538899631, -0.07491745619743967, 0.08366378101336348, -0.12051612652755182, -0.14272338908853804, 0.022136452894770557, 0.46677170082879293, -0.3004313656692482, -0.3191613098843747, 0.081629244439381, -0.2857658067484761, -0.10589635285689195, 0.17061442615253744, -0.12308220360665374, 0.09357966052569971, 0.11064253251194256, 0.03294541774863365, -0.10437487522481234, -0.302156890586766, 0.2690856718476031, 0.07631834195986105, 0.33911740252633943, -0.03013947369400293, 0.17648445815663594, -0.01201807495479466, -0.014171285194398206, -0.03452516976368738, -0.09611749595831405, 0.18442367695592296, 0.2201241323202374, 0.1785894518919811, 0.3199254594414026, -0.40447749051556087, -0.1415015592154154, 0.07131569021660242, 0.14245893541059107, 0.13062400888254166, -0.06156434186743157, -0.25731921150010956, 0.07049202574654274, -0.11338015586719107, -0.052512771780691615, -0.13510863872387321, -0.06451386905417653, 0.037340186500349405, -0.28720172410341466, 0.043249118043952116, 0.0666276858932306, 0.02401583884089331, -0.039352867595486604, -0.15121193634713911, 0.002505855317447026, 0.10113777003138308, 0.05491344271387881, 0.09995297111413637, 0.11931937374397045, -0.1168875095075694, -0.15097397365340381, 0.334082575265769, -0.07662925008420424, -0.1927561318849593, 0.1399644463772405, -0.044400201196883135, -0.15364318926800874, 0.0746773112636463, 0.22170937722726802, 0.1614372151203833, -0.1486091151964038, 0.025584911496028494, 0.003180980924843176, 0.1449874933938063, 0.02271982342609839, -0.021194160218902264, 0.13440465345195715, 0.14379003741385438, 0.12817144671982972, 0.12468719840714126, -0.11785635377197366, -0.10959753008250883, -0.338247421334029, -0.14922777219018513, -0.18432079052558512, -0.01939455691603039, -0.11502813744902979, -0.13320011286670044, 0.4288696055745433, 0.23176042156113805, 0.21799026662632112, 0.12170069169543779, 0.3121441546738575, 0.08382476626305506, 0.08239626551193785, 0.15523375159056835, 0.20115251821958147, 0.07788642616586605, 0.12459896500874904, -0.22497366023825327, 0.11820032915610607, 0.10736091027223908] |
1,802.04592 | A Deep Reinforcement Learning Framework for Rebalancing Dockless Bike
Sharing Systems | Bike sharing provides an environment-friendly way for traveling and is
booming all over the world. Yet, due to the high similarity of user travel
patterns, the bike imbalance problem constantly occurs, especially for dockless
bike sharing systems, causing significant impact on service quality and company
revenue. Thus, it has become a critical task for bike sharing systems to
resolve such imbalance efficiently. In this paper, we propose a novel deep
reinforcement learning framework for incentivizing users to rebalance such
systems. We model the problem as a Markov decision process and take both
spatial and temporal features into consideration. We develop a novel deep
reinforcement learning algorithm called Hierarchical Reinforcement Pricing
(HRP), which builds upon the Deep Deterministic Policy Gradient algorithm.
Different from existing methods that often ignore spatial information and rely
heavily on accurate prediction, HRP captures both spatial and temporal
dependencies using a divide-and-conquer structure with an embedded localized
module. We conduct extensive experiments to evaluate HRP, based on a dataset
from Mobike, a major Chinese dockless bike sharing company. Results show that
HRP performs close to the 24-timeslot look-ahead optimization, and outperforms
state-of-the-art methods in both service level and bike distribution. It also
transfers well when applied to unseen areas.
| cs.AI | bike sharing provides an environmentfriendly way for traveling and is booming all over the world yet due to the high similarity of user travel patterns the bike imbalance problem constantly occurs especially for dockless bike sharing systems causing significant impact on service quality and company revenue thus it has become a critical task for bike sharing systems to resolve such imbalance efficiently in this paper we propose a novel deep reinforcement learning framework for incentivizing users to rebalance such systems we model the problem as a markov decision process and take both spatial and temporal features into consideration we develop a novel deep reinforcement learning algorithm called hierarchical reinforcement pricing hrp which builds upon the deep deterministic policy gradient algorithm different from existing methods that often ignore spatial information and rely heavily on accurate prediction hrp captures both spatial and temporal dependencies using a divideandconquer structure with an embedded localized module we conduct extensive experiments to evaluate hrp based on a dataset from mobike a major chinese dockless bike sharing company results show that hrp performs close to the 24timeslot lookahead optimization and outperforms stateoftheart methods in both service level and bike distribution it also transfers well when applied to unseen areas | [['bike', 'sharing', 'provides', 'an', 'environmentfriendly', 'way', 'for', 'traveling', 'and', 'is', 'booming', 'all', 'over', 'the', 'world', 'yet', 'due', 'to', 'the', 'high', 'similarity', 'of', 'user', 'travel', 'patterns', 'the', 'bike', 'imbalance', 'problem', 'constantly', 'occurs', 'especially', 'for', 'dockless', 'bike', 'sharing', 'systems', 'causing', 'significant', 'impact', 'on', 'service', 'quality', 'and', 'company', 'revenue', 'thus', 'it', 'has', 'become', 'a', 'critical', 'task', 'for', 'bike', 'sharing', 'systems', 'to', 'resolve', 'such', 'imbalance', 'efficiently', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'deep', 'reinforcement', 'learning', 'framework', 'for', 'incentivizing', 'users', 'to', 'rebalance', 'such', 'systems', 'we', 'model', 'the', 'problem', 'as', 'a', 'markov', 'decision', 'process', 'and', 'take', 'both', 'spatial', 'and', 'temporal', 'features', 'into', 'consideration', 'we', 'develop', 'a', 'novel', 'deep', 'reinforcement', 'learning', 'algorithm', 'called', 'hierarchical', 'reinforcement', 'pricing', 'hrp', 'which', 'builds', 'upon', 'the', 'deep', 'deterministic', 'policy', 'gradient', 'algorithm', 'different', 'from', 'existing', 'methods', 'that', 'often', 'ignore', 'spatial', 'information', 'and', 'rely', 'heavily', 'on', 'accurate', 'prediction', 'hrp', 'captures', 'both', 'spatial', 'and', 'temporal', 'dependencies', 'using', 'a', 'divideandconquer', 'structure', 'with', 'an', 'embedded', 'localized', 'module', 'we', 'conduct', 'extensive', 'experiments', 'to', 'evaluate', 'hrp', 'based', 'on', 'a', 'dataset', 'from', 'mobike', 'a', 'major', 'chinese', 'dockless', 'bike', 'sharing', 'company', 'results', 'show', 'that', 'hrp', 'performs', 'close', 'to', 'the', '24timeslot', 'lookahead', 'optimization', 'and', 'outperforms', 'stateoftheart', 'methods', 'in', 'both', 'service', 'level', 'and', 'bike', 'distribution', 'it', 'also', 'transfers', 'well', 'when', 'applied', 'to', 'unseen', 'areas']] | [-0.09911305333640594, 0.0012695183411335564, -0.09624203484602717, 0.10241931844223413, -0.1368395144627221, -0.18802446401469522, 0.10097811070087816, 0.46370111394729185, -0.2937060232617109, -0.3159203537246351, 0.08502122350569945, -0.28786678107403824, -0.1714972366361105, 0.17827915729704633, -0.13975730615283422, 0.06733473023458787, 0.11107392672597621, 0.022047376503996477, -0.005256666200680297, -0.22822165117015256, 0.30700926250889343, 0.06645665380861078, 0.38855003826181167, 0.05820848418408958, 0.1506936500785497, 0.03014554415333701, -0.011700855786981644, -0.014148423664818579, -0.04871501705867866, 0.14895261081158004, 0.3336609965503049, 0.2115694932107911, 0.3771918346359399, -0.4196809643128915, -0.21426167920699798, 0.08948825457276989, 0.15683009888309596, 0.08078901910290252, -0.05750627598125228, -0.31632521469146013, 0.049019652706065876, -0.21866860639290023, -0.004541620759980346, -0.13404935690057718, -0.05045118069609822, -0.010950771834010916, -0.305066623575858, 0.008157754750008375, 0.024511787695787032, 0.05463173433536529, -0.05461953643973527, -0.10542322797654428, 0.03412681876100248, 0.20527867424902413, 0.05104829641612159, 0.011974094317564556, 0.1399675503440331, -0.15112099841792936, -0.15250393233739248, 0.37221327307286545, -0.026567453281045775, -0.17403079208394337, 0.1869887933007613, -0.03437551527761331, -0.16686164192503217, 0.08846955120086263, 0.28550621013699184, 0.10921065748405101, -0.15369129484898436, -0.0029649291829257018, -0.050498406444467715, 0.17732395986975424, 0.03585727121078627, -0.012646233720880985, 0.18864715846593663, 0.27703281307467886, 0.12482241220396957, 0.09729407580027273, -0.08422715302941329, -0.15945313643636322, -0.12242828410545095, -0.10416443645309793, -0.1441432422771818, -0.017487522373346623, -0.09007500506073367, -0.15512320401369414, 0.3734132135147924, 0.22565443172531935, 0.18169157609890274, 0.10882732569789097, 0.3665790807291291, 0.04879923524660526, 0.08722583222694102, 0.16268420388744867, 0.10630568731066525, -0.049342820883626626, 0.1855253035460937, -0.19288252911817708, 0.14321048342071435, 0.013734752439722345] |
1,802.04593 | DyPerm: Maximizing Permanence for Dynamic Community Detection | In this paper, we propose DyPerm, the first dynamic community detection
method which optimizes a novel community scoring metric, called permanence.
DyPerm incrementally modifies the community structure by updating those
communities where the editing of nodes and edges has been performed, keeping
the rest of the network unchanged. We present strong theoretical guarantees to
show how/why mere updates on the existing community structure leads to
permanence maximization in dynamic networks, which in turn decreases the
computational complexity drastically. Experiments on both synthetic and six
real-world networks with given ground-truth community structure show that
DyPerm achieves (on average) 35% gain in accuracy (based on NMI) compared to
the best method among four baseline methods. DyPerm also turns out to be 15
times faster than its static counterpart.
| cs.SI physics.soc-ph | in this paper we propose dyperm the first dynamic community detection method which optimizes a novel community scoring metric called permanence dyperm incrementally modifies the community structure by updating those communities where the editing of nodes and edges has been performed keeping the rest of the network unchanged we present strong theoretical guarantees to show howwhy mere updates on the existing community structure leads to permanence maximization in dynamic networks which in turn decreases the computational complexity drastically experiments on both synthetic and six realworld networks with given groundtruth community structure show that dyperm achieves on average 35 gain in accuracy based on nmi compared to the best method among four baseline methods dyperm also turns out to be 15 times faster than its static counterpart | [['in', 'this', 'paper', 'we', 'propose', 'dyperm', 'the', 'first', 'dynamic', 'community', 'detection', 'method', 'which', 'optimizes', 'a', 'novel', 'community', 'scoring', 'metric', 'called', 'permanence', 'dyperm', 'incrementally', 'modifies', 'the', 'community', 'structure', 'by', 'updating', 'those', 'communities', 'where', 'the', 'editing', 'of', 'nodes', 'and', 'edges', 'has', 'been', 'performed', 'keeping', 'the', 'rest', 'of', 'the', 'network', 'unchanged', 'we', 'present', 'strong', 'theoretical', 'guarantees', 'to', 'show', 'howwhy', 'mere', 'updates', 'on', 'the', 'existing', 'community', 'structure', 'leads', 'to', 'permanence', 'maximization', 'in', 'dynamic', 'networks', 'which', 'in', 'turn', 'decreases', 'the', 'computational', 'complexity', 'drastically', 'experiments', 'on', 'both', 'synthetic', 'and', 'six', 'realworld', 'networks', 'with', 'given', 'groundtruth', 'community', 'structure', 'show', 'that', 'dyperm', 'achieves', 'on', 'average', '35', 'gain', 'in', 'accuracy', 'based', 'on', 'nmi', 'compared', 'to', 'the', 'best', 'method', 'among', 'four', 'baseline', 'methods', 'dyperm', 'also', 'turns', 'out', 'to', 'be', '15', 'times', 'faster', 'than', 'its', 'static', 'counterpart']] | [-0.09463099720701575, -0.01465852758474648, -0.05401103761792183, 0.04082877125125378, -0.10462418510392309, -0.1385025658545783, 0.09757933535054326, 0.4498556554764509, -0.24828917988762259, -0.3452607653737068, 0.06120128443092108, -0.27172707609273494, -0.1938053832249716, 0.13286799999326468, -0.07503393352404236, 0.05792447557998821, 0.12871149145998062, 0.08810243434086441, -0.07008725542388856, -0.3081207649409771, 0.2523505897242576, 0.12772375277988612, 0.35456130402721464, 0.057554682202637195, 0.08970619173720479, -0.006236198730766774, -0.05709178149700165, 0.07800183746498078, -0.07549375838629203, 0.11353778132703156, 0.23607196440547704, 0.20164743034727872, 0.3143240155298263, -0.40107476770877837, -0.1901973385065794, 0.09736225869320334, 0.13828264670073986, 0.08974281845800579, 0.008592043939977884, -0.32932706613093615, 0.11340480638481677, -0.15941916698217393, -0.006133358184248209, -0.11343814564496278, -0.0282231222987175, -0.010759070627391338, -0.2328624569135718, 0.04615966082341038, 0.026289776604622603, 0.03790127244964242, -0.052902329097501935, -0.16231943334266544, 0.008442595399916172, 0.13157975694164634, 0.03354286529868841, 0.03551511039584875, 0.15199893034622072, -0.118306985007599, -0.16214972110278905, 0.3869799934923649, -0.0743830819564173, -0.15515722460113465, 0.1969826202839613, -0.06761550760641694, -0.16560659307986497, 0.14852576413564383, 0.20291987225413322, 0.11391506680846214, -0.1477310241176747, 0.026657172474078835, -0.057639439758844675, 0.20100802790373565, 0.056581203056499364, 0.014103204309940338, 0.12140866611152887, 0.24093071706267075, 0.1250390638895333, 0.15282298016455023, -0.07175870015844703, -0.1210540338754654, -0.15031088937819004, -0.08254586462234147, -0.15877248932421206, -0.02820567449554801, -0.13585553387901747, -0.13665812873281538, 0.4460445161424577, 0.20768996069580317, 0.18518530936725439, 0.12955868375487625, 0.3070600486919284, 0.01922704655304551, 0.08619508201442659, 0.14141067837923765, 0.2582336599044502, 0.04641865707375109, 0.11520000632526353, -0.19324257005751133, 0.1345176992751658, 0.043632219672203064] |
1,802.04594 | The QUIJOTE Experiment: Prospects for CMB B-MODE polarization detection
and foregrounds characterization | QUIJOTE (Q-U-I JOint TEnerife) is an experiment designed to achieve CMB
B-mode polarization detection and sensitive enough to detect a primordial
gravitational-wave component if the B-mode amplitude is larger than r = 0.05.
It consists in two telescopes and three instruments observing in the frequency
range 10-42 GHz installed at the Teide Observatory in the Canary Islands,
Spain. The observing strategy includes three raster scan deep integration
fields for cosmology, a nominal wide survey covering the Northen Sky and
specific raster scan deep integration observations in regions of specific
interest. The main goals of the project are presented and the first scientific
results obtained with the first instrument are reviewed.
| astro-ph.CO astro-ph.IM | quijote qui joint tenerife is an experiment designed to achieve cmb bmode polarization detection and sensitive enough to detect a primordial gravitationalwave component if the bmode amplitude is larger than r 005 it consists in two telescopes and three instruments observing in the frequency range 1042 ghz installed at the teide observatory in the canary islands spain the observing strategy includes three raster scan deep integration fields for cosmology a nominal wide survey covering the northen sky and specific raster scan deep integration observations in regions of specific interest the main goals of the project are presented and the first scientific results obtained with the first instrument are reviewed | [['quijote', 'qui', 'joint', 'tenerife', 'is', 'an', 'experiment', 'designed', 'to', 'achieve', 'cmb', 'bmode', 'polarization', 'detection', 'and', 'sensitive', 'enough', 'to', 'detect', 'a', 'primordial', 'gravitationalwave', 'component', 'if', 'the', 'bmode', 'amplitude', 'is', 'larger', 'than', 'r', '005', 'it', 'consists', 'in', 'two', 'telescopes', 'and', 'three', 'instruments', 'observing', 'in', 'the', 'frequency', 'range', '1042', 'ghz', 'installed', 'at', 'the', 'teide', 'observatory', 'in', 'the', 'canary', 'islands', 'spain', 'the', 'observing', 'strategy', 'includes', 'three', 'raster', 'scan', 'deep', 'integration', 'fields', 'for', 'cosmology', 'a', 'nominal', 'wide', 'survey', 'covering', 'the', 'northen', 'sky', 'and', 'specific', 'raster', 'scan', 'deep', 'integration', 'observations', 'in', 'regions', 'of', 'specific', 'interest', 'the', 'main', 'goals', 'of', 'the', 'project', 'are', 'presented', 'and', 'the', 'first', 'scientific', 'results', 'obtained', 'with', 'the', 'first', 'instrument', 'are', 'reviewed']] | [-0.12680939434088673, 0.12216412222470455, -0.04333026275573367, 0.06875113125554183, -0.09500225484629886, -0.11908254917512683, -0.06594083567917416, 0.3778304478748598, -0.16202691241805614, -0.3727994525667142, 0.1349934754123549, -0.32358310234525967, -0.05154829317999193, 0.2603692754723684, -0.006673832238582826, -0.001676258214973603, 0.09576438040541554, -0.10541796068557435, 0.004272112724181541, -0.25632920990810143, 0.23216498892267096, 0.19301386064951118, 0.3300471661388184, -0.062001294857408434, 0.1379647635406366, -0.04204261945819275, -0.12379745328453956, -0.04451507802500769, -0.1394049464897425, 0.054019837407395244, 0.35669965433879514, 0.19442761748063345, 0.22144561677446795, -0.338727984085886, -0.13821465734185445, 0.06621473274814586, 0.07053262978593854, -0.0016316203400492668, 0.019672682120775182, -0.35117176005668527, 0.02088197405208592, -0.13365940929859924, -0.09202764955073318, 0.008395934843941143, -0.023410785680257336, 0.0019588226762910685, -0.2518197420048872, -0.021075530792586505, -0.06835116918901568, 0.111168212748857, -0.08320504834409803, -0.16097656703614457, -0.014021510993458193, 0.10955970603282805, -0.05189130184050925, 0.08124743536420821, 0.12152145889208273, -0.09257609565543977, -0.04155965539178363, 0.32029326243489914, -0.11009611676868021, 0.003356765257228323, 0.10412033595989838, -0.26246443082130066, -0.21202397324075853, 0.14585560011888715, 0.17575528014330538, 0.11552956688467896, -0.1436541805214128, 0.06694316835341009, 0.07994403629305048, 0.23439025086419726, 0.1386473829926992, 0.015579033440358384, 0.30232450081449413, 0.18791807649001754, 0.11150958025623199, 0.11745865563366183, -0.31329925333287706, -0.026176918832654203, -0.31967815291136503, -0.07720976268562178, -0.15311962458104567, -0.00222372320584125, -0.05036682829517371, -0.0862890660560138, 0.4307303194784456, 0.15860388135236766, 0.12556070971940816, 0.019003044693144382, 0.3376069521979877, -0.03159163796334286, 0.1069266538985108, -0.010226595357784795, 0.32477254215282975, 0.05897758425972252, 0.20137478902729022, -0.13940973765501338, -0.01400357395996926, -0.027457062668098067] |
1,802.04595 | Information Sufficiency and Stability in Decentralized Decision-Making | This paper develops a formal framework for analyzing information sufficiency in cooperative decision-making. Departing from models of incomplete information that emphasize accuracy of beliefs, we ask what kind and amount of information are required for justifying a choice. Using Gentzen-style sequent calculus, we construct a syntactic model that makes explicit an agent's reasoning process: from which information, through what inference procedure, and to what conclusion. We define a syntactic criterion, called C$_i$-acceptability, to determine when a proposed distribution is justifiable given limited structural information. We show that, under a mild assumption that each coalition's potential is known to at least one member, the set of unanimously accepted payoffs coincides with the core. This reinterprets the core not as a predictive solution, but as the boundary of what can be justified under minimal information. Moreover, our results offer a new perspective on Debreu-Scarf theorem: while the core converges to the competitive equilibrium in replicated markets, this convergence obscures a key asymmetry. Competitive equilibrium requires only local information -- preferences and prices -- regardless of market size, whereas reaching the core entails increasing informational demands that may ultimately exceed any agent's cognitive capacity. | econ.TH | this paper develops a formal framework for analyzing information sufficiency in cooperative decisionmaking departing from models of incomplete information that emphasize accuracy of beliefs we ask what kind and amount of information are required for justifying a choice using gentzenstyle sequent calculus we construct a syntactic model that makes explicit an agents reasoning process from which information through what inference procedure and to what conclusion we define a syntactic criterion called c_iacceptability to determine when a proposed distribution is justifiable given limited structural information we show that under a mild assumption that each coalitions potential is known to at least one member the set of unanimously accepted payoffs coincides with the core this reinterprets the core not as a predictive solution but as the boundary of what can be justified under minimal information moreover our results offer a new perspective on debreuscarf theorem while the core converges to the competitive equilibrium in replicated markets this convergence obscures a key asymmetry competitive equilibrium requires only local information preferences and prices regardless of market size whereas reaching the core entails increasing informational demands that may ultimately exceed any agents cognitive capacity | [['this', 'paper', 'develops', 'a', 'formal', 'framework', 'for', 'analyzing', 'information', 'sufficiency', 'in', 'cooperative', 'decisionmaking', 'departing', 'from', 'models', 'of', 'incomplete', 'information', 'that', 'emphasize', 'accuracy', 'of', 'beliefs', 'we', 'ask', 'what', 'kind', 'and', 'amount', 'of', 'information', 'are', 'required', 'for', 'justifying', 'a', 'choice', 'using', 'gentzenstyle', 'sequent', 'calculus', 'we', 'construct', 'a', 'syntactic', 'model', 'that', 'makes', 'explicit', 'an', 'agents', 'reasoning', 'process', 'from', 'which', 'information', 'through', 'what', 'inference', 'procedure', 'and', 'to', 'what', 'conclusion', 'we', 'define', 'a', 'syntactic', 'criterion', 'called', 'c_iacceptability', 'to', 'determine', 'when', 'a', 'proposed', 'distribution', 'is', 'justifiable', 'given', 'limited', 'structural', 'information', 'we', 'show', 'that', 'under', 'a', 'mild', 'assumption', 'that', 'each', 'coalitions', 'potential', 'is', 'known', 'to', 'at', 'least', 'one', 'member', 'the', 'set', 'of', 'unanimously', 'accepted', 'payoffs', 'coincides', 'with', 'the', 'core', 'this', 'reinterprets', 'the', 'core', 'not', 'as', 'a', 'predictive', 'solution', 'but', 'as', 'the', 'boundary', 'of', 'what', 'can', 'be', 'justified', 'under', 'minimal', 'information', 'moreover', 'our', 'results', 'offer', 'a', 'new', 'perspective', 'on', 'debreuscarf', 'theorem', 'while', 'the', 'core', 'converges', 'to', 'the', 'competitive', 'equilibrium', 'in', 'replicated', 'markets', 'this', 'convergence', 'obscures', 'a', 'key', 'asymmetry', 'competitive', 'equilibrium', 'requires', 'only', 'local', 'information', 'preferences', 'and', 'prices', 'regardless', 'of', 'market', 'size', 'whereas', 'reaching', 'the', 'core', 'entails', 'increasing', 'informational', 'demands', 'that', 'may', 'ultimately', 'exceed', 'any', 'agents', 'cognitive', 'capacity']] | [-0.08677781803656698, 0.04109623384443149, -0.13725152044223352, 0.11995492338794192, -0.15578645423931234, -0.1824284178937255, 0.1391396434401177, 0.3598628735822192, -0.2953508230882453, -0.2721523214629627, 0.11036904126053669, -0.24918844247296612, -0.13087731822553206, 0.11399050374679706, -0.14217051550656318, 0.002658893797486861, 0.08456680683150171, 0.09080647795466099, -0.02198664180406514, -0.23614097925221778, 0.3286031670718987, 0.06593934341114671, 0.30072885313454795, 0.05374297181102024, 0.12570642987959538, -0.004161980062882531, -0.005693914874252629, 0.04010363909376058, -0.14064135961954383, 0.13577950695893146, 0.29322528272810316, 0.23788638675789583, 0.35998083392088426, -0.42126054416365805, -0.19102640039496682, 0.12029842827357053, 0.1160088995506459, 0.09337937568932557, -0.006131921099045346, -0.2440474895015857, 0.10062681604363523, -0.17628696245355482, -0.0996896414051049, -0.10511572648556952, -0.015179989602974552, -0.010195263951393044, -0.3068928349499197, 0.026709532465120867, 0.123297951181723, 0.07850986580180133, -0.054261621358750865, -0.10741052799733644, -0.028096781683747064, 0.12090138471165528, 0.030585201488736828, -0.004011104448031096, 0.1607116606450057, -0.15170412711963496, -0.1317637980452435, 0.37529642177237704, -0.016198429437154993, -0.20060546935117618, 0.15309861225803148, -0.10709860720509852, -0.15972754225398808, 0.10988910493464582, 0.1049329568877851, 0.074817697222489, -0.18579510841333435, 0.031306341648124215, -0.07564880837590489, 0.22638789205911525, 0.07495104173636612, 0.05047283482857367, 0.20663647731220758, 0.19305801299340863, 0.11601047558998838, 0.1056690919169419, 0.009870702370921558, -0.17321660921455703, -0.29414737754237447, -0.13771530004021498, -0.16759017459988435, 0.05829046968811747, -0.10637456768064418, -0.15151361710476605, 0.3205155282104537, 0.21647865570307195, 0.1423390064205486, 0.11198824276353288, 0.29401586158263354, 0.08355856893646697, 0.04632484950971874, 0.109629989829522, 0.1933883073077323, 0.05241936492300368, 0.09485524592617338, -0.14569754542858854, 0.19527581210103742, 0.020261215880254212] |
1,802.04596 | Cosmological constant and renormalization of gravity | In arXiv:1601.02203 and arXiv:1702.07063, we have proposed a topological
model with a simple Lagrangian density and have tried to solve one of the
cosmological constant problems. The Lagrangian density is the BRS exact and
therefore the model can be regarded as a topological theory. In this model, the
divergence of the vacuum energy coming from the quantum corrections from
matters can be absorbed into the redefinition of the scalar field. In this
paper, we consider the extension of the model in order to apply the mechanism
to other kinds of divergences coming from the quantum correction and consider
the cosmology in an extended model.
| hep-th astro-ph.CO gr-qc | in arxiv160102203 and arxiv170207063 we have proposed a topological model with a simple lagrangian density and have tried to solve one of the cosmological constant problems the lagrangian density is the brs exact and therefore the model can be regarded as a topological theory in this model the divergence of the vacuum energy coming from the quantum corrections from matters can be absorbed into the redefinition of the scalar field in this paper we consider the extension of the model in order to apply the mechanism to other kinds of divergences coming from the quantum correction and consider the cosmology in an extended model | [['in', 'arxiv160102203', 'and', 'arxiv170207063', 'we', 'have', 'proposed', 'a', 'topological', 'model', 'with', 'a', 'simple', 'lagrangian', 'density', 'and', 'have', 'tried', 'to', 'solve', 'one', 'of', 'the', 'cosmological', 'constant', 'problems', 'the', 'lagrangian', 'density', 'is', 'the', 'brs', 'exact', 'and', 'therefore', 'the', 'model', 'can', 'be', 'regarded', 'as', 'a', 'topological', 'theory', 'in', 'this', 'model', 'the', 'divergence', 'of', 'the', 'vacuum', 'energy', 'coming', 'from', 'the', 'quantum', 'corrections', 'from', 'matters', 'can', 'be', 'absorbed', 'into', 'the', 'redefinition', 'of', 'the', 'scalar', 'field', 'in', 'this', 'paper', 'we', 'consider', 'the', 'extension', 'of', 'the', 'model', 'in', 'order', 'to', 'apply', 'the', 'mechanism', 'to', 'other', 'kinds', 'of', 'divergences', 'coming', 'from', 'the', 'quantum', 'correction', 'and', 'consider', 'the', 'cosmology', 'in', 'an', 'extended', 'model']] | [-0.07381123528523627, 0.12239286507717813, -0.12926434538801948, 0.07775266088120748, -0.042171806955308304, -0.12217538170607797, -0.0077462745784763615, 0.2932808963837577, -0.29264742472921224, -0.31450825400522675, 0.07661085919929012, -0.2844101639336669, -0.14164743722215586, 0.13586402175646714, -0.04210178426914282, 0.034916386496750454, -0.03861447805013763, 0.0778762499673986, -0.06639717434368589, -0.21572789941530893, 0.3506283272541694, 0.036272181247077956, 0.21659300092826872, 0.0638601523778383, 0.08056423815843813, -0.03727244574110955, -0.01149098391589873, 0.06023082086889475, -0.122008977510382, 0.12398750940337777, 0.20027412696029334, 0.08762292316475627, 0.22858994377505346, -0.4448110570163265, -0.2741265331997591, 0.11678921816614914, 0.10972581578272522, 0.17560947843480343, -0.03444773998732368, -0.2653121177070573, 0.06704714114996879, -0.2187912629132031, -0.12965248265833246, -0.060990944102990864, -0.07270203256755885, -0.053947312593021816, -0.2439827325151247, 0.07621391045440938, 0.013517830927180601, -0.02982984254976698, -0.06440221172684402, -0.06829959728444616, 0.012019588475060813, 0.1015654474670323, 0.09225748733996286, 0.04264571977888837, 0.08034334171965134, -0.17945662920144112, -0.13452112750383094, 0.43919634094973115, -0.10984065341329494, -0.22817025470602162, 0.125070822251705, -0.08794092467310381, -0.13374309090203515, 0.08799913806804255, 0.18864896292706915, 0.11781353629468118, -0.13556580490651815, 0.17169140414197875, -0.012171762723786136, 0.1329101541572634, 0.009060197820266088, 0.023316478849772143, 0.23915042274394163, 0.09084013241397984, 0.04415458501499219, 0.16435057144696533, -0.06910874948873386, -0.13603603291124397, -0.3597868387952593, -0.16520407466975717, -0.14129633161093236, 0.06788706469952184, -0.06806774886596638, -0.1631195488130199, 0.4204791133547677, 0.19511237660167263, 0.19805516831932918, 0.015804034529947768, 0.29697935338424264, 0.16386335163135266, 0.09582376322656523, 0.03775452641204145, 0.2768746860617516, 0.13775292810454381, 0.07117888574744118, -0.20761615403827427, -0.01555172735186038, 0.08907760964140442] |
1,802.04597 | Mimetic Spectral Element Method for Anisotropic Diffusion | This paper addresses the topological structure of steady, anisotropic,
inhomogeneous diffusion problems. Two discrete formulations: a) mixed and b)
direct formulations are discussed. Differential operators are represented by
sparse incidence matrices, while weighted mass matrices play the role of
metric-dependent Hodge matrices. The resulting mixed formulations are
point-wise divergence-free if the right hand side function f = 0. The method is
inf-sup stable and displays optimal convergence on orthogonal and non-affine
grids.
| math.NA | this paper addresses the topological structure of steady anisotropic inhomogeneous diffusion problems two discrete formulations a mixed and b direct formulations are discussed differential operators are represented by sparse incidence matrices while weighted mass matrices play the role of metricdependent hodge matrices the resulting mixed formulations are pointwise divergencefree if the right hand side function f 0 the method is infsup stable and displays optimal convergence on orthogonal and nonaffine grids | [['this', 'paper', 'addresses', 'the', 'topological', 'structure', 'of', 'steady', 'anisotropic', 'inhomogeneous', 'diffusion', 'problems', 'two', 'discrete', 'formulations', 'a', 'mixed', 'and', 'b', 'direct', 'formulations', 'are', 'discussed', 'differential', 'operators', 'are', 'represented', 'by', 'sparse', 'incidence', 'matrices', 'while', 'weighted', 'mass', 'matrices', 'play', 'the', 'role', 'of', 'metricdependent', 'hodge', 'matrices', 'the', 'resulting', 'mixed', 'formulations', 'are', 'pointwise', 'divergencefree', 'if', 'the', 'right', 'hand', 'side', 'function', 'f', '0', 'the', 'method', 'is', 'infsup', 'stable', 'and', 'displays', 'optimal', 'convergence', 'on', 'orthogonal', 'and', 'nonaffine', 'grids']] | [-0.16441388407879523, 0.14596214830140833, -0.044692591908322254, 0.08656207433718086, -0.08179607937886367, -0.18029845532843133, -0.05982176062132848, 0.38337192479783383, -0.3579815843759078, -0.18752250418355557, 0.16855067964380896, -0.24220878472158186, -0.1740035004257946, 0.12313486409412933, -0.07832265460968647, 0.07366963533002516, 0.07835578519693563, -0.017466294592325116, -0.15480238364510973, -0.23187803272420252, 0.3662454226959339, -0.05205741735227721, 0.27604525377580397, 0.011386032216250896, 0.11913259858003175, -0.0079195454690448, -0.06576036147012466, 0.019951748937158516, -0.10183021288470064, 0.1227856023223992, 0.25949205618194293, 0.049763570795439076, 0.26227799535755225, -0.4173282606159927, -0.15293448449204294, 0.14648618555011253, 0.11883821500412806, 0.026335100456416398, -0.03883899892122865, -0.24582284174754587, 0.0761997291267338, -0.09517554979784493, -0.13085963729191835, -0.07633090912836643, -0.01781580380728127, 0.0329785106472448, -0.3533599624569318, 0.16872573298284074, 0.07619202409831571, 0.044940466257992764, -0.10793787538087074, -0.21932904490492713, -0.06171951183235981, 0.06551854700033724, 0.0146356025205689, -0.043223744789531955, 0.08575137530807668, -0.07409113892485243, -0.0883076702257697, 0.3587940309039304, -0.019570251520145947, -0.30074763459376463, 0.12101085354167392, -0.10132491658769653, -0.12098738332738129, 0.10865956218585267, 0.16757290614900036, 0.17624660420008528, -0.07188456117349322, 0.1693113382658134, -0.09652614743042161, 0.09828018474299953, 0.08141505495238473, 0.029303498395626813, 0.13848658762281943, 0.0736824332697081, 0.1838148925846941, 0.09580717529629318, 0.009714978394544565, -0.14226644861341362, -0.2966206257139713, -0.1156863566934013, -0.14942800828163894, 0.02183098198159788, -0.15931356635045515, -0.23721390325103847, 0.3623597793753298, 0.03909155238800171, 0.11519142947959858, 0.04863183661429605, 0.26905263755076997, 0.16928664397474535, -0.030260829460761234, 0.09042165278863738, 0.1588949330387191, 0.29764028776987966, 0.09684586359358484, -0.2257875578910847, 0.07581688320054344, 0.19400281359074295] |
1,802.04598 | Estimating the coronal and chromospheric magnetic fields of solar active
regions as observed with the Nobeyama Radioheliograph Compared with the
Extrapolated Linear Force-Free Field | Adopting the thermal free-free emission mechanism, the coronal and
chromospheric magnetic fields are derived from the polarization and spectral
observations with the Nobeyama Radioheliograph at 1.76 cm. The solar active
regions (AR) located near the disk center observed on January 8, 2015 (AR
12257) and December 4, 2016 (AR 12615) are used for the estimate of the
chromospheric and coronal magnetic fields with the microwave radio
observations. We compare solar radio maps of active regions for both intensity
and circularly polarized component with the optical maps from observations with
the Helioseismic and Magnetic Imager and the chromosphere and corona transition
region images obtained with the Atmospheric Imaging Assembly instrument, on
board the Solar Dynamic Observatory. We notice from the comparison between
radio maps of both AR that the circular polarization degree in the AR 12257 is
about 2 percent, but the AR 12615 has a higher existent value by 3 percent.
Radio observations provide us for direct measurements of magnetic fields in the
chromospheric and coronal layers. We estimate the coronal magnetic fields using
the Atmospheric Imaging Assembly observations by adopting magnetic loops in the
corona over some patches with weak photospheric magnetic fields. The coronal
magnetic field derived from the Atmospheric Imaging Assembly data was from 90
to 240 Gauss. We also study the coronal magnetic fields based on the structure
of the extrapolated field, where the result of the magnetic fields was in the
range from 35 to 145 Gauss, showing that the difference in the coronal magnetic
fields between both results is attributed to the assumption of the force-free
approximation.
| astro-ph.SR | adopting the thermal freefree emission mechanism the coronal and chromospheric magnetic fields are derived from the polarization and spectral observations with the nobeyama radioheliograph at 176 cm the solar active regions ar located near the disk center observed on january 8 2015 ar 12257 and december 4 2016 ar 12615 are used for the estimate of the chromospheric and coronal magnetic fields with the microwave radio observations we compare solar radio maps of active regions for both intensity and circularly polarized component with the optical maps from observations with the helioseismic and magnetic imager and the chromosphere and corona transition region images obtained with the atmospheric imaging assembly instrument on board the solar dynamic observatory we notice from the comparison between radio maps of both ar that the circular polarization degree in the ar 12257 is about 2 percent but the ar 12615 has a higher existent value by 3 percent radio observations provide us for direct measurements of magnetic fields in the chromospheric and coronal layers we estimate the coronal magnetic fields using the atmospheric imaging assembly observations by adopting magnetic loops in the corona over some patches with weak photospheric magnetic fields the coronal magnetic field derived from the atmospheric imaging assembly data was from 90 to 240 gauss we also study the coronal magnetic fields based on the structure of the extrapolated field where the result of the magnetic fields was in the range from 35 to 145 gauss showing that the difference in the coronal magnetic fields between both results is attributed to the assumption of the forcefree approximation | [['adopting', 'the', 'thermal', 'freefree', 'emission', 'mechanism', 'the', 'coronal', 'and', 'chromospheric', 'magnetic', 'fields', 'are', 'derived', 'from', 'the', 'polarization', 'and', 'spectral', 'observations', 'with', 'the', 'nobeyama', 'radioheliograph', 'at', '176', 'cm', 'the', 'solar', 'active', 'regions', 'ar', 'located', 'near', 'the', 'disk', 'center', 'observed', 'on', 'january', '8', '2015', 'ar', '12257', 'and', 'december', '4', '2016', 'ar', '12615', 'are', 'used', 'for', 'the', 'estimate', 'of', 'the', 'chromospheric', 'and', 'coronal', 'magnetic', 'fields', 'with', 'the', 'microwave', 'radio', 'observations', 'we', 'compare', 'solar', 'radio', 'maps', 'of', 'active', 'regions', 'for', 'both', 'intensity', 'and', 'circularly', 'polarized', 'component', 'with', 'the', 'optical', 'maps', 'from', 'observations', 'with', 'the', 'helioseismic', 'and', 'magnetic', 'imager', 'and', 'the', 'chromosphere', 'and', 'corona', 'transition', 'region', 'images', 'obtained', 'with', 'the', 'atmospheric', 'imaging', 'assembly', 'instrument', 'on', 'board', 'the', 'solar', 'dynamic', 'observatory', 'we', 'notice', 'from', 'the', 'comparison', 'between', 'radio', 'maps', 'of', 'both', 'ar', 'that', 'the', 'circular', 'polarization', 'degree', 'in', 'the', 'ar', '12257', 'is', 'about', '2', 'percent', 'but', 'the', 'ar', '12615', 'has', 'a', 'higher', 'existent', 'value', 'by', '3', 'percent', 'radio', 'observations', 'provide', 'us', 'for', 'direct', 'measurements', 'of', 'magnetic', 'fields', 'in', 'the', 'chromospheric', 'and', 'coronal', 'layers', 'we', 'estimate', 'the', 'coronal', 'magnetic', 'fields', 'using', 'the', 'atmospheric', 'imaging', 'assembly', 'observations', 'by', 'adopting', 'magnetic', 'loops', 'in', 'the', 'corona', 'over', 'some', 'patches', 'with', 'weak', 'photospheric', 'magnetic', 'fields', 'the', 'coronal', 'magnetic', 'field', 'derived', 'from', 'the', 'atmospheric', 'imaging', 'assembly', 'data', 'was', 'from', '90', 'to', '240', 'gauss', 'we', 'also', 'study', 'the', 'coronal', 'magnetic', 'fields', 'based', 'on', 'the', 'structure', 'of', 'the', 'extrapolated', 'field', 'where', 'the', 'result', 'of', 'the', 'magnetic', 'fields', 'was', 'in', 'the', 'range', 'from', '35', 'to', '145', 'gauss', 'showing', 'that', 'the', 'difference', 'in', 'the', 'coronal', 'magnetic', 'fields', 'between', 'both', 'results', 'is', 'attributed', 'to', 'the', 'assumption', 'of', 'the', 'forcefree', 'approximation']] | [-0.07140602631640702, 0.19148031976769797, 0.042097147561295734, 0.08904774369354364, -0.05709607720596295, -0.030985364086490653, 0.012851206987643065, 0.4474041580982592, -0.1805776366607154, -0.42101079190927787, 0.10373995723907561, -0.2652836467221493, -0.09885876197938832, 0.24529109500130902, 0.03437789534457238, -0.03715494969659895, 0.050724701736687944, -0.04178135265706382, -0.03184406119809126, -0.16101468766020732, 0.2736122483830057, 0.12361910841267171, 0.21938684721828805, 0.004508200165783537, 0.0985095577401027, -0.08825922200623079, -0.0504295288467373, 0.02427599113434553, -0.09592017299662678, 0.07353520924867742, 0.1814565918367299, 0.10664102483283856, 0.1586566517812867, -0.4499602267425864, -0.2299330087050339, -0.011190854612438158, 0.09525260113632857, -0.018844246478497955, -0.02213308960511581, -0.2909158467604169, 0.06045850865423351, -0.0682996751199645, -0.08314510589372723, 0.06626987829090764, -0.01779712395344672, 0.0238850315492172, -0.3176789267135381, 0.04723603609189751, -0.005748280984620739, 0.1915942743497319, -0.17894789972164135, -0.06983429097688232, -0.06275818740299606, 0.13746532747857415, 0.05776402125691717, 0.09491603272089243, 0.19383062085964614, -0.13156529977717848, -0.07793192320299902, 0.3095642887368099, -0.0935651749743584, 0.004973423792142064, 0.18565895713926417, -0.2853331930821198, -0.12008800353922693, 0.21082626477997193, 0.13724221349194274, 0.07840642558903187, -0.10539638688025096, 0.05966999673465681, -0.053173218665544614, 0.16569781120977153, 0.07790379471348963, -0.005949270242461185, 0.2785526935628462, 0.06436619769168082, 0.05123488897086617, 0.13118384316852638, -0.321024401613843, -0.011522120119061792, -0.2396882668394467, -0.11235409717566612, -0.09327431480842732, 0.059110464885031584, -0.1098880553281874, -0.1616953952265618, 0.41834575587248435, 0.1757307928019842, 0.17934159871540478, -0.04091561479597456, 0.323429475643697, 0.09427492954934166, 0.06848863781147933, 0.14709713675395739, 0.34525243666656835, 0.27681541658930797, 0.23501659024166036, -0.20982036422545597, -0.013291570532824344, 0.045553118503434846] |
1,802.04599 | Two-Dimensional Dilaton Gravity Theory and Lattice Schwarzian Theory | We report a holographic study of a two-dimensional dilaton gravity theory
with the Dirichlet boundary condition for the cases of non-vanishing and
vanishing cosmological constants. Our result shows that the boundary theory of
the two-dimensional dilaton gravity theory with the Dirichlet boundary
condition for the case of non-vanishing cosmological constants is the
Schwarzian term coupled to a dilaton field, while for the case of vanishing
cosmological constant, a theory does not have a kinetic term. We also include
the higher derivative term $R^2$, where $R$ is the scalar curvature that is
coupled to a dilaton field. We find that the form of the boundary theory is not
modified perturbatively. Finally, we show that a lattice holographic picture is
realized up to the second-order perturbation of boundary cut-off $\epsilon^2$
under a constant boundary dilaton field and the non-vanishing cosmological
constant by identifying the lattice spacing $a$ of a lattice Schwarzian theory
with the boundary cut-off $\epsilon$ of the two-dimensional dilaton gravity
theory.
| hep-th | we report a holographic study of a twodimensional dilaton gravity theory with the dirichlet boundary condition for the cases of nonvanishing and vanishing cosmological constants our result shows that the boundary theory of the twodimensional dilaton gravity theory with the dirichlet boundary condition for the case of nonvanishing cosmological constants is the schwarzian term coupled to a dilaton field while for the case of vanishing cosmological constant a theory does not have a kinetic term we also include the higher derivative term r2 where r is the scalar curvature that is coupled to a dilaton field we find that the form of the boundary theory is not modified perturbatively finally we show that a lattice holographic picture is realized up to the secondorder perturbation of boundary cutoff epsilon2 under a constant boundary dilaton field and the nonvanishing cosmological constant by identifying the lattice spacing a of a lattice schwarzian theory with the boundary cutoff epsilon of the twodimensional dilaton gravity theory | [['we', 'report', 'a', 'holographic', 'study', 'of', 'a', 'twodimensional', 'dilaton', 'gravity', 'theory', 'with', 'the', 'dirichlet', 'boundary', 'condition', 'for', 'the', 'cases', 'of', 'nonvanishing', 'and', 'vanishing', 'cosmological', 'constants', 'our', 'result', 'shows', 'that', 'the', 'boundary', 'theory', 'of', 'the', 'twodimensional', 'dilaton', 'gravity', 'theory', 'with', 'the', 'dirichlet', 'boundary', 'condition', 'for', 'the', 'case', 'of', 'nonvanishing', 'cosmological', 'constants', 'is', 'the', 'schwarzian', 'term', 'coupled', 'to', 'a', 'dilaton', 'field', 'while', 'for', 'the', 'case', 'of', 'vanishing', 'cosmological', 'constant', 'a', 'theory', 'does', 'not', 'have', 'a', 'kinetic', 'term', 'we', 'also', 'include', 'the', 'higher', 'derivative', 'term', 'r2', 'where', 'r', 'is', 'the', 'scalar', 'curvature', 'that', 'is', 'coupled', 'to', 'a', 'dilaton', 'field', 'we', 'find', 'that', 'the', 'form', 'of', 'the', 'boundary', 'theory', 'is', 'not', 'modified', 'perturbatively', 'finally', 'we', 'show', 'that', 'a', 'lattice', 'holographic', 'picture', 'is', 'realized', 'up', 'to', 'the', 'secondorder', 'perturbation', 'of', 'boundary', 'cutoff', 'epsilon2', 'under', 'a', 'constant', 'boundary', 'dilaton', 'field', 'and', 'the', 'nonvanishing', 'cosmological', 'constant', 'by', 'identifying', 'the', 'lattice', 'spacing', 'a', 'of', 'a', 'lattice', 'schwarzian', 'theory', 'with', 'the', 'boundary', 'cutoff', 'epsilon', 'of', 'the', 'twodimensional', 'dilaton', 'gravity', 'theory']] | [-0.21950979230879164, 0.14606780659332178, -0.10152291137687515, 0.03870276444496136, -0.130410225550002, -0.20666109893748663, -0.03272055255275173, 0.274885646108052, -0.21749690123284177, -0.21016442854975506, 0.08694345513879327, -0.26750145366658334, -0.14805833580007094, 0.10519017732661703, -0.015819911678720797, 0.055776480079183115, -0.016978745841889742, 0.10149192943104676, -0.09351497487112972, -0.2524030570183759, 0.38474980252650304, 0.030141025044093404, 0.20913271614645393, 0.1197858168139782, 0.1073483198632411, -0.06784425999228813, 0.04426569440141783, 0.05993886142673348, -0.21578228087341617, 0.07040541510022483, 0.1333986775492613, -0.030621324341906155, 0.2415413649185844, -0.3879639298788139, -0.310209200804278, 0.05338353972870463, 0.08423554117542616, 0.1418986299222694, -0.03418644561623194, -0.22498029665114005, 0.06893863273865503, -0.14157001136784783, -0.18323367678774347, -0.05877503982936003, -0.013797169453637986, -0.09297950383057378, -0.3299941074403917, 0.13674545864070628, 0.010131692675792652, 0.015317590658477745, -0.12894415103408122, -0.05339292006607613, -0.044637744111061, 0.039073803965349374, 0.14995977977111427, 0.10777921197930154, 0.0792007403106932, -0.19099128522233377, -0.053552308578987066, 0.3881848942233909, -0.19672877639018704, -0.26016126726956473, 0.0979438069137681, -0.17187961712421745, -0.12159095436438733, 0.05328201368705415, 0.08607362223476726, 0.15989189238073478, -0.11274448683867173, 0.24446244270508957, -0.034001345318880924, 0.17792743634178032, 0.10018927817412229, -0.010660681503344767, 0.23900671425038336, 0.055500270330248784, 0.07571820143150362, 0.1321338669900198, -0.004842662034116639, -0.12661206026659896, -0.4596097978260021, -0.14421727904552442, -0.1731479991515173, 0.09944246772706353, -0.1997165598453569, -0.24664816120350214, 0.33617454215809006, 0.09680816097624646, 0.14925522048327122, 0.09876626692943691, 0.21072075597982368, 0.15527275913056587, 0.06410052685026565, 0.04905508475389725, 0.2711121611071531, 0.17947998164678627, 0.10970250443954553, -0.29525458878947436, -0.11122997739982808, 0.15046994718983306] |
1,802.046 | Experimental Observation of Flow Fields Around Active Janus Spheres | The hydrodynamic flow field around a catalytically active colloid is probed
using particle tracking velocimetry both in the freely swimming state and when
kept stationary with an external force. Our measurements provide information
about the fluid velocity in the vicinity of the surface of the colloid, and
confirm a mechanism for propulsion that was proposed recently. In addition to
offering a unified understanding of the nonequilibrium interfacial transport
processes at stake, our results open the way to a thorough description of the
hydrodynamic interactions between such active particles and understanding their
collective dynamics.
| cond-mat.soft physics.flu-dyn | the hydrodynamic flow field around a catalytically active colloid is probed using particle tracking velocimetry both in the freely swimming state and when kept stationary with an external force our measurements provide information about the fluid velocity in the vicinity of the surface of the colloid and confirm a mechanism for propulsion that was proposed recently in addition to offering a unified understanding of the nonequilibrium interfacial transport processes at stake our results open the way to a thorough description of the hydrodynamic interactions between such active particles and understanding their collective dynamics | [['the', 'hydrodynamic', 'flow', 'field', 'around', 'a', 'catalytically', 'active', 'colloid', 'is', 'probed', 'using', 'particle', 'tracking', 'velocimetry', 'both', 'in', 'the', 'freely', 'swimming', 'state', 'and', 'when', 'kept', 'stationary', 'with', 'an', 'external', 'force', 'our', 'measurements', 'provide', 'information', 'about', 'the', 'fluid', 'velocity', 'in', 'the', 'vicinity', 'of', 'the', 'surface', 'of', 'the', 'colloid', 'and', 'confirm', 'a', 'mechanism', 'for', 'propulsion', 'that', 'was', 'proposed', 'recently', 'in', 'addition', 'to', 'offering', 'a', 'unified', 'understanding', 'of', 'the', 'nonequilibrium', 'interfacial', 'transport', 'processes', 'at', 'stake', 'our', 'results', 'open', 'the', 'way', 'to', 'a', 'thorough', 'description', 'of', 'the', 'hydrodynamic', 'interactions', 'between', 'such', 'active', 'particles', 'and', 'understanding', 'their', 'collective', 'dynamics']] | [-0.12472982141840201, 0.18082694830113186, -0.14328857376903636, -0.011254759739473543, -0.018173211554606116, -0.11048897557080753, 0.02486541163882301, 0.3319986361449444, -0.26115958159789443, -0.3422571784586355, 0.01846677775029093, -0.28098227587398344, -0.1157932959857487, 0.19178793452284548, 0.012879802019245202, 0.041238225575897, 0.02544894278730436, 0.008197633998020383, 0.028077423765314042, -0.14727449574838242, 0.2201640661255086, 0.0953438510812859, 0.2803484624832548, 0.09078163074289439, 0.13732695449343932, 0.023410939606487432, -0.02257713775015286, 0.04801094751324384, -0.17937710723297992, 0.08350298320373861, 0.21428723394199806, 0.0026116522594845743, 0.2474474298657589, -0.46930213414773503, -0.2559924588027981, 0.02483460714700081, 0.17799085099500433, 0.14738592773335435, -0.14766227150015454, -0.29072471885311024, 0.009754426817419708, -0.12934789791583054, -0.16752322654049562, -0.08060542685830946, 0.03781203502133208, 0.0462141385181777, -0.23327020201731913, 0.08485471682562944, 0.07608454610641685, 0.10744586560915234, -0.10955644198142553, -0.021132252945174134, -0.03950973906584324, 0.16717715739048467, 0.06373409715340904, 0.04374607797506796, 0.2721816942205913, -0.21117534416587522, -0.08666147864473764, 0.4029152200266879, -0.0441853134988016, -0.21457017478483018, 0.2780074707141036, -0.17518943843872398, -0.043469028787747506, 0.14725341359453817, 0.19941348489373922, 0.10054967000139176, -0.1796921154527026, 0.007614704350294966, -0.054388538726495315, 0.15206806129720862, 0.02127854793422645, -0.01571618748693577, 0.267008982663874, 0.22645478148604192, 0.030366058651638286, 0.11041724111794704, -0.09676844981418903, -0.14413531326879098, -0.2784132024934215, -0.18807977330320144, -0.15379866162034614, 0.01613050808639376, -0.0802198204818064, -0.12986102344227896, 0.37583157240903825, 0.1569916287152928, 0.17256043206960445, -0.004143751857261504, 0.3011836288446781, 0.017736402772096618, 0.00034152769223256136, 0.10471368028772293, 0.3060293010916681, 0.12882893322966993, 0.1474321397842579, -0.2929268108871115, 0.05724445216217509, 0.0477898703407376] |
1,802.04601 | Magnetoplasmonic Quasicrystals | Nanostructured magneto-optical materials sustaining optical resonances open
very efficient way for light control via magnetic field, which is of prime
importance for telecommunication and sensing applications. However, usually
their response is narrowband due to its resonance character. Here we
demonstrate and investigate a novel type of the magnetoplasmonic structure, the
magnetoplasmonic quasicrystal, which demonstrates unique magneto-optical
response. It consists of the magnetic dielectric film covered by a thin gold
layer perforated by slits forming a Fibonacci-like binary sequence. The
transverse magneto-optical Kerr effect (TMOKE) acquires controllable multiple
plasmon-related resonances resulting in a magneto-optical response in a wide
frequency range. The broadband TMOKE is valuable for numerous nanophotonics
applications including optical sensing, control of light, all-optical control
of magnetization etc. On the other hand, TMOKE spectroscopy is an efficient
tool for investigation of the peculiarities of plasmonic quasicrystals.
| physics.optics | nanostructured magnetooptical materials sustaining optical resonances open very efficient way for light control via magnetic field which is of prime importance for telecommunication and sensing applications however usually their response is narrowband due to its resonance character here we demonstrate and investigate a novel type of the magnetoplasmonic structure the magnetoplasmonic quasicrystal which demonstrates unique magnetooptical response it consists of the magnetic dielectric film covered by a thin gold layer perforated by slits forming a fibonaccilike binary sequence the transverse magnetooptical kerr effect tmoke acquires controllable multiple plasmonrelated resonances resulting in a magnetooptical response in a wide frequency range the broadband tmoke is valuable for numerous nanophotonics applications including optical sensing control of light alloptical control of magnetization etc on the other hand tmoke spectroscopy is an efficient tool for investigation of the peculiarities of plasmonic quasicrystals | [['nanostructured', 'magnetooptical', 'materials', 'sustaining', 'optical', 'resonances', 'open', 'very', 'efficient', 'way', 'for', 'light', 'control', 'via', 'magnetic', 'field', 'which', 'is', 'of', 'prime', 'importance', 'for', 'telecommunication', 'and', 'sensing', 'applications', 'however', 'usually', 'their', 'response', 'is', 'narrowband', 'due', 'to', 'its', 'resonance', 'character', 'here', 'we', 'demonstrate', 'and', 'investigate', 'a', 'novel', 'type', 'of', 'the', 'magnetoplasmonic', 'structure', 'the', 'magnetoplasmonic', 'quasicrystal', 'which', 'demonstrates', 'unique', 'magnetooptical', 'response', 'it', 'consists', 'of', 'the', 'magnetic', 'dielectric', 'film', 'covered', 'by', 'a', 'thin', 'gold', 'layer', 'perforated', 'by', 'slits', 'forming', 'a', 'fibonaccilike', 'binary', 'sequence', 'the', 'transverse', 'magnetooptical', 'kerr', 'effect', 'tmoke', 'acquires', 'controllable', 'multiple', 'plasmonrelated', 'resonances', 'resulting', 'in', 'a', 'magnetooptical', 'response', 'in', 'a', 'wide', 'frequency', 'range', 'the', 'broadband', 'tmoke', 'is', 'valuable', 'for', 'numerous', 'nanophotonics', 'applications', 'including', 'optical', 'sensing', 'control', 'of', 'light', 'alloptical', 'control', 'of', 'magnetization', 'etc', 'on', 'the', 'other', 'hand', 'tmoke', 'spectroscopy', 'is', 'an', 'efficient', 'tool', 'for', 'investigation', 'of', 'the', 'peculiarities', 'of', 'plasmonic', 'quasicrystals']] | [-0.1558664271073854, 0.14122376265442974, -0.0389118779104833, -0.02596668791546322, -0.13345651303911032, -0.16591595098211923, 0.02459002059271477, 0.4662852902102339, -0.2638036992661107, -0.27708090376108885, 0.06144758823853301, -0.2569668856517905, -0.17099363156183459, 0.3004474064869368, -0.007068389872609473, 0.08694204965970986, -0.013173805078087538, -0.08159675249514882, 0.030412616759456473, -0.11388286934850518, 0.24249881082419855, 0.00872030456101878, 0.3413633723548093, 0.05373617478043718, 0.07080708513282896, 0.0735194727552452, 0.08332548201125224, -0.02247840113020228, -0.09243926780490096, 0.14133838465033263, 0.2596920037809896, -0.05641466882490717, 0.2782953941855607, -0.4195897092234672, -0.2483424642602639, 0.012396538743119249, 0.17464025545803666, 0.13327861623667345, -0.17643684853186747, -0.24947041244441232, 0.04533407388611094, -0.09176070260154494, -0.14730014720150983, -0.11132437978213762, 0.03409506039272802, 0.01874681883097818, -0.2804294799104408, 0.0062287265249966264, 0.06326440801528994, 0.13881513900945291, -0.09468654431796442, -0.05659374174908461, 0.013283615192288862, 0.046814436668201405, -0.04337531651425011, -0.017958314764922868, 0.21097606376347625, -0.14114920027821107, -0.09931296788101249, 0.3964676971355563, -0.041934175998047815, -0.07920099348720054, 0.14939163421256715, -0.17378117920666494, -0.006103508489425568, 0.15952438168118105, 0.20928340803777032, 0.15779180987053276, -0.16149321537737063, 0.06706080986751818, -0.013626149906913805, 0.2105830909079968, 0.11494881686453215, 0.16911886874517865, 0.2980531980694436, 0.25668125484748194, 0.009775623757912614, 0.18248887607692535, -0.1319140118721407, 0.019785553357317385, -0.17663508338334985, -0.16512811553997486, -0.20735519071047961, 0.062114028458702654, -0.07062309961539166, -0.22101118575836368, 0.4254983283497174, 0.10261713257162175, 0.12775318451253148, -0.10074320698999252, 0.3355086948722601, 0.0722416236941867, 0.10441242826602641, -0.05475725921261234, 0.30983697977053987, 0.1829336132539217, 0.14695499475323337, -0.2741636188002303, 0.014396595636807272, -0.052462288425030076] |
1,802.04602 | Ends of Schreier graphs of hyperbolic groups | We study the number of ends of a Schreier graph of a hyperbolic group. Let G
be a hyperbolic group and let H be a subgroup of G. In general, there is no
algorithm to compute the number of ends of a Schreier graph of the pair (G, H).
However, assuming that H is a quasi-convex subgroup of G, we construct an
algorithm.
| math.GR | we study the number of ends of a schreier graph of a hyperbolic group let g be a hyperbolic group and let h be a subgroup of g in general there is no algorithm to compute the number of ends of a schreier graph of the pair g h however assuming that h is a quasiconvex subgroup of g we construct an algorithm | [['we', 'study', 'the', 'number', 'of', 'ends', 'of', 'a', 'schreier', 'graph', 'of', 'a', 'hyperbolic', 'group', 'let', 'g', 'be', 'a', 'hyperbolic', 'group', 'and', 'let', 'h', 'be', 'a', 'subgroup', 'of', 'g', 'in', 'general', 'there', 'is', 'no', 'algorithm', 'to', 'compute', 'the', 'number', 'of', 'ends', 'of', 'a', 'schreier', 'graph', 'of', 'the', 'pair', 'g', 'h', 'however', 'assuming', 'that', 'h', 'is', 'a', 'quasiconvex', 'subgroup', 'of', 'g', 'we', 'construct', 'an', 'algorithm']] | [-0.2388287383826479, 0.13558052933524503, -0.1168128756717557, -0.013166306314930792, -0.1469444111026528, -0.11629253609608563, 0.04363500086649779, 0.4093679788093718, -0.2951464412940873, -0.3036195898044204, 0.0830265287927071, -0.274066485878494, -0.08873767790103716, 0.17441096901893616, -0.1369978930387232, -0.09115380817462528, 0.12433055951629603, 0.18906842657024897, -0.016120248766142934, -0.21879402035570128, 0.32651339201552293, -0.08942429475589758, 0.13851200549730233, 0.02894851120395793, 0.07071648668202143, -0.011065950443495124, -0.009651892892425023, 0.07123045572301462, -0.15992571050285026, 0.07556894161398449, 0.2507340565235132, 0.09100855023614944, 0.32926478398786413, -0.3310852101043103, -0.1635625532953926, 0.3079596808700386, 0.11437537946686563, -0.04509980391548385, -0.07288909273310787, -0.23751985810933604, 0.15670654733502676, -0.15272148373344588, -0.14935512035079893, 0.04340199452070963, 0.14034975559583732, -0.04374298911785618, -0.28876466846596155, -0.03462944724892695, 0.06285782663949899, 0.08258239029064066, 0.1050967921961158, -0.07365679576630807, -0.12103620680078628, 0.08747642528679636, -0.0363146207177095, 0.11020947821689622, 0.05364767735498765, -0.06454439044353508, -0.12600611179830537, 0.4528797403687522, -0.12926451644549766, -0.16056985177454494, 0.08981670693509163, -0.17656658543273807, -0.1902221908408498, 0.14563035976792138, 0.1730273768069252, 0.1784568191875541, -0.030603971435791917, 0.22743391487950695, -0.17680655972706893, 0.09740724631895621, 0.02110988711790433, -0.07572607285553767, 0.08283673909803231, 0.13711465380731083, 0.14837396651920345, 0.17783058137218985, 0.06247715312721474, 0.14374860803345366, -0.3649395369584598, -0.18803746205946756, -0.21317223917752032, 0.13704745207602778, -0.13980802004424198, -0.24218008951062248, 0.42539407856880673, 0.027312893450023638, 0.16222101857974416, 0.11493824188789678, 0.14346060316477502, 0.0795484413041748, 0.01683697264109339, 0.19711700990973485, 0.043396747301495266, 0.2718631194549657, -0.2035339544896805, -0.18808818834700755, -0.03582329380636414, 0.18839816925012404] |
1,802.04603 | Embedding spanning bounded degree graphs in randomly perturbed graphs | We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs,
where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha
n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach
for studying the appearance of spanning subgraphs in this model using
absorption. This approach yields simpler proofs of several known results. We
also use it to derive the following two new results.
For every $\alpha>0$ and $\Delta\ge 5$, and every $n$-vertex graph $F$ with
maximum degree at most $\Delta$, we show that if $p=\omega(n^{-2/(\Delta+1)})$
then $G_\alpha \cup G(n,p)$ with high probability contains a copy of $F$. The
bound used for $p$ here is lower by a $\log$-factor in comparison to the
conjectured threshold for the general appearance of such subgraphs in $G(n,p)$
alone, a typical feature of previous results concerning randomly perturbed
dense graphs.
We also give the first example of graphs where the appearance threshold in
$G_\alpha \cup G(n,p)$ is lower than the appearance threshold in $G(n,p)$ by
substantially more than a $\log$-factor. We prove that, for every $k\geq 2$ and
$\alpha >0$, there is some $\eta>0$ for which the $k$th power of a Hamilton
cycle with high probability appears in $G_\alpha \cup G(n,p)$ when
$p=\omega(n^{-1/k-\eta})$. The appearance threshold of the $k$th power of a
Hamilton cycle in $G(n,p)$ alone is known to be $n^{-1/k}$, up to a $\log$-term
when $k=2$, and exactly for $k>2$.
| math.CO | we study the model g_alphacup gnp of randomly perturbed dense graphs where g_alpha is any nvertex graph with minimum degree at least alpha n and gnp is the binomial random graph we introduce a general approach for studying the appearance of spanning subgraphs in this model using absorption this approach yields simpler proofs of several known results we also use it to derive the following two new results for every alpha0 and deltage 5 and every nvertex graph f with maximum degree at most delta we show that if pomegan2delta1 then g_alpha cup gnp with high probability contains a copy of f the bound used for p here is lower by a logfactor in comparison to the conjectured threshold for the general appearance of such subgraphs in gnp alone a typical feature of previous results concerning randomly perturbed dense graphs we also give the first example of graphs where the appearance threshold in g_alpha cup gnp is lower than the appearance threshold in gnp by substantially more than a logfactor we prove that for every kgeq 2 and alpha 0 there is some eta0 for which the kth power of a hamilton cycle with high probability appears in g_alpha cup gnp when pomegan1keta the appearance threshold of the kth power of a hamilton cycle in gnp alone is known to be n1k up to a logterm when k2 and exactly for k2 | [['we', 'study', 'the', 'model', 'g_alphacup', 'gnp', 'of', 'randomly', 'perturbed', 'dense', 'graphs', 'where', 'g_alpha', 'is', 'any', 'nvertex', 'graph', 'with', 'minimum', 'degree', 'at', 'least', 'alpha', 'n', 'and', 'gnp', 'is', 'the', 'binomial', 'random', 'graph', 'we', 'introduce', 'a', 'general', 'approach', 'for', 'studying', 'the', 'appearance', 'of', 'spanning', 'subgraphs', 'in', 'this', 'model', 'using', 'absorption', 'this', 'approach', 'yields', 'simpler', 'proofs', 'of', 'several', 'known', 'results', 'we', 'also', 'use', 'it', 'to', 'derive', 'the', 'following', 'two', 'new', 'results', 'for', 'every', 'alpha0', 'and', 'deltage', '5', 'and', 'every', 'nvertex', 'graph', 'f', 'with', 'maximum', 'degree', 'at', 'most', 'delta', 'we', 'show', 'that', 'if', 'pomegan2delta1', 'then', 'g_alpha', 'cup', 'gnp', 'with', 'high', 'probability', 'contains', 'a', 'copy', 'of', 'f', 'the', 'bound', 'used', 'for', 'p', 'here', 'is', 'lower', 'by', 'a', 'logfactor', 'in', 'comparison', 'to', 'the', 'conjectured', 'threshold', 'for', 'the', 'general', 'appearance', 'of', 'such', 'subgraphs', 'in', 'gnp', 'alone', 'a', 'typical', 'feature', 'of', 'previous', 'results', 'concerning', 'randomly', 'perturbed', 'dense', 'graphs', 'we', 'also', 'give', 'the', 'first', 'example', 'of', 'graphs', 'where', 'the', 'appearance', 'threshold', 'in', 'g_alpha', 'cup', 'gnp', 'is', 'lower', 'than', 'the', 'appearance', 'threshold', 'in', 'gnp', 'by', 'substantially', 'more', 'than', 'a', 'logfactor', 'we', 'prove', 'that', 'for', 'every', 'kgeq', '2', 'and', 'alpha', '0', 'there', 'is', 'some', 'eta0', 'for', 'which', 'the', 'kth', 'power', 'of', 'a', 'hamilton', 'cycle', 'with', 'high', 'probability', 'appears', 'in', 'g_alpha', 'cup', 'gnp', 'when', 'pomegan1keta', 'the', 'appearance', 'threshold', 'of', 'the', 'kth', 'power', 'of', 'a', 'hamilton', 'cycle', 'in', 'gnp', 'alone', 'is', 'known', 'to', 'be', 'n1k', 'up', 'to', 'a', 'logterm', 'when', 'k2', 'and', 'exactly', 'for', 'k2']] | [-0.130583367701142, 0.13878398340914244, -0.04124994475622528, 0.02333165430484185, -0.022937925190839707, -0.15596389532186838, 0.041038477301239704, 0.3633187709479922, -0.23852206815154126, -0.30354849929518707, 0.07248303991911209, -0.343812529235574, -0.1821853085614204, 0.1246530149715615, -0.08010471278321665, 0.02766258206968826, 0.09407549911467399, 0.1498241970339977, 0.04453337572181524, -0.23458597111080032, 0.27849426502809255, -0.012541078466222537, 0.16434843115118133, 0.054371816994760624, 0.06716975097963383, 0.013558095021378736, 0.05635683406927261, 0.05612842237178285, -0.2298143399866246, 0.0678936534919105, 0.22280825588620354, 0.13544458209713117, 0.2642713797473914, -0.32578922418166284, -0.18616345522551103, 0.2146382900066755, 0.11017988954811035, 0.047247899725207626, -0.0020513236017487982, -0.19782151884524413, 0.1789412923329042, -0.11860249860033771, -0.12930547324513536, -0.0008141200227066101, 0.10790346573436364, 0.0032026055584128896, -0.3535142153914302, 0.02237906831308516, 0.13559725046092766, 0.028589279037050285, 0.043854176886298384, -0.18111398997187908, -0.019618647293020933, 0.09580787280233838, -0.05663639018983137, 0.07840390561817531, 0.03958183851862717, -0.1314871419488308, -0.12279729368205805, 0.38713574555893654, -0.0821426418193313, -0.11440091273507437, 0.08615177823840661, -0.20154428205099037, -0.2404994270052582, 0.14997397286321268, 0.08738290176393392, 0.15472318485123004, -0.07772385109051773, 0.10259454422726959, -0.07798581694020976, 0.1460617733671936, 0.15024943053559706, -0.009318912765275541, 0.0743480016798692, 0.14316581833424397, 0.172361410340888, 0.17520060955788777, -0.03362930200457182, 0.004963574512133692, -0.30587949822189114, -0.0967206819764314, -0.24431422117520044, 0.10453122780418357, -0.21857747976030437, -0.16750964521243356, 0.39780712631575793, 0.12111283813534085, 0.21974106345683597, 0.14822853876808537, 0.24358290684405373, 0.1123894357435633, -0.0003701422341151659, 0.17833224994406982, 0.14279121350698828, 0.14642097963849857, -0.002716608146229946, -0.10830473769496818, 0.06408173956615468, 0.1082190687780362] |
1,802.04604 | Interferometer-based high-accuracy white light measurement of neutral
rubidium density and gradient at AWAKE | The AWAKE experiment requires an automated online rubidium (Rb) plasma
density and gradient diagnostic for densities between 1 and 10$\cdot$10$^{14}$
cm$^{-3}$. A linear density gradient along the plasma source at the percent
level may be useful to improve the electron acceleration process. Because of
full laser ionization of Rb vapor to Rb$^{+}$ within a radius of 1 mm, the
plasma density equals the vapor density. We measure the Rb vapor densities at
both ends of the source, with high precision using, white light interferometry.
At either source end, broadband laser light passes a remotely controlled
Mach-Zehnder interferometer built out of single mode fibers. The resulting
interference signal, influenced by dispersion in the vicinity of the Rb D1 and
D2 transitions, is dispersed in wavelength by a spectrograph. Fully automated
Fourier-based signal conditioning and a fit algorithm yield the density with an
uncertainty between the measurements at both ends of 0.11 to 0.46 $\%$ over the
entire density range. These densities used to operate the plasma source are
displayed live in the control room.
| physics.plasm-ph physics.ins-det | the awake experiment requires an automated online rubidium rb plasma density and gradient diagnostic for densities between 1 and 10cdot1014 cm3 a linear density gradient along the plasma source at the percent level may be useful to improve the electron acceleration process because of full laser ionization of rb vapor to rb within a radius of 1 mm the plasma density equals the vapor density we measure the rb vapor densities at both ends of the source with high precision using white light interferometry at either source end broadband laser light passes a remotely controlled machzehnder interferometer built out of single mode fibers the resulting interference signal influenced by dispersion in the vicinity of the rb d1 and d2 transitions is dispersed in wavelength by a spectrograph fully automated fourierbased signal conditioning and a fit algorithm yield the density with an uncertainty between the measurements at both ends of 011 to 046 over the entire density range these densities used to operate the plasma source are displayed live in the control room | [['the', 'awake', 'experiment', 'requires', 'an', 'automated', 'online', 'rubidium', 'rb', 'plasma', 'density', 'and', 'gradient', 'diagnostic', 'for', 'densities', 'between', '1', 'and', '10cdot1014', 'cm3', 'a', 'linear', 'density', 'gradient', 'along', 'the', 'plasma', 'source', 'at', 'the', 'percent', 'level', 'may', 'be', 'useful', 'to', 'improve', 'the', 'electron', 'acceleration', 'process', 'because', 'of', 'full', 'laser', 'ionization', 'of', 'rb', 'vapor', 'to', 'rb', 'within', 'a', 'radius', 'of', '1', 'mm', 'the', 'plasma', 'density', 'equals', 'the', 'vapor', 'density', 'we', 'measure', 'the', 'rb', 'vapor', 'densities', 'at', 'both', 'ends', 'of', 'the', 'source', 'with', 'high', 'precision', 'using', 'white', 'light', 'interferometry', 'at', 'either', 'source', 'end', 'broadband', 'laser', 'light', 'passes', 'a', 'remotely', 'controlled', 'machzehnder', 'interferometer', 'built', 'out', 'of', 'single', 'mode', 'fibers', 'the', 'resulting', 'interference', 'signal', 'influenced', 'by', 'dispersion', 'in', 'the', 'vicinity', 'of', 'the', 'rb', 'd1', 'and', 'd2', 'transitions', 'is', 'dispersed', 'in', 'wavelength', 'by', 'a', 'spectrograph', 'fully', 'automated', 'fourierbased', 'signal', 'conditioning', 'and', 'a', 'fit', 'algorithm', 'yield', 'the', 'density', 'with', 'an', 'uncertainty', 'between', 'the', 'measurements', 'at', 'both', 'ends', 'of', '011', 'to', '046', 'over', 'the', 'entire', 'density', 'range', 'these', 'densities', 'used', 'to', 'operate', 'the', 'plasma', 'source', 'are', 'displayed', 'live', 'in', 'the', 'control', 'room']] | [-0.07780480364675237, 0.2020616335755184, -0.06913864259793265, -0.028114259027487824, 0.036590454111431255, -0.14802175654882663, 0.0868427746232098, 0.42609866242311156, -0.2210405725680771, -0.32335830022368517, 0.058036215514167926, -0.2860654897699187, 0.019900738343335035, 0.18258256045284502, -0.018368616747827818, 0.03607155529207588, 0.01714847586253843, -0.01760643230763411, -0.05531868751484857, -0.16258908492752638, 0.20640161814582017, 0.1157521333719729, 0.304532317738784, 0.03994505398781502, 0.11253104172647, -0.045833578319642805, 0.003371425323618565, -0.030060290632638754, -0.09575805770694851, 0.06114036415578329, 0.2624749722427618, 0.08194413945594209, 0.2521267924131009, -0.4348174337706493, -0.255942982334197, 0.04863172018344307, 0.14813512351570857, 0.06752934569645433, -0.050109424451311606, -0.2662814115854906, 0.006402086858686648, -0.12157754990005354, -0.16099320723789565, 0.021440427047772367, -0.0027026595215569114, 0.03901369929346338, -0.297996092021291, 0.07632991888870795, -0.056296801435889145, 0.06889674458543808, -0.029331978959200238, -0.09959338924014255, -0.016708530918613337, 0.0783205800989305, -0.07333145920362198, 0.0742444441381812, 0.22520242391252204, -0.09951860429610164, -0.011285846858225458, 0.33391864692325274, -0.1659954264807673, -0.0925557374639698, 0.15796267064029557, -0.19897593233505623, -0.0534408759034364, 0.22985561926064915, 0.15526460748974627, 0.10327448486622794, -0.11870624058286262, -0.002266308774746824, 0.03371016151470552, 0.2479834942397667, 0.15853066651057995, 0.04267630277457511, 0.26754939526098925, 0.17961151561732486, 0.04269124811300082, 0.09201121389183722, -0.19592702822019045, -0.024026881085268945, -0.26665579683381563, -0.12676150811569253, -0.15953138787677235, 0.0015787054588528055, -0.08285842514739845, -0.11853739744350478, 0.3615849575583349, 0.1268109622341989, 0.1688489633794787, -0.03959336675082644, 0.36106574495067023, 0.11972931603566139, 0.01257081322197677, 0.06967146471360622, 0.25889574219772254, 0.17493400657113795, 0.10672020159964041, -0.25161133440788724, 0.027446697357148803, -0.009511399692828543] |
1,802.04605 | Non-explosion criteria for rough differential equations driven by
unbounded vector fields | We give in this note a simple treatment of the non-explosion problem for
rough differential equations driven by unbounded vector fields and weak
geometric rough paths of arbitrary roughness.
| math.CA | we give in this note a simple treatment of the nonexplosion problem for rough differential equations driven by unbounded vector fields and weak geometric rough paths of arbitrary roughness | [['we', 'give', 'in', 'this', 'note', 'a', 'simple', 'treatment', 'of', 'the', 'nonexplosion', 'problem', 'for', 'rough', 'differential', 'equations', 'driven', 'by', 'unbounded', 'vector', 'fields', 'and', 'weak', 'geometric', 'rough', 'paths', 'of', 'arbitrary', 'roughness']] | [-0.1659251127135137, 0.18524386961783829, -0.09120771674246624, 0.1104605066838899, -0.14772967769411102, -0.11039517933888168, 0.017905262844829725, 0.3352701733338422, -0.3539961162826111, -0.26261710828362866, 0.05559314562184415, -0.21310467876750847, -0.16409659348749395, 0.20756914729958978, -0.15424226953423228, 0.09077805221273468, 0.08786658088451829, -0.022842269326592314, -0.04322817263289772, -0.25895390910064353, 0.4081985323877046, -0.07922919402862418, 0.17281419857694158, 0.05537099908668034, 0.21223207296610908, 0.1144813422338459, -0.07631988367386933, 0.09490566565815745, -0.2777433222207915, 0.15959228247259583, 0.2335505574492031, -0.024773997286784238, 0.24689929123068677, -0.4923672786560552, -0.21302368085638718, 0.08884161103773734, 0.07274854255454807, 0.13998896015229925, -0.07661790095655055, -0.2668729151823911, 0.05144405429219377, -0.06824332212322745, -0.21639007646269326, -0.02096972902755028, 0.06851347614529318, 0.04981916622611983, -0.3121396805448779, 0.11223645948258967, 0.16941400841761636, 0.1268763981181486, -0.08956868130842159, -0.03713445654460069, 0.014585914090275764, 0.03523495464168232, 0.00154784532938281, 0.010657726144739267, 0.03870873032780043, -0.11840695276824308, -0.09280316512389429, 0.29168700863575114, -0.09403884676405518, -0.3308027481724476, 0.1532154724258801, -0.08220476016466474, -0.06326510243374726, 0.17091654009860138, 0.20369935217152896, 0.17298358807276035, -0.21231491224647597, 0.12926226140377273, -0.05912445366767974, 0.03989312187607946, 0.07900244376525797, -0.017849438374155556, 0.11521770798697553, 0.11725286320494167, 0.15347800602943734, 0.1486678871583065, 0.03216240298131417, -0.09185422815639398, -0.4065545242408226, -0.13397816915450425, -0.05615931970934416, 0.11707112645923064, -0.14681856335764992, -0.2948959309864661, 0.2989706515238203, 0.14122718355040356, 0.1992421204802291, 0.08556476472234674, 0.2603686227752217, 0.22625405151910824, -0.08326585324288442, 0.01540849168367427, 0.1773071301266037, 0.22703434322189925, 0.1179336660766396, -0.15161882755186024, 0.088037202616447, 0.1165219505863457] |
1,802.04606 | Metric Factorization: Recommendation beyond Matrix Factorization | In the past decade, matrix factorization has been extensively researched and
has become one of the most popular techniques for personalized recommendations.
Nevertheless, the dot product adopted in matrix factorization based recommender
models does not satisfy the inequality property, which may limit their
expressiveness and lead to sub-optimal solutions. To overcome this problem, we
propose a novel recommender technique dubbed as {\em Metric Factorization}. We
assume that users and items can be placed in a low dimensional space and their
explicit closeness can be measured using Euclidean distance which satisfies the
inequality property. To demonstrate its effectiveness, we further designed two
variants of metric factorization with one for rating estimation and the other
for personalized item ranking. Extensive experiments on a number of real-world
datasets show that our approach outperforms existing state-of-the-art by a
large margin on both rating prediction and item ranking tasks.
| cs.IR | in the past decade matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations nevertheless the dot product adopted in matrix factorization based recommender models does not satisfy the inequality property which may limit their expressiveness and lead to suboptimal solutions to overcome this problem we propose a novel recommender technique dubbed as em metric factorization we assume that users and items can be placed in a low dimensional space and their explicit closeness can be measured using euclidean distance which satisfies the inequality property to demonstrate its effectiveness we further designed two variants of metric factorization with one for rating estimation and the other for personalized item ranking extensive experiments on a number of realworld datasets show that our approach outperforms existing stateoftheart by a large margin on both rating prediction and item ranking tasks | [['in', 'the', 'past', 'decade', 'matrix', 'factorization', 'has', 'been', 'extensively', 'researched', 'and', 'has', 'become', 'one', 'of', 'the', 'most', 'popular', 'techniques', 'for', 'personalized', 'recommendations', 'nevertheless', 'the', 'dot', 'product', 'adopted', 'in', 'matrix', 'factorization', 'based', 'recommender', 'models', 'does', 'not', 'satisfy', 'the', 'inequality', 'property', 'which', 'may', 'limit', 'their', 'expressiveness', 'and', 'lead', 'to', 'suboptimal', 'solutions', 'to', 'overcome', 'this', 'problem', 'we', 'propose', 'a', 'novel', 'recommender', 'technique', 'dubbed', 'as', 'em', 'metric', 'factorization', 'we', 'assume', 'that', 'users', 'and', 'items', 'can', 'be', 'placed', 'in', 'a', 'low', 'dimensional', 'space', 'and', 'their', 'explicit', 'closeness', 'can', 'be', 'measured', 'using', 'euclidean', 'distance', 'which', 'satisfies', 'the', 'inequality', 'property', 'to', 'demonstrate', 'its', 'effectiveness', 'we', 'further', 'designed', 'two', 'variants', 'of', 'metric', 'factorization', 'with', 'one', 'for', 'rating', 'estimation', 'and', 'the', 'other', 'for', 'personalized', 'item', 'ranking', 'extensive', 'experiments', 'on', 'a', 'number', 'of', 'realworld', 'datasets', 'show', 'that', 'our', 'approach', 'outperforms', 'existing', 'stateoftheart', 'by', 'a', 'large', 'margin', 'on', 'both', 'rating', 'prediction', 'and', 'item', 'ranking', 'tasks']] | [-0.050820177397124806, -0.011025132614627687, -0.07945682580045993, 0.07609147943003336, -0.14433599441771447, -0.21161732685221876, 0.03082086939118906, 0.44138825442092233, -0.2526777137512302, -0.29279184294864535, 0.11234090546375025, -0.31705903838479166, -0.1690524106250248, 0.16467618073026338, -0.10585213309968822, 0.10546333533865335, 0.11089880013928956, 0.08034806222955619, -0.10990403835765189, -0.3214265108464234, 0.3290569590381993, 0.020386614681531984, 0.3486674824525835, 0.10044420925745119, 0.12944428004427916, 0.017471431120712724, -0.0330455004562585, 0.06952326051133342, -0.08302527907219176, 0.14168033746844028, 0.3271785546251067, 0.2305344188724929, 0.3402829690021463, -0.37764833298408323, -0.18901843767768392, 0.1375570235735116, 0.15066924554088879, 0.04052016312289197, -0.06637750410138527, -0.2976450188628708, 0.10753500984153813, -0.23186315628441256, -0.019379538842864957, -0.15135812793353884, -0.022159173496119264, -0.010681484953642616, -0.326070362220182, 0.02327113528250872, 0.031208797215691045, -0.01187526163024207, -0.012739128846280638, -0.15910095038189967, 0.07683239396525703, 0.11774982050863197, 0.08379172792774625, 0.0054203295569297755, 0.12291500092315902, -0.11684071444228215, -0.19096689928200147, 0.3811626652928276, -0.04881199089706772, -0.23264694378465517, 0.18891291636747257, -0.058700527475189626, -0.17317465241972563, 0.04794320298565759, 0.22128170481624287, 0.12100147897985557, -0.13859307639520718, 0.06476128510682126, -0.08335509540079834, 0.16834902929581907, 0.05002480297601627, 0.029879698963163212, 0.1385045203108651, 0.19443333844133626, 0.06913999017342576, 0.0824956668378339, -0.05128440661549879, -0.09290696151502845, -0.15517476329114288, -0.13241775137753897, -0.21061892192261034, 0.018714868793520308, -0.15811321037411594, -0.16618508954222003, 0.37792437177267857, 0.2073318678162145, 0.17439170657760567, 0.06459828753496469, 0.31667531678491895, 0.09213490258197352, 0.10338441830309522, 0.0799093011139323, 0.2006103181819425, 0.04044401339261741, 0.11358798730523428, -0.14177531595628856, 0.13298435503384098, 0.11067553890461568] |
1,802.04607 | A cancellativity criterion for presented monoids | We establish a new, fairly general cancellativity criterion for a presented
monoid that properly extends the previously known related criteria. It is based
on a new version of the word transformation called factor reversing, and its
specificity is to avoid any restriction on the number of relations in the
presentation. As an application, we deduce the cancellativity of some natural
extension of Artin's braid monoid in which crossings are colored.
| math.GR | we establish a new fairly general cancellativity criterion for a presented monoid that properly extends the previously known related criteria it is based on a new version of the word transformation called factor reversing and its specificity is to avoid any restriction on the number of relations in the presentation as an application we deduce the cancellativity of some natural extension of artins braid monoid in which crossings are colored | [['we', 'establish', 'a', 'new', 'fairly', 'general', 'cancellativity', 'criterion', 'for', 'a', 'presented', 'monoid', 'that', 'properly', 'extends', 'the', 'previously', 'known', 'related', 'criteria', 'it', 'is', 'based', 'on', 'a', 'new', 'version', 'of', 'the', 'word', 'transformation', 'called', 'factor', 'reversing', 'and', 'its', 'specificity', 'is', 'to', 'avoid', 'any', 'restriction', 'on', 'the', 'number', 'of', 'relations', 'in', 'the', 'presentation', 'as', 'an', 'application', 'we', 'deduce', 'the', 'cancellativity', 'of', 'some', 'natural', 'extension', 'of', 'artins', 'braid', 'monoid', 'in', 'which', 'crossings', 'are', 'colored']] | [-0.10496953528906618, 0.06841426355552227, -0.10566737939204489, 0.12150295731012843, -0.17641712810312, -0.11967301268263587, 0.06761546897635395, 0.32620412866984094, -0.32817591660547935, -0.2598222542421094, 0.10427968745186393, -0.21835223622620106, -0.16751157673341888, 0.22610959682081427, -0.16541971215379558, -0.017379107061008522, 0.022717247144984347, 0.10599386752583087, -0.061341153707222214, -0.24095639110143696, 0.3354777766790773, 0.017471509599792105, 0.24389554254511106, 0.05345064403622278, 0.1069053790397967, 0.023852355166205336, -0.06539506550346103, -0.007094808787639652, -0.1551014854677695, 0.09615514238498041, 0.20031280802296741, 0.14205356841640812, 0.207111684512347, -0.3466815380512604, -0.13309428626816952, 0.12614748825352373, 0.09763397290371359, 0.08373772688043703, -0.05794840659156242, -0.26888372985912223, 0.13079329338589948, -0.18887482157775334, -0.1248758711319949, -0.061852856259793046, 0.027518339062641773, 0.012488012365065516, -0.2530912847923381, -0.01622481146878272, 0.15841609622750963, 0.09591843275619405, -0.02394414892519957, -0.10833843128472966, 0.02149672645942441, 0.09829003455649529, -0.001920134700568659, 0.0208699877041259, 0.06851533651351929, -0.11513353566239987, -0.13623796428686807, 0.4012044919388635, -0.024127554640706095, -0.23694599731160063, 0.17150704994065955, -0.07433163911004417, -0.1991518764690097, 0.09806708994853709, 0.0791850337359522, 0.10822627946202244, -0.12270688426547817, 0.1024871241692121, -0.16905427909057055, 0.13236450599506497, 0.12239314016353871, 0.012187586436214457, 0.102887645480223, 0.13403701500834098, 0.10227663974676814, 0.1940772184702967, 0.011459162372297474, -0.02246956660279206, -0.35892175255077224, -0.216920574501689, -0.14153650864360057, 0.051099411135406364, -0.08419711133444382, -0.18679201367444226, 0.39447184125227586, 0.13281595361019885, 0.17156044102406928, 0.12467743379363258, 0.21939280120921986, 0.11617575195850804, 0.09529465565777043, 0.020292365444558008, 0.12552168853123605, 0.18866947635209985, -0.021718707175127097, -0.1631924757600895, 0.05587719226522105, 0.18234709313006273] |
1,802.04608 | On the nonexistence of linear perfect Lee codes | In 1968, Golomb and Welch conjectured that there does not exist perfect Lee
code in $\mathbb{Z}^{n}$ with radius $r\ge2$ and dimension $n\ge3$. Besides its
own interest in coding theory and discrete geometry, this conjecture is also
strongly related to the degree-diameter problems of abelian Cayley graphs.
Although there are many papers on this topic, the Golomb-Welch conjecture is
far from being solved. In this paper, we prove the nonexistence of linear
perfect Lee codes by introducing some new algebraic methods. Using these new
methods, we show the nonexistence of linear perfect Lee codes of radii $r=2,3$
in $\mathbb{Z}^n$ for infinitely many values of the dimension $n$. In
particular, there does not exist linear perfect Lee codes of radius $2$ in
$\mathbb{Z}^n$ for all $3\le n\le 100$ except 8 cases.
| math.CO cs.IT math.IT | in 1968 golomb and welch conjectured that there does not exist perfect lee code in mathbbzn with radius rge2 and dimension nge3 besides its own interest in coding theory and discrete geometry this conjecture is also strongly related to the degreediameter problems of abelian cayley graphs although there are many papers on this topic the golombwelch conjecture is far from being solved in this paper we prove the nonexistence of linear perfect lee codes by introducing some new algebraic methods using these new methods we show the nonexistence of linear perfect lee codes of radii r23 in mathbbzn for infinitely many values of the dimension n in particular there does not exist linear perfect lee codes of radius 2 in mathbbzn for all 3le nle 100 except 8 cases | [['in', '1968', 'golomb', 'and', 'welch', 'conjectured', 'that', 'there', 'does', 'not', 'exist', 'perfect', 'lee', 'code', 'in', 'mathbbzn', 'with', 'radius', 'rge2', 'and', 'dimension', 'nge3', 'besides', 'its', 'own', 'interest', 'in', 'coding', 'theory', 'and', 'discrete', 'geometry', 'this', 'conjecture', 'is', 'also', 'strongly', 'related', 'to', 'the', 'degreediameter', 'problems', 'of', 'abelian', 'cayley', 'graphs', 'although', 'there', 'are', 'many', 'papers', 'on', 'this', 'topic', 'the', 'golombwelch', 'conjecture', 'is', 'far', 'from', 'being', 'solved', 'in', 'this', 'paper', 'we', 'prove', 'the', 'nonexistence', 'of', 'linear', 'perfect', 'lee', 'codes', 'by', 'introducing', 'some', 'new', 'algebraic', 'methods', 'using', 'these', 'new', 'methods', 'we', 'show', 'the', 'nonexistence', 'of', 'linear', 'perfect', 'lee', 'codes', 'of', 'radii', 'r23', 'in', 'mathbbzn', 'for', 'infinitely', 'many', 'values', 'of', 'the', 'dimension', 'n', 'in', 'particular', 'there', 'does', 'not', 'exist', 'linear', 'perfect', 'lee', 'codes', 'of', 'radius', '2', 'in', 'mathbbzn', 'for', 'all', '3le', 'nle', '100', 'except', '8', 'cases']] | [-0.16153819886101192, 0.11494992719602215, -0.015813933055515785, 0.05933033792904845, -0.0348970753992655, -0.22890989654589183, -0.02419114822175267, 0.36272918996076253, -0.25855987987213935, -0.2566316775389218, 0.12070431200473375, -0.28053667189827725, -0.15907043595157577, 0.1951729198195791, -0.14581323273537694, 0.05609808081290378, 0.036682739622833194, 0.05692333889793056, -0.07639367917061661, -0.3817947652703512, 0.28553351783374137, 0.002062096722539543, 0.19372357802588291, 0.09239496377318404, 0.043847088831975016, 0.015593595088048036, -0.029045519726296758, 0.046050960958904076, -0.23267458592815182, 0.0848587489562369, 0.317567807880353, 0.15393603451427273, 0.22609809501089387, -0.3608415292705907, -0.2162877617208937, 0.18250509646049765, 0.1397377322355733, 0.11362680054248073, -0.051527262487549824, -0.17326058243769546, 0.14044757194676286, -0.14576317864477403, -0.13849610385174552, 3.094792135002077e-05, 0.0853235982141869, 0.008108702881258097, -0.2295754871172325, 0.041623643655176526, 0.16642783098500366, 0.10051907378775898, -0.02741414327048083, -0.1939213234387959, 0.013116792750422114, 0.07138359628422836, 0.010117478887081262, 0.029938540789623592, -0.042144988724860805, -0.06200310370845128, -0.15051057168405302, 0.33858562312125007, -0.0246928165731735, -0.2128540800610023, 0.15963470062255397, -0.13370602517280467, -0.17912153741741885, 0.120117117860174, 0.08449044395526943, 0.1497440088193777, -0.022703328675251138, 0.22263297184538314, -0.18258481542467025, 0.17029260763584442, 0.19102718464149407, 0.024306592914138652, 0.13270517613363358, 0.010366118892074325, 0.07631410232947258, 0.09573661692642657, 0.028071086208494887, -0.07205572231088822, -0.287711576616406, -0.10122993716955647, -0.2000427709778684, 0.08844978200987363, -0.11144423755862688, -0.1908963812702848, 0.3240890353629293, 0.11449586504767108, 0.11795734362171371, 0.07643070784505716, 0.20020674110224196, 0.0034600847794190627, 0.024097737903136386, 0.21275606532689445, 0.2041229993917586, 0.2091982100689567, 0.003012877590268446, -0.1090294780803469, -0.00939154031130579, 0.13736425550264675] |
1,802.04609 | Network Features Based Co-hyponymy Detection | Distinguishing lexical relations has been a long term pursuit in natural
language processing (NLP) domain. Recently, in order to detect lexical
relations like hypernymy, meronymy, co-hyponymy etc., distributional semantic
models are being used extensively in some form or the other. Even though a lot
of efforts have been made for detecting hypernymy relation, the problem of
co-hyponymy detection has been rarely investigated. In this paper, we are
proposing a novel supervised model where various network measures have been
utilized to identify co-hyponymy relation with high accuracy performing better
or at par with the state-of-the-art models.
| cs.CL | distinguishing lexical relations has been a long term pursuit in natural language processing nlp domain recently in order to detect lexical relations like hypernymy meronymy cohyponymy etc distributional semantic models are being used extensively in some form or the other even though a lot of efforts have been made for detecting hypernymy relation the problem of cohyponymy detection has been rarely investigated in this paper we are proposing a novel supervised model where various network measures have been utilized to identify cohyponymy relation with high accuracy performing better or at par with the stateoftheart models | [['distinguishing', 'lexical', 'relations', 'has', 'been', 'a', 'long', 'term', 'pursuit', 'in', 'natural', 'language', 'processing', 'nlp', 'domain', 'recently', 'in', 'order', 'to', 'detect', 'lexical', 'relations', 'like', 'hypernymy', 'meronymy', 'cohyponymy', 'etc', 'distributional', 'semantic', 'models', 'are', 'being', 'used', 'extensively', 'in', 'some', 'form', 'or', 'the', 'other', 'even', 'though', 'a', 'lot', 'of', 'efforts', 'have', 'been', 'made', 'for', 'detecting', 'hypernymy', 'relation', 'the', 'problem', 'of', 'cohyponymy', 'detection', 'has', 'been', 'rarely', 'investigated', 'in', 'this', 'paper', 'we', 'are', 'proposing', 'a', 'novel', 'supervised', 'model', 'where', 'various', 'network', 'measures', 'have', 'been', 'utilized', 'to', 'identify', 'cohyponymy', 'relation', 'with', 'high', 'accuracy', 'performing', 'better', 'or', 'at', 'par', 'with', 'the', 'stateoftheart', 'models']] | [-0.053884618080184354, 0.009094705962036785, -0.07091367142274976, 0.10512451015192231, -0.1538400091475954, -0.18543703387932559, -0.023479145210187295, 0.4526692890415066, -0.2514922918212649, -0.3611920473999099, 0.09145509525153198, -0.3183901828566664, -0.14627567381156903, 0.16557307044583325, -0.08931541698249547, 0.1437799067677636, 0.03839264974537256, 0.09962342528528288, -0.08468183712102473, -0.22350133303552866, 0.2706894293108857, 0.039107581541726465, 0.3392408037754266, 0.03847012555373735, 0.09537677337954703, -0.08707492265017017, -0.07479739189454306, 0.022983283788504963, -0.07096290216585131, 0.14023462875966766, 0.3406287843493996, 0.1826909863463554, 0.3324666096583793, -0.42609611974636974, -0.2880024587539466, 0.17278886383497402, 0.16564506250433625, 0.09436465138079304, -0.05764462139187871, -0.3293867986943377, 0.11412391353331162, -0.21440435978338906, 0.05021655630124243, -0.1458589634220851, 0.04634174671710322, -0.0013144151712032525, -0.17245787239854077, 0.047873760395879414, 0.09197740665342855, 0.13130062419038854, 0.0030380194295981998, -0.13605420323775003, 0.058514439538856475, 0.1676612140855899, 0.04967820845715898, 0.06769738751708677, 0.018719008439955744, -0.1853417857574593, -0.16698096563157283, 0.39661574606832706, -0.06862357627036736, -0.23946563484098174, 0.2640354116202185, -0.05293523964570149, -0.23267958298521607, 0.006267958982406478, 0.18862452807002947, 0.10001610809275391, -0.21375358332144587, 0.06513146416921364, -0.0224776088701267, 0.15585557754323082, 0.12647991999003447, 0.054842392786553035, 0.22977572908919108, 0.2497020869956989, -0.04397214660421014, 0.09768699232158005, -0.08417878309754949, -0.028796614726123056, -0.1031731693270175, -0.12199594111819016, -0.12174284553253337, -0.06858744121548768, -0.014176447174854969, -0.1327025878929386, 0.345335610041787, 0.1890762069703717, 0.1743029329901267, 0.05022732277253741, 0.2868567227336921, 0.09497427915860164, 0.13464508955611995, 0.04314988359906956, 0.22740764653855494, 0.05123515788857874, 0.10237014620123726, -0.11206978679095445, 0.15902694813220908, 0.06489918010407372] |
1,802.0461 | Inverted hysteresis and negative remanence in a homogeneous
antiferromagnet | Magnetic remanence - found in bar magnets or magnetic storage devices - is
probably the oldest and most ubiquitous phenomenon underpinning technological
applications of magnetism. It is a macroscopic non-equilibrium phenomenon: a
remanent magnetisation appears when a magnetic field is applied to an initially
unmagnetised ferromagnet, and then taken away. Here, we present an inverted
magnetic hysteresis loop in the pyrochlore compound Nd$_2$Hf$_2$O$_7$: the
remanent magnetisation points in a direction opposite to the applied field.
This phenomenon is exquisitely tunable as a function of the protocol in field
and temperature, and it is reproducible as in a quasi-equilibrium setting. We
account for this phenomenon in considerable detail in terms of the properties
of non-equilibrium population of domain walls which exhibit a magnetic moment
between domains of an ordered antiferromagnetic state which itself has zero net
magnetisation. Properties and (non-equilibrium) dynamics of topological defects
play an important role in modern spintronics, and our study adds an instance
where a uniform field couples selectively to domain walls rather than the bulk.
| cond-mat.str-el | magnetic remanence found in bar magnets or magnetic storage devices is probably the oldest and most ubiquitous phenomenon underpinning technological applications of magnetism it is a macroscopic nonequilibrium phenomenon a remanent magnetisation appears when a magnetic field is applied to an initially unmagnetised ferromagnet and then taken away here we present an inverted magnetic hysteresis loop in the pyrochlore compound nd_2hf_2o_7 the remanent magnetisation points in a direction opposite to the applied field this phenomenon is exquisitely tunable as a function of the protocol in field and temperature and it is reproducible as in a quasiequilibrium setting we account for this phenomenon in considerable detail in terms of the properties of nonequilibrium population of domain walls which exhibit a magnetic moment between domains of an ordered antiferromagnetic state which itself has zero net magnetisation properties and nonequilibrium dynamics of topological defects play an important role in modern spintronics and our study adds an instance where a uniform field couples selectively to domain walls rather than the bulk | [['magnetic', 'remanence', 'found', 'in', 'bar', 'magnets', 'or', 'magnetic', 'storage', 'devices', 'is', 'probably', 'the', 'oldest', 'and', 'most', 'ubiquitous', 'phenomenon', 'underpinning', 'technological', 'applications', 'of', 'magnetism', 'it', 'is', 'a', 'macroscopic', 'nonequilibrium', 'phenomenon', 'a', 'remanent', 'magnetisation', 'appears', 'when', 'a', 'magnetic', 'field', 'is', 'applied', 'to', 'an', 'initially', 'unmagnetised', 'ferromagnet', 'and', 'then', 'taken', 'away', 'here', 'we', 'present', 'an', 'inverted', 'magnetic', 'hysteresis', 'loop', 'in', 'the', 'pyrochlore', 'compound', 'nd_2hf_2o_7', 'the', 'remanent', 'magnetisation', 'points', 'in', 'a', 'direction', 'opposite', 'to', 'the', 'applied', 'field', 'this', 'phenomenon', 'is', 'exquisitely', 'tunable', 'as', 'a', 'function', 'of', 'the', 'protocol', 'in', 'field', 'and', 'temperature', 'and', 'it', 'is', 'reproducible', 'as', 'in', 'a', 'quasiequilibrium', 'setting', 'we', 'account', 'for', 'this', 'phenomenon', 'in', 'considerable', 'detail', 'in', 'terms', 'of', 'the', 'properties', 'of', 'nonequilibrium', 'population', 'of', 'domain', 'walls', 'which', 'exhibit', 'a', 'magnetic', 'moment', 'between', 'domains', 'of', 'an', 'ordered', 'antiferromagnetic', 'state', 'which', 'itself', 'has', 'zero', 'net', 'magnetisation', 'properties', 'and', 'nonequilibrium', 'dynamics', 'of', 'topological', 'defects', 'play', 'an', 'important', 'role', 'in', 'modern', 'spintronics', 'and', 'our', 'study', 'adds', 'an', 'instance', 'where', 'a', 'uniform', 'field', 'couples', 'selectively', 'to', 'domain', 'walls', 'rather', 'than', 'the', 'bulk']] | [-0.17596406059996056, 0.21838198948473772, -0.07364313311998295, 0.048339425194138905, -0.0848259151413902, -0.09088901791115661, 0.025779802349209506, 0.3817292376455054, -0.29294301688542074, -0.2697881283981905, 0.050919947649228824, -0.24003293998371136, -0.1241674194230238, 0.2079186393102317, 0.004521094607638128, -0.03825804321109373, -0.049724940763202954, 0.02785473177770534, -0.015593791539017784, -0.17809780299977726, 0.2515843735673992, -0.010486754213490209, 0.3195597369936351, 0.06937435359963362, 0.06408708260295749, -0.028250956686258495, 0.1401162035931575, 0.07470707717093539, -0.12045880495177874, 0.028477840203404742, 0.2384767558577145, -0.039185411425823546, 0.2532338032959007, -0.4753189689580755, -0.2057812045249774, 0.061129439497332884, 0.16202377719125788, 0.14802732065752014, -0.1021103843841814, -0.25188330121700236, 0.044255206944892204, -0.11219290387536208, -0.1665861276528028, -0.09023009112684395, 0.03376361659408199, -0.035549700934810184, -0.25747166908379776, 0.08868561284504382, 0.13049632969104785, 0.1442847200725452, -0.08711952643104916, -0.0829746075288718, -0.044720502321311015, 0.0898694258278968, 0.07204178417612046, 0.13172960980354909, 0.1880851519751329, -0.17012337089168378, -0.1345720799522003, 0.34748615824802587, -0.019488113657140076, -0.12487680027899557, 0.1548275569389316, -0.17960511651226735, -0.09895455980594887, 0.11801402605733419, 0.14670739377952596, 0.12236016145374357, -0.16948344033810728, 0.08699355382649003, -0.000744485077504293, 0.17051119911372212, 0.010592866885329944, 0.0550034674703626, 0.2874967587758655, 0.2034511054018849, 0.06930493866935013, 0.2151830197520223, -0.10143490132513872, -0.12383094472047615, -0.24301776099888361, -0.19377146395910755, -0.21464798373383392, 0.08325886511028581, -0.054447479743660564, -0.2358957442666873, 0.38595576529918485, 0.16622172317366643, 0.16952770927090602, -0.12893856014826346, 0.2747901109866349, 0.07835261521409322, 0.07777495894872818, 0.054860747843582455, 0.22523319952860363, 0.21432202986121762, 0.19416912747210407, -0.24161922012691397, 0.10506169457431792, -0.02521517826033846] |
1,802.04611 | Sur les paquets d'Arthur de $\mathbf{Sp}(2n,\mathbb{R})$ contenant des
modules unitaires de plus haut poids, scalaires | Soit $\pi$ un module de plus haut poids unitaire du groupe $G=Sp(2n,\mathbb
R)$. On s'int\'eresse aux paquets d'Arthur contenant $\pi$. Lorsque le plus
haut poids est scalaire, on d\'etermine les param\`etres de ces paquets, on
\'etablit la propri\'et\'e de multiplicit\'e un de $\pi$ dans le paquet, et
l'on calcule le caract\`ere $\rho_\pi$ (du groupe des composantes connexes du
centralisateur du param\`etre dans le groupe dual) associ\'e \`a $\pi$ et qui
joue un grand r\^ole dans la th\'eorie d'Arthur. On fait de m\^eme pour
certains modules de plus haut poids unitaires unipotents $\sigma_{n,k}$.
Let $\pi$ be an irreducible unitary highest weight module for $G=Sp(2,\mathbb
R)$. We would like to determine the Arthur packets containing $\pi$. When the
highest weight is scalar, we determine the Arthur parameter of these packets,
we establish the multiplicity one property of $\pi$ in the packet and we
compute the character $\rho_\pi$ (of the group of connected components of the
centralizer of $\psi$ in the dual group) associated to $\pi$ which plays an
important role in Arthur's theory. We also deal with the case of some unipotent
unitary highest weight modules $\sigma_{n,k}$.
| math.RT | soit pi un module de plus haut poids unitaire du groupe gsp2nmathbb r on sinteresse aux paquets darthur contenant pi lorsque le plus haut poids est scalaire on determine les parametres de ces paquets on etablit la propriete de multiplicite un de pi dans le paquet et lon calcule le caractere rho_pi du groupe des composantes connexes du centralisateur du parametre dans le groupe dual associe a pi et qui joue un grand role dans la theorie darthur on fait de meme pour certains modules de plus haut poids unitaires unipotents sigma_nk let pi be an irreducible unitary highest weight module for gsp2mathbb r we would like to determine the arthur packets containing pi when the highest weight is scalar we determine the arthur parameter of these packets we establish the multiplicity one property of pi in the packet and we compute the character rho_pi of the group of connected components of the centralizer of psi in the dual group associated to pi which plays an important role in arthurs theory we also deal with the case of some unipotent unitary highest weight modules sigma_nk | [['soit', 'pi', 'un', 'module', 'de', 'plus', 'haut', 'poids', 'unitaire', 'du', 'groupe', 'gsp2nmathbb', 'r', 'on', 'sinteresse', 'aux', 'paquets', 'darthur', 'contenant', 'pi', 'lorsque', 'le', 'plus', 'haut', 'poids', 'est', 'scalaire', 'on', 'determine', 'les', 'parametres', 'de', 'ces', 'paquets', 'on', 'etablit', 'la', 'propriete', 'de', 'multiplicite', 'un', 'de', 'pi', 'dans', 'le', 'paquet', 'et', 'lon', 'calcule', 'le', 'caractere', 'rho_pi', 'du', 'groupe', 'des', 'composantes', 'connexes', 'du', 'centralisateur', 'du', 'parametre', 'dans', 'le', 'groupe', 'dual', 'associe', 'a', 'pi', 'et', 'qui', 'joue', 'un', 'grand', 'role', 'dans', 'la', 'theorie', 'darthur', 'on', 'fait', 'de', 'meme', 'pour', 'certains', 'modules', 'de', 'plus', 'haut', 'poids', 'unitaires', 'unipotents', 'sigma_nk', 'let', 'pi', 'be', 'an', 'irreducible', 'unitary', 'highest', 'weight', 'module', 'for', 'gsp2mathbb', 'r', 'we', 'would', 'like', 'to', 'determine', 'the', 'arthur', 'packets', 'containing', 'pi', 'when', 'the', 'highest', 'weight', 'is', 'scalar', 'we', 'determine', 'the', 'arthur', 'parameter', 'of', 'these', 'packets', 'we', 'establish', 'the', 'multiplicity', 'one', 'property', 'of', 'pi', 'in', 'the', 'packet', 'and', 'we', 'compute', 'the', 'character', 'rho_pi', 'of', 'the', 'group', 'of', 'connected', 'components', 'of', 'the', 'centralizer', 'of', 'psi', 'in', 'the', 'dual', 'group', 'associated', 'to', 'pi', 'which', 'plays', 'an', 'important', 'role', 'in', 'arthurs', 'theory', 'we', 'also', 'deal', 'with', 'the', 'case', 'of', 'some', 'unipotent', 'unitary', 'highest', 'weight', 'modules', 'sigma_nk']] | [-0.24741961113893643, 0.056910860220611266, -0.17545135956574845, 0.05352456260895981, -0.08392821529823877, -0.15569616481661797, -0.14301171160755924, 0.13381153537033402, -0.20437589499352316, -0.19672667857462278, 0.025156074321245427, -0.3841187881080659, -0.17926223731118734, 0.11874550153739759, -0.21508319617586805, -0.07591093200176396, -0.0752060582457049, 0.009571356366255454, 0.01890728390611872, -0.25895162240939806, 0.28820652537275576, 0.13008444503993616, 0.2484207525644656, -0.0844805482704612, 0.16414349630556918, 0.2122358318704825, 0.040040127996989826, -0.22743999615828456, -0.30251084292527536, 0.02349954232532572, 0.3696763615256974, 0.10645085015938013, 0.20110278896434786, -0.3159764168354181, 0.014901677097941001, 0.18723909398233826, 0.10764122748706531, -0.07856777667740851, 0.05383372620249597, -0.38726176919318367, 0.18531266823257472, -0.2678936348574308, -0.06924773997289467, -0.020285577784486853, -0.034526537773122624, -0.006500416123954283, -0.24121609640277022, 0.0805267633665238, 0.007359938575773613, 0.14092618917565342, -0.023116267201807966, -0.299186613612839, -0.16503976901307457, 0.01451217710340503, -0.14981107994694018, 0.12976504932413555, 0.031199749496478874, -0.008575130765745929, -0.03330905984570323, 0.2572754395570463, -0.1252639458391938, -0.09020132073047725, 0.11801577579731551, -0.09544904533598399, -0.2790967662470763, 0.07302069405201249, 0.07936702336691279, 0.1372368672061814, 0.16386191302404807, 0.340194245764236, -0.029897035217260594, 0.09638129307755403, 0.22804697496550425, -0.048514141947425045, 0.08419486983924858, -0.014821466689182262, -0.03305787795993588, -0.1383938771310508, -0.0215696522264497, 0.04850717053677027, -0.2340953756945085, -0.3488103546775304, -0.024882144683583098, 0.11968495889188169, -0.0406543844353739, -0.19736572476820305, 0.22496638307219965, -0.021623034874529958, 0.13568797487136142, 0.07730104536928523, 0.07976037509749634, -0.10593042799251175, -0.03765268279955937, 0.0848821067573646, 0.06311607917474588, 0.13567554748074695, 0.10412132350157353, -0.2596733588034512, -0.06587818139478958, 0.2888340032531542] |
1,802.04612 | Fast polymerization at low temperature of an infrared radiation cured
epoxy-amine adhesive | In the industry, the cure time of two-component adhesives is very important
for a cost-effective manufacturing. Too fast, it does not favor the application
of the product and the control of bonded joints. Too slow, it leads to long
process times and too high process costs. The best compromises are
two-component adhesives that cure slowly at room temperature and can reach full
polymerization in minutes, on demand. In this paper, the curing behavior of a
model poly-epoxide adhesive (a stoichiometric mixture of a pure epoxy and
amine) polymerized with infrared radiation will be studied. The kinetic
follow-up of this polymerization will be carried out by thermal analysis
(determination of the residual heat peak by Differential Scanning
Calorimetry-DSC). This study paves the way to a cold and universal
cure-on-demand process, which means achieved in few minutes at low temperature
without any initiators, catalysts or accelerators. Basically, infrared curing
can be possible thanks to an increase in temperature (called thermal effect).
But it has been shown that a "non-thermal effect" could also be involved in
accelerating kinetics with infrared. This increase due to a non-thermal effect,
suggested as a function of the infrared radiative flux, has been shown to be
possible thanks to the absorption of infrared radiation, leading to a reduction
in the energy barrier of the primary epoxy/amine reaction.
| cond-mat.mtrl-sci physics.chem-ph | in the industry the cure time of twocomponent adhesives is very important for a costeffective manufacturing too fast it does not favor the application of the product and the control of bonded joints too slow it leads to long process times and too high process costs the best compromises are twocomponent adhesives that cure slowly at room temperature and can reach full polymerization in minutes on demand in this paper the curing behavior of a model polyepoxide adhesive a stoichiometric mixture of a pure epoxy and amine polymerized with infrared radiation will be studied the kinetic followup of this polymerization will be carried out by thermal analysis determination of the residual heat peak by differential scanning calorimetrydsc this study paves the way to a cold and universal cureondemand process which means achieved in few minutes at low temperature without any initiators catalysts or accelerators basically infrared curing can be possible thanks to an increase in temperature called thermal effect but it has been shown that a nonthermal effect could also be involved in accelerating kinetics with infrared this increase due to a nonthermal effect suggested as a function of the infrared radiative flux has been shown to be possible thanks to the absorption of infrared radiation leading to a reduction in the energy barrier of the primary epoxyamine reaction | [['in', 'the', 'industry', 'the', 'cure', 'time', 'of', 'twocomponent', 'adhesives', 'is', 'very', 'important', 'for', 'a', 'costeffective', 'manufacturing', 'too', 'fast', 'it', 'does', 'not', 'favor', 'the', 'application', 'of', 'the', 'product', 'and', 'the', 'control', 'of', 'bonded', 'joints', 'too', 'slow', 'it', 'leads', 'to', 'long', 'process', 'times', 'and', 'too', 'high', 'process', 'costs', 'the', 'best', 'compromises', 'are', 'twocomponent', 'adhesives', 'that', 'cure', 'slowly', 'at', 'room', 'temperature', 'and', 'can', 'reach', 'full', 'polymerization', 'in', 'minutes', 'on', 'demand', 'in', 'this', 'paper', 'the', 'curing', 'behavior', 'of', 'a', 'model', 'polyepoxide', 'adhesive', 'a', 'stoichiometric', 'mixture', 'of', 'a', 'pure', 'epoxy', 'and', 'amine', 'polymerized', 'with', 'infrared', 'radiation', 'will', 'be', 'studied', 'the', 'kinetic', 'followup', 'of', 'this', 'polymerization', 'will', 'be', 'carried', 'out', 'by', 'thermal', 'analysis', 'determination', 'of', 'the', 'residual', 'heat', 'peak', 'by', 'differential', 'scanning', 'calorimetrydsc', 'this', 'study', 'paves', 'the', 'way', 'to', 'a', 'cold', 'and', 'universal', 'cureondemand', 'process', 'which', 'means', 'achieved', 'in', 'few', 'minutes', 'at', 'low', 'temperature', 'without', 'any', 'initiators', 'catalysts', 'or', 'accelerators', 'basically', 'infrared', 'curing', 'can', 'be', 'possible', 'thanks', 'to', 'an', 'increase', 'in', 'temperature', 'called', 'thermal', 'effect', 'but', 'it', 'has', 'been', 'shown', 'that', 'a', 'nonthermal', 'effect', 'could', 'also', 'be', 'involved', 'in', 'accelerating', 'kinetics', 'with', 'infrared', 'this', 'increase', 'due', 'to', 'a', 'nonthermal', 'effect', 'suggested', 'as', 'a', 'function', 'of', 'the', 'infrared', 'radiative', 'flux', 'has', 'been', 'shown', 'to', 'be', 'possible', 'thanks', 'to', 'the', 'absorption', 'of', 'infrared', 'radiation', 'leading', 'to', 'a', 'reduction', 'in', 'the', 'energy', 'barrier', 'of', 'the', 'primary', 'epoxyamine', 'reaction']] | [-0.05839829144019017, 0.16888003108875568, -0.08881074070611955, 0.016550667748181997, -0.06366379221974595, -0.140839221773031, 0.06383256454568322, 0.4038693115753294, -0.25135570512739597, -0.30451590007740176, 0.1077687582631673, -0.24778421445861804, -0.09183846355608694, 0.17355983532858468, -0.05592523057108607, 0.045873434629929426, 0.02456732284971858, -0.021548674387978046, -0.01084958520314777, -0.21979579144196273, 0.22654257371969935, 0.1629752400158732, 0.2820869082481497, 0.12224418897595671, 0.08965986167485998, -0.05257366767182248, -0.007244958072314384, 0.01232887430254508, -0.08993793203727465, 0.04777767084306106, 0.2646428102140177, 0.020896061664205736, 0.2642014397052763, -0.4586455326234163, -0.2549256720883056, 0.12729182267018282, 0.15790089048850522, 0.10085165509425914, -0.05240890462893596, -0.17790155236057384, 0.04536884535681801, -0.19180070048767245, -0.1668324736960703, -0.06991523491322166, 0.01723133276256569, -6.860277520630646e-05, -0.25189154610443104, 0.06649515166686291, 0.02573860924759949, 0.0352421174067314, -0.05407568906957749, -0.07366207874104104, -0.04214380392416691, 0.07496490642855254, 0.07327311526333452, 0.02335185200125259, 0.19435003210350665, -0.13862139287461847, -0.05870233165397723, 0.3884231228536616, -0.0698789915078561, -0.11798745506180071, 0.21095229950582575, -0.1237995438256163, -0.10597006234348993, 0.2265738832755704, 0.12817164212443727, 0.11437406467787999, -0.20893805519315517, 0.04184931089777685, 0.05919416288034646, 0.16739706297004078, 0.10160747380103674, 0.011035964934207085, 0.23644782926270705, 0.22372388982007074, 0.02578828463555072, 0.15793372808332573, -0.0865188767665704, -0.040306313645150686, -0.2359648338191349, -0.1785674867984468, -0.15147584339892664, 0.09851085023018202, -0.046994022702939994, -0.1576027398661137, 0.3320183548149308, 0.12434404782726671, 0.17653160678310087, -0.005836610753451371, 0.30749692223239605, 0.11464684615418298, 0.1181063892942836, 0.02801350319188916, 0.28303400378812243, 0.08796658420922338, 0.14452703145259335, -0.2567073773631516, 0.11235975777284087, -0.01914312524927987] |
1,802.04613 | First-order queries on classes of structures with bounded expansion | We consider the evaluation of first-order queries over classes of databases
with bounded expansion. The notion of bounded expansion is fairly broad and
generalizes bounded degree, bounded treewidth and exclusion of at least one
minor. It was known that over a class of databases with bounded expansion,
first-order sentences could be evaluated in time linear in the size of the
database. We give a different proof of this result. Moreover, we show that
answers to first-order queries can be enumerated with constant delay after a
linear time preprocessing. We also show that counting the number of answers to
a query can be done in time linear in the size of the database.
| cs.DB | we consider the evaluation of firstorder queries over classes of databases with bounded expansion the notion of bounded expansion is fairly broad and generalizes bounded degree bounded treewidth and exclusion of at least one minor it was known that over a class of databases with bounded expansion firstorder sentences could be evaluated in time linear in the size of the database we give a different proof of this result moreover we show that answers to firstorder queries can be enumerated with constant delay after a linear time preprocessing we also show that counting the number of answers to a query can be done in time linear in the size of the database | [['we', 'consider', 'the', 'evaluation', 'of', 'firstorder', 'queries', 'over', 'classes', 'of', 'databases', 'with', 'bounded', 'expansion', 'the', 'notion', 'of', 'bounded', 'expansion', 'is', 'fairly', 'broad', 'and', 'generalizes', 'bounded', 'degree', 'bounded', 'treewidth', 'and', 'exclusion', 'of', 'at', 'least', 'one', 'minor', 'it', 'was', 'known', 'that', 'over', 'a', 'class', 'of', 'databases', 'with', 'bounded', 'expansion', 'firstorder', 'sentences', 'could', 'be', 'evaluated', 'in', 'time', 'linear', 'in', 'the', 'size', 'of', 'the', 'database', 'we', 'give', 'a', 'different', 'proof', 'of', 'this', 'result', 'moreover', 'we', 'show', 'that', 'answers', 'to', 'firstorder', 'queries', 'can', 'be', 'enumerated', 'with', 'constant', 'delay', 'after', 'a', 'linear', 'time', 'preprocessing', 'we', 'also', 'show', 'that', 'counting', 'the', 'number', 'of', 'answers', 'to', 'a', 'query', 'can', 'be', 'done', 'in', 'time', 'linear', 'in', 'the', 'size', 'of', 'the', 'database']] | [-0.1489553106283503, 0.08975322672631592, -0.04527707999971296, 0.012405290492876832, -0.09629497060918116, -0.11619660362235404, 0.06656707049946167, 0.3657006560242735, -0.33138869797195575, -0.3211449549999088, 0.09304467246277325, -0.25444332328957636, -0.07266480457370303, 0.20605420337025343, -0.0918078245013021, 0.04587971486450572, 0.05356698967911403, 0.0961217423402039, -0.06153888084268796, -0.3586402395719363, 0.2988878218748141, -0.017789863282814622, 0.1428068311485861, 0.09057752750231884, 0.07212384156965916, -0.030772550430681025, -0.043615658376698514, 0.10950104703286863, -0.11137091961109036, 0.08589490032110396, 0.32364035010167364, 0.20454588052650383, 0.27371734161611777, -0.35968183514861657, -0.15112777949551465, 0.13246984823594435, 0.12416620556281746, 0.11588105813799691, -0.004573508344557402, -0.2738219332823064, 0.11803404098152116, -0.14130869707683555, -0.07445159643871843, -0.06885402342803511, 0.04396615422280904, 0.030669766744332656, -0.27329734236471787, 0.03669871617057652, 0.13561443227808923, 0.06102670692988405, -0.03683468052726572, -0.06757596254880939, 0.04105735938355792, 0.07708956233026194, 0.007777989102968215, 0.04356010093137489, 0.054147086634267386, -0.09473700244104423, -0.15752174629700935, 0.3687428802950308, -0.12066018196180396, -0.16709620645269752, 0.13133695887933886, -0.16232148236096172, -0.14746219807420857, 0.12511690106475726, 0.18340244711310202, 0.16943209944292903, -0.11616985666166459, 0.1360708226472655, -0.10344075857262526, 0.2406143361586146, 0.17063785465039213, 0.004942723084241152, 0.09585302010028889, 0.15457302558934316, 0.08031099075118878, 0.196494686821617, -0.005426501310596775, -0.09584244470793887, -0.3206996205096532, -0.12708470590379356, -0.19857696966833568, 0.017056059957082783, -0.16163250534503146, -0.2148105439014866, 0.37957572943664025, 0.13469571282621473, 0.22577699152420141, 0.1755771443048226, 0.25427455090851125, 0.1353085002925322, 0.09083239561836567, 0.11129440383644708, 0.1326093306166253, 0.05567473802615756, 0.0657494626585893, -0.16194181661038393, 0.13459137207246386, 0.08341921733504673] |
1,802.04614 | Electric control of emergent magnonic spin current and dynamic
multiferroicity in magnetic insulators at finite temperatures | Conversion of thermal energy into magnonic spin currents and/or effective
electric polarization promises new device functionalities. A versatile approach
is presented here for generating and controlling open circuit magnonic spin
currents and an effective multiferroicity at a uniform temperature with the aid
of spatially inhomogeneous, external, static electric fields. This field
applied to a ferromagnetic insulator with a Dzyaloshinskii-Moriya type coupling
changes locally the magnon dispersion and modifies the density of thermally
excited magnons in a region of the scale of the field inhomogeneity. The
resulting gradient in the magnon density can be viewed as a gradient in the
effective magnon temperature. This effective thermal gradient together with
local magnon dispersion result in an open-circuit, electric field controlled
magnonic spin current. In fact, for a moderate variation in the external
electric field the predicted magnonic spin current is on the scale of the spin
(Seebeck) current generated by a comparable external temperature gradient.
Analytical methods supported by full-fledge numerics confirm that both, a
finite temperature and an inhomogeneous electric field are necessary for this
emergent non-equilibrium phenomena. The proposal can be integrated in magnonic
and multiferroic circuits, for instance to convert heat into electrically
controlled pure spin current using for example nanopatterning, without the need
to generate large thermal gradients on the nanoscale.
| cond-mat.mes-hall | conversion of thermal energy into magnonic spin currents andor effective electric polarization promises new device functionalities a versatile approach is presented here for generating and controlling open circuit magnonic spin currents and an effective multiferroicity at a uniform temperature with the aid of spatially inhomogeneous external static electric fields this field applied to a ferromagnetic insulator with a dzyaloshinskiimoriya type coupling changes locally the magnon dispersion and modifies the density of thermally excited magnons in a region of the scale of the field inhomogeneity the resulting gradient in the magnon density can be viewed as a gradient in the effective magnon temperature this effective thermal gradient together with local magnon dispersion result in an opencircuit electric field controlled magnonic spin current in fact for a moderate variation in the external electric field the predicted magnonic spin current is on the scale of the spin seebeck current generated by a comparable external temperature gradient analytical methods supported by fullfledge numerics confirm that both a finite temperature and an inhomogeneous electric field are necessary for this emergent nonequilibrium phenomena the proposal can be integrated in magnonic and multiferroic circuits for instance to convert heat into electrically controlled pure spin current using for example nanopatterning without the need to generate large thermal gradients on the nanoscale | [['conversion', 'of', 'thermal', 'energy', 'into', 'magnonic', 'spin', 'currents', 'andor', 'effective', 'electric', 'polarization', 'promises', 'new', 'device', 'functionalities', 'a', 'versatile', 'approach', 'is', 'presented', 'here', 'for', 'generating', 'and', 'controlling', 'open', 'circuit', 'magnonic', 'spin', 'currents', 'and', 'an', 'effective', 'multiferroicity', 'at', 'a', 'uniform', 'temperature', 'with', 'the', 'aid', 'of', 'spatially', 'inhomogeneous', 'external', 'static', 'electric', 'fields', 'this', 'field', 'applied', 'to', 'a', 'ferromagnetic', 'insulator', 'with', 'a', 'dzyaloshinskiimoriya', 'type', 'coupling', 'changes', 'locally', 'the', 'magnon', 'dispersion', 'and', 'modifies', 'the', 'density', 'of', 'thermally', 'excited', 'magnons', 'in', 'a', 'region', 'of', 'the', 'scale', 'of', 'the', 'field', 'inhomogeneity', 'the', 'resulting', 'gradient', 'in', 'the', 'magnon', 'density', 'can', 'be', 'viewed', 'as', 'a', 'gradient', 'in', 'the', 'effective', 'magnon', 'temperature', 'this', 'effective', 'thermal', 'gradient', 'together', 'with', 'local', 'magnon', 'dispersion', 'result', 'in', 'an', 'opencircuit', 'electric', 'field', 'controlled', 'magnonic', 'spin', 'current', 'in', 'fact', 'for', 'a', 'moderate', 'variation', 'in', 'the', 'external', 'electric', 'field', 'the', 'predicted', 'magnonic', 'spin', 'current', 'is', 'on', 'the', 'scale', 'of', 'the', 'spin', 'seebeck', 'current', 'generated', 'by', 'a', 'comparable', 'external', 'temperature', 'gradient', 'analytical', 'methods', 'supported', 'by', 'fullfledge', 'numerics', 'confirm', 'that', 'both', 'a', 'finite', 'temperature', 'and', 'an', 'inhomogeneous', 'electric', 'field', 'are', 'necessary', 'for', 'this', 'emergent', 'nonequilibrium', 'phenomena', 'the', 'proposal', 'can', 'be', 'integrated', 'in', 'magnonic', 'and', 'multiferroic', 'circuits', 'for', 'instance', 'to', 'convert', 'heat', 'into', 'electrically', 'controlled', 'pure', 'spin', 'current', 'using', 'for', 'example', 'nanopatterning', 'without', 'the', 'need', 'to', 'generate', 'large', 'thermal', 'gradients', 'on', 'the', 'nanoscale']] | [-0.18022031473332553, 0.242692337668391, -0.037062868357859026, 0.013102167366321762, -0.09480446302157088, -0.10307087517068, 0.03009137731404022, 0.4032302786084548, -0.2710283717617148, -0.3049428714581376, 0.0306431514964146, -0.23080464802079007, -0.0694616910511794, 0.2353893154007798, 0.04628442609428533, 0.006364907831076025, -0.0734998774802216, -0.023689418357792594, -0.037948728328081015, -0.14004561948664312, 0.25234192919790605, 0.010629246893236107, 0.35819302296414623, 0.1043651772208267, 0.08186017699701441, -0.006268362036989258, 0.08267623344611184, 0.08709687311278805, -0.0874462950934873, 0.09612722152124947, 0.24594678996817293, -0.0971781986769936, 0.1779111435947319, -0.5057142294785926, -0.2282485670842965, 0.024729826356736043, 0.13872789176718764, 0.21221384278415514, -0.12187859572649457, -0.2742140871853056, 0.03960525229608229, -0.16977334199167193, -0.15858514957182424, -0.1270861162414923, 0.003300131310079194, 0.0106131214899352, -0.2848813252549776, 0.09113403339760964, 0.07922977144434226, 0.07671442022765747, -0.09878253480725585, -0.10158712957972582, -0.07630636750724813, 0.04244525211222662, 0.006818157069804803, 0.0920170726240372, 0.22544152262957304, -0.16944752970547525, -0.13131629923323582, 0.27827374891600976, -0.14316392200397757, -0.18441880255732074, 0.11274646908348697, -0.11470179841525747, -0.017140332786497514, 0.12362886583454417, 0.1515721473044895, 0.08632752602207235, -0.1756688410420618, 0.10426251697895104, 0.03861343166616006, 0.1525348173831524, 0.03151693581188089, 0.05120946325475411, 0.3332884424965077, 0.17146532499874143, 0.08523379360706033, 0.17492061618719898, -0.07777906733372647, -0.03804124337446137, -0.253565725800472, -0.1650707300232085, -0.22484491330226053, 0.11072378636648257, -0.12029060561223855, -0.18898606686765423, 0.4295276547082538, 0.18722214977947793, 0.12391289727182878, -0.051045858581056335, 0.3226704813054645, 0.17814928994944731, 0.0986044131057608, 0.07889498370872294, 0.23951000528313884, 0.2032754830425789, 0.16234402122640623, -0.33716720772443665, 0.03366203676743057, -0.029020508380165157] |
1,802.04615 | How Far Might We Walk at Random? | This elementary treatment first summarizes extreme values of a Bernoulli
random walk on the one-dimensional integer lattice over a finite discrete time
interval. Both the symmetric (unbiased) and asymmetric (biased) cases are
discussed. Asymptotic results are given as the time interval length approaches
infinity. Focus then shifts to such walks reflected at the origin -- in both
strong and weak senses -- and related unsolved problems are meticulously
examined.
| math.HO | this elementary treatment first summarizes extreme values of a bernoulli random walk on the onedimensional integer lattice over a finite discrete time interval both the symmetric unbiased and asymmetric biased cases are discussed asymptotic results are given as the time interval length approaches infinity focus then shifts to such walks reflected at the origin in both strong and weak senses and related unsolved problems are meticulously examined | [['this', 'elementary', 'treatment', 'first', 'summarizes', 'extreme', 'values', 'of', 'a', 'bernoulli', 'random', 'walk', 'on', 'the', 'onedimensional', 'integer', 'lattice', 'over', 'a', 'finite', 'discrete', 'time', 'interval', 'both', 'the', 'symmetric', 'unbiased', 'and', 'asymmetric', 'biased', 'cases', 'are', 'discussed', 'asymptotic', 'results', 'are', 'given', 'as', 'the', 'time', 'interval', 'length', 'approaches', 'infinity', 'focus', 'then', 'shifts', 'to', 'such', 'walks', 'reflected', 'at', 'the', 'origin', 'in', 'both', 'strong', 'and', 'weak', 'senses', 'and', 'related', 'unsolved', 'problems', 'are', 'meticulously', 'examined']] | [-0.1325818673471239, 0.2016108314395507, -0.03460891517713221, 0.1102105337386228, -0.07941665136213623, -0.17978948588941746, 0.061473475505055775, 0.44907525762804407, -0.26775766209240504, -0.1830832412633211, 0.16216785058122016, -0.2725760445638157, -0.11259559008254628, 0.18606009982081492, -0.03700364155889447, 0.07008855978097357, 0.04705587087838507, 0.07410573641032871, -0.06301415364827904, -0.27960541486781815, 0.2399248103889178, 0.003893430706169178, 0.2540072510296951, 0.03702329849014615, 0.11488088046343052, 0.04080528553241669, -0.08439231909283285, 0.052037671126907215, -0.16020922916037822, 0.045107239795633275, 0.2510833487248243, 0.004448563075944114, 0.30009487240728155, -0.37837326395978677, -0.19016137222521382, 0.1284237636058633, 0.1308553157054555, 0.10117458971912291, -0.029778366555710003, -0.30165710182054273, 0.06817832358403882, -0.07978308077123183, -0.13209140689960167, 0.020859339455170416, 0.05930703368260345, 0.09282028732765744, -0.24362509746326885, 0.08565005810875724, 0.08879963920882611, 0.07740284560887671, -0.027315551032826527, -0.1833416993882674, 0.050626797942138875, 0.13550029227982707, 0.0731458913590481, -0.02813885179556795, 0.07794397694072616, -0.04304725941923906, -0.17562031868928626, 0.36850784963636257, -0.040531254637597214, -0.2070977147946607, 0.18617388312774363, -0.17856086898984305, -0.150023391796971, 0.10623929976249363, 0.18637013949676237, 0.14921280559597175, -0.10279284068730785, 0.12217993106877209, -0.0642343393679875, 0.08237816001516211, 0.09219708253017891, 0.049503551274816045, 0.20002312939475053, 0.0840282175662135, 0.06606601295235164, 0.15574675177418584, -0.019267794041922175, -0.1789258291194243, -0.34153399117110267, -0.06475289841530038, -0.20362879363680952, 0.052529438051270014, -0.11764890901373401, -0.20952080033107925, 0.36638099883001907, 0.14166413042555326, 0.21080037886137837, 0.09877599308739847, 0.24832160604089054, 0.1680099780362016, -0.07666339212333534, 0.04454690615521438, 0.1074341688819452, 0.14709911692310682, 0.07408979992597683, -0.17926097958028983, 0.08200567437043942, 0.09804597318714568] |
1,802.04616 | Ramanujan-type formulae for $1/\pi$: $q$-analogues | The hypergeometric formulae designed by Ramanujan more than a century ago for
efficient approximation of $\pi$, Archimedes' constant, remain an attractive
object of arithmetic study. In this note we discuss some $q$-analogues of
Ramanujan-type evaluations and of related supercongruences.
| math.NT math.CA math.CO | the hypergeometric formulae designed by ramanujan more than a century ago for efficient approximation of pi archimedes constant remain an attractive object of arithmetic study in this note we discuss some qanalogues of ramanujantype evaluations and of related supercongruences | [['the', 'hypergeometric', 'formulae', 'designed', 'by', 'ramanujan', 'more', 'than', 'a', 'century', 'ago', 'for', 'efficient', 'approximation', 'of', 'pi', 'archimedes', 'constant', 'remain', 'an', 'attractive', 'object', 'of', 'arithmetic', 'study', 'in', 'this', 'note', 'we', 'discuss', 'some', 'qanalogues', 'of', 'ramanujantype', 'evaluations', 'and', 'of', 'related', 'supercongruences']] | [-0.18468104493028173, 0.0542701300640683, -0.12923956055862781, 0.18969336967580977, -0.1077546190040616, -0.16170887595329148, 0.05282851644099141, 0.34894483742447424, -0.21870843301980925, -0.25671779779860604, 0.08164245094984579, -0.2951474056746333, -0.22386966817654097, 0.2794006727158259, -0.10407537004599969, 0.051922328173159026, 0.032351129998763405, 0.002397167782943982, -0.12137325905645505, -0.36760616870835805, 0.29344404140372204, 0.024029404712984197, 0.10950536768023784, 0.04443325902311466, 0.06815263511947332, 0.0021732665989428568, -0.06117508997424291, -0.12276759352542473, -0.19983343729892603, 0.16903633492974898, 0.2707805349252736, 0.10854655119757621, 0.31209049328493005, -0.44121043116618425, -0.05764705790445591, 0.08120584615673392, 0.18070218181953981, 0.03366913124680137, -0.04734403996628363, -0.24082176289401758, 0.03896736828849102, -0.1983383226280029, -0.20882183641720659, -0.1297896790962953, 0.12101359221224602, 0.07816524100967516, -0.166929471378143, 0.06926359162212183, 0.09058420961866012, 0.137980140453109, -0.009190931540125838, -0.23923179139502537, 0.20766600646460667, 0.03427180922470796, 0.10688414811514892, 0.013926271677542573, -0.0015490054009625544, -0.17387955883541742, -0.1425059302112995, 0.3709341374775156, -0.01354865370423142, -0.1399226310925606, 0.07160157431514026, -0.10700284533250408, -0.18415502400304645, 0.09530676027330068, 0.10275438400463034, 0.19763389315742713, -0.14958879676384804, 0.04748703737426788, -0.12726939877925011, 0.1113218195282687, 0.26985036615186775, -0.026756680140701625, 0.1415139760535497, 0.05724947751523592, 0.008237022537893305, 0.17961388948158577, 0.03223865809969795, -0.096540008767102, -0.316734371563563, -0.2533214598392638, -0.13640541667887307, 0.1000052191890203, -0.08445589311192564, -0.16771440184078154, 0.38539107946249157, 0.1358236269428371, 0.12106126699692164, 0.13454237286574566, 0.25046831264327735, 0.1310707907884931, 0.039379342536752425, 0.018749685910267707, 0.15132983510445158, 0.19047382369470328, 0.05204466118242962, -0.08706355554600939, 0.04719224457557385, 0.16286791290323704] |
1,802.04617 | Fast Global Convergence via Landscape of Empirical Loss | While optimizing convex objective (loss) functions has been a powerhouse for
machine learning for at least two decades, non-convex loss functions have
attracted fast growing interests recently, due to many desirable properties
such as superior robustness and classification accuracy, compared with their
convex counterparts. The main obstacle for non-convex estimators is that it is
in general intractable to find the optimal solution. In this paper, we study
the computational issues for some non-convex M-estimators. In particular, we
show that the stochastic variance reduction methods converge to the global
optimal with linear rate, by exploiting the statistical property of the
population loss. En route, we improve the convergence analysis for the batch
gradient method in \cite{mei2016landscape}.
| stat.ML cs.LG | while optimizing convex objective loss functions has been a powerhouse for machine learning for at least two decades nonconvex loss functions have attracted fast growing interests recently due to many desirable properties such as superior robustness and classification accuracy compared with their convex counterparts the main obstacle for nonconvex estimators is that it is in general intractable to find the optimal solution in this paper we study the computational issues for some nonconvex mestimators in particular we show that the stochastic variance reduction methods converge to the global optimal with linear rate by exploiting the statistical property of the population loss en route we improve the convergence analysis for the batch gradient method in citemei2016landscape | [['while', 'optimizing', 'convex', 'objective', 'loss', 'functions', 'has', 'been', 'a', 'powerhouse', 'for', 'machine', 'learning', 'for', 'at', 'least', 'two', 'decades', 'nonconvex', 'loss', 'functions', 'have', 'attracted', 'fast', 'growing', 'interests', 'recently', 'due', 'to', 'many', 'desirable', 'properties', 'such', 'as', 'superior', 'robustness', 'and', 'classification', 'accuracy', 'compared', 'with', 'their', 'convex', 'counterparts', 'the', 'main', 'obstacle', 'for', 'nonconvex', 'estimators', 'is', 'that', 'it', 'is', 'in', 'general', 'intractable', 'to', 'find', 'the', 'optimal', 'solution', 'in', 'this', 'paper', 'we', 'study', 'the', 'computational', 'issues', 'for', 'some', 'nonconvex', 'mestimators', 'in', 'particular', 'we', 'show', 'that', 'the', 'stochastic', 'variance', 'reduction', 'methods', 'converge', 'to', 'the', 'global', 'optimal', 'with', 'linear', 'rate', 'by', 'exploiting', 'the', 'statistical', 'property', 'of', 'the', 'population', 'loss', 'en', 'route', 'we', 'improve', 'the', 'convergence', 'analysis', 'for', 'the', 'batch', 'gradient', 'method', 'in', 'citemei2016landscape']] | [-0.036681860236026216, -0.04147097352982025, -0.08187074503420215, 0.10036804911521215, -0.08275141018410131, -0.1461145414423459, 0.022349477153304115, 0.43852452978899237, -0.30713851280150967, -0.2794153118621468, 0.1457126798565712, -0.28776963850842757, -0.19998907775969424, 0.21540447204524912, -0.14857777976839429, 0.19708241214322156, 0.07749301220827508, -0.033682571879277624, -0.1271417896271471, -0.31922696145780366, 0.26210214908381824, 0.050219311044968074, 0.3313233291142081, 0.03590914943222806, 0.12708720023102502, -0.003388708101977643, 0.03410018879609803, 0.03468458914900558, -0.1002274922044435, 0.1591596741662279, 0.2959510105939811, 0.18815324849065132, 0.4273132843275865, -0.3799964553562173, -0.24408434431901888, 0.16737662588466742, 0.1589940850019941, 0.08247022376408016, -0.0996791914354585, -0.18200401987128875, 0.11831929441745671, -0.1426900331208711, -0.08849032764862243, -0.12792903425482413, -0.023267355151147695, 0.06999403038705503, -0.28979444444146857, 0.08081725388438556, 0.06317930914494291, 0.03855864848255327, -0.06432669447212104, -0.16784880488698387, 0.03570077656114703, 0.08000842757469959, 0.1402493567214135, 0.06238179366520949, 0.08460488303139675, -0.1468714048224093, -0.1224008567616948, 0.33460258691686023, -0.03127442581963055, -0.23423954540161057, 0.2120485667899055, -0.07725054053426311, -0.1734468188328799, 0.15430567494038036, 0.2546498908481577, 0.13875814354488333, -0.16176383420334836, 0.08380574094113208, 0.003155065316445472, 0.08485905746847652, 0.04526778838695272, 0.07028729754771727, 0.11411406770511939, 0.20343996618318846, 0.18531024065675428, 0.1638165071633187, -0.038190998578660616, -0.1145968449816696, -0.1985812386939008, -0.13365868751874618, -0.20935032394175468, -0.00910986899020428, -0.1012205372873659, -0.14680437452421247, 0.3638529947615768, 0.14847464440798944, 0.1760957056591124, 0.13718917420575102, 0.31216940824595985, 0.13447906031056814, 0.04897296702971257, 0.1361684463203378, 0.2740391737696196, 0.09802258330021511, 0.07777575039296623, -0.24193401147382693, 0.1223078292157305, 0.05026552817894538] |
1,802.04618 | Wahl maps and extensions of canonical curves and K3 surfaces | Let $C$ be a smooth projective curve of genus $g \geq 11$, non-tetragonal,
considered in its canonical embedding in $\mathbf{P}^{g-1}$. We prove that $C$
is a linear section of an arithmetically Gorenstein normal variety $Y$ in
$\mathbf{P}^{g+r}$, not a cone, with $\dim(Y)=r+2$ and
$\omega_Y=\mathcal{O}_Y(-r)$, if the Gauss--Wahl map of $C$ has corank larger
or equal than $r+1$. This relies on previous work of Wahl and
Arbarello-Bruno-Sernesi; a partial converse is given via a theorem of Lvovski.
We derive a similar result for $K3$ surfaces: Let $(S,L)$ be a polarized $K3$
surface of genus $g \geq 11$, non-tetragonal, and considered in its embedding
in $|L|^\vee \cong \mathbf{P}^g$. It is a linear section of a variety $Y$ as
above if $H^1(T_S \otimes L^\vee)$ has dimension larger or equal than $r$.
We give various applications, including one to the following forgetful
modular map: Let $\mathcal{K}_g$ be the moduli space of polarized $K3$ surfaces
of genus $g$, and $\mathcal{KC}_g$ the space of pairs $(S,C)$ with $C$ a smooth
curve on $S$ and $(S,\mathcal{O}_S(C)) \in \mathcal{K}_g$; we consider the map
$c_g: (S,C) \in \mathcal{K}_g \mapsto C \in \mathcal{M}_g$. If $g \geq 11$, we
show that this map has smooth fibres over the locus of non-tetragonal curves,
with fibre-dimension over non-tetragonal $C$ the corank of the Gauss--Wahl map
of $C$ minus one.
| math.AG | let c be a smooth projective curve of genus g geq 11 nontetragonal considered in its canonical embedding in mathbfpg1 we prove that c is a linear section of an arithmetically gorenstein normal variety y in mathbfpgr not a cone with dimyr2 and omega_ymathcalo_yr if the gausswahl map of c has corank larger or equal than r1 this relies on previous work of wahl and arbarellobrunosernesi a partial converse is given via a theorem of lvovski we derive a similar result for k3 surfaces let sl be a polarized k3 surface of genus g geq 11 nontetragonal and considered in its embedding in lvee cong mathbfpg it is a linear section of a variety y as above if h1t_s otimes lvee has dimension larger or equal than r we give various applications including one to the following forgetful modular map let mathcalk_g be the moduli space of polarized k3 surfaces of genus g and mathcalkc_g the space of pairs sc with c a smooth curve on s and smathcalo_sc in mathcalk_g we consider the map c_g sc in mathcalk_g mapsto c in mathcalm_g if g geq 11 we show that this map has smooth fibres over the locus of nontetragonal curves with fibredimension over nontetragonal c the corank of the gausswahl map of c minus one | [['let', 'c', 'be', 'a', 'smooth', 'projective', 'curve', 'of', 'genus', 'g', 'geq', '11', 'nontetragonal', 'considered', 'in', 'its', 'canonical', 'embedding', 'in', 'mathbfpg1', 'we', 'prove', 'that', 'c', 'is', 'a', 'linear', 'section', 'of', 'an', 'arithmetically', 'gorenstein', 'normal', 'variety', 'y', 'in', 'mathbfpgr', 'not', 'a', 'cone', 'with', 'dimyr2', 'and', 'omega_ymathcalo_yr', 'if', 'the', 'gausswahl', 'map', 'of', 'c', 'has', 'corank', 'larger', 'or', 'equal', 'than', 'r1', 'this', 'relies', 'on', 'previous', 'work', 'of', 'wahl', 'and', 'arbarellobrunosernesi', 'a', 'partial', 'converse', 'is', 'given', 'via', 'a', 'theorem', 'of', 'lvovski', 'we', 'derive', 'a', 'similar', 'result', 'for', 'k3', 'surfaces', 'let', 'sl', 'be', 'a', 'polarized', 'k3', 'surface', 'of', 'genus', 'g', 'geq', '11', 'nontetragonal', 'and', 'considered', 'in', 'its', 'embedding', 'in', 'lvee', 'cong', 'mathbfpg', 'it', 'is', 'a', 'linear', 'section', 'of', 'a', 'variety', 'y', 'as', 'above', 'if', 'h1t_s', 'otimes', 'lvee', 'has', 'dimension', 'larger', 'or', 'equal', 'than', 'r', 'we', 'give', 'various', 'applications', 'including', 'one', 'to', 'the', 'following', 'forgetful', 'modular', 'map', 'let', 'mathcalk_g', 'be', 'the', 'moduli', 'space', 'of', 'polarized', 'k3', 'surfaces', 'of', 'genus', 'g', 'and', 'mathcalkc_g', 'the', 'space', 'of', 'pairs', 'sc', 'with', 'c', 'a', 'smooth', 'curve', 'on', 's', 'and', 'smathcalo_sc', 'in', 'mathcalk_g', 'we', 'consider', 'the', 'map', 'c_g', 'sc', 'in', 'mathcalk_g', 'mapsto', 'c', 'in', 'mathcalm_g', 'if', 'g', 'geq', '11', 'we', 'show', 'that', 'this', 'map', 'has', 'smooth', 'fibres', 'over', 'the', 'locus', 'of', 'nontetragonal', 'curves', 'with', 'fibredimension', 'over', 'nontetragonal', 'c', 'the', 'corank', 'of', 'the', 'gausswahl', 'map', 'of', 'c', 'minus', 'one']] | [-0.18549257266826083, 0.07074402608592442, -0.08224262302200049, -0.0032271844182356164, -0.03971125539896891, -0.21975557458371364, -0.00588863161323693, 0.35785419051650125, -0.2943768806794539, -0.20060541340393093, 0.07265434137274845, -0.2791893593875205, -0.10871434193609163, 0.23460507687993273, -0.12599118268621967, -0.05904316439079992, 0.008690764302883316, 0.07895809640245412, -0.12134154550639425, -0.31503739293488064, 0.3715885194945218, -0.11180909018329313, 0.17410675878292453, 0.05912148120487338, 0.10953684739557466, 0.02692673710637079, 0.03928217891227509, -0.011384986441070902, -0.18057376370924982, 0.11465429671549152, 0.28196887924276254, 0.11003272948107623, 0.16266884767132686, -0.3139908030133676, -0.20434310659880892, 0.24315965974822715, 0.10647458119405058, -0.03550530010616416, 0.046173467656386455, -0.18952227088397947, 0.14952181710216753, -0.12294562776192215, -0.14630325395026672, -0.007454674617557103, 0.1479811386544753, -0.011970372799453623, -0.22643145348353705, -0.018126259645070936, 0.10787758196066385, 0.1450617671085423, 0.013914967177142136, -0.15040700427219822, -0.1550898217496329, 0.007051323193556679, -0.03800103165842409, 0.1790932252833372, 0.0408959649645166, -0.09369822920717556, -0.052529239303345236, 0.3743231783556784, -0.14392431881212803, -0.19168225584982945, 0.11340794727444796, -0.19449360088245676, -0.11183822678695685, 0.14742305016218515, 0.11123244534017233, 0.20411367783221998, 0.0160522825392009, 0.21680548555748722, -0.1126943839016586, 0.12401123096927853, 0.09320435957441776, -0.07451341683136786, 0.12886996626431865, 0.11302417922957704, 0.11453965935727646, 0.10947300656698644, -0.06521247052260688, 0.0675598571485303, -0.3651727541909539, -0.22211051307471807, -0.12378487794251718, 0.20093379325580066, -0.10854513828421591, -0.1212567261470656, 0.37041108300129477, 0.007148942494939261, 0.2484797620274163, 0.08050585183512254, 0.21010388203625902, 0.04290447152836771, 0.031035225185952173, 0.10571969780162564, 0.10688380457792349, 0.19414081967669755, -0.0552832816894914, -0.11486194123458943, -0.007565985245657672, 0.14088161639281976] |
1,802.04619 | Finiteness of Maximal Geodesic Submanifolds in Hyperbolic Hybrids | We show that large classes of non-arithmetic hyperbolic $n$-manifolds,
including the hybrids introduced by Gromov and Piatetski-Shapiro and many of
their generalizations, have only finitely many finite-volume immersed totally
geodesic hypersurfaces. In higher codimension, we prove finiteness for geodesic
submanifolds of dimension at least $2$ that are maximal, i.e., not properly
contained in a proper geodesic submanifold of the ambient $n$-manifold. The
proof is a mix of structure theory for arithmetic groups, dynamics, and
geometry in negative curvature.
| math.GT math.DG math.DS math.GR | we show that large classes of nonarithmetic hyperbolic nmanifolds including the hybrids introduced by gromov and piatetskishapiro and many of their generalizations have only finitely many finitevolume immersed totally geodesic hypersurfaces in higher codimension we prove finiteness for geodesic submanifolds of dimension at least 2 that are maximal ie not properly contained in a proper geodesic submanifold of the ambient nmanifold the proof is a mix of structure theory for arithmetic groups dynamics and geometry in negative curvature | [['we', 'show', 'that', 'large', 'classes', 'of', 'nonarithmetic', 'hyperbolic', 'nmanifolds', 'including', 'the', 'hybrids', 'introduced', 'by', 'gromov', 'and', 'piatetskishapiro', 'and', 'many', 'of', 'their', 'generalizations', 'have', 'only', 'finitely', 'many', 'finitevolume', 'immersed', 'totally', 'geodesic', 'hypersurfaces', 'in', 'higher', 'codimension', 'we', 'prove', 'finiteness', 'for', 'geodesic', 'submanifolds', 'of', 'dimension', 'at', 'least', '2', 'that', 'are', 'maximal', 'ie', 'not', 'properly', 'contained', 'in', 'a', 'proper', 'geodesic', 'submanifold', 'of', 'the', 'ambient', 'nmanifold', 'the', 'proof', 'is', 'a', 'mix', 'of', 'structure', 'theory', 'for', 'arithmetic', 'groups', 'dynamics', 'and', 'geometry', 'in', 'negative', 'curvature']] | [-0.2060103167552883, 0.15241434964506576, -0.09128315977823849, 0.11491511086485563, -0.07047875821948625, -0.14280856657438937, -0.08465867313610104, 0.34989246874092483, -0.256118223309899, -0.2140405585941596, 0.11004892154148994, -0.3288438933877609, -0.1345390591901751, 0.20021817454089147, -0.1876250849902415, 0.015594664041717082, 0.08879659941587119, 0.07857364411943425, -0.03514130538305602, -0.29417715531935057, 0.42571428267118067, -0.10944866658880925, 0.1845060063717075, 0.14494953839442667, 0.14812458944148743, -0.008757920971570106, -0.0020959750773050846, 0.093401353266717, -0.16227201749969913, 0.13237899682150248, 0.25014121040033227, 0.0514170403043047, 0.19999529518043765, -0.38513982661355, -0.24857012188444153, 0.22520840374561837, 0.1595326931311343, -0.005636621536746717, -0.03532998104734967, -0.2720354863752921, 0.14750552050267848, -0.06750940676563634, -0.21848495695620584, -0.09587295773104788, 0.047321359340388044, -0.015873804485473115, -0.09966986241693704, 0.02082139543759135, 0.16252927583021423, 0.16432616714006051, -0.04344047971953375, -0.10206549227810822, -0.07355942802193265, 0.08513137019830398, 0.009703006186427023, 0.01749807488746368, 0.08098042374834992, -0.028703356149773568, -0.08224952994630887, 0.3771559923158911, -0.06461869969438666, -0.30732820037370306, 0.15516903514090258, -0.18801896741542107, -0.17874361898821706, 0.16934231724231863, 0.1689984885772738, 0.182735944884674, -0.06757448260293294, 0.20761527678442712, -0.06573542513741323, 0.05162130884873944, 0.16784213483333588, 0.00315932450720515, 0.10200028845335907, 0.05583055885747457, 0.1344853923551571, 0.0945915947548854, 0.03526390757626639, -0.04781172794695848, -0.3778234556174049, -0.24520808141917372, -0.14637100921036342, 0.1558646672684774, -0.16863138395759356, -0.2284527106049399, 0.33783225770084524, -0.013650896021714196, 0.15711225959687278, 0.13519627516134045, 0.25032636437577027, -0.03843805644861183, 0.06100008088964014, 0.16237152465141547, 0.15455698332964227, 0.20796323770907924, -0.06526223137879218, -0.08940960076721147, -0.04709938117780556, 0.20668228266712946] |
1,802.0462 | Kaleidoscope of Classical Images and Quantum Coherent States | The Schr\"odinger cat states, constructed from Glauber coherent states and
applied for description of qubits are generalized to the kaleidoscope of
coherent states, related with regular n-polygon symmetry and the roots of
unity. This quantum kaleidoscope is motivated by our method of classical
hydrodynamics images in a wedge domain, described by $q$-calculus of analytic
functions with $q$ as a primitive root of unity. The cases of the trinity
states and the quartet states are described in details. Normalization formula
for these states requires introduction of specific combinations of exponential
functions with mod 3 and mod 4 symmetry. We show that these states can be
generated for an arbitrary $n$ by the Quantum Fourier transform and can provide
qutrits, ququats and in general, qudit units of quantum information. Relations
of our states with quantum groups and quantum calculus are discussed.
| quant-ph math-ph math.MP | the schrodinger cat states constructed from glauber coherent states and applied for description of qubits are generalized to the kaleidoscope of coherent states related with regular npolygon symmetry and the roots of unity this quantum kaleidoscope is motivated by our method of classical hydrodynamics images in a wedge domain described by qcalculus of analytic functions with q as a primitive root of unity the cases of the trinity states and the quartet states are described in details normalization formula for these states requires introduction of specific combinations of exponential functions with mod 3 and mod 4 symmetry we show that these states can be generated for an arbitrary n by the quantum fourier transform and can provide qutrits ququats and in general qudit units of quantum information relations of our states with quantum groups and quantum calculus are discussed | [['the', 'schrodinger', 'cat', 'states', 'constructed', 'from', 'glauber', 'coherent', 'states', 'and', 'applied', 'for', 'description', 'of', 'qubits', 'are', 'generalized', 'to', 'the', 'kaleidoscope', 'of', 'coherent', 'states', 'related', 'with', 'regular', 'npolygon', 'symmetry', 'and', 'the', 'roots', 'of', 'unity', 'this', 'quantum', 'kaleidoscope', 'is', 'motivated', 'by', 'our', 'method', 'of', 'classical', 'hydrodynamics', 'images', 'in', 'a', 'wedge', 'domain', 'described', 'by', 'qcalculus', 'of', 'analytic', 'functions', 'with', 'q', 'as', 'a', 'primitive', 'root', 'of', 'unity', 'the', 'cases', 'of', 'the', 'trinity', 'states', 'and', 'the', 'quartet', 'states', 'are', 'described', 'in', 'details', 'normalization', 'formula', 'for', 'these', 'states', 'requires', 'introduction', 'of', 'specific', 'combinations', 'of', 'exponential', 'functions', 'with', 'mod', '3', 'and', 'mod', '4', 'symmetry', 'we', 'show', 'that', 'these', 'states', 'can', 'be', 'generated', 'for', 'an', 'arbitrary', 'n', 'by', 'the', 'quantum', 'fourier', 'transform', 'and', 'can', 'provide', 'qutrits', 'ququats', 'and', 'in', 'general', 'qudit', 'units', 'of', 'quantum', 'information', 'relations', 'of', 'our', 'states', 'with', 'quantum', 'groups', 'and', 'quantum', 'calculus', 'are', 'discussed']] | [-0.12408113898374408, 0.19463693985488123, -0.08855910127540287, 0.06168104686921717, 0.011085043198985161, -0.17031370605327015, -0.0006061067097827042, 0.3028101769456868, -0.2614216361087646, -0.26263506600646663, 0.062357132381712685, -0.2767638016036517, -0.13816087330664717, 0.1991482615996849, -0.038018210228237745, 0.10048888313496927, 0.04499039011538404, 0.054259107969307656, -0.06323996410544346, -0.2339137833994284, 0.35904411491837435, -0.02212252063013399, 0.23591348969648934, 0.012581880552788003, 0.09463304528470734, 0.03627897576234645, 0.010059705647311623, -0.03344635902007042, -0.08841925094486423, 0.1541177123791719, 0.2929742692922838, 0.11983699315410147, 0.1703740727707489, -0.4551127548564038, -0.1696145975788077, 0.059734023065580955, 0.1297786667437976, 0.12517391892967464, -0.009698715195790094, -0.3341309321447939, 0.07786114714878926, -0.1739684960322468, -0.14565324873442378, -0.1299751080478803, 0.04172470116830371, 0.014263557698737557, -0.24966932184284005, 0.09678325928972109, 0.08409333191544031, 0.08686588840096814, -0.03177462768738439, -0.1212740338285179, -0.0021053309612672965, 0.09582894331634902, -0.07749025998871586, -0.012192760094189547, 0.09022862532363682, -0.14161992051283553, -0.1944303229022369, 0.3470323945415749, 0.004666420800289769, -0.24644338911091038, 0.1331736676612904, -0.12844564347266615, -0.09746245505026938, 0.05224118955272565, 0.08555417513247017, 0.11753743280247926, -0.055447509579306886, 0.11110692222742112, -0.0447337890593268, 0.1552836376999458, 0.0794799968553372, 0.07547480703654813, 0.14876498212190278, 0.03163272460667993, 0.018233427947903013, 0.18402958955371204, -0.023436328922163883, -0.1415816022940784, -0.35243835419470027, -0.19240878972647002, -0.21631539212338788, 0.10508852366277639, -0.07199779025493809, -0.13868576506522934, 0.4229326417683054, 0.05816855575173688, 0.17631993719155517, 0.04792628943142917, 0.2006661713176923, 0.16054393675449646, 0.07547238583487237, 0.050810984060583465, 0.15352157631339572, 0.18640451445311254, 0.008616024973339957, -0.20426565322148943, -0.02168962675246842, 0.09167888314838407] |
1,802.04621 | Maximum Queue Length for Traffic Light with Bernoulli Arrivals | Cars arrive at an intersection with a stoplight, which is either red or
green. The cars all travel in the same direction, that is, we ignore
cross-traffic & oncoming traffic. Assume that the intersection is initially
empty. Assume that, at every second, there is a probability p that one new car
will arrive at the light, and the outcome is independent of past & future. Let
L>=1 be an integer. A red light lasts L seconds; likewise for green. If the
light is red, no cars can leave the intersection. If the light is green, cars
will leave the intersection at a rate of one per second. Over a time period of
n seconds, determine the (random) maximum queue length M of cars at the
intersection. What is the distribution of M, as a function of (p,L,n)? We
answer this question for the special case L=1 and introduce a conjecture for
L>1.
| math.HO | cars arrive at an intersection with a stoplight which is either red or green the cars all travel in the same direction that is we ignore crosstraffic oncoming traffic assume that the intersection is initially empty assume that at every second there is a probability p that one new car will arrive at the light and the outcome is independent of past future let l1 be an integer a red light lasts l seconds likewise for green if the light is red no cars can leave the intersection if the light is green cars will leave the intersection at a rate of one per second over a time period of n seconds determine the random maximum queue length m of cars at the intersection what is the distribution of m as a function of pln we answer this question for the special case l1 and introduce a conjecture for l1 | [['cars', 'arrive', 'at', 'an', 'intersection', 'with', 'a', 'stoplight', 'which', 'is', 'either', 'red', 'or', 'green', 'the', 'cars', 'all', 'travel', 'in', 'the', 'same', 'direction', 'that', 'is', 'we', 'ignore', 'crosstraffic', 'oncoming', 'traffic', 'assume', 'that', 'the', 'intersection', 'is', 'initially', 'empty', 'assume', 'that', 'at', 'every', 'second', 'there', 'is', 'a', 'probability', 'p', 'that', 'one', 'new', 'car', 'will', 'arrive', 'at', 'the', 'light', 'and', 'the', 'outcome', 'is', 'independent', 'of', 'past', 'future', 'let', 'l1', 'be', 'an', 'integer', 'a', 'red', 'light', 'lasts', 'l', 'seconds', 'likewise', 'for', 'green', 'if', 'the', 'light', 'is', 'red', 'no', 'cars', 'can', 'leave', 'the', 'intersection', 'if', 'the', 'light', 'is', 'green', 'cars', 'will', 'leave', 'the', 'intersection', 'at', 'a', 'rate', 'of', 'one', 'per', 'second', 'over', 'a', 'time', 'period', 'of', 'n', 'seconds', 'determine', 'the', 'random', 'maximum', 'queue', 'length', 'm', 'of', 'cars', 'at', 'the', 'intersection', 'what', 'is', 'the', 'distribution', 'of', 'm', 'as', 'a', 'function', 'of', 'pln', 'we', 'answer', 'this', 'question', 'for', 'the', 'special', 'case', 'l1', 'and', 'introduce', 'a', 'conjecture', 'for', 'l1']] | [-0.17468679490680464, 0.18032048743443982, -0.12115313216806359, 0.043852274730370296, -0.062344269712936856, -0.1580680454518621, 0.06920273532628413, 0.36814429769730006, -0.25872369910646603, -0.2213831405724155, 0.1255797043090355, -0.32691112308194176, -0.0705545931185702, 0.16830011102958464, -0.09866643938292192, -0.04773583443797875, 0.0889569320215925, 0.1340561664581999, 0.005450796826598828, -0.2727229618483017, 0.2842028604526598, -0.01652799364360637, 0.20049142078715282, 0.03837535853791457, 0.09190670917890403, 0.056208061361404126, 0.0004127286208540376, -0.024270678606296846, -0.0632878940172756, 0.0415599777085094, 0.23567644608575825, 0.1521209113587662, 0.33284880442040093, -0.39846210109422314, -0.17693105378756988, 0.1754542563060586, 0.14134417869535043, 0.03269508605644782, 0.003967752920826209, -0.18253350218964254, 0.13948175238297245, -0.10470369223180233, -0.18666331637056932, 0.07490855007082374, 0.11679946838865594, 0.02987328026562479, -0.2749645770933704, -0.002539638954530401, 0.03286777630498345, 0.04675119780117314, -0.01436680520028376, -0.08575473424522269, -0.05265551731427944, 0.14362888232392304, 0.024016699639868352, 0.0840405022956731, 0.09631174090810608, -0.08591230766028916, -0.08955195976027457, 0.39681060067901464, -0.0698118979672295, -0.1277457720556315, 0.12595448521709682, -0.17197395375954774, -0.11001529964312111, 0.128170218032741, 0.1592185522067117, 0.15441822321872983, -0.09081571716690223, 0.030592980868833126, -0.11339990058663807, 0.16710743666220232, 0.1421608569588037, 0.006686918128863127, 0.24399720868111383, 0.15351092576552433, 0.15280323497632256, 0.08634228724283136, -0.1293286713052716, -0.020035833185976185, -0.3337116567824261, -0.1653385043938038, -0.1913760029327987, 0.10273419847343142, -0.0764467093760332, -0.11007695507895726, 0.3448571895230437, 0.10424772873458346, 0.23591724118442844, 0.0975621310383044, 0.3288293792397384, 0.14351320856378957, 0.039936316418074755, 0.14099178951071112, 0.17154001452078754, 0.03092397008663131, 0.09258841117140806, -0.17640511897875422, 0.07726023249615659, 0.06511780374602183] |
1,802.04622 | Advection and autocatalysis as organizing principles for banded
vegetation patterns | We motivate and analyze a simple model for the formation of banded vegetation
patterns. The model incorporates a minimal number of ingredients for vegetation
growth in semi-arid landscapes. It allows for comprehensive analysis and sheds
new light onto phenomena such as the migration of vegetation bands and the
interplay between their upper and lower edges. The key ingredient is the
formulation as a closed reaction-diffusion system, thus introducing a
conservation law that both allows for analysis and provides ready intuition and
understanding through analogies with characteristic speeds of propagation and
shock waves.
| nlin.PS | we motivate and analyze a simple model for the formation of banded vegetation patterns the model incorporates a minimal number of ingredients for vegetation growth in semiarid landscapes it allows for comprehensive analysis and sheds new light onto phenomena such as the migration of vegetation bands and the interplay between their upper and lower edges the key ingredient is the formulation as a closed reactiondiffusion system thus introducing a conservation law that both allows for analysis and provides ready intuition and understanding through analogies with characteristic speeds of propagation and shock waves | [['we', 'motivate', 'and', 'analyze', 'a', 'simple', 'model', 'for', 'the', 'formation', 'of', 'banded', 'vegetation', 'patterns', 'the', 'model', 'incorporates', 'a', 'minimal', 'number', 'of', 'ingredients', 'for', 'vegetation', 'growth', 'in', 'semiarid', 'landscapes', 'it', 'allows', 'for', 'comprehensive', 'analysis', 'and', 'sheds', 'new', 'light', 'onto', 'phenomena', 'such', 'as', 'the', 'migration', 'of', 'vegetation', 'bands', 'and', 'the', 'interplay', 'between', 'their', 'upper', 'and', 'lower', 'edges', 'the', 'key', 'ingredient', 'is', 'the', 'formulation', 'as', 'a', 'closed', 'reactiondiffusion', 'system', 'thus', 'introducing', 'a', 'conservation', 'law', 'that', 'both', 'allows', 'for', 'analysis', 'and', 'provides', 'ready', 'intuition', 'and', 'understanding', 'through', 'analogies', 'with', 'characteristic', 'speeds', 'of', 'propagation', 'and', 'shock', 'waves']] | [-0.10787262781219475, 0.13630624672615618, -0.11727561736378171, 0.09887291846477994, -0.0885614762082696, -0.1258556336245459, 0.06546767844575578, 0.2926028370148624, -0.2546091917902231, -0.3212796721162032, 0.09205225846380927, -0.25123911160683393, -0.2321056388672846, 0.21937693723821608, -0.031445660542332284, 0.035082677986634815, 0.04075582528932263, -0.07665118952939773, 0.008758537445986725, -0.1106770878642514, 0.2971152245097429, 0.04985063532259791, 0.29367258270149643, 0.1255687434155413, 0.09697955312794479, 0.010099383711349219, -0.05651137809289376, -0.025377303174615878, -0.15622879443577878, 0.13672372317397158, 0.2043252735823879, 0.15081344846555073, 0.24787349268571351, -0.4889808057240494, -0.28218437145140185, 0.061246686938988125, 0.16212486648810623, 0.10361799865495414, -0.07965655461726862, -0.229182671998506, 0.03397690974499868, -0.12083527662173804, -0.16983256050709472, -0.06221115277477783, 0.03164390229579547, 0.03305690864457891, -0.27269618457142747, 0.0810444881056395, 0.09257070601755835, 0.07834566252669269, -0.08855020805672013, -0.060611980667327654, -0.07337205346835696, 0.15964937722310424, 0.0324402445593201, -0.04800733062438667, 0.08651671823210326, -0.13400713972868802, -0.0716308670816943, 0.42738443692012323, -0.08259281058259227, -0.17538690210684485, 0.23818659920336516, -0.11334267409572772, -0.07528206750588573, 0.11084768598210877, 0.21618913483056848, 0.06419586853553483, -0.12375012855045497, 0.024662138241894907, -0.045030518698141626, 0.12615037523463127, 0.04065510867487477, 0.03999836316696652, 0.26388347031467635, 0.25225943113353266, 0.08363847040733241, 0.1272866661336435, -0.09744102084685279, -0.13471432572038358, -0.2973729787880312, -0.1760883933014196, -0.09298462155983662, 0.004698947388375097, -0.12437759312366403, -0.17628250651709412, 0.4535823475478379, 0.1259407551412511, 0.20230933858851052, 0.07169747492298484, 0.2687844468442642, 0.07404581907347006, 0.034651948703432696, 0.07046709147423667, 0.16160163409380324, 0.1597670112083585, 0.09369429428150634, -0.1940856330734475, 0.10831514259537114, 0.07507437960568654] |
1,802.04623 | Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity | Hoffman's classical result gives a bound on the distance of a point from a
convex and compact polytope in terms of the magnitude of violation of the
constraints. Recently, several results showed that Hoffman's bound can be used
to derive strongly-convex-like rates for first-order methods for
\textit{offline} convex optimization of curved, though not strongly convex,
functions, over polyhedral sets. In this work, we use this classical result for
the first time to obtain faster rates for \textit{online convex optimization}
over polyhedral sets with curved convex, though not strongly convex, loss
functions. We show that under several reasonable assumptions on the data, the
standard \textit{Online Gradient Descent} algorithm guarantees logarithmic
regret. To the best of our knowledge, the only previous algorithm to achieve
logarithmic regret in the considered settings is the \textit{Online Newton
Step} algorithm which requires quadratic (in the dimension) memory and at least
quadratic runtime per iteration, which greatly limits its applicability to
large-scale problems. In particular, our results hold for
\textit{semi-adversarial} settings in which the data is a combination of an
arbitrary (adversarial) sequence and a stochastic sequence, which might provide
reasonable approximation for many real-world sequences, or under a natural
assumption that the data is low-rank. We demonstrate via experiments that the
regret of OGD is indeed comparable to that of ONS (and even far better) on
curved though not strongly-convex losses.
| cs.LG math.OC | hoffmans classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints recently several results showed that hoffmans bound can be used to derive stronglyconvexlike rates for firstorder methods for textitoffline convex optimization of curved though not strongly convex functions over polyhedral sets in this work we use this classical result for the first time to obtain faster rates for textitonline convex optimization over polyhedral sets with curved convex though not strongly convex loss functions we show that under several reasonable assumptions on the data the standard textitonline gradient descent algorithm guarantees logarithmic regret to the best of our knowledge the only previous algorithm to achieve logarithmic regret in the considered settings is the textitonline newton step algorithm which requires quadratic in the dimension memory and at least quadratic runtime per iteration which greatly limits its applicability to largescale problems in particular our results hold for textitsemiadversarial settings in which the data is a combination of an arbitrary adversarial sequence and a stochastic sequence which might provide reasonable approximation for many realworld sequences or under a natural assumption that the data is lowrank we demonstrate via experiments that the regret of ogd is indeed comparable to that of ons and even far better on curved though not stronglyconvex losses | [['hoffmans', 'classical', 'result', 'gives', 'a', 'bound', 'on', 'the', 'distance', 'of', 'a', 'point', 'from', 'a', 'convex', 'and', 'compact', 'polytope', 'in', 'terms', 'of', 'the', 'magnitude', 'of', 'violation', 'of', 'the', 'constraints', 'recently', 'several', 'results', 'showed', 'that', 'hoffmans', 'bound', 'can', 'be', 'used', 'to', 'derive', 'stronglyconvexlike', 'rates', 'for', 'firstorder', 'methods', 'for', 'textitoffline', 'convex', 'optimization', 'of', 'curved', 'though', 'not', 'strongly', 'convex', 'functions', 'over', 'polyhedral', 'sets', 'in', 'this', 'work', 'we', 'use', 'this', 'classical', 'result', 'for', 'the', 'first', 'time', 'to', 'obtain', 'faster', 'rates', 'for', 'textitonline', 'convex', 'optimization', 'over', 'polyhedral', 'sets', 'with', 'curved', 'convex', 'though', 'not', 'strongly', 'convex', 'loss', 'functions', 'we', 'show', 'that', 'under', 'several', 'reasonable', 'assumptions', 'on', 'the', 'data', 'the', 'standard', 'textitonline', 'gradient', 'descent', 'algorithm', 'guarantees', 'logarithmic', 'regret', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'only', 'previous', 'algorithm', 'to', 'achieve', 'logarithmic', 'regret', 'in', 'the', 'considered', 'settings', 'is', 'the', 'textitonline', 'newton', 'step', 'algorithm', 'which', 'requires', 'quadratic', 'in', 'the', 'dimension', 'memory', 'and', 'at', 'least', 'quadratic', 'runtime', 'per', 'iteration', 'which', 'greatly', 'limits', 'its', 'applicability', 'to', 'largescale', 'problems', 'in', 'particular', 'our', 'results', 'hold', 'for', 'textitsemiadversarial', 'settings', 'in', 'which', 'the', 'data', 'is', 'a', 'combination', 'of', 'an', 'arbitrary', 'adversarial', 'sequence', 'and', 'a', 'stochastic', 'sequence', 'which', 'might', 'provide', 'reasonable', 'approximation', 'for', 'many', 'realworld', 'sequences', 'or', 'under', 'a', 'natural', 'assumption', 'that', 'the', 'data', 'is', 'lowrank', 'we', 'demonstrate', 'via', 'experiments', 'that', 'the', 'regret', 'of', 'ogd', 'is', 'indeed', 'comparable', 'to', 'that', 'of', 'ons', 'and', 'even', 'far', 'better', 'on', 'curved', 'though', 'not', 'stronglyconvex', 'losses']] | [-0.07270928877411043, 0.005835891240383415, -0.09949572499415466, 0.08745767644840405, -0.08353323335320827, -0.1344436067260902, 0.06439461406855948, 0.38814216403023344, -0.29039933147940433, -0.29430484667320156, 0.11937026344573819, -0.2176439390262493, -0.15377845712718158, 0.26180728171605433, -0.1348601577536207, 0.08309937165261794, 0.09068235985657008, 0.04291822404442501, -0.08690198249864338, -0.3475102149785367, 0.2906527004252718, 0.035508174257094016, 0.24906492469761304, 0.06774534483183375, 0.10336502957483545, 0.0013267545761945637, 0.04707636473274418, 0.051648932747175344, -0.09870476465891642, 0.1351114156939958, 0.26851714878539334, 0.17903105730416397, 0.30136377903353007, -0.4255670921233871, -0.18053791188136903, 0.14248209956599056, 0.11316668726240219, 0.08059007562947514, -0.04678037682195265, -0.23146437898470348, 0.09592917145881384, -0.09415882837858403, -0.0761620797814108, -0.10701047663155092, -0.03187334927001492, 0.019082670554731694, -0.34491229928651984, 0.05607440618217626, 0.11537445359550116, 0.012953008462428512, -0.059404097416546744, -0.14103577656863517, 0.046515153518422704, 0.04222428357706827, 0.06501261238635188, 0.07572626485802533, 0.10095898627675234, -0.0939396933543876, -0.16245525123785362, 0.3595838341632265, -0.07734366924806828, -0.2332226452135769, 0.1981414349056935, -0.14417682912027371, -0.14928007296875387, 0.13856320187132054, 0.2033125009856786, 0.18744782497897544, -0.1426305074637313, 0.11183229642043166, -0.0831310271792899, 0.15424173319518603, 0.06918678831020914, 0.03527712836786436, 0.06772967087702132, 0.13389988590528845, 0.17637745655562537, 0.13938119576465038, -0.017771648542721643, -0.13702863811582092, -0.29823804381533187, -0.11916414799738775, -0.20135327573498135, 0.011110951528023624, -0.1572133951693577, -0.16318401664645815, 0.33159384663914215, 0.11071646493189287, 0.2003318253328247, 0.17083891450047425, 0.31818313251412367, 0.09228371338075185, 0.07212246595119698, 0.1228517751635424, 0.23628833721028517, 0.06488606896859096, 0.03928422176944992, -0.19611968147681166, 0.09959136407755549, 0.07387311260044709] |
1,802.04624 | Silicon Optical Phased Array with High-Efficiency Beam Formation over
180 Degree Field of View | Chip-scale optical phased arrays could enable compact beam steering and LIDAR
for autonomous vehicles, precision robotics, and free-space optical
communications. Because these applications demand wide angle beam steering as
well as high optical power in the output beam, a natural design choice would be
to space the array emitters at a half-wavelength pitch, as is common in
radiofrequency phased arrays. Optical phased arrays, however, unlike RF phased
arrays, have been limited by the tradeoff between field of view (i.e. angle
steering) and beamforming efficiency (i.e. optical power in the output beam).
This tradeoff exists because optical phased arrays rely on waveguides as
emitters, which suffer from strong crosstalk when placed in close proximity
relative to their mode size. Here we overcome these limitations and demonstrate
a platform for optical phased arrays with 180{\deg} field of view, where more
than 72 percent of the power is carried in a single diffraction-limited beam
even when steered up to 60{\deg} off-axis. Our platform leverages high
index-contrast, dispersion-engineered waveguides spaced one half-wavelength
apart without incurring crosstalk.
| physics.app-ph physics.optics | chipscale optical phased arrays could enable compact beam steering and lidar for autonomous vehicles precision robotics and freespace optical communications because these applications demand wide angle beam steering as well as high optical power in the output beam a natural design choice would be to space the array emitters at a halfwavelength pitch as is common in radiofrequency phased arrays optical phased arrays however unlike rf phased arrays have been limited by the tradeoff between field of view ie angle steering and beamforming efficiency ie optical power in the output beam this tradeoff exists because optical phased arrays rely on waveguides as emitters which suffer from strong crosstalk when placed in close proximity relative to their mode size here we overcome these limitations and demonstrate a platform for optical phased arrays with 180deg field of view where more than 72 percent of the power is carried in a single diffractionlimited beam even when steered up to 60deg offaxis our platform leverages high indexcontrast dispersionengineered waveguides spaced one halfwavelength apart without incurring crosstalk | [['chipscale', 'optical', 'phased', 'arrays', 'could', 'enable', 'compact', 'beam', 'steering', 'and', 'lidar', 'for', 'autonomous', 'vehicles', 'precision', 'robotics', 'and', 'freespace', 'optical', 'communications', 'because', 'these', 'applications', 'demand', 'wide', 'angle', 'beam', 'steering', 'as', 'well', 'as', 'high', 'optical', 'power', 'in', 'the', 'output', 'beam', 'a', 'natural', 'design', 'choice', 'would', 'be', 'to', 'space', 'the', 'array', 'emitters', 'at', 'a', 'halfwavelength', 'pitch', 'as', 'is', 'common', 'in', 'radiofrequency', 'phased', 'arrays', 'optical', 'phased', 'arrays', 'however', 'unlike', 'rf', 'phased', 'arrays', 'have', 'been', 'limited', 'by', 'the', 'tradeoff', 'between', 'field', 'of', 'view', 'ie', 'angle', 'steering', 'and', 'beamforming', 'efficiency', 'ie', 'optical', 'power', 'in', 'the', 'output', 'beam', 'this', 'tradeoff', 'exists', 'because', 'optical', 'phased', 'arrays', 'rely', 'on', 'waveguides', 'as', 'emitters', 'which', 'suffer', 'from', 'strong', 'crosstalk', 'when', 'placed', 'in', 'close', 'proximity', 'relative', 'to', 'their', 'mode', 'size', 'here', 'we', 'overcome', 'these', 'limitations', 'and', 'demonstrate', 'a', 'platform', 'for', 'optical', 'phased', 'arrays', 'with', '180deg', 'field', 'of', 'view', 'where', 'more', 'than', '72', 'percent', 'of', 'the', 'power', 'is', 'carried', 'in', 'a', 'single', 'diffractionlimited', 'beam', 'even', 'when', 'steered', 'up', 'to', '60deg', 'offaxis', 'our', 'platform', 'leverages', 'high', 'indexcontrast', 'dispersionengineered', 'waveguides', 'spaced', 'one', 'halfwavelength', 'apart', 'without', 'incurring', 'crosstalk']] | [-0.18798300186591765, 0.13402423412040915, 0.04196889385266966, -0.04261927136834603, -0.09060499896457809, -0.2668484814930707, 0.04910293844701766, 0.5346407237960848, -0.24259400826900504, -0.3397407770849938, 0.11292882049713436, -0.2640253938463798, -0.09893306857516426, 0.29502390920005866, -0.08037665014853701, 0.11563444655824474, 0.0750953343637331, -0.09888979061885715, -0.03062892805982576, -0.11452677714107774, 0.17509641874105084, 0.10857041100470544, 0.38135355742117605, 0.0004840713782171004, 0.15004000408564108, 0.044858261949547194, 0.04815069600116721, -0.01219927163562483, -0.005850266191436974, 0.10668537047891986, 0.299686455427734, 0.084393996416407, 0.2537621851404046, -0.4469002734133324, -0.19310441778615378, 0.08932413457253904, 0.16834268161788757, 0.09126538903314382, -0.05043709507121685, -0.27003846122195596, 0.01855589068483908, -0.12232237618124156, -0.1323241408519057, -0.00555742216069078, -0.03275060446169444, 0.10782727028911955, -0.2513117856172801, -0.05780437069201028, -0.0043025231866628275, 0.11421478370226226, 0.04929250298300758, -0.08634814646279136, 0.032970795199426625, 0.07888156571865439, -0.0700697249402617, 0.04386082163478551, 0.14869088503033961, -0.11909540906564745, -0.1046283693285659, 0.3881669689056485, 0.0019807799425359198, -0.1726233895738111, 0.13500569351179914, -0.17413396421051042, -0.005113432294862388, 0.1770908795385134, 0.23844677252731514, 0.029301002800334677, -0.11490406438543835, -0.03265224963015075, 0.013510051172911623, 0.26979125047990576, 0.190711330024114, 0.16581654271414115, 0.31186153232878033, 0.20198693319472896, 0.1108556364481554, 0.16136406694584915, -0.1889388909421964, 0.00626950770979314, -0.18856829298703476, -0.09442788883800034, -0.20543293364743329, 0.05279940938398372, -0.06938422313582715, -0.1051559711729994, 0.32828498482812457, 0.13221060297977136, 0.10347342392332246, 0.02496809914077329, 0.40718791556888434, 0.05378600671484005, 0.13989931773962885, 0.0069560444816340545, 0.3379213998830596, 0.12524306748961206, 0.15789383768136506, -0.19656007854825666, -0.048091019782627566, -0.09745230419333852] |
1,802.04625 | Economic Impact of Discoverability of Localities and Addresses in India | Most of the earth's population has a poorly defined addressing system, thus
having a poorly discoverable residence, property or business locations on a
map. Easily discoverable addresses are important for improving their
livelihood, business-incomes, and even service delivery. The economic cycle
based on discoverable addresses is self-reinforcing: consumers independently
identify and adopt such addresses according to their own convenience and
businesses use algorithms or third-party services to resolve these addresses
into geocodes to help better identify their customers' locations.
Our paper analyses from the top two industries in India: Logistics and
Financial Services, indicate that the lack of a good addressing system costs
India $10-14B annually. As the Indian economy is expected to grow rapidly, the
businesses would proportionately grow, causing the total costs to grow further.
We, therefore, need to consider a dramatically new approach to modernize the
addressing systems to bring in efficiency.
| cs.CY | most of the earths population has a poorly defined addressing system thus having a poorly discoverable residence property or business locations on a map easily discoverable addresses are important for improving their livelihood businessincomes and even service delivery the economic cycle based on discoverable addresses is selfreinforcing consumers independently identify and adopt such addresses according to their own convenience and businesses use algorithms or thirdparty services to resolve these addresses into geocodes to help better identify their customers locations our paper analyses from the top two industries in india logistics and financial services indicate that the lack of a good addressing system costs india 1014b annually as the indian economy is expected to grow rapidly the businesses would proportionately grow causing the total costs to grow further we therefore need to consider a dramatically new approach to modernize the addressing systems to bring in efficiency | [['most', 'of', 'the', 'earths', 'population', 'has', 'a', 'poorly', 'defined', 'addressing', 'system', 'thus', 'having', 'a', 'poorly', 'discoverable', 'residence', 'property', 'or', 'business', 'locations', 'on', 'a', 'map', 'easily', 'discoverable', 'addresses', 'are', 'important', 'for', 'improving', 'their', 'livelihood', 'businessincomes', 'and', 'even', 'service', 'delivery', 'the', 'economic', 'cycle', 'based', 'on', 'discoverable', 'addresses', 'is', 'selfreinforcing', 'consumers', 'independently', 'identify', 'and', 'adopt', 'such', 'addresses', 'according', 'to', 'their', 'own', 'convenience', 'and', 'businesses', 'use', 'algorithms', 'or', 'thirdparty', 'services', 'to', 'resolve', 'these', 'addresses', 'into', 'geocodes', 'to', 'help', 'better', 'identify', 'their', 'customers', 'locations', 'our', 'paper', 'analyses', 'from', 'the', 'top', 'two', 'industries', 'in', 'india', 'logistics', 'and', 'financial', 'services', 'indicate', 'that', 'the', 'lack', 'of', 'a', 'good', 'addressing', 'system', 'costs', 'india', '1014b', 'annually', 'as', 'the', 'indian', 'economy', 'is', 'expected', 'to', 'grow', 'rapidly', 'the', 'businesses', 'would', 'proportionately', 'grow', 'causing', 'the', 'total', 'costs', 'to', 'grow', 'further', 'we', 'therefore', 'need', 'to', 'consider', 'a', 'dramatically', 'new', 'approach', 'to', 'modernize', 'the', 'addressing', 'systems', 'to', 'bring', 'in', 'efficiency']] | [-0.11802800389176066, 0.08345189262051265, -0.02108942456152681, 0.10491076571104879, -0.1274562430913215, -0.16082630838247966, 0.1342162409141152, 0.3700549839572473, -0.26410168608393314, -0.34553566098968674, 0.1645324403693626, -0.3129560636165975, -0.09807311127717783, 0.17348716065769534, -0.15959047280265004, 0.02167799735484137, 0.0587174829121653, -0.010384626732162245, 0.02896552993138516, -0.305622196438807, 0.2597552975379191, 0.07801339257153572, 0.31114235691648057, 0.08658054317315142, 0.03337723427367481, -0.021481755345903495, -0.09271648348556584, -0.04121801911221721, -0.06566447930247075, 0.16241286990682144, 0.34331598062511093, 0.23389689115664133, 0.3741804920006674, -0.467954740631622, -0.16871452047587274, 0.1280529428976816, 0.1709517709800153, 0.03888380296619518, 0.0034394689781267287, -0.27828827358365477, 0.08429345268580307, -0.2149656443039307, -0.14531196729390772, -0.07174713044952222, -0.019854195070798164, 0.03157915685967366, -0.21350868726214328, -0.006368729049808808, -0.00990385712951526, 0.0527519336917887, -0.04625553357857768, -0.12189660418511636, -0.03236212519362204, 0.2227524131749369, 0.12144095309883017, -0.028762314247188867, 0.19323467907749795, -0.15352571344367796, -0.1083565161545546, 0.41628572398184477, 0.0070862996821793225, -0.1436653544514121, 0.2190423064182962, -0.09864915723072273, -0.15596028462938077, 0.0676281859811682, 0.2678757928624437, 0.03736409508473389, -0.20691727333982196, 0.019620968237310858, 0.04832945818771849, 0.1753507481979115, 0.07755088965714603, 0.025830945963938753, 0.26749627798603576, 0.2171023503024053, 0.1449299025629367, 0.0810729981875503, 0.009174965009405896, -0.11230696907260462, -0.13289330596872767, -0.16360798819068742, -0.120076611418264, 0.03306572146427173, -0.041349636992827135, -0.1364765022881329, 0.373488906249925, 0.2099597083235329, 0.17106186550914904, 0.053627389250323176, 0.31886649845571785, 0.033670105625202854, 0.10878085173174765, 0.1195134731869285, 0.16581909282465132, -0.034421915416377825, 0.21197623802492252, -0.1442353134857608, 0.17875012263681714, -0.04409940684233773] |
1,802.04626 | Barista - a Graphical Tool for Designing and Training Deep Neural
Networks | In recent years, the importance of deep learning has significantly increased
in pattern recognition, computer vision, and artificial intelligence research,
as well as in industry. However, despite the existence of multiple deep
learning frameworks, there is a lack of comprehensible and easy-to-use
high-level tools for the design, training, and testing of deep neural networks
(DNNs). In this paper, we introduce Barista, an open-source graphical
high-level interface for the Caffe deep learning framework. While Caffe is one
of the most popular frameworks for training DNNs, editing prototext files in
order to specify the net architecture and hyper parameters can become a
cumbersome and error-prone task. Instead, Barista offers a fully graphical user
interface with a graph-based net topology editor and provides an end-to-end
training facility for DNNs, which allows researchers to focus on solving their
problems without having to write code, edit text files, or manually parse
logged data.
| cs.LG stat.ML | in recent years the importance of deep learning has significantly increased in pattern recognition computer vision and artificial intelligence research as well as in industry however despite the existence of multiple deep learning frameworks there is a lack of comprehensible and easytouse highlevel tools for the design training and testing of deep neural networks dnns in this paper we introduce barista an opensource graphical highlevel interface for the caffe deep learning framework while caffe is one of the most popular frameworks for training dnns editing prototext files in order to specify the net architecture and hyper parameters can become a cumbersome and errorprone task instead barista offers a fully graphical user interface with a graphbased net topology editor and provides an endtoend training facility for dnns which allows researchers to focus on solving their problems without having to write code edit text files or manually parse logged data | [['in', 'recent', 'years', 'the', 'importance', 'of', 'deep', 'learning', 'has', 'significantly', 'increased', 'in', 'pattern', 'recognition', 'computer', 'vision', 'and', 'artificial', 'intelligence', 'research', 'as', 'well', 'as', 'in', 'industry', 'however', 'despite', 'the', 'existence', 'of', 'multiple', 'deep', 'learning', 'frameworks', 'there', 'is', 'a', 'lack', 'of', 'comprehensible', 'and', 'easytouse', 'highlevel', 'tools', 'for', 'the', 'design', 'training', 'and', 'testing', 'of', 'deep', 'neural', 'networks', 'dnns', 'in', 'this', 'paper', 'we', 'introduce', 'barista', 'an', 'opensource', 'graphical', 'highlevel', 'interface', 'for', 'the', 'caffe', 'deep', 'learning', 'framework', 'while', 'caffe', 'is', 'one', 'of', 'the', 'most', 'popular', 'frameworks', 'for', 'training', 'dnns', 'editing', 'prototext', 'files', 'in', 'order', 'to', 'specify', 'the', 'net', 'architecture', 'and', 'hyper', 'parameters', 'can', 'become', 'a', 'cumbersome', 'and', 'errorprone', 'task', 'instead', 'barista', 'offers', 'a', 'fully', 'graphical', 'user', 'interface', 'with', 'a', 'graphbased', 'net', 'topology', 'editor', 'and', 'provides', 'an', 'endtoend', 'training', 'facility', 'for', 'dnns', 'which', 'allows', 'researchers', 'to', 'focus', 'on', 'solving', 'their', 'problems', 'without', 'having', 'to', 'write', 'code', 'edit', 'text', 'files', 'or', 'manually', 'parse', 'logged', 'data']] | [-0.0548880721702158, -0.03859234322634602, -0.054791996740184874, 0.08573170866402259, -0.1910566150584594, -0.2353325513299225, 0.00856060024547283, 0.47055677146742714, -0.2797206474735788, -0.38214519278456766, 0.05257642527069694, -0.25697777059959126, -0.1776781098134689, 0.1821090542033416, -0.13170232940275145, 0.11909355510574239, 0.15601256723534696, 0.02555034493989482, -0.043566178003021955, -0.277188448913294, 0.2721721823707375, 0.06383673126292953, 0.34842509589455767, 0.04683675820350039, 0.10032483568608279, 0.009521648174129604, -0.016355484581495425, -0.05871192242658767, -0.0414123560577555, 0.22055679923287738, 0.4110994386505716, 0.2904155597417001, 0.36742049851613184, -0.47498376061823094, -0.19899908565998484, 0.04419953707561251, 0.16334967956827562, 0.1134206358474825, -0.0607101344226283, -0.3198181433717207, 0.09755067561822785, -0.20507994511475167, 0.03221797443083709, -0.14784535861710327, 0.010232975199615874, -0.04720806796341298, -0.2743188164887481, -0.0712563853400449, 0.08063065487223038, 0.16437700533365107, 0.008446446598941448, -0.11337194518268513, 0.03603957518840171, 0.1756812433797714, 0.03370628685715805, 0.10384535188248166, 0.13017316173990162, -0.24079179651496715, -0.1322377719758015, 0.3614806110660235, -0.01608823424483947, -0.17517615097644582, 0.20602669587301814, 0.080813840069637, -0.1930760807566801, 0.06560770326553761, 0.2783765400170672, 0.07915058358553417, -0.21952050274276003, 0.08633464622251107, 0.02857088961172849, 0.1855326707278486, 0.03712709878292568, -0.043099611880397105, 0.2070913331022448, 0.29752528987869264, 0.0053809716993448685, 0.1461881240956536, -0.07200860233223509, -0.07483726309384314, -0.17669066175744, -0.1377781611343776, -0.16001104019015241, -0.04451708015779882, -0.09012072959373908, -0.20432716966638353, 0.36585031295841447, 0.211957493255257, 0.13637478234005623, 0.12750260741687475, 0.37665219773494063, -0.004102621865807241, 0.19139770603244555, 0.16285671141643243, 0.1290350435483808, -0.005367642696186596, 0.22107659543699706, -0.0893686715858754, 0.13566704198708568, 0.017141882314340395] |
1,802.04627 | Trade-offs Between Weak-Noise Estimation Performance and Outage
Exponents in Nonlinear Modulation | We focus on the problem of modulating a parameter onto a power-limited signal
transmitted over a discrete-time Gaussian channel and estimating this parameter
at the receiver. Considering the well-known threshold effect in non-linear
modulation systems, our approach is the following: instead of deriving upper
and lower bounds on the total estimation error, which weigh both weak-noise
errors and anomalous errors beyond the threshold, we separate the two kinds of
errors. In particular, we derive upper and lower bounds on the best achievable
trade-off between the exponential decay rate of the weak-noise expected error
cost and the exponential decay rate of the probability of the anomalous error
event, also referred to as the outage event. This outage event is left to be
defined as part of the communication system design problem. Our achievability
scheme, which is based on lattice codes, meets the lower bound at the high
signal-to-noise (SNR) limit and for a certain range of trade-offs between the
weak--noise error cost and the outage exponent.
| cs.IT math.IT | we focus on the problem of modulating a parameter onto a powerlimited signal transmitted over a discretetime gaussian channel and estimating this parameter at the receiver considering the wellknown threshold effect in nonlinear modulation systems our approach is the following instead of deriving upper and lower bounds on the total estimation error which weigh both weaknoise errors and anomalous errors beyond the threshold we separate the two kinds of errors in particular we derive upper and lower bounds on the best achievable tradeoff between the exponential decay rate of the weaknoise expected error cost and the exponential decay rate of the probability of the anomalous error event also referred to as the outage event this outage event is left to be defined as part of the communication system design problem our achievability scheme which is based on lattice codes meets the lower bound at the high signaltonoise snr limit and for a certain range of tradeoffs between the weaknoise error cost and the outage exponent | [['we', 'focus', 'on', 'the', 'problem', 'of', 'modulating', 'a', 'parameter', 'onto', 'a', 'powerlimited', 'signal', 'transmitted', 'over', 'a', 'discretetime', 'gaussian', 'channel', 'and', 'estimating', 'this', 'parameter', 'at', 'the', 'receiver', 'considering', 'the', 'wellknown', 'threshold', 'effect', 'in', 'nonlinear', 'modulation', 'systems', 'our', 'approach', 'is', 'the', 'following', 'instead', 'of', 'deriving', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'total', 'estimation', 'error', 'which', 'weigh', 'both', 'weaknoise', 'errors', 'and', 'anomalous', 'errors', 'beyond', 'the', 'threshold', 'we', 'separate', 'the', 'two', 'kinds', 'of', 'errors', 'in', 'particular', 'we', 'derive', 'upper', 'and', 'lower', 'bounds', 'on', 'the', 'best', 'achievable', 'tradeoff', 'between', 'the', 'exponential', 'decay', 'rate', 'of', 'the', 'weaknoise', 'expected', 'error', 'cost', 'and', 'the', 'exponential', 'decay', 'rate', 'of', 'the', 'probability', 'of', 'the', 'anomalous', 'error', 'event', 'also', 'referred', 'to', 'as', 'the', 'outage', 'event', 'this', 'outage', 'event', 'is', 'left', 'to', 'be', 'defined', 'as', 'part', 'of', 'the', 'communication', 'system', 'design', 'problem', 'our', 'achievability', 'scheme', 'which', 'is', 'based', 'on', 'lattice', 'codes', 'meets', 'the', 'lower', 'bound', 'at', 'the', 'high', 'signaltonoise', 'snr', 'limit', 'and', 'for', 'a', 'certain', 'range', 'of', 'tradeoffs', 'between', 'the', 'weaknoise', 'error', 'cost', 'and', 'the', 'outage', 'exponent']] | [-0.18805972699527487, 0.06077219632482438, -0.04813033553743453, 0.11008211989676718, -0.0111856395269349, -0.1687401771319635, 0.1788373620277553, 0.314353356990173, -0.24868725946765732, -0.3051755508915944, 0.13764752367313837, -0.24862990500687648, -0.14035816407113363, 0.22954225878576945, -0.08158211259905136, 0.10482251368688815, 0.0070997280569634206, 0.07670385943245933, -0.08453509565231136, -0.2678433267625444, 0.2788581719004662, 0.13938571463875246, 0.30648333718435783, 0.05206310513118903, 0.1132776454373291, -0.007729485406625, 0.01097161131840425, -0.07294434295459228, -0.18703149189946777, 0.0961645995407845, 0.22041026064843844, 0.12898392015221444, 0.2402659043556813, -0.3439573316058765, -0.2018534050351291, 0.12453068463188229, 0.1741270061525883, 0.09074981983232482, -0.0008208631707186049, -0.2785295047204603, 0.06820878901264885, -0.18109652347947386, -0.02002218800286452, 0.07218476506514532, -0.021361670044787003, 0.042751337297147876, -0.33043338439681313, 0.11344956608443295, 0.05635110081991915, 0.029925321860619906, -0.03811122801041964, -0.14607788720520948, 0.04236009744927287, 0.15177745757285843, 0.056731257674806385, -0.0006515824814524614, 0.11444926257668571, -0.10627133937439684, -0.0911247607094772, 0.3051414819152066, -0.07281808392920842, -0.23028824708925447, 0.11600409451427615, -0.15217989965934645, -0.07928500412257783, 0.1819411262305397, 0.25617350355552676, 0.05991981462998824, -0.12842310950385802, 0.06568633673225784, 0.02556071315017162, 0.17954165183685042, 0.07522143360763563, 0.13240398690104485, 0.11556247263638811, 0.18186852890631242, 0.1234124071388082, 0.1539521400583908, -0.14082696847899845, -0.1052778038930035, -0.3272409040050468, -0.1100340466738227, -0.2096706815967054, 0.003474932989444245, -0.14860940230384145, -0.1265765833278596, 0.35069025179702407, 0.14089597378342383, 0.18156180549977405, 0.1629824095462082, 0.3507121713775577, 0.2026730645518524, -0.025410204090065124, 0.10005976123564213, 0.2633107583574725, 0.11543282530072964, 0.018040272324684668, -0.25525441488363976, 0.11788108503502427, 0.07431005699644712] |
1,802.04628 | Numerical modelling of a peripheral arterial stenosis using
dimensionally reduced models and kernel methods | In this work, we consider two kinds of model reduction techniques to simulate
blood flow through the largest systemic arteries, where a stenosis is located
in a peripheral artery i.e. in an artery that is located far away from the
heart. For our simulations we place the stenosis in one of the tibial arteries
belonging to the right lower leg (right post tibial artery). The model
reduction techniques that are used are on the one hand dimensionally reduced
models (1-D and 0-D models, the so-called mixed-dimension model) and on the
other hand surrogate models produced by kernel methods. Both methods are
combined in such a way that the mixed-dimension models yield training data for
the surrogate model, where the surrogate model is parametrised by the degree of
narrowing of the peripheral stenosis. By means of a well-trained surrogate
model, we show that simulation data can be reproduced with a satisfactory
accuracy and that parameter optimisation or state estimation problems can be
solved in a very efficient way. Furthermore it is demonstrated that a surrogate
model enables us to present after a very short simulation time the impact of a
varying degree of stenosis on blood flow, obtaining a speedup of several orders
over the full model.
| math.NA cs.NA | in this work we consider two kinds of model reduction techniques to simulate blood flow through the largest systemic arteries where a stenosis is located in a peripheral artery ie in an artery that is located far away from the heart for our simulations we place the stenosis in one of the tibial arteries belonging to the right lower leg right post tibial artery the model reduction techniques that are used are on the one hand dimensionally reduced models 1d and 0d models the socalled mixeddimension model and on the other hand surrogate models produced by kernel methods both methods are combined in such a way that the mixeddimension models yield training data for the surrogate model where the surrogate model is parametrised by the degree of narrowing of the peripheral stenosis by means of a welltrained surrogate model we show that simulation data can be reproduced with a satisfactory accuracy and that parameter optimisation or state estimation problems can be solved in a very efficient way furthermore it is demonstrated that a surrogate model enables us to present after a very short simulation time the impact of a varying degree of stenosis on blood flow obtaining a speedup of several orders over the full model | [['in', 'this', 'work', 'we', 'consider', 'two', 'kinds', 'of', 'model', 'reduction', 'techniques', 'to', 'simulate', 'blood', 'flow', 'through', 'the', 'largest', 'systemic', 'arteries', 'where', 'a', 'stenosis', 'is', 'located', 'in', 'a', 'peripheral', 'artery', 'ie', 'in', 'an', 'artery', 'that', 'is', 'located', 'far', 'away', 'from', 'the', 'heart', 'for', 'our', 'simulations', 'we', 'place', 'the', 'stenosis', 'in', 'one', 'of', 'the', 'tibial', 'arteries', 'belonging', 'to', 'the', 'right', 'lower', 'leg', 'right', 'post', 'tibial', 'artery', 'the', 'model', 'reduction', 'techniques', 'that', 'are', 'used', 'are', 'on', 'the', 'one', 'hand', 'dimensionally', 'reduced', 'models', '1d', 'and', '0d', 'models', 'the', 'socalled', 'mixeddimension', 'model', 'and', 'on', 'the', 'other', 'hand', 'surrogate', 'models', 'produced', 'by', 'kernel', 'methods', 'both', 'methods', 'are', 'combined', 'in', 'such', 'a', 'way', 'that', 'the', 'mixeddimension', 'models', 'yield', 'training', 'data', 'for', 'the', 'surrogate', 'model', 'where', 'the', 'surrogate', 'model', 'is', 'parametrised', 'by', 'the', 'degree', 'of', 'narrowing', 'of', 'the', 'peripheral', 'stenosis', 'by', 'means', 'of', 'a', 'welltrained', 'surrogate', 'model', 'we', 'show', 'that', 'simulation', 'data', 'can', 'be', 'reproduced', 'with', 'a', 'satisfactory', 'accuracy', 'and', 'that', 'parameter', 'optimisation', 'or', 'state', 'estimation', 'problems', 'can', 'be', 'solved', 'in', 'a', 'very', 'efficient', 'way', 'furthermore', 'it', 'is', 'demonstrated', 'that', 'a', 'surrogate', 'model', 'enables', 'us', 'to', 'present', 'after', 'a', 'very', 'short', 'simulation', 'time', 'the', 'impact', 'of', 'a', 'varying', 'degree', 'of', 'stenosis', 'on', 'blood', 'flow', 'obtaining', 'a', 'speedup', 'of', 'several', 'orders', 'over', 'the', 'full', 'model']] | [-0.04323669505778596, 0.05038639878040661, -0.09261425760646974, 0.05480271961327497, -0.02819100201799019, -0.1501238109720238, 0.012183988803672125, 0.37602207101248564, -0.25173345097629984, -0.27767387820516254, 0.134241007007342, -0.28522137462080105, -0.14208018591907778, 0.24505163951962283, -0.069605229679581, 0.03907613246454417, 0.1116250632816781, 0.04032336986958257, -0.0341820648387617, -0.21392466455078638, 0.2633057893434702, 0.025218160884020832, 0.2685031716178343, 0.028076228505967964, 0.11265311438649062, -0.051294064490594767, 0.010904439984938329, 0.048084785741328906, -0.11099752577046301, 0.13200205042325322, 0.22275201072646542, 0.11089313230748532, 0.29580885104753657, -0.44845778502758993, -0.2578894116563126, 0.10720040520553667, 0.13979495667798209, 0.11771419812536356, -0.011829020626146745, -0.24621468533318744, 0.0917301469898412, -0.18433309547522317, -0.09701762658665951, -0.038493365435906264, -0.042727157653273236, -0.008009708011794148, -0.29889127061966786, 0.12443458730622209, 0.026344281397771216, 0.07924088643574455, -0.0550211231739631, -0.09329691132331647, -0.05484279096058742, 0.1294846465529702, 0.043539464408735226, 0.05496280260148992, 0.12598485946576157, -0.17025607272426516, -0.08930675191375273, 0.37607125452837176, -0.047121792439443685, -0.23691601888050587, 0.1961410279516854, -0.09860217776737239, -0.09455420870731757, 0.13096570709123484, 0.2069956606446971, 0.1209948338721924, -0.1511202372827576, 0.019366405756513418, -0.027284284443278045, 0.17526289506349713, 0.04443426717985964, -0.10112052913574339, 0.14713727542678418, 0.2249940953158674, 0.017526684212498367, 0.1421226286140013, -0.12382469985191032, -0.07635017804851195, -0.2571010543802048, -0.11197714714866891, -0.12311510808621216, -0.017601470067815685, -0.11038283880686137, -0.14424402093746078, 0.41164815356701756, 0.17340602294216384, 0.21634923202862727, 0.05079386998148798, 0.3181495980124523, 0.08250765123311882, 0.09309806009795227, 0.05945651088976889, 0.20372796826882886, 0.058864654753881605, 0.038379773671074216, -0.20009881019189918, 0.10589317113920613, 0.06643419929450034] |
1,802.04629 | On subgame perfect equilibria in quantum Stackelberg duopoly with
incompete information | The Li-Du-Massar quantum duopoly model is one of the generally accepted
quantum game schemes. It has applications in a wide range of duopoly problems.
Our purpose is to study Stackelberg's duopoly with incomplete information in
the quantum domain. The result of Lo and Kiang has shown that the correlation
of players' quantities caused by the quantum entanglement enhances the
first-mover advantage in the game. Our work demonstrates that there is no
first-mover advantage if the players' actions are maximally correlated.
Furthermore, we proved that the second mover gains a higher equilibrium payoff
that the first one.
| quant-ph | the lidumassar quantum duopoly model is one of the generally accepted quantum game schemes it has applications in a wide range of duopoly problems our purpose is to study stackelbergs duopoly with incomplete information in the quantum domain the result of lo and kiang has shown that the correlation of players quantities caused by the quantum entanglement enhances the firstmover advantage in the game our work demonstrates that there is no firstmover advantage if the players actions are maximally correlated furthermore we proved that the second mover gains a higher equilibrium payoff that the first one | [['the', 'lidumassar', 'quantum', 'duopoly', 'model', 'is', 'one', 'of', 'the', 'generally', 'accepted', 'quantum', 'game', 'schemes', 'it', 'has', 'applications', 'in', 'a', 'wide', 'range', 'of', 'duopoly', 'problems', 'our', 'purpose', 'is', 'to', 'study', 'stackelbergs', 'duopoly', 'with', 'incomplete', 'information', 'in', 'the', 'quantum', 'domain', 'the', 'result', 'of', 'lo', 'and', 'kiang', 'has', 'shown', 'that', 'the', 'correlation', 'of', 'players', 'quantities', 'caused', 'by', 'the', 'quantum', 'entanglement', 'enhances', 'the', 'firstmover', 'advantage', 'in', 'the', 'game', 'our', 'work', 'demonstrates', 'that', 'there', 'is', 'no', 'firstmover', 'advantage', 'if', 'the', 'players', 'actions', 'are', 'maximally', 'correlated', 'furthermore', 'we', 'proved', 'that', 'the', 'second', 'mover', 'gains', 'a', 'higher', 'equilibrium', 'payoff', 'that', 'the', 'first', 'one']] | [-0.12193899538833648, 0.08965158979898613, -0.13748994662769531, 0.07797652395613687, -0.009714274971108687, -0.16109322594282657, 0.040722636552527544, 0.36226379333161995, -0.24511649592436457, -0.2391606044220297, 0.06539807296235506, -0.2928625084361748, -0.19196270431980098, 0.17218851348826367, -0.1175358428766853, 0.014511266144874848, 0.07272993531078101, 0.0477943876317065, 0.010326088646328764, -0.32178837163864, 0.3275214840363907, 0.029184290475064985, 0.28601274075672817, 0.0849427009540561, 0.11952431687202893, 0.01680436784303502, 0.017082319212587255, 0.05270447936889373, -0.10920257869476796, 0.08940253103838156, 0.2800798697397113, 0.13753801317591416, 0.37572884532917095, -0.35474948853646454, -0.21457574493986994, 0.1539295768120179, 0.07223780958570147, 0.13143978301239642, -0.029806907275250476, -0.2584152973796192, 0.08738195932421246, -0.21656927601679377, -0.06687124377410662, -0.04246380611714956, 0.003677855887891431, -0.03865161657970595, -0.282066891156137, 0.02397612286241431, 0.08859395500468581, 0.02123664942030844, -0.004528069960590648, -0.09500637471577839, -0.015655318858396067, 0.18132609573045844, 0.02939928523142283, 0.004205059755201403, 0.09393279116698786, -0.1473749468544204, -0.211180547457556, 0.4047783001571109, -0.04076601803841952, -0.1770761625743226, 0.15084448397943848, -0.15363415621564183, -0.10555510708179913, 0.09924944697045966, 0.07235210328117797, 0.11021813459841437, -0.11409359509615521, 0.08833478572962218, -0.06771546350301881, 0.20162563336228853, 0.025678677597132167, 0.07816404993768389, 0.14307670892755453, 0.13024866665762505, 0.13947819042950868, 0.13693968685785016, -0.0015317803634771782, -0.24377888245201718, -0.25829886608806096, -0.1616661564005833, -0.21921958833148605, 0.02113262885495236, -0.0876074637971071, -0.10715587460772918, 0.3671925887857613, 0.17066810898678866, 0.07761114185774012, 0.039488781910193595, 0.30907029895798155, 0.121673462365901, 0.037849792583208336, 0.07120174296494378, 0.26318863474175724, 0.11237062539562191, 0.12406035500921701, -0.22809108670978612, 0.11636917713147245, 0.023798356452760728] |
1,802.0463 | A probabilistic framework for multi-view feature learning with
many-to-many associations via neural networks | A simple framework Probabilistic Multi-view Graph Embedding (PMvGE) is
proposed for multi-view feature learning with many-to-many associations so that
it generalizes various existing multi-view methods. PMvGE is a probabilistic
model for predicting new associations via graph embedding of the nodes of data
vectors with links of their associations. Multi-view data vectors with
many-to-many associations are transformed by neural networks to feature vectors
in a shared space, and the probability of new association between two data
vectors is modeled by the inner product of their feature vectors. While
existing multi-view feature learning techniques can treat only either of
many-to-many association or non-linear transformation, PMvGE can treat both
simultaneously. By combining Mercer's theorem and the universal approximation
theorem, we prove that PMvGE learns a wide class of similarity measures across
views. Our likelihood-based estimator enables efficient computation of
non-linear transformations of data vectors in large-scale datasets by minibatch
SGD, and numerical experiments illustrate that PMvGE outperforms existing
multi-view methods.
| stat.ML | a simple framework probabilistic multiview graph embedding pmvge is proposed for multiview feature learning with manytomany associations so that it generalizes various existing multiview methods pmvge is a probabilistic model for predicting new associations via graph embedding of the nodes of data vectors with links of their associations multiview data vectors with manytomany associations are transformed by neural networks to feature vectors in a shared space and the probability of new association between two data vectors is modeled by the inner product of their feature vectors while existing multiview feature learning techniques can treat only either of manytomany association or nonlinear transformation pmvge can treat both simultaneously by combining mercers theorem and the universal approximation theorem we prove that pmvge learns a wide class of similarity measures across views our likelihoodbased estimator enables efficient computation of nonlinear transformations of data vectors in largescale datasets by minibatch sgd and numerical experiments illustrate that pmvge outperforms existing multiview methods | [['a', 'simple', 'framework', 'probabilistic', 'multiview', 'graph', 'embedding', 'pmvge', 'is', 'proposed', 'for', 'multiview', 'feature', 'learning', 'with', 'manytomany', 'associations', 'so', 'that', 'it', 'generalizes', 'various', 'existing', 'multiview', 'methods', 'pmvge', 'is', 'a', 'probabilistic', 'model', 'for', 'predicting', 'new', 'associations', 'via', 'graph', 'embedding', 'of', 'the', 'nodes', 'of', 'data', 'vectors', 'with', 'links', 'of', 'their', 'associations', 'multiview', 'data', 'vectors', 'with', 'manytomany', 'associations', 'are', 'transformed', 'by', 'neural', 'networks', 'to', 'feature', 'vectors', 'in', 'a', 'shared', 'space', 'and', 'the', 'probability', 'of', 'new', 'association', 'between', 'two', 'data', 'vectors', 'is', 'modeled', 'by', 'the', 'inner', 'product', 'of', 'their', 'feature', 'vectors', 'while', 'existing', 'multiview', 'feature', 'learning', 'techniques', 'can', 'treat', 'only', 'either', 'of', 'manytomany', 'association', 'or', 'nonlinear', 'transformation', 'pmvge', 'can', 'treat', 'both', 'simultaneously', 'by', 'combining', 'mercers', 'theorem', 'and', 'the', 'universal', 'approximation', 'theorem', 'we', 'prove', 'that', 'pmvge', 'learns', 'a', 'wide', 'class', 'of', 'similarity', 'measures', 'across', 'views', 'our', 'likelihoodbased', 'estimator', 'enables', 'efficient', 'computation', 'of', 'nonlinear', 'transformations', 'of', 'data', 'vectors', 'in', 'largescale', 'datasets', 'by', 'minibatch', 'sgd', 'and', 'numerical', 'experiments', 'illustrate', 'that', 'pmvge', 'outperforms', 'existing', 'multiview', 'methods']] | [-0.07760483354543614, -0.00979303242045508, -0.08069982767627118, 0.09081069722246664, -0.1406143335951789, -0.20978410586723642, 0.06585072648895395, 0.45877675849730803, -0.3481403980967678, -0.2934846932092195, 0.03432737335349154, -0.2836514645427388, -0.19462376381092628, 0.15540491486158056, -0.11237271749662905, 0.08755676861804952, 0.15239292895124787, 0.02317383918009556, -0.09266267324928312, -0.24365724014173185, 0.3410095039689854, 0.0011153279085922394, 0.36224358729946954, -0.05287236580921776, 0.1672572471812415, 0.04108867218872164, -0.10593950086507567, 0.013815110545067092, -0.019169065003106476, 0.2242772103091524, 0.36194797213764707, 0.26712107826113274, 0.30151066052353687, -0.36387995351699126, -0.26186091588679583, 0.11455381830418661, 0.13934387707234522, 0.06804660256222783, -0.013625605748135858, -0.34588857690928276, 0.07089191388077797, -0.14675251705049994, 0.025753247723647742, -0.17550301872294657, -0.044098581869606, 0.00843051050983927, -0.3433616211471759, 0.08499146079959975, 0.0824306526867922, 0.04388101077430947, -0.05073088754241349, -0.10175599755161698, 0.011447474663739039, 0.10692585508967899, 0.025154088265677783, 0.046805882976971754, 0.09386860667045709, -0.1337821859789265, -0.20337985488615787, 0.33027427124191716, -0.041968408236458046, -0.242021675209758, 0.21129189163986237, -0.010743093621994184, -0.1637276941228207, 0.0961573809788675, 0.21158890492448904, 0.11337470424592874, -0.19193268134584948, 0.056941848318314975, -0.11526737753361178, 0.1178818585649192, 0.041257234279861214, 0.0049562885182773235, 0.14766014538776534, 0.17852045612552078, 0.046107268902609584, 0.12947355089916782, -0.13381161240291348, -0.0873701336532594, -0.19322914067821897, -0.10215360427773587, -0.21903485246595872, -0.0726935089281078, -0.20833572555768265, -0.12140749897333278, 0.3671511302058508, 0.1585922491778234, 0.22974026335438916, 0.12663978439215184, 0.330725504473967, 0.014567373436875641, 0.1169341373847572, 0.13371921900161512, 0.13571896022156024, 0.07936116265263526, 0.060362694667842075, -0.10959025272568629, 0.08870073628558475, 0.11057979113475722] |
1,802.04631 | The HARPS search for southern extra-solar planets. XLIII. A compact
system of four super-Earth planets orbiting HD 215152 | We report the discovery of four super-Earth planets around HD 215152, with
orbital periods of 5.76, 7.28, 10.86, and 25.2 d, and minimum masses of 1.8,
1.7, 2.8, and 2.9 M_Earth respectively. This discovery is based on 373
high-quality radial velocity measurements taken by HARPS over 13 years. Given
the low masses of the planets, the signal-to-noise ratio is not sufficient to
constrain the planet eccentricities. However, a preliminary dynamical analysis
suggests that eccentricities should be typically lower than about 0.03 for the
system to remain stable. With two pairs of planets with a period ratio lower
than 1.5, with short orbital periods, low masses, and low eccentricities, HD
215152 is similar to the very compact multi-planet systems found by Kepler,
which is very rare in radial-velocity surveys. This discovery proves that these
systems can be reached with the radial-velocity technique, but characterizing
them requires a huge amount of observations.
| astro-ph.EP | we report the discovery of four superearth planets around hd 215152 with orbital periods of 576 728 1086 and 252 d and minimum masses of 18 17 28 and 29 m_earth respectively this discovery is based on 373 highquality radial velocity measurements taken by harps over 13 years given the low masses of the planets the signaltonoise ratio is not sufficient to constrain the planet eccentricities however a preliminary dynamical analysis suggests that eccentricities should be typically lower than about 003 for the system to remain stable with two pairs of planets with a period ratio lower than 15 with short orbital periods low masses and low eccentricities hd 215152 is similar to the very compact multiplanet systems found by kepler which is very rare in radialvelocity surveys this discovery proves that these systems can be reached with the radialvelocity technique but characterizing them requires a huge amount of observations | [['we', 'report', 'the', 'discovery', 'of', 'four', 'superearth', 'planets', 'around', 'hd', '215152', 'with', 'orbital', 'periods', 'of', '576', '728', '1086', 'and', '252', 'd', 'and', 'minimum', 'masses', 'of', '18', '17', '28', 'and', '29', 'm_earth', 'respectively', 'this', 'discovery', 'is', 'based', 'on', '373', 'highquality', 'radial', 'velocity', 'measurements', 'taken', 'by', 'harps', 'over', '13', 'years', 'given', 'the', 'low', 'masses', 'of', 'the', 'planets', 'the', 'signaltonoise', 'ratio', 'is', 'not', 'sufficient', 'to', 'constrain', 'the', 'planet', 'eccentricities', 'however', 'a', 'preliminary', 'dynamical', 'analysis', 'suggests', 'that', 'eccentricities', 'should', 'be', 'typically', 'lower', 'than', 'about', '003', 'for', 'the', 'system', 'to', 'remain', 'stable', 'with', 'two', 'pairs', 'of', 'planets', 'with', 'a', 'period', 'ratio', 'lower', 'than', '15', 'with', 'short', 'orbital', 'periods', 'low', 'masses', 'and', 'low', 'eccentricities', 'hd', '215152', 'is', 'similar', 'to', 'the', 'very', 'compact', 'multiplanet', 'systems', 'found', 'by', 'kepler', 'which', 'is', 'very', 'rare', 'in', 'radialvelocity', 'surveys', 'this', 'discovery', 'proves', 'that', 'these', 'systems', 'can', 'be', 'reached', 'with', 'the', 'radialvelocity', 'technique', 'but', 'characterizing', 'them', 'requires', 'a', 'huge', 'amount', 'of', 'observations']] | [-0.17809777766799656, 0.19349551967477324, -0.05661875908766445, 0.032842904047700704, -0.08777387200923939, -0.11715052906829687, 0.12176953195720105, 0.3264907214057481, -0.12775424797075322, -0.4260479213065795, 0.1193893781565822, -0.2837198042783515, -0.03647137000351339, 0.2503239713700463, -0.09290473933671475, 0.05485631085970011, 0.183462371679992, -0.031233748158351896, -0.0686890509906162, -0.31672645937903104, 0.2063627638570914, 0.05163528020116123, 0.07307865017571964, -0.016928781075654802, 0.03990131352298163, -0.0659278360607631, -0.024644899455165, -0.07518568453756538, -0.1616062630048357, 0.07643486658186727, 0.22650222724611946, 0.10549723470860438, 0.22211320059550171, -0.2809456802363432, -0.14853925083612873, 0.07105100553205891, 0.1569560760606298, 0.04553389484047059, 0.0006366883384101596, -0.2541591662259118, 0.16803192367955785, -0.19516016749312748, -0.1460913035521485, -0.023341856501222513, 0.14020307849450792, -0.008986068899626058, -0.26796446610682617, 0.11910855895021578, 0.01723068701067933, 0.18445521593644484, -0.1501542317596063, -0.2099973883667042, -0.05355645777544359, 0.03201010234093898, 0.016580196418421896, 0.04692137346451951, 0.07909025618101696, -0.028122284311197093, -0.034049825736548044, 0.4115242016111576, -0.1283152762973898, -0.04366805236409041, 0.2714546396966545, -0.2547054507146665, -0.142951321253251, 0.18055782586059257, 0.18733150885452995, 0.1502149921741236, -0.1919283963286796, -0.058873534028935935, 0.0030749755883211823, 0.27557774804960433, 0.10233493875460448, 0.07879112583169764, 0.37208275693292553, 0.14400556522446709, 0.07333875742954882, 0.003828250540332315, -0.23593399158975492, -0.028409325328932422, -0.13061657359483778, -0.0938464602296409, -0.15644842996796895, 0.07603394383860743, -0.10950691216724384, -0.059875777305884136, 0.33539298653045696, 0.12710900843218975, 0.24889578188870204, 0.07102603626333655, 0.261902093405936, 0.10317291249088452, 0.10440453795161227, 0.11309369007830282, 0.34961696481332183, 0.1438804326006337, 0.1126357849531593, -0.19961283142313463, 0.07650319026858621, -0.0488820949827346] |
1,802.04632 | Hierarchical Overlap Graph | Given a set of finite words, the Overlap Graph (OG) is a complete weighted
digraph where each word is a node and where the weight of an arc equals the
length of the longest overlap of one word onto the other (Overlap is an
asymmetric notion). The OG serves to assemble DNA fragments or to compute
shortest superstrings which are a compressed representation of the input. The
OG requires a space is quadratic in the number of words, which limits its
scalability. The Hierarchical Overlap Graph (HOG) is an alternative graph that
also encodes all maximal overlaps, but uses a space that is linear in the sum
of the lengths of the input words. We propose the first algorithm to build the
HOG in linear space for words of equal length.
| cs.DS | given a set of finite words the overlap graph og is a complete weighted digraph where each word is a node and where the weight of an arc equals the length of the longest overlap of one word onto the other overlap is an asymmetric notion the og serves to assemble dna fragments or to compute shortest superstrings which are a compressed representation of the input the og requires a space is quadratic in the number of words which limits its scalability the hierarchical overlap graph hog is an alternative graph that also encodes all maximal overlaps but uses a space that is linear in the sum of the lengths of the input words we propose the first algorithm to build the hog in linear space for words of equal length | [['given', 'a', 'set', 'of', 'finite', 'words', 'the', 'overlap', 'graph', 'og', 'is', 'a', 'complete', 'weighted', 'digraph', 'where', 'each', 'word', 'is', 'a', 'node', 'and', 'where', 'the', 'weight', 'of', 'an', 'arc', 'equals', 'the', 'length', 'of', 'the', 'longest', 'overlap', 'of', 'one', 'word', 'onto', 'the', 'other', 'overlap', 'is', 'an', 'asymmetric', 'notion', 'the', 'og', 'serves', 'to', 'assemble', 'dna', 'fragments', 'or', 'to', 'compute', 'shortest', 'superstrings', 'which', 'are', 'a', 'compressed', 'representation', 'of', 'the', 'input', 'the', 'og', 'requires', 'a', 'space', 'is', 'quadratic', 'in', 'the', 'number', 'of', 'words', 'which', 'limits', 'its', 'scalability', 'the', 'hierarchical', 'overlap', 'graph', 'hog', 'is', 'an', 'alternative', 'graph', 'that', 'also', 'encodes', 'all', 'maximal', 'overlaps', 'but', 'uses', 'a', 'space', 'that', 'is', 'linear', 'in', 'the', 'sum', 'of', 'the', 'lengths', 'of', 'the', 'input', 'words', 'we', 'propose', 'the', 'first', 'algorithm', 'to', 'build', 'the', 'hog', 'in', 'linear', 'space', 'for', 'words', 'of', 'equal', 'length']] | [-0.1464708622576996, 0.13758830306640532, -0.053873401874576815, 0.06549216638930597, -0.14561661160444372, -0.07603516292097118, 0.037728812040775335, 0.3892406304686807, -0.34110755091604156, -0.23430744663790892, 0.051467138649149306, -0.2983913167116751, -0.10945463633584214, 0.11459969625388848, -0.07580406431336212, 0.0026356972818874277, 0.0854153589828505, 0.1838146299550324, -0.08043045797278635, -0.247394014896162, 0.2967072256879867, 0.020735944852318246, 0.24122322196645649, -0.017614012600530565, 0.13457018183544278, 0.036750864461490895, -0.039562922326549316, 0.011828905077453858, -0.10966543860092336, 0.16409749156646147, 0.25909431877311406, 0.17782090660468994, 0.2574700829608522, -0.3587668984346376, -0.1555258466041014, 0.15177025549639842, 0.13915298848931912, 0.10053867417856881, 0.04944173367836207, -0.21316874106876724, 0.11410242124755675, -0.14839595591805818, -0.04339747558497177, 0.035073678206496, 0.08429200549873005, 0.019492157038215916, -0.2671447692453179, -0.009956912022263509, 0.10251818551994746, 0.005425650718842299, 0.00837696875260702, -0.11529370360360801, -0.014537577026786696, 0.1379407494851452, -0.03857235129538725, 0.09384017060190894, 0.07367437267107249, -0.11728912396427557, -0.1412787693019473, 0.40514621334790274, -0.052801474680029256, -0.22500611899975148, 0.1279232574747662, -0.08554224870416499, -0.10308304834286221, 0.14355257842760846, 0.12403165914815005, 0.08487693834978774, -0.09304451708546804, 0.11412046358961513, -0.12702942987235674, 0.20730328214006455, 0.1299805755527932, 0.052325937086503016, 0.19722324643170333, 0.20058447650797268, 0.11910774689238832, 0.1799550501577279, -0.09475503048596491, -0.04290179407978537, -0.28993115821881715, -0.1734793562093707, -0.24210657018062637, -0.045048862893866615, -0.15276810369009547, -0.2497883706232746, 0.43190126742755297, 0.0896958507995569, 0.2566585333996545, 0.1238661872592705, 0.27648923713500606, 0.08870157948617365, 0.11021171681909957, 0.11542931838913728, 0.09177969033005186, 0.10087934461109455, -0.014886915669527673, -0.2040664941029808, 0.06590707525757554, 0.15820104042281405] |
1,802.04633 | Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks
by Backdooring | Deep Neural Networks have recently gained lots of success after enabling
several breakthroughs in notoriously challenging problems. Training these
networks is computationally expensive and requires vast amounts of training
data. Selling such pre-trained models can, therefore, be a lucrative business
model. Unfortunately, once the models are sold they can be easily copied and
redistributed. To avoid this, a tracking mechanism to identify models as the
intellectual property of a particular vendor is necessary.
In this work, we present an approach for watermarking Deep Neural Networks in
a black-box way. Our scheme works for general classification tasks and can
easily be combined with current learning algorithms. We show experimentally
that such a watermark has no noticeable impact on the primary task that the
model is designed for and evaluate the robustness of our proposal against a
multitude of practical attacks. Moreover, we provide a theoretical analysis,
relating our approach to previous work on backdooring.
| cs.LG | deep neural networks have recently gained lots of success after enabling several breakthroughs in notoriously challenging problems training these networks is computationally expensive and requires vast amounts of training data selling such pretrained models can therefore be a lucrative business model unfortunately once the models are sold they can be easily copied and redistributed to avoid this a tracking mechanism to identify models as the intellectual property of a particular vendor is necessary in this work we present an approach for watermarking deep neural networks in a blackbox way our scheme works for general classification tasks and can easily be combined with current learning algorithms we show experimentally that such a watermark has no noticeable impact on the primary task that the model is designed for and evaluate the robustness of our proposal against a multitude of practical attacks moreover we provide a theoretical analysis relating our approach to previous work on backdooring | [['deep', 'neural', 'networks', 'have', 'recently', 'gained', 'lots', 'of', 'success', 'after', 'enabling', 'several', 'breakthroughs', 'in', 'notoriously', 'challenging', 'problems', 'training', 'these', 'networks', 'is', 'computationally', 'expensive', 'and', 'requires', 'vast', 'amounts', 'of', 'training', 'data', 'selling', 'such', 'pretrained', 'models', 'can', 'therefore', 'be', 'a', 'lucrative', 'business', 'model', 'unfortunately', 'once', 'the', 'models', 'are', 'sold', 'they', 'can', 'be', 'easily', 'copied', 'and', 'redistributed', 'to', 'avoid', 'this', 'a', 'tracking', 'mechanism', 'to', 'identify', 'models', 'as', 'the', 'intellectual', 'property', 'of', 'a', 'particular', 'vendor', 'is', 'necessary', 'in', 'this', 'work', 'we', 'present', 'an', 'approach', 'for', 'watermarking', 'deep', 'neural', 'networks', 'in', 'a', 'blackbox', 'way', 'our', 'scheme', 'works', 'for', 'general', 'classification', 'tasks', 'and', 'can', 'easily', 'be', 'combined', 'with', 'current', 'learning', 'algorithms', 'we', 'show', 'experimentally', 'that', 'such', 'a', 'watermark', 'has', 'no', 'noticeable', 'impact', 'on', 'the', 'primary', 'task', 'that', 'the', 'model', 'is', 'designed', 'for', 'and', 'evaluate', 'the', 'robustness', 'of', 'our', 'proposal', 'against', 'a', 'multitude', 'of', 'practical', 'attacks', 'moreover', 'we', 'provide', 'a', 'theoretical', 'analysis', 'relating', 'our', 'approach', 'to', 'previous', 'work', 'on', 'backdooring']] | [-0.055447336820897794, 0.009531216387346686, -0.0897075883970645, 0.07185198321071527, -0.1138875546656843, -0.2011839415798405, 0.05666581051704461, 0.45656454573556976, -0.2543051586621196, -0.32782792909021835, 0.11341236782103997, -0.2339197400050532, -0.2092175478219839, 0.24117544873335742, -0.1561991480228148, 0.11484840435227134, 0.13668849040895062, -0.0012201297341610036, -0.023193385498751395, -0.32779913939731686, 0.28206093529986803, 0.06154805863096906, 0.3321648602018525, 0.08430131951861672, 0.07477752946847192, -0.06551172900799429, -0.01291166025360948, 0.0027923266262453246, -0.04724015273802108, 0.1639260242778906, 0.3203142453997699, 0.21553153969273953, 0.3610892777674292, -0.45673591191390234, -0.25897790733755466, 0.15346724315742521, 0.16174052600859126, 0.1580155612594497, -0.06424233744741957, -0.30124645614016216, 0.115914413546163, -0.2143929466225305, -0.015682106905028616, -0.19348254176714508, -0.018146968633549188, -0.03713813216707326, -0.27040597297156255, -0.014950893001361308, 0.06356915435753763, 0.03347082263299901, -0.006568465913388584, -0.08649025163169044, 0.017870137472575726, 0.15113092639397732, 0.053519735308854205, 0.04191795046713914, 0.11674003519721354, -0.17769519954196622, -0.14707880462044973, 0.37607247605429667, -0.01162469978628092, -0.2031133137428888, 0.2014990561353778, 0.02002054655244329, -0.18668190622395886, 0.08835372026691116, 0.23154735405267657, 0.12404679874950823, -0.18493311408383306, 0.03009509923408347, -0.050210163542559666, 0.1722946191133049, 0.008849608368779483, 0.010920896217469004, 0.2089419319282139, 0.25120872062382804, 0.036765688168280145, 0.13337093028377767, -0.07693768076684424, -0.06987651745179105, -0.20740152960781033, -0.11486487957575407, -0.1972523913259226, 0.0173212519201977, -0.052056931243752935, -0.1247647775790507, 0.3840753894451633, 0.23709347869551398, 0.2006067853224905, 0.09036636846997824, 0.38456291836490364, 0.05240804667578471, 0.14960492673746653, 0.08327542185916652, 0.21969409296319722, 0.008430897730010512, 0.1363928832824489, -0.112375634063746, 0.14958272338078946, -0.005789779858835237] |
1,802.04634 | Lattice Functions for the Analysis of Analog-to-Digital Conversion | Analog-to-digital (A/D) converters are the common interface between analog
signals and the domain of digital discrete-time signal processing. In essence,
this domain simultaneously incorporates quantization both in amplitude and
time, i.e. amplitude quantization and uniform time sampling. Thus, we view A/D
conversion as a sampling process in both the time and amplitude domains based
on the observation that the underlying continuous-time signals representing
digital sequences can be sampled in a lattice---i.e. at points restricted to
lie on a uniform grid both in time and amplitude. We refer to them as lattice
functions. This is in contrast with the traditional approach based on the
classical sampling theorem and quantization error analysis. The latter has been
mainly addressed with the help of probabilistic models, or deterministic ones
either confined to very particular scenarios or considering worst-case
assumptions. In this paper, we provide a deterministic theoretical analysis and
framework for the functions involved in digital discrete-time processing. We
show that lattice functions possess a rich analytic structure in the context of
integral-valued entire functions of exponential type. We derive set and
spectral properties of this class of functions. This allows us to prove in a
deterministic way and for general bandlimited functions a fundamental lower
bound on the maximum frequency component introduced by quantization that is
independent of the resolution of the quantizer.
| eess.SP cs.IT math.CV math.IT | analogtodigital ad converters are the common interface between analog signals and the domain of digital discretetime signal processing in essence this domain simultaneously incorporates quantization both in amplitude and time ie amplitude quantization and uniform time sampling thus we view ad conversion as a sampling process in both the time and amplitude domains based on the observation that the underlying continuoustime signals representing digital sequences can be sampled in a latticeie at points restricted to lie on a uniform grid both in time and amplitude we refer to them as lattice functions this is in contrast with the traditional approach based on the classical sampling theorem and quantization error analysis the latter has been mainly addressed with the help of probabilistic models or deterministic ones either confined to very particular scenarios or considering worstcase assumptions in this paper we provide a deterministic theoretical analysis and framework for the functions involved in digital discretetime processing we show that lattice functions possess a rich analytic structure in the context of integralvalued entire functions of exponential type we derive set and spectral properties of this class of functions this allows us to prove in a deterministic way and for general bandlimited functions a fundamental lower bound on the maximum frequency component introduced by quantization that is independent of the resolution of the quantizer | [['analogtodigital', 'ad', 'converters', 'are', 'the', 'common', 'interface', 'between', 'analog', 'signals', 'and', 'the', 'domain', 'of', 'digital', 'discretetime', 'signal', 'processing', 'in', 'essence', 'this', 'domain', 'simultaneously', 'incorporates', 'quantization', 'both', 'in', 'amplitude', 'and', 'time', 'ie', 'amplitude', 'quantization', 'and', 'uniform', 'time', 'sampling', 'thus', 'we', 'view', 'ad', 'conversion', 'as', 'a', 'sampling', 'process', 'in', 'both', 'the', 'time', 'and', 'amplitude', 'domains', 'based', 'on', 'the', 'observation', 'that', 'the', 'underlying', 'continuoustime', 'signals', 'representing', 'digital', 'sequences', 'can', 'be', 'sampled', 'in', 'a', 'latticeie', 'at', 'points', 'restricted', 'to', 'lie', 'on', 'a', 'uniform', 'grid', 'both', 'in', 'time', 'and', 'amplitude', 'we', 'refer', 'to', 'them', 'as', 'lattice', 'functions', 'this', 'is', 'in', 'contrast', 'with', 'the', 'traditional', 'approach', 'based', 'on', 'the', 'classical', 'sampling', 'theorem', 'and', 'quantization', 'error', 'analysis', 'the', 'latter', 'has', 'been', 'mainly', 'addressed', 'with', 'the', 'help', 'of', 'probabilistic', 'models', 'or', 'deterministic', 'ones', 'either', 'confined', 'to', 'very', 'particular', 'scenarios', 'or', 'considering', 'worstcase', 'assumptions', 'in', 'this', 'paper', 'we', 'provide', 'a', 'deterministic', 'theoretical', 'analysis', 'and', 'framework', 'for', 'the', 'functions', 'involved', 'in', 'digital', 'discretetime', 'processing', 'we', 'show', 'that', 'lattice', 'functions', 'possess', 'a', 'rich', 'analytic', 'structure', 'in', 'the', 'context', 'of', 'integralvalued', 'entire', 'functions', 'of', 'exponential', 'type', 'we', 'derive', 'set', 'and', 'spectral', 'properties', 'of', 'this', 'class', 'of', 'functions', 'this', 'allows', 'us', 'to', 'prove', 'in', 'a', 'deterministic', 'way', 'and', 'for', 'general', 'bandlimited', 'functions', 'a', 'fundamental', 'lower', 'bound', 'on', 'the', 'maximum', 'frequency', 'component', 'introduced', 'by', 'quantization', 'that', 'is', 'independent', 'of', 'the', 'resolution', 'of', 'the', 'quantizer']] | [-0.1253974082705365, 0.06996504678369657, -0.09324846262022955, 0.06777312235745951, -0.0838583920461436, -0.1133332911870319, 0.09950407186457165, 0.39491090226863174, -0.28121578660538443, -0.26512434073090213, 0.1414942354794175, -0.19840203371165016, -0.17195745091247436, 0.19895062428504678, -0.09312011399912354, 0.06391582926777808, 0.031673098537968854, 0.018673481450646852, -0.06982027457657028, -0.19671354577111158, 0.28227101584426534, 0.04016604585802718, 0.31240685234807397, -0.02865225356497449, 0.10646491994460423, 0.04442047926099741, -0.05279076878687358, -0.021092948832306755, -0.11262918703975533, 0.10678944362914317, 0.24934761058486327, 0.12471294092605413, 0.26122584075828564, -0.42073315206370804, -0.22198543505271107, 0.13688320699721984, 0.14571326458029296, 0.10294965914021072, -0.04899096239962058, -0.2512073121650238, 0.09280509398994993, -0.11589588974411152, -0.06301042284937702, -0.04675301544785023, -0.014681969476665994, 0.051221138419217715, -0.2934537950988761, 0.07600804871228868, 0.08981792121853459, 0.04646878141578134, -0.04574442615325363, -0.09966808288160406, 0.03843732218079473, 0.10865169108662431, -0.011627706569501467, 0.031004094633541694, 0.07600847890039217, -0.09573949718572514, -0.13479430833406167, 0.35035875877237893, -0.055089967011699464, -0.2513923134875896, 0.17981489546614016, -0.14288210135046817, -0.13015643134208174, 0.10675109272873769, 0.20617596085234355, 0.09564157969479929, -0.15081117281102316, 0.11570247182953193, -0.0013002946539080306, 0.1820565584321936, 0.07814870933474777, 0.08870942258625823, 0.16865928863737623, 0.16557712001049865, 0.06944595236484319, 0.14613344232694217, -0.07408689884519414, -0.13645463310007738, -0.2898922747859017, -0.113017741010788, -0.1984937862922612, 0.031322898998108084, -0.09041619767294293, -0.1834917598649579, 0.410379326217659, 0.1314304218780075, 0.19199403435986948, 0.09302509339424232, 0.32956478541151335, 0.16127895971088507, 0.05143784614307508, 0.05773077290206823, 0.17657198695403195, 0.12160242330942082, 0.11114791388406534, -0.15632928960391035, 0.043559286473361464, 0.06467989238072612] |
1,802.04635 | Electrostatics of Two-Dimensional Lateral Junctions | The increasing technological control of two-dimensional materials has allowed
the demonstration of 2D lateral junctions, which display unique properties that
might serve as the basis for a new generation of 2D electronic and
optoelectronic devices. Notably, the chemically doped MoS$_2$ homojunction, the
WSe$_2$-MoS$_2$ monolayer and MoS$_2$ monolayer/multilayer heterojunctions,
have been demonstrated. Here we report the investigation of 2D lateral junction
electrostatics, which differs from the bulk case because of the weaker
screening, producing a much longer transition region between the space charge
region and the quasi-neutral region, making inappropriate the use of the
complete-depletion approximation. For such a purpose we have developed a method
based on the conformal mapping technique to solve the 2D electrostatics, which
is widely applicable to every kind of junctions, giving accurate results for
even large asymmetric charge distribution scenarios.
| cond-mat.mes-hall | the increasing technological control of twodimensional materials has allowed the demonstration of 2d lateral junctions which display unique properties that might serve as the basis for a new generation of 2d electronic and optoelectronic devices notably the chemically doped mos_2 homojunction the wse_2mos_2 monolayer and mos_2 monolayermultilayer heterojunctions have been demonstrated here we report the investigation of 2d lateral junction electrostatics which differs from the bulk case because of the weaker screening producing a much longer transition region between the space charge region and the quasineutral region making inappropriate the use of the completedepletion approximation for such a purpose we have developed a method based on the conformal mapping technique to solve the 2d electrostatics which is widely applicable to every kind of junctions giving accurate results for even large asymmetric charge distribution scenarios | [['the', 'increasing', 'technological', 'control', 'of', 'twodimensional', 'materials', 'has', 'allowed', 'the', 'demonstration', 'of', '2d', 'lateral', 'junctions', 'which', 'display', 'unique', 'properties', 'that', 'might', 'serve', 'as', 'the', 'basis', 'for', 'a', 'new', 'generation', 'of', '2d', 'electronic', 'and', 'optoelectronic', 'devices', 'notably', 'the', 'chemically', 'doped', 'mos_2', 'homojunction', 'the', 'wse_2mos_2', 'monolayer', 'and', 'mos_2', 'monolayermultilayer', 'heterojunctions', 'have', 'been', 'demonstrated', 'here', 'we', 'report', 'the', 'investigation', 'of', '2d', 'lateral', 'junction', 'electrostatics', 'which', 'differs', 'from', 'the', 'bulk', 'case', 'because', 'of', 'the', 'weaker', 'screening', 'producing', 'a', 'much', 'longer', 'transition', 'region', 'between', 'the', 'space', 'charge', 'region', 'and', 'the', 'quasineutral', 'region', 'making', 'inappropriate', 'the', 'use', 'of', 'the', 'completedepletion', 'approximation', 'for', 'such', 'a', 'purpose', 'we', 'have', 'developed', 'a', 'method', 'based', 'on', 'the', 'conformal', 'mapping', 'technique', 'to', 'solve', 'the', '2d', 'electrostatics', 'which', 'is', 'widely', 'applicable', 'to', 'every', 'kind', 'of', 'junctions', 'giving', 'accurate', 'results', 'for', 'even', 'large', 'asymmetric', 'charge', 'distribution', 'scenarios']] | [-0.1126802260070249, 0.06697433483151888, -0.041495522618237315, 0.020353840331980875, -0.05293815697994873, -0.18683414413791263, 0.03788831985245148, 0.39251647226399544, -0.217705125511698, -0.2914326207881624, 0.030165365057076666, -0.2614644729976796, -0.1756374722621827, 0.24190088054412184, 0.027850147961241117, 0.05697653257415037, 0.0025524873327054647, -0.08524967542722482, -0.09250855790609917, -0.13452226090047395, 0.26850983953442087, 0.031843974445523185, 0.3698460844056116, 0.09588882859768064, 0.06370941453937892, -0.009233321853433594, 0.06168030004129943, 0.046077051326750676, -0.15841796652751905, 0.1225311751830194, 0.23593167422134712, -0.06274721468269656, 0.26367982511521515, -0.475160033275174, -0.2640111292077398, 0.033525081778255604, 0.15873556630685925, 0.1705965351350394, -0.11973030436484171, -0.2642010696475733, 0.07304525484285092, -0.13607402448939288, -0.11685148922708433, -0.05933819399003617, 0.01928872383855791, 0.007434389642157564, -0.25463264296713256, 0.045821272637553964, 0.038358302882195196, 0.030497208505756025, -0.0608583554943228, -0.12656137723410432, -0.04976503020434669, 0.12335177297548701, 0.010518177361298127, 0.018289928398603064, 0.18515349580169035, -0.13560455189100606, -0.07908258066427978, 0.3988145080564374, -0.008400746875188568, -0.1543416330700204, 0.19977432839346654, -0.1662777732390995, -0.08448543804380196, 0.13179959264710883, 0.12499845637692929, 0.16139629090233057, -0.1583483218229517, 0.07795784619829095, -0.038834984745886744, 0.14409438016468124, 0.04985322137222146, 0.10142310054542383, 0.245525062084198, 0.22712208190227323, 0.057851246752155326, 0.15073385000560488, -0.13990345071105173, -0.04831213499137172, -0.21150127022922266, -0.22272672574112992, -0.2065361080211446, 0.07156982890922915, -0.054693159915063225, -0.23179957430075968, 0.4193071133852231, 0.16942758814581216, 0.12635543215032102, -0.03346568328825841, 0.2562754857018731, 0.11115699442664416, 0.12430586987818859, -0.003974049955352463, 0.2578827008273396, 0.12915212424669528, 0.13521683400860196, -0.1946097708935144, 0.08621189959707078, 0.028631382571223763] |
1,802.04636 | Modeling of Facial Aging and Kinship: A Survey | Computational facial models that capture properties of facial cues related to
aging and kinship increasingly attract the attention of the research community,
enabling the development of reliable methods for age progression, age
estimation, age-invariant facial characterization, and kinship verification
from visual data. In this paper, we review recent advances in modeling of
facial aging and kinship. In particular, we provide an up-to date, complete
list of available annotated datasets and an in-depth analysis of geometric,
hand-crafted, and learned facial representations that are used for facial aging
and kinship characterization. Moreover, evaluation protocols and metrics are
reviewed and notable experimental results for each surveyed task are analyzed.
This survey allows us to identify challenges and discuss future research
directions for the development of robust facial models in real-world
conditions.
| cs.CV | computational facial models that capture properties of facial cues related to aging and kinship increasingly attract the attention of the research community enabling the development of reliable methods for age progression age estimation ageinvariant facial characterization and kinship verification from visual data in this paper we review recent advances in modeling of facial aging and kinship in particular we provide an upto date complete list of available annotated datasets and an indepth analysis of geometric handcrafted and learned facial representations that are used for facial aging and kinship characterization moreover evaluation protocols and metrics are reviewed and notable experimental results for each surveyed task are analyzed this survey allows us to identify challenges and discuss future research directions for the development of robust facial models in realworld conditions | [['computational', 'facial', 'models', 'that', 'capture', 'properties', 'of', 'facial', 'cues', 'related', 'to', 'aging', 'and', 'kinship', 'increasingly', 'attract', 'the', 'attention', 'of', 'the', 'research', 'community', 'enabling', 'the', 'development', 'of', 'reliable', 'methods', 'for', 'age', 'progression', 'age', 'estimation', 'ageinvariant', 'facial', 'characterization', 'and', 'kinship', 'verification', 'from', 'visual', 'data', 'in', 'this', 'paper', 'we', 'review', 'recent', 'advances', 'in', 'modeling', 'of', 'facial', 'aging', 'and', 'kinship', 'in', 'particular', 'we', 'provide', 'an', 'upto', 'date', 'complete', 'list', 'of', 'available', 'annotated', 'datasets', 'and', 'an', 'indepth', 'analysis', 'of', 'geometric', 'handcrafted', 'and', 'learned', 'facial', 'representations', 'that', 'are', 'used', 'for', 'facial', 'aging', 'and', 'kinship', 'characterization', 'moreover', 'evaluation', 'protocols', 'and', 'metrics', 'are', 'reviewed', 'and', 'notable', 'experimental', 'results', 'for', 'each', 'surveyed', 'task', 'are', 'analyzed', 'this', 'survey', 'allows', 'us', 'to', 'identify', 'challenges', 'and', 'discuss', 'future', 'research', 'directions', 'for', 'the', 'development', 'of', 'robust', 'facial', 'models', 'in', 'realworld', 'conditions']] | [-0.05199521999644834, -0.040588661956584345, -0.060127959608679685, 0.030699980541455053, -0.12191134416424912, -0.16964115534623073, -0.012191715649343793, 0.4659603805405887, -0.1897401654520842, -0.31250764211038434, 0.1222692913317129, -0.3157595762210453, -0.22138388145817664, 0.22771085505410443, -0.18938840683971303, 0.10146531865264721, 0.14074597895644078, 0.03978880888468029, -0.05634814290596561, -0.27168105410661286, 0.2643648848509577, 0.030141539818526606, 0.31723858196083016, 0.10888015327876155, 0.07302308131804998, -0.03560218550301501, -0.14583073555873194, -0.01745261306192462, -0.15466293226595232, 0.2515390241283953, 0.38681318542231874, 0.2560192417595389, 0.2818527558990791, -0.42169790318983746, -0.17606729489575162, 0.03977024193402145, 0.1466617729408505, 0.10557994216886316, -0.07447401627047559, -0.36030932050014985, 0.04613035878920048, -0.14499767903443866, -0.024111057380507662, -0.18294562090657593, 0.08942846961202115, -0.043321146065090584, -0.24439637429597896, 0.038940712893895044, 0.07696339606094783, 0.22805571272294586, -0.10120025732211665, -0.1559184176300095, 0.040035863978949586, 0.27613876873304644, 0.09862837083197719, 0.0029204076478683105, 0.14679211763093086, -0.2111527871805258, -0.14894834000573265, 0.35534513680132357, 0.024296889448259758, -0.14662249011581574, 0.21925957582700323, -0.05728736578112864, -0.21797516143433457, 0.07152005973341692, 0.26568218732003385, 0.11163178997436964, -0.21924850907851393, -0.024731047052292402, -0.013698538263327457, 0.15953919622134125, 0.0334962380675995, 0.04705480071459347, 0.21302678537239708, 0.2192208337997211, -0.014093061227087431, 0.1191855960976567, -0.1244865498894195, -0.05150359416541856, -0.21908211337923122, -0.12424547377035139, -0.11555391472881645, -0.05220019318416392, -0.10974110935630889, -0.1584691104513967, 0.44034494597494134, 0.257608106139842, 0.16875936131554062, 0.09410283044090598, 0.29656466363569883, -0.031118424893925186, 0.08991911125692033, 0.02691110200202826, 0.16022620722651482, 0.03650377457594778, 0.11753591359042981, -0.1890670257770845, 0.13861759818492705, 0.015722436909233844] |
1,802.04637 | Field theoretic model for the Josephson effect | The Josephson effect is found to stem from the quantum behavior of massive
photons existing in a superconducting medium. Accordingly, the Josephson
coupling energy is found to be equal to the rest mass energy of these photons.
The Josephson effect is described by propagation of massive photon field
following the universal quantum equation instead of being due to quantum
tunnelling. The mass of the photon is found to be dependent on the electric
properties of the junction. A characteristic (critical) quantized capacitance
of the junction is found to be inversely related to the critical current. The
quantum (kinetic) inductance induced in the junction is found to be equal to
$L_q=\mu_0\lambda_J$\,, where $\lambda_J$ is the Josephson penetration depth,
and $\mu_0$ is the free space permeability.
| physics.gen-ph | the josephson effect is found to stem from the quantum behavior of massive photons existing in a superconducting medium accordingly the josephson coupling energy is found to be equal to the rest mass energy of these photons the josephson effect is described by propagation of massive photon field following the universal quantum equation instead of being due to quantum tunnelling the mass of the photon is found to be dependent on the electric properties of the junction a characteristic critical quantized capacitance of the junction is found to be inversely related to the critical current the quantum kinetic inductance induced in the junction is found to be equal to l_qmu_0lambda_j where lambda_j is the josephson penetration depth and mu_0 is the free space permeability | [['the', 'josephson', 'effect', 'is', 'found', 'to', 'stem', 'from', 'the', 'quantum', 'behavior', 'of', 'massive', 'photons', 'existing', 'in', 'a', 'superconducting', 'medium', 'accordingly', 'the', 'josephson', 'coupling', 'energy', 'is', 'found', 'to', 'be', 'equal', 'to', 'the', 'rest', 'mass', 'energy', 'of', 'these', 'photons', 'the', 'josephson', 'effect', 'is', 'described', 'by', 'propagation', 'of', 'massive', 'photon', 'field', 'following', 'the', 'universal', 'quantum', 'equation', 'instead', 'of', 'being', 'due', 'to', 'quantum', 'tunnelling', 'the', 'mass', 'of', 'the', 'photon', 'is', 'found', 'to', 'be', 'dependent', 'on', 'the', 'electric', 'properties', 'of', 'the', 'junction', 'a', 'characteristic', 'critical', 'quantized', 'capacitance', 'of', 'the', 'junction', 'is', 'found', 'to', 'be', 'inversely', 'related', 'to', 'the', 'critical', 'current', 'the', 'quantum', 'kinetic', 'inductance', 'induced', 'in', 'the', 'junction', 'is', 'found', 'to', 'be', 'equal', 'to', 'l_qmu_0lambda_j', 'where', 'lambda_j', 'is', 'the', 'josephson', 'penetration', 'depth', 'and', 'mu_0', 'is', 'the', 'free', 'space', 'permeability']] | [-0.19122025395205955, 0.24036640975230594, -0.03420630755372406, 0.03752221850057443, -0.06312556801045813, -0.14225049051872599, 0.0058176785450034995, 0.3091568790860777, -0.2525451033398872, -0.3010820356932113, -0.024354121789745078, -0.31088903572834364, -0.057634634374663596, 0.21633453907944808, -0.007345206505520557, 0.031051153650249894, -0.04649068905812938, 0.07262955414419009, -0.020802821593010813, -0.1971365770256919, 0.33823110790908095, 0.052065220229872845, 0.34520968164854904, 0.10272574074929808, 0.07000963954345846, -0.08714874308533603, 0.07057770378688895, 0.048581230946072584, -0.13315531388076582, 0.02914177840651293, 0.21362855586760898, -0.04522077911495557, 0.18867613736358357, -0.433412473133909, -0.1812588126262332, 0.09064500771152477, 0.1621162280122318, 0.11751099783412325, 0.03908080905505524, -0.2777145241152465, 0.06181057615251076, -0.12229973791598729, -0.10940787184423184, 0.034865269763016606, 0.03350852900544348, 0.013135231991593794, -0.2471583439340073, 0.09097131489344486, -0.015507678251440933, -0.009046233993599086, 0.001527929580126836, -0.053792886692004625, -0.04035145150709564, 0.0565223861935291, 0.049448676286189534, 0.06099952216926447, 0.2010775308571453, -0.1595599176248581, -0.06079271617080501, 0.34448192947036854, -0.03465858452699745, -0.17236997571781398, 0.11133189017437702, -0.16026766862927527, 0.015803175330979795, 0.14656944589204784, 0.08716032939879753, 0.05654052534042214, -0.18520455222910012, 0.0882209816761717, 0.028257943296093282, 0.1824509999572822, 0.05448007201245887, 0.0914699569329377, 0.2683399918231719, 0.18069217166280357, 0.03701552916772482, 0.13937174913102413, -0.11218498381256027, -0.09405492225707304, -0.28499964081371826, -0.18941056645074025, -0.24382475707528553, 0.1448489824230442, -0.05304657518321826, -0.2053743103079922, 0.3856716230246655, 0.19365442474561978, 0.17108843208298208, -0.0302783322967286, 0.3139979050956606, 0.2563230672063745, 0.11668166794390153, 0.03355532193298989, 0.2843539731395317, 0.2141443363833809, 0.12075607061037809, -0.3335874860669009, 0.03243436589761357, -0.003456386851101387] |
1,802.04638 | Quantum purification spectroscopy | We discuss a protocol based on quenching a purified quantum system that
allows to capture bulk spectral features. It uses an infinite temperature
initial state and an interferometric strategy to access the Loschmidt
amplitude, from which the spectral features are retrieved via Fourier
transform, providing coarse-grained approximation at finite times. It involves
techniques available in current experimental setups for quantum simulation, at
least for small systems. We illustrate possible applications in testing the
eigenstate thermalization hypothesis and the physics of many-body localization.
| quant-ph cond-mat.str-el | we discuss a protocol based on quenching a purified quantum system that allows to capture bulk spectral features it uses an infinite temperature initial state and an interferometric strategy to access the loschmidt amplitude from which the spectral features are retrieved via fourier transform providing coarsegrained approximation at finite times it involves techniques available in current experimental setups for quantum simulation at least for small systems we illustrate possible applications in testing the eigenstate thermalization hypothesis and the physics of manybody localization | [['we', 'discuss', 'a', 'protocol', 'based', 'on', 'quenching', 'a', 'purified', 'quantum', 'system', 'that', 'allows', 'to', 'capture', 'bulk', 'spectral', 'features', 'it', 'uses', 'an', 'infinite', 'temperature', 'initial', 'state', 'and', 'an', 'interferometric', 'strategy', 'to', 'access', 'the', 'loschmidt', 'amplitude', 'from', 'which', 'the', 'spectral', 'features', 'are', 'retrieved', 'via', 'fourier', 'transform', 'providing', 'coarsegrained', 'approximation', 'at', 'finite', 'times', 'it', 'involves', 'techniques', 'available', 'in', 'current', 'experimental', 'setups', 'for', 'quantum', 'simulation', 'at', 'least', 'for', 'small', 'systems', 'we', 'illustrate', 'possible', 'applications', 'in', 'testing', 'the', 'eigenstate', 'thermalization', 'hypothesis', 'and', 'the', 'physics', 'of', 'manybody', 'localization']] | [-0.1030764282260817, 0.13943149615398598, -0.16736680297635315, 0.08232914199257588, 0.0021949014271518625, -0.18870584006852856, 0.03938969579048273, 0.37019657120449334, -0.25820076219146937, -0.24946651366970887, 0.0894716451222804, -0.26539290731892745, -0.09745827618497992, 0.23945160219218672, 0.004287749915043029, 0.13337428570815885, 0.08754851783784788, 0.024274949049690693, -0.08228312240041816, -0.21434325218291544, 0.2760050435346074, 0.06714847409336759, 0.3112485202983385, 0.059275472110773365, 0.09711819678181555, 0.042191164377826926, 0.0016207388920209756, -0.054258859841289316, -0.12362754675774429, 0.06830367886052444, 0.26453385706536653, 0.15391633390994153, 0.22845904668793082, -0.441194253746511, -0.2120501056608812, 0.048504167981729726, 0.14571326138826496, 0.16666242090002747, -0.03541569221656906, -0.30185176430996963, 0.04442428811112555, -0.16942742885453854, -0.12437366354619948, -0.12828768799422172, -0.009180988821132881, -0.04559548885175368, -0.29475066543942907, 0.08346156183652943, 0.0005759479983414455, 0.0568199202009454, -0.038544634494095724, -0.06157545723083497, 0.07053225309156426, 0.10962268452035127, -0.03755693850902522, -0.032192192640916516, 0.1544514393445286, -0.1099934328443984, -0.1332264360631021, 0.3438542222649586, -0.045687525592767064, -0.14548060893103842, 0.23865671585620632, -0.10593839402015252, -0.1300115908961743, 0.13126381761508016, 0.1180117804806952, 0.10065001847290593, -0.12317248837022883, 0.0734154417665062, 0.02380120766735295, 0.22134670113190646, 0.035930602408082386, 0.10385847870805641, 0.210447025757919, 0.174160983799616, 0.05998307501715494, 0.14435905180644334, -0.11958820736546796, -0.12976228594055922, -0.31082590914717534, -0.1325796359082366, -0.2680127901683857, 0.06900309677031345, -0.06596888879437579, -0.13778990224321805, 0.40841795703986794, 0.19331215188849898, 0.1605418741748464, 0.029136412508683505, 0.32058004062713646, 0.1139510757426118, 0.04888332252981278, 0.05402151544055924, 0.1668704242811811, 0.12096405901559969, 0.11342988664670507, -0.27222492214485366, 0.034524888038726116, 0.06853563884250456] |
1,802.04639 | Cosmological bounds on neutrino statistics | We consider the phenomenological implications of the violation of the Pauli
exclusion principle for neutrinos, focusing on cosmological observables such as
the spectrum of Cosmic Microwave Background anisotropies, Baryon Acoustic
Oscillations and the primordial abundances of light elements. Neutrinos that
behave (at least partly) as bosonic particles have a modified equilibrium
distribution function that implies a different influence on the evolution of
the Universe that, in the case of massive neutrinos, can not be simply
parametrized by a change in the effective number of neutrinos. Our results show
that, despite the precision of the available cosmological data, only very weak
bounds can be obtained on neutrino statistics, disfavouring a more bosonic
behaviour at less than $2\sigma$.
| astro-ph.CO hep-ph | we consider the phenomenological implications of the violation of the pauli exclusion principle for neutrinos focusing on cosmological observables such as the spectrum of cosmic microwave background anisotropies baryon acoustic oscillations and the primordial abundances of light elements neutrinos that behave at least partly as bosonic particles have a modified equilibrium distribution function that implies a different influence on the evolution of the universe that in the case of massive neutrinos can not be simply parametrized by a change in the effective number of neutrinos our results show that despite the precision of the available cosmological data only very weak bounds can be obtained on neutrino statistics disfavouring a more bosonic behaviour at less than 2sigma | [['we', 'consider', 'the', 'phenomenological', 'implications', 'of', 'the', 'violation', 'of', 'the', 'pauli', 'exclusion', 'principle', 'for', 'neutrinos', 'focusing', 'on', 'cosmological', 'observables', 'such', 'as', 'the', 'spectrum', 'of', 'cosmic', 'microwave', 'background', 'anisotropies', 'baryon', 'acoustic', 'oscillations', 'and', 'the', 'primordial', 'abundances', 'of', 'light', 'elements', 'neutrinos', 'that', 'behave', 'at', 'least', 'partly', 'as', 'bosonic', 'particles', 'have', 'a', 'modified', 'equilibrium', 'distribution', 'function', 'that', 'implies', 'a', 'different', 'influence', 'on', 'the', 'evolution', 'of', 'the', 'universe', 'that', 'in', 'the', 'case', 'of', 'massive', 'neutrinos', 'can', 'not', 'be', 'simply', 'parametrized', 'by', 'a', 'change', 'in', 'the', 'effective', 'number', 'of', 'neutrinos', 'our', 'results', 'show', 'that', 'despite', 'the', 'precision', 'of', 'the', 'available', 'cosmological', 'data', 'only', 'very', 'weak', 'bounds', 'can', 'be', 'obtained', 'on', 'neutrino', 'statistics', 'disfavouring', 'a', 'more', 'bosonic', 'behaviour', 'at', 'less', 'than', '2sigma']] | [-0.12152400742794772, 0.24994984331364134, -0.07339293384474926, 0.15506556040029332, -0.06519801123469168, -0.09973504940240548, 0.031521336721449064, 0.2731001680186982, -0.1889503505000652, -0.3112204649549877, 0.040202044622956554, -0.30991378021908217, -0.032193132868871606, 0.21931425682750755, 0.040545956492584585, -0.025430242294156604, 0.05932549990970513, 0.031022754883200956, -0.056350177980895186, -0.2690551635600498, 0.3285679551170625, 0.11829492607121837, 0.24925632412336637, 0.028252162264081938, 0.08176841516677964, -0.0524709663486333, -0.03334779553677373, 0.029093647478068054, -0.08240199138464081, 0.040193315930584256, 0.1693138753029855, 0.13750654430899384, 0.1537477102548141, -0.42241667570738956, -0.27486169682253664, 0.1834447601215978, 0.17504851113134745, 0.14617055126241055, -0.0749031051383444, -0.2860279211369022, 0.039659151440116995, -0.16926874566405756, -0.13703034668438266, -0.017511603075224137, -0.044695943304947736, -0.0137838047752478, -0.24272911068341085, 0.13713846044842723, -0.0006123576072397931, 0.014272376838750366, -0.023941661160969144, -0.1472246044532171, -0.02524807967510524, 0.05252061487809787, 0.09299073924996955, -0.04904887277295749, 0.1495630051358603, -0.15585868846191542, -0.07590306800356585, 0.43594108069122867, -0.15748811730021584, -0.17200156523653404, 0.13616695880472404, -0.20469201977990953, -0.17682204632377574, 0.09230744524192515, 0.16058407388306384, 0.07613735245380165, -0.16897987928000632, 0.1135784778859394, -0.04557924751385019, 0.16253912387062505, 0.07657012167077608, 0.08288788640116952, 0.3073366435389195, 0.14546898534071856, 0.08218183334824501, 0.013983276865348733, -0.06949023376339404, -0.00517069918488891, -0.3481890691508507, -0.08221453482813025, -0.2014943681866059, 0.09841341468024345, -0.1385641341529945, -0.1424905585540571, 0.3758334593590477, 0.13781143740975652, 0.20483046091675502, 0.045361156856384255, 0.27301642429565304, 0.07832293655895949, 0.03349903286113564, 0.04765802241283758, 0.33064171676684556, 0.13963884127663512, 0.09514628652611683, -0.25785417547288897, 0.04302611985597117, 0.016776964228985638] |
1,802.0464 | Quantum effects in amplitude death of coupled anharmonic
self-oscillators | Coupling two or more self-oscillating systems may stabilize their
zero-amplitude rest-state, therefore quenching their oscillation. This
phenomenon is termed "amplitude death". Well-known and studied in classical
self-oscillators, amplitude death was only recently investigated in quantum
self-oscillators [Ishibashi et al., Phys. Rev. E 96, 052210]. Quantitative
differences between the classical and quantum descriptions were found. Here, we
demonstrate that for quantum self-oscillators with anharmonicity in their
energy spectrum, multiple resonances in the mean phonon number can be observed.
This is a result of the discrete energy spectrum of these oscillators, and is
not present in the corresponding classical model. Experiments can be realized
with current technology and would demonstrate these genuine quantum effects in
the amplitude death phenomenon.
| quant-ph cond-mat.mes-hall | coupling two or more selfoscillating systems may stabilize their zeroamplitude reststate therefore quenching their oscillation this phenomenon is termed amplitude death wellknown and studied in classical selfoscillators amplitude death was only recently investigated in quantum selfoscillators ishibashi et al phys rev e 96 052210 quantitative differences between the classical and quantum descriptions were found here we demonstrate that for quantum selfoscillators with anharmonicity in their energy spectrum multiple resonances in the mean phonon number can be observed this is a result of the discrete energy spectrum of these oscillators and is not present in the corresponding classical model experiments can be realized with current technology and would demonstrate these genuine quantum effects in the amplitude death phenomenon | [['coupling', 'two', 'or', 'more', 'selfoscillating', 'systems', 'may', 'stabilize', 'their', 'zeroamplitude', 'reststate', 'therefore', 'quenching', 'their', 'oscillation', 'this', 'phenomenon', 'is', 'termed', 'amplitude', 'death', 'wellknown', 'and', 'studied', 'in', 'classical', 'selfoscillators', 'amplitude', 'death', 'was', 'only', 'recently', 'investigated', 'in', 'quantum', 'selfoscillators', 'ishibashi', 'et', 'al', 'phys', 'rev', 'e', '96', '052210', 'quantitative', 'differences', 'between', 'the', 'classical', 'and', 'quantum', 'descriptions', 'were', 'found', 'here', 'we', 'demonstrate', 'that', 'for', 'quantum', 'selfoscillators', 'with', 'anharmonicity', 'in', 'their', 'energy', 'spectrum', 'multiple', 'resonances', 'in', 'the', 'mean', 'phonon', 'number', 'can', 'be', 'observed', 'this', 'is', 'a', 'result', 'of', 'the', 'discrete', 'energy', 'spectrum', 'of', 'these', 'oscillators', 'and', 'is', 'not', 'present', 'in', 'the', 'corresponding', 'classical', 'model', 'experiments', 'can', 'be', 'realized', 'with', 'current', 'technology', 'and', 'would', 'demonstrate', 'these', 'genuine', 'quantum', 'effects', 'in', 'the', 'amplitude', 'death', 'phenomenon']] | [-0.14577100406016183, 0.22332187974521808, -0.060353021236622464, 0.05582803982289751, -0.03505756660141861, -0.14305121386423708, 0.03627956422531734, 0.3516192333124902, -0.21568495029502588, -0.3215746734129346, 0.026255137344781795, -0.2529575093406374, -0.21058390464066812, 0.2374814806951453, -0.08863910698615339, 0.026653012974977332, 0.035606915086669765, 0.02674904631288803, 0.008551918757755472, -0.2363857352944172, 0.200518598869119, 0.054087768700075055, 0.3065797907786201, 0.05280143996984091, 0.02562588680960724, -0.023700500498323337, 0.006526959541699161, -0.0013228219204946704, -0.12709748620077532, 0.02762869583523792, 0.23952778189078622, 0.05642999641030379, 0.2527224687656955, -0.40713982601933507, -0.2576767759964518, 0.14727929553887603, 0.1395425363094546, 0.1869786801343055, -0.014145823493827661, -0.305884064750179, 0.01629003738458066, -0.18451270924617902, -0.13067852785081968, -0.09099624730727594, 0.042719833609526574, 0.011941841572685087, -0.23577767961618046, 0.16830228388754895, 0.04897215981036425, 0.0494796653278172, -0.007389029236915319, -0.05564709929496293, -0.04081710021456947, 0.0597602898032283, -0.03626998984356127, -0.019692667407672042, 0.10952479121396723, -0.06622253409789308, -0.1808936886853822, 0.3321524481896473, -0.04680407289415598, -0.1519915519127845, 0.21818562320069126, -0.1672235274363471, -0.08211472614303879, 0.0758914811860608, 0.12109084488904995, 0.06139190922612729, -0.14634886611172038, 0.05891942184458932, 0.015502881022099324, 0.14878841710641333, 0.10567881582183358, 0.09425519560261265, 0.20793173969925746, 0.1136582037029059, -0.046559519426006335, 0.11881325950076722, -0.08148732716521329, -0.14004709867446724, -0.24765033087764016, -0.10613007648321597, -0.1843753269104206, 0.0850954096401161, 0.01584699772470428, -0.1285815555156897, 0.3709830008852093, 0.10962037151912227, 0.18803977572318653, -0.02353820777700647, 0.2323496075347066, 0.14855319385457297, 0.032749417041549864, 0.05583732583681526, 0.33675417312947303, 0.16133712085328347, 0.11182630131547541, -0.2910717550908094, 0.022039337812558464, 0.016305188275873662] |
1,802.04641 | A differential graded Lie algebra approach to non abelian extensions of
associative algebras | In this paper we show that non abelian extensions of an associative algebra
$\mathcal{B}$ by an associative algebra $\mathcal{A}$ can be viewed as
Maurer-Cartan elements of a suitable differential graded Lie algebra $L$. In
particular we show that $\mathcal{MC}(L)$, the Deligne groupoid of $L$, is in
1-1 correspondence with the non-abelian cohomology
$H^2_{nab}(\mathcal{B},\mathcal{A})$.
| math.AT math.QA | in this paper we show that non abelian extensions of an associative algebra mathcalb by an associative algebra mathcala can be viewed as maurercartan elements of a suitable differential graded lie algebra l in particular we show that mathcalmcl the deligne groupoid of l is in 11 correspondence with the nonabelian cohomology h2_nabmathcalbmathcala | [['in', 'this', 'paper', 'we', 'show', 'that', 'non', 'abelian', 'extensions', 'of', 'an', 'associative', 'algebra', 'mathcalb', 'by', 'an', 'associative', 'algebra', 'mathcala', 'can', 'be', 'viewed', 'as', 'maurercartan', 'elements', 'of', 'a', 'suitable', 'differential', 'graded', 'lie', 'algebra', 'l', 'in', 'particular', 'we', 'show', 'that', 'mathcalmcl', 'the', 'deligne', 'groupoid', 'of', 'l', 'is', 'in', '11', 'correspondence', 'with', 'the', 'nonabelian', 'cohomology', 'h2_nabmathcalbmathcala']] | [-0.225687127067324, 0.06785950879166908, -0.05146239873240976, 0.036689807423481755, -0.1644239629819697, -0.13723760520966322, -0.10015776925765928, 0.36737435366661636, -0.4474111982420379, -0.1778331199733942, 0.09931164341020014, -0.1848006192229542, -0.1701625020188444, 0.1601727729590208, -0.2345756136209649, -0.11109961770182732, 0.06261906537282116, 0.18182492950091175, -0.1070721529506366, -0.2338496586216577, 0.45712450457115966, -0.016421698986817442, 0.18876389900733734, -0.03867795942899059, 0.12384830811517496, -0.017736046811264446, -0.01469607267747907, 0.012076737066986514, -0.11380816064004595, 0.09572774588185198, 0.3925611693046841, 0.017879732761203367, 0.15643454022595987, -0.38600699825431495, -0.03455301387892926, 0.18521284616059241, 0.20169838894085557, -0.01284013192315458, -0.04252734175864972, -0.27717191521443574, 0.11945475336602505, -0.3199835533604902, -0.1100628458639132, -0.0800138240241829, 0.1533798704987538, -0.029223503289269467, -0.26920317843848585, -0.013289870420361267, 0.11985481687474485, 0.17365403466072737, -0.09354843727002542, -0.05083422706115479, -0.12726540442592665, -0.005412050568516932, -0.11783040955425332, 0.039973749911558686, 0.14649856318810991, -0.04167237954999448, -0.2290079663964171, 0.35253427718199937, -0.09995056685133308, -0.2557186127877703, 0.05116263915802918, -0.20240022049641565, -0.21861706714273668, 0.06257464035468943, -0.009082510921300626, 0.14895902910068923, -0.028768914879537096, 0.2758505410679123, -0.21564258916266993, 0.030323908034273806, 0.05015047520910408, 0.0014830418113692134, 0.13202773430841228, 0.12822853796658853, 0.016963303691762334, 0.125407638318161, 0.11588605434871187, 0.03280021350684704, -0.43450769037008286, -0.2593538060455638, -0.03957501299423622, 0.1898184103306894, -0.11258966437833128, -0.14044383821972445, 0.3508709697600673, 0.13683781209493093, 0.2060115917896231, 0.0945145111604064, 0.14280444924153535, 0.11253509515047293, 0.1329288629851505, 0.019277349726169134, 0.10409424216806085, 0.3079016789401352, -0.022530901108813638, -0.1213162346085643, -0.13831731500834518, 0.23953883348069355] |
1,802.04642 | Active Exploration Using Gaussian Random Fields and Gaussian Process
Implicit Surfaces | In this work we study the problem of exploring surfaces and building compact
3D representations of the environment surrounding a robot through active
perception. We propose an online probabilistic framework that merges visual and
tactile measurements using Gaussian Random Field and Gaussian Process Implicit
Surfaces. The system investigates incomplete point clouds in order to find a
small set of regions of interest which are then physically explored with a
robotic arm equipped with tactile sensors. We show experimental results
obtained using a PrimeSense camera, a Kinova Jaco2 robotic arm and Optoforce
sensors on different scenarios. We then demonstrate how to use the online
framework for object detection and terrain classification.
| cs.RO | in this work we study the problem of exploring surfaces and building compact 3d representations of the environment surrounding a robot through active perception we propose an online probabilistic framework that merges visual and tactile measurements using gaussian random field and gaussian process implicit surfaces the system investigates incomplete point clouds in order to find a small set of regions of interest which are then physically explored with a robotic arm equipped with tactile sensors we show experimental results obtained using a primesense camera a kinova jaco2 robotic arm and optoforce sensors on different scenarios we then demonstrate how to use the online framework for object detection and terrain classification | [['in', 'this', 'work', 'we', 'study', 'the', 'problem', 'of', 'exploring', 'surfaces', 'and', 'building', 'compact', '3d', 'representations', 'of', 'the', 'environment', 'surrounding', 'a', 'robot', 'through', 'active', 'perception', 'we', 'propose', 'an', 'online', 'probabilistic', 'framework', 'that', 'merges', 'visual', 'and', 'tactile', 'measurements', 'using', 'gaussian', 'random', 'field', 'and', 'gaussian', 'process', 'implicit', 'surfaces', 'the', 'system', 'investigates', 'incomplete', 'point', 'clouds', 'in', 'order', 'to', 'find', 'a', 'small', 'set', 'of', 'regions', 'of', 'interest', 'which', 'are', 'then', 'physically', 'explored', 'with', 'a', 'robotic', 'arm', 'equipped', 'with', 'tactile', 'sensors', 'we', 'show', 'experimental', 'results', 'obtained', 'using', 'a', 'primesense', 'camera', 'a', 'kinova', 'jaco2', 'robotic', 'arm', 'and', 'optoforce', 'sensors', 'on', 'different', 'scenarios', 'we', 'then', 'demonstrate', 'how', 'to', 'use', 'the', 'online', 'framework', 'for', 'object', 'detection', 'and', 'terrain', 'classification']] | [-0.10024462922645563, 0.044665368152279616, -0.07727092717012221, -0.027284671923338135, -0.12139804799702357, -0.15334754499437456, 0.03526076863689179, 0.46670438603244047, -0.231359812380238, -0.3168472887524827, 0.09663334156344221, -0.24187595170753245, -0.23619368853555484, 0.20306627770293165, -0.150631926052103, 0.06860844820991836, 0.09462364291433584, 0.026067631757310167, -0.027733030684546314, -0.1902421757790514, 0.3167840159836818, -0.0019102166406810284, 0.23883878471837802, -0.020156006040898237, 0.1948011168786748, 0.02682845246427777, -0.030066365316848864, 0.021056885212998498, -0.11748421819469182, 0.16345845571803777, 0.2918901840013198, 0.14706619403071025, 0.26207253443373535, -0.4415547966279767, -0.22482252416878262, 0.0784208659971641, 0.12237854374530302, 0.06479551362360574, -0.0955978433188813, -0.39760908721522853, 0.08258562161248516, -0.16885510082779961, -0.08365547155368734, -0.0508263977075165, -0.013369653351731937, -0.010828133882023394, -0.28625768949701025, -0.04047879729927941, 0.007621274492703378, 0.10573953565167771, -0.09675763888199898, -0.05160607229177417, 0.0643350832439451, 0.1720271584112197, -0.025988128725492225, 0.02336686248256063, 0.22512921338308264, -0.18041391157418152, -0.11325465671728704, 0.3511279472573237, -0.011806209464769133, -0.2037121205971661, 0.23581849226558751, -0.09310428771105679, -0.11605210186998276, 0.06876513973217119, 0.2525215113771, 0.14335626627487894, -0.16835841468789361, 0.030896575047782707, -0.05476438515311615, 0.15660742510940923, 0.02196684910661795, -0.02838378606618128, 0.20630796234631402, 0.21882851939987052, 0.06713390150530772, 0.17708575854882258, -0.15095370111944661, -0.06965073760683564, -0.2603537628427148, -0.14012701069428163, -0.15118796112418006, -0.030914843689904294, -0.09828425691904902, -0.11779865958008238, 0.3304130509157072, 0.19856117843565615, 0.22801286282906816, 0.0758190714595416, 0.3547998110001737, -0.002412970811631319, 0.033692166884429754, 0.07813249637256377, 0.17478923471062444, 0.03220830539410764, 0.0943594625431367, -0.14155664564195006, 0.035578985647721724, 0.03537332932888107] |
1,802.04643 | Surfaces of general type with $p_g=1$, $q=0$, $K^2=6$ and Grassmannians | We construct examples of surfaces of general type with $p_g=1$, $q=0$ and
$K^2=6$. We use as key varieties Fano fourfolds and Calabi-Yau threefolds that
are zero section of some special homogeneous vector bundle on Grassmannians. We
link as well our construction to a classical Campedelli surface, using the
Pfaffian-Grassmannian correspondence.
| math.AG | we construct examples of surfaces of general type with p_g1 q0 and k26 we use as key varieties fano fourfolds and calabiyau threefolds that are zero section of some special homogeneous vector bundle on grassmannians we link as well our construction to a classical campedelli surface using the pfaffiangrassmannian correspondence | [['we', 'construct', 'examples', 'of', 'surfaces', 'of', 'general', 'type', 'with', 'p_g1', 'q0', 'and', 'k26', 'we', 'use', 'as', 'key', 'varieties', 'fano', 'fourfolds', 'and', 'calabiyau', 'threefolds', 'that', 'are', 'zero', 'section', 'of', 'some', 'special', 'homogeneous', 'vector', 'bundle', 'on', 'grassmannians', 'we', 'link', 'as', 'well', 'our', 'construction', 'to', 'a', 'classical', 'campedelli', 'surface', 'using', 'the', 'pfaffiangrassmannian', 'correspondence']] | [-0.18492883283644915, -0.014006601534783841, -0.038474070616066454, 0.13450321611016988, -0.13884793534874917, -0.23281622069887817, -0.008771856289822608, 0.3627442108094692, -0.20961211692541837, -0.1824828742071986, 0.11810721321264282, -0.2532351313205436, -0.2444215475022793, 0.24004004762507974, -0.1972331060282886, -0.0033333062985911963, 0.002309639723971486, 0.006761099398136139, -0.12206602358724922, -0.3728606321685948, 0.5136434917151927, -0.046516134161502125, 0.25643488300964234, 0.06572336618788541, 0.12581388811580838, 0.036948678595945236, 0.06112500311806798, -0.03458413098007441, -0.19485581283995998, 0.14871537077706307, 0.3265647601848468, 0.03118354850448668, 0.05355691384524107, -0.3761896992474794, -0.16656844731362072, 0.17707572866231203, 0.11237972118891776, 0.11613937312737108, -0.01779532778309658, -0.22312333168461917, 0.055167524283751844, -0.14926894256146625, -0.21388010997325183, -0.14180976264178752, -0.03249853064771742, 0.10138344671577215, -0.1434869875293225, -0.027584308423101903, 0.08028986783931032, 0.1690137599594891, -0.0621874874830246, -0.12092222295468673, -0.11335816115140915, 0.024723295178264378, 0.007712285406887532, 0.05517141615971923, 0.06266488063149155, -0.10600189231336117, -0.14440006209537387, 0.34361294800415637, -0.1064471766166389, -0.22947692120447755, 0.12548887105658652, -0.11096569992601872, -0.13963863943703472, 0.11686790588544682, 0.12755833515897394, 0.20404451062437146, 0.045175289046019314, 0.11580482566496357, -0.1203497302532196, 0.006007727142423392, 0.13746870645321907, -0.021004997821291907, 0.1249643918313086, 0.09050004730001092, 0.027560208458453417, 0.09975229154573753, -0.05880260013509542, -0.07956840846687556, -0.4647750470042229, -0.23546006594377103, -0.06620085480622948, 0.21352945669554174, -0.10449203003139701, -0.1735012387484312, 0.370759971998632, -0.03459713281597942, 0.26003680580295624, 0.10339901985600591, 0.20737725362181664, -0.004759506082627922, 0.02183613528497517, 0.011664023138582707, 0.14848592321679463, 0.2662119320034981, -0.03112799291498959, -0.061230954974889756, -0.10929330411367118, 0.19615109760314225] |
1,802.04644 | Price of Anarchy for Mean Field Games | The price of anarchy, originally introduced to quantify the inefficiency of
selfish behavior in routing games, is extended to mean field games. The price
of anarchy is defined as the ratio of a worst case social cost computed for a
mean field game equilibrium to the optimal social cost as computed by a central
planner. We illustrate properties of such a price of anarchy on linear
quadratic extended mean field games, for which explicit computations are
possible. Various asymptotic behaviors of the price of anarchy are proved for
limiting behaviors of the coefficients in the model and numerics are presented.
| math.OC | the price of anarchy originally introduced to quantify the inefficiency of selfish behavior in routing games is extended to mean field games the price of anarchy is defined as the ratio of a worst case social cost computed for a mean field game equilibrium to the optimal social cost as computed by a central planner we illustrate properties of such a price of anarchy on linear quadratic extended mean field games for which explicit computations are possible various asymptotic behaviors of the price of anarchy are proved for limiting behaviors of the coefficients in the model and numerics are presented | [['the', 'price', 'of', 'anarchy', 'originally', 'introduced', 'to', 'quantify', 'the', 'inefficiency', 'of', 'selfish', 'behavior', 'in', 'routing', 'games', 'is', 'extended', 'to', 'mean', 'field', 'games', 'the', 'price', 'of', 'anarchy', 'is', 'defined', 'as', 'the', 'ratio', 'of', 'a', 'worst', 'case', 'social', 'cost', 'computed', 'for', 'a', 'mean', 'field', 'game', 'equilibrium', 'to', 'the', 'optimal', 'social', 'cost', 'as', 'computed', 'by', 'a', 'central', 'planner', 'we', 'illustrate', 'properties', 'of', 'such', 'a', 'price', 'of', 'anarchy', 'on', 'linear', 'quadratic', 'extended', 'mean', 'field', 'games', 'for', 'which', 'explicit', 'computations', 'are', 'possible', 'various', 'asymptotic', 'behaviors', 'of', 'the', 'price', 'of', 'anarchy', 'are', 'proved', 'for', 'limiting', 'behaviors', 'of', 'the', 'coefficients', 'in', 'the', 'model', 'and', 'numerics', 'are', 'presented']] | [-0.14964260021224618, 0.03877487265039235, -0.09970725096296519, 0.17044299891451373, -0.03479518225416541, -0.1439776864182204, 0.12575045820325614, 0.3702701549604535, -0.2680007314588875, -0.31107926581054923, 0.11885739868273959, -0.24053128181491046, -0.16460036227013916, 0.11774896271293983, -0.13258278909604995, 0.07505100564099848, -0.0038982294639572502, 0.03785853854846209, 0.06179452038661111, -0.3052728793211281, 0.27902942925924434, 0.07544964516535402, 0.22831868357956409, 0.0801540421124082, 0.09031500610522926, -0.012703233663924039, -4.432904068380594e-05, 0.09953741820529104, -0.16837579493410884, 0.09590536399744451, 0.29515900257974864, 0.12699078060220928, 0.3384944247454405, -0.3740375069156289, -0.16514854041161015, 0.15119819757528602, 0.06030680998461321, 0.04064575986354612, 0.00782017121760873, -0.2447581691830419, 0.06719124513329007, -0.19147780228406192, -0.13577702560927718, -0.04832427837420255, -0.001050009528407827, 0.07692553477128967, -0.3371104976721108, 0.017378041138872504, 0.009145971033722161, 0.09235036563128234, -0.02335155914071947, -0.15812529207207263, -0.05441787955234759, 0.15214101633056998, 0.10839914898031566, -0.07589686309918761, 0.15328230744693427, -0.20177243204787373, -0.23927101814188062, 0.41083381794393065, -0.1045907125249505, -0.1734608690813184, 0.11024714204948395, -0.09540872684214265, -0.059855227621737866, 0.12498800355941057, 0.22385231632739305, 0.1393003073334694, -0.1267526880931109, 0.10064883663260843, -0.09031724078580737, 0.14140425003599374, 0.0856202711397782, 0.03586013051215559, 0.1006789806485176, 0.16696712421253324, 0.15629010138567537, 0.15520939663052558, 0.04002942520426586, -0.2557203698909143, -0.26770890183746815, -0.13368971201358362, -0.18143056697561405, 0.06366909373900853, -0.1626461196875607, -0.14199373369105162, 0.383156224116683, 0.0933070875145495, 0.11838728344067931, 0.16558412405778655, 0.26273158921161666, 0.14969711124198512, -0.04445094837807119, 0.11285720932297409, 0.2322793636005372, 0.07786569338524714, 0.1392684422666207, -0.22887444198597223, 0.15221884149126708, 0.08770963789895177] |
1,802.04645 | Single-Perspective Warps in Natural Image Stitching | Results of image stitching can be perceptually divided into
single-perspective and multiple-perspective. Compared to the
multiple-perspective result, the single-perspective result excels in
perspective consistency but suffers from projective distortion. In this paper,
we propose two single-perspective warps for natural image stitching. The first
one is a parametric warp, which is a combination of the
as-projective-as-possible warp and the quasi-homography warp via dual-feature.
The second one is a mesh-based warp, which is determined by optimizing a total
energy function that simultaneously emphasizes different characteristics of the
single-perspective warp, including alignment, naturalness, distortion and
saliency. A comprehensive evaluation demonstrates that the proposed warp
outperforms some state-of-the-art warps, including homography, APAP,
AutoStitch, SPHP and GSP.
| cs.CV | results of image stitching can be perceptually divided into singleperspective and multipleperspective compared to the multipleperspective result the singleperspective result excels in perspective consistency but suffers from projective distortion in this paper we propose two singleperspective warps for natural image stitching the first one is a parametric warp which is a combination of the asprojectiveaspossible warp and the quasihomography warp via dualfeature the second one is a meshbased warp which is determined by optimizing a total energy function that simultaneously emphasizes different characteristics of the singleperspective warp including alignment naturalness distortion and saliency a comprehensive evaluation demonstrates that the proposed warp outperforms some stateoftheart warps including homography apap autostitch sphp and gsp | [['results', 'of', 'image', 'stitching', 'can', 'be', 'perceptually', 'divided', 'into', 'singleperspective', 'and', 'multipleperspective', 'compared', 'to', 'the', 'multipleperspective', 'result', 'the', 'singleperspective', 'result', 'excels', 'in', 'perspective', 'consistency', 'but', 'suffers', 'from', 'projective', 'distortion', 'in', 'this', 'paper', 'we', 'propose', 'two', 'singleperspective', 'warps', 'for', 'natural', 'image', 'stitching', 'the', 'first', 'one', 'is', 'a', 'parametric', 'warp', 'which', 'is', 'a', 'combination', 'of', 'the', 'asprojectiveaspossible', 'warp', 'and', 'the', 'quasihomography', 'warp', 'via', 'dualfeature', 'the', 'second', 'one', 'is', 'a', 'meshbased', 'warp', 'which', 'is', 'determined', 'by', 'optimizing', 'a', 'total', 'energy', 'function', 'that', 'simultaneously', 'emphasizes', 'different', 'characteristics', 'of', 'the', 'singleperspective', 'warp', 'including', 'alignment', 'naturalness', 'distortion', 'and', 'saliency', 'a', 'comprehensive', 'evaluation', 'demonstrates', 'that', 'the', 'proposed', 'warp', 'outperforms', 'some', 'stateoftheart', 'warps', 'including', 'homography', 'apap', 'autostitch', 'sphp', 'and', 'gsp']] | [-0.12655222613349507, -0.032871664403467823, -0.0979731771112377, 0.054921802251873146, -0.1198079767679676, -0.12487165022795217, -0.019242243600983616, 0.39389689786171694, -0.27647752989801244, -0.2845051509729766, 0.0816884410157458, -0.21696530351278567, -0.1895545536498411, 0.18972508677648842, -0.130669885315001, 0.022710347766806416, 0.0522846763829675, -0.06043171035467621, -0.10418663061984362, -0.23242032784037292, 0.32584517741994506, 0.04252420600349887, 0.2911244154044794, 0.031033173989538754, 0.11462650942795594, -0.02234595975787336, -0.0528078611433899, 0.02855348706655546, -0.06891743061754857, 0.13535064259886317, 0.20904749916405033, 0.17530035715413475, 0.25706753258619014, -0.3416220454516214, -0.21217555680030256, 0.030419044085530512, 0.1495709479060195, 0.10011951285927052, -0.08132227724674371, -0.29732525092336015, 0.0784354263749999, -0.11766323213969622, 0.01997785932820188, -0.0698240734124129, -0.04475829745172907, -0.035543424359292065, -0.2932899003899699, 0.07731048996910589, 0.07868514801674617, 0.012719853272781186, -0.07251185031154903, -0.09678132588539375, -0.008343597108267521, 0.11608322382981487, 0.08452235754374243, 0.11509760979289582, 0.1467093174012566, -0.1484903088672548, -0.10977435842532357, 0.41991328794045646, -0.08992749623475818, -0.21473722586727598, 0.15123619290427603, -0.07717077707799169, -0.09962049076534432, 0.14198929003926866, 0.152875260347415, 0.1033793066055813, -0.12096742021107892, 0.033379927352327136, -0.03102632674790167, 0.16268128804529275, 0.10531244498737362, 0.013555152862922314, 0.1944705136034877, 0.17724783154665877, 0.06436118305823126, 0.2010190668206132, -0.1427061463868536, -0.06962764649352896, -0.2673793002074465, -0.12469190646629405, -0.1493468872584411, -0.020662992434371093, -0.14463266172743222, -0.11911748003624721, 0.44126893986665877, 0.1330578497252128, 0.2735056312703485, 0.06810685410591509, 0.39701318880970327, 0.03466666118164948, 0.13187032461555145, 0.06645797038826784, 0.24545396327541996, -0.02180806083664503, 0.03675790480551643, -0.21753542476420187, 0.05395671261320694, 0.06700168273180997] |
1,802.04646 | Inner functions and zero sets for $\ell^{p}_{A}$ | In this paper we characterize the zero sets of functions from $\ell^{p}_{A}$
(the analytic functions on the open unit disk $D$ whose Taylor coefficients
form an $\ell^p$ sequence) by developing a concept of an "inner function"
modeled by Beurling's discussion of the Hilbert space $\ell^{2}_{A}$ (the
classical Hardy space). The zero set criterion is used to construct families of
zero sets which are not covered by classical results. In particular, it is
proved that when $p > 2$, there are zero sets for $\ell^{p}_{A}$ which are not
Blaschke sequences.
| math.CV | in this paper we characterize the zero sets of functions from ellp_a the analytic functions on the open unit disk d whose taylor coefficients form an ellp sequence by developing a concept of an inner function modeled by beurlings discussion of the hilbert space ell2_a the classical hardy space the zero set criterion is used to construct families of zero sets which are not covered by classical results in particular it is proved that when p 2 there are zero sets for ellp_a which are not blaschke sequences | [['in', 'this', 'paper', 'we', 'characterize', 'the', 'zero', 'sets', 'of', 'functions', 'from', 'ellp_a', 'the', 'analytic', 'functions', 'on', 'the', 'open', 'unit', 'disk', 'd', 'whose', 'taylor', 'coefficients', 'form', 'an', 'ellp', 'sequence', 'by', 'developing', 'a', 'concept', 'of', 'an', 'inner', 'function', 'modeled', 'by', 'beurlings', 'discussion', 'of', 'the', 'hilbert', 'space', 'ell2_a', 'the', 'classical', 'hardy', 'space', 'the', 'zero', 'set', 'criterion', 'is', 'used', 'to', 'construct', 'families', 'of', 'zero', 'sets', 'which', 'are', 'not', 'covered', 'by', 'classical', 'results', 'in', 'particular', 'it', 'is', 'proved', 'that', 'when', 'p', '2', 'there', 'are', 'zero', 'sets', 'for', 'ellp_a', 'which', 'are', 'not', 'blaschke', 'sequences']] | [-0.1265395660282058, 0.11853160667815246, -0.08664784545407575, 0.07459347549524596, -0.033761510395390146, -0.08003081081106382, 0.01954982767073328, 0.3296571756548741, -0.33599269121666164, -0.1876299677800168, 0.13401092475499302, -0.24901924058794975, -0.14449857076739564, 0.24158423270153648, -0.08555772635428345, 0.06113354222547701, 0.03194542337373337, 0.047554818551768276, -0.06241157815024695, -0.307980534456232, 0.41173741609296377, -0.03318905487437459, 0.1971085000125801, -0.001027788090355256, 0.05468954584169242, 0.0025544707553789895, -0.03929398497566581, -0.00955160832758445, -0.20849990035340477, 0.13263903822311585, 0.26200731874388805, 0.13788794468102208, 0.3185652740080567, -0.3511992198141182, -0.1794852685950258, 0.16544701756142519, 0.13629107036463478, -0.013961893552914263, 0.007178139131899704, -0.24848612161243663, 0.11398592344759141, -0.11572136633947272, -0.1537618966170532, -0.09556577841285616, 0.04244261579451097, 0.028307000728433625, -0.2803444856558652, 0.004162521528847077, 0.11969340312130311, 0.09527760654249612, -0.07672058219254455, -0.1403900883763152, -0.002684836185482495, 0.0956748869150247, 0.001927208951126565, 0.10745954254970831, 0.069023488785195, -0.039403217028388206, -0.09391675183330389, 0.3187080192653572, -0.05737959369400735, -0.29642015687354345, 0.1696983730968307, -0.20924501915955368, -0.07515454502666698, 0.10719472888090155, 0.10039202760466757, 0.13704373430570257, -0.13632859271927053, 0.16362616367199842, -0.10895233686794253, 0.10878032111042343, 0.1127086110139156, 0.01532047911108855, 0.15776339394643027, 0.047744654847637694, 0.10283840855802684, 0.1619253983748529, 0.010392404361525276, -0.08602275756352087, -0.3677430783672368, -0.12605262446929427, -0.23805382790810922, 0.054294891458566245, -0.07134602540446555, -0.23821560436969294, 0.3295914075583877, 0.028197057242505253, 0.22967780143269065, 0.07298074372057968, 0.23679054793627824, 0.13043698590567254, 0.061574796539293056, 0.08444060139796312, 0.15008376287844252, 0.14584849202895867, 0.028365996737471397, -0.12024343953029636, 0.022254691921475837, 0.15619552120675936] |
1,802.04647 | Deep Learning with Apache SystemML | Enterprises operate large data lakes using Hadoop and Spark frameworks that
(1) run a plethora of tools to automate powerful data
preparation/transformation pipelines, (2) run on shared, large clusters to (3)
perform many different analytics tasks ranging from model preparation,
building, evaluation, and tuning for both machine learning and deep learning.
Developing machine/deep learning models on data in such shared environments is
challenging. Apache SystemML provides a unified framework for implementing
machine learning and deep learning algorithms in a variety of shared deployment
scenarios. SystemML's novel compilation approach automatically generates
runtime execution plans for machine/deep learning algorithms that are composed
of single-node and distributed runtime operations depending on data and cluster
characteristics such as data size, data sparsity, cluster size, and memory
configurations, while still exploiting the capabilities of the underlying big
data frameworks.
| cs.LG cs.DC | enterprises operate large data lakes using hadoop and spark frameworks that 1 run a plethora of tools to automate powerful data preparationtransformation pipelines 2 run on shared large clusters to 3 perform many different analytics tasks ranging from model preparation building evaluation and tuning for both machine learning and deep learning developing machinedeep learning models on data in such shared environments is challenging apache systemml provides a unified framework for implementing machine learning and deep learning algorithms in a variety of shared deployment scenarios systemmls novel compilation approach automatically generates runtime execution plans for machinedeep learning algorithms that are composed of singlenode and distributed runtime operations depending on data and cluster characteristics such as data size data sparsity cluster size and memory configurations while still exploiting the capabilities of the underlying big data frameworks | [['enterprises', 'operate', 'large', 'data', 'lakes', 'using', 'hadoop', 'and', 'spark', 'frameworks', 'that', '1', 'run', 'a', 'plethora', 'of', 'tools', 'to', 'automate', 'powerful', 'data', 'preparationtransformation', 'pipelines', '2', 'run', 'on', 'shared', 'large', 'clusters', 'to', '3', 'perform', 'many', 'different', 'analytics', 'tasks', 'ranging', 'from', 'model', 'preparation', 'building', 'evaluation', 'and', 'tuning', 'for', 'both', 'machine', 'learning', 'and', 'deep', 'learning', 'developing', 'machinedeep', 'learning', 'models', 'on', 'data', 'in', 'such', 'shared', 'environments', 'is', 'challenging', 'apache', 'systemml', 'provides', 'a', 'unified', 'framework', 'for', 'implementing', 'machine', 'learning', 'and', 'deep', 'learning', 'algorithms', 'in', 'a', 'variety', 'of', 'shared', 'deployment', 'scenarios', 'systemmls', 'novel', 'compilation', 'approach', 'automatically', 'generates', 'runtime', 'execution', 'plans', 'for', 'machinedeep', 'learning', 'algorithms', 'that', 'are', 'composed', 'of', 'singlenode', 'and', 'distributed', 'runtime', 'operations', 'depending', 'on', 'data', 'and', 'cluster', 'characteristics', 'such', 'as', 'data', 'size', 'data', 'sparsity', 'cluster', 'size', 'and', 'memory', 'configurations', 'while', 'still', 'exploiting', 'the', 'capabilities', 'of', 'the', 'underlying', 'big', 'data', 'frameworks']] | [-0.056760232908400765, 0.01718877924069988, -0.07690044466907045, 0.060144906130682844, -0.12156453200749996, -0.21291008384573754, 0.04451360586663765, 0.42252777155248844, -0.2948201857718893, -0.4044774368186622, 0.1326496159132203, -0.24349010671545385, -0.07724643490545338, 0.2645070166379975, -0.08346941045513659, 0.12929490957917136, 0.16985134588498058, -0.05053519808941267, -0.04265022413120746, -0.28549670791394555, 0.2734219323593248, 0.03323130407961523, 0.387692087090038, -0.027047487466144517, 0.09491563462705183, 0.00123584576332095, -0.03784663352593215, -0.03062155249592086, -0.039947010205099956, 0.16466495404672582, 0.3840652506327608, 0.32835089519380056, 0.3235187150650855, -0.45345998819296557, -0.16638922432056544, 0.08431458023419096, 0.13927943369895784, 0.05535428221584439, -0.07902249903903187, -0.3137160022037499, 0.08032189197855945, -0.17849708420478486, -0.003459625616387436, -0.1976941764552259, -0.00029375223499355894, -0.012798337167513444, -0.2836402081320006, -0.04495460328656587, 0.022095186098753897, 0.12469610045699289, -0.020080627127423544, -0.12591125449398533, 0.06047313345003535, 0.16073612535414708, -0.018200275969733906, 0.03565998346135585, 0.2318205705360566, -0.17206892766460608, -0.19030808804338006, 0.35584681406334945, 0.0026186404742695618, -0.10567223742096261, 0.26586876415725175, 0.05403345137495886, -0.2558777649237802, 0.04654564713586517, 0.32373572140843887, 0.05827207229043724, -0.2071190560024909, 0.11333671438015616, 0.047926671048061864, 0.1912158377094646, 0.012629162333200149, 0.0030333524972031064, 0.1597356781342321, 0.33741727631510887, 0.01274341757887283, 0.08093709842245461, -0.08488972147990187, -0.11486667686911074, -0.19058362218008065, -0.08410542095291683, -0.18216221671812519, -0.06322657731432242, -0.1598816451425426, -0.15255555341189558, 0.3187087099279531, 0.18711227517412748, 0.16669983824954904, 0.11328105615085048, 0.37874557266971376, -0.058907984700371424, 0.18802341272715817, 0.21197100410195577, 0.08564193212695306, -0.02627598861220053, 0.18371326215106598, -0.13857032733468452, 0.0644503918098935, -0.06210523793759586] |
1,802.04648 | Approach combining the Rietveld method and pairs distribution function
analysis to study crystalline materials under high-pressure and/or
temperature | An approach combining the Rietveld method and pairs distribution function
analysis was developed and can help to understand the effect of temperature
and/or high-pressure on crystalline materials. It was applied to orthorhombic
Ta2O5 compound, and the obtained results were compared with the experimental
pairs distribution function reported in the literature, and an excellent
agreement was reached. The approach permitted to simulate average pairs
distribution functions GTa-Ta(R), GTa-O(R), and GO-O(R) and the average radial
distribution functions RDFTa-Ta(R), RDFTa-O(R), and RDFO-O(R). The coordination
numbers for the first neighbors were obtained, and used in the expression to
calculate the Cowley-Warren chemical short-range order parameter {\alpha}CW .
The calculated value suggests a preference for forming homopolar pairs in the
first coordination shell. Previous study on the effect of high-pressure on
orthorhombic Ta2O5 showed a pressure-induced amorphization process. This
amorphization can be associated with the preference for forming homopolar pairs
in the first coordination shell.
| cond-mat.mtrl-sci | an approach combining the rietveld method and pairs distribution function analysis was developed and can help to understand the effect of temperature andor highpressure on crystalline materials it was applied to orthorhombic ta2o5 compound and the obtained results were compared with the experimental pairs distribution function reported in the literature and an excellent agreement was reached the approach permitted to simulate average pairs distribution functions gtatar gtaor and goor and the average radial distribution functions rdftatar rdftaor and rdfoor the coordination numbers for the first neighbors were obtained and used in the expression to calculate the cowleywarren chemical shortrange order parameter alphacw the calculated value suggests a preference for forming homopolar pairs in the first coordination shell previous study on the effect of highpressure on orthorhombic ta2o5 showed a pressureinduced amorphization process this amorphization can be associated with the preference for forming homopolar pairs in the first coordination shell | [['an', 'approach', 'combining', 'the', 'rietveld', 'method', 'and', 'pairs', 'distribution', 'function', 'analysis', 'was', 'developed', 'and', 'can', 'help', 'to', 'understand', 'the', 'effect', 'of', 'temperature', 'andor', 'highpressure', 'on', 'crystalline', 'materials', 'it', 'was', 'applied', 'to', 'orthorhombic', 'ta2o5', 'compound', 'and', 'the', 'obtained', 'results', 'were', 'compared', 'with', 'the', 'experimental', 'pairs', 'distribution', 'function', 'reported', 'in', 'the', 'literature', 'and', 'an', 'excellent', 'agreement', 'was', 'reached', 'the', 'approach', 'permitted', 'to', 'simulate', 'average', 'pairs', 'distribution', 'functions', 'gtatar', 'gtaor', 'and', 'goor', 'and', 'the', 'average', 'radial', 'distribution', 'functions', 'rdftatar', 'rdftaor', 'and', 'rdfoor', 'the', 'coordination', 'numbers', 'for', 'the', 'first', 'neighbors', 'were', 'obtained', 'and', 'used', 'in', 'the', 'expression', 'to', 'calculate', 'the', 'cowleywarren', 'chemical', 'shortrange', 'order', 'parameter', 'alphacw', 'the', 'calculated', 'value', 'suggests', 'a', 'preference', 'for', 'forming', 'homopolar', 'pairs', 'in', 'the', 'first', 'coordination', 'shell', 'previous', 'study', 'on', 'the', 'effect', 'of', 'highpressure', 'on', 'orthorhombic', 'ta2o5', 'showed', 'a', 'pressureinduced', 'amorphization', 'process', 'this', 'amorphization', 'can', 'be', 'associated', 'with', 'the', 'preference', 'for', 'forming', 'homopolar', 'pairs', 'in', 'the', 'first', 'coordination', 'shell']] | [-0.08797090744901397, 0.09416528611503784, -0.08356141171116434, 0.033009935594736174, -0.025958894319097762, -0.05035696199006388, 0.11072459146642769, 0.43174045186647225, -0.2243160177284563, -0.32986845624383904, 0.0044380656253336604, -0.3183274265168838, -0.11053981654785416, 0.13415100141166067, 0.038763814189300784, 0.05188479401748365, 0.014279539529627688, 0.0028113092256473824, -0.08753894103533576, -0.2401214667143379, 0.2680034041004034, 0.0910243562219376, 0.3457074778311899, 0.05264090288850203, 0.03653946413632325, -0.0007505634058476753, 0.014162669141947384, 0.026217209408059716, -0.16350264204370882, 0.08357147001464602, 0.21879961554118446, 0.009810372439383621, 0.1837458247236881, -0.4172085777292369, -0.21400263983572662, 0.04880017856739356, 0.10968040167944322, 0.09606097305429653, -0.0831188217885989, -0.26810424262001903, 0.0845045198417518, -0.15869479763328137, -0.1267086467640081, -0.06723616909707936, -0.01957939917993942, 0.0422208023595322, -0.29687675861248247, 0.08146102959618078, 0.007416419302847918, 0.08341184928750908, -0.1561409936739053, -0.17853201715879038, -0.04731971948755197, 0.10426812708167962, 0.02206787081336124, 0.06224232096008589, 0.12622121026293492, -0.05346502669149039, -0.10390201844865272, 0.38555187629994897, -0.025797052804911902, -0.09724476112997238, 0.16870096463605133, -0.17649919542969322, -0.11094241189888455, 0.16742746765449854, 0.11198674845115715, 0.11616019898382815, -0.14466358037849128, -0.001755870891813661, 0.01366064321039848, 0.19410809780582522, 0.07541140669983037, -0.03655405384600105, 0.16929010499898398, 0.1621820264246682, -0.020909516304783837, 0.186884343680683, -0.100017748263576, -0.09301908689380532, -0.2164964155789176, -0.18112409848090208, -0.184961112216115, -0.012694325002113645, -0.06414438114406436, -0.12187188968692027, 0.35387424700959047, 0.08732522169823273, 0.20378332695281, -0.007813736304483364, 0.2082162189599074, 0.09363615490548627, 0.08780329006323985, 0.0025269641790171744, 0.2398907026230082, 0.15656060644779618, 0.10188275287386922, -0.2648851227631766, 0.17337198812567012, 0.03426455956240985] |
1,802.04649 | Optimal Weak Parallelogram Constants for $L^p$ Spaces | Inspired by Clarkson's inequalities for $L^p$ and continuing work from
\cite{CR}, this paper computes the optimal constant $C$ in the weak
parallelogram laws $$ \|f + g \|^r + C\|f - g\|^r \leq 2^{r-1}\big( \|f\|^r +
\|g\|^r \big), $$ $$ \|f + g \|^r + C\|f- g \|^r \geq 2^{r-1}\big( \|f\|^r +
\|g \|^r \big)$$ for the $L^p$ spaces, $1 < p < \infty$.
| math.FA | inspired by clarksons inequalities for lp and continuing work from citecr this paper computes the optimal constant c in the weak parallelogram laws f g r cf gr leq 2r1big fr gr big f g r cf g r geq 2r1big fr g r big for the lp spaces 1 p infty | [['inspired', 'by', 'clarksons', 'inequalities', 'for', 'lp', 'and', 'continuing', 'work', 'from', 'citecr', 'this', 'paper', 'computes', 'the', 'optimal', 'constant', 'c', 'in', 'the', 'weak', 'parallelogram', 'laws', 'f', 'g', 'r', 'cf', 'gr', 'leq', '2r1big', 'fr', 'gr', 'big', 'f', 'g', 'r', 'cf', 'g', 'r', 'geq', '2r1big', 'fr', 'g', 'r', 'big', 'for', 'the', 'lp', 'spaces', '1', 'p', 'infty']] | [-0.197547618560493, 0.012733431980013848, -0.043732459619641305, 0.06953590077115222, -0.08712798185646534, -0.30923704758286474, 0.003344192863442004, 0.30614345919340846, -0.32739310613833367, -0.2461129923723638, -0.002695948660839349, -0.24334122285246848, -0.07533855147659779, 0.12371639549732208, -0.11667365051805972, 0.012586481077596546, -0.014243809077888726, 0.011406032405793666, -0.08731409628875554, -0.2676699513010681, 0.2881969051063061, -0.026127420756965877, 0.10523365979082883, -0.06029118363745511, -0.024783516321331262, 0.021400450570508836, -0.02460364216240123, 0.03754301814362407, -0.3571651063114405, 0.07518393453210592, 0.2930040397401899, 0.17554665837436914, 0.32660294122993944, -0.27817508049309253, -0.16138268811628223, 0.17366700600832702, 0.12542704836698249, -0.1171760292723775, 0.011858098631491884, -0.22493282602052203, 0.18213717258535325, -0.1495835365355015, -0.08976338190026581, 0.044949641041457655, 0.2840043455455452, -0.0027855221321806314, -0.3733936274796724, 0.035322525668889285, 0.16672799605876207, 0.04411843436071649, 0.03472921969834715, -0.24183410741388797, -0.009825765527784825, -0.02270010344684124, 0.014738643802702426, 0.22071134594269096, 0.06921400848776102, -0.016105782142840325, -0.012355172261595725, 0.3580993755348027, -0.1583210029453039, -0.09787294864654542, 0.0536886215955019, -0.21070337981916964, -0.17383317432831974, 0.007967160567641258, 0.03315448205452412, 0.2418713244050741, -0.002393826311454177, 0.40252705008606426, -0.05092806769534945, 0.10286896419711411, 0.13681132124736906, -0.045121195204555986, 0.10682355786673725, -0.011041477341204881, 0.12529463993385434, 0.00552806043997407, 0.015938858049921692, 0.16110278177657164, -0.4000882326066494, -0.11577233804389835, -0.2273406568169594, 0.13745693013072013, -0.2116404420041363, -0.05178777841851115, 0.2700309793651104, 0.004696376770734787, 0.0971863179281354, 0.15740608163177966, 0.13986897896975278, 0.03597293174359947, -0.032879468186292796, 0.19175699124112724, 0.12048205506056547, 0.17906082420144231, 0.06595244836062193, -0.17828774002846332, -0.06989132400602102, 0.19992165950126947] |
1,802.0465 | A conservative implicit multirate method for hyperbolic problems | This work focuses on the development of a self adjusting multirate strategy
based on an implicit time discretization for the numerical solution of
hyperbolic equations, that could benefit from different time steps in different
areas of the spatial domain. We propose a novel mass conservative multirate
approach, that can be generalized to various implicit time discretization
methods. It is based on flux partitioning, so that flux exchanges between a
cell and its neighbors are balanced. A number of numerical experiments on both
non-linear scalar problems and systems of hyperbolic equations have been
carried out to test the efficiency and accuracy of the proposed approach.
| math.NA | this work focuses on the development of a self adjusting multirate strategy based on an implicit time discretization for the numerical solution of hyperbolic equations that could benefit from different time steps in different areas of the spatial domain we propose a novel mass conservative multirate approach that can be generalized to various implicit time discretization methods it is based on flux partitioning so that flux exchanges between a cell and its neighbors are balanced a number of numerical experiments on both nonlinear scalar problems and systems of hyperbolic equations have been carried out to test the efficiency and accuracy of the proposed approach | [['this', 'work', 'focuses', 'on', 'the', 'development', 'of', 'a', 'self', 'adjusting', 'multirate', 'strategy', 'based', 'on', 'an', 'implicit', 'time', 'discretization', 'for', 'the', 'numerical', 'solution', 'of', 'hyperbolic', 'equations', 'that', 'could', 'benefit', 'from', 'different', 'time', 'steps', 'in', 'different', 'areas', 'of', 'the', 'spatial', 'domain', 'we', 'propose', 'a', 'novel', 'mass', 'conservative', 'multirate', 'approach', 'that', 'can', 'be', 'generalized', 'to', 'various', 'implicit', 'time', 'discretization', 'methods', 'it', 'is', 'based', 'on', 'flux', 'partitioning', 'so', 'that', 'flux', 'exchanges', 'between', 'a', 'cell', 'and', 'its', 'neighbors', 'are', 'balanced', 'a', 'number', 'of', 'numerical', 'experiments', 'on', 'both', 'nonlinear', 'scalar', 'problems', 'and', 'systems', 'of', 'hyperbolic', 'equations', 'have', 'been', 'carried', 'out', 'to', 'test', 'the', 'efficiency', 'and', 'accuracy', 'of', 'the', 'proposed', 'approach']] | [-0.1261822595798339, 0.04087852034395977, -0.10389415043083808, 0.01683653494602857, -0.0987567591946572, -0.12119740616225709, 0.06056458231670639, 0.3919551398497648, -0.23719201491733727, -0.30922163965610355, 0.10994111112869667, -0.23494627481648842, -0.15317036844498944, 0.2265162956721794, -0.060140850116462946, 0.09609367470301759, 0.08727567916391238, -0.020362308302607674, -0.07532211679902573, -0.2535760864087094, 0.3206058846822438, 0.0487105993435342, 0.31758802861664803, 0.07849972137661937, 0.1796016374271578, -0.061546276726473406, -0.06871135520318952, 0.062273569512539186, -0.07783640585631264, 0.10312875112196287, 0.22050368149603644, 0.11380296550319494, 0.33405133144697174, -0.4687816168074138, -0.2526661428497531, 0.07401575623169684, 0.16187943775842611, 0.09027268316220635, -0.0578327682552089, -0.26338810997549444, 0.07435412143016808, -0.14935655651005128, -0.07932501743869999, -0.09537539692917982, -0.017373668952271916, 0.059318315665362976, -0.270897623957493, 0.07083724053854194, 0.036837707947527706, 0.030768625017327186, -0.04767181402488719, -0.10686778290591274, -0.01824517806548661, 0.11187473809248051, 0.041487161842479296, -0.036749388239024065, 0.08044352358242926, -0.06039277521239665, -0.13245863563385613, 0.37083443934814286, -0.04642279125535144, -0.30655700229824734, 0.1984468546579592, -0.04684040990496914, -0.11902398624135038, 0.1371720345610251, 0.255674795480445, 0.185197036628289, -0.15724186904397078, 0.06040813669824274, -0.030513775834921174, 0.19630527693796188, 0.047270902210864454, -0.028886335369092055, 0.1563439354336319, 0.2181064029528688, 0.09093286663231154, 0.07808010053905981, -0.07848865679429415, -0.15624400018714368, -0.2696943631073317, -0.13960831317728242, -0.1819783627288416, -0.002082572139513034, -0.10540682586011266, -0.14127161341289488, 0.397863667870227, 0.17919380135852128, 0.14328494248016235, 0.06526531833626975, 0.3442532672510984, 0.1444199954287167, 0.0570250303314354, 0.04329546509185233, 0.18998834535551185, 0.06930225686161205, 0.1263960587541358, -0.2638034127012361, 0.01774122306736759, 0.12930114318330127] |
1,802.04651 | Impulsively generated wave trains in coronal structures: II. Effects of
transverse structuring on sausage waves in pressureless slabs | Impulsively generated sausage wave trains in coronal structures are important
for interpreting a substantial number of observations of quasi-periodic signals
with quasi-periods of order seconds. We have previously shown that the Morlet
spectra of these wave trains in coronal tubes depend crucially on the
dispersive properties of trapped sausage waves, the existence of cutoff axial
wavenumbers and the monotonicity of the dependence of the axial group speed on
the axial wavenumber in particular. This study examines the difference a slab
geometry may introduce, for which purpose we conduct a comprehensive eigenmode
analysis, both analytically and numerically, on trapped sausage modes in
coronal slabs with a considerable number of density profiles. For the profile
descriptions examined, coronal slabs can trap sausage waves with longer axial
wavelengths, and the group speed approaches the internal Alfv\'en speed more
rapidly at large wavenumbers in the cylindrical case. However, common to both
geometries, cutoff wavenumbers exist only when the density profile falls
sufficiently rapidly at distances far from coronal structures. Likewise, the
monotonicity of the group speed curves depends critically on the profile
steepness right at the structure axis. Furthermore, the Morlet spectra of the
wave trains are shaped by the group speed curves for coronal slabs and tubes
alike. Consequently, we conclude that these spectra have the potential for
telling the sub-resolution density structuring inside coronal structures,
although their detection requires an instrumental cadence of better than $\sim
1$ second.
| astro-ph.SR | impulsively generated sausage wave trains in coronal structures are important for interpreting a substantial number of observations of quasiperiodic signals with quasiperiods of order seconds we have previously shown that the morlet spectra of these wave trains in coronal tubes depend crucially on the dispersive properties of trapped sausage waves the existence of cutoff axial wavenumbers and the monotonicity of the dependence of the axial group speed on the axial wavenumber in particular this study examines the difference a slab geometry may introduce for which purpose we conduct a comprehensive eigenmode analysis both analytically and numerically on trapped sausage modes in coronal slabs with a considerable number of density profiles for the profile descriptions examined coronal slabs can trap sausage waves with longer axial wavelengths and the group speed approaches the internal alfven speed more rapidly at large wavenumbers in the cylindrical case however common to both geometries cutoff wavenumbers exist only when the density profile falls sufficiently rapidly at distances far from coronal structures likewise the monotonicity of the group speed curves depends critically on the profile steepness right at the structure axis furthermore the morlet spectra of the wave trains are shaped by the group speed curves for coronal slabs and tubes alike consequently we conclude that these spectra have the potential for telling the subresolution density structuring inside coronal structures although their detection requires an instrumental cadence of better than sim 1 second | [['impulsively', 'generated', 'sausage', 'wave', 'trains', 'in', 'coronal', 'structures', 'are', 'important', 'for', 'interpreting', 'a', 'substantial', 'number', 'of', 'observations', 'of', 'quasiperiodic', 'signals', 'with', 'quasiperiods', 'of', 'order', 'seconds', 'we', 'have', 'previously', 'shown', 'that', 'the', 'morlet', 'spectra', 'of', 'these', 'wave', 'trains', 'in', 'coronal', 'tubes', 'depend', 'crucially', 'on', 'the', 'dispersive', 'properties', 'of', 'trapped', 'sausage', 'waves', 'the', 'existence', 'of', 'cutoff', 'axial', 'wavenumbers', 'and', 'the', 'monotonicity', 'of', 'the', 'dependence', 'of', 'the', 'axial', 'group', 'speed', 'on', 'the', 'axial', 'wavenumber', 'in', 'particular', 'this', 'study', 'examines', 'the', 'difference', 'a', 'slab', 'geometry', 'may', 'introduce', 'for', 'which', 'purpose', 'we', 'conduct', 'a', 'comprehensive', 'eigenmode', 'analysis', 'both', 'analytically', 'and', 'numerically', 'on', 'trapped', 'sausage', 'modes', 'in', 'coronal', 'slabs', 'with', 'a', 'considerable', 'number', 'of', 'density', 'profiles', 'for', 'the', 'profile', 'descriptions', 'examined', 'coronal', 'slabs', 'can', 'trap', 'sausage', 'waves', 'with', 'longer', 'axial', 'wavelengths', 'and', 'the', 'group', 'speed', 'approaches', 'the', 'internal', 'alfven', 'speed', 'more', 'rapidly', 'at', 'large', 'wavenumbers', 'in', 'the', 'cylindrical', 'case', 'however', 'common', 'to', 'both', 'geometries', 'cutoff', 'wavenumbers', 'exist', 'only', 'when', 'the', 'density', 'profile', 'falls', 'sufficiently', 'rapidly', 'at', 'distances', 'far', 'from', 'coronal', 'structures', 'likewise', 'the', 'monotonicity', 'of', 'the', 'group', 'speed', 'curves', 'depends', 'critically', 'on', 'the', 'profile', 'steepness', 'right', 'at', 'the', 'structure', 'axis', 'furthermore', 'the', 'morlet', 'spectra', 'of', 'the', 'wave', 'trains', 'are', 'shaped', 'by', 'the', 'group', 'speed', 'curves', 'for', 'coronal', 'slabs', 'and', 'tubes', 'alike', 'consequently', 'we', 'conclude', 'that', 'these', 'spectra', 'have', 'the', 'potential', 'for', 'telling', 'the', 'subresolution', 'density', 'structuring', 'inside', 'coronal', 'structures', 'although', 'their', 'detection', 'requires', 'an', 'instrumental', 'cadence', 'of', 'better', 'than', 'sim', '1', 'second']] | [-0.16615269115388046, 0.19572663889716674, -0.03291989229047292, 0.09334992257813071, -0.08991938917818716, -0.06515690566817993, -0.019310636958896607, 0.44469231408547166, -0.18574168591097123, -0.27416218800265024, 0.10656504458659012, -0.2673519822424554, -0.08659355519206255, 0.2307564553753394, 0.03775967898091964, 0.04275605210174128, 0.06158192300581042, 0.017575736216790344, -0.042677554876594886, -0.15224728514282507, 0.27610443630729314, 0.08359143872334922, 0.29093963159169306, 0.010040204506120802, 0.05060184248731722, -0.050946797161872136, -0.012558270125428877, 0.001138797566547232, -0.13709697871049917, 0.05722633820279675, 0.18787864428723894, 0.07348805506145424, 0.25514518863633, -0.48321043295091237, -0.27342601343436895, 0.016617681590398236, 0.21681531905433385, 0.06655629671457958, -0.02669680903408473, -0.2578493485284448, 0.06156283337228253, -0.0792353456559733, -0.17313246975575922, -0.023195802490621552, 0.07946123363611968, 0.06897742063462166, -0.20847932274267866, 0.12309561049322977, 0.027054314648582583, 0.07944429339742351, -0.08725704042777671, -0.061322659905210644, -0.04709974937663824, 0.07851201774499683, 0.11916120196312507, 0.0019332991564085004, 0.14395214897241065, -0.12817114951992722, -0.029987331573018743, 0.36309868303301224, -0.07599168762711905, -0.17120073308430264, 0.18064945744413693, -0.22515577218945185, -0.07538860935473152, 0.19469833872192224, 0.1865895881112349, 0.07614508161510704, -0.034672579122867565, 0.012954801175017225, -0.04403891293579856, 0.19590809431826792, 0.17215076994182446, 0.017516383245662327, 0.26748871571242305, 0.1075751995776338, 0.04818634724420085, 0.09337278986172119, -0.1577184595349166, -0.0009207084490838697, -0.28001456748436687, -0.0985872550784626, -0.11170067537923233, -0.003856991269597113, -0.11827101852420235, -0.22098503903901673, 0.4548731348871932, 0.13598669135708252, 0.18629047300536344, 0.03701568790563477, 0.2893958177922641, 0.12530482386957095, 0.06773201782568121, 0.14373562675190427, 0.27278757822636707, 0.19292319595312574, 0.12422745366890567, -0.2360985951193054, -0.012109391540249462, 0.05033964925777104] |
1,802.04652 | Attosecond dispersive soft X-ray absorption fine structure spectroscopy
in graphite | Phase transitions of solids and structural transformations of molecules are
canonical examples of important photo-induced processes, whose underlying
mechanisms largely elude our comprehension due to our inability to correlate
electronic excitation with atomic position in real time. Here, we present a
decisive step towards such new methodology based on water-window-covering (284
eV to 543 eV) attosecond soft X-ray pulses that can simultaneously access
electronic and lattice parameters via dispersive X-ray absorption
fine-structure (XAFS) spectroscopy. We validate attoXAFS with an identification
of the {\sigma}* and {\pi}* orbital contributions to the density of states in
graphite simultaneously with its lattice's four characteristic bonding
distances. This work demonstrates the concept of attoXAFS as a powerful
real-time investigative tool which is equally applicable to gas-, liquid- and
condensed phase.
| cond-mat.mtrl-sci | phase transitions of solids and structural transformations of molecules are canonical examples of important photoinduced processes whose underlying mechanisms largely elude our comprehension due to our inability to correlate electronic excitation with atomic position in real time here we present a decisive step towards such new methodology based on waterwindowcovering 284 ev to 543 ev attosecond soft xray pulses that can simultaneously access electronic and lattice parameters via dispersive xray absorption finestructure xafs spectroscopy we validate attoxafs with an identification of the sigma and pi orbital contributions to the density of states in graphite simultaneously with its lattices four characteristic bonding distances this work demonstrates the concept of attoxafs as a powerful realtime investigative tool which is equally applicable to gas liquid and condensed phase | [['phase', 'transitions', 'of', 'solids', 'and', 'structural', 'transformations', 'of', 'molecules', 'are', 'canonical', 'examples', 'of', 'important', 'photoinduced', 'processes', 'whose', 'underlying', 'mechanisms', 'largely', 'elude', 'our', 'comprehension', 'due', 'to', 'our', 'inability', 'to', 'correlate', 'electronic', 'excitation', 'with', 'atomic', 'position', 'in', 'real', 'time', 'here', 'we', 'present', 'a', 'decisive', 'step', 'towards', 'such', 'new', 'methodology', 'based', 'on', 'waterwindowcovering', '284', 'ev', 'to', '543', 'ev', 'attosecond', 'soft', 'xray', 'pulses', 'that', 'can', 'simultaneously', 'access', 'electronic', 'and', 'lattice', 'parameters', 'via', 'dispersive', 'xray', 'absorption', 'finestructure', 'xafs', 'spectroscopy', 'we', 'validate', 'attoxafs', 'with', 'an', 'identification', 'of', 'the', 'sigma', 'and', 'pi', 'orbital', 'contributions', 'to', 'the', 'density', 'of', 'states', 'in', 'graphite', 'simultaneously', 'with', 'its', 'lattices', 'four', 'characteristic', 'bonding', 'distances', 'this', 'work', 'demonstrates', 'the', 'concept', 'of', 'attoxafs', 'as', 'a', 'powerful', 'realtime', 'investigative', 'tool', 'which', 'is', 'equally', 'applicable', 'to', 'gas', 'liquid', 'and', 'condensed', 'phase']] | [-0.07232961725476045, 0.15904442269508212, -0.08164665323575257, 0.03533202518048681, -0.058784152968924065, -0.1312976694383399, 0.11193046729046027, 0.44974391812794523, -0.2716651877701344, -0.31480294430903233, 0.02178944236232487, -0.28695186811926787, -0.13153672581023276, 0.17990182596640508, 0.028094106713129417, 0.0723655054371491, 0.0009481400789570858, -0.09142115398035308, -0.035238120935811496, -0.1726021929071514, 0.2740226788598983, 0.08644639946840947, 0.2539123199845771, 0.11201561954002216, 0.05520782958559661, 0.011770969817842373, 0.0045891692174873395, -0.050408901952084945, -0.1117312464623671, 0.1327598325456836, 0.3103722523531464, 0.023385220894315203, 0.20709762433219364, -0.4216425595499697, -0.21100407301020793, 0.030155202574249296, 0.1277522756145565, 0.10283122441758112, -0.04394465632694697, -0.27734131054555783, 0.011067605373086065, -0.11931019505394287, -0.1387532866773669, -0.1403627551826801, 0.038257424072667835, 0.025167361794747642, -0.21401301184363786, 0.07507170060817457, 0.02367484625657929, 0.07084758369801719, -0.10978128633855033, -0.0948080502862691, -0.019253893056884408, 0.09141704838982494, -0.00714082757705731, 0.04484327229457434, 0.17996028416454182, -0.08743665286828382, -0.15280391073587243, 0.44638942372908846, -0.037861082676156864, -0.0674289421018091, 0.23870943747957038, -0.13130707996057683, -0.14572375206769153, 0.19264657054569756, 0.1353367936690567, 0.11208168359985766, -0.1427326615686055, 0.012508304698056862, 0.012208128282151445, 0.24533540426875602, 0.037779415988164845, 0.11683733375422413, 0.23311713217284347, 0.17026336840163062, 0.016004055929293888, 0.10074677392382358, -0.12888792343628516, -0.05744263489700121, -0.23199726340406743, -0.14849878574118447, -0.170472066213957, 0.07784552409382323, -0.02919904884575011, -0.1641071878953791, 0.40939935092569985, 0.14004337876943534, 0.17589293934832342, -0.0466002702024063, 0.2983467344062968, 0.06605525520633998, 0.0418657193639789, -0.009483492996192491, 0.2381655600868532, 0.15892305535829213, 0.09408658634123133, -0.2712664957765154, 0.06279567973764583, 0.0030898140852156355] |
1,802.04653 | Derivations of the Planck Blackbody Spectrum from Thermodynamic Ideas in
Classical Physics with Classical Zero-Point Radiation | Based upon thermodynamic ideas, two new derivations of the Planck blackbody
spectrum are given within classical physics which includes classical zero-point
radiation. The first and second laws of thermodynamics, applied to a harmonic
oscillator or a radiation normal mode, require that the canonical potential
$\phi(\omega/T)$ is a function of a single variable corresponding to the ratio
of the oscillation frequency to the temperature. The second law of
thermodynamics involves extremum ideas which may be applied to thermal
radiation. Our first derivation of the Planck spectrum is based upon the idea
that the canonical potential $\phi(\omega/T)$ is a monotonic function and all
its derivatives are monotonic when interpolating between zero-point energy at
low temperature and energy equipartition at high temperature; the monotonic
behavior precludes the canonical potential from giving a preferred value for
the ratio $\omega/T.$ Our second derivation of the Planck spectrum is based
upon the requirement that the change in the Helmholtz free energy of the
radiation in a partitioned box held at constant temperature should be a minimum
at thermal equilibrium. Finally, the change in Casimir energy with change in
partition position for the radiation in a partitioned box is shown to
correspond at high temperature to the absence of zero-point energy when the
spectral energy per normal mode is chosen as the traditional Planck spectrum
which omits zero-point energy at low temperature; thus the idea of zero-point
energy is embedded in the traditional Planck spectrum. It is emphasized that
thermal radiation is intimately connected with zero-point radiation and the
structure of spacetime in classical physics.
| physics.gen-ph | based upon thermodynamic ideas two new derivations of the planck blackbody spectrum are given within classical physics which includes classical zeropoint radiation the first and second laws of thermodynamics applied to a harmonic oscillator or a radiation normal mode require that the canonical potential phiomegat is a function of a single variable corresponding to the ratio of the oscillation frequency to the temperature the second law of thermodynamics involves extremum ideas which may be applied to thermal radiation our first derivation of the planck spectrum is based upon the idea that the canonical potential phiomegat is a monotonic function and all its derivatives are monotonic when interpolating between zeropoint energy at low temperature and energy equipartition at high temperature the monotonic behavior precludes the canonical potential from giving a preferred value for the ratio omegat our second derivation of the planck spectrum is based upon the requirement that the change in the helmholtz free energy of the radiation in a partitioned box held at constant temperature should be a minimum at thermal equilibrium finally the change in casimir energy with change in partition position for the radiation in a partitioned box is shown to correspond at high temperature to the absence of zeropoint energy when the spectral energy per normal mode is chosen as the traditional planck spectrum which omits zeropoint energy at low temperature thus the idea of zeropoint energy is embedded in the traditional planck spectrum it is emphasized that thermal radiation is intimately connected with zeropoint radiation and the structure of spacetime in classical physics | [['based', 'upon', 'thermodynamic', 'ideas', 'two', 'new', 'derivations', 'of', 'the', 'planck', 'blackbody', 'spectrum', 'are', 'given', 'within', 'classical', 'physics', 'which', 'includes', 'classical', 'zeropoint', 'radiation', 'the', 'first', 'and', 'second', 'laws', 'of', 'thermodynamics', 'applied', 'to', 'a', 'harmonic', 'oscillator', 'or', 'a', 'radiation', 'normal', 'mode', 'require', 'that', 'the', 'canonical', 'potential', 'phiomegat', 'is', 'a', 'function', 'of', 'a', 'single', 'variable', 'corresponding', 'to', 'the', 'ratio', 'of', 'the', 'oscillation', 'frequency', 'to', 'the', 'temperature', 'the', 'second', 'law', 'of', 'thermodynamics', 'involves', 'extremum', 'ideas', 'which', 'may', 'be', 'applied', 'to', 'thermal', 'radiation', 'our', 'first', 'derivation', 'of', 'the', 'planck', 'spectrum', 'is', 'based', 'upon', 'the', 'idea', 'that', 'the', 'canonical', 'potential', 'phiomegat', 'is', 'a', 'monotonic', 'function', 'and', 'all', 'its', 'derivatives', 'are', 'monotonic', 'when', 'interpolating', 'between', 'zeropoint', 'energy', 'at', 'low', 'temperature', 'and', 'energy', 'equipartition', 'at', 'high', 'temperature', 'the', 'monotonic', 'behavior', 'precludes', 'the', 'canonical', 'potential', 'from', 'giving', 'a', 'preferred', 'value', 'for', 'the', 'ratio', 'omegat', 'our', 'second', 'derivation', 'of', 'the', 'planck', 'spectrum', 'is', 'based', 'upon', 'the', 'requirement', 'that', 'the', 'change', 'in', 'the', 'helmholtz', 'free', 'energy', 'of', 'the', 'radiation', 'in', 'a', 'partitioned', 'box', 'held', 'at', 'constant', 'temperature', 'should', 'be', 'a', 'minimum', 'at', 'thermal', 'equilibrium', 'finally', 'the', 'change', 'in', 'casimir', 'energy', 'with', 'change', 'in', 'partition', 'position', 'for', 'the', 'radiation', 'in', 'a', 'partitioned', 'box', 'is', 'shown', 'to', 'correspond', 'at', 'high', 'temperature', 'to', 'the', 'absence', 'of', 'zeropoint', 'energy', 'when', 'the', 'spectral', 'energy', 'per', 'normal', 'mode', 'is', 'chosen', 'as', 'the', 'traditional', 'planck', 'spectrum', 'which', 'omits', 'zeropoint', 'energy', 'at', 'low', 'temperature', 'thus', 'the', 'idea', 'of', 'zeropoint', 'energy', 'is', 'embedded', 'in', 'the', 'traditional', 'planck', 'spectrum', 'it', 'is', 'emphasized', 'that', 'thermal', 'radiation', 'is', 'intimately', 'connected', 'with', 'zeropoint', 'radiation', 'and', 'the', 'structure', 'of', 'spacetime', 'in', 'classical', 'physics']] | [-0.0976236587061976, 0.18455870304615019, -0.12445967255553114, 0.052354854324676126, -0.07106028537418752, -0.09707369719762937, 0.04453813103009452, 0.30254260193669325, -0.2767785824598832, -0.3156015231870697, 0.04578896747989347, -0.297147089995633, -0.030431490152295737, 0.18782059377281257, -0.030143979975946422, 0.015322122384759496, -0.02819252346853318, 0.08539935593398695, -0.053052928168654034, -0.1666032930579604, 0.33342817836091854, 0.1523861645910074, 0.308159819368484, 0.06417296317158616, 0.0918964548218355, -0.020975576031560195, 0.0004648251556318428, 0.030233796053892092, -0.12273809578948658, 0.055570951548361336, 0.20869404862060037, 0.061501237551055965, 0.25969106882803317, -0.3738983893508703, -0.2331070704785816, 0.11894537773332559, 0.0745804765133471, 0.09579103926125754, -0.019815905014183954, -0.16382768773655698, 0.029297091404089315, -0.13039698622719698, -0.15319160918079433, -0.02201673885610944, 0.007342249179600913, 0.007419505835969176, -0.2359366340890574, 0.1515174391315668, 0.04001380046065606, 0.020414301593291384, -0.10980390749546132, -0.11672549598188198, -0.054117084395329584, 0.07383550041527087, 0.022912751442163426, 0.05547671194472059, 0.17589602967450446, -0.09375938398807193, -0.05112619990359235, 0.39211885407530644, -0.09475954483173155, -0.1523484466761147, 0.15312350095609872, -0.15995510802576973, -0.09864522311181645, 0.15276738960710645, 0.07292138881712162, 0.06235123873798898, -0.1417612468507059, 0.10447071951898579, 0.07202838610555773, 0.19396873878667975, 0.07909367818274404, 0.031949694333889056, 0.27932347722526174, 0.10603396800252085, 0.060743716328943265, 0.1455248122319972, -0.06414411871446646, -0.11326908641331102, -0.3482312630294473, -0.11519441364453087, -0.25028327025961516, 0.06377705906879783, -0.10179915127105232, -0.18549020866737465, 0.37267281067033764, 0.12402390416059461, 0.1725643779282109, 0.04061064959159921, 0.3266653500540997, 0.1872048538166382, 0.06566408305297955, 0.06933815312549996, 0.3047042990492628, 0.12528361755539663, 0.13905853706091875, -0.2631633834561171, -0.034671788056584774, 0.054062020826677326] |
1,802.04654 | Analysis of Time Scale to Consensus in Voting Dynamics with more than
Two Options | We generalize a binary majority-vote model on adaptive networks to its
plurality-vote counterpart and analyze the time scale to consensus when voters
are given more than two options. When opinions are uniformly distributed in the
population of voters in the initial state, we find that the time scale to
consensus is shorter than the binary vote model from both numerical simulations
and mathematical analysis using the master equation for the three-state
plurality-vote model. When intervention such as opinion conversion is allowed,
as in the case of sudden change of mind of voter for any reason, the effort
needed to push the fragmented three-opinion population in the thermodynamic
limit to the consensus state, measured in minimal intervention cost, is less
than that needed to push a polarized two-opinion population to the consensus
state, when the degree ($p$) of homophily is less than 0.8. For finite system,
the fragmented three-opinion population will spontaneously reach the consensus
state, with faster time to consensus, compared to polarized two-opinion
population, for a broad range of $p$.
| physics.soc-ph | we generalize a binary majorityvote model on adaptive networks to its pluralityvote counterpart and analyze the time scale to consensus when voters are given more than two options when opinions are uniformly distributed in the population of voters in the initial state we find that the time scale to consensus is shorter than the binary vote model from both numerical simulations and mathematical analysis using the master equation for the threestate pluralityvote model when intervention such as opinion conversion is allowed as in the case of sudden change of mind of voter for any reason the effort needed to push the fragmented threeopinion population in the thermodynamic limit to the consensus state measured in minimal intervention cost is less than that needed to push a polarized twoopinion population to the consensus state when the degree p of homophily is less than 08 for finite system the fragmented threeopinion population will spontaneously reach the consensus state with faster time to consensus compared to polarized twoopinion population for a broad range of p | [['we', 'generalize', 'a', 'binary', 'majorityvote', 'model', 'on', 'adaptive', 'networks', 'to', 'its', 'pluralityvote', 'counterpart', 'and', 'analyze', 'the', 'time', 'scale', 'to', 'consensus', 'when', 'voters', 'are', 'given', 'more', 'than', 'two', 'options', 'when', 'opinions', 'are', 'uniformly', 'distributed', 'in', 'the', 'population', 'of', 'voters', 'in', 'the', 'initial', 'state', 'we', 'find', 'that', 'the', 'time', 'scale', 'to', 'consensus', 'is', 'shorter', 'than', 'the', 'binary', 'vote', 'model', 'from', 'both', 'numerical', 'simulations', 'and', 'mathematical', 'analysis', 'using', 'the', 'master', 'equation', 'for', 'the', 'threestate', 'pluralityvote', 'model', 'when', 'intervention', 'such', 'as', 'opinion', 'conversion', 'is', 'allowed', 'as', 'in', 'the', 'case', 'of', 'sudden', 'change', 'of', 'mind', 'of', 'voter', 'for', 'any', 'reason', 'the', 'effort', 'needed', 'to', 'push', 'the', 'fragmented', 'threeopinion', 'population', 'in', 'the', 'thermodynamic', 'limit', 'to', 'the', 'consensus', 'state', 'measured', 'in', 'minimal', 'intervention', 'cost', 'is', 'less', 'than', 'that', 'needed', 'to', 'push', 'a', 'polarized', 'twoopinion', 'population', 'to', 'the', 'consensus', 'state', 'when', 'the', 'degree', 'p', 'of', 'homophily', 'is', 'less', 'than', '08', 'for', 'finite', 'system', 'the', 'fragmented', 'threeopinion', 'population', 'will', 'spontaneously', 'reach', 'the', 'consensus', 'state', 'with', 'faster', 'time', 'to', 'consensus', 'compared', 'to', 'polarized', 'twoopinion', 'population', 'for', 'a', 'broad', 'range', 'of', 'p']] | [-0.0954505430789098, 0.11698780689737079, -0.06969181848254208, 0.0801980133952671, -0.06444339276079022, -0.17040906074505888, 0.11941091983704365, 0.392220055975826, -0.23722596653622754, -0.3029947952198529, 0.10152070311630657, -0.2670219998659664, -0.04683158470437541, 0.13992793648810076, -0.04652029364669358, 0.037417916786293255, 0.05777350248093581, 0.07782081186047031, -0.0003235838284078789, -0.28894533580223547, 0.2916326238310825, 0.05213827163536559, 0.2489012847858759, -0.04599159197985298, 0.06840862360733904, 0.002112896049569486, 0.04874921226547214, 0.006553524963514149, -0.09682408789465849, 0.04952629716053866, 0.2520889384557673, 0.1372396564551926, 0.33237997441394634, -0.4319481344468761, -0.1820979347923629, 0.16952271412161782, 0.1490505046717692, 0.16414456236127176, 0.01220538295090283, -0.2715320475018251, 0.08935939430460682, -0.20625029370532172, -0.1322015994909214, -0.02474350260695911, 0.05575431345237626, 0.015256292502564646, -0.26394063185312244, 0.08646280069601292, 0.04366870294733528, 0.05871907106671504, -0.062053635191548155, -0.10530355112145148, -0.050942506859002756, 0.11025465192812446, 0.039207262663056325, 0.036883315858458394, 0.12532675065840895, -0.16511120350094655, -0.12002892485051825, 0.3818857701745821, -0.033610017492033524, -0.16320116391741774, 0.17795233901492075, -0.16824688898584647, -0.10929012417041681, 0.11996012926646317, 0.18850808097757618, 0.11888771229532509, -0.13309995180073506, -0.01839952727531938, -0.028836422921185604, 0.23930614965570252, 0.004066174032918194, 0.007555179232568072, 0.14578946383550154, 0.21380135749142662, 0.11884214520203876, 0.11286146654978896, -0.05133296311451721, -0.2079562512362561, -0.2230831648914786, -0.11867231605247709, -0.1640447155458101, 0.07268661000610639, -0.09198798671925075, -0.11244737051362008, 0.3754296632407353, 0.18988514828294167, 0.1603132758905011, 0.12514762651333203, 0.24970078127178205, 0.08881957772220567, 0.026486865345562934, 0.1036346893449864, 0.22239338004640277, 0.08071532958916972, 0.09730567483569098, -0.20845026024944036, 0.14087655207983693, -0.01506191257343829] |
1,802.04655 | Optimal Slice Allocation in 5G Core Networks | 5G network slicing is essential to providing flexible, scalable and on-demand
solutions for the vast array of applications in 5G networks. Two key challenges
of 5G network slicing are function isolation (intra-slice) and guaranteeing
end-to-end delay for a slice. In this paper, we address the question of optimal
allocation of a slice in 5G core networks by tackling these two challenges. We
adopt and extend the work by D. Dietrich [1] to create a model that satisfies
constraints on end-to-end delay as well as isolation between components of a
slice for reliability.
| cs.NI | 5g network slicing is essential to providing flexible scalable and ondemand solutions for the vast array of applications in 5g networks two key challenges of 5g network slicing are function isolation intraslice and guaranteeing endtoend delay for a slice in this paper we address the question of optimal allocation of a slice in 5g core networks by tackling these two challenges we adopt and extend the work by d dietrich 1 to create a model that satisfies constraints on endtoend delay as well as isolation between components of a slice for reliability | [['5g', 'network', 'slicing', 'is', 'essential', 'to', 'providing', 'flexible', 'scalable', 'and', 'ondemand', 'solutions', 'for', 'the', 'vast', 'array', 'of', 'applications', 'in', '5g', 'networks', 'two', 'key', 'challenges', 'of', '5g', 'network', 'slicing', 'are', 'function', 'isolation', 'intraslice', 'and', 'guaranteeing', 'endtoend', 'delay', 'for', 'a', 'slice', 'in', 'this', 'paper', 'we', 'address', 'the', 'question', 'of', 'optimal', 'allocation', 'of', 'a', 'slice', 'in', '5g', 'core', 'networks', 'by', 'tackling', 'these', 'two', 'challenges', 'we', 'adopt', 'and', 'extend', 'the', 'work', 'by', 'd', 'dietrich', '1', 'to', 'create', 'a', 'model', 'that', 'satisfies', 'constraints', 'on', 'endtoend', 'delay', 'as', 'well', 'as', 'isolation', 'between', 'components', 'of', 'a', 'slice', 'for', 'reliability']] | [-0.22260278871323427, -0.02008218662408383, 0.03139752732670825, 0.043962360764651195, -0.05773164977764954, -0.1909948995174921, 0.060223860518105896, 0.40802694750069035, -0.24844046919505394, -0.28073049458148686, 0.1252442029540164, -0.19099627218573637, -0.20036233686677524, 0.17073597490493936, -0.11452966983146641, 0.12592637235217768, 0.0719180463904353, -0.08049560602470908, -0.03565882074737759, -0.22434856096262354, 0.3361230468903871, 0.06242717270557161, 0.34557464265305066, 0.09431051724063962, 0.09866648032481823, -0.012834915886228175, -0.03418600114831782, -0.04016818006715292, -0.09315442828420087, 0.1957419893309555, 0.32326624599163944, 0.234125820803456, 0.33751694607022015, -0.4369286155611601, -0.2529571601809711, 0.06056775344515462, 0.21705673425964525, 0.03962078299778311, -0.013717334979288431, -0.2427306597414629, 0.14912857925114426, -0.2333743779555611, -0.10355623380240539, -0.03853397217133771, -0.0014230135990225751, 0.0712472169897924, -0.2828288332194738, 0.0014509524866614652, 0.02310268331000217, -0.010372291865718105, -0.04744156778526857, -0.03664817709637725, 0.035199897022128265, 0.17724783201297017, -0.009037971277670611, 0.05852984777985788, 0.07772509185799761, -0.16658045869553462, -0.1311022505245131, 0.3954856017523486, -0.016410150453853217, -0.2281894916466073, 0.12942611838124043, 0.003285175587971816, -0.20315656572600585, 0.05530757575963988, 0.22677934005269376, 0.05643264141500644, -0.18438145063270855, 0.033564524697873785, 0.014671034857873683, 0.12296782157120659, 0.10913951083025693, 0.10101997460056421, 0.21446450131580883, 0.2818457009068326, 0.15720123919820014, 0.1507052429040651, -0.06425675300061298, -0.0827626031064226, -0.2683933859326593, -0.19410935222454692, -0.17225239312519197, 0.021854975807440023, -0.07505051863494294, -0.12929209254925017, 0.4149623416141485, 0.159504374425919, 0.16137283368405644, 0.16449073465217068, 0.38160323450827727, 0.03139118136301556, 0.10083638577286722, 0.11791891964537132, 0.1767128700107012, 0.05767572880722582, 0.17546509712954741, -0.10642816009931266, 0.056219413962579616, 0.029401185914732352] |
1,802.04656 | On convergence of arbitrary D-solution of steady Navier--Stokes system
in 2D exterior domains | We study solutions to stationary Navier Stokes system in two dimensional
exterior domain. We prove that any such solution with finite Dirichlet integral
converges at infinity uniformly. No additional condition (on symmetry or
smallness) are assumed.
| math.AP math-ph math.MP | we study solutions to stationary navier stokes system in two dimensional exterior domain we prove that any such solution with finite dirichlet integral converges at infinity uniformly no additional condition on symmetry or smallness are assumed | [['we', 'study', 'solutions', 'to', 'stationary', 'navier', 'stokes', 'system', 'in', 'two', 'dimensional', 'exterior', 'domain', 'we', 'prove', 'that', 'any', 'such', 'solution', 'with', 'finite', 'dirichlet', 'integral', 'converges', 'at', 'infinity', 'uniformly', 'no', 'additional', 'condition', 'on', 'symmetry', 'or', 'smallness', 'are', 'assumed']] | [-0.19705310489775407, 0.08732141013671127, -0.07478291811680214, 0.024757249642991357, -0.16553970353884828, -0.20229860881550443, -0.06779798658357726, 0.35531370616000557, -0.2844225190476411, -0.16031680836264664, 0.2166877053257647, -0.3150654620904889, -0.058061046816874295, 0.08072662720223889, -0.05962303520128545, 0.1204737653541896, 0.11265848843484288, 0.07838600544750483, -0.049651551183261394, -0.18765508528384897, 0.4105541974487197, -0.1606260992314977, 0.27500458154827356, -0.002723211448432671, 0.1441012870135536, -0.060475929271584995, 0.04182636956748967, 0.006276958622038364, -0.20240032484778364, -0.027180733003964026, 0.20246043344700915, 0.010923949956324779, 0.2789819205386771, -0.4740101388759083, -0.21965564942608276, 0.1928544180571205, 0.1792745115623499, 0.05535830146012207, -0.028366133324905403, -0.2635365874092612, 0.17860136196638146, -0.06415927570520176, -0.2527157789251457, -0.0539308255020943, -0.0328625516138143, 0.04601896639279504, -0.37947262789950603, 0.08918068633000883, 0.1083801460141937, 0.07788886010853781, -0.22413038044598782, -0.09658430843652847, -0.02482876395030568, 0.0179997348653463, 0.11068729207747513, -0.017230985847870924, 0.016776556385189503, -0.06364802716355673, -0.007241539191454649, 0.3195950957015157, -0.11166214499907154, -0.39444772340357304, 0.24493752725215423, -0.2118856930303284, -0.07479992851666692, 0.12032044690568, 0.12884584189547846, 0.16167700417443281, -0.10683373351477915, 0.21087868290487677, -0.09659891880841719, 0.173499175787179, 0.20046560239926395, -0.05023034395869925, 0.12296672693143289, 0.04877922311425209, 0.2346265210977031, 0.1550878931561278, -0.012032275624935411, -0.13933927255372205, -0.44596350234415794, -0.15524483614394236, -0.2241991799738672, 0.16563408242331612, -0.1412754817607088, -0.22839092473602957, 0.24961517197597358, 0.11112251920955411, 0.14208644757875138, 0.06711207826932271, 0.23535214385224712, 0.20716622612801278, -0.018277717754244804, 0.14435651080889833, 0.11718537801385133, 0.08919922567050283, 0.11422363468187137, -0.2025430255000376, -0.00817792945437961, 0.1786871224952241] |
1,802.04657 | Analyzing and Mitigating the Impact of Permanent Faults on a Systolic
Array Based Neural Network Accelerator | Due to their growing popularity and computational cost, deep neural networks
(DNNs) are being targeted for hardware acceleration. A popular architecture for
DNN acceleration, adopted by the Google Tensor Processing Unit (TPU), utilizes
a systolic array based matrix multiplication unit at its core. This paper deals
with the design of fault-tolerant, systolic array based DNN accelerators for
high defect rate technologies. To this end, we empirically show that the
classification accuracy of a baseline TPU drops significantly even at extremely
low fault rates (as low as $0.006\%$). We then propose two novel strategies,
fault-aware pruning (FAP) and fault-aware pruning+retraining (FAP+T), that
enable the TPU to operate at fault rates of up to $50\%$, with negligible drop
in classification accuracy (as low as $0.1\%$) and no run-time performance
overhead. The FAP+T does introduce a one-time retraining penalty per TPU chip
before it is deployed, but we propose optimizations that reduce this one-time
penalty to under 12 minutes. The penalty is then amortized over the entire
lifetime of the TPU's operation.
| cs.LG cs.AR cs.CV cs.NE | due to their growing popularity and computational cost deep neural networks dnns are being targeted for hardware acceleration a popular architecture for dnn acceleration adopted by the google tensor processing unit tpu utilizes a systolic array based matrix multiplication unit at its core this paper deals with the design of faulttolerant systolic array based dnn accelerators for high defect rate technologies to this end we empirically show that the classification accuracy of a baseline tpu drops significantly even at extremely low fault rates as low as 0006 we then propose two novel strategies faultaware pruning fap and faultaware pruningretraining fapt that enable the tpu to operate at fault rates of up to 50 with negligible drop in classification accuracy as low as 01 and no runtime performance overhead the fapt does introduce a onetime retraining penalty per tpu chip before it is deployed but we propose optimizations that reduce this onetime penalty to under 12 minutes the penalty is then amortized over the entire lifetime of the tpus operation | [['due', 'to', 'their', 'growing', 'popularity', 'and', 'computational', 'cost', 'deep', 'neural', 'networks', 'dnns', 'are', 'being', 'targeted', 'for', 'hardware', 'acceleration', 'a', 'popular', 'architecture', 'for', 'dnn', 'acceleration', 'adopted', 'by', 'the', 'google', 'tensor', 'processing', 'unit', 'tpu', 'utilizes', 'a', 'systolic', 'array', 'based', 'matrix', 'multiplication', 'unit', 'at', 'its', 'core', 'this', 'paper', 'deals', 'with', 'the', 'design', 'of', 'faulttolerant', 'systolic', 'array', 'based', 'dnn', 'accelerators', 'for', 'high', 'defect', 'rate', 'technologies', 'to', 'this', 'end', 'we', 'empirically', 'show', 'that', 'the', 'classification', 'accuracy', 'of', 'a', 'baseline', 'tpu', 'drops', 'significantly', 'even', 'at', 'extremely', 'low', 'fault', 'rates', 'as', 'low', 'as', '0006', 'we', 'then', 'propose', 'two', 'novel', 'strategies', 'faultaware', 'pruning', 'fap', 'and', 'faultaware', 'pruningretraining', 'fapt', 'that', 'enable', 'the', 'tpu', 'to', 'operate', 'at', 'fault', 'rates', 'of', 'up', 'to', '50', 'with', 'negligible', 'drop', 'in', 'classification', 'accuracy', 'as', 'low', 'as', '01', 'and', 'no', 'runtime', 'performance', 'overhead', 'the', 'fapt', 'does', 'introduce', 'a', 'onetime', 'retraining', 'penalty', 'per', 'tpu', 'chip', 'before', 'it', 'is', 'deployed', 'but', 'we', 'propose', 'optimizations', 'that', 'reduce', 'this', 'onetime', 'penalty', 'to', 'under', '12', 'minutes', 'the', 'penalty', 'is', 'then', 'amortized', 'over', 'the', 'entire', 'lifetime', 'of', 'the', 'tpus', 'operation']] | [-0.12304639428233106, 0.05195981831084715, -0.02389430926580514, 0.028964845393645754, -0.06283120115681197, -0.22488403289961362, 0.10406962586663819, 0.4440027358399502, -0.252886204037904, -0.3312546352057585, 0.15251453338299012, -0.22691523937716002, -0.14265410602092743, 0.18792923174415982, -0.1438018784891548, 0.10499294821437659, 0.09811074053695415, 0.03195275384322962, -0.10104580187423078, -0.3104434444061813, 0.19889408810732198, 0.1604601218019698, 0.3274345513214246, 0.06615665154302926, 0.14948702504209774, -0.049194712726776266, 0.02656257269215227, -0.04919882281406206, -0.03957880766423235, 0.11589258583678332, 0.28731211555922137, 0.15960369250526474, 0.3496525790050371, -0.44776591654157355, -0.17425969755831397, 0.09049699693111636, 0.136868941644761, 0.05811947656513353, -0.052153631282549, -0.20810915651964024, 0.15471469470260976, -0.24782165246627605, -0.025788706881160448, -0.08960911601925978, -0.004267741083389237, 0.0005377332896127232, -0.2509015541512608, 0.03270396933935228, 0.018746955738779866, 0.03067523725552573, 0.0014685056750230224, -0.1339536630409947, 0.04830725017070238, 0.08736616817934971, -0.013072553599375255, 0.06443045079331136, 0.19974104814796842, -0.12120444542545426, -0.12612005134135307, 0.3355900098187184, -0.056831665023873074, -0.1638729384701167, 0.1752438875876015, -0.04198312565235288, -0.14219102455813082, 0.14451484391022296, 0.2598238688139342, 0.07656290541247775, -0.12249552471274953, 0.025633290376260578, 0.08525992774160668, 0.22174748603512334, 0.098074449014218, 0.047583190715245326, 0.1365933207326591, 0.2778131628888548, 0.0987885514845229, 0.15125033988373443, -0.14951224880115616, -0.02634941698107425, -0.2276147180680363, -0.14287122186007245, -0.17279859975956025, 0.019175117739818927, -0.11622419884164022, -0.16305164399714808, 0.3474239727116323, 0.1662027182257069, 0.16138483871951134, 0.1859098860517233, 0.3792171276595798, 0.04380919425083058, 0.16657039616118363, 0.13847578604582805, 0.18192369020765736, 0.02508579014517766, 0.15673901087506065, -0.1834307664123896, 0.0744503325799347, 0.030362705813742997] |
1,802.04658 | Hypersingular nonlinear boundary-value problems with a small parameter | For the first time, some hypersingular nonlinear boundary-value problems with
a small parameter~$\varepsilon$ at the highest derivative are described. These
problems essentially (qualitatively and quantitatively) differ from the usual
linear and quasilinear singularly perturbed boundary-value problems and have
the following unusual properties:
(i) in hypersingular boundary-value problems, super thin boundary layers
arise, and the derivative at the boundary layer can have very large values of
the order of $e^{1/\varepsilon}$ and more (in standard problems with boundary
layers, the derivative at the boundary has the order of $\varepsilon^{-1}$ or
less);
(ii) in hypersingular boundary-value problems, the position of the boundary
layer is determined by the values of the unknown function at the boundaries (in
standard problems with boundary layers, the position of the boundary layer is
determined by coefficients of the given equation, and the values of the unknown
function at the boundaries do not play a role here);
(iii) hypersingular boundary-value problems do not admit a direct application
of the method of matched asymptotic expansions (without a preliminary nonlinear
point transformation of the equation under consideration).
Examples of hypersingular nonlinear boundary-value problems with ODEs and
PDEs are given and their exact solutions are obtained. It is important to note
that the exact solutions presented in this paper can be used to compare the
effectiveness of various methods of numerical integration of singularly
perturbed problems with boundary layers, and also to develop new numerical and
approximate analytical methods.
| math.AP cs.NA math-ph math.MP physics.class-ph | for the first time some hypersingular nonlinear boundaryvalue problems with a small parametervarepsilon at the highest derivative are described these problems essentially qualitatively and quantitatively differ from the usual linear and quasilinear singularly perturbed boundaryvalue problems and have the following unusual properties i in hypersingular boundaryvalue problems super thin boundary layers arise and the derivative at the boundary layer can have very large values of the order of e1varepsilon and more in standard problems with boundary layers the derivative at the boundary has the order of varepsilon1 or less ii in hypersingular boundaryvalue problems the position of the boundary layer is determined by the values of the unknown function at the boundaries in standard problems with boundary layers the position of the boundary layer is determined by coefficients of the given equation and the values of the unknown function at the boundaries do not play a role here iii hypersingular boundaryvalue problems do not admit a direct application of the method of matched asymptotic expansions without a preliminary nonlinear point transformation of the equation under consideration examples of hypersingular nonlinear boundaryvalue problems with odes and pdes are given and their exact solutions are obtained it is important to note that the exact solutions presented in this paper can be used to compare the effectiveness of various methods of numerical integration of singularly perturbed problems with boundary layers and also to develop new numerical and approximate analytical methods | [['for', 'the', 'first', 'time', 'some', 'hypersingular', 'nonlinear', 'boundaryvalue', 'problems', 'with', 'a', 'small', 'parametervarepsilon', 'at', 'the', 'highest', 'derivative', 'are', 'described', 'these', 'problems', 'essentially', 'qualitatively', 'and', 'quantitatively', 'differ', 'from', 'the', 'usual', 'linear', 'and', 'quasilinear', 'singularly', 'perturbed', 'boundaryvalue', 'problems', 'and', 'have', 'the', 'following', 'unusual', 'properties', 'i', 'in', 'hypersingular', 'boundaryvalue', 'problems', 'super', 'thin', 'boundary', 'layers', 'arise', 'and', 'the', 'derivative', 'at', 'the', 'boundary', 'layer', 'can', 'have', 'very', 'large', 'values', 'of', 'the', 'order', 'of', 'e1varepsilon', 'and', 'more', 'in', 'standard', 'problems', 'with', 'boundary', 'layers', 'the', 'derivative', 'at', 'the', 'boundary', 'has', 'the', 'order', 'of', 'varepsilon1', 'or', 'less', 'ii', 'in', 'hypersingular', 'boundaryvalue', 'problems', 'the', 'position', 'of', 'the', 'boundary', 'layer', 'is', 'determined', 'by', 'the', 'values', 'of', 'the', 'unknown', 'function', 'at', 'the', 'boundaries', 'in', 'standard', 'problems', 'with', 'boundary', 'layers', 'the', 'position', 'of', 'the', 'boundary', 'layer', 'is', 'determined', 'by', 'coefficients', 'of', 'the', 'given', 'equation', 'and', 'the', 'values', 'of', 'the', 'unknown', 'function', 'at', 'the', 'boundaries', 'do', 'not', 'play', 'a', 'role', 'here', 'iii', 'hypersingular', 'boundaryvalue', 'problems', 'do', 'not', 'admit', 'a', 'direct', 'application', 'of', 'the', 'method', 'of', 'matched', 'asymptotic', 'expansions', 'without', 'a', 'preliminary', 'nonlinear', 'point', 'transformation', 'of', 'the', 'equation', 'under', 'consideration', 'examples', 'of', 'hypersingular', 'nonlinear', 'boundaryvalue', 'problems', 'with', 'odes', 'and', 'pdes', 'are', 'given', 'and', 'their', 'exact', 'solutions', 'are', 'obtained', 'it', 'is', 'important', 'to', 'note', 'that', 'the', 'exact', 'solutions', 'presented', 'in', 'this', 'paper', 'can', 'be', 'used', 'to', 'compare', 'the', 'effectiveness', 'of', 'various', 'methods', 'of', 'numerical', 'integration', 'of', 'singularly', 'perturbed', 'problems', 'with', 'boundary', 'layers', 'and', 'also', 'to', 'develop', 'new', 'numerical', 'and', 'approximate', 'analytical', 'methods']] | [-0.1074055114221026, 0.042096558351941565, -0.0430627252871884, 0.023110367824382923, -0.10588481423464861, -0.13429477075783616, -0.037882514063645394, 0.34399206010585137, -0.31566090637699085, -0.28982471273617544, 0.18371032954322453, -0.2970088476185102, -0.14941618168984164, 0.1931402231784577, -0.047575405743369395, 0.13197886900093278, 0.09852757216926585, 0.008705101758637961, -0.1370218789967847, -0.22603061534959742, 0.3895765505057383, -0.01904918877606062, 0.20620035916527218, 0.0382660676083686, 0.11754988829030635, -0.05392080832946491, 0.002853704899787269, 0.03449221667932703, -0.15204284675930196, 0.10487216810319334, 0.27669747578812404, -0.0006233315082623603, 0.29929600897780123, -0.4711853257122826, -0.2195528857449585, 0.056199993898576876, 0.13237720664511335, 0.08121517711081244, -0.010262233563116752, -0.26486483087683926, 0.08729633211772493, -0.06486164103955665, -0.17715744803402017, -0.02848980954174507, -0.023269004454004004, 0.04307360080209501, -0.2929865022479715, 0.12497517903070052, 0.04043526081566481, 0.018732437701459895, -0.1326840957923931, -0.1279532335143774, -0.0034240688123007086, 0.11187763070152637, 0.052281089324226725, -0.03550603351892626, 0.045079240666583496, -0.16062252316128542, -0.09321182858832973, 0.37154141408490376, -0.032524826398436374, -0.2913672016683391, 0.2026561646226873, -0.13082760080417738, -0.09283528838485004, 0.13303558715004407, 0.16105365671831717, 0.20278906646937608, -0.13091942834013953, 0.1228945328314365, -0.011213669609872901, 0.12571821035681036, 0.0930002252373131, -0.02334001998397264, 0.12032138895382113, 0.11866266979102759, 0.08664604364795253, 0.13591034155527248, -0.033676089308759635, -0.10773282976464388, -0.35410010064853, -0.12467096350353925, -0.15389415015109834, -0.011906364019415243, -0.14658973707713463, -0.22905417478227236, 0.38505470436859, 0.1429959886152535, 0.17253009315104562, 0.02657881073178129, 0.22901478949339782, 0.23175303907272346, 0.039973521328709544, 0.06617293842731321, 0.23398332515634854, 0.1347427175048382, 0.144873095924057, -0.23116938791317032, 0.06515352264482607, 0.1323764789364043] |
1,802.04659 | A Faster Isomorphism Test for Graphs of Small Degree | In a recent breakthrough, Babai (STOC 2016) gave a quasipolynomial time graph
isomorphism test. In this work, we give an improved isomorphism test for graphs
of small degree: our algorithms runs in time $n^{O((\log d)^{c})}$, where $n$
is the number of vertices of the input graphs, $d$ is the maximum degree of the
input graphs, and $c$ is an absolute constant. The best previous isomorphism
test for graphs of maximum degree $d$ due to Babai, Kantor and Luks (FOCS 1983)
runs in time $n^{O(d/ \log d)}$.
| cs.DS cs.DM math.CO math.GR | in a recent breakthrough babai stoc 2016 gave a quasipolynomial time graph isomorphism test in this work we give an improved isomorphism test for graphs of small degree our algorithms runs in time nolog dc where n is the number of vertices of the input graphs d is the maximum degree of the input graphs and c is an absolute constant the best previous isomorphism test for graphs of maximum degree d due to babai kantor and luks focs 1983 runs in time nod log d | [['in', 'a', 'recent', 'breakthrough', 'babai', 'stoc', '2016', 'gave', 'a', 'quasipolynomial', 'time', 'graph', 'isomorphism', 'test', 'in', 'this', 'work', 'we', 'give', 'an', 'improved', 'isomorphism', 'test', 'for', 'graphs', 'of', 'small', 'degree', 'our', 'algorithms', 'runs', 'in', 'time', 'nolog', 'dc', 'where', 'n', 'is', 'the', 'number', 'of', 'vertices', 'of', 'the', 'input', 'graphs', 'd', 'is', 'the', 'maximum', 'degree', 'of', 'the', 'input', 'graphs', 'and', 'c', 'is', 'an', 'absolute', 'constant', 'the', 'best', 'previous', 'isomorphism', 'test', 'for', 'graphs', 'of', 'maximum', 'degree', 'd', 'due', 'to', 'babai', 'kantor', 'and', 'luks', 'focs', '1983', 'runs', 'in', 'time', 'nod', 'log', 'd']] | [-0.19928533058115389, 0.07651292268480553, -0.04828159464523196, -0.0054715581977371735, -0.06848068186081946, -0.16751295220929868, 0.06757184828978119, 0.3201840762915306, -0.24889245686164602, -0.4452650849165958, 0.0456336249088392, -0.2517344487484458, -0.10760487551356904, 0.15495408366862035, -0.14642839507351435, 0.10507489212377127, 0.10005257986377665, 0.02690223681328948, 0.03381421428368708, -0.43577791645555747, 0.19042798469308764, 0.07354292226143094, 0.16980386210529697, 0.09724148092141678, 0.06511818484923002, 0.02902489705119542, -0.028595377886018087, -0.012065163683579412, -0.16779628379248776, 0.031451308233446856, 0.282215551446127, 0.19208554654966953, 0.22406756804259712, -0.34751504160420493, -0.07921155856727341, 0.1854425373996153, 0.08386662503336231, 0.07958877212936492, 0.0412461387729922, -0.21006766398069124, 0.07654064694192088, -0.07480990834893567, -0.0701310377172736, 0.016876700572496236, 0.22862755672919544, -0.009829813040533038, -0.31799488761570566, 0.021031562271419654, 0.15121422167650836, 0.07893736678890365, 0.08896677986025638, -0.17385891413446083, 0.07332230711539904, 0.08194153565848462, -0.07953620950832184, 0.16960368813881868, -0.018748827353065704, -0.0979012749239066, -0.2591767440181832, 0.309769757936687, -0.04394150822055201, -0.05633340513084604, 0.12587185407079063, -0.11572257619416125, -0.18465042020584088, 0.09498987381541452, 0.1941324751932434, 0.20513588742916147, -0.02976763153686946, 0.22146193543313678, -0.14112473352877206, 0.1677403865371246, 0.20150061171545192, -0.08034334872134549, -0.009744450601554194, 0.1412298834211258, 0.11105284197689143, 0.1569758679685291, 0.040816687134116195, 0.016362409215680388, -0.25599171455169834, -0.16488768431888676, -0.25323536555109505, 0.07773656757591768, -0.22707082097233153, -0.12285847717565809, 0.4192622231406181, 0.09680307569891908, 0.22939115798447368, 0.17405407229265155, 0.21338431118056178, 0.04370084271338487, -0.017893515940116674, 0.2138831848874255, 0.1653954203181012, 0.16403448464738768, 0.036384111237820496, -0.19339397654132268, 0.09091565323056826, 0.16806845061567632] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.