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,803.03567 | Review of Blockchain Technology and its Expectations: Case of the Energy
Sector | This article suggests that the worldwide relevance of blockchain technology
is motivated by the changes that it is expected to cause in: (i) the way that
business is organised and (ii) regulated, as well as (iii) by the way that it
changes the role of individuals within a society. The article presents an
overview of the features of blockchain technology. It then takes a closer look
into the developments within the energy sector across the world to gain a
preliminary indication of whether the stated expectations are coming to
reality. As a result of this review, we remain cautiously optimistic that
blockchain technology could deliver the expected impact.
| cs.CY | this article suggests that the worldwide relevance of blockchain technology is motivated by the changes that it is expected to cause in i the way that business is organised and ii regulated as well as iii by the way that it changes the role of individuals within a society the article presents an overview of the features of blockchain technology it then takes a closer look into the developments within the energy sector across the world to gain a preliminary indication of whether the stated expectations are coming to reality as a result of this review we remain cautiously optimistic that blockchain technology could deliver the expected impact | [['this', 'article', 'suggests', 'that', 'the', 'worldwide', 'relevance', 'of', 'blockchain', 'technology', 'is', 'motivated', 'by', 'the', 'changes', 'that', 'it', 'is', 'expected', 'to', 'cause', 'in', 'i', 'the', 'way', 'that', 'business', 'is', 'organised', 'and', 'ii', 'regulated', 'as', 'well', 'as', 'iii', 'by', 'the', 'way', 'that', 'it', 'changes', 'the', 'role', 'of', 'individuals', 'within', 'a', 'society', 'the', 'article', 'presents', 'an', 'overview', 'of', 'the', 'features', 'of', 'blockchain', 'technology', 'it', 'then', 'takes', 'a', 'closer', 'look', 'into', 'the', 'developments', 'within', 'the', 'energy', 'sector', 'across', 'the', 'world', 'to', 'gain', 'a', 'preliminary', 'indication', 'of', 'whether', 'the', 'stated', 'expectations', 'are', 'coming', 'to', 'reality', 'as', 'a', 'result', 'of', 'this', 'review', 'we', 'remain', 'cautiously', 'optimistic', 'that', 'blockchain', 'technology', 'could', 'deliver', 'the', 'expected', 'impact']] | [-0.10189100834799723, 0.08898020951474556, -0.09350500937068353, 0.07396413647694755, -0.09352732106560359, -0.09088809543754905, 0.07506977289018256, 0.340587893569911, -0.26775935995478733, -0.3220360000419465, 0.11686602909079132, -0.2583427982646282, -0.1905324102575563, 0.17538761560098026, -0.10603511318374702, -0.05433820509696724, 0.0604742157857227, 0.036128461186308414, 0.00431181006004206, -0.26091341216858754, 0.30962510041340635, 0.10798748059163767, 0.29461379295766904, 0.10534038626550075, 0.04259165093578674, -0.03823876080019141, -0.0469058922058644, 0.013602971151057217, -0.09185761737124401, 0.15687694233161487, 0.3030172929305721, 0.22049560994599704, 0.3505774078959668, -0.4359768235331608, -0.15505830046755295, 0.07658911141549686, 0.14422351838934613, 0.09720470509664328, -0.07072369305037514, -0.2827663433498755, 0.07085619128688618, -0.23111581828238237, -0.18250165539966137, -0.016772656968829257, 0.030354590905416343, -0.011876387888117245, -0.21865132225987813, 0.012169908430358325, 0.0623744334260226, 0.02878422811799855, -0.016699984630880255, -0.09152955520484182, -0.00977138778479356, 0.15159864275483415, 0.0916123542680267, 0.056995410265194044, 0.17774441755911405, -0.13694339127633376, -0.11684847022924158, 0.42594731552526355, -0.031050675324405783, -0.09665560855905318, 0.13954494632047568, -0.11242002634659272, -0.14115775227374225, 0.06272536700513835, 0.1698943059826787, 0.0008091221399674261, -0.18544627026723767, 0.04353781879601431, -0.025356528823505396, 0.150013490101426, 0.0034818552537924713, 0.060895085020025295, 0.268007196287659, 0.22549802939735214, 0.07232368858186183, 0.08746361020193608, -0.02041769577017813, -0.14128954677963285, -0.3266180401529979, -0.16246140926334732, -0.12844905943644266, 0.06368025730329531, -0.0048559997186304014, -0.13793901213513757, 0.38651403023956205, 0.22194808829334323, 0.1794672634202504, -0.009027069467130652, 0.31087948655692377, 0.050071002657878796, 0.09657833212986588, 0.05306100510319488, 0.25319805627481806, 0.032883672078174574, 0.19069018758212528, -0.13030102582544917, 0.153903702808613, -0.02156673071483426] |
1,803.03568 | The Mid-IR Albedo of Neptune Derived from Spitzer Observations | Mid-IR albedo values of Neptune are derived from Spitzer Space Telescope
measurements reported by Stauffer et al. (2016). The method of this derivation
is described and the results indicate that the geometric albedo was about 1% or
less at the time of the observations in 2016. Short-term mid-IR variability of
Neptune, evidenced by the Spitzer observations themselves, indicates an albedo
at 3.6 microns ranging from 0.2% to 0.6% with a mean of 0.4%. The corresponding
albedos at 4.5 microns are 0.7%, 1.3% and 0.9%. Furthermore, the 60-year
history of visible-light brightness variations, which show that Neptune was
significantly fainter a few decades ago, suggests that the mid-IR albedo during
that earlier period of time may have been much less than 1%. The albedo values
reported here can have implications for models of Neptune's atmosphere.
However, the mid-IR brightness of Neptune cannot contribute very strongly to
its total albedo because the Sun emits only about 2% of its flux long-ward of 3
micron. By contrast, the Sun emits 42% of its flux at visible and near-UV
wavelengths where the planet's albedo is in the tens of percents.
| astro-ph.EP | midir albedo values of neptune are derived from spitzer space telescope measurements reported by stauffer et al 2016 the method of this derivation is described and the results indicate that the geometric albedo was about 1 or less at the time of the observations in 2016 shortterm midir variability of neptune evidenced by the spitzer observations themselves indicates an albedo at 36 microns ranging from 02 to 06 with a mean of 04 the corresponding albedos at 45 microns are 07 13 and 09 furthermore the 60year history of visiblelight brightness variations which show that neptune was significantly fainter a few decades ago suggests that the midir albedo during that earlier period of time may have been much less than 1 the albedo values reported here can have implications for models of neptunes atmosphere however the midir brightness of neptune cannot contribute very strongly to its total albedo because the sun emits only about 2 of its flux longward of 3 micron by contrast the sun emits 42 of its flux at visible and nearuv wavelengths where the planets albedo is in the tens of percents | [['midir', 'albedo', 'values', 'of', 'neptune', 'are', 'derived', 'from', 'spitzer', 'space', 'telescope', 'measurements', 'reported', 'by', 'stauffer', 'et', 'al', '2016', 'the', 'method', 'of', 'this', 'derivation', 'is', 'described', 'and', 'the', 'results', 'indicate', 'that', 'the', 'geometric', 'albedo', 'was', 'about', '1', 'or', 'less', 'at', 'the', 'time', 'of', 'the', 'observations', 'in', '2016', 'shortterm', 'midir', 'variability', 'of', 'neptune', 'evidenced', 'by', 'the', 'spitzer', 'observations', 'themselves', 'indicates', 'an', 'albedo', 'at', '36', 'microns', 'ranging', 'from', '02', 'to', '06', 'with', 'a', 'mean', 'of', '04', 'the', 'corresponding', 'albedos', 'at', '45', 'microns', 'are', '07', '13', 'and', '09', 'furthermore', 'the', '60year', 'history', 'of', 'visiblelight', 'brightness', 'variations', 'which', 'show', 'that', 'neptune', 'was', 'significantly', 'fainter', 'a', 'few', 'decades', 'ago', 'suggests', 'that', 'the', 'midir', 'albedo', 'during', 'that', 'earlier', 'period', 'of', 'time', 'may', 'have', 'been', 'much', 'less', 'than', '1', 'the', 'albedo', 'values', 'reported', 'here', 'can', 'have', 'implications', 'for', 'models', 'of', 'neptunes', 'atmosphere', 'however', 'the', 'midir', 'brightness', 'of', 'neptune', 'can', 'not', 'contribute', 'very', 'strongly', 'to', 'its', 'total', 'albedo', 'because', 'the', 'sun', 'emits', 'only', 'about', '2', 'of', 'its', 'flux', 'longward', 'of', '3', 'micron', 'by', 'contrast', 'the', 'sun', 'emits', '42', 'of', 'its', 'flux', 'at', 'visible', 'and', 'nearuv', 'wavelengths', 'where', 'the', 'planets', 'albedo', 'is', 'in', 'the', 'tens', 'of', 'percents']] | [-0.007129563794366737, 0.20522978172625383, -0.09176654736888047, 0.029350739690216187, -0.044518005700513, -0.05819490860978311, 0.04668585363623592, 0.4296348109308451, -0.15501875252049555, -0.42755011621523986, 0.11590382954128146, -0.3110010040386077, -0.09236767638554388, 0.2005106400453142, -0.16065213887299845, -0.01999907915117493, 0.07634518474196009, -0.08754151738883759, -0.017776413487624078, -0.2778008474076894, 0.17916888044898044, 0.10228103492907024, 0.11423791717503838, 0.03945992003508749, 0.07274090349275798, -0.09478569679512558, -0.07955812641751285, -0.055925791211741266, -0.15218216924692185, 0.07592640675723872, 0.2004630083431165, 0.049653654722596474, 0.17844135436493366, -0.35479052097880265, -0.2545589242817804, 0.05292661210402528, 0.11849784465845335, -0.008636733259940969, 0.04873499633896259, -0.243409372751606, 0.06391697127389458, -0.14981409868494394, -0.15219125997793068, 0.06449233839427804, 0.15233334595148257, -0.047979138127308994, -0.21943703799553335, 0.11579042510129511, 0.04190338040418166, 0.19368451036871437, -0.15638779817188886, -0.21718366130598807, -0.1248563129615467, 0.043161090803307725, 0.004516225075349212, 0.054851282151405986, 0.15723259415587082, -0.09807394457268803, -0.050403014039570954, 0.3777160331318006, -0.07465070924091101, 0.047485110499363214, 0.21240619555947415, -0.24488658124063026, -0.07067300305318307, 0.2712814487755936, 0.11527314627721139, 0.12322182285494823, -0.133346703675461, 0.023986030509796575, -0.030865099517638512, 0.2737680050011545, 0.11761900259650009, 0.1084879259404572, 0.3112419608801125, 0.12002420058613394, 0.0472993473833636, 0.055387645936197535, -0.30227844823614997, -0.03053995181294656, -0.19145746680006465, -0.07040560847387355, -0.1784865040292236, 0.08093828840044584, -0.12875978208377642, -0.03609894799257823, 0.35734787251909866, 0.1803495554374232, 0.23647701971103402, 0.07185118940078658, 0.27600855396233775, 0.08328874785712058, 0.11471953029337496, 0.09265753019222601, 0.3956877828182224, 0.09473817775469213, 0.16592647522790008, -0.16608341962079154, 0.06980238077703883, -0.02455010006632556] |
1,803.03569 | The Herzog-Sch\"onheim Conjecture for small groups and harmonic
subgroups | We prove that the Herzog-Sch\"onheim Conjecture holds for any group $G$ of
order smaller than $1440$. In other words we show that in any non-trivial coset
partition $\{g_i U_i\}_{i=1}^n $ of $G$ there exist distinct $1 \leq i, j \leq
n$ such that $[G:U_i]=[G:U_j]$.
We also study interaction between the indices of subgroups having cosets with
pairwise trivial intersection and harmonic integers. We prove that if
$U_1$,...,$U_n$ are subgroups of $G$ which have pairwise trivially intersecting
cosets and $n \leq 4$ then $[G:U_1]$,...,$[G:U_n]$ are harmonic integers.
| math.GR math.CO | we prove that the herzogschonheim conjecture holds for any group g of order smaller than 1440 in other words we show that in any nontrivial coset partition g_i u_i_i1n of g there exist distinct 1 leq i j leq n such that gu_igu_j we also study interaction between the indices of subgroups having cosets with pairwise trivial intersection and harmonic integers we prove that if u_1u_n are subgroups of g which have pairwise trivially intersecting cosets and n leq 4 then gu_1gu_n are harmonic integers | [['we', 'prove', 'that', 'the', 'herzogschonheim', 'conjecture', 'holds', 'for', 'any', 'group', 'g', 'of', 'order', 'smaller', 'than', '1440', 'in', 'other', 'words', 'we', 'show', 'that', 'in', 'any', 'nontrivial', 'coset', 'partition', 'g_i', 'u_i_i1n', 'of', 'g', 'there', 'exist', 'distinct', '1', 'leq', 'i', 'j', 'leq', 'n', 'such', 'that', 'gu_igu_j', 'we', 'also', 'study', 'interaction', 'between', 'the', 'indices', 'of', 'subgroups', 'having', 'cosets', 'with', 'pairwise', 'trivial', 'intersection', 'and', 'harmonic', 'integers', 'we', 'prove', 'that', 'if', 'u_1u_n', 'are', 'subgroups', 'of', 'g', 'which', 'have', 'pairwise', 'trivially', 'intersecting', 'cosets', 'and', 'n', 'leq', '4', 'then', 'gu_1gu_n', 'are', 'harmonic', 'integers']] | [-0.2102396402099147, 0.21021539685259596, -0.025063728703549358, 0.011014649587706095, -0.04574897119820845, -0.21902743196569202, -0.005781857592121857, 0.4242178424738529, -0.24451607103436823, -0.25548313822165675, 0.025224474403530178, -0.3576778501425529, -0.10580717993150579, 0.14427883679149445, -0.046408915608303576, -0.08791514904601727, 0.0559290285096589, 0.11448699865126755, -0.0497387618042256, -0.3091996618114957, 0.3314035076011972, -0.19069330311144655, 0.1569192761235172, 0.03940606504542435, 0.04978036511655352, -0.0007600931382579048, 0.040917949830522625, 0.01433091205204042, -0.1983604761789604, 0.05566086551166003, 0.28932749728811336, 0.11291177996161689, 0.22650148247073337, -0.3589273633026495, -0.13874602114651124, 0.2964132500744266, 0.1838023328653923, -0.050740888076777596, -0.011055718102242524, -0.19379685121224965, 0.19103121014720784, -0.15333345816357108, -0.10211492499064018, -0.032594971455315626, 0.17280598473451214, 0.04291675524593035, -0.2899498327567083, 0.020907372421167632, 0.13575039170228126, 0.1097692227808804, 0.0530972193029323, -0.21196238665057845, -0.08138852536950897, 0.1111399109884188, 0.0035992621830323846, 0.03780405300317287, 0.004715374767462291, -0.045569889610860406, -0.10576826373183328, 0.3590618262022007, -0.05411576363772705, -0.17827177189699397, 0.10726628346913834, -0.20807610859060888, -0.24502407191548406, 0.054768519169401106, 0.04522343503492998, 0.15298301310891785, 0.02734710035913783, 0.20031599179776272, -0.15961574748294746, 0.1532872982732043, 0.14826928261985503, 0.008370166065216792, 0.1108853329972523, -0.0021135317837456015, 0.10712962766836692, 0.10329732907688949, 0.03490820867804492, 0.08243320625638817, -0.3811362179041636, -0.1550989518475878, -0.17866425756819365, 0.14612073371209566, -0.16597828369484022, -0.13875332169189322, 0.3399838949326517, 0.11381435158617068, 0.13555289133985685, 0.1448947401595211, 0.15449977257266279, 0.04045026843640499, 0.03255708480719477, 0.1777440972240051, 0.09488947398778869, 0.14973456548844896, -0.21572975291893248, -0.13194918818700854, -0.07463258113314557, 0.16636384605634502] |
1,803.0357 | AdS$_5$ black strings in the stu model of FI-gauged $N=2$ supergravity | We analytically construct asymptotically AdS$_5$ black string solutions
starting from the four-dimensional domain wall black hole of arXiv:0911.4926.
It is shown that its uplift gives a black string in $d=5$ minimal gauged
supergravity, with momentum along the string. Applying instead the residual
symmetries of $N=2$, $d=4$ Fayet-Iliopoulos-gauged supergravity discovered in
arXiv:1606.05160 to the domain wall seed leads, after uplifting, to a dyonic
black string that interpolates between AdS$_5$ and
$\text{AdS}_3\times\text{H}^2$ at the horizon. A Kaluza-Klein reduction of the
latter along an angular Killing direction $\phi$ followed by a duality
transformation yields, after going back to five dimensions, a black string with
both momentum along the string and rotation along $\phi$. This is the first
instance of using solution-generating techniques in gauged supergravity to add
rotation to a given seed. These solutions all have constant scalar fields. As
was shown in hep-th/0302218, the construction of supersymmetric static magnetic
black strings in the FI-gauged stu model amounts to solving the
$\text{SO}(2,1)$ spinning top equations, which descend from an inhomogeneous
version of the Nahm equations. We are able to solve these in a particular case,
which leads to a generalization of the Maldacena-Nu\~nez solution.
| hep-th gr-qc | we analytically construct asymptotically ads_5 black string solutions starting from the fourdimensional domain wall black hole of arxiv09114926 it is shown that its uplift gives a black string in d5 minimal gauged supergravity with momentum along the string applying instead the residual symmetries of n2 d4 fayetiliopoulosgauged supergravity discovered in arxiv160605160 to the domain wall seed leads after uplifting to a dyonic black string that interpolates between ads_5 and textads_3timestexth2 at the horizon a kaluzaklein reduction of the latter along an angular killing direction phi followed by a duality transformation yields after going back to five dimensions a black string with both momentum along the string and rotation along phi this is the first instance of using solutiongenerating techniques in gauged supergravity to add rotation to a given seed these solutions all have constant scalar fields as was shown in hepth0302218 the construction of supersymmetric static magnetic black strings in the figauged stu model amounts to solving the textso21 spinning top equations which descend from an inhomogeneous version of the nahm equations we are able to solve these in a particular case which leads to a generalization of the maldacenanunez solution | [['we', 'analytically', 'construct', 'asymptotically', 'ads_5', 'black', 'string', 'solutions', 'starting', 'from', 'the', 'fourdimensional', 'domain', 'wall', 'black', 'hole', 'of', 'arxiv09114926', 'it', 'is', 'shown', 'that', 'its', 'uplift', 'gives', 'a', 'black', 'string', 'in', 'd5', 'minimal', 'gauged', 'supergravity', 'with', 'momentum', 'along', 'the', 'string', 'applying', 'instead', 'the', 'residual', 'symmetries', 'of', 'n2', 'd4', 'fayetiliopoulosgauged', 'supergravity', 'discovered', 'in', 'arxiv160605160', 'to', 'the', 'domain', 'wall', 'seed', 'leads', 'after', 'uplifting', 'to', 'a', 'dyonic', 'black', 'string', 'that', 'interpolates', 'between', 'ads_5', 'and', 'textads_3timestexth2', 'at', 'the', 'horizon', 'a', 'kaluzaklein', 'reduction', 'of', 'the', 'latter', 'along', 'an', 'angular', 'killing', 'direction', 'phi', 'followed', 'by', 'a', 'duality', 'transformation', 'yields', 'after', 'going', 'back', 'to', 'five', 'dimensions', 'a', 'black', 'string', 'with', 'both', 'momentum', 'along', 'the', 'string', 'and', 'rotation', 'along', 'phi', 'this', 'is', 'the', 'first', 'instance', 'of', 'using', 'solutiongenerating', 'techniques', 'in', 'gauged', 'supergravity', 'to', 'add', 'rotation', 'to', 'a', 'given', 'seed', 'these', 'solutions', 'all', 'have', 'constant', 'scalar', 'fields', 'as', 'was', 'shown', 'in', 'hepth0302218', 'the', 'construction', 'of', 'supersymmetric', 'static', 'magnetic', 'black', 'strings', 'in', 'the', 'figauged', 'stu', 'model', 'amounts', 'to', 'solving', 'the', 'textso21', 'spinning', 'top', 'equations', 'which', 'descend', 'from', 'an', 'inhomogeneous', 'version', 'of', 'the', 'nahm', 'equations', 'we', 'are', 'able', 'to', 'solve', 'these', 'in', 'a', 'particular', 'case', 'which', 'leads', 'to', 'a', 'generalization', 'of', 'the', 'maldacenanunez', 'solution']] | [-0.12868234240299753, 0.1254260683676631, -0.05892451746002471, 0.09784809150294932, -0.12194649271556847, -0.1573723298447427, -0.0026413130170855953, 0.27791852879798623, -0.19024338874395094, -0.2600031345181407, 0.10228557525417312, -0.3078038582862455, -0.10433156501692069, 0.13924647503787832, -0.07981389170632727, 0.02469095440975125, -0.02118153001059107, 0.06154761730470464, -0.12305646294087011, -0.26968064114591606, 0.32690098386017546, 0.01682602548070492, 0.2687386652086711, -0.036742074401318145, 0.1543116435804154, -0.028084924689904655, 0.02234864199373831, 0.032174314384759276, -0.12790976093510248, 0.1098279835916342, 0.2071414322214281, 0.09751694316485075, 0.10624196645503323, -0.4524727453708008, -0.20134669913261283, 0.06145815131810283, 0.2207191542901289, 0.22688928564074098, -0.06461327992409709, -0.24021942760690204, 0.08726487903084645, -0.18333281988718658, -0.18354286953446367, -0.06039432588944672, 0.04900574907084666, -0.09544212521449412, -0.23036182185720092, 0.06948545723233071, 0.0488658351629662, -0.06617878524106814, -0.11367647114562832, -0.020401243382992262, -0.1034958680405692, 0.04175452075357879, 0.20700314185608, 0.12791952513338578, 0.11595293748072319, -0.1624714655267145, -0.15084995786717, 0.31542718139106546, -0.07147265335304602, -0.26547328306622403, 0.12667584325993053, -0.12416610845254474, -0.12130076384862824, 0.13460952594691025, 0.11464371767035254, 0.19627599384615657, -0.15173864989261074, 0.21350925091352227, -0.017462547182516063, 0.14497746113482463, 0.18352094657408694, -0.015210448944520566, 0.320740848449209, 0.10209116327103167, 0.04953900663155852, 0.22233449974878422, -0.0360849013612155, -0.13297449886815757, -0.38276094404519884, -0.1075286289856341, -0.08278727379655065, 0.1510857755521072, -0.17407834508330486, -0.1916397626981795, 0.3452737913116492, 0.07072570509407469, 0.20820231685635224, 0.04621743487559699, 0.17221959289764205, 0.07167221087979914, 0.07870361843097565, 0.10496768603534488, 0.26067144781293505, 0.1515710702145933, 0.14210796247797228, -0.24483148484823786, -0.1617465252557429, 0.19798725238570603] |
1,803.03571 | City-wide Analysis of Electronic Health Records Reveals Gender and Age
Biases in the Administration of Known Drug-Drug Interactions | The occurrence of drug-drug-interactions (DDI) from multiple drug
dispensations is a serious problem, both for individuals and health-care
systems, since patients with complications due to DDI are likely to reenter the
system at a costlier level. We present a large-scale longitudinal study (18
months) of the DDI phenomenon at the primary- and secondary-care level using
electronic health records (EHR) from the city of Blumenau in Southern Brazil
(pop. $\approx 340,000$). We found that 181 distinct drug pairs known to
interact were dispensed concomitantly to 12\% of the patients in the city's
public health-care system. Further, 4\% of the patients were dispensed drug
pairs that are likely to result in major adverse drug reactions (ADR)---with
costs estimated to be much larger than previously reported in smaller studies.
The large-scale analysis reveals that women have a 60\% increased risk of DDI
as compared to men; the increase becomes 90\% when considering only DDI known
to lead to major ADR. Furthermore, DDI risk increases substantially with age;
patients aged 70-79 years have a 34\% risk of DDI when they are dispensed two
or more drugs concomitantly. Interestingly, a statistical null model
demonstrates that age- and female-specific risks from increased polypharmacy
fail by far to explain the observed DDI risks in those populations, suggesting
unknown social or biological causes. We also provide a network visualization of
drugs and demographic factors that characterize the DDI phenomenon and
demonstrate that accurate DDI prediction can be included in healthcare and
public-health management, to reduce DDI-related ADR and costs.
| cs.SI cs.CY cs.IR q-bio.QM stat.ML | the occurrence of drugdruginteractions ddi from multiple drug dispensations is a serious problem both for individuals and healthcare systems since patients with complications due to ddi are likely to reenter the system at a costlier level we present a largescale longitudinal study 18 months of the ddi phenomenon at the primary and secondarycare level using electronic health records ehr from the city of blumenau in southern brazil pop approx 340000 we found that 181 distinct drug pairs known to interact were dispensed concomitantly to 12 of the patients in the citys public healthcare system further 4 of the patients were dispensed drug pairs that are likely to result in major adverse drug reactions adrwith costs estimated to be much larger than previously reported in smaller studies the largescale analysis reveals that women have a 60 increased risk of ddi as compared to men the increase becomes 90 when considering only ddi known to lead to major adr furthermore ddi risk increases substantially with age patients aged 7079 years have a 34 risk of ddi when they are dispensed two or more drugs concomitantly interestingly a statistical null model demonstrates that age and femalespecific risks from increased polypharmacy fail by far to explain the observed ddi risks in those populations suggesting unknown social or biological causes we also provide a network visualization of drugs and demographic factors that characterize the ddi phenomenon and demonstrate that accurate ddi prediction can be included in healthcare and publichealth management to reduce ddirelated adr and costs | [['the', 'occurrence', 'of', 'drugdruginteractions', 'ddi', 'from', 'multiple', 'drug', 'dispensations', 'is', 'a', 'serious', 'problem', 'both', 'for', 'individuals', 'and', 'healthcare', 'systems', 'since', 'patients', 'with', 'complications', 'due', 'to', 'ddi', 'are', 'likely', 'to', 'reenter', 'the', 'system', 'at', 'a', 'costlier', 'level', 'we', 'present', 'a', 'largescale', 'longitudinal', 'study', '18', 'months', 'of', 'the', 'ddi', 'phenomenon', 'at', 'the', 'primary', 'and', 'secondarycare', 'level', 'using', 'electronic', 'health', 'records', 'ehr', 'from', 'the', 'city', 'of', 'blumenau', 'in', 'southern', 'brazil', 'pop', 'approx', '340000', 'we', 'found', 'that', '181', 'distinct', 'drug', 'pairs', 'known', 'to', 'interact', 'were', 'dispensed', 'concomitantly', 'to', '12', 'of', 'the', 'patients', 'in', 'the', 'citys', 'public', 'healthcare', 'system', 'further', '4', 'of', 'the', 'patients', 'were', 'dispensed', 'drug', 'pairs', 'that', 'are', 'likely', 'to', 'result', 'in', 'major', 'adverse', 'drug', 'reactions', 'adrwith', 'costs', 'estimated', 'to', 'be', 'much', 'larger', 'than', 'previously', 'reported', 'in', 'smaller', 'studies', 'the', 'largescale', 'analysis', 'reveals', 'that', 'women', 'have', 'a', '60', 'increased', 'risk', 'of', 'ddi', 'as', 'compared', 'to', 'men', 'the', 'increase', 'becomes', '90', 'when', 'considering', 'only', 'ddi', 'known', 'to', 'lead', 'to', 'major', 'adr', 'furthermore', 'ddi', 'risk', 'increases', 'substantially', 'with', 'age', 'patients', 'aged', '7079', 'years', 'have', 'a', '34', 'risk', 'of', 'ddi', 'when', 'they', 'are', 'dispensed', 'two', 'or', 'more', 'drugs', 'concomitantly', 'interestingly', 'a', 'statistical', 'null', 'model', 'demonstrates', 'that', 'age', 'and', 'femalespecific', 'risks', 'from', 'increased', 'polypharmacy', 'fail', 'by', 'far', 'to', 'explain', 'the', 'observed', 'ddi', 'risks', 'in', 'those', 'populations', 'suggesting', 'unknown', 'social', 'or', 'biological', 'causes', 'we', 'also', 'provide', 'a', 'network', 'visualization', 'of', 'drugs', 'and', 'demographic', 'factors', 'that', 'characterize', 'the', 'ddi', 'phenomenon', 'and', 'demonstrate', 'that', 'accurate', 'ddi', 'prediction', 'can', 'be', 'included', 'in', 'healthcare', 'and', 'publichealth', 'management', 'to', 'reduce', 'ddirelated', 'adr', 'and', 'costs']] | [-0.06957076059236406, 0.11820401023351969, 0.0035471544385368586, 0.13363934580578285, -0.07085800027574, -0.14584710805287554, 0.10321586507422177, 0.3644549604085442, -0.22054269645729516, -0.3421231882845158, 0.10842632221966432, -0.36794013110491386, -0.1662040781048432, 0.20849361630981086, -0.11369196617342227, -0.03583736875672733, 0.11710862080532233, 0.03880638727399646, 0.04895559528062013, -0.3018145784716595, 0.2667716694881254, 0.042328449419640445, 0.29053000909930904, 0.08937395297250421, 0.04075722924918394, -0.02161622493619435, -0.03757397795275434, 0.009191730280586168, -0.07382388345912226, 0.11125164095944053, 0.36168103304035104, 0.13970529276221136, 0.351179539530393, -0.4298676900245005, -0.22258628656482707, 0.11535311837157723, 0.15345190571846257, 0.14192389281749054, 0.012000832908687116, -0.32517273261471363, 0.07309797132334321, -0.20648991514462978, -0.1285056203391907, -0.04379628358273309, 0.022143258586035445, -0.0021296138798848527, -0.24619111214520134, 0.1627743538576665, -0.02266590728913052, 0.14965019813456312, -0.12423429655705075, -0.176318291823769, -0.056606037168168144, 0.1751411279358569, 0.1430325824753038, 0.044679967334663846, 0.18443347639490118, -0.15946879443907194, -0.1061237244289483, 0.3455209390710673, 0.019594171408601545, -0.10426566431327002, 0.2085946113859746, -0.12665253857601066, -0.10076083762766354, 0.16317907953444014, 0.21624112960817599, 0.028083297798074173, -0.20400616251083462, -0.09641448223603638, 0.0527604252837606, 0.1946735778121186, 0.0807971935537949, -0.036926760595410175, 0.16086605688190606, 0.16165665272608032, 0.04312778550551319, 0.10063214079366203, -0.10778298564102562, -0.06656548704906198, -0.1442461547388821, -0.1335893777121201, -0.06377994649677125, 0.07283821565978855, -0.07647346675647165, -0.13535952573397853, 0.3528146170190398, 0.18525423532696922, 0.12100938543129605, -0.0020847162747083875, 0.23178350799106306, 0.0305928612489551, 0.14321454562300237, 0.02957104043710641, 0.22111100550420337, 0.0008434453992493695, 0.1067807068151315, -0.21631798329076074, 0.16980612674273826, -0.09766027175050351] |
1,803.03572 | Extensions and duality | For a fixed finite group $Q$ and semi-simple finite dimensional algebra $S$,
we examine an equivalence between strongly $Q$-graded algebras (extensions)
with identity component $S$ and $S^1$-gerbes on action groupoids of $Q$ on the
set of isomorphism classes of simple objects of the category of $S$-modules.
This clarifies the nature of the map considered in arXiv:1312.7316. Motivated
by this and arXiv:0909.3140(2) we suggest and study a notion of extensions
suitable to the case when $S$ is replaced by a Hopf algebra, in the sense that
there is a bijection between extensions with "fiber" $H$ and $H^*$. In
particular we focus on the case of $H$ equal to the group algebra of a finite
group. When $K$ is abelian, the answer is particularly symmetric as duality of
Hopf algebras does not take us outside of the category of groups.
| math.QA | for a fixed finite group q and semisimple finite dimensional algebra s we examine an equivalence between strongly qgraded algebras extensions with identity component s and s1gerbes on action groupoids of q on the set of isomorphism classes of simple objects of the category of smodules this clarifies the nature of the map considered in arxiv13127316 motivated by this and arxiv090931402 we suggest and study a notion of extensions suitable to the case when s is replaced by a hopf algebra in the sense that there is a bijection between extensions with fiber h and h in particular we focus on the case of h equal to the group algebra of a finite group when k is abelian the answer is particularly symmetric as duality of hopf algebras does not take us outside of the category of groups | [['for', 'a', 'fixed', 'finite', 'group', 'q', 'and', 'semisimple', 'finite', 'dimensional', 'algebra', 's', 'we', 'examine', 'an', 'equivalence', 'between', 'strongly', 'qgraded', 'algebras', 'extensions', 'with', 'identity', 'component', 's', 'and', 's1gerbes', 'on', 'action', 'groupoids', 'of', 'q', 'on', 'the', 'set', 'of', 'isomorphism', 'classes', 'of', 'simple', 'objects', 'of', 'the', 'category', 'of', 'smodules', 'this', 'clarifies', 'the', 'nature', 'of', 'the', 'map', 'considered', 'in', 'arxiv13127316', 'motivated', 'by', 'this', 'and', 'arxiv090931402', 'we', 'suggest', 'and', 'study', 'a', 'notion', 'of', 'extensions', 'suitable', 'to', 'the', 'case', 'when', 's', 'is', 'replaced', 'by', 'a', 'hopf', 'algebra', 'in', 'the', 'sense', 'that', 'there', 'is', 'a', 'bijection', 'between', 'extensions', 'with', 'fiber', 'h', 'and', 'h', 'in', 'particular', 'we', 'focus', 'on', 'the', 'case', 'of', 'h', 'equal', 'to', 'the', 'group', 'algebra', 'of', 'a', 'finite', 'group', 'when', 'k', 'is', 'abelian', 'the', 'answer', 'is', 'particularly', 'symmetric', 'as', 'duality', 'of', 'hopf', 'algebras', 'does', 'not', 'take', 'us', 'outside', 'of', 'the', 'category', 'of', 'groups']] | [-0.1755489247974337, 0.09674112673650705, -0.05653768788804026, 0.03575363717391156, -0.11122361106476199, -0.15044251798912334, 0.03084989801316303, 0.3601223301854642, -0.3305534429519492, -0.21064369342296713, 0.1010985966448275, -0.23647836763719918, -0.11826384710558854, 0.17780908112592228, -0.1319420539383667, -0.10176207397050936, 0.046122001374469083, 0.14017672829247793, -0.09727036128135617, -0.23722873609650003, 0.4339677844580044, -0.02238371803832706, 0.23112690404934041, 0.03186578509870314, 0.10240220183999661, 0.0458229354921701, -0.04383506790241774, 0.03322227704612648, -0.14009848147698528, 0.10461808644536444, 0.2851151932469186, 0.0651803510811399, 0.2396148078277132, -0.3306426403989248, -0.12181512087665718, 0.19606564896564713, 0.12228862951194648, 0.0022404296323657036, -0.024264410897397764, -0.26298183976220624, 0.11767387124564266, -0.21322782802642049, -0.10254617746207206, -0.03046386589309858, 0.1361482633091167, -0.03542348144829328, -0.2575840205330785, -0.008360882438650793, 0.1265640598790282, 0.1406020786585834, -0.0566867316922392, -0.04892556770252721, -0.06162233450723922, 0.07788161417984692, -0.01851794023557699, 0.015182086735662511, 0.08852388699169216, -0.1041650650310711, -0.12926100739979815, 0.401646172394976, -0.049864267026457715, -0.2144447106265408, 0.1806628959654036, -0.192507034229279, -0.15073719318024814, 0.07235835045439136, 0.06914206219645326, 0.14940443848643234, -0.01932741888466647, 0.22613357291479855, -0.146413017230396, 0.07329153928260305, 0.05607055712607689, -0.019804879050592288, 0.13938548168687917, 0.10517237203791463, 0.07642871866119094, 0.15077821294931604, 0.04417355322820025, -0.035431419040405136, -0.3799779497990933, -0.1730843603132491, -0.09811866730588543, 0.09845394776932474, -0.07685170454768762, -0.1629744473971454, 0.3883714967147064, 0.11627837261724328, 0.20577440515283824, 0.07353950708227999, 0.17321075615473092, 0.0595233673676001, 0.10177836810266051, 0.03836705793818349, 0.12195740986670203, 0.27403697478482225, -0.05158529900397886, -0.15925314846989588, -0.040307336575899494, 0.19215474655399756] |
1,803.03573 | Bayesian mean-variance analysis: Optimal portfolio selection under
parameter uncertainty | The paper solves the problem of optimal portfolio choice when the parameters
of the asset returns distribution, like the mean vector and the covariance
matrix are unknown and have to be estimated by using historical data of the
asset returns. The new approach employs the Bayesian posterior predictive
distribution which is the distribution of the future realization of the asset
returns given the observable sample. The parameters of the posterior predictive
distributions are functions of the observed data values and, consequently, the
solution of the optimization problem is expressed in terms of data only and
does not depend on unknown quantities. In contrast, the optimization problem of
the traditional approach is based on unknown quantities which are estimated in
the second step leading to a suboptimal solution. We also derive a very useful
stochastic representation of the posterior predictive distribution whose
application leads not only to the solution of the considered optimization
problem, but provides the posterior predictive distribution of the optimal
portfolio return used to construct a prediction interval. A Bayesian efficient
frontier, a set of optimal portfolios obtained by employing the posterior
predictive distribution, is constructed as well. Theoretically and using real
data we show that the Bayesian efficient frontier outperforms the sample
efficient frontier, a common estimator of the set of optimal portfolios known
to be overoptimistic.
| q-fin.ST q-fin.PM | the paper solves the problem of optimal portfolio choice when the parameters of the asset returns distribution like the mean vector and the covariance matrix are unknown and have to be estimated by using historical data of the asset returns the new approach employs the bayesian posterior predictive distribution which is the distribution of the future realization of the asset returns given the observable sample the parameters of the posterior predictive distributions are functions of the observed data values and consequently the solution of the optimization problem is expressed in terms of data only and does not depend on unknown quantities in contrast the optimization problem of the traditional approach is based on unknown quantities which are estimated in the second step leading to a suboptimal solution we also derive a very useful stochastic representation of the posterior predictive distribution whose application leads not only to the solution of the considered optimization problem but provides the posterior predictive distribution of the optimal portfolio return used to construct a prediction interval a bayesian efficient frontier a set of optimal portfolios obtained by employing the posterior predictive distribution is constructed as well theoretically and using real data we show that the bayesian efficient frontier outperforms the sample efficient frontier a common estimator of the set of optimal portfolios known to be overoptimistic | [['the', 'paper', 'solves', 'the', 'problem', 'of', 'optimal', 'portfolio', 'choice', 'when', 'the', 'parameters', 'of', 'the', 'asset', 'returns', 'distribution', 'like', 'the', 'mean', 'vector', 'and', 'the', 'covariance', 'matrix', 'are', 'unknown', 'and', 'have', 'to', 'be', 'estimated', 'by', 'using', 'historical', 'data', 'of', 'the', 'asset', 'returns', 'the', 'new', 'approach', 'employs', 'the', 'bayesian', 'posterior', 'predictive', 'distribution', 'which', 'is', 'the', 'distribution', 'of', 'the', 'future', 'realization', 'of', 'the', 'asset', 'returns', 'given', 'the', 'observable', 'sample', 'the', 'parameters', 'of', 'the', 'posterior', 'predictive', 'distributions', 'are', 'functions', 'of', 'the', 'observed', 'data', 'values', 'and', 'consequently', 'the', 'solution', 'of', 'the', 'optimization', 'problem', 'is', 'expressed', 'in', 'terms', 'of', 'data', 'only', 'and', 'does', 'not', 'depend', 'on', 'unknown', 'quantities', 'in', 'contrast', 'the', 'optimization', 'problem', 'of', 'the', 'traditional', 'approach', 'is', 'based', 'on', 'unknown', 'quantities', 'which', 'are', 'estimated', 'in', 'the', 'second', 'step', 'leading', 'to', 'a', 'suboptimal', 'solution', 'we', 'also', 'derive', 'a', 'very', 'useful', 'stochastic', 'representation', 'of', 'the', 'posterior', 'predictive', 'distribution', 'whose', 'application', 'leads', 'not', 'only', 'to', 'the', 'solution', 'of', 'the', 'considered', 'optimization', 'problem', 'but', 'provides', 'the', 'posterior', 'predictive', 'distribution', 'of', 'the', 'optimal', 'portfolio', 'return', 'used', 'to', 'construct', 'a', 'prediction', 'interval', 'a', 'bayesian', 'efficient', 'frontier', 'a', 'set', 'of', 'optimal', 'portfolios', 'obtained', 'by', 'employing', 'the', 'posterior', 'predictive', 'distribution', 'is', 'constructed', 'as', 'well', 'theoretically', 'and', 'using', 'real', 'data', 'we', 'show', 'that', 'the', 'bayesian', 'efficient', 'frontier', 'outperforms', 'the', 'sample', 'efficient', 'frontier', 'a', 'common', 'estimator', 'of', 'the', 'set', 'of', 'optimal', 'portfolios', 'known', 'to', 'be', 'overoptimistic']] | [-0.04165565702662041, 0.010627821020104669, -0.13115623652278868, 0.12233308875213632, -0.10358255717649378, -0.09563561211001467, 0.08948973063009114, 0.3885394644373181, -0.2992659825948067, -0.32235048002727457, 0.16109408673794612, -0.24738283099140973, -0.11590333127691833, 0.19270912308182397, -0.08071048197505826, 0.12358638631048961, 0.06512177031995221, 0.023692314709875394, -0.04904812435323203, -0.2628848729612814, 0.2875685375353152, 0.0850834892978045, 0.32863602272065523, -0.050460279403275556, 0.1773784380992848, 0.01876633357976309, -0.04556680047535337, 0.0011910731438547373, -0.12476412238482391, 0.18371464284189806, 0.27009129576723684, 0.1999149121365256, 0.32980747544418343, -0.3635699174194253, -0.1648572912307414, 0.14467937128925273, 0.1236251339505543, 0.0741382406781089, -0.003227056333244863, -0.23395787945271215, 0.042685676785979676, -0.1515706715004688, -0.09697693998883054, -0.08544977624921805, -0.026146787316115066, 0.036090714838990776, -0.3729380477431484, 0.11214380404708209, -0.014876713501871563, -0.011542934470344334, -0.06402376308635047, -0.18240733579732477, -0.012493477684488013, 0.12777431785427987, 0.0879069159717553, 0.012571349574930288, 0.14773872569203378, -0.12166378688786857, -0.11831537302244793, 0.361289185683497, -0.05129228950562802, -0.23582923474552278, 0.06570423944027756, -0.11671767751580443, -0.1061454915759069, 0.1253257361431183, 0.18763165936106815, 0.13394139328077223, -0.19049855853061837, 0.08428062505210454, -0.06158039581099398, 0.14294654143212193, -0.017331901423379103, 0.007366445441518656, 0.17331917007369074, 0.17953139763981613, 0.12327035339919597, 0.12404274515786462, -0.10068615018390119, -0.14301443483087828, -0.28790415949135256, -0.09789379939426329, -0.2445878006602553, -0.006267240867733066, -0.15181358789314717, -0.216670258927413, 0.4102142942392013, 0.19193327209002084, 0.18151742404284463, 0.1108895886562426, 0.26538713370365175, 0.16883537024960704, 0.005231951654654536, 0.10677378198809244, 0.21025096288543532, 0.06399083080680364, 0.042116706273836, -0.18511136846275555, 0.1931946819843936, 0.0039453496034680445] |
1,803.03574 | The norm map and the capitulation kernel | Let f: S'--> S be a finite and faithfully flat morphism of locally noetherian
schemes of constant rank n > 1 and let G be a smooth, commutative and
quasi-projective S-group scheme with connected fibers. Under certain
restrictions on f and G, we relate the kernel of the restriction map in degree
r>0 \'etale cohomology Res_{G}^{(r)}: H^{r}(S_{\et},G)--> H^{r}(S'_{\et},G) to
a certain quotient of the kernel of the mod n corestriction map in degree r-1,
namely Cores_{G}^{(r-1)}/n: H^{r-1}(S'_{\et},G)/n\to H^{r-1}\lbe(S_{\et},G)/n.
When r=1 and f is a Galois covering with Galois group D, our main theorem
relates Ker Res_{G}^{(1)}=H^{1}(D,G(S')) to the subgroup of G(S') of those
sections whose S'/S-norm lies in G(S)^{n}. We also include applications to the
capitulation problem for Neron-Raynaud class groups of invertible tori and
Tate-Shafarevich groups of abelian varieties.
| math.NT math.AG | let f s s be a finite and faithfully flat morphism of locally noetherian schemes of constant rank n 1 and let g be a smooth commutative and quasiprojective sgroup scheme with connected fibers under certain restrictions on f and g we relate the kernel of the restriction map in degree r0 etale cohomology res_gr hrs_etg hrs_etg to a certain quotient of the kernel of the mod n corestriction map in degree r1 namely cores_gr1n hr1s_etgnto hr1lbes_etgn when r1 and f is a galois covering with galois group d our main theorem relates ker res_g1h1dgs to the subgroup of gs of those sections whose ssnorm lies in gsn we also include applications to the capitulation problem for neronraynaud class groups of invertible tori and tateshafarevich groups of abelian varieties | [['let', 'f', 's', 's', 'be', 'a', 'finite', 'and', 'faithfully', 'flat', 'morphism', 'of', 'locally', 'noetherian', 'schemes', 'of', 'constant', 'rank', 'n', '1', 'and', 'let', 'g', 'be', 'a', 'smooth', 'commutative', 'and', 'quasiprojective', 'sgroup', 'scheme', 'with', 'connected', 'fibers', 'under', 'certain', 'restrictions', 'on', 'f', 'and', 'g', 'we', 'relate', 'the', 'kernel', 'of', 'the', 'restriction', 'map', 'in', 'degree', 'r0', 'etale', 'cohomology', 'res_gr', 'hrs_etg', 'hrs_etg', 'to', 'a', 'certain', 'quotient', 'of', 'the', 'kernel', 'of', 'the', 'mod', 'n', 'corestriction', 'map', 'in', 'degree', 'r1', 'namely', 'cores_gr1n', 'hr1s_etgnto', 'hr1lbes_etgn', 'when', 'r1', 'and', 'f', 'is', 'a', 'galois', 'covering', 'with', 'galois', 'group', 'd', 'our', 'main', 'theorem', 'relates', 'ker', 'res_g1h1dgs', 'to', 'the', 'subgroup', 'of', 'gs', 'of', 'those', 'sections', 'whose', 'ssnorm', 'lies', 'in', 'gsn', 'we', 'also', 'include', 'applications', 'to', 'the', 'capitulation', 'problem', 'for', 'neronraynaud', 'class', 'groups', 'of', 'invertible', 'tori', 'and', 'tateshafarevich', 'groups', 'of', 'abelian', 'varieties']] | [-0.23785576815979795, 0.04819886475771425, -0.10205759234996813, 0.008987696556892667, -0.08653292966435754, -0.20794954263575136, -0.01591189601646376, 0.3322290263979906, -0.36057408548320735, -0.18166070238352874, 0.07557687800539087, -0.23471902593249275, -0.08977064834494565, 0.20572384603081212, -0.1862904436045116, -0.04509786279090951, -0.019203386926693062, 0.14209818423184897, -0.07566055930182038, -0.31468742761400437, 0.41542576779160767, -0.09596925842455559, 0.18601010171245905, 0.04865075669377186, 0.11084668285160836, 0.014954322182963933, -0.00783857383254555, -0.038836441216840135, -0.15551964816028974, 0.09798778448302689, 0.36604779931311043, 0.03981231302098041, 0.21212136294437392, -0.32319860441249704, -0.14092140784487128, 0.30650845813309596, 0.08971724299819119, -0.09370583566957183, 0.056681101100571875, -0.2585829076452947, 0.16429962346240157, -0.1799574328585051, -0.14544772210290596, -0.0360065646931499, 0.13392642714297248, 0.04543507938351174, -0.27301645750600484, -0.00897906860923432, 0.1059069309736632, 0.16494929928106308, -0.031169842363470385, -0.11087738259154703, -0.10163550603676648, 0.044924204398534305, -0.05733304374077688, 0.10696635688579972, 0.10625882066726204, -0.06582097231125038, -0.059887788735420236, 0.37760656424272326, -0.10062338631494992, -0.18943952597797878, 0.0889033156056558, -0.18929701265428336, -0.1632792667388135, 0.12673576000416953, 0.07244843290367674, 0.19554804998751346, 0.08155442630220111, 0.2725147117284172, -0.1487509153009723, 0.09556648602067012, 0.07715193925785922, -0.035311409802694295, 0.07158103660162117, 0.037661178283498534, 0.11512406029167675, 0.0881861663900406, 0.013214036163258096, 0.06898806440163284, -0.37295744177554885, -0.16426565241248858, -0.09997533003972363, 0.18912213569837472, -0.14245111275499034, -0.1323887494415225, 0.3903131030055808, 0.028351652349585726, 0.17528427415527403, 0.14673678849958965, 0.17855986644844374, 0.003292472279187472, 0.049134452228299194, 0.0991716114616382, 0.01768665663116882, 0.29364674367130766, -0.1346374154729288, -0.13595903945162952, -0.05506529981615923, 0.2403754949411978] |
1,803.03575 | Pseudodifferential calculus on noncommutative tori, I. Oscillating
integrals | This paper is the first part of a two-paper series whose aim is to give a
thorough account on Connes' pseudodifferential calculus on noncommutative tori.
This pseudodifferential calculus has been used in numerous recent papers, but a
detailed description is still missing. In this paper, we focus on constructing
an oscillating integral for noncommutative tori and laying down the main
functional analysis ground for understanding Connes' pseudodifferential
calculus. In particular, this allows us to give a precise explanation of the
definition of pseudodifferential operators on noncommutative tori. More
generally, this paper introduces the main technical tools that are used in the
2nd part of the series to derive the main properties of these operators. In
addition, we establish the equivalence between our class of operators and the
toroidal pseudo differential operators considered by other authors.
| math.OA | this paper is the first part of a twopaper series whose aim is to give a thorough account on connes pseudodifferential calculus on noncommutative tori this pseudodifferential calculus has been used in numerous recent papers but a detailed description is still missing in this paper we focus on constructing an oscillating integral for noncommutative tori and laying down the main functional analysis ground for understanding connes pseudodifferential calculus in particular this allows us to give a precise explanation of the definition of pseudodifferential operators on noncommutative tori more generally this paper introduces the main technical tools that are used in the 2nd part of the series to derive the main properties of these operators in addition we establish the equivalence between our class of operators and the toroidal pseudo differential operators considered by other authors | [['this', 'paper', 'is', 'the', 'first', 'part', 'of', 'a', 'twopaper', 'series', 'whose', 'aim', 'is', 'to', 'give', 'a', 'thorough', 'account', 'on', 'connes', 'pseudodifferential', 'calculus', 'on', 'noncommutative', 'tori', 'this', 'pseudodifferential', 'calculus', 'has', 'been', 'used', 'in', 'numerous', 'recent', 'papers', 'but', 'a', 'detailed', 'description', 'is', 'still', 'missing', 'in', 'this', 'paper', 'we', 'focus', 'on', 'constructing', 'an', 'oscillating', 'integral', 'for', 'noncommutative', 'tori', 'and', 'laying', 'down', 'the', 'main', 'functional', 'analysis', 'ground', 'for', 'understanding', 'connes', 'pseudodifferential', 'calculus', 'in', 'particular', 'this', 'allows', 'us', 'to', 'give', 'a', 'precise', 'explanation', 'of', 'the', 'definition', 'of', 'pseudodifferential', 'operators', 'on', 'noncommutative', 'tori', 'more', 'generally', 'this', 'paper', 'introduces', 'the', 'main', 'technical', 'tools', 'that', 'are', 'used', 'in', 'the', '2nd', 'part', 'of', 'the', 'series', 'to', 'derive', 'the', 'main', 'properties', 'of', 'these', 'operators', 'in', 'addition', 'we', 'establish', 'the', 'equivalence', 'between', 'our', 'class', 'of', 'operators', 'and', 'the', 'toroidal', 'pseudo', 'differential', 'operators', 'considered', 'by', 'other', 'authors']] | [-0.12967089564039339, 0.013483573186870974, -0.10527411233633757, 0.12394144751510962, -0.1283470798490776, -0.06776834168919811, -0.02102269031521347, 0.3109472734663911, -0.25031710945725166, -0.2644222806794224, 0.1217749389414503, -0.24872579674971618, -0.16673592893337763, 0.2027955145523366, -0.1708146453007228, 0.03206811908080622, 0.0323333817154721, 0.04190627042618063, -0.09460586899788015, -0.20025584943316602, 0.43621182397904773, 0.03253653987517787, 0.18623007421761198, 0.0552911923887829, 0.038773583562147836, 0.02313184210754655, -0.12874756669970575, -0.056849638655505796, -0.16828456061091318, 0.21346293367850766, 0.28278817934376466, 0.038554122942258365, 0.29668502403009267, -0.44204150544548476, -0.16483775860181563, 0.09921207158584837, 0.12965911967955807, 0.06079949842145046, -0.026109518475196738, -0.296144469510074, 0.05851399864380558, -0.17112251659510314, -0.12515638110538324, -0.1318171073751593, 0.04599929289133461, -0.016491239580015343, -0.20541567390232726, 0.01002452856067706, 0.15840170820140176, 0.12812072444983102, -0.08264810623195781, -0.0843846905010718, 0.06460208999924362, 0.11467698369934051, 0.03319901969042365, -0.0008488811104109994, 0.060494384619717796, -0.005208157221959145, -0.12273008770964763, 0.32236010523305997, -0.05713076353573275, -0.2222667288242115, 0.14291404669207555, -0.17628460172218857, -0.2251108372963413, 0.06102509383043205, 0.1426249007039048, 0.1889737030974141, -0.1689946038303552, 0.14528664515991868, -0.05442044364322943, 0.12485257027049859, 0.046504979639279624, 0.04148945703464388, 0.1600176964058644, 0.1447314735726212, 0.07563006414652422, 0.14279341555623062, 0.009133832101468687, -0.13062706096701462, -0.38400392940750827, -0.191176900619434, -0.0980649673724892, 0.10059796021992548, -0.025285457771193856, -0.20258540330385721, 0.45131469936006596, 0.1544993072472237, 0.17575144985069832, 0.04710165823775309, 0.2745010105410108, 0.15657731481521667, 0.06959598918134967, 0.01233240069942204, 0.20037970080695772, 0.22796758954516716, 0.14607138112877255, -0.12518824212149612, 0.003201239381019992, 0.18812363615121555] |
1,803.03576 | Illuminating an Ecosystem of Partisan Websites | This paper aims to shed light on alternative news media ecosystems that are
believed to have influenced opinions and beliefs by false and/or biased news
reporting during the 2016 US Presidential Elections. We examine a large,
professionally curated list of 668 hyper-partisan websites and their
corresponding Facebook pages, and identify key characteristics that mediate the
traffic flow within this ecosystem. We uncover a pattern of new websites being
established in the run up to the elections, and abandoned after. Such websites
form an ecosystem, creating links from one website to another, and by `liking'
each others' Facebook pages. These practices are highly effective in directing
user traffic internally within the ecosystem in a highly partisan manner, with
right-leaning sites linking to and liking other right-leaning sites and
similarly left-leaning sites linking to other sites on the left, thus forming a
filter bubble amongst news producers similar to the filter bubble which has
been widely observed among consumers of partisan news. Whereas there is
activity along both left- and right-leaning sites, right-leaning sites are more
evolved, accounting for a disproportionate number of abandoned websites and
partisan internal links. We also examine demographic characteristics of
consumers of hyper-partisan news and find that some of the more populous
demographic groups in the US tend to be consumers of more right-leaning sites.
| cs.SI | this paper aims to shed light on alternative news media ecosystems that are believed to have influenced opinions and beliefs by false andor biased news reporting during the 2016 us presidential elections we examine a large professionally curated list of 668 hyperpartisan websites and their corresponding facebook pages and identify key characteristics that mediate the traffic flow within this ecosystem we uncover a pattern of new websites being established in the run up to the elections and abandoned after such websites form an ecosystem creating links from one website to another and by liking each others facebook pages these practices are highly effective in directing user traffic internally within the ecosystem in a highly partisan manner with rightleaning sites linking to and liking other rightleaning sites and similarly leftleaning sites linking to other sites on the left thus forming a filter bubble amongst news producers similar to the filter bubble which has been widely observed among consumers of partisan news whereas there is activity along both left and rightleaning sites rightleaning sites are more evolved accounting for a disproportionate number of abandoned websites and partisan internal links we also examine demographic characteristics of consumers of hyperpartisan news and find that some of the more populous demographic groups in the us tend to be consumers of more rightleaning sites | [['this', 'paper', 'aims', 'to', 'shed', 'light', 'on', 'alternative', 'news', 'media', 'ecosystems', 'that', 'are', 'believed', 'to', 'have', 'influenced', 'opinions', 'and', 'beliefs', 'by', 'false', 'andor', 'biased', 'news', 'reporting', 'during', 'the', '2016', 'us', 'presidential', 'elections', 'we', 'examine', 'a', 'large', 'professionally', 'curated', 'list', 'of', '668', 'hyperpartisan', 'websites', 'and', 'their', 'corresponding', 'facebook', 'pages', 'and', 'identify', 'key', 'characteristics', 'that', 'mediate', 'the', 'traffic', 'flow', 'within', 'this', 'ecosystem', 'we', 'uncover', 'a', 'pattern', 'of', 'new', 'websites', 'being', 'established', 'in', 'the', 'run', 'up', 'to', 'the', 'elections', 'and', 'abandoned', 'after', 'such', 'websites', 'form', 'an', 'ecosystem', 'creating', 'links', 'from', 'one', 'website', 'to', 'another', 'and', 'by', 'liking', 'each', 'others', 'facebook', 'pages', 'these', 'practices', 'are', 'highly', 'effective', 'in', 'directing', 'user', 'traffic', 'internally', 'within', 'the', 'ecosystem', 'in', 'a', 'highly', 'partisan', 'manner', 'with', 'rightleaning', 'sites', 'linking', 'to', 'and', 'liking', 'other', 'rightleaning', 'sites', 'and', 'similarly', 'leftleaning', 'sites', 'linking', 'to', 'other', 'sites', 'on', 'the', 'left', 'thus', 'forming', 'a', 'filter', 'bubble', 'amongst', 'news', 'producers', 'similar', 'to', 'the', 'filter', 'bubble', 'which', 'has', 'been', 'widely', 'observed', 'among', 'consumers', 'of', 'partisan', 'news', 'whereas', 'there', 'is', 'activity', 'along', 'both', 'left', 'and', 'rightleaning', 'sites', 'rightleaning', 'sites', 'are', 'more', 'evolved', 'accounting', 'for', 'a', 'disproportionate', 'number', 'of', 'abandoned', 'websites', 'and', 'partisan', 'internal', 'links', 'we', 'also', 'examine', 'demographic', 'characteristics', 'of', 'consumers', 'of', 'hyperpartisan', 'news', 'and', 'find', 'that', 'some', 'of', 'the', 'more', 'populous', 'demographic', 'groups', 'in', 'the', 'us', 'tend', 'to', 'be', 'consumers', 'of', 'more', 'rightleaning', 'sites']] | [-0.10705110031203689, 0.10834284430839956, -0.03132910218973932, 0.1199682798651841, -0.14077039079393006, -0.17810771801221412, 0.15046034053382185, 0.43351105437506726, -0.21584857726031872, -0.32485019037508606, 0.08445217401488826, -0.3986081462353468, -0.1342655481901535, 0.14832865741358178, -0.07157692426283445, -0.1020342056201728, 0.02048553468140211, 0.038759418707426795, 0.08851515639826553, -0.3542235850159096, 0.28824610286553215, 0.07597168481990282, 0.31744504298516957, 0.05464662105909416, 0.03400180394512339, -0.024795224727560607, -0.12661137678571935, -0.02084130889088053, -0.09800729341747981, 0.15053113121953782, 0.3271190323523559, 0.1899608342751672, 0.3356848778975655, -0.42461514393133776, -0.13014411672784557, 0.09900384249105569, 0.13355728111998072, 0.08285700511144396, -0.03853722409261251, -0.362392962279339, 0.06279486921628774, -0.24016261619756057, -0.0875437440455801, -0.05072721334341656, 0.06037065176902691, 0.07343432250095226, -0.1858725898694204, 0.04212311731060229, -0.023315342903901148, 0.07937490275721945, 0.006225123438203047, -0.07901646128763372, -0.07546069366805908, 0.22370815439115402, 0.12892756206713069, -0.030195855172908938, 0.1839596273437623, -0.17102572450431466, -0.13336859129944362, 0.3932055845848083, 0.01513877341712606, -0.10431691629743453, 0.22049999463668069, -0.07553526129110068, -0.13073053869337256, 0.07615515247442274, 0.22462439051591082, 0.05634039833987226, -0.2201359396530015, -0.07628524397695137, -0.07622085563615308, 0.18891420547393353, 0.11836623397660077, -0.01304610434507582, 0.23993703468020336, 0.1372835704338445, 0.0922643700582383, 0.0694821089050681, -0.01925532203725612, -0.09484017216750691, -0.1440997158040664, -0.14236504287128487, -0.08304212751266148, 0.03400316930210759, -0.08380524744105328, -0.14679367518511682, 0.3922522819208299, 0.14758444554494343, 0.1466395669114617, -0.019936534908096132, 0.19403597994488642, -0.06384122579826325, 0.100553669619389, 0.13541614946540154, 0.12582386922252725, -0.013306666417734071, 0.1982649119489307, -0.10594104846814982, 0.1699885208704745, -0.017919010493458003] |
1,803.03577 | Intentions of Vulnerable Road Users - Detection and Forecasting by Means
of Machine Learning | Avoiding collisions with vulnerable road users (VRUs) using sensor-based
early recognition of critical situations is one of the manifold opportunities
provided by the current development in the field of intelligent vehicles. As
especially pedestrians and cyclists are very agile and have a variety of
movement options, modeling their behavior in traffic scenes is a challenging
task. In this article we propose movement models based on machine learning
methods, in particular artificial neural networks, in order to classify the
current motion state and to predict the future trajectory of VRUs. Both model
types are also combined to enable the application of specifically trained
motion predictors based on a continuously updated pseudo probabilistic state
classification. Furthermore, the architecture is used to evaluate
motion-specific physical models for starting and stopping and video-based
pedestrian motion classification. A comprehensive dataset consisting of 1068
pedestrian and 494 cyclist scenes acquired at an urban intersection is used for
optimization, training, and evaluation of the different models. The results
show substantial higher classification rates and the ability to earlier
recognize motion state changes with the machine learning approaches compared to
interacting multiple model (IMM) Kalman Filtering. The trajectory prediction
quality is also improved for all kinds of test scenes, especially when starting
and stopping motions are included. Here, 37\% and 41\% lower position errors
were achieved on average, respectively.
| cs.CV | avoiding collisions with vulnerable road users vrus using sensorbased early recognition of critical situations is one of the manifold opportunities provided by the current development in the field of intelligent vehicles as especially pedestrians and cyclists are very agile and have a variety of movement options modeling their behavior in traffic scenes is a challenging task in this article we propose movement models based on machine learning methods in particular artificial neural networks in order to classify the current motion state and to predict the future trajectory of vrus both model types are also combined to enable the application of specifically trained motion predictors based on a continuously updated pseudo probabilistic state classification furthermore the architecture is used to evaluate motionspecific physical models for starting and stopping and videobased pedestrian motion classification a comprehensive dataset consisting of 1068 pedestrian and 494 cyclist scenes acquired at an urban intersection is used for optimization training and evaluation of the different models the results show substantial higher classification rates and the ability to earlier recognize motion state changes with the machine learning approaches compared to interacting multiple model imm kalman filtering the trajectory prediction quality is also improved for all kinds of test scenes especially when starting and stopping motions are included here 37 and 41 lower position errors were achieved on average respectively | [['avoiding', 'collisions', 'with', 'vulnerable', 'road', 'users', 'vrus', 'using', 'sensorbased', 'early', 'recognition', 'of', 'critical', 'situations', 'is', 'one', 'of', 'the', 'manifold', 'opportunities', 'provided', 'by', 'the', 'current', 'development', 'in', 'the', 'field', 'of', 'intelligent', 'vehicles', 'as', 'especially', 'pedestrians', 'and', 'cyclists', 'are', 'very', 'agile', 'and', 'have', 'a', 'variety', 'of', 'movement', 'options', 'modeling', 'their', 'behavior', 'in', 'traffic', 'scenes', 'is', 'a', 'challenging', 'task', 'in', 'this', 'article', 'we', 'propose', 'movement', 'models', 'based', 'on', 'machine', 'learning', 'methods', 'in', 'particular', 'artificial', 'neural', 'networks', 'in', 'order', 'to', 'classify', 'the', 'current', 'motion', 'state', 'and', 'to', 'predict', 'the', 'future', 'trajectory', 'of', 'vrus', 'both', 'model', 'types', 'are', 'also', 'combined', 'to', 'enable', 'the', 'application', 'of', 'specifically', 'trained', 'motion', 'predictors', 'based', 'on', 'a', 'continuously', 'updated', 'pseudo', 'probabilistic', 'state', 'classification', 'furthermore', 'the', 'architecture', 'is', 'used', 'to', 'evaluate', 'motionspecific', 'physical', 'models', 'for', 'starting', 'and', 'stopping', 'and', 'videobased', 'pedestrian', 'motion', 'classification', 'a', 'comprehensive', 'dataset', 'consisting', 'of', '1068', 'pedestrian', 'and', '494', 'cyclist', 'scenes', 'acquired', 'at', 'an', 'urban', 'intersection', 'is', 'used', 'for', 'optimization', 'training', 'and', 'evaluation', 'of', 'the', 'different', 'models', 'the', 'results', 'show', 'substantial', 'higher', 'classification', 'rates', 'and', 'the', 'ability', 'to', 'earlier', 'recognize', 'motion', 'state', 'changes', 'with', 'the', 'machine', 'learning', 'approaches', 'compared', 'to', 'interacting', 'multiple', 'model', 'imm', 'kalman', 'filtering', 'the', 'trajectory', 'prediction', 'quality', 'is', 'also', 'improved', 'for', 'all', 'kinds', 'of', 'test', 'scenes', 'especially', 'when', 'starting', 'and', 'stopping', 'motions', 'are', 'included', 'here', '37', 'and', '41', 'lower', 'position', 'errors', 'were', 'achieved', 'on', 'average', 'respectively']] | [-0.0859991140621291, 0.04151832503326163, -0.07349124709779227, 0.0590466852864748, -0.08625422904098576, -0.16759832149202172, 0.029718481881586326, 0.43780474033714695, -0.21998194753912023, -0.3570471978174861, 0.11423493747662922, -0.27566136675040154, -0.14361731777263975, 0.21538908255752176, -0.14877883030567318, 0.09818012499070557, 0.1318705574667547, 0.06698839613818564, -0.019791730199623006, -0.2669779877723406, 0.2648486214245416, 0.02933918868233873, 0.34622698239770466, -0.0008386799007315528, 0.1223162724234333, -0.009718181406655773, -0.031467871280090716, 0.006072584881489589, -0.05225672786195487, 0.15951649852415192, 0.2968633689633035, 0.14250777672423282, 0.2801338744519109, -0.42074267050590025, -0.22875410400182855, 0.0864512927141649, 0.1352225494422865, 0.09442833015398884, -0.0136693003624466, -0.37665398532884536, 0.0694818593781251, -0.1854992387773977, -0.05960048817717258, -0.10811778498305516, 0.025700533147160472, 0.017539267052250746, -0.268008380462098, 0.02604860127771231, 0.019940449199004267, 0.1152586565437642, -0.09437722049240785, -0.11406975697609596, 0.016590598569283348, 0.19239317711233692, 0.039469130303372034, 0.03324847975745797, 0.1785827799091666, -0.20857169890630095, -0.17059664130898786, 0.3996356669982726, -0.031020650230030613, -0.20421335685744205, 0.24433230509007858, -0.0391463102878664, -0.12810059211809527, 0.11609590545783496, 0.27740636810406366, 0.11013165046990087, -0.17838311473215898, -0.03867300708344291, 0.018391039497642356, 0.12812215576202354, 0.03272633609700609, -0.04110852138414471, 0.19031513027942062, 0.26170843959235673, 0.04540075283307074, 0.08799210597274147, -0.16214784338160165, -0.10552177297014913, -0.22201990365415855, -0.0955680479105054, -0.123630781193242, -0.003917117866645144, -0.07281676416896517, -0.10865091921401802, 0.3911032918247987, 0.24033056957943535, 0.19277069496456534, 0.07598789694867182, 0.32211506174115295, 0.040353673008609224, 0.02616761525436728, 0.09411763229317413, 0.18702893514180852, 0.006283607929204168, 0.14622427081657488, -0.18802310709460554, 0.08284574095159769, 0.03694198615849018] |
1,803.03578 | No Particle Production in Two Dimensions: Recursion Relations and
Multi-Regge Limit | We introduce high-energy limits which allow us to derive recursion relations
fixing the various couplings of Lagrangians of two-dimensional relativistic
quantum field theories with no tree-level particle production in a very
straightforward way. The sine-Gordon model, the Bullough-Dodd theory, Toda
theories of various kinds and the U(N) non-linear sigma model can all be
rediscovered in this way. The results here were the outcome of our explorations
at the 2017 Perimeter Institute Winter School.
| hep-th | we introduce highenergy limits which allow us to derive recursion relations fixing the various couplings of lagrangians of twodimensional relativistic quantum field theories with no treelevel particle production in a very straightforward way the sinegordon model the bulloughdodd theory toda theories of various kinds and the un nonlinear sigma model can all be rediscovered in this way the results here were the outcome of our explorations at the 2017 perimeter institute winter school | [['we', 'introduce', 'highenergy', 'limits', 'which', 'allow', 'us', 'to', 'derive', 'recursion', 'relations', 'fixing', 'the', 'various', 'couplings', 'of', 'lagrangians', 'of', 'twodimensional', 'relativistic', 'quantum', 'field', 'theories', 'with', 'no', 'treelevel', 'particle', 'production', 'in', 'a', 'very', 'straightforward', 'way', 'the', 'sinegordon', 'model', 'the', 'bulloughdodd', 'theory', 'toda', 'theories', 'of', 'various', 'kinds', 'and', 'the', 'un', 'nonlinear', 'sigma', 'model', 'can', 'all', 'be', 'rediscovered', 'in', 'this', 'way', 'the', 'results', 'here', 'were', 'the', 'outcome', 'of', 'our', 'explorations', 'at', 'the', '2017', 'perimeter', 'institute', 'winter', 'school']] | [-0.0888573318458328, 0.18117233777852498, -0.1257307520455183, 0.09720011853632096, -0.0912037946551732, -0.15554208422641028, -0.008380441491058327, 0.2700063077388459, -0.2008137883305907, -0.3167390751920334, 0.041196489314331786, -0.2610425129532814, -0.1744967335197207, 0.17602627173748683, -0.016216587664380874, 0.06614018106244644, 0.027588316990534635, 0.0032850697362310673, -0.06109530033467159, -0.29464258632163376, 0.26846010678077803, 0.05555001153349111, 0.2682617609006391, 0.047237281789620444, 0.06329357045485753, 0.03119495301188467, -0.003129018364595377, -0.00648068031296134, -0.16912644993105572, 0.13794021516374938, 0.2499558680678067, 0.07777382349531638, 0.18437276574566144, -0.45525477540819614, -0.21066989269337222, 0.06672385053020226, 0.08746044955866998, 0.16336246993399084, -0.021553795886774585, -0.31101499878074207, -0.022543402950037015, -0.2023840376418339, -0.17839357053720686, -0.06254480714105988, -0.02221980340593839, -0.039473743669127356, -0.21877942114353996, 0.06077800714729788, 0.006410020167543872, 0.07184918033762848, -0.0300552520473577, -0.07917911182986954, -0.041213298312145964, 0.09799574654268688, 0.04444717479014948, 0.031425055958432695, 0.0829368235084088, -0.16720351926688973, -0.1761070690564301, 0.41847067152800627, -0.05901473727115519, -0.1996300014322751, 0.20309440195815612, -0.1699240197912369, -0.22454043941521276, 0.048906367597463606, 0.16906615590344962, 0.11857257677522832, -0.20256216552312653, 0.20073754548283346, -0.04365176226007226, 0.09718384409693312, 0.10909694979247982, 0.024191763055868037, 0.26199605742673554, 0.10150774982949234, -0.021517856558465897, 0.07263047244297723, -0.052396232619473376, -0.13234422661440626, -0.3895905370989891, -0.15249321277393665, -0.03796085494742665, 0.04700888099455058, -0.08588857222838832, -0.14292329292718883, 0.3812836111612516, 0.17112923121998366, 0.12694791876647163, 0.06822099506197982, 0.17090787929929283, 0.16518053207195632, 0.063038710364434, 0.0487365081064301, 0.23908691027852363, 0.19123191927712768, 0.08923361412160201, -0.17957545999335509, -0.06069846790641138, 0.16024182216353614] |
1,803.03579 | Log-scale equidistribution of nodal sets in Grauert tubes | Let $M_{\tau_0}$ be the Grauert tube (of some fixed radius $\tau_0$) of a
compact, negatively curved, real analytic Riemannian manifold $M$ without
boundary. Let $\phi_\lambda$ be a Laplacian eigenfunction on $M$ of eigenvalues
$-\lambda^2$ and let $\phi_\lambda^\mathbb{C}$ be its holomorphic extension to
$M_{\tau_0}$. In this article, we prove that on $M_{\tau_0} \setminus M$, there
exists a dimensional constant $\alpha > 0$ and a full density subsequence $
\{\lambda_{j_k}\}_{k=1}^{\infty}$ of the spectrum for which the masses of the
complexified eigenfunctions $\phi_{\lambda_{j_k}}^\mathbb{C}$ are
asymptotically equidistributed at length scale $(\log
\lambda_{j_k})^{-\alpha}$. Moreover, the complex zeros of
$\phi_{\lambda_{j_k}}^\mathbb{C}$ also become equidistributed on this
logarithmic length scale.
| math.AP | let m_tau_0 be the grauert tube of some fixed radius tau_0 of a compact negatively curved real analytic riemannian manifold m without boundary let phi_lambda be a laplacian eigenfunction on m of eigenvalues lambda2 and let phi_lambdamathbbc be its holomorphic extension to m_tau_0 in this article we prove that on m_tau_0 setminus m there exists a dimensional constant alpha 0 and a full density subsequence lambda_j_k_k1infty of the spectrum for which the masses of the complexified eigenfunctions phi_lambda_j_kmathbbc are asymptotically equidistributed at length scale log lambda_j_kalpha moreover the complex zeros of phi_lambda_j_kmathbbc also become equidistributed on this logarithmic length scale | [['let', 'm_tau_0', 'be', 'the', 'grauert', 'tube', 'of', 'some', 'fixed', 'radius', 'tau_0', 'of', 'a', 'compact', 'negatively', 'curved', 'real', 'analytic', 'riemannian', 'manifold', 'm', 'without', 'boundary', 'let', 'phi_lambda', 'be', 'a', 'laplacian', 'eigenfunction', 'on', 'm', 'of', 'eigenvalues', 'lambda2', 'and', 'let', 'phi_lambdamathbbc', 'be', 'its', 'holomorphic', 'extension', 'to', 'm_tau_0', 'in', 'this', 'article', 'we', 'prove', 'that', 'on', 'm_tau_0', 'setminus', 'm', 'there', 'exists', 'a', 'dimensional', 'constant', 'alpha', '0', 'and', 'a', 'full', 'density', 'subsequence', 'lambda_j_k_k1infty', 'of', 'the', 'spectrum', 'for', 'which', 'the', 'masses', 'of', 'the', 'complexified', 'eigenfunctions', 'phi_lambda_j_kmathbbc', 'are', 'asymptotically', 'equidistributed', 'at', 'length', 'scale', 'log', 'lambda_j_kalpha', 'moreover', 'the', 'complex', 'zeros', 'of', 'phi_lambda_j_kmathbbc', 'also', 'become', 'equidistributed', 'on', 'this', 'logarithmic', 'length', 'scale']] | [-0.22183207960701304, 0.155376212916484, -0.06679332513288644, 0.04271649830288401, -0.08340529781079999, -0.15980297987790484, -0.024492703739394384, 0.3418512172506828, -0.22549646583042646, -0.17242096462532094, 0.11220773530903419, -0.3162594042032173, -0.08759205053364368, 0.173532408894971, -0.07972765005879888, 0.02276713082039925, 0.07255809928633665, 0.13756557319705423, -0.08280772647428278, -0.19843402581387445, 0.37160226353689246, -0.011286337301135064, 0.15274515612001874, 0.08751759230600376, 0.07161784524122547, -0.04387892793471876, 0.05087876013038974, 0.008350919983594825, -0.21887255374527548, 0.08836449815303479, 0.24736662009534868, 0.04835344155711171, 0.25958021843903945, -0.3513048928721171, -0.1582920004074511, 0.2308772371444655, 0.20526628432991473, -0.12131537891262652, 0.03445517474564871, -0.2791449660190234, 0.1639589945883735, -0.04382173368021062, -0.2353044100179288, -0.027597132325172424, 0.1237313149398879, -0.014566444578629576, -0.26680939586735086, 0.04892143277469777, 0.07212832330873138, 0.06656156002886986, -0.0222606538807189, -0.13464286076885304, -0.053072765038201686, 0.04862867877083389, 0.030502365539340597, 0.11681005045477497, 0.09181140500463937, 0.019912310330868134, -0.022780842042381042, 0.3196785781385475, -0.11746873454631944, -0.28586101290818894, 0.05367188442890582, -0.21561104309205947, -0.11581775491174899, 0.11546614684752728, 0.13897800029525043, 0.17815804032020663, 0.007249161855954873, 0.2597585152234196, -0.09582271619675387, 0.1762203813383454, 0.15156951524611367, -0.008763996526402862, 0.16441634678232828, 0.08380545332635704, 0.15547949716611154, 0.05085232808426218, -0.013854133401458201, -0.01549461141081625, -0.36385913616732546, -0.1755246919432753, -0.20491885764916476, 0.23789278526888474, -0.20495864902347277, -0.25168485937542034, 0.34264207251958156, 0.04733709342912526, 0.26147903554925794, 0.16279364438163804, 0.1964217148169777, 0.11551381464018241, 0.03619587231966618, 0.13781416955354966, 0.052472226298720524, 0.18285886359303014, 0.0026332784395076726, -0.19235117437416002, -0.08336048727168849, 0.14667052504312444] |
1,803.0358 | Pseudodifferential calculus on noncommutative tori, II. Main properties | This paper is the 2nd part of a two-paper series whose aim is to give a
detailed description of Connes' pseudodifferential calculus on noncommutative
$n$-tori, $n\geq 2$. We make use of the tools introduced in the 1st part to
deal with the main properties of pseudodifferential operators on noncommutative
tori of any dimension $n\geq 2$. This includes the main results mentioned in
the original notes of Connes and Baaj. We also obtain further results regarding
action on Sobolev spaces, spectral theory of elliptic operators, and
Schatten-class properties of pseudodifferential operators of negative order,
including a trace-formula for pseudodifferential operators of order $<-n$.
| math.OA | this paper is the 2nd part of a twopaper series whose aim is to give a detailed description of connes pseudodifferential calculus on noncommutative ntori ngeq 2 we make use of the tools introduced in the 1st part to deal with the main properties of pseudodifferential operators on noncommutative tori of any dimension ngeq 2 this includes the main results mentioned in the original notes of connes and baaj we also obtain further results regarding action on sobolev spaces spectral theory of elliptic operators and schattenclass properties of pseudodifferential operators of negative order including a traceformula for pseudodifferential operators of order n | [['this', 'paper', 'is', 'the', '2nd', 'part', 'of', 'a', 'twopaper', 'series', 'whose', 'aim', 'is', 'to', 'give', 'a', 'detailed', 'description', 'of', 'connes', 'pseudodifferential', 'calculus', 'on', 'noncommutative', 'ntori', 'ngeq', '2', 'we', 'make', 'use', 'of', 'the', 'tools', 'introduced', 'in', 'the', '1st', 'part', 'to', 'deal', 'with', 'the', 'main', 'properties', 'of', 'pseudodifferential', 'operators', 'on', 'noncommutative', 'tori', 'of', 'any', 'dimension', 'ngeq', '2', 'this', 'includes', 'the', 'main', 'results', 'mentioned', 'in', 'the', 'original', 'notes', 'of', 'connes', 'and', 'baaj', 'we', 'also', 'obtain', 'further', 'results', 'regarding', 'action', 'on', 'sobolev', 'spaces', 'spectral', 'theory', 'of', 'elliptic', 'operators', 'and', 'schattenclass', 'properties', 'of', 'pseudodifferential', 'operators', 'of', 'negative', 'order', 'including', 'a', 'traceformula', 'for', 'pseudodifferential', 'operators', 'of', 'order', 'n']] | [-0.12503897162652253, 0.02642956924726172, -0.07029345951568668, 0.10299204277003755, -0.09956645643301677, -0.0773490303251339, -0.053784385645107395, 0.2975013188021903, -0.24196850645383544, -0.2246066483180269, 0.14890844408782328, -0.3182811489384068, -0.1512442813554576, 0.1887726775176897, -0.17408639885079447, 0.03926814972690427, 0.021568736190548037, 0.0970361459041291, -0.1365678444905852, -0.2521995752323695, 0.4848705409233007, -0.00034248049251071297, 0.12856745658128862, 0.08419465294827035, 0.057596404465044486, 0.019320919130015934, -0.10861332880535929, -0.07489483601109374, -0.16991948306538615, 0.2008425149211365, 0.28529212545917026, 0.0210965502393976, 0.27683875765098204, -0.39230816497808635, -0.1662812964935409, 0.10094325953407564, 0.09847253863469209, 0.009116560137729244, 0.02152609927602813, -0.3219103927880821, 0.0991357433042572, -0.1535379283157832, -0.16475404945598676, -0.1100815778095644, 0.03145794501288397, 0.007430594273275778, -0.2631795075353198, 0.018593794340901724, 0.18139962874592677, 0.1302658798136186, -0.12323719903937366, -0.09281032182054945, 0.019163697441615682, 0.11097077329500145, -0.006850714011505099, -0.004517166875302792, 0.029135704584567265, -0.018063695082385645, -0.16740310154071464, 0.32815522216905907, -0.07248382111043107, -0.2142799542386933, 0.08324451069578086, -0.1984111776501678, -0.1893241667732744, 0.05337224295478093, 0.15398351262014653, 0.20739447038233427, -0.07461136121229076, 0.1922753138253281, -0.02791798306991563, 0.16427866859121784, 0.0707036625169734, 0.04890473527225232, 0.05111884493565205, 0.08495302430277986, 0.09321986596644072, 0.1321657226457823, 0.03186981806227255, -0.08146820943583596, -0.3975156102661449, -0.19296788627115807, -0.12336313109937133, 0.1333626564845701, -0.10363449007797165, -0.19423842411672715, 0.44690762238005305, 0.1381080673528042, 0.17643329044250716, 0.06816901395669078, 0.209995178176127, 0.1258673364008975, 0.060022698209902255, 0.03157723846264405, 0.13007669838947603, 0.2490144636260696, 0.14660540372041045, -0.12423712849653888, -0.061953004523374065, 0.2619389232229626] |
1,803.03581 | Linear and nonlinear coherent perfect absorbers on simple layers | We consider linear and nonlinear coherent perfect absorbers (CPAs) in
multidimensional geometries and construct explicitly the respective perfectly
absorbed solutions. The multidimensional CPAs have a structure of the so-called
simple layers which represent the generalization of the point $\delta$ function
potential to higher dimensions. The considered examples include broadband CPAs
confined to a straight line (in a two-dimensional setting) and to a plane (in
the three-dimensional space); CPAs for topological vortices on an absorbing
circle; as well as axially-symmetric CPAs on a sphere. Additionally, it is
shown that a paraxial beam propagating along a surface nonlinear CPA embedded
in the three-dimensional space can be stable against perturbations. The results
are interpreted in applications to optical and acoustic systems.
| physics.optics nlin.PS | we consider linear and nonlinear coherent perfect absorbers cpas in multidimensional geometries and construct explicitly the respective perfectly absorbed solutions the multidimensional cpas have a structure of the socalled simple layers which represent the generalization of the point delta function potential to higher dimensions the considered examples include broadband cpas confined to a straight line in a twodimensional setting and to a plane in the threedimensional space cpas for topological vortices on an absorbing circle as well as axiallysymmetric cpas on a sphere additionally it is shown that a paraxial beam propagating along a surface nonlinear cpa embedded in the threedimensional space can be stable against perturbations the results are interpreted in applications to optical and acoustic systems | [['we', 'consider', 'linear', 'and', 'nonlinear', 'coherent', 'perfect', 'absorbers', 'cpas', 'in', 'multidimensional', 'geometries', 'and', 'construct', 'explicitly', 'the', 'respective', 'perfectly', 'absorbed', 'solutions', 'the', 'multidimensional', 'cpas', 'have', 'a', 'structure', 'of', 'the', 'socalled', 'simple', 'layers', 'which', 'represent', 'the', 'generalization', 'of', 'the', 'point', 'delta', 'function', 'potential', 'to', 'higher', 'dimensions', 'the', 'considered', 'examples', 'include', 'broadband', 'cpas', 'confined', 'to', 'a', 'straight', 'line', 'in', 'a', 'twodimensional', 'setting', 'and', 'to', 'a', 'plane', 'in', 'the', 'threedimensional', 'space', 'cpas', 'for', 'topological', 'vortices', 'on', 'an', 'absorbing', 'circle', 'as', 'well', 'as', 'axiallysymmetric', 'cpas', 'on', 'a', 'sphere', 'additionally', 'it', 'is', 'shown', 'that', 'a', 'paraxial', 'beam', 'propagating', 'along', 'a', 'surface', 'nonlinear', 'cpa', 'embedded', 'in', 'the', 'threedimensional', 'space', 'can', 'be', 'stable', 'against', 'perturbations', 'the', 'results', 'are', 'interpreted', 'in', 'applications', 'to', 'optical', 'and', 'acoustic', 'systems']] | [-0.1319868005013046, 0.09666406435182148, -0.014637544411787037, 0.07214159161144457, -0.059059408824827714, -0.1344639400762143, -0.0007855240255594254, 0.41237269405086163, -0.2608755058845726, -0.20851211143278722, 0.10453354118498422, -0.2642475120186553, -0.1511857070451034, 0.2168434088126267, -0.02979106229919372, 0.08188552713274198, 0.00021732585125807988, -0.030361650556018104, -0.05763982336028969, -0.17193729883470274, 0.2939728648180805, 0.0071621631347116525, 0.2673898219225644, -0.0086086132303196, 0.09559482298357318, 0.018929537556378835, 0.017450074128554028, 0.08063408085667939, -0.1210624150149608, 0.08568187311865878, 0.23120087980708576, 0.020167362457930535, 0.18385300397432913, -0.43460444435161555, -0.2902721729350545, 0.08378560364372649, 0.16196962706059004, 0.13866897729537214, -0.04936747713274938, -0.29765759700498845, 0.05451347977041377, -0.12796768109645631, -0.19307688502121276, -0.061017986497510286, -0.0011664408385374787, 0.04278389748059592, -0.24589759644004516, 0.031931406400024384, 0.05899611835356139, -0.002395398142699239, -0.06319119470683321, -0.02400709021149866, -0.0733629566798839, 0.05865154660433152, -0.031546312774002744, 0.02281471178866923, 0.0822655044503952, -0.11287370803460116, -0.11444183226361065, 0.42701541922860226, -0.0806250231975879, -0.2773655302570028, 0.17877853612348404, -0.11450199879729583, -0.05139538693297023, 0.15589193680513083, 0.2252960487474072, 0.13088779164857026, -0.08446061643979007, 0.08422050925397898, -0.08604072985412964, 0.13926357208574547, 0.089956043418339, 0.0466755230405952, 0.2398247011755672, 0.11674680055703147, 0.07216942624259992, 0.16533567865825086, -0.06730018663456884, -0.11104222391810963, -0.32004889350195054, -0.15648286163972658, -0.14228232076758582, 0.032401105219308855, -0.06599614579749483, -0.2274930769490311, 0.3786116132406139, 0.05973178426482541, 0.22696318679244526, -0.016712481066213637, 0.301439208025902, 0.12602231741125175, 0.04578305626193346, 0.05460957786605015, 0.25579691537797955, 0.156786339367361, 0.08810781486632334, -0.15902783002179527, -0.052107944366348496, 0.052684379749442053] |
1,803.03582 | Weighted quivers | A "weight" on a quiver $Q$ with values in a group $G$ is a function which
assigns an element of $G$ for each arrow in $Q$. This paper shows that the
essential steps in the mutation of quivers with potential [DWZ] goes through
with weights provided that the weights on each cycle in the potential have
trivial product. This gives another proof of the sign coherence of $c$-vectors.
We also classify all weights on tame quivers.
| math.RT | a weight on a quiver q with values in a group g is a function which assigns an element of g for each arrow in q this paper shows that the essential steps in the mutation of quivers with potential dwz goes through with weights provided that the weights on each cycle in the potential have trivial product this gives another proof of the sign coherence of cvectors we also classify all weights on tame quivers | [['a', 'weight', 'on', 'a', 'quiver', 'q', 'with', 'values', 'in', 'a', 'group', 'g', 'is', 'a', 'function', 'which', 'assigns', 'an', 'element', 'of', 'g', 'for', 'each', 'arrow', 'in', 'q', 'this', 'paper', 'shows', 'that', 'the', 'essential', 'steps', 'in', 'the', 'mutation', 'of', 'quivers', 'with', 'potential', 'dwz', 'goes', 'through', 'with', 'weights', 'provided', 'that', 'the', 'weights', 'on', 'each', 'cycle', 'in', 'the', 'potential', 'have', 'trivial', 'product', 'this', 'gives', 'another', 'proof', 'of', 'the', 'sign', 'coherence', 'of', 'cvectors', 'we', 'also', 'classify', 'all', 'weights', 'on', 'tame', 'quivers']] | [-0.1543470850214362, 0.10276927111844998, -0.1010198275744915, -0.023995499581408997, -0.06768318404133121, -0.1639832012852033, 0.06559338819390784, 0.3826287241776784, -0.31335181755324204, -0.20696064492687583, 0.03714416692654292, -0.23577406793832778, -0.16651804943724224, 0.12768428225070239, -0.13780057601009807, -0.07050874148320872, 0.10355390476683776, 0.17408210900922616, -0.0509895154585441, -0.29567012794315817, 0.3863675044973691, -0.018626771482328573, 0.19931474283337594, 0.03284572597593069, 0.10377943949036611, 0.05655261794105172, -0.006706587591518959, -0.004844548044105371, -0.12812182219796037, 0.11306418382873137, 0.2424885840341449, 0.06541093696529666, 0.28488164850821096, -0.33748964495956896, -0.14445078724063934, 0.1879051669811209, 0.14508494347333908, 0.06992063393661131, -0.03336689303163439, -0.2109140790005525, 0.106567408926785, -0.1840522717187802, -0.1059991924961408, -0.015982988824446997, 0.1225703198214372, 0.033023729485770065, -0.292395840510726, -0.02168930072686635, 0.03564588579038779, 0.07936745590219894, -0.0762675866857171, -0.16298209999998411, -0.0536282995219032, 0.15014625674734514, -0.009301623705153665, 0.08221673119192321, 0.0432156050329407, -0.13469315682848296, -0.16659043145676453, 0.3257037404303749, -0.04379194569463531, -0.2247952646317329, 0.14552999537438155, -0.1326123730915909, -0.176561906610926, 0.09676302868872881, 0.061306678174684444, 0.11043596213683486, -0.031383302755032975, 0.13523019881298146, -0.06893580548465252, 0.11045953719876707, 0.06907237966855367, -0.013542065559886397, 0.17672642101844152, 0.13139565682038665, 0.09918691791904469, 0.1673557924727599, -0.015438725057368477, 0.0012666648315886656, -0.3776168579856555, -0.19130214483787616, -0.16762635595630854, 0.08458411227911711, -0.15461566519613068, -0.20414809660365185, 0.46520996406674386, 0.1249215342849493, 0.2622500799363479, 0.12435368073638528, 0.2140946156407396, 0.11128393484900395, 0.1497589367457355, 0.03869845733667413, 0.12216310088833172, 0.16316125164739786, 0.004186271980094413, -0.20016336087758343, 0.04255496719735675, 0.1780907484392325] |
1,803.03583 | A model with Suslin trees but no minimal uncountable linear orders other
than $\omega_1$ and $-\omega_1$ | We show that the existence of a Suslin tree does not necessarily imply that
there are uncountable minimal linear orders other than $\omega_1$ and
$-\omega_1$, answering a question of J. Baumgartner. This is done by a
Jensen-type iteration, proving that one can force CH together with a restricted
form of ladder system uniformization on trees, all while preserving a rigid
Suslin tree.
| math.LO | we show that the existence of a suslin tree does not necessarily imply that there are uncountable minimal linear orders other than omega_1 and omega_1 answering a question of j baumgartner this is done by a jensentype iteration proving that one can force ch together with a restricted form of ladder system uniformization on trees all while preserving a rigid suslin tree | [['we', 'show', 'that', 'the', 'existence', 'of', 'a', 'suslin', 'tree', 'does', 'not', 'necessarily', 'imply', 'that', 'there', 'are', 'uncountable', 'minimal', 'linear', 'orders', 'other', 'than', 'omega_1', 'and', 'omega_1', 'answering', 'a', 'question', 'of', 'j', 'baumgartner', 'this', 'is', 'done', 'by', 'a', 'jensentype', 'iteration', 'proving', 'that', 'one', 'can', 'force', 'ch', 'together', 'with', 'a', 'restricted', 'form', 'of', 'ladder', 'system', 'uniformization', 'on', 'trees', 'all', 'while', 'preserving', 'a', 'rigid', 'suslin', 'tree']] | [-0.2051326224219895, 0.1525565835106517, -0.057086860806110404, 0.07795734909333048, -0.12751622452220368, -0.17397798398780007, 0.08384847369105104, 0.33809320196779746, -0.27865023802845706, -0.19236924874806596, 0.09899369392153476, -0.2772599822210689, -0.08582062253938808, 0.18563683312987128, -0.08456868051941838, 0.022467702281691374, 0.10954918387541247, 0.06185927807969312, -0.009780677677612872, -0.2654687410573505, 0.3660044857345882, -0.05343059272385172, 0.20277470115416368, 0.0381316163787438, 0.1507994923252432, 0.01265729738835005, -0.012491412851358614, 0.09302383171950257, -0.14951710272080457, 0.12047001730740792, 0.2610726661439384, 0.1457818014652378, 0.29345586610537383, -0.3425867013452995, -0.1995391141953728, 0.17195140990436136, 0.14459011612850572, 0.06344406276325425, 0.0269969304865827, -0.2178972255468609, 0.12097666192904956, -0.14084547553812304, -0.10766765306283149, -0.09260298956125494, 0.028052777833034916, -0.007144008242082031, -0.24658352615041357, 0.004510901282511411, 0.24957233180119207, 0.08782678548126452, -0.025783770792787115, -0.10038633059312199, -0.07532046606103258, 0.044140270903646465, -0.02528219233312073, 0.12822749359803576, 0.06728961740830733, -0.03492513397002533, -0.1557971688227788, 0.3613271765831497, -0.10946971842866098, -0.22394758443378152, 0.19604698864502773, -0.17288398313816758, -0.21483009646932083, 0.11110472539439797, -0.02136172238510147, 0.10919088913848804, -0.07962614810094237, 0.18275470995520723, -0.15584166492185286, 0.18901286011696944, 0.18494416365490085, -0.05334491294718558, 0.12283446781446165, 0.08884740338450478, 0.1553382720017145, 0.0925413224585129, 0.08338264347760067, -0.037836046904445655, -0.27016301525215947, -0.12925215139083804, -0.1304245537161947, 0.10548894728121776, -0.07333183298314613, -0.21368703158992913, 0.3123325063929623, 0.0940003558287337, 0.19294110727646657, 0.16026113340030274, 0.23460347854322003, 0.07568482570951024, 0.07731038954244146, 0.12012275692165619, 0.16051274110213853, 0.1252531825692483, -0.03941113678663368, -0.13940933864233235, 0.07808304632142667, 0.19005473180403631] |
1,803.03584 | Pre-MAP Search for Transiting Objects Orbiting White Dwarfs | Metal pollution in white dwarf atmospheres may be the accreted remnants of
planetary objects. After the discovery of disintegrating planetary objects
transiting WD 1145+017 (Vanderburg et al. 2015), undergraduates in the
University of Washington's Pre- Major in Astronomy Program (Pre-MAP) were
inspired to collect photometry of the brightest white dwarfs to hunt for
similar transiting objects around other metal-polluted white dwarfs. Prior
surveys have yet to make a detection of a transiting planet orbiting a white
dwarf, yet white dwarfs are still an attractive target for searches of small,
rocky planetary material. Since a typical white dwarf is Earth-sized, transits
of Earth-sized planets could have depths >50%, so even low S/N photometry has a
chance at discovering transiting material. We identified bright, northern,
metal-polluted white dwarfs in the SDSS DR10 white dwarf catalog, and observed
five targets with the Astrophysical Research Consortium Small Aperture
Telescope (ARCSAT) 0.5-meter telescope at Apache Point Observatory. The ARCSAT
photometry had sufficient precision to detect Moon-sized objects or larger at
short orbital periods, though no such planets were detected for these targets.
We look forward to surveys which may find planets orbiting white dwarfs, such
as NASA's TESS, ESA's PLATO, and the Evryscope.
| astro-ph.EP astro-ph.SR | metal pollution in white dwarf atmospheres may be the accreted remnants of planetary objects after the discovery of disintegrating planetary objects transiting wd 1145017 vanderburg et al 2015 undergraduates in the university of washingtons pre major in astronomy program premap were inspired to collect photometry of the brightest white dwarfs to hunt for similar transiting objects around other metalpolluted white dwarfs prior surveys have yet to make a detection of a transiting planet orbiting a white dwarf yet white dwarfs are still an attractive target for searches of small rocky planetary material since a typical white dwarf is earthsized transits of earthsized planets could have depths 50 so even low sn photometry has a chance at discovering transiting material we identified bright northern metalpolluted white dwarfs in the sdss dr10 white dwarf catalog and observed five targets with the astrophysical research consortium small aperture telescope arcsat 05meter telescope at apache point observatory the arcsat photometry had sufficient precision to detect moonsized objects or larger at short orbital periods though no such planets were detected for these targets we look forward to surveys which may find planets orbiting white dwarfs such as nasas tess esas plato and the evryscope | [['metal', 'pollution', 'in', 'white', 'dwarf', 'atmospheres', 'may', 'be', 'the', 'accreted', 'remnants', 'of', 'planetary', 'objects', 'after', 'the', 'discovery', 'of', 'disintegrating', 'planetary', 'objects', 'transiting', 'wd', '1145017', 'vanderburg', 'et', 'al', '2015', 'undergraduates', 'in', 'the', 'university', 'of', 'washingtons', 'pre', 'major', 'in', 'astronomy', 'program', 'premap', 'were', 'inspired', 'to', 'collect', 'photometry', 'of', 'the', 'brightest', 'white', 'dwarfs', 'to', 'hunt', 'for', 'similar', 'transiting', 'objects', 'around', 'other', 'metalpolluted', 'white', 'dwarfs', 'prior', 'surveys', 'have', 'yet', 'to', 'make', 'a', 'detection', 'of', 'a', 'transiting', 'planet', 'orbiting', 'a', 'white', 'dwarf', 'yet', 'white', 'dwarfs', 'are', 'still', 'an', 'attractive', 'target', 'for', 'searches', 'of', 'small', 'rocky', 'planetary', 'material', 'since', 'a', 'typical', 'white', 'dwarf', 'is', 'earthsized', 'transits', 'of', 'earthsized', 'planets', 'could', 'have', 'depths', '50', 'so', 'even', 'low', 'sn', 'photometry', 'has', 'a', 'chance', 'at', 'discovering', 'transiting', 'material', 'we', 'identified', 'bright', 'northern', 'metalpolluted', 'white', 'dwarfs', 'in', 'the', 'sdss', 'dr10', 'white', 'dwarf', 'catalog', 'and', 'observed', 'five', 'targets', 'with', 'the', 'astrophysical', 'research', 'consortium', 'small', 'aperture', 'telescope', 'arcsat', '05meter', 'telescope', 'at', 'apache', 'point', 'observatory', 'the', 'arcsat', 'photometry', 'had', 'sufficient', 'precision', 'to', 'detect', 'moonsized', 'objects', 'or', 'larger', 'at', 'short', 'orbital', 'periods', 'though', 'no', 'such', 'planets', 'were', 'detected', 'for', 'these', 'targets', 'we', 'look', 'forward', 'to', 'surveys', 'which', 'may', 'find', 'planets', 'orbiting', 'white', 'dwarfs', 'such', 'as', 'nasas', 'tess', 'esas', 'plato', 'and', 'the', 'evryscope']] | [-0.05572740898324727, 0.18170710241798643, -0.08095649816801376, 0.11113988335016231, -0.22797806924938063, -0.1080594200504511, 0.11923541974351563, 0.35072054904462263, -0.06555717964327396, -0.4209870494681062, 0.08255148452537303, -0.3977174027595079, -0.09016393624114419, 0.24316136021228188, -0.189894014139274, 0.005760244107946302, 0.21523206056780042, -0.12961738212345722, 0.000922155186693852, -0.3895510347828156, 0.2282652333966748, 0.0927424079261137, -0.05719488648453144, -0.16684488528596256, 0.040296536698029614, -0.12388685675169755, -0.11520642966074361, -0.14259250501918636, -0.17010267754085362, -0.09453603519553629, 0.3566350643134986, 0.14515883176977926, 0.21695492114410783, -0.308716419105879, -0.246332975737092, 0.08238750770029546, 0.13538327144524742, -0.030347628060333205, -0.10894520011039055, -0.3759965655320992, 0.10783249140726496, -0.22353056470647154, -0.20863157578254815, 0.06603120425433824, 0.13232462363778566, 0.01821864554376313, -0.2004480110728323, 0.015330173496175745, 0.07148191483333857, 0.17724049616854337, -0.184496198602096, -0.19128314289205586, -0.04164131573810609, 0.09097747751299969, -0.054615862514398, 0.028110654634244815, 0.1344109556291986, -0.11093864160603985, 0.03510002634074125, 0.3997264614265831, -0.12371663351171659, 0.12231217896873885, 0.2718111423409845, -0.22231674884596483, -0.1620940190264861, 0.1260880623095095, 0.20424967269751837, 0.17815441895814876, -0.2680337049767864, -0.01783411132305216, -0.0007592781218747147, 0.1634988009471345, 0.12861718421077561, 0.07372753656495155, 0.49969450645901337, 0.16719754765896747, 0.08316340703556371, 0.003272845696439176, -0.3795711041035394, 0.008879312865302023, -0.1070331146122154, -0.12624122464860027, -0.15153543214950738, 0.08488988919263574, -0.027290696526478947, -0.14876280993345486, 0.2907907418069439, 0.12164040252500487, 0.11223559672685547, -0.04819107535377502, 0.3295661569878722, -0.01585891681477531, 0.1502791513180868, 0.11136530772218424, 0.35036538417140645, 0.14244763587089668, 0.12594872363372658, -0.1400027855409949, 0.07558681685101203, -0.03954226431740222] |
1,803.03585 | The Importance of Being Recurrent for Modeling Hierarchical Structure | Recent work has shown that recurrent neural networks (RNNs) can implicitly
capture and exploit hierarchical information when trained to solve common
natural language processing tasks such as language modeling (Linzen et al.,
2016) and neural machine translation (Shi et al., 2016). In contrast, the
ability to model structured data with non-recurrent neural networks has
received little attention despite their success in many NLP tasks (Gehring et
al., 2017; Vaswani et al., 2017). In this work, we compare the two
architectures---recurrent versus non-recurrent---with respect to their ability
to model hierarchical structure and find that recurrency is indeed important
for this purpose.
| cs.CL | recent work has shown that recurrent neural networks rnns can implicitly capture and exploit hierarchical information when trained to solve common natural language processing tasks such as language modeling linzen et al 2016 and neural machine translation shi et al 2016 in contrast the ability to model structured data with nonrecurrent neural networks has received little attention despite their success in many nlp tasks gehring et al 2017 vaswani et al 2017 in this work we compare the two architecturesrecurrent versus nonrecurrentwith respect to their ability to model hierarchical structure and find that recurrency is indeed important for this purpose | [['recent', 'work', 'has', 'shown', 'that', 'recurrent', 'neural', 'networks', 'rnns', 'can', 'implicitly', 'capture', 'and', 'exploit', 'hierarchical', 'information', 'when', 'trained', 'to', 'solve', 'common', 'natural', 'language', 'processing', 'tasks', 'such', 'as', 'language', 'modeling', 'linzen', 'et', 'al', '2016', 'and', 'neural', 'machine', 'translation', 'shi', 'et', 'al', '2016', 'in', 'contrast', 'the', 'ability', 'to', 'model', 'structured', 'data', 'with', 'nonrecurrent', 'neural', 'networks', 'has', 'received', 'little', 'attention', 'despite', 'their', 'success', 'in', 'many', 'nlp', 'tasks', 'gehring', 'et', 'al', '2017', 'vaswani', 'et', 'al', '2017', 'in', 'this', 'work', 'we', 'compare', 'the', 'two', 'architecturesrecurrent', 'versus', 'nonrecurrentwith', 'respect', 'to', 'their', 'ability', 'to', 'model', 'hierarchical', 'structure', 'and', 'find', 'that', 'recurrency', 'is', 'indeed', 'important', 'for', 'this', 'purpose']] | [0.010460381168629783, -0.024751840190182686, -0.02023467955616664, 0.04790469680375857, -0.1749586092773825, -0.14677361818980805, -0.004994411206785209, 0.4522610458032209, -0.2738434927804129, -0.4124938138571748, 0.002118172964178577, -0.2581913375048613, -0.3152304102086975, 0.17250559235238755, -0.22958908115551635, 0.144552038963504, 0.10262670398366694, -0.024291504440563067, -6.530654844732917e-05, -0.3612055378771216, 0.22980829220911375, 0.1440289203666759, 0.3761211955273638, -0.0061174870601722175, 0.10380938153699687, -0.010048574568437678, -0.06162073323027972, -0.059616394493044636, -0.0879120280907064, 0.1512088699703466, 0.3141155529325372, 0.20174289045900543, 0.33770252972584675, -0.4211149942082334, -0.2964293965594653, 0.12208045408253235, 0.1081215370587805, 0.11588703500040408, -0.002997040358961237, -0.3065860919863442, 0.0683727726002927, -0.20752080007009588, 0.054715254439079035, -0.13999686573218667, 0.13076882060066017, -0.016465995821873754, -0.2546764377424997, 0.03417110376592193, 0.20243410538520892, 0.05220183711118844, 0.016890538100875457, -0.09551309370340741, -0.02784611685771723, 0.10481061910342054, -0.003441699357627302, 0.13453096446310342, 0.04948267211890495, -0.12831274740996637, -0.20291963561761137, 0.315988922634219, -0.018744200023784473, -0.1424719669656562, 0.2730328240621911, 0.01444296480146978, -0.2586422639385778, 0.0007961650987212756, 0.26520841382443905, 0.06263038389175674, -0.1733730212888949, 0.1285719811394858, -0.09989310964723402, 0.17292866130283444, 0.11589956176657305, -0.04298918953697596, 0.1576897362306505, 0.21827835772823237, -0.08172970033329151, 0.0600051707255521, -0.0648761133197695, -0.10841463360108664, -0.08138490435952435, -0.09047571337741457, -0.19059442155709377, -0.034556105617690375, 0.025654218258658112, -0.09293935893487176, 0.3666662031366509, 0.23575477473608844, 0.26161882563551164, 0.08385197598753232, 0.26612785132601857, 0.0130589774712369, 0.06757834383906626, 0.15559163993243508, 0.20687493104107527, 0.1082545110946331, 0.2067880131855455, -0.14389924007427538, 0.11399305236587605, 0.05483875991016322] |
1,803.03586 | Towards 5G Enabled Tactile Robotic Telesurgery | Robotic telesurgery has a potential to provide extreme and urgent health care
services and bring unprecedented opportunities to deliver highly specialized
skills globally. It has a significant societal impact and is regarded as one of
the appealing use cases of Tactile Internet and 5G applications. However, the
performance of robotic telesurgery largely depends on the network performance
in terms of latency, jitter and packet loss, especially when telesurgical
system is equipped with haptic feedback. This imposes significant challenges to
design a reliable and secure but cost-effective communication solution. This
article aims to give a better understanding of the characteristics of robotic
telesurgical system, and the limiting factors, the possible telesurgery
services and the communication quality of service (QoS) requirements of the
multi-modal sensory data. Based on this, a viable network architecture enabled
by the converged edge and core cloud is presented and the relevant research
challenges, open issues and enabling technologies in the 5G communication
system are discussed.
| cs.NI | robotic telesurgery has a potential to provide extreme and urgent health care services and bring unprecedented opportunities to deliver highly specialized skills globally it has a significant societal impact and is regarded as one of the appealing use cases of tactile internet and 5g applications however the performance of robotic telesurgery largely depends on the network performance in terms of latency jitter and packet loss especially when telesurgical system is equipped with haptic feedback this imposes significant challenges to design a reliable and secure but costeffective communication solution this article aims to give a better understanding of the characteristics of robotic telesurgical system and the limiting factors the possible telesurgery services and the communication quality of service qos requirements of the multimodal sensory data based on this a viable network architecture enabled by the converged edge and core cloud is presented and the relevant research challenges open issues and enabling technologies in the 5g communication system are discussed | [['robotic', 'telesurgery', 'has', 'a', 'potential', 'to', 'provide', 'extreme', 'and', 'urgent', 'health', 'care', 'services', 'and', 'bring', 'unprecedented', 'opportunities', 'to', 'deliver', 'highly', 'specialized', 'skills', 'globally', 'it', 'has', 'a', 'significant', 'societal', 'impact', 'and', 'is', 'regarded', 'as', 'one', 'of', 'the', 'appealing', 'use', 'cases', 'of', 'tactile', 'internet', 'and', '5g', 'applications', 'however', 'the', 'performance', 'of', 'robotic', 'telesurgery', 'largely', 'depends', 'on', 'the', 'network', 'performance', 'in', 'terms', 'of', 'latency', 'jitter', 'and', 'packet', 'loss', 'especially', 'when', 'telesurgical', 'system', 'is', 'equipped', 'with', 'haptic', 'feedback', 'this', 'imposes', 'significant', 'challenges', 'to', 'design', 'a', 'reliable', 'and', 'secure', 'but', 'costeffective', 'communication', 'solution', 'this', 'article', 'aims', 'to', 'give', 'a', 'better', 'understanding', 'of', 'the', 'characteristics', 'of', 'robotic', 'telesurgical', 'system', 'and', 'the', 'limiting', 'factors', 'the', 'possible', 'telesurgery', 'services', 'and', 'the', 'communication', 'quality', 'of', 'service', 'qos', 'requirements', 'of', 'the', 'multimodal', 'sensory', 'data', 'based', 'on', 'this', 'a', 'viable', 'network', 'architecture', 'enabled', 'by', 'the', 'converged', 'edge', 'and', 'core', 'cloud', 'is', 'presented', 'and', 'the', 'relevant', 'research', 'challenges', 'open', 'issues', 'and', 'enabling', 'technologies', 'in', 'the', '5g', 'communication', 'system', 'are', 'discussed']] | [-0.20121116684956028, 0.0017546158272160005, -0.014571771050709052, 0.016030726637514425, -0.1255329314345211, -0.21074143612957735, 0.08477314146636408, 0.39855111588405656, -0.22498087346173612, -0.326044741340123, 0.14208235742253122, -0.24255425666010927, -0.20366822679444582, 0.2374977630362669, -0.16994156471683491, 0.1284620430898157, 0.11908414130853608, 0.019992346558727243, -0.0016183134678992902, -0.2655376499766319, 0.2814129600271913, 0.09651100525891856, 0.3565926251909401, 0.1298379471814378, 0.09951646511717051, -0.031073315335066305, -0.026786957761343523, -0.07318154374966473, -0.06853913459440551, 0.19186357808700186, 0.3476004008840345, 0.22280742360656208, 0.35609485786643963, -0.45175456244474915, -0.21807215011772949, 0.057280753963167154, 0.15827993365871143, 0.0048667208639362565, -0.07230459182092897, -0.30818551094448077, 0.0646237999545646, -0.2304962437741364, -0.13282065563470485, -0.07730955304872669, 0.004840191966512158, 0.045553955610304474, -0.2635735564487927, -0.031132404728574512, -0.02783988096715906, 0.05944098263855175, -0.03903929422509302, -0.0680943174454195, 0.0072668089333898095, 0.22953048083121458, 0.02614783938484903, 0.04443604525626649, 0.15355386854962835, -0.20525116677678934, -0.10002310228934866, 0.45422918746790175, 0.05768885536714681, -0.1645032517977436, 0.20902471727974525, -0.040708520656003604, -0.13111109882180544, 0.10139507579888347, 0.24840120870997257, 0.006350121717263437, -0.20720149972080032, 0.023558040506492333, 0.08568896967446125, 0.1606581705774157, 0.01786195799337016, 0.13319009652101918, 0.20764457603291714, 0.3051105934929079, 0.12378801531202596, 0.089901874478482, -0.04015580589199274, -0.0728858131034848, -0.19107257868634844, -0.16105482743351568, -0.11891048785912085, 0.02240216564622861, -0.0695163839084245, -0.11020845807853001, 0.3772220062430877, 0.1989924836582563, 0.09925718545468666, 0.028289238745464556, 0.41216997184519527, 0.044005267371429437, 0.10893935911781803, 0.0925599453879426, 0.20299599208291383, 0.011281555341674557, 0.21616243552180786, -0.172353308746603, 0.1067667539243268, -0.0649626801428503] |
1,803.03587 | The Green Bank Northern Celestial Cap Pulsar Survey II: The Discovery
and Timing of Ten Pulsars | We present timing solutions for ten pulsars discovered in 350 MHz searches
with the Green Bank Telescope. Nine of these were discovered in the Green Bank
Northern Celestial Cap survey and one was discovered by students in the Pulsar
Search Collaboratory program in analysis of drift-scan data. Following
discovery and confirmation with the Green Bank Telescope, timing has yielded
phase-connected solutions with high precision measurements of rotational and
astrometric parameters. Eight of the pulsars are slow and isolated, including
PSR J0930$-$2301, a pulsar with nulling fraction lower limit of $\sim$30\% and
nulling timescale of seconds to minutes. This pulsar also shows evidence of
mode changing. The remaining two pulsars have undergone recycling, accreting
material from binary companions, resulting in higher spin frequencies. PSR
J0557$-$2948 is an isolated, 44 \rm{ms} pulsar that has been partially recycled
and is likely a former member of a binary system which was disrupted by a
second supernova. The paucity of such so-called `disrupted binary pulsars'
(DRPs) compared to double neutron star (DNS) binaries can be used to test
current evolutionary scenarios, especially the kicks imparted on the neutron
stars in the second supernova. There is some evidence that DRPs have larger
space velocities, which could explain their small numbers. PSR J1806+2819 is a
15 \rm{ms} pulsar in a 44 day orbit with a low mass white dwarf companion. We
did not detect the companion in archival optical data, indicating that it must
be older than 1200 Myr.
| astro-ph.HE | we present timing solutions for ten pulsars discovered in 350 mhz searches with the green bank telescope nine of these were discovered in the green bank northern celestial cap survey and one was discovered by students in the pulsar search collaboratory program in analysis of driftscan data following discovery and confirmation with the green bank telescope timing has yielded phaseconnected solutions with high precision measurements of rotational and astrometric parameters eight of the pulsars are slow and isolated including psr j09302301 a pulsar with nulling fraction lower limit of sim30 and nulling timescale of seconds to minutes this pulsar also shows evidence of mode changing the remaining two pulsars have undergone recycling accreting material from binary companions resulting in higher spin frequencies psr j05572948 is an isolated 44 rmms pulsar that has been partially recycled and is likely a former member of a binary system which was disrupted by a second supernova the paucity of such socalled disrupted binary pulsars drps compared to double neutron star dns binaries can be used to test current evolutionary scenarios especially the kicks imparted on the neutron stars in the second supernova there is some evidence that drps have larger space velocities which could explain their small numbers psr j18062819 is a 15 rmms pulsar in a 44 day orbit with a low mass white dwarf companion we did not detect the companion in archival optical data indicating that it must be older than 1200 myr | [['we', 'present', 'timing', 'solutions', 'for', 'ten', 'pulsars', 'discovered', 'in', '350', 'mhz', 'searches', 'with', 'the', 'green', 'bank', 'telescope', 'nine', 'of', 'these', 'were', 'discovered', 'in', 'the', 'green', 'bank', 'northern', 'celestial', 'cap', 'survey', 'and', 'one', 'was', 'discovered', 'by', 'students', 'in', 'the', 'pulsar', 'search', 'collaboratory', 'program', 'in', 'analysis', 'of', 'driftscan', 'data', 'following', 'discovery', 'and', 'confirmation', 'with', 'the', 'green', 'bank', 'telescope', 'timing', 'has', 'yielded', 'phaseconnected', 'solutions', 'with', 'high', 'precision', 'measurements', 'of', 'rotational', 'and', 'astrometric', 'parameters', 'eight', 'of', 'the', 'pulsars', 'are', 'slow', 'and', 'isolated', 'including', 'psr', 'j09302301', 'a', 'pulsar', 'with', 'nulling', 'fraction', 'lower', 'limit', 'of', 'sim30', 'and', 'nulling', 'timescale', 'of', 'seconds', 'to', 'minutes', 'this', 'pulsar', 'also', 'shows', 'evidence', 'of', 'mode', 'changing', 'the', 'remaining', 'two', 'pulsars', 'have', 'undergone', 'recycling', 'accreting', 'material', 'from', 'binary', 'companions', 'resulting', 'in', 'higher', 'spin', 'frequencies', 'psr', 'j05572948', 'is', 'an', 'isolated', '44', 'rmms', 'pulsar', 'that', 'has', 'been', 'partially', 'recycled', 'and', 'is', 'likely', 'a', 'former', 'member', 'of', 'a', 'binary', 'system', 'which', 'was', 'disrupted', 'by', 'a', 'second', 'supernova', 'the', 'paucity', 'of', 'such', 'socalled', 'disrupted', 'binary', 'pulsars', 'drps', 'compared', 'to', 'double', 'neutron', 'star', 'dns', 'binaries', 'can', 'be', 'used', 'to', 'test', 'current', 'evolutionary', 'scenarios', 'especially', 'the', 'kicks', 'imparted', 'on', 'the', 'neutron', 'stars', 'in', 'the', 'second', 'supernova', 'there', 'is', 'some', 'evidence', 'that', 'drps', 'have', 'larger', 'space', 'velocities', 'which', 'could', 'explain', 'their', 'small', 'numbers', 'psr', 'j18062819', 'is', 'a', '15', 'rmms', 'pulsar', 'in', 'a', '44', 'day', 'orbit', 'with', 'a', 'low', 'mass', 'white', 'dwarf', 'companion', 'we', 'did', 'not', 'detect', 'the', 'companion', 'in', 'archival', 'optical', 'data', 'indicating', 'that', 'it', 'must', 'be', 'older', 'than', '1200', 'myr']] | [-0.14552952248321077, 0.1464965375531567, -0.06656805972206294, 0.08937844948864554, -0.19013956005911042, -0.09986899919987162, 0.103267988905108, 0.37695272910217736, -0.14642547174730966, -0.36178977186616246, 0.1400190261845325, -0.30601214278473765, -0.04603502188836493, 0.2731555278722789, -0.04876621866460634, -0.03268221732342, 0.1685266610158015, -0.03262318236773802, -0.057581469228600295, -0.2390266462278754, 0.21616846386530283, 0.07346444684334068, 0.09820732888161637, -0.08999313072254686, 0.10586914681502185, -0.08668631834180628, -0.04987073389372606, -0.06439233100527379, -0.07484840920579665, 0.004915808938798265, 0.24945000390423303, 0.1517360757258974, 0.2048388040979163, -0.3623976775028092, -0.1783906747350785, 0.07804166693357306, 0.155254014723868, 0.03557785202663345, -0.07816086607014909, -0.30718470724040414, 0.11390036014181457, -0.3050997031572037, -0.1919382047260065, 0.04834082747481288, 0.08254513472404378, 0.08572556486813095, -0.14977396345428468, 0.0937995856610043, 0.032300479010635964, 0.059485675410024634, -0.14374913868229353, -0.14260426805906046, 0.01157223066844708, 0.04989989313187865, 0.05499436202065466, 0.07446925409301866, 0.10458176531224944, -0.08470931296162774, -0.08876366941691824, 0.36769059790073305, -0.06641412758158577, -0.015188140840908691, 0.20563347830951798, -0.26592665763228945, -0.216430915352035, 0.19041794268502055, 0.14178445008895108, 0.10638618187698298, -0.21127295436992244, -0.02854186074531084, -0.009478465256487725, 0.25463087230951964, 0.11643037301484324, 0.043267579422691334, 0.35258249830158434, 0.1616703153621487, 0.01121819227403926, 0.11656471181010133, -0.3000212767537465, -0.03020341694355011, -0.14699774071628766, -0.06581299296515959, -0.1364369119226954, 0.12572478166656914, -0.08678047214529991, -0.08400148939668634, 0.347216836340476, 0.06737798450282818, 0.11783587935801486, 0.0068986532560873105, 0.28226166289634846, 0.1021214076814682, 0.11889993877025422, 0.12337129929582256, 0.34643513542002313, 0.14581955411222033, 0.12119676140536434, -0.19874092755219647, 0.09756935256724265, -0.0311456427779867] |
1,803.03588 | Towards Erdos-Hajnal for graphs with no 5-hole | The Erdos-Hajnal conjecture says that for every graph $H$ there exists $c>0$
such that $\max(\alpha(G),\omega(G))\ge n^c$ for every $H$-free graph $G$ with
$n$ vertices, and this is still open when $H=C_5$. Until now the best bound
known on $\max(\alpha(G),\omega(G))$ for $C_5$-free graphs was the general
bound of Erdos and Hajnal, that for all $H$, $\max(\alpha(G),\omega(G))\ge
2^{\Omega(\sqrt{\log n })}$ if $G$ is $H$-free. We improve this when $H=C_5$ to
$\max(\alpha(G),\omega(G))\ge 2^{\Omega(\sqrt{\log n \log \log n})}.$
| math.CO | the erdoshajnal conjecture says that for every graph h there exists c0 such that maxalphagomegagge nc for every hfree graph g with n vertices and this is still open when hc_5 until now the best bound known on maxalphagomegag for c_5free graphs was the general bound of erdos and hajnal that for all h maxalphagomegagge 2omegasqrtlog n if g is hfree we improve this when hc_5 to maxalphagomegagge 2omegasqrtlog n log log n | [['the', 'erdoshajnal', 'conjecture', 'says', 'that', 'for', 'every', 'graph', 'h', 'there', 'exists', 'c0', 'such', 'that', 'maxalphagomegagge', 'nc', 'for', 'every', 'hfree', 'graph', 'g', 'with', 'n', 'vertices', 'and', 'this', 'is', 'still', 'open', 'when', 'hc_5', 'until', 'now', 'the', 'best', 'bound', 'known', 'on', 'maxalphagomegag', 'for', 'c_5free', 'graphs', 'was', 'the', 'general', 'bound', 'of', 'erdos', 'and', 'hajnal', 'that', 'for', 'all', 'h', 'maxalphagomegagge', '2omegasqrtlog', 'n', 'if', 'g', 'is', 'hfree', 'we', 'improve', 'this', 'when', 'hc_5', 'to', 'maxalphagomegagge', '2omegasqrtlog', 'n', 'log', 'log', 'n']] | [-0.13796480428427457, 0.17042334450941002, 0.0007498069001095636, 0.043115196390343564, -0.04247052801240768, -0.25825835153726595, 0.09465032355593783, 0.353362598163741, -0.22952059973031283, -0.35956041283373325, 0.07415500849352351, -0.34448765829937267, -0.1394264817171331, 0.1322224692042385, -0.12115851435145097, 0.009003433106201036, 0.12698571397257702, 0.12309097836467638, 0.07868285653946389, -0.38658359154942445, 0.2744709803922368, -0.07311828017866771, 0.12353820555311229, 0.13278436435918722, 0.028863403307540076, 0.04813769532899771, 0.07302301126266164, 0.01947240431659988, -0.20939751143523608, 0.017249155940122104, 0.2807317808004362, 0.20754124601371587, 0.24371668079069683, -0.3117729209987114, -0.13778806864616594, 0.2353662195499055, 0.15196624231923903, 0.008732465800962277, 0.005087899474892766, -0.16748114890818086, 0.1649817808996886, -0.02681425687457834, -0.1066862981300801, 0.045548192172178203, 0.2520315366464534, -0.07017127695892539, -0.30911991886262385, -0.027106886789468782, 0.16489950176328422, -0.022215195479137556, 0.0986649926618806, -0.1871154478801015, -0.053220425166987946, 0.10512155723907719, -0.08050886528965617, 0.17132894283027522, -0.029425594564859887, -0.08140272414976997, -0.10188940076955727, 0.32719747903091567, -0.0915611230236079, -0.08555263942440174, 0.0721602763980627, -0.16159025563725404, -0.2792598754300603, 0.08657273855060339, 0.016051432543567248, 0.19766514764300414, -0.02441723028272723, 0.259850331713512, -0.1986427212400096, 0.16085870346287265, 0.18603408069216779, -0.014717267609168111, 0.01780475705329861, 0.10952268445066043, 0.1837792450029935, 0.09887908574725901, 0.07236696375600461, 0.06999098594034357, -0.29955808318087035, -0.138926813946039, -0.25020327895513866, 0.15780444748899233, -0.18409819741292657, -0.17804475418025895, 0.23063246299113546, 0.07438235686360194, 0.17041626432910562, 0.14970370715350978, 0.18896707726609227, 0.05631809565903885, 0.009768587284322295, 0.3033267703572554, 0.11743724093373333, 0.18772397425823978, -0.08262898351864091, -0.15040878718718886, 0.10368878777538026, 0.14719827294881854] |
1,803.03589 | Probing heavy ion collisions using quark and gluon jet substructure | We study the phenomenon of jet quenching utilizing quark and gluon jet
substructures as independent probes of heavy ion collisions. We exploit jet and
subjet features to highlight differences between quark and gluon jets in vacuum
and in a medium with the jet-quenching model implemented in JEWEL. We begin
with a physics-motivated, multivariate analysis of jet substructure observables
including the jet mass, the radial moments, the $p_T^D$ and the pixel
multiplicity. In comparison, we employ state-of-the-art image-recognition
techniques by training a deep convolutional neutral network on jet images. To
systematically extract jet substructure information, we introduce the
telescoping deconstruction framework exploiting subjet kinematics at multiple
angular scales. We draw connections to the soft-drop subjet distribution and
illuminate medium-induced jet modifications using Lund diagrams. We find that
the quark gluon discrimination performance worsens in heavy ion jets due to
significant soft event activity affecting the soft jet substructure. Our work
suggests a systematically improvable framework for studying modifications to
quark and gluon jet substructures and facilitating direct comparisons between
theoretical calculations, simulations and measurements in heavy ion collisions.
| hep-ph | we study the phenomenon of jet quenching utilizing quark and gluon jet substructures as independent probes of heavy ion collisions we exploit jet and subjet features to highlight differences between quark and gluon jets in vacuum and in a medium with the jetquenching model implemented in jewel we begin with a physicsmotivated multivariate analysis of jet substructure observables including the jet mass the radial moments the p_td and the pixel multiplicity in comparison we employ stateoftheart imagerecognition techniques by training a deep convolutional neutral network on jet images to systematically extract jet substructure information we introduce the telescoping deconstruction framework exploiting subjet kinematics at multiple angular scales we draw connections to the softdrop subjet distribution and illuminate mediuminduced jet modifications using lund diagrams we find that the quark gluon discrimination performance worsens in heavy ion jets due to significant soft event activity affecting the soft jet substructure our work suggests a systematically improvable framework for studying modifications to quark and gluon jet substructures and facilitating direct comparisons between theoretical calculations simulations and measurements in heavy ion collisions | [['we', 'study', 'the', 'phenomenon', 'of', 'jet', 'quenching', 'utilizing', 'quark', 'and', 'gluon', 'jet', 'substructures', 'as', 'independent', 'probes', 'of', 'heavy', 'ion', 'collisions', 'we', 'exploit', 'jet', 'and', 'subjet', 'features', 'to', 'highlight', 'differences', 'between', 'quark', 'and', 'gluon', 'jets', 'in', 'vacuum', 'and', 'in', 'a', 'medium', 'with', 'the', 'jetquenching', 'model', 'implemented', 'in', 'jewel', 'we', 'begin', 'with', 'a', 'physicsmotivated', 'multivariate', 'analysis', 'of', 'jet', 'substructure', 'observables', 'including', 'the', 'jet', 'mass', 'the', 'radial', 'moments', 'the', 'p_td', 'and', 'the', 'pixel', 'multiplicity', 'in', 'comparison', 'we', 'employ', 'stateoftheart', 'imagerecognition', 'techniques', 'by', 'training', 'a', 'deep', 'convolutional', 'neutral', 'network', 'on', 'jet', 'images', 'to', 'systematically', 'extract', 'jet', 'substructure', 'information', 'we', 'introduce', 'the', 'telescoping', 'deconstruction', 'framework', 'exploiting', 'subjet', 'kinematics', 'at', 'multiple', 'angular', 'scales', 'we', 'draw', 'connections', 'to', 'the', 'softdrop', 'subjet', 'distribution', 'and', 'illuminate', 'mediuminduced', 'jet', 'modifications', 'using', 'lund', 'diagrams', 'we', 'find', 'that', 'the', 'quark', 'gluon', 'discrimination', 'performance', 'worsens', 'in', 'heavy', 'ion', 'jets', 'due', 'to', 'significant', 'soft', 'event', 'activity', 'affecting', 'the', 'soft', 'jet', 'substructure', 'our', 'work', 'suggests', 'a', 'systematically', 'improvable', 'framework', 'for', 'studying', 'modifications', 'to', 'quark', 'and', 'gluon', 'jet', 'substructures', 'and', 'facilitating', 'direct', 'comparisons', 'between', 'theoretical', 'calculations', 'simulations', 'and', 'measurements', 'in', 'heavy', 'ion', 'collisions']] | [-0.034808170300971525, 0.1558678557038686, -0.19516796856792382, 0.1892348172532468, -0.09031777972050306, -0.07791622280074799, 0.0006063334949019939, 0.45302052144487365, -0.19997200592470982, -0.30072791198805227, -0.05737854232011878, -0.2829043423956902, 0.04628851492284129, 0.08952288098086071, 0.018632693773945847, 0.09310731014741933, 0.1402458753923512, -0.10576167067060363, -0.0951367936862993, -0.13297371626871055, 0.3558554542474554, 0.10525320709806651, 0.20703746568895665, 0.1512683251146132, 0.10990381974655883, 0.04409280017782582, -0.14037974663131403, 0.007755174348262365, -0.11211646310374236, 0.07522895815420506, 0.2167199766421217, 0.08375290362324696, 0.1545463529141491, -0.3942499008597964, -0.171322546558623, 0.03271305778308503, 0.1752811313447632, 0.08949122212003091, -0.06274985305578211, -0.23540492901725873, 0.07849777038741888, -0.29421379595092567, -0.12181090301469673, -0.09581900916804197, -0.06124056692499573, -0.011000102638440618, -0.30256777856430556, 0.09117484760258905, -0.00679752275631842, 0.04473938881632534, 0.059594376796677624, -0.12856980591307338, -0.05346074392677069, 0.029600272208352253, 0.12462273631231743, 0.10471399578115886, 0.2592783347127359, -0.2344524394329453, -0.1847505015715704, 0.34753955097206063, -0.0110907142200523, -0.14619758033276192, 0.20758069293983913, -0.1985743675133645, -0.19740568629155555, 0.1152911250185028, 0.2771241382236486, 0.0875126072633117, -0.15488862521725438, -0.013371679145582335, -0.020885421115757717, 0.15880690283195223, 0.09040429730180093, 0.08177232006985673, 0.2199382228042804, 0.19016275590148854, -0.06603481507489174, 0.1305661916440599, -0.15605538424846352, -0.06689894121498038, -0.33342327721355125, -0.07594033765296142, -0.06296766779285534, -0.011440859596497552, -0.14943397631133726, -0.08261352134631726, 0.40271929645184745, 0.11575452062317122, 0.2659598660165652, -0.02401775372672384, 0.3501919847465841, 0.011466979787758642, 0.08162006447723104, 0.1551114035846592, 0.27790844931180386, 0.209548610158654, 0.1693450186104319, -0.2581060164138454, 0.04555053770473742, 0.07974491748856223] |
1,803.0359 | Optimal measurement strategies for the trine states with arbitrary prior
probabilities | We investigate the optimal measurement strategy for state discrimination of
the trine ensemble of qubit states prepared with arbitrary prior probabilities.
Our approach generates the minimum achievable probability of error and also the
maximum confidence strategy. Although various cases with symmetry have been
considered and solution techniques put forward in the literature, to our
knowledge this is only the second such closed form, analytical, arbitrary
prior, example available for the minimum-error figure of merit, after the
simplest and well-known two-state example.
| quant-ph | we investigate the optimal measurement strategy for state discrimination of the trine ensemble of qubit states prepared with arbitrary prior probabilities our approach generates the minimum achievable probability of error and also the maximum confidence strategy although various cases with symmetry have been considered and solution techniques put forward in the literature to our knowledge this is only the second such closed form analytical arbitrary prior example available for the minimumerror figure of merit after the simplest and wellknown twostate example | [['we', 'investigate', 'the', 'optimal', 'measurement', 'strategy', 'for', 'state', 'discrimination', 'of', 'the', 'trine', 'ensemble', 'of', 'qubit', 'states', 'prepared', 'with', 'arbitrary', 'prior', 'probabilities', 'our', 'approach', 'generates', 'the', 'minimum', 'achievable', 'probability', 'of', 'error', 'and', 'also', 'the', 'maximum', 'confidence', 'strategy', 'although', 'various', 'cases', 'with', 'symmetry', 'have', 'been', 'considered', 'and', 'solution', 'techniques', 'put', 'forward', 'in', 'the', 'literature', 'to', 'our', 'knowledge', 'this', 'is', 'only', 'the', 'second', 'such', 'closed', 'form', 'analytical', 'arbitrary', 'prior', 'example', 'available', 'for', 'the', 'minimumerror', 'figure', 'of', 'merit', 'after', 'the', 'simplest', 'and', 'wellknown', 'twostate', 'example']] | [-0.08988435581372475, 0.06641427474671308, -0.06530108237869026, 0.05919508610702591, -0.045298646526112235, -0.20742247807850808, 0.12499301866800697, 0.38009478238894157, -0.20206126472395328, -0.3344177198941233, 0.09607833052301251, -0.23781172784022342, -0.10677630714727221, 0.18155991996603985, -0.03819755237423068, 0.15115632234072243, 0.07613389319050368, 0.10418578255691646, -0.07082912515572927, -0.2681549649087735, 0.2975951810999785, 0.08003180068170215, 0.34849762019735797, 0.012373878603318223, 0.136909850332656, 0.0260253691309948, 0.010110074315036152, -0.035746721493176016, -0.1740457644732094, 0.11148915187682795, 0.2775828753322087, 0.1684171425000431, 0.24377463991397325, -0.3898853770583684, -0.21568397254349642, 0.11444811574700806, 0.10736638347382577, 0.18883861787617207, -0.0530202592274657, -0.27897960179410647, 0.033892594180127356, -0.2172265317906154, -0.10441022885986316, -0.06299520178732497, -0.0018573051784187555, -0.018395286841019067, -0.3009199487019537, 0.07498314595216436, 0.0865734393886624, 0.009070216701078562, -0.05019388056969569, -0.18113682655341648, 0.03368242242859309, 0.13757866723635406, 0.01212291942368963, -0.009042863009704484, 0.10052191547296344, -0.09310517282754091, -0.13932481771449984, 0.29744843420009187, -0.03459276516496399, -0.2378171071306699, 0.09515582548776343, -0.11051264870911837, -0.11206207998142934, 0.09495750062144649, 0.11761616479697419, 0.12847500113931334, -0.15615661307755443, 0.04738926211656588, -0.026290477333981314, 0.15621520530570437, 0.08470045345731908, 0.053201707614654745, 0.14507422926634503, 0.14389877173371246, 0.07986912620541306, 0.17824838140312535, -0.09277547005977896, -0.14438998291015992, -0.31389719685165923, -0.15589195457689556, -0.19447511063175804, 0.04469034455164715, -0.08428325646008612, -0.11147509158853396, 0.3902198424028164, 0.14567072099695602, 0.15068947616389688, 0.04245310389137839, 0.31367766027005367, 0.12661882286695877, -0.026546972182889778, 0.05680093964573318, 0.2558012300208326, 0.09175572128977949, -0.0028420003292001323, -0.2105308479193259, 0.1221896427637541, 0.019181397479073502] |
1,803.03591 | Thermally tunable hybrid photonic architecture for nonlinear optical
circuits | We develop a thermally tunable hybrid photonic platform comprising gallium
arsenide (GaAs) photonic crystal cavities, silicon nitride (SiN$_x$) grating
couplers and waveguides, and chromium (Cr) microheaters on an integrated
photonic chip. The GaAs photonic crystal cavities are evanescently connected to
a common bus waveguide, separating the computation and communication layers.
The microheaters are designed to continuously and reversibly tune distant
photonic crystal cavities to a common resonance. This architecture can be
implemented in a coherent optical network for dedicated optical computing and
machine learning.
| physics.app-ph cond-mat.mtrl-sci physics.optics | we develop a thermally tunable hybrid photonic platform comprising gallium arsenide gaas photonic crystal cavities silicon nitride sin_x grating couplers and waveguides and chromium cr microheaters on an integrated photonic chip the gaas photonic crystal cavities are evanescently connected to a common bus waveguide separating the computation and communication layers the microheaters are designed to continuously and reversibly tune distant photonic crystal cavities to a common resonance this architecture can be implemented in a coherent optical network for dedicated optical computing and machine learning | [['we', 'develop', 'a', 'thermally', 'tunable', 'hybrid', 'photonic', 'platform', 'comprising', 'gallium', 'arsenide', 'gaas', 'photonic', 'crystal', 'cavities', 'silicon', 'nitride', 'sin_x', 'grating', 'couplers', 'and', 'waveguides', 'and', 'chromium', 'cr', 'microheaters', 'on', 'an', 'integrated', 'photonic', 'chip', 'the', 'gaas', 'photonic', 'crystal', 'cavities', 'are', 'evanescently', 'connected', 'to', 'a', 'common', 'bus', 'waveguide', 'separating', 'the', 'computation', 'and', 'communication', 'layers', 'the', 'microheaters', 'are', 'designed', 'to', 'continuously', 'and', 'reversibly', 'tune', 'distant', 'photonic', 'crystal', 'cavities', 'to', 'a', 'common', 'resonance', 'this', 'architecture', 'can', 'be', 'implemented', 'in', 'a', 'coherent', 'optical', 'network', 'for', 'dedicated', 'optical', 'computing', 'and', 'machine', 'learning']] | [-0.17516494609714886, 0.18646986484738937, 0.04827562623679461, -0.13983883753306664, -0.054175814386412856, -0.3564991478453435, 0.047003246882619955, 0.6341621669984999, -0.2650630519769731, -0.29466954188510064, -0.008505662438914268, -0.33254654328560546, -0.10218303235402952, 0.269307174331819, 0.04660593384601054, 0.15669286381896763, 0.017088165872597268, -0.17936121402973576, -0.023928559079303385, -0.12409972097902071, 0.17692448911146216, 0.039123303503618534, 0.4201559931305902, 0.015493026845866726, 0.10588320087464083, -0.03301844013012236, 0.15866574352063859, -0.13784276830015837, -0.08800682481766368, 0.19928686240954058, 0.34142667010781313, -0.13629864368565558, 0.2539185253193691, -0.5334685059885184, -0.1923220669795271, 0.02785198102217345, 0.1926156505613194, 0.12636910113395147, -0.10011091962916821, -0.3196698561798604, 0.003136381274089217, -0.13395724416754784, -0.09201316077572604, -0.03737388379938368, -0.11612233997965675, -0.02910531899847445, -0.16868027212053893, -0.11899467704573735, -0.023580081805232026, 0.019768942865387846, 0.01205883034050376, 0.024287456505200162, -0.06068116279840026, -0.04556666947679505, -0.26375552517406287, -0.020098811543513357, 0.3148936031752133, -0.0017171813746071642, -0.18621780092473186, 0.3455342003088888, -0.008631773997053858, -0.08759212358632967, 0.12041319740403976, -0.0584491636559722, 0.03337244006494681, 0.08909074977661173, 0.28098852624576204, -0.007817388756111973, -0.17130020870605395, -0.01277677612891975, 0.017396269299622093, 0.28360594384139404, 0.1369431506997595, 0.1669658435774701, 0.25793818584532435, 0.29820189855638, -0.020235059381645572, 0.20814694314945623, -0.11003886084931548, 0.0452292463132402, -0.17997945021350115, -0.23999745174798937, -0.23924370399340877, 0.0067638770865631245, -0.11671106404139123, -0.2517968240482289, 0.39691876912755625, 0.02172232887408297, 0.05195768263989261, -0.11002597700072718, 0.3103660299342924, 0.04532061877571756, 0.21510890128445767, 0.052941882106963364, 0.33017375227063894, 0.22115652363668015, 0.1325968404444644, -0.24077063269491883, -0.06082159274124673, -0.09295840415593591] |
1,803.03592 | Discovery of a radio nebula around PSR J0855-4644 | We report the discovery of a diffuse radio emission around PSR J0855--4644
using an upgraded GMRT (uGMRT) observation at 1.35 GHz. The radio emission is
spatially coincident with the diffuse X-ray pulsar wind nebula (PWN) seen with
XMM but is much larger in extent compared to the compact axisymmetric PWN seen
with Chandra. The morphology of the emission, with a bright partial ring-like
structure and two faint tail-like features strongly resembles a bow shock
nebula, and indicates a velocity of 100 km/s through the ambient medium. We
conclude that the emission is most likely to be associated with the radio PWN
of PSR J0855-4644. From the integrated flux density, we estimate the energetics
of the PWN.
| astro-ph.HE | we report the discovery of a diffuse radio emission around psr j08554644 using an upgraded gmrt ugmrt observation at 135 ghz the radio emission is spatially coincident with the diffuse xray pulsar wind nebula pwn seen with xmm but is much larger in extent compared to the compact axisymmetric pwn seen with chandra the morphology of the emission with a bright partial ringlike structure and two faint taillike features strongly resembles a bow shock nebula and indicates a velocity of 100 kms through the ambient medium we conclude that the emission is most likely to be associated with the radio pwn of psr j08554644 from the integrated flux density we estimate the energetics of the pwn | [['we', 'report', 'the', 'discovery', 'of', 'a', 'diffuse', 'radio', 'emission', 'around', 'psr', 'j08554644', 'using', 'an', 'upgraded', 'gmrt', 'ugmrt', 'observation', 'at', '135', 'ghz', 'the', 'radio', 'emission', 'is', 'spatially', 'coincident', 'with', 'the', 'diffuse', 'xray', 'pulsar', 'wind', 'nebula', 'pwn', 'seen', 'with', 'xmm', 'but', 'is', 'much', 'larger', 'in', 'extent', 'compared', 'to', 'the', 'compact', 'axisymmetric', 'pwn', 'seen', 'with', 'chandra', 'the', 'morphology', 'of', 'the', 'emission', 'with', 'a', 'bright', 'partial', 'ringlike', 'structure', 'and', 'two', 'faint', 'taillike', 'features', 'strongly', 'resembles', 'a', 'bow', 'shock', 'nebula', 'and', 'indicates', 'a', 'velocity', 'of', '100', 'kms', 'through', 'the', 'ambient', 'medium', 'we', 'conclude', 'that', 'the', 'emission', 'is', 'most', 'likely', 'to', 'be', 'associated', 'with', 'the', 'radio', 'pwn', 'of', 'psr', 'j08554644', 'from', 'the', 'integrated', 'flux', 'density', 'we', 'estimate', 'the', 'energetics', 'of', 'the', 'pwn']] | [-0.08225217425657821, 0.07789090264235836, -0.05613656530301247, 0.0743503384121517, -0.20211790070130392, -0.0724316857040635, -0.009078110351452026, 0.5145959137971031, -0.18242071109514277, -0.30103964183543774, 0.057006471408009206, -0.3083761319325402, 1.1290740201667208e-05, 0.20776473799046, 0.046132925014685966, -0.10527842710746035, 0.09494679568110612, -0.11063091087973966, -0.02820149894125342, -0.1142378656547627, 0.252861411687075, 0.14319392317777563, 0.14154982313931244, 0.013033407876781863, 0.10672661644438731, -0.17087726845959972, -0.03626244192830576, -0.05816292737466123, -0.03721736693998913, 0.0744143160469509, 0.16855454253803553, 0.11527999923945854, 0.1265561151521979, -0.3827333533975842, -0.24427690883648806, 0.013700291088878595, 0.21647662772989734, -0.06548097294931911, 0.0005251661721809671, -0.3825655899749234, 0.07189411549539916, -0.26453988722541594, -0.2848326516225292, 0.19984736885265286, 0.02605698089083207, 0.029200331420348637, -0.14457813708025335, 0.14829072366259863, -0.052163072897859944, 0.06401889830835741, -0.16881770716883757, -0.05100537106346596, -0.011868170225703767, -0.04985476980901098, 0.02740141279104262, 0.10853805229095903, 0.1790487314132845, -0.14368628250467108, -0.08388540941563531, 0.4048664177936534, -0.03956565192242249, 0.06364879535575366, 0.22985506736561015, -0.2873210469341098, -0.22700039201400019, 0.2865577227163032, 0.08348222985333795, 0.05103334189585314, -0.13344485869938266, -0.042973622409747274, -0.0819082593149907, 0.26486312097203435, 0.028485485200031566, 0.07661422308743128, 0.32990378600641573, 0.13953153141683916, 0.05862209328915924, 0.2311442867995256, -0.3663224828522853, 0.047826581815225554, -0.21012807715732348, -0.03410600344419624, -0.1312029311786695, 0.14817956317986908, -0.1316360666623323, -0.1308496603180237, 0.3781571104070814, 0.08551888907296133, 0.1684254131857948, -0.010481852925671586, 0.32262315104940326, 0.13095779207049354, 0.045563928546094944, 0.24843098568441024, 0.31362298782914877, 0.20408804590235755, 0.15017177754258415, -0.21349732925240272, 0.08685176978931473, -0.0763432405997421] |
1,803.03593 | A feedback control algorithm to steer networks to a Cournot-Nash
equilibrium | We propose a distributed feedback control that steers a dynamical network to
a prescribed equilibrium corresponding to the so-called Cournot-Nash
equilibrium. The network dynamics considered here are a class of passive
nonlinear second-order systems, where production and demands act as external
inputs to the systems. While productions are assumed to be controllable at each
node, the demand is determined as a function of local prices according to the
utility of the consumers. Using reduced information on the demand, the proposed
controller guarantees the convergence of the closed loop system to the optimal
equilibrium point dictated by the Cournot-Nash competition.
| math.OC | we propose a distributed feedback control that steers a dynamical network to a prescribed equilibrium corresponding to the socalled cournotnash equilibrium the network dynamics considered here are a class of passive nonlinear secondorder systems where production and demands act as external inputs to the systems while productions are assumed to be controllable at each node the demand is determined as a function of local prices according to the utility of the consumers using reduced information on the demand the proposed controller guarantees the convergence of the closed loop system to the optimal equilibrium point dictated by the cournotnash competition | [['we', 'propose', 'a', 'distributed', 'feedback', 'control', 'that', 'steers', 'a', 'dynamical', 'network', 'to', 'a', 'prescribed', 'equilibrium', 'corresponding', 'to', 'the', 'socalled', 'cournotnash', 'equilibrium', 'the', 'network', 'dynamics', 'considered', 'here', 'are', 'a', 'class', 'of', 'passive', 'nonlinear', 'secondorder', 'systems', 'where', 'production', 'and', 'demands', 'act', 'as', 'external', 'inputs', 'to', 'the', 'systems', 'while', 'productions', 'are', 'assumed', 'to', 'be', 'controllable', 'at', 'each', 'node', 'the', 'demand', 'is', 'determined', 'as', 'a', 'function', 'of', 'local', 'prices', 'according', 'to', 'the', 'utility', 'of', 'the', 'consumers', 'using', 'reduced', 'information', 'on', 'the', 'demand', 'the', 'proposed', 'controller', 'guarantees', 'the', 'convergence', 'of', 'the', 'closed', 'loop', 'system', 'to', 'the', 'optimal', 'equilibrium', 'point', 'dictated', 'by', 'the', 'cournotnash', 'competition']] | [-0.16460956366629237, 0.08683408037030298, -0.07687320507065666, 0.04809187247177981, -0.05771134535057677, -0.18228924590647408, 0.10484151493268784, 0.3360652569869552, -0.3298278437607517, -0.26125489672025043, 0.12009254293845534, -0.2713989469486129, -0.11499192942089091, 0.1285769489753728, -0.06021932789566691, 0.11013935707660034, -0.0074273354886570065, 0.07136105442645424, -0.005458152177978797, -0.22636453647429894, 0.32529380186249246, 0.06518260789376618, 0.2892325390832889, -0.004189723218330229, 0.15053900478953364, -0.01318518890096157, 0.03446354361714306, 0.06009244476261283, -0.09241415608612258, 0.11519852743338267, 0.23936319947854212, 0.11691963724378082, 0.3294368406400235, -0.4349165301243163, -0.18633108315142718, 0.12557578721375326, 0.0994966754294706, 0.08603360424185115, -0.02636295888041419, -0.2578470925189028, 0.09937064224063899, -0.179666082986226, -0.11662458694737518, -0.050828661207542425, -0.032259527612665685, 0.09821087001456372, -0.35132346732184444, 0.0033971789073095554, 0.021252146588974737, 0.012003510002742964, -0.07949762979070797, -0.03807075950434676, -0.11751940014837968, 0.1901380142356937, -0.002276971327103298, 0.0075383941640588216, 0.22233387749322286, -0.12948360794336733, -0.13979060755045425, 0.3960806137383586, -0.04372889691648647, -0.22928352089395343, 0.16272027832408897, -0.08384623400622396, -0.089756539505389, 0.12327180735089562, 0.22459245061577118, 0.0914649100400357, -0.20370856407239582, 0.02695610272084278, -0.010136091098603275, 0.15524372510109896, 0.003866212023892487, 0.036067044875123584, 0.19353449852629143, 0.17549483840720673, 0.15852107078476688, 0.1568964141917255, 0.0053179479190007305, -0.19256008458511922, -0.29360291676012557, -0.08784129174256866, -0.17006936338212755, 0.04710784076590731, -0.06291202069574736, -0.15017263548015947, 0.37629513854085644, 0.11870573369275797, 0.1790393138247909, 0.10110531033797547, 0.3130713623732027, 0.18016901052312342, 0.02369591738614771, 0.12842700059873738, 0.23172462017585835, 0.07673202373670658, 0.13080269017614274, -0.2637135076237786, 0.123223884548578, 0.044405703837371836] |
1,803.03594 | Constraining Extended Scalar Sectors at the LHC and beyond | We give a brief overview of beyond the Standard Model (BSM) theories with an
extended scalar sector and their phenomenological status in the light of recent
experimental results. We discuss the relevant theoretical and experimental
constraints, and show their impact on the allowed parameter space of two
specific models: the real scalar singlet extension of the Standard Model (SM)
and the Inert Doublet Model. We emphasize the importance of the LHC
measurements, both the direct searches for additional scalar bosons, as well as
the precise measurements of properties of the Higgs boson of mass 125 GeV. We
show the complementarity of these measurements to electroweak and dark matter
observables.
| hep-ph | we give a brief overview of beyond the standard model bsm theories with an extended scalar sector and their phenomenological status in the light of recent experimental results we discuss the relevant theoretical and experimental constraints and show their impact on the allowed parameter space of two specific models the real scalar singlet extension of the standard model sm and the inert doublet model we emphasize the importance of the lhc measurements both the direct searches for additional scalar bosons as well as the precise measurements of properties of the higgs boson of mass 125 gev we show the complementarity of these measurements to electroweak and dark matter observables | [['we', 'give', 'a', 'brief', 'overview', 'of', 'beyond', 'the', 'standard', 'model', 'bsm', 'theories', 'with', 'an', 'extended', 'scalar', 'sector', 'and', 'their', 'phenomenological', 'status', 'in', 'the', 'light', 'of', 'recent', 'experimental', 'results', 'we', 'discuss', 'the', 'relevant', 'theoretical', 'and', 'experimental', 'constraints', 'and', 'show', 'their', 'impact', 'on', 'the', 'allowed', 'parameter', 'space', 'of', 'two', 'specific', 'models', 'the', 'real', 'scalar', 'singlet', 'extension', 'of', 'the', 'standard', 'model', 'sm', 'and', 'the', 'inert', 'doublet', 'model', 'we', 'emphasize', 'the', 'importance', 'of', 'the', 'lhc', 'measurements', 'both', 'the', 'direct', 'searches', 'for', 'additional', 'scalar', 'bosons', 'as', 'well', 'as', 'the', 'precise', 'measurements', 'of', 'properties', 'of', 'the', 'higgs', 'boson', 'of', 'mass', '125', 'gev', 'we', 'show', 'the', 'complementarity', 'of', 'these', 'measurements', 'to', 'electroweak', 'and', 'dark', 'matter', 'observables']] | [-0.07956769152057416, 0.1849432326737127, -0.047452264678997734, 0.14040476940743146, -0.10609413938887349, -0.16248329739522085, 0.026207980067563166, 0.30800415874552833, -0.206535986270072, -0.3369771741809101, 0.05963992503783538, -0.28559729309940557, -0.06279914975678975, 0.15568472346111517, 0.059906557697905316, 0.1000497576635365, 0.051675627349850234, 0.045135677185490594, -0.08211317355958146, -0.25536702949673346, 0.2956668106890326, 0.045387276943875565, 0.18601171265210992, 0.12776498283353557, 0.06586890792850097, 0.056983455455938886, -0.07110805033680496, -0.07184216797532335, -0.18512458852791322, 0.1181147264000541, 0.12990860071011479, 0.12892947223575768, 0.13858679906089166, -0.3936538471490008, -0.1951347693860736, 0.15665639232451078, 0.10056441227495329, 0.10577422232418364, -0.0975518060149625, -0.34530401275997313, 0.04020650271292126, -0.20887677865786428, -0.11309364137299564, -0.08210879190688218, -0.08257755245415306, -0.05303785688491589, -0.29447889781702274, 0.07987552251102864, -0.028182469520914376, 0.04497466260276803, -0.07030155052593269, -0.19094227815747533, -0.04830238028053502, 0.004939061867226975, 0.15398158793553385, -0.03303908926238297, 0.1684958338395718, -0.23237179673422093, -0.17519204539285307, 0.40899893583371005, -0.1417618072378116, -0.14776329602832572, 0.19175921572872157, -0.1688063084617804, -0.1570981700012595, 0.02237893067249054, 0.17703080184142525, 0.07640950323227759, -0.11666858039471671, 0.18012223781221076, -0.0661301081530203, 0.1454549554667068, -0.06260877662261419, 0.10566704290056038, 0.2799621092480257, 0.19805849646004514, -0.004974972281536651, 0.06891505755783153, -0.0685472976685493, -0.11583152842289264, -0.4615994176545411, -0.17163905971192267, -0.05200722482944027, -0.018242026249869564, -0.09861649318778173, -0.08005451457147751, 0.4510085244594706, 0.18899803973294885, 0.2619932714268702, 0.006885288492562847, 0.32321973042904373, 0.045965746411447066, 0.03879407545500392, -0.04971429904700693, 0.35705763600561596, 0.16426021455351367, 0.10741666380162222, -0.20278832808547065, -0.03642325805085754, 0.0071077236751897616] |
1,803.03595 | Duals of Hardy-amalgam spaces $\mathcal{H}_{\mathrm{loc}}^{(q,p)}$ and
Pseudo-differential operators | In this paper, we carry on with the study of the Hardy-Amalgam spaces
$\mathcal{H}_{\mathrm{loc}}^{(q,p)}$ spaces introduced in \cite{AbFt}. We
investigate their dual spaces and establish some results of boundedness of
pseudo-differential operators in these spaces.
| math.FA | in this paper we carry on with the study of the hardyamalgam spaces mathcalh_mathrmlocqp spaces introduced in citeabft we investigate their dual spaces and establish some results of boundedness of pseudodifferential operators in these spaces | [['in', 'this', 'paper', 'we', 'carry', 'on', 'with', 'the', 'study', 'of', 'the', 'hardyamalgam', 'spaces', 'mathcalh_mathrmlocqp', 'spaces', 'introduced', 'in', 'citeabft', 'we', 'investigate', 'their', 'dual', 'spaces', 'and', 'establish', 'some', 'results', 'of', 'boundedness', 'of', 'pseudodifferential', 'operators', 'in', 'these', 'spaces']] | [-0.1291191882143418, 0.07928168289645603, -0.05162211180184827, 0.15416618604142446, -0.041892004629709954, 0.02942948246544058, 0.0015946243162916014, 0.39625582189270947, -0.26553201359329803, -0.18446708019032623, 0.19289849213479707, -0.24902650617966146, -0.18351925542634545, 0.18777775353836743, -0.18972717090086502, 0.02333544110032645, 0.007548024426355507, 0.031320003058874245, -0.20448378860160257, -0.2931518037662362, 0.5483662509782747, -0.04562572595860922, 0.18127900971607727, 0.0520770563885118, 0.06391520338189421, 0.045999780635942115, -0.13980827807928575, -0.036894704469225624, -0.2561686243297476, 0.22167291514801257, 0.2525452413793766, 0.05446094199732849, 0.31685628267851745, -0.41519166348558484, -0.16798786734315482, 0.20713919971251127, 0.10956796047023752, -0.036516655405813996, -0.025713693368192198, -0.33898775764938555, 0.10070429522205483, -0.11351669277770049, -0.10587164229064276, -0.1847762463501457, -0.05104570785029368, 0.09309257780709727, -0.24237759999761527, -0.03683804956293016, 0.12173150124197657, 0.09418488525305733, -0.20698050031382026, -0.051342801049803245, 0.017538525883785704, 0.09398844850842249, 0.04175420311477148, -0.013497264244396127, 0.013728454158726063, -0.028136563339185985, -0.17003545125551295, 0.3217877970274651, -0.04677197201685472, -0.2770616050922509, 0.12947912333589612, -0.22226370120364608, -0.18994848972017114, -0.05211892667593378, 0.20867007682946595, 0.20727237167231966, -0.05521100742573088, 0.14519313804516004, -0.08826897143753189, 0.027023968935915917, 0.06914286741591764, 0.18607142635367133, 0.05832983147014271, 0.14275188899288574, 0.11087798228430928, 0.20807537075950566, 0.011320928372724942, -0.06871573695433185, -0.3416620053238038, -0.22569785823085994, -0.09311867968856612, 0.033400838460886116, -0.06663568045504772, -0.19158404941360155, 0.39134413410316815, 0.1827514275174701, 0.20484080549442407, 0.1160558242012154, 0.144039525149503, 0.07241763939347232, 0.01065566390047245, 0.04097048493779518, 0.22764534293409353, 0.22375762152175108, 0.1583665154281665, -0.15344962570816278, -0.05590307962318713, 0.21215414038548866] |
1,803.03596 | Parity anomaly cancellation in a three-dimensional QED with single
massless Dirac fermion | We study a three-dimensional non-compact QED with a single two-component
massless fermion and two infinitely massive regulator fermions of half the
charge using lattice overlap formalism. The parity anomaly is expected to
cancel exactly between the massless and regulator fermions in the continuum,
but this cancellation is inexact on lattice akin to lattice chiral gauge
theories. We show non-perturbatively that parity-breaking terms vanish in the
continuum limit at any finite volume. We present numerical evidences that the
resulting parity-invariant theory spontaneously breaks parity in the infinite
volume limit.
| hep-lat cond-mat.str-el hep-th | we study a threedimensional noncompact qed with a single twocomponent massless fermion and two infinitely massive regulator fermions of half the charge using lattice overlap formalism the parity anomaly is expected to cancel exactly between the massless and regulator fermions in the continuum but this cancellation is inexact on lattice akin to lattice chiral gauge theories we show nonperturbatively that paritybreaking terms vanish in the continuum limit at any finite volume we present numerical evidences that the resulting parityinvariant theory spontaneously breaks parity in the infinite volume limit | [['we', 'study', 'a', 'threedimensional', 'noncompact', 'qed', 'with', 'a', 'single', 'twocomponent', 'massless', 'fermion', 'and', 'two', 'infinitely', 'massive', 'regulator', 'fermions', 'of', 'half', 'the', 'charge', 'using', 'lattice', 'overlap', 'formalism', 'the', 'parity', 'anomaly', 'is', 'expected', 'to', 'cancel', 'exactly', 'between', 'the', 'massless', 'and', 'regulator', 'fermions', 'in', 'the', 'continuum', 'but', 'this', 'cancellation', 'is', 'inexact', 'on', 'lattice', 'akin', 'to', 'lattice', 'chiral', 'gauge', 'theories', 'we', 'show', 'nonperturbatively', 'that', 'paritybreaking', 'terms', 'vanish', 'in', 'the', 'continuum', 'limit', 'at', 'any', 'finite', 'volume', 'we', 'present', 'numerical', 'evidences', 'that', 'the', 'resulting', 'parityinvariant', 'theory', 'spontaneously', 'breaks', 'parity', 'in', 'the', 'infinite', 'volume', 'limit']] | [-0.1997561242394361, 0.26763259880879725, -0.07443090757839275, 0.09809656887426338, -0.037324933663264594, -0.14369485397103496, 0.06257757995494599, 0.3412640207521194, -0.14541330806043168, -0.22053364546577955, 0.04155563048367516, -0.3057252556847578, -0.153087639601753, 0.025240594743412326, 0.025761703039858152, 0.029227938926355404, -0.012832589786161076, 0.031459848269481554, -0.11859554933405227, -0.2447051200116138, 0.30705672277624463, -0.03832897719059309, 0.2799919498502277, 0.11495913994837213, 0.09864792569582774, 0.03177479402140968, 0.03030507348012179, 0.003827487785284492, -0.07484509456265766, 0.032454820815473795, 0.18345075033721514, -0.08914438868470659, 0.14464054132324897, -0.4399542583321983, -0.20169812076181354, 0.10995283148209141, 0.17723542113195767, 0.1827982485146177, -0.023449181253619663, -0.24205883244179527, 0.04910290699494495, -0.18368801675652238, -0.2238472151075257, -0.08699387444225563, -0.07127391753337262, -0.11887165162426588, -0.25301345567938616, 0.10744944327267479, 0.000884626134806736, 0.07774040526287122, -0.037758664902701806, -0.07839918018593876, -0.05600718297170137, 0.07032936079618098, 0.1099754162079824, 0.035154458820629356, 0.07648998966165395, -0.138292204141511, -0.1498674295461652, 0.43493649062954565, -0.12606941247676415, -0.2479295134861869, 0.16828403354421342, -0.17608779716432432, -0.18135463089724493, 0.1617040523084473, 0.09069097059016878, 0.09760085872205143, -0.11239047297567595, 0.19897277270501945, -0.11913648130774329, 0.16252522795746865, 0.07954726260769265, 0.04399000043155287, 0.272091227827001, 0.06038631932196123, 0.0461802428630604, 0.15759984362970994, -0.0018074114579411055, -0.17846654228527437, -0.41013644356280565, -0.1019664013607243, -0.17915693093726243, 0.10908338720434006, -0.09407197978229802, -0.20775489517572251, 0.3213097080800005, 0.13618304536265152, 0.13202761046969416, 0.06590081555821764, 0.2697584666549863, 0.17302685913587498, 0.1279482732220045, 0.049180153114403685, 0.2005256984874987, 0.1369433958382367, 0.039129651395755485, -0.3385246812090786, -0.18537692778045312, 0.1895999384154989] |
1,803.03597 | Resolution Limits for Detecting Community Changes in Multilayer Networks | Multilayer networks capture pairwise relationships between the components of
complex systems across multiple modes or scales of interactions. An important
meso-scale feature of these networks is measured though their community
structure, which defines groups of strongly connected nodes that exist within
and across network layers. Because interlayer edges can describe relationships
between different modalities, scales, or time points, it is essential to
understand how communities change and evolve across layers. A popular method
for detecting communities in multilayer networks consists of maximizing a
quality function known as modularity. However, in the multilayer setting the
modularity function depends on an interlayer coupling parameter, $\omega$, and
how this parameter affects community detection is not well understood. Here, we
expose an upper bound for $\omega$ beyond which community changes across layers
can not be detected. This upper bound has non-trivial, purely multilayer
effects and acts as a resolution limit for detecting evolving communities.
Further, we establish an explicit and previously undiscovered relationship
between the single layer resolution parameter, $\gamma$, and interlayer
coupling parameter, $\omega,$ that provides new understanding of the modularity
parameter space. Our findings not only represent new theoretical considerations
but also have important practical implications for choosing interlayer coupling
values when using multilayer networks to model real-world systems whose
communities change across time or modality.
| physics.soc-ph cs.SI physics.data-an | multilayer networks capture pairwise relationships between the components of complex systems across multiple modes or scales of interactions an important mesoscale feature of these networks is measured though their community structure which defines groups of strongly connected nodes that exist within and across network layers because interlayer edges can describe relationships between different modalities scales or time points it is essential to understand how communities change and evolve across layers a popular method for detecting communities in multilayer networks consists of maximizing a quality function known as modularity however in the multilayer setting the modularity function depends on an interlayer coupling parameter omega and how this parameter affects community detection is not well understood here we expose an upper bound for omega beyond which community changes across layers can not be detected this upper bound has nontrivial purely multilayer effects and acts as a resolution limit for detecting evolving communities further we establish an explicit and previously undiscovered relationship between the single layer resolution parameter gamma and interlayer coupling parameter omega that provides new understanding of the modularity parameter space our findings not only represent new theoretical considerations but also have important practical implications for choosing interlayer coupling values when using multilayer networks to model realworld systems whose communities change across time or modality | [['multilayer', 'networks', 'capture', 'pairwise', 'relationships', 'between', 'the', 'components', 'of', 'complex', 'systems', 'across', 'multiple', 'modes', 'or', 'scales', 'of', 'interactions', 'an', 'important', 'mesoscale', 'feature', 'of', 'these', 'networks', 'is', 'measured', 'though', 'their', 'community', 'structure', 'which', 'defines', 'groups', 'of', 'strongly', 'connected', 'nodes', 'that', 'exist', 'within', 'and', 'across', 'network', 'layers', 'because', 'interlayer', 'edges', 'can', 'describe', 'relationships', 'between', 'different', 'modalities', 'scales', 'or', 'time', 'points', 'it', 'is', 'essential', 'to', 'understand', 'how', 'communities', 'change', 'and', 'evolve', 'across', 'layers', 'a', 'popular', 'method', 'for', 'detecting', 'communities', 'in', 'multilayer', 'networks', 'consists', 'of', 'maximizing', 'a', 'quality', 'function', 'known', 'as', 'modularity', 'however', 'in', 'the', 'multilayer', 'setting', 'the', 'modularity', 'function', 'depends', 'on', 'an', 'interlayer', 'coupling', 'parameter', 'omega', 'and', 'how', 'this', 'parameter', 'affects', 'community', 'detection', 'is', 'not', 'well', 'understood', 'here', 'we', 'expose', 'an', 'upper', 'bound', 'for', 'omega', 'beyond', 'which', 'community', 'changes', 'across', 'layers', 'can', 'not', 'be', 'detected', 'this', 'upper', 'bound', 'has', 'nontrivial', 'purely', 'multilayer', 'effects', 'and', 'acts', 'as', 'a', 'resolution', 'limit', 'for', 'detecting', 'evolving', 'communities', 'further', 'we', 'establish', 'an', 'explicit', 'and', 'previously', 'undiscovered', 'relationship', 'between', 'the', 'single', 'layer', 'resolution', 'parameter', 'gamma', 'and', 'interlayer', 'coupling', 'parameter', 'omega', 'that', 'provides', 'new', 'understanding', 'of', 'the', 'modularity', 'parameter', 'space', 'our', 'findings', 'not', 'only', 'represent', 'new', 'theoretical', 'considerations', 'but', 'also', 'have', 'important', 'practical', 'implications', 'for', 'choosing', 'interlayer', 'coupling', 'values', 'when', 'using', 'multilayer', 'networks', 'to', 'model', 'realworld', 'systems', 'whose', 'communities', 'change', 'across', 'time', 'or', 'modality']] | [-0.163359611746681, 0.11272460509175392, -0.04276229612769725, 0.06812592105620115, -0.10693941572158833, -0.16384870712248234, 0.0755466844089042, 0.4159493528776497, -0.3188295216021067, -0.35451078251282747, 0.012983383459613492, -0.2504593169046827, -0.2208220121161316, 0.16237661702515965, 0.011490274765789857, -0.012415364252391954, 0.0645439982692772, 0.011812357556196713, -0.022867307675649873, -0.21168905972662516, 0.34280976598916973, 0.06228914844289979, 0.3213086434200441, 0.10318836833733334, 0.0678563286228297, -0.011297113879009316, 0.013996796674861041, 0.03569906299961535, -0.12504683889778576, 0.10785665955788497, 0.3169111311685938, 0.10724513351408085, 0.2846525112443351, -0.43620953493464354, -0.25085982511083327, 0.11634296059954441, 0.18880448076943648, 0.057373694974328523, 0.040607950572364, -0.275411254602319, 0.05275910693464505, -0.12715742165205357, -0.0780292588621204, -0.10532747065892147, 0.030490358991148037, 0.0015431714609208751, -0.2406669273022149, 0.07867610202457595, 0.0519746621928143, 0.06108503476101861, -0.046920746746560056, -0.10543560386291558, -0.03537714319242704, 0.21007854654304095, 0.02692055884802009, 0.0013035095631902184, 0.1442327819607943, -0.15980879502222986, -0.10178843880220204, 0.3225153854930617, -0.035395641130108006, -0.2027215388512117, 0.2258619891357756, -0.08175384406398581, -0.15458106514170905, 0.06606032705221708, 0.20550403334515902, 0.10840236572722826, -0.13412285259296242, 0.05800525203867267, -0.035098474981942185, 0.2282175210556973, 0.07480605151156121, 0.07436322547695556, 0.2069579656540512, 0.2311267561859138, 0.09464737140623473, 0.09739533538830022, -0.07234114864688784, -0.07694400884385143, -0.20836592697408965, -0.11109736709252749, -0.18891957780851104, -0.016052832632017143, -0.132720275558602, -0.19577354731181829, 0.41126253023508624, 0.1453583565666819, 0.22869698036947314, 0.03655837987868929, 0.2631324161340213, 0.0757074790313692, 0.11668277607913016, 0.05704971093240534, 0.24737015480249597, 0.11199266636563535, 0.06706007856170638, -0.1435669358467757, 0.14821175105051598, -0.003055745601941283] |
1,803.03598 | Merging the Astrophysics and Planetary Science Information Systems | Conceptually exoplanet research has one foot in the discipline of
Astrophysics and the other foot in Planetary Science. Research strategies for
exoplanets will require efficient access to data and information from both
realms. Astrophysics has a sophisticated, well integrated, distributed
information system with archives and data centers which are interlinked with
the technical literature via the Astrophysics Data System (ADS). The
information system for Planetary Science does not have a central component
linking the literature with the observational and theoretical data. Here we
propose that the Committee on an Exoplanet Science Strategy recommend that this
linkage be built, with the ADS playing the role in Planetary Science which it
already plays in Astrophysics. This will require additional resources for the
ADS, and the Planetary Data System (PDS), as well as other international
collaborators
| astro-ph.IM cs.DL physics.soc-ph | conceptually exoplanet research has one foot in the discipline of astrophysics and the other foot in planetary science research strategies for exoplanets will require efficient access to data and information from both realms astrophysics has a sophisticated well integrated distributed information system with archives and data centers which are interlinked with the technical literature via the astrophysics data system ads the information system for planetary science does not have a central component linking the literature with the observational and theoretical data here we propose that the committee on an exoplanet science strategy recommend that this linkage be built with the ads playing the role in planetary science which it already plays in astrophysics this will require additional resources for the ads and the planetary data system pds as well as other international collaborators | [['conceptually', 'exoplanet', 'research', 'has', 'one', 'foot', 'in', 'the', 'discipline', 'of', 'astrophysics', 'and', 'the', 'other', 'foot', 'in', 'planetary', 'science', 'research', 'strategies', 'for', 'exoplanets', 'will', 'require', 'efficient', 'access', 'to', 'data', 'and', 'information', 'from', 'both', 'realms', 'astrophysics', 'has', 'a', 'sophisticated', 'well', 'integrated', 'distributed', 'information', 'system', 'with', 'archives', 'and', 'data', 'centers', 'which', 'are', 'interlinked', 'with', 'the', 'technical', 'literature', 'via', 'the', 'astrophysics', 'data', 'system', 'ads', 'the', 'information', 'system', 'for', 'planetary', 'science', 'does', 'not', 'have', 'a', 'central', 'component', 'linking', 'the', 'literature', 'with', 'the', 'observational', 'and', 'theoretical', 'data', 'here', 'we', 'propose', 'that', 'the', 'committee', 'on', 'an', 'exoplanet', 'science', 'strategy', 'recommend', 'that', 'this', 'linkage', 'be', 'built', 'with', 'the', 'ads', 'playing', 'the', 'role', 'in', 'planetary', 'science', 'which', 'it', 'already', 'plays', 'in', 'astrophysics', 'this', 'will', 'require', 'additional', 'resources', 'for', 'the', 'ads', 'and', 'the', 'planetary', 'data', 'system', 'pds', 'as', 'well', 'as', 'other', 'international', 'collaborators']] | [-0.061290439727709145, 0.08022444288666916, -0.0986790678295818, 0.04772428226923304, -0.17670296353140943, -0.12457324006013516, 0.025641258189776785, 0.3414573521822467, -0.2259067129208076, -0.4028396552386589, 0.17233235535344907, -0.3081891874229549, -0.12791967552323313, 0.25036600915561047, -0.08078070474032284, 0.06456726000126087, 0.1336070479461013, 0.021277192507387327, 0.03844556287001062, -0.26462624434213666, 0.3152382727441049, 0.13760666901602836, 0.25766871970442745, 0.015472254579312596, 0.03508255708546035, 0.013538150470423744, -0.1042653970889523, -0.051675621766765094, -0.13975362419170465, 0.15022466567001844, 0.3831700134350169, 0.24704305473180038, 0.31434088813042954, -0.42624857033343805, -0.2345680631207008, 0.04220870371795911, 0.14346013104375033, 0.07601073671909596, -0.09980305152353515, -0.2580234659485575, -0.0013124958675046613, -0.18620792359001653, -0.11492605815480526, -0.04232582250343902, 0.06103198147988073, 0.015307315925041675, -0.2231285483716406, -0.011601639890525126, 0.028339480408782463, 0.1323555716299417, -0.08205727129628447, -0.14120241252992555, -0.03492430917904677, 0.20754359736408395, 0.025767714408387366, 0.04673022063119911, 0.14928140172986945, -0.15313944765681722, -0.12284424299500267, 0.41736544789116187, 0.0057135249113425945, -0.1070701704759683, 0.21809863839718632, -0.12773838616151334, -0.18874943502163305, 0.03129234283994463, 0.18559828771740422, 0.05520403147430012, -0.17628000251234585, 0.07458722778496199, -0.02911749906501824, 0.1557482359615764, 0.008089057575995312, 0.07375616667778197, 0.31687302611544166, 0.16287406963205203, 0.07744889116768998, 0.06744907286606337, -0.10919681264444682, -0.11099965994323331, -0.22559841418694845, -0.14385495197616124, -0.1387899744751534, -0.02111727409438962, -0.03119343833565008, -0.1391511399901115, 0.32461458361266476, 0.16671796207477277, 0.0736761513075098, -0.06594759240725491, 0.3280422628850193, 0.011846517925185705, 0.12268227274018459, 0.1058952417329682, 0.28648411833394066, 0.03746813283602994, 0.23144712164311818, -0.1601273887318076, 0.08140165700762764, -0.019936537317567525] |
1,803.03599 | Hilbert's Sixth Problem: the endless road to rigour | Introduction to the special issue of Phil. Trans. R. Soc. A 376, 2018,
`Hilbert's Sixth Problem'. The essence of the Sixth Problem is discussed and
the content of this issue is introduced.
In 1900, David Hilbert presented 23 problems for the advancement of
mathematical science. Hilbert's Sixth Problem proposed the expansion of the
axiomatic method outside of mathematics, in physics and beyond. Its title was
shocking: "Mathematical Treatment of the Axioms of Physics." Axioms of physics
did not exist and were not expected. During further explanation, Hilbert
specified this problem with special focus on probability and "the limiting
processes, ... which lead from the atomistic view to the laws of motion of
continua". The programmatic call was formulated "to treat, by means of axioms,
those physical sciences in which already today mathematics plays an important
part." This issue presents a modern slice of the work on the Sixth Problem,
from quantum probability to fluid dynamics and machine learning, and from
review of solid mathematical and physical results to opinion pieces with new
ambitious ideas. Some expectations were broken: The continuum limit of
atomistic kinetics may differ from the classical fluid dynamics. The "curse of
dimensionality" in machine learning turns into the "blessing of dimensionality"
that is closely related to statistical physics. Quantum probability facilitates
the modelling of geological uncertainty and hydrocarbon reservoirs. And many
other findings are presented.
| physics.hist-ph math-ph math.HO math.MP | introduction to the special issue of phil trans r soc a 376 2018 hilberts sixth problem the essence of the sixth problem is discussed and the content of this issue is introduced in 1900 david hilbert presented 23 problems for the advancement of mathematical science hilberts sixth problem proposed the expansion of the axiomatic method outside of mathematics in physics and beyond its title was shocking mathematical treatment of the axioms of physics axioms of physics did not exist and were not expected during further explanation hilbert specified this problem with special focus on probability and the limiting processes which lead from the atomistic view to the laws of motion of continua the programmatic call was formulated to treat by means of axioms those physical sciences in which already today mathematics plays an important part this issue presents a modern slice of the work on the sixth problem from quantum probability to fluid dynamics and machine learning and from review of solid mathematical and physical results to opinion pieces with new ambitious ideas some expectations were broken the continuum limit of atomistic kinetics may differ from the classical fluid dynamics the curse of dimensionality in machine learning turns into the blessing of dimensionality that is closely related to statistical physics quantum probability facilitates the modelling of geological uncertainty and hydrocarbon reservoirs and many other findings are presented | [['introduction', 'to', 'the', 'special', 'issue', 'of', 'phil', 'trans', 'r', 'soc', 'a', '376', '2018', 'hilberts', 'sixth', 'problem', 'the', 'essence', 'of', 'the', 'sixth', 'problem', 'is', 'discussed', 'and', 'the', 'content', 'of', 'this', 'issue', 'is', 'introduced', 'in', '1900', 'david', 'hilbert', 'presented', '23', 'problems', 'for', 'the', 'advancement', 'of', 'mathematical', 'science', 'hilberts', 'sixth', 'problem', 'proposed', 'the', 'expansion', 'of', 'the', 'axiomatic', 'method', 'outside', 'of', 'mathematics', 'in', 'physics', 'and', 'beyond', 'its', 'title', 'was', 'shocking', 'mathematical', 'treatment', 'of', 'the', 'axioms', 'of', 'physics', 'axioms', 'of', 'physics', 'did', 'not', 'exist', 'and', 'were', 'not', 'expected', 'during', 'further', 'explanation', 'hilbert', 'specified', 'this', 'problem', 'with', 'special', 'focus', 'on', 'probability', 'and', 'the', 'limiting', 'processes', 'which', 'lead', 'from', 'the', 'atomistic', 'view', 'to', 'the', 'laws', 'of', 'motion', 'of', 'continua', 'the', 'programmatic', 'call', 'was', 'formulated', 'to', 'treat', 'by', 'means', 'of', 'axioms', 'those', 'physical', 'sciences', 'in', 'which', 'already', 'today', 'mathematics', 'plays', 'an', 'important', 'part', 'this', 'issue', 'presents', 'a', 'modern', 'slice', 'of', 'the', 'work', 'on', 'the', 'sixth', 'problem', 'from', 'quantum', 'probability', 'to', 'fluid', 'dynamics', 'and', 'machine', 'learning', 'and', 'from', 'review', 'of', 'solid', 'mathematical', 'and', 'physical', 'results', 'to', 'opinion', 'pieces', 'with', 'new', 'ambitious', 'ideas', 'some', 'expectations', 'were', 'broken', 'the', 'continuum', 'limit', 'of', 'atomistic', 'kinetics', 'may', 'differ', 'from', 'the', 'classical', 'fluid', 'dynamics', 'the', 'curse', 'of', 'dimensionality', 'in', 'machine', 'learning', 'turns', 'into', 'the', 'blessing', 'of', 'dimensionality', 'that', 'is', 'closely', 'related', 'to', 'statistical', 'physics', 'quantum', 'probability', 'facilitates', 'the', 'modelling', 'of', 'geological', 'uncertainty', 'and', 'hydrocarbon', 'reservoirs', 'and', 'many', 'other', 'findings', 'are', 'presented']] | [-0.05133942183399971, 0.06712026854558788, -0.10861187354226377, 0.07549870313896022, -0.12249252544757028, -0.11359904092707823, 0.03388103161654374, 0.25734521645133585, -0.3010135893740728, -0.33122118339270745, 0.10247482283970152, -0.2659990514427555, -0.14957406114589933, 0.191957781680076, -0.12348031701052373, 0.06909913167799515, 0.031315140664117974, 0.005048123117544512, -0.030122174041362127, -0.2799776064022752, 0.30231977687914763, 0.08319695875159411, 0.28256044144914505, 0.06113343424930972, 0.08962146886447465, 0.008196593914591268, -0.07308084777420969, -0.0072888424307198186, -0.13994618389353033, 0.14917680769410016, 0.31982717172566816, 0.16714238754554014, 0.3430034109690772, -0.4301182443095527, -0.20004650403843938, 0.04143970666067585, 0.09257272947302687, 0.11405890722480082, 0.0032929254373707828, -0.2846143796654328, -0.007762637399629349, -0.15073487033558772, -0.14103742007941567, -0.03002703291546586, 0.04521187304391932, -0.021698225494463916, -0.1744624689623451, 0.08108624769374728, 0.11029506447860389, 0.11043089789662526, -0.05199959037975728, -0.14740591348735574, 0.022118811944644105, 0.09735405156368365, 0.058282078082502985, 0.022492709350136277, 0.12244364028511413, -0.14422153166314744, -0.14704165693848406, 0.44750495768656817, 0.02532812775602966, -0.14785875384090674, 0.2089035062474252, -0.12063091350329572, -0.17644678247940732, 0.11108318442455185, 0.15512134651920148, 0.05439553699878738, -0.16321717420519055, 0.13667363171760066, -0.024757277884106213, 0.14042654258146725, 0.07204435156793683, 0.00809979740743595, 0.21330594871447542, 0.1639816833527693, -0.00348605675902833, 0.11047152372508921, -0.02588832236906936, -0.17456039707976423, -0.29916284069221977, -0.15577418626889192, -0.1781923921188003, 0.05398709278377819, -0.03358209275301815, -0.14953434862409787, 0.3560085356505259, 0.16946179404575787, 0.10833374328812839, -0.003567436492554679, 0.22928996740774732, 0.08470836008533769, 0.00969564651486788, 0.03851048335830972, 0.2463551594149824, 0.14496207811576334, 0.14657476057589777, -0.16692369663446838, 0.06180784937572801, 0.10565279215463491] |
1,803.036 | A theory of NP-completeness and ill-conditioning for approximate real
computations | We develop a complexity theory for approximate real computations. We first
produce a theory for exact computations but with condition numbers. The input
size depends on a condition number, which is not assumed known by the machine.
The theory admits deterministic and nondeterministic polynomial time
recognizable problems. We prove that P is not NP in this theory if and only if
P is not NP in the BSS theory over the reals.
Then we develop a theory with weak and strong approximate computations. This
theory is intended to model actual numerical computations that are usually
performed in floating point arithmetic. It admits classes P and NP and also an
NP-complete problem. We relate the P vs NP question in this new theory to the
classical P vs NP problem.
| cs.CC | we develop a complexity theory for approximate real computations we first produce a theory for exact computations but with condition numbers the input size depends on a condition number which is not assumed known by the machine the theory admits deterministic and nondeterministic polynomial time recognizable problems we prove that p is not np in this theory if and only if p is not np in the bss theory over the reals then we develop a theory with weak and strong approximate computations this theory is intended to model actual numerical computations that are usually performed in floating point arithmetic it admits classes p and np and also an npcomplete problem we relate the p vs np question in this new theory to the classical p vs np problem | [['we', 'develop', 'a', 'complexity', 'theory', 'for', 'approximate', 'real', 'computations', 'we', 'first', 'produce', 'a', 'theory', 'for', 'exact', 'computations', 'but', 'with', 'condition', 'numbers', 'the', 'input', 'size', 'depends', 'on', 'a', 'condition', 'number', 'which', 'is', 'not', 'assumed', 'known', 'by', 'the', 'machine', 'the', 'theory', 'admits', 'deterministic', 'and', 'nondeterministic', 'polynomial', 'time', 'recognizable', 'problems', 'we', 'prove', 'that', 'p', 'is', 'not', 'np', 'in', 'this', 'theory', 'if', 'and', 'only', 'if', 'p', 'is', 'not', 'np', 'in', 'the', 'bss', 'theory', 'over', 'the', 'reals', 'then', 'we', 'develop', 'a', 'theory', 'with', 'weak', 'and', 'strong', 'approximate', 'computations', 'this', 'theory', 'is', 'intended', 'to', 'model', 'actual', 'numerical', 'computations', 'that', 'are', 'usually', 'performed', 'in', 'floating', 'point', 'arithmetic', 'it', 'admits', 'classes', 'p', 'and', 'np', 'and', 'also', 'an', 'npcomplete', 'problem', 'we', 'relate', 'the', 'p', 'vs', 'np', 'question', 'in', 'this', 'new', 'theory', 'to', 'the', 'classical', 'p', 'vs', 'np', 'problem']] | [-0.1267501291071693, 0.10721945981127336, -0.12263613645449396, 0.11888899766504331, -0.07062669976997052, -0.2040724974818701, 0.09159217651774601, 0.32230477366062216, -0.3447709489584893, -0.295225768021575, 0.03751614435427902, -0.2266474152669715, -0.1857100005456528, 0.17567086472652507, -0.07071327046281839, 0.056999768000529256, 0.040243085537849416, 0.07358328437129426, -0.06891766854366937, -0.27997134538374613, 0.25620720166958466, -0.023168834846813317, 0.20918786063674807, 0.07775699576839458, 0.045641390337606946, 0.02999175139955541, 0.009906847073241722, 0.059928715090057996, -0.14848850227140212, 0.07498488691003719, 0.30397891957861506, 0.18532197811106552, 0.2688677107929721, -0.44911716846648114, -0.1436005533030329, 0.1776860393592799, 0.10695702120546223, 0.10624893831518703, -0.011272880724313589, -0.17449814089314017, 0.1901343634673358, -0.10320556243563923, -0.11234818187690261, -0.05570121528219807, 0.08800510589986346, -0.025128104529061984, -0.2929243536471108, 0.019493495491143792, 0.09800942864471165, 0.06141719233620074, -0.03486110075095365, -0.08740572371455126, 0.06973879902746326, 0.04267693868325662, 0.010751562101663588, 0.05497926762941214, 0.054841219548626925, -0.09857005712778358, -0.1397996009544058, 0.3898968121267913, -0.0047507297478673995, -0.26767630834681116, 0.1687967490780261, -0.12292189311322778, -0.17489120033894515, 0.10425569126454666, 0.12305371616714338, 0.1707009231281835, -0.053465570222095464, 0.21602858285114618, -0.11970501928048771, 0.22392225023760648, 0.06632682130592622, -0.028360635511461618, 0.1077848124541631, 0.10986090721490309, 0.06116934839000766, 0.11017782067114762, -0.00207170666296526, -0.1012882440849099, -0.3457568919704866, -0.10145066074518011, -0.16626195890410234, 0.06658340979928364, -0.05408399720446571, -0.2168895463683, 0.29716861732809463, 0.1257512892516106, 0.1322581042326236, 0.12769373431314476, 0.3019416728742825, 0.1659058547008407, -0.0031171257972226357, 0.10453704154017822, 0.1672503404146017, 0.14829256374013516, 0.05239832914134762, -0.1862972745953431, 0.07047636076706902, 0.11207941861086806] |
1,803.03601 | The spectrum of a Schr\"odinger operator in a wire-like domain with a
purely imaginary degenerate potential in the semiclassical limit | Consider a two-dimensional domain shaped like a wire, not necessarily of
uniform cross section. Let $V$ denote an electric potential driven by a voltage
drop between the conducting surfaces of the wire. We consider the operator
${\mathcal A}_h=-h^2\Delta+iV$ in the semi-classical limit $h\to 0$. We obtain
both the asymptotic behaviour of the left margin of the spectrum, as well as
resolvent estimates on the left side of this margin. We extend here previous
results obtained for potentials for which the set where the current (or $\nabla
V$) is normal to the boundary is discrete, in contrast with the present case
where $V$ is constant along the conducting surfaces.
| math-ph math.MP | consider a twodimensional domain shaped like a wire not necessarily of uniform cross section let v denote an electric potential driven by a voltage drop between the conducting surfaces of the wire we consider the operator mathcal a_hh2deltaiv in the semiclassical limit hto 0 we obtain both the asymptotic behaviour of the left margin of the spectrum as well as resolvent estimates on the left side of this margin we extend here previous results obtained for potentials for which the set where the current or nabla v is normal to the boundary is discrete in contrast with the present case where v is constant along the conducting surfaces | [['consider', 'a', 'twodimensional', 'domain', 'shaped', 'like', 'a', 'wire', 'not', 'necessarily', 'of', 'uniform', 'cross', 'section', 'let', 'v', 'denote', 'an', 'electric', 'potential', 'driven', 'by', 'a', 'voltage', 'drop', 'between', 'the', 'conducting', 'surfaces', 'of', 'the', 'wire', 'we', 'consider', 'the', 'operator', 'mathcal', 'a_hh2deltaiv', 'in', 'the', 'semiclassical', 'limit', 'hto', '0', 'we', 'obtain', 'both', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'left', 'margin', 'of', 'the', 'spectrum', 'as', 'well', 'as', 'resolvent', 'estimates', 'on', 'the', 'left', 'side', 'of', 'this', 'margin', 'we', 'extend', 'here', 'previous', 'results', 'obtained', 'for', 'potentials', 'for', 'which', 'the', 'set', 'where', 'the', 'current', 'or', 'nabla', 'v', 'is', 'normal', 'to', 'the', 'boundary', 'is', 'discrete', 'in', 'contrast', 'with', 'the', 'present', 'case', 'where', 'v', 'is', 'constant', 'along', 'the', 'conducting', 'surfaces']] | [-0.14888263635650695, 0.09147702962735114, -0.01172813901973662, -0.029797739921590297, -0.04529264225476535, -0.1464226102743681, 0.0338614725129174, 0.3547194266221791, -0.2902061994335501, -0.19953950550450691, 0.08120328930171782, -0.31832088676289977, -0.07050963965784236, 0.1941517703974985, -0.07017978176335309, 0.008308665060969157, 0.0236373334975095, 0.08717026110634069, -0.07959952400388004, -0.17779935182237597, 0.3377300727520591, -0.03480324931181619, 0.2375461455417153, 0.09148060825923196, 0.04922895764096457, 0.017658077297888906, 0.0408293852913324, 0.03566290204038965, -0.17134010320894907, 0.08299791152702174, 0.18789597921003806, -0.008237568082757921, 0.2482355843846486, -0.4406140736504414, -0.18810130713211598, 0.14223146224916677, 0.16207219637651868, 0.023929915124350273, -0.023612682073307443, -0.29924317936534844, 0.08521579845730111, -0.14108605047896783, -0.14793785924753436, -0.003687461566127767, 0.047620009700550095, 0.04736134218852793, -0.3140016646629252, 0.07541797948983785, 0.08592540803952926, 0.044888198978450394, -0.06538308399651095, -0.1240252946747171, -0.04338051259482854, 0.10079890481554293, 0.03561252832551983, 0.07712127627678668, 0.09022190338778571, -0.14647808800033668, -0.059363590013758044, 0.3391519010275881, -0.12368453681364516, -0.240279990779323, 0.11763867684509431, -0.19963876723755744, -0.01178695610289192, 0.0438640618318187, 0.13782775181859175, 0.156510865820624, -0.10689126473425009, 0.18699010569497804, -0.051984505461328705, 0.09595890920043479, 0.07263598557143847, -0.015490111485819951, 0.16161943792809394, 0.16222074067341946, 0.1143225766631348, 0.15087933774175835, -0.10899819916867103, -0.030345732459328444, -0.38025238677406703, -0.1482573076908555, -0.16240547837637295, 0.08927664486487356, -0.045113488918640345, -0.23470901111119089, 0.3703947535881372, 0.09020787914431541, 0.26254849906175215, 0.08036652347616956, 0.2663613245866009, 0.1558249460406238, 0.0032094183800063123, 0.09080897349098296, 0.20081514740203915, 0.14774121727280876, 0.0919340569395398, -0.20557648097991804, 0.03075907761492183, 0.06762786432404384] |
1,803.03602 | Weyl's polarization theorem in positive characteristic | Let $V$ be an $n$-dimensional algebraic representation over an algebraically
closed field $K$ of a group $G$. For $m > 0$, we study the invariant rings
$K[V^{ m}]^G$ for the diagonal action of $G$ on $V^m$. In characteristic zero,
a theorem of Weyl tells us that we can obtain all the invariants in $K[V^m]^G$
by the process of polarization and restitution from $K[V^n]^G$. In particular,
this means that if $K[V^n]^G$ is generated in degree $\leq d$, then so is
$K[V^m]^G$ no matter how large $m$ is.
There are several explicit counterexamples to Weyl's theorem in positive
characteristic. However, when $G$ is a (connected) reductive affine group
scheme over $\mathbb{Z}$ and $V^*$ is a good $G$-module, we show that Weyl's
theorem holds in sufficiently large characteristic. As a special case, we
consider the ring of invariants $R(n,m)$ for the left-right action of ${\rm
SL}_n \times {\rm SL}_n$ on $m$-tuples of $n \times n$ matrices. In this case,
we show that the invariants of degree $\leq n^6$ suffice to generate $R(n,m)$
if the characteristic is larger than $2n^6 + n^2$.
| math.RT | let v be an ndimensional algebraic representation over an algebraically closed field k of a group g for m 0 we study the invariant rings kv mg for the diagonal action of g on vm in characteristic zero a theorem of weyl tells us that we can obtain all the invariants in kvmg by the process of polarization and restitution from kvng in particular this means that if kvng is generated in degree leq d then so is kvmg no matter how large m is there are several explicit counterexamples to weyls theorem in positive characteristic however when g is a connected reductive affine group scheme over mathbbz and v is a good gmodule we show that weyls theorem holds in sufficiently large characteristic as a special case we consider the ring of invariants rnm for the leftright action of rm sl_n times rm sl_n on mtuples of n times n matrices in this case we show that the invariants of degree leq n6 suffice to generate rnm if the characteristic is larger than 2n6 n2 | [['let', 'v', 'be', 'an', 'ndimensional', 'algebraic', 'representation', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'of', 'a', 'group', 'g', 'for', 'm', '0', 'we', 'study', 'the', 'invariant', 'rings', 'kv', 'mg', 'for', 'the', 'diagonal', 'action', 'of', 'g', 'on', 'vm', 'in', 'characteristic', 'zero', 'a', 'theorem', 'of', 'weyl', 'tells', 'us', 'that', 'we', 'can', 'obtain', 'all', 'the', 'invariants', 'in', 'kvmg', 'by', 'the', 'process', 'of', 'polarization', 'and', 'restitution', 'from', 'kvng', 'in', 'particular', 'this', 'means', 'that', 'if', 'kvng', 'is', 'generated', 'in', 'degree', 'leq', 'd', 'then', 'so', 'is', 'kvmg', 'no', 'matter', 'how', 'large', 'm', 'is', 'there', 'are', 'several', 'explicit', 'counterexamples', 'to', 'weyls', 'theorem', 'in', 'positive', 'characteristic', 'however', 'when', 'g', 'is', 'a', 'connected', 'reductive', 'affine', 'group', 'scheme', 'over', 'mathbbz', 'and', 'v', 'is', 'a', 'good', 'gmodule', 'we', 'show', 'that', 'weyls', 'theorem', 'holds', 'in', 'sufficiently', 'large', 'characteristic', 'as', 'a', 'special', 'case', 'we', 'consider', 'the', 'ring', 'of', 'invariants', 'rnm', 'for', 'the', 'leftright', 'action', 'of', 'rm', 'sl_n', 'times', 'rm', 'sl_n', 'on', 'mtuples', 'of', 'n', 'times', 'n', 'matrices', 'in', 'this', 'case', 'we', 'show', 'that', 'the', 'invariants', 'of', 'degree', 'leq', 'n6', 'suffice', 'to', 'generate', 'rnm', 'if', 'the', 'characteristic', 'is', 'larger', 'than', '2n6', 'n2']] | [-0.22709305685092723, 0.1293098680273329, -0.07731000909061972, 0.015949690177464174, -0.05575448590016729, -0.17267733764412357, -0.033245403473915226, 0.361300534893607, -0.2727271789295036, -0.22014353297336764, 0.047505050681688456, -0.2495927373881365, -0.13432242183101384, 0.20809422801302876, -0.08775230987149096, -0.07668561564195295, 0.008216672541768572, 0.15751035401034494, -0.08786517342682494, -0.2878842164645903, 0.3304595854322881, -0.07292855705735599, 0.18819812960857743, 0.045532221591836494, 0.10522642203195151, 0.0177602231080189, 0.03740185518142616, 0.01130288114316415, -0.15493435942284292, 0.06081016215551265, 0.28751544280351293, 0.09086073932595291, 0.20758623339311588, -0.3676785855143883, -0.13720802494140646, 0.225081812552458, 0.14888395899960902, 0.029956758098113677, 0.009598401882739867, -0.23069137931249084, 0.19911343326959977, -0.1639707376139826, -0.1702159202608908, -0.04775452791702349, 0.15235496399894377, -0.03329251948872657, -0.296735821183511, 0.030591994632295397, 0.10367123133145532, 0.11046267243719465, -0.01694154443468379, -0.12598039503249903, -0.03524585393376562, 0.07485792129574652, 0.0029812196997565563, 0.07361493063319019, 0.06371624072537173, -0.08036410110308193, -0.07653184128156322, 0.38158758424579836, -0.12109360176716934, -0.20270047872327268, 0.09835739293390192, -0.19634018298563397, -0.1488353371089541, 0.12826243502177234, 0.11307617228716439, 0.19417757398264787, -0.011938423992200284, 0.22412272298445945, -0.163542399372429, 0.11759549544496072, 0.0874372392237663, -0.016447520516352555, 0.12915459185903674, 0.05202970015247851, 0.1130384830299421, 0.08873503198400465, 0.0009470163102716554, 0.03616657949507583, -0.37142478739626184, -0.19830805893045264, -0.17892815123500336, 0.2051392783678873, -0.14090883376555338, -0.09805285994255872, 0.3697631072550076, 0.09457902590267707, 0.18893213970261777, 0.11215030972921658, 0.1926794431096506, 0.08392932234253453, 0.06556924932560515, 0.1054515867781024, 0.08039419315376341, 0.2145627100727261, -0.04014158315095661, -0.16939365480170954, -0.019582935550715774, 0.13904483029673007] |
1,803.03603 | Learning local, quenched disorder in plasticity and other crackling
noise phenomena | When far from equilibrium, many-body systems display behavior that strongly
depends on the initial conditions. A characteristic such example is the
phenomenon of plasticity of crystalline and amorphous materials that strongly
depends on the material history. In plasticity modeling, the history is
captured by a quenched, local and disordered flow stress distribution. While it
is this disorder that causes avalanches that are commonly observed during
nanoscale plastic deformation, the functional form and scaling properties have
remained elusive. In this paper, a generic formalism is developed for deriving
local disorder distributions from field-response (e.g. stress/strain)
timeseries in models of crackling noise. We demonstrate the efficiency of the
method in the hysteretic random-field Ising model and also, models of elastic
interface depinning that have been used to model crystalline and amorphous
plasticity. We show that the capacity to resolve the quenched disorder
distribution improves with the temporal resolution and number of samples.
| cond-mat.mtrl-sci cond-mat.dis-nn cond-mat.mes-hall cond-mat.stat-mech nlin.CG | when far from equilibrium manybody systems display behavior that strongly depends on the initial conditions a characteristic such example is the phenomenon of plasticity of crystalline and amorphous materials that strongly depends on the material history in plasticity modeling the history is captured by a quenched local and disordered flow stress distribution while it is this disorder that causes avalanches that are commonly observed during nanoscale plastic deformation the functional form and scaling properties have remained elusive in this paper a generic formalism is developed for deriving local disorder distributions from fieldresponse eg stressstrain timeseries in models of crackling noise we demonstrate the efficiency of the method in the hysteretic randomfield ising model and also models of elastic interface depinning that have been used to model crystalline and amorphous plasticity we show that the capacity to resolve the quenched disorder distribution improves with the temporal resolution and number of samples | [['when', 'far', 'from', 'equilibrium', 'manybody', 'systems', 'display', 'behavior', 'that', 'strongly', 'depends', 'on', 'the', 'initial', 'conditions', 'a', 'characteristic', 'such', 'example', 'is', 'the', 'phenomenon', 'of', 'plasticity', 'of', 'crystalline', 'and', 'amorphous', 'materials', 'that', 'strongly', 'depends', 'on', 'the', 'material', 'history', 'in', 'plasticity', 'modeling', 'the', 'history', 'is', 'captured', 'by', 'a', 'quenched', 'local', 'and', 'disordered', 'flow', 'stress', 'distribution', 'while', 'it', 'is', 'this', 'disorder', 'that', 'causes', 'avalanches', 'that', 'are', 'commonly', 'observed', 'during', 'nanoscale', 'plastic', 'deformation', 'the', 'functional', 'form', 'and', 'scaling', 'properties', 'have', 'remained', 'elusive', 'in', 'this', 'paper', 'a', 'generic', 'formalism', 'is', 'developed', 'for', 'deriving', 'local', 'disorder', 'distributions', 'from', 'fieldresponse', 'eg', 'stressstrain', 'timeseries', 'in', 'models', 'of', 'crackling', 'noise', 'we', 'demonstrate', 'the', 'efficiency', 'of', 'the', 'method', 'in', 'the', 'hysteretic', 'randomfield', 'ising', 'model', 'and', 'also', 'models', 'of', 'elastic', 'interface', 'depinning', 'that', 'have', 'been', 'used', 'to', 'model', 'crystalline', 'and', 'amorphous', 'plasticity', 'we', 'show', 'that', 'the', 'capacity', 'to', 'resolve', 'the', 'quenched', 'disorder', 'distribution', 'improves', 'with', 'the', 'temporal', 'resolution', 'and', 'number', 'of', 'samples']] | [-0.09819499990784082, 0.17419453495144593, -0.13313764223091354, 0.02776533103979274, -0.02471524303085202, -0.13393206912836672, 0.003857475006171571, 0.40658650712903915, -0.2687140758584516, -0.2713276587032882, 0.06917673757537299, -0.2641958769085823, -0.23313641965845538, 0.14632264628143818, -0.03831882043610774, 0.07120004660706192, 0.007178066953104114, -0.02532949773657242, -0.035973328637621746, -0.2253841813544324, 0.2963034298283442, 0.031098314499030916, 0.36818833216624774, 0.050001634594253046, 0.0683309124183416, -0.006051813336651797, 0.054772378336138176, 0.07610055958639655, -0.15119387861487735, 0.05534387195846941, 0.20900268519701376, 0.001691357637349291, 0.2221806561011796, -0.46516837857213594, -0.29826097863557555, 0.0798302801367815, 0.10404986935546981, 0.13300007299657585, -0.028681769034975275, -0.22392455179669313, 0.08940891682048446, -0.13438765624000523, -0.11122243498583267, -0.08799560664959202, 0.043930987586836084, 0.07076679924995195, -0.22737464157633183, 0.15373558907175042, 0.11090358279664195, 0.10698194587806352, -0.11339180518704273, -0.056266457436218754, -0.04747602682804451, 0.09855387843196005, 0.04676997438350523, -0.007909292017653485, 0.21009967441751853, -0.19355675295282831, -0.061649807459274744, 0.36161956840488535, -0.02410878542023117, -0.13771522142516132, 0.22017703614753964, -0.1608664328701194, -0.13954506896048685, 0.15720925197917843, 0.1642342343170121, 0.07543315649213857, -0.1777248099285542, 0.062418527173772206, 0.003870562408838246, 0.1946887788644073, 0.007879974283027969, 0.02724984832008013, 0.2025199166417822, 0.24891288449593987, -0.009774443665331842, 0.1627574750572293, -0.09754309922944279, -0.10976370324024418, -0.2503128519388003, -0.11731389530873548, -0.2394378041010975, 0.0636753599884476, -0.09788590075464564, -0.2177183745341413, 0.37738781060317167, 0.19228033039987638, 0.19001375836313972, 0.040011335161183305, 0.20913367007152747, 0.09246698965087233, 0.06383717536219964, 0.03731297086236761, 0.23651654028096206, 0.14230846663805713, 0.1167018169196535, -0.2509729189941997, 0.16927888915067751, 0.018788288028648237] |
1,803.03604 | SDSS-IV MaNGA: The Spectroscopic Discovery of Strongly Lensed Galaxies | We present a catalogue of 38 spectroscopically detected strong galaxy-galaxy
gravitational lens candidates identified in the Sloan Digital Sky Survey IV
(SDSS-IV). We were able to simulate narrow-band images for 8 of them
demonstrating evidence of multiple images. Two of our systems are compound lens
candidates, each with 2 background source-planes. One of these compound systems
shows clear lensing features in the narrow-band image. Our sample is based on
2812 galaxies observed by the Mapping Nearby Galaxies at APO (MaNGA) integral
field unit (IFU). This Spectroscopic Identification of Lensing Objects (SILO)
survey extends the methodology of the Sloan Lens ACS Survey (SLACS) and BOSS
Emission-Line Survey (BELLS) to lower redshift and multiple IFU spectra. We
searched ~ 1.5 million spectra, of which 3065 contained multiple high
signal-to-noise background emission-lines or a resolved [OII] doublet, that are
included in this catalogue. Upon manual inspection, we discovered regions with
multiple spectra containing background emission-lines at the same redshift,
providing evidence of a common source-plane geometry which was not possible in
previous SLACS and BELLS discovery programs. We estimate more than half of our
candidates have an Einstein radius > 1.7", which is significantly greater than
seen in SLACS and BELLS. These larger Einstein radii produce more extended
images of the background galaxy increasing the probability that a background
emission-line will enter one of the IFU spectroscopic fibres, making detection
more likely.
| astro-ph.GA | we present a catalogue of 38 spectroscopically detected strong galaxygalaxy gravitational lens candidates identified in the sloan digital sky survey iv sdssiv we were able to simulate narrowband images for 8 of them demonstrating evidence of multiple images two of our systems are compound lens candidates each with 2 background sourceplanes one of these compound systems shows clear lensing features in the narrowband image our sample is based on 2812 galaxies observed by the mapping nearby galaxies at apo manga integral field unit ifu this spectroscopic identification of lensing objects silo survey extends the methodology of the sloan lens acs survey slacs and boss emissionline survey bells to lower redshift and multiple ifu spectra we searched 15 million spectra of which 3065 contained multiple high signaltonoise background emissionlines or a resolved oii doublet that are included in this catalogue upon manual inspection we discovered regions with multiple spectra containing background emissionlines at the same redshift providing evidence of a common sourceplane geometry which was not possible in previous slacs and bells discovery programs we estimate more than half of our candidates have an einstein radius 17 which is significantly greater than seen in slacs and bells these larger einstein radii produce more extended images of the background galaxy increasing the probability that a background emissionline will enter one of the ifu spectroscopic fibres making detection more likely | [['we', 'present', 'a', 'catalogue', 'of', '38', 'spectroscopically', 'detected', 'strong', 'galaxygalaxy', 'gravitational', 'lens', 'candidates', 'identified', 'in', 'the', 'sloan', 'digital', 'sky', 'survey', 'iv', 'sdssiv', 'we', 'were', 'able', 'to', 'simulate', 'narrowband', 'images', 'for', '8', 'of', 'them', 'demonstrating', 'evidence', 'of', 'multiple', 'images', 'two', 'of', 'our', 'systems', 'are', 'compound', 'lens', 'candidates', 'each', 'with', '2', 'background', 'sourceplanes', 'one', 'of', 'these', 'compound', 'systems', 'shows', 'clear', 'lensing', 'features', 'in', 'the', 'narrowband', 'image', 'our', 'sample', 'is', 'based', 'on', '2812', 'galaxies', 'observed', 'by', 'the', 'mapping', 'nearby', 'galaxies', 'at', 'apo', 'manga', 'integral', 'field', 'unit', 'ifu', 'this', 'spectroscopic', 'identification', 'of', 'lensing', 'objects', 'silo', 'survey', 'extends', 'the', 'methodology', 'of', 'the', 'sloan', 'lens', 'acs', 'survey', 'slacs', 'and', 'boss', 'emissionline', 'survey', 'bells', 'to', 'lower', 'redshift', 'and', 'multiple', 'ifu', 'spectra', 'we', 'searched', '15', 'million', 'spectra', 'of', 'which', '3065', 'contained', 'multiple', 'high', 'signaltonoise', 'background', 'emissionlines', 'or', 'a', 'resolved', 'oii', 'doublet', 'that', 'are', 'included', 'in', 'this', 'catalogue', 'upon', 'manual', 'inspection', 'we', 'discovered', 'regions', 'with', 'multiple', 'spectra', 'containing', 'background', 'emissionlines', 'at', 'the', 'same', 'redshift', 'providing', 'evidence', 'of', 'a', 'common', 'sourceplane', 'geometry', 'which', 'was', 'not', 'possible', 'in', 'previous', 'slacs', 'and', 'bells', 'discovery', 'programs', 'we', 'estimate', 'more', 'than', 'half', 'of', 'our', 'candidates', 'have', 'an', 'einstein', 'radius', '17', 'which', 'is', 'significantly', 'greater', 'than', 'seen', 'in', 'slacs', 'and', 'bells', 'these', 'larger', 'einstein', 'radii', 'produce', 'more', 'extended', 'images', 'of', 'the', 'background', 'galaxy', 'increasing', 'the', 'probability', 'that', 'a', 'background', 'emissionline', 'will', 'enter', 'one', 'of', 'the', 'ifu', 'spectroscopic', 'fibres', 'making', 'detection', 'more', 'likely']] | [-0.08458782829585346, -0.005314138359882131, -0.056407347647061123, 0.09000187049067654, -0.14521380554033708, -0.10145615193110981, 0.019119667803118648, 0.42590659329321534, -0.09830182184456472, -0.3618352119192745, 0.03781670954776928, -0.36052623518075033, -0.04686261954499961, 0.2319136368354424, -0.007647971138440534, -0.022046018932200144, 0.0620202608844389, -0.10221446303040845, -0.016176566911322493, -0.3650332933056902, 0.276953488633663, 0.06526063783047927, 0.2211929753997602, -0.11940757707132241, 0.08397534153057444, -0.02213862119036504, -0.1729816228884841, 0.01743262905042322, -0.1356003894710803, 0.07355001352035102, 0.2791924218026987, 0.17656834898475327, 0.24318462421713744, -0.2682300187167709, -0.16771111331171298, 0.07905799117911838, 0.2132135382111687, 0.09541389207300045, -0.08155423557364941, -0.38402638103878867, 0.0909228701498854, -0.13590062046897458, -0.1450622072590173, 0.041760438091463646, -0.020020328294197344, 0.03791937546132841, -0.1770351726764739, 0.13079345553280966, -0.005654871960343645, 0.16197216580827942, -0.12917698729799781, -0.12118097485364539, -0.04917903397483669, 0.08411652918604194, -0.0621734160004777, 0.07276633047844917, 0.17323754138964337, -0.16189750879632095, -0.029640944530379718, 0.3816486030479118, -0.05620707101582661, 0.0028959477930206113, 0.1939836361567053, -0.2228644008117736, -0.19158846843344843, 0.17977501742595361, 0.1547951093149594, 0.11570219928591896, -0.20292851269096795, -0.026928291334646994, -0.04820146455699413, 0.2824063300246793, 0.06595323231087717, 0.08556609451251806, 0.31390940074075374, 0.060622903023871175, 0.039858451151223113, 0.1062991660535418, -0.28049589853656, 0.02777019172131117, -0.2646546189104561, -0.10284591255353072, -0.13071395906689784, 0.10013908456061375, -0.10016690758113601, -0.12903424444303443, 0.3268770930837362, 0.12699333046649508, 0.17926520440805768, 0.0634616688137258, 0.31511437962350924, 0.005393331355324625, 0.16930757821290301, -0.019676217574428403, 0.3347217375865882, 0.12292723188926755, 0.10901907446435694, -0.13045866161778535, -0.026460041710282718, 0.0007447412590891848] |
1,803.03605 | Cantor-Bendixson ranks of countable SFTs | We show that the possible Cantor-Bendixson ranks of countable SFTs are
exactly the finite ordinals and ordinals of the form $\lambda + 3$, where
$\lambda$ is a computable ordinal. This result was claimed by the author in his
PhD dissertation, but the proof contains an error, which is fixed in this note.
| math.DS cs.LO | we show that the possible cantorbendixson ranks of countable sfts are exactly the finite ordinals and ordinals of the form lambda 3 where lambda is a computable ordinal this result was claimed by the author in his phd dissertation but the proof contains an error which is fixed in this note | [['we', 'show', 'that', 'the', 'possible', 'cantorbendixson', 'ranks', 'of', 'countable', 'sfts', 'are', 'exactly', 'the', 'finite', 'ordinals', 'and', 'ordinals', 'of', 'the', 'form', 'lambda', '3', 'where', 'lambda', 'is', 'a', 'computable', 'ordinal', 'this', 'result', 'was', 'claimed', 'by', 'the', 'author', 'in', 'his', 'phd', 'dissertation', 'but', 'the', 'proof', 'contains', 'an', 'error', 'which', 'is', 'fixed', 'in', 'this', 'note']] | [-0.13177987697132515, 0.16257869850018966, -0.09485809671162974, 0.09676629301461884, -0.11394935067943937, -0.12469085193622638, 0.04434817762789773, 0.3089319089902382, -0.26635440621598094, -0.2089214417900817, 0.07423577585951517, -0.31693297851027225, -0.11190036078001939, 0.10494507644804851, -0.14265264693063265, -0.015035708325312418, 0.0006765114536107171, 0.15428901153306165, 0.014274204938499001, -0.3711981226270105, 0.3899785548302473, -0.031442378227617224, 0.18207117818369, 0.07291524378838492, 0.09780152250702183, -0.04016800008385497, -0.042163450891772904, 0.015222892986939233, -0.18553936341392246, 0.09747313942038911, 0.3160469918055277, 0.1551495797055609, 0.3298710510865146, -0.2762848158348717, -0.11126003748572924, 0.1394440876046086, 0.11090248194066625, 0.07696271074853618, 0.03391551480208542, -0.28078840086784435, 0.12608591868204302, -0.1995843289529576, -0.11099482998799752, -0.008073180767835355, 0.1041291869592433, -0.006991620285107809, -0.24181356481915595, 0.008321111355269072, 0.22155862937078757, 0.14719327066239773, -0.014429121842041757, -0.1596934193854823, 0.022467273451826152, 0.07373899856910986, 0.05905368912271133, 0.05233981723522804, 0.001080019089082877, -0.015855891287084853, -0.10525176058724231, 0.3739896390002732, -0.06159795599752197, -0.1860995234866791, 0.11928662062421733, -0.1721384135513183, -0.21033191596221762, 0.10212825070701394, -0.0010806951105740725, 0.15047743719290285, -0.06199452772225235, 0.20350440496501201, -0.1463685685850899, 0.2197852048146374, 0.14775279791587415, -0.009008167265896119, 0.08833644548248426, 0.11881679721067057, 0.06581755751269121, 0.1552807000630042, 0.05012333970151696, -0.01723383218346748, -0.37950548810847834, -0.18290460818246299, -0.1920320862429399, 0.08239089930886585, -0.03312601372753681, -0.18294784003028683, 0.3536761910517645, 0.1270393965053646, 0.10683150041629286, 0.1759227689597573, 0.2284821357906741, 0.11723542441705279, 0.003761922557126073, 0.06256295242072905, 0.17904863920172348, 0.10092760654001989, -0.011343273023764292, -0.07996787505187825, 0.06474292258202445, 0.1611853766017685] |
1,803.03606 | A Simple proof of Johnson-Lindenstrauss extension theorem | Johnson and Lindenstrauss proved that any Lipschitz mapping from an $n$-point
subset of a metric space into Hilbert space can be extended to the whole space,
while increasing the Lipschitz constant by a factor of $O(\sqrt{\log n})$. We
present a simplification of their argument that avoids dimension reduction and
the Kirszbraun theorem.
| math.MG math.FA | johnson and lindenstrauss proved that any lipschitz mapping from an npoint subset of a metric space into hilbert space can be extended to the whole space while increasing the lipschitz constant by a factor of osqrtlog n we present a simplification of their argument that avoids dimension reduction and the kirszbraun theorem | [['johnson', 'and', 'lindenstrauss', 'proved', 'that', 'any', 'lipschitz', 'mapping', 'from', 'an', 'npoint', 'subset', 'of', 'a', 'metric', 'space', 'into', 'hilbert', 'space', 'can', 'be', 'extended', 'to', 'the', 'whole', 'space', 'while', 'increasing', 'the', 'lipschitz', 'constant', 'by', 'a', 'factor', 'of', 'osqrtlog', 'n', 'we', 'present', 'a', 'simplification', 'of', 'their', 'argument', 'that', 'avoids', 'dimension', 'reduction', 'and', 'the', 'kirszbraun', 'theorem']] | [-0.12167801478734383, 0.09903131846966481, -0.09288603124262479, 0.05150740396661254, -0.09834662293836188, -0.09575224780620864, 0.10247761928565943, 0.3234243512583467, -0.2988996477439426, -0.22798368510288688, 0.12130105851862866, -0.23001758978129005, -0.14238603753843704, 0.199018401810183, -0.12815709335084718, 0.03369928108384976, 0.05178695998620242, -0.00546670239418745, -0.08449702098285063, -0.3036951809548415, 0.37211610772646964, -0.012851240185017768, 0.1848723909172874, 0.054660735759311, 0.1523242405651567, 0.056549749408776946, -0.06518119899556041, 0.05449193989905045, -0.12627881083132636, 0.13949795321633035, 0.25053874470400983, 0.16220076753345963, 0.3178219677378925, -0.33653250644699884, -0.23668848382882202, 0.1865808487457868, 0.13622379335216606, 0.03464326025613655, 0.019122421248399545, -0.3282275884412229, 0.06747952307789372, -0.09958800843406397, -0.14824692039893797, -0.10801410198641512, 0.07524897195757009, -0.06371844001226307, -0.28784451296982855, -0.0027372186752752615, 0.1767084737165043, 0.008219227033595625, -0.09790807077661157, -0.07660900762018102, -0.051163558973572575, 0.08558999047426578, -0.02917914379101533, 0.1875866630490726, 0.0659427685828772, -0.04542016567519078, -0.07466141837469947, 0.32913631963758516, -0.10948590198061608, -0.24102664373528498, 0.11696206635007492, -0.13317200739402324, -0.12387473632294971, 0.1418949975990332, 0.1274691128458541, 0.09579029781385683, -0.06965069587414081, 0.2539337155153939, -0.08306535716670063, 0.18128626700490713, 0.11914531198831704, 0.039507206417441085, 0.029496654760665618, 0.08540568533890809, 0.168746393798546, 0.1447474006361937, 0.015470331266092567, -0.024704616194447644, -0.33832655635734016, -0.20619045221022902, -0.2175687335145015, 0.122913310993821, -0.21657893049044874, -0.1708268799747412, 0.3082272920202321, 0.04683752812875005, 0.21851327042811766, 0.129819135611447, 0.2511459280638239, 0.11072430630715993, 0.07098670713961698, 0.11650056993732086, 0.15503721413775706, 0.10801342201795286, 0.0051938950558766146, -0.15742522176767054, 0.02055631652295303, 0.1992470736687] |
1,803.03607 | On Generation of Adversarial Examples using Convex Programming | It has been observed that deep learning architectures tend to make erroneous
decisions with high reliability for particularly designed adversarial
instances. In this work, we show that the perturbation analysis of these
architectures provides a framework for generating adversarial instances by
convex programming which, for classification tasks, is able to recover variants
of existing non-adaptive adversarial methods. The proposed framework can be
used for the design of adversarial noise under various desirable constraints
and different types of networks. Moreover, this framework is capable of
explaining various existing adversarial methods and can be used to derive new
algorithms as well. We make use of these results to obtain novel algorithms.
The experiments show the competitive performance of the obtained solutions, in
terms of fooling ratio, when benchmarked with well-known adversarial methods.
| cs.LG stat.ML | it has been observed that deep learning architectures tend to make erroneous decisions with high reliability for particularly designed adversarial instances in this work we show that the perturbation analysis of these architectures provides a framework for generating adversarial instances by convex programming which for classification tasks is able to recover variants of existing nonadaptive adversarial methods the proposed framework can be used for the design of adversarial noise under various desirable constraints and different types of networks moreover this framework is capable of explaining various existing adversarial methods and can be used to derive new algorithms as well we make use of these results to obtain novel algorithms the experiments show the competitive performance of the obtained solutions in terms of fooling ratio when benchmarked with wellknown adversarial methods | [['it', 'has', 'been', 'observed', 'that', 'deep', 'learning', 'architectures', 'tend', 'to', 'make', 'erroneous', 'decisions', 'with', 'high', 'reliability', 'for', 'particularly', 'designed', 'adversarial', 'instances', 'in', 'this', 'work', 'we', 'show', 'that', 'the', 'perturbation', 'analysis', 'of', 'these', 'architectures', 'provides', 'a', 'framework', 'for', 'generating', 'adversarial', 'instances', 'by', 'convex', 'programming', 'which', 'for', 'classification', 'tasks', 'is', 'able', 'to', 'recover', 'variants', 'of', 'existing', 'nonadaptive', 'adversarial', 'methods', 'the', 'proposed', 'framework', 'can', 'be', 'used', 'for', 'the', 'design', 'of', 'adversarial', 'noise', 'under', 'various', 'desirable', 'constraints', 'and', 'different', 'types', 'of', 'networks', 'moreover', 'this', 'framework', 'is', 'capable', 'of', 'explaining', 'various', 'existing', 'adversarial', 'methods', 'and', 'can', 'be', 'used', 'to', 'derive', 'new', 'algorithms', 'as', 'well', 'we', 'make', 'use', 'of', 'these', 'results', 'to', 'obtain', 'novel', 'algorithms', 'the', 'experiments', 'show', 'the', 'competitive', 'performance', 'of', 'the', 'obtained', 'solutions', 'in', 'terms', 'of', 'fooling', 'ratio', 'when', 'benchmarked', 'with', 'wellknown', 'adversarial', 'methods']] | [-0.03598943984028525, -0.04122705108199555, -0.0668209028430283, 0.11409492375902258, -0.07819294104209314, -0.21204398543430636, 0.009937506785186437, 0.43127622654518255, -0.24248880150620467, -0.35081749151532465, 0.0826888264497169, -0.2101698557380587, -0.2429822452330532, 0.23961879418482288, -0.15695845624431967, 0.16156244243566806, 0.09517723011981266, 0.012704211014967699, -0.06317355394757425, -0.33812349177180573, 0.3174672119140338, 0.04391670394487357, 0.331662385015247, 0.030786612351836922, 0.10219065132909096, -0.06046909994732302, 0.009037179582250806, 0.060285116286608036, -0.09441262212494621, 0.16563030772914106, 0.3466972366835062, 0.21909740079158488, 0.32253674311706654, -0.441097576257128, -0.23143372574391274, 0.10587567340296049, 0.12434759235318499, 0.138760421198542, -0.05483942437881174, -0.3322466599253508, 0.15255297758401587, -0.16218674622583562, -0.017010608583223074, -0.2187320827649763, -0.06284058064293976, 0.038779509884233655, -0.3385200302474774, -0.019140877006933666, 0.083349651518242, -0.01240327598956915, -0.038808355602220845, -0.1515274147144877, 0.05990781771520583, 0.13957878198550763, 0.08086879079659971, 0.009800328937574074, 0.10435862633972787, -0.1395823127303559, -0.206764059406347, 0.3669610729441047, -0.06533618683640201, -0.20784851521826708, 0.22507320080095758, 0.014283129139445148, -0.1734707217126225, 0.09114239038899541, 0.24782075721125763, 0.1539723901758687, -0.15519501626225135, 0.024676470808649004, -0.010295459129310285, 0.13092071740314937, 0.03251143025879103, 0.030411163244683008, 0.12551513871070571, 0.21651428706514148, 0.06595041835725379, 0.18277290120291023, -0.1015388398646162, -0.06273709968663752, -0.20810707058453073, -0.0668205986247183, -0.1494026318899929, -0.023611203030360718, -0.098457927364059, -0.13201053308394667, 0.37443422683729577, 0.2550456697622744, 0.18922515983621663, 0.14295754252771775, 0.37165657582764444, 0.05686738784693612, 0.10447516510836206, 0.1084537592322494, 0.23842758007275944, 0.05360009072957417, 0.08306375996997724, -0.15710428226739168, 0.1283455482361695, 0.009243738794556032] |
1,803.03608 | On The Uplink Throughput of Zero-Forcing in Cell-Free Massive MIMO with
Coarse Quantization | The recently proposed Cell-Free massive MIMO architecture is studied for the
uplink. In contrast to most previous works, joint detection is performed using
global CSI. Therefore, we study strategies for transferring CSI to the CPU
taking into account the fronthaul capacity which limits CSI quantization. Two
strategies for pilot-based CSI acquisition are considered:
estimate-and-quantize and quantize-and-estimate. These are analysed using the
Bussgang decomposition. For a given quantization constraint for the data and
CSI the achievable rate per user with Zero-Forcing is determined. Numerical
results show that quantize-and-estimate (the simpler strategy) is similar to or
better than estimate-and-quantize, especially for 1-bit resolution.
| cs.IT math.IT | the recently proposed cellfree massive mimo architecture is studied for the uplink in contrast to most previous works joint detection is performed using global csi therefore we study strategies for transferring csi to the cpu taking into account the fronthaul capacity which limits csi quantization two strategies for pilotbased csi acquisition are considered estimateandquantize and quantizeandestimate these are analysed using the bussgang decomposition for a given quantization constraint for the data and csi the achievable rate per user with zeroforcing is determined numerical results show that quantizeandestimate the simpler strategy is similar to or better than estimateandquantize especially for 1bit resolution | [['the', 'recently', 'proposed', 'cellfree', 'massive', 'mimo', 'architecture', 'is', 'studied', 'for', 'the', 'uplink', 'in', 'contrast', 'to', 'most', 'previous', 'works', 'joint', 'detection', 'is', 'performed', 'using', 'global', 'csi', 'therefore', 'we', 'study', 'strategies', 'for', 'transferring', 'csi', 'to', 'the', 'cpu', 'taking', 'into', 'account', 'the', 'fronthaul', 'capacity', 'which', 'limits', 'csi', 'quantization', 'two', 'strategies', 'for', 'pilotbased', 'csi', 'acquisition', 'are', 'considered', 'estimateandquantize', 'and', 'quantizeandestimate', 'these', 'are', 'analysed', 'using', 'the', 'bussgang', 'decomposition', 'for', 'a', 'given', 'quantization', 'constraint', 'for', 'the', 'data', 'and', 'csi', 'the', 'achievable', 'rate', 'per', 'user', 'with', 'zeroforcing', 'is', 'determined', 'numerical', 'results', 'show', 'that', 'quantizeandestimate', 'the', 'simpler', 'strategy', 'is', 'similar', 'to', 'or', 'better', 'than', 'estimateandquantize', 'especially', 'for', '1bit', 'resolution']] | [-0.18317184501241163, -0.02164399002189028, -0.015055676845392002, 0.028288889373892668, -0.09363454183054723, -0.2521335005078503, 0.08561857470992915, 0.411420477150949, -0.2123454472964591, -0.28339452786159886, 0.15192145921323524, -0.22780120204750104, -0.11636250119982768, 0.15232520938140445, -0.12298107693048636, 0.054467315407537076, 0.08766834507936362, 0.05828792867298747, -0.09170624051247868, -0.323463622739865, 0.2757090493729434, 0.15323762839525631, 0.4006810717707135, -0.03277739823421406, 0.096439196326117, 0.02111279227550036, -0.058735240836502965, -0.024582878273633337, -0.12988417899302393, 0.07968956149500056, 0.31595070473369713, 0.2051181243780578, 0.22142865616328938, -0.4435219443259166, -0.27189756865545955, 0.04477821227124671, 0.16246700096760214, 0.08185350535720702, -0.08161363138615624, -0.267573867473252, 0.1975804645155278, -0.19634886372104748, 0.07156515354740664, -0.004240257156647972, -0.12165398839573116, -0.028615429069722052, -0.36912911042532665, 0.06626020196210786, -0.007019050016077524, -0.005528042121723141, -0.119184966935997, -0.20747687914360738, 0.014786783312975438, 0.15358747967960523, 0.007852711119525825, -0.04856914498113556, 0.06936345112836469, -0.12242245379374507, -0.08711004037093178, 0.35362440359193026, 0.023038159395038803, -0.2792232675635683, 0.14558025875210417, -0.12325212225970841, -0.11639996758210905, 0.17265528316619164, 0.17802197395910307, 0.09358882438391447, -0.20576289313432483, -0.004903671302899872, 0.01641139462494205, 0.1846122243105597, 0.0778755877627847, 0.12691838251061968, 0.10489544118802573, 0.2611392312731171, 0.09692518120708386, 0.12331196577192198, -0.15500164720453033, -0.14368199530182427, -0.1926234421157038, -0.1421564525262136, -0.20607809536639102, 0.019140250870439503, -0.06544152306381988, 0.005426638183596823, 0.28510843703196836, 0.11280408086850471, 0.10647709520063219, 0.11287169365485958, 0.44216753586589064, 0.1380506799527511, 0.07160638992136978, 0.11160733647759735, 0.2417922207567188, 0.1238690028207127, 0.1212578262250448, -0.225906167695414, 0.03955955884044932, 0.0024414516903805672] |
1,803.03609 | Thermoelectric performance of topological boundary modes | We investigate quantum transport and thermoelectrical properties of a
finite-size Su-Schrieffer-Heeger model, a paradigmatic model for a
one-dimensional topological insulator, which displays topologically protected
edge states. By coupling the model to two fermionic reservoirs at its ends, we
can explore the non-equilibrium dynamics of the system. Investigating the
energy-resolved transmission, the current and the noise, we find that these
observables can be used to detect the topologically non-trivial phase. With
specific parameters and asymmetric reservoir coupling strengths, we show that
we can dissipatively prepare the edge states as stationary states of a
non-equilibrium configuration. In addition, we point out that the edge states
can be exploited to design a refrigerator driven by chemical work or a heat
engine driven by a thermal gradient, respectively. These thermal devices do not
require asymmetric couplings and are topologically protected against
symmetry-preserving perturbations. Their maximum efficiencies significantly
exceed that of a single quantum dot device at comparable coupling strengths.
| cond-mat.stat-mech quant-ph | we investigate quantum transport and thermoelectrical properties of a finitesize suschriefferheeger model a paradigmatic model for a onedimensional topological insulator which displays topologically protected edge states by coupling the model to two fermionic reservoirs at its ends we can explore the nonequilibrium dynamics of the system investigating the energyresolved transmission the current and the noise we find that these observables can be used to detect the topologically nontrivial phase with specific parameters and asymmetric reservoir coupling strengths we show that we can dissipatively prepare the edge states as stationary states of a nonequilibrium configuration in addition we point out that the edge states can be exploited to design a refrigerator driven by chemical work or a heat engine driven by a thermal gradient respectively these thermal devices do not require asymmetric couplings and are topologically protected against symmetrypreserving perturbations their maximum efficiencies significantly exceed that of a single quantum dot device at comparable coupling strengths | [['we', 'investigate', 'quantum', 'transport', 'and', 'thermoelectrical', 'properties', 'of', 'a', 'finitesize', 'suschriefferheeger', 'model', 'a', 'paradigmatic', 'model', 'for', 'a', 'onedimensional', 'topological', 'insulator', 'which', 'displays', 'topologically', 'protected', 'edge', 'states', 'by', 'coupling', 'the', 'model', 'to', 'two', 'fermionic', 'reservoirs', 'at', 'its', 'ends', 'we', 'can', 'explore', 'the', 'nonequilibrium', 'dynamics', 'of', 'the', 'system', 'investigating', 'the', 'energyresolved', 'transmission', 'the', 'current', 'and', 'the', 'noise', 'we', 'find', 'that', 'these', 'observables', 'can', 'be', 'used', 'to', 'detect', 'the', 'topologically', 'nontrivial', 'phase', 'with', 'specific', 'parameters', 'and', 'asymmetric', 'reservoir', 'coupling', 'strengths', 'we', 'show', 'that', 'we', 'can', 'dissipatively', 'prepare', 'the', 'edge', 'states', 'as', 'stationary', 'states', 'of', 'a', 'nonequilibrium', 'configuration', 'in', 'addition', 'we', 'point', 'out', 'that', 'the', 'edge', 'states', 'can', 'be', 'exploited', 'to', 'design', 'a', 'refrigerator', 'driven', 'by', 'chemical', 'work', 'or', 'a', 'heat', 'engine', 'driven', 'by', 'a', 'thermal', 'gradient', 'respectively', 'these', 'thermal', 'devices', 'do', 'not', 'require', 'asymmetric', 'couplings', 'and', 'are', 'topologically', 'protected', 'against', 'symmetrypreserving', 'perturbations', 'their', 'maximum', 'efficiencies', 'significantly', 'exceed', 'that', 'of', 'a', 'single', 'quantum', 'dot', 'device', 'at', 'comparable', 'coupling', 'strengths']] | [-0.19518922104579095, 0.23008553476463403, -0.07129576059599077, 0.023420104735921467, -0.012809711322188378, -0.2287561388536086, 0.09336199548035379, 0.38893779826260383, -0.2701258993647512, -0.27772192616135843, 0.04708343164079012, -0.30024133460415947, -0.1281808132020336, 0.17434300959726134, 0.019814852578565478, 0.06010378727111064, 0.03657137241905495, -0.02546705815250114, -0.05991628332844665, -0.15459066034940583, 0.2946227522446744, 0.015206382725568068, 0.29755821754525025, 0.07091602506716886, 0.03274426651637881, -0.06589915359978595, 0.09209236194935418, 0.04277806861866867, -0.12832754325335696, 0.031018128743275038, 0.21696135794411547, -0.03033245116952927, 0.1902546044559248, -0.47696555953833364, -0.24600166733406725, 0.09830122080456931, 0.13230785969269251, 0.16647455232863825, -0.051231377914307576, -0.308523638615565, 0.047437697393639434, -0.19712291808137972, -0.12139681033149827, -0.1289329628839398, -0.03777903087076641, -0.019336770380276345, -0.23170669566869975, 0.0689166797865783, 0.05258527435362339, -0.005538100520929983, -0.013550751253064992, -0.04920205171295111, -0.10769656522259596, 0.1198224286894284, -0.07470688064086942, -0.03565646195183358, 0.21330257647881104, -0.15919576107614464, -0.15500039575140803, 0.33019479951791225, -0.11047536195856669, -0.18931137403743642, 0.2361749788445811, -0.1046035249417107, -0.08395731187455596, 0.08505214953855161, 0.14392021190855772, 0.09605431134301809, -0.15296847011533476, 0.0486444175348527, 0.019468084560526955, 0.1584255812588268, -0.01460577276114735, 0.08938998519367869, 0.2997400068137194, 0.11765964574578609, 0.06059350689287268, 0.21282464893564823, -0.09076059131372359, -0.12878908915445209, -0.27376165320616097, -0.15662103471526456, -0.21673553867205497, 0.098323986572758, -0.039246148853037024, -0.17193129573678298, 0.464373441244806, 0.18989155565157548, 0.18395765328539476, -0.023797139359427795, 0.26359747212320084, 0.15695959459915157, 0.05389623788125332, 0.09465316299409154, 0.26571129672830146, 0.11771488614350317, 0.050161219302624946, -0.3036416585887632, 0.042514420499003704, -0.0017781324774747895] |
1,803.0361 | Random Access Schemes in Wireless Systems With Correlated User Activity | Traditional random access schemes are designed based on the aggregate process
of user activation, which is created on the basis of independent activations of
the users. However, in Machine-Type Communications (MTC), some users are likely
to exhibit a high degree of correlation, e.g. because they observe the same
physical phenomenon. This paves the way to devise access schemes that combine
scheduling and random access, which is the topic of this work. The underlying
idea is to schedule highly correlated users in such a way that their
transmissions are less likely to result in a collision. To this end, we propose
two greedy allocation algorithms. Both attempt to maximize the throughput using
only pairwise correlations, but they rely on different assumptions about the
higher-order dependencies. We show that both algorithms achieve higher
throughput compared to the traditional random access schemes, suggesting that
user correlation can be utilized effectively in access protocols for MTC.
| cs.IT math.IT | traditional random access schemes are designed based on the aggregate process of user activation which is created on the basis of independent activations of the users however in machinetype communications mtc some users are likely to exhibit a high degree of correlation eg because they observe the same physical phenomenon this paves the way to devise access schemes that combine scheduling and random access which is the topic of this work the underlying idea is to schedule highly correlated users in such a way that their transmissions are less likely to result in a collision to this end we propose two greedy allocation algorithms both attempt to maximize the throughput using only pairwise correlations but they rely on different assumptions about the higherorder dependencies we show that both algorithms achieve higher throughput compared to the traditional random access schemes suggesting that user correlation can be utilized effectively in access protocols for mtc | [['traditional', 'random', 'access', 'schemes', 'are', 'designed', 'based', 'on', 'the', 'aggregate', 'process', 'of', 'user', 'activation', 'which', 'is', 'created', 'on', 'the', 'basis', 'of', 'independent', 'activations', 'of', 'the', 'users', 'however', 'in', 'machinetype', 'communications', 'mtc', 'some', 'users', 'are', 'likely', 'to', 'exhibit', 'a', 'high', 'degree', 'of', 'correlation', 'eg', 'because', 'they', 'observe', 'the', 'same', 'physical', 'phenomenon', 'this', 'paves', 'the', 'way', 'to', 'devise', 'access', 'schemes', 'that', 'combine', 'scheduling', 'and', 'random', 'access', 'which', 'is', 'the', 'topic', 'of', 'this', 'work', 'the', 'underlying', 'idea', 'is', 'to', 'schedule', 'highly', 'correlated', 'users', 'in', 'such', 'a', 'way', 'that', 'their', 'transmissions', 'are', 'less', 'likely', 'to', 'result', 'in', 'a', 'collision', 'to', 'this', 'end', 'we', 'propose', 'two', 'greedy', 'allocation', 'algorithms', 'both', 'attempt', 'to', 'maximize', 'the', 'throughput', 'using', 'only', 'pairwise', 'correlations', 'but', 'they', 'rely', 'on', 'different', 'assumptions', 'about', 'the', 'higherorder', 'dependencies', 'we', 'show', 'that', 'both', 'algorithms', 'achieve', 'higher', 'throughput', 'compared', 'to', 'the', 'traditional', 'random', 'access', 'schemes', 'suggesting', 'that', 'user', 'correlation', 'can', 'be', 'utilized', 'effectively', 'in', 'access', 'protocols', 'for', 'mtc']] | [-0.18052322741009688, 0.05793875557566552, -0.09974816937220136, 0.0721707377345195, -0.11567269883878332, -0.20942344670000143, 0.11215061515624832, 0.4468731530206768, -0.26940699668883, -0.3002188411467758, 0.053110914225199896, -0.2573344249364087, -0.17198185872525515, 0.1541655180082767, -0.09419824087710463, 0.05967652217460502, 0.03433066132282348, 0.04291118989625063, -0.025020018635826233, -0.3169587427002721, 0.28759517485128816, 0.08791572070702769, 0.36845331315539387, 0.03772090949228426, 0.04024361518799866, 0.009873725571914724, -0.06628272472268068, -0.02179067544516568, -0.05802289525749266, 0.13406899986531293, 0.31283011486429085, 0.1579631137447474, 0.3127756607963851, -0.44568365519425196, -0.22631219553908236, 0.08031074300800499, 0.18938201392484189, 0.0816359616717244, -0.024456833156076947, -0.2301091883472461, 0.13471259031365135, -0.20774029278264175, -0.026543318293988705, -0.06906841602176428, -0.06983155979296977, 0.07397216311763163, -0.33459566589935047, -0.002101019890304949, 0.018069146916451773, 0.01682490455967031, -0.0037727178635721336, -0.0643102170602345, 0.04278947950929011, 0.1682227785242599, 0.022774067126623488, -0.0002377967129608518, 0.118994473020154, -0.10878763026420002, -0.16564724698898653, 0.41149976793186444, 0.027646119687951318, -0.21647412491696932, 0.22855182946506447, -0.07870287788835795, -0.14954602718965984, 0.13033992068774655, 0.25254194990587786, 0.09294794206231784, -0.1764440159681008, -0.02187094635270401, 0.00012687408659411105, 0.16303379016340172, 0.07653079252677823, 0.13819132766710887, 0.15782274227699658, 0.14537400419909605, 0.13085437660437924, 0.0781272705269083, -0.046480255011159134, -0.11198771335368388, -0.19045548578785537, -0.1067435703497674, -0.20828999471728152, 0.02823710543759118, -0.07201874352320278, -0.12865842279432782, 0.36180764678743127, 0.21393802899891803, 0.18486372676776036, 0.08683158533408698, 0.3485611983648452, 0.08842324861478501, 0.11568873456379056, 0.15056223181186637, 0.17444882314674415, 0.04583737884278985, 0.1410454985360909, -0.17392589450556492, 0.1395089794210722, -0.02718428822347625] |
1,803.03611 | The Trade-off between Privacy and Fidelity via Ehrhart Theory | As an increasing amount of data is gathered nowadays and stored in databases
(DBs), the question arises of how to protect the privacy of individual records
in a DB even while providing accurate answers to queries on the DB.
Differential Privacy (DP) has gained acceptance as a framework to quantify
vulnerability of algorithms to privacy breaches. We consider the problem of how
to sanitize an entire DB via a DP mechanism, on which unlimited further
querying is performed. While protecting privacy, it is important that the
sanitized DB still provide accurate responses to queries. The central
contribution of this work is to characterize the amount of information
preserved in an optimal DP DB sanitizing mechanism (DSM). We precisely
characterize the utility-privacy trade-off of mechanisms that sanitize DBs in
the asymptotic regime of large DBs. We study this in an information-theoretic
framework by modeling a generic distribution on the data, and a measure of
fidelity between the histograms of the original and sanitized DBs. We consider
the popular $\mathbb{L}_{1}-$distortion metric that leads to the formulation as
a linear program (LP). This optimization problem is prohibitive in complexity
with the number of constraints growing exponentially in the parameters of the
problem. Leveraging tools from discrete geometry, analytic combinatorics, and
duality theorems of optimization, we fully characterize the optimal solution in
terms of a power series whose coefficients are the number of integer points on
a multidimensional convex polytope studied by Ehrhart in 1967. Employing
Ehrhart theory, we determine a simple closed form computable expression for the
asymptotic growth of the optimal privacy-fidelity trade-off to infinite
precision. At the heart of the findings is a deep connection between the
minimum expected distortion and the Ehrhart series of an integral convex
polytope.
| cs.IT math.IT | as an increasing amount of data is gathered nowadays and stored in databases dbs the question arises of how to protect the privacy of individual records in a db even while providing accurate answers to queries on the db differential privacy dp has gained acceptance as a framework to quantify vulnerability of algorithms to privacy breaches we consider the problem of how to sanitize an entire db via a dp mechanism on which unlimited further querying is performed while protecting privacy it is important that the sanitized db still provide accurate responses to queries the central contribution of this work is to characterize the amount of information preserved in an optimal dp db sanitizing mechanism dsm we precisely characterize the utilityprivacy tradeoff of mechanisms that sanitize dbs in the asymptotic regime of large dbs we study this in an informationtheoretic framework by modeling a generic distribution on the data and a measure of fidelity between the histograms of the original and sanitized dbs we consider the popular mathbbl_1distortion metric that leads to the formulation as a linear program lp this optimization problem is prohibitive in complexity with the number of constraints growing exponentially in the parameters of the problem leveraging tools from discrete geometry analytic combinatorics and duality theorems of optimization we fully characterize the optimal solution in terms of a power series whose coefficients are the number of integer points on a multidimensional convex polytope studied by ehrhart in 1967 employing ehrhart theory we determine a simple closed form computable expression for the asymptotic growth of the optimal privacyfidelity tradeoff to infinite precision at the heart of the findings is a deep connection between the minimum expected distortion and the ehrhart series of an integral convex polytope | [['as', 'an', 'increasing', 'amount', 'of', 'data', 'is', 'gathered', 'nowadays', 'and', 'stored', 'in', 'databases', 'dbs', 'the', 'question', 'arises', 'of', 'how', 'to', 'protect', 'the', 'privacy', 'of', 'individual', 'records', 'in', 'a', 'db', 'even', 'while', 'providing', 'accurate', 'answers', 'to', 'queries', 'on', 'the', 'db', 'differential', 'privacy', 'dp', 'has', 'gained', 'acceptance', 'as', 'a', 'framework', 'to', 'quantify', 'vulnerability', 'of', 'algorithms', 'to', 'privacy', 'breaches', 'we', 'consider', 'the', 'problem', 'of', 'how', 'to', 'sanitize', 'an', 'entire', 'db', 'via', 'a', 'dp', 'mechanism', 'on', 'which', 'unlimited', 'further', 'querying', 'is', 'performed', 'while', 'protecting', 'privacy', 'it', 'is', 'important', 'that', 'the', 'sanitized', 'db', 'still', 'provide', 'accurate', 'responses', 'to', 'queries', 'the', 'central', 'contribution', 'of', 'this', 'work', 'is', 'to', 'characterize', 'the', 'amount', 'of', 'information', 'preserved', 'in', 'an', 'optimal', 'dp', 'db', 'sanitizing', 'mechanism', 'dsm', 'we', 'precisely', 'characterize', 'the', 'utilityprivacy', 'tradeoff', 'of', 'mechanisms', 'that', 'sanitize', 'dbs', 'in', 'the', 'asymptotic', 'regime', 'of', 'large', 'dbs', 'we', 'study', 'this', 'in', 'an', 'informationtheoretic', 'framework', 'by', 'modeling', 'a', 'generic', 'distribution', 'on', 'the', 'data', 'and', 'a', 'measure', 'of', 'fidelity', 'between', 'the', 'histograms', 'of', 'the', 'original', 'and', 'sanitized', 'dbs', 'we', 'consider', 'the', 'popular', 'mathbbl_1distortion', 'metric', 'that', 'leads', 'to', 'the', 'formulation', 'as', 'a', 'linear', 'program', 'lp', 'this', 'optimization', 'problem', 'is', 'prohibitive', 'in', 'complexity', 'with', 'the', 'number', 'of', 'constraints', 'growing', 'exponentially', 'in', 'the', 'parameters', 'of', 'the', 'problem', 'leveraging', 'tools', 'from', 'discrete', 'geometry', 'analytic', 'combinatorics', 'and', 'duality', 'theorems', 'of', 'optimization', 'we', 'fully', 'characterize', 'the', 'optimal', 'solution', 'in', 'terms', 'of', 'a', 'power', 'series', 'whose', 'coefficients', 'are', 'the', 'number', 'of', 'integer', 'points', 'on', 'a', 'multidimensional', 'convex', 'polytope', 'studied', 'by', 'ehrhart', 'in', '1967', 'employing', 'ehrhart', 'theory', 'we', 'determine', 'a', 'simple', 'closed', 'form', 'computable', 'expression', 'for', 'the', 'asymptotic', 'growth', 'of', 'the', 'optimal', 'privacyfidelity', 'tradeoff', 'to', 'infinite', 'precision', 'at', 'the', 'heart', 'of', 'the', 'findings', 'is', 'a', 'deep', 'connection', 'between', 'the', 'minimum', 'expected', 'distortion', 'and', 'the', 'ehrhart', 'series', 'of', 'an', 'integral', 'convex', 'polytope']] | [-0.13679392688249895, 0.0040418157658569836, -0.07793659662870182, 0.10723640027063593, -0.0652109064533004, -0.13314500818732422, 0.1281179234330946, 0.3262208202361069, -0.34106669625286923, -0.3035710595183439, 0.11521236662845732, -0.295404986256955, -0.15615728663417375, 0.17847551609731607, -0.14624130169020874, 0.08253406507770654, 0.03299629815831338, 0.03709719142759743, -0.0478802894802204, -0.2744533368581711, 0.2971854725619778, 0.08505613320754186, 0.2990743630871802, 0.05648900847556395, 0.1037161750026972, 0.029246341700867547, -0.02221960895222618, 0.016016256186494056, -0.14446392334291733, 0.17532514677777028, 0.3075056377150301, 0.19763192130168053, 0.3108893104916816, -0.4047591717314574, -0.15624561332495088, 0.10601549031590665, 0.13438842845698037, 0.09173304334378939, -0.05242166642838001, -0.23732889480107314, 0.10551704029134194, -0.13988540401695282, -0.08865067352690584, -0.07594470346958695, 0.019284383890420927, -0.019068986061436182, -0.30284387884918806, 0.042514999355580264, 0.05886194230158247, 0.0769930256211518, -0.048309373265536096, -0.07033483681132223, -0.0033090361157901114, 0.133509389459403, 0.03909252513398683, 0.02130337872980423, 0.07948463680418012, -0.12457880349377971, -0.14175204552752388, 0.3561399514091664, -0.01956826786044985, -0.20989748795673094, 0.12007095658064044, -0.11688107002682828, -0.10187566377771237, 0.1367405660147616, 0.22093394670352157, 0.12419122449688978, -0.1692957896902063, 0.10081970376810026, -0.05876121070997959, 0.1661875996937311, 0.07066579323613664, 0.06782061891333963, 0.15239001339842026, 0.16985983534783639, 0.08813048216638032, 0.17696854364822157, -0.04660497189839729, -0.10485933790751896, -0.24751442127984824, -0.13900173658664236, -0.18710626142548878, 0.04868822254181898, -0.1146006352148386, -0.15249028008787768, 0.3532003531830021, 0.1344489216066936, 0.20372223075954699, 0.07670863065583683, 0.32165619107679677, 0.11451338140161259, 0.03582217239052663, 0.0821388267417002, 0.18322771419429096, 0.10528497578221263, 0.09540229416094147, -0.21032142249372351, 0.0943201288672073, 0.05324423316397242] |
1,803.03612 | Supersymmetric integrable theories from no particle production | We consider a theory of scalar superfields in two dimensions with arbitrary
superpotential. By imposing no particle production in tree level scattering, we
constrain the form of the admissible interactions, recovering a supersymmetric
extension of the sinh-Gordon model.
| hep-th | we consider a theory of scalar superfields in two dimensions with arbitrary superpotential by imposing no particle production in tree level scattering we constrain the form of the admissible interactions recovering a supersymmetric extension of the sinhgordon model | [['we', 'consider', 'a', 'theory', 'of', 'scalar', 'superfields', 'in', 'two', 'dimensions', 'with', 'arbitrary', 'superpotential', 'by', 'imposing', 'no', 'particle', 'production', 'in', 'tree', 'level', 'scattering', 'we', 'constrain', 'the', 'form', 'of', 'the', 'admissible', 'interactions', 'recovering', 'a', 'supersymmetric', 'extension', 'of', 'the', 'sinhgordon', 'model']] | [-0.1399175257875437, 0.2013300689378459, -0.03240724393981509, 0.1274993786784379, -0.07499779140772789, -0.17322337860241532, -0.026745474937151334, 0.2658648704129614, -0.1683385252805525, -0.2895121488131975, 0.03737642814552313, -0.2806372563109586, -0.1443085985527815, 0.025154382195691334, 0.04096976913340194, 0.04013389339180369, 0.012906331624100474, 0.06475930507785004, -0.06065030283245601, -0.2247096309499619, 0.3728846825512224, -0.04442094151837457, 0.15576940216124058, 0.06221227070962318, 0.14329350364737606, 0.10401097600544362, -0.029762296219000985, -0.04794793593158063, -0.10913820521857001, 0.1469757397610106, 0.19233371140925506, 0.07436937279999256, 0.08993918546720554, -0.43375354130311233, -0.24871930653400914, 0.199683942194832, 0.16907536775167836, 0.1240482330689893, -0.04821335830676712, -0.2611372474777071, 0.02775210720765723, -0.20890221438419662, -0.19179307469656984, -0.03500988178788439, -0.04884787371970321, -0.09896426559670975, -0.3313442154199277, 0.07650994014387068, -0.01803290000871608, 0.03950762112110265, -0.10030275460112055, -0.06793917724740152, -0.07971996769897248, -0.017463074678457098, 0.08535350619594713, -0.0020665693499674824, 0.11851014326767702, -0.24684922107936522, -0.16637861741228813, 0.38087265389530284, -0.130223894455029, -0.32557381093992216, 0.11860120230305352, -0.13952372629979723, -0.1906505597167109, 0.09018939005603131, 0.15230698751187638, 0.11392648741112728, -0.17978540702575915, 0.29067385598625006, -0.05003797284964668, 0.12669245379756353, 0.15995525524608398, -0.00660179938973957, 0.21232120859387674, 0.16863264094449973, 0.025002113862061186, 0.14667326334471764, -0.0010973131161575254, -0.12969141840738685, -0.44004045524879504, -0.13040333532875306, -0.08344319695300471, 0.061365811840484015, -0.15746316803913368, -0.1651755187072252, 0.4248763276938055, 0.14764960840540498, 0.21457931595413307, 0.10391914851865486, 0.21942757721990347, 0.1482299844807896, 0.05873180239608413, 0.019811027144130907, 0.24201927065702253, 0.16343186350882447, 0.01202305885472972, -0.2125368715558005, -0.08577655056050341, 0.16762394107584105] |
1,803.03613 | Detecting Adversarial Examples - A Lesson from Multimedia Forensics | Adversarial classification is the task of performing robust classification in
the presence of a strategic attacker. Originating from information hiding and
multimedia forensics, adversarial classification recently received a lot of
attention in a broader security context. In the domain of machine
learning-based image classification, adversarial classification can be
interpreted as detecting so-called adversarial examples, which are slightly
altered versions of benign images. They are specifically crafted to be
misclassified with a very high probability by the classifier under attack.
Neural networks, which dominate among modern image classifiers, have been shown
to be especially vulnerable to these adversarial examples.
However, detecting subtle changes in digital images has always been the goal
of multimedia forensics and steganalysis. In this paper, we highlight the
parallels between these two fields and secure machine learning.
Furthermore, we adapt a linear filter, similar to early steganalysis methods,
to detect adversarial examples that are generated with the projected gradient
descent (PGD) method, the state-of-the-art algorithm for this task. We test our
method on the MNIST database and show for several parameter combinations of PGD
that our method can reliably detect adversarial examples.
Additionally, the combination of adversarial re-training and our detection
method effectively reduces the attack surface of attacks against neural
networks. Thus, we conclude that adversarial examples for image classification
possibly do not withstand detection methods from steganalysis, and future work
should explore the effectiveness of known techniques from multimedia forensics
in other adversarial settings.
| cs.CR | adversarial classification is the task of performing robust classification in the presence of a strategic attacker originating from information hiding and multimedia forensics adversarial classification recently received a lot of attention in a broader security context in the domain of machine learningbased image classification adversarial classification can be interpreted as detecting socalled adversarial examples which are slightly altered versions of benign images they are specifically crafted to be misclassified with a very high probability by the classifier under attack neural networks which dominate among modern image classifiers have been shown to be especially vulnerable to these adversarial examples however detecting subtle changes in digital images has always been the goal of multimedia forensics and steganalysis in this paper we highlight the parallels between these two fields and secure machine learning furthermore we adapt a linear filter similar to early steganalysis methods to detect adversarial examples that are generated with the projected gradient descent pgd method the stateoftheart algorithm for this task we test our method on the mnist database and show for several parameter combinations of pgd that our method can reliably detect adversarial examples additionally the combination of adversarial retraining and our detection method effectively reduces the attack surface of attacks against neural networks thus we conclude that adversarial examples for image classification possibly do not withstand detection methods from steganalysis and future work should explore the effectiveness of known techniques from multimedia forensics in other adversarial settings | [['adversarial', 'classification', 'is', 'the', 'task', 'of', 'performing', 'robust', 'classification', 'in', 'the', 'presence', 'of', 'a', 'strategic', 'attacker', 'originating', 'from', 'information', 'hiding', 'and', 'multimedia', 'forensics', 'adversarial', 'classification', 'recently', 'received', 'a', 'lot', 'of', 'attention', 'in', 'a', 'broader', 'security', 'context', 'in', 'the', 'domain', 'of', 'machine', 'learningbased', 'image', 'classification', 'adversarial', 'classification', 'can', 'be', 'interpreted', 'as', 'detecting', 'socalled', 'adversarial', 'examples', 'which', 'are', 'slightly', 'altered', 'versions', 'of', 'benign', 'images', 'they', 'are', 'specifically', 'crafted', 'to', 'be', 'misclassified', 'with', 'a', 'very', 'high', 'probability', 'by', 'the', 'classifier', 'under', 'attack', 'neural', 'networks', 'which', 'dominate', 'among', 'modern', 'image', 'classifiers', 'have', 'been', 'shown', 'to', 'be', 'especially', 'vulnerable', 'to', 'these', 'adversarial', 'examples', 'however', 'detecting', 'subtle', 'changes', 'in', 'digital', 'images', 'has', 'always', 'been', 'the', 'goal', 'of', 'multimedia', 'forensics', 'and', 'steganalysis', 'in', 'this', 'paper', 'we', 'highlight', 'the', 'parallels', 'between', 'these', 'two', 'fields', 'and', 'secure', 'machine', 'learning', 'furthermore', 'we', 'adapt', 'a', 'linear', 'filter', 'similar', 'to', 'early', 'steganalysis', 'methods', 'to', 'detect', 'adversarial', 'examples', 'that', 'are', 'generated', 'with', 'the', 'projected', 'gradient', 'descent', 'pgd', 'method', 'the', 'stateoftheart', 'algorithm', 'for', 'this', 'task', 'we', 'test', 'our', 'method', 'on', 'the', 'mnist', 'database', 'and', 'show', 'for', 'several', 'parameter', 'combinations', 'of', 'pgd', 'that', 'our', 'method', 'can', 'reliably', 'detect', 'adversarial', 'examples', 'additionally', 'the', 'combination', 'of', 'adversarial', 'retraining', 'and', 'our', 'detection', 'method', 'effectively', 'reduces', 'the', 'attack', 'surface', 'of', 'attacks', 'against', 'neural', 'networks', 'thus', 'we', 'conclude', 'that', 'adversarial', 'examples', 'for', 'image', 'classification', 'possibly', 'do', 'not', 'withstand', 'detection', 'methods', 'from', 'steganalysis', 'and', 'future', 'work', 'should', 'explore', 'the', 'effectiveness', 'of', 'known', 'techniques', 'from', 'multimedia', 'forensics', 'in', 'other', 'adversarial', 'settings']] | [-0.05336575754275195, -0.03361467462594165, -0.05992819328995024, 0.11146395310913466, -0.08854521460008952, -0.2429190787377623, 0.023372479924390475, 0.44106081004009023, -0.2573047692100342, -0.3473946049080764, 0.10346914536834044, -0.29050987359003855, -0.25132937774560943, 0.2241850680757239, -0.2188438730563766, 0.10223397349151607, 0.0828671570804952, 0.04243311106917062, -0.05084974906713191, -0.35941520113903236, 0.3247466441959914, 0.028388048235763443, 0.3428551250811526, 0.002944283912914988, 0.052236710193203605, -0.06051673979116565, -0.04140841209224452, 0.009630468888325172, -0.011882219776635644, 0.12923087258548618, 0.3690488346263953, 0.22759139421298538, 0.35425061801941404, -0.3892308509310466, -0.2559122449511888, 0.15430850901584447, 0.13722514138273528, 0.18535861372850274, -0.11438213802034339, -0.3983203789149119, 0.16652191635177405, -0.1994794015451159, 0.0305409100451984, -0.17379884414811264, -0.04296028758905766, 0.0036922311064471573, -0.2466899159843702, 0.003205241561403584, 0.10751342425117012, 0.0832633018059165, -0.032783775288849355, -0.07533923909068108, -0.002307891188614133, 0.13930519521976803, 0.07377376027744278, 0.05165301541706243, 0.17375574020910461, -0.20941624913177606, -0.14546612953980528, 0.3247066613960871, -0.02755111422989845, -0.18463653879957156, 0.2048744796814249, 0.030279772353717066, -0.1696114255705747, 0.1101010719462294, 0.2892608318232374, 0.1507501046301867, -0.12930010724033397, -0.011050594944767966, -0.011763251824966908, 0.16330869122949979, 0.07837436583782566, 0.006417696949223127, 0.16168131568945485, 0.19486335384616604, 0.03998251775061423, 0.17189852410228923, -0.17726933358385225, -0.049233564969140525, -0.2020756911922823, -0.07118514803955214, -0.18859192443169873, -0.008751879608836785, -0.06496440325379002, -0.1318713204904019, 0.39925142952774856, 0.25972476550942936, 0.18418969509141153, 0.07110685448963039, 0.39671469955202426, -0.021599970997611226, 0.12625447671985152, 0.09559135823306009, 0.23081473076728728, 0.025791160623001318, 0.08821105540858652, -0.13640358061558921, 0.13055660446061437, 0.018155046787393516] |
1,803.03614 | Divergence-Optimal Fixed-to-Fixed Length Distribution Matching With
Shell Mapping | Distribution matching (DM) transforms independent and Bernoulli(1/2)
distributed bits into a sequence of output symbols with a desired distribution.
A fixed-to-fixed length, invertible DM architecture based on shell mapping is
presented. It is shown that shell mapping for distribution matching (SMDM) is
the optimum DM for the informational divergence metric and that finding energy
optimal sequences is a special case of divergence minimization. Additionally,
it is shown how to find the required shell mapping weight function to
approximate arbitrary output distributions. SMDM is combined with probabilistic
amplitude shaping (PAS) to operate close to the Shannon limit. SMDM exhibits
excellent performance for short blocklengths as required by ultra-reliable
low-latency (URLLC) applications. SMDM outperforms constant composition DM
(CCDM) by 0.6 dB when used with 64-QAM at a spectral efficiency of 3
bits/channel use and a 5G low-density parity-check code with a short
blocklength of 192 bits
| cs.IT math.IT | distribution matching dm transforms independent and bernoulli12 distributed bits into a sequence of output symbols with a desired distribution a fixedtofixed length invertible dm architecture based on shell mapping is presented it is shown that shell mapping for distribution matching smdm is the optimum dm for the informational divergence metric and that finding energy optimal sequences is a special case of divergence minimization additionally it is shown how to find the required shell mapping weight function to approximate arbitrary output distributions smdm is combined with probabilistic amplitude shaping pas to operate close to the shannon limit smdm exhibits excellent performance for short blocklengths as required by ultrareliable lowlatency urllc applications smdm outperforms constant composition dm ccdm by 06 db when used with 64qam at a spectral efficiency of 3 bitschannel use and a 5g lowdensity paritycheck code with a short blocklength of 192 bits | [['distribution', 'matching', 'dm', 'transforms', 'independent', 'and', 'bernoulli12', 'distributed', 'bits', 'into', 'a', 'sequence', 'of', 'output', 'symbols', 'with', 'a', 'desired', 'distribution', 'a', 'fixedtofixed', 'length', 'invertible', 'dm', 'architecture', 'based', 'on', 'shell', 'mapping', 'is', 'presented', 'it', 'is', 'shown', 'that', 'shell', 'mapping', 'for', 'distribution', 'matching', 'smdm', 'is', 'the', 'optimum', 'dm', 'for', 'the', 'informational', 'divergence', 'metric', 'and', 'that', 'finding', 'energy', 'optimal', 'sequences', 'is', 'a', 'special', 'case', 'of', 'divergence', 'minimization', 'additionally', 'it', 'is', 'shown', 'how', 'to', 'find', 'the', 'required', 'shell', 'mapping', 'weight', 'function', 'to', 'approximate', 'arbitrary', 'output', 'distributions', 'smdm', 'is', 'combined', 'with', 'probabilistic', 'amplitude', 'shaping', 'pas', 'to', 'operate', 'close', 'to', 'the', 'shannon', 'limit', 'smdm', 'exhibits', 'excellent', 'performance', 'for', 'short', 'blocklengths', 'as', 'required', 'by', 'ultrareliable', 'lowlatency', 'urllc', 'applications', 'smdm', 'outperforms', 'constant', 'composition', 'dm', 'ccdm', 'by', '06', 'db', 'when', 'used', 'with', '64qam', 'at', 'a', 'spectral', 'efficiency', 'of', '3', 'bitschannel', 'use', 'and', 'a', '5g', 'lowdensity', 'paritycheck', 'code', 'with', 'a', 'short', 'blocklength', 'of', '192', 'bits']] | [-0.16537702058202638, 0.08172581092448025, -0.06284956678670521, 0.11359208377527669, -0.044884071187374905, -0.21319533768433352, 0.06846390447349728, 0.3947326744027022, -0.2578289333291145, -0.29213204393292674, 0.06753428900426822, -0.24762451808944913, -0.10720331008067457, 0.1730080892318963, -0.0784286575734667, 0.10257083846712096, 0.057241931670836896, 0.033282138898761734, -0.08442453697216479, -0.2462476536942025, 0.25232954753300874, 0.14095709525928315, 0.3146068762095335, -0.015497537717844049, 0.11954298561451854, 0.0320106797180415, 0.005063388306654006, -0.08843444048478785, -0.1173381448709026, 0.09220744495946241, 0.2843924664711166, 0.1566721564728242, 0.21250881062911098, -0.3317743548985972, -0.2223014087131661, 0.10316709358691394, 0.1696724518098765, 0.04542856305165009, -0.057824225586147, -0.21432627904222398, 0.1484888194439312, -0.20066381414249512, -0.041874914766392775, 0.009812010565332862, 0.029618914015979197, 0.07778445664896733, -0.36145856900192386, 0.03583779468317516, 0.03759823431270585, -0.013608767641320204, -0.004390705000130563, -0.12930266762204054, 0.03357619988512144, 0.09527098086679568, -0.016136553701168548, 0.08829953620766497, 0.12672332438928102, -0.08984850918123913, -0.040363615055361554, 0.34703394051434266, -0.09562031963448842, -0.19257951912327875, 0.11152488555591036, -0.05984381049509264, -0.08175670295248791, 0.16903920077553872, 0.14476063730479735, 0.0600388987773436, -0.11182959672017508, 0.08984054446894636, -0.011513282764806516, 0.26778112147520816, 0.12638524732351974, 0.10189849205764606, 0.20098068960937276, 0.15573955378204118, 0.09780361458413406, 0.14536530043470622, -0.09264625793366577, -0.08873342033863689, -0.26687734166625887, -0.12085176862355082, -0.22389051706866464, 0.021874473601605535, -0.14132499323881753, -0.1441093001661405, 0.32455370992344496, 0.10903939302887819, 0.15836510198358963, 0.1487779526699645, 0.32232104977528153, 0.10230309643359053, 0.06457804533015911, 0.1636056300614857, 0.16204897113049002, 0.15916459633525745, 0.06487041639815692, -0.18066767413013926, 0.05772276000162593, 0.041267539594425924] |
1,803.03615 | Ho\v{r}ava-Lifshitz cosmology in light of new data | We present new observational constraints on Lorentz violating
Ho\v{r}ava-Lifshitz cosmological scenarios using an updated cosmological data
set from Cosmic Microwave Background (Planck CMB), expansion rates of
elliptical and lenticular galaxies, JLA compilation (Joint Light-Curve
Analysis) data for Type Ia supernovae (SneIa), Baryon Acoustic Oscillations
(BAO) and priors on the Hubble parameter with an alternative parametrisation of
the equations. Unlike in other approaches we consider the curvature parameter
$\Omega_k$ as a free parameter in the analysis we considered the parameters
$\Omega_k$ and $\Delta N_\nu$ as completely free, which helped to place new,
updated bounds on several of the theory parameters. Remarkably, the detailed
balance scenario exhibits positive spatial curvature to more than 3$\sigma$,
whereas for further theory generalizations we found evidence for positive
spatial curvature at 1$\sigma$. This could create circumstantial evidence from
observations and could be used to single out distinct formulations and
scenarios.
| gr-qc astro-ph.CO hep-th | we present new observational constraints on lorentz violating hovravalifshitz cosmological scenarios using an updated cosmological data set from cosmic microwave background planck cmb expansion rates of elliptical and lenticular galaxies jla compilation joint lightcurve analysis data for type ia supernovae sneia baryon acoustic oscillations bao and priors on the hubble parameter with an alternative parametrisation of the equations unlike in other approaches we consider the curvature parameter omega_k as a free parameter in the analysis we considered the parameters omega_k and delta n_nu as completely free which helped to place new updated bounds on several of the theory parameters remarkably the detailed balance scenario exhibits positive spatial curvature to more than 3sigma whereas for further theory generalizations we found evidence for positive spatial curvature at 1sigma this could create circumstantial evidence from observations and could be used to single out distinct formulations and scenarios | [['we', 'present', 'new', 'observational', 'constraints', 'on', 'lorentz', 'violating', 'hovravalifshitz', 'cosmological', 'scenarios', 'using', 'an', 'updated', 'cosmological', 'data', 'set', 'from', 'cosmic', 'microwave', 'background', 'planck', 'cmb', 'expansion', 'rates', 'of', 'elliptical', 'and', 'lenticular', 'galaxies', 'jla', 'compilation', 'joint', 'lightcurve', 'analysis', 'data', 'for', 'type', 'ia', 'supernovae', 'sneia', 'baryon', 'acoustic', 'oscillations', 'bao', 'and', 'priors', 'on', 'the', 'hubble', 'parameter', 'with', 'an', 'alternative', 'parametrisation', 'of', 'the', 'equations', 'unlike', 'in', 'other', 'approaches', 'we', 'consider', 'the', 'curvature', 'parameter', 'omega_k', 'as', 'a', 'free', 'parameter', 'in', 'the', 'analysis', 'we', 'considered', 'the', 'parameters', 'omega_k', 'and', 'delta', 'n_nu', 'as', 'completely', 'free', 'which', 'helped', 'to', 'place', 'new', 'updated', 'bounds', 'on', 'several', 'of', 'the', 'theory', 'parameters', 'remarkably', 'the', 'detailed', 'balance', 'scenario', 'exhibits', 'positive', 'spatial', 'curvature', 'to', 'more', 'than', '3sigma', 'whereas', 'for', 'further', 'theory', 'generalizations', 'we', 'found', 'evidence', 'for', 'positive', 'spatial', 'curvature', 'at', '1sigma', 'this', 'could', 'create', 'circumstantial', 'evidence', 'from', 'observations', 'and', 'could', 'be', 'used', 'to', 'single', 'out', 'distinct', 'formulations', 'and', 'scenarios']] | [-0.0988140351797079, 0.09653032786950967, -0.07940876968657701, 0.12744566838551286, -0.1817464333273367, -0.16456918161970358, 0.05554375207349141, 0.33044392076165724, -0.18941217662197435, -0.30714977669089827, 0.04843174400351321, -0.3097079148380241, -0.03567840262419648, 0.23712777774522287, 0.0009142959881197991, 0.007895667811630524, 0.039144070312937, -0.04515369039856725, -0.08333338331754526, -0.2554396352950587, 0.3042942442003146, 0.11317096351356465, 0.25159937890687917, -0.04101938406367683, 0.06541866857474411, -0.11355573478633435, -0.11625753896563158, 0.020303224240099855, -0.27788106539578117, 0.025346215725423664, 0.19142500422862618, 0.19473818123191855, 0.17812437438018, -0.40236760300952784, -0.28604533972813645, 0.15797693282042424, 0.19116744679114264, 0.127033795412798, -0.04114310428334041, -0.30826950202754233, -0.007531538895111428, -0.14413122417883845, -0.10383578606868266, -0.049070458049148634, -0.023853026912547648, -0.073042338735023, -0.28635065402745064, 0.19990838635324812, -0.021708867208669998, 0.031238511376108766, -0.1277744901017286, -0.137449474348816, -0.020393797663726017, 6.316567628851367e-05, 0.07825150075708127, 0.016941740761265263, 0.07814060969394632, -0.08632752325663912, -0.05934597119145716, 0.37733092912498656, -0.10911586475301899, -0.12657334428190048, 0.1334976536826515, -0.14451773155532363, -0.2127650103098454, 0.023852021966983255, 0.17131533607607707, 0.04029168484137497, -0.15647799947894075, 0.09394908733075782, 0.0482444997146053, 0.21600879484968674, 0.06932404100694435, 0.03106720871680106, 0.2722556005141491, 0.10159953536802074, 0.08834631726697101, 0.02449268148443985, -0.14699808298448463, -0.016235991057732865, -0.36142219026805833, -0.043433912598023504, -0.13295373895541868, 0.09153545354881014, -0.22085777955312047, -0.14382120672558407, 0.35542564134165233, 0.11988390034983037, 0.21524102051949334, 0.06263765165042262, 0.3194268243904743, 0.029356808612748055, 0.0590199557158889, 0.04126973818832388, 0.30274931499217117, 0.12481385241618329, 0.09304249575426285, -0.1927518761529225, 0.027622018492871173, 0.01723043441597838] |
1,803.03616 | A Dynamic Jamming Game for Real-Time Status Updates | We study timely status updates of a real-time system in an adversarial
setting. The system samples a physical process, and sends the samples from the
source (e.g., a sensor) to the destination (e.g, a control center) through a
channel. For real-time monitoring/control tasks, it is crucial for the system
to update the status of the physical process "timely". We measure the
timeliness of status updates by the time elapsed since the latest update at the
destination was generated at the source, and define the time elapsed as age of
information, or age in short. To sabotage the system, an attacker aims to
maximize the age by jamming the channel and hence causing delay in status
updates. The system aims to minimize the age by judiciously choosing when to
sample and send the updates. We model the ongoing repeated interaction between
the attacker and the system as a dynamic game. In each stage game, the attacker
chooses the jamming time according to the jamming time distribution, and the
system responds by delaying the sampling according to the sampling policy. We
prove that there exists a unique stationary equilibrium in the game, and
provide a complete analytical characterization of the equilibrium. Our results
shed lights on how the attacker sabotages the system and how the system should
defend against the attacker.
| cs.IT math.IT | we study timely status updates of a realtime system in an adversarial setting the system samples a physical process and sends the samples from the source eg a sensor to the destination eg a control center through a channel for realtime monitoringcontrol tasks it is crucial for the system to update the status of the physical process timely we measure the timeliness of status updates by the time elapsed since the latest update at the destination was generated at the source and define the time elapsed as age of information or age in short to sabotage the system an attacker aims to maximize the age by jamming the channel and hence causing delay in status updates the system aims to minimize the age by judiciously choosing when to sample and send the updates we model the ongoing repeated interaction between the attacker and the system as a dynamic game in each stage game the attacker chooses the jamming time according to the jamming time distribution and the system responds by delaying the sampling according to the sampling policy we prove that there exists a unique stationary equilibrium in the game and provide a complete analytical characterization of the equilibrium our results shed lights on how the attacker sabotages the system and how the system should defend against the attacker | [['we', 'study', 'timely', 'status', 'updates', 'of', 'a', 'realtime', 'system', 'in', 'an', 'adversarial', 'setting', 'the', 'system', 'samples', 'a', 'physical', 'process', 'and', 'sends', 'the', 'samples', 'from', 'the', 'source', 'eg', 'a', 'sensor', 'to', 'the', 'destination', 'eg', 'a', 'control', 'center', 'through', 'a', 'channel', 'for', 'realtime', 'monitoringcontrol', 'tasks', 'it', 'is', 'crucial', 'for', 'the', 'system', 'to', 'update', 'the', 'status', 'of', 'the', 'physical', 'process', 'timely', 'we', 'measure', 'the', 'timeliness', 'of', 'status', 'updates', 'by', 'the', 'time', 'elapsed', 'since', 'the', 'latest', 'update', 'at', 'the', 'destination', 'was', 'generated', 'at', 'the', 'source', 'and', 'define', 'the', 'time', 'elapsed', 'as', 'age', 'of', 'information', 'or', 'age', 'in', 'short', 'to', 'sabotage', 'the', 'system', 'an', 'attacker', 'aims', 'to', 'maximize', 'the', 'age', 'by', 'jamming', 'the', 'channel', 'and', 'hence', 'causing', 'delay', 'in', 'status', 'updates', 'the', 'system', 'aims', 'to', 'minimize', 'the', 'age', 'by', 'judiciously', 'choosing', 'when', 'to', 'sample', 'and', 'send', 'the', 'updates', 'we', 'model', 'the', 'ongoing', 'repeated', 'interaction', 'between', 'the', 'attacker', 'and', 'the', 'system', 'as', 'a', 'dynamic', 'game', 'in', 'each', 'stage', 'game', 'the', 'attacker', 'chooses', 'the', 'jamming', 'time', 'according', 'to', 'the', 'jamming', 'time', 'distribution', 'and', 'the', 'system', 'responds', 'by', 'delaying', 'the', 'sampling', 'according', 'to', 'the', 'sampling', 'policy', 'we', 'prove', 'that', 'there', 'exists', 'a', 'unique', 'stationary', 'equilibrium', 'in', 'the', 'game', 'and', 'provide', 'a', 'complete', 'analytical', 'characterization', 'of', 'the', 'equilibrium', 'our', 'results', 'shed', 'lights', 'on', 'how', 'the', 'attacker', 'sabotages', 'the', 'system', 'and', 'how', 'the', 'system', 'should', 'defend', 'against', 'the', 'attacker']] | [-0.14897907738907074, 0.06886137734338697, -0.12342565517377006, 0.03445983822615361, -0.06365850167519865, -0.19324469747055972, 0.18037708997384672, 0.3690650468743449, -0.30458121493655266, -0.30809416517683674, 0.14791152035147848, -0.29585753033715173, -0.1122608280905155, 0.0979416724956603, -0.12120121732378729, 0.05845778381639938, 0.05283538237590035, 0.09832114183011255, 0.009763410723973236, -0.2583517065173476, 0.3087120666232712, 0.1176417761401128, 0.24626012385284546, 0.01209807176775205, 0.12048224799512296, 0.05536517457194934, -0.038119988810215485, -0.037141202320518305, -0.10295337821008374, 0.0037770506353416574, 0.2480997629968317, 0.21677777131511017, 0.3274619401936684, -0.43165731577425226, -0.16736721630590548, 0.11118023318383809, 0.1055231553297052, 0.10550437659802718, -0.03476992438476823, -0.3130121561912222, 0.09675316468368225, -0.1883250278027711, -0.08844202950408836, 0.011097365364415246, 0.009778987133550809, 0.03889087536970341, -0.28908098820803063, -0.01648995767501311, 0.0077466108663212675, 0.02579913717916731, -0.08608288990564371, -0.03908706636225737, -0.008229936453847026, 0.2359781679212716, 0.03245616239925992, 0.05363088258736502, 0.18297469303216957, -0.14111065803044434, -0.11801581015733473, 0.35658063363591463, -0.03374112877618829, -0.14258186999332467, 0.16494682118207976, -0.07467979371895878, -0.07334443398136133, 0.1106097597560478, 0.22257332536690963, 0.08295978779622584, -0.19018020875755443, -0.0028414872812466065, 0.009138657164614681, 0.20210807721681653, -0.006161373326503629, 0.025712673511749152, 0.2033071804646437, 0.1940439662868328, 0.12241554107739154, 0.13378518372410994, -0.07132512861926861, -0.11703620592576511, -0.27872510302658066, -0.14175193314654155, -0.17969242746753772, 0.0250229513830155, -0.07283700621791543, -0.0803215658941537, 0.40163760772402135, 0.22171162678475637, 0.1945110980886966, 0.06388081295774617, 0.361080974101734, 0.060484324846258646, 0.010565690248200687, 0.10917276788050087, 0.19511780566792217, 0.049521854503770196, 0.16858577490741505, -0.25745239097105954, 0.18465234724369003, 0.011955686065223101] |
1,803.03617 | Evidence for cascaded third harmonic generation in non-centrosymmetric
gold nanoantennas | The optimization of nonlinear optical processes at the nanoscale is a crucial
step for the development of nanoscale photon sources for quantum-optical
networks. The development of innovative plasmonic nanoantenna designs and
hybrid nanostructures to enhance optical nonlinearities in very small volumes
represents one of the most promising routes. In such systems, the upconversion
of photons can be achieved with high efficiencies via third-order processes,
such as third harmonic generation (THG), thanks to the resonantly-enhanced
volume currents. Conversely, second-order processes, such as second harmonic
generation (SHG), are often inhibited by the symmetry of metal lattices and of
common nanoantenna geometries. SHG and THG processes in plasmonic
nanostructures are generally treated independently, since they both represent a
small perturbation in the light-matter interaction mechanisms. In this work, we
demonstrate that this paradigm does not hold in general, by providing evidence
of a cascaded process in THG, which is fueled by SHG and sizably contributes to
the overall yield. We address this mechanism by unveiling an anomalous
fingerprint in the polarization state of the nonlinear emission from
non-centrosymmetric gold nanoantennas and point out that such cascaded
processes may also appear for structures that exhibit only moderate SHG yields
- signifying its general relevance in plasmon-enhanced nonlinear optics. The
presence of this peculiar mechanism in THG from plasmonic nanoantennas at
telecommunication wavelengths allows gaining further insight on the physics of
plasmon-enhanced nonlinear optical processes. This could be crucial in the
realization of nanoscale elements for photon conversion and manipulation
operating at room-temperature.
| cond-mat.mes-hall | the optimization of nonlinear optical processes at the nanoscale is a crucial step for the development of nanoscale photon sources for quantumoptical networks the development of innovative plasmonic nanoantenna designs and hybrid nanostructures to enhance optical nonlinearities in very small volumes represents one of the most promising routes in such systems the upconversion of photons can be achieved with high efficiencies via thirdorder processes such as third harmonic generation thg thanks to the resonantlyenhanced volume currents conversely secondorder processes such as second harmonic generation shg are often inhibited by the symmetry of metal lattices and of common nanoantenna geometries shg and thg processes in plasmonic nanostructures are generally treated independently since they both represent a small perturbation in the lightmatter interaction mechanisms in this work we demonstrate that this paradigm does not hold in general by providing evidence of a cascaded process in thg which is fueled by shg and sizably contributes to the overall yield we address this mechanism by unveiling an anomalous fingerprint in the polarization state of the nonlinear emission from noncentrosymmetric gold nanoantennas and point out that such cascaded processes may also appear for structures that exhibit only moderate shg yields signifying its general relevance in plasmonenhanced nonlinear optics the presence of this peculiar mechanism in thg from plasmonic nanoantennas at telecommunication wavelengths allows gaining further insight on the physics of plasmonenhanced nonlinear optical processes this could be crucial in the realization of nanoscale elements for photon conversion and manipulation operating at roomtemperature | [['the', 'optimization', 'of', 'nonlinear', 'optical', 'processes', 'at', 'the', 'nanoscale', 'is', 'a', 'crucial', 'step', 'for', 'the', 'development', 'of', 'nanoscale', 'photon', 'sources', 'for', 'quantumoptical', 'networks', 'the', 'development', 'of', 'innovative', 'plasmonic', 'nanoantenna', 'designs', 'and', 'hybrid', 'nanostructures', 'to', 'enhance', 'optical', 'nonlinearities', 'in', 'very', 'small', 'volumes', 'represents', 'one', 'of', 'the', 'most', 'promising', 'routes', 'in', 'such', 'systems', 'the', 'upconversion', 'of', 'photons', 'can', 'be', 'achieved', 'with', 'high', 'efficiencies', 'via', 'thirdorder', 'processes', 'such', 'as', 'third', 'harmonic', 'generation', 'thg', 'thanks', 'to', 'the', 'resonantlyenhanced', 'volume', 'currents', 'conversely', 'secondorder', 'processes', 'such', 'as', 'second', 'harmonic', 'generation', 'shg', 'are', 'often', 'inhibited', 'by', 'the', 'symmetry', 'of', 'metal', 'lattices', 'and', 'of', 'common', 'nanoantenna', 'geometries', 'shg', 'and', 'thg', 'processes', 'in', 'plasmonic', 'nanostructures', 'are', 'generally', 'treated', 'independently', 'since', 'they', 'both', 'represent', 'a', 'small', 'perturbation', 'in', 'the', 'lightmatter', 'interaction', 'mechanisms', 'in', 'this', 'work', 'we', 'demonstrate', 'that', 'this', 'paradigm', 'does', 'not', 'hold', 'in', 'general', 'by', 'providing', 'evidence', 'of', 'a', 'cascaded', 'process', 'in', 'thg', 'which', 'is', 'fueled', 'by', 'shg', 'and', 'sizably', 'contributes', 'to', 'the', 'overall', 'yield', 'we', 'address', 'this', 'mechanism', 'by', 'unveiling', 'an', 'anomalous', 'fingerprint', 'in', 'the', 'polarization', 'state', 'of', 'the', 'nonlinear', 'emission', 'from', 'noncentrosymmetric', 'gold', 'nanoantennas', 'and', 'point', 'out', 'that', 'such', 'cascaded', 'processes', 'may', 'also', 'appear', 'for', 'structures', 'that', 'exhibit', 'only', 'moderate', 'shg', 'yields', 'signifying', 'its', 'general', 'relevance', 'in', 'plasmonenhanced', 'nonlinear', 'optics', 'the', 'presence', 'of', 'this', 'peculiar', 'mechanism', 'in', 'thg', 'from', 'plasmonic', 'nanoantennas', 'at', 'telecommunication', 'wavelengths', 'allows', 'gaining', 'further', 'insight', 'on', 'the', 'physics', 'of', 'plasmonenhanced', 'nonlinear', 'optical', 'processes', 'this', 'could', 'be', 'crucial', 'in', 'the', 'realization', 'of', 'nanoscale', 'elements', 'for', 'photon', 'conversion', 'and', 'manipulation', 'operating', 'at', 'roomtemperature']] | [-0.10753294727896992, 0.16512343754501954, -0.01558935924231448, 0.009240313946058362, -0.04535718492104065, -0.15161325043512258, 0.02957418455500985, 0.4399638954090022, -0.2638622246016202, -0.255182764802113, 0.03342329214189413, -0.27454635266103616, -0.19095064609816773, 0.253752676868125, 0.0029023884977534536, 0.057388355532003124, 0.00048294322148553635, -0.1088566111347936, 0.041002364850391895, -0.14025967004275333, 0.266216431009142, 0.07470741021745698, 0.3358268691085445, 0.10943808029160688, 0.08527916818876045, -0.011183695144657241, 0.021117739912936924, -0.06738604301292646, -0.04062089800967449, 0.15891707142407777, 0.302981423125706, 0.0021149770409502238, 0.2590753107486285, -0.45629481841557423, -0.2449945259126665, 0.05927962888119274, 0.16417572668259625, 0.15461812894706528, -0.11634113389049795, -0.23893700080437336, 0.031656529460298385, -0.10544689959065937, -0.12756777831319313, -0.09114923728297668, -0.03956642643989701, 0.02396427869781671, -0.27000429867064535, 0.05228816161979921, 0.101210881036382, 0.04910174384736739, -0.004941247897326328, -0.05257118308939311, -0.029662200479734283, 0.0730595589457042, -0.035041051677466836, -0.020865960356775626, 0.16664407537827788, -0.17848355446184272, -0.17635027693984237, 0.4360406375999151, -0.0697428003351321, -0.11864398238871261, 0.17653001633190893, -0.19281030877451846, -0.08305802683417614, 0.17742873822915772, 0.217655556749643, 0.1261372946338023, -0.15980891167631123, 0.01204247240529505, 0.05953347479343897, 0.18510724719755656, 0.0985685940567962, 0.15948868976568478, 0.26825947540450223, 0.23095390890151835, 0.03206882951781154, 0.14513044580246928, -0.0628610211160592, -0.03680125078061965, -0.2590826106321836, -0.16665665837295113, -0.1940287403189219, 0.05808082178640622, -0.08962051147325927, -0.14109026112566375, 0.3829408050872959, 0.13852711976741475, 0.12508148003392194, -0.05199196508299439, 0.29386720237763303, 0.14769649928952247, 0.1449810316624037, -0.0368968402026108, 0.34620277913144004, 0.12779287132340283, 0.13546562869278977, -0.2281954934046866, 0.05275400851590197, 0.0013568041080737163] |
1,803.03618 | A Ranking Method For Selection Of $\Eta$ Mesons In High Multiplicity
Events | The selection of $\eta$ mesons with a high efficiency and a high purity can
be important in the formation of statistically significant invariant mass
spectra in the reconstruction of short-lived particles such as $\eta'
\rightarrow \pi^{+} \pi^{-} \eta$. In this study, a cut-based standard method
and a Ranking method to reduce combinatorial background in the reconstruction
of $\eta \rightarrow \gamma \gamma$ decays in high multiplicity hadronic events
are presented. By using recorded ALEPH data and fully simulated events, the
performances of the methods are compared. Results show that the Ranking method
yields significant improvements in the purity of the selected $\eta$ meson
relative to the standard method.
| hep-ph hep-ex | the selection of eta mesons with a high efficiency and a high purity can be important in the formation of statistically significant invariant mass spectra in the reconstruction of shortlived particles such as eta rightarrow pi pi eta in this study a cutbased standard method and a ranking method to reduce combinatorial background in the reconstruction of eta rightarrow gamma gamma decays in high multiplicity hadronic events are presented by using recorded aleph data and fully simulated events the performances of the methods are compared results show that the ranking method yields significant improvements in the purity of the selected eta meson relative to the standard method | [['the', 'selection', 'of', 'eta', 'mesons', 'with', 'a', 'high', 'efficiency', 'and', 'a', 'high', 'purity', 'can', 'be', 'important', 'in', 'the', 'formation', 'of', 'statistically', 'significant', 'invariant', 'mass', 'spectra', 'in', 'the', 'reconstruction', 'of', 'shortlived', 'particles', 'such', 'as', 'eta', 'rightarrow', 'pi', 'pi', 'eta', 'in', 'this', 'study', 'a', 'cutbased', 'standard', 'method', 'and', 'a', 'ranking', 'method', 'to', 'reduce', 'combinatorial', 'background', 'in', 'the', 'reconstruction', 'of', 'eta', 'rightarrow', 'gamma', 'gamma', 'decays', 'in', 'high', 'multiplicity', 'hadronic', 'events', 'are', 'presented', 'by', 'using', 'recorded', 'aleph', 'data', 'and', 'fully', 'simulated', 'events', 'the', 'performances', 'of', 'the', 'methods', 'are', 'compared', 'results', 'show', 'that', 'the', 'ranking', 'method', 'yields', 'significant', 'improvements', 'in', 'the', 'purity', 'of', 'the', 'selected', 'eta', 'meson', 'relative', 'to', 'the', 'standard', 'method']] | [-0.04358509249297606, 0.13248350733247038, -0.11212337847851286, 0.10782366644952307, 0.02892639416609412, -0.08787684775801881, 0.05228191423208113, 0.36096725578063005, -0.22188477824816358, -0.3088575923101646, -0.01743978874052866, -0.32705040899253335, -0.03805885783387957, 0.19767288769656252, -0.02090447200636301, 0.10586979941717375, 0.16692799255121324, 0.06187080171516287, -0.08937394305530263, -0.20387399921663732, 0.24788326303100336, 0.08712427560936346, 0.25713910672065116, 0.04083491535422122, 0.025751371923442408, 0.0065723302660979956, -0.10513928333279964, 0.010629953276888232, -0.11930099939830899, 0.06398632863066464, 0.24711370609796424, 0.13714256526893615, 0.17715000183208385, -0.27801739570693434, -0.13291602252730142, 0.16590733817456482, 0.14379855088245508, 0.016298210657436713, -0.06719784001671822, -0.3210081694665078, 0.1683135412624715, -0.1728609472811853, -0.0664566184663884, -0.09695836806574087, 0.0011437238829436704, 0.011292881739247486, -0.32473012113021077, 0.10671421762764732, 0.0014791620015215659, 0.04019239457828976, -0.026658881107501895, -0.1830144135899424, -0.021289730322695224, 0.06882643087758361, 0.09646868266200072, 0.0927809897089969, 0.14262667188647193, -0.16539523093177824, -0.1753691172349119, 0.39029035020932973, -0.08786391908146232, -0.21352262415479276, 0.19055110223103908, -0.17257843685780314, -0.16489591620096536, 0.2521807728944538, 0.23676448398069522, 0.10665682131842336, -0.14544699740570002, 0.05900338717581809, -0.0007082203176812591, 0.16165106440676708, 0.054811355588243946, 0.032894200466956215, 0.12415955543831408, 0.21699388864859243, -0.028265922708941675, 0.09724518754106085, -0.132146804671839, 0.010429141868915514, -0.33167838152045404, -0.1676294701957257, -0.13170869997049742, 0.03673671150284114, -0.11169978085359684, -0.09012484703665581, 0.3611347197302591, 0.06076482384439523, 0.27378883628853573, -0.004855479205149078, 0.3289380757851857, 0.10439812965913041, 0.033185574891933495, 0.04018717242413523, 0.27862127953879184, 0.15010619086265634, 0.11181830245757772, -0.2543621146181059, 0.04413165885380635, 0.029728188414439978] |
1,803.03619 | Signature of non-isotropic distribution of stellar rotation inclination
angles in the Praesepe cluster | The distribution of the stellar rotation axes of 113 main sequence stars in
the open cluster Praesepe are examined by using current photometric rotation
periods, spectroscopic rotation velocities, and estimated stellar radii. Three
different samples of stellar rotation data on spotted stars from the Galactic
field and two independent samples of planetary hosts are used as control
samples to support the consistency of the analysis. Considering the high
completeness of the Praesepe sample and the behavior of the control samples, we
find that the main sequence F - K stars in this cluster are susceptible to
rotational axis alignment. Using a cone model, the most likely inclination
angle is 76+/-14 degrees with a half opening angle of 47+/-24 degrees.
Non-isotropic distribution of the inclination angles is preferred over the
isotropic distribution, except if the rotation velocities used in this work are
systematically overestimated. We found no indication of this being the case on
the basis of the currently available data.
| astro-ph.SR | the distribution of the stellar rotation axes of 113 main sequence stars in the open cluster praesepe are examined by using current photometric rotation periods spectroscopic rotation velocities and estimated stellar radii three different samples of stellar rotation data on spotted stars from the galactic field and two independent samples of planetary hosts are used as control samples to support the consistency of the analysis considering the high completeness of the praesepe sample and the behavior of the control samples we find that the main sequence f k stars in this cluster are susceptible to rotational axis alignment using a cone model the most likely inclination angle is 7614 degrees with a half opening angle of 4724 degrees nonisotropic distribution of the inclination angles is preferred over the isotropic distribution except if the rotation velocities used in this work are systematically overestimated we found no indication of this being the case on the basis of the currently available data | [['the', 'distribution', 'of', 'the', 'stellar', 'rotation', 'axes', 'of', '113', 'main', 'sequence', 'stars', 'in', 'the', 'open', 'cluster', 'praesepe', 'are', 'examined', 'by', 'using', 'current', 'photometric', 'rotation', 'periods', 'spectroscopic', 'rotation', 'velocities', 'and', 'estimated', 'stellar', 'radii', 'three', 'different', 'samples', 'of', 'stellar', 'rotation', 'data', 'on', 'spotted', 'stars', 'from', 'the', 'galactic', 'field', 'and', 'two', 'independent', 'samples', 'of', 'planetary', 'hosts', 'are', 'used', 'as', 'control', 'samples', 'to', 'support', 'the', 'consistency', 'of', 'the', 'analysis', 'considering', 'the', 'high', 'completeness', 'of', 'the', 'praesepe', 'sample', 'and', 'the', 'behavior', 'of', 'the', 'control', 'samples', 'we', 'find', 'that', 'the', 'main', 'sequence', 'f', 'k', 'stars', 'in', 'this', 'cluster', 'are', 'susceptible', 'to', 'rotational', 'axis', 'alignment', 'using', 'a', 'cone', 'model', 'the', 'most', 'likely', 'inclination', 'angle', 'is', '7614', 'degrees', 'with', 'a', 'half', 'opening', 'angle', 'of', '4724', 'degrees', 'nonisotropic', 'distribution', 'of', 'the', 'inclination', 'angles', 'is', 'preferred', 'over', 'the', 'isotropic', 'distribution', 'except', 'if', 'the', 'rotation', 'velocities', 'used', 'in', 'this', 'work', 'are', 'systematically', 'overestimated', 'we', 'found', 'no', 'indication', 'of', 'this', 'being', 'the', 'case', 'on', 'the', 'basis', 'of', 'the', 'currently', 'available', 'data']] | [-0.14067038392308373, 0.1521804443818265, -0.062232871021513106, 0.06436152691563368, -0.08590778357015466, -0.039398434549956673, 0.06269118262589587, 0.41381904192315705, -0.2121902691857866, -0.35566938220986033, 0.08279060363936466, -0.26545084079631615, -0.007071845854322116, 0.2025887799440479, -0.0478870459252371, 0.014132135829583701, 0.07822813850435072, -0.02214006827148439, -0.05754677017523948, -0.272404846178848, 0.3095938878561481, 0.011409600492297384, 0.20768010719392285, -0.10075784681706086, 0.04673836537953115, -0.031509997151827195, -0.04919314063512925, -0.008367544532103359, -0.1622618758634451, 0.06944022158383385, 0.20101038859454248, 0.11073990566717312, 0.19559349073389978, -0.28851552677183206, -0.14942989248852684, 0.03834305312660224, 0.17243036836292008, 0.08415799691640544, -0.06296234930361733, -0.24039635196498027, 0.06079091496381955, -0.1326696718881879, -0.214945403112204, 0.029737407441174833, 0.06147674439290433, 0.062234124615378444, -0.22731927116313633, 0.12128640575343216, 0.04581954822811128, 0.1833772010070348, -0.11565299580933866, -0.18155623393121567, -0.10726508996068682, 0.11601242137364105, 0.08177070937532369, 0.08649447775221102, 0.13873435583539634, -0.0759907109405166, -0.025646374578464706, 0.3929471284994539, -0.04159667572656752, -0.12902654193007862, 0.18310465842321422, -0.21523844222860328, -0.1228655309404639, 0.11299088847407568, 0.17971770749749533, 0.1544729369171198, -0.16447807354676836, -0.0035448108383149797, -0.027015824576710944, 0.19763590898891947, 0.05112741006034538, 0.010647585179873466, 0.2941281326604222, 0.08716328031494745, 0.024570226862604887, 0.08525280986543533, -0.24554176874892236, -0.06680927931407243, -0.24016735770991482, -0.08027009431671046, -0.1543772566108818, 0.055336793153195306, -0.13771299069204423, -0.11685423193347154, 0.3777428444346073, 0.1436553523164102, 0.21098961906490038, 0.04231331513538582, 0.3044325766628081, 0.055548833445177276, 0.112138121139182, 0.11097640221288323, 0.3044238407926271, 0.19642912088776207, 0.027165370837363572, -0.23906752838659445, 0.13313231410446968, -0.0464185743948515] |
1,803.0362 | Stable and Consistent Membership at Scale with Rapid | We present the design and evaluation of Rapid, a distributed membership
service. At Rapid's core is a scheme for multi-process cut detection (CD) that
revolves around two key insights: (i) it suspects a failure of a process only
after alerts arrive from multiple sources, and (ii) when a group of processes
experience problems, it detects failures of the entire group, rather than
conclude about each process individually. Implementing these insights
translates into a simple membership algorithm with low communication overhead.
We present evidence that our strategy suffices to drive unanimous detection
almost-everywhere, even when complex network conditions arise, such as one-way
reachability problems, firewall misconfigurations, and high packet loss.
Furthermore, we present both empirical evidence and analyses that proves that
the almost-everywhere detection happens with high probability. To complete the
design, Rapid contains a leaderless consensus protocol that converts
multi-process cut detections into a view-change decision. The resulting
membership service works both in fully decentralized as well as logically
centralized modes.
We present an evaluation of Rapid in moderately scalable cloud settings.
Rapid bootstraps 2000 node clusters 2-5.8x faster than prevailing tools such as
Memberlist and ZooKeeper, remains stable in face of complex failure scenarios,
and provides strong consistency guarantees. It is easy to integrate Rapid into
existing distributed applications, of which we demonstrate two.
| cs.DC | we present the design and evaluation of rapid a distributed membership service at rapids core is a scheme for multiprocess cut detection cd that revolves around two key insights i it suspects a failure of a process only after alerts arrive from multiple sources and ii when a group of processes experience problems it detects failures of the entire group rather than conclude about each process individually implementing these insights translates into a simple membership algorithm with low communication overhead we present evidence that our strategy suffices to drive unanimous detection almosteverywhere even when complex network conditions arise such as oneway reachability problems firewall misconfigurations and high packet loss furthermore we present both empirical evidence and analyses that proves that the almosteverywhere detection happens with high probability to complete the design rapid contains a leaderless consensus protocol that converts multiprocess cut detections into a viewchange decision the resulting membership service works both in fully decentralized as well as logically centralized modes we present an evaluation of rapid in moderately scalable cloud settings rapid bootstraps 2000 node clusters 258x faster than prevailing tools such as memberlist and zookeeper remains stable in face of complex failure scenarios and provides strong consistency guarantees it is easy to integrate rapid into existing distributed applications of which we demonstrate two | [['we', 'present', 'the', 'design', 'and', 'evaluation', 'of', 'rapid', 'a', 'distributed', 'membership', 'service', 'at', 'rapids', 'core', 'is', 'a', 'scheme', 'for', 'multiprocess', 'cut', 'detection', 'cd', 'that', 'revolves', 'around', 'two', 'key', 'insights', 'i', 'it', 'suspects', 'a', 'failure', 'of', 'a', 'process', 'only', 'after', 'alerts', 'arrive', 'from', 'multiple', 'sources', 'and', 'ii', 'when', 'a', 'group', 'of', 'processes', 'experience', 'problems', 'it', 'detects', 'failures', 'of', 'the', 'entire', 'group', 'rather', 'than', 'conclude', 'about', 'each', 'process', 'individually', 'implementing', 'these', 'insights', 'translates', 'into', 'a', 'simple', 'membership', 'algorithm', 'with', 'low', 'communication', 'overhead', 'we', 'present', 'evidence', 'that', 'our', 'strategy', 'suffices', 'to', 'drive', 'unanimous', 'detection', 'almosteverywhere', 'even', 'when', 'complex', 'network', 'conditions', 'arise', 'such', 'as', 'oneway', 'reachability', 'problems', 'firewall', 'misconfigurations', 'and', 'high', 'packet', 'loss', 'furthermore', 'we', 'present', 'both', 'empirical', 'evidence', 'and', 'analyses', 'that', 'proves', 'that', 'the', 'almosteverywhere', 'detection', 'happens', 'with', 'high', 'probability', 'to', 'complete', 'the', 'design', 'rapid', 'contains', 'a', 'leaderless', 'consensus', 'protocol', 'that', 'converts', 'multiprocess', 'cut', 'detections', 'into', 'a', 'viewchange', 'decision', 'the', 'resulting', 'membership', 'service', 'works', 'both', 'in', 'fully', 'decentralized', 'as', 'well', 'as', 'logically', 'centralized', 'modes', 'we', 'present', 'an', 'evaluation', 'of', 'rapid', 'in', 'moderately', 'scalable', 'cloud', 'settings', 'rapid', 'bootstraps', '2000', 'node', 'clusters', '258x', 'faster', 'than', 'prevailing', 'tools', 'such', 'as', 'memberlist', 'and', 'zookeeper', 'remains', 'stable', 'in', 'face', 'of', 'complex', 'failure', 'scenarios', 'and', 'provides', 'strong', 'consistency', 'guarantees', 'it', 'is', 'easy', 'to', 'integrate', 'rapid', 'into', 'existing', 'distributed', 'applications', 'of', 'which', 'we', 'demonstrate', 'two']] | [-0.16274442065744396, 0.03803691198866219, -0.07584225511362881, 0.05029891889478436, -0.09000971596709997, -0.2051351301060146, 0.13320192534977324, 0.4263411329461719, -0.25012564990106084, -0.29130406485747473, 0.13347399917613487, -0.2358171021882093, -0.14135725184300924, 0.17887712395662125, -0.0891064119828373, 0.048700161796625493, 0.12273138718358856, 0.007059613707308429, -0.01868582985095926, -0.2458227551970543, 0.2649759154065011, 0.04607546633715689, 0.30880651236423906, 0.04478963217170874, 0.09440670882676781, 0.02936864074787459, -0.025338302405972808, 0.00782710199413452, -0.05032959996087983, 0.0910626642632777, 0.2884872467213152, 0.25350257135128146, 0.3328468693719017, -0.42441668176039493, -0.18100519556077724, 0.07748262918628927, 0.1645196182312848, 0.0974391698985545, -0.07661757039159914, -0.267843705856786, 0.11908388571958672, -0.20117111989947142, -0.09463286358546817, -0.07862140008200065, 0.01887304673437029, -0.009193159674979606, -0.28385345476848634, 0.04720346062369469, 0.07725438066672552, 0.035299054562237184, -0.04171008846111912, -0.06672194848641015, 0.025773303096736165, 0.13070417709350982, 0.0019481980243482504, 0.017462914251669678, 0.14179131959265778, -0.11744729673063255, -0.14294532566761844, 0.388135347286907, -0.01332062103344624, -0.11272009662399178, 0.22979076490473915, -0.047479396439399045, -0.1893235763627157, 0.14604998944669892, 0.18697997138238037, 0.09899388268515293, -0.14845864105429324, -0.006551241225816688, -0.008377827945569495, 0.18329292737202332, 0.037630845748386696, 0.030584232600511244, 0.18204465319999968, 0.19484447356959242, 0.13024633154734302, 0.12704515403777994, -0.060017905105783975, -0.1157511197643372, -0.2632266990634512, -0.1527888137530887, -0.1115208658508359, 0.01871765304558893, -0.09765738495123102, -0.1638782932749787, 0.3461217402545855, 0.15056600302176656, 0.18793809586006902, 0.09669781657307022, 0.34584958361953777, 0.07933111195803953, 0.07506264075977323, 0.1487166137634425, 0.17894048806069032, 0.04670601450390059, 0.08626532363749267, -0.1513173082054874, 0.1260986181260482, -0.020711025313193084] |
1,803.03621 | Approximate Randomized Benchmarking for Finite Groups | We investigate randomized benchmarking in a general setting with quantum
gates that form a representation, not necessarily an irreducible one, of a
finite group. We derive an estimate for the average fidelity, to which
experimental data may then be calibrated. Furthermore, we establish that
randomized benchmarking can be achieved by the sole implementation of quantum
gates that generate the group as well as one additional arbitrary group
element. In this case, we need to assume that the noise is close to being
covariant. This yields a more practical approach to randomized benchmarking.
Moreover, we show that randomized benchmarking is stable with respect to
approximate Haar sampling for the sequences of gates. This opens up the
possibility of using Markov chain Monte Carlo methods to obtain the random
sequences of gates more efficiently. We demonstrate these results numerically
using the well-studied example of the Clifford group as well as the group of
monomial unitary matrices. For the latter, we focus on the subgroup with
nonzero entries consisting of n-th roots of unity, which contains T gates.
| quant-ph | we investigate randomized benchmarking in a general setting with quantum gates that form a representation not necessarily an irreducible one of a finite group we derive an estimate for the average fidelity to which experimental data may then be calibrated furthermore we establish that randomized benchmarking can be achieved by the sole implementation of quantum gates that generate the group as well as one additional arbitrary group element in this case we need to assume that the noise is close to being covariant this yields a more practical approach to randomized benchmarking moreover we show that randomized benchmarking is stable with respect to approximate haar sampling for the sequences of gates this opens up the possibility of using markov chain monte carlo methods to obtain the random sequences of gates more efficiently we demonstrate these results numerically using the wellstudied example of the clifford group as well as the group of monomial unitary matrices for the latter we focus on the subgroup with nonzero entries consisting of nth roots of unity which contains t gates | [['we', 'investigate', 'randomized', 'benchmarking', 'in', 'a', 'general', 'setting', 'with', 'quantum', 'gates', 'that', 'form', 'a', 'representation', 'not', 'necessarily', 'an', 'irreducible', 'one', 'of', 'a', 'finite', 'group', 'we', 'derive', 'an', 'estimate', 'for', 'the', 'average', 'fidelity', 'to', 'which', 'experimental', 'data', 'may', 'then', 'be', 'calibrated', 'furthermore', 'we', 'establish', 'that', 'randomized', 'benchmarking', 'can', 'be', 'achieved', 'by', 'the', 'sole', 'implementation', 'of', 'quantum', 'gates', 'that', 'generate', 'the', 'group', 'as', 'well', 'as', 'one', 'additional', 'arbitrary', 'group', 'element', 'in', 'this', 'case', 'we', 'need', 'to', 'assume', 'that', 'the', 'noise', 'is', 'close', 'to', 'being', 'covariant', 'this', 'yields', 'a', 'more', 'practical', 'approach', 'to', 'randomized', 'benchmarking', 'moreover', 'we', 'show', 'that', 'randomized', 'benchmarking', 'is', 'stable', 'with', 'respect', 'to', 'approximate', 'haar', 'sampling', 'for', 'the', 'sequences', 'of', 'gates', 'this', 'opens', 'up', 'the', 'possibility', 'of', 'using', 'markov', 'chain', 'monte', 'carlo', 'methods', 'to', 'obtain', 'the', 'random', 'sequences', 'of', 'gates', 'more', 'efficiently', 'we', 'demonstrate', 'these', 'results', 'numerically', 'using', 'the', 'wellstudied', 'example', 'of', 'the', 'clifford', 'group', 'as', 'well', 'as', 'the', 'group', 'of', 'monomial', 'unitary', 'matrices', 'for', 'the', 'latter', 'we', 'focus', 'on', 'the', 'subgroup', 'with', 'nonzero', 'entries', 'consisting', 'of', 'nth', 'roots', 'of', 'unity', 'which', 'contains', 't', 'gates']] | [-0.11313038519583643, 0.11652906126725221, -0.07364319045096636, 0.0481348339035841, -0.02978562063404492, -0.16786984833755664, 0.08337528675794602, 0.41479268462530205, -0.27649036051838527, -0.2613035385646591, 0.10545714806898364, -0.23406923683094127, -0.13835795908068707, 0.24108194439538888, -0.07973827999883465, 0.06309981889224478, 0.06854864101324763, 0.06171070753463677, -0.11875039560055094, -0.281892517006823, 0.29009275142635615, 0.043290301693071215, 0.23167291672102042, -0.038728301072759284, 0.10158423082703458, -0.00845788272363799, 0.0016039452884745386, -0.014419923901025738, -0.0792447920034257, 0.1094968815680061, 0.2646133212665362, 0.10811917064711452, 0.2549252608099154, -0.40259448131280284, -0.15200503233288015, 0.1664300560578704, 0.14480313951415674, 0.1630032996713583, -0.06846425640879066, -0.28462701206361607, 0.12610562834622605, -0.18638318203921828, -0.1117894539928862, -0.14999599135081682, -0.010575270636805465, -0.00783846142335928, -0.31735572116715566, 0.01839261533825525, 0.04792936017869839, 0.05890650081315211, 0.018980233181667115, -0.10212490403426012, 0.05061273506709508, 0.12374181681977851, -0.03465039715104337, 0.034117819973533706, 0.11916925294590848, -0.05789742484505821, -0.1687692354752549, 0.37569032147526743, -0.07063557909801603, -0.23002525726599352, 0.12471329285297543, -0.1283273424447647, -0.15368506792932748, 0.06362657807235207, 0.13870222634103682, 0.12418147102530513, -0.11960323516612074, 0.08658467282674143, -0.08485276582517794, 0.1672256152897275, 0.020615360965686187, 0.011250313048450542, 0.1029963811500264, 0.11410040536629303, 0.10855663227715663, 0.19575932714822036, -0.019954427191987634, -0.0958039758434253, -0.32883388538445746, -0.19141350544057786, -0.20835908097348044, 0.08916630772882074, -0.10288018958110895, -0.2033751809064831, 0.3892011861276946, 0.1828901367486573, 0.17874430398323707, 0.10302577107745622, 0.28652579798230104, 0.10959143665486148, 0.07582329744606146, 0.08693218646514911, 0.1437955921356167, 0.152737225588145, -0.04640717620761799, -0.20509458866768648, 0.049952310069597196, 0.08203230407887271] |
1,803.03622 | Virtual Network Embedding Approximations: Leveraging Randomized Rounding | The Virtual Network Embedding Problem (VNEP) captures the essence of many
resource allocation problems of today's infrastructure providers, which offer
their physical computation and networking resources to customers. Customers
request resources in the form of Virtual Networks, i.e. as a directed graph
which specifies computational requirements at the nodes and communication
requirements on the edges. An embedding of a Virtual Network on the shared
physical infrastructure is the joint mapping of (virtual) nodes to physical
servers together with the mapping of (virtual) edges onto paths in the physical
network connecting the respective servers.
This work initiates the study of approximation algorithms for the VNEP.
Concretely, we study the offline setting with admission control: given multiple
request graphs the task is to embed the most profitable subset while not
exceeding resource capacities. Our approximation is based on the randomized
rounding of Linear Programming (LP) solutions. Interestingly, we uncover that
the standard LP formulation for the VNEP exhibits an inherent structural
deficit when considering general virtual network topologies: its solutions
cannot be decomposed into valid embeddings. In turn, focusing on the class of
cactus request graphs, we devise a novel LP formulation, whose solutions can be
decomposed into convex combinations of valid embedding. Proving performance
guarantees of our rounding scheme, we obtain the first approximation algorithm
for the VNEP in the resource augmentation model.
We propose two types of rounding heuristics and evaluate their performance in
an extensive computational study. Our results indicate that randomized rounding
can yield good solutions (even without augmentations). Specifically, heuristic
rounding achieves 73.8% of the baseline's profit, while not exceeding
capacities.
| cs.NI cs.DS | the virtual network embedding problem vnep captures the essence of many resource allocation problems of todays infrastructure providers which offer their physical computation and networking resources to customers customers request resources in the form of virtual networks ie as a directed graph which specifies computational requirements at the nodes and communication requirements on the edges an embedding of a virtual network on the shared physical infrastructure is the joint mapping of virtual nodes to physical servers together with the mapping of virtual edges onto paths in the physical network connecting the respective servers this work initiates the study of approximation algorithms for the vnep concretely we study the offline setting with admission control given multiple request graphs the task is to embed the most profitable subset while not exceeding resource capacities our approximation is based on the randomized rounding of linear programming lp solutions interestingly we uncover that the standard lp formulation for the vnep exhibits an inherent structural deficit when considering general virtual network topologies its solutions cannot be decomposed into valid embeddings in turn focusing on the class of cactus request graphs we devise a novel lp formulation whose solutions can be decomposed into convex combinations of valid embedding proving performance guarantees of our rounding scheme we obtain the first approximation algorithm for the vnep in the resource augmentation model we propose two types of rounding heuristics and evaluate their performance in an extensive computational study our results indicate that randomized rounding can yield good solutions even without augmentations specifically heuristic rounding achieves 738 of the baselines profit while not exceeding capacities | [['the', 'virtual', 'network', 'embedding', 'problem', 'vnep', 'captures', 'the', 'essence', 'of', 'many', 'resource', 'allocation', 'problems', 'of', 'todays', 'infrastructure', 'providers', 'which', 'offer', 'their', 'physical', 'computation', 'and', 'networking', 'resources', 'to', 'customers', 'customers', 'request', 'resources', 'in', 'the', 'form', 'of', 'virtual', 'networks', 'ie', 'as', 'a', 'directed', 'graph', 'which', 'specifies', 'computational', 'requirements', 'at', 'the', 'nodes', 'and', 'communication', 'requirements', 'on', 'the', 'edges', 'an', 'embedding', 'of', 'a', 'virtual', 'network', 'on', 'the', 'shared', 'physical', 'infrastructure', 'is', 'the', 'joint', 'mapping', 'of', 'virtual', 'nodes', 'to', 'physical', 'servers', 'together', 'with', 'the', 'mapping', 'of', 'virtual', 'edges', 'onto', 'paths', 'in', 'the', 'physical', 'network', 'connecting', 'the', 'respective', 'servers', 'this', 'work', 'initiates', 'the', 'study', 'of', 'approximation', 'algorithms', 'for', 'the', 'vnep', 'concretely', 'we', 'study', 'the', 'offline', 'setting', 'with', 'admission', 'control', 'given', 'multiple', 'request', 'graphs', 'the', 'task', 'is', 'to', 'embed', 'the', 'most', 'profitable', 'subset', 'while', 'not', 'exceeding', 'resource', 'capacities', 'our', 'approximation', 'is', 'based', 'on', 'the', 'randomized', 'rounding', 'of', 'linear', 'programming', 'lp', 'solutions', 'interestingly', 'we', 'uncover', 'that', 'the', 'standard', 'lp', 'formulation', 'for', 'the', 'vnep', 'exhibits', 'an', 'inherent', 'structural', 'deficit', 'when', 'considering', 'general', 'virtual', 'network', 'topologies', 'its', 'solutions', 'can', 'not', 'be', 'decomposed', 'into', 'valid', 'embeddings', 'in', 'turn', 'focusing', 'on', 'the', 'class', 'of', 'cactus', 'request', 'graphs', 'we', 'devise', 'a', 'novel', 'lp', 'formulation', 'whose', 'solutions', 'can', 'be', 'decomposed', 'into', 'convex', 'combinations', 'of', 'valid', 'embedding', 'proving', 'performance', 'guarantees', 'of', 'our', 'rounding', 'scheme', 'we', 'obtain', 'the', 'first', 'approximation', 'algorithm', 'for', 'the', 'vnep', 'in', 'the', 'resource', 'augmentation', 'model', 'we', 'propose', 'two', 'types', 'of', 'rounding', 'heuristics', 'and', 'evaluate', 'their', 'performance', 'in', 'an', 'extensive', 'computational', 'study', 'our', 'results', 'indicate', 'that', 'randomized', 'rounding', 'can', 'yield', 'good', 'solutions', 'even', 'without', 'augmentations', 'specifically', 'heuristic', 'rounding', 'achieves', '738', 'of', 'the', 'baselines', 'profit', 'while', 'not', 'exceeding', 'capacities']] | [-0.16650348769913798, 0.009680127114977882, -0.06576673654171655, 0.05463780721842821, -0.11356640653157572, -0.1897563430893604, 0.14137700823759483, 0.39683092683202253, -0.30980667699312897, -0.3172251320672485, 0.0810138354047184, -0.2511801675779147, -0.1475951106010778, 0.1566339315758702, -0.11878789659306178, 0.05849222657819859, 0.09368054789627182, 0.009128037601586361, -0.0415518664587992, -0.2731844391565076, 0.2970011712223531, 0.01725503590028241, 0.3205026712417954, 0.0690290747575005, 0.0730893904703476, 0.021388503359982148, -0.022219219918907532, 0.02239633168638596, -0.09181185753885349, 0.1398059100567205, 0.30606763166076734, 0.2161460737522059, 0.3057719395715603, -0.4547436782844224, -0.1789556195854016, 0.11497953160894367, 0.1299813786934499, 0.06690742999121968, -0.0003490556497126818, -0.26433271233273564, 0.09905626560684364, -0.15263984903060604, -0.036104922985245105, -0.08951588005424951, -0.04574349773520569, 0.012817221322922774, -0.28025407342257785, -0.054830152010720855, 0.04358419675626001, -0.013045458072128722, -0.0716296468371578, -0.11060532124423123, 0.026898283039588692, 0.15960470915229483, -0.001662726146344728, 0.024126218833064414, 0.11515396885433286, -0.12469784520049733, -0.19552941745507338, 0.4071133051770476, 0.017075159902385666, -0.2103616045541921, 0.15945429700110458, -0.0350220390490063, -0.17575102343294277, 0.11485175719783412, 0.23337388573179269, 0.0890872723352656, -0.15498247827465847, 0.07466814938058444, -0.05616359552544243, 0.15414473308373314, 0.06726603259701493, 0.07228559852459134, 0.12171023466079584, 0.20764852620327387, 0.14158367010092643, 0.1568308963088916, -0.005388604933923145, -0.1312743391824078, -0.2506637768751836, -0.14210559310004958, -0.20960330539646577, 0.0282639814085516, -0.17749416306949845, -0.15957944562026072, 0.392883066645478, 0.12703230431092516, 0.14836919114415376, 0.16954164056124973, 0.3443116871319395, 0.08980344071509844, 0.0916299648407214, 0.18524933215033018, 0.15895767668553162, 0.00631802023898037, 0.10104411102255877, -0.2066358885903544, 0.1162072760896441, 0.09970004316419363] |
1,803.03623 | Hourly-Similarity Based Solar Forecasting Using Multi-Model Machine
Learning Blending | With the increasing penetration of solar power into power systems,
forecasting becomes critical in power system operations. In this paper, an
hourly-similarity (HS) based method is developed for 1-hour-ahead (1HA) global
horizontal irradiance (GHI) forecasting. This developed method utilizes diurnal
patterns, statistical distinctions between different hours, and hourly
similarities in solar data to improve the forecasting accuracy. The HS-based
method is built by training multiple two-layer multi-model forecasting
framework (MMFF) models independently with the same-hour subsets. The final
optimal model is a combination of MMFF models with the best-performed blending
algorithm at every hour. At the forecasting stage, the most suitable model is
selected to perform the forecasting subtask of a certain hour. The HS-based
method is validated by 1-year data with six solar features collected by the
National Renewable Energy Laboratory (NREL). Results show that the HS-based
method outperforms the non-HS (all-in-one) method significantly with the same
MMFF architecture, wherein the optimal HS- based method outperforms the best
all-in-one method by 10.94% and 7.74% based on the normalized mean absolute
error and normalized root mean square error, respectively.
| stat.ML cs.LG | with the increasing penetration of solar power into power systems forecasting becomes critical in power system operations in this paper an hourlysimilarity hs based method is developed for 1hourahead 1ha global horizontal irradiance ghi forecasting this developed method utilizes diurnal patterns statistical distinctions between different hours and hourly similarities in solar data to improve the forecasting accuracy the hsbased method is built by training multiple twolayer multimodel forecasting framework mmff models independently with the samehour subsets the final optimal model is a combination of mmff models with the bestperformed blending algorithm at every hour at the forecasting stage the most suitable model is selected to perform the forecasting subtask of a certain hour the hsbased method is validated by 1year data with six solar features collected by the national renewable energy laboratory nrel results show that the hsbased method outperforms the nonhs allinone method significantly with the same mmff architecture wherein the optimal hs based method outperforms the best allinone method by 1094 and 774 based on the normalized mean absolute error and normalized root mean square error respectively | [['with', 'the', 'increasing', 'penetration', 'of', 'solar', 'power', 'into', 'power', 'systems', 'forecasting', 'becomes', 'critical', 'in', 'power', 'system', 'operations', 'in', 'this', 'paper', 'an', 'hourlysimilarity', 'hs', 'based', 'method', 'is', 'developed', 'for', '1hourahead', '1ha', 'global', 'horizontal', 'irradiance', 'ghi', 'forecasting', 'this', 'developed', 'method', 'utilizes', 'diurnal', 'patterns', 'statistical', 'distinctions', 'between', 'different', 'hours', 'and', 'hourly', 'similarities', 'in', 'solar', 'data', 'to', 'improve', 'the', 'forecasting', 'accuracy', 'the', 'hsbased', 'method', 'is', 'built', 'by', 'training', 'multiple', 'twolayer', 'multimodel', 'forecasting', 'framework', 'mmff', 'models', 'independently', 'with', 'the', 'samehour', 'subsets', 'the', 'final', 'optimal', 'model', 'is', 'a', 'combination', 'of', 'mmff', 'models', 'with', 'the', 'bestperformed', 'blending', 'algorithm', 'at', 'every', 'hour', 'at', 'the', 'forecasting', 'stage', 'the', 'most', 'suitable', 'model', 'is', 'selected', 'to', 'perform', 'the', 'forecasting', 'subtask', 'of', 'a', 'certain', 'hour', 'the', 'hsbased', 'method', 'is', 'validated', 'by', '1year', 'data', 'with', 'six', 'solar', 'features', 'collected', 'by', 'the', 'national', 'renewable', 'energy', 'laboratory', 'nrel', 'results', 'show', 'that', 'the', 'hsbased', 'method', 'outperforms', 'the', 'nonhs', 'allinone', 'method', 'significantly', 'with', 'the', 'same', 'mmff', 'architecture', 'wherein', 'the', 'optimal', 'hs', 'based', 'method', 'outperforms', 'the', 'best', 'allinone', 'method', 'by', '1094', 'and', '774', 'based', 'on', 'the', 'normalized', 'mean', 'absolute', 'error', 'and', 'normalized', 'root', 'mean', 'square', 'error', 'respectively']] | [-0.04521890897929636, 0.06224620259426483, -0.06250752219116057, 0.05429183666370917, -0.012384756415075693, -0.1453319839205232, 0.04185789084328457, 0.365517854152215, -0.21226274488948696, -0.37007153641454055, 0.09900233430607579, -0.28903783716509024, -0.12587028055457194, 0.25672402521703025, -0.09091072562931246, 0.09782948550657837, 0.12818510534855498, 0.033944922220769384, -0.05004241128419822, -0.27513479633052224, 0.22483254529164318, 0.12969743011174778, 0.3687754855598888, -0.03918656169011586, 0.1615303430633587, -0.037236552739332865, -0.06137577695852802, -0.019642241479495184, -0.06402622804879594, 0.14945635196081272, 0.2259836606700273, 0.16230597722241816, 0.3374024927508452, -0.3730189881246803, -0.2222774792193419, 0.07999672581081015, 0.07711597696226628, 0.0002816729873386508, 0.025003649447129427, -0.26795153176638087, 0.08497886281094455, -0.1692307160418976, -0.06755781282450078, -0.04047210596372627, -0.02479643472120424, 0.045299947493295106, -0.3217041905097276, 0.10999849145812106, -0.0026020857537800523, 0.12817905640843286, -0.12935074518240902, -0.14755610919710938, -0.033089755444835896, 0.11384331739394565, 0.03356022225838219, 0.03286516410567814, 0.11172307246314857, -0.05321758471946151, -0.11353529651105576, 0.3510176223525078, -0.09109576249554366, -0.15522910491832548, 0.10576976480829191, -0.09249603769316667, -0.12867845453838736, 0.1298838751377118, 0.20237551836802953, 0.09756070303843717, -0.1703556706655146, 0.004510893029190406, -0.007410512188034983, 0.20941488211166998, 0.011461624008942546, -0.06727345622376124, 0.1642372484927569, 0.2596202514893402, 0.0759291430676862, 0.09006326188833985, -0.2006112470206094, -0.09069669372913551, -0.2290076961881492, -0.08099632692453317, -0.15102495825405346, -0.057903523091226816, -0.12313335579713992, -0.12451178032764895, 0.437799427109216, 0.2202616740190397, 0.1422117699978663, 0.08033404053280378, 0.3687630118640689, 0.1173377811499586, 0.0611104972477507, 0.13119432065135267, 0.19662414355515745, 0.02210107802634122, 0.14788768600707475, -0.21301499907616417, 0.07564920460740697, 0.11870851068262205] |
1,803.03624 | The usability of the optical parametric amplification of light for
high-angular-resolution imaging and fast astrometry | High-angular-resolution imaging is crucial for many applications in modern
astronomy and astrophysics. The fundamental diffraction limit constrains the
resolving power of both ground-based and spaceborne telescopes. The recent idea
of a quantum telescope based on the optical parametric amplification (OPA) of
light aims to bypass this limit for the imaging of extended sources by an order
of magnitude or more. We present an updated scheme of an OPA-based device and a
more accurate model of the signal amplification by such a device. The
semiclassical model that we present predicts that the noise in such a system
will form so-called light speckles as a result of light interference in the
optical path. Based on this model, we analysed the efficiency of OPA in
increasing the angular resolution of the imaging of extended targets and the
precise localization of a distant point source. According to our new model, OPA
offers a gain in resolved imaging in comparison to classical optics. For a
given time-span, we found that OPA can be more efficient in localizing a single
distant point source than classical telescopes.
| astro-ph.IM | highangularresolution imaging is crucial for many applications in modern astronomy and astrophysics the fundamental diffraction limit constrains the resolving power of both groundbased and spaceborne telescopes the recent idea of a quantum telescope based on the optical parametric amplification opa of light aims to bypass this limit for the imaging of extended sources by an order of magnitude or more we present an updated scheme of an opabased device and a more accurate model of the signal amplification by such a device the semiclassical model that we present predicts that the noise in such a system will form socalled light speckles as a result of light interference in the optical path based on this model we analysed the efficiency of opa in increasing the angular resolution of the imaging of extended targets and the precise localization of a distant point source according to our new model opa offers a gain in resolved imaging in comparison to classical optics for a given timespan we found that opa can be more efficient in localizing a single distant point source than classical telescopes | [['highangularresolution', 'imaging', 'is', 'crucial', 'for', 'many', 'applications', 'in', 'modern', 'astronomy', 'and', 'astrophysics', 'the', 'fundamental', 'diffraction', 'limit', 'constrains', 'the', 'resolving', 'power', 'of', 'both', 'groundbased', 'and', 'spaceborne', 'telescopes', 'the', 'recent', 'idea', 'of', 'a', 'quantum', 'telescope', 'based', 'on', 'the', 'optical', 'parametric', 'amplification', 'opa', 'of', 'light', 'aims', 'to', 'bypass', 'this', 'limit', 'for', 'the', 'imaging', 'of', 'extended', 'sources', 'by', 'an', 'order', 'of', 'magnitude', 'or', 'more', 'we', 'present', 'an', 'updated', 'scheme', 'of', 'an', 'opabased', 'device', 'and', 'a', 'more', 'accurate', 'model', 'of', 'the', 'signal', 'amplification', 'by', 'such', 'a', 'device', 'the', 'semiclassical', 'model', 'that', 'we', 'present', 'predicts', 'that', 'the', 'noise', 'in', 'such', 'a', 'system', 'will', 'form', 'socalled', 'light', 'speckles', 'as', 'a', 'result', 'of', 'light', 'interference', 'in', 'the', 'optical', 'path', 'based', 'on', 'this', 'model', 'we', 'analysed', 'the', 'efficiency', 'of', 'opa', 'in', 'increasing', 'the', 'angular', 'resolution', 'of', 'the', 'imaging', 'of', 'extended', 'targets', 'and', 'the', 'precise', 'localization', 'of', 'a', 'distant', 'point', 'source', 'according', 'to', 'our', 'new', 'model', 'opa', 'offers', 'a', 'gain', 'in', 'resolved', 'imaging', 'in', 'comparison', 'to', 'classical', 'optics', 'for', 'a', 'given', 'timespan', 'we', 'found', 'that', 'opa', 'can', 'be', 'more', 'efficient', 'in', 'localizing', 'a', 'single', 'distant', 'point', 'source', 'than', 'classical', 'telescopes']] | [-0.11602610064600204, 0.07893003616701517, -0.10999290586069392, 0.056566050376966805, -0.06057738473732545, -0.1258299526571187, 0.061946468299005034, 0.38337347527456017, -0.2373593628651062, -0.3156733893524002, 0.1043037060165632, -0.269623675409642, -0.13354347588614088, 0.2897482216517524, -0.07115096619154987, 0.05689619888431866, 0.08680063216327871, -0.02483132439561438, -0.018210230109687666, -0.16944555754840956, 0.2679680129890356, 0.12652995963593913, 0.2677836722782787, 0.005899848312389251, 0.11584053738949972, 0.037882024443424804, -0.0625611185954686, -0.011056851529668791, -0.06951793392286239, 0.15372786451750253, 0.24265300253436733, 0.1324257117451569, 0.25178213552805967, -0.4085642314781357, -0.2652855765116115, 0.086679459687364, 0.15308735631510365, 0.10007449317958944, -0.08136428214013564, -0.27857119382447537, 0.035493503759781615, -0.13852523498278757, -0.15258432916943088, -0.012712832907079485, -0.015900576076152938, 0.01859172719059897, -0.26426182552819616, 0.022606311932104696, 0.0349364804270464, 0.057329206680618854, -0.05342171475416122, -0.04648270678261618, 0.04428946827057041, 0.10256698948081437, -0.06381265798488674, 0.034056929197011504, 0.05999282701542554, -0.19264334460782856, -0.10563875317531923, 0.3833000574143234, -0.07983390209188636, -0.11170265359632338, 0.16027012825020012, -0.15647206340484612, -0.09510572139152934, 0.14216073907198978, 0.18032530895512364, 0.14807020439428156, -0.16304336963533606, 0.02755502708303071, -0.002730348079813925, 0.22629526858874882, 0.06260418506110264, 0.10098181049503366, 0.2362912467526166, 0.2175739303506994, 0.08289297998657803, 0.1439282348575903, -0.19949842310853969, -0.04340445210470417, -0.27436818341937896, -0.13806276869959805, -0.16481591596960105, 0.06386719286108816, -0.0739223364107805, -0.10722135602823048, 0.39214584938264385, 0.21057952375361935, 0.1441210373200726, -0.011308622298054604, 0.3764936725177162, 0.11957840823344679, 0.07757009991429038, 0.0117066088730896, 0.30789448622895105, 0.10733768180033515, 0.11143624437868845, -0.19882730896423398, -0.017992091244841045, -0.003209839958707963] |
1,803.03625 | A Gemini view of the galaxy cluster RXC J1504-0248: insights on the
nature of the central gaseous filaments | We revisit the galaxy cluster RXC J1504-0248, a remarkable example of a
structure with a strong cool core in a near redshift ($z = 0.216$). We
performed a combined analysis using photometric and spectroscopic data obtained
at Gemini South Telescope. We estimated the cluster mass through gravitational
lensing, obtaining $M_{200} = 5.3\pm0.4 \times 10^{14}$ $h_{70}^{-1}$ M$_\odot$
within $R_{200} = 1.56 \pm 0.04$ $h^{-1}_{70}$ Mpc, in agreement with a virial
mass estimate. This cluster presents a prominent filamentary structure
associated to its BCG, located mainly along its major axis and aligned with the
X-ray emission. A combined study of three emission line diagnostic diagrams has
shown that the filament emission falls in the so-called transition region of
these diagrams. Consequently, several ionizing sources should be playing an
meaningful role. We have argued that old stars, often invoked to explain LINER
emission, should not be the major source of ionization. We have noticed that
most of the filamentary emission has line ratios consistent with the shock
excitation limits obtained from shock models. We also found that line fluxes
are related to gas velocities (here estimated from line widths) by power-laws
with slopes in the range expected from shock models. These models also show,
however, that only ~10% of H$\alpha$ luminosity can be explained by shocks. We
conclude that shocks probably associated to the cooling of the intracluster gas
in a filamentary structure may indeed be contributing to the filament nebular
emission, but can not be the major source of ionizing photons.
| astro-ph.GA | we revisit the galaxy cluster rxc j15040248 a remarkable example of a structure with a strong cool core in a near redshift z 0216 we performed a combined analysis using photometric and spectroscopic data obtained at gemini south telescope we estimated the cluster mass through gravitational lensing obtaining m_200 53pm04 times 1014 h_701 m_odot within r_200 156 pm 004 h1_70 mpc in agreement with a virial mass estimate this cluster presents a prominent filamentary structure associated to its bcg located mainly along its major axis and aligned with the xray emission a combined study of three emission line diagnostic diagrams has shown that the filament emission falls in the socalled transition region of these diagrams consequently several ionizing sources should be playing an meaningful role we have argued that old stars often invoked to explain liner emission should not be the major source of ionization we have noticed that most of the filamentary emission has line ratios consistent with the shock excitation limits obtained from shock models we also found that line fluxes are related to gas velocities here estimated from line widths by powerlaws with slopes in the range expected from shock models these models also show however that only 10 of halpha luminosity can be explained by shocks we conclude that shocks probably associated to the cooling of the intracluster gas in a filamentary structure may indeed be contributing to the filament nebular emission but can not be the major source of ionizing photons | [['we', 'revisit', 'the', 'galaxy', 'cluster', 'rxc', 'j15040248', 'a', 'remarkable', 'example', 'of', 'a', 'structure', 'with', 'a', 'strong', 'cool', 'core', 'in', 'a', 'near', 'redshift', 'z', '0216', 'we', 'performed', 'a', 'combined', 'analysis', 'using', 'photometric', 'and', 'spectroscopic', 'data', 'obtained', 'at', 'gemini', 'south', 'telescope', 'we', 'estimated', 'the', 'cluster', 'mass', 'through', 'gravitational', 'lensing', 'obtaining', 'm_200', '53pm04', 'times', '1014', 'h_701', 'm_odot', 'within', 'r_200', '156', 'pm', '004', 'h1_70', 'mpc', 'in', 'agreement', 'with', 'a', 'virial', 'mass', 'estimate', 'this', 'cluster', 'presents', 'a', 'prominent', 'filamentary', 'structure', 'associated', 'to', 'its', 'bcg', 'located', 'mainly', 'along', 'its', 'major', 'axis', 'and', 'aligned', 'with', 'the', 'xray', 'emission', 'a', 'combined', 'study', 'of', 'three', 'emission', 'line', 'diagnostic', 'diagrams', 'has', 'shown', 'that', 'the', 'filament', 'emission', 'falls', 'in', 'the', 'socalled', 'transition', 'region', 'of', 'these', 'diagrams', 'consequently', 'several', 'ionizing', 'sources', 'should', 'be', 'playing', 'an', 'meaningful', 'role', 'we', 'have', 'argued', 'that', 'old', 'stars', 'often', 'invoked', 'to', 'explain', 'liner', 'emission', 'should', 'not', 'be', 'the', 'major', 'source', 'of', 'ionization', 'we', 'have', 'noticed', 'that', 'most', 'of', 'the', 'filamentary', 'emission', 'has', 'line', 'ratios', 'consistent', 'with', 'the', 'shock', 'excitation', 'limits', 'obtained', 'from', 'shock', 'models', 'we', 'also', 'found', 'that', 'line', 'fluxes', 'are', 'related', 'to', 'gas', 'velocities', 'here', 'estimated', 'from', 'line', 'widths', 'by', 'powerlaws', 'with', 'slopes', 'in', 'the', 'range', 'expected', 'from', 'shock', 'models', 'these', 'models', 'also', 'show', 'however', 'that', 'only', '10', 'of', 'halpha', 'luminosity', 'can', 'be', 'explained', 'by', 'shocks', 'we', 'conclude', 'that', 'shocks', 'probably', 'associated', 'to', 'the', 'cooling', 'of', 'the', 'intracluster', 'gas', 'in', 'a', 'filamentary', 'structure', 'may', 'indeed', 'be', 'contributing', 'to', 'the', 'filament', 'nebular', 'emission', 'but', 'can', 'not', 'be', 'the', 'major', 'source', 'of', 'ionizing', 'photons']] | [-0.06789377082394986, 0.0965003106685486, -0.0672672170674291, 0.11163278223448586, -0.07639878012476581, -0.07414330660888437, 0.028899971447259067, 0.4813817061758677, -0.1744711435372277, -0.3220366891931559, 0.06086951612302133, -0.2869917506664098, -0.009329390944197363, 0.20788240359144736, 0.01835332479178581, -0.055018366495296206, 0.06508419694131828, -0.0776394384600161, -0.039446945975333755, -0.20228326071595742, 0.28482901074324324, 0.09780141399776349, 0.17677609076280695, 0.04139557198457206, 0.06105317036948333, -0.1328649849480125, -0.057027968154365165, 0.02828015476469042, -0.13377632816090987, 0.03990549900851472, 0.22213806431716607, 0.11575988269426295, 0.21522629474476743, -0.3495110416453051, -0.21772988910737187, 0.06636301437526422, 0.2603424096625054, 0.023109861905543424, -0.05603851215364259, -0.2902252674446304, 0.0562012522771466, -0.1894450298983787, -0.18669245495331152, 0.08937988075671992, 0.01701722145614932, 0.024488587511157556, -0.19112095320344422, 0.15905816171945217, -0.014194408394434473, 0.05077762548338439, -0.09124036839605905, -0.09657788611032435, -0.07407230172510502, 0.04959812757108727, 0.04372365872440554, 0.09749490902549206, 0.21621171481426438, -0.12981650275350015, -0.04993696331779365, 0.41656070372059206, -0.0650254749362815, 0.015571209481825716, 0.20746206667762798, -0.2048964453033328, -0.20745582167167964, 0.21129476964487084, 0.13811835381641344, 0.05226187033819218, -0.1607115600040072, -0.024102246278580125, -0.03664411216989526, 0.22898378941425138, 0.044709448972678756, 0.013267992989745299, 0.33206912468294386, 0.059383535846135316, -0.002256992236772155, 0.11316912431989369, -0.21726206068157555, -0.041494473240521475, -0.2585350775358374, -0.07912427035244335, -0.0970938516891424, 0.0795583668291105, -0.11409473749577567, -0.12626693396340982, 0.2993426869084704, 0.14074962018341586, 0.23844256316532084, 0.027886512316190867, 0.2720919622864086, 0.12058750317731613, 0.12995804047171927, 0.12126344942762593, 0.32567730550577895, 0.20884270064693067, 0.06972209194514778, -0.21958369451296347, 0.06619412685385676, -0.007824842752239927] |
1,803.03626 | Examples of cyclic polynomially bounded operators that are not similar
to contractions, II | The question if polynomially bounded operator is similar to a contraction was
posed by Halmos and was answered in the negative by Pisier. His counterexample
is an operator of infinite multiplicity, while all its restrictions on
invariant subspaces of finite multiplicity are similar to contractions. In
[G16], cyclic polynomially bounded operators which are not similar to
contractions was constructed. The construction was based on a perturbation of
the sequence of finite dimensional operators which is uniformly polynomially
bounded, but is not uniformly completely polynomially bounded, constructed by
Pisier. In this paper, a cyclic polynomially bounded operator $T_0$ such that
$T_0$ is not similar to a contraction and $\omega_a(T_0)=\mathbb O$, is
constructed. Here $\omega_a(z)=\exp(a\frac{z+1}{z-1})$, $z\in\mathbb D$, $a>0$,
and $\mathbb D$ is the open unit disk. To obtain such $T_0$, a slight
modification of the construction from [G16] is needed.
| math.FA | the question if polynomially bounded operator is similar to a contraction was posed by halmos and was answered in the negative by pisier his counterexample is an operator of infinite multiplicity while all its restrictions on invariant subspaces of finite multiplicity are similar to contractions in g16 cyclic polynomially bounded operators which are not similar to contractions was constructed the construction was based on a perturbation of the sequence of finite dimensional operators which is uniformly polynomially bounded but is not uniformly completely polynomially bounded constructed by pisier in this paper a cyclic polynomially bounded operator t_0 such that t_0 is not similar to a contraction and omega_at_0mathbb o is constructed here omega_azexpafracz1z1 zinmathbb d a0 and mathbb d is the open unit disk to obtain such t_0 a slight modification of the construction from g16 is needed | [['the', 'question', 'if', 'polynomially', 'bounded', 'operator', 'is', 'similar', 'to', 'a', 'contraction', 'was', 'posed', 'by', 'halmos', 'and', 'was', 'answered', 'in', 'the', 'negative', 'by', 'pisier', 'his', 'counterexample', 'is', 'an', 'operator', 'of', 'infinite', 'multiplicity', 'while', 'all', 'its', 'restrictions', 'on', 'invariant', 'subspaces', 'of', 'finite', 'multiplicity', 'are', 'similar', 'to', 'contractions', 'in', 'g16', 'cyclic', 'polynomially', 'bounded', 'operators', 'which', 'are', 'not', 'similar', 'to', 'contractions', 'was', 'constructed', 'the', 'construction', 'was', 'based', 'on', 'a', 'perturbation', 'of', 'the', 'sequence', 'of', 'finite', 'dimensional', 'operators', 'which', 'is', 'uniformly', 'polynomially', 'bounded', 'but', 'is', 'not', 'uniformly', 'completely', 'polynomially', 'bounded', 'constructed', 'by', 'pisier', 'in', 'this', 'paper', 'a', 'cyclic', 'polynomially', 'bounded', 'operator', 't_0', 'such', 'that', 't_0', 'is', 'not', 'similar', 'to', 'a', 'contraction', 'and', 'omega_at_0mathbb', 'o', 'is', 'constructed', 'here', 'omega_azexpafracz1z1', 'zinmathbb', 'd', 'a0', 'and', 'mathbb', 'd', 'is', 'the', 'open', 'unit', 'disk', 'to', 'obtain', 'such', 't_0', 'a', 'slight', 'modification', 'of', 'the', 'construction', 'from', 'g16', 'is', 'needed']] | [-0.13016836937373122, 0.22131364063031522, -0.06005394906627343, 0.05077932883218369, -0.09048408607486635, -0.17158438971348325, -0.008631716966834468, 0.336719958591001, -0.3329146148308235, -0.18663957986213706, 0.15896037557275336, -0.2930959379574394, -0.08702238366993911, 0.17171436650952435, -0.152303560058285, 0.05974332966733902, 0.03255040872575003, 0.1155890358495526, -0.08067773981533452, -0.31747688621501713, 0.35358034530380633, 0.0071009655914488524, 0.14515334623009787, 0.08735817673561327, 0.07814769454040181, -0.04262289341867847, -0.03717387282727834, 0.022801571398946074, -0.13591926353124376, 0.08238611801061779, 0.24039259947398128, 0.11646773160079166, 0.27675880127422076, -0.33933707629330456, -0.14350995025897112, 0.1872538917198065, 0.14966828863629522, 0.04911759089993532, -0.01463608501431094, -0.2586290458052912, 0.15529963182394996, -0.12518215831283563, -0.14161233333117493, -0.03163472394482918, 0.10291210834197152, -0.0016445737141218748, -0.26433953012490424, 0.053986215813304574, 0.1845966812072541, 0.07942746027187883, -0.07059385655499201, -0.0770760377362261, -0.03952779556515024, 0.056033692459630614, -0.025036402293207013, 0.13924969864413417, 0.06280813040896593, 0.011705832241900412, -0.10046163019176353, 0.32692608504336984, -0.06822290704996489, -0.22708148205214562, 0.14688529547899687, -0.18936040173353189, -0.10605171545124475, 0.09386990832931855, 0.06660565799650024, 0.18341678628862343, -0.11317489338056047, 0.24664327754812, -0.1096226429217495, 0.158125133763807, 0.1230694555595298, -0.018011618571643552, 0.05923420312533648, 0.05496094522566315, 0.12989143636899397, 0.13180672496502452, 0.08097700049470671, -0.0527809912318309, -0.34138576863059666, -0.09170267897057141, -0.22752484593365807, 0.11277073705840689, -0.073432285891292, -0.19836035748149322, 0.34951020051341725, 0.018402610088421225, 0.2438777771381223, 0.08823701444335337, 0.2087190090404714, 0.1380627364577616, 0.09211511627825744, 0.11015470603289192, 0.12908488149439698, 0.1649577777048655, 0.05125788363169276, -0.17761532343052644, 0.0752219301648438, 0.176867653915264] |
1,803.03627 | A local depth measure for general data | We introduce the Integrated Dual Local Depth which is a local depth measure
for data in a Banach space based on the use of one-dimensional projections. The
properties of a depth measure are analyzed under this setting and a proper
definition of local symmetry is given. Moreover, strong consistency results for
the local depth and also for the local depth regions are attained. Finally,
applications to descriptive data analysis and classification are analyzed,
making the special focus on multivariate functional data, where we obtain very
promising results.
| stat.ME | we introduce the integrated dual local depth which is a local depth measure for data in a banach space based on the use of onedimensional projections the properties of a depth measure are analyzed under this setting and a proper definition of local symmetry is given moreover strong consistency results for the local depth and also for the local depth regions are attained finally applications to descriptive data analysis and classification are analyzed making the special focus on multivariate functional data where we obtain very promising results | [['we', 'introduce', 'the', 'integrated', 'dual', 'local', 'depth', 'which', 'is', 'a', 'local', 'depth', 'measure', 'for', 'data', 'in', 'a', 'banach', 'space', 'based', 'on', 'the', 'use', 'of', 'onedimensional', 'projections', 'the', 'properties', 'of', 'a', 'depth', 'measure', 'are', 'analyzed', 'under', 'this', 'setting', 'and', 'a', 'proper', 'definition', 'of', 'local', 'symmetry', 'is', 'given', 'moreover', 'strong', 'consistency', 'results', 'for', 'the', 'local', 'depth', 'and', 'also', 'for', 'the', 'local', 'depth', 'regions', 'are', 'attained', 'finally', 'applications', 'to', 'descriptive', 'data', 'analysis', 'and', 'classification', 'are', 'analyzed', 'making', 'the', 'special', 'focus', 'on', 'multivariate', 'functional', 'data', 'where', 'we', 'obtain', 'very', 'promising', 'results']] | [-0.06705972371387413, 0.027169918331007164, -0.09657697732849367, 0.0935390834173391, -0.07339009826189313, -0.08991842106755438, 0.04632052833257222, 0.41080432256747934, -0.2843830982201743, -0.23618793343033256, 0.16131603802773758, -0.24759742282812708, -0.12484100412834308, 0.22309965329865614, -0.08212394203894355, 0.06234848481099838, 0.05836805738722799, 0.06163080468045912, -0.11011301606208429, -0.2641219693856935, 0.33693663243889466, 0.042234970171047354, 0.34034527462489644, 0.040629713311015316, 0.10161615906406365, 0.044787875858360325, -0.0853558214991514, 0.09297867409380463, -0.17071215069756426, 0.18841789038744808, 0.22070026277275434, 0.13810670475379147, 0.24713502785769, -0.4121380852984971, -0.20140350069422489, 0.10172689526245512, 0.05734571657710891, 0.06444333892064062, -0.06271960769897733, -0.3059771907055515, 0.11363081880791605, -0.06780547558747489, -0.09714945437033372, -0.13540079041608963, 0.050917392885633586, 0.03423393242617791, -0.32038359863191157, 0.0655323192125973, 0.05378353021953298, 0.1269652786418453, -0.08526825561755519, -0.06336828070992453, -0.0069673832334663675, 0.11341909639772842, -0.026965904740038616, 0.016237370829076517, 0.10535858848383757, -0.15580678681693114, -0.06970679072727418, 0.3511079703082984, -0.06780402510675826, -0.21101186312360412, 0.21019194465285787, -0.1005940938197162, -0.16962621446120843, 0.03957199257257898, 0.18123772693262702, 0.11228585115837297, -0.15560677977300238, 0.10790394285985472, -0.09804127505584352, 0.14258680483774583, 0.03144729488004727, 0.08883600940007245, 0.14486231614203973, 0.18643793378068113, 0.12058749687376208, 0.15287929015962043, -0.14085817331683703, -0.06024086712484901, -0.3203955867766649, -0.15207997167846937, -0.18385366561298055, -0.02400967330623675, -0.11319043099744401, -0.14674760080103216, 0.3920565912414385, 0.1480302348754358, 0.25511691177092577, 0.08342565586603108, 0.2870038916710122, 0.1454864426398243, 0.04697993265641532, 0.05113287608342609, 0.19926536715878496, 0.12497982165465753, 0.05080957676755029, -0.13347095979415094, 0.03615945308394302, 0.06915890415809278] |
1,803.03628 | The Electric Two-echelon Vehicle Routing Problem | Two-echelon distribution systems are attractive from an economical standpoint
and help to keep large vehicles out of city centers. Large trucks can be used
to deliver goods to intermediate facilities in accessible locations, whereas
smaller vehicles allow to reach the final customers. Due to their reduced size
and emissions, companies consider using an electric fleet of terrestrian or
aerial vehicles for last mile deliveries. Route planning in multi-tier
logistics leads to notoriously difficult problems. This difficulty is accrued
in the presence of an electric fleet, since each vehicle operates on a smaller
range, and may require visits to charging stations. To study these challenges,
we introduce the Electric Two-echelon Vehicle Routing Problem as a prototypical
problem. We propose a large neighbourhood search metaheuristic as well as an
exact mathematical programming algorithm, which uses decomposition techniques
to enumerate promising first-level solutions, in conjunction with bounding
functions and route enumeration for the second-level routes. These algorithms
produce optimal or near-optimal solutions for the problem, and allow us to
evaluate the impact of several defining features of optimized battery-powered
distribution networks. We created representative E2EVRP benchmark instances to
simulate realistic metropolitan areas. In particular, we observe that the
detour miles due to recharging decrease proportionally to $1/\rho^x$ with $x
\approx 5/4$ as a function of the charging stations density $\rho$; e.g., in a
scenario where the density of charging stations is doubled, recharging detours
are reduced by 58\%. Finally, we evaluate the trade-off between battery
capacity and detour miles. This estimate is critical for strategic
fleet-acquisition decisions, in a context where large batteries are generally
more costly and less environment-friendly.
| cs.DS | twoechelon distribution systems are attractive from an economical standpoint and help to keep large vehicles out of city centers large trucks can be used to deliver goods to intermediate facilities in accessible locations whereas smaller vehicles allow to reach the final customers due to their reduced size and emissions companies consider using an electric fleet of terrestrian or aerial vehicles for last mile deliveries route planning in multitier logistics leads to notoriously difficult problems this difficulty is accrued in the presence of an electric fleet since each vehicle operates on a smaller range and may require visits to charging stations to study these challenges we introduce the electric twoechelon vehicle routing problem as a prototypical problem we propose a large neighbourhood search metaheuristic as well as an exact mathematical programming algorithm which uses decomposition techniques to enumerate promising firstlevel solutions in conjunction with bounding functions and route enumeration for the secondlevel routes these algorithms produce optimal or nearoptimal solutions for the problem and allow us to evaluate the impact of several defining features of optimized batterypowered distribution networks we created representative e2evrp benchmark instances to simulate realistic metropolitan areas in particular we observe that the detour miles due to recharging decrease proportionally to 1rhox with x approx 54 as a function of the charging stations density rho eg in a scenario where the density of charging stations is doubled recharging detours are reduced by 58 finally we evaluate the tradeoff between battery capacity and detour miles this estimate is critical for strategic fleetacquisition decisions in a context where large batteries are generally more costly and less environmentfriendly | [['twoechelon', 'distribution', 'systems', 'are', 'attractive', 'from', 'an', 'economical', 'standpoint', 'and', 'help', 'to', 'keep', 'large', 'vehicles', 'out', 'of', 'city', 'centers', 'large', 'trucks', 'can', 'be', 'used', 'to', 'deliver', 'goods', 'to', 'intermediate', 'facilities', 'in', 'accessible', 'locations', 'whereas', 'smaller', 'vehicles', 'allow', 'to', 'reach', 'the', 'final', 'customers', 'due', 'to', 'their', 'reduced', 'size', 'and', 'emissions', 'companies', 'consider', 'using', 'an', 'electric', 'fleet', 'of', 'terrestrian', 'or', 'aerial', 'vehicles', 'for', 'last', 'mile', 'deliveries', 'route', 'planning', 'in', 'multitier', 'logistics', 'leads', 'to', 'notoriously', 'difficult', 'problems', 'this', 'difficulty', 'is', 'accrued', 'in', 'the', 'presence', 'of', 'an', 'electric', 'fleet', 'since', 'each', 'vehicle', 'operates', 'on', 'a', 'smaller', 'range', 'and', 'may', 'require', 'visits', 'to', 'charging', 'stations', 'to', 'study', 'these', 'challenges', 'we', 'introduce', 'the', 'electric', 'twoechelon', 'vehicle', 'routing', 'problem', 'as', 'a', 'prototypical', 'problem', 'we', 'propose', 'a', 'large', 'neighbourhood', 'search', 'metaheuristic', 'as', 'well', 'as', 'an', 'exact', 'mathematical', 'programming', 'algorithm', 'which', 'uses', 'decomposition', 'techniques', 'to', 'enumerate', 'promising', 'firstlevel', 'solutions', 'in', 'conjunction', 'with', 'bounding', 'functions', 'and', 'route', 'enumeration', 'for', 'the', 'secondlevel', 'routes', 'these', 'algorithms', 'produce', 'optimal', 'or', 'nearoptimal', 'solutions', 'for', 'the', 'problem', 'and', 'allow', 'us', 'to', 'evaluate', 'the', 'impact', 'of', 'several', 'defining', 'features', 'of', 'optimized', 'batterypowered', 'distribution', 'networks', 'we', 'created', 'representative', 'e2evrp', 'benchmark', 'instances', 'to', 'simulate', 'realistic', 'metropolitan', 'areas', 'in', 'particular', 'we', 'observe', 'that', 'the', 'detour', 'miles', 'due', 'to', 'recharging', 'decrease', 'proportionally', 'to', '1rhox', 'with', 'x', 'approx', '54', 'as', 'a', 'function', 'of', 'the', 'charging', 'stations', 'density', 'rho', 'eg', 'in', 'a', 'scenario', 'where', 'the', 'density', 'of', 'charging', 'stations', 'is', 'doubled', 'recharging', 'detours', 'are', 'reduced', 'by', '58', 'finally', 'we', 'evaluate', 'the', 'tradeoff', 'between', 'battery', 'capacity', 'and', 'detour', 'miles', 'this', 'estimate', 'is', 'critical', 'for', 'strategic', 'fleetacquisition', 'decisions', 'in', 'a', 'context', 'where', 'large', 'batteries', 'are', 'generally', 'more', 'costly', 'and', 'less', 'environmentfriendly']] | [-0.14445315359183322, 0.08133876277864184, -0.010302801700592211, 0.06889732219672766, -0.09143029290743654, -0.17302847249936243, 0.1316282006840225, 0.3855639584999914, -0.26086000575659224, -0.39112242225543403, 0.10879410484835803, -0.2881444376546309, -0.09654482118294047, 0.18587557952355296, -0.14379625586782202, 0.042870345252774965, 0.06405413802978742, -0.0018680632316255977, -0.002864211677038465, -0.22728818825874547, 0.23355542910559735, 0.06340947341591743, 0.30519778323235847, 0.062001414563393524, 0.08190044545756207, -0.0075390439218498, 0.017923569200939352, 0.02076490066711837, -0.09562226678896009, 0.13271435562161793, 0.3380853691113539, 0.1452316813925175, 0.3110501781785896, -0.4860656902250682, -0.1780193829829291, 0.14751605588470024, 0.14971189670185708, 0.06284294099398241, 0.00046829169963799887, -0.2587682154842302, 0.10189737777974626, -0.22777473245403895, -0.12866838155190385, -0.05788018105254144, 0.03158570169701379, 0.06697089462576455, -0.304364654451552, -0.033124223408136984, -0.0828900665249286, 0.026369465825753464, -0.061742473707070485, -0.11080954319216707, 0.02085506236764953, 0.18327644989762046, 0.06053393810612111, 0.009722839095434989, 0.15376724503020767, -0.13081017613738286, -0.12690038375729987, 0.4200593701461082, 0.011908507233745855, -0.16797746649939752, 0.17884297202387295, -0.05342569749823598, -0.11096614879687022, 0.13432847170868611, 0.2523392596549422, 0.14840571386226145, -0.1726143866256871, -0.010487835997487188, 0.005151771922363854, 0.13034891508193863, 0.07372846990379331, 0.00909083692698665, 0.20719886813914765, 0.2220123659229763, 0.20830624879730916, 0.13581496433969303, -0.09804402973336938, -0.12092649951770179, -0.19901844397534266, -0.13014377775967667, -0.157814869519054, 0.04695454491709603, -0.08151229085298228, -0.1272791120553028, 0.33135585290355035, 0.19641079968186767, 0.15076976073126772, 0.0582717900397256, 0.326798960870617, 0.0852479173911615, 0.07918548745903481, 0.12043836980017023, 0.1452069070669132, 0.008867157142460629, 0.16175055961893028, -0.18490380004885829, 0.08064434161195497, 0.0037774252488380544] |
1,803.03629 | Bounds on Dark Matter annihilations from 21 cm data | The observation of an absorption feature in the 21 cm spectrum at redshift
$z\approx 17$ implies bounds on Dark Matter annihilations for a broad range of
masses, given that significant heating of the intergalactic medium would have
erased such feature. The resulting bounds on the DM annihilation cross sections
are comparable to the strongest ones from all other observables.
| astro-ph.CO hep-ph | the observation of an absorption feature in the 21 cm spectrum at redshift zapprox 17 implies bounds on dark matter annihilations for a broad range of masses given that significant heating of the intergalactic medium would have erased such feature the resulting bounds on the dm annihilation cross sections are comparable to the strongest ones from all other observables | [['the', 'observation', 'of', 'an', 'absorption', 'feature', 'in', 'the', '21', 'cm', 'spectrum', 'at', 'redshift', 'zapprox', '17', 'implies', 'bounds', 'on', 'dark', 'matter', 'annihilations', 'for', 'a', 'broad', 'range', 'of', 'masses', 'given', 'that', 'significant', 'heating', 'of', 'the', 'intergalactic', 'medium', 'would', 'have', 'erased', 'such', 'feature', 'the', 'resulting', 'bounds', 'on', 'the', 'dm', 'annihilation', 'cross', 'sections', 'are', 'comparable', 'to', 'the', 'strongest', 'ones', 'from', 'all', 'other', 'observables']] | [-0.08871034209190284, 0.15405855251508727, -0.0516414138551612, 0.10151208154225753, -0.06338358997225256, -0.05051697808775609, -0.008058016622533738, 0.3651502478317263, -0.18843948490665122, -0.35440259770947996, 0.005533067799583709, -0.34479987468191625, 0.06105031120448799, 0.2495572657622318, 0.095136992972723, 0.00775582578538333, 0.010948485008172564, 0.012659580194217673, -0.042782105530870654, -0.2604490718093969, 0.30626347015209304, 0.08896271003631212, 0.2101735997534657, 0.10747446077165462, 0.032331148983310846, -0.04134736972529504, -0.09482440998840888, -0.07108352177034495, -0.13840254183557235, 0.043576159924900125, 0.23799392132688377, 0.11194263911466666, 0.12630654197044167, -0.3476204365744429, -0.22898878603857958, 0.19407679776708453, 0.18113177253122806, 0.09612012807658668, -0.060344260900234016, -0.3194506803874747, 0.05211623102994794, -0.17421498476385566, -0.05956775584589627, 0.05375355477365902, 0.01558966034928621, -0.03765119950018697, -0.22429639981049349, 0.1192670454176427, 0.025672631898610774, -0.022112711285383016, -0.09209353319700744, -0.16993675965784213, -0.05142558906700904, 0.017877540046001894, 0.02780145181784943, -0.011118857821418067, 0.2356652467969363, -0.20503039066127296, -0.06953825206511606, 0.423132379665592, -0.13287246034685837, -0.026012399375943813, 0.19358171146931286, -0.19860269773309513, -0.17083876405179627, 0.2500540119106487, 0.21181168906603767, 0.056863368741410264, -0.1177254271598817, 0.08302401451362391, -0.05866633758138297, 0.19707418132131382, 0.07524399938440676, 0.10535240028905919, 0.2980011876009531, 0.080264065860597, 0.08985653612368061, -0.007344457635584966, -0.14544361806079997, -0.0025859369927922547, -0.3368075716040902, -0.0908245210490442, -0.13322711073185745, 0.06332106941963657, -0.15144574605086344, -0.0882043718159104, 0.33017747119953067, 0.14630826685372425, 0.3019738985320269, 0.05693288014854415, 0.29678081078612706, 0.1149752593867607, 0.09074198565114353, 0.07805000171381032, 0.3671393447508246, 0.15689671514713663, 0.07486001714685206, -0.15887078400938062, 0.04641996703694685, -0.002681791888928767] |
1,803.0363 | Importance of non-local electron correlations in BaNiS$_{2}$ semimetal
from quantum oscillations studies | By means of Shubnikov-de-Haas and de-Haas-van-Alphen oscillations, and ab
initio calculations, we have studied the Fermi surface of high-quality
BaNiS$_2$ single crystals, with mean free path $l \sim 400 ~\text{\AA}$. The
angle and temperature dependence of quantum oscillations indicates a
quasi-two-dimensional Fermi surface, made of an electron-like tube centred at
$\Gamma$, and of 4 hole-like cones, generated by Dirac bands, weakly dispersive
in the out-of-plane direction. Ab initio electronic structure calculations, in
the density functional theory framework, show that the inclusion of screened
exchange is necessary to account for the experimental Fermi pockets. Therefore,
the choice of the functional becomes crucial. A modified HSE hybrid functional
with 7% of exact exchange outperforms both GGA and GGA+U density functionals,
signalling the importance of non-local screened-exchange interactions in
BaNiS$_2$, and, more generally, in $3d$ compensated semimetals.
| cond-mat.mtrl-sci | by means of shubnikovdehaas and dehaasvanalphen oscillations and ab initio calculations we have studied the fermi surface of highquality banis_2 single crystals with mean free path l sim 400 textaa the angle and temperature dependence of quantum oscillations indicates a quasitwodimensional fermi surface made of an electronlike tube centred at gamma and of 4 holelike cones generated by dirac bands weakly dispersive in the outofplane direction ab initio electronic structure calculations in the density functional theory framework show that the inclusion of screened exchange is necessary to account for the experimental fermi pockets therefore the choice of the functional becomes crucial a modified hse hybrid functional with 7 of exact exchange outperforms both gga and ggau density functionals signalling the importance of nonlocal screenedexchange interactions in banis_2 and more generally in 3d compensated semimetals | [['by', 'means', 'of', 'shubnikovdehaas', 'and', 'dehaasvanalphen', 'oscillations', 'and', 'ab', 'initio', 'calculations', 'we', 'have', 'studied', 'the', 'fermi', 'surface', 'of', 'highquality', 'banis_2', 'single', 'crystals', 'with', 'mean', 'free', 'path', 'l', 'sim', '400', 'textaa', 'the', 'angle', 'and', 'temperature', 'dependence', 'of', 'quantum', 'oscillations', 'indicates', 'a', 'quasitwodimensional', 'fermi', 'surface', 'made', 'of', 'an', 'electronlike', 'tube', 'centred', 'at', 'gamma', 'and', 'of', '4', 'holelike', 'cones', 'generated', 'by', 'dirac', 'bands', 'weakly', 'dispersive', 'in', 'the', 'outofplane', 'direction', 'ab', 'initio', 'electronic', 'structure', 'calculations', 'in', 'the', 'density', 'functional', 'theory', 'framework', 'show', 'that', 'the', 'inclusion', 'of', 'screened', 'exchange', 'is', 'necessary', 'to', 'account', 'for', 'the', 'experimental', 'fermi', 'pockets', 'therefore', 'the', 'choice', 'of', 'the', 'functional', 'becomes', 'crucial', 'a', 'modified', 'hse', 'hybrid', 'functional', 'with', '7', 'of', 'exact', 'exchange', 'outperforms', 'both', 'gga', 'and', 'ggau', 'density', 'functionals', 'signalling', 'the', 'importance', 'of', 'nonlocal', 'screenedexchange', 'interactions', 'in', 'banis_2', 'and', 'more', 'generally', 'in', '3d', 'compensated', 'semimetals']] | [-0.1796402667647787, 0.17454378398445022, -0.07055204698282516, 0.0845859023716749, -0.02038478257426464, -0.14089807684866906, 0.08512264378142974, 0.37858040352810673, -0.24393571659561192, -0.2954546391213341, -0.08592833900205624, -0.36590214050027414, -0.1319086580022947, 0.16173390826425835, 0.0805429048043912, 0.029508094980951343, 0.041862781355053245, -0.05557824285881622, -0.14545890708182896, -0.17861738859731427, 0.2841167475493041, 0.06658375171211256, 0.2889609091190635, 0.10607571187064246, 0.030265158352462938, 0.07536792673462474, 0.04652764802927207, 0.07654652741751564, -0.15299321836910304, 0.11529857341770026, 0.24543061156395768, -0.11666302146292779, 0.23818530006257735, -0.4819610715329425, -0.229782151605642, -0.05507939009329499, 0.0957408114544936, 0.08193171538634976, -0.06021509793686503, -0.2747624080850562, 0.04548681660819409, -0.16200153620864974, -0.1447537568173677, -0.11990268739833455, -0.015120802758219861, 0.0054693039256467745, -0.20852611071704677, 0.17486443491166095, -0.025736790280719634, 0.0570709422227897, -0.1456188542017741, -0.1578500612861296, -0.0950358279688812, 0.004005156172467257, 0.03435159883454943, 0.07690690856413054, 0.15666574151984958, -0.08831050878203016, -0.06475182347096947, 0.3820160677753834, -0.0990639454850218, -0.13072058670709272, 0.13413475722347304, -0.18480032853392966, -0.09074899216821945, 0.1872841122598429, 0.0531564339119663, 0.07922151545410169, -0.14059626099822084, 0.1479946820859436, 0.015054881116184197, 0.16437322700156398, 0.04234104054118159, 0.02499900977196756, 0.20941502936411371, 0.15519168910243786, 0.05435572317349655, 0.018179367334623612, -0.18125151895653846, -0.06444237136052672, -0.2620230615903526, -0.1504800206983337, -0.20877696690149605, 0.03860222743198609, -0.05498997546889239, -0.23341753096806248, 0.38365379164912805, 0.08020770145274365, 0.125296659345405, -0.04366962062872585, 0.21262887822213902, 0.08904625125205033, 0.06023627059158883, 0.07638486325671312, 0.2329018844096963, 0.16766177624318082, 0.027309675242251426, -0.2764884420538516, 0.01613588554266868, 0.016991668403384955] |
1,803.03631 | Mechanics of magma chamber with the implication of the effect of CO2
fluxing | As the magma ascends from its depth of generation to the surface, it is often
stored in a series of chambers along the way. The rheological contrast between
the viscous magma in the magmatic chambers and the surrounding rocks disturbed
the stress field which can give rise to various modes of rock failure at
magmatic pressures less than the lithostatic stress, leading to an eruption.
Different modes of mechanical failure of the chamber walls are considered
depending on the geometry and the sign the relative pressure. Relaxation of
viscous stress around magmatic chambers, which is important on the time scale
of weeks to months is considered in the analysis of stability with application
to both large and extra-large magmatic chambers such as Yellowstone. The
effects of a strong deep CO2 flux in Yellowstone are considered in detail. The
analysis shows that variations in the flow rate around the observed mean value
of 40 kg/m2/yr in the hydrothermally active areas can change the composition of
the magma for several hundred thousand years, and cause periodic uplift and
subsidence of the caldera surface with a period of several decades.
| physics.geo-ph | as the magma ascends from its depth of generation to the surface it is often stored in a series of chambers along the way the rheological contrast between the viscous magma in the magmatic chambers and the surrounding rocks disturbed the stress field which can give rise to various modes of rock failure at magmatic pressures less than the lithostatic stress leading to an eruption different modes of mechanical failure of the chamber walls are considered depending on the geometry and the sign the relative pressure relaxation of viscous stress around magmatic chambers which is important on the time scale of weeks to months is considered in the analysis of stability with application to both large and extralarge magmatic chambers such as yellowstone the effects of a strong deep co2 flux in yellowstone are considered in detail the analysis shows that variations in the flow rate around the observed mean value of 40 kgm2yr in the hydrothermally active areas can change the composition of the magma for several hundred thousand years and cause periodic uplift and subsidence of the caldera surface with a period of several decades | [['as', 'the', 'magma', 'ascends', 'from', 'its', 'depth', 'of', 'generation', 'to', 'the', 'surface', 'it', 'is', 'often', 'stored', 'in', 'a', 'series', 'of', 'chambers', 'along', 'the', 'way', 'the', 'rheological', 'contrast', 'between', 'the', 'viscous', 'magma', 'in', 'the', 'magmatic', 'chambers', 'and', 'the', 'surrounding', 'rocks', 'disturbed', 'the', 'stress', 'field', 'which', 'can', 'give', 'rise', 'to', 'various', 'modes', 'of', 'rock', 'failure', 'at', 'magmatic', 'pressures', 'less', 'than', 'the', 'lithostatic', 'stress', 'leading', 'to', 'an', 'eruption', 'different', 'modes', 'of', 'mechanical', 'failure', 'of', 'the', 'chamber', 'walls', 'are', 'considered', 'depending', 'on', 'the', 'geometry', 'and', 'the', 'sign', 'the', 'relative', 'pressure', 'relaxation', 'of', 'viscous', 'stress', 'around', 'magmatic', 'chambers', 'which', 'is', 'important', 'on', 'the', 'time', 'scale', 'of', 'weeks', 'to', 'months', 'is', 'considered', 'in', 'the', 'analysis', 'of', 'stability', 'with', 'application', 'to', 'both', 'large', 'and', 'extralarge', 'magmatic', 'chambers', 'such', 'as', 'yellowstone', 'the', 'effects', 'of', 'a', 'strong', 'deep', 'co2', 'flux', 'in', 'yellowstone', 'are', 'considered', 'in', 'detail', 'the', 'analysis', 'shows', 'that', 'variations', 'in', 'the', 'flow', 'rate', 'around', 'the', 'observed', 'mean', 'value', 'of', '40', 'kgm2yr', 'in', 'the', 'hydrothermally', 'active', 'areas', 'can', 'change', 'the', 'composition', 'of', 'the', 'magma', 'for', 'several', 'hundred', 'thousand', 'years', 'and', 'cause', 'periodic', 'uplift', 'and', 'subsidence', 'of', 'the', 'caldera', 'surface', 'with', 'a', 'period', 'of', 'several', 'decades']] | [-0.10402154936581044, 0.17555343800521694, -0.06506384832885218, -0.004324577064756807, -0.01733371005519419, -0.02924890208397866, -0.024226537408508563, 0.3314505963410075, -0.2854139393396877, -0.3177712919794627, 0.17604013323041334, -0.2545045568632918, -0.09779537477565149, 0.21260491340496654, -0.0671013133449329, 0.01859376018810262, 0.023467284018123473, 0.03265283382371873, -0.07436265793528307, -0.2375886362184443, 0.24447821772380454, 0.07368545897817869, 0.2602702748848478, 0.07077739360503148, 0.09019868891132442, -0.09092000196562022, -0.02199639673045887, 0.019179539765055115, -0.12452587177367358, 0.06833699188270681, 0.22100091266722696, 0.055735118785319296, 0.23238608834862307, -0.508110641073939, -0.20300257259073692, 0.06479401204080598, 0.08508203155864534, 0.04938421682077082, 0.00020449273760203977, -0.21817925344158368, 0.05117005518562085, -0.1871778081158629, -0.13202671602972457, 0.002025228652574525, 0.07301940688221539, 0.008200971137832951, -0.19790972735783136, 0.12112683397088501, 0.050967294120149546, 0.11461984186458427, -0.11689570080551848, -0.10210080485589601, -0.053510603923476424, 0.12854188264700006, 0.13059789615280523, 0.005045069594288598, 0.19878591285936686, -0.15016884254920926, -0.04607021562453057, 0.37405574835232785, -0.07102057450439944, -0.10049805084394442, 0.255587434595155, -0.17077152023746356, -0.04280032535410813, 0.20514552405833997, 0.1999313925141217, 0.09327267877524718, -0.11739767587215111, -0.013501897702509588, -0.02543136516233554, 0.1421789512440965, 0.12193177500487985, -0.030329905344626387, 0.23244073735424192, 0.18983746627660317, 0.054386932051715416, 0.14763450003984208, -0.15859551013186196, -0.07869387141152008, -0.2899489965088464, -0.2001408054619222, -0.09843324793225809, 0.02810779537477002, -0.0776898014808319, -0.19420096504980244, 0.4149810428580118, 0.07738458326690503, 0.19737777354799815, -0.03871510574543798, 0.24835603765488878, 0.0292577939998434, 0.13768386465750596, 0.05097597157582641, 0.26850494627236715, 0.14058931161699867, 0.15903490923244407, -0.24995876648243065, 0.11791719666908722, 0.03702839884051197] |
1,803.03632 | Measurable selector in Kadison's carpenter's theorem | We show the existence of a measurable selector in Carpenter's Theorem due to
Kadison. This solves a problem posed by Jasper and the first author. As an
application we obtain a characterization of all possible spectral functions of
shift-invariant subspaces of $L^2(\mathbb R^d)$ and Carpenter's Theorem for
type I$_\infty$ von Neumann algebras.
| math.FA | we show the existence of a measurable selector in carpenters theorem due to kadison this solves a problem posed by jasper and the first author as an application we obtain a characterization of all possible spectral functions of shiftinvariant subspaces of l2mathbb rd and carpenters theorem for type i_infty von neumann algebras | [['we', 'show', 'the', 'existence', 'of', 'a', 'measurable', 'selector', 'in', 'carpenters', 'theorem', 'due', 'to', 'kadison', 'this', 'solves', 'a', 'problem', 'posed', 'by', 'jasper', 'and', 'the', 'first', 'author', 'as', 'an', 'application', 'we', 'obtain', 'a', 'characterization', 'of', 'all', 'possible', 'spectral', 'functions', 'of', 'shiftinvariant', 'subspaces', 'of', 'l2mathbb', 'rd', 'and', 'carpenters', 'theorem', 'for', 'type', 'i_infty', 'von', 'neumann', 'algebras']] | [-0.11860614140123989, 0.032060814970184134, -0.051756528994211785, 0.06763707933042987, -0.08353829343552487, -0.13493119141695878, 0.008663223304141026, 0.28591320498470363, -0.3365158083347174, -0.15069397886355335, 0.17634942026835723, -0.25088553628526056, -0.13627504136484975, 0.21898590938116497, -0.1926288199969209, 0.07602573845248956, 0.07454707779330559, 0.006218355838567591, -0.09894014105241065, -0.2265858409765105, 0.39089769748254466, -0.0434127210934933, 0.20369665457222325, 0.11617754557384895, 0.11651345720299734, 0.07238345796493097, -0.05569337363032481, -0.009076052891591994, -0.18844870708506697, 0.1220479692677215, 0.2897036015414275, 0.17803407576866448, 0.3346480120979742, -0.3118249830037642, -0.12725155961771423, 0.1880495659290598, 0.07480616677695742, 0.021830014490450803, -0.03336856856297415, -0.3387447116323389, 0.07611054320855495, -0.1812406311957882, -0.16716475558216468, -0.07406929240991864, 0.05230234402160232, -0.006116521419384158, -0.3255290879259029, 0.11260747119712715, 0.20369296526321426, 0.06051664588113244, -0.16127220240349954, -0.0872817564701948, 0.026485154611201815, 0.061725468813584976, -0.051683924841479614, 0.040292912968792595, 0.0194705028552562, -0.022852283477102622, -0.18081094779504034, 0.31492801556865185, -0.05389932021633005, -0.20701533509418368, 0.10866148770751002, -0.1320976415881887, -0.16268090104970795, -0.004136899271263526, 0.091470677669769, 0.12711567611684307, -0.11229225266008423, 0.1943904490080268, -0.15171661659573707, 0.06917029180420706, 0.15865093956773096, 0.03704790265944142, 0.06855407439154358, 0.10178887210069941, 0.16112755907950208, 0.15773961116344884, 0.031476160985990785, 0.046909435319741115, -0.360833409508744, -0.20394257947695082, -0.20926120105566673, 0.13421022311712688, -0.05429333390146404, -0.21367693866173235, 0.3695987317970811, 0.09530837418368229, 0.1798510426798692, 0.0906437849984146, 0.17756429484758812, 0.1133133671761383, 0.007126238193590185, 0.06411852889980835, 0.11194454424548894, 0.24928337109472173, 0.0726776380593387, -0.145863336045295, -0.03923843809976601, 0.24222761072003499] |
1,803.03633 | Holographic second laws of black hole thermodynamics | Recently, it has been shown that for out-of-equilibrium systems, there are
additional constraints on thermodynamical evolution besides the ordinary second
law. These form a new family of second laws of thermodynamics, which are
equivalent to the monotonicity of quantum R\'enyi divergences. In black hole
thermodynamics, the usual second law is manifest as the area increase theorem.
Hence one may ask if these additional laws imply new restrictions for
gravitational dynamics, such as for out-of-equilibrium black holes? Inspired by
this question, we study these constraints within the AdS/CFT correspondence.
First, we show that the R\'enyi divergence can be computed via a Euclidean path
integral for a certain class of excited CFT states. Applying this construction
to the boundary CFT, the R\'enyi divergence is evaluated as the renormalized
action for a particular bulk solution of a minimally coupled gravity-scalar
system. Further, within this framework, we show that there exist transitions
which are allowed by the traditional second law, but forbidden by the
additional thermodynamical constraints. We speculate on the implications of our
findings.
| hep-th gr-qc quant-ph | recently it has been shown that for outofequilibrium systems there are additional constraints on thermodynamical evolution besides the ordinary second law these form a new family of second laws of thermodynamics which are equivalent to the monotonicity of quantum renyi divergences in black hole thermodynamics the usual second law is manifest as the area increase theorem hence one may ask if these additional laws imply new restrictions for gravitational dynamics such as for outofequilibrium black holes inspired by this question we study these constraints within the adscft correspondence first we show that the renyi divergence can be computed via a euclidean path integral for a certain class of excited cft states applying this construction to the boundary cft the renyi divergence is evaluated as the renormalized action for a particular bulk solution of a minimally coupled gravityscalar system further within this framework we show that there exist transitions which are allowed by the traditional second law but forbidden by the additional thermodynamical constraints we speculate on the implications of our findings | [['recently', 'it', 'has', 'been', 'shown', 'that', 'for', 'outofequilibrium', 'systems', 'there', 'are', 'additional', 'constraints', 'on', 'thermodynamical', 'evolution', 'besides', 'the', 'ordinary', 'second', 'law', 'these', 'form', 'a', 'new', 'family', 'of', 'second', 'laws', 'of', 'thermodynamics', 'which', 'are', 'equivalent', 'to', 'the', 'monotonicity', 'of', 'quantum', 'renyi', 'divergences', 'in', 'black', 'hole', 'thermodynamics', 'the', 'usual', 'second', 'law', 'is', 'manifest', 'as', 'the', 'area', 'increase', 'theorem', 'hence', 'one', 'may', 'ask', 'if', 'these', 'additional', 'laws', 'imply', 'new', 'restrictions', 'for', 'gravitational', 'dynamics', 'such', 'as', 'for', 'outofequilibrium', 'black', 'holes', 'inspired', 'by', 'this', 'question', 'we', 'study', 'these', 'constraints', 'within', 'the', 'adscft', 'correspondence', 'first', 'we', 'show', 'that', 'the', 'renyi', 'divergence', 'can', 'be', 'computed', 'via', 'a', 'euclidean', 'path', 'integral', 'for', 'a', 'certain', 'class', 'of', 'excited', 'cft', 'states', 'applying', 'this', 'construction', 'to', 'the', 'boundary', 'cft', 'the', 'renyi', 'divergence', 'is', 'evaluated', 'as', 'the', 'renormalized', 'action', 'for', 'a', 'particular', 'bulk', 'solution', 'of', 'a', 'minimally', 'coupled', 'gravityscalar', 'system', 'further', 'within', 'this', 'framework', 'we', 'show', 'that', 'there', 'exist', 'transitions', 'which', 'are', 'allowed', 'by', 'the', 'traditional', 'second', 'law', 'but', 'forbidden', 'by', 'the', 'additional', 'thermodynamical', 'constraints', 'we', 'speculate', 'on', 'the', 'implications', 'of', 'our', 'findings']] | [-0.11602037251662811, 0.14847990908600084, -0.11606759345431251, 0.10687264673376445, -0.06619073436404878, -0.1639635272961306, 0.03302852499941419, 0.27932053306058313, -0.24882231316153416, -0.2891110932340094, 0.10676193976167546, -0.3080714185727619, -0.1663278592981899, 0.18149122663593867, -0.06720225999611076, 0.08885221046597114, 0.005480034008611277, 0.05664468882196959, -0.07493236498248203, -0.22492909451608945, 0.3661805150148116, 0.007767477405001545, 0.2539250290631289, 0.08071966265595099, 0.08485905784155019, -0.023250784466250077, 0.024080301788826173, 0.06714209280799181, -0.16483268258906458, 0.1256459080345237, 0.20604711961632932, 0.11295774739578758, 0.23907318516029863, -0.41205837674526097, -0.2699383599178155, 0.09497658111568955, 0.1305504297818553, 0.1163020192329603, -0.06717546930610153, -0.25127675351060447, 0.051769092749826044, -0.19184426873464855, -0.13668268109121692, -0.10835236384484329, 0.012294819344336178, -0.029007883152545957, -0.2398198512410037, 0.10433096198463127, 0.1035846908337148, 8.723691884667902e-05, -0.06919434736210482, -0.03858365709362388, -0.038820556351337694, 0.10502368334833292, 0.09059289240752134, 0.0024233164227627523, 0.12809392603996553, -0.11126742094662585, -0.12210515385210427, 0.3515047033692503, -0.039468506589390294, -0.1932808458205988, 0.14394160632414427, -0.16712702771414573, -0.2062769199024385, 0.0665599214980564, 0.09637312726689536, 0.15495725076271008, -0.18527100812534839, 0.12066496719677024, -0.040313701778954936, 0.13550977413447257, 0.08197455372585104, 0.07517106763811575, 0.2664523206048115, 0.06826292116287551, 0.054255524541289485, 0.20418959035747822, 0.013837206524617056, -0.162918827010384, -0.3771004157783518, -0.1750280201581119, -0.18822940841469674, 0.09380633083624187, -0.1048994096205706, -0.15067874160727993, 0.3117249960839552, 0.13665101082780404, 0.15634669687555372, 0.060389618234088026, 0.22397201735508368, 0.16359548635266133, 0.06997902780684115, 0.07689369546674323, 0.2900160961561123, 0.1123558136427568, 0.0786749341781115, -0.23550434695721512, 0.008860648788065154, 0.1354339429591265] |
1,803.03634 | Smooth orthogonal projections on Riemannian manifold | We construct a decomposition of the identity operator on a Riemannian
manifold $M$ as a sum of smooth orthogonal projections subordinate to an open
cover of $M$. This extends a decomposition of the real line by smooth
orthogonal projection due to Coifman, Meyer and Auscher, Weiss, Wickerhauser,
and a similar decomposition when $M$ is the sphere by the first two authors.
| math.CA math.DG | we construct a decomposition of the identity operator on a riemannian manifold m as a sum of smooth orthogonal projections subordinate to an open cover of m this extends a decomposition of the real line by smooth orthogonal projection due to coifman meyer and auscher weiss wickerhauser and a similar decomposition when m is the sphere by the first two authors | [['we', 'construct', 'a', 'decomposition', 'of', 'the', 'identity', 'operator', 'on', 'a', 'riemannian', 'manifold', 'm', 'as', 'a', 'sum', 'of', 'smooth', 'orthogonal', 'projections', 'subordinate', 'to', 'an', 'open', 'cover', 'of', 'm', 'this', 'extends', 'a', 'decomposition', 'of', 'the', 'real', 'line', 'by', 'smooth', 'orthogonal', 'projection', 'due', 'to', 'coifman', 'meyer', 'and', 'auscher', 'weiss', 'wickerhauser', 'and', 'a', 'similar', 'decomposition', 'when', 'm', 'is', 'the', 'sphere', 'by', 'the', 'first', 'two', 'authors']] | [-0.1482859109217922, 0.04576411156667746, -0.1011225271349152, 0.010914984997361899, -0.11364682734323045, -0.10451190231833607, 0.020664275026259324, 0.324205059496065, -0.27884825797130663, -0.19220453179441394, 0.16254476171452553, -0.2465082912395398, -0.14378545461416556, 0.1504518168629147, -0.15449636434204878, 0.007666674442589283, 0.05407098388920228, 0.00045790739047030606, -0.11502323985963206, -0.2243751627005016, 0.3952215358925362, -0.03426054534502328, 0.2259185183948527, 0.004251802115080258, 0.12458414950718483, 0.02953803396473328, -0.08922627596184611, 0.01857522080730026, -0.11322951256297528, 0.16847383558439713, 0.22759267973403136, 0.1176787483971566, 0.26756692680840694, -0.28674833515348536, -0.1612758960419645, 0.12252027684201797, 0.11354616649138431, -0.03382271494095524, 0.033618659562974544, -0.3156699235240618, 0.0940430221768717, -0.09165678885765374, -0.14395092194899917, -0.053608848713338375, 0.07943113834286729, 0.01549042242889603, -0.28447766426640253, -0.007202624576166272, 0.1571771651506424, 0.06796589964069426, -0.08527338519925251, -0.15634552071181437, 0.006030064778557668, 0.07816075566079235, -0.03739107108752553, 0.12781138579982024, 0.06610662435026218, 0.014189809347347667, -0.11505925733751307, 0.3460160993039608, -0.14111884807158884, -0.2700479645592471, 0.15208632159046828, -0.14855517781106756, -0.09281740030273795, 0.11966056443440418, 0.11397830458978812, 0.16270562421220044, -0.08341445583040089, 0.19656729550139668, -0.14835873466605942, 0.03848887642185825, 0.15078708318372566, -0.10087773866641024, 0.10201113688138624, 0.06442021205633258, 0.19092467857214312, 0.12146476486232131, -0.022137540862119446, -0.023096565747012694, -0.2868089490259687, -0.2100676203146577, -0.24256927204939227, 0.16861016735589754, -0.09663727455723953, -0.1949482609362652, 0.39649466207871836, -0.0173836309928447, 0.2879373373230919, 0.036037006756911676, 0.29141370685150225, 0.06718158107056903, 0.024937604926526545, 0.06909038606875886, 0.10861480470824365, 0.2564238771252955, 0.06701256922290971, -0.1705424216731141, -0.07549639247978727, 0.16866038395479943] |
1,803.03635 | The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks | Neural network pruning techniques can reduce the parameter counts of trained
networks by over 90%, decreasing storage requirements and improving
computational performance of inference without compromising accuracy. However,
contemporary experience is that the sparse architectures produced by pruning
are difficult to train from the start, which would similarly improve training
performance.
We find that a standard pruning technique naturally uncovers subnetworks
whose initializations made them capable of training effectively. Based on these
results, we articulate the "lottery ticket hypothesis:" dense,
randomly-initialized, feed-forward networks contain subnetworks ("winning
tickets") that - when trained in isolation - reach test accuracy comparable to
the original network in a similar number of iterations. The winning tickets we
find have won the initialization lottery: their connections have initial
weights that make training particularly effective.
We present an algorithm to identify winning tickets and a series of
experiments that support the lottery ticket hypothesis and the importance of
these fortuitous initializations. We consistently find winning tickets that are
less than 10-20% of the size of several fully-connected and convolutional
feed-forward architectures for MNIST and CIFAR10. Above this size, the winning
tickets that we find learn faster than the original network and reach higher
test accuracy.
| cs.LG cs.AI cs.NE | neural network pruning techniques can reduce the parameter counts of trained networks by over 90 decreasing storage requirements and improving computational performance of inference without compromising accuracy however contemporary experience is that the sparse architectures produced by pruning are difficult to train from the start which would similarly improve training performance we find that a standard pruning technique naturally uncovers subnetworks whose initializations made them capable of training effectively based on these results we articulate the lottery ticket hypothesis dense randomlyinitialized feedforward networks contain subnetworks winning tickets that when trained in isolation reach test accuracy comparable to the original network in a similar number of iterations the winning tickets we find have won the initialization lottery their connections have initial weights that make training particularly effective we present an algorithm to identify winning tickets and a series of experiments that support the lottery ticket hypothesis and the importance of these fortuitous initializations we consistently find winning tickets that are less than 1020 of the size of several fullyconnected and convolutional feedforward architectures for mnist and cifar10 above this size the winning tickets that we find learn faster than the original network and reach higher test accuracy | [['neural', 'network', 'pruning', 'techniques', 'can', 'reduce', 'the', 'parameter', 'counts', 'of', 'trained', 'networks', 'by', 'over', '90', 'decreasing', 'storage', 'requirements', 'and', 'improving', 'computational', 'performance', 'of', 'inference', 'without', 'compromising', 'accuracy', 'however', 'contemporary', 'experience', 'is', 'that', 'the', 'sparse', 'architectures', 'produced', 'by', 'pruning', 'are', 'difficult', 'to', 'train', 'from', 'the', 'start', 'which', 'would', 'similarly', 'improve', 'training', 'performance', 'we', 'find', 'that', 'a', 'standard', 'pruning', 'technique', 'naturally', 'uncovers', 'subnetworks', 'whose', 'initializations', 'made', 'them', 'capable', 'of', 'training', 'effectively', 'based', 'on', 'these', 'results', 'we', 'articulate', 'the', 'lottery', 'ticket', 'hypothesis', 'dense', 'randomlyinitialized', 'feedforward', 'networks', 'contain', 'subnetworks', 'winning', 'tickets', 'that', 'when', 'trained', 'in', 'isolation', 'reach', 'test', 'accuracy', 'comparable', 'to', 'the', 'original', 'network', 'in', 'a', 'similar', 'number', 'of', 'iterations', 'the', 'winning', 'tickets', 'we', 'find', 'have', 'won', 'the', 'initialization', 'lottery', 'their', 'connections', 'have', 'initial', 'weights', 'that', 'make', 'training', 'particularly', 'effective', 'we', 'present', 'an', 'algorithm', 'to', 'identify', 'winning', 'tickets', 'and', 'a', 'series', 'of', 'experiments', 'that', 'support', 'the', 'lottery', 'ticket', 'hypothesis', 'and', 'the', 'importance', 'of', 'these', 'fortuitous', 'initializations', 'we', 'consistently', 'find', 'winning', 'tickets', 'that', 'are', 'less', 'than', '1020', 'of', 'the', 'size', 'of', 'several', 'fullyconnected', 'and', 'convolutional', 'feedforward', 'architectures', 'for', 'mnist', 'and', 'cifar10', 'above', 'this', 'size', 'the', 'winning', 'tickets', 'that', 'we', 'find', 'learn', 'faster', 'than', 'the', 'original', 'network', 'and', 'reach', 'higher', 'test', 'accuracy']] | [-0.05890056030463656, 0.05890218652756612, -0.04565350285123045, 0.09876262252599154, -0.08780487329813139, -0.22448721011549386, 0.13739043383559743, 0.44471988532982043, -0.22723931739699543, -0.35362875418813555, 0.07219884103004896, -0.2479863348393226, -0.16893122701820137, 0.14941015155933685, -0.1267472216039801, 0.07360319038425402, 0.20384377067699572, 0.05704590827416705, -0.05498446320950966, -0.4052343471652866, 0.2538201849769839, 0.06677343500588014, 0.33094597516144264, -0.007294906182156707, 0.10885634158107771, -0.07509168587649602, 0.0061012168642969765, -0.02295216347022001, -0.02875397105864457, 0.1304587108624757, 0.2723125604703566, 0.2256791554272593, 0.37814408116878906, -0.46373860891528274, -0.15638874888382093, 0.14014095575810048, 0.12437435382993758, 0.08676566303961872, 0.01619502552012837, -0.3090795322002995, 0.12809324509236125, -0.185440200447504, -0.00030231204718988086, -0.14470729593315865, -0.03599936581853473, 0.021308890391825413, -0.28635716823176766, 0.0013950612974811668, 0.08181240712678564, 0.015610437146483027, 0.0038310520217886995, -0.16419985615980945, -0.023028807522139837, 0.15071004051052875, -0.000553543132976914, 0.037449317730069924, 0.15270915026396362, -0.19793974391151486, -0.16491932670671341, 0.31664349357787597, -0.03912115141785613, -0.1818288259816413, 0.1830491796717979, -0.03197809186650022, -0.155880144885171, 0.12994178485277355, 0.21824915802433828, 0.07423270818995958, -0.1109767098361252, -0.05082246328511617, -0.045765441768726677, 0.21628988690066095, 0.12772511560749025, 0.004619539641699165, 0.14252007231520183, 0.2707896652679795, 0.07525083866226961, 0.13809311084986228, -0.10325363855491207, -0.07968531692120227, -0.20203511078476108, -0.07551600022018146, -0.17733914357828623, -0.004985068576073046, -0.12704699647055145, -0.120919407061221, 0.3932580384152599, 0.26229922896089525, 0.212744380544624, 0.2071358650900205, 0.3120707584133999, -8.028719279610989e-05, 0.12793203438477763, 0.13499712357915253, 0.2285930157279149, -0.020039112395036737, 0.09238941865326951, -0.1700819911374663, 0.13205417507560924, 0.035901224215714525] |
1,803.03636 | Spin systems from loop soups | We study spin systems defined by the winding of a random walk loop soup. For
a particular choice of loop soup intensity, we show that the corresponding spin
system is reflection-positive and is dual, in the Kramers-Wannier sense, to the
spin system $\text{sgn}(\varphi)$ where $\varphi$ is a discrete Gaussian free
field.
In general, we show that the spin correlation functions have conformally
covariant scaling limits corresponding to the one-parameter family of functions
studied by Camia, Gandolfi and Kleban (Nuclear Physics B, 902, 2016) and
defined in terms of the winding of the Brownian loop soup. These functions have
properties consistent with the behavior of correlation functions of conformal
primaries in a conformal field theory. Here, we prove that they do correspond
to correlation functions of continuum fields (random generalized functions) for
values of the intensity of the Brownian loop soup that are not too large.
| math-ph math.MP math.PR | we study spin systems defined by the winding of a random walk loop soup for a particular choice of loop soup intensity we show that the corresponding spin system is reflectionpositive and is dual in the kramerswannier sense to the spin system textsgnvarphi where varphi is a discrete gaussian free field in general we show that the spin correlation functions have conformally covariant scaling limits corresponding to the oneparameter family of functions studied by camia gandolfi and kleban nuclear physics b 902 2016 and defined in terms of the winding of the brownian loop soup these functions have properties consistent with the behavior of correlation functions of conformal primaries in a conformal field theory here we prove that they do correspond to correlation functions of continuum fields random generalized functions for values of the intensity of the brownian loop soup that are not too large | [['we', 'study', 'spin', 'systems', 'defined', 'by', 'the', 'winding', 'of', 'a', 'random', 'walk', 'loop', 'soup', 'for', 'a', 'particular', 'choice', 'of', 'loop', 'soup', 'intensity', 'we', 'show', 'that', 'the', 'corresponding', 'spin', 'system', 'is', 'reflectionpositive', 'and', 'is', 'dual', 'in', 'the', 'kramerswannier', 'sense', 'to', 'the', 'spin', 'system', 'textsgnvarphi', 'where', 'varphi', 'is', 'a', 'discrete', 'gaussian', 'free', 'field', 'in', 'general', 'we', 'show', 'that', 'the', 'spin', 'correlation', 'functions', 'have', 'conformally', 'covariant', 'scaling', 'limits', 'corresponding', 'to', 'the', 'oneparameter', 'family', 'of', 'functions', 'studied', 'by', 'camia', 'gandolfi', 'and', 'kleban', 'nuclear', 'physics', 'b', '902', '2016', 'and', 'defined', 'in', 'terms', 'of', 'the', 'winding', 'of', 'the', 'brownian', 'loop', 'soup', 'these', 'functions', 'have', 'properties', 'consistent', 'with', 'the', 'behavior', 'of', 'correlation', 'functions', 'of', 'conformal', 'primaries', 'in', 'a', 'conformal', 'field', 'theory', 'here', 'we', 'prove', 'that', 'they', 'do', 'correspond', 'to', 'correlation', 'functions', 'of', 'continuum', 'fields', 'random', 'generalized', 'functions', 'for', 'values', 'of', 'the', 'intensity', 'of', 'the', 'brownian', 'loop', 'soup', 'that', 'are', 'not', 'too', 'large']] | [-0.1341042834246764, 0.2194962599880657, -0.0833803119474194, 0.08755507882112094, -0.02006283954768959, -0.10068787452635458, -0.02093169117142679, 0.3673684398462582, -0.215115642032793, -0.22176014169882466, 0.073635620902577, -0.26124456564300796, -0.17983386734138346, 0.1685694100007014, -0.0312608908118111, 0.0716600384808367, -0.020525696021246, 0.048837879902243406, -0.08273661185861177, -0.20793179259635508, 0.3385025577574399, 0.0038037707070341436, 0.2365913055804817, 0.017150084119445335, 0.12303716615618517, 0.025507756651172206, -0.008661347835893847, 0.049099835379618324, -0.12777967908287893, 0.0783555269348047, 0.16919357402285742, 0.05137959059114413, 0.20946606865618378, -0.38113540028118426, -0.1954822872260896, 0.12282372754351753, 0.12764865702249356, 0.040244034553729255, 0.00885841807434594, -0.2633430960510547, 0.05347991567234405, -0.150514841386919, -0.15359191855855492, -0.07349977356110078, 0.0380169336163413, 0.03992594797293552, -0.2668853753065277, 0.08668785406108429, 0.06842765027168854, 0.04291410786875834, -0.022140544625775267, -0.09028786022827262, -0.04849556520154389, 0.10937012779241842, 0.025883276418123085, 0.0690427111872446, 0.15825715503241453, -0.15104098545594347, -0.17440773924358333, 0.3213551789404947, -0.10370717421756126, -0.25285276116078925, 0.14236538570144652, -0.24994645645185504, -0.1806712103587213, 0.08514396787763366, 0.13480955734202224, 0.12465160420267946, -0.153443613251309, 0.17330336677332525, -0.07846377957119127, 0.10814917727839202, 0.056707575021492734, 0.04608473020400399, 0.216672742535593, 0.03854384569947595, 0.05228435241507315, 0.1600568074273825, -0.04008384965628567, -0.1712528139048825, -0.34224930465117925, -0.1519901557928986, -0.19370795786380768, 0.08826888032015429, -0.09528348354120277, -0.23056289186287257, 0.3849534868624889, 0.12382330511233401, 0.18711048643389303, 0.10225546643778216, 0.17800367648467524, 0.17020466615859833, 0.07409367550482987, 0.08157533452483928, 0.20096354855922982, 0.19563960175340375, 0.05240986071375017, -0.20466558915601732, -0.019547961603166186, 0.10706210160990143] |
1,803.03637 | Restrictions of aspherical arrangements | In this note we present examples of $K(\pi,1)$-arrangements which admit a
restriction which fails to be $K(\pi,1)$. This shows that asphericity is not
hereditary among hyperplane arrangements.
| math.AT math.GT | in this note we present examples of kpi1arrangements which admit a restriction which fails to be kpi1 this shows that asphericity is not hereditary among hyperplane arrangements | [['in', 'this', 'note', 'we', 'present', 'examples', 'of', 'kpi1arrangements', 'which', 'admit', 'a', 'restriction', 'which', 'fails', 'to', 'be', 'kpi1', 'this', 'shows', 'that', 'asphericity', 'is', 'not', 'hereditary', 'among', 'hyperplane', 'arrangements']] | [-0.13086533754204327, 0.05994675412344245, -0.13291958576211563, 0.08097238228387701, -0.161242818674789, -0.14425361949878818, -0.009224255148393031, 0.4108273306718239, -0.31080953468783545, -0.19722176529467106, 0.0400220460858411, -0.18388556158886507, -0.20424442308453414, 0.1596076245813702, -0.2213001695748132, -0.12058154493570328, 0.1132427451845545, 0.04022770840674639, -0.038968842396011144, -0.3295680150532952, 0.38713761361745685, -0.025814162459797584, 0.20420820681521526, 0.16233681878433204, 0.06144108401181606, -0.009343816827122983, 0.05930567092190568, 0.09122994491973749, -0.16958512843260765, 0.14785298314661935, 0.35575996790654385, 0.14506476247110045, 0.186648251918646, -0.32520004268735647, -0.13499755684572917, 0.2820326734620791, 0.16855029049698855, 0.1353210955231379, -0.04745799088134216, -0.1699698237129129, 0.11740636078712459, -0.16332209357418692, -0.17219442705838725, -0.07977184801935576, 0.043697621673345566, 0.04915435533397473, -0.2347722579545986, 0.056131245353474066, 0.24497602600604296, 0.10191039830589524, -0.01288394547569064, -0.006438422195899945, 0.01664941331658226, 0.02363268663891806, -0.0009728362515138892, 0.03173244554692736, 0.04885358193244498, -0.024240144510538533, -0.10272129381505343, 0.4279960726316159, 0.038585765000719294, -0.2683098609604013, 0.18335000790942174, -0.18932440887706783, -0.23280863771931484, 0.16889092498100722, 0.05530040247294192, 0.14296467279424319, -0.06575536727905273, 0.11936446256004274, -0.20349079825413915, 0.1462498169320707, 0.08507540016076885, 0.022642912361054465, 0.13293813183330572, 0.07606401957141665, 0.1273655036213593, 0.18628231847497562, 0.008642822790604372, 0.0012947795912623405, -0.39294969032590205, -0.18554779912273472, -0.14224281983199313, 0.11129457522418726, -0.03229721492299667, -0.23372092384558457, 0.35828945212639296, 0.14279422751412943, 0.2182810676212494, 0.08450243948922995, 0.1942460983991623, 0.024830818606110718, 0.12043434141490322, 0.06986714775960606, 0.2071972916332575, 0.13002234210188574, -0.00922983462134233, -0.11462179071699771, 0.10081377996203418, 0.13143697585194156] |
1,803.03638 | On the Numerical Robustness of the Streaming Instability: Particle
Concentration and Gas Dynamics in Protoplanetary Disks | The Streaming Instability (SI) is a mechanism to concentrate solids in
protoplanetary disks. Nonlinear particle clumping from the SI can trigger
gravitational collapse into planetesimals. To better understand the numerical
robustness of the SI, we perform a suite of vertically-stratified 3D
simulations with fixed physical parameters known to produce strong clumping. We
vary the numerical implementation, namely the computational domain size and the
vertical boundary conditions (vBCs), comparing newly-implemented outflow vBCs
to the previously-used periodic and reflecting vBCs. We find strong particle
clumping by the SI is mostly independent of the vBCs. However, peak particle
densities are higher in larger simulation domains due to a larger particle mass
reservoir. We report SI-triggered zonal flows, i.e., azimuthally-banded radial
variations of gas pressure. These structures have low amplitudes, insufficient
to halt particle radial drift, confirming that particle trapping in gas
pressure maxima is not the mechanism of the SI. We find that outflow vBCs
produce artificially large gas outflow rates at vertical boundaries. However,
the outflow vBCs reduce artificial reflections at vertical boundaries, allowing
more particle sedimentation, and showing less temporal variation and better
convergence with box size. The radial spacing of dense particle filaments is
$\sim0.15$ gas scale heights ($H$) for all vBCs, which sets the feeding zone
for planetesimal growth in self-gravitating simulations. Our results validate
the use of the outflow vBCs in SI simulations, even with vertical boundaries
close ($\leq 0.4H$) to the disk midplane. Overall, our study demonstrates the
numerical robustness of nonlinear particle clumping by the SI.
| astro-ph.EP | the streaming instability si is a mechanism to concentrate solids in protoplanetary disks nonlinear particle clumping from the si can trigger gravitational collapse into planetesimals to better understand the numerical robustness of the si we perform a suite of verticallystratified 3d simulations with fixed physical parameters known to produce strong clumping we vary the numerical implementation namely the computational domain size and the vertical boundary conditions vbcs comparing newlyimplemented outflow vbcs to the previouslyused periodic and reflecting vbcs we find strong particle clumping by the si is mostly independent of the vbcs however peak particle densities are higher in larger simulation domains due to a larger particle mass reservoir we report sitriggered zonal flows ie azimuthallybanded radial variations of gas pressure these structures have low amplitudes insufficient to halt particle radial drift confirming that particle trapping in gas pressure maxima is not the mechanism of the si we find that outflow vbcs produce artificially large gas outflow rates at vertical boundaries however the outflow vbcs reduce artificial reflections at vertical boundaries allowing more particle sedimentation and showing less temporal variation and better convergence with box size the radial spacing of dense particle filaments is sim015 gas scale heights h for all vbcs which sets the feeding zone for planetesimal growth in selfgravitating simulations our results validate the use of the outflow vbcs in si simulations even with vertical boundaries close leq 04h to the disk midplane overall our study demonstrates the numerical robustness of nonlinear particle clumping by the si | [['the', 'streaming', 'instability', 'si', 'is', 'a', 'mechanism', 'to', 'concentrate', 'solids', 'in', 'protoplanetary', 'disks', 'nonlinear', 'particle', 'clumping', 'from', 'the', 'si', 'can', 'trigger', 'gravitational', 'collapse', 'into', 'planetesimals', 'to', 'better', 'understand', 'the', 'numerical', 'robustness', 'of', 'the', 'si', 'we', 'perform', 'a', 'suite', 'of', 'verticallystratified', '3d', 'simulations', 'with', 'fixed', 'physical', 'parameters', 'known', 'to', 'produce', 'strong', 'clumping', 'we', 'vary', 'the', 'numerical', 'implementation', 'namely', 'the', 'computational', 'domain', 'size', 'and', 'the', 'vertical', 'boundary', 'conditions', 'vbcs', 'comparing', 'newlyimplemented', 'outflow', 'vbcs', 'to', 'the', 'previouslyused', 'periodic', 'and', 'reflecting', 'vbcs', 'we', 'find', 'strong', 'particle', 'clumping', 'by', 'the', 'si', 'is', 'mostly', 'independent', 'of', 'the', 'vbcs', 'however', 'peak', 'particle', 'densities', 'are', 'higher', 'in', 'larger', 'simulation', 'domains', 'due', 'to', 'a', 'larger', 'particle', 'mass', 'reservoir', 'we', 'report', 'sitriggered', 'zonal', 'flows', 'ie', 'azimuthallybanded', 'radial', 'variations', 'of', 'gas', 'pressure', 'these', 'structures', 'have', 'low', 'amplitudes', 'insufficient', 'to', 'halt', 'particle', 'radial', 'drift', 'confirming', 'that', 'particle', 'trapping', 'in', 'gas', 'pressure', 'maxima', 'is', 'not', 'the', 'mechanism', 'of', 'the', 'si', 'we', 'find', 'that', 'outflow', 'vbcs', 'produce', 'artificially', 'large', 'gas', 'outflow', 'rates', 'at', 'vertical', 'boundaries', 'however', 'the', 'outflow', 'vbcs', 'reduce', 'artificial', 'reflections', 'at', 'vertical', 'boundaries', 'allowing', 'more', 'particle', 'sedimentation', 'and', 'showing', 'less', 'temporal', 'variation', 'and', 'better', 'convergence', 'with', 'box', 'size', 'the', 'radial', 'spacing', 'of', 'dense', 'particle', 'filaments', 'is', 'sim015', 'gas', 'scale', 'heights', 'h', 'for', 'all', 'vbcs', 'which', 'sets', 'the', 'feeding', 'zone', 'for', 'planetesimal', 'growth', 'in', 'selfgravitating', 'simulations', 'our', 'results', 'validate', 'the', 'use', 'of', 'the', 'outflow', 'vbcs', 'in', 'si', 'simulations', 'even', 'with', 'vertical', 'boundaries', 'close', 'leq', '04h', 'to', 'the', 'disk', 'midplane', 'overall', 'our', 'study', 'demonstrates', 'the', 'numerical', 'robustness', 'of', 'nonlinear', 'particle', 'clumping', 'by', 'the', 'si']] | [-0.09110216143392702, 0.1550783650222471, -0.021098708251355996, 0.05757456526278533, -0.04670002056199366, -0.08878624552368908, -0.012528928845459896, 0.3927076070836084, -0.23570316345355805, -0.30775269937153243, 0.06367797728659841, -0.23041722831887104, -0.033843428407224915, 0.17068202715346426, -0.01272585786618067, 0.04737553997866569, 0.07252831788613431, -0.12330451772187746, -0.03704809164910036, -0.22311210474600235, 0.2931909861058117, 0.11247861176548947, 0.208647184445703, 0.04738616752823169, 0.05339659613955225, -0.12012769352182776, -0.03366729528211328, 0.013709935254507487, -0.20322900804562632, 0.03424706107433585, 0.1403621875384312, 0.04729973652886275, 0.25790127007020336, -0.47411202434394056, -0.2365177743885133, 0.026865122033820125, 0.20166961806488312, 0.11293668598039902, -0.06935515543503448, -0.2182741963159999, 0.07850555780967097, -0.14523534312649, -0.1772799372293746, 0.010289577336093756, 0.0365350991740988, 0.04818461858714375, -0.2840079518566434, 0.13596964549675072, 0.058368322966177194, 0.09163337135865848, -0.08560381236114359, -0.07122142342362373, -0.1040028007522661, 0.05356546379240876, 0.03643625358076421, 0.01010560195033078, 0.26036511344324437, -0.11691359309066508, -0.032063134558190924, 0.41041333850890005, -0.05844196259990455, -0.16849983677586292, 0.28098159593590083, -0.232402037900512, -0.0681548606284665, 0.2225318233644019, 0.18560335136604525, 0.06624076376723562, -0.06292877236715398, 0.006832113107520854, -0.04357905275021274, 0.18685802399094456, 0.1029980591669183, -0.003356057204185955, 0.2627001597467179, 0.14620394849654048, 0.05951104814425156, 0.10293958893875711, -0.18328996524665384, -0.09567372824418388, -0.236222832692757, -0.13857480958892754, -0.13656297858875815, 0.010915585632134142, -0.15968385421377118, -0.1646910687319882, 0.2921764849245759, 0.15879985175260733, 0.20236179273154947, 0.026500751379400403, 0.29830098123432347, 0.07346454631647982, 0.09135529240443101, 0.1328517559234188, 0.2590979851656518, 0.14473767957796582, 0.11891190979194137, -0.2943242962139794, 0.0758227267290368, 0.027569108183548276] |
1,803.03639 | Precision and Recall for Time Series | Classical anomaly detection is principally concerned with point-based
anomalies, those anomalies that occur at a single point in time. Yet, many
real-world anomalies are range-based, meaning they occur over a period of time.
Motivated by this observation, we present a new mathematical model to evaluate
the accuracy of time series classification algorithms. Our model expands the
well-known Precision and Recall metrics to measure ranges, while simultaneously
enabling customization support for domain-specific preferences.
| cs.LG cs.AI | classical anomaly detection is principally concerned with pointbased anomalies those anomalies that occur at a single point in time yet many realworld anomalies are rangebased meaning they occur over a period of time motivated by this observation we present a new mathematical model to evaluate the accuracy of time series classification algorithms our model expands the wellknown precision and recall metrics to measure ranges while simultaneously enabling customization support for domainspecific preferences | [['classical', 'anomaly', 'detection', 'is', 'principally', 'concerned', 'with', 'pointbased', 'anomalies', 'those', 'anomalies', 'that', 'occur', 'at', 'a', 'single', 'point', 'in', 'time', 'yet', 'many', 'realworld', 'anomalies', 'are', 'rangebased', 'meaning', 'they', 'occur', 'over', 'a', 'period', 'of', 'time', 'motivated', 'by', 'this', 'observation', 'we', 'present', 'a', 'new', 'mathematical', 'model', 'to', 'evaluate', 'the', 'accuracy', 'of', 'time', 'series', 'classification', 'algorithms', 'our', 'model', 'expands', 'the', 'wellknown', 'precision', 'and', 'recall', 'metrics', 'to', 'measure', 'ranges', 'while', 'simultaneously', 'enabling', 'customization', 'support', 'for', 'domainspecific', 'preferences']] | [-0.14524069608887658, 0.04282541776127699, -0.06519942283678877, 0.06044853029824379, -0.11204160227336818, -0.16592057192206588, 0.09160627341609345, 0.40448039155712145, -0.27031576045555994, -0.35022079665213823, 0.12207826305206658, -0.2520880578498084, -0.14705934039213592, 0.2119629245911104, -0.1221612224730456, 0.0761635470488626, 0.08920269800970952, 0.07069776389592637, -0.0704348093454933, -0.2818660974347343, 0.24746699148898996, 0.050758978351950645, 0.2994892619964149, 0.035112984740812356, 0.08559926414939885, -0.03538180210550005, -0.0850169521699071, 0.02625715399012228, -0.05396826522953941, 0.09300876056982411, 0.32184058908994, 0.17078301898355777, 0.23523973559753764, -0.36911791369008523, -0.2819649477347007, 0.1256838258381726, 0.08950337868494292, 0.08155178109518602, -0.019781448955958087, -0.307987157216606, 0.07070233886932126, -0.13743484285078011, -0.08770718953908524, -0.14078792987857014, 0.01704471900140763, -0.02956839188684373, -0.22652009706426826, 0.09078126562397099, 0.029739210220415972, 0.1096072086171868, -0.052251479493053116, -0.09028652716531521, 0.08608742191184622, 0.12892908295745859, 0.07521331747476426, 0.013832329707737599, 0.11587232185087891, -0.12712379553856104, -0.20031858207140532, 0.4045082805031497, -0.06257652971867679, -0.15943414222500804, 0.23816333853756078, -0.11584952228521514, -0.19313621485424745, 0.1591381511081838, 0.19889938041079505, 0.1431804141935168, -0.1462506385675321, 0.0397386681862473, -0.01264855981086536, 0.16371877472273708, 0.07812012635016193, -0.0014994889174381064, 0.2296190260062253, 0.2175387987194376, 0.01597096648361508, 0.041607087604158245, -0.05347780134535343, -0.08355843174892168, -0.2747799499629764, -0.14290761956120454, -0.11297918827686873, -0.04377078764244086, -0.06936234581755546, -0.14046915835287008, 0.4072298145749503, 0.21735683198898592, 0.22957883330592369, 0.13415157868682095, 0.2927181783856617, 0.0756896711940903, 0.08684358878498541, 0.05054664456272601, 0.19170034003845002, 0.008844643239475166, 0.1351850688240827, -0.1534841732031459, 0.09055064853358392, 0.025954860851116892] |
1,803.0364 | Signature Calculation of Area Hermitian Form on Some Spaces of Polygons | This chapter is motivated by the paper by Thurston on triangulations of the
sphere and singular flat metrics on the sphere. Thurston locally parametrized
the moduli space of singular flat metrics on the sphere with prescribed
positive curvature data by the complex hyperbolic space of appropriate
dimension. This work can be considered as a generalization of signature
calculation of the Hermitian form that he made in his paper.
The moduli space of singular flat metrics having unit area on the sphere with
prescribed curvature data can be locally parametrized by certain spaces of
polygons. This can be done by cutting singular flat spheres through length
minimizing geodesics from a fixed singular point to the others. In that case
the space of polygons is a complex vector space of dimension $n-1$ when there
are $n+1$ singular points. Also there is natural area Hermitian form of
signature $(1,n-2)$ on this vector space. In this chapter we calculate the
signature of the area Hermitian form on some spaces of polygons which locally
parametrize the moduli space of singular flat metrics having unit area on the
sphere with one singular point of negative curvature. The formula we obtain
depends only on the sum of the curvatures of the singular points having
positive curvature.
This paper will appear in the book "In the tradition of Thurston, Vol. II",
Springer, 2022.
| math.MG | this chapter is motivated by the paper by thurston on triangulations of the sphere and singular flat metrics on the sphere thurston locally parametrized the moduli space of singular flat metrics on the sphere with prescribed positive curvature data by the complex hyperbolic space of appropriate dimension this work can be considered as a generalization of signature calculation of the hermitian form that he made in his paper the moduli space of singular flat metrics having unit area on the sphere with prescribed curvature data can be locally parametrized by certain spaces of polygons this can be done by cutting singular flat spheres through length minimizing geodesics from a fixed singular point to the others in that case the space of polygons is a complex vector space of dimension n1 when there are n1 singular points also there is natural area hermitian form of signature 1n2 on this vector space in this chapter we calculate the signature of the area hermitian form on some spaces of polygons which locally parametrize the moduli space of singular flat metrics having unit area on the sphere with one singular point of negative curvature the formula we obtain depends only on the sum of the curvatures of the singular points having positive curvature this paper will appear in the book in the tradition of thurston vol ii springer 2022 | [['this', 'chapter', 'is', 'motivated', 'by', 'the', 'paper', 'by', 'thurston', 'on', 'triangulations', 'of', 'the', 'sphere', 'and', 'singular', 'flat', 'metrics', 'on', 'the', 'sphere', 'thurston', 'locally', 'parametrized', 'the', 'moduli', 'space', 'of', 'singular', 'flat', 'metrics', 'on', 'the', 'sphere', 'with', 'prescribed', 'positive', 'curvature', 'data', 'by', 'the', 'complex', 'hyperbolic', 'space', 'of', 'appropriate', 'dimension', 'this', 'work', 'can', 'be', 'considered', 'as', 'a', 'generalization', 'of', 'signature', 'calculation', 'of', 'the', 'hermitian', 'form', 'that', 'he', 'made', 'in', 'his', 'paper', 'the', 'moduli', 'space', 'of', 'singular', 'flat', 'metrics', 'having', 'unit', 'area', 'on', 'the', 'sphere', 'with', 'prescribed', 'curvature', 'data', 'can', 'be', 'locally', 'parametrized', 'by', 'certain', 'spaces', 'of', 'polygons', 'this', 'can', 'be', 'done', 'by', 'cutting', 'singular', 'flat', 'spheres', 'through', 'length', 'minimizing', 'geodesics', 'from', 'a', 'fixed', 'singular', 'point', 'to', 'the', 'others', 'in', 'that', 'case', 'the', 'space', 'of', 'polygons', 'is', 'a', 'complex', 'vector', 'space', 'of', 'dimension', 'n1', 'when', 'there', 'are', 'n1', 'singular', 'points', 'also', 'there', 'is', 'natural', 'area', 'hermitian', 'form', 'of', 'signature', '1n2', 'on', 'this', 'vector', 'space', 'in', 'this', 'chapter', 'we', 'calculate', 'the', 'signature', 'of', 'the', 'area', 'hermitian', 'form', 'on', 'some', 'spaces', 'of', 'polygons', 'which', 'locally', 'parametrize', 'the', 'moduli', 'space', 'of', 'singular', 'flat', 'metrics', 'having', 'unit', 'area', 'on', 'the', 'sphere', 'with', 'one', 'singular', 'point', 'of', 'negative', 'curvature', 'the', 'formula', 'we', 'obtain', 'depends', 'only', 'on', 'the', 'sum', 'of', 'the', 'curvatures', 'of', 'the', 'singular', 'points', 'having', 'positive', 'curvature', 'this', 'paper', 'will', 'appear', 'in', 'the', 'book', 'in', 'the', 'tradition', 'of', 'thurston', 'vol', 'ii', 'springer', '2022']] | [-0.17346680080725088, 0.10280024510290887, -0.07084850631447302, 0.03765321913589206, -0.08810648925291996, -0.12444984410682486, 0.0025456513190228076, 0.3315965137713485, -0.24928680202406314, -0.19912762352110197, 0.13694214280022102, -0.2892454310382406, -0.1968167446884844, 0.17639892823166317, -0.1544503559668859, 0.0354719735806187, 0.03663331882821189, 0.0773728022020724, -0.10722494648976458, -0.32907804707686106, 0.4794164533581999, 0.02365148428413603, 0.21623317906012138, 0.04209445364773273, 0.10938950007606764, 0.014291716684690781, -0.03501467945364614, 0.06005564685613434, -0.18213557128994984, 0.1705138302801384, 0.24697763015412622, 0.062166273391081224, 0.20162923719630474, -0.3692513744657238, -0.21206269351558552, 0.19747622330414338, 0.10618539835015933, -0.014652893293338517, 0.04262997551924653, -0.26609738377543785, 0.06404452679057916, -0.06324983323406842, -0.19138409042317006, -0.053251151446666985, 0.04117237223519219, -0.020730695981118413, -0.14091669080158076, 0.011285799781972956, 0.07304666542344623, 0.08303352745489166, -0.082423284381835, -0.10097504127563701, -0.04488608173508611, 0.08293570183696122, 0.05693339640999006, 0.0881557618154006, 0.10002695659382475, -0.04193684685871833, -0.07792064707312318, 0.36973205163350537, -0.07040339156985283, -0.29328101479758817, 0.0931385514119433, -0.15887349849566818, -0.09022426675849905, 0.14394745983597304, 0.1715075692606883, 0.15422065435598295, -0.045465064991795874, 0.20180380144027166, -0.07710809302412801, 0.07516395107765371, 0.15894228578648634, -0.02960374746264683, 0.20146305033730136, 0.08117496014365719, 0.12690239013483126, 0.12411380598373298, -0.040046077126430144, -0.11325636547421002, -0.3762246956427892, -0.21614487151304881, -0.21658903836065696, 0.13953162252385584, -0.16308167488411224, -0.23707044309626024, 0.3760771259986278, -0.03512462764357527, 0.2365365443813304, 0.086026231255641, 0.24951738284693825, 0.057809082274583895, 0.044187796463569004, 0.08406430276110768, 0.21767387704988425, 0.09330742698938896, 0.06143281714990735, -0.10203727662822025, -0.0405155803824568, 0.16384629158406622] |
1,803.03641 | X-ray emission from black-hole and neutron-star binaries | In this chapter, I present the main X-ray observational characteristics of
black-hole binaries and low magnetic field neutron-star binaries, concentrating
on what can be considered similarities or differences, with particular emphasis
on their fast-timing behaviour.
| astro-ph.HE | in this chapter i present the main xray observational characteristics of blackhole binaries and low magnetic field neutronstar binaries concentrating on what can be considered similarities or differences with particular emphasis on their fasttiming behaviour | [['in', 'this', 'chapter', 'i', 'present', 'the', 'main', 'xray', 'observational', 'characteristics', 'of', 'blackhole', 'binaries', 'and', 'low', 'magnetic', 'field', 'neutronstar', 'binaries', 'concentrating', 'on', 'what', 'can', 'be', 'considered', 'similarities', 'or', 'differences', 'with', 'particular', 'emphasis', 'on', 'their', 'fasttiming', 'behaviour']] | [-0.12461050448140927, 0.1414584746052112, -0.050048631988465785, 0.18399896939351623, -0.15191824745519886, -0.10084223640816552, 0.02614462462786053, 0.4153079445606896, -0.13364334601376737, -0.3468536019325256, 0.13767656211275608, -0.32433315169598376, -0.10152154432476632, 0.23440959876004075, -0.07307859361171723, -0.019377021118998528, 0.10664443006472928, 0.0018640546394245966, -0.08618929541802832, -0.2577689306012222, 0.42717322600739344, 0.06974861371730055, 0.14100537711388564, -0.021309427664216077, 0.02067421022469976, -0.030949286012245076, -0.028392578714660235, 0.035015597473829985, -0.15347782034160837, 0.06958707546416137, 0.2840711977865015, 0.11551348245037453, 0.1514837827001299, -0.42291623247521265, -0.2066020380705595, 0.027258776540734938, 0.1485665735322982, 0.013328920251556806, -0.1066379879933915, -0.23272654355636666, 0.05991874428000301, -0.21117743764937455, -0.1112665240253721, 0.01062986504818712, 0.03680928199485477, 0.1499718601150172, -0.083997403111841, 0.04143566989472934, 0.11296596596283572, 0.08067602589726448, -0.12472857162356377, -0.14573388834084783, 0.0462525935976633, 0.08619122918296074, 0.1383595130273274, 0.041759671816336254, 0.12491537002580506, -0.1393724541512451, -0.08614294105874641, 0.3722933012459959, 0.013439346104860306, -0.09889398022953953, 0.23980971769030604, -0.24773895447807653, -0.20667316490518195, 0.020413153379091196, 0.21098633411207368, 0.14455343170889787, -0.13119973256917936, 0.04354322888539173, 0.08596760682495577, 0.217190433293581, 0.037795276647167544, 0.12357373418552535, 0.4029665380716324, 0.17400011733906076, -0.09936229674411672, 0.1295342760393396, -0.14911953491557922, -0.047429738007485865, -0.25942054913279466, -0.06051262352349503, -0.10532742652909031, 0.14212411333407673, -0.08890588018735539, -0.17057933158108166, 0.36218233349333917, 0.1447609076309683, 0.1772628399410418, -0.055448063596018726, 0.290870340580919, 0.08740021272429398, -0.0516503547783941, 0.052690913900732994, 0.336023694436465, 0.15379466712474824, 0.14128818038318838, -0.2695722179686917, 0.08474089273118547, -0.022809743295822825] |
1,803.03642 | Deep Auxiliary Learning for Visual Localization and Odometry | Localization is an indispensable component of a robot's autonomy stack that
enables it to determine where it is in the environment, essentially making it a
precursor for any action execution or planning. Although convolutional neural
networks have shown promising results for visual localization, they are still
grossly outperformed by state-of-the-art local feature-based techniques. In
this work, we propose VLocNet, a new convolutional neural network architecture
for 6-DoF global pose regression and odometry estimation from consecutive
monocular images. Our multitask model incorporates hard parameter sharing, thus
being compact and enabling real-time inference, in addition to being end-to-end
trainable. We propose a novel loss function that utilizes auxiliary learning to
leverage relative pose information during training, thereby constraining the
search space to obtain consistent pose estimates. We evaluate our proposed
VLocNet on indoor as well as outdoor datasets and show that even our single
task model exceeds the performance of state-of-the-art deep architectures for
global localization, while achieving competitive performance for visual
odometry estimation. Furthermore, we present extensive experimental evaluations
utilizing our proposed Geometric Consistency Loss that show the effectiveness
of multitask learning and demonstrate that our model is the first deep learning
technique to be on par with, and in some cases outperforms state-of-the-art
SIFT-based approaches.
| cs.RO cs.LG | localization is an indispensable component of a robots autonomy stack that enables it to determine where it is in the environment essentially making it a precursor for any action execution or planning although convolutional neural networks have shown promising results for visual localization they are still grossly outperformed by stateoftheart local featurebased techniques in this work we propose vlocnet a new convolutional neural network architecture for 6dof global pose regression and odometry estimation from consecutive monocular images our multitask model incorporates hard parameter sharing thus being compact and enabling realtime inference in addition to being endtoend trainable we propose a novel loss function that utilizes auxiliary learning to leverage relative pose information during training thereby constraining the search space to obtain consistent pose estimates we evaluate our proposed vlocnet on indoor as well as outdoor datasets and show that even our single task model exceeds the performance of stateoftheart deep architectures for global localization while achieving competitive performance for visual odometry estimation furthermore we present extensive experimental evaluations utilizing our proposed geometric consistency loss that show the effectiveness of multitask learning and demonstrate that our model is the first deep learning technique to be on par with and in some cases outperforms stateoftheart siftbased approaches | [['localization', 'is', 'an', 'indispensable', 'component', 'of', 'a', 'robots', 'autonomy', 'stack', 'that', 'enables', 'it', 'to', 'determine', 'where', 'it', 'is', 'in', 'the', 'environment', 'essentially', 'making', 'it', 'a', 'precursor', 'for', 'any', 'action', 'execution', 'or', 'planning', 'although', 'convolutional', 'neural', 'networks', 'have', 'shown', 'promising', 'results', 'for', 'visual', 'localization', 'they', 'are', 'still', 'grossly', 'outperformed', 'by', 'stateoftheart', 'local', 'featurebased', 'techniques', 'in', 'this', 'work', 'we', 'propose', 'vlocnet', 'a', 'new', 'convolutional', 'neural', 'network', 'architecture', 'for', '6dof', 'global', 'pose', 'regression', 'and', 'odometry', 'estimation', 'from', 'consecutive', 'monocular', 'images', 'our', 'multitask', 'model', 'incorporates', 'hard', 'parameter', 'sharing', 'thus', 'being', 'compact', 'and', 'enabling', 'realtime', 'inference', 'in', 'addition', 'to', 'being', 'endtoend', 'trainable', 'we', 'propose', 'a', 'novel', 'loss', 'function', 'that', 'utilizes', 'auxiliary', 'learning', 'to', 'leverage', 'relative', 'pose', 'information', 'during', 'training', 'thereby', 'constraining', 'the', 'search', 'space', 'to', 'obtain', 'consistent', 'pose', 'estimates', 'we', 'evaluate', 'our', 'proposed', 'vlocnet', 'on', 'indoor', 'as', 'well', 'as', 'outdoor', 'datasets', 'and', 'show', 'that', 'even', 'our', 'single', 'task', 'model', 'exceeds', 'the', 'performance', 'of', 'stateoftheart', 'deep', 'architectures', 'for', 'global', 'localization', 'while', 'achieving', 'competitive', 'performance', 'for', 'visual', 'odometry', 'estimation', 'furthermore', 'we', 'present', 'extensive', 'experimental', 'evaluations', 'utilizing', 'our', 'proposed', 'geometric', 'consistency', 'loss', 'that', 'show', 'the', 'effectiveness', 'of', 'multitask', 'learning', 'and', 'demonstrate', 'that', 'our', 'model', 'is', 'the', 'first', 'deep', 'learning', 'technique', 'to', 'be', 'on', 'par', 'with', 'and', 'in', 'some', 'cases', 'outperforms', 'stateoftheart', 'siftbased', 'approaches']] | [-0.05165716783064077, -0.04054772523281494, -0.05529173253694686, 0.033083775019693396, -0.10007921658547186, -0.20704771249850348, -0.0012409909679440827, 0.49509667585172307, -0.2312530598853056, -0.3361555511268174, 0.07300269915154431, -0.23881708936902082, -0.23973919142878092, 0.21826172681956937, -0.1860154864196552, 0.11721305085300672, 0.1923204515901644, 0.037740217202070464, -0.08043755016732597, -0.27891038769356363, 0.26947516338237265, 0.05561846908516955, 0.34012031745188304, 0.03582756881340884, 0.17319847666772037, 0.014044334504344478, -0.0013091612368731236, -0.027472105315503474, -0.035933791860837276, 0.19994625468289753, 0.30956562905140766, 0.19906356383751078, 0.3013339455761924, -0.38416374992244173, -0.2761568663619095, 0.07203112833610759, 0.17319705436551353, 0.08285981086033067, -0.041135275786424556, -0.37708455955655107, 0.09143363627855007, -0.1864700236709834, 0.035356386412480255, -0.1971562476919555, -0.04512596048312489, -0.03852967674895076, -0.33448794578633656, 0.03940024318673262, 0.051097613213216125, 0.039718841188927975, -0.07986433691708598, -0.10736436811162205, 0.049566522537639775, 0.1823752256712263, 0.009355092577340945, 0.08669191633135354, 0.14581470412128356, -0.21408925857249414, -0.14867983877704274, 0.3396677869349355, -0.06795040193104708, -0.20741381607836157, 0.22106249649077653, 0.005062333601186188, -0.1658708421013704, 0.08809828044074337, 0.2241925957703554, 0.12751727727037376, -0.15366136068478226, 0.006973162329494499, -0.05002902732117147, 0.18908096966333687, 0.01027187210530406, 0.007144381149058662, 0.15381540716285022, 0.30861768414629853, 0.09386062371578613, 0.12222480683008255, -0.16536276450028597, -0.06552649596365305, -0.19665951069171836, -0.10032074352294752, -0.18696445740941095, -0.04265685874469033, -0.11038167951365921, -0.13353399553367437, 0.37662199456471857, 0.30173985238028006, 0.2061129602137953, 0.18297472922017843, 0.42270442429112226, 0.015764028179777286, 0.12197804417086357, 0.12583041817216747, 0.23608473325048845, -0.024945298003078233, 0.09420235614951064, -0.1893828795081368, 0.11138705354064657, 0.06259795897640288] |
1,803.03643 | Pollen Patterns Form from Modulated Phases | Pollen grains are known for their impressive variety of species-specific,
microscale surface patterning. Despite having similar biological developmental
steps, pollen grain surface features are remarkably geometrically varied.
Previous work suggests that a physical process may drive this pattern formation
and that the observed diversity of patterns can be explained by viewing pollen
pattern development as a phase transition to a spatially modulated phase.
Several studies have shown that the polysaccharide material of plant cell walls
undergoes phase separation in the absence of cross-linking stabilizers of the
mixed phase. Here we show experimental evidence of a change in density of the
extracellular polysaccharide material (primexine) during pollen cell
development leads to a spatially modulated phase. The spatial pattern of this
phase-separated primexine is also mechanically coupled to the undulation of the
pollen cell membrane. The resulting patterned pools of denser primexine form
the negative template of the ultimate sites of sporopollenin deposition,
leading to the final micropattern observed in the mature pollen. We then
present a general physical model of pattern formation via modulated phases.
Using analytical and numerical techniques, we find that most of the pollen
micropatterns observed in biological evolution could result from a physical
process of modulated phases. However, an analysis of the relative rates of
transitions from states that are equilibrated to or from states that are not
equilibrated suggests that while equilibrium states of this process have
occurred throughout evolutionary history, there has been no particular
evolutionary selection for distinctly patterned equilibrated states.
| cond-mat.soft | pollen grains are known for their impressive variety of speciesspecific microscale surface patterning despite having similar biological developmental steps pollen grain surface features are remarkably geometrically varied previous work suggests that a physical process may drive this pattern formation and that the observed diversity of patterns can be explained by viewing pollen pattern development as a phase transition to a spatially modulated phase several studies have shown that the polysaccharide material of plant cell walls undergoes phase separation in the absence of crosslinking stabilizers of the mixed phase here we show experimental evidence of a change in density of the extracellular polysaccharide material primexine during pollen cell development leads to a spatially modulated phase the spatial pattern of this phaseseparated primexine is also mechanically coupled to the undulation of the pollen cell membrane the resulting patterned pools of denser primexine form the negative template of the ultimate sites of sporopollenin deposition leading to the final micropattern observed in the mature pollen we then present a general physical model of pattern formation via modulated phases using analytical and numerical techniques we find that most of the pollen micropatterns observed in biological evolution could result from a physical process of modulated phases however an analysis of the relative rates of transitions from states that are equilibrated to or from states that are not equilibrated suggests that while equilibrium states of this process have occurred throughout evolutionary history there has been no particular evolutionary selection for distinctly patterned equilibrated states | [['pollen', 'grains', 'are', 'known', 'for', 'their', 'impressive', 'variety', 'of', 'speciesspecific', 'microscale', 'surface', 'patterning', 'despite', 'having', 'similar', 'biological', 'developmental', 'steps', 'pollen', 'grain', 'surface', 'features', 'are', 'remarkably', 'geometrically', 'varied', 'previous', 'work', 'suggests', 'that', 'a', 'physical', 'process', 'may', 'drive', 'this', 'pattern', 'formation', 'and', 'that', 'the', 'observed', 'diversity', 'of', 'patterns', 'can', 'be', 'explained', 'by', 'viewing', 'pollen', 'pattern', 'development', 'as', 'a', 'phase', 'transition', 'to', 'a', 'spatially', 'modulated', 'phase', 'several', 'studies', 'have', 'shown', 'that', 'the', 'polysaccharide', 'material', 'of', 'plant', 'cell', 'walls', 'undergoes', 'phase', 'separation', 'in', 'the', 'absence', 'of', 'crosslinking', 'stabilizers', 'of', 'the', 'mixed', 'phase', 'here', 'we', 'show', 'experimental', 'evidence', 'of', 'a', 'change', 'in', 'density', 'of', 'the', 'extracellular', 'polysaccharide', 'material', 'primexine', 'during', 'pollen', 'cell', 'development', 'leads', 'to', 'a', 'spatially', 'modulated', 'phase', 'the', 'spatial', 'pattern', 'of', 'this', 'phaseseparated', 'primexine', 'is', 'also', 'mechanically', 'coupled', 'to', 'the', 'undulation', 'of', 'the', 'pollen', 'cell', 'membrane', 'the', 'resulting', 'patterned', 'pools', 'of', 'denser', 'primexine', 'form', 'the', 'negative', 'template', 'of', 'the', 'ultimate', 'sites', 'of', 'sporopollenin', 'deposition', 'leading', 'to', 'the', 'final', 'micropattern', 'observed', 'in', 'the', 'mature', 'pollen', 'we', 'then', 'present', 'a', 'general', 'physical', 'model', 'of', 'pattern', 'formation', 'via', 'modulated', 'phases', 'using', 'analytical', 'and', 'numerical', 'techniques', 'we', 'find', 'that', 'most', 'of', 'the', 'pollen', 'micropatterns', 'observed', 'in', 'biological', 'evolution', 'could', 'result', 'from', 'a', 'physical', 'process', 'of', 'modulated', 'phases', 'however', 'an', 'analysis', 'of', 'the', 'relative', 'rates', 'of', 'transitions', 'from', 'states', 'that', 'are', 'equilibrated', 'to', 'or', 'from', 'states', 'that', 'are', 'not', 'equilibrated', 'suggests', 'that', 'while', 'equilibrium', 'states', 'of', 'this', 'process', 'have', 'occurred', 'throughout', 'evolutionary', 'history', 'there', 'has', 'been', 'no', 'particular', 'evolutionary', 'selection', 'for', 'distinctly', 'patterned', 'equilibrated', 'states']] | [-0.10759949335039071, 0.2118242367789385, -0.10654860755927459, -0.0069554010492575485, -0.0009353397739672564, -0.11512505250786076, 0.0402389011602296, 0.4023410271724489, -0.2588564413604402, -0.28549377390228936, 0.0928010103270048, -0.22087525344090309, -0.1824456345241676, 0.1349146859474268, -0.04831786327867587, 0.006897887171244219, 0.041326084752979775, -0.050078571119111, -0.019708330916218098, -0.17461056346679485, 0.2714379486415868, 0.0304478115404055, 0.3121260399721957, 0.020165194867782642, 0.07998168057803731, -0.09823983441911116, 0.0140422926278694, 0.01468163246856302, -0.13162527913371422, 0.06204765898735609, 0.2490898153689743, 0.08382595812748526, 0.19860344699667237, -0.5042183890671855, -0.26513369723669883, 0.08365611265729583, 0.17930702433345946, 0.13759656061846157, -0.11931714879034648, -0.2409123874499417, 0.05680612775963746, -0.12337532611689209, -0.13032915257863942, -0.020101034041301053, 0.026647852561474453, 0.02957792417453867, -0.24319084501840416, 0.12336028467499882, 0.060953958952408786, 0.05866151337031033, -0.09878173180216, -0.10241165830766995, -0.11018368526838901, 0.14482465266568087, 0.02865998237027041, 0.00692088058884672, 0.21983519070630334, -0.11768643267554935, -0.09164893667296908, 0.35038203138259916, -0.026953290753270978, -0.11565035152271753, 0.2383425723926005, -0.1509279360876625, -0.11174707277299367, 0.205855703282329, 0.16083932716051133, 0.09253538513936602, -0.15991165327053514, -0.02756983895712282, -0.007520171043716704, 0.19903500469456967, 0.10343592451048667, 0.002962904654554947, 0.2521928704127942, 0.22449313013481234, -0.003932986088566542, 0.1571909368939213, -0.10222073562435685, -0.12717850907039413, -0.21652712841325145, -0.14052839338475634, -0.15111144796502207, 0.02609579735327885, -0.08472579099960546, -0.21708215972845446, 0.379857372444282, 0.10960212865384386, 0.19556867126451155, -0.01767469736964776, 0.22641784113422944, 0.007725880172281579, 0.08082608106864117, -0.021466957223488063, 0.2288789371098581, 0.10492098681927788, 0.10619249695446342, -0.24207980681553376, 0.17743392290577778, -0.012486611300799238] |
1,803.03644 | Converting non-relativistic dark matter to radiation | Dark matter in the cosmological concordance model is parameterised by a
single number, describing the covariantly conserved energy density of a
non-relativistic fluid. Here we test this assumption in a model-independent and
conservative way by considering the possibility that, at any point during the
cosmological evolution, dark matter may be converted into a non-interacting
form of radiation. This scenario encompasses, but is more general than, the
cases where dark matter decays or annihilates into these states. We show that
observations of the cosmic microwave background allow to strongly constrain
this scenario for any conversion time after big bang nucleosynthesis. We
discuss in detail, both from a Bayesian and frequentist point of view, in which
sense adding large-scale structure observations may even provide a certain
preference for a conversion of dark matter to radiation at late times. Finally
we apply our general results to a specific particle physics realisation of such
a scenario, featuring late kinetic decoupling and Sommerfeld-enhanced dark
matter annihilation. We identify a small part of parameter space that both
mitigates the tension between cosmic microwave and large-scale structure data
and allows for velocity-dependent dark matter self-interactions strong enough
to address the small-scale problems of structure formation.
| astro-ph.CO hep-ph | dark matter in the cosmological concordance model is parameterised by a single number describing the covariantly conserved energy density of a nonrelativistic fluid here we test this assumption in a modelindependent and conservative way by considering the possibility that at any point during the cosmological evolution dark matter may be converted into a noninteracting form of radiation this scenario encompasses but is more general than the cases where dark matter decays or annihilates into these states we show that observations of the cosmic microwave background allow to strongly constrain this scenario for any conversion time after big bang nucleosynthesis we discuss in detail both from a bayesian and frequentist point of view in which sense adding largescale structure observations may even provide a certain preference for a conversion of dark matter to radiation at late times finally we apply our general results to a specific particle physics realisation of such a scenario featuring late kinetic decoupling and sommerfeldenhanced dark matter annihilation we identify a small part of parameter space that both mitigates the tension between cosmic microwave and largescale structure data and allows for velocitydependent dark matter selfinteractions strong enough to address the smallscale problems of structure formation | [['dark', 'matter', 'in', 'the', 'cosmological', 'concordance', 'model', 'is', 'parameterised', 'by', 'a', 'single', 'number', 'describing', 'the', 'covariantly', 'conserved', 'energy', 'density', 'of', 'a', 'nonrelativistic', 'fluid', 'here', 'we', 'test', 'this', 'assumption', 'in', 'a', 'modelindependent', 'and', 'conservative', 'way', 'by', 'considering', 'the', 'possibility', 'that', 'at', 'any', 'point', 'during', 'the', 'cosmological', 'evolution', 'dark', 'matter', 'may', 'be', 'converted', 'into', 'a', 'noninteracting', 'form', 'of', 'radiation', 'this', 'scenario', 'encompasses', 'but', 'is', 'more', 'general', 'than', 'the', 'cases', 'where', 'dark', 'matter', 'decays', 'or', 'annihilates', 'into', 'these', 'states', 'we', 'show', 'that', 'observations', 'of', 'the', 'cosmic', 'microwave', 'background', 'allow', 'to', 'strongly', 'constrain', 'this', 'scenario', 'for', 'any', 'conversion', 'time', 'after', 'big', 'bang', 'nucleosynthesis', 'we', 'discuss', 'in', 'detail', 'both', 'from', 'a', 'bayesian', 'and', 'frequentist', 'point', 'of', 'view', 'in', 'which', 'sense', 'adding', 'largescale', 'structure', 'observations', 'may', 'even', 'provide', 'a', 'certain', 'preference', 'for', 'a', 'conversion', 'of', 'dark', 'matter', 'to', 'radiation', 'at', 'late', 'times', 'finally', 'we', 'apply', 'our', 'general', 'results', 'to', 'a', 'specific', 'particle', 'physics', 'realisation', 'of', 'such', 'a', 'scenario', 'featuring', 'late', 'kinetic', 'decoupling', 'and', 'sommerfeldenhanced', 'dark', 'matter', 'annihilation', 'we', 'identify', 'a', 'small', 'part', 'of', 'parameter', 'space', 'that', 'both', 'mitigates', 'the', 'tension', 'between', 'cosmic', 'microwave', 'and', 'largescale', 'structure', 'data', 'and', 'allows', 'for', 'velocitydependent', 'dark', 'matter', 'selfinteractions', 'strong', 'enough', 'to', 'address', 'the', 'smallscale', 'problems', 'of', 'structure', 'formation']] | [-0.12103080088590187, 0.16102610746483234, -0.1203242560561671, 0.13555089291361527, -0.11003727573816749, -0.10522643421221563, -0.0042496074356769, 0.30336485417898407, -0.24498494014830677, -0.3546517951098845, 0.02205039255763169, -0.23857315538300852, -0.05159766983000957, 0.16443554467269964, 0.03423844923081836, -0.016413331474530314, 0.026169080100248033, 0.0004625593036039253, -0.03922749812846458, -0.23083501664046763, 0.3401674316693897, 0.08444683592898225, 0.21483176657130396, 0.033308752135119656, 0.08974306746162568, -0.0413449345135384, -0.050855908331207254, -0.0006801315749919123, -0.16182728126439155, 0.03674981650523606, 0.19999883270991797, 0.1461401797285435, 0.21190521752842786, -0.4600833248243564, -0.2792703330827256, 0.19398594593553983, 0.15781671139341075, 0.1438297239676673, -0.10924764754019285, -0.2878613593621236, 0.04421860095030614, -0.19257196272732785, -0.08958450258436679, -0.06307972935287075, -0.018995766542061712, -0.05570300596276994, -0.26708778345074285, 0.12377967148774652, -0.001852638836046963, -0.08351392863918627, -0.07436472575816401, -0.04163985727166738, 0.003956021413834991, 0.0036959753200091947, 0.06467640304625166, -0.009576844119683209, 0.18215651739379296, -0.20340640738258384, -0.06092238013286877, 0.44171525402032213, -0.12506362012620706, -0.1404531562602091, 0.17837121130926817, -0.15118752114681733, -0.19329924280567076, 0.1128237982365218, 0.14793654226267597, 0.07150651434450551, -0.1459974189170735, 0.13054977211780197, -0.007696274191145832, 0.17511606042307445, 0.06692108742403563, 0.014831769219576145, 0.3552406907335601, 0.18431242042446905, 0.06265162296341543, 0.07344048171635774, -0.09329227053188728, -0.08336605102933868, -0.36269351519700704, -0.14913243436206935, -0.12088597668546507, 0.06633645544449489, -0.10246877516159786, -0.13875411520241712, 0.36544896539822785, 0.13509928232367266, 0.20287554160776464, 0.029450077394780824, 0.3220735298507292, 0.06013207733831039, 0.00201856747570664, 0.06978567128159067, 0.27968073898757045, 0.11173473020328792, 0.09088913056848928, -0.1965324455981538, 0.0027910493681150856, -0.027027349111228956] |
1,803.03645 | The groomed and ungroomed jet mass distribution for inclusive jet
production at the LHC | We study jet mass distributions measured in the single inclusive jet
production in proton-proton collisions $pp\to \text{jet}+X$ at the LHC. We
consider both standard ungroomed jets as well as soft drop groomed jets. Within
the Soft Collinear Effective Theory (SCET), we establish QCD factorization
theorems for both cases and we study their relation. The developed framework
allows for the joint resummation of several classes of logarithmic corrections
to all orders in the strong coupling constant. For the ungroomed case, we resum
logarithms in the jet radius parameter and in the small jet mass. For the
groomed case, we resum in addition the logarithms in the soft threshold
parameter $z_{\text{cut}}$ which is introduced by the soft drop grooming
algorithm. In this way, we are able to reliably determine the absolute
normalization of the groomed jet mass distribution in proton-proton collisions.
All logarithmic corrections are resummed to the next-to-leading logarithmic
accuracy. We present numerical results and compare with the available data from
the LHC. For both the groomed and ungroomed jet mass distributions we find very
good agreement after including non-perturbative corrections.
| hep-ph hep-ex nucl-ex nucl-th | we study jet mass distributions measured in the single inclusive jet production in protonproton collisions ppto textjetx at the lhc we consider both standard ungroomed jets as well as soft drop groomed jets within the soft collinear effective theory scet we establish qcd factorization theorems for both cases and we study their relation the developed framework allows for the joint resummation of several classes of logarithmic corrections to all orders in the strong coupling constant for the ungroomed case we resum logarithms in the jet radius parameter and in the small jet mass for the groomed case we resum in addition the logarithms in the soft threshold parameter z_textcut which is introduced by the soft drop grooming algorithm in this way we are able to reliably determine the absolute normalization of the groomed jet mass distribution in protonproton collisions all logarithmic corrections are resummed to the nexttoleading logarithmic accuracy we present numerical results and compare with the available data from the lhc for both the groomed and ungroomed jet mass distributions we find very good agreement after including nonperturbative corrections | [['we', 'study', 'jet', 'mass', 'distributions', 'measured', 'in', 'the', 'single', 'inclusive', 'jet', 'production', 'in', 'protonproton', 'collisions', 'ppto', 'textjetx', 'at', 'the', 'lhc', 'we', 'consider', 'both', 'standard', 'ungroomed', 'jets', 'as', 'well', 'as', 'soft', 'drop', 'groomed', 'jets', 'within', 'the', 'soft', 'collinear', 'effective', 'theory', 'scet', 'we', 'establish', 'qcd', 'factorization', 'theorems', 'for', 'both', 'cases', 'and', 'we', 'study', 'their', 'relation', 'the', 'developed', 'framework', 'allows', 'for', 'the', 'joint', 'resummation', 'of', 'several', 'classes', 'of', 'logarithmic', 'corrections', 'to', 'all', 'orders', 'in', 'the', 'strong', 'coupling', 'constant', 'for', 'the', 'ungroomed', 'case', 'we', 'resum', 'logarithms', 'in', 'the', 'jet', 'radius', 'parameter', 'and', 'in', 'the', 'small', 'jet', 'mass', 'for', 'the', 'groomed', 'case', 'we', 'resum', 'in', 'addition', 'the', 'logarithms', 'in', 'the', 'soft', 'threshold', 'parameter', 'z_textcut', 'which', 'is', 'introduced', 'by', 'the', 'soft', 'drop', 'grooming', 'algorithm', 'in', 'this', 'way', 'we', 'are', 'able', 'to', 'reliably', 'determine', 'the', 'absolute', 'normalization', 'of', 'the', 'groomed', 'jet', 'mass', 'distribution', 'in', 'protonproton', 'collisions', 'all', 'logarithmic', 'corrections', 'are', 'resummed', 'to', 'the', 'nexttoleading', 'logarithmic', 'accuracy', 'we', 'present', 'numerical', 'results', 'and', 'compare', 'with', 'the', 'available', 'data', 'from', 'the', 'lhc', 'for', 'both', 'the', 'groomed', 'and', 'ungroomed', 'jet', 'mass', 'distributions', 'we', 'find', 'very', 'good', 'agreement', 'after', 'including', 'nonperturbative', 'corrections']] | [-0.062266989919362206, 0.11947703935393242, -0.14339114645204648, 0.1916740357813389, -0.032188836594408785, -0.07100336024389399, -0.01681190473629115, 0.39740131351077024, -0.19942977205283066, -0.28896595961180144, 0.0023304183164861198, -0.3143095844985388, 0.025376311254911334, 0.14279755450493797, 0.018288192889450234, 0.14692949405845318, 0.06428069241966677, -0.03729309018066559, -0.07190910205453135, -0.19566631264394077, 0.3334395183203482, 0.06740130871201361, 0.1939561894767028, 0.16183769595731237, 0.07048562241720774, 0.06796302359782722, -0.07521970889123948, 0.0013613148258836236, -0.15793706253483142, 0.0446519923618183, 0.24608277330986697, 0.0057208355380919396, 0.15455513749211147, -0.338526330620321, -0.09118954650537428, 0.07432845637316728, 0.16381957703634223, 0.0702364954365126, -0.014345830269990353, -0.18265892433096242, 0.12494551422407424, -0.3219661587828448, -0.14514024165204034, -0.12461677155660351, -0.033241854252179244, -0.020976521920246287, -0.30592259088877133, 0.11245403851316747, -0.03246267870726719, -0.025700209874337195, 0.013369102799398668, -0.12204207999205123, -0.023346568998235524, 0.07517638032756455, 0.1507310485161643, 0.0627174047680374, 0.1756843049963676, -0.23546315629071654, -0.17772199555596743, 0.37207279953189903, -0.039403484192515555, -0.1235709724760505, 0.14512173551025503, -0.23654434887182446, -0.19064636903362317, 0.14246255707765756, 0.2505198782322897, 0.13941915101741112, -0.15266275769047563, 0.10019855264329752, 0.004201186817612852, 0.14320410124556937, 0.08466456047592258, 0.03912009011303542, 0.11906171799897523, 0.13324230434255954, -0.04356095065589079, 0.1288747814042993, -0.1370136665034644, -0.09183362553510087, -0.44795470241478036, -0.05884401105973849, -0.06295820446710972, 0.00771938459804625, -0.16918090980353, -0.11266090586396486, 0.3436116962589573, 0.11333022329321536, 0.3034660358439777, 0.08919186940138338, 0.3338680337950608, 0.12352393225340079, 0.08960069667199345, 0.13987878036968848, 0.34817933122622235, 0.148765008300855, 0.12545536047721792, -0.2345688986350059, 0.029952807861832933, 0.10617425064582316] |
1,803.03646 | Aspherical Supernovae: Effects on Early Light Curves | Early light from core-collapse supernovae, now detectable in high-cadence
surveys, holds clues to a star and its environment just before it explodes.
However, effects that alter the early light have not been fully explored. We
highlight the possibility of non-radial flows at the time of shock breakout.
These develop in sufficiently non-spherical explosions if the progenitor is not
too diffuse. When they do develop, non-radial flows limit ejecta speeds and
cause ejecta-ejecta collisions. We explore these phenomena and their
observational implications, using global, axisymmetric, non-relativistic FLASH
simulations of simplified polytropic progenitors, which we scale to
representative stars. We develop a method to track photon production within the
ejecta, enabling us to estimate band-dependent light curves from adiabatic
simulations. Immediate breakout emission becomes hidden as an oblique flow
develops. Non-spherical effects lead the shock-heated ejecta to release a more
constant luminosity at a higher, evolving color temperature at early times,
effectively mixing breakout light with the early light curve. Collisions
between non-radial ejecta thermalize a small fraction of the explosion energy;
we address emission from these collisions in a subsequent paper.
| astro-ph.HE | early light from corecollapse supernovae now detectable in highcadence surveys holds clues to a star and its environment just before it explodes however effects that alter the early light have not been fully explored we highlight the possibility of nonradial flows at the time of shock breakout these develop in sufficiently nonspherical explosions if the progenitor is not too diffuse when they do develop nonradial flows limit ejecta speeds and cause ejectaejecta collisions we explore these phenomena and their observational implications using global axisymmetric nonrelativistic flash simulations of simplified polytropic progenitors which we scale to representative stars we develop a method to track photon production within the ejecta enabling us to estimate banddependent light curves from adiabatic simulations immediate breakout emission becomes hidden as an oblique flow develops nonspherical effects lead the shockheated ejecta to release a more constant luminosity at a higher evolving color temperature at early times effectively mixing breakout light with the early light curve collisions between nonradial ejecta thermalize a small fraction of the explosion energy we address emission from these collisions in a subsequent paper | [['early', 'light', 'from', 'corecollapse', 'supernovae', 'now', 'detectable', 'in', 'highcadence', 'surveys', 'holds', 'clues', 'to', 'a', 'star', 'and', 'its', 'environment', 'just', 'before', 'it', 'explodes', 'however', 'effects', 'that', 'alter', 'the', 'early', 'light', 'have', 'not', 'been', 'fully', 'explored', 'we', 'highlight', 'the', 'possibility', 'of', 'nonradial', 'flows', 'at', 'the', 'time', 'of', 'shock', 'breakout', 'these', 'develop', 'in', 'sufficiently', 'nonspherical', 'explosions', 'if', 'the', 'progenitor', 'is', 'not', 'too', 'diffuse', 'when', 'they', 'do', 'develop', 'nonradial', 'flows', 'limit', 'ejecta', 'speeds', 'and', 'cause', 'ejectaejecta', 'collisions', 'we', 'explore', 'these', 'phenomena', 'and', 'their', 'observational', 'implications', 'using', 'global', 'axisymmetric', 'nonrelativistic', 'flash', 'simulations', 'of', 'simplified', 'polytropic', 'progenitors', 'which', 'we', 'scale', 'to', 'representative', 'stars', 'we', 'develop', 'a', 'method', 'to', 'track', 'photon', 'production', 'within', 'the', 'ejecta', 'enabling', 'us', 'to', 'estimate', 'banddependent', 'light', 'curves', 'from', 'adiabatic', 'simulations', 'immediate', 'breakout', 'emission', 'becomes', 'hidden', 'as', 'an', 'oblique', 'flow', 'develops', 'nonspherical', 'effects', 'lead', 'the', 'shockheated', 'ejecta', 'to', 'release', 'a', 'more', 'constant', 'luminosity', 'at', 'a', 'higher', 'evolving', 'color', 'temperature', 'at', 'early', 'times', 'effectively', 'mixing', 'breakout', 'light', 'with', 'the', 'early', 'light', 'curve', 'collisions', 'between', 'nonradial', 'ejecta', 'thermalize', 'a', 'small', 'fraction', 'of', 'the', 'explosion', 'energy', 'we', 'address', 'emission', 'from', 'these', 'collisions', 'in', 'a', 'subsequent', 'paper']] | [-0.05830989395432153, 0.19490104409751896, -0.13110141622620589, 0.1616885909763836, -0.13671912495228955, -0.10707771689526986, 0.03814270025881413, 0.4154620819605429, -0.23276615279138754, -0.29932955930311256, 0.06784911935839427, -0.26935475846679685, -0.016726825624644528, 0.19044994529110365, -0.022772924250094858, -0.022730211529935394, 0.15946747701844025, -0.0859518921882039, -0.068816512434837, -0.23792047637863364, 0.26764762802205605, 0.08020926197189525, 0.16217101618612456, 0.03152767460345806, 0.046442280325117685, -0.0885118858722252, -0.021143636092291262, -0.05605912447241057, -0.1380915415602786, -0.006521099808140704, 0.19482455062211684, 0.15244633633013835, 0.21398581001470543, -0.5092521703557512, -0.31065901919325306, 0.14858320542460296, 0.22562556559162725, 0.1376084292134499, -0.09081708364227367, -0.2223728718268607, 0.043438369746439616, -0.23022007009576403, -0.2153880012055141, 0.02322576135168029, 0.04772984941856475, 0.018762168406207095, -0.2218048763240287, 0.11972436143472978, 0.01573717185327336, 0.03377497475854428, -0.057766027045540264, 0.003047168200872006, -0.07044067290252563, 0.041448771296226414, 0.09479907585188288, 0.02123483518325833, 0.16172661901290356, -0.15087087789593348, 0.0072141909729897475, 0.4497653479693072, -0.06417402857394275, -0.00020450326046963645, 0.22368349098501591, -0.1826027122159702, -0.12298466795639203, 0.20700521168023264, 0.23559677694513145, 0.1274643169570319, -0.1330836030031722, -0.05180156231284214, 0.036541911435193856, 0.14388955442635498, 0.06780167777538716, 0.0354303136947903, 0.320381302407334, 0.159876862175336, -0.026601157988832648, 0.06972312636467935, -0.17378713237934656, -0.029503016118688625, -0.30531648009516005, -0.08395648468545945, -0.09103544273897589, 0.11687936843779359, -0.10686616235070891, -0.13320703284981447, 0.3327379923459538, 0.14873597580502487, 0.19110765899128318, -0.017016753181685076, 0.29753539392297995, 0.06544947757531352, 0.041107643952374685, 0.19077031865232108, 0.3363052510406676, 0.16414530523246226, 0.17893346649004074, -0.24352491276947438, 0.09924982764950678, 0.0368078011686409] |
1,803.03647 | The Hyperbolic Higgs | We introduce the Hyperbolic Higgs, a novel solution to the little hierarchy
problem that features Standard Model neutral scalar top partners. At one-loop
order, the protection from ultraviolet sensitivity is due to an accidental
non-compact symmetry of the Higgs potential that emerges in the infrared. Once
the general features of the effective description are detailed, a completion
that relies on a five dimensional supersymmetric framework is provided. Novel
phenomenology is compared and contrasted with the Twin Higgs scenario.
| hep-ph | we introduce the hyperbolic higgs a novel solution to the little hierarchy problem that features standard model neutral scalar top partners at oneloop order the protection from ultraviolet sensitivity is due to an accidental noncompact symmetry of the higgs potential that emerges in the infrared once the general features of the effective description are detailed a completion that relies on a five dimensional supersymmetric framework is provided novel phenomenology is compared and contrasted with the twin higgs scenario | [['we', 'introduce', 'the', 'hyperbolic', 'higgs', 'a', 'novel', 'solution', 'to', 'the', 'little', 'hierarchy', 'problem', 'that', 'features', 'standard', 'model', 'neutral', 'scalar', 'top', 'partners', 'at', 'oneloop', 'order', 'the', 'protection', 'from', 'ultraviolet', 'sensitivity', 'is', 'due', 'to', 'an', 'accidental', 'noncompact', 'symmetry', 'of', 'the', 'higgs', 'potential', 'that', 'emerges', 'in', 'the', 'infrared', 'once', 'the', 'general', 'features', 'of', 'the', 'effective', 'description', 'are', 'detailed', 'a', 'completion', 'that', 'relies', 'on', 'a', 'five', 'dimensional', 'supersymmetric', 'framework', 'is', 'provided', 'novel', 'phenomenology', 'is', 'compared', 'and', 'contrasted', 'with', 'the', 'twin', 'higgs', 'scenario']] | [-0.0881217611887946, 0.13853352581533657, -0.07931996838380702, 0.1475346517519285, -0.11784800808303632, -0.1916209731119661, 0.006391991562663744, 0.3112696220811743, -0.21125801867590502, -0.2667648203981419, 0.08774935323536062, -0.3115590900206604, -0.16545727984526026, 0.10749849010235032, -0.048718038671769395, 0.040687669116335035, 0.042279691339876406, 0.05313622454802195, -0.06367907617300844, -0.2282582356904944, 0.35350993460712904, 0.05454541981602327, 0.28077829285309863, 0.07657465546463545, 0.08543912748483798, -0.004918545257682219, -0.010746392642315, -0.04095148259344009, -0.08177333395136745, 0.1388746474691195, 0.15333998494017392, 0.07073987001338257, 0.19271770016535017, -0.35861683682275886, -0.19229275388762546, 0.12822178239002824, 0.1189268693053283, 0.14974994133883276, -0.11044627552977405, -0.2908877178262442, 0.09713241829871176, -0.18479950192909783, -0.15174887143373966, -0.06929545024505411, -0.08555085640042447, -0.15720410545905814, -0.29356890793245, 0.04955448892425734, -0.03935065137174649, 0.056141797003921315, -0.02971014572092547, -0.08628622260547648, -0.08555533821121432, 0.03155114135752695, 0.13108240201836452, 0.01897376731563455, 0.10960460187515053, -0.20368134672277777, -0.1494693587704275, 0.43373603053773063, -0.13238357265035097, -0.183305185703107, 0.20851117244754463, -0.09774924805746056, -0.13498459223848888, 0.1517339366225478, 0.1625831750436471, 0.11260972127246742, -0.1531520469997747, 0.2073660124658953, -0.045307793272420384, 0.17903177093905517, 0.017518521507437795, 0.04986129168985197, 0.26303318897501016, 0.22555593602980176, 0.05856260314631539, 0.11166530532332566, -0.04535183560950921, -0.12304744450375438, -0.41091451537795365, -0.1247126097098375, -0.07142507798898105, 0.03780584037900926, -0.07006201653674883, -0.13693049882586378, 0.4492017948188079, 0.11941880973590276, 0.21623410055569062, 0.04106927818308274, 0.3062981908651403, 0.10103754024991456, 0.10000929303276233, 0.012323690405211005, 0.28372111034173614, 0.08492117968256561, 0.09233193199198024, -0.20730474444019656, -0.03594038647432358, 0.13334366648147503] |
1,803.03648 | Inner Super-Earths, Outer Gas Giants: How Pebble Isolation and Migration
Feedback Keep Jupiters Cold | The majority of gas giants (planets of masses $\gtrsim10^2 M_\oplus$) are
found to reside at distances beyond $\sim1$ au from their host stars. Within 1
au, the planetary population is dominated by super-Earths of $2-20 M_\oplus$.
We show that this dichotomy between inner super-Earths and outer gas giants can
be naturally explained should they form in nearly inviscid disks. In laminar
disks, a planet can more easily repel disk gas away from its orbit. The
feedback torque from the pile-up of gas inside the planet's orbit slows down
and eventually halts migration. A pressure bump outside the planet's orbit
traps pebbles and solids, starving the core. Gas giants are born cold and stay
cold: more massive cores are preferentially formed at larger distances, and
they barely migrate under disk feedback. We demonstrate this using 2D
hydrodynamical simulations of disk-planet interaction lasting up to $10^5$
years: we track planet migration and pebble accretion until both come to an end
by disk feedback. Whether cores undergo runaway gas accretion to become gas
giants or not is determined by computing 1D gas accretion models. Our
simulations show that in an inviscid minimum mass solar nebula, gas giants do
not form inside $\sim$0.5 au, nor can they migrate there while the disk is
present. We also explore the dependence on disk mass, and find that gas giants
form further out in less massive disks.
| astro-ph.EP | the majority of gas giants planets of masses gtrsim102 m_oplus are found to reside at distances beyond sim1 au from their host stars within 1 au the planetary population is dominated by superearths of 220 m_oplus we show that this dichotomy between inner superearths and outer gas giants can be naturally explained should they form in nearly inviscid disks in laminar disks a planet can more easily repel disk gas away from its orbit the feedback torque from the pileup of gas inside the planets orbit slows down and eventually halts migration a pressure bump outside the planets orbit traps pebbles and solids starving the core gas giants are born cold and stay cold more massive cores are preferentially formed at larger distances and they barely migrate under disk feedback we demonstrate this using 2d hydrodynamical simulations of diskplanet interaction lasting up to 105 years we track planet migration and pebble accretion until both come to an end by disk feedback whether cores undergo runaway gas accretion to become gas giants or not is determined by computing 1d gas accretion models our simulations show that in an inviscid minimum mass solar nebula gas giants do not form inside sim05 au nor can they migrate there while the disk is present we also explore the dependence on disk mass and find that gas giants form further out in less massive disks | [['the', 'majority', 'of', 'gas', 'giants', 'planets', 'of', 'masses', 'gtrsim102', 'm_oplus', 'are', 'found', 'to', 'reside', 'at', 'distances', 'beyond', 'sim1', 'au', 'from', 'their', 'host', 'stars', 'within', '1', 'au', 'the', 'planetary', 'population', 'is', 'dominated', 'by', 'superearths', 'of', '220', 'm_oplus', 'we', 'show', 'that', 'this', 'dichotomy', 'between', 'inner', 'superearths', 'and', 'outer', 'gas', 'giants', 'can', 'be', 'naturally', 'explained', 'should', 'they', 'form', 'in', 'nearly', 'inviscid', 'disks', 'in', 'laminar', 'disks', 'a', 'planet', 'can', 'more', 'easily', 'repel', 'disk', 'gas', 'away', 'from', 'its', 'orbit', 'the', 'feedback', 'torque', 'from', 'the', 'pileup', 'of', 'gas', 'inside', 'the', 'planets', 'orbit', 'slows', 'down', 'and', 'eventually', 'halts', 'migration', 'a', 'pressure', 'bump', 'outside', 'the', 'planets', 'orbit', 'traps', 'pebbles', 'and', 'solids', 'starving', 'the', 'core', 'gas', 'giants', 'are', 'born', 'cold', 'and', 'stay', 'cold', 'more', 'massive', 'cores', 'are', 'preferentially', 'formed', 'at', 'larger', 'distances', 'and', 'they', 'barely', 'migrate', 'under', 'disk', 'feedback', 'we', 'demonstrate', 'this', 'using', '2d', 'hydrodynamical', 'simulations', 'of', 'diskplanet', 'interaction', 'lasting', 'up', 'to', '105', 'years', 'we', 'track', 'planet', 'migration', 'and', 'pebble', 'accretion', 'until', 'both', 'come', 'to', 'an', 'end', 'by', 'disk', 'feedback', 'whether', 'cores', 'undergo', 'runaway', 'gas', 'accretion', 'to', 'become', 'gas', 'giants', 'or', 'not', 'is', 'determined', 'by', 'computing', '1d', 'gas', 'accretion', 'models', 'our', 'simulations', 'show', 'that', 'in', 'an', 'inviscid', 'minimum', 'mass', 'solar', 'nebula', 'gas', 'giants', 'do', 'not', 'form', 'inside', 'sim05', 'au', 'nor', 'can', 'they', 'migrate', 'there', 'while', 'the', 'disk', 'is', 'present', 'we', 'also', 'explore', 'the', 'dependence', 'on', 'disk', 'mass', 'and', 'find', 'that', 'gas', 'giants', 'form', 'further', 'out', 'in', 'less', 'massive', 'disks']] | [-0.09624435435322559, 0.20470891349617412, -0.044912001304328444, 0.06986374927320234, -0.06744390898485385, -0.06674478285460045, 0.06771750215785173, 0.3820894646010382, -0.21318237932155962, -0.3243791985492546, 0.05966794066859976, -0.27802993417515054, -0.008881871919552593, 0.16963821922823705, -0.056491070332855955, -0.037314067799446134, 0.13163069031079827, -0.12261606853192106, -0.040699116366854665, -0.28694304686404115, 0.28655917991722085, 0.04519616949204963, -0.009588939226839854, -0.0164984468261853, -0.021288331593994212, -0.17843459619654586, 0.02873064507806228, -0.06820122668438632, -0.21519938922261328, -0.019572933585099553, 0.20191657239890407, 0.08173465868863075, 0.25848611826482026, -0.49337969016405225, -0.2062517185429739, 0.04066208587230548, 0.2612612463878063, 0.04850781327012278, -0.06760202956590902, -0.20675045473642809, 0.0844507015656943, -0.25493653976034536, -0.20682656438768152, 0.05860269718598473, 0.08837615748583946, -0.027477310027659217, -0.22711084048344712, 0.14028754478824101, 0.12223609755949481, 0.0780871428725178, -0.12718891732485804, -0.10468270639767466, -0.1311483804754022, 0.04994665782837926, 0.0048567654997737995, 0.031971303446461326, 0.3298026897823033, -0.09128083857991125, 0.054449900641591976, 0.43428013239298824, -0.0706348497425611, -0.04071297078917269, 0.347784975615492, -0.28485511510972056, -0.06464455573941054, 0.19853291437029838, 0.20206795361945812, 0.10791916329332668, -0.14039806312952272, -0.017229163461825407, -0.06076087680361841, 0.1940722414446772, 0.14579467977012467, -0.0188610978621949, 0.48662570577681713, 0.11848236631359095, 0.06747701711517394, 0.04547281388203492, -0.184951131071126, -0.12845413234267058, -0.1353292069316882, -0.11595247535277968, -0.13242670104423862, 0.046025433419803766, -0.08358157843119798, -0.1066823586375192, 0.20961299089223917, 0.10985915364657084, 0.2275422284602309, 0.03732146529237861, 0.31630646370189347, 0.06457333513586175, 0.17676142409909518, 0.24505485849778938, 0.3259552707976621, 0.1483977694349723, 0.08718619313971747, -0.25582405400675035, 0.06875406767256842, -0.005600173218661676] |
1,803.03649 | Unsqueezing of standing waves due to inflationary domain structure | The so-called "trans-Planckian" problem of inflation may be evaded by
positing that modes come into existence only when they became "cis-Planckian"
by virtue of expansion. However, this would imply that for any mode a new
random realization would have to be drawn every $N$ wavelengths, with $N$
typically of order 1000 (but it could be larger or smaller). Such a re-drawing
of realizations leads to a heteroskodastic distribution if the region under
observation contains several such independent domains. This has no effect on
the sampled power spectrum for a scale-invariant raw spectrum, but at very
small scales it leads to a spectral index bias towards scale-invariance and
smooths oscillations in the spectrum. The domain structure would also
"unsqueeze" some of the propagating waves, i.e., dismantle their standing wave
character. By describing standing waves as travelling waves of the same
amplitude moving in opposite directions we determine the observational effects
of unsqueezing. We find that it would erase the Doppler peaks in the CMB, but
only on very small angular scales, where the primordial signal may not be
readily accessible. The standing waves in a primordial gravitational wave
background would also be turned into travelling waves. This unsqueezing of the
gravitational wave background may constitute a detectable phenomenon.
| astro-ph.CO gr-qc | the socalled transplanckian problem of inflation may be evaded by positing that modes come into existence only when they became cisplanckian by virtue of expansion however this would imply that for any mode a new random realization would have to be drawn every n wavelengths with n typically of order 1000 but it could be larger or smaller such a redrawing of realizations leads to a heteroskodastic distribution if the region under observation contains several such independent domains this has no effect on the sampled power spectrum for a scaleinvariant raw spectrum but at very small scales it leads to a spectral index bias towards scaleinvariance and smooths oscillations in the spectrum the domain structure would also unsqueeze some of the propagating waves ie dismantle their standing wave character by describing standing waves as travelling waves of the same amplitude moving in opposite directions we determine the observational effects of unsqueezing we find that it would erase the doppler peaks in the cmb but only on very small angular scales where the primordial signal may not be readily accessible the standing waves in a primordial gravitational wave background would also be turned into travelling waves this unsqueezing of the gravitational wave background may constitute a detectable phenomenon | [['the', 'socalled', 'transplanckian', 'problem', 'of', 'inflation', 'may', 'be', 'evaded', 'by', 'positing', 'that', 'modes', 'come', 'into', 'existence', 'only', 'when', 'they', 'became', 'cisplanckian', 'by', 'virtue', 'of', 'expansion', 'however', 'this', 'would', 'imply', 'that', 'for', 'any', 'mode', 'a', 'new', 'random', 'realization', 'would', 'have', 'to', 'be', 'drawn', 'every', 'n', 'wavelengths', 'with', 'n', 'typically', 'of', 'order', '1000', 'but', 'it', 'could', 'be', 'larger', 'or', 'smaller', 'such', 'a', 'redrawing', 'of', 'realizations', 'leads', 'to', 'a', 'heteroskodastic', 'distribution', 'if', 'the', 'region', 'under', 'observation', 'contains', 'several', 'such', 'independent', 'domains', 'this', 'has', 'no', 'effect', 'on', 'the', 'sampled', 'power', 'spectrum', 'for', 'a', 'scaleinvariant', 'raw', 'spectrum', 'but', 'at', 'very', 'small', 'scales', 'it', 'leads', 'to', 'a', 'spectral', 'index', 'bias', 'towards', 'scaleinvariance', 'and', 'smooths', 'oscillations', 'in', 'the', 'spectrum', 'the', 'domain', 'structure', 'would', 'also', 'unsqueeze', 'some', 'of', 'the', 'propagating', 'waves', 'ie', 'dismantle', 'their', 'standing', 'wave', 'character', 'by', 'describing', 'standing', 'waves', 'as', 'travelling', 'waves', 'of', 'the', 'same', 'amplitude', 'moving', 'in', 'opposite', 'directions', 'we', 'determine', 'the', 'observational', 'effects', 'of', 'unsqueezing', 'we', 'find', 'that', 'it', 'would', 'erase', 'the', 'doppler', 'peaks', 'in', 'the', 'cmb', 'but', 'only', 'on', 'very', 'small', 'angular', 'scales', 'where', 'the', 'primordial', 'signal', 'may', 'not', 'be', 'readily', 'accessible', 'the', 'standing', 'waves', 'in', 'a', 'primordial', 'gravitational', 'wave', 'background', 'would', 'also', 'be', 'turned', 'into', 'travelling', 'waves', 'this', 'unsqueezing', 'of', 'the', 'gravitational', 'wave', 'background', 'may', 'constitute', 'a', 'detectable', 'phenomenon']] | [-0.1816935795256088, 0.23104293460543657, -0.1218456536315822, 0.08495909537434156, -0.13489213196579092, -0.10944607160902889, -0.012330048945371127, 0.32832595364654005, -0.2700522652106919, -0.27201258422109514, 0.12254105975709195, -0.2658552456752677, -0.09796699508451145, 0.21905852959656474, 0.010703178076358472, -0.019713659169785496, 0.06016531632926425, 0.028402416134170563, -0.005885476846903966, -0.1680971772416857, 0.2893055394547647, 0.09400459270757448, 0.23265661254067552, 0.02887873460505424, 0.05184750848913134, -0.046854818781168005, -0.007190969097083939, 0.04383734883190009, -0.07256284661209263, 0.03397415084775831, 0.23908853770710822, 0.13097229653024178, 0.26256265319090133, -0.44851391198353846, -0.28090925767887015, 0.1433512332431715, 0.19567872404597994, 0.17785809664950325, -0.04990690737891612, -0.28214780679385504, 0.07240253825456344, -0.11559436066314725, -0.14314989689416413, -0.02247444256048264, 0.04493278162152116, -0.02970399140332151, -0.2458193623865129, 0.0842193889203986, 0.06631679015619488, -0.027900187832130156, -0.02999602063797561, -0.07553859723713524, -0.03436098171379692, 0.08404382985395499, 0.09502310604040552, 0.030199939936165484, 0.10043555723584666, -0.12780343463258437, -0.05447125508624308, 0.4041898492035534, -0.09714234692189072, -0.17084551067227724, 0.1642644257844412, -0.20840540559953216, -0.12054968554655025, 0.17890005746025942, 0.15571152999666818, 0.0749258912039985, -0.08108600356572783, 0.05106925713833137, -0.019179543663573845, 0.21003251134307843, 0.1701773485384441, 0.08117756723905707, 0.328636046810984, 0.08209366266377123, 0.08800012818904676, 0.0973468706967109, -0.09438208860845254, -0.0059913030155737115, -0.2882714158639752, -0.06729713510842351, -0.18271045490747817, 0.0916880322111314, -0.07322768801173798, -0.1944010823843496, 0.3990457550498652, 0.13968961697652146, 0.20339791194806472, 0.023077072821135445, 0.25708200576774815, 0.1354689296195054, 0.10162122862234602, 0.06968545746012347, 0.30870134153892514, 0.0956041928545745, 0.09086882244116568, -0.16252700259032765, 0.06414350563731375, -0.032574045655358895] |
1,803.0365 | Neutrino Discovery Limit of Dark Matter Direct Detection Experiments in
the Presence of Non-Standard Interactions | The detection of coherent neutrino-nucleus scattering by the COHERENT
collaboration has set on quantitative grounds the existence of an irreducible
neutrino background in direct detection searches of Weakly Interacting Massive
Dark Matter candidates. This background leads to an ultimate discovery limit
for these experiments: a minimum Dark Matter interaction cross section below
which events produced by the coherent neutrino scattering will mimic the Dark
Matter signal, the so-called \emph{neutrino floor}. In this work we study the
modification of such neutrino floor induced by non-standard neutrino
interactions within their presently allowed values by the global analysis of
oscillation and COHERENT data. By using the full likelihood information of such
global analysis we consistently account for the correlated effects of
non-standard neutrino interactions both in the neutrino propagation in matter
and in its interaction in the detector. We quantify their impact on the
neutrino floor for five future experiments: DARWIN (Xe), ARGO (Ar), Super-CDMS
HV (Ge and Si) and CRESST phase III (CaWO$_4$). Quantitatively, we find that
non-standard neutrino interactions allowed at the $3\sigma$ level can result in
an increase of the neutrino floor of up to a factor $\sim 5$ with respect to
the Standard Model expectations and impact the expected sensitivities of the
ARGO, CRESST phase III and DARWIN experiments.
| hep-ph | the detection of coherent neutrinonucleus scattering by the coherent collaboration has set on quantitative grounds the existence of an irreducible neutrino background in direct detection searches of weakly interacting massive dark matter candidates this background leads to an ultimate discovery limit for these experiments a minimum dark matter interaction cross section below which events produced by the coherent neutrino scattering will mimic the dark matter signal the socalled emphneutrino floor in this work we study the modification of such neutrino floor induced by nonstandard neutrino interactions within their presently allowed values by the global analysis of oscillation and coherent data by using the full likelihood information of such global analysis we consistently account for the correlated effects of nonstandard neutrino interactions both in the neutrino propagation in matter and in its interaction in the detector we quantify their impact on the neutrino floor for five future experiments darwin xe argo ar supercdms hv ge and si and cresst phase iii cawo_4 quantitatively we find that nonstandard neutrino interactions allowed at the 3sigma level can result in an increase of the neutrino floor of up to a factor sim 5 with respect to the standard model expectations and impact the expected sensitivities of the argo cresst phase iii and darwin experiments | [['the', 'detection', 'of', 'coherent', 'neutrinonucleus', 'scattering', 'by', 'the', 'coherent', 'collaboration', 'has', 'set', 'on', 'quantitative', 'grounds', 'the', 'existence', 'of', 'an', 'irreducible', 'neutrino', 'background', 'in', 'direct', 'detection', 'searches', 'of', 'weakly', 'interacting', 'massive', 'dark', 'matter', 'candidates', 'this', 'background', 'leads', 'to', 'an', 'ultimate', 'discovery', 'limit', 'for', 'these', 'experiments', 'a', 'minimum', 'dark', 'matter', 'interaction', 'cross', 'section', 'below', 'which', 'events', 'produced', 'by', 'the', 'coherent', 'neutrino', 'scattering', 'will', 'mimic', 'the', 'dark', 'matter', 'signal', 'the', 'socalled', 'emphneutrino', 'floor', 'in', 'this', 'work', 'we', 'study', 'the', 'modification', 'of', 'such', 'neutrino', 'floor', 'induced', 'by', 'nonstandard', 'neutrino', 'interactions', 'within', 'their', 'presently', 'allowed', 'values', 'by', 'the', 'global', 'analysis', 'of', 'oscillation', 'and', 'coherent', 'data', 'by', 'using', 'the', 'full', 'likelihood', 'information', 'of', 'such', 'global', 'analysis', 'we', 'consistently', 'account', 'for', 'the', 'correlated', 'effects', 'of', 'nonstandard', 'neutrino', 'interactions', 'both', 'in', 'the', 'neutrino', 'propagation', 'in', 'matter', 'and', 'in', 'its', 'interaction', 'in', 'the', 'detector', 'we', 'quantify', 'their', 'impact', 'on', 'the', 'neutrino', 'floor', 'for', 'five', 'future', 'experiments', 'darwin', 'xe', 'argo', 'ar', 'supercdms', 'hv', 'ge', 'and', 'si', 'and', 'cresst', 'phase', 'iii', 'cawo_4', 'quantitatively', 'we', 'find', 'that', 'nonstandard', 'neutrino', 'interactions', 'allowed', 'at', 'the', '3sigma', 'level', 'can', 'result', 'in', 'an', 'increase', 'of', 'the', 'neutrino', 'floor', 'of', 'up', 'to', 'a', 'factor', 'sim', '5', 'with', 'respect', 'to', 'the', 'standard', 'model', 'expectations', 'and', 'impact', 'the', 'expected', 'sensitivities', 'of', 'the', 'argo', 'cresst', 'phase', 'iii', 'and', 'darwin', 'experiments']] | [-0.08088179281355733, 0.2166886801836855, -0.03737420167157908, 0.15342942104256002, -0.03699135042851764, -0.0619721793698851, 0.06392775650379029, 0.30903653168948325, -0.2096863408131819, -0.35886679393819726, 0.040502117499464044, -0.3402502678922917, -0.06724231108425978, 0.18295608533983027, 0.0626938864510756, 0.023326835716813057, 0.056115986881822205, 0.02840509653006765, -0.08059403184315626, -0.23606186873629315, 0.28764639943715575, 0.147443501628561, 0.2510465807014069, 0.08876882332853937, 0.09119885225065107, 0.00893069670032086, -0.09136057297061932, -0.05406653708622359, -0.12130200046421119, 0.04100077579903046, 0.23262138962333478, 0.13170130972407365, 0.11993715150446663, -0.44158094726574193, -0.18898028388294127, 0.1906159143743404, 0.11541738625059939, 0.07374986349081433, -0.10108322094965494, -0.377678190050513, 0.038241722231951394, -0.22811741905474064, -0.11095830151793418, -0.013620065404859742, -0.035088539651581686, -0.0056979463816705074, -0.25027016132321367, 0.08049412777827848, 0.0031405739838805532, -0.017585857673303076, -0.03906621435227131, -0.1271319799503962, 0.02338722191693074, 0.049449559943928745, 0.05379703988457036, -0.031479000304263025, 0.15413207140289978, -0.21671160903946457, -0.10532022664951758, 0.37797623129035723, -0.15303719915008465, -0.1285314984646354, 0.16538716776382276, -0.16373501509318292, -0.09348692903718488, 0.17758378006838726, 0.19109475883681987, 0.032113560097198485, -0.16890286535367763, 0.09503390268661063, -0.024950395509239696, 0.16512000167065047, 0.04502122488728408, 0.011970565522882785, 0.2935250057397704, 0.24351740136751504, 0.0700720546134351, -0.019766112927650435, -0.18991923462165047, -0.018732294703178713, -0.3595327218620187, -0.09856331689755597, -0.07584374602081959, 0.020248118659334357, -0.06052396736864188, -0.10644466187537573, 0.375075042285649, 0.15838929747217936, 0.163509546422609, -0.014354454266000984, 0.30537066504394894, 0.06455719933248265, 0.022584753767163915, -0.023920475539827103, 0.3635043461682302, 0.11994785497758234, 0.07501647534499471, -0.24864677812249075, 0.045692879803123344, -0.002031555654409756] |
1,803.03651 | Singlet Scalar Top Partners from Accidental Supersymmetry | We present a model wherein the Higgs mass is protected from the quadratic
one-loop top quark corrections by scalar particles that are complete singlets
under the Standard Model (SM) gauge group. While bearing some similarity to
Folded Supersymmetry, the construction is purely four dimensional and enjoys
more parametric freedom, allowing electroweak symmetry breaking to occur
easily. The cancelation of the top loop quadratic divergence is ensured by a
$Z_3$ symmetry that relates the SM top sector and two hidden top sectors, each
charged under its own hidden color group. In addition to the singlet scalars,
the hidden sectors contain electroweak-charged supermultiplets below the TeV
scale, which provide the main access to this model at colliders. The
phenomenology presents both differences and similarities with respect to other
realizations of neutral naturalness. Generally, the glueballs of hidden color
have longer decay lengths. The production of hidden sector particles results in
quirk or squirk bound states, which later annihilate. We survey the possible
signatures and corresponding experimental constraints.
| hep-ph | we present a model wherein the higgs mass is protected from the quadratic oneloop top quark corrections by scalar particles that are complete singlets under the standard model sm gauge group while bearing some similarity to folded supersymmetry the construction is purely four dimensional and enjoys more parametric freedom allowing electroweak symmetry breaking to occur easily the cancelation of the top loop quadratic divergence is ensured by a z_3 symmetry that relates the sm top sector and two hidden top sectors each charged under its own hidden color group in addition to the singlet scalars the hidden sectors contain electroweakcharged supermultiplets below the tev scale which provide the main access to this model at colliders the phenomenology presents both differences and similarities with respect to other realizations of neutral naturalness generally the glueballs of hidden color have longer decay lengths the production of hidden sector particles results in quirk or squirk bound states which later annihilate we survey the possible signatures and corresponding experimental constraints | [['we', 'present', 'a', 'model', 'wherein', 'the', 'higgs', 'mass', 'is', 'protected', 'from', 'the', 'quadratic', 'oneloop', 'top', 'quark', 'corrections', 'by', 'scalar', 'particles', 'that', 'are', 'complete', 'singlets', 'under', 'the', 'standard', 'model', 'sm', 'gauge', 'group', 'while', 'bearing', 'some', 'similarity', 'to', 'folded', 'supersymmetry', 'the', 'construction', 'is', 'purely', 'four', 'dimensional', 'and', 'enjoys', 'more', 'parametric', 'freedom', 'allowing', 'electroweak', 'symmetry', 'breaking', 'to', 'occur', 'easily', 'the', 'cancelation', 'of', 'the', 'top', 'loop', 'quadratic', 'divergence', 'is', 'ensured', 'by', 'a', 'z_3', 'symmetry', 'that', 'relates', 'the', 'sm', 'top', 'sector', 'and', 'two', 'hidden', 'top', 'sectors', 'each', 'charged', 'under', 'its', 'own', 'hidden', 'color', 'group', 'in', 'addition', 'to', 'the', 'singlet', 'scalars', 'the', 'hidden', 'sectors', 'contain', 'electroweakcharged', 'supermultiplets', 'below', 'the', 'tev', 'scale', 'which', 'provide', 'the', 'main', 'access', 'to', 'this', 'model', 'at', 'colliders', 'the', 'phenomenology', 'presents', 'both', 'differences', 'and', 'similarities', 'with', 'respect', 'to', 'other', 'realizations', 'of', 'neutral', 'naturalness', 'generally', 'the', 'glueballs', 'of', 'hidden', 'color', 'have', 'longer', 'decay', 'lengths', 'the', 'production', 'of', 'hidden', 'sector', 'particles', 'results', 'in', 'quirk', 'or', 'squirk', 'bound', 'states', 'which', 'later', 'annihilate', 'we', 'survey', 'the', 'possible', 'signatures', 'and', 'corresponding', 'experimental', 'constraints']] | [-0.1156562923577262, 0.2712485957202195, -0.0733488849619767, 0.14381824200547005, -0.1151629440321746, -0.2130990754798759, 0.034420733348602746, 0.3274368968928551, -0.2294605072848953, -0.299106977413275, 0.05622248296489621, -0.3096188864636621, -0.04468289673152357, 0.03904195368096868, 0.03524101969059103, 0.03508915085162365, 0.0013771972863185333, 0.06208360536331339, -0.05980685937662734, -0.28431071321871815, 0.29542087166138536, 0.00631453660771069, 0.2494240198923252, 0.05997534776773735, 0.05685822298557202, -0.00012715296853878875, -0.0029938975856611053, -0.10117019666074889, -0.06315540359399875, 0.115685497322929, 0.13931016354053566, 0.05240538109252911, 0.10706158994310876, -0.3926427198187789, -0.16298922179419428, 0.1534478611585389, 0.13305993788739348, 0.11276824437379951, -0.07649393059874433, -0.3237355388871326, 0.10226867917680932, -0.1731676529793398, -0.12336904833607217, -0.07728670783931525, -0.08478074545529103, -0.1475041314804069, -0.28245393470747443, 0.09003774734588749, -0.001967162580978943, 0.04659505745413054, 0.0026522981259892355, -0.14344092111441126, -0.1395883456059936, 0.04503950397001307, 0.1760326231618287, -0.0031789851470044018, 0.16385251121374028, -0.21498129135708463, -0.1791299957513707, 0.4070601473592943, -0.10129105603810763, -0.2022988244319028, 0.1946056375461744, -0.1200736154413146, -0.16588368571044668, 0.13164745034471087, 0.1641300797360245, 0.0767053503361417, -0.1684754131554921, 0.18665937991477777, -0.05960179250914513, 0.17551518825632406, 0.06436270115067955, 0.09652714304932643, 0.27371244212589796, 0.12285415298964192, 0.04932310010970956, 0.12024131129621266, -0.025421183510887915, -0.15807744739655258, -0.43324447467514293, -0.12302467916441212, -0.06274084313651944, -0.004880953257869384, -0.06176970582476692, -0.10090243200510286, 0.44054194221772797, 0.12164925859720026, 0.22446500112461606, 0.03606688094228824, 0.2662077174981965, 0.040353275764529115, 0.1512621073109075, 0.05191473656322625, 0.26225296536083587, 0.1403917959101907, 0.0587825229172822, -0.2062759221511575, -0.014033893151663063, 0.08811650575541823] |
1,803.03652 | SPH to Grid: a new integral conserving method | Analysing data from Smoothed Particle Hydrodynamics (SPH) simulations is
about understanding global fluid properties rather than individual fluid
elements. Therefore, in order to properly understand the outcome of such
simulations it is crucial to transition from a particle to a grid based
picture. In this paper we briefly summarise different methods of calculating a
representative volume discretisation from SPH data and propose an improved
version of commonly used techniques. We present a possibility to generate
accurate 2D data directly without the CPU time and memory consuming detour over
a 3D grid. We lay out the importance of an accurate algorithm to conserve
integral fluid properties and to properly treat small scale structures using a
typical galaxy simulation snapshot. For demonstration purposes we additionally
calculate velocity power spectra and as expected find the main differences on
small scales. Finally we propose two new multi-purpose analysis packages which
utilise the new algorithms: Pygad and SPHMapper.
| astro-ph.IM physics.comp-ph | analysing data from smoothed particle hydrodynamics sph simulations is about understanding global fluid properties rather than individual fluid elements therefore in order to properly understand the outcome of such simulations it is crucial to transition from a particle to a grid based picture in this paper we briefly summarise different methods of calculating a representative volume discretisation from sph data and propose an improved version of commonly used techniques we present a possibility to generate accurate 2d data directly without the cpu time and memory consuming detour over a 3d grid we lay out the importance of an accurate algorithm to conserve integral fluid properties and to properly treat small scale structures using a typical galaxy simulation snapshot for demonstration purposes we additionally calculate velocity power spectra and as expected find the main differences on small scales finally we propose two new multipurpose analysis packages which utilise the new algorithms pygad and sphmapper | [['analysing', 'data', 'from', 'smoothed', 'particle', 'hydrodynamics', 'sph', 'simulations', 'is', 'about', 'understanding', 'global', 'fluid', 'properties', 'rather', 'than', 'individual', 'fluid', 'elements', 'therefore', 'in', 'order', 'to', 'properly', 'understand', 'the', 'outcome', 'of', 'such', 'simulations', 'it', 'is', 'crucial', 'to', 'transition', 'from', 'a', 'particle', 'to', 'a', 'grid', 'based', 'picture', 'in', 'this', 'paper', 'we', 'briefly', 'summarise', 'different', 'methods', 'of', 'calculating', 'a', 'representative', 'volume', 'discretisation', 'from', 'sph', 'data', 'and', 'propose', 'an', 'improved', 'version', 'of', 'commonly', 'used', 'techniques', 'we', 'present', 'a', 'possibility', 'to', 'generate', 'accurate', '2d', 'data', 'directly', 'without', 'the', 'cpu', 'time', 'and', 'memory', 'consuming', 'detour', 'over', 'a', '3d', 'grid', 'we', 'lay', 'out', 'the', 'importance', 'of', 'an', 'accurate', 'algorithm', 'to', 'conserve', 'integral', 'fluid', 'properties', 'and', 'to', 'properly', 'treat', 'small', 'scale', 'structures', 'using', 'a', 'typical', 'galaxy', 'simulation', 'snapshot', 'for', 'demonstration', 'purposes', 'we', 'additionally', 'calculate', 'velocity', 'power', 'spectra', 'and', 'as', 'expected', 'find', 'the', 'main', 'differences', 'on', 'small', 'scales', 'finally', 'we', 'propose', 'two', 'new', 'multipurpose', 'analysis', 'packages', 'which', 'utilise', 'the', 'new', 'algorithms', 'pygad', 'and', 'sphmapper']] | [-0.05135549887990123, 0.05277852979446268, -0.1275497590259507, 0.10695331952371172, -0.07411077930684516, -0.09360379365346833, 0.005847724688868501, 0.3878488003072754, -0.259715404410828, -0.3682946953367417, 0.08888810791463794, -0.24690654534932893, -0.10394505261819785, 0.20563173549333033, -0.0427477533006979, 0.06077660156401577, 0.11081932725027105, -0.049051599065150255, -0.0845453982852054, -0.1960719880595532, 0.28497915599951584, 0.11598464960713457, 0.2604625201691559, 0.0012008585351895517, 0.1113441163220671, -0.021467790377653197, -0.11451302423752499, 0.05310686554031952, -0.18470045270410596, 0.08240585436810129, 0.22134862946105863, 0.11247574009420659, 0.2782709887066227, -0.4836237286988473, -0.2146108905408556, 0.07275722966988538, 0.16329665861666104, 0.14733202224951977, -0.07556772750219491, -0.2135163053241096, 0.08244641939184277, -0.18304525849036254, -0.12354375880877703, -0.125901801005894, -0.00020401234683019436, 0.0194571612110602, -0.25221666938352355, 0.06662939118517451, -0.006636472196867135, 0.06302049373961147, -0.02882598666088742, -0.09428504556386627, 0.015054614639329101, 0.14162618431126983, -0.0013488806716308293, 0.004084098194448265, 0.14143084037728262, -0.11060853169911807, -0.08829810532636398, 0.44402508669539004, -0.05006541095726849, -0.20317291646011618, 0.20494223041583273, -0.10429793508994757, -0.1379774555637939, 0.11455555476050898, 0.23827272319907186, 0.13521380970772628, -0.15780099988945864, -0.0010886316959413127, 0.0009594811990067659, 0.20373387280728247, -0.01675051213889722, -0.002578697014590016, 0.20766276705837408, 0.20821889089913853, 0.027168357368583317, 0.11786904672294893, -0.12553602907943867, -0.10889397353390294, -0.28383257953659785, -0.1736622791479431, -0.19077272867531028, 0.02942200546038787, -0.08752197980684527, -0.15685595390201848, 0.38613038716702075, 0.24441492550124397, 0.16495067590233925, 0.04981966700099581, 0.36639093026975234, 0.05460190476729405, 0.06826190626409077, 0.09196502573029539, 0.16717659326390494, 0.07163329290485146, 0.12585268172956632, -0.202719490001416, 0.0018878921339078652, 0.08143371991066892] |
1,803.03653 | Spectroscopic decomposition of NGC 3521: unveiling the properties of the
bulge and disc | We study the kinematics and the stellar populations of the bulge and disc of
the spiral galaxy NGC 3521. At each position in the field of view, we separate
the contributions of the bulge and the disc from the total observed spectrum
and study their kinematics, age, and metallicities independently. Their
properties are clearly distinct: the bulge rotates more slowly, has a higher
velocity dispersion, and is less luminous than the disc. We identify three main
populations of stars in NGC 3521: old ($\geq7$ Gyr), intermediate ($\approx$ 3
Gyr), and young ($\leq$1 Gyr). The mass and light of NGC 3521 are dominated by
the intermediate stellar population. The youngest population contributes mostly
to the disc component and its contribution increases with radius. We also study
the luminosity-weighed properties of the stars in NGC 3521. Along the
photometric major axis, we find: i) no age gradient for the stars in the bulge,
and a negative age gradient for the stars in the disc; ii) negative metallicity
gradients and sub-solar $\alpha$-enhancement for both the bulge and the disc.
We propose the following picture for the formation of NGC 3521: initial
formation a long time ago ($\geq 7$ Gyr), followed by a second burst of star
formation or a merger ($\approx$ 3 Gyrs ago), which contributed predominantly
to the mass-build up of the bulge. Recently ($\leq 1$ Gyr), the disc of NGC
3521 experienced an additional episode of star formation that started in the
innermost regions.
| astro-ph.GA | we study the kinematics and the stellar populations of the bulge and disc of the spiral galaxy ngc 3521 at each position in the field of view we separate the contributions of the bulge and the disc from the total observed spectrum and study their kinematics age and metallicities independently their properties are clearly distinct the bulge rotates more slowly has a higher velocity dispersion and is less luminous than the disc we identify three main populations of stars in ngc 3521 old geq7 gyr intermediate approx 3 gyr and young leq1 gyr the mass and light of ngc 3521 are dominated by the intermediate stellar population the youngest population contributes mostly to the disc component and its contribution increases with radius we also study the luminosityweighed properties of the stars in ngc 3521 along the photometric major axis we find i no age gradient for the stars in the bulge and a negative age gradient for the stars in the disc ii negative metallicity gradients and subsolar alphaenhancement for both the bulge and the disc we propose the following picture for the formation of ngc 3521 initial formation a long time ago geq 7 gyr followed by a second burst of star formation or a merger approx 3 gyrs ago which contributed predominantly to the massbuild up of the bulge recently leq 1 gyr the disc of ngc 3521 experienced an additional episode of star formation that started in the innermost regions | [['we', 'study', 'the', 'kinematics', 'and', 'the', 'stellar', 'populations', 'of', 'the', 'bulge', 'and', 'disc', 'of', 'the', 'spiral', 'galaxy', 'ngc', '3521', 'at', 'each', 'position', 'in', 'the', 'field', 'of', 'view', 'we', 'separate', 'the', 'contributions', 'of', 'the', 'bulge', 'and', 'the', 'disc', 'from', 'the', 'total', 'observed', 'spectrum', 'and', 'study', 'their', 'kinematics', 'age', 'and', 'metallicities', 'independently', 'their', 'properties', 'are', 'clearly', 'distinct', 'the', 'bulge', 'rotates', 'more', 'slowly', 'has', 'a', 'higher', 'velocity', 'dispersion', 'and', 'is', 'less', 'luminous', 'than', 'the', 'disc', 'we', 'identify', 'three', 'main', 'populations', 'of', 'stars', 'in', 'ngc', '3521', 'old', 'geq7', 'gyr', 'intermediate', 'approx', '3', 'gyr', 'and', 'young', 'leq1', 'gyr', 'the', 'mass', 'and', 'light', 'of', 'ngc', '3521', 'are', 'dominated', 'by', 'the', 'intermediate', 'stellar', 'population', 'the', 'youngest', 'population', 'contributes', 'mostly', 'to', 'the', 'disc', 'component', 'and', 'its', 'contribution', 'increases', 'with', 'radius', 'we', 'also', 'study', 'the', 'luminosityweighed', 'properties', 'of', 'the', 'stars', 'in', 'ngc', '3521', 'along', 'the', 'photometric', 'major', 'axis', 'we', 'find', 'i', 'no', 'age', 'gradient', 'for', 'the', 'stars', 'in', 'the', 'bulge', 'and', 'a', 'negative', 'age', 'gradient', 'for', 'the', 'stars', 'in', 'the', 'disc', 'ii', 'negative', 'metallicity', 'gradients', 'and', 'subsolar', 'alphaenhancement', 'for', 'both', 'the', 'bulge', 'and', 'the', 'disc', 'we', 'propose', 'the', 'following', 'picture', 'for', 'the', 'formation', 'of', 'ngc', '3521', 'initial', 'formation', 'a', 'long', 'time', 'ago', 'geq', '7', 'gyr', 'followed', 'by', 'a', 'second', 'burst', 'of', 'star', 'formation', 'or', 'a', 'merger', 'approx', '3', 'gyrs', 'ago', 'which', 'contributed', 'predominantly', 'to', 'the', 'massbuild', 'up', 'of', 'the', 'bulge', 'recently', 'leq', '1', 'gyr', 'the', 'disc', 'of', 'ngc', '3521', 'experienced', 'an', 'additional', 'episode', 'of', 'star', 'formation', 'that', 'started', 'in', 'the', 'innermost', 'regions']] | [-0.06868865838828903, 0.10772144534636947, -0.09907043051492438, 0.10032426651772035, -0.07138249677068774, -0.0329603284560685, 0.026304626184287656, 0.4480094568479296, -0.1650368051750284, -0.3494691530414529, 0.026137113138353183, -0.2682801285547038, 0.01177449169166819, 0.16986579666551746, -0.05397945046965883, -0.09767321812175407, 0.055650668892105154, -0.09614425906486407, -0.04057328126594208, -0.3130198950286089, 0.30611568841024367, 0.009403840276408802, 0.052804092210968684, -0.07268458390386226, 0.05054439126254983, -0.1058979806126988, -0.06127987124404534, -0.10082945594741843, -0.19698228022602074, 0.027433117762733543, 0.17382695477193075, 0.13459187497373254, 0.2868635384172696, -0.3440647709001768, -0.1632608093912578, 0.030101308583656783, 0.2765444270006663, 0.0259762352976863, -0.10456545379128031, -0.23227641094259577, 0.08029322858312442, -0.19948163942126673, -0.21724215496516944, 0.17446372045891909, 0.11433660014314168, -0.028083666147571445, -0.17615059429694632, 0.22299293122248032, 0.07318479407393215, 0.13190929476303123, -0.15806326830829204, -0.1462380372188769, -0.09084348749423485, 0.0997880974685951, 0.04346957376286681, 0.12478863956847255, 0.18977279522595347, -0.14225908631992168, 0.013369742177109933, 0.351052698335336, -0.06762718789433916, 0.05129595821978393, 0.23263975969685774, -0.25231122358845104, -0.16329536909351988, 0.06705091611957525, 0.13760100208276968, 0.1426149634278478, -0.1465214160676752, 0.010357744361880656, 0.010497773753544819, 0.22020302626741006, 0.07025936362043765, 0.002329603330818144, 0.31969953448554167, 0.09111299153989282, 0.05261962601375917, 0.05822538308455334, -0.23281803221685263, -0.09037350115455162, -0.19386359404277875, -0.11010237425180244, -0.0500472973166536, 0.08112965985993503, -0.19135671330705725, -0.09381375978874715, 0.37048191728294516, 0.04084228311908814, 0.2545355464287365, 0.03772032861882836, 0.29811395376271477, 0.05641451568117643, 0.13566067766715073, 0.1901211694551485, 0.303865152469129, 0.23055784654884726, 0.07852350085146756, -0.28876178105532274, 0.1190920780471785, -0.03537271122537028] |
1,803.03654 | Directing Chemotaxis-Based Spatial Self-Organization via Biased, Random
Initial Conditions | Inspired by the chemotaxis interaction of living cells, we have developed an
agent-based approach for self-organizing shape formation. Since all our
simulations begin with a different uniform random configuration and our agents
move stochastically, it has been observed that the self-organization process
may form two or more stable final configurations. These differing
configurations may be characterized via statistical moments of the agents'
locations. In order to direct the agents to robustly form one specific
configuration, we generate biased initial conditions whose statistical moments
are related to moments of the desired configuration. With this approach, we are
able to successfully direct the aggregating swarms to produced a desired
macroscopic shape, starting from randomized initial conditions with controlled
statistical properties.
| cs.MA | inspired by the chemotaxis interaction of living cells we have developed an agentbased approach for selforganizing shape formation since all our simulations begin with a different uniform random configuration and our agents move stochastically it has been observed that the selforganization process may form two or more stable final configurations these differing configurations may be characterized via statistical moments of the agents locations in order to direct the agents to robustly form one specific configuration we generate biased initial conditions whose statistical moments are related to moments of the desired configuration with this approach we are able to successfully direct the aggregating swarms to produced a desired macroscopic shape starting from randomized initial conditions with controlled statistical properties | [['inspired', 'by', 'the', 'chemotaxis', 'interaction', 'of', 'living', 'cells', 'we', 'have', 'developed', 'an', 'agentbased', 'approach', 'for', 'selforganizing', 'shape', 'formation', 'since', 'all', 'our', 'simulations', 'begin', 'with', 'a', 'different', 'uniform', 'random', 'configuration', 'and', 'our', 'agents', 'move', 'stochastically', 'it', 'has', 'been', 'observed', 'that', 'the', 'selforganization', 'process', 'may', 'form', 'two', 'or', 'more', 'stable', 'final', 'configurations', 'these', 'differing', 'configurations', 'may', 'be', 'characterized', 'via', 'statistical', 'moments', 'of', 'the', 'agents', 'locations', 'in', 'order', 'to', 'direct', 'the', 'agents', 'to', 'robustly', 'form', 'one', 'specific', 'configuration', 'we', 'generate', 'biased', 'initial', 'conditions', 'whose', 'statistical', 'moments', 'are', 'related', 'to', 'moments', 'of', 'the', 'desired', 'configuration', 'with', 'this', 'approach', 'we', 'are', 'able', 'to', 'successfully', 'direct', 'the', 'aggregating', 'swarms', 'to', 'produced', 'a', 'desired', 'macroscopic', 'shape', 'starting', 'from', 'randomized', 'initial', 'conditions', 'with', 'controlled', 'statistical', 'properties']] | [-0.09106333317606062, 0.16434620996116822, -0.10690716877816465, 0.04899913097159373, -0.06622517398574342, -0.12132103340621343, 0.017051726762181686, 0.41163701889247206, -0.27723583547887787, -0.3238606782081553, 0.04338845512652138, -0.21896083695593022, -0.13788535515580452, 0.1231533681038546, -0.024985329405862396, 0.06086245118008958, 0.04492661427860385, 0.01078469330697494, 0.014522984979690992, -0.2526236472294224, 0.2970697071908389, 0.045960266517980373, 0.2766415077514189, -0.06514971646464478, 0.0999739977641631, -0.032488168313185746, 0.029071489790991202, 0.06901090243294583, -0.14304927603364576, 0.13224268100871625, 0.22188249862628548, 0.11679082399163143, 0.26706921894860974, -0.49243844455202757, -0.2007379018606902, 0.13755152782551566, 0.14170381184904127, 0.14284793321453668, -0.04728143616597725, -0.32647354195241707, 0.11709861986938927, -0.15355574598898952, -0.16524808160502905, -0.11275019584286769, -0.02460016809025053, 0.09161628337953855, -0.3149668881985343, 0.02096173096590249, 0.05368847246488982, 0.026197434016266615, -0.07964649164094195, -0.10612728336226132, -0.043883727705579696, 0.19241088569081405, 0.015799446970419722, -0.01982598285135513, 0.18604021485484504, -0.11075617625453052, -0.12739320729180412, 0.3504729909522427, 0.019106759629567486, -0.24601077957382678, 0.25468939338352975, -0.13248137665628376, -0.14833738667480015, 0.13509876068318422, 0.18379455320221388, 0.12098589174496799, -0.18256328076566175, -0.03020851477986533, -0.005083884601875887, 0.15707362412329037, 0.05740476374403905, -0.0281430468835347, 0.24052251109821818, 0.15525324099649818, 0.07668029192353647, 0.11255954052232821, -0.038401224192673875, -0.1920020019327748, -0.2319793341902353, -0.07189433458971523, -0.17888700636991664, 0.0641231094299563, -0.07828765437024215, -0.15228734307101596, 0.3781339186125324, 0.15690775132766172, 0.21393509686458856, 0.03741379461637935, 0.2715533472818591, 0.07728434053952095, 0.03513079055119306, 0.028714874100287335, 0.2162122259753109, 0.0609692803651126, 0.08348526014212393, -0.17492820015690147, 0.13399755678108058, 0.031036459414635675] |
1,803.03655 | Accurately predicting the escape fraction of ionizing photons using
restframe ultraviolet absorption lines | The fraction of ionizing photons that escape high-redshift galaxies
sensitively determines whether galaxies reionized the early universe. However,
this escape fraction cannot be measured from high-redshift galaxies because the
opacity of the intergalactic medium is large at high redshifts. Without methods
to indirectly measure the escape fraction of high-redshift galaxies, it is
unlikely that we will know what reionized the universe. Here, we analyze the
far-ultraviolet (UV) H I (Lyman series) and low-ionization metal absorption
lines of nine low-redshift, confirmed Lyman continuum emitting galaxies. We use
the H I covering fractions, column densities, and dust attenuations measured in
a companion paper to predict the escape fraction of ionizing photons. We find
good agreement between the predicted and observed Lyman continuum escape
fractions (within $1.4\sigma$) using both the H I and ISM absorption lines. The
ionizing photons escape through holes in the H I, but we show that dust
attenuation reduces the fraction of photons that escape galaxies. This means
that the average high-redshift galaxy likely emits more ionizing photons than
low-redshift galaxies. Two other indirect methods accurately predict the escape
fractions: the Ly$\alpha$ escape fraction and the optical [O III]/[O II] flux
ratio. We use these indirect methods to predict the escape fraction of a sample
of 21 galaxies with rest-frame UV spectra but without Lyman continuum
observations. Many of these galaxies have low escape fractions ($f_{\rm esc}
\le 1$\%), but 11 have escape fractions $>1$\%. The methods presented here will
measure the escape fractions of high-redshift galaxies, enabling future
telescopes to determine whether star-forming galaxies reionized the early
universe.
| astro-ph.GA | the fraction of ionizing photons that escape highredshift galaxies sensitively determines whether galaxies reionized the early universe however this escape fraction cannot be measured from highredshift galaxies because the opacity of the intergalactic medium is large at high redshifts without methods to indirectly measure the escape fraction of highredshift galaxies it is unlikely that we will know what reionized the universe here we analyze the farultraviolet uv h i lyman series and lowionization metal absorption lines of nine lowredshift confirmed lyman continuum emitting galaxies we use the h i covering fractions column densities and dust attenuations measured in a companion paper to predict the escape fraction of ionizing photons we find good agreement between the predicted and observed lyman continuum escape fractions within 14sigma using both the h i and ism absorption lines the ionizing photons escape through holes in the h i but we show that dust attenuation reduces the fraction of photons that escape galaxies this means that the average highredshift galaxy likely emits more ionizing photons than lowredshift galaxies two other indirect methods accurately predict the escape fractions the lyalpha escape fraction and the optical o iiio ii flux ratio we use these indirect methods to predict the escape fraction of a sample of 21 galaxies with restframe uv spectra but without lyman continuum observations many of these galaxies have low escape fractions f_rm esc le 1 but 11 have escape fractions 1 the methods presented here will measure the escape fractions of highredshift galaxies enabling future telescopes to determine whether starforming galaxies reionized the early universe | [['the', 'fraction', 'of', 'ionizing', 'photons', 'that', 'escape', 'highredshift', 'galaxies', 'sensitively', 'determines', 'whether', 'galaxies', 'reionized', 'the', 'early', 'universe', 'however', 'this', 'escape', 'fraction', 'can', 'not', 'be', 'measured', 'from', 'highredshift', 'galaxies', 'because', 'the', 'opacity', 'of', 'the', 'intergalactic', 'medium', 'is', 'large', 'at', 'high', 'redshifts', 'without', 'methods', 'to', 'indirectly', 'measure', 'the', 'escape', 'fraction', 'of', 'highredshift', 'galaxies', 'it', 'is', 'unlikely', 'that', 'we', 'will', 'know', 'what', 'reionized', 'the', 'universe', 'here', 'we', 'analyze', 'the', 'farultraviolet', 'uv', 'h', 'i', 'lyman', 'series', 'and', 'lowionization', 'metal', 'absorption', 'lines', 'of', 'nine', 'lowredshift', 'confirmed', 'lyman', 'continuum', 'emitting', 'galaxies', 'we', 'use', 'the', 'h', 'i', 'covering', 'fractions', 'column', 'densities', 'and', 'dust', 'attenuations', 'measured', 'in', 'a', 'companion', 'paper', 'to', 'predict', 'the', 'escape', 'fraction', 'of', 'ionizing', 'photons', 'we', 'find', 'good', 'agreement', 'between', 'the', 'predicted', 'and', 'observed', 'lyman', 'continuum', 'escape', 'fractions', 'within', '14sigma', 'using', 'both', 'the', 'h', 'i', 'and', 'ism', 'absorption', 'lines', 'the', 'ionizing', 'photons', 'escape', 'through', 'holes', 'in', 'the', 'h', 'i', 'but', 'we', 'show', 'that', 'dust', 'attenuation', 'reduces', 'the', 'fraction', 'of', 'photons', 'that', 'escape', 'galaxies', 'this', 'means', 'that', 'the', 'average', 'highredshift', 'galaxy', 'likely', 'emits', 'more', 'ionizing', 'photons', 'than', 'lowredshift', 'galaxies', 'two', 'other', 'indirect', 'methods', 'accurately', 'predict', 'the', 'escape', 'fractions', 'the', 'lyalpha', 'escape', 'fraction', 'and', 'the', 'optical', 'o', 'iiio', 'ii', 'flux', 'ratio', 'we', 'use', 'these', 'indirect', 'methods', 'to', 'predict', 'the', 'escape', 'fraction', 'of', 'a', 'sample', 'of', '21', 'galaxies', 'with', 'restframe', 'uv', 'spectra', 'but', 'without', 'lyman', 'continuum', 'observations', 'many', 'of', 'these', 'galaxies', 'have', 'low', 'escape', 'fractions', 'f_rm', 'esc', 'le', '1', 'but', '11', 'have', 'escape', 'fractions', '1', 'the', 'methods', 'presented', 'here', 'will', 'measure', 'the', 'escape', 'fractions', 'of', 'highredshift', 'galaxies', 'enabling', 'future', 'telescopes', 'to', 'determine', 'whether', 'starforming', 'galaxies', 'reionized', 'the', 'early', 'universe']] | [0.0018414535515779323, 0.17210953471864576, -0.008084857011199625, 0.13571971879158726, -0.06792244216930335, -0.06495910834777972, 0.09662056136011035, 0.4770320771454737, -0.09021360676564362, -0.3265859014889889, -0.05448986607750028, -0.3501501740652254, 0.05143790539903602, 0.14666383749166667, 0.030045585320563097, -0.04900098838611466, 0.0176229281110111, -0.19807653207246256, 0.052226329262018686, -0.342525621257023, 0.25019010905019395, 0.09377648921191008, 0.14922011070938287, -0.026458301675109857, 0.0573680525649182, -0.1397375075422652, -0.13446092760811248, -0.02431005600864831, -0.227099564004654, 0.0040852661642435065, 0.2526313290053486, 0.19979477682778918, 0.23913917155094244, -0.33772298683294955, -0.2152611804426687, 0.1870639762177464, 0.28309188147300274, 0.0645690838966012, -0.0711828254842243, -0.2540037985070398, -0.006925839148203118, -0.13601982815840577, -0.14982605913575467, 0.12466577503658917, 0.04644464351722107, 0.022010092492843355, -0.1790010617582941, 0.16812385954105535, -0.06778026205555347, 0.04878298189469624, -0.0693555512096219, -0.03483063546080727, -0.1113897267518515, 0.05109823053039011, -0.022426696347921972, 0.01965783545979338, 0.3247971076525434, -0.20998371333879387, 0.04444182003487858, 0.44489044979414494, -0.08954961560569548, 0.0420645011974306, 0.2436098865700807, -0.29263255658641574, -0.19910281197207183, 0.26913899402276853, 0.15621475682645622, 0.09203288580248153, -0.10978379352838943, -0.00467514472229003, -0.02842077929896777, 0.24502908388934172, 0.02073047726978887, 0.1083642812078059, 0.3076769376844453, -0.011522536744966646, 0.009013033446577516, 0.0488434941795569, -0.19737763982979845, 0.07852291541042028, -0.236649188995397, -0.15763516621164606, -0.12700310990908378, 0.19444975436499415, -0.12592192694393808, -0.10424016744890376, 0.27009140596264736, 0.17014949202316304, 0.25440215024654667, 0.14306603654437625, 0.32902307896788147, 0.13276147262426985, 0.05051343730772164, 0.10263981182178147, 0.3696085814176077, 0.16363645253267667, 0.051879361952062684, -0.25184964376922797, 0.08029713179609271, 0.018824774996730787] |
1,803.03656 | Nucleon Quark Distribution Functions from the Dyson-Schwinger Equations | We present results for the nucleon's leading-twist spin-independent valence
parton distribution functions obtained from a theoretical framework based on
the Dyson-Schwinger equations (DSEs) of QCD that previously gave an excellent
description of nucleon electromagnetic form factors. We employ the
rainbow-ladder truncation of the DSEs and utilize nucleon bound state
amplitudes from the Poincar\'e-covariant Faddeev equation, where the dominant
scalar and axial-vector quark-quark correlations are included. This DSE
framework is used to numerically evaluate the first 20 moments of the valence
$u$ and $d$ quark distribution functions, from which the $x$-dependence of the
distributions is found to be well constrained. We find good agreement with
empirical parameterizations of experimental data and make the prediction that
the $d/u$ ratio in the $x\to 1$ limit, invariant under scale evolution, takes
the value $d/u \to 0.087 \pm 0.010$. We find that this ratio is rather
sensitive to the strength of axial-vector diquark correlations. However,
contrary to a naive expectation, our result for the $d/u$ ratio in the $x\to 1$
limit does not vanish when only scalar diquark correlations are present,
although it is an order of magnitude smaller than our $d/u$ result that also
includes axial-vector diquarks. The valence quark distribution results are set
in a broader context via a simple pion cloud model estimate of sea-quark
light-cone momenta and gluon light-cone momentum.
| nucl-th hep-ph nucl-ex | we present results for the nucleons leadingtwist spinindependent valence parton distribution functions obtained from a theoretical framework based on the dysonschwinger equations dses of qcd that previously gave an excellent description of nucleon electromagnetic form factors we employ the rainbowladder truncation of the dses and utilize nucleon bound state amplitudes from the poincarecovariant faddeev equation where the dominant scalar and axialvector quarkquark correlations are included this dse framework is used to numerically evaluate the first 20 moments of the valence u and d quark distribution functions from which the xdependence of the distributions is found to be well constrained we find good agreement with empirical parameterizations of experimental data and make the prediction that the du ratio in the xto 1 limit invariant under scale evolution takes the value du to 0087 pm 0010 we find that this ratio is rather sensitive to the strength of axialvector diquark correlations however contrary to a naive expectation our result for the du ratio in the xto 1 limit does not vanish when only scalar diquark correlations are present although it is an order of magnitude smaller than our du result that also includes axialvector diquarks the valence quark distribution results are set in a broader context via a simple pion cloud model estimate of seaquark lightcone momenta and gluon lightcone momentum | [['we', 'present', 'results', 'for', 'the', 'nucleons', 'leadingtwist', 'spinindependent', 'valence', 'parton', 'distribution', 'functions', 'obtained', 'from', 'a', 'theoretical', 'framework', 'based', 'on', 'the', 'dysonschwinger', 'equations', 'dses', 'of', 'qcd', 'that', 'previously', 'gave', 'an', 'excellent', 'description', 'of', 'nucleon', 'electromagnetic', 'form', 'factors', 'we', 'employ', 'the', 'rainbowladder', 'truncation', 'of', 'the', 'dses', 'and', 'utilize', 'nucleon', 'bound', 'state', 'amplitudes', 'from', 'the', 'poincarecovariant', 'faddeev', 'equation', 'where', 'the', 'dominant', 'scalar', 'and', 'axialvector', 'quarkquark', 'correlations', 'are', 'included', 'this', 'dse', 'framework', 'is', 'used', 'to', 'numerically', 'evaluate', 'the', 'first', '20', 'moments', 'of', 'the', 'valence', 'u', 'and', 'd', 'quark', 'distribution', 'functions', 'from', 'which', 'the', 'xdependence', 'of', 'the', 'distributions', 'is', 'found', 'to', 'be', 'well', 'constrained', 'we', 'find', 'good', 'agreement', 'with', 'empirical', 'parameterizations', 'of', 'experimental', 'data', 'and', 'make', 'the', 'prediction', 'that', 'the', 'du', 'ratio', 'in', 'the', 'xto', '1', 'limit', 'invariant', 'under', 'scale', 'evolution', 'takes', 'the', 'value', 'du', 'to', '0087', 'pm', '0010', 'we', 'find', 'that', 'this', 'ratio', 'is', 'rather', 'sensitive', 'to', 'the', 'strength', 'of', 'axialvector', 'diquark', 'correlations', 'however', 'contrary', 'to', 'a', 'naive', 'expectation', 'our', 'result', 'for', 'the', 'du', 'ratio', 'in', 'the', 'xto', '1', 'limit', 'does', 'not', 'vanish', 'when', 'only', 'scalar', 'diquark', 'correlations', 'are', 'present', 'although', 'it', 'is', 'an', 'order', 'of', 'magnitude', 'smaller', 'than', 'our', 'du', 'result', 'that', 'also', 'includes', 'axialvector', 'diquarks', 'the', 'valence', 'quark', 'distribution', 'results', 'are', 'set', 'in', 'a', 'broader', 'context', 'via', 'a', 'simple', 'pion', 'cloud', 'model', 'estimate', 'of', 'seaquark', 'lightcone', 'momenta', 'and', 'gluon', 'lightcone', 'momentum']] | [-0.08022334203166573, 0.15819987166605434, -0.141142130629521, 0.1511499967912986, -0.0638555797203933, -0.06109869261654987, 0.0503337718812179, 0.34414487158598966, -0.15940313543922366, -0.23959370472226038, -0.052616284775853873, -0.31768051472802955, -0.06192627885898779, 0.08622963489968857, 0.05593657973711485, 0.07852646258136589, 0.05712120904859377, 0.019314052859219173, -0.10514429391608425, -0.22497739795527366, 0.3647735559500618, -0.002881798627424866, 0.2590455821753569, 0.13766792366046196, 0.06429914365916993, 0.04552435221950009, -0.014700067297610791, -0.06610545834534926, -0.13195553911516558, 0.05947621902408393, 0.20159875930629279, 0.06162838304955427, 0.15805344348326836, -0.3634496178508834, -0.13496755461737972, 0.07828087914739332, 0.16986304536551136, 0.09556693152883877, 0.02814306128721208, -0.28094676811435176, 0.06954279743755858, -0.22794723320331373, -0.1668318614159545, -0.13590877965415857, -0.004555625220139821, -0.0030707358558062616, -0.3648189695798643, 0.13567640733058334, -0.018057792226371428, -0.00809234218112699, -0.04104632250199171, -0.2802401587928403, -0.04466388877545011, 0.05084795398453195, 0.09046616943044902, 0.14741802753080066, 0.11008128412833361, -0.18244072942689277, -0.06908793596404107, 0.3966287118563488, -0.08527418639337841, -0.21503403607636826, 0.09103954499523627, -0.1799558571531314, -0.10754470068740246, 0.11436679270373631, 0.1587852685506026, 0.11288532235587365, -0.167671913867213, 0.1075877417694909, -0.06996846807584779, 0.19311239387516835, 0.0682437758293156, 0.054738399325719805, 0.1596504976892138, 0.1430450124223823, -0.02051668332626014, 0.06228570624937189, -0.06765162110324421, -0.13378198440590677, -0.37925444097156086, -0.06776585430890263, -0.1361243689361509, 0.06628107930302087, -0.12442354752044789, -0.1315998989993283, 0.3349200719855853, 0.14142693405371312, 0.2179910183424921, 0.06415308237162984, 0.2946248066241611, 0.13049623176311176, 0.0707830405883389, 0.10572208212497197, 0.28732130839595715, 0.18187834329256727, 0.10438620328184772, -0.24823391065533065, 0.01577135478040059, 0.08647243509740998] |
1,803.03657 | Quantum simulation of partially distinguishable boson sampling | Boson Sampling is the problem of sampling from the same output probability
distribution as a collection of indistinguishable single photons input into a
linear interferometer. It has been shown that, subject to certain computational
complexity conjectures, in general the problem is difficult to solve
classically, motivating optical experiments aimed at demonstrating quantum
computational "supremacy". There are a number of challenges faced by such
experiments, including the generation of indistinguishable single photons. We
provide a quantum circuit that simulates bosonic sampling with arbitrarily
distinguishable particles. This makes clear how distinguishabililty leads to
decoherence in the standard quantum circuit model, allowing insight to be
gained. At the heart of the circuit is the quantum Schur transform, which
follows from a representation theoretic approach to the physics of
distinguishable particles in first quantisation. The techniques are quite
general and have application beyond boson sampling.
| quant-ph | boson sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer it has been shown that subject to certain computational complexity conjectures in general the problem is difficult to solve classically motivating optical experiments aimed at demonstrating quantum computational supremacy there are a number of challenges faced by such experiments including the generation of indistinguishable single photons we provide a quantum circuit that simulates bosonic sampling with arbitrarily distinguishable particles this makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model allowing insight to be gained at the heart of the circuit is the quantum schur transform which follows from a representation theoretic approach to the physics of distinguishable particles in first quantisation the techniques are quite general and have application beyond boson sampling | [['boson', 'sampling', 'is', 'the', 'problem', 'of', 'sampling', 'from', 'the', 'same', 'output', 'probability', 'distribution', 'as', 'a', 'collection', 'of', 'indistinguishable', 'single', 'photons', 'input', 'into', 'a', 'linear', 'interferometer', 'it', 'has', 'been', 'shown', 'that', 'subject', 'to', 'certain', 'computational', 'complexity', 'conjectures', 'in', 'general', 'the', 'problem', 'is', 'difficult', 'to', 'solve', 'classically', 'motivating', 'optical', 'experiments', 'aimed', 'at', 'demonstrating', 'quantum', 'computational', 'supremacy', 'there', 'are', 'a', 'number', 'of', 'challenges', 'faced', 'by', 'such', 'experiments', 'including', 'the', 'generation', 'of', 'indistinguishable', 'single', 'photons', 'we', 'provide', 'a', 'quantum', 'circuit', 'that', 'simulates', 'bosonic', 'sampling', 'with', 'arbitrarily', 'distinguishable', 'particles', 'this', 'makes', 'clear', 'how', 'distinguishabililty', 'leads', 'to', 'decoherence', 'in', 'the', 'standard', 'quantum', 'circuit', 'model', 'allowing', 'insight', 'to', 'be', 'gained', 'at', 'the', 'heart', 'of', 'the', 'circuit', 'is', 'the', 'quantum', 'schur', 'transform', 'which', 'follows', 'from', 'a', 'representation', 'theoretic', 'approach', 'to', 'the', 'physics', 'of', 'distinguishable', 'particles', 'in', 'first', 'quantisation', 'the', 'techniques', 'are', 'quite', 'general', 'and', 'have', 'application', 'beyond', 'boson', 'sampling']] | [-0.06950533674015398, 0.17531037543501174, -0.11660146401263774, 0.07827906053613073, -0.061277517070993784, -0.21110429075613085, 0.03516998359950126, 0.3457462729634634, -0.3009443087318297, -0.31416927941276557, 0.033844026977229595, -0.26246526118900093, -0.12752403553375707, 0.24858739485997441, -0.08533329323774004, 0.12075980225844042, 0.08424724056718073, 0.02717190796164297, -0.022755411310520557, -0.2536578729623995, 0.2560318876789617, 0.05457972216286829, 0.2878499963586884, -0.0018858918637436415, 0.13388954355281646, 0.0006939607605870281, -0.008916086099842298, -0.0064671440183051996, -0.0668561653704923, 0.1111406847352295, 0.28506744567837033, 0.1684043386801412, 0.28949629117601683, -0.4305635128835482, -0.20051906534603664, 0.11549646359552364, 0.15610108656785868, 0.17235404916822777, -0.08207319430075585, -0.27810583910239595, 0.04419356488423156, -0.14130092185057166, -0.08812116699201787, -0.05297653395017343, -0.036675258356678696, -0.05717683327384293, -0.25074296923454054, 0.02330941437144897, 0.03797202857011663, 0.01649750423551138, 0.03942793724293422, -0.07613135383830273, 0.057756385360179206, 0.11076520169777464, 0.0039402214448533155, 0.02095568448172084, 0.13522590704420248, -0.16114835117228463, -0.1929576008514102, 0.4190872617331999, -0.005523598945832678, -0.20460566579464023, 0.201572913090266, -0.1241349391539448, -0.13686092678191406, 0.15167286254831458, 0.12933241183137786, 0.04965184242298294, -0.1255295919470622, 0.12328126932053628, -0.044363906221198186, 0.16410130261709646, 0.057083710791942265, 0.08574880994274281, 0.23237672174249643, 0.17865390637889506, 0.03995873469227393, 0.19728764223649964, -0.05367054918959704, -0.1613320739399309, -0.29835379336561474, -0.15645149735667344, -0.23233623235885587, 0.08452792650620852, -0.03995955621846536, -0.14587571279657174, 0.37148687741220265, 0.18021590981765517, 0.1698053903279028, 0.06457674760188509, 0.32985362196341156, 0.14776173738812629, 0.0594959942877592, 0.024523096935757036, 0.2165778620808851, 0.15431697020872628, 0.04473847562912851, -0.1960021864464839, 0.02234176588743659, 0.02606846725102514] |
1,803.03658 | NNLO QCD corrections to the polarized top quark decay $t(\uparrow) \to
X_b+W^+$ | We compute the next-to-next-to-leading order (NNLO) QCD corrections to the
decay $t(\uparrow) \to X_b +W^+$ of a polarized top quark. The spin-momentum
correlation in this quasi two-body decay is described by the polar angle
distribution $\mathrm{d}\Gamma/\mathrm{d}\cos\theta_P=\frac{\Gamma}{2}(1+P_t\,
\alpha_P\, \cos\theta_P)$ where $P_t$ is the polarization of the top quark and
$\alpha_P$ denotes the asymmetry parameter of the decay. For the latter we find
$\alpha^{\mathrm{NNLO}}_P=0.3792\pm 0.0037$.
| hep-ph | we compute the nexttonexttoleading order nnlo qcd corrections to the decay tuparrow to x_b w of a polarized top quark the spinmomentum correlation in this quasi twobody decay is described by the polar angle distribution mathrmdgammamathrmdcostheta_pfracgamma21p_t alpha_p costheta_p where p_t is the polarization of the top quark and alpha_p denotes the asymmetry parameter of the decay for the latter we find alphamathrmnnlo_p03792pm 00037 | [['we', 'compute', 'the', 'nexttonexttoleading', 'order', 'nnlo', 'qcd', 'corrections', 'to', 'the', 'decay', 'tuparrow', 'to', 'x_b', 'w', 'of', 'a', 'polarized', 'top', 'quark', 'the', 'spinmomentum', 'correlation', 'in', 'this', 'quasi', 'twobody', 'decay', 'is', 'described', 'by', 'the', 'polar', 'angle', 'distribution', 'mathrmdgammamathrmdcostheta_pfracgamma21p_t', 'alpha_p', 'costheta_p', 'where', 'p_t', 'is', 'the', 'polarization', 'of', 'the', 'top', 'quark', 'and', 'alpha_p', 'denotes', 'the', 'asymmetry', 'parameter', 'of', 'the', 'decay', 'for', 'the', 'latter', 'we', 'find', 'alphamathrmnnlo_p03792pm', '00037']] | [-0.13649681759998203, 0.2614547757431865, -0.11929804802251359, 0.1230380131494409, -0.028567662586768468, -0.07933711830992252, 0.058402044139802455, 0.31823686209196844, -0.26298559290977813, -0.177616710588336, -0.05139776946161874, -0.3410973680826525, 0.066298863866056, 0.0718408436824878, 0.1197206539257119, 0.11301812277330707, -0.010384237308365603, 0.0074185048074771965, -0.11238357933082928, -0.19983011552443106, 0.3185153218607108, 0.0017592713508444529, 0.17194887547714946, 0.16156776926169794, 0.018749164789915083, 0.05192141424243649, -0.054513514825763804, -0.12046913807280361, -0.1761004974056656, 0.052073439086476964, 0.1672155670724654, -0.05394493011602511, 0.07919693517809114, -0.2482259259481604, -0.03633355230558664, 0.10850931274859855, 0.13554030133721728, 0.08645717119798065, 0.00797053094720468, -0.2653779839165509, 0.12182551828833918, -0.24520986130228267, -0.14343630539175745, -0.0960387715138495, 0.037790295155718925, -0.05298027372919023, -0.37956790942698715, 0.10637631032926341, -0.018533860938623546, -0.023710464546456932, 0.07825956727998952, -0.21350187848632535, -0.10009251022711396, 0.05568209626556685, 0.15117812028620392, 0.15843579032613586, 0.13821119683173796, -0.19896886678567777, -0.1515125982608879, 0.3895497388827304, -0.09737322371802293, -0.1847983226024856, 0.020113418522911767, -0.2931407569985216, -0.08003600011579692, 0.15201106560028468, 0.21996868496450286, 0.15287832020161052, -0.105706479997995, 0.1726675271824206, -0.027564190436775486, 0.18994678684975952, 0.08585655712522566, 0.05203764595401784, 0.16317290941563745, 0.15007692046153048, -0.03148738532327115, 0.10996806668117642, -0.14649775301416715, -0.11631939965300261, -0.4404048261853556, -0.1385010851547122, -0.1259377121925354, 0.09601370846697439, -0.09770155052319751, -0.15654538484911124, 0.4220611041566978, 0.0621102170397838, 0.2795939489888648, 0.030565829152086128, 0.3182711409715315, 0.14973090801698466, 0.06708991683844942, 0.09354702295580258, 0.3143694198690355, 0.2231745562244517, 0.12100031308364123, -0.3199102086480707, 0.07820690209822108, 0.09038365654026469] |
1,803.03659 | Listing Maximal Subgraphs in Strongly Accessible Set Systems | Algorithms for listing the subgraphs satisfying a given property (e.g.,being
a clique, a cut, a cycle, etc.) fall within the general framework of set
systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and
an indicator F, subset of 2^U, of which subsets of U have the required
property. For the problem of listing all sets in F maximal under inclusion, the
ambitious goal is to cover a large class of set systems, preserving at the same
time the efficiency of the enumeration. Among the existing algorithms, the
best-known ones list the maximal subsets in time proportional to their number
but may require exponential space. In this paper we improve the state of the
art in two directions by introducing an algorithmic framework that, under
standard suitable conditions, simultaneously (i) extends the class of problems
that can be solved efficiently to strongly accessible set systems, and (ii)
reduces the additional space usage from exponential in |U| to stateless, thus
accounting for just O(q) space, where q <= |U| is the largest size of a maximal
set in F
| cs.DM | algorithms for listing the subgraphs satisfying a given property egbeing a clique a cut a cycle etc fall within the general framework of set systems a set system u f uses a ground set u eg the network nodes and an indicator f subset of 2u of which subsets of u have the required property for the problem of listing all sets in f maximal under inclusion the ambitious goal is to cover a large class of set systems preserving at the same time the efficiency of the enumeration among the existing algorithms the bestknown ones list the maximal subsets in time proportional to their number but may require exponential space in this paper we improve the state of the art in two directions by introducing an algorithmic framework that under standard suitable conditions simultaneously i extends the class of problems that can be solved efficiently to strongly accessible set systems and ii reduces the additional space usage from exponential in u to stateless thus accounting for just oq space where q u is the largest size of a maximal set in f | [['algorithms', 'for', 'listing', 'the', 'subgraphs', 'satisfying', 'a', 'given', 'property', 'egbeing', 'a', 'clique', 'a', 'cut', 'a', 'cycle', 'etc', 'fall', 'within', 'the', 'general', 'framework', 'of', 'set', 'systems', 'a', 'set', 'system', 'u', 'f', 'uses', 'a', 'ground', 'set', 'u', 'eg', 'the', 'network', 'nodes', 'and', 'an', 'indicator', 'f', 'subset', 'of', '2u', 'of', 'which', 'subsets', 'of', 'u', 'have', 'the', 'required', 'property', 'for', 'the', 'problem', 'of', 'listing', 'all', 'sets', 'in', 'f', 'maximal', 'under', 'inclusion', 'the', 'ambitious', 'goal', 'is', 'to', 'cover', 'a', 'large', 'class', 'of', 'set', 'systems', 'preserving', 'at', 'the', 'same', 'time', 'the', 'efficiency', 'of', 'the', 'enumeration', 'among', 'the', 'existing', 'algorithms', 'the', 'bestknown', 'ones', 'list', 'the', 'maximal', 'subsets', 'in', 'time', 'proportional', 'to', 'their', 'number', 'but', 'may', 'require', 'exponential', 'space', 'in', 'this', 'paper', 'we', 'improve', 'the', 'state', 'of', 'the', 'art', 'in', 'two', 'directions', 'by', 'introducing', 'an', 'algorithmic', 'framework', 'that', 'under', 'standard', 'suitable', 'conditions', 'simultaneously', 'i', 'extends', 'the', 'class', 'of', 'problems', 'that', 'can', 'be', 'solved', 'efficiently', 'to', 'strongly', 'accessible', 'set', 'systems', 'and', 'ii', 'reduces', 'the', 'additional', 'space', 'usage', 'from', 'exponential', 'in', 'u', 'to', 'stateless', 'thus', 'accounting', 'for', 'just', 'oq', 'space', 'where', 'q', 'u', 'is', 'the', 'largest', 'size', 'of', 'a', 'maximal', 'set', 'in', 'f']] | [-0.16030564950651152, 0.06478776206703125, -0.0020738778415821738, 0.025822430158898766, -0.061317033921163736, -0.11479501730179066, 0.10562975366233981, 0.32752138560453614, -0.3137812750045579, -0.30818536003877584, 0.09661647374805697, -0.27129970380401874, -0.06433507158794532, 0.19840525549447552, -0.07208689703007362, 0.06530273971021505, 0.07198465210743822, 0.06302894398462601, -0.05083270064826318, -0.2836226827546872, 0.3260883755206673, -0.02750540940618081, 0.23944275866641285, 0.012302480520972225, 0.08115271621660053, 0.002551256247877993, -0.012280988719334805, 0.07168673883351513, -0.11348192289813516, 0.12662045751982318, 0.24054812935211664, 0.21187434586757734, 0.31850257864897397, -0.37424096432360976, -0.1737959298732496, 0.20765099315750565, 0.1251904562605477, 0.0604579735484619, 0.0310746557028084, -0.2451479125084806, 0.11154229961499408, -0.14054659488841195, -0.1227574753933228, -0.042917877284728075, 0.07434468854802077, 0.026876215144971405, -0.3085879132581445, -0.008944640310921266, 0.08158265302088213, 0.018029711293670665, -0.02842264579593685, -0.13955308030395266, 0.00842645526914806, 0.11554154159583069, -0.0180519018961874, 0.08056832955904551, 0.06766721907399267, -0.12546264873126747, -0.07990920504012687, 0.4094210541551257, -0.03949099839127694, -0.20369426380320974, 0.1613042413047259, -0.1260921606579079, -0.14667517855599688, 0.13914939596005563, 0.15287803109110956, 0.12753970191460923, -0.14596493097513422, 0.1710744477651123, -0.08080653439385939, 0.13673084574638977, 0.052353981494709115, 0.06977506541643179, 0.1397774550356329, 0.1575741737026844, 0.16135758909545225, 0.13990564034435551, -0.012359399641454629, -0.03841022850438994, -0.3417625305406585, -0.11566176396221496, -0.1740035462918548, 0.008860914561140177, -0.09548590516215472, -0.17293319132647242, 0.415395283674985, 0.11622001941042062, 0.1922560872082793, 0.07649307160645949, 0.22694104792713954, 0.06920449766455151, 0.07401049938782088, 0.13516231806995796, 0.12439981760242237, 0.06290619062377488, 0.04130531982058189, -0.2036331298359373, 0.08252792722023614, 0.10780653318311574] |
1,803.0366 | A note on Perelman's no shrinking breather theorem | As an application of his entropy formula, Perelman proved that every compact
shrinking breather is a shrinking gradient Ricci soliton. We give a proof for
the complete noncompact case by using Perelman's $\mathcal{L}$-geometry. Our
proof follows the argument in Lu and Zheng of constructing an ancient solution,
and removes a technical assumption made by them.
| math.DG | as an application of his entropy formula perelman proved that every compact shrinking breather is a shrinking gradient ricci soliton we give a proof for the complete noncompact case by using perelmans mathcallgeometry our proof follows the argument in lu and zheng of constructing an ancient solution and removes a technical assumption made by them | [['as', 'an', 'application', 'of', 'his', 'entropy', 'formula', 'perelman', 'proved', 'that', 'every', 'compact', 'shrinking', 'breather', 'is', 'a', 'shrinking', 'gradient', 'ricci', 'soliton', 'we', 'give', 'a', 'proof', 'for', 'the', 'complete', 'noncompact', 'case', 'by', 'using', 'perelmans', 'mathcallgeometry', 'our', 'proof', 'follows', 'the', 'argument', 'in', 'lu', 'and', 'zheng', 'of', 'constructing', 'an', 'ancient', 'solution', 'and', 'removes', 'a', 'technical', 'assumption', 'made', 'by', 'them']] | [-0.1601686121861416, 0.011471664468882847, -0.189655554705058, 0.07261730650767546, -0.13427569468816122, -0.15256453020049743, 0.014794401203592619, 0.28955540992319584, -0.1903312567759443, -0.192836525246363, 0.18773433940993897, -0.2814759678655752, -0.14460950124905342, 0.21767555649771733, -0.17034102383035202, -0.03119108467190354, 0.07598259109848489, 0.021539360103714798, -0.03413354995104277, -0.2907286812033918, 0.36783722538018115, -0.016437320797531692, 0.24147782602381926, 0.1379108635958767, 0.1417136036583947, 0.01980859672443734, -0.054782258691611116, -0.025403068745853723, -0.19576332819525744, 0.1160641747733785, 0.21412120836666199, 0.15128813466678062, 0.31162344943732023, -0.38684443122851747, -0.2062999979265172, 0.10455507704022306, 0.13372688154965914, 0.14905907836294285, -0.1504773187916726, -0.31278858426527156, 0.09339191339461615, -0.13368882992546316, -0.27258863847560455, -0.09173258496620865, 0.06433464624677543, -0.003142120195897641, -0.19362801944630015, 0.05770666404040875, 0.23081535363086947, 0.017012820147943718, -0.07408453911732606, -0.08938818316285808, -0.05266217944746906, -0.0007088870689686802, 0.06234633865231579, 0.07894727735159297, 0.07221342542066446, -0.004599163515700234, -0.097004548292952, 0.26123001529938644, -0.14560926460695486, -0.20219212373787607, 0.07558879174326581, 0.015977791062107793, -0.1304408596436217, 0.07642142033997786, 0.03341429421992938, 0.19340001358823092, -0.09945943788194132, 0.09491881818501968, -0.07779200226327197, 0.11056857794109318, 0.18863465226496812, -0.06767376496767004, 0.11495632432073492, 0.12984418223991437, 0.16966103565775686, 0.16471397616314115, 0.06854417760957775, -0.07644472355712895, -0.36848226337935086, -0.2306377927393273, -0.23451016563922167, 0.19423808357505887, -0.15002283506489927, -0.17003154551127442, 0.32521656386692216, -0.015044498912714145, 0.17093944751347104, 0.12454105191001738, 0.26266141256524456, 0.09123241737985087, -0.008436986890349848, 0.14840549096913525, 0.18999482346353708, 0.2203022663490157, 0.13649469344980186, -0.09520346112549305, 0.0024386349875755884, 0.24770632344815466] |
1,803.03661 | Competition between delta isobars and hyperons and properties of compact
stars | The $\Delta$-isobar degrees of freedom are included in the covariant
density functional (CDF) theory to study the equation of state (EoS)
and composition of dense matter in compact stars. In addition to
$\Delta$'s we include the full octet of baryons, which allows us to
study the interplay between the onset of delta isobars and hyperonic
degrees of freedom. Using both the Hartree and Hartree-Fock
approximation we find that $\Delta$'s appear already at densities
slightly above the saturation density of nuclear matter for a wide
range of the meson-$\Delta$ coupling constants. This delays the
appearance of hyperons and significantly affects the gross
properties of compact stars. Specifically, $\Delta$'s soften the
EoS at low densities but stiffen it at high densities. This
softening reduces the radius of a canonical $1.4 M_\odot$ star by up
to 2~km for a reasonably attractive $\Delta$ potential in matter,
while the stiffening results in larger maximum masses of compact
stars. We conclude that the hypernuclear CDF parametrizations that
satisfy the 2$M_\odot$ maximum mass constraint remain valid when
$\Delta$ isobars are included, with the important consequence that
the resulting stellar radii are shifted toward lower values, which
is in agreement with the analysis of neutron star radii.
| nucl-th astro-ph.HE astro-ph.SR | the deltaisobar degrees of freedom are included in the covariant density functional cdf theory to study the equation of state eos and composition of dense matter in compact stars in addition to deltas we include the full octet of baryons which allows us to study the interplay between the onset of delta isobars and hyperonic degrees of freedom using both the hartree and hartreefock approximation we find that deltas appear already at densities slightly above the saturation density of nuclear matter for a wide range of the mesondelta coupling constants this delays the appearance of hyperons and significantly affects the gross properties of compact stars specifically deltas soften the eos at low densities but stiffen it at high densities this softening reduces the radius of a canonical 14 m_odot star by up to 2km for a reasonably attractive delta potential in matter while the stiffening results in larger maximum masses of compact stars we conclude that the hypernuclear cdf parametrizations that satisfy the 2m_odot maximum mass constraint remain valid when delta isobars are included with the important consequence that the resulting stellar radii are shifted toward lower values which is in agreement with the analysis of neutron star radii | [['the', 'deltaisobar', 'degrees', 'of', 'freedom', 'are', 'included', 'in', 'the', 'covariant', 'density', 'functional', 'cdf', 'theory', 'to', 'study', 'the', 'equation', 'of', 'state', 'eos', 'and', 'composition', 'of', 'dense', 'matter', 'in', 'compact', 'stars', 'in', 'addition', 'to', 'deltas', 'we', 'include', 'the', 'full', 'octet', 'of', 'baryons', 'which', 'allows', 'us', 'to', 'study', 'the', 'interplay', 'between', 'the', 'onset', 'of', 'delta', 'isobars', 'and', 'hyperonic', 'degrees', 'of', 'freedom', 'using', 'both', 'the', 'hartree', 'and', 'hartreefock', 'approximation', 'we', 'find', 'that', 'deltas', 'appear', 'already', 'at', 'densities', 'slightly', 'above', 'the', 'saturation', 'density', 'of', 'nuclear', 'matter', 'for', 'a', 'wide', 'range', 'of', 'the', 'mesondelta', 'coupling', 'constants', 'this', 'delays', 'the', 'appearance', 'of', 'hyperons', 'and', 'significantly', 'affects', 'the', 'gross', 'properties', 'of', 'compact', 'stars', 'specifically', 'deltas', 'soften', 'the', 'eos', 'at', 'low', 'densities', 'but', 'stiffen', 'it', 'at', 'high', 'densities', 'this', 'softening', 'reduces', 'the', 'radius', 'of', 'a', 'canonical', '14', 'm_odot', 'star', 'by', 'up', 'to', '2km', 'for', 'a', 'reasonably', 'attractive', 'delta', 'potential', 'in', 'matter', 'while', 'the', 'stiffening', 'results', 'in', 'larger', 'maximum', 'masses', 'of', 'compact', 'stars', 'we', 'conclude', 'that', 'the', 'hypernuclear', 'cdf', 'parametrizations', 'that', 'satisfy', 'the', '2m_odot', 'maximum', 'mass', 'constraint', 'remain', 'valid', 'when', 'delta', 'isobars', 'are', 'included', 'with', 'the', 'important', 'consequence', 'that', 'the', 'resulting', 'stellar', 'radii', 'are', 'shifted', 'toward', 'lower', 'values', 'which', 'is', 'in', 'agreement', 'with', 'the', 'analysis', 'of', 'neutron', 'star', 'radii']] | [-0.09379611667504327, 0.20836565835634246, -0.07330487630343265, 0.09195310240223382, -0.07568581214743769, -0.05245994185944172, 0.06339344088484374, 0.32412198096551376, -0.1817219444089616, -0.3395005106088715, -0.007464824137371974, -0.3074826984678782, -0.009229464508179162, 0.11682068549726873, 0.03780850506331207, 0.004564448322755675, 0.05025109601080079, 0.04904748825591547, -0.14243618817764778, -0.20406519256431063, 0.3405200983891546, 0.01607968882572922, 0.1779454618932284, 0.09463191778408457, 0.0392312808772208, -0.041280481430485544, 0.03236825524998659, -0.0066100947836395165, -0.18676721143863761, 0.058918186886744064, 0.2369155873182333, 0.07281930682720807, 0.19811918459494005, -0.38251579668598645, -0.21583405710789705, 0.08960821048939845, 0.12526457234770247, 0.09211169569659038, -0.03540565185745675, -0.2484144733047508, 0.08737200581475403, -0.2167913857729861, -0.20863018483346837, -0.07968142299414283, 0.049307351137012845, 0.06450185377704629, -0.25875111480215285, 0.18487301983134444, 0.017834757183057565, -0.0123464077983917, -0.09930034989292376, -0.22684397368757714, -0.058060564516427354, 0.028999245174804168, 0.0442382911728187, 0.0663148774148078, 0.12186079241119024, -0.2016562153279518, 0.039185204691926226, 0.3994999257283229, -0.06430840572916122, -0.11602769520679357, 0.1603220094834934, -0.19988283243693525, -0.15782680191014978, 0.15420604392067727, 0.1510789503306362, 0.1274251594676194, -0.14514182315178914, 0.06616310857020606, 0.015147336069000603, 0.1969956019846252, 0.09912277591377121, 0.06421563654371173, 0.22652144123702497, 0.1454656466423073, 0.05614513156211211, 0.0479973517158398, -0.10195368121384665, -0.11673941330589128, -0.3201250726465286, -0.0702054128991534, -0.12872650823203113, 0.023471073784296297, -0.13468982214948888, -0.1011540594444883, 0.34708580430220776, 0.08904657423063511, 0.1953414204892599, 0.03536229658015825, 0.2494742266782042, 0.12640808992478245, 0.0758842759544613, 0.1134598011461397, 0.2927129737600082, 0.24468994781379635, 0.08594443497890042, -0.29822470936007006, 0.006669380848185451, -0.006675735459371348] |
1,803.03662 | Hate Speech Detection: A Solved Problem? The Challenging Case of Long
Tail on Twitter | In recent years, the increasing propagation of hate speech on social media
and the urgent need for effective counter-measures have drawn significant
investment from governments, companies, and researchers. A large number of
methods have been developed for automated hate speech detection online. This
aims to classify textual content into non-hate or hate speech, in which case
the method may also identify the targeting characteristics (i.e., types of
hate, such as race, and religion) in the hate speech. However, we notice
significant difference between the performance of the two (i.e., non-hate v.s.
hate). In this work, we argue for a focus on the latter problem for practical
reasons. We show that it is a much more challenging task, as our analysis of
the language in the typical datasets shows that hate speech lacks unique,
discriminative features and therefore is found in the 'long tail' in a dataset
that is difficult to discover. We then propose Deep Neural Network structures
serving as feature extractors that are particularly effective for capturing the
semantics of hate speech. Our methods are evaluated on the largest collection
of hate speech datasets based on Twitter, and are shown to be able to
outperform the best performing method by up to 5 percentage points in
macro-average F1, or 8 percentage points in the more challenging case of
identifying hateful content.
| cs.CL | in recent years the increasing propagation of hate speech on social media and the urgent need for effective countermeasures have drawn significant investment from governments companies and researchers a large number of methods have been developed for automated hate speech detection online this aims to classify textual content into nonhate or hate speech in which case the method may also identify the targeting characteristics ie types of hate such as race and religion in the hate speech however we notice significant difference between the performance of the two ie nonhate vs hate in this work we argue for a focus on the latter problem for practical reasons we show that it is a much more challenging task as our analysis of the language in the typical datasets shows that hate speech lacks unique discriminative features and therefore is found in the long tail in a dataset that is difficult to discover we then propose deep neural network structures serving as feature extractors that are particularly effective for capturing the semantics of hate speech our methods are evaluated on the largest collection of hate speech datasets based on twitter and are shown to be able to outperform the best performing method by up to 5 percentage points in macroaverage f1 or 8 percentage points in the more challenging case of identifying hateful content | [['in', 'recent', 'years', 'the', 'increasing', 'propagation', 'of', 'hate', 'speech', 'on', 'social', 'media', 'and', 'the', 'urgent', 'need', 'for', 'effective', 'countermeasures', 'have', 'drawn', 'significant', 'investment', 'from', 'governments', 'companies', 'and', 'researchers', 'a', 'large', 'number', 'of', 'methods', 'have', 'been', 'developed', 'for', 'automated', 'hate', 'speech', 'detection', 'online', 'this', 'aims', 'to', 'classify', 'textual', 'content', 'into', 'nonhate', 'or', 'hate', 'speech', 'in', 'which', 'case', 'the', 'method', 'may', 'also', 'identify', 'the', 'targeting', 'characteristics', 'ie', 'types', 'of', 'hate', 'such', 'as', 'race', 'and', 'religion', 'in', 'the', 'hate', 'speech', 'however', 'we', 'notice', 'significant', 'difference', 'between', 'the', 'performance', 'of', 'the', 'two', 'ie', 'nonhate', 'vs', 'hate', 'in', 'this', 'work', 'we', 'argue', 'for', 'a', 'focus', 'on', 'the', 'latter', 'problem', 'for', 'practical', 'reasons', 'we', 'show', 'that', 'it', 'is', 'a', 'much', 'more', 'challenging', 'task', 'as', 'our', 'analysis', 'of', 'the', 'language', 'in', 'the', 'typical', 'datasets', 'shows', 'that', 'hate', 'speech', 'lacks', 'unique', 'discriminative', 'features', 'and', 'therefore', 'is', 'found', 'in', 'the', 'long', 'tail', 'in', 'a', 'dataset', 'that', 'is', 'difficult', 'to', 'discover', 'we', 'then', 'propose', 'deep', 'neural', 'network', 'structures', 'serving', 'as', 'feature', 'extractors', 'that', 'are', 'particularly', 'effective', 'for', 'capturing', 'the', 'semantics', 'of', 'hate', 'speech', 'our', 'methods', 'are', 'evaluated', 'on', 'the', 'largest', 'collection', 'of', 'hate', 'speech', 'datasets', 'based', 'on', 'twitter', 'and', 'are', 'shown', 'to', 'be', 'able', 'to', 'outperform', 'the', 'best', 'performing', 'method', 'by', 'up', 'to', '5', 'percentage', 'points', 'in', 'macroaverage', 'f1', 'or', '8', 'percentage', 'points', 'in', 'the', 'more', 'challenging', 'case', 'of', 'identifying', 'hateful', 'content']] | [-0.0739789130742958, 0.017564603408324976, -0.05916805706219748, 0.09799023643400605, -0.11701898996464231, -0.15478504632853649, 0.04231898559850048, 0.43319817583330655, -0.21259709497733803, -0.3231451411210318, 0.08592632253236264, -0.35998675974974914, -0.20323128852972083, 0.22760857730199033, -0.12675006272567604, 0.03516105360077662, 0.07758488626568578, 0.08700220669958401, -0.006421261828985404, -0.2908449643884193, 0.30707303893710064, -0.0013919220995210874, 0.35771007082340395, 0.07990449738572351, 0.05194319292674084, -0.05761058066802269, -0.07867987339003858, -0.03897986462477341, -0.019194055066724437, 0.14389194874357517, 0.36548905429663137, 0.21872489736309614, 0.33440458022947, -0.3696694481747479, -0.2016705676384101, 0.13441816026514228, 0.16507107726700435, 0.11675433951326837, -0.05103762679672483, -0.3605655184819956, 0.10564277453813702, -0.17907280622431163, 0.015619787688113071, -0.10408442264729688, 0.06416090225160256, -0.0303576231910318, -0.21796969556493093, 0.06562038866911528, 0.0821435308094475, 0.12279853250577369, -0.01690802587810057, -0.1358152576933869, 0.014953642560761761, 0.2015289405561899, 0.13449143311537973, 0.013492984974502839, 0.10089474964505908, -0.22577918054858773, -0.10882214918224649, 0.4097709714096378, -0.07051079999020493, -0.18668285307834265, 0.22367449972238815, -0.027477170976106375, -0.16688354233693561, 0.08174848281778395, 0.2620334178378636, 0.112831794533188, -0.17179606944079173, -0.029991072321321224, -0.02559542218858207, 0.21565012654755264, 0.07030301587021148, 0.0012138501878573814, 0.1942679298501885, 0.2318438110111112, 0.0430496665098789, 0.12986643200856635, -0.09143608135531064, -0.014668586871332743, -0.17267411906187508, -0.13057697973192922, -0.1425144606592684, -0.00800472081808204, -0.06407308801340564, -0.1472072726627547, 0.3908631162940186, 0.23608914775064807, 0.16794986190930516, 0.048446460843446074, 0.3055150683662346, 0.00782058634319004, 0.10248789739456367, 0.09022583752124444, 0.20130659572526136, -0.03803019444722767, 0.1481278631391681, -0.1574349089054687, 0.11485512540516951, -0.0007651204497299411] |
1,803.03663 | Disconnected Cuts in Claw-free Graphs | A disconnected cut of a connected graph is a vertex cut that itself also
induces a disconnected subgraph. The decision problem whether a graph has a
disconnected cut is called Disconnected Cut. This problem is closely related to
several homomorphism and contraction problems, and fits in an extensive line of
research on vertex cuts with additional properties. It is known that
Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms
are known for several graph classes. However, the complexity of the problem on
claw-free graphs remained an open question. Its connection to the complexity of
the problem to contract a claw-free graph to the 4-vertex cycle $C_4$ led Ito
et al. (TCS 2011) to explicitly ask to resolve this open question.
We prove that Disconnected Cut is polynomial-time solvable on claw-free
graphs, answering the question of Ito et al. The centerpiece of our result is a
novel decomposition theorem for claw-free graphs of diameter 2, which we
believe is of independent interest and expands the research line initiated by
Chudnovsky and Seymour (JCTB 2007-2012) and Hermelin et al. (ICALP 2011). On
our way to exploit this decomposition theorem, we characterize how disconnected
cuts interact with certain cobipartite subgraphs, and prove two further novel
algorithmic results, namely Disconnected Cut is polynomial-time solvable on
circular-arc graphs and line graphs.
| cs.DS cs.CC cs.DM math.CO | a disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph the decision problem whether a graph has a disconnected cut is called disconnected cut this problem is closely related to several homomorphism and contraction problems and fits in an extensive line of research on vertex cuts with additional properties it is known that disconnected cut is nphard on general graphs while polynomialtime algorithms are known for several graph classes however the complexity of the problem on clawfree graphs remained an open question its connection to the complexity of the problem to contract a clawfree graph to the 4vertex cycle c_4 led ito et al tcs 2011 to explicitly ask to resolve this open question we prove that disconnected cut is polynomialtime solvable on clawfree graphs answering the question of ito et al the centerpiece of our result is a novel decomposition theorem for clawfree graphs of diameter 2 which we believe is of independent interest and expands the research line initiated by chudnovsky and seymour jctb 20072012 and hermelin et al icalp 2011 on our way to exploit this decomposition theorem we characterize how disconnected cuts interact with certain cobipartite subgraphs and prove two further novel algorithmic results namely disconnected cut is polynomialtime solvable on circulararc graphs and line graphs | [['a', 'disconnected', 'cut', 'of', 'a', 'connected', 'graph', 'is', 'a', 'vertex', 'cut', 'that', 'itself', 'also', 'induces', 'a', 'disconnected', 'subgraph', 'the', 'decision', 'problem', 'whether', 'a', 'graph', 'has', 'a', 'disconnected', 'cut', 'is', 'called', 'disconnected', 'cut', 'this', 'problem', 'is', 'closely', 'related', 'to', 'several', 'homomorphism', 'and', 'contraction', 'problems', 'and', 'fits', 'in', 'an', 'extensive', 'line', 'of', 'research', 'on', 'vertex', 'cuts', 'with', 'additional', 'properties', 'it', 'is', 'known', 'that', 'disconnected', 'cut', 'is', 'nphard', 'on', 'general', 'graphs', 'while', 'polynomialtime', 'algorithms', 'are', 'known', 'for', 'several', 'graph', 'classes', 'however', 'the', 'complexity', 'of', 'the', 'problem', 'on', 'clawfree', 'graphs', 'remained', 'an', 'open', 'question', 'its', 'connection', 'to', 'the', 'complexity', 'of', 'the', 'problem', 'to', 'contract', 'a', 'clawfree', 'graph', 'to', 'the', '4vertex', 'cycle', 'c_4', 'led', 'ito', 'et', 'al', 'tcs', '2011', 'to', 'explicitly', 'ask', 'to', 'resolve', 'this', 'open', 'question', 'we', 'prove', 'that', 'disconnected', 'cut', 'is', 'polynomialtime', 'solvable', 'on', 'clawfree', 'graphs', 'answering', 'the', 'question', 'of', 'ito', 'et', 'al', 'the', 'centerpiece', 'of', 'our', 'result', 'is', 'a', 'novel', 'decomposition', 'theorem', 'for', 'clawfree', 'graphs', 'of', 'diameter', '2', 'which', 'we', 'believe', 'is', 'of', 'independent', 'interest', 'and', 'expands', 'the', 'research', 'line', 'initiated', 'by', 'chudnovsky', 'and', 'seymour', 'jctb', '20072012', 'and', 'hermelin', 'et', 'al', 'icalp', '2011', 'on', 'our', 'way', 'to', 'exploit', 'this', 'decomposition', 'theorem', 'we', 'characterize', 'how', 'disconnected', 'cuts', 'interact', 'with', 'certain', 'cobipartite', 'subgraphs', 'and', 'prove', 'two', 'further', 'novel', 'algorithmic', 'results', 'namely', 'disconnected', 'cut', 'is', 'polynomialtime', 'solvable', 'on', 'circulararc', 'graphs', 'and', 'line', 'graphs']] | [-0.13745903516606933, 0.07935286763056348, -0.0587291227297301, 0.0633398247295307, -0.19692810281786485, -0.1470989751829253, 0.1123001093670743, 0.4189869282562115, -0.29571071853263114, -0.3167276262655991, 0.10786565884022863, -0.29592499921286325, -0.17533738568741317, 0.14255050917523443, -0.1618107767389028, 0.026100161598318197, 0.1278856872909899, -0.00319997193192323, 0.04189774338070543, -0.311667778993286, 0.3071134688221602, -0.012292003906289236, 0.22013307230893112, 0.17925450343151636, 0.05893867600435784, 0.01925280407432108, -0.04110212413457419, 0.10591976044575659, -0.1841704933214898, 0.08900801112198212, 0.29084555382002997, 0.19639306680702923, 0.2348347705011384, -0.3639973154240245, -0.15414646887348607, 0.1695388894407463, 0.10319086936635709, 0.05877471000966488, 0.01498549894980847, -0.2298962280491726, 0.0783088313812954, -0.09776511942164613, -0.09752692223404782, -0.008026930635982971, 0.09750693965139329, -0.08742717753774315, -0.22313349352030237, -0.02622090220793659, 0.17453911468608801, -0.011824439101807886, 0.05906037536637704, -0.12839261170662514, 0.011531397439710317, 0.08441150178192952, -0.0795280281533092, 0.09732736322688101, 0.03822088021776476, -0.08008961527023055, -0.2320666808686796, 0.3197393327456933, 0.060014858927338495, -0.11403172020800412, 0.13789168116422967, -0.0450598799309548, -0.26218489053180666, 0.12333794857734182, 0.13806454170470708, 0.16639777611718948, -0.12817864870191167, 0.17344977674549744, -0.1520115294148761, 0.09923393378534072, 0.14919372821662472, -0.07712273080827917, 0.09891151449346162, 0.14956347836467754, 0.16878261814885046, 0.20906572040798432, 0.07087928795259993, -0.048410373684093615, -0.23366039523581436, -0.07606813815486972, -0.20160827819800534, 0.060773753902849253, -0.1276153618726295, -0.24387213792181958, 0.4264334328643499, 0.09522423928671885, 0.17576244922457349, 0.08496144589799277, 0.247854577954175, 0.03970707302438864, 0.020284031251330065, 0.21082749678069776, 0.16108671973198824, 0.20847934180413535, 0.0019222249697740063, -0.17759972689416978, 0.06005709708044562, 0.1464915863054574] |
1,803.03664 | Automating Reading Comprehension by Generating Question and Answer Pairs | Neural network-based methods represent the state-of-the-art in question
generation from text. Existing work focuses on generating only questions from
text without concerning itself with answer generation. Moreover, our analysis
shows that handling rare words and generating the most appropriate question
given a candidate answer are still challenges facing existing approaches. We
present a novel two-stage process to generate question-answer pairs from the
text. For the first stage, we present alternatives for encoding the span of the
pivotal answer in the sentence using Pointer Networks. In our second stage, we
employ sequence to sequence models for question generation, enhanced with rich
linguistic features. Finally, global attention and answer encoding are used for
generating the question most relevant to the answer. We motivate and
linguistically analyze the role of each component in our framework and consider
compositions of these. This analysis is supported by extensive experimental
evaluations. Using standard evaluation metrics as well as human evaluations,
our experimental results validate the significant improvement in the quality of
questions generated by our framework over the state-of-the-art. The technique
presented here represents another step towards more automated reading
comprehension assessment. We also present a live system \footnote{Demo of the
system is available at
\url{https://www.cse.iitb.ac.in/~vishwajeet/autoqg.html}.} to demonstrate the
effectiveness of our approach.
| cs.CL cs.AI | neural networkbased methods represent the stateoftheart in question generation from text existing work focuses on generating only questions from text without concerning itself with answer generation moreover our analysis shows that handling rare words and generating the most appropriate question given a candidate answer are still challenges facing existing approaches we present a novel twostage process to generate questionanswer pairs from the text for the first stage we present alternatives for encoding the span of the pivotal answer in the sentence using pointer networks in our second stage we employ sequence to sequence models for question generation enhanced with rich linguistic features finally global attention and answer encoding are used for generating the question most relevant to the answer we motivate and linguistically analyze the role of each component in our framework and consider compositions of these this analysis is supported by extensive experimental evaluations using standard evaluation metrics as well as human evaluations our experimental results validate the significant improvement in the quality of questions generated by our framework over the stateoftheart the technique presented here represents another step towards more automated reading comprehension assessment we also present a live system footnotedemo of the system is available at urlhttpswwwcseiitbacinvishwajeetautoqghtml to demonstrate the effectiveness of our approach | [['neural', 'networkbased', 'methods', 'represent', 'the', 'stateoftheart', 'in', 'question', 'generation', 'from', 'text', 'existing', 'work', 'focuses', 'on', 'generating', 'only', 'questions', 'from', 'text', 'without', 'concerning', 'itself', 'with', 'answer', 'generation', 'moreover', 'our', 'analysis', 'shows', 'that', 'handling', 'rare', 'words', 'and', 'generating', 'the', 'most', 'appropriate', 'question', 'given', 'a', 'candidate', 'answer', 'are', 'still', 'challenges', 'facing', 'existing', 'approaches', 'we', 'present', 'a', 'novel', 'twostage', 'process', 'to', 'generate', 'questionanswer', 'pairs', 'from', 'the', 'text', 'for', 'the', 'first', 'stage', 'we', 'present', 'alternatives', 'for', 'encoding', 'the', 'span', 'of', 'the', 'pivotal', 'answer', 'in', 'the', 'sentence', 'using', 'pointer', 'networks', 'in', 'our', 'second', 'stage', 'we', 'employ', 'sequence', 'to', 'sequence', 'models', 'for', 'question', 'generation', 'enhanced', 'with', 'rich', 'linguistic', 'features', 'finally', 'global', 'attention', 'and', 'answer', 'encoding', 'are', 'used', 'for', 'generating', 'the', 'question', 'most', 'relevant', 'to', 'the', 'answer', 'we', 'motivate', 'and', 'linguistically', 'analyze', 'the', 'role', 'of', 'each', 'component', 'in', 'our', 'framework', 'and', 'consider', 'compositions', 'of', 'these', 'this', 'analysis', 'is', 'supported', 'by', 'extensive', 'experimental', 'evaluations', 'using', 'standard', 'evaluation', 'metrics', 'as', 'well', 'as', 'human', 'evaluations', 'our', 'experimental', 'results', 'validate', 'the', 'significant', 'improvement', 'in', 'the', 'quality', 'of', 'questions', 'generated', 'by', 'our', 'framework', 'over', 'the', 'stateoftheart', 'the', 'technique', 'presented', 'here', 'represents', 'another', 'step', 'towards', 'more', 'automated', 'reading', 'comprehension', 'assessment', 'we', 'also', 'present', 'a', 'live', 'system', 'footnotedemo', 'of', 'the', 'system', 'is', 'available', 'at', 'urlhttpswwwcseiitbacinvishwajeetautoqghtml', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach']] | [-0.046383427834797014, -0.0025583309041926775, -0.03196754671360661, 0.06729091672747993, -0.09306936740829813, -0.11641167414306504, 0.06481264884947095, 0.4006383297419766, -0.24484324396542478, -0.32444971104992965, 0.07609497071300611, -0.2914434131051743, -0.18754268259650506, 0.24910966002569737, -0.0806373546998568, 0.057144936128723914, 0.1426528676878661, 0.034188366136740804, -0.017945315909753668, -0.2920577888172574, 0.35347838880941085, 0.04448289776720652, 0.3080222292803228, 0.047573753691664555, 0.09515919155872814, -0.03288255927902533, -0.10926308101497409, -0.02936685375326949, -0.08829386720974026, 0.19752657825678088, 0.31513997902492097, 0.2352071418926665, 0.32065417329530893, -0.39733615072171496, -0.20297496730416287, 0.04303427978486913, 0.1365081672284116, 0.13687552913523665, -0.09558108066891535, -0.30670010022387456, 0.12946823740025937, -0.14585013106442624, -0.02731165443660646, -0.1422343930638418, -0.011514978251624399, -0.02319230374158928, -0.2714355454087348, 0.028792956892667882, 0.11327555749803872, 0.06898225219380792, -0.04922139594649396, -0.11839807967132912, 0.07063822321616477, 0.18945802803912268, 0.05089636748876595, 0.07186119060767474, 0.10026794653414271, -0.16253223975541115, -0.18326217922404772, 0.38672697484129814, -0.07502329451934911, -0.19795198415565055, 0.18964449632912875, -0.05840599880349345, -0.17510145968280552, 0.05287157343473376, 0.18819786348811737, 0.1446764827285689, -0.13096825642193236, 0.004396565129878227, -0.06260527582929992, 0.20564992699272386, 0.055775064943222014, 0.004506486477103175, 0.2205296409702519, 0.26908605847416855, -0.009496364672100398, 0.16129417785261643, -0.05216132118167901, -0.07416514123721821, -0.2747029780887249, -0.14087697566009877, -0.1430040264740677, -0.00490688543125033, -0.03068278491292603, -0.1304245019286144, 0.42535096865329075, 0.2802209386829196, 0.21231686188498647, 0.07494249083328901, 0.3327915439791069, 0.043583956035989815, 0.04203716001655089, 0.03709533031711854, 0.14052799173471767, 0.008037739540109548, 0.1116217707028249, -0.16400536205520194, 0.09592178293912694, 0.06915983392018683] |
1,803.03665 | Syntax-Aware Language Modeling with Recurrent Neural Networks | Neural language models (LMs) are typically trained using only lexical
features, such as surface forms of words. In this paper, we argue this deprives
the LM of crucial syntactic signals that can be detected at high confidence
using existing parsers. We present a simple but highly effective approach for
training neural LMs using both lexical and syntactic information, and a novel
approach for applying such LMs to unparsed text using sequential Monte Carlo
sampling. In experiments on a range of corpora and corpus sizes, we show our
approach consistently outperforms standard lexical LMs in character-level
language modeling; on the other hand, for word-level models the models are on a
par with standard language models. These results indicate potential for
expanding LMs beyond lexical surface features to higher-level NLP features for
character-level models.
| cs.CL cs.LG | neural language models lms are typically trained using only lexical features such as surface forms of words in this paper we argue this deprives the lm of crucial syntactic signals that can be detected at high confidence using existing parsers we present a simple but highly effective approach for training neural lms using both lexical and syntactic information and a novel approach for applying such lms to unparsed text using sequential monte carlo sampling in experiments on a range of corpora and corpus sizes we show our approach consistently outperforms standard lexical lms in characterlevel language modeling on the other hand for wordlevel models the models are on a par with standard language models these results indicate potential for expanding lms beyond lexical surface features to higherlevel nlp features for characterlevel models | [['neural', 'language', 'models', 'lms', 'are', 'typically', 'trained', 'using', 'only', 'lexical', 'features', 'such', 'as', 'surface', 'forms', 'of', 'words', 'in', 'this', 'paper', 'we', 'argue', 'this', 'deprives', 'the', 'lm', 'of', 'crucial', 'syntactic', 'signals', 'that', 'can', 'be', 'detected', 'at', 'high', 'confidence', 'using', 'existing', 'parsers', 'we', 'present', 'a', 'simple', 'but', 'highly', 'effective', 'approach', 'for', 'training', 'neural', 'lms', 'using', 'both', 'lexical', 'and', 'syntactic', 'information', 'and', 'a', 'novel', 'approach', 'for', 'applying', 'such', 'lms', 'to', 'unparsed', 'text', 'using', 'sequential', 'monte', 'carlo', 'sampling', 'in', 'experiments', 'on', 'a', 'range', 'of', 'corpora', 'and', 'corpus', 'sizes', 'we', 'show', 'our', 'approach', 'consistently', 'outperforms', 'standard', 'lexical', 'lms', 'in', 'characterlevel', 'language', 'modeling', 'on', 'the', 'other', 'hand', 'for', 'wordlevel', 'models', 'the', 'models', 'are', 'on', 'a', 'par', 'with', 'standard', 'language', 'models', 'these', 'results', 'indicate', 'potential', 'for', 'expanding', 'lms', 'beyond', 'lexical', 'surface', 'features', 'to', 'higherlevel', 'nlp', 'features', 'for', 'characterlevel', 'models']] | [0.006442041827707004, 0.023085520954674664, -0.05499815965028665, 0.1451286692545529, -0.15913236158267233, -0.19493846489358266, 0.041834947026604855, 0.49307063398242906, -0.28894597071912564, -0.31413999603321874, 0.03450418375379171, -0.3114744302183958, -0.17987580337554557, 0.23160027881830092, -0.07570870854813634, 0.0713829874978152, 0.16840252905856562, 0.060369420512259464, -0.0803284477375853, -0.2703812314794605, 0.2685825887655143, 0.04214372211455844, 0.30570079809239575, -0.011325618056651518, 0.1354592915816332, -0.0810653988364373, -0.030401810548687708, -0.03860610595527496, -0.0372544109756558, 0.18952712930298146, 0.35671576478553313, 0.19496604892290162, 0.2835647960954154, -0.4112805478267713, -0.26448481163465, 0.026591947849640866, 0.1639119917882308, 0.13962088278745824, -0.010864642565138638, -0.3273231578095041, 0.1138838003691684, -0.1872921108858276, 0.13238638618122076, -0.17930661369015582, -0.0627269089961325, 0.024267805327895943, -0.24908834636053212, 0.07408161167715648, 0.1707384052956548, 0.1547119571038216, -0.022651238020381513, -0.2131892060896538, 0.01358647175126119, 0.08315512753191283, 0.017273086192928794, 0.05259457877428335, 0.10466198674367584, -0.18946118679836052, -0.15994977984108202, 0.35743335040129776, -0.15455624023061387, -0.2815631972732492, 0.2611791805456613, 0.0006836668502909082, -0.18701117854025073, 0.02138981149702525, 0.2402171407122421, 0.09833413615595293, -0.17551320962579423, 0.05029810019875414, -0.00805821777356945, 0.25259203455972534, 0.052108909762357825, -0.008954357082123747, 0.20916377169076525, 0.29700132653486866, -0.07956533141803877, 0.07004132120157343, -0.11787162616116684, -0.053416668501405314, -0.2046789922480443, -0.11372299569139954, -0.15688979753192234, -0.09309713954802688, -0.10453936328210793, -0.18942394849616778, 0.40510935356257527, 0.2723639978856588, 0.15356192916262013, 0.1877405441558088, 0.3174350363778249, 0.041192078994914096, 0.16398284213887598, 0.10142704693579208, 0.11256348887700161, -0.03380946721881628, 0.10480373224442582, -0.13350384743912644, 0.1142066565825682, 0.08500736235385008] |
1,803.03666 | Standing Wave Decomposition Gaussian Process | We propose a Standing Wave Decomposition (SWD) approximation to Gaussian
Process regression (GP). GP involves a costly matrix inversion operation, which
limits applicability to large data analysis. For an input space that can be
approximated by a grid and when correlations among data are short-ranged, the
kernel matrix inversion can be replaced by analytic diagonalization using the
SWD. We show that this approach applies to uni- and multi-dimensional input
data, extends to include longer-range correlations, and the grid can be in a
latent space and used as inducing points. Through simulations, we show that our
approximate method applied to the squared exponential kernel outperforms
existing methods in predictive accuracy per unit time in the regime where data
are plentiful. Our SWD-GP is recommended for regression analyses where there is
a relatively large amount of data and/or there are constraints on computation
time.
| stat.ML cond-mat.dis-nn cs.LG | we propose a standing wave decomposition swd approximation to gaussian process regression gp gp involves a costly matrix inversion operation which limits applicability to large data analysis for an input space that can be approximated by a grid and when correlations among data are shortranged the kernel matrix inversion can be replaced by analytic diagonalization using the swd we show that this approach applies to uni and multidimensional input data extends to include longerrange correlations and the grid can be in a latent space and used as inducing points through simulations we show that our approximate method applied to the squared exponential kernel outperforms existing methods in predictive accuracy per unit time in the regime where data are plentiful our swdgp is recommended for regression analyses where there is a relatively large amount of data andor there are constraints on computation time | [['we', 'propose', 'a', 'standing', 'wave', 'decomposition', 'swd', 'approximation', 'to', 'gaussian', 'process', 'regression', 'gp', 'gp', 'involves', 'a', 'costly', 'matrix', 'inversion', 'operation', 'which', 'limits', 'applicability', 'to', 'large', 'data', 'analysis', 'for', 'an', 'input', 'space', 'that', 'can', 'be', 'approximated', 'by', 'a', 'grid', 'and', 'when', 'correlations', 'among', 'data', 'are', 'shortranged', 'the', 'kernel', 'matrix', 'inversion', 'can', 'be', 'replaced', 'by', 'analytic', 'diagonalization', 'using', 'the', 'swd', 'we', 'show', 'that', 'this', 'approach', 'applies', 'to', 'uni', 'and', 'multidimensional', 'input', 'data', 'extends', 'to', 'include', 'longerrange', 'correlations', 'and', 'the', 'grid', 'can', 'be', 'in', 'a', 'latent', 'space', 'and', 'used', 'as', 'inducing', 'points', 'through', 'simulations', 'we', 'show', 'that', 'our', 'approximate', 'method', 'applied', 'to', 'the', 'squared', 'exponential', 'kernel', 'outperforms', 'existing', 'methods', 'in', 'predictive', 'accuracy', 'per', 'unit', 'time', 'in', 'the', 'regime', 'where', 'data', 'are', 'plentiful', 'our', 'swdgp', 'is', 'recommended', 'for', 'regression', 'analyses', 'where', 'there', 'is', 'a', 'relatively', 'large', 'amount', 'of', 'data', 'andor', 'there', 'are', 'constraints', 'on', 'computation', 'time']] | [-0.07276566920666593, 0.05973651946833149, -0.07777784780123607, 0.10074027310625713, -0.0869537449593768, -0.13884714031459908, 0.0754549750936026, 0.4202935420082393, -0.2899624207684546, -0.28349512532115617, 0.15724098258158473, -0.2660528089362362, -0.14458177866189614, 0.21266613913789154, -0.03420359094388591, 0.08071430816136776, 0.10818682467492284, -0.02186670274546383, -0.08509343224313401, -0.23023696379828537, 0.2856103789006816, 0.036102010881699995, 0.2779142197670666, -0.00039115063317701326, 0.09906395200180906, 0.025957107253319827, -0.028619562383866638, 0.019467440539069396, -0.053698388115675864, 0.11557396420059686, 0.3115220005534827, 0.14682003916142153, 0.2871140091290288, -0.44051179207914265, -0.24343263285221362, 0.1252375414424926, 0.1668472981034177, 0.10040436308180371, -0.020020335527130315, -0.2664733334437858, 0.060325476800005697, -0.15296233471165946, -0.06250995274051918, -0.17625300084564385, -0.016814770563406512, 0.028148652924594623, -0.3858837847538451, 0.1045713709033233, 0.03472822990453412, 0.015875194786473156, -0.01964119768615627, -0.10936401931384036, 0.01337719591109888, 0.08608778373933569, 0.0314327610443191, 0.04492722870451762, 0.09449093444735235, -0.07924054629592132, -0.08173106933270205, 0.3650038054226138, -0.08676122312916192, -0.2699702325481789, 0.15947454602371716, -0.10002243860479418, -0.11315901731702348, 0.1352300455080385, 0.2030268125516752, 0.07170102752890464, -0.1190458938520912, 0.10089736606542629, -0.02768231080900729, 0.18067174314534462, 0.014855955097434632, -0.04312880414353142, 0.12264577218608812, 0.18955139381685526, 0.06244561709265443, 0.1200207508547258, -0.12937191106438478, -0.11767034999316588, -0.2676112654103719, -0.09934267446981637, -0.257982252740321, -0.011424329502244665, -0.12503980536794898, -0.15027075385053953, 0.35257651982828975, 0.1608882114350637, 0.22095159140369253, 0.08137165072146169, 0.3177238441805573, 0.1413072866878096, 0.10301027658349234, 0.10587066018239534, 0.15736298298080129, 0.07416828986296946, 0.058621421941813634, -0.17031845153583516, 0.07892134885059286, 0.03818832759593501] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.