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.07567
|
Umbral Moonshine and String Duality
|
By studying 2d string compactifications with half-maximal supersymmetry in a
variety of duality frames, we find a natural physical setting for understanding
Umbral moonshine. Near points in moduli space with enhanced gauge symmetry, we
find that the Umbral symmetry groups arise as symmetries of the theory. In one
duality frame -- a flux compactification on $T^4/Z_2\times T^4$ -- the
24-dimensional permutation representations of the Umbral groups act on
D1-branes strung between a set of NS5-branes. The presence of these NS5-branes
is used to explain the Umbral moonshine decompositions of the K3 twining
genera, and in particular of the K3 elliptic genus. The fundamental string in
this frame is dual to the type IIA string on K3$\times T^4$ and to a
compactified heterotic little string theory. The latter provides an interesting
example of a little string theory, as the string-scale geometry transverse to
the 5-brane plays an important role in its construction.
|
hep-th
|
by studying 2d string compactifications with halfmaximal supersymmetry in a variety of duality frames we find a natural physical setting for understanding umbral moonshine near points in moduli space with enhanced gauge symmetry we find that the umbral symmetry groups arise as symmetries of the theory in one duality frame a flux compactification on t4z_2times t4 the 24dimensional permutation representations of the umbral groups act on d1branes strung between a set of ns5branes the presence of these ns5branes is used to explain the umbral moonshine decompositions of the k3 twining genera and in particular of the k3 elliptic genus the fundamental string in this frame is dual to the type iia string on k3times t4 and to a compactified heterotic little string theory the latter provides an interesting example of a little string theory as the stringscale geometry transverse to the 5brane plays an important role in its construction
|
[['by', 'studying', '2d', 'string', 'compactifications', 'with', 'halfmaximal', 'supersymmetry', 'in', 'a', 'variety', 'of', 'duality', 'frames', 'we', 'find', 'a', 'natural', 'physical', 'setting', 'for', 'understanding', 'umbral', 'moonshine', 'near', 'points', 'in', 'moduli', 'space', 'with', 'enhanced', 'gauge', 'symmetry', 'we', 'find', 'that', 'the', 'umbral', 'symmetry', 'groups', 'arise', 'as', 'symmetries', 'of', 'the', 'theory', 'in', 'one', 'duality', 'frame', 'a', 'flux', 'compactification', 'on', 't4z_2times', 't4', 'the', '24dimensional', 'permutation', 'representations', 'of', 'the', 'umbral', 'groups', 'act', 'on', 'd1branes', 'strung', 'between', 'a', 'set', 'of', 'ns5branes', 'the', 'presence', 'of', 'these', 'ns5branes', 'is', 'used', 'to', 'explain', 'the', 'umbral', 'moonshine', 'decompositions', 'of', 'the', 'k3', 'twining', 'genera', 'and', 'in', 'particular', 'of', 'the', 'k3', 'elliptic', 'genus', 'the', 'fundamental', 'string', 'in', 'this', 'frame', 'is', 'dual', 'to', 'the', 'type', 'iia', 'string', 'on', 'k3times', 't4', 'and', 'to', 'a', 'compactified', 'heterotic', 'little', 'string', 'theory', 'the', 'latter', 'provides', 'an', 'interesting', 'example', 'of', 'a', 'little', 'string', 'theory', 'as', 'the', 'stringscale', 'geometry', 'transverse', 'to', 'the', '5brane', 'plays', 'an', 'important', 'role', 'in', 'its', 'construction']]
|
[-0.1751017405689266, 0.13679593478072266, -0.09343793659039924, 0.18057365029990496, -0.11550103913287858, -0.12694879611198967, -0.005484208249883424, 0.3219744376570767, -0.23487199014650556, -0.27454949085241986, 0.08200611494091414, -0.24560424211951024, -0.19028105098766754, 0.16815225272816983, -0.14006976760621812, -0.037752252550735894, -0.028671433331092466, 0.08670803302320072, -0.10477496894757654, -0.2837435469673191, 0.34373533037314946, 0.0173492061880392, 0.3070413756539819, 0.031344398843577585, 0.06951457439493891, -0.002376253958917349, -0.014328680212005368, -0.07125952137288845, -0.13036085811084352, 0.1781845096438947, 0.2899539429769927, 0.04353401497182612, 0.06922022447248015, -0.4733357961868515, -0.2172723924471742, 0.09333500399166164, 0.1740393547098958, 0.11529865364128775, -0.02509909470304469, -0.24804900608000321, 0.020829730653015244, -0.10848767568539777, -0.15729127950554184, -0.030353078595834557, 0.045858802899995166, -0.06257288009431716, -0.1531724897071694, 0.010504467003802592, 0.029747063218540436, 0.11341464817146393, -0.023224076647091203, -0.04962383025653056, -0.08695241055495383, 0.08671656769473811, 0.14336104962874102, 0.09976894465413548, 0.10071996385640641, -0.20950197320702058, -0.15318910292400098, 0.37009875937302067, -0.048294739401270007, -0.18527138439586033, 0.12584554206743534, -0.10971769586369093, -0.22201661988966973, 0.0906862231770631, 0.08171554752373816, 0.1490477588030862, -0.004899820751774855, 0.2125935002373267, -0.11055308188047461, 0.10381370295716978, 0.13500083104480762, 0.05092901260768239, 0.26272061681752473, 0.1224621186721944, 0.039815880144266666, 0.1287165350497801, -0.05524743190255469, -0.11729609482092594, -0.4602374641249913, -0.14599139813976394, -0.04727309989283566, 0.1692366871992252, -0.16906199282380543, -0.2046485960930334, 0.37629721448693826, 0.03591926319751184, 0.19287118887704974, 0.03482016349035139, 0.117872212522638, 0.041107432785498235, 0.10940981179010123, 0.012872406228829326, 0.16230573054604433, 0.21592491264989902, 0.04559805176560641, -0.23757265631748187, -0.1721088619135018, 0.23341926415073308]
|
1,803.07568
|
A note on the entropy of rotating BPS AdS$_7\times S^4$ black holes
|
In this note we show that the entropy of BPS, rotating, electrically charged
AdS$_7 \times S^4$ black holes can be obtained by an extremization principle
involving a particular combination of anomaly coefficients of the
six-dimensional $\mathcal{N} = (2, 0)$ theory. This result extends our previous
finding for BPS, rotating AdS$_5 \times S^5$ black holes.
|
hep-th
|
in this note we show that the entropy of bps rotating electrically charged ads_7 times s4 black holes can be obtained by an extremization principle involving a particular combination of anomaly coefficients of the sixdimensional mathcaln 2 0 theory this result extends our previous finding for bps rotating ads_5 times s5 black holes
|
[['in', 'this', 'note', 'we', 'show', 'that', 'the', 'entropy', 'of', 'bps', 'rotating', 'electrically', 'charged', 'ads_7', 'times', 's4', 'black', 'holes', 'can', 'be', 'obtained', 'by', 'an', 'extremization', 'principle', 'involving', 'a', 'particular', 'combination', 'of', 'anomaly', 'coefficients', 'of', 'the', 'sixdimensional', 'mathcaln', '2', '0', 'theory', 'this', 'result', 'extends', 'our', 'previous', 'finding', 'for', 'bps', 'rotating', 'ads_5', 'times', 's5', 'black', 'holes']]
|
[-0.1618769972394045, 0.1233850258673247, -0.004995790326677896, 0.09508770456063156, -0.026055842589692405, -0.13130420136247883, -0.010528228643244871, 0.2751613323629465, -0.09644820773095455, -0.27517599442024837, 0.09882961346917206, -0.30082978301171986, -0.09750647786653267, 0.16017355082802615, -0.12175237315373039, 0.010481864266659854, -0.001764831467057174, 0.03921932291309788, -0.1533760115249469, -0.2423648253381955, 0.30359294860325053, -0.019420038074044126, 0.22096783701189845, -0.027784884784300374, 0.08923786991926015, 0.0077166529635916345, 0.055280656079357525, 0.06378552742864725, -0.1689127179721803, 0.1545078563943224, 0.2518962940798615, 0.10654204479365978, 0.06334163916279685, -0.46012891814956125, -0.23708410012834477, 0.08378349648753428, 0.20308228253984367, 0.18483655087930975, -0.059994309683734516, -0.2564882578082242, 0.08684147634315041, -0.23012164807966295, -0.20799586752578966, -0.040537371388021506, 0.08883254722041904, -0.09430532343685627, -0.25098421711052926, 0.16288429150964082, 0.09823362669854793, -0.08392665468437492, -0.08712178664633406, -0.04307052656955455, -0.08633469158941705, 0.039623140506797806, 0.21232449017324537, 0.13072164495528307, 0.19903563006060584, -0.08090777218974424, -0.19743529419010541, 0.22211798273448674, -0.0862755606583548, -0.2297830034293375, 0.10158404500996869, -0.21691651529421643, -0.19250909794332846, 0.11226077719573986, 0.0675915809400942, 0.34411737943103293, -0.14580832991116452, 0.20218629059645365, -0.1135124375006922, 0.21491799436790762, 0.1773321489487195, 0.04498470083476519, 0.37600921003042526, 0.10802411063539111, 0.0056651101781512204, 0.18174596895015677, -0.03174997650895198, -0.04162568837087953, -0.3879747173555617, -0.16727600359129455, -0.09295281836376437, 0.23096509048504368, -0.18883711416801474, -0.12295236563274883, 0.28681120530368304, 0.06518874931553344, 0.17536126277497355, 0.08988074200965886, 0.15324233441445032, 0.08913952111538921, -0.00963284338842023, 0.10909732914406736, 0.3027909350282741, 0.0992312411061611, 0.1287200134730775, -0.23633660337413256, -0.2353036489495832, 0.20517940535473655]
|
1,803.07569
|
Prediction of Supernova Rates in Known Galaxy-galaxy Strong-lens Systems
|
We propose a new strategy of finding strongly-lensed supernovae (SNe) by
monitoring known galaxy-scale strong-lens systems. Strongly lensed SNe are
potentially powerful tools for the study of cosmology, galaxy evolution, and
stellar populations, but they are extremely rare. By targeting known strongly
lensed starforming galaxies, our strategy significantly boosts the detection
efficiency for lensed SNe compared to a blind search. As a reference sample, we
compile the 128 galaxy-galaxy strong-lens systems from the Sloan Lens ACS
Survey (SLACS), the SLACS for the Masses Survey, and the Baryon Oscillation
Spectroscopic Survey Emission-Line Lens Survey. Within this sample, we estimate
the rates of strongly-lensed Type Ia SN (SNIa) and core-collapse SN (CCSN) to
be $1.23 \pm 0.12$ and $10.4 \pm 1.1$ events per year, respectively. The lensed
SN images are expected to be widely separated with a median separation of 2
arcsec. Assuming a conservative fiducial lensing magnification factor of 5 for
the most highly magnified SN image, we forecast that a monitoring program with
a single-visit depth of 24.7 mag (5$\sigma$ point source, $r$ band) and a
cadence of 5 days can detect 0.49 strongly-lensed SNIa event and 2.1
strongly-lensed CCSN events per year within this sample. Our proposed
targeted-search strategy is particularly useful for prompt and efficient
identifications and follow-up observations of strongly-lensed SN candidates. It
also allows telescopes with small field of views and limited time to
efficiently discover strongly-lensed SNe with a pencil-beam scanning strategy.
|
astro-ph.GA
|
we propose a new strategy of finding stronglylensed supernovae sne by monitoring known galaxyscale stronglens systems strongly lensed sne are potentially powerful tools for the study of cosmology galaxy evolution and stellar populations but they are extremely rare by targeting known strongly lensed starforming galaxies our strategy significantly boosts the detection efficiency for lensed sne compared to a blind search as a reference sample we compile the 128 galaxygalaxy stronglens systems from the sloan lens acs survey slacs the slacs for the masses survey and the baryon oscillation spectroscopic survey emissionline lens survey within this sample we estimate the rates of stronglylensed type ia sn snia and corecollapse sn ccsn to be 123 pm 012 and 104 pm 11 events per year respectively the lensed sn images are expected to be widely separated with a median separation of 2 arcsec assuming a conservative fiducial lensing magnification factor of 5 for the most highly magnified sn image we forecast that a monitoring program with a singlevisit depth of 247 mag 5sigma point source r band and a cadence of 5 days can detect 049 stronglylensed snia event and 21 stronglylensed ccsn events per year within this sample our proposed targetedsearch strategy is particularly useful for prompt and efficient identifications and followup observations of stronglylensed sn candidates it also allows telescopes with small field of views and limited time to efficiently discover stronglylensed sne with a pencilbeam scanning strategy
|
[['we', 'propose', 'a', 'new', 'strategy', 'of', 'finding', 'stronglylensed', 'supernovae', 'sne', 'by', 'monitoring', 'known', 'galaxyscale', 'stronglens', 'systems', 'strongly', 'lensed', 'sne', 'are', 'potentially', 'powerful', 'tools', 'for', 'the', 'study', 'of', 'cosmology', 'galaxy', 'evolution', 'and', 'stellar', 'populations', 'but', 'they', 'are', 'extremely', 'rare', 'by', 'targeting', 'known', 'strongly', 'lensed', 'starforming', 'galaxies', 'our', 'strategy', 'significantly', 'boosts', 'the', 'detection', 'efficiency', 'for', 'lensed', 'sne', 'compared', 'to', 'a', 'blind', 'search', 'as', 'a', 'reference', 'sample', 'we', 'compile', 'the', '128', 'galaxygalaxy', 'stronglens', 'systems', 'from', 'the', 'sloan', 'lens', 'acs', 'survey', 'slacs', 'the', 'slacs', 'for', 'the', 'masses', 'survey', 'and', 'the', 'baryon', 'oscillation', 'spectroscopic', 'survey', 'emissionline', 'lens', 'survey', 'within', 'this', 'sample', 'we', 'estimate', 'the', 'rates', 'of', 'stronglylensed', 'type', 'ia', 'sn', 'snia', 'and', 'corecollapse', 'sn', 'ccsn', 'to', 'be', '123', 'pm', '012', 'and', '104', 'pm', '11', 'events', 'per', 'year', 'respectively', 'the', 'lensed', 'sn', 'images', 'are', 'expected', 'to', 'be', 'widely', 'separated', 'with', 'a', 'median', 'separation', 'of', '2', 'arcsec', 'assuming', 'a', 'conservative', 'fiducial', 'lensing', 'magnification', 'factor', 'of', '5', 'for', 'the', 'most', 'highly', 'magnified', 'sn', 'image', 'we', 'forecast', 'that', 'a', 'monitoring', 'program', 'with', 'a', 'singlevisit', 'depth', 'of', '247', 'mag', '5sigma', 'point', 'source', 'r', 'band', 'and', 'a', 'cadence', 'of', '5', 'days', 'can', 'detect', '049', 'stronglylensed', 'snia', 'event', 'and', '21', 'stronglylensed', 'ccsn', 'events', 'per', 'year', 'within', 'this', 'sample', 'our', 'proposed', 'targetedsearch', 'strategy', 'is', 'particularly', 'useful', 'for', 'prompt', 'and', 'efficient', 'identifications', 'and', 'followup', 'observations', 'of', 'stronglylensed', 'sn', 'candidates', 'it', 'also', 'allows', 'telescopes', 'with', 'small', 'field', 'of', 'views', 'and', 'limited', 'time', 'to', 'efficiently', 'discover', 'stronglylensed', 'sne', 'with', 'a', 'pencilbeam', 'scanning', 'strategy']]
|
[-0.04473437525352199, 0.021354702901158294, -0.036234343233044745, 0.13054667354583094, -0.14378965252189566, -0.13909242508964517, 0.09823587790557767, 0.4131323766886746, -0.1174907974244719, -0.3790458997679969, 0.06870872538805134, -0.34986132172127976, -0.020664007137815656, 0.24104600812217725, -0.022486075133972425, -0.02742142434048435, 0.12802154085326592, -0.16577961199948468, -0.05796248385469603, -0.38417628632021783, 0.2360266383068431, 0.09430456919185186, 0.19192425538075425, -0.13622969862466314, 0.08903147023905195, -0.07035488095820164, -0.16377773503496676, -0.013387383916809902, -0.16100001241484588, 0.022903706188810893, 0.28046073550180833, 0.22184110725677367, 0.2130712140213414, -0.24816190318964246, -0.18401179878609414, 0.12844513688173334, 0.22065328907515555, 0.08772439857679952, -0.06445013757899179, -0.3523267632028704, 0.0966708378686759, -0.17618284790413613, -0.13151296187721004, 0.07921155822715896, 0.025502653135444527, 0.0545939474417907, -0.22751855276232996, 0.1971319424385803, -0.059839471309175475, 0.09234750321750546, -0.07918695947949546, -0.08342490435362857, -0.02119277763798028, 0.009944743954308204, -0.04585585328829238, 0.10219715689052433, 0.12467200694195295, -0.1348270141407137, -0.028246403416279323, 0.4496496173146702, -0.026315656446721562, 0.052451052789164954, 0.18199271499573932, -0.17677630027223346, -0.19268705166769767, 0.1592135770814651, 0.20381337680663494, 0.1284040194705239, -0.2324736209998649, -0.07653899609049096, 0.032940732516443076, 0.26734497266788515, 0.017699871009010507, 0.08166641813523572, 0.3246868414393926, 0.159941412809885, 0.06886847873644555, 0.03192823539957625, -0.3255251809595532, 0.07684362516146533, -0.26369180241836454, -0.07844852566446761, -0.13553738443800484, 0.16357769623006127, -0.1738856862909215, -0.08990637390858047, 0.34893774453519005, 0.10774489016848285, 0.16826755789570289, 0.06904457833260787, 0.2787629063241184, 0.00555630021193854, 0.1287760968769948, 0.04651499791583836, 0.33485828682196217, 0.12904461486939878, 0.08099017058295924, -0.1610591049977949, 0.01515389539072511, 0.004562644893698142]
|
1,803.0757
|
Optimal Target Stars in the Search for Life
|
The selection of optimal targets in the search for life represents a highly
important strategic issue. In this Letter, we evaluate the benefits of
searching for life around a potentially habitable planet orbiting a star of
arbitrary mass relative to a similar planet around a Sun-like star. If recent
physical arguments implying that the habitability of planets orbiting low-mass
stars is selectively suppressed are correct, we find that planets around
solar-type stars may represent the optimal targets.
|
astro-ph.EP
|
the selection of optimal targets in the search for life represents a highly important strategic issue in this letter we evaluate the benefits of searching for life around a potentially habitable planet orbiting a star of arbitrary mass relative to a similar planet around a sunlike star if recent physical arguments implying that the habitability of planets orbiting lowmass stars is selectively suppressed are correct we find that planets around solartype stars may represent the optimal targets
|
[['the', 'selection', 'of', 'optimal', 'targets', 'in', 'the', 'search', 'for', 'life', 'represents', 'a', 'highly', 'important', 'strategic', 'issue', 'in', 'this', 'letter', 'we', 'evaluate', 'the', 'benefits', 'of', 'searching', 'for', 'life', 'around', 'a', 'potentially', 'habitable', 'planet', 'orbiting', 'a', 'star', 'of', 'arbitrary', 'mass', 'relative', 'to', 'a', 'similar', 'planet', 'around', 'a', 'sunlike', 'star', 'if', 'recent', 'physical', 'arguments', 'implying', 'that', 'the', 'habitability', 'of', 'planets', 'orbiting', 'lowmass', 'stars', 'is', 'selectively', 'suppressed', 'are', 'correct', 'we', 'find', 'that', 'planets', 'around', 'solartype', 'stars', 'may', 'represent', 'the', 'optimal', 'targets']]
|
[-0.14600275216212907, 0.16996221830947444, -0.07959684118168889, 0.11593717550737904, -0.16730084120259656, -0.06054857277081578, 0.16861663545880998, 0.3263189777272282, -0.10215936708808332, -0.34586130704295326, 0.04426165251968453, -0.27046791362491523, -0.10783049765998473, 0.1944434414647955, -0.14856838375668635, 0.01657327972110603, 0.16743669022394755, 0.004199238421467992, 0.003891443664377386, -0.271900384166798, 0.30166389609312083, 0.07371616460286178, -0.004314442479668499, -0.03787815036227951, 0.006281692307902041, -0.090338678770493, -0.043606236020659474, -0.10446650850550308, -0.18892421753107203, 0.05175840753045949, 0.3361693352896285, 0.1664921272328341, 0.3087072300591639, -0.3353609318131363, -0.20907404662001056, 0.09691198227976981, 0.19004124989007393, 0.04156298129879809, -0.11857736102220687, -0.24853694001091764, 0.14176637862276817, -0.1815385771253866, -0.21066559392765358, 0.02104547011436193, 0.1181028706396555, -0.016930341297252613, -0.306227042932402, 0.03002024195217467, 0.09027960979088297, 0.07608656210268473, -0.1731425374164246, -0.12480045613143351, -0.05067338951706112, 0.0936435631645674, 0.03040550475903823, 0.03013084072305204, 0.22810125580759016, -0.10510160653712455, -0.039957686412063514, 0.44710839191427476, -0.11096669847218248, -0.0584501878769657, 0.24752856977283955, -0.22561483843518154, -0.18414729103663718, 0.10040390616216298, 0.20694179617642583, 0.2521424801512198, -0.19287803467943684, -0.03175368303563083, -0.030889797565684496, 0.1653000862615836, 0.11961221839482715, 0.06291786872769718, 0.4905201031209587, 0.21571273028747748, 0.11582134804664204, 0.06206096244322789, -0.20397227627600167, -0.08278538448760261, -0.1471684974219118, -0.17840284663071107, -0.14553174059596155, 0.028050268688783436, -0.11215909493046922, -0.12041644631679375, 0.34366327498785476, 0.18049918694040654, 0.1368239007696703, 0.0020922064847712007, 0.27400004573456654, 0.05307565943350072, 0.0994349726681392, 0.11571543486546967, 0.3344842636256249, 0.0906455045832055, 0.05968283421916331, -0.2798506468111141, 0.13852294914382088, -0.05297759332536877]
|
1,803.07571
|
A Potential Cyclotron Resonant Scattering Feature in the ULX Pulsar NGC
300 ULX1 seen by NuSTAR and XMM-Newton
|
Based on phase-resolved broadband spectroscopy using $XMM$-$Newton$ and
$NuSTAR$, we report on a potential cyclotron resonant scattering feature at $E
\sim 13$ keV in the pulsed spectrum of the recently discoverd ULX pulsar NGC
300 ULX1. If this interpretation is correct, the implied magnetic field of the
central neutron star is $B \sim 10^{12}$ G (assuming scattering off electrons),
similar to that estimated from the observed spin-up of the star, and also
similar to known Galactic X-ray pulsars. We discuss the implications of this
result for the connection between NGC 300 ULX1 and the other known ULX pulsars,
particularly in light of the recent discovery of a likely proton Cyclotron line
in another ULX, M51 ULX-8.
|
astro-ph.HE astro-ph.GA
|
based on phaseresolved broadband spectroscopy using xmmnewton and nustar we report on a potential cyclotron resonant scattering feature at e sim 13 kev in the pulsed spectrum of the recently discoverd ulx pulsar ngc 300 ulx1 if this interpretation is correct the implied magnetic field of the central neutron star is b sim 1012 g assuming scattering off electrons similar to that estimated from the observed spinup of the star and also similar to known galactic xray pulsars we discuss the implications of this result for the connection between ngc 300 ulx1 and the other known ulx pulsars particularly in light of the recent discovery of a likely proton cyclotron line in another ulx m51 ulx8
|
[['based', 'on', 'phaseresolved', 'broadband', 'spectroscopy', 'using', 'xmmnewton', 'and', 'nustar', 'we', 'report', 'on', 'a', 'potential', 'cyclotron', 'resonant', 'scattering', 'feature', 'at', 'e', 'sim', '13', 'kev', 'in', 'the', 'pulsed', 'spectrum', 'of', 'the', 'recently', 'discoverd', 'ulx', 'pulsar', 'ngc', '300', 'ulx1', 'if', 'this', 'interpretation', 'is', 'correct', 'the', 'implied', 'magnetic', 'field', 'of', 'the', 'central', 'neutron', 'star', 'is', 'b', 'sim', '1012', 'g', 'assuming', 'scattering', 'off', 'electrons', 'similar', 'to', 'that', 'estimated', 'from', 'the', 'observed', 'spinup', 'of', 'the', 'star', 'and', 'also', 'similar', 'to', 'known', 'galactic', 'xray', 'pulsars', 'we', 'discuss', 'the', 'implications', 'of', 'this', 'result', 'for', 'the', 'connection', 'between', 'ngc', '300', 'ulx1', 'and', 'the', 'other', 'known', 'ulx', 'pulsars', 'particularly', 'in', 'light', 'of', 'the', 'recent', 'discovery', 'of', 'a', 'likely', 'proton', 'cyclotron', 'line', 'in', 'another', 'ulx', 'm51', 'ulx8']]
|
[-0.07301901292622737, 0.1067404798677434, -0.0672737263912416, 0.12263175150298554, -0.13727293872962829, -0.09859010475313129, 0.0924870790913701, 0.43328563603370085, -0.15715382815055226, -0.336065800698555, 0.013458362182237857, -0.32737921830671635, -0.0037695784121751785, 0.29214616669746846, -0.006565674912670384, -0.04409012684760534, 0.054148108708550746, -0.032670040266669316, -0.03681112876485871, -0.19973295283207732, 0.2655932993668577, 0.08382569925616616, 0.15913400723720375, 0.04625448157767887, 0.08251829131141952, -0.020700480588509335, -0.016540723383102727, -0.13210699850612362, -0.1017997115276597, 0.04270702496818874, 0.23245619418625924, 0.06330410162867654, 0.14484265245011319, -0.34645339739104003, -0.19556692668601222, 0.03969609351707217, 0.20075024134357985, -0.048611162424988474, -0.06517964000813663, -0.30150870528558027, 0.051841406337916854, -0.2471153590666211, -0.21222744741598548, 0.09014167947613674, 0.07725310432623424, 0.014300071599933763, -0.16979651741845453, 0.12204539987800198, 0.02505228191452182, 0.06151847185809975, -0.20547310102164099, -0.09715949209487956, 0.031182517026267623, -0.037849456075902864, 0.08290722112717998, 0.11893511471824478, 0.1530766453108062, -0.10461587233711844, -0.08625922903985433, 0.3599809665364497, -0.058244363963603975, 0.11605602290643298, 0.1956257813255829, -0.2823440565423959, -0.22725869719667927, 0.1398046150398643, 0.08842275958184315, 0.12350560286608728, -0.16456860220464675, 0.03358331267043705, -0.08532896958185239, 0.25013499408150497, 0.08615075804941032, 0.0718025121068501, 0.32300217588958535, 0.10946389766683316, -0.010066277602606493, 0.11623003632690676, -0.3091372695103612, 0.05600013189908603, -0.22151310290007487, -0.020357273521063767, -0.13992390177496103, 0.17027489656744443, -0.10405541153829646, -0.08682390209287405, 0.3690721564035377, 0.06943163677807088, 0.18853557425672593, -0.06685549713235915, 0.3004114503445833, 0.14277368798528028, 0.0366259651061188, 0.1436043260436829, 0.35528330433627836, 0.21787918621431226, 0.0995454973946123, -0.2955976553686449, 0.04364530952019698, -0.05808251125980978]
|
1,803.07572
|
Co-existence and switching between fast and $\Omega$-slow wind solutions
in rapidly rotating massive stars
|
Most radiatively-driven massive star winds can be modelled with m-CAK theory
resulting in so called fast solution. However, those most rapidly rotating
among them, especially when the stellar rotational speed is higher than $\sim
75\%$ of the critical rotational speed, can adopt a different solution called
$\Omega$-slow solution characterized by a dense and slow wind. Here, in this
work we study the transition region of the solutions where the fast solution
changes to the $\Omega$-slow. Using both time-steady and time-dependent
numerical codes, we study this transition region for different equatorial
models of B-type stars. In all the cases, at certain range of rotational
speeds, we found a region where the fast and $\Omega$-slow solution can
co-exist. We find that the type of solution obtained in this co-existence
region depends heavily on the initial conditions of our models. We also test
the stability of the solutions within the co-existence region by performing
base density perturbations in the wind. We find that under certain conditions,
the fast solution can switch to a $\Omega$-slow solution, or vice versa. Such
solution switching may be a possible contributor of material injected into the
circumstellar environment of Be stars, without requiring rotational speeds near
critical values.
|
astro-ph.SR
|
most radiativelydriven massive star winds can be modelled with mcak theory resulting in so called fast solution however those most rapidly rotating among them especially when the stellar rotational speed is higher than sim 75 of the critical rotational speed can adopt a different solution called omegaslow solution characterized by a dense and slow wind here in this work we study the transition region of the solutions where the fast solution changes to the omegaslow using both timesteady and timedependent numerical codes we study this transition region for different equatorial models of btype stars in all the cases at certain range of rotational speeds we found a region where the fast and omegaslow solution can coexist we find that the type of solution obtained in this coexistence region depends heavily on the initial conditions of our models we also test the stability of the solutions within the coexistence region by performing base density perturbations in the wind we find that under certain conditions the fast solution can switch to a omegaslow solution or vice versa such solution switching may be a possible contributor of material injected into the circumstellar environment of be stars without requiring rotational speeds near critical values
|
[['most', 'radiativelydriven', 'massive', 'star', 'winds', 'can', 'be', 'modelled', 'with', 'mcak', 'theory', 'resulting', 'in', 'so', 'called', 'fast', 'solution', 'however', 'those', 'most', 'rapidly', 'rotating', 'among', 'them', 'especially', 'when', 'the', 'stellar', 'rotational', 'speed', 'is', 'higher', 'than', 'sim', '75', 'of', 'the', 'critical', 'rotational', 'speed', 'can', 'adopt', 'a', 'different', 'solution', 'called', 'omegaslow', 'solution', 'characterized', 'by', 'a', 'dense', 'and', 'slow', 'wind', 'here', 'in', 'this', 'work', 'we', 'study', 'the', 'transition', 'region', 'of', 'the', 'solutions', 'where', 'the', 'fast', 'solution', 'changes', 'to', 'the', 'omegaslow', 'using', 'both', 'timesteady', 'and', 'timedependent', 'numerical', 'codes', 'we', 'study', 'this', 'transition', 'region', 'for', 'different', 'equatorial', 'models', 'of', 'btype', 'stars', 'in', 'all', 'the', 'cases', 'at', 'certain', 'range', 'of', 'rotational', 'speeds', 'we', 'found', 'a', 'region', 'where', 'the', 'fast', 'and', 'omegaslow', 'solution', 'can', 'coexist', 'we', 'find', 'that', 'the', 'type', 'of', 'solution', 'obtained', 'in', 'this', 'coexistence', 'region', 'depends', 'heavily', 'on', 'the', 'initial', 'conditions', 'of', 'our', 'models', 'we', 'also', 'test', 'the', 'stability', 'of', 'the', 'solutions', 'within', 'the', 'coexistence', 'region', 'by', 'performing', 'base', 'density', 'perturbations', 'in', 'the', 'wind', 'we', 'find', 'that', 'under', 'certain', 'conditions', 'the', 'fast', 'solution', 'can', 'switch', 'to', 'a', 'omegaslow', 'solution', 'or', 'vice', 'versa', 'such', 'solution', 'switching', 'may', 'be', 'a', 'possible', 'contributor', 'of', 'material', 'injected', 'into', 'the', 'circumstellar', 'environment', 'of', 'be', 'stars', 'without', 'requiring', 'rotational', 'speeds', 'near', 'critical', 'values']]
|
[-0.1482770230877213, 0.1359838331490755, -0.04408971666125581, 0.04779265455261338, -0.057458354207919914, -0.1198933903989382, 0.07140194673818769, 0.3633163698669523, -0.2459825510822702, -0.28936258983798324, 0.1348799663496902, -0.2351795654511079, -0.10523606383940205, 0.1911665795429144, -0.03192072095538606, -0.008677465619330178, 0.06160304491757415, -0.003636393202468753, -0.08419556966167875, -0.15265520310145803, 0.3049031696957536, 0.03132053661858663, 0.23834934620419518, -0.0023279014011495748, 0.06109424562426284, -0.118641039817594, 0.044508416540920734, 0.035985248894494365, -0.13832583905350476, 0.028963413670171575, 0.20918498443741554, 0.14927669439464808, 0.2401114693353884, -0.44008323380257935, -0.231847407608293, 0.08225343892117962, 0.2086078102188185, 0.11429106215015054, -0.0774106486702658, -0.2413467564873281, 0.10236908613471314, -0.18308906153659335, -0.18330195891219772, -0.05773716735653579, 0.012502217756118626, 0.05129922860476654, -0.27899186660302805, 0.07821929717421881, 0.036921032250393185, 0.027916844050050713, -0.13646962868981063, -0.051196440175408496, -0.05268827409599908, 0.07809899146741373, 0.08286771789542399, 0.04040979880373925, 0.12440315037732944, -0.16874660025699995, 0.004876156253740192, 0.3909647837211378, -0.08241619971340697, -0.1721439552679658, 0.2364947623980697, -0.19139915799722076, -0.09953747142106295, 0.15646992177469657, 0.17491578903514893, 0.19357042634510435, -0.1311861331100954, 0.017541837975441014, -0.004782454788801261, 0.165651410514256, 0.0774570029519964, 0.011953281364403665, 0.2506551470118575, 0.13722821264062077, 0.057830341776716525, 0.13350729197321926, -0.1296902157065051, -0.12306907258491265, -0.24636603833641857, -0.11708608528657351, -0.11078688925190364, 0.03449933698168024, -0.1400767007793911, -0.1331188701512292, 0.38208055982366207, 0.13171796121576335, 0.18861297460505738, 0.007209455172996968, 0.27140187109354885, 0.13859952651255297, 0.038944026838289576, 0.1794299747631885, 0.29543987998738885, 0.08985030185547657, 0.11574560092063621, -0.22785830688895659, 0.08855620177462697, 0.04149122950737365]
|
1,803.07573
|
Numerical Problems in Coupling Photon Momentum (Radiation Pressure) to
Gas
|
Radiation pressure (RP; or photon momentum absorbed by gas) is important in a
tremendous range of astrophysical systems. But we show the usual method for
assigning absorbed photon momentum to gas in numerical radiation-hydrodynamics
simulations (integrating over cell volumes or evaluating at cell centers) can
severely under-estimate the RP force in the immediate vicinity around
un-resolved (point/discrete) sources (and subsequently under-estimate its
effects on bulk gas properties), unless photon mean-free-paths are
highly-resolved in the fluid grid. The existence of this error is independent
of the numerical radiation transfer (RT) method (even in exact
ray-tracing/Monte-Carlo methods), because it depends on how the RT solution is
interpolated back onto fluid elements. Brute-force convergence (resolving
mean-free paths) is impossible in many cases (especially where UV/ionizing
photons are involved). Instead, we show a 'face-integrated' method --
integrating and applying the momentum fluxes at interfaces between fluid
elements -- better approximates the correct solution at all resolution levels.
The 'fix' is simple and we provide example implementations for ray-tracing,
Monte-Carlo, and moments RT methods in both grid and mesh-free fluid schemes.
We consider an example of star formation in a molecular cloud with UV/ionizing
RP. At state-of-the-art resolution, cell-integrated methods under-estimate the
net effects of RP by an order of magnitude, leading (incorrectly) to the
conclusion that RP is unimportant, while face-integrated methods predict strong
self-regulation of star formation and cloud destruction via RP.
|
astro-ph.GA astro-ph.CO astro-ph.HE astro-ph.IM astro-ph.SR
|
radiation pressure rp or photon momentum absorbed by gas is important in a tremendous range of astrophysical systems but we show the usual method for assigning absorbed photon momentum to gas in numerical radiationhydrodynamics simulations integrating over cell volumes or evaluating at cell centers can severely underestimate the rp force in the immediate vicinity around unresolved pointdiscrete sources and subsequently underestimate its effects on bulk gas properties unless photon meanfreepaths are highlyresolved in the fluid grid the existence of this error is independent of the numerical radiation transfer rt method even in exact raytracingmontecarlo methods because it depends on how the rt solution is interpolated back onto fluid elements bruteforce convergence resolving meanfree paths is impossible in many cases especially where uvionizing photons are involved instead we show a faceintegrated method integrating and applying the momentum fluxes at interfaces between fluid elements better approximates the correct solution at all resolution levels the fix is simple and we provide example implementations for raytracing montecarlo and moments rt methods in both grid and meshfree fluid schemes we consider an example of star formation in a molecular cloud with uvionizing rp at stateoftheart resolution cellintegrated methods underestimate the net effects of rp by an order of magnitude leading incorrectly to the conclusion that rp is unimportant while faceintegrated methods predict strong selfregulation of star formation and cloud destruction via rp
|
[['radiation', 'pressure', 'rp', 'or', 'photon', 'momentum', 'absorbed', 'by', 'gas', 'is', 'important', 'in', 'a', 'tremendous', 'range', 'of', 'astrophysical', 'systems', 'but', 'we', 'show', 'the', 'usual', 'method', 'for', 'assigning', 'absorbed', 'photon', 'momentum', 'to', 'gas', 'in', 'numerical', 'radiationhydrodynamics', 'simulations', 'integrating', 'over', 'cell', 'volumes', 'or', 'evaluating', 'at', 'cell', 'centers', 'can', 'severely', 'underestimate', 'the', 'rp', 'force', 'in', 'the', 'immediate', 'vicinity', 'around', 'unresolved', 'pointdiscrete', 'sources', 'and', 'subsequently', 'underestimate', 'its', 'effects', 'on', 'bulk', 'gas', 'properties', 'unless', 'photon', 'meanfreepaths', 'are', 'highlyresolved', 'in', 'the', 'fluid', 'grid', 'the', 'existence', 'of', 'this', 'error', 'is', 'independent', 'of', 'the', 'numerical', 'radiation', 'transfer', 'rt', 'method', 'even', 'in', 'exact', 'raytracingmontecarlo', 'methods', 'because', 'it', 'depends', 'on', 'how', 'the', 'rt', 'solution', 'is', 'interpolated', 'back', 'onto', 'fluid', 'elements', 'bruteforce', 'convergence', 'resolving', 'meanfree', 'paths', 'is', 'impossible', 'in', 'many', 'cases', 'especially', 'where', 'uvionizing', 'photons', 'are', 'involved', 'instead', 'we', 'show', 'a', 'faceintegrated', 'method', 'integrating', 'and', 'applying', 'the', 'momentum', 'fluxes', 'at', 'interfaces', 'between', 'fluid', 'elements', 'better', 'approximates', 'the', 'correct', 'solution', 'at', 'all', 'resolution', 'levels', 'the', 'fix', 'is', 'simple', 'and', 'we', 'provide', 'example', 'implementations', 'for', 'raytracing', 'montecarlo', 'and', 'moments', 'rt', 'methods', 'in', 'both', 'grid', 'and', 'meshfree', 'fluid', 'schemes', 'we', 'consider', 'an', 'example', 'of', 'star', 'formation', 'in', 'a', 'molecular', 'cloud', 'with', 'uvionizing', 'rp', 'at', 'stateoftheart', 'resolution', 'cellintegrated', 'methods', 'underestimate', 'the', 'net', 'effects', 'of', 'rp', 'by', 'an', 'order', 'of', 'magnitude', 'leading', 'incorrectly', 'to', 'the', 'conclusion', 'that', 'rp', 'is', 'unimportant', 'while', 'faceintegrated', 'methods', 'predict', 'strong', 'selfregulation', 'of', 'star', 'formation', 'and', 'cloud', 'destruction', 'via', 'rp']]
|
[-0.08276396367105295, 0.09083423922837372, -0.058020152394903136, 0.06549689908321057, -0.01442581813190938, -0.09272138646777314, 0.049813894789900864, 0.39766430341311404, -0.23550878673464665, -0.3150217892971259, 0.06694194433480702, -0.2941479736504875, -0.04754674990204171, 0.19589841919206502, -0.02774716954393027, 0.012809203517872857, 0.063557067234174, -0.045315984505840144, -0.058917476028426306, -0.21929264383659036, 0.2897950614522841, 0.10338886470642981, 0.24284703068347094, 0.05467526688081053, 0.09184954961266804, -0.022779910493776336, -0.048954188594015666, 0.031121580031451542, -0.12405263709008871, 0.05372796269125297, 0.22225758607021054, 0.06885971758340413, 0.2529424940081741, -0.44380964511199983, -0.23253280928291314, 0.07383473470664441, 0.18721974136618277, 0.11338235016887051, -0.05326636818233407, -0.1768056300934404, 0.08435085720093166, -0.18090344901691685, -0.1257662397017755, -0.060098428139672824, 0.024326408372380193, 0.02606894057123452, -0.2894906401277629, 0.1202156989298224, 0.014442407702796397, 0.03362414505865492, -0.06992812511282512, -0.10102174711793342, -0.034570286797175, 0.09170502591469148, 0.02921590307855408, 0.032830784645829315, 0.19051039908479833, -0.1496730877282119, -0.05661145208806202, 0.41985111336039194, -0.03355807849302519, -0.19529416296329047, 0.20527225239873603, -0.16435650349091235, -0.08025437945432894, 0.21422154834569507, 0.15955754513653028, 0.1344684731225202, -0.09829369969749907, 0.05996032952182079, 0.022314940176763665, 0.1599136644246493, 0.08588939785185429, -0.0004340522809306512, 0.24634604909465657, 0.15037291075117667, 0.023602036827166255, 0.0797714946145477, -0.10834864094047933, -0.10913487785885967, -0.23871024677882324, -0.1441565710754419, -0.1847273820915746, 0.05292265631493416, -0.10853141892938938, -0.1300819434814453, 0.30183673217401813, 0.17457054416451873, 0.15262416609235713, 0.0012598917809071707, 0.3634534207852306, 0.12375706360362856, 0.0515985811833997, 0.11347877471770688, 0.2245696807644112, 0.11522593748806095, 0.07591824718648232, -0.2598417566471465, 0.06866433313389116, 0.05964777061740893]
|
1,803.07574
|
Water Residence Time Estimation by 1D Deconvolution in the Form of a
l2-Regularized Inverse Problem With Smoothness, Positivity and Causality
Constraints
|
The Water Residence Time distribution is the equivalent of the impulse
response of a linear system allowing the propagation of water through a medium,
e.g. the propagation of rain water from the top of the mountain towards the
aquifers. We consider the output aquifer levels as the convolution between the
input rain levels and the Water Residence Time, starting with an initial
aquifer base level. The estimation of Water Residence Time is important for a
better understanding of hydro-bio-geochemical processes and mixing properties
of wetlands used as filters in ecological applications, as well as protecting
fresh water sources for wells from pollutants. Common methods of estimating the
Water Residence Time focus on cross-correlation, parameter fitting and
non-parametric deconvolution methods. Here we propose a 1D full-deconvolution,
regularized, non-parametric inverse problem algorithm that enforces smoothness
and uses constraints of causality and positivity to estimate the Water
Residence Time curve. Compared to Bayesian non-parametric deconvolution
approaches, it has a fast runtime per test case; compared to the popular and
fast cross-correlation method, it produces a more precise Water Residence Time
curve even in the case of noisy measurements. The algorithm needs only one
regularization parameter to balance between smoothness of the Water Residence
Time and accuracy of the reconstruction. We propose an approach on how to
automatically find a suitable value of the regularization parameter from the
input data only. Tests on real data illustrate the potential of this method to
analyze hydrological datasets.
|
eess.SP
|
the water residence time distribution is the equivalent of the impulse response of a linear system allowing the propagation of water through a medium eg the propagation of rain water from the top of the mountain towards the aquifers we consider the output aquifer levels as the convolution between the input rain levels and the water residence time starting with an initial aquifer base level the estimation of water residence time is important for a better understanding of hydrobiogeochemical processes and mixing properties of wetlands used as filters in ecological applications as well as protecting fresh water sources for wells from pollutants common methods of estimating the water residence time focus on crosscorrelation parameter fitting and nonparametric deconvolution methods here we propose a 1d fulldeconvolution regularized nonparametric inverse problem algorithm that enforces smoothness and uses constraints of causality and positivity to estimate the water residence time curve compared to bayesian nonparametric deconvolution approaches it has a fast runtime per test case compared to the popular and fast crosscorrelation method it produces a more precise water residence time curve even in the case of noisy measurements the algorithm needs only one regularization parameter to balance between smoothness of the water residence time and accuracy of the reconstruction we propose an approach on how to automatically find a suitable value of the regularization parameter from the input data only tests on real data illustrate the potential of this method to analyze hydrological datasets
|
[['the', 'water', 'residence', 'time', 'distribution', 'is', 'the', 'equivalent', 'of', 'the', 'impulse', 'response', 'of', 'a', 'linear', 'system', 'allowing', 'the', 'propagation', 'of', 'water', 'through', 'a', 'medium', 'eg', 'the', 'propagation', 'of', 'rain', 'water', 'from', 'the', 'top', 'of', 'the', 'mountain', 'towards', 'the', 'aquifers', 'we', 'consider', 'the', 'output', 'aquifer', 'levels', 'as', 'the', 'convolution', 'between', 'the', 'input', 'rain', 'levels', 'and', 'the', 'water', 'residence', 'time', 'starting', 'with', 'an', 'initial', 'aquifer', 'base', 'level', 'the', 'estimation', 'of', 'water', 'residence', 'time', 'is', 'important', 'for', 'a', 'better', 'understanding', 'of', 'hydrobiogeochemical', 'processes', 'and', 'mixing', 'properties', 'of', 'wetlands', 'used', 'as', 'filters', 'in', 'ecological', 'applications', 'as', 'well', 'as', 'protecting', 'fresh', 'water', 'sources', 'for', 'wells', 'from', 'pollutants', 'common', 'methods', 'of', 'estimating', 'the', 'water', 'residence', 'time', 'focus', 'on', 'crosscorrelation', 'parameter', 'fitting', 'and', 'nonparametric', 'deconvolution', 'methods', 'here', 'we', 'propose', 'a', '1d', 'fulldeconvolution', 'regularized', 'nonparametric', 'inverse', 'problem', 'algorithm', 'that', 'enforces', 'smoothness', 'and', 'uses', 'constraints', 'of', 'causality', 'and', 'positivity', 'to', 'estimate', 'the', 'water', 'residence', 'time', 'curve', 'compared', 'to', 'bayesian', 'nonparametric', 'deconvolution', 'approaches', 'it', 'has', 'a', 'fast', 'runtime', 'per', 'test', 'case', 'compared', 'to', 'the', 'popular', 'and', 'fast', 'crosscorrelation', 'method', 'it', 'produces', 'a', 'more', 'precise', 'water', 'residence', 'time', 'curve', 'even', 'in', 'the', 'case', 'of', 'noisy', 'measurements', 'the', 'algorithm', 'needs', 'only', 'one', 'regularization', 'parameter', 'to', 'balance', 'between', 'smoothness', 'of', 'the', 'water', 'residence', 'time', 'and', 'accuracy', 'of', 'the', 'reconstruction', 'we', 'propose', 'an', 'approach', 'on', 'how', 'to', 'automatically', 'find', 'a', 'suitable', 'value', 'of', 'the', 'regularization', 'parameter', 'from', 'the', 'input', 'data', 'only', 'tests', 'on', 'real', 'data', 'illustrate', 'the', 'potential', 'of', 'this', 'method', 'to', 'analyze', 'hydrological', 'datasets']]
|
[-0.05779591696210221, 0.05021004858010285, -0.09634880218888676, 0.08912472841700064, -0.03575486595309865, -0.12948440871236527, 0.07480974069886127, 0.37675799355768136, -0.27968421417666467, -0.32018417650132314, 0.14103167969051547, -0.2570731413909176, -0.12391874565821819, 0.18183334462956435, -0.05686146424955326, 0.11288784059723177, 0.0651897563906893, 0.006621830131289662, -0.04902934200991584, -0.21961931831974957, 0.25707857902882675, 0.09302979064754612, 0.28828988957440943, 0.04454983633292145, 0.14758531431468772, -0.0006418121427250831, -0.050949590483282896, -0.028429163210717454, -0.0924939505979538, 0.08551283361084339, 0.23135072735922946, 0.13781747928621815, 0.30573601044215665, -0.44507227074569206, -0.26951037780537607, 0.10464616338274282, 0.09395144594107242, 0.0904165439154377, -0.014620312751442774, -0.273771205162006, -0.018461718708159845, -0.10702775656167714, -0.08966582845974418, -0.03502499106803823, -0.0038566580003275533, 0.04067269621259108, -0.2870725293791849, 0.12964176517214956, 0.001965822572586084, 0.05930379174053513, -0.07239585907381636, -0.12738494644921552, -0.03609697801298676, 0.14766266231257547, 0.07078579096596666, -0.009495816269872913, 0.17129454552098547, -0.14033426062465026, -0.03509212971789661, 0.3967527645799842, -0.1256634401019651, -0.20299243060365382, 0.201553614658136, -0.11318033290651888, -0.10361374452199677, 0.15201856482508067, 0.2370582547927252, 0.11679950490434143, -0.16130815541847107, 0.016794342769526148, -0.030934061120540902, 0.1864952661270455, 0.07287630593895164, -0.026204251526430185, 0.14984322440806605, 0.22954172065489337, 0.11751896563613452, 0.13102086672167756, -0.18924691115209352, -0.06257123315354193, -0.2527520616624551, -0.17607969645738103, -0.182206609854197, -0.009933535759822512, -0.12511725430860268, -0.17527633987607777, 0.42476334340995076, 0.18971289311258988, 0.16238887558172937, 0.097447082337974, 0.3442066417516026, 0.09503994652929337, 0.030435574909761766, 0.07435883088699818, 0.1700255727048605, 0.09729765736688879, 0.1391070731077733, -0.21076780837516312, 0.1383157761457715, 0.042458163518809315]
|
1,803.07575
|
Light axions with large hadronic couplings
|
We present models in which axions have large couplings to hadrons while
remaining naturally light. By assigning $U(1)_{PQ}$ charges to Standard Model
quarks such that $U(1)_{PQ}$ is not anomalous under QCD, the derivative
couplings naturally arise while no potential is generated for the axion upon
QCD confinement. We present simple models that implement this idea both for an
axion-like particle and for the QCD axion. We show that both models lead to
sizable flavor violations that could be probed by future experiments. Our
construction shows that the axion coupling to hadrons can be essentially
independent from its mass and thus motivates experimental searches in a wide
range of axion parameter space.
|
hep-ph
|
we present models in which axions have large couplings to hadrons while remaining naturally light by assigning u1_pq charges to standard model quarks such that u1_pq is not anomalous under qcd the derivative couplings naturally arise while no potential is generated for the axion upon qcd confinement we present simple models that implement this idea both for an axionlike particle and for the qcd axion we show that both models lead to sizable flavor violations that could be probed by future experiments our construction shows that the axion coupling to hadrons can be essentially independent from its mass and thus motivates experimental searches in a wide range of axion parameter space
|
[['we', 'present', 'models', 'in', 'which', 'axions', 'have', 'large', 'couplings', 'to', 'hadrons', 'while', 'remaining', 'naturally', 'light', 'by', 'assigning', 'u1_pq', 'charges', 'to', 'standard', 'model', 'quarks', 'such', 'that', 'u1_pq', 'is', 'not', 'anomalous', 'under', 'qcd', 'the', 'derivative', 'couplings', 'naturally', 'arise', 'while', 'no', 'potential', 'is', 'generated', 'for', 'the', 'axion', 'upon', 'qcd', 'confinement', 'we', 'present', 'simple', 'models', 'that', 'implement', 'this', 'idea', 'both', 'for', 'an', 'axionlike', 'particle', 'and', 'for', 'the', 'qcd', 'axion', 'we', 'show', 'that', 'both', 'models', 'lead', 'to', 'sizable', 'flavor', 'violations', 'that', 'could', 'be', 'probed', 'by', 'future', 'experiments', 'our', 'construction', 'shows', 'that', 'the', 'axion', 'coupling', 'to', 'hadrons', 'can', 'be', 'essentially', 'independent', 'from', 'its', 'mass', 'and', 'thus', 'motivates', 'experimental', 'searches', 'in', 'a', 'wide', 'range', 'of', 'axion', 'parameter', 'space']]
|
[-0.09273789261744635, 0.28363488449807894, -0.09070972000303267, 0.1159186503935924, -0.12448971361123226, -0.11971121987009102, 0.05239901252548202, 0.36333584022364235, -0.22139209715297092, -0.31808232962833466, 0.04533624208767202, -0.2256583463534847, -0.0764111969410232, 0.18047380660815784, 0.016134579452006397, 0.04293200462848905, 0.05020811263606086, -0.028329425399099384, -0.03278019929699063, -0.21996515331924096, 0.28676747002949315, 0.021018505289412296, 0.20832005067023676, 0.14346545305981948, 0.06502590049477713, -0.03837630118302128, 0.01753993430971965, -0.01735027427685464, -0.0695193179976536, 0.0517268348988649, 0.19644013588205436, 0.08560995204705349, 0.11801628076244851, -0.3938640856460945, -0.246489308528793, 0.19592080867706654, 0.16224462258721795, 0.13863207195017085, -0.1089523430234073, -0.3112965869541104, 0.0991364851408336, -0.2000011564085579, -0.10378748292590047, -0.17031106957956008, -0.046429362005411506, -0.058570004497268784, -0.33681199275510937, 0.04694096948364162, -0.01711820771179355, -0.06374652451323765, -0.026294914431878372, -0.1449587130835196, 0.008377238313105327, 0.00623388416846996, 0.15475311985570803, 0.07245170415970623, 0.14863121513327635, -0.1940786406074793, -0.16596375924308557, 0.45344690773384394, -0.11203521274886019, -0.19637479498848184, 0.17193020680533336, -0.13885989427767895, -0.1707732627998937, 0.10740935150197975, 0.17192075673390078, 0.07046945089986129, -0.15735956650176966, 0.15514808673273167, -0.05236051665400868, 0.1977732851010588, 0.026872490593525873, 0.06137193448166153, 0.32823227532207966, 0.15995188872959162, 0.038229227504432875, 0.048134977241290046, -0.00747675947039514, -0.11270877072243607, -0.3766772880277655, -0.09101908008996942, -0.1254127558324956, 0.04289779052998858, -0.11747914921835291, -0.11861287276386409, 0.3695508535439568, 0.20963605962429396, 0.2322891594061779, 0.021520349944874576, 0.2661008569286079, 0.08223776542057225, 0.12712852419920367, 0.02612759325200239, 0.3281728461602921, 0.07665658662901134, 0.10452654183137457, -0.2360380101416193, -0.039288747367692424, 0.05227411877199261]
|
1,803.07576
|
Quasinormal modes as a distinguisher between general relativity and f(R)
gravity: Charged black-holes
|
The ring-down phase of black-hole perturbations is governed by the
Quasi-Normal modes (QNM) and offer valuable insight into the nature of the
objects emitting them. In General relativity, we identify a dimensionless
parameter that can estimate the charge of a black-hole from the energetics of
quasi-normal modes. We then extend the analysis for f(R) theories of gravity.
Using Isaacson's prescription to modified theories of gravity, we obtain an
accurate and robust method to estimate the difference in the radiated energies
in the scalar and vector modes due to modifications to general relativity. We
then discuss how to quantify the deviation from general relativity.
|
gr-qc astro-ph.CO hep-th
|
the ringdown phase of blackhole perturbations is governed by the quasinormal modes qnm and offer valuable insight into the nature of the objects emitting them in general relativity we identify a dimensionless parameter that can estimate the charge of a blackhole from the energetics of quasinormal modes we then extend the analysis for fr theories of gravity using isaacsons prescription to modified theories of gravity we obtain an accurate and robust method to estimate the difference in the radiated energies in the scalar and vector modes due to modifications to general relativity we then discuss how to quantify the deviation from general relativity
|
[['the', 'ringdown', 'phase', 'of', 'blackhole', 'perturbations', 'is', 'governed', 'by', 'the', 'quasinormal', 'modes', 'qnm', 'and', 'offer', 'valuable', 'insight', 'into', 'the', 'nature', 'of', 'the', 'objects', 'emitting', 'them', 'in', 'general', 'relativity', 'we', 'identify', 'a', 'dimensionless', 'parameter', 'that', 'can', 'estimate', 'the', 'charge', 'of', 'a', 'blackhole', 'from', 'the', 'energetics', 'of', 'quasinormal', 'modes', 'we', 'then', 'extend', 'the', 'analysis', 'for', 'fr', 'theories', 'of', 'gravity', 'using', 'isaacsons', 'prescription', 'to', 'modified', 'theories', 'of', 'gravity', 'we', 'obtain', 'an', 'accurate', 'and', 'robust', 'method', 'to', 'estimate', 'the', 'difference', 'in', 'the', 'radiated', 'energies', 'in', 'the', 'scalar', 'and', 'vector', 'modes', 'due', 'to', 'modifications', 'to', 'general', 'relativity', 'we', 'then', 'discuss', 'how', 'to', 'quantify', 'the', 'deviation', 'from', 'general', 'relativity']]
|
[-0.1076826140899392, 0.10932837754560892, -0.14171748289169328, 0.140298282837233, -0.1286963137336871, -0.1222388855841698, 0.007060604130406186, 0.2661639822203919, -0.19062957584912193, -0.28548880243330327, 0.03598714980762452, -0.26481412697438766, -0.14639110976798478, 0.20061802393892436, -0.04222343122423852, 0.023345703573318794, -0.0007846772498948481, 0.011213777500919057, -0.09340379712877125, -0.14534229307675064, 0.3559309132668434, 0.08854375948713532, 0.21295221381395765, 0.0013200485088763017, 0.06168338199354057, -0.021663705192198887, -0.01954407127375163, 0.03521693530447275, -0.19053683906277355, 0.10318903554484103, 0.23325056621838175, 0.14981388300657272, 0.22197779364492834, -0.4201485376027458, -0.2200536476267339, 0.06301220984749713, 0.1335683623475737, 0.19837884019011431, -0.02410585159273113, -0.28297117551182877, 0.06789658802478954, -0.18328390905217637, -0.15743434580621643, -0.1023135861219133, 0.04032328294915626, -0.05397927797245748, -0.2593838516328918, 0.11940620194451468, 0.01259473438184817, -0.06846330160257018, -0.10511605371042941, -0.0363698340794162, -0.02211027100537587, 0.10253113619440678, 0.15502322385725067, -0.0008028102496150628, 0.1500555756637483, -0.10536210468599519, -0.08753242878609527, 0.41888413675925107, -0.09871066231461405, -0.2338222853423467, 0.14993977299846203, -0.20999307088210312, -0.10917565759126711, 0.09490371170426601, 0.20982251668041482, 0.17698582781261754, -0.12721226835460628, 0.07936530322055739, 0.07414242457960127, 0.17728374855032245, 0.07728953717403042, 0.0824589513381265, 0.31837216359608383, 0.07351300801213795, -0.029248987889658767, 0.15446864788248701, -0.06137133525595186, -0.06091628419868286, -0.33713239752371044, -0.14376640658996867, -0.1378157015898925, 0.053491326289712586, -0.14942589393114442, -0.13821269268423175, 0.43311534829220727, 0.1689033800949686, 0.11703772228030325, 0.07296917303600936, 0.27108557125354565, 0.12099115279711133, 0.02048904304076167, 0.07713005136137882, 0.376626278483987, 0.18975649855678303, 0.07231684903008412, -0.27698246363405754, -0.07343511088091192, 0.07428276610280414]
|
1,803.07577
|
Stellar Population Properties of Ultracompact Dwarfs in M87: a
Mass-metallicity Correlation Connecting Low-metallicity Globular Clusters and
Compact Ellipticals
|
We derive stellar population parameters for a representative sample of
ultracompact dwarfs (UCDs) and a large sample of massive globular clusters
(GCs) with stellar masses $\gtrsim$ 10$^{6}$ $M_{\odot}$ in the central galaxy
M87 of the Virgo galaxy cluster, based on model fitting to the Lick-index
measurements from both the literature and new observations. After necessary
spectral stacking of the relatively faint objects in our initial sample of 40
UCDs and 118 GCs, we obtain 30 sets of Lick-index measurements for UCDs and 80
for GCs. The M87 UCDs have ages $\gtrsim$ 8 Gyr and [$\alpha$/Fe] $\simeq$ 0.4
dex, in agreement with previous studies based on smaller samples. The
literature UCDs, located in lower-density environments than M87, extend to
younger ages and smaller [$\alpha$/Fe] (at given metallicities) than M87 UCDs,
resembling the environmental dependence of the Virgo dE nuclei. The UCDs
exhibit a positive mass-metallicity relation (MZR), which flattens and connects
compact ellipticals at stellar masses $\gtrsim$ 10$^{8}$ $M_{\odot}$. The Virgo
dE nuclei largely follow the average MZR of UCDs, whereas most of the M87 GCs
are offset towards higher metallicities for given stellar masses. The
difference between the mass-metallicity distributions of UCDs and GCs may be
qualitatively understood as a result of their different physical sizes at birth
in a self-enrichment scenario or of galactic nuclear cluster star formation
efficiency being relatively low in a tidal stripping scenario for UCD
formation. The existing observations provide the necessary but not sufficient
evidence for tidally stripped dE nuclei being the dominant contributors to the
M87 UCDs.
|
astro-ph.GA astro-ph.CO
|
we derive stellar population parameters for a representative sample of ultracompact dwarfs ucds and a large sample of massive globular clusters gcs with stellar masses gtrsim 106 m_odot in the central galaxy m87 of the virgo galaxy cluster based on model fitting to the lickindex measurements from both the literature and new observations after necessary spectral stacking of the relatively faint objects in our initial sample of 40 ucds and 118 gcs we obtain 30 sets of lickindex measurements for ucds and 80 for gcs the m87 ucds have ages gtrsim 8 gyr and alphafe simeq 04 dex in agreement with previous studies based on smaller samples the literature ucds located in lowerdensity environments than m87 extend to younger ages and smaller alphafe at given metallicities than m87 ucds resembling the environmental dependence of the virgo de nuclei the ucds exhibit a positive massmetallicity relation mzr which flattens and connects compact ellipticals at stellar masses gtrsim 108 m_odot the virgo de nuclei largely follow the average mzr of ucds whereas most of the m87 gcs are offset towards higher metallicities for given stellar masses the difference between the massmetallicity distributions of ucds and gcs may be qualitatively understood as a result of their different physical sizes at birth in a selfenrichment scenario or of galactic nuclear cluster star formation efficiency being relatively low in a tidal stripping scenario for ucd formation the existing observations provide the necessary but not sufficient evidence for tidally stripped de nuclei being the dominant contributors to the m87 ucds
|
[['we', 'derive', 'stellar', 'population', 'parameters', 'for', 'a', 'representative', 'sample', 'of', 'ultracompact', 'dwarfs', 'ucds', 'and', 'a', 'large', 'sample', 'of', 'massive', 'globular', 'clusters', 'gcs', 'with', 'stellar', 'masses', 'gtrsim', '106', 'm_odot', 'in', 'the', 'central', 'galaxy', 'm87', 'of', 'the', 'virgo', 'galaxy', 'cluster', 'based', 'on', 'model', 'fitting', 'to', 'the', 'lickindex', 'measurements', 'from', 'both', 'the', 'literature', 'and', 'new', 'observations', 'after', 'necessary', 'spectral', 'stacking', 'of', 'the', 'relatively', 'faint', 'objects', 'in', 'our', 'initial', 'sample', 'of', '40', 'ucds', 'and', '118', 'gcs', 'we', 'obtain', '30', 'sets', 'of', 'lickindex', 'measurements', 'for', 'ucds', 'and', '80', 'for', 'gcs', 'the', 'm87', 'ucds', 'have', 'ages', 'gtrsim', '8', 'gyr', 'and', 'alphafe', 'simeq', '04', 'dex', 'in', 'agreement', 'with', 'previous', 'studies', 'based', 'on', 'smaller', 'samples', 'the', 'literature', 'ucds', 'located', 'in', 'lowerdensity', 'environments', 'than', 'm87', 'extend', 'to', 'younger', 'ages', 'and', 'smaller', 'alphafe', 'at', 'given', 'metallicities', 'than', 'm87', 'ucds', 'resembling', 'the', 'environmental', 'dependence', 'of', 'the', 'virgo', 'de', 'nuclei', 'the', 'ucds', 'exhibit', 'a', 'positive', 'massmetallicity', 'relation', 'mzr', 'which', 'flattens', 'and', 'connects', 'compact', 'ellipticals', 'at', 'stellar', 'masses', 'gtrsim', '108', 'm_odot', 'the', 'virgo', 'de', 'nuclei', 'largely', 'follow', 'the', 'average', 'mzr', 'of', 'ucds', 'whereas', 'most', 'of', 'the', 'm87', 'gcs', 'are', 'offset', 'towards', 'higher', 'metallicities', 'for', 'given', 'stellar', 'masses', 'the', 'difference', 'between', 'the', 'massmetallicity', 'distributions', 'of', 'ucds', 'and', 'gcs', 'may', 'be', 'qualitatively', 'understood', 'as', 'a', 'result', 'of', 'their', 'different', 'physical', 'sizes', 'at', 'birth', 'in', 'a', 'selfenrichment', 'scenario', 'or', 'of', 'galactic', 'nuclear', 'cluster', 'star', 'formation', 'efficiency', 'being', 'relatively', 'low', 'in', 'a', 'tidal', 'stripping', 'scenario', 'for', 'ucd', 'formation', 'the', 'existing', 'observations', 'provide', 'the', 'necessary', 'but', 'not', 'sufficient', 'evidence', 'for', 'tidally', 'stripped', 'de', 'nuclei', 'being', 'the', 'dominant', 'contributors', 'to', 'the', 'm87', 'ucds']]
|
[-0.0374000019450694, 0.13165097410871288, -0.09608822955940594, 0.19691269896836497, -0.1182933794142033, -0.01927367387216641, 0.06881034421536514, 0.4395603404974374, -0.020876592374865083, -0.4219378812617153, -0.04747686986573128, -0.2723959202577514, 0.0391875384260871, 0.22687690300334384, -0.056171410020160836, -0.07655987064684118, 0.07368827315150965, -0.11729198926406652, -0.07216324720611451, -0.331490545918593, 0.29909729864081647, 0.034827263424480996, 0.13101859883896597, -0.1215345795123332, 0.03287579592818753, -0.13999941976425626, -0.03176267440641651, -0.06373500286080823, -0.19254256361054153, -0.005130981438652077, 0.28872233839599254, 0.12579117845157234, 0.23851363402681322, -0.3213464020693037, -0.15854092967956818, 0.06533633695647678, 0.2787920438233528, 0.014853973459547722, -0.16879624457146208, -0.3024900275443893, 0.11602694075921272, -0.23254571610504365, -0.21129804297201848, 0.15197203935061648, 0.06655711987180503, 0.034334197801750475, -0.18323471213876102, 0.2625812559249246, 0.011174266972747727, 0.11090280727197335, -0.18313215035160518, -0.17277307606643197, -0.07475197937717207, 0.04635578697440985, -0.00849146164603546, 0.0711027750462169, 0.2437175650050585, -0.07169353216244861, 0.027395860234268127, 0.4017854682041523, -0.005916889097498487, 0.07447293769993533, 0.26963692019678887, -0.2498423305695774, -0.22267819273351566, 0.03743980075489348, 0.15622497048718473, 0.10159022731735833, -0.18760292099671452, -0.010681167564709583, -0.0011710856406854128, 0.22089798551320472, 0.0658385292865248, 0.08349152304564753, 0.3476342519206237, 0.1253706914919069, 0.07657715133079658, -0.014254518281796757, -0.19945961861196523, -0.02678556249322971, -0.1710816694347474, -0.051873656651591805, -0.10286905038845176, 0.07170024823392127, -0.24216616107655073, -0.09262024759182956, 0.2836972018117158, 0.08101552074424938, 0.25293403726500113, 0.12899669085667784, 0.286768657784161, 0.040337085374401824, 0.18220978871438887, 0.16418149961088968, 0.313626721956241, 0.24437758000842552, 0.037935083677467896, -0.24495495206036597, 0.07879845251871903, -0.050820976977903894]
|
1,803.07578
|
Toward a compact fibered squeezing parametric source
|
In this work, we investigate three different compact fibered systems
generating vacuum squeezing that involve optical cavities limited by the end
surface of a fiber and by a curved mirror and containing a thin parametric
crystal. These systems have the advantage to couple squeezed states directly to
a fiber, allowing the user to benefit from the flexibility of fibers in the use
of squeezing. Three types of fibers are investigated: standard single-mode
fibers, photonic-crystal large mode area single-mode fibers and short
multi-mode fiber taped to a single-mode fiber. The observed squeezing is modest
(-0.56 dB, -0.9 dB, -1 dB), but these experiments open the way to miniaturized
squeezing devices that could be a very interesting advantage in scaling up
quantum systems for quantum processing, opening new perspectives in the domain
of integrated quantum optics.
|
quant-ph
|
in this work we investigate three different compact fibered systems generating vacuum squeezing that involve optical cavities limited by the end surface of a fiber and by a curved mirror and containing a thin parametric crystal these systems have the advantage to couple squeezed states directly to a fiber allowing the user to benefit from the flexibility of fibers in the use of squeezing three types of fibers are investigated standard singlemode fibers photoniccrystal large mode area singlemode fibers and short multimode fiber taped to a singlemode fiber the observed squeezing is modest 056 db 09 db 1 db but these experiments open the way to miniaturized squeezing devices that could be a very interesting advantage in scaling up quantum systems for quantum processing opening new perspectives in the domain of integrated quantum optics
|
[['in', 'this', 'work', 'we', 'investigate', 'three', 'different', 'compact', 'fibered', 'systems', 'generating', 'vacuum', 'squeezing', 'that', 'involve', 'optical', 'cavities', 'limited', 'by', 'the', 'end', 'surface', 'of', 'a', 'fiber', 'and', 'by', 'a', 'curved', 'mirror', 'and', 'containing', 'a', 'thin', 'parametric', 'crystal', 'these', 'systems', 'have', 'the', 'advantage', 'to', 'couple', 'squeezed', 'states', 'directly', 'to', 'a', 'fiber', 'allowing', 'the', 'user', 'to', 'benefit', 'from', 'the', 'flexibility', 'of', 'fibers', 'in', 'the', 'use', 'of', 'squeezing', 'three', 'types', 'of', 'fibers', 'are', 'investigated', 'standard', 'singlemode', 'fibers', 'photoniccrystal', 'large', 'mode', 'area', 'singlemode', 'fibers', 'and', 'short', 'multimode', 'fiber', 'taped', 'to', 'a', 'singlemode', 'fiber', 'the', 'observed', 'squeezing', 'is', 'modest', '056', 'db', '09', 'db', '1', 'db', 'but', 'these', 'experiments', 'open', 'the', 'way', 'to', 'miniaturized', 'squeezing', 'devices', 'that', 'could', 'be', 'a', 'very', 'interesting', 'advantage', 'in', 'scaling', 'up', 'quantum', 'systems', 'for', 'quantum', 'processing', 'opening', 'new', 'perspectives', 'in', 'the', 'domain', 'of', 'integrated', 'quantum', 'optics']]
|
[-0.16680008237104196, 0.17033152326024067, -0.06867470909535552, -0.024628993054268074, -0.03598777618982009, -0.22239177585092942, 0.03780322259729867, 0.45518071343427274, -0.25433849128755504, -0.23718947810190383, 0.07375390166521016, -0.2318046192096463, -0.12046056889942777, 0.3097857093966719, -0.0938893120332774, 0.10377324256983433, 0.08955731717157248, -0.07292909527531088, -0.029716454613119808, -0.222312746103853, 0.2837704925488597, -0.00842739139777372, 0.3358302735584552, -0.004851236103672479, 0.14307724099272667, -0.01833982150845313, 0.056158271527835237, -0.0349928337642784, -0.11784603481179663, 0.17907565064969777, 0.2648558240104119, 0.019435519755665046, 0.2685671008518661, -0.39597644182895103, -0.23177731778722868, 0.07798146449529858, 0.11607582316344688, 0.14068302971227511, -0.010777108518080092, -0.2837854362224965, 0.056757148793106206, -0.1690536906606945, -0.16268665831587747, -0.06867513531096169, -0.029951198839707607, 0.01592623096206156, -0.18828194404808013, -0.025809518261395617, 0.0719526734992813, 0.06747452231165744, 0.07265327106012334, -0.05107782539779515, 0.00846977040533032, 0.08190896604974657, -0.08768385666276593, -0.01396390250206355, 0.19117395014418706, -0.1703546332688863, -0.09968199326184148, 0.360462324255504, -0.09188206876808805, -0.14956890933959285, 0.14737421421355, -0.13998105393465496, -0.018927454663468384, 0.18240702902175374, 0.18035151912577088, 0.04543076601633524, -0.12960510897630853, 0.011779532366894436, 0.029614161917203063, 0.22682235554580008, 0.1677189747222574, 0.1670628614869636, 0.23797883871775954, 0.1739935632239082, 0.009159949755838224, 0.18718532633658416, -0.110056037736584, -0.07651394648727641, -0.2915377679086332, -0.1930689161240276, -0.1641511122438511, 0.10803757637475075, -0.10170300931327911, -0.10520680665921198, 0.39150733711309177, 0.07262608044391582, 0.1317599630552351, -0.0036751042439866423, 0.3082117223417136, 0.06253570471647014, 0.14007851940583188, -0.005858502892860726, 0.33203197483306945, 0.1770523555069439, 0.0939317011960075, -0.18037598689413392, -0.11333134681778724, -0.07221356738005147]
|
1,803.07579
|
Schrodinger-Maxwell systems on compact Riemannian manifolds
|
In this paper we are focusing to the following Schr\"odinger-Maxwell system
$(\mathcal{SM}_{\Psi(\lambda,\cdot)}^{e})$:
\[ \begin{cases} -\Delta_{g}u+\beta(x)u+eu\phi=\Psi(\lambda,x)f(u) &
\mathrm{in}\ M -\Delta_{g}\phi+\phi=qu^{2} & \mathrm{\mathrm{in}\ M}
\end{cases} \] where $(M,g)$ is a 3-dimensional compact Riemannian manifold
without boundary, $e,q>0$ are positive numbers, $f:\mathbb{R}\to\mathbb{R}$ is
a continuous function, $\beta\in C^{\infty}(M)$ and $\Psi\in
C^{\infty}(\mathbb{R}_{+}\times M)$ are positive functions. By various
variational approaches, existence of multiple solutions of the problem
$(\mathcal{SM}_{\Psi(\lambda,\cdot)}^{e})$ is established.
|
math.AP
|
in this paper we are focusing to the following schrodingermaxwell system mathcalsm_psilambdacdote begincases delta_gubetaxueuphipsilambdaxfu mathrmin m delta_gphiphiqu2 mathrmmathrmin m endcases where mg is a 3dimensional compact riemannian manifold without boundary eq0 are positive numbers fmathbbrtomathbbr is a continuous function betain cinftym and psiin cinftymathbbr_times m are positive functions by various variational approaches existence of multiple solutions of the problem mathcalsm_psilambdacdote is established
|
[['in', 'this', 'paper', 'we', 'are', 'focusing', 'to', 'the', 'following', 'schrodingermaxwell', 'system', 'mathcalsm_psilambdacdote', 'begincases', 'delta_gubetaxueuphipsilambdaxfu', 'mathrmin', 'm', 'delta_gphiphiqu2', 'mathrmmathrmin', 'm', 'endcases', 'where', 'mg', 'is', 'a', '3dimensional', 'compact', 'riemannian', 'manifold', 'without', 'boundary', 'eq0', 'are', 'positive', 'numbers', 'fmathbbrtomathbbr', 'is', 'a', 'continuous', 'function', 'betain', 'cinftym', 'and', 'psiin', 'cinftymathbbr_times', 'm', 'are', 'positive', 'functions', 'by', 'various', 'variational', 'approaches', 'existence', 'of', 'multiple', 'solutions', 'of', 'the', 'problem', 'mathcalsm_psilambdacdote', 'is', 'established']]
|
[-0.26426029486382113, 0.08607600018149242, 0.01122488985337051, 0.04033037516637705, -0.10050129061398495, -0.22151070595386305, -0.0886077167961048, 0.37583918812950806, -0.23706780696686888, -0.21096281723917595, 0.1626894505607197, -0.34963944249986006, -0.1437781053661768, 0.1638517362298444, -0.09112863964401186, 0.09131529869046062, 0.018737665202934295, 0.028498248642011146, -0.09166182873013895, -0.18521414308426237, 0.460955989813166, -0.15322169410397432, 0.1352588468829968, 0.04001797230115959, 0.12850827312130214, -0.05308768324071674, 0.09453238852854286, 0.011463678990756827, -0.21597800511517562, 0.03990320406280391, 0.23684790524254953, 0.11987264248974887, 0.32765152348604587, -0.3581329020921008, -0.21362309056400722, 0.18559259016598975, 0.11142442557944118, -0.06400032808804619, -0.011111543197850031, -0.31711861378114137, 0.1670617445571614, -0.0553899255381631, -0.12911296184341023, -0.007439806134373482, 0.07884331746858411, 0.06323423047017838, -0.37258465455046724, 0.08062967109227819, 0.0880237644139145, 0.023718352321468825, -0.13700352523509146, -0.16799126251758675, -0.040292348633686616, 0.07545815325076026, -0.02654501630708442, 0.12149858816077799, 0.021901076185583537, -0.02663705575728922, -0.020623927753019546, 0.31705195060931146, -0.09043580038788994, -0.3505257606905486, 0.12135482191141429, -0.17007829480904288, -0.14311917722391496, 0.10799749562283978, 0.13224002711025865, 0.23388356968228305, -0.1205353575060144, 0.24108833051182696, -0.10146344215068634, 0.12819838493929378, 0.08461639009848503, -0.059710165535631986, 0.08310258204749386, 0.13451525966437267, 0.1501844367344997, 0.07523656767859523, 0.0031193523859006484, -0.022628980356135538, -0.31211134032283944, -0.18193272251768836, -0.18501143137525236, 0.1925520156177559, -0.0756843038748879, -0.15288080930310702, 0.2722238408168778, -0.01922648964682594, 0.19217626537595475, 0.09516815264110587, 0.19337326347782177, 0.13620678634366154, -0.09280996390485338, 0.10530534487250927, 0.08765006333539661, 0.14610411764754513, 0.10892485837186021, -0.19024127553400053, -0.038236396798830743, 0.15192225340953364]
|
1,803.0758
|
Resource theory of non-Gaussian operations
|
Non-Gaussian states and operations are crucial for various
continuous-variable quantum information processing tasks. To quantitatively
understand non-Gaussianity beyond states, we establish a resource theory for
non-Gaussian operations. In our framework, we consider Gaussian operations as
free operations, and non-Gaussian operations as resources. We define
entanglement-assisted non-Gaussianity generating power and show that it is a
monotone that is non-increasing under the set of free super-operations, i.e.,
concatenation and tensoring with Gaussian channels. For conditional unitary
maps, this monotone can be analytically calculated. As examples, we show that
the non-Gaussianity of ideal photon-number subtraction and photon-number
addition equal the non-Gaussianity of the single-photon Fock state. Based on
our non-Gaussianity monotone, we divide non-Gaussian operations into two
classes: (1) the finite non-Gaussianity class, e.g., photon-number subtraction,
photon-number addition and all Gaussian-dilatable non-Gaussian channels; and
(2) the diverging non-Gaussianity class, e.g., the binary phase-shift channel
and the Kerr nonlinearity. This classification also implies that not all
non-Gaussian channels are exactly Gaussian-dilatable. Our resource theory
enables a quantitative characterization and a first classification of
non-Gaussian operations, paving the way towards the full understanding of
non-Gaussianity.
|
quant-ph
|
nongaussian states and operations are crucial for various continuousvariable quantum information processing tasks to quantitatively understand nongaussianity beyond states we establish a resource theory for nongaussian operations in our framework we consider gaussian operations as free operations and nongaussian operations as resources we define entanglementassisted nongaussianity generating power and show that it is a monotone that is nonincreasing under the set of free superoperations ie concatenation and tensoring with gaussian channels for conditional unitary maps this monotone can be analytically calculated as examples we show that the nongaussianity of ideal photonnumber subtraction and photonnumber addition equal the nongaussianity of the singlephoton fock state based on our nongaussianity monotone we divide nongaussian operations into two classes 1 the finite nongaussianity class eg photonnumber subtraction photonnumber addition and all gaussiandilatable nongaussian channels and 2 the diverging nongaussianity class eg the binary phaseshift channel and the kerr nonlinearity this classification also implies that not all nongaussian channels are exactly gaussiandilatable our resource theory enables a quantitative characterization and a first classification of nongaussian operations paving the way towards the full understanding of nongaussianity
|
[['nongaussian', 'states', 'and', 'operations', 'are', 'crucial', 'for', 'various', 'continuousvariable', 'quantum', 'information', 'processing', 'tasks', 'to', 'quantitatively', 'understand', 'nongaussianity', 'beyond', 'states', 'we', 'establish', 'a', 'resource', 'theory', 'for', 'nongaussian', 'operations', 'in', 'our', 'framework', 'we', 'consider', 'gaussian', 'operations', 'as', 'free', 'operations', 'and', 'nongaussian', 'operations', 'as', 'resources', 'we', 'define', 'entanglementassisted', 'nongaussianity', 'generating', 'power', 'and', 'show', 'that', 'it', 'is', 'a', 'monotone', 'that', 'is', 'nonincreasing', 'under', 'the', 'set', 'of', 'free', 'superoperations', 'ie', 'concatenation', 'and', 'tensoring', 'with', 'gaussian', 'channels', 'for', 'conditional', 'unitary', 'maps', 'this', 'monotone', 'can', 'be', 'analytically', 'calculated', 'as', 'examples', 'we', 'show', 'that', 'the', 'nongaussianity', 'of', 'ideal', 'photonnumber', 'subtraction', 'and', 'photonnumber', 'addition', 'equal', 'the', 'nongaussianity', 'of', 'the', 'singlephoton', 'fock', 'state', 'based', 'on', 'our', 'nongaussianity', 'monotone', 'we', 'divide', 'nongaussian', 'operations', 'into', 'two', 'classes', '1', 'the', 'finite', 'nongaussianity', 'class', 'eg', 'photonnumber', 'subtraction', 'photonnumber', 'addition', 'and', 'all', 'gaussiandilatable', 'nongaussian', 'channels', 'and', '2', 'the', 'diverging', 'nongaussianity', 'class', 'eg', 'the', 'binary', 'phaseshift', 'channel', 'and', 'the', 'kerr', 'nonlinearity', 'this', 'classification', 'also', 'implies', 'that', 'not', 'all', 'nongaussian', 'channels', 'are', 'exactly', 'gaussiandilatable', 'our', 'resource', 'theory', 'enables', 'a', 'quantitative', 'characterization', 'and', 'a', 'first', 'classification', 'of', 'nongaussian', 'operations', 'paving', 'the', 'way', 'towards', 'the', 'full', 'understanding', 'of', 'nongaussianity']]
|
[-0.13066862243106642, 0.14502212059773548, -0.11675427982446837, 0.11951473667181102, 0.008138793104954358, -0.1921945071679219, 0.01556959928744762, 0.35921940363227983, -0.2588965362200966, -0.2280227170920389, 0.06226235754869478, -0.23442704685619048, -0.13942108847369244, 0.2264457072070826, -0.07898188244428633, 0.1344999315948515, 0.056317633721651245, -0.006433639059758792, -0.059654561661994135, -0.2791099151731916, 0.36067719966709866, 0.025037530017095896, 0.2999540305470174, -0.012143074173419763, 0.07842040826213983, 0.022144477690785785, -0.07104555498953319, -0.017843188667564, -0.09783246688163934, 0.08626101196462047, 0.27698667408467015, 0.17369606954671737, 0.27253441683590246, -0.38889371162269915, -0.22009916056873602, 0.19174459188818763, 0.09847621084075805, 0.16686413857275567, 0.00818601909940694, -0.3265580858431472, 0.024190223666623573, -0.21093896866939163, -0.03575243244452749, -0.1939442792491682, -0.007279247218988952, -0.005432759481350665, -0.32224046935144507, 0.08340332420700029, 0.08804654212021348, 0.005170223882584964, 0.04874470452962201, -0.0764527746586729, -0.011845012622264525, 0.09165215364652081, -0.09610637286467899, -0.026834488449760288, 0.17540930373867775, -0.1608644488601719, -0.14257419869102442, 0.31590686102876553, -0.07161286823572538, -0.19940158561540314, 0.09399851558284077, -0.15147691979441308, -0.1871971797071776, 0.054264741568263136, 0.11810129737260483, 0.06497967560738746, -0.12366339324915644, 0.0845935484654228, -0.003725195298297594, 0.18976249335212686, 0.11399825497419905, 0.18185528051265973, 0.1885779272293998, 0.0650719222849456, 0.1406085551374376, 0.20256340114260354, -0.09921015636590283, -0.07346701527824678, -0.3721445356548296, -0.13342388469126013, -0.2106032958241064, 0.0712997797038176, -0.1218166921982814, -0.1717942372322251, 0.42549143721070665, 0.12859589639409197, 0.12211444879761019, 0.1222251175539726, 0.33920883894950615, 0.11315654175322158, 0.01325374124519064, 0.08312664471966567, 0.16002103100441353, 0.1821780655648833, 0.00898188526221251, -0.18978406549273533, 0.03992953108844616, -0.017401348001002678]
|
1,803.07581
|
Packing and covering induced subdivisions
|
A class $\mathcal{F}$ of graphs has the induced Erd\H{o}s-P\'osa property if
there exists a function $f$ such that for every graph $G$ and every positive
integer $k$, $G$ contains either $k$ pairwise vertex-disjoint induced subgraphs
that belong to $\mathcal{F}$, or a vertex set of size at most $f(k)$ hitting
all induced copies of graphs in $\mathcal{F}$. Kim and Kwon (SODA'18) showed
that for a cycle $C_{\ell}$ of length $\ell$, the class of
$C_{\ell}$-subdivisions has the induced Erd\H{o}s-P\'osa property if and only
if $\ell\le 4$. In this paper, we investigate whether or not the class of
$H$-subdivisions has the induced Erd\H{o}s-P\'osa property for other graphs
$H$.
We completely settle the case when $H$ is a forest or a complete bipartite
graph. Regarding the general case, we identify necessary conditions on $H$ for
the class of $H$-subdivisions to have the induced Erd\H{o}s-P\'osa property.
For this, we provide three basic constructions that are useful to prove that
the class of the subdivisions of a graph does not have the induced
Erd\H{o}s-P\'osa property. Among remaining graphs, we prove that if $H$ is
either the diamond, the $1$-pan, or the $2$-pan, then the class of
$H$-subdivisions has the induced Erd\H{o}s-P\'osa property.
|
cs.DM
|
a class mathcalf of graphs has the induced erdhosposa property if there exists a function f such that for every graph g and every positive integer k g contains either k pairwise vertexdisjoint induced subgraphs that belong to mathcalf or a vertex set of size at most fk hitting all induced copies of graphs in mathcalf kim and kwon soda18 showed that for a cycle c_ell of length ell the class of c_ellsubdivisions has the induced erdhosposa property if and only if ellle 4 in this paper we investigate whether or not the class of hsubdivisions has the induced erdhosposa property for other graphs h we completely settle the case when h is a forest or a complete bipartite graph regarding the general case we identify necessary conditions on h for the class of hsubdivisions to have the induced erdhosposa property for this we provide three basic constructions that are useful to prove that the class of the subdivisions of a graph does not have the induced erdhosposa property among remaining graphs we prove that if h is either the diamond the 1pan or the 2pan then the class of hsubdivisions has the induced erdhosposa property
|
[['a', 'class', 'mathcalf', 'of', 'graphs', 'has', 'the', 'induced', 'erdhosposa', 'property', 'if', 'there', 'exists', 'a', 'function', 'f', 'such', 'that', 'for', 'every', 'graph', 'g', 'and', 'every', 'positive', 'integer', 'k', 'g', 'contains', 'either', 'k', 'pairwise', 'vertexdisjoint', 'induced', 'subgraphs', 'that', 'belong', 'to', 'mathcalf', 'or', 'a', 'vertex', 'set', 'of', 'size', 'at', 'most', 'fk', 'hitting', 'all', 'induced', 'copies', 'of', 'graphs', 'in', 'mathcalf', 'kim', 'and', 'kwon', 'soda18', 'showed', 'that', 'for', 'a', 'cycle', 'c_ell', 'of', 'length', 'ell', 'the', 'class', 'of', 'c_ellsubdivisions', 'has', 'the', 'induced', 'erdhosposa', 'property', 'if', 'and', 'only', 'if', 'ellle', '4', 'in', 'this', 'paper', 'we', 'investigate', 'whether', 'or', 'not', 'the', 'class', 'of', 'hsubdivisions', 'has', 'the', 'induced', 'erdhosposa', 'property', 'for', 'other', 'graphs', 'h', 'we', 'completely', 'settle', 'the', 'case', 'when', 'h', 'is', 'a', 'forest', 'or', 'a', 'complete', 'bipartite', 'graph', 'regarding', 'the', 'general', 'case', 'we', 'identify', 'necessary', 'conditions', 'on', 'h', 'for', 'the', 'class', 'of', 'hsubdivisions', 'to', 'have', 'the', 'induced', 'erdhosposa', 'property', 'for', 'this', 'we', 'provide', 'three', 'basic', 'constructions', 'that', 'are', 'useful', 'to', 'prove', 'that', 'the', 'class', 'of', 'the', 'subdivisions', 'of', 'a', 'graph', 'does', 'not', 'have', 'the', 'induced', 'erdhosposa', 'property', 'among', 'remaining', 'graphs', 'we', 'prove', 'that', 'if', 'h', 'is', 'either', 'the', 'diamond', 'the', '1pan', 'or', 'the', '2pan', 'then', 'the', 'class', 'of', 'hsubdivisions', 'has', 'the', 'induced', 'erdhosposa', 'property']]
|
[-0.17113366012263637, 0.16012788636439812, -0.0252034022422131, 0.010995496057186256, -0.08491455607292353, -0.14218095120361046, 0.02135031507410823, 0.3969208789805983, -0.2975375121533255, -0.24998137653067012, 0.08305705174769955, -0.2972161240122942, -0.14283818096269907, 0.14023246054436259, -0.07666101966806026, -0.0187562122805903, 0.10704635010930888, 0.13241765132415775, 0.014408708212250564, -0.2618020200241451, 0.331774540226231, -0.07416426527453827, 0.16469425659740122, 0.10802143760546656, 0.08520544851150537, 0.03140396124639891, 0.039923663945974776, 0.1124923684745255, -0.20322143307570645, 0.04663728048223906, 0.23150726351911116, 0.17848143753127577, 0.2814587799185607, -0.33025119430837924, -0.18786445719918593, 0.3124306928921356, 0.06260529827625717, 0.033297587188963244, -0.021629071129133703, -0.18010397992637298, 0.1927444323984221, -0.10289765653137715, -0.11321811084852704, -0.0051641194680657415, 0.12631344418837617, -0.03276010970416156, -0.29665411370830524, -0.019974024264248078, 0.2203959435477269, 0.04851361653173989, 0.06822653271865892, -0.1352159159017939, -0.07781739892568343, 0.10412062400993602, -0.046155468032362396, 0.058703756671630504, 0.029723624213251233, -0.1030954417078623, -0.14244034677053866, 0.36747727466872626, -0.051676350995570115, -0.1544061260819049, 0.1312718258156089, -0.16801469613571163, -0.2393280415303542, 0.10755712580456944, 0.0688443308831265, 0.15530123925463832, -0.09541340466563704, 0.17720861287475106, -0.1384013350666959, 0.11248800967737956, 0.13544503794114438, 0.05077763929042647, 0.12141226565856197, 0.06851786752038398, 0.16214486738242248, 0.17440082378223432, -0.015400384421281787, 0.05947915552463865, -0.30424167884639197, -0.1338895400696545, -0.194007898822615, 0.11333295862010072, -0.09608129613136769, -0.22214181159762908, 0.406648301241987, 0.07294329881687393, 0.16660328146186054, 0.08180633652955294, 0.17089484886500328, 0.054197971037799525, 0.08518106918214999, 0.1650877458506645, 0.15343652184994727, 0.16236593119180012, -0.06125986597553822, -0.15973380384749583, 0.10572742086526374, 0.14626453925947142]
|
1,803.07582
|
Indirect Influences, Links Ranking, and Deconstruction of Networks
|
The PWP map was introduced by the second author as a tool for ranking nodes
in networks. In this work we extend this technique so that it can be used to
rank links as well. Applying the Girvan-Newman algorithm a ranking method on
links induces a deconstruction method for networks, therefore we obtain new
methods for finding clustering and core-periphery structures on networks.
|
cs.SI math.CO
|
the pwp map was introduced by the second author as a tool for ranking nodes in networks in this work we extend this technique so that it can be used to rank links as well applying the girvannewman algorithm a ranking method on links induces a deconstruction method for networks therefore we obtain new methods for finding clustering and coreperiphery structures on networks
|
[['the', 'pwp', 'map', 'was', 'introduced', 'by', 'the', 'second', 'author', 'as', 'a', 'tool', 'for', 'ranking', 'nodes', 'in', 'networks', 'in', 'this', 'work', 'we', 'extend', 'this', 'technique', 'so', 'that', 'it', 'can', 'be', 'used', 'to', 'rank', 'links', 'as', 'well', 'applying', 'the', 'girvannewman', 'algorithm', 'a', 'ranking', 'method', 'on', 'links', 'induces', 'a', 'deconstruction', 'method', 'for', 'networks', 'therefore', 'we', 'obtain', 'new', 'methods', 'for', 'finding', 'clustering', 'and', 'coreperiphery', 'structures', 'on', 'networks']]
|
[-0.0770755023473785, -0.021206885783208743, -0.10741690782800553, 0.10398337594972598, -0.08853859849835909, -0.14750709413506446, 0.0849843890746198, 0.4191384119026008, -0.2697932928253616, -0.31715404614806175, 0.0703567743027908, -0.2226889123179255, -0.30743329676370773, 0.20202013714209435, -0.07507867386771573, 0.0427807477923731, 0.07149282831048208, 0.032045727802647486, -0.02247695736069646, -0.277897629975563, 0.35396160554909517, 0.09261692965787555, 0.30247518934664275, 0.0634069858074543, 0.09777232217380688, 0.008091233035046903, -0.057159835502268774, 0.09068554236243169, -0.09446780119400328, 0.16544534511391132, 0.27265574944220367, 0.1735316033194226, 0.278382039909798, -0.32588025155876366, -0.23850509935309963, 0.13345023742803033, 0.1318584027153159, 0.15772664102740466, -0.0007886694271176581, -0.3117830099331008, 0.11671412651914925, -0.21984183628644263, -0.04484836225737891, -0.15142895778020224, -0.058014302948741096, 0.011459859886339732, -0.28294224649786004, 0.024393311975198607, 0.049789572077330264, 0.009608143689258703, -0.013540379089554624, -0.07295194972631713, 0.03950741528976886, 0.13999866748169537, -0.02003993886330771, 0.0689806174412961, 0.07345979822622169, -0.09649369734827251, -0.19120884331918897, 0.3527696624191271, -0.053060501976500425, -0.21543645573454717, 0.1568629443312862, 0.024053056036964768, -0.2361890421736808, 0.062094495232616155, 0.2248938036786895, 0.14492286333771762, -0.143137142091753, 0.011024484661267332, -0.06973596585411874, 0.12395951093455392, 0.08014622342491907, -0.05336685167507283, 0.12851714552749718, 0.2144788939446684, 0.14824924073995105, 0.1615595040059397, -0.07955221385724606, -0.004652876259079055, -0.18851162188701212, -0.17630861028437578, -0.24434496688523463, -0.01747283168388383, -0.0693262189823953, -0.1462411435232276, 0.4309239528245396, 0.1544798804698364, 0.21374794462370494, 0.0901873430813707, 0.307341159827682, 0.06059390661631903, 0.12319319528926696, 0.09907377276214815, 0.17781472597123374, 0.14977341534436814, 0.13845767622577057, -0.08097711000415969, 0.10009008349614247, 0.1667879006884519]
|
1,803.07583
|
Long-range entanglement near a Kondo-destruction quantum critical point
|
The numerical renormalization group is used to study quantum entanglement in
the Kondo impurity model with a pseudogapped density of states
$\rho(\varepsilon)\propto|\varepsilon|^r$ ($r>0$) that vanishes at the Fermi
energy $\varepsilon=0$. The model features a Kondo-destruction quantum critical
point (QCP) separating a partially screened phase (reached for impurity-band
exchange couplings $J>J_c$) from a local-moment phase ($J<J_c$). The impurity
contribution $S_e^{imp}$ to the entanglement entropy between a region of radius
$R$ around the magnetic impurity and the rest of the host system reveals a
characteristic length scale $R^*$ that distinguishes a regime $R\ll R^*$ of
maximal critical entanglement from one $R\gg R^*$ of weaker entanglement.
Within each phase, $S_e^{imp}$ is a universal function of $R/R^*$ with a
power-law decay for $R/R^*\gg 1$. The entanglement length scale $R^*$ diverges
on approach to the QCP with a critical exponent that depends only on $r$.
|
cond-mat.str-el
|
the numerical renormalization group is used to study quantum entanglement in the kondo impurity model with a pseudogapped density of states rhovarepsilonproptovarepsilonr r0 that vanishes at the fermi energy varepsilon0 the model features a kondodestruction quantum critical point qcp separating a partially screened phase reached for impurityband exchange couplings jj_c from a localmoment phase jj_c the impurity contribution s_eimp to the entanglement entropy between a region of radius r around the magnetic impurity and the rest of the host system reveals a characteristic length scale r that distinguishes a regime rll r of maximal critical entanglement from one rgg r of weaker entanglement within each phase s_eimp is a universal function of rr with a powerlaw decay for rrgg 1 the entanglement length scale r diverges on approach to the qcp with a critical exponent that depends only on r
|
[['the', 'numerical', 'renormalization', 'group', 'is', 'used', 'to', 'study', 'quantum', 'entanglement', 'in', 'the', 'kondo', 'impurity', 'model', 'with', 'a', 'pseudogapped', 'density', 'of', 'states', 'rhovarepsilonproptovarepsilonr', 'r0', 'that', 'vanishes', 'at', 'the', 'fermi', 'energy', 'varepsilon0', 'the', 'model', 'features', 'a', 'kondodestruction', 'quantum', 'critical', 'point', 'qcp', 'separating', 'a', 'partially', 'screened', 'phase', 'reached', 'for', 'impurityband', 'exchange', 'couplings', 'jj_c', 'from', 'a', 'localmoment', 'phase', 'jj_c', 'the', 'impurity', 'contribution', 's_eimp', 'to', 'the', 'entanglement', 'entropy', 'between', 'a', 'region', 'of', 'radius', 'r', 'around', 'the', 'magnetic', 'impurity', 'and', 'the', 'rest', 'of', 'the', 'host', 'system', 'reveals', 'a', 'characteristic', 'length', 'scale', 'r', 'that', 'distinguishes', 'a', 'regime', 'rll', 'r', 'of', 'maximal', 'critical', 'entanglement', 'from', 'one', 'rgg', 'r', 'of', 'weaker', 'entanglement', 'within', 'each', 'phase', 's_eimp', 'is', 'a', 'universal', 'function', 'of', 'rr', 'with', 'a', 'powerlaw', 'decay', 'for', 'rrgg', '1', 'the', 'entanglement', 'length', 'scale', 'r', 'diverges', 'on', 'approach', 'to', 'the', 'qcp', 'with', 'a', 'critical', 'exponent', 'that', 'depends', 'only', 'on', 'r']]
|
[-0.2203447747605798, 0.21586702524013268, -0.11937105044832125, 0.05970257660202846, 0.03788157638722195, -0.2620795907500638, 0.10255883674835786, 0.27556892739684213, -0.26005993058959787, -0.1993004077418899, 0.01635877768978175, -0.35724692143883335, -0.0705191386411624, 0.1546081770245698, 0.056366323092601416, 0.026627963561194894, -0.0381762940716512, 0.08633772971156492, -0.11497150346301221, -0.1745903997678611, 0.32068004296118435, 0.03799673039568862, 0.25091299324926425, 0.10788298924864434, 0.03649206039742293, 0.009489579947994035, 0.0992426779360839, 0.045803249344531005, -0.1869566338538575, 0.015338300086595529, 0.22169925639515414, -0.02072504536002217, 0.25256204583873865, -0.3023516462006442, -0.20967721907586298, 0.07354472343371633, 0.15362356144332273, 0.1037092677605174, 0.002047991049681407, -0.2750807008911472, 0.05257252740043709, -0.16479366191881983, -0.142288294264718, 0.002564832307946156, 0.06529683278024416, -0.05523878034813713, -0.2719268870149629, 0.15511051471591653, 0.02638440709971987, 0.08917642291292877, -0.014662599766298252, -0.05964135322360294, -0.04284885423326427, 0.08202062237679082, 0.03562302997520687, 0.1008862099278143, 0.19386295377112486, -0.12591620980803034, -0.044688655981136596, 0.31844449315822737, -0.08007790634120979, -0.10076634127044064, 0.15509301874622264, -0.18931210150613503, -0.08833121242744657, 0.12929698413320104, 0.0785153450749075, 0.09190818487310454, -0.0747379407968016, 0.16505944564115077, -0.007511363770497744, 0.24578477652518332, -0.008458258335903177, 0.06957373351392829, 0.2522948071744074, 0.12714205609689302, 0.08584208246097927, 0.1499742723604226, -0.11690792385899626, -0.12741405589108848, -0.3422768830376513, -0.14144973895129034, -0.28310875044039946, 0.08445611821062972, -0.16260071208018737, -0.19162273743902059, 0.41299355821684003, 0.13423814847791457, 0.22149873227017985, 0.02815660295634777, 0.20495250373941792, 0.10182436441220274, 0.06833566058262744, 0.12587883926565102, 0.2077822027837529, 0.126871821068241, 0.07469692754709874, -0.2996470125953612, 0.01887643265346175, 0.12196354879586793]
|
1,803.07584
|
Quartz tuning-fork based carbon nanotube transfer into quantum device
geometries
|
With the objective of integrating single clean, as-grown carbon nanotubes
into complex circuits, we have developed a technique to grow nanotubes directly
on commercially available quartz tuning forks using a high temperature CVD
process. Multiple straight and aligned nanotubes bridge the >100um gap between
the two tips. The nanotubes are then lowered onto contact electrodes,
electronically characterized in situ, and subsequently cut loose from the
tuning fork using a high current. First quantum transport measurements of the
resulting devices at cryogenic temperatures display Coulomb blockade
characteristics.
|
cond-mat.mes-hall
|
with the objective of integrating single clean asgrown carbon nanotubes into complex circuits we have developed a technique to grow nanotubes directly on commercially available quartz tuning forks using a high temperature cvd process multiple straight and aligned nanotubes bridge the 100um gap between the two tips the nanotubes are then lowered onto contact electrodes electronically characterized in situ and subsequently cut loose from the tuning fork using a high current first quantum transport measurements of the resulting devices at cryogenic temperatures display coulomb blockade characteristics
|
[['with', 'the', 'objective', 'of', 'integrating', 'single', 'clean', 'asgrown', 'carbon', 'nanotubes', 'into', 'complex', 'circuits', 'we', 'have', 'developed', 'a', 'technique', 'to', 'grow', 'nanotubes', 'directly', 'on', 'commercially', 'available', 'quartz', 'tuning', 'forks', 'using', 'a', 'high', 'temperature', 'cvd', 'process', 'multiple', 'straight', 'and', 'aligned', 'nanotubes', 'bridge', 'the', '100um', 'gap', 'between', 'the', 'two', 'tips', 'the', 'nanotubes', 'are', 'then', 'lowered', 'onto', 'contact', 'electrodes', 'electronically', 'characterized', 'in', 'situ', 'and', 'subsequently', 'cut', 'loose', 'from', 'the', 'tuning', 'fork', 'using', 'a', 'high', 'current', 'first', 'quantum', 'transport', 'measurements', 'of', 'the', 'resulting', 'devices', 'at', 'cryogenic', 'temperatures', 'display', 'coulomb', 'blockade', 'characteristics']]
|
[-0.09867313674239572, 0.19963251175710844, -0.02309220302362688, -0.07072560628527098, -0.029698608215725005, -0.23287693735721066, 0.11319169712382866, 0.526739782133941, -0.2793093183474496, -0.3296092539527562, 0.021609572378301255, -0.31630474376914547, -0.0547582198714101, 0.21714137646716175, 0.01229124244550909, 0.04060172067067131, 0.09232519355299341, -0.12260916221515969, -0.05687660871745022, -0.17898489502366893, 0.21382787413245372, 0.050086132303519215, 0.3917179184337688, 0.0852466895337065, 0.09965894259593644, -0.01805488496130809, 0.09550247290191988, 0.05147634483440671, -0.16146728444064773, 0.10850293507195771, 0.23861903629568948, -0.08713771828970071, 0.20151291535300916, -0.5295502799021643, -0.16731099592695056, 0.0007280481242856314, 0.1444173752665953, 0.11439384994920083, -0.06570930782364422, -0.2351758958945094, 0.07198370686396523, -0.11625545743316802, -0.07422723269701237, -0.024957182773843754, -0.08020876017994745, 0.03308604214053471, -0.16983951918704998, 0.003199424486347409, -0.012102614349122484, 0.08295707121967923, -0.044160089750136626, -0.12377318824359844, -0.07120798378208176, 0.11175990200514883, -0.06040179970989621, -0.02207617860200793, 0.3221151444595307, -0.09598234645090997, -0.05881536932293932, 0.2940984600044917, -0.07039227174205143, -0.10469205777409898, 0.20681224294212583, -0.12591668230083466, -0.04924455097724879, 0.17857344918965556, 0.08714017978068007, 0.13513222268036687, -0.2341040964996399, 0.007851191849155394, 0.06770480917509493, 0.14947674616218307, 0.1845260535984105, 0.019369130515558428, 0.2907093549688715, 0.24400534008922012, 0.001148968136349563, 0.18960914041760357, -0.10397392793065803, 0.01027552399047932, -0.18156119501610762, -0.18059620727124343, -0.2236551175348807, 0.07584855097703376, -0.06925802857873604, -0.21077522143808214, 0.34056099224192643, 0.07492532770062775, 0.2137775634832377, -0.020687047002273938, 0.32607383265289974, 0.06274229512674474, 0.1672247680185666, -0.03193146789576425, 0.2377824700792147, 0.1451350266038072, 0.12160155608665285, -0.233608718438962, 0.05107911121165163, -0.05295950582597491]
|
1,803.07585
|
Homological classification of topological terms in sigma models on
homogeneous spaces
|
We classify the topological terms (in a sense to be made precise) that may
appear in a non-linear sigma model based on maps from an arbitrary worldvolume
manifold to a homogeneous space $G/H$ (where $G$ is an arbitrary Lie group and
$H \subset G$). We derive a new condition for $G$-invariance of topological
terms, which is necessary and sufficient (at least when $G$ is connected), and
discuss a variety of examples in quantum mechanics and quantum field theory. In
the present work we discuss only terms that may be written in terms of
(possibly only locally-defined) differential forms on $G/H$, leading to an
action that is manifestly local. Such terms come in one of two types, with
prototypical quantum-mechanical examples given by the Aharonov-Bohm effect and
the Dirac monopole. The classification is based on the observation that, for
topological terms, the maps from the worldvolume to $G/H$ may be replaced by
singular homology cycles on $G/H$. In a forthcoming paper we apply the results
to phenomenological models in which the Higgs boson is composite.
|
hep-th hep-ph
|
we classify the topological terms in a sense to be made precise that may appear in a nonlinear sigma model based on maps from an arbitrary worldvolume manifold to a homogeneous space gh where g is an arbitrary lie group and h subset g we derive a new condition for ginvariance of topological terms which is necessary and sufficient at least when g is connected and discuss a variety of examples in quantum mechanics and quantum field theory in the present work we discuss only terms that may be written in terms of possibly only locallydefined differential forms on gh leading to an action that is manifestly local such terms come in one of two types with prototypical quantummechanical examples given by the aharonovbohm effect and the dirac monopole the classification is based on the observation that for topological terms the maps from the worldvolume to gh may be replaced by singular homology cycles on gh in a forthcoming paper we apply the results to phenomenological models in which the higgs boson is composite
|
[['we', 'classify', 'the', 'topological', 'terms', 'in', 'a', 'sense', 'to', 'be', 'made', 'precise', 'that', 'may', 'appear', 'in', 'a', 'nonlinear', 'sigma', 'model', 'based', 'on', 'maps', 'from', 'an', 'arbitrary', 'worldvolume', 'manifold', 'to', 'a', 'homogeneous', 'space', 'gh', 'where', 'g', 'is', 'an', 'arbitrary', 'lie', 'group', 'and', 'h', 'subset', 'g', 'we', 'derive', 'a', 'new', 'condition', 'for', 'ginvariance', 'of', 'topological', 'terms', 'which', 'is', 'necessary', 'and', 'sufficient', 'at', 'least', 'when', 'g', 'is', 'connected', 'and', 'discuss', 'a', 'variety', 'of', 'examples', 'in', 'quantum', 'mechanics', 'and', 'quantum', 'field', 'theory', 'in', 'the', 'present', 'work', 'we', 'discuss', 'only', 'terms', 'that', 'may', 'be', 'written', 'in', 'terms', 'of', 'possibly', 'only', 'locallydefined', 'differential', 'forms', 'on', 'gh', 'leading', 'to', 'an', 'action', 'that', 'is', 'manifestly', 'local', 'such', 'terms', 'come', 'in', 'one', 'of', 'two', 'types', 'with', 'prototypical', 'quantummechanical', 'examples', 'given', 'by', 'the', 'aharonovbohm', 'effect', 'and', 'the', 'dirac', 'monopole', 'the', 'classification', 'is', 'based', 'on', 'the', 'observation', 'that', 'for', 'topological', 'terms', 'the', 'maps', 'from', 'the', 'worldvolume', 'to', 'gh', 'may', 'be', 'replaced', 'by', 'singular', 'homology', 'cycles', 'on', 'gh', 'in', 'a', 'forthcoming', 'paper', 'we', 'apply', 'the', 'results', 'to', 'phenomenological', 'models', 'in', 'which', 'the', 'higgs', 'boson', 'is', 'composite']]
|
[-0.15165534038792483, 0.12617451594779522, -0.07389061658471908, 0.04793020980646727, -0.10637675763118541, -0.11688951203257017, -0.014155071821524066, 0.3466091709339927, -0.23286742841873062, -0.25248363644323557, 0.09549244369604978, -0.24858348721359996, -0.19692287170702868, 0.19961756660506644, -0.10157158692238917, -0.02604713191642244, 0.040657862972725056, 0.10488660897171104, -0.08056764115161937, -0.25945458676393046, 0.3817668637098884, -0.022722945061522996, 0.20995441039264118, 0.057028050807401025, 0.09838116492262516, -0.009141812300384473, 0.001997386906884782, 0.061731862910352805, -0.1230352830749618, 0.10883122125651216, 0.24130933475356575, 0.04311003129669711, 0.18126328146063733, -0.41942572767642894, -0.2034848279148426, 0.14203534834086895, 0.1230104414093169, 0.08901523699818029, -0.004134482001774458, -0.313590411905028, 0.10947690744905722, -0.1516167050891224, -0.10663781695110702, -0.08975571206497863, 0.04201133491206464, -0.044908435394366585, -0.25722098529296017, 0.022623316608315826, 0.042635230623164225, 0.057446845477960744, -0.04120082922022918, -0.07705930193843341, -0.043036287069727466, 0.07584913517030668, 0.00016935979987590992, 0.06055559388672312, 0.08383040599814005, -0.13793283638051956, -0.14254496318901, 0.4167308547552782, -0.11151699390765493, -0.24761699523841, 0.16526981960880388, -0.13581676115603025, -0.15320358445718027, 0.08732168760482521, 0.15639023288238751, 0.13404097486971128, -0.12070777743759407, 0.13929406408154962, -0.051836132395734216, 0.10882880067286863, 0.04509194780826226, 0.029312478568426323, 0.2183466137429678, 0.10445549541377816, 0.10421488358339445, 0.1202996039713583, -0.024538981003001673, -0.050325621737049485, -0.4010828534226822, -0.17413345425879453, -0.15629041398843302, 0.10943874426657098, -0.07108755440385303, -0.16838312445572395, 0.4041493416298181, 0.09034942261186889, 0.21750756620493686, 0.012714958715589782, 0.22066068661067334, 0.14833118902330672, 0.04613052420692797, 0.04182720996289589, 0.19232590148632212, 0.16561239824826687, 0.0059028865084394646, -0.17165246740486687, -0.012766412015396824, 0.13121896387270554]
|
1,803.07586
|
Low-Complexity Distributed Radio Access Network Slicing: Algorithms and
Experimental Results
|
Radio access network (RAN) slicing is an effective methodology to dynamically
allocate networking resources in 5G networks. One of the main challenges of RAN
slicing is that it is provably an NP-Hard problem. For this reason, we design
near-optimal low-complexity distributed RAN slicing algorithms. First, we model
the slicing problem as a congestion game, and demonstrate that such game admits
a unique Nash equilibrium (NE). Then, we evaluate the Price of Anarchy (PoA) of
the NE, i.e., the efficiency of the NE as compared to the social optimum, and
demonstrate that the PoA is upper-bounded by 3/2. Next, we propose two
fully-distributed algorithms that provably converge to the unique NE without
revealing privacy-sensitive parameters from the slice tenants. Moreover, we
introduce an adaptive pricing mechanism of the wireless resources to improve
the network owner's profit. We evaluate the performance of our algorithms
through simulations and an experimental testbed deployed on the Amazon EC2
cloud, both based on a real-world dataset of base stations from the OpenCellID
project. Results conclude that our algorithms converge to the NE rapidly and
achieve near-optimal performance, while our pricing mechanism effectively
improves the profit of the network owner.
|
cs.NI
|
radio access network ran slicing is an effective methodology to dynamically allocate networking resources in 5g networks one of the main challenges of ran slicing is that it is provably an nphard problem for this reason we design nearoptimal lowcomplexity distributed ran slicing algorithms first we model the slicing problem as a congestion game and demonstrate that such game admits a unique nash equilibrium ne then we evaluate the price of anarchy poa of the ne ie the efficiency of the ne as compared to the social optimum and demonstrate that the poa is upperbounded by 32 next we propose two fullydistributed algorithms that provably converge to the unique ne without revealing privacysensitive parameters from the slice tenants moreover we introduce an adaptive pricing mechanism of the wireless resources to improve the network owners profit we evaluate the performance of our algorithms through simulations and an experimental testbed deployed on the amazon ec2 cloud both based on a realworld dataset of base stations from the opencellid project results conclude that our algorithms converge to the ne rapidly and achieve nearoptimal performance while our pricing mechanism effectively improves the profit of the network owner
|
[['radio', 'access', 'network', 'ran', 'slicing', 'is', 'an', 'effective', 'methodology', 'to', 'dynamically', 'allocate', 'networking', 'resources', 'in', '5g', 'networks', 'one', 'of', 'the', 'main', 'challenges', 'of', 'ran', 'slicing', 'is', 'that', 'it', 'is', 'provably', 'an', 'nphard', 'problem', 'for', 'this', 'reason', 'we', 'design', 'nearoptimal', 'lowcomplexity', 'distributed', 'ran', 'slicing', 'algorithms', 'first', 'we', 'model', 'the', 'slicing', 'problem', 'as', 'a', 'congestion', 'game', 'and', 'demonstrate', 'that', 'such', 'game', 'admits', 'a', 'unique', 'nash', 'equilibrium', 'ne', 'then', 'we', 'evaluate', 'the', 'price', 'of', 'anarchy', 'poa', 'of', 'the', 'ne', 'ie', 'the', 'efficiency', 'of', 'the', 'ne', 'as', 'compared', 'to', 'the', 'social', 'optimum', 'and', 'demonstrate', 'that', 'the', 'poa', 'is', 'upperbounded', 'by', '32', 'next', 'we', 'propose', 'two', 'fullydistributed', 'algorithms', 'that', 'provably', 'converge', 'to', 'the', 'unique', 'ne', 'without', 'revealing', 'privacysensitive', 'parameters', 'from', 'the', 'slice', 'tenants', 'moreover', 'we', 'introduce', 'an', 'adaptive', 'pricing', 'mechanism', 'of', 'the', 'wireless', 'resources', 'to', 'improve', 'the', 'network', 'owners', 'profit', 'we', 'evaluate', 'the', 'performance', 'of', 'our', 'algorithms', 'through', 'simulations', 'and', 'an', 'experimental', 'testbed', 'deployed', 'on', 'the', 'amazon', 'ec2', 'cloud', 'both', 'based', 'on', 'a', 'realworld', 'dataset', 'of', 'base', 'stations', 'from', 'the', 'opencellid', 'project', 'results', 'conclude', 'that', 'our', 'algorithms', 'converge', 'to', 'the', 'ne', 'rapidly', 'and', 'achieve', 'nearoptimal', 'performance', 'while', 'our', 'pricing', 'mechanism', 'effectively', 'improves', 'the', 'profit', 'of', 'the', 'network', 'owner']]
|
[-0.14526047863425143, -0.06862272958672595, -0.06972466002237827, 0.04694585664098364, -0.06369134921017879, -0.1785463052826041, 0.13757350492232945, 0.4363695903060337, -0.295826695272505, -0.29021285742540687, 0.07815885445234017, -0.25075650676202105, -0.17909747236535623, 0.1346477563974986, -0.11905096047545764, 0.05384820485414821, 0.07745056230730067, -0.003471337811788544, 0.027477002485587338, -0.3138629457874534, 0.3014130458789926, 0.1122682374213279, 0.35215771232469706, 0.08018626502356103, 0.08696455372410128, -0.07516444465727545, 0.01882749647423528, 0.005008621255910839, -0.08685219027578721, 0.10959060977378006, 0.2937903990605264, 0.2743072299441944, 0.35016200640590495, -0.42830088523138937, -0.14191207434244765, 0.10719364893748207, 0.15025956348108593, 0.032815975738534085, -0.025115107597230235, -0.2722969258223505, 0.13496030691749183, -0.24054220668040216, -0.08084133820102579, -0.07334898747649277, -0.04852292125481957, 0.04466392190048888, -0.34951365484448615, -0.0614399739917341, -0.02433630779948241, -0.021822323399343684, -0.06386452800506959, -0.1283760715086828, 0.0036298868908488657, 0.1903662746632714, 0.018185757099521044, -0.0021783279419954247, 0.16059050262750438, -0.1214542470630325, -0.22166343851373918, 0.3974573905773771, -0.036762100064758364, -0.15395096295590824, 0.14126409921906694, -0.0018290586819299885, -0.14405082739115946, 0.11741687734380928, 0.21791799939334547, 0.12681320979512142, -0.1323104094141551, 0.04766201354626295, -0.09730559952489178, 0.18556560202099112, 0.055059006986994063, 0.03477420512778432, 0.10689681264254129, 0.24807446458241125, 0.20511944874912538, 0.1373907956409918, -0.06523185612362188, -0.14837458982947282, -0.2109344180522991, -0.14348251227299139, -0.20024765827838564, 0.03176828698512205, -0.14344540640953105, -0.1138464611164333, 0.37311539275591105, 0.20957288693170995, 0.10952258404237607, 0.16022867243592978, 0.39620602689198375, 0.033316095226837206, 0.025337769196388155, 0.22217780632975823, 0.19033961136301514, -0.029702435034171987, 0.1802989814641478, -0.22634283275389558, 0.07972705345324964, 0.00040215762176861364]
|
1,803.07587
|
HINT: A Hierarchical Independent Component Analysis Toolbox for
Investigating Brain Functional Networks using Neuroimaging Data
|
Independent component analysis (ICA) is a popular tool for investigating
brain organization in neuroscience research. In fMRI studies, an important goal
is to study how brain networks are modulated by subjects' clinical and
demographic variables. Existing ICA methods and toolboxes don't incorporate
subjects' covariates effects in ICA estimation of brain networks, which
potentially leads to loss in accuracy and statistical power in detecting brain
network differences between subjects' groups. We introduce a Matlab toolbox,
HINT (Hierarchical INdependent component analysis Toolbox), that provides a
hierarchical covariate-adjusted ICA (hc-ICA) for modeling and testing covariate
effects and generates model-based estimates of brain networks on both the
population- and individual-level. HINT provides a user-friendly Matlab GUI that
allows users to easily load images, specify covariate effects, monitor model
estimation via an EM algorithm, specify hypothesis tests, and visualize
results. HINT also has a command line interface which allows users to
conveniently run and reproduce the analysis with a script. HINT implements a
new multi-level probabilistic ICA model for group ICA. It provides a
statistically principled ICA modeling framework for investigating covariate
effects on brain networks. HINT can also generate and visualize model-based
network estimates for user-specified subject groups, which greatly facilitates
group comparisons.
|
stat.CO
|
independent component analysis ica is a popular tool for investigating brain organization in neuroscience research in fmri studies an important goal is to study how brain networks are modulated by subjects clinical and demographic variables existing ica methods and toolboxes dont incorporate subjects covariates effects in ica estimation of brain networks which potentially leads to loss in accuracy and statistical power in detecting brain network differences between subjects groups we introduce a matlab toolbox hint hierarchical independent component analysis toolbox that provides a hierarchical covariateadjusted ica hcica for modeling and testing covariate effects and generates modelbased estimates of brain networks on both the population and individuallevel hint provides a userfriendly matlab gui that allows users to easily load images specify covariate effects monitor model estimation via an em algorithm specify hypothesis tests and visualize results hint also has a command line interface which allows users to conveniently run and reproduce the analysis with a script hint implements a new multilevel probabilistic ica model for group ica it provides a statistically principled ica modeling framework for investigating covariate effects on brain networks hint can also generate and visualize modelbased network estimates for userspecified subject groups which greatly facilitates group comparisons
|
[['independent', 'component', 'analysis', 'ica', 'is', 'a', 'popular', 'tool', 'for', 'investigating', 'brain', 'organization', 'in', 'neuroscience', 'research', 'in', 'fmri', 'studies', 'an', 'important', 'goal', 'is', 'to', 'study', 'how', 'brain', 'networks', 'are', 'modulated', 'by', 'subjects', 'clinical', 'and', 'demographic', 'variables', 'existing', 'ica', 'methods', 'and', 'toolboxes', 'dont', 'incorporate', 'subjects', 'covariates', 'effects', 'in', 'ica', 'estimation', 'of', 'brain', 'networks', 'which', 'potentially', 'leads', 'to', 'loss', 'in', 'accuracy', 'and', 'statistical', 'power', 'in', 'detecting', 'brain', 'network', 'differences', 'between', 'subjects', 'groups', 'we', 'introduce', 'a', 'matlab', 'toolbox', 'hint', 'hierarchical', 'independent', 'component', 'analysis', 'toolbox', 'that', 'provides', 'a', 'hierarchical', 'covariateadjusted', 'ica', 'hcica', 'for', 'modeling', 'and', 'testing', 'covariate', 'effects', 'and', 'generates', 'modelbased', 'estimates', 'of', 'brain', 'networks', 'on', 'both', 'the', 'population', 'and', 'individuallevel', 'hint', 'provides', 'a', 'userfriendly', 'matlab', 'gui', 'that', 'allows', 'users', 'to', 'easily', 'load', 'images', 'specify', 'covariate', 'effects', 'monitor', 'model', 'estimation', 'via', 'an', 'em', 'algorithm', 'specify', 'hypothesis', 'tests', 'and', 'visualize', 'results', 'hint', 'also', 'has', 'a', 'command', 'line', 'interface', 'which', 'allows', 'users', 'to', 'conveniently', 'run', 'and', 'reproduce', 'the', 'analysis', 'with', 'a', 'script', 'hint', 'implements', 'a', 'new', 'multilevel', 'probabilistic', 'ica', 'model', 'for', 'group', 'ica', 'it', 'provides', 'a', 'statistically', 'principled', 'ica', 'modeling', 'framework', 'for', 'investigating', 'covariate', 'effects', 'on', 'brain', 'networks', 'hint', 'can', 'also', 'generate', 'and', 'visualize', 'modelbased', 'network', 'estimates', 'for', 'userspecified', 'subject', 'groups', 'which', 'greatly', 'facilitates', 'group', 'comparisons']]
|
[-0.043779452256105765, -0.01256705371935198, -0.15423683530058374, 0.12557472795661953, -0.16761915171707067, -0.2647646730742182, 0.025216947133873936, 0.4257423186444235, -0.21933616005881418, -0.31513600772002126, 0.05928324492156713, -0.24558518225967418, -0.218122161908266, 0.20209044051318983, -0.09405777009434509, 0.04990924589542879, 0.12100341402974939, -0.016425708762424142, 0.01753434022380547, -0.20296713930079618, 0.21916380250294965, 0.08015765484558851, 0.3440730892347567, -0.009986833075997468, 0.07616523226706612, 0.025729995871179107, -0.13481738604370017, 0.006728190631191764, -0.0794678951212766, 0.13678195165244467, 0.403059692902848, 0.2632317143530471, 0.36809733451692145, -0.42269420409292885, -0.27061979937592917, 0.10721831580605169, 0.14435606852651225, 0.09056769518212256, -0.02258528665653571, -0.3461143844713918, 0.031929937153678346, -0.15087863724888068, -0.03427415332789862, -0.16929650413944866, -0.037171260143613744, -0.07008313823572473, -0.351524229246107, 0.10558569373185464, 0.02756490046746389, 0.16174245420184852, -0.02918527471524842, -0.11778610728380054, 0.029934913115199618, 0.17258301617064975, 0.06599103436908788, 0.021735924894620447, 0.1969543129295073, -0.07808528288891962, -0.13200144278299478, 0.30318931477953387, 0.007805593082189767, -0.22090772933190256, 0.19436661911789666, -0.04329480061359289, -0.2117307291617805, 0.07643151548410344, 0.29163620463628886, 0.0026453429423837047, -0.236705431432435, 0.01850251784057808, -0.002228264273567633, 0.25714879452352024, -0.027555230765067266, -0.05489761888454057, 0.1652210363142211, 0.22781525442677766, 0.04122851781471811, 0.11830519986658762, -0.10193860138965785, -0.039658235490670185, -0.23264203390466387, -0.11453630708421421, -0.0997867075952165, -0.07253212719818965, -0.15833931339067123, -0.1816756594479272, 0.44986329415831905, 0.19307273311065415, 0.12353970587836823, 0.09916397190424661, 0.3106126714935244, -0.0003146281103707022, 0.08464570163344645, 0.08477371070896172, 0.08921548229262392, 0.14968218321258184, 0.0839944358143692, -0.16950538638988605, 0.1715975147319224, -0.02123328716719918]
|
1,803.07588
|
A Push-Pull Gradient Method for Distributed Optimization in Networks
|
In this paper, we focus on solving a distributed convex optimization problem
in a network, where each agent has its own convex cost function and the goal is
to minimize the sum of the agents' cost functions while obeying the network
connectivity structure. In order to minimize the sum of the cost functions, we
consider a new distributed gradient-based method where each node maintains two
estimates, namely, an estimate of the optimal decision variable and an estimate
of the gradient for the average of the agents' objective functions. From the
viewpoint of an agent, the information about the decision variable is pushed to
the neighbors, while the information about the gradients is pulled from the
neighbors (hence giving the name "push-pull gradient method"). The method
unifies the algorithms with different types of distributed architecture,
including decentralized (peer-to-peer), centralized (master-slave), and
semi-centralized (leader-follower) architecture. We show that the algorithm
converges linearly for strongly convex and smooth objective functions over a
directed static network. In our numerical test, the algorithm performs well
even for time-varying directed networks.
|
math.OC cs.DC cs.NI
|
in this paper we focus on solving a distributed convex optimization problem in a network where each agent has its own convex cost function and the goal is to minimize the sum of the agents cost functions while obeying the network connectivity structure in order to minimize the sum of the cost functions we consider a new distributed gradientbased method where each node maintains two estimates namely an estimate of the optimal decision variable and an estimate of the gradient for the average of the agents objective functions from the viewpoint of an agent the information about the decision variable is pushed to the neighbors while the information about the gradients is pulled from the neighbors hence giving the name pushpull gradient method the method unifies the algorithms with different types of distributed architecture including decentralized peertopeer centralized masterslave and semicentralized leaderfollower architecture we show that the algorithm converges linearly for strongly convex and smooth objective functions over a directed static network in our numerical test the algorithm performs well even for timevarying directed networks
|
[['in', 'this', 'paper', 'we', 'focus', 'on', 'solving', 'a', 'distributed', 'convex', 'optimization', 'problem', 'in', 'a', 'network', 'where', 'each', 'agent', 'has', 'its', 'own', 'convex', 'cost', 'function', 'and', 'the', 'goal', 'is', 'to', 'minimize', 'the', 'sum', 'of', 'the', 'agents', 'cost', 'functions', 'while', 'obeying', 'the', 'network', 'connectivity', 'structure', 'in', 'order', 'to', 'minimize', 'the', 'sum', 'of', 'the', 'cost', 'functions', 'we', 'consider', 'a', 'new', 'distributed', 'gradientbased', 'method', 'where', 'each', 'node', 'maintains', 'two', 'estimates', 'namely', 'an', 'estimate', 'of', 'the', 'optimal', 'decision', 'variable', 'and', 'an', 'estimate', 'of', 'the', 'gradient', 'for', 'the', 'average', 'of', 'the', 'agents', 'objective', 'functions', 'from', 'the', 'viewpoint', 'of', 'an', 'agent', 'the', 'information', 'about', 'the', 'decision', 'variable', 'is', 'pushed', 'to', 'the', 'neighbors', 'while', 'the', 'information', 'about', 'the', 'gradients', 'is', 'pulled', 'from', 'the', 'neighbors', 'hence', 'giving', 'the', 'name', 'pushpull', 'gradient', 'method', 'the', 'method', 'unifies', 'the', 'algorithms', 'with', 'different', 'types', 'of', 'distributed', 'architecture', 'including', 'decentralized', 'peertopeer', 'centralized', 'masterslave', 'and', 'semicentralized', 'leaderfollower', 'architecture', 'we', 'show', 'that', 'the', 'algorithm', 'converges', 'linearly', 'for', 'strongly', 'convex', 'and', 'smooth', 'objective', 'functions', 'over', 'a', 'directed', 'static', 'network', 'in', 'our', 'numerical', 'test', 'the', 'algorithm', 'performs', 'well', 'even', 'for', 'timevarying', 'directed', 'networks']]
|
[-0.12225419841706753, 0.0064600715941716255, -0.05344228253167655, 0.014054018297631825, -0.09074261212189283, -0.16942327300086618, 0.08576172265656559, 0.4165010521401252, -0.3445226172038487, -0.2706323493884078, 0.08672372938799007, -0.27113098934292795, -0.18612069050714905, 0.11428573287624334, -0.09794394843014223, 0.07660834003738792, 0.04712361312870469, 0.08759920438219394, -0.032334081668606296, -0.28158484908153436, 0.30144433882220517, 0.03453201569616795, 0.2823250980422433, 0.012726279651480061, 0.17168374374841472, 0.0536680725270084, -0.00798445463446634, 0.0340277690979253, -0.07249622819899482, 0.13935404009518346, 0.2463218054221943, 0.20379172708573087, 0.3891800800697612, -0.4256528611188488, -0.17064124871577535, 0.12931663838481264, 0.12158662605165903, 0.06225291969254613, 0.015446005683791425, -0.2526277811878494, 0.09054861584811338, -0.14727888057507307, -0.06553977653118116, -0.022395615593663282, -0.05269789267863546, 0.09237903296880956, -0.3316563851961733, 0.01857691142441971, 0.03306948066090366, 0.00531536279246211, -0.10012158412020654, -0.12555207761403706, 0.005079492552738105, 0.14578617824574133, 0.02833064423408359, 0.08250885950002287, 0.16361946120326007, -0.1426964650715568, -0.15707459452428987, 0.35193955070206095, -0.011236227660972093, -0.23777158966953202, 0.14788675585495575, -0.03665918979261603, -0.13618186398808446, 0.10717614652189825, 0.24604709995644433, 0.17380128019888486, -0.17528961967710138, 0.04996036653273872, -0.049838475451937744, 0.1445181875882138, 0.0006349133354212556, 0.005927359403244087, 0.13097481612249146, 0.2074951417770769, 0.2273623162734189, 0.17226305607706308, -0.03304091539633061, -0.17141516430303455, -0.2505667322300516, -0.13127118241174945, -0.2294213404506445, -0.034766601631501026, -0.1558488539390133, -0.15558205532708339, 0.4200913736437048, 0.12855184362935168, 0.19272008600511722, 0.1545567661523819, 0.35915640590446335, 0.10187917132861912, 0.05277944951185158, 0.17017222809871393, 0.18778538806496986, 0.08083863569822694, 0.09436804915312677, -0.22453051105274685, 0.13431618132229362, 0.058727145870881424]
|
1,803.07589
|
The Swift/BAT AGN Spectroscopic Survey -- IX. The Clustering
Environments of an Unbiased Sample of Local AGN
|
We characterize the environments of local accreting supermassive black holes
by measuring the clustering of AGN in the Swift/BAT Spectroscopic Survey
(BASS). With 548 AGN in the redshift range 0.01<z<0.1 over the full sky from
the DR1 catalog, BASS provides the largest, least biased sample of local AGN to
date due to its hard X-ray selection (14-195 keV) and rich
multiwavelength/ancillary data. By measuring the projected cross-correlation
function between the AGN and 2MASS galaxies, and interpreting it via halo
occupation distribution (HOD) and subhalo-based models, we constrain the
occupation statistics of the full sample, as well as in bins of absorbing
column density and black hole mass. We find that AGN tend to reside in galaxy
group environments, in agreement with previous studies of AGN throughout a
large range of luminosity and redshift, and that on average they occupy their
dark matter halos similar to inactive galaxies of comparable stellar mass. We
also find evidence that obscured AGN tend to reside in denser environments than
unobscured AGN, even when samples were matched in luminosity, redshift, stellar
mass, and Eddington ratio. We show that this can be explained either by
significantly different halo occupation distributions or statistically
different host halo assembly histories. Lastly, we see that massive black holes
are slightly more likely to reside in central galaxies than black holes of
smaller mass.
|
astro-ph.GA
|
we characterize the environments of local accreting supermassive black holes by measuring the clustering of agn in the swiftbat spectroscopic survey bass with 548 agn in the redshift range 001z01 over the full sky from the dr1 catalog bass provides the largest least biased sample of local agn to date due to its hard xray selection 14195 kev and rich multiwavelengthancillary data by measuring the projected crosscorrelation function between the agn and 2mass galaxies and interpreting it via halo occupation distribution hod and subhalobased models we constrain the occupation statistics of the full sample as well as in bins of absorbing column density and black hole mass we find that agn tend to reside in galaxy group environments in agreement with previous studies of agn throughout a large range of luminosity and redshift and that on average they occupy their dark matter halos similar to inactive galaxies of comparable stellar mass we also find evidence that obscured agn tend to reside in denser environments than unobscured agn even when samples were matched in luminosity redshift stellar mass and eddington ratio we show that this can be explained either by significantly different halo occupation distributions or statistically different host halo assembly histories lastly we see that massive black holes are slightly more likely to reside in central galaxies than black holes of smaller mass
|
[['we', 'characterize', 'the', 'environments', 'of', 'local', 'accreting', 'supermassive', 'black', 'holes', 'by', 'measuring', 'the', 'clustering', 'of', 'agn', 'in', 'the', 'swiftbat', 'spectroscopic', 'survey', 'bass', 'with', '548', 'agn', 'in', 'the', 'redshift', 'range', '001z01', 'over', 'the', 'full', 'sky', 'from', 'the', 'dr1', 'catalog', 'bass', 'provides', 'the', 'largest', 'least', 'biased', 'sample', 'of', 'local', 'agn', 'to', 'date', 'due', 'to', 'its', 'hard', 'xray', 'selection', '14195', 'kev', 'and', 'rich', 'multiwavelengthancillary', 'data', 'by', 'measuring', 'the', 'projected', 'crosscorrelation', 'function', 'between', 'the', 'agn', 'and', '2mass', 'galaxies', 'and', 'interpreting', 'it', 'via', 'halo', 'occupation', 'distribution', 'hod', 'and', 'subhalobased', 'models', 'we', 'constrain', 'the', 'occupation', 'statistics', 'of', 'the', 'full', 'sample', 'as', 'well', 'as', 'in', 'bins', 'of', 'absorbing', 'column', 'density', 'and', 'black', 'hole', 'mass', 'we', 'find', 'that', 'agn', 'tend', 'to', 'reside', 'in', 'galaxy', 'group', 'environments', 'in', 'agreement', 'with', 'previous', 'studies', 'of', 'agn', 'throughout', 'a', 'large', 'range', 'of', 'luminosity', 'and', 'redshift', 'and', 'that', 'on', 'average', 'they', 'occupy', 'their', 'dark', 'matter', 'halos', 'similar', 'to', 'inactive', 'galaxies', 'of', 'comparable', 'stellar', 'mass', 'we', 'also', 'find', 'evidence', 'that', 'obscured', 'agn', 'tend', 'to', 'reside', 'in', 'denser', 'environments', 'than', 'unobscured', 'agn', 'even', 'when', 'samples', 'were', 'matched', 'in', 'luminosity', 'redshift', 'stellar', 'mass', 'and', 'eddington', 'ratio', 'we', 'show', 'that', 'this', 'can', 'be', 'explained', 'either', 'by', 'significantly', 'different', 'halo', 'occupation', 'distributions', 'or', 'statistically', 'different', 'host', 'halo', 'assembly', 'histories', 'lastly', 'we', 'see', 'that', 'massive', 'black', 'holes', 'are', 'slightly', 'more', 'likely', 'to', 'reside', 'in', 'central', 'galaxies', 'than', 'black', 'holes', 'of', 'smaller', 'mass']]
|
[-0.016284731938925094, 0.10915566039191585, -0.05041294842452755, 0.2047556710879348, -0.10475628267619674, -0.03883259612260959, 0.07616135402165387, 0.47416177877473614, -0.06745279980486267, -0.39937118080137, 0.01355225297862588, -0.3501385744762232, 0.03334565849935771, 0.19026866270654846, -0.029806850056640164, -0.048394796043901483, -0.014813421558529745, -0.14046231376605606, -0.050368057829193555, -0.32581113027282294, 0.31824687101385174, 0.08925415558015666, 0.18011339135337368, -0.10914272894636133, 0.07060860647668228, -0.0486766924977311, -0.11350321311849207, 0.02208978428275691, -0.16511007124214772, 0.00352690463919378, 0.3058223531555156, 0.1409458231749287, 0.233151761280811, -0.3069141550550982, -0.17114837923375847, 0.11862180000213207, 0.24779516789741915, 0.04916086549158482, -0.1037637875855893, -0.25117536650957933, 0.07083809850629466, -0.2589453729439782, -0.1251629734553009, 0.06125073641858894, 0.03302622077211198, 0.06364247150196614, -0.1617678869304951, 0.229230416226343, 0.011164557888821543, 0.006636665750514059, -0.12395549847742299, -0.08606881199075896, -0.12432593706788757, 0.06476439612591534, 0.04624681468795968, 0.06122676427244331, 0.26054107750517347, -0.16061038473132172, -0.010672683204414652, 0.3902653149263017, -0.007958928692682407, 0.010034639809735759, 0.2506933326188188, -0.2813838856590794, -0.1715422466511067, 0.10832594878030245, 0.20189546127129362, 0.12048972385558321, -0.13562383617273674, 0.007815414950108299, -0.047852488579671004, 0.27142867994625375, 0.004818155124732946, 0.07236404956413388, 0.377629235442949, 0.06290043796027053, 0.08626677217678382, 0.08469806782104816, -0.16791552662553383, -0.00920396919332748, -0.18363119425922125, -0.05860458711179066, -0.17769162835736604, 0.11589320520849317, -0.17766022278002266, -0.11599584434990565, 0.3243593015598462, 0.13378751011274553, 0.25559908343474824, 0.11313179667777808, 0.2943665802513392, 0.06544792802679895, 0.11329491433847645, 0.12440687471924863, 0.31942470820106533, 0.14950079356353915, 0.03338414703325128, -0.2240748796727913, 0.03941107078400605, -0.01009273340365095]
|
1,803.0759
|
On the Basel Liquidity Formula for Elliptical Distributions
|
A justification of the Basel liquidity formula for risk capital in the
trading book is given under the assumption that market risk-factor changes form
a Gaussian white noise process over 10-day time steps and changes to P&L are
linear in the risk-factor changes. A generalization of the formula is derived
under the more general assumption that risk-factor changes are multivariate
elliptical. It is shown that the Basel formula tends to be conservative when
the elliptical distributions are from the heavier-tailed generalized hyperbolic
family. As a by-product of the analysis a Fourier approach to calculating
expected shortfall for general symmetric loss distributions is developed.
|
q-fin.RM
|
a justification of the basel liquidity formula for risk capital in the trading book is given under the assumption that market riskfactor changes form a gaussian white noise process over 10day time steps and changes to pl are linear in the riskfactor changes a generalization of the formula is derived under the more general assumption that riskfactor changes are multivariate elliptical it is shown that the basel formula tends to be conservative when the elliptical distributions are from the heaviertailed generalized hyperbolic family as a byproduct of the analysis a fourier approach to calculating expected shortfall for general symmetric loss distributions is developed
|
[['a', 'justification', 'of', 'the', 'basel', 'liquidity', 'formula', 'for', 'risk', 'capital', 'in', 'the', 'trading', 'book', 'is', 'given', 'under', 'the', 'assumption', 'that', 'market', 'riskfactor', 'changes', 'form', 'a', 'gaussian', 'white', 'noise', 'process', 'over', '10day', 'time', 'steps', 'and', 'changes', 'to', 'pl', 'are', 'linear', 'in', 'the', 'riskfactor', 'changes', 'a', 'generalization', 'of', 'the', 'formula', 'is', 'derived', 'under', 'the', 'more', 'general', 'assumption', 'that', 'riskfactor', 'changes', 'are', 'multivariate', 'elliptical', 'it', 'is', 'shown', 'that', 'the', 'basel', 'formula', 'tends', 'to', 'be', 'conservative', 'when', 'the', 'elliptical', 'distributions', 'are', 'from', 'the', 'heaviertailed', 'generalized', 'hyperbolic', 'family', 'as', 'a', 'byproduct', 'of', 'the', 'analysis', 'a', 'fourier', 'approach', 'to', 'calculating', 'expected', 'shortfall', 'for', 'general', 'symmetric', 'loss', 'distributions', 'is', 'developed']]
|
[-0.06372008509074961, 0.05911602861094244, -0.15705460790562834, 0.16542250083743393, -0.0840544916635144, -0.1171891197191497, 0.03455154329890982, 0.3719409912535288, -0.23780845232235576, -0.24689346591679795, 0.12411195015335835, -0.2672947613902173, -0.16510925817108957, 0.19876433382696898, -0.1759874561521252, 0.033910029893288916, 0.032389036101714064, -0.0035057007159938294, -0.05748751254930857, -0.25200511153461863, 0.28594858966568865, 0.06926069066868824, 0.3046895530056751, -0.021591463068599624, 0.07368187321583375, 0.005354895288106597, -0.039017152981561366, -0.005385223161248328, -0.10433998174429363, 0.10637790278686454, 0.24638133943171323, 0.12150825396433328, 0.31563708017742964, -0.36866604319764573, -0.1864219529789339, 0.12581487696219995, 0.03181399220094374, 0.05755955578524222, 0.014396649673869336, -0.23709294731611186, 0.059031722298597246, -0.21634259009824217, -0.15747394431744097, -0.05598078572724774, 0.07477516591327392, 0.0259046142839474, -0.34725635826081325, 0.10220394125976826, 0.13207509190305272, 0.04639853154678119, -0.0737772883250586, -0.11874924809671938, -0.03190629347001465, 0.06411311350388733, 0.1046939145372977, -0.018323551411333593, 0.14695398888247793, -0.0795751036714437, -0.06870295511540568, 0.36611956019560327, -0.11548325720975555, -0.230811359999403, 0.06948044319926462, -0.15200294141015672, -0.11883443731642826, 0.13216977101723545, 0.16370919861297295, 0.08311932521772761, -0.19159894806032807, 0.0785415744656489, -0.04987657020429095, 0.11345858665214834, 0.10018509434246757, -0.015769082332907008, 0.13944006458069513, 0.11783928757994572, 0.09905313161988426, 0.14638330478976183, -0.07833045318686557, -0.15727407546732033, -0.3235316607124597, -0.13926085075634775, -0.1702968270960942, 0.07954957365912828, -0.11548125335720065, -0.19676875578125405, 0.3323265258833151, 0.05837834049106657, 0.15003929040349515, 0.12940718775199164, 0.2721182932371943, 0.21636706572738068, 0.033166088570741194, 0.0689156434851364, 0.14824580709061141, 0.10492786435970983, 0.07491829202768112, -0.15314754602630415, 0.17618971143948656, 0.016769966571727423]
|
1,803.07591
|
A probabilistic variant of Sperner's theorem and of maximal $r$-cover
free families
|
A family of sets is called $r$-\emph{cover free} if no set in the family is
contained in the union of $r$ (or less) other sets in the family. A $1$-cover
free family is simply an antichain with respect to set inclusion. Thus,
Sperner's classical result determines the maximal cardinality of a $1$-cover
free family of subsets of an $n$-element set. Estimating the maximal
cardinality of an $r$-cover free family of subsets of an $n$-element set for
$r>1$ was also studied. In this note we are interested in the following
probabilistic variant of this problem. Let $S_0,S_1,\ldots, S_r$ be independent
and identically distributed random subsets of an $n$-element set. Which
distribution minimizes the probability that $S_0\subseteq {\bigcup_{i=1}^r
S_i}$? A natural candidate is the uniform distribution on an $r$-cover-free
family of maximal cardinality. We show that for $r=1$ such distribution is
indeed best possible. In a complete contrast, we also show that this is far
from being true for every $r>1$ and $n$ large enough.
|
math.CO math.PR
|
a family of sets is called remphcover free if no set in the family is contained in the union of r or less other sets in the family a 1cover free family is simply an antichain with respect to set inclusion thus sperners classical result determines the maximal cardinality of a 1cover free family of subsets of an nelement set estimating the maximal cardinality of an rcover free family of subsets of an nelement set for r1 was also studied in this note we are interested in the following probabilistic variant of this problem let s_0s_1ldots s_r be independent and identically distributed random subsets of an nelement set which distribution minimizes the probability that s_0subseteq bigcup_i1r s_i a natural candidate is the uniform distribution on an rcoverfree family of maximal cardinality we show that for r1 such distribution is indeed best possible in a complete contrast we also show that this is far from being true for every r1 and n large enough
|
[['a', 'family', 'of', 'sets', 'is', 'called', 'remphcover', 'free', 'if', 'no', 'set', 'in', 'the', 'family', 'is', 'contained', 'in', 'the', 'union', 'of', 'r', 'or', 'less', 'other', 'sets', 'in', 'the', 'family', 'a', '1cover', 'free', 'family', 'is', 'simply', 'an', 'antichain', 'with', 'respect', 'to', 'set', 'inclusion', 'thus', 'sperners', 'classical', 'result', 'determines', 'the', 'maximal', 'cardinality', 'of', 'a', '1cover', 'free', 'family', 'of', 'subsets', 'of', 'an', 'nelement', 'set', 'estimating', 'the', 'maximal', 'cardinality', 'of', 'an', 'rcover', 'free', 'family', 'of', 'subsets', 'of', 'an', 'nelement', 'set', 'for', 'r1', 'was', 'also', 'studied', 'in', 'this', 'note', 'we', 'are', 'interested', 'in', 'the', 'following', 'probabilistic', 'variant', 'of', 'this', 'problem', 'let', 's_0s_1ldots', 's_r', 'be', 'independent', 'and', 'identically', 'distributed', 'random', 'subsets', 'of', 'an', 'nelement', 'set', 'which', 'distribution', 'minimizes', 'the', 'probability', 'that', 's_0subseteq', 'bigcup_i1r', 's_i', 'a', 'natural', 'candidate', 'is', 'the', 'uniform', 'distribution', 'on', 'an', 'rcoverfree', 'family', 'of', 'maximal', 'cardinality', 'we', 'show', 'that', 'for', 'r1', 'such', 'distribution', 'is', 'indeed', 'best', 'possible', 'in', 'a', 'complete', 'contrast', 'we', 'also', 'show', 'that', 'this', 'is', 'far', 'from', 'being', 'true', 'for', 'every', 'r1', 'and', 'n', 'large', 'enough']]
|
[-0.15656443991383928, 0.13676475415916098, -0.01281086367311751, 0.03255424562138713, -0.06161944710524978, -0.07766873562103434, 0.05092878674103576, 0.3322209263499233, -0.31533303481354646, -0.22032659478332836, 0.07957089814479065, -0.33983341036186476, -0.08045309538075071, 0.1952707871014644, -0.1303860406794698, 0.022260347238866388, 0.028053802441046306, 0.1323083952531978, 0.002404279296158866, -0.2632051267168799, 0.34484256509169464, -0.04044515028993368, 0.24754974044930594, -0.008150595916541898, 0.08809468993074765, 0.027113949405444655, 0.02394359449931616, 0.07028762280798642, -0.16956310167349392, 0.1231636461041049, 0.22349672872650253, 0.2144416602743937, 0.2914073835334675, -0.3229801902778456, -0.14875374075505812, 0.2534736452452174, 0.14188577078733663, 0.039240294440863, -0.009186873314042047, -0.18547498861885375, 0.15495065644169878, -0.16976775964692378, -0.16532376827078926, -0.009486268155846246, 0.105901327701938, 0.006576560763938791, -0.32860372939805504, -0.02912637966004301, 0.10251754053696326, 0.07130529394890123, -0.02367002519950935, -0.14482290149446886, -0.02809926499849909, 0.06107822407606491, -0.0166861182820218, 0.08785208065216993, 0.016111590635182728, -0.0427205444797043, -0.08272463578588454, 0.3677991684782022, -0.03901360131752719, -0.23564658514342632, 0.13441855194058958, -0.13837534611878596, -0.16193834794195855, 0.10776516801980175, 0.09765136025543474, 0.155872237245748, -0.14307141687222727, 0.16226787287905028, -0.1914824007173917, 0.15880833304365563, 0.07982492362442693, 0.0608534449081168, 0.1928751821671227, 0.11987369409376744, 0.17425862035809, 0.18948230641459524, -0.016394751471212242, -0.030919922155752233, -0.3740723306953812, -0.13113095182747503, -0.23640039897001805, 0.08576424273693412, -0.12242686610789762, -0.23749260658955879, 0.355640147486405, 0.09965705744452051, 0.2066760002917189, 0.10238449834361317, 0.18461621310087337, 0.054092710339156524, 0.010317264818794029, 0.12891856304245294, 0.0930540460346498, 0.07588729701022719, -0.11183447737519624, -0.13869961237410308, 0.0911377535296521, 0.1066273079390169]
|
1,803.07592
|
Critical domains for the first nonzero Neumann eigenvalue in Riemannian
manifolds
|
The present paper is devoted to geometric optimization problems related to
the Neumann eigenvalue problem for the Laplace-Beltrami operator on bounded
subdomains $\Omega$ of a Riemannian manifold $(\mathcal{M},g)$. More precisely,
we analyze locally extremal domains for the first nontrivial eigenvalue
$\mu_2(\Omega)$ with respect to volume preserving domain perturbations, and we
show that corresponding notions of criticality arise in the form of
overdetermined boundary problems. Our results rely on an extension of Zanger's
shape derivative formula which covers the case when $\mu_2(\Omega)$ is not a
simple eigenvalue. In the second part of the paper, we focus on product
manifolds of the form $\mathcal{M} = \mathbb{R}^k \times \mathcal{N}$, and we
classify the subdomains where an associated overdetermined boundary value
problem has a solution.
|
math.AP math.DG
|
the present paper is devoted to geometric optimization problems related to the neumann eigenvalue problem for the laplacebeltrami operator on bounded subdomains omega of a riemannian manifold mathcalmg more precisely we analyze locally extremal domains for the first nontrivial eigenvalue mu_2omega with respect to volume preserving domain perturbations and we show that corresponding notions of criticality arise in the form of overdetermined boundary problems our results rely on an extension of zangers shape derivative formula which covers the case when mu_2omega is not a simple eigenvalue in the second part of the paper we focus on product manifolds of the form mathcalm mathbbrk times mathcaln and we classify the subdomains where an associated overdetermined boundary value problem has a solution
|
[['the', 'present', 'paper', 'is', 'devoted', 'to', 'geometric', 'optimization', 'problems', 'related', 'to', 'the', 'neumann', 'eigenvalue', 'problem', 'for', 'the', 'laplacebeltrami', 'operator', 'on', 'bounded', 'subdomains', 'omega', 'of', 'a', 'riemannian', 'manifold', 'mathcalmg', 'more', 'precisely', 'we', 'analyze', 'locally', 'extremal', 'domains', 'for', 'the', 'first', 'nontrivial', 'eigenvalue', 'mu_2omega', 'with', 'respect', 'to', 'volume', 'preserving', 'domain', 'perturbations', 'and', 'we', 'show', 'that', 'corresponding', 'notions', 'of', 'criticality', 'arise', 'in', 'the', 'form', 'of', 'overdetermined', 'boundary', 'problems', 'our', 'results', 'rely', 'on', 'an', 'extension', 'of', 'zangers', 'shape', 'derivative', 'formula', 'which', 'covers', 'the', 'case', 'when', 'mu_2omega', 'is', 'not', 'a', 'simple', 'eigenvalue', 'in', 'the', 'second', 'part', 'of', 'the', 'paper', 'we', 'focus', 'on', 'product', 'manifolds', 'of', 'the', 'form', 'mathcalm', 'mathbbrk', 'times', 'mathcaln', 'and', 'we', 'classify', 'the', 'subdomains', 'where', 'an', 'associated', 'overdetermined', 'boundary', 'value', 'problem', 'has', 'a', 'solution']]
|
[-0.14611209451882248, 0.0029207250084277996, -0.04687113536643099, 0.029991749957783007, -0.1317016903952766, -0.10791507071791952, -0.05811036960417483, 0.3253517065788111, -0.2905011475399262, -0.196505405480813, 0.19579972371169435, -0.31625746772820207, -0.1518474416611638, 0.16092253390586145, -0.13889591765449139, 0.08350945556411098, 0.09828100599810294, 0.10035187304176453, -0.11040189941491962, -0.19991511755286395, 0.4596958082764089, -0.07938843697090359, 0.21914432797299213, 0.08592561731885869, 0.10121801747752651, -0.04905365700950893, 0.021506110216029176, 0.042335479123079604, -0.18818905580420284, 0.15044874700858502, 0.26378754441498703, 0.07833532508885284, 0.2770366399543934, -0.41862693083856034, -0.15550297472008187, 0.17931480002941705, 0.12712058817435587, 0.015006742617232772, 0.010606765126229357, -0.28758378400263857, 0.08732190286787618, -0.07907353523343864, -0.15164226706789322, -0.03311791712175585, 0.01613957277585228, -0.06925404523381916, -0.2801220002603725, 0.09086527368601631, 0.09414985703946162, 0.027470790514988557, -0.12281061109045849, -0.1079422767868876, 0.02265824601562897, 0.07778517260463681, 0.033254150829489244, 0.020558701344851812, 0.06868636217594397, -0.0638685840135049, -0.0839145731008729, 0.37432192391207236, -0.031134417268815412, -0.32809327611652744, 0.10920257343198447, -0.1358889637812346, -0.1494953744035183, 0.07774177945821295, 0.18026148780256884, 0.21245364050240012, -0.08913895152687748, 0.1901826505821214, -0.06349793647048103, 0.13457958078591012, 0.07921841145813965, -0.026878185879376505, 0.0926926009564371, 0.13044446119999498, 0.21360303146936813, 0.1864619624674782, 0.0031159997916733453, -0.09912360245127137, -0.35343385993369986, -0.1536227472414098, -0.20616335620391457, 0.09004505529831958, -0.11552911936554924, -0.2318063550511328, 0.40216294719892387, 0.07875091173224338, 0.21113730913435086, 0.10399824459821831, 0.2187987089689289, 0.14000392578906154, 0.0032775577846444956, 0.11141008173874697, 0.14705947142861345, 0.1713455124002952, 0.0887402877673319, -0.20797247912939207, -0.024732143058590277, 0.15067361863836268]
|
1,803.07593
|
Statistical Analysis of Solar Events Associated with Storm Sudden
Commencements over One Year of Solar Maximum during Cycle 23: Propagation
from the Sun to the Earth and Effects
|
Taking the 32 storm sudden commencements (SSCs) listed by ISGI during 2002 as
a starting point, we performed a multi-criterion analysis based on observations
(propagation time, velocity comparisons, sense of the magnetic field rotation,
radio waves) to associate them with solar sources. We identified their effects
in the interplanetary medium, and looked at the response of the terrestrial
ionized and neutral environment. We find that 28 SSCs can be related to 44
coronal mass ejections (CMEs), 15 with a unique CME and 13 with a series of
multiple CMEs, among which 19 involved halo CMEs; 12 of the 19 fastest CMEs
with speeds greater than 1000 km/s are halo CMEs. The probability for an SSC to
occur is 75% if the CME is a halo CME. The complex interactions between two
CMEs and the modification of their trajectories have been examined using joint
white-light and multiple-wavelength radio observations. The solar-wind
structures at L1 after the shocks leading the 32 SSCs are 12 magnetic clouds
(MCs), 6 interplanetary CMEs (ICMEs) without an MC structure, 4 miscellaneous
structures, which cannot unambiguously be classified as ICMEs, 5 corotating or
stream interaction regions (CIRs/SIRs), and 4 isolated shock events; note than
one CIR caused two SSCs. The 11 MCs listed in 3 or more MC catalogs covering
the year 2002 are associated with SSCs. For the 3 most intense geomagnetic
storms related to MCs, we note 2 sudden increases of the Dst, at the arrival of
the sheath and the arrival of the MC itself. The most geoeffective events are
MCs, since 92% of them trigger moderate or intense storms, followed by ICMEs
(33%). At best, CIRs/SIRs only cause weak storms. We show that these
geoeffective events (ICMEs or MCs) trigger or reinforce terrestrial radiowave
activity in the magnetosphere, an enhanced convection in the ionosphere, and a
stronger response in the thermosphere.
|
astro-ph.SR physics.space-ph
|
taking the 32 storm sudden commencements sscs listed by isgi during 2002 as a starting point we performed a multicriterion analysis based on observations propagation time velocity comparisons sense of the magnetic field rotation radio waves to associate them with solar sources we identified their effects in the interplanetary medium and looked at the response of the terrestrial ionized and neutral environment we find that 28 sscs can be related to 44 coronal mass ejections cmes 15 with a unique cme and 13 with a series of multiple cmes among which 19 involved halo cmes 12 of the 19 fastest cmes with speeds greater than 1000 kms are halo cmes the probability for an ssc to occur is 75 if the cme is a halo cme the complex interactions between two cmes and the modification of their trajectories have been examined using joint whitelight and multiplewavelength radio observations the solarwind structures at l1 after the shocks leading the 32 sscs are 12 magnetic clouds mcs 6 interplanetary cmes icmes without an mc structure 4 miscellaneous structures which cannot unambiguously be classified as icmes 5 corotating or stream interaction regions cirssirs and 4 isolated shock events note than one cir caused two sscs the 11 mcs listed in 3 or more mc catalogs covering the year 2002 are associated with sscs for the 3 most intense geomagnetic storms related to mcs we note 2 sudden increases of the dst at the arrival of the sheath and the arrival of the mc itself the most geoeffective events are mcs since 92 of them trigger moderate or intense storms followed by icmes 33 at best cirssirs only cause weak storms we show that these geoeffective events icmes or mcs trigger or reinforce terrestrial radiowave activity in the magnetosphere an enhanced convection in the ionosphere and a stronger response in the thermosphere
|
[['taking', 'the', '32', 'storm', 'sudden', 'commencements', 'sscs', 'listed', 'by', 'isgi', 'during', '2002', 'as', 'a', 'starting', 'point', 'we', 'performed', 'a', 'multicriterion', 'analysis', 'based', 'on', 'observations', 'propagation', 'time', 'velocity', 'comparisons', 'sense', 'of', 'the', 'magnetic', 'field', 'rotation', 'radio', 'waves', 'to', 'associate', 'them', 'with', 'solar', 'sources', 'we', 'identified', 'their', 'effects', 'in', 'the', 'interplanetary', 'medium', 'and', 'looked', 'at', 'the', 'response', 'of', 'the', 'terrestrial', 'ionized', 'and', 'neutral', 'environment', 'we', 'find', 'that', '28', 'sscs', 'can', 'be', 'related', 'to', '44', 'coronal', 'mass', 'ejections', 'cmes', '15', 'with', 'a', 'unique', 'cme', 'and', '13', 'with', 'a', 'series', 'of', 'multiple', 'cmes', 'among', 'which', '19', 'involved', 'halo', 'cmes', '12', 'of', 'the', '19', 'fastest', 'cmes', 'with', 'speeds', 'greater', 'than', '1000', 'kms', 'are', 'halo', 'cmes', 'the', 'probability', 'for', 'an', 'ssc', 'to', 'occur', 'is', '75', 'if', 'the', 'cme', 'is', 'a', 'halo', 'cme', 'the', 'complex', 'interactions', 'between', 'two', 'cmes', 'and', 'the', 'modification', 'of', 'their', 'trajectories', 'have', 'been', 'examined', 'using', 'joint', 'whitelight', 'and', 'multiplewavelength', 'radio', 'observations', 'the', 'solarwind', 'structures', 'at', 'l1', 'after', 'the', 'shocks', 'leading', 'the', '32', 'sscs', 'are', '12', 'magnetic', 'clouds', 'mcs', '6', 'interplanetary', 'cmes', 'icmes', 'without', 'an', 'mc', 'structure', '4', 'miscellaneous', 'structures', 'which', 'can', 'not', 'unambiguously', 'be', 'classified', 'as', 'icmes', '5', 'corotating', 'or', 'stream', 'interaction', 'regions', 'cirssirs', 'and', '4', 'isolated', 'shock', 'events', 'note', 'than', 'one', 'cir', 'caused', 'two', 'sscs', 'the', '11', 'mcs', 'listed', 'in', '3', 'or', 'more', 'mc', 'catalogs', 'covering', 'the', 'year', '2002', 'are', 'associated', 'with', 'sscs', 'for', 'the', '3', 'most', 'intense', 'geomagnetic', 'storms', 'related', 'to', 'mcs', 'we', 'note', '2', 'sudden', 'increases', 'of', 'the', 'dst', 'at', 'the', 'arrival', 'of', 'the', 'sheath', 'and', 'the', 'arrival', 'of', 'the', 'mc', 'itself', 'the', 'most', 'geoeffective', 'events', 'are', 'mcs', 'since', '92', 'of', 'them', 'trigger', 'moderate', 'or', 'intense', 'storms', 'followed', 'by', 'icmes', '33', 'at', 'best', 'cirssirs', 'only', 'cause', 'weak', 'storms', 'we', 'show', 'that', 'these', 'geoeffective', 'events', 'icmes', 'or', 'mcs', 'trigger', 'or', 'reinforce', 'terrestrial', 'radiowave', 'activity', 'in', 'the', 'magnetosphere', 'an', 'enhanced', 'convection', 'in', 'the', 'ionosphere', 'and', 'a', 'stronger', 'response', 'in', 'the', 'thermosphere']]
|
[-0.14134657858175476, 0.22770779195150895, 0.021683439387737476, 0.16423430396099362, -0.0421546629730466, -0.030302735045552254, 0.025709376365305504, 0.4421924363419998, -0.15846878390232697, -0.406496102909871, 0.0827139407014733, -0.2749109632256471, -0.09311850638329691, 0.18296837110777714, -0.008534146902711417, -0.015070448475859427, 0.10763747495784746, -0.024536561620348663, -0.050925399235744954, -0.22193061406008924, 0.2209108260511938, 0.10699290075960259, 0.14835635597400634, -0.03501339122714639, 0.09009375318343099, -0.08782946951767229, -0.06016178031184169, -0.032772241499247574, -0.05810490382548606, 0.02507235958040053, 0.16629066299270456, 0.12968860361329432, 0.23023838218335013, -0.46246511084971087, -0.2324238826453783, 0.016917530250936456, 0.16754245492507966, -0.029569773397977568, -0.014924340390018567, -0.30423108273942107, 0.07510918584573113, -0.20007403828873258, -0.13867993401196096, 0.11800124447981468, 0.057147790382622306, 0.05824422506232034, -0.2720513937352271, 0.118834917627205, 0.010615783847040601, 0.13989788137895232, -0.0960125057144681, -0.06816178142303127, -0.02910810010507703, 0.1193790458579505, 0.11360664148754106, 0.09071068234781254, 0.20728672296721853, -0.10075447185298282, -0.10442090808741863, 0.40012188365125995, -0.005532081138964261, -0.04416072696486938, 0.2537563060451409, -0.25381933160997805, -0.1626474188213287, 0.22574099673939224, 0.14958872243889845, 0.04397529987196036, -0.14563188262932836, -0.07264271349603542, -0.018758530243455123, 0.1324353121884747, 0.11450602861997836, -0.018037852832706633, 0.2290180946930062, 0.0705411558760805, 0.05178522714641968, 0.0608471793906681, -0.24104044171243455, -0.027835204412101532, -0.23800424043630522, -0.11181248347670619, -0.07386463720144497, 0.046103625813641, -0.1215640837651924, -0.1270270505834453, 0.3934747556352294, 0.16710317816609652, 0.1887843879265977, -0.054910385750654135, 0.24857612691661404, 0.08450559761262579, 0.06396224104960638, 0.20153437328777501, 0.3026524334765508, 0.15311946316920463, 0.1651663454190057, -0.16416952468521795, 0.09470648679492716, 0.044850881575162406]
|
1,803.07594
|
Hydrodynamic Flows on Curved Surfaces: Spectral Numerical Methods for
Radial Manifold Shapes
|
We formulate hydrodynamic equations and spectrally accurate numerical methods
for investigating the role of geometry in flows within two-dimensional fluid
interfaces. To achieve numerical approximations having high precision and level
of symmetry for radial manifold shapes, we develop spectral Galerkin methods
based on hyperinterpolation with Lebedev quadratures for $L^2$-projection to
spherical harmonics. We demonstrate our methods by investigating hydrodynamic
responses as the surface geometry is varied. Relative to the case of a sphere,
we find significant changes can occur in the observed hydrodynamic flow
responses as exhibited by quantitative and topological transitions in the
structure of the flow. We present numerical results based on the
Rayleigh-Dissipation principle to gain further insights into these flow
responses. We investigate the roles played by the geometry especially
concerning the positive and negative Gaussian curvature of the interface. We
provide general approaches for taking geometric effects into account for
investigations of hydrodynamic phenomena within curved fluid interfaces.
|
cond-mat.soft physics.comp-ph
|
we formulate hydrodynamic equations and spectrally accurate numerical methods for investigating the role of geometry in flows within twodimensional fluid interfaces to achieve numerical approximations having high precision and level of symmetry for radial manifold shapes we develop spectral galerkin methods based on hyperinterpolation with lebedev quadratures for l2projection to spherical harmonics we demonstrate our methods by investigating hydrodynamic responses as the surface geometry is varied relative to the case of a sphere we find significant changes can occur in the observed hydrodynamic flow responses as exhibited by quantitative and topological transitions in the structure of the flow we present numerical results based on the rayleighdissipation principle to gain further insights into these flow responses we investigate the roles played by the geometry especially concerning the positive and negative gaussian curvature of the interface we provide general approaches for taking geometric effects into account for investigations of hydrodynamic phenomena within curved fluid interfaces
|
[['we', 'formulate', 'hydrodynamic', 'equations', 'and', 'spectrally', 'accurate', 'numerical', 'methods', 'for', 'investigating', 'the', 'role', 'of', 'geometry', 'in', 'flows', 'within', 'twodimensional', 'fluid', 'interfaces', 'to', 'achieve', 'numerical', 'approximations', 'having', 'high', 'precision', 'and', 'level', 'of', 'symmetry', 'for', 'radial', 'manifold', 'shapes', 'we', 'develop', 'spectral', 'galerkin', 'methods', 'based', 'on', 'hyperinterpolation', 'with', 'lebedev', 'quadratures', 'for', 'l2projection', 'to', 'spherical', 'harmonics', 'we', 'demonstrate', 'our', 'methods', 'by', 'investigating', 'hydrodynamic', 'responses', 'as', 'the', 'surface', 'geometry', 'is', 'varied', 'relative', 'to', 'the', 'case', 'of', 'a', 'sphere', 'we', 'find', 'significant', 'changes', 'can', 'occur', 'in', 'the', 'observed', 'hydrodynamic', 'flow', 'responses', 'as', 'exhibited', 'by', 'quantitative', 'and', 'topological', 'transitions', 'in', 'the', 'structure', 'of', 'the', 'flow', 'we', 'present', 'numerical', 'results', 'based', 'on', 'the', 'rayleighdissipation', 'principle', 'to', 'gain', 'further', 'insights', 'into', 'these', 'flow', 'responses', 'we', 'investigate', 'the', 'roles', 'played', 'by', 'the', 'geometry', 'especially', 'concerning', 'the', 'positive', 'and', 'negative', 'gaussian', 'curvature', 'of', 'the', 'interface', 'we', 'provide', 'general', 'approaches', 'for', 'taking', 'geometric', 'effects', 'into', 'account', 'for', 'investigations', 'of', 'hydrodynamic', 'phenomena', 'within', 'curved', 'fluid', 'interfaces']]
|
[-0.11019304270341404, 0.06890935032616223, -0.1285500924752437, 0.05945693640004672, -0.046092418099808706, -0.10953324123003863, -0.019143574730199026, 0.3853441268622287, -0.24120328909300856, -0.2924396266033383, 0.07639592677725504, -0.2419732394138057, -0.16605443893288457, 0.2049103909245643, -0.03343203268052189, 0.057659682468511164, 0.04147202386765888, -0.05915387018294974, -0.10187838360434398, -0.16998295448138379, 0.32325409178769116, 0.05456543748119944, 0.2721102575734748, 0.08693418248118465, 0.10486761475974497, -0.004735741914421516, -0.05297472775227537, 0.09017901921546773, -0.20825145742032633, 0.12031753203133408, 0.24459778962926448, 0.03604455442033022, 0.24218092601605398, -0.49674247957974377, -0.27684240721799525, 0.025882394467005628, 0.12170787216095241, 0.12840410318887352, -0.07761605176615137, -0.2837587225168184, 0.07000131001022007, -0.0974215038188145, -0.12623245017560916, -0.13881327793320739, -0.016320051977680505, 0.03748277616135678, -0.2528040022822863, 0.11117205485731431, 0.08199282280518098, 0.09510881111246387, -0.08501514068216477, -0.09986896366784717, -0.016360539279718835, 0.159824171425211, 0.041824126910222206, -0.056027934316501306, 0.11058668841494516, -0.13307530878994026, -0.10379913836521537, 0.41020963059150073, -0.07384849035818326, -0.2586729560892931, 0.18401335143962091, -0.1641461256689294, -0.08043087334494646, 0.13100042879140297, 0.2512035974589373, 0.10740898689867831, -0.07271789612078512, 0.03334407493208633, 0.010660706711381576, 0.132766426298124, 0.04967851114863726, -0.004308933571002471, 0.20666685926507375, 0.16379206255691028, 0.022539628902450204, 0.1354527666408103, -0.09376125453395377, -0.12302479998355634, -0.29275801383099814, -0.1471603439092034, -0.12959360957182453, 0.029882558279879096, -0.11002538900012089, -0.15656316726419486, 0.39658005479233044, 0.12420644315486577, 0.16613712503672823, 0.01872664041461815, 0.28174305094504043, 0.121910534268337, 0.006773828126729074, 0.06838670115011107, 0.2621055404030669, 0.17115609420579858, 0.100228806256047, -0.23052063226810118, 0.0072715147344799905, 0.1136682464918857]
|
1,803.07595
|
From $\gamma$ to Radio - The Electromagnetic Counterpart of GW 170817
|
The gravitational waves from the first binary neutron star merger, GW170817,
were accompanied by a multi-wavelength electromagnetic counterpart, from
$\gamma$-rays to radio. The accompanying gamma-rays, seems at first to confirm
the association of mergers with short gamma-ray bursts (sGRBs). The common
interpretation was that we see an emission from an sGRB jet seen off-axis.
However, a closer examination of the sub-luminous $\gamma$-rays and the
peculiar radio afterglow were inconsistent with this simple interpretation.
Here we present results of 3D and 2D numerical simulations that follow the
hydrodynamics and emission of the outflow from a neutron star merger form its
ejection and up to its deceleration by the circum-merger medium. Our results
show that the entire set of $\gamma$-rays, X-rays and radio observations can be
explained by the emission from a mildly relativistic cocoon material (Lorentz
factor $\sim$2-5) that was formed while a jet propagated through the material
ejected during the merger. The $\gamma$-rays are generated when the cocoon
breaks out from the engulfing ejecta while the afterglow is produced by
interaction of the cocoon matter with the interstellar medium. The strong early
uv/optical signal may be a Lorentz boosted macronova/kilonova. The fate of the
jet itself is currently unknown, but our full-EM models define a path to
resolving between successful and choked jet scenarios, outputting coupled
predictions for the image size, morphology, observed time-dependent
polarization and light curve behavior from radio to X-ray. The predictive power
of these models will prove key in interpreting the on-going multi-faceted
observations of this unprecedented event.
|
astro-ph.HE gr-qc
|
the gravitational waves from the first binary neutron star merger gw170817 were accompanied by a multiwavelength electromagnetic counterpart from gammarays to radio the accompanying gammarays seems at first to confirm the association of mergers with short gammaray bursts sgrbs the common interpretation was that we see an emission from an sgrb jet seen offaxis however a closer examination of the subluminous gammarays and the peculiar radio afterglow were inconsistent with this simple interpretation here we present results of 3d and 2d numerical simulations that follow the hydrodynamics and emission of the outflow from a neutron star merger form its ejection and up to its deceleration by the circummerger medium our results show that the entire set of gammarays xrays and radio observations can be explained by the emission from a mildly relativistic cocoon material lorentz factor sim25 that was formed while a jet propagated through the material ejected during the merger the gammarays are generated when the cocoon breaks out from the engulfing ejecta while the afterglow is produced by interaction of the cocoon matter with the interstellar medium the strong early uvoptical signal may be a lorentz boosted macronovakilonova the fate of the jet itself is currently unknown but our fullem models define a path to resolving between successful and choked jet scenarios outputting coupled predictions for the image size morphology observed timedependent polarization and light curve behavior from radio to xray the predictive power of these models will prove key in interpreting the ongoing multifaceted observations of this unprecedented event
|
[['the', 'gravitational', 'waves', 'from', 'the', 'first', 'binary', 'neutron', 'star', 'merger', 'gw170817', 'were', 'accompanied', 'by', 'a', 'multiwavelength', 'electromagnetic', 'counterpart', 'from', 'gammarays', 'to', 'radio', 'the', 'accompanying', 'gammarays', 'seems', 'at', 'first', 'to', 'confirm', 'the', 'association', 'of', 'mergers', 'with', 'short', 'gammaray', 'bursts', 'sgrbs', 'the', 'common', 'interpretation', 'was', 'that', 'we', 'see', 'an', 'emission', 'from', 'an', 'sgrb', 'jet', 'seen', 'offaxis', 'however', 'a', 'closer', 'examination', 'of', 'the', 'subluminous', 'gammarays', 'and', 'the', 'peculiar', 'radio', 'afterglow', 'were', 'inconsistent', 'with', 'this', 'simple', 'interpretation', 'here', 'we', 'present', 'results', 'of', '3d', 'and', '2d', 'numerical', 'simulations', 'that', 'follow', 'the', 'hydrodynamics', 'and', 'emission', 'of', 'the', 'outflow', 'from', 'a', 'neutron', 'star', 'merger', 'form', 'its', 'ejection', 'and', 'up', 'to', 'its', 'deceleration', 'by', 'the', 'circummerger', 'medium', 'our', 'results', 'show', 'that', 'the', 'entire', 'set', 'of', 'gammarays', 'xrays', 'and', 'radio', 'observations', 'can', 'be', 'explained', 'by', 'the', 'emission', 'from', 'a', 'mildly', 'relativistic', 'cocoon', 'material', 'lorentz', 'factor', 'sim25', 'that', 'was', 'formed', 'while', 'a', 'jet', 'propagated', 'through', 'the', 'material', 'ejected', 'during', 'the', 'merger', 'the', 'gammarays', 'are', 'generated', 'when', 'the', 'cocoon', 'breaks', 'out', 'from', 'the', 'engulfing', 'ejecta', 'while', 'the', 'afterglow', 'is', 'produced', 'by', 'interaction', 'of', 'the', 'cocoon', 'matter', 'with', 'the', 'interstellar', 'medium', 'the', 'strong', 'early', 'uvoptical', 'signal', 'may', 'be', 'a', 'lorentz', 'boosted', 'macronovakilonova', 'the', 'fate', 'of', 'the', 'jet', 'itself', 'is', 'currently', 'unknown', 'but', 'our', 'fullem', 'models', 'define', 'a', 'path', 'to', 'resolving', 'between', 'successful', 'and', 'choked', 'jet', 'scenarios', 'outputting', 'coupled', 'predictions', 'for', 'the', 'image', 'size', 'morphology', 'observed', 'timedependent', 'polarization', 'and', 'light', 'curve', 'behavior', 'from', 'radio', 'to', 'xray', 'the', 'predictive', 'power', 'of', 'these', 'models', 'will', 'prove', 'key', 'in', 'interpreting', 'the', 'ongoing', 'multifaceted', 'observations', 'of', 'this', 'unprecedented', 'event']]
|
[-0.061681851786858144, 0.14267995608175096, -0.10573712079340511, 0.1294329420494591, -0.16232323971395177, -0.06575657493727972, 0.013944500335440016, 0.4560496308080169, -0.22600961970749767, -0.30657448802900267, 0.034851852074681514, -0.2872675652226129, -0.03149863985572122, 0.21851894602205502, 0.0204942569644951, -0.020464930540985943, 0.12881382136138164, -0.07678654172691513, -0.06398109027112192, -0.1802093078627203, 0.2835113053262026, 0.154119278330252, 0.16545763939797165, 0.002177594834382078, 0.09651033577960971, -0.06895237305086566, -0.07316929096184079, -0.04059295722494918, -0.07513351669867589, 0.0357730277531977, 0.20088176307815384, 0.1572265645500228, 0.16263270457910625, -0.4217252101038631, -0.276192372431051, 0.05329145907899328, 0.15861735966212423, 0.03522894502488944, -0.07697954230693232, -0.32244991261439687, 0.04288880456520979, -0.25556160769781533, -0.15953520283036202, 0.08344760584641263, 0.009420851074204135, 0.041098557371809424, -0.19526289799343424, 0.10716772380353261, 0.023443695011899336, -0.0048847581432442146, -0.09467854640405789, 0.007566890871315541, -0.030135096662095285, 0.024968858995772638, 0.12345517451125401, 0.09718662246865076, 0.16863325000202573, -0.17721582082029713, -0.09488010395038131, 0.4412596624240695, -0.01780186846028583, 0.023175120127361372, 0.2058201796028288, -0.22143303127161623, -0.1579482669485696, 0.24233969203771585, 0.14486437295359444, 0.07569827359592712, -0.13903160151253052, -0.04569406688572334, -0.02667090518259076, 0.18587259495115108, 0.04653922180075614, 0.015862552268222807, 0.33463958607684746, 0.13046980786102033, -0.05561989840246232, 0.1331194012038098, -0.19135737440277975, 0.02616075776235397, -0.2994517829089214, -0.07811890889805152, -0.16184445673347528, 0.1448467703516673, -0.11562593010336762, -0.08915770308353912, 0.37793115388501836, 0.08460906096427995, 0.180347210569938, 0.00782926822038538, 0.31463343093720864, 0.07319512896976514, 0.042245485738246324, 0.146815505996532, 0.36380035229643204, 0.14569274298670476, 0.11584236347988486, -0.23194449833609104, 0.12076863453656703, 0.0042565087008612805]
|
1,803.07596
|
Mumford divisors
|
We define the notion of Mumford divisors, argue that they are the natural
divisors to study on reduced but non-normal varieties and prove a structure
theorem for the Mumford class group. v.2: references added
|
math.AG
|
we define the notion of mumford divisors argue that they are the natural divisors to study on reduced but nonnormal varieties and prove a structure theorem for the mumford class group v2 references added
|
[['we', 'define', 'the', 'notion', 'of', 'mumford', 'divisors', 'argue', 'that', 'they', 'are', 'the', 'natural', 'divisors', 'to', 'study', 'on', 'reduced', 'but', 'nonnormal', 'varieties', 'and', 'prove', 'a', 'structure', 'theorem', 'for', 'the', 'mumford', 'class', 'group', 'v2', 'references', 'added']]
|
[-0.1734823622562758, 0.06644427516114186, -0.1260018494692357, 0.1524107820518753, -0.10375021244673167, -0.1636202921406092, 0.013843693756772316, 0.2869369142195758, -0.3516977019608021, -0.21646036399418817, 0.054115794181330674, -0.26687161197118897, -0.17650684573249342, 0.20702348183840513, -0.2690716984353083, -0.07111454382538795, 0.06987304029547993, 0.06645177078762037, -0.07083857111180858, -0.3321588536217699, 0.44314170628786087, -0.06476579968105345, 0.25400969550451813, 0.09898961466901443, 0.07894374813665361, -0.011493302292793113, -0.04766052465557175, -0.02783297626849483, -0.15497785539007644, 0.18335971543017557, 0.3459902215639458, 0.09054676361847669, 0.22140527172151075, -0.3641915661008919, -0.1596939238062238, 0.19683131726239533, 0.04079705469912904, 0.04786608491421623, 0.044206985960687124, -0.24526047624428482, 0.11362885787863941, -0.15783903940909488, -0.23396857370458105, -0.174645389758927, 0.05447095662684125, 0.03382594981367754, -0.16881696405471303, -0.0725563883281532, 0.15558861174127636, 0.22360831438837683, -0.0016459391575635357, -0.11824946494444329, -0.08703997214187813, -0.018659680862637126, 0.03595827382934444, 0.001550723668461775, 0.12503715523737757, -0.1011330986614613, -0.0488976669662139, 0.38969434688196464, -0.02021083693184397, -0.23001423222012818, 0.09594630921149955, -0.14099153448991916, -0.1921508025021895, 0.07331922554465778, 0.12358578398604603, 0.1821019464336774, 0.006384397142991314, 0.12468308319769088, -0.1593134620172136, 0.06365651368875713, 0.1497880867545438, 0.012650327441994758, 0.07769556162769303, 0.020119962885099298, 0.07585467810413855, 0.08763963263481855, 0.01820036129998591, -0.029223888728986767, -0.3501946677399032, -0.19856810294475188, -0.09451655172468985, 0.14369363884907216, -0.09519586069740506, -0.2028364231262137, 0.38919946836198077, 0.08649152017417638, 0.16030816366786466, 0.17213417439009338, 0.15752164495643228, 0.064001977799789, 0.05886009535478318, 0.07724061046781786, 0.1474831371485968, 0.2120824882431942, -0.022970625760910267, -0.10252887643325855, 0.010455978198853485, 0.26300299479900036]
|
1,803.07597
|
Diffusion-driven transition between two regimes of viscous fingering
|
Viscous fingering patterns can form at the interface between two immiscible
fluids confined in the gap between a pair of flat plates; whenever the fluid
with lower viscosity displaces the one of higher viscosity the interface is
unstable. For miscible fluids the situation is more complicated due to the
formation of interfacial structure in the thin dimension spanning the gap. Here
we study the effect of the inherent diffusion between the two miscible fluids
on this structure and on the viscous fingering patterns that emerge. We
discover an unexpected transition separating two distinct regimes where the
pattern morphologies and mode of onset are different. This transition is marked
by a regime of transient stability as the structure of the fingers evolves from
having three-dimensional structure to being quasi-two dimensional. The presence
of diffusion allows an instability to form where it was otherwise forbidden.
|
physics.flu-dyn
|
viscous fingering patterns can form at the interface between two immiscible fluids confined in the gap between a pair of flat plates whenever the fluid with lower viscosity displaces the one of higher viscosity the interface is unstable for miscible fluids the situation is more complicated due to the formation of interfacial structure in the thin dimension spanning the gap here we study the effect of the inherent diffusion between the two miscible fluids on this structure and on the viscous fingering patterns that emerge we discover an unexpected transition separating two distinct regimes where the pattern morphologies and mode of onset are different this transition is marked by a regime of transient stability as the structure of the fingers evolves from having threedimensional structure to being quasitwo dimensional the presence of diffusion allows an instability to form where it was otherwise forbidden
|
[['viscous', 'fingering', 'patterns', 'can', 'form', 'at', 'the', 'interface', 'between', 'two', 'immiscible', 'fluids', 'confined', 'in', 'the', 'gap', 'between', 'a', 'pair', 'of', 'flat', 'plates', 'whenever', 'the', 'fluid', 'with', 'lower', 'viscosity', 'displaces', 'the', 'one', 'of', 'higher', 'viscosity', 'the', 'interface', 'is', 'unstable', 'for', 'miscible', 'fluids', 'the', 'situation', 'is', 'more', 'complicated', 'due', 'to', 'the', 'formation', 'of', 'interfacial', 'structure', 'in', 'the', 'thin', 'dimension', 'spanning', 'the', 'gap', 'here', 'we', 'study', 'the', 'effect', 'of', 'the', 'inherent', 'diffusion', 'between', 'the', 'two', 'miscible', 'fluids', 'on', 'this', 'structure', 'and', 'on', 'the', 'viscous', 'fingering', 'patterns', 'that', 'emerge', 'we', 'discover', 'an', 'unexpected', 'transition', 'separating', 'two', 'distinct', 'regimes', 'where', 'the', 'pattern', 'morphologies', 'and', 'mode', 'of', 'onset', 'are', 'different', 'this', 'transition', 'is', 'marked', 'by', 'a', 'regime', 'of', 'transient', 'stability', 'as', 'the', 'structure', 'of', 'the', 'fingers', 'evolves', 'from', 'having', 'threedimensional', 'structure', 'to', 'being', 'quasitwo', 'dimensional', 'the', 'presence', 'of', 'diffusion', 'allows', 'an', 'instability', 'to', 'form', 'where', 'it', 'was', 'otherwise', 'forbidden']]
|
[-0.18658448636802108, 0.21419478305212508, -0.09516494318360945, 0.0035463079876898156, -0.05273007336268006, -0.13811940641852316, -0.017914630498711046, 0.3255440335121605, -0.3197792328412195, -0.27702255887419014, 0.050711833915862065, -0.2747191073246979, -0.14832804565663105, 0.10539957947403818, 0.03327997311806449, -0.020364168371966147, -0.0179380960852051, -0.05567963592955595, -0.03962891244563971, -0.1474627121742424, 0.3784603933719071, -0.006956737592712149, 0.3061572317704819, 0.03465914859442965, 0.049262245032623726, -0.0762193318541077, 0.05723462321195537, 0.0664571119397895, -0.20706076017554265, 0.03478410427777709, 0.22864657249692436, -0.05478931280093958, 0.22558462912203758, -0.45443891492913235, -0.22335766369828602, 0.051225251970825704, 0.1575146748853678, 0.13223149035275764, -0.019513590166193005, -0.22381974187178108, 0.03441256396081689, -0.11863941489881673, -0.11678887102297032, 0.007353364398794158, 0.05086775344203819, -0.03851443364193754, -0.2329908210618936, 0.16345615994667154, 0.08988694863563235, 0.054805525910708454, -0.08938875343688028, -0.038828146412734174, -0.08577063885335061, 0.12187273248010869, 0.07356007213759647, -0.01980822943509198, 0.10780448813994344, -0.19173728757957362, -0.03137464685873552, 0.3890230121462235, -0.04937018114760831, -0.1858225597029591, 0.3216037818172074, -0.18378523598796317, -0.01181493097772965, 0.21118506485062255, 0.17061062319972714, 0.10597880056674977, -0.08629340474116062, 0.01582097558718227, -0.0429411292225904, 0.15587953685773082, 0.12627409401486492, -0.039119184867094654, 0.2343569411700787, 0.2353289708319296, 0.04707730775764147, 0.19803358174183153, -0.11100668116440912, -0.12962742059302707, -0.2647339425056235, -0.1725318990745484, -0.1410741982662031, 0.012819208691573956, -0.10732334513861158, -0.22525480124526298, 0.35770648342420486, 0.0844482645157145, 0.2045780714939941, -0.039447012598385345, 0.2729210023755221, 0.07043947847283256, 0.021074498918923466, 0.08716553799935024, 0.278550160612416, 0.13515371005897495, 0.12838517839157826, -0.2609084180566007, 0.10152056261610526, 0.06647049027358319]
|
1,803.07598
|
Secondary ion mass spectrometry for SRF cavity materials
|
Historically, many advances in superconducting radio frequency (SRF) cavities
destined for use in advanced particle accelerators have come empirically,
through the iterative procedure of modifying processing and then performance
testing. However, material structure is directly responsible for performance.
Understanding, the link between processing, structure, and performance will
streamline and accelerate the research process. In order to connect processing,
structure, and performance, accurate and robust materials characterization
methods are needed. Here one such method, SIMS, is discussed with focus on
analysis of SRF materials. In addition, several examples are presented, showing
how SIMS is being used to further understanding of materials based SRF
technologies.
|
physics.acc-ph
|
historically many advances in superconducting radio frequency srf cavities destined for use in advanced particle accelerators have come empirically through the iterative procedure of modifying processing and then performance testing however material structure is directly responsible for performance understanding the link between processing structure and performance will streamline and accelerate the research process in order to connect processing structure and performance accurate and robust materials characterization methods are needed here one such method sims is discussed with focus on analysis of srf materials in addition several examples are presented showing how sims is being used to further understanding of materials based srf technologies
|
[['historically', 'many', 'advances', 'in', 'superconducting', 'radio', 'frequency', 'srf', 'cavities', 'destined', 'for', 'use', 'in', 'advanced', 'particle', 'accelerators', 'have', 'come', 'empirically', 'through', 'the', 'iterative', 'procedure', 'of', 'modifying', 'processing', 'and', 'then', 'performance', 'testing', 'however', 'material', 'structure', 'is', 'directly', 'responsible', 'for', 'performance', 'understanding', 'the', 'link', 'between', 'processing', 'structure', 'and', 'performance', 'will', 'streamline', 'and', 'accelerate', 'the', 'research', 'process', 'in', 'order', 'to', 'connect', 'processing', 'structure', 'and', 'performance', 'accurate', 'and', 'robust', 'materials', 'characterization', 'methods', 'are', 'needed', 'here', 'one', 'such', 'method', 'sims', 'is', 'discussed', 'with', 'focus', 'on', 'analysis', 'of', 'srf', 'materials', 'in', 'addition', 'several', 'examples', 'are', 'presented', 'showing', 'how', 'sims', 'is', 'being', 'used', 'to', 'further', 'understanding', 'of', 'materials', 'based', 'srf', 'technologies']]
|
[-0.051926839472816406, 0.07116413420265161, -0.05008516654155208, 0.03167051464063582, -0.10403478200755363, -0.177700321648939, -0.005138006956470244, 0.49779877346913215, -0.23738475194544467, -0.32446251520254077, 0.12912668750250658, -0.23956255672626126, -0.18437048641838205, 0.3188325851326085, -0.0420320682652584, 0.10862215749865163, 0.09771579419922771, -0.01838920145630113, -0.08611639582741897, -0.23654502918898554, 0.26117595025672785, 0.12858378709953966, 0.3810003625943316, 0.0573107475455561, 0.044727128464728594, -0.05812836119914156, -0.05330712917018953, -0.024777247461951472, -0.08108735154156835, 0.17317946156649625, 0.30533375676034147, 0.14332562255971495, 0.3109241264931026, -0.4781374694029032, -0.24537170484879064, 0.05358477312962986, 0.15774921199207384, 0.06536660141772727, -0.11720561908526364, -0.21232591631813247, 0.084336402333224, -0.16233108164652169, -0.10010304754979692, -0.12648182947333286, -0.041910808886066804, 0.04377734687550048, -0.19995459007580754, -0.010259107442446125, 0.0605904444491545, 0.051747534285046304, -0.0321936057021534, -0.11601650252829766, 0.08171822301799304, 0.13468742003953718, 0.00720208673709687, -0.00031579773674167476, 0.17597165993116434, -0.11532142769219805, -0.16827774452931674, 0.38420636091128135, -0.0031326120296601674, -0.16688128947777656, 0.24422157694386698, -0.10265187554522553, -0.16212091112093438, 0.1062894214885038, 0.21350032705994484, 0.04415494020919777, -0.1688011813455587, 0.04502947759776132, 0.11147803898213558, 0.14494422849299368, 0.07629303013887799, 0.07882634639848494, 0.2033876543502929, 0.2597504956873803, 0.024722669555611223, 0.12383299801968833, -0.0684376007682888, -0.022647201020306755, -0.20061062583790243, -0.18968467338525496, -0.17289339674600554, -0.01948230245564013, -0.0036729167646997454, -0.12675690657495367, 0.37135427132321214, 0.1902443045316246, 0.12969071294172008, -0.06536876198437824, 0.35470648220224865, 0.03054506995362564, 0.07951041091757927, 0.07072484221544514, 0.24258196005344534, 0.15658745764191284, 0.12375477704138142, -0.18702132555936435, 0.09262364268420463, 0.03972406934684558]
|
1,803.07599
|
Thermal to Visible Synthesis of Face Images using Multiple Regions
|
Synthesis of visible spectrum faces from thermal facial imagery is a
promising approach for heterogeneous face recognition; enabling existing face
recognition software trained on visible imagery to be leveraged, and allowing
human analysts to verify cross-spectrum matches more effectively. We propose a
new synthesis method to enhance the discriminative quality of synthesized
visible face imagery by leveraging both global (e.g., entire face) and local
regions (e.g., eyes, nose, and mouth). Here, each region provides (1) an
independent representation for the corresponding area, and (2) additional
regularization terms, which impact the overall quality of synthesized images.
We analyze the effects of using multiple regions to synthesize a visible face
image from a thermal face. We demonstrate that our approach improves
cross-spectrum verification rates over recently published synthesis approaches.
Moreover, using our synthesized imagery, we report the results on facial
landmark detection-commonly used for image registration-which is a critical
part of the face recognition process.
|
cs.CV
|
synthesis of visible spectrum faces from thermal facial imagery is a promising approach for heterogeneous face recognition enabling existing face recognition software trained on visible imagery to be leveraged and allowing human analysts to verify crossspectrum matches more effectively we propose a new synthesis method to enhance the discriminative quality of synthesized visible face imagery by leveraging both global eg entire face and local regions eg eyes nose and mouth here each region provides 1 an independent representation for the corresponding area and 2 additional regularization terms which impact the overall quality of synthesized images we analyze the effects of using multiple regions to synthesize a visible face image from a thermal face we demonstrate that our approach improves crossspectrum verification rates over recently published synthesis approaches moreover using our synthesized imagery we report the results on facial landmark detectioncommonly used for image registrationwhich is a critical part of the face recognition process
|
[['synthesis', 'of', 'visible', 'spectrum', 'faces', 'from', 'thermal', 'facial', 'imagery', 'is', 'a', 'promising', 'approach', 'for', 'heterogeneous', 'face', 'recognition', 'enabling', 'existing', 'face', 'recognition', 'software', 'trained', 'on', 'visible', 'imagery', 'to', 'be', 'leveraged', 'and', 'allowing', 'human', 'analysts', 'to', 'verify', 'crossspectrum', 'matches', 'more', 'effectively', 'we', 'propose', 'a', 'new', 'synthesis', 'method', 'to', 'enhance', 'the', 'discriminative', 'quality', 'of', 'synthesized', 'visible', 'face', 'imagery', 'by', 'leveraging', 'both', 'global', 'eg', 'entire', 'face', 'and', 'local', 'regions', 'eg', 'eyes', 'nose', 'and', 'mouth', 'here', 'each', 'region', 'provides', '1', 'an', 'independent', 'representation', 'for', 'the', 'corresponding', 'area', 'and', '2', 'additional', 'regularization', 'terms', 'which', 'impact', 'the', 'overall', 'quality', 'of', 'synthesized', 'images', 'we', 'analyze', 'the', 'effects', 'of', 'using', 'multiple', 'regions', 'to', 'synthesize', 'a', 'visible', 'face', 'image', 'from', 'a', 'thermal', 'face', 'we', 'demonstrate', 'that', 'our', 'approach', 'improves', 'crossspectrum', 'verification', 'rates', 'over', 'recently', 'published', 'synthesis', 'approaches', 'moreover', 'using', 'our', 'synthesized', 'imagery', 'we', 'report', 'the', 'results', 'on', 'facial', 'landmark', 'detectioncommonly', 'used', 'for', 'image', 'registrationwhich', 'is', 'a', 'critical', 'part', 'of', 'the', 'face', 'recognition', 'process']]
|
[-0.004478554515050885, -0.05527825161360978, -0.08303442644726312, 0.0055420033384519455, -0.08609648218797829, -0.15689586304029488, 0.023717493023908395, 0.45933485369117844, -0.25473615611033723, -0.32476522138231245, 0.1256089637284198, -0.2789060389283822, -0.18511114600083686, 0.22006996599525608, -0.18533349150521156, 0.09041425662226235, 0.11288803915141632, 0.006529175058093588, -0.03231273300364453, -0.2342742658374424, 0.2581845058085064, 0.02520935189916401, 0.34479629720826416, 0.04576897122804692, 0.12154031982522039, -0.017949679006810073, -0.053678915903761684, -0.01264599109968997, -0.06447769892857824, 0.2264480358359731, 0.29350323613350654, 0.19226603434356168, 0.235827221396373, -0.41033167620837097, -0.21988821540811154, 0.048413574431147056, 0.1605942736845078, 0.09447451826070885, -0.0990378320058507, -0.37841059011407197, 0.10570894607299605, -0.13308991071465887, 0.0012899580078557231, -0.10152195293505657, -0.03161556870963375, -0.09385517069650505, -0.303506980853661, 0.03579672352589716, 0.020245974501039807, 0.13141421639415996, -0.10046452446378126, -0.11819219222101106, -0.020415817772883257, 0.2542066478898243, 0.00016286715673165557, 0.035212777588911205, 0.2032456371519986, -0.21469930280770932, -0.1022118661484823, 0.38999202734611876, -0.04661604666477994, -0.16517987020239727, 0.20756246700315484, -0.07630666517128316, -0.11498199522322575, 0.17103850399914955, 0.21908441961231018, 0.1287916088723485, -0.14102200605900378, 0.016616855956157608, -0.02920443501742865, 0.2360102570591038, 0.07810449777849462, -0.005141678756559329, 0.22254783819685536, 0.2078406535496084, 0.013085780208868697, 0.1886457942298225, -0.2233388263933416, 0.023441000329638948, -0.16542781580167065, -0.09307425531762227, -0.1836448241956532, -0.05194082017217004, -0.11636739881325278, -0.1235692798274119, 0.4482506007350833, 0.23970481844631253, 0.20464993218909824, 0.07742114861986125, 0.375191732056883, 0.018528848662910772, 0.11288711888752631, 0.02656789600004177, 0.19543431357970917, -0.05866237170223319, 0.1369042028881153, -0.1811388624918382, 0.08920125213963602, 0.05002767677011819]
|
1,803.076
|
Axionic black branes with conformal coupling
|
We find neutral and charged black branes solutions with axion fields in the
context of a conformally coupled gravitational theory in four dimensions. These
solutions describe AdS black branes supported by axion fields that break
translational invariance at the boundary, providing for momentum dissipation.
The conformally coupled scalar field is regular inside and outside the event
horizon and there is no need of any self-interaction, obtaining in this way
solutions without fine-tuned parameters. We analyze the thermodynamics of our
solutions considering the effects of the axion charges and it is shown that
axionic and electric charges must be related such that the conformal scalar
field does not contribute to the mass. We compute the holographic DC
conductivity and we show how it is affected by the inclusion of the conformal
scalar field, which provides a temperature independent behavior. We include a
non-linear axionic contribution given by a k-essence term that modifies the DC
conductivity providing for more general behaviors. Finally, we endorse our
solutions with rotation showing that angular momentum is sustained by the axion
charges.
|
hep-th gr-qc
|
we find neutral and charged black branes solutions with axion fields in the context of a conformally coupled gravitational theory in four dimensions these solutions describe ads black branes supported by axion fields that break translational invariance at the boundary providing for momentum dissipation the conformally coupled scalar field is regular inside and outside the event horizon and there is no need of any selfinteraction obtaining in this way solutions without finetuned parameters we analyze the thermodynamics of our solutions considering the effects of the axion charges and it is shown that axionic and electric charges must be related such that the conformal scalar field does not contribute to the mass we compute the holographic dc conductivity and we show how it is affected by the inclusion of the conformal scalar field which provides a temperature independent behavior we include a nonlinear axionic contribution given by a kessence term that modifies the dc conductivity providing for more general behaviors finally we endorse our solutions with rotation showing that angular momentum is sustained by the axion charges
|
[['we', 'find', 'neutral', 'and', 'charged', 'black', 'branes', 'solutions', 'with', 'axion', 'fields', 'in', 'the', 'context', 'of', 'a', 'conformally', 'coupled', 'gravitational', 'theory', 'in', 'four', 'dimensions', 'these', 'solutions', 'describe', 'ads', 'black', 'branes', 'supported', 'by', 'axion', 'fields', 'that', 'break', 'translational', 'invariance', 'at', 'the', 'boundary', 'providing', 'for', 'momentum', 'dissipation', 'the', 'conformally', 'coupled', 'scalar', 'field', 'is', 'regular', 'inside', 'and', 'outside', 'the', 'event', 'horizon', 'and', 'there', 'is', 'no', 'need', 'of', 'any', 'selfinteraction', 'obtaining', 'in', 'this', 'way', 'solutions', 'without', 'finetuned', 'parameters', 'we', 'analyze', 'the', 'thermodynamics', 'of', 'our', 'solutions', 'considering', 'the', 'effects', 'of', 'the', 'axion', 'charges', 'and', 'it', 'is', 'shown', 'that', 'axionic', 'and', 'electric', 'charges', 'must', 'be', 'related', 'such', 'that', 'the', 'conformal', 'scalar', 'field', 'does', 'not', 'contribute', 'to', 'the', 'mass', 'we', 'compute', 'the', 'holographic', 'dc', 'conductivity', 'and', 'we', 'show', 'how', 'it', 'is', 'affected', 'by', 'the', 'inclusion', 'of', 'the', 'conformal', 'scalar', 'field', 'which', 'provides', 'a', 'temperature', 'independent', 'behavior', 'we', 'include', 'a', 'nonlinear', 'axionic', 'contribution', 'given', 'by', 'a', 'kessence', 'term', 'that', 'modifies', 'the', 'dc', 'conductivity', 'providing', 'for', 'more', 'general', 'behaviors', 'finally', 'we', 'endorse', 'our', 'solutions', 'with', 'rotation', 'showing', 'that', 'angular', 'momentum', 'is', 'sustained', 'by', 'the', 'axion', 'charges']]
|
[-0.17513654370453546, 0.1801801202633545, -0.0684320529346058, 0.08379406271772248, -0.12212670520371334, -0.14290870174723255, -0.02464364121194442, 0.31489378071009094, -0.17617393743289125, -0.2817684812947515, 0.06111032270299885, -0.28372136621460825, -0.13164441141469235, 0.15304156131407415, -0.02238840616006531, 0.008172651213085786, -0.024073257761880417, 0.04502412492134185, -0.045065975975541565, -0.23261493715902112, 0.3672393181001429, 0.016785693578474984, 0.25082934098000725, 0.08560333211260679, 0.10533120649051853, -0.02024511645272882, 0.009048154643757945, 0.08421042066236789, -0.1415719316861958, 0.05775149665846997, 0.18734475840623913, 0.07350014169089097, 0.16361179313125004, -0.44034256833732466, -0.2282727481109429, 0.110933780951944, 0.13664174768068318, 0.15579787597165373, -0.11854136919257806, -0.26105516592823813, 0.0812396703503592, -0.1429200844775716, -0.17376379839631476, -0.11726505613213786, 0.018988049841110213, -0.02549045813793782, -0.2716689519663553, 0.1083877041343261, 0.04646366242906714, -0.024863305825089232, -0.12524630804546177, -0.027217548289627302, -0.0555917561869137, 0.054636393978646745, 0.15688088359655178, 0.049096838010551765, 0.18474889755915766, -0.18129781160281377, -0.08966411881093253, 0.358772920320255, -0.11239839779293768, -0.2696136323290623, 0.14193578840654067, -0.1638230362785345, -0.08754574388942936, 0.10810815410381606, 0.10661915530164895, 0.1426883835837626, -0.14999945425502534, 0.18470037141841286, 0.003818005929960319, 0.1840816377956468, 0.09580413336913228, 0.034279820380602774, 0.34370830425442284, 0.09685397872619267, 0.05307553393041334, 0.14894418626830552, -0.007380935721316332, -0.10788729566212912, -0.3778635207643013, -0.14187774727311495, -0.12486575229426804, 0.1046334406962408, -0.13230681991345508, -0.16340010857063383, 0.388105318389452, 0.1530552286360696, 0.15026896920409688, 0.02055352349799994, 0.24891718609036284, 0.14087191375868066, 0.10536919797992926, 0.1265450001466723, 0.3188062169700226, 0.11374930129254195, 0.16012959195359144, -0.2691282966512848, -0.08760313907607103, 0.06866834642344409]
|
1,803.07601
|
Gravitationally Lensed Quasars in Gaia: II. Discovery of 24 Lensed
Quasars
|
We report the discovery, spectroscopic confirmation and preliminary
characterisation of 24 gravitationally lensed quasars identified using Gaia
observations. Candidates were selected in the Pan-STARRS footprint with
quasar-like WISE colours or as photometric quasars from SDSS, requiring either
multiple detections in Gaia or a single Gaia detection near a morphological
galaxy. The Pan-STARRS grizY images were modelled for the most promising
candidates and 60 candidate systems were followed up with the William Herschel
Telescope. 13 of the lenses were discovered as Gaia multiples and 10 as single
Gaia detections near galaxies. We also discover 1 lens identified through a
quasar emission line in an SDSS galaxy spectrum. The lenses have median image
separation 2.13 arcsec and the source redshifts range from 1.06 to 3.36. 4
systems are quadruply-imaged and 20 are doubly-imaged. Deep CFHT data reveal an
Einstein ring in one double system. We also report 12 quasar pairs, 10 of which
have components at the same redshift and require further follow-up to rule out
the lensing hypothesis. We compare the properties of these lenses and other
known lenses recovered by our search method to a complete sample of simulated
lenses to show the lenses we are missing are mainly those with small
separations and higher source redshifts. The initial Gaia data release only
catalogues all images of ~ 30% of known bright lensed quasars, however the
improved completeness of Gaia data release 2 will help find all bright lensed
quasars on the sky.
|
astro-ph.GA
|
we report the discovery spectroscopic confirmation and preliminary characterisation of 24 gravitationally lensed quasars identified using gaia observations candidates were selected in the panstarrs footprint with quasarlike wise colours or as photometric quasars from sdss requiring either multiple detections in gaia or a single gaia detection near a morphological galaxy the panstarrs grizy images were modelled for the most promising candidates and 60 candidate systems were followed up with the william herschel telescope 13 of the lenses were discovered as gaia multiples and 10 as single gaia detections near galaxies we also discover 1 lens identified through a quasar emission line in an sdss galaxy spectrum the lenses have median image separation 213 arcsec and the source redshifts range from 106 to 336 4 systems are quadruplyimaged and 20 are doublyimaged deep cfht data reveal an einstein ring in one double system we also report 12 quasar pairs 10 of which have components at the same redshift and require further followup to rule out the lensing hypothesis we compare the properties of these lenses and other known lenses recovered by our search method to a complete sample of simulated lenses to show the lenses we are missing are mainly those with small separations and higher source redshifts the initial gaia data release only catalogues all images of 30 of known bright lensed quasars however the improved completeness of gaia data release 2 will help find all bright lensed quasars on the sky
|
[['we', 'report', 'the', 'discovery', 'spectroscopic', 'confirmation', 'and', 'preliminary', 'characterisation', 'of', '24', 'gravitationally', 'lensed', 'quasars', 'identified', 'using', 'gaia', 'observations', 'candidates', 'were', 'selected', 'in', 'the', 'panstarrs', 'footprint', 'with', 'quasarlike', 'wise', 'colours', 'or', 'as', 'photometric', 'quasars', 'from', 'sdss', 'requiring', 'either', 'multiple', 'detections', 'in', 'gaia', 'or', 'a', 'single', 'gaia', 'detection', 'near', 'a', 'morphological', 'galaxy', 'the', 'panstarrs', 'grizy', 'images', 'were', 'modelled', 'for', 'the', 'most', 'promising', 'candidates', 'and', '60', 'candidate', 'systems', 'were', 'followed', 'up', 'with', 'the', 'william', 'herschel', 'telescope', '13', 'of', 'the', 'lenses', 'were', 'discovered', 'as', 'gaia', 'multiples', 'and', '10', 'as', 'single', 'gaia', 'detections', 'near', 'galaxies', 'we', 'also', 'discover', '1', 'lens', 'identified', 'through', 'a', 'quasar', 'emission', 'line', 'in', 'an', 'sdss', 'galaxy', 'spectrum', 'the', 'lenses', 'have', 'median', 'image', 'separation', '213', 'arcsec', 'and', 'the', 'source', 'redshifts', 'range', 'from', '106', 'to', '336', '4', 'systems', 'are', 'quadruplyimaged', 'and', '20', 'are', 'doublyimaged', 'deep', 'cfht', 'data', 'reveal', 'an', 'einstein', 'ring', 'in', 'one', 'double', 'system', 'we', 'also', 'report', '12', 'quasar', 'pairs', '10', 'of', 'which', 'have', 'components', 'at', 'the', 'same', 'redshift', 'and', 'require', 'further', 'followup', 'to', 'rule', 'out', 'the', 'lensing', 'hypothesis', 'we', 'compare', 'the', 'properties', 'of', 'these', 'lenses', 'and', 'other', 'known', 'lenses', 'recovered', 'by', 'our', 'search', 'method', 'to', 'a', 'complete', 'sample', 'of', 'simulated', 'lenses', 'to', 'show', 'the', 'lenses', 'we', 'are', 'missing', 'are', 'mainly', 'those', 'with', 'small', 'separations', 'and', 'higher', 'source', 'redshifts', 'the', 'initial', 'gaia', 'data', 'release', 'only', 'catalogues', 'all', 'images', 'of', '30', 'of', 'known', 'bright', 'lensed', 'quasars', 'however', 'the', 'improved', 'completeness', 'of', 'gaia', 'data', 'release', '2', 'will', 'help', 'find', 'all', 'bright', 'lensed', 'quasars', 'on', 'the', 'sky']]
|
[-0.05943803157857504, 0.037882829172664695, -0.0375620784999972, 0.07646294057293225, -0.15228143906555608, -0.08639102476102507, 0.041648487883720026, 0.44493340849799434, -0.13211888529808638, -0.41829987212030356, 0.10331413186971129, -0.41626058063616067, -0.018071940482386258, 0.23565518395197846, -0.010741212523363393, 0.02328425178483267, 0.10813912058543522, -0.12858517318944762, -0.006865236934595299, -0.37767053431934605, 0.2526001897813706, 0.06590692399438636, 0.15235825484832133, -0.12433591800403189, 0.09865074508490564, -0.06638022035664363, -0.17057119195218667, -0.006437360272504205, -0.13955883687258167, 0.0006441809102307913, 0.2680756344704327, 0.16279872856295305, 0.2070829350258847, -0.2517949848680616, -0.15713826783216936, 0.053397764619208934, 0.18939323976832204, 0.07665742881730062, -0.06511283268014831, -0.37058308008049945, 0.11671774868405047, -0.14733662863150393, -0.15871094955970372, 0.03380010186979347, 0.019165454788349013, 0.08239032628451481, -0.1629199672669311, 0.11383502944425511, -0.025094780322907045, 0.14582573247338407, -0.14453754868177496, -0.11633263577895686, -0.06739569088388311, 0.08325630391193631, -0.07942838415364958, 0.09336597740040199, 0.1259217296249795, -0.15348425718632427, -0.06858288089615824, 0.4195260199533452, -0.044108175659121195, 0.02876303760404121, 0.186020253540771, -0.19029608168466064, -0.20338288687596728, 0.14344428057786202, 0.176673311093622, 0.13025628825580346, -0.18820942189228868, -0.05447346630433097, 0.024101108529081584, 0.26929681154241214, 0.07693303910214916, 0.10234716822273456, 0.3312455531852397, 0.08233038604274885, 0.0402774030797235, 0.10407247850002745, -0.3346139114563669, 0.08005757136308889, -0.2645038181830732, -0.07746896299645151, -0.1631823060235532, 0.10541371283461032, -0.11554568827927712, -0.09228430079942769, 0.314839396414093, 0.12812720527987898, 0.205774450516867, 0.07226388278457697, 0.2956997633272828, -0.007936138778055194, 0.168126958764874, 0.02516341405682081, 0.380061684230204, 0.08107677744682262, 0.08405224523027928, -0.10346752260609583, -0.028699487717129477, -0.023250433737566033]
|
1,803.07602
|
UnibucKernel: A kernel-based learning method for complex word
identification
|
In this paper, we present a kernel-based learning approach for the 2018
Complex Word Identification (CWI) Shared Task. Our approach is based on
combining multiple low-level features, such as character n-grams, with
high-level semantic features that are either automatically learned using word
embeddings or extracted from a lexical knowledge base, namely WordNet. After
feature extraction, we employ a kernel method for the learning phase. The
feature matrix is first transformed into a normalized kernel matrix. For the
binary classification task (simple versus complex), we employ Support Vector
Machines. For the regression task, in which we have to predict the complexity
level of a word (a word is more complex if it is labeled as complex by more
annotators), we employ v-Support Vector Regression. We applied our approach
only on the three English data sets containing documents from Wikipedia,
WikiNews and News domains. Our best result during the competition was the third
place on the English Wikipedia data set. However, in this paper, we also report
better post-competition results.
|
cs.CL
|
in this paper we present a kernelbased learning approach for the 2018 complex word identification cwi shared task our approach is based on combining multiple lowlevel features such as character ngrams with highlevel semantic features that are either automatically learned using word embeddings or extracted from a lexical knowledge base namely wordnet after feature extraction we employ a kernel method for the learning phase the feature matrix is first transformed into a normalized kernel matrix for the binary classification task simple versus complex we employ support vector machines for the regression task in which we have to predict the complexity level of a word a word is more complex if it is labeled as complex by more annotators we employ vsupport vector regression we applied our approach only on the three english data sets containing documents from wikipedia wikinews and news domains our best result during the competition was the third place on the english wikipedia data set however in this paper we also report better postcompetition results
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'kernelbased', 'learning', 'approach', 'for', 'the', '2018', 'complex', 'word', 'identification', 'cwi', 'shared', 'task', 'our', 'approach', 'is', 'based', 'on', 'combining', 'multiple', 'lowlevel', 'features', 'such', 'as', 'character', 'ngrams', 'with', 'highlevel', 'semantic', 'features', 'that', 'are', 'either', 'automatically', 'learned', 'using', 'word', 'embeddings', 'or', 'extracted', 'from', 'a', 'lexical', 'knowledge', 'base', 'namely', 'wordnet', 'after', 'feature', 'extraction', 'we', 'employ', 'a', 'kernel', 'method', 'for', 'the', 'learning', 'phase', 'the', 'feature', 'matrix', 'is', 'first', 'transformed', 'into', 'a', 'normalized', 'kernel', 'matrix', 'for', 'the', 'binary', 'classification', 'task', 'simple', 'versus', 'complex', 'we', 'employ', 'support', 'vector', 'machines', 'for', 'the', 'regression', 'task', 'in', 'which', 'we', 'have', 'to', 'predict', 'the', 'complexity', 'level', 'of', 'a', 'word', 'a', 'word', 'is', 'more', 'complex', 'if', 'it', 'is', 'labeled', 'as', 'complex', 'by', 'more', 'annotators', 'we', 'employ', 'vsupport', 'vector', 'regression', 'we', 'applied', 'our', 'approach', 'only', 'on', 'the', 'three', 'english', 'data', 'sets', 'containing', 'documents', 'from', 'wikipedia', 'wikinews', 'and', 'news', 'domains', 'our', 'best', 'result', 'during', 'the', 'competition', 'was', 'the', 'third', 'place', 'on', 'the', 'english', 'wikipedia', 'data', 'set', 'however', 'in', 'this', 'paper', 'we', 'also', 'report', 'better', 'postcompetition', 'results']]
|
[-0.012690453560085978, 0.010677417071709064, -0.0722105422553545, 0.08621228419517551, -0.17954187851516296, -0.12301722170595458, 0.09531945261747359, 0.4537308513448981, -0.2866288635232848, -0.2854851500331954, 0.05714444564948204, -0.3200418902114926, -0.1920961952297028, 0.19443523153679412, -0.07734819078081828, 0.047110273327795556, 0.15146568937444624, 0.10884424128317313, -0.047939409871312406, -0.277034390162855, 0.38213777238458485, -0.008392358396737697, 0.3179284483027048, -0.009636979254553774, 0.1278979464888595, -0.007405905506133052, -0.0754910090821098, -0.04795400667266396, -0.027526846583760107, 0.19155180018428647, 0.36338717078589305, 0.23101308500996517, 0.30283586407626817, -0.3647650827313522, -0.19452656915238473, 0.06886523032650173, 0.1019502894780013, 0.12210098971490062, -0.007109398407266269, -0.3451491586486168, 0.10356935435727596, -0.1863497854043133, 0.07785938315729271, -0.14940287066835486, -0.003537790958552125, -0.03555557322911472, -0.25336441371525764, 0.05029820366800919, 0.12792261116608175, 0.10378330174002595, -0.06359652210790999, -0.13405942942593024, 0.05460887558585378, 0.15457141627334506, 0.01273278650007919, 0.0827386028652322, 0.09825307367896538, -0.13874657197526383, -0.15212206550857085, 0.3815468457516305, -0.09189390279575736, -0.24531814711263214, 0.18880315042591603, -0.02863300533987537, -0.18550395250353896, 0.056744208280554785, 0.23802433321865912, 0.09829306875182661, -0.15744910560392156, 0.008266476462218732, -0.0777700796896246, 0.24307037389162414, 0.07689719096461903, -0.06836503329212794, 0.16555240901304175, 0.25774811491269817, -0.02077142838500217, 0.1401571497323917, -0.11297943561427116, -0.023945427708840835, -0.22426629024397438, -0.1295655044018776, -0.22284527977895058, -0.035424621519214376, -0.11321349585319739, -0.1564943535576859, 0.4145894872336955, 0.18847056718621247, 0.23140204984772794, 0.09159126416515158, 0.2989357212658771, 0.0410730148956471, 0.10178678639339071, 0.10488554540342612, 0.11509154520058881, -0.0060521525394974535, 0.1255513958069691, -0.12216835964783401, 0.09567335955199122, 0.11463700183025913]
|
1,803.07603
|
Schopenhauer on Space, Time, Causality and Matter: A Physical
Re-examination
|
According to Schopenhauer, Kant's arguments about the transcendental ideality
of space and time can be extended to matter through the concept of causality
and the principle of sufficient reason. In this article, I examine to what
extent space, time and causality can be considered a priori concepts in the
light of classical and modern physics. The concepts of matter and field, and
their possible a priori fundaments, as stated by Schopenhauer, are thus
revisited in a modern context.
|
physics.hist-ph
|
according to schopenhauer kants arguments about the transcendental ideality of space and time can be extended to matter through the concept of causality and the principle of sufficient reason in this article i examine to what extent space time and causality can be considered a priori concepts in the light of classical and modern physics the concepts of matter and field and their possible a priori fundaments as stated by schopenhauer are thus revisited in a modern context
|
[['according', 'to', 'schopenhauer', 'kants', 'arguments', 'about', 'the', 'transcendental', 'ideality', 'of', 'space', 'and', 'time', 'can', 'be', 'extended', 'to', 'matter', 'through', 'the', 'concept', 'of', 'causality', 'and', 'the', 'principle', 'of', 'sufficient', 'reason', 'in', 'this', 'article', 'i', 'examine', 'to', 'what', 'extent', 'space', 'time', 'and', 'causality', 'can', 'be', 'considered', 'a', 'priori', 'concepts', 'in', 'the', 'light', 'of', 'classical', 'and', 'modern', 'physics', 'the', 'concepts', 'of', 'matter', 'and', 'field', 'and', 'their', 'possible', 'a', 'priori', 'fundaments', 'as', 'stated', 'by', 'schopenhauer', 'are', 'thus', 'revisited', 'in', 'a', 'modern', 'context']]
|
[-0.06508989961156131, 0.12699061992431157, -0.1537620651590834, 0.16065415129598573, -0.13833231947041655, -0.1036861701194491, 0.0765039202769434, 0.3046671826343395, -0.3076670157330993, -0.3607857614069393, 0.14026618671395177, -0.1769584169317233, -0.14068275080430076, 0.17464975863204976, -0.105847990397658, 0.04284946360061631, -0.0211265778021985, 0.06497570613742266, -0.06360530682401364, -0.24223879642637544, 0.3558215476498988, 0.06018245579233687, 0.2194471220289798, 0.07710201769920164, 0.07856682387385885, 0.0002476457739248872, -0.0666997937001533, 0.050472831477523676, -0.13030549891195015, 0.12606901699971212, 0.2689896509798832, 0.2041536238485653, 0.2904399094956094, -0.4695752580699168, -0.2370338109566977, 0.11110551477605968, 0.11875778480163335, 0.07910232429735754, 0.008206197256712537, -0.3091615039095479, 0.0679962721448024, -0.11925573489861563, -0.17330035499272575, -0.05934004541517137, 0.011345406793560343, 0.016233464874523252, -0.18748571662428348, 0.06143626661383008, 0.08264327826174467, 0.05171355871042531, -0.02225226504761897, -0.0557725371817421, 0.030759292176777597, 0.0852835524036843, 0.06767902079675543, 0.023401911339820607, 0.1043289375221847, -0.11915739032893295, -0.13407448818907142, 0.4323267918570261, -0.018863950978572432, -0.19188408772951285, 0.18359264121758506, -0.13314470477818854, -0.08649962534515285, 0.051702031689561216, 0.14571429524374635, 0.06548395919564523, -0.18006647552216523, 0.08709370981638417, -0.028094323425504723, 0.15400633385319165, 0.05983199818231361, 0.08434952555935045, 0.24288090739987397, 0.13027469005043568, 0.0076169896454207206, 0.05798617546679452, -0.014264160813151025, -0.11005209303402808, -0.3602709384193938, -0.20810184545514762, -0.18247712861461637, 0.04000214818178823, -0.045588232330613356, -0.08683246605735469, 0.36275392388434785, 0.1848014423303539, 0.1248163697309792, -0.0023234589883175337, 0.25734758968342486, 0.08553735957876167, 0.02753598765948003, 0.03730191409244741, 0.2658986802102606, 0.1614341226338997, 0.14392088780694298, -0.14402535704491465, 0.054653295456725905, 0.04275170673836807]
|
1,803.07604
|
Continuous cohomology of topological quandles
|
A continuous cohomology theory for topological quandles is introduced, and
compared to the algebraic theories. Extensions of topological quandles are
studied with respect to continuous 2-cocycles, and used to show the differences
in second cohomology groups for specific topological quandles. A method of
computing the cohomology groups of the inverse limit is applied to quandles.
|
math.GT math.AT
|
a continuous cohomology theory for topological quandles is introduced and compared to the algebraic theories extensions of topological quandles are studied with respect to continuous 2cocycles and used to show the differences in second cohomology groups for specific topological quandles a method of computing the cohomology groups of the inverse limit is applied to quandles
|
[['a', 'continuous', 'cohomology', 'theory', 'for', 'topological', 'quandles', 'is', 'introduced', 'and', 'compared', 'to', 'the', 'algebraic', 'theories', 'extensions', 'of', 'topological', 'quandles', 'are', 'studied', 'with', 'respect', 'to', 'continuous', '2cocycles', 'and', 'used', 'to', 'show', 'the', 'differences', 'in', 'second', 'cohomology', 'groups', 'for', 'specific', 'topological', 'quandles', 'a', 'method', 'of', 'computing', 'the', 'cohomology', 'groups', 'of', 'the', 'inverse', 'limit', 'is', 'applied', 'to', 'quandles']]
|
[-0.20034318631514908, 0.07734005947343328, -0.10829567135396329, 0.13367684214714576, -0.1231842520900748, -0.1046923990784721, 0.00526620665861463, 0.35518847881731663, -0.37546167197552593, -0.23507085896033625, 0.08679982136554, -0.24526969736272639, -0.12989113618704407, 0.18579677590592342, -0.19594158544628457, 0.035104130089960314, -0.05029237217862498, 0.10722724260254339, -0.12834782493724065, -0.29654552792622285, 0.3911936350928789, -0.07994917089288885, 0.2344854115762494, 0.04276206528937275, 0.06516011343549259, -0.08049939384853298, -0.03866205496544188, 0.05271166549487547, -0.1389707521027462, 0.1599696066907861, 0.39454359569671477, -0.05648815337229859, 0.11450693356719883, -0.3526753113351085, -0.1533818987452171, 0.14366864627227188, 0.08363002866337245, 0.037709362483160064, -0.026714288714257153, -0.34512167617001316, 0.20091479755938052, -0.259662886406295, -0.09711771546439692, -0.13340486242351207, 0.09080006926616824, 0.03739443660121072, -0.1710717073218389, -0.024856390291824938, 0.010243009081618352, 0.15161622376604514, -0.07164924342862584, -0.02379601133606312, -0.07413176230408929, 0.134546755914661, 0.012093468035825275, 0.026178391108458692, 0.1320927846160802, -0.12012507322837006, -0.2377287873828953, 0.46551868966357274, -0.017412978986447506, -0.2149067011069168, 0.17175633776932955, -0.12119265950538895, -0.2481197038919411, 0.11145183945244008, 0.04183333534747362, 0.1626662479205565, -0.0036630993708968163, 0.17457034392070703, -0.025551052374595946, 0.08115870248187672, 0.05957327550277114, -0.007174626771699298, 0.12485840102149681, 0.08802580589597875, 0.0848897222937508, 0.20261323113333096, 0.07635205083272674, -0.06240684562786059, -0.3029658109288324, -0.21850722775032574, -0.11037989038635385, 0.05040578860366209, -0.051563890955135736, -0.18810840529305015, 0.4508006278425455, 0.14458908656723163, 0.09699395131319762, 0.16332833685658193, 0.2202080161945725, 0.07026070830496875, 0.09454664436422966, 0.024110700816593385, 0.11187282075936145, 0.3502899130975658, 0.011155363968150183, -0.14022497391296465, -0.06438562527976253, 0.25025587862526827]
|
1,803.07605
|
The QCD running coupling at all scales and the connection between hadron
masses and \Lambda_s
|
We report on recent experimental and theoretical developments in our
understanding of the QCD running coupling \alpha_s in QCD's nonperturbative
regime. They allow us to analytically compute the hadron mass spectrum, with
\Lambda_s the only input necessary to this determination. The computed spectra
agrees well with experimental data.
|
hep-ph
|
we report on recent experimental and theoretical developments in our understanding of the qcd running coupling alpha_s in qcds nonperturbative regime they allow us to analytically compute the hadron mass spectrum with lambda_s the only input necessary to this determination the computed spectra agrees well with experimental data
|
[['we', 'report', 'on', 'recent', 'experimental', 'and', 'theoretical', 'developments', 'in', 'our', 'understanding', 'of', 'the', 'qcd', 'running', 'coupling', 'alpha_s', 'in', 'qcds', 'nonperturbative', 'regime', 'they', 'allow', 'us', 'to', 'analytically', 'compute', 'the', 'hadron', 'mass', 'spectrum', 'with', 'lambda_s', 'the', 'only', 'input', 'necessary', 'to', 'this', 'determination', 'the', 'computed', 'spectra', 'agrees', 'well', 'with', 'experimental', 'data']]
|
[-0.07979501801310107, 0.12577963914372958, -0.11572775980069612, 0.057315728430694435, -0.09556728085347761, -0.0836262049075837, 0.0522408192725076, 0.3783154293196276, -0.1718564067268744, -0.32230954968448106, 0.06210453890283437, -0.2847767602240007, -0.03430078231031075, 0.18843606520871012, 0.028472136647906154, 0.15225560838977495, 0.12080259691962662, -0.016307977246469818, -0.06804123504601496, -0.20391964266309515, 0.27725409119739197, 0.09511892024117212, 0.2504811514712249, 0.2094162663561292, 0.0273182070547288, 0.01049710721175264, -0.09477745588325585, -0.05692177021410316, -0.2233350404033748, 0.11816693186604728, 0.2656691794594129, 0.04282142050215043, 0.11668624088633806, -0.4129588056821376, -0.1461570009608598, 0.03543402576663842, 0.16395223491902775, 0.15966236568056047, -0.020941790190894, -0.24916754837613553, 0.04361649325195079, -0.1848094358089535, -0.1542420392506756, -0.19552860572002828, -0.03888967345119454, -0.054875377997329146, -0.3089212013874203, 0.049336701641247295, -0.10096746966155479, -0.015707200606508803, -0.03171188663691282, -0.16487094766731994, 0.011789929199342927, 0.1447336308968564, 0.09676842090046496, 0.06989793006020288, 0.11418128049505565, -0.16556525445048464, -0.1271607291904123, 0.3970944603594641, -0.08116489992729232, -0.09410023021822174, 0.1564520071260631, -0.23585084038010487, -0.18692611278189966, 0.07779501657932997, 0.1634689087756366, 0.09260598565257776, -0.08698679130369176, 0.11985209805303991, -0.026986254573178787, 0.19506799045969578, -0.008747136783010015, 0.09410945781079742, 0.18239444156643003, 0.18146428502708054, -0.06559092320579414, 0.04856722992068777, -0.009681008887127973, -0.11324535831226967, -0.366749325611939, -0.0130649170508453, -0.1664023420016747, 0.06706323522424402, -0.09995828482563714, -0.12596013624958383, 0.4120127047256877, 0.20927933522034436, 0.29856102752819424, 0.08756723466406886, 0.34782667201943696, 0.1307263226893459, 0.062065140756506786, 0.04367765506564562, 0.3342925188286851, 0.17802966746967286, 0.16079735978079648, -0.31789242874947377, 0.003500945276755374, 0.06799634966106775]
|
1,803.07606
|
Couette-Poiseuille flow with partial slip and uniform cross flow for
power-law fluids
|
Exact solutions are obtained for the steady flow of a power-law fluid between
parallel plates with partial slip conditions and uniform cross flow. The
problem is properly formulated and similarities are exploited. The exact
solutions are obtained in terms of integrals which can be performed, in closed
form, in special cases of the power-law index n. Solutions to cases of n=1/2,
1, and 2; representing a pseudo-plastic, a Newtonian, and a dilatant fluid,
respectively, are presented. Tendencies to corresponding degenerate cases in
the literature are demonstrated. Depending on the strength of the cross flow
and the pressure gradient, the flow may be of Couette type with convex, linear,
or concave velocity profile; or of Poiseuille type. Borderline cases are
identified. Moreover, a case in which the power-law model for the dilatant
fluid fails is detected.
|
physics.flu-dyn math.CA
|
exact solutions are obtained for the steady flow of a powerlaw fluid between parallel plates with partial slip conditions and uniform cross flow the problem is properly formulated and similarities are exploited the exact solutions are obtained in terms of integrals which can be performed in closed form in special cases of the powerlaw index n solutions to cases of n12 1 and 2 representing a pseudoplastic a newtonian and a dilatant fluid respectively are presented tendencies to corresponding degenerate cases in the literature are demonstrated depending on the strength of the cross flow and the pressure gradient the flow may be of couette type with convex linear or concave velocity profile or of poiseuille type borderline cases are identified moreover a case in which the powerlaw model for the dilatant fluid fails is detected
|
[['exact', 'solutions', 'are', 'obtained', 'for', 'the', 'steady', 'flow', 'of', 'a', 'powerlaw', 'fluid', 'between', 'parallel', 'plates', 'with', 'partial', 'slip', 'conditions', 'and', 'uniform', 'cross', 'flow', 'the', 'problem', 'is', 'properly', 'formulated', 'and', 'similarities', 'are', 'exploited', 'the', 'exact', 'solutions', 'are', 'obtained', 'in', 'terms', 'of', 'integrals', 'which', 'can', 'be', 'performed', 'in', 'closed', 'form', 'in', 'special', 'cases', 'of', 'the', 'powerlaw', 'index', 'n', 'solutions', 'to', 'cases', 'of', 'n12', '1', 'and', '2', 'representing', 'a', 'pseudoplastic', 'a', 'newtonian', 'and', 'a', 'dilatant', 'fluid', 'respectively', 'are', 'presented', 'tendencies', 'to', 'corresponding', 'degenerate', 'cases', 'in', 'the', 'literature', 'are', 'demonstrated', 'depending', 'on', 'the', 'strength', 'of', 'the', 'cross', 'flow', 'and', 'the', 'pressure', 'gradient', 'the', 'flow', 'may', 'be', 'of', 'couette', 'type', 'with', 'convex', 'linear', 'or', 'concave', 'velocity', 'profile', 'or', 'of', 'poiseuille', 'type', 'borderline', 'cases', 'are', 'identified', 'moreover', 'a', 'case', 'in', 'which', 'the', 'powerlaw', 'model', 'for', 'the', 'dilatant', 'fluid', 'fails', 'is', 'detected']]
|
[-0.15200222654061185, 0.09900014102027786, -0.07612123356925117, 0.05008314155490586, -0.030685373005905636, -0.18164732297192568, -0.03967202173338996, 0.34334787676731743, -0.2568722183816135, -0.27396084569843004, 0.11275579119359867, -0.28585457085907734, -0.09601209805243545, 0.19426553285404763, -0.022519241728716426, 0.08126823652397704, 0.03106024305474151, 0.04915235768744929, -0.06266905709118065, -0.21458534536089885, 0.282027334117986, -0.03283750416228065, 0.2662206848445176, 0.041003638559400486, 0.07339003644883632, -0.06627679835935986, -0.0018359446001273614, 0.12201455674275402, -0.1743759525577641, 0.04682613043718178, 0.23601843674701672, 0.022482898869310264, 0.19790848539107375, -0.4301066172343713, -0.22171383861590316, 0.09146501750305847, 0.15568514582873494, 0.0674464953356181, -0.006988630361889524, -0.24732509629835409, 0.07060983401757699, -0.13521147222016697, -0.15587757710298455, -0.03169629656261316, 0.02224094663505201, 0.09620721064921882, -0.29949596918843413, 0.17383492637977557, 0.06846174367669004, 0.045938353221518576, -0.10573665679053024, -0.09704188844533983, -0.04724790300760004, 0.09119108705953867, 0.087208221227586, -0.004693334646247051, 0.09670901532129696, -0.1687851705415933, -0.0510313776390696, 0.3954483103007078, -0.0555471884543766, -0.27050565113485964, 0.17897921687474957, -0.11110662257781735, -0.05599632786966308, 0.13133855297109456, 0.17531781557740436, 0.14203112605459023, -0.11997469255907668, 0.0744175920206881, -0.04637183813309228, 0.12801655391899489, 0.11378881388378365, -0.06564806808407107, 0.16296061341892237, 0.09390409298379113, 0.046512654151215596, 0.15456271399398921, -0.07783850590112033, -0.14475831550166562, -0.34087832397608847, -0.1393356823565059, -0.12031091555815052, 0.023062300580312257, -0.12680453927379048, -0.17245867019864144, 0.35219592789567455, 0.008187604316993169, 0.17810070337037798, 0.04665567283173678, 0.23995044487011102, 0.14789906344204037, -0.005161729087639186, 0.1296376959912272, 0.273880590112121, 0.1418973924799098, 0.11458372185696607, -0.1759359919845506, 0.05780091197057455, 0.08984102109723069]
|
1,803.07607
|
Surfactant-induced-retardation in lateral migration of droplets in a
microfluidic confinement
|
In the present study, the role of surfactants on the cross-stream migration
of droplets is investigated both experimentally and theoretically. For
experimental analysis, sunflower oil is used as the carrier phase and DI water
as the dispersed phase which is intermixed with Triton X-100 that acts as the
surfactant. A T-junction is used in the microchannel for the purpose of droplet
generation. Presence of an imposed pressure driven flow induces droplet
deformation and disturbs the equilibrium that results in subsequent
surfactant-redistribution along the interface. This further induces a gradient
in the surface tension, thus generating a Marangoni stress that significantly
alters the droplet dynamics. On subsequent experimental investigation, it is
found that presence of surfactants reduces the cross-stream migration velocity
of the droplet. Further, it is shown that the effect of surfactants in reducing
the cross-stream migration is significantly enhanced for a larger droplet as
compared to a smaller one within the same time span, provided the channel
height is kept constant. In addition, a larger surfactant concentration is
found to induce a greater retardation in cross-stream migration of the droplet,
the effect of which is reduced when the initial transverse position of the
droplet is shifted closer to the channel centerline. The present analysis can
be applied to various droplet based microfluidic as well as medical diagnostic
devices where manipulation of droplet trajectory is a major issue. For the
theoretical counterpart, an asymptotic approach is adopted in the presence of
bulk-insoluble surfactants and under the assumption of negligible fluid
inertia. A good match between our theoretical prediction and the experimental
results is obtained.
|
physics.flu-dyn
|
in the present study the role of surfactants on the crossstream migration of droplets is investigated both experimentally and theoretically for experimental analysis sunflower oil is used as the carrier phase and di water as the dispersed phase which is intermixed with triton x100 that acts as the surfactant a tjunction is used in the microchannel for the purpose of droplet generation presence of an imposed pressure driven flow induces droplet deformation and disturbs the equilibrium that results in subsequent surfactantredistribution along the interface this further induces a gradient in the surface tension thus generating a marangoni stress that significantly alters the droplet dynamics on subsequent experimental investigation it is found that presence of surfactants reduces the crossstream migration velocity of the droplet further it is shown that the effect of surfactants in reducing the crossstream migration is significantly enhanced for a larger droplet as compared to a smaller one within the same time span provided the channel height is kept constant in addition a larger surfactant concentration is found to induce a greater retardation in crossstream migration of the droplet the effect of which is reduced when the initial transverse position of the droplet is shifted closer to the channel centerline the present analysis can be applied to various droplet based microfluidic as well as medical diagnostic devices where manipulation of droplet trajectory is a major issue for the theoretical counterpart an asymptotic approach is adopted in the presence of bulkinsoluble surfactants and under the assumption of negligible fluid inertia a good match between our theoretical prediction and the experimental results is obtained
|
[['in', 'the', 'present', 'study', 'the', 'role', 'of', 'surfactants', 'on', 'the', 'crossstream', 'migration', 'of', 'droplets', 'is', 'investigated', 'both', 'experimentally', 'and', 'theoretically', 'for', 'experimental', 'analysis', 'sunflower', 'oil', 'is', 'used', 'as', 'the', 'carrier', 'phase', 'and', 'di', 'water', 'as', 'the', 'dispersed', 'phase', 'which', 'is', 'intermixed', 'with', 'triton', 'x100', 'that', 'acts', 'as', 'the', 'surfactant', 'a', 'tjunction', 'is', 'used', 'in', 'the', 'microchannel', 'for', 'the', 'purpose', 'of', 'droplet', 'generation', 'presence', 'of', 'an', 'imposed', 'pressure', 'driven', 'flow', 'induces', 'droplet', 'deformation', 'and', 'disturbs', 'the', 'equilibrium', 'that', 'results', 'in', 'subsequent', 'surfactantredistribution', 'along', 'the', 'interface', 'this', 'further', 'induces', 'a', 'gradient', 'in', 'the', 'surface', 'tension', 'thus', 'generating', 'a', 'marangoni', 'stress', 'that', 'significantly', 'alters', 'the', 'droplet', 'dynamics', 'on', 'subsequent', 'experimental', 'investigation', 'it', 'is', 'found', 'that', 'presence', 'of', 'surfactants', 'reduces', 'the', 'crossstream', 'migration', 'velocity', 'of', 'the', 'droplet', 'further', 'it', 'is', 'shown', 'that', 'the', 'effect', 'of', 'surfactants', 'in', 'reducing', 'the', 'crossstream', 'migration', 'is', 'significantly', 'enhanced', 'for', 'a', 'larger', 'droplet', 'as', 'compared', 'to', 'a', 'smaller', 'one', 'within', 'the', 'same', 'time', 'span', 'provided', 'the', 'channel', 'height', 'is', 'kept', 'constant', 'in', 'addition', 'a', 'larger', 'surfactant', 'concentration', 'is', 'found', 'to', 'induce', 'a', 'greater', 'retardation', 'in', 'crossstream', 'migration', 'of', 'the', 'droplet', 'the', 'effect', 'of', 'which', 'is', 'reduced', 'when', 'the', 'initial', 'transverse', 'position', 'of', 'the', 'droplet', 'is', 'shifted', 'closer', 'to', 'the', 'channel', 'centerline', 'the', 'present', 'analysis', 'can', 'be', 'applied', 'to', 'various', 'droplet', 'based', 'microfluidic', 'as', 'well', 'as', 'medical', 'diagnostic', 'devices', 'where', 'manipulation', 'of', 'droplet', 'trajectory', 'is', 'a', 'major', 'issue', 'for', 'the', 'theoretical', 'counterpart', 'an', 'asymptotic', 'approach', 'is', 'adopted', 'in', 'the', 'presence', 'of', 'bulkinsoluble', 'surfactants', 'and', 'under', 'the', 'assumption', 'of', 'negligible', 'fluid', 'inertia', 'a', 'good', 'match', 'between', 'our', 'theoretical', 'prediction', 'and', 'the', 'experimental', 'results', 'is', 'obtained']]
|
[-0.12553740927760096, 0.18383862116887986, -0.11930443650773752, -0.0013515052592342881, -0.02664213697647343, -0.1179819877698536, 0.007132323660857678, 0.33606628186915766, -0.2588603904031699, -0.2715740930359853, 0.09040833415973493, -0.24180103498305186, -0.12917558738373985, 0.20647376399848455, -0.05662413805762143, 0.02900876373073844, 0.053926475540851684, 0.0014765939972728151, -0.006524449181583614, -0.19444271654046422, 0.24913770495913923, 0.08059217692786623, 0.33002867509996936, 0.13581309790396354, 0.06576583826801113, -0.02758407479279565, 0.018465431168066346, 0.060337009775972866, -0.17571934265642405, 0.05326739014144066, 0.18381580172957107, -0.010291729216240771, 0.24427998598448988, -0.4609079955995814, -0.23459839791426004, 0.051342694352632355, 0.1665508109242248, 0.1487559224664811, -0.09382258267354347, -0.238295687840607, 0.07968659031456302, -0.16428790383391478, -0.15305623858577277, 0.012641775362483959, 0.045252295102952436, 0.028803389006871516, -0.25591587981194996, 0.13175838930751888, 0.06001526985482132, 0.062023119310434104, -0.0838330438254448, -0.11179203057173416, -0.09471517914114697, 0.13052374730915797, 0.10152675536861325, 0.044520479826917946, 0.2420160088609787, -0.1454088288534631, -0.014663931754322106, 0.4133944588858535, -0.07920187998548886, -0.21501044282767595, 0.1759761647711253, -0.1317579314801417, -0.02408679418341954, 0.17120557873750622, 0.18106968587923072, 0.10370918122711574, -0.09180443728203884, -0.008110657211494041, -0.032111710555384025, 0.19186915967351414, 0.09067675668105285, -0.058832252353868894, 0.18284965760850067, 0.23753152847088194, 0.09019038383140734, 0.1743876295135013, -0.1436644270998415, -0.12099292894520801, -0.2699133237370577, -0.19352444564966137, -0.1722819956777327, -0.01855443138369145, -0.09723290554744664, -0.15740118247486506, 0.3463751180593222, 0.11858278659381284, 0.16587251615834497, -0.002270267729226061, 0.29431560050568656, 0.07659818555853425, 0.0735483946160948, 0.02651313403514528, 0.26775210778522857, 0.12094333100029951, 0.12682159318316005, -0.30021057581969895, 0.14912231398583478, 0.02171003640126508]
|
1,803.07608
|
A Survey of Deep Learning Techniques for Mobile Robot Applications
|
Advancements in deep learning over the years have attracted research into how
deep artificial neural networks can be used in robotic systems. This research
survey will present a summarization of the current research with a specific
focus on the gains and obstacles for deep learning to be applied to mobile
robotics.
|
cs.CV cs.RO
|
advancements in deep learning over the years have attracted research into how deep artificial neural networks can be used in robotic systems this research survey will present a summarization of the current research with a specific focus on the gains and obstacles for deep learning to be applied to mobile robotics
|
[['advancements', 'in', 'deep', 'learning', 'over', 'the', 'years', 'have', 'attracted', 'research', 'into', 'how', 'deep', 'artificial', 'neural', 'networks', 'can', 'be', 'used', 'in', 'robotic', 'systems', 'this', 'research', 'survey', 'will', 'present', 'a', 'summarization', 'of', 'the', 'current', 'research', 'with', 'a', 'specific', 'focus', 'on', 'the', 'gains', 'and', 'obstacles', 'for', 'deep', 'learning', 'to', 'be', 'applied', 'to', 'mobile', 'robotics']]
|
[-0.050976577945345755, 0.02268687664421604, -0.054115767499395444, -0.028561073312006306, -0.17108480077163846, -0.14798182466377816, -0.04478241847919337, 0.500132850279995, -0.2628972772691472, -0.31342080602531924, 0.0999843462041634, -0.2564150186292097, -0.2442433421737423, 0.2680819615283433, -0.1671346512842266, 0.07684157113088112, 0.15149225111977727, 0.027156449890896387, -0.04411504567399913, -0.36258938053951545, 0.25439059668604064, 0.009593819499166463, 0.3787722988601993, 0.07171109561607533, 0.08109251037240028, -0.034890894202844185, 0.0027219314520776855, 0.00927517409710323, -0.08714091760453348, 0.2725993437582956, 0.44655071995129775, 0.23849513420981228, 0.4508798129710497, -0.495144526967231, -0.326304705083078, 0.12675684569038304, 0.20850030743681333, 0.10023512751521434, -0.08751368324737996, -0.37349118460334985, 0.052505093644939216, -0.20103033014810553, -0.010952267877976684, -0.11748206882746708, 0.03104963474998287, 0.04081231042144674, -0.17829551069321586, -0.12890193936433278, 0.030932293821345356, 0.13528898606697717, -0.027261328335632298, -0.1462820156970445, 0.1151652887244435, 0.18522334389169426, 0.04512813596018389, 0.12590562480994882, 0.15243014897785934, -0.26524891124983485, -0.1705510825576151, 0.33140585158823754, -0.055155844482428884, -0.16604511109272055, 0.18972208033151486, 0.028987125219667658, -0.22937373442611858, 0.058500500105997076, 0.39216897746219354, 0.10676656024274873, -0.20070388489494137, 0.04726886545540765, -0.0005284950831064991, 0.10369101320119466, -0.028973026584614727, -0.03182211558462358, 0.3067364386812437, 0.34029089020309494, 0.0761427686905817, 0.12443033281220671, -0.13367480128620038, -0.11687005238205779, -0.11698596636015995, -0.06783276159480653, -0.14714047499914087, 0.04344650562487397, 0.02503551540048291, -0.0830083809354726, 0.3757769413219363, 0.2536189815297143, 0.17321950186719642, 0.016601291503392013, 0.3367010116869328, 0.023020377729599382, 0.210638992305772, 0.06731820681734997, 0.2726685197329989, 0.03186235281036181, 0.2781737070946096, -0.1236762381797912, 0.04536361712049328, -0.04241405030274216]
|
1,803.07609
|
The $\ell^\infty$-Cophenetic Metric for Phylogenetic Trees as an
Interleaving Distance
|
There are many metrics available to compare phylogenetic trees since this is
a fundamental task in computational biology. In this paper, we focus on one
such metric, the $\ell^\infty$-cophenetic metric introduced by Cardona et al.
This metric works by representing a phylogenetic tree with $n$ labeled leaves
as a point in $\mathbb{R}^{n(n+1)/2}$ known as the cophenetic vector, then
comparing the two resulting Euclidean points using the $\ell^\infty$ distance.
Meanwhile, the interleaving distance is a formal categorical construction
generalized from the definition of Chazal et al., originally introduced to
compare persistence modules arising from the field of topological data
analysis. We show that the $\ell^\infty$-cophenetic metric is an example of an
interleaving distance. To do this, we define phylogenetic trees as a category
of merge trees with some additional structure; namely labelings on the leaves
plus a requirement that morphisms respect these labels. Then we can use the
definition of a flow on this category to give an interleaving distance.
Finally, we show that, because of the additional structure given by the
categories defined, the map sending a labeled merge tree to the cophenetic
vector is, in fact, an isometric embedding, thus proving that the
$\ell^\infty$-cophenetic metric is, in fact, an interleaving distance.
|
cs.CG math.CT
|
there are many metrics available to compare phylogenetic trees since this is a fundamental task in computational biology in this paper we focus on one such metric the ellinftycophenetic metric introduced by cardona et al this metric works by representing a phylogenetic tree with n labeled leaves as a point in mathbbrnn12 known as the cophenetic vector then comparing the two resulting euclidean points using the ellinfty distance meanwhile the interleaving distance is a formal categorical construction generalized from the definition of chazal et al originally introduced to compare persistence modules arising from the field of topological data analysis we show that the ellinftycophenetic metric is an example of an interleaving distance to do this we define phylogenetic trees as a category of merge trees with some additional structure namely labelings on the leaves plus a requirement that morphisms respect these labels then we can use the definition of a flow on this category to give an interleaving distance finally we show that because of the additional structure given by the categories defined the map sending a labeled merge tree to the cophenetic vector is in fact an isometric embedding thus proving that the ellinftycophenetic metric is in fact an interleaving distance
|
[['there', 'are', 'many', 'metrics', 'available', 'to', 'compare', 'phylogenetic', 'trees', 'since', 'this', 'is', 'a', 'fundamental', 'task', 'in', 'computational', 'biology', 'in', 'this', 'paper', 'we', 'focus', 'on', 'one', 'such', 'metric', 'the', 'ellinftycophenetic', 'metric', 'introduced', 'by', 'cardona', 'et', 'al', 'this', 'metric', 'works', 'by', 'representing', 'a', 'phylogenetic', 'tree', 'with', 'n', 'labeled', 'leaves', 'as', 'a', 'point', 'in', 'mathbbrnn12', 'known', 'as', 'the', 'cophenetic', 'vector', 'then', 'comparing', 'the', 'two', 'resulting', 'euclidean', 'points', 'using', 'the', 'ellinfty', 'distance', 'meanwhile', 'the', 'interleaving', 'distance', 'is', 'a', 'formal', 'categorical', 'construction', 'generalized', 'from', 'the', 'definition', 'of', 'chazal', 'et', 'al', 'originally', 'introduced', 'to', 'compare', 'persistence', 'modules', 'arising', 'from', 'the', 'field', 'of', 'topological', 'data', 'analysis', 'we', 'show', 'that', 'the', 'ellinftycophenetic', 'metric', 'is', 'an', 'example', 'of', 'an', 'interleaving', 'distance', 'to', 'do', 'this', 'we', 'define', 'phylogenetic', 'trees', 'as', 'a', 'category', 'of', 'merge', 'trees', 'with', 'some', 'additional', 'structure', 'namely', 'labelings', 'on', 'the', 'leaves', 'plus', 'a', 'requirement', 'that', 'morphisms', 'respect', 'these', 'labels', 'then', 'we', 'can', 'use', 'the', 'definition', 'of', 'a', 'flow', 'on', 'this', 'category', 'to', 'give', 'an', 'interleaving', 'distance', 'finally', 'we', 'show', 'that', 'because', 'of', 'the', 'additional', 'structure', 'given', 'by', 'the', 'categories', 'defined', 'the', 'map', 'sending', 'a', 'labeled', 'merge', 'tree', 'to', 'the', 'cophenetic', 'vector', 'is', 'in', 'fact', 'an', 'isometric', 'embedding', 'thus', 'proving', 'that', 'the', 'ellinftycophenetic', 'metric', 'is', 'in', 'fact', 'an', 'interleaving', 'distance']]
|
[-0.12824815814267493, 0.08904544032152467, -0.06988685532468394, 0.08894064285982381, -0.10420657956592776, -0.0994800792691942, 0.05038883885431256, 0.37357064861044365, -0.34092395924105867, -0.2824274600053146, 0.061965488811922424, -0.2840986888659788, -0.1958019637736719, 0.14515153590221402, -0.17344643783625863, -0.0030367172170263617, 0.08460276010006074, 0.09802592089585033, -0.06746749886466812, -0.2613969934752109, 0.3943004506033155, 0.0678491894432589, 0.25270767777055425, -0.003800345501348154, 0.12330901369380658, 0.02379867573273345, -0.062280654261440076, 0.07690592374610923, -0.14023195946341802, 0.14339951831043526, 0.25246148723854095, 0.19903043869058068, 0.2210337430940184, -0.3282293173118462, -0.19187773867097302, 0.13901904479436003, 0.11378624439424839, 0.10102509290434013, -0.014213516086308674, -0.29551363069406567, 0.10503339836465436, -0.15575191213526943, -0.04366520803134462, -0.04715708348974215, 0.0397742430509221, -0.016158325616177634, -0.21710202646550644, -0.02801590678351584, 0.09116675960396958, 0.06661935240975511, -0.044744679478428036, -0.09354037193196886, -0.050116298556332456, 0.11661786161390926, 0.00916896583581927, 0.11267763700229648, 0.04952214671002321, -0.058834024278426184, -0.1690619555881145, 0.3354597819299525, -0.034085056833999317, -0.22996001460257018, 0.19443615803040973, -0.04476885936646931, -0.15797285104995196, 0.047831983407449666, 0.12972651090326984, 0.12322638521147011, -0.1432566398514935, 0.12666379583800277, -0.06845491761063684, 0.1386858417720022, 0.1375348406655028, -0.0012590134706329647, 0.14704027060715863, 0.1478312843263761, 0.0875521690282966, 0.16274622009501824, -0.056364382063478824, -0.06520872997219641, -0.2819094562912314, -0.16223650901426043, -0.18005260526763267, 0.06150763308159099, -0.12478651937887314, -0.22098724849855722, 0.3478586677906673, 0.148184731529692, 0.2700011135445009, 0.12237046452051502, 0.2819048210814021, 0.04456003006392469, 0.06295127891448897, 0.09200831467664536, 0.17327758546907626, 0.13282175274422178, 0.01848805355213916, -0.10386768887885174, 0.06311565895092243, 0.14708448918211964]
|
1,803.0761
|
Exploring the use of time-varying graphs for modelling transit networks
|
The study of the dynamic relationship between topological structure of a
transit network and the mobility patterns of transit vehicles on this network
is critical towardsdevising smart and time-aware solutions to transit
management and recommendation systems. This paper proposes a time-varying graph
(TVG) to model thisrelationship. The effectiveness of this proposed model has
been explored by implementing the model in Neo4j graph database using transit
feeds generated by bus transit network of the City of Moncton, New Brunswick,
Canada. Dynamics in this relationshipalsohave been detected using network
metrics such as temporal shortest paths, degree, betweenness and PageRank
centralities as well as temporal network diameter and density. Keywords:
Transit Networks,Mobility Pattern,Time-Varying Graph model, Graph Databaseand
Graph Analytics
Keywords: Transit Networks,Mobility Pattern,Time-Varying Graph model, Graph
Database and Graph Analytics
|
cs.SI physics.soc-ph
|
the study of the dynamic relationship between topological structure of a transit network and the mobility patterns of transit vehicles on this network is critical towardsdevising smart and timeaware solutions to transit management and recommendation systems this paper proposes a timevarying graph tvg to model thisrelationship the effectiveness of this proposed model has been explored by implementing the model in neo4j graph database using transit feeds generated by bus transit network of the city of moncton new brunswick canada dynamics in this relationshipalsohave been detected using network metrics such as temporal shortest paths degree betweenness and pagerank centralities as well as temporal network diameter and density keywords transit networksmobility patterntimevarying graph model graph databaseand graph analytics keywords transit networksmobility patterntimevarying graph model graph database and graph analytics
|
[['the', 'study', 'of', 'the', 'dynamic', 'relationship', 'between', 'topological', 'structure', 'of', 'a', 'transit', 'network', 'and', 'the', 'mobility', 'patterns', 'of', 'transit', 'vehicles', 'on', 'this', 'network', 'is', 'critical', 'towardsdevising', 'smart', 'and', 'timeaware', 'solutions', 'to', 'transit', 'management', 'and', 'recommendation', 'systems', 'this', 'paper', 'proposes', 'a', 'timevarying', 'graph', 'tvg', 'to', 'model', 'thisrelationship', 'the', 'effectiveness', 'of', 'this', 'proposed', 'model', 'has', 'been', 'explored', 'by', 'implementing', 'the', 'model', 'in', 'neo4j', 'graph', 'database', 'using', 'transit', 'feeds', 'generated', 'by', 'bus', 'transit', 'network', 'of', 'the', 'city', 'of', 'moncton', 'new', 'brunswick', 'canada', 'dynamics', 'in', 'this', 'relationshipalsohave', 'been', 'detected', 'using', 'network', 'metrics', 'such', 'as', 'temporal', 'shortest', 'paths', 'degree', 'betweenness', 'and', 'pagerank', 'centralities', 'as', 'well', 'as', 'temporal', 'network', 'diameter', 'and', 'density', 'keywords', 'transit', 'networksmobility', 'patterntimevarying', 'graph', 'model', 'graph', 'databaseand', 'graph', 'analytics', 'keywords', 'transit', 'networksmobility', 'patterntimevarying', 'graph', 'model', 'graph', 'database', 'and', 'graph', 'analytics']]
|
[-0.14687450912828415, 0.016829149685089743, -0.0776163996473523, 0.023122914361380736, -0.1224360145091758, -0.16243839177887065, 0.0705818435960544, 0.41181490118852104, -0.2774691869212725, -0.3793598595312086, 0.09163450721012018, -0.3456068058198286, -0.2461593975944413, 0.10653394666476712, -0.1162316952003324, 0.13316725333363322, 0.13118953929061733, 0.04367470391631379, 0.07750720799490178, -0.22045201844717296, 0.27097631229184643, 0.03771478135012469, 0.27562187785693143, 0.0759102233495145, 0.07789070359667984, 0.058121650487626506, -0.058567492658335524, 0.07787553489630474, -0.13232739219221018, 0.12337324362627025, 0.27499257032443786, 0.23943653806128493, 0.22712937065487002, -0.3805541252338533, -0.28383798573671254, 0.12229890418949269, 0.12942864375694071, 0.02540154425600954, 0.02989033872747036, -0.36914317344583697, 0.11286531176055008, -0.2272914091503234, -0.0203443554435241, -0.04506690714950279, 0.07269885409544459, 0.03939073721254718, -0.22419652381321906, -0.008314287909543363, -0.014638569062946648, 0.12948508496727731, 0.016087116334208493, -0.07166473667129432, -0.06783155594376247, 0.17029381859889728, -0.03575061709063633, 0.022117059518014855, 0.1227834219333984, -0.10101466230067456, -0.21793663310443478, 0.39146920099412486, -0.04503945951050116, -0.08938622439943128, 0.09751137394173923, -0.0327107335867013, -0.15245678495236878, 0.04662236700750003, 0.28296264681286354, 0.06871046230859928, -0.21555158342047342, 0.0006892386383882139, -0.03666496079837335, 0.1645074383142578, 0.0766818816152054, -0.009830533850432957, 0.21193753940574192, 0.2940062011939363, 0.13352342536357248, 0.12685733212560604, -0.11958247210270077, -0.09349425311863296, -0.15216237558762274, -0.09223635547589194, -0.22469123575976513, -0.02764285055099655, -0.19506868940577804, -0.17588688672315014, 0.5166434422608907, 0.19676723988663594, 0.15255478635367195, 0.0988177711092788, 0.3387730505664722, 0.043798928146084805, 0.07340440603162525, 0.16275195426197123, 0.09233446671801099, 0.06591562310655964, 0.21659497588762414, -0.16048589634898483, 0.1439698664747747, 0.08399190790990715]
|
1,803.07611
|
Compact complex surfaces with no nonconstant meromorphic functions
|
In 1949 Siegel gave an example of a complex two-torus with no nonconstant
meromorphic functions. In 1964 Kodaira showed that compact complex surfaces
with no nonconstant meromorphic must be of the following three types: tori,
Hopf type surfaces with first Betti number equal to one, and K3 surfaces. In
this paper we show that surfaces of these three types have a dense set of
surfaces in their natural moduli spaces with no nonconstant meromorphic
functions.
|
math.CV
|
in 1949 siegel gave an example of a complex twotorus with no nonconstant meromorphic functions in 1964 kodaira showed that compact complex surfaces with no nonconstant meromorphic must be of the following three types tori hopf type surfaces with first betti number equal to one and k3 surfaces in this paper we show that surfaces of these three types have a dense set of surfaces in their natural moduli spaces with no nonconstant meromorphic functions
|
[['in', '1949', 'siegel', 'gave', 'an', 'example', 'of', 'a', 'complex', 'twotorus', 'with', 'no', 'nonconstant', 'meromorphic', 'functions', 'in', '1964', 'kodaira', 'showed', 'that', 'compact', 'complex', 'surfaces', 'with', 'no', 'nonconstant', 'meromorphic', 'must', 'be', 'of', 'the', 'following', 'three', 'types', 'tori', 'hopf', 'type', 'surfaces', 'with', 'first', 'betti', 'number', 'equal', 'to', 'one', 'and', 'k3', 'surfaces', 'in', 'this', 'paper', 'we', 'show', 'that', 'surfaces', 'of', 'these', 'three', 'types', 'have', 'a', 'dense', 'set', 'of', 'surfaces', 'in', 'their', 'natural', 'moduli', 'spaces', 'with', 'no', 'nonconstant', 'meromorphic', 'functions']]
|
[-0.2144794857253631, 0.07336418039650501, -0.07092307262122631, 0.07868954252917319, -0.09709743188073237, -0.1575695395221313, -0.046748246983624994, 0.3474365894993146, -0.22353902583320936, -0.22940999910856286, 0.0875882357545197, -0.2620613040526708, -0.23460668966174125, 0.26638739441831905, -0.1530261184896032, 0.02974377930164337, 0.008990814375380674, 0.034374214435617126, -0.10813084470108152, -0.37348385448257126, 0.48630829225915173, -0.12358897440445919, 0.15431551612913608, 0.04380694488684336, 0.07784484130019943, -0.04181778631793956, -0.00567798796420296, -0.05075938543925683, -0.1606253710212574, 0.13402395538054407, 0.3033283210794131, 0.03102551367133856, 0.2143762566149235, -0.4507571710894505, -0.23266470078378915, 0.23791023425757885, 0.0732777565345168, -0.03000103812664747, -0.04285456261287133, -0.17450573037068048, 0.05123308884600798, -0.09941354423761367, -0.2301083313114941, -0.08343272924423217, 0.1043007221693794, 0.043691318991283576, -0.15831216792265573, -0.024193614025910696, 0.09890248683591683, 0.16810013975948096, -0.09588655812044938, -0.13074721607069176, -0.15061401730092863, 0.06745833824699124, 0.041833343381683034, 0.06501179579024513, 0.016981290709227322, -0.08750865566544234, -0.12165397416179378, 0.28747771186133225, -0.08615990119675795, -0.30117903364201387, 0.203803798048757, -0.19639088846743108, -0.1839302877088388, 0.183079110806187, 0.10488624101815125, 0.19027917695542176, -0.04538663199792305, 0.1342702063367081, -0.11750295144816239, 0.12872608251869677, 0.1987262557943662, -0.048533202668962376, 0.17523340357467532, 0.053455470403035485, 0.0603176610575368, 0.10927167439678064, 0.01313199456781149, -0.047642292616268, -0.35910776468614736, -0.24151942504569887, -0.08650406586627166, 0.14225052537706992, -0.10925761269386082, -0.23746705405414104, 0.410629918128252, -0.04349433111647765, 0.2223854916729033, 0.10535889549801747, 0.1604735884939631, 0.024871259681143176, 0.06144411359913647, 0.08300966195762158, 0.16648894924670457, 0.13751810662448405, 0.004367472939193249, -0.06588238631685575, -0.052740568866332375, 0.16705926463007928]
|
1,803.07612
|
Generating Multi-Agent Trajectories using Programmatic Weak Supervision
|
We study the problem of training sequential generative models for capturing
coordinated multi-agent trajectory behavior, such as offensive basketball
gameplay. When modeling such settings, it is often beneficial to design
hierarchical models that can capture long-term coordination using intermediate
variables. Furthermore, these intermediate variables should capture interesting
high-level behavioral semantics in an interpretable and manipulatable way. We
present a hierarchical framework that can effectively learn such sequential
generative models. Our approach is inspired by recent work on leveraging
programmatically produced weak labels, which we extend to the spatiotemporal
regime. In addition to synthetic settings, we show how to instantiate our
framework to effectively model complex interactions between basketball players
and generate realistic multi-agent trajectories of basketball gameplay over
long time periods. We validate our approach using both quantitative and
qualitative evaluations, including a user study comparison conducted with
professional sports analysts.
|
cs.LG stat.ML
|
we study the problem of training sequential generative models for capturing coordinated multiagent trajectory behavior such as offensive basketball gameplay when modeling such settings it is often beneficial to design hierarchical models that can capture longterm coordination using intermediate variables furthermore these intermediate variables should capture interesting highlevel behavioral semantics in an interpretable and manipulatable way we present a hierarchical framework that can effectively learn such sequential generative models our approach is inspired by recent work on leveraging programmatically produced weak labels which we extend to the spatiotemporal regime in addition to synthetic settings we show how to instantiate our framework to effectively model complex interactions between basketball players and generate realistic multiagent trajectories of basketball gameplay over long time periods we validate our approach using both quantitative and qualitative evaluations including a user study comparison conducted with professional sports analysts
|
[['we', 'study', 'the', 'problem', 'of', 'training', 'sequential', 'generative', 'models', 'for', 'capturing', 'coordinated', 'multiagent', 'trajectory', 'behavior', 'such', 'as', 'offensive', 'basketball', 'gameplay', 'when', 'modeling', 'such', 'settings', 'it', 'is', 'often', 'beneficial', 'to', 'design', 'hierarchical', 'models', 'that', 'can', 'capture', 'longterm', 'coordination', 'using', 'intermediate', 'variables', 'furthermore', 'these', 'intermediate', 'variables', 'should', 'capture', 'interesting', 'highlevel', 'behavioral', 'semantics', 'in', 'an', 'interpretable', 'and', 'manipulatable', 'way', 'we', 'present', 'a', 'hierarchical', 'framework', 'that', 'can', 'effectively', 'learn', 'such', 'sequential', 'generative', 'models', 'our', 'approach', 'is', 'inspired', 'by', 'recent', 'work', 'on', 'leveraging', 'programmatically', 'produced', 'weak', 'labels', 'which', 'we', 'extend', 'to', 'the', 'spatiotemporal', 'regime', 'in', 'addition', 'to', 'synthetic', 'settings', 'we', 'show', 'how', 'to', 'instantiate', 'our', 'framework', 'to', 'effectively', 'model', 'complex', 'interactions', 'between', 'basketball', 'players', 'and', 'generate', 'realistic', 'multiagent', 'trajectories', 'of', 'basketball', 'gameplay', 'over', 'long', 'time', 'periods', 'we', 'validate', 'our', 'approach', 'using', 'both', 'quantitative', 'and', 'qualitative', 'evaluations', 'including', 'a', 'user', 'study', 'comparison', 'conducted', 'with', 'professional', 'sports', 'analysts']]
|
[-0.03619267394541637, 0.02196268816670512, -0.11702520303727056, 0.13899742624828104, -0.14629414390627268, -0.1743616682464085, 0.05503082059237921, 0.48861678708212597, -0.2991498717807022, -0.36002195765865397, 0.004437606126162495, -0.23947639703351825, -0.2534859495713039, 0.1695168673288711, -0.1273911664813942, 0.05727935118059106, 0.15088300204155505, -0.008414785694727239, 0.029212961878284073, -0.2633642328396136, 0.2826818147918051, 0.020170675557195903, 0.29341136535352214, -0.02284800554196357, 0.11504126080569435, 0.036612877767972306, -0.019619224408099836, 0.04127517522422924, -0.0837664633510669, 0.1615648476055209, 0.34832963738476436, 0.22346837610891418, 0.34779013872992065, -0.4499506934790324, -0.2440809148779892, 0.09956797186932559, 0.1266835237145655, 0.11241770718256607, -0.01184610724333568, -0.36842763594331895, 0.07829604045312905, -0.20465896894217384, -0.006207517216127392, -0.22032875706382254, -0.04193564327037398, 0.027486688198591087, -0.35280006647717654, -0.003604351901630904, 0.06071021104089466, 0.10018762910130916, -0.048244209685990365, -0.049881544409993483, 0.014201407484274278, 0.21498113038643354, 0.06592515126409022, -0.003989671783006572, 0.13015995733439922, -0.1364101423243728, -0.19840440033201842, 0.3655221998751005, -0.029040592857999793, -0.17038284429738706, 0.2519738616897388, -0.05507159823343712, -0.17063523984203735, 0.03452810042055575, 0.27867226847546533, 0.14816752704956854, -0.17075510511180164, -0.007061354041096246, -0.07402118590680208, 0.2068844740807429, 0.019493619307003756, -0.03070890745280165, 0.19008105530912148, 0.26472385808766047, 0.004639989183720281, 0.10399565760852068, -0.04151441503468082, -0.1888894197920747, -0.23018944174867018, -0.06728202153446404, -0.09511923481518707, -0.019689661326012343, -0.09278749630933855, -0.1145035902461151, 0.38329449436026264, 0.25526078933096946, 0.17948237390435756, 0.11585164648820877, 0.32837204302245, 0.019560330598582084, 0.030888383823334642, 0.043892861761694366, 0.12020086309813122, -0.017084833431051025, 0.1289397481794251, -0.18361561847124117, 0.14077906041482055, 0.005263663330511686]
|
1,803.07613
|
Integrating DRAM Power-Down Modes in gem5 and Quantifying their Impact
|
Across applications, DRAM is a significant contributor to the overall system
power, with the DRAM access energy per bit up to three orders of magnitude
higher compared to on-chip memory accesses. To improve the power efficiency,
DRAM technology incorporates multiple power-down modes, each with different
trade-offs between achievable power savings and performance impact due to entry
and exit delay requirements. Accurate modeling of these low power modes and
entry and exit control is crucial to analyze the trade-offs across controller
configurations and workloads with varied memory access characteristics. To
address this, we integrate the power-down modes into the DRAM controller model
in the open-source simulator gem5. This is the first publicly available
full-system simulator with DRAM power-down modes, providing the research
community a tool for DRAM power analysis for a breadth of use cases. We
validate the power-down functionality with sweep tests, which trigger defined
memory access characteristics. We further evaluate the model with real HPC
workloads, illustrating the value of integrating low power functionality into a
full system simulator.
|
cs.AR
|
across applications dram is a significant contributor to the overall system power with the dram access energy per bit up to three orders of magnitude higher compared to onchip memory accesses to improve the power efficiency dram technology incorporates multiple powerdown modes each with different tradeoffs between achievable power savings and performance impact due to entry and exit delay requirements accurate modeling of these low power modes and entry and exit control is crucial to analyze the tradeoffs across controller configurations and workloads with varied memory access characteristics to address this we integrate the powerdown modes into the dram controller model in the opensource simulator gem5 this is the first publicly available fullsystem simulator with dram powerdown modes providing the research community a tool for dram power analysis for a breadth of use cases we validate the powerdown functionality with sweep tests which trigger defined memory access characteristics we further evaluate the model with real hpc workloads illustrating the value of integrating low power functionality into a full system simulator
|
[['across', 'applications', 'dram', 'is', 'a', 'significant', 'contributor', 'to', 'the', 'overall', 'system', 'power', 'with', 'the', 'dram', 'access', 'energy', 'per', 'bit', 'up', 'to', 'three', 'orders', 'of', 'magnitude', 'higher', 'compared', 'to', 'onchip', 'memory', 'accesses', 'to', 'improve', 'the', 'power', 'efficiency', 'dram', 'technology', 'incorporates', 'multiple', 'powerdown', 'modes', 'each', 'with', 'different', 'tradeoffs', 'between', 'achievable', 'power', 'savings', 'and', 'performance', 'impact', 'due', 'to', 'entry', 'and', 'exit', 'delay', 'requirements', 'accurate', 'modeling', 'of', 'these', 'low', 'power', 'modes', 'and', 'entry', 'and', 'exit', 'control', 'is', 'crucial', 'to', 'analyze', 'the', 'tradeoffs', 'across', 'controller', 'configurations', 'and', 'workloads', 'with', 'varied', 'memory', 'access', 'characteristics', 'to', 'address', 'this', 'we', 'integrate', 'the', 'powerdown', 'modes', 'into', 'the', 'dram', 'controller', 'model', 'in', 'the', 'opensource', 'simulator', 'gem5', 'this', 'is', 'the', 'first', 'publicly', 'available', 'fullsystem', 'simulator', 'with', 'dram', 'powerdown', 'modes', 'providing', 'the', 'research', 'community', 'a', 'tool', 'for', 'dram', 'power', 'analysis', 'for', 'a', 'breadth', 'of', 'use', 'cases', 'we', 'validate', 'the', 'powerdown', 'functionality', 'with', 'sweep', 'tests', 'which', 'trigger', 'defined', 'memory', 'access', 'characteristics', 'we', 'further', 'evaluate', 'the', 'model', 'with', 'real', 'hpc', 'workloads', 'illustrating', 'the', 'value', 'of', 'integrating', 'low', 'power', 'functionality', 'into', 'a', 'full', 'system', 'simulator']]
|
[-0.1752220680937171, 0.03272491874693729, -0.01768487530404373, -0.011895418651265038, -0.07337310523589087, -0.21253697129842988, 0.09828809486883555, 0.3764670954688507, -0.2654126009383403, -0.3776201804332873, 0.08803102351547054, -0.26835694668047566, -0.0890193063984899, 0.23900116039713953, -0.0799215906244867, 0.08647665581392015, 0.0846496368484462, -0.02551969178020954, -0.012647842708975076, -0.2606026073123383, 0.1974030321546118, 0.14086037964067039, 0.36325421941959685, 0.05417281628641136, 0.10336235831217731, -0.08522019574336488, -0.035502889078548726, -0.05968709921333571, -0.102211667298038, 0.100225135507336, 0.2754227766602793, 0.14174107009106698, 0.3163923215614084, -0.46525699525852415, -0.16764874776058336, 0.05567401097813512, 0.11379969303550966, 0.01501945034970584, -0.015283832479925716, -0.22479710191049995, 0.12528446136069868, -0.27017683094942613, -0.061515155703048496, -0.10386815318454276, -0.02515018301851609, 0.03389517158434233, -0.2864287046746433, -0.028430716082563295, -0.009627834502059748, 0.03830224462675259, -0.048028830671682954, -0.09131003290223068, 0.016655869199209573, 0.2168409795883824, 0.009991723893429427, -0.029237394018427416, 0.1814598270691931, -0.09050916357283474, -0.14456064660951276, 0.3550646731082131, 0.013132764320642523, -0.17903621051433113, 0.13826858888325447, -0.07907485291909645, -0.0952965169268496, 0.11938310666009784, 0.2587758050409748, -0.023207197527346367, -0.1456017837914474, 0.04796353416476289, 0.10857591928695054, 0.23512608340996152, 0.06682358236764284, 0.09139308782623094, 0.18145245517028824, 0.25921976884607884, 0.03964423608678557, 0.1855186266167199, -0.08796084242708543, -0.11809270724051577, -0.22551294216947795, -0.15085192532338518, -0.15158822847365894, -0.005643739623209352, -0.10294277359250426, -0.10298838034710463, 0.466968114564524, 0.2135585795471664, 0.10707443072460592, 0.11507410788189565, 0.46408471927485045, 0.07639306107645526, 0.18286725627532338, 0.15602346911807272, 0.1232067262116984, 0.023512345692142844, 0.18983029521015637, -0.23789853428709595, 0.04351899268324761, -0.06491954007514697]
|
1,803.07614
|
Fog Massive MIMO: A User-Centric Seamless Hot-Spot Architecture
|
The decoupling of data and control planes, as proposed for 5G networks, will
enable the efficient implementation of multitier networks where user equipment
(UE) nodes obtain coverage and connectivity through the top-tier macro-cells,
and, at the same time, achieve high-throughput low-latency communication
through lower tiers in the hierarchy. This paper considers a new architecture
for such lower tiers, dubbed fog massive MIMO, where the UEs are able to
establish high-throughput low-latency data links in a seamless and
opportunistic manner, as they travel through a dense fog of high-capacity
wireless infrastructure nodes, referred to as remote radio heads (RRHs).
Traditional handover mechanisms in dense multicell networks inherently give
rise to frequent handovers and pilot sequence re-assignments, incurring, as a
result, excessive protocol overhead and significant latency. In the proposed
fog massive MIMO architecture, UEs seamlessly and implicitly associate
themselves to the most convenient RRHs in a completely autonomous manner. Each
UE makes use of a unique uplink pilot sequence, and pilot contamination is
mitigated by a novel coded "on-the-fly" pilot contamination control mechanism.
We analyze the spectral efficiency and the outage probability of the proposed
architecture via stochastic geometry, using some recent results on unique
coverage in Boolean models, and provide a detailed comparison with respect to
an idealized baseline massive MIMO cellular system, that neglects protocol
overhead and latency due to explicit user-cell association. Our analysis,
supported by extensive system simulation, reveals that there exists a "sweet
spot" of the per-pilot user load (number of users per pilot), such that the
proposed system achieves spectral efficiency close to that of an ideal cellular
system with the minimum distance user-base station association and no
pilot/handover overhead.
|
cs.IT math.IT
|
the decoupling of data and control planes as proposed for 5g networks will enable the efficient implementation of multitier networks where user equipment ue nodes obtain coverage and connectivity through the toptier macrocells and at the same time achieve highthroughput lowlatency communication through lower tiers in the hierarchy this paper considers a new architecture for such lower tiers dubbed fog massive mimo where the ues are able to establish highthroughput lowlatency data links in a seamless and opportunistic manner as they travel through a dense fog of highcapacity wireless infrastructure nodes referred to as remote radio heads rrhs traditional handover mechanisms in dense multicell networks inherently give rise to frequent handovers and pilot sequence reassignments incurring as a result excessive protocol overhead and significant latency in the proposed fog massive mimo architecture ues seamlessly and implicitly associate themselves to the most convenient rrhs in a completely autonomous manner each ue makes use of a unique uplink pilot sequence and pilot contamination is mitigated by a novel coded onthefly pilot contamination control mechanism we analyze the spectral efficiency and the outage probability of the proposed architecture via stochastic geometry using some recent results on unique coverage in boolean models and provide a detailed comparison with respect to an idealized baseline massive mimo cellular system that neglects protocol overhead and latency due to explicit usercell association our analysis supported by extensive system simulation reveals that there exists a sweet spot of the perpilot user load number of users per pilot such that the proposed system achieves spectral efficiency close to that of an ideal cellular system with the minimum distance userbase station association and no pilothandover overhead
|
[['the', 'decoupling', 'of', 'data', 'and', 'control', 'planes', 'as', 'proposed', 'for', '5g', 'networks', 'will', 'enable', 'the', 'efficient', 'implementation', 'of', 'multitier', 'networks', 'where', 'user', 'equipment', 'ue', 'nodes', 'obtain', 'coverage', 'and', 'connectivity', 'through', 'the', 'toptier', 'macrocells', 'and', 'at', 'the', 'same', 'time', 'achieve', 'highthroughput', 'lowlatency', 'communication', 'through', 'lower', 'tiers', 'in', 'the', 'hierarchy', 'this', 'paper', 'considers', 'a', 'new', 'architecture', 'for', 'such', 'lower', 'tiers', 'dubbed', 'fog', 'massive', 'mimo', 'where', 'the', 'ues', 'are', 'able', 'to', 'establish', 'highthroughput', 'lowlatency', 'data', 'links', 'in', 'a', 'seamless', 'and', 'opportunistic', 'manner', 'as', 'they', 'travel', 'through', 'a', 'dense', 'fog', 'of', 'highcapacity', 'wireless', 'infrastructure', 'nodes', 'referred', 'to', 'as', 'remote', 'radio', 'heads', 'rrhs', 'traditional', 'handover', 'mechanisms', 'in', 'dense', 'multicell', 'networks', 'inherently', 'give', 'rise', 'to', 'frequent', 'handovers', 'and', 'pilot', 'sequence', 'reassignments', 'incurring', 'as', 'a', 'result', 'excessive', 'protocol', 'overhead', 'and', 'significant', 'latency', 'in', 'the', 'proposed', 'fog', 'massive', 'mimo', 'architecture', 'ues', 'seamlessly', 'and', 'implicitly', 'associate', 'themselves', 'to', 'the', 'most', 'convenient', 'rrhs', 'in', 'a', 'completely', 'autonomous', 'manner', 'each', 'ue', 'makes', 'use', 'of', 'a', 'unique', 'uplink', 'pilot', 'sequence', 'and', 'pilot', 'contamination', 'is', 'mitigated', 'by', 'a', 'novel', 'coded', 'onthefly', 'pilot', 'contamination', 'control', 'mechanism', 'we', 'analyze', 'the', 'spectral', 'efficiency', 'and', 'the', 'outage', 'probability', 'of', 'the', 'proposed', 'architecture', 'via', 'stochastic', 'geometry', 'using', 'some', 'recent', 'results', 'on', 'unique', 'coverage', 'in', 'boolean', 'models', 'and', 'provide', 'a', 'detailed', 'comparison', 'with', 'respect', 'to', 'an', 'idealized', 'baseline', 'massive', 'mimo', 'cellular', 'system', 'that', 'neglects', 'protocol', 'overhead', 'and', 'latency', 'due', 'to', 'explicit', 'usercell', 'association', 'our', 'analysis', 'supported', 'by', 'extensive', 'system', 'simulation', 'reveals', 'that', 'there', 'exists', 'a', 'sweet', 'spot', 'of', 'the', 'perpilot', 'user', 'load', 'number', 'of', 'users', 'per', 'pilot', 'such', 'that', 'the', 'proposed', 'system', 'achieves', 'spectral', 'efficiency', 'close', 'to', 'that', 'of', 'an', 'ideal', 'cellular', 'system', 'with', 'the', 'minimum', 'distance', 'userbase', 'station', 'association', 'and', 'no', 'pilothandover', 'overhead']]
|
[-0.27702057183014006, -0.005629302964834906, 0.009015640585031702, 0.02989596258098389, -0.07995446361456367, -0.22523980231737314, 0.18899120746697248, 0.3950913280833704, -0.24852198890313137, -0.29988446465463997, 0.05097796720232569, -0.23257085257602153, -0.2016868477016892, 0.12291786484373392, -0.13981150760018562, 0.05458557539433582, 0.10731737290623328, 0.008257651225354134, 0.014989896239224572, -0.22628679332807797, 0.2600627335575418, 0.17796295090244177, 0.3745117345756609, 0.006230798134607546, 0.06077446501818059, 0.0018332718657039706, -0.06041365146279615, -0.06356398714706302, -0.043781801277533644, 0.07960796190064141, 0.34759738371126114, 0.23814016646934133, 0.2942696843166655, -0.4755997748724816, -0.24437394323537037, 0.0771991686414477, 0.1979315202313709, 0.015881189207406544, -0.0884639842639551, -0.28439477579702277, 0.15132767646087353, -0.2748439270847787, -0.0456430692867045, -0.0020158296287223535, -0.06515488220974053, 0.05724095184042122, -0.34073554097432573, 0.01637898362263007, -0.05166722317277403, 0.056270655683065246, -0.016389723041396752, -0.07251925631033959, -0.00660350498501996, 0.17791250846800719, -0.010657779241301419, 0.02306470362172759, 0.11306050215462297, -0.08702371606599853, -0.11618733438304983, 0.37900241890123915, 0.03246627954148684, -0.1976639285057633, 0.21868642301882033, -0.03634588768869475, -0.14232053996691474, 0.15765344916378923, 0.2598550679817141, 0.029974734905302086, -0.20848160207394387, -0.00452687918812364, 0.006761276564004767, 0.17444862005938971, 0.07788294797162815, 0.13159929069003, 0.17183075982722498, 0.240554869947648, 0.16673711278892017, 0.12111922224212587, -0.11882726358584104, -0.08328553763535487, -0.1984936037531972, -0.14198514291395745, -0.20451548545802142, 0.00016383926389268138, -0.10727885360049166, -0.09266795623099137, 0.3428108315734063, 0.14346850069001787, 0.13439949931433567, 0.14290883914813154, 0.43206791740359446, 0.06104750623764477, 0.12192133084219291, 0.14488886897162204, 0.12836873706401625, 0.060554184983723246, 0.17264558667775018, -0.20325950097415046, 0.04516637360126176, -0.022549072699280175]
|
1,803.07615
|
Chaos in Continuously Monitored Quantum Systems: An Optimal Path
Approach
|
We predict that continuously monitored quantum dynamics can be chaotic. The
optimal paths between past and future boundary conditions can diverge
exponentially in time when there is time-dependent evolution and continuous
weak monitoring. Optimal paths are defined by extremizing the global
probability density to move between two boundary conditions. We investigate the
onset of chaos in pure-state qubit systems with optimal paths generated by a
periodic Hamiltonian. Specifically, chaotic quantum dynamics are demonstrated
in a scheme where two non-commuting observables of a qubit are continuously
monitored, and one measurement strength is periodically modulated. The optimal
quantum paths in this example bear similarities to the trajectories of the
kicked rotor, or standard map, which is a paradigmatic example of classical
chaos. We emphasize connections with the concept of resonance between
integrable optimal paths and weak periodic perturbations, as well as our
previous work on "multipaths", and connect the optimal path chaos to
instabilities in the underlying quantum trajectories.
|
quant-ph
|
we predict that continuously monitored quantum dynamics can be chaotic the optimal paths between past and future boundary conditions can diverge exponentially in time when there is timedependent evolution and continuous weak monitoring optimal paths are defined by extremizing the global probability density to move between two boundary conditions we investigate the onset of chaos in purestate qubit systems with optimal paths generated by a periodic hamiltonian specifically chaotic quantum dynamics are demonstrated in a scheme where two noncommuting observables of a qubit are continuously monitored and one measurement strength is periodically modulated the optimal quantum paths in this example bear similarities to the trajectories of the kicked rotor or standard map which is a paradigmatic example of classical chaos we emphasize connections with the concept of resonance between integrable optimal paths and weak periodic perturbations as well as our previous work on multipaths and connect the optimal path chaos to instabilities in the underlying quantum trajectories
|
[['we', 'predict', 'that', 'continuously', 'monitored', 'quantum', 'dynamics', 'can', 'be', 'chaotic', 'the', 'optimal', 'paths', 'between', 'past', 'and', 'future', 'boundary', 'conditions', 'can', 'diverge', 'exponentially', 'in', 'time', 'when', 'there', 'is', 'timedependent', 'evolution', 'and', 'continuous', 'weak', 'monitoring', 'optimal', 'paths', 'are', 'defined', 'by', 'extremizing', 'the', 'global', 'probability', 'density', 'to', 'move', 'between', 'two', 'boundary', 'conditions', 'we', 'investigate', 'the', 'onset', 'of', 'chaos', 'in', 'purestate', 'qubit', 'systems', 'with', 'optimal', 'paths', 'generated', 'by', 'a', 'periodic', 'hamiltonian', 'specifically', 'chaotic', 'quantum', 'dynamics', 'are', 'demonstrated', 'in', 'a', 'scheme', 'where', 'two', 'noncommuting', 'observables', 'of', 'a', 'qubit', 'are', 'continuously', 'monitored', 'and', 'one', 'measurement', 'strength', 'is', 'periodically', 'modulated', 'the', 'optimal', 'quantum', 'paths', 'in', 'this', 'example', 'bear', 'similarities', 'to', 'the', 'trajectories', 'of', 'the', 'kicked', 'rotor', 'or', 'standard', 'map', 'which', 'is', 'a', 'paradigmatic', 'example', 'of', 'classical', 'chaos', 'we', 'emphasize', 'connections', 'with', 'the', 'concept', 'of', 'resonance', 'between', 'integrable', 'optimal', 'paths', 'and', 'weak', 'periodic', 'perturbations', 'as', 'well', 'as', 'our', 'previous', 'work', 'on', 'multipaths', 'and', 'connect', 'the', 'optimal', 'path', 'chaos', 'to', 'instabilities', 'in', 'the', 'underlying', 'quantum', 'trajectories']]
|
[-0.20613140361917437, 0.22232463260056676, -0.080188804223042, 0.07227706787128975, -0.014039005591848473, -0.18925818723217128, 0.05182396279125931, 0.3878481987934963, -0.3252217433071298, -0.24553802994726476, 0.10039641923170275, -0.2606086706279949, -0.18774793916500535, 0.21292208942323687, -0.05090080371280764, 0.1365736324316377, 0.08765105579261946, 0.03632697333421582, -0.06626682346990735, -0.19827858893983777, 0.29541792419753343, 0.02575545627356857, 0.24219011728189127, -0.029558404473408798, 0.099782000856391, 0.014829521758517452, 0.023546163333805315, 0.014688143364278374, -0.14934386682677547, 0.04917684868778915, 0.2352658669158607, 0.07238571429892093, 0.2780363537596574, -0.442962775861097, -0.2295876514629289, 0.1312485807130386, 0.12309876535715132, 0.1176641414877751, 0.003470714116331107, -0.31489909159992435, 0.026367695457494823, -0.09935377091525277, -0.14715328121188564, -0.03854640970187511, 0.03218362549213088, 0.08584085116934055, -0.26610906439934184, 0.07426121593957209, 0.039948134535514296, 0.04846533685833643, -0.03471129133060551, 0.04017011388753701, -0.04305083790473688, 0.17302715131559906, 0.0057795568485002795, 0.029253412951614446, 0.15835673775476444, -0.06177828479765849, -0.18178210143596052, 0.31816256601381215, -0.06837825355814046, -0.21583620210884102, 0.19456275678566023, -0.14714960718325748, -0.08267043141505806, 0.09013819493721151, 0.13696640494997334, 0.09392398460857143, -0.1572728080866498, 0.07402468395714536, -0.003037900808504575, 0.13484818207479682, 0.07652101245750288, 0.06984323627689178, 0.206387411223016, 0.12514588203737928, 0.12937774807570657, 0.15019937193208036, -0.02939905996685017, -0.23406586255047732, -0.2876944219468126, -0.12987524160972921, -0.17957346039308106, 0.07156721357950217, -0.06521761981771508, -0.1623085195904562, 0.4041129771115028, 0.16471712053479082, 0.21367311474398537, 0.004145528880173376, 0.254529232782116, 0.1450988385480811, -0.012938260620479935, 0.08861732250450262, 0.24115820846425454, 0.1174851813454442, 0.07871912848382334, -0.25580918612433184, 0.0435081534057998, 0.06301818326691011]
|
1,803.07616
|
IntPhys: A Framework and Benchmark for Visual Intuitive Physics
Reasoning
|
In order to reach human performance on complexvisual tasks, artificial
systems need to incorporate a sig-nificant amount of understanding of the world
in termsof macroscopic objects, movements, forces, etc. Inspiredby work on
intuitive physics in infants, we propose anevaluation benchmark which diagnoses
how much a givensystem understands about physics by testing whether itcan tell
apart well matched videos of possible versusimpossible events constructed with
a game engine. Thetest requires systems to compute a physical plausibilityscore
over an entire video. It is free of bias and cantest a range of basic physical
reasoning concepts. Wethen describe two Deep Neural Networks systems aimedat
learning intuitive physics in an unsupervised way,using only physically
possible videos. The systems aretrained with a future semantic mask prediction
objectiveand tested on the possible versus impossible discrimi-nation task. The
analysis of their results compared tohuman data gives novel insights in the
potentials andlimitations of next frame prediction architectures.
|
cs.AI cs.CV
|
in order to reach human performance on complexvisual tasks artificial systems need to incorporate a significant amount of understanding of the world in termsof macroscopic objects movements forces etc inspiredby work on intuitive physics in infants we propose anevaluation benchmark which diagnoses how much a givensystem understands about physics by testing whether itcan tell apart well matched videos of possible versusimpossible events constructed with a game engine thetest requires systems to compute a physical plausibilityscore over an entire video it is free of bias and cantest a range of basic physical reasoning concepts wethen describe two deep neural networks systems aimedat learning intuitive physics in an unsupervised wayusing only physically possible videos the systems aretrained with a future semantic mask prediction objectiveand tested on the possible versus impossible discrimination task the analysis of their results compared tohuman data gives novel insights in the potentials andlimitations of next frame prediction architectures
|
[['in', 'order', 'to', 'reach', 'human', 'performance', 'on', 'complexvisual', 'tasks', 'artificial', 'systems', 'need', 'to', 'incorporate', 'a', 'significant', 'amount', 'of', 'understanding', 'of', 'the', 'world', 'in', 'termsof', 'macroscopic', 'objects', 'movements', 'forces', 'etc', 'inspiredby', 'work', 'on', 'intuitive', 'physics', 'in', 'infants', 'we', 'propose', 'anevaluation', 'benchmark', 'which', 'diagnoses', 'how', 'much', 'a', 'givensystem', 'understands', 'about', 'physics', 'by', 'testing', 'whether', 'itcan', 'tell', 'apart', 'well', 'matched', 'videos', 'of', 'possible', 'versusimpossible', 'events', 'constructed', 'with', 'a', 'game', 'engine', 'thetest', 'requires', 'systems', 'to', 'compute', 'a', 'physical', 'plausibilityscore', 'over', 'an', 'entire', 'video', 'it', 'is', 'free', 'of', 'bias', 'and', 'cantest', 'a', 'range', 'of', 'basic', 'physical', 'reasoning', 'concepts', 'wethen', 'describe', 'two', 'deep', 'neural', 'networks', 'systems', 'aimedat', 'learning', 'intuitive', 'physics', 'in', 'an', 'unsupervised', 'wayusing', 'only', 'physically', 'possible', 'videos', 'the', 'systems', 'aretrained', 'with', 'a', 'future', 'semantic', 'mask', 'prediction', 'objectiveand', 'tested', 'on', 'the', 'possible', 'versus', 'impossible', 'discrimination', 'task', 'the', 'analysis', 'of', 'their', 'results', 'compared', 'tohuman', 'data', 'gives', 'novel', 'insights', 'in', 'the', 'potentials', 'andlimitations', 'of', 'next', 'frame', 'prediction', 'architectures']]
|
[-0.07318522448220582, 0.032697605113577055, -0.09566693205461115, 0.12627906643928014, -0.12666585657106183, -0.1727039523908361, 0.059385332654216395, 0.3981943165939023, -0.24173002839852958, -0.38434081509667656, 0.04646891536305783, -0.2607645597621632, -0.17564277160294187, 0.21771642051067258, -0.1319869201310646, 0.06139599751514285, 0.1166042897766873, 0.09390051214636039, -0.05172508826901538, -0.2540181834848403, 0.2677112263731603, 0.06334397373456029, 0.302852463018872, 0.03495626153299279, 0.13195879673741676, -0.019838891280536997, -0.04579315665299629, -0.02643142371619148, -0.1024069851731322, 0.14831047952036136, 0.32793652478417856, 0.20185175732320257, 0.3149973156083542, -0.44208841694435524, -0.24633782359062514, 0.0855589115144268, 0.12201659221883251, 0.10294399167556115, -0.032049644132902316, -0.32157774272360906, 0.029431203591772842, -0.16561466667265978, -0.05160482876252995, -0.13828214184283766, 0.0360833975389155, -0.0510453788590541, -0.2377818366999168, 0.01486974972328032, 0.0649137637975848, 0.09524131264475022, -0.05037830603037919, -0.07660041539582299, 0.05379296441980787, 0.20068205639358555, 0.020024186727389304, 0.02360494129721131, 0.1819557732356879, -0.21640977858385044, -0.19917292629521507, 0.4244211206296042, -0.0008512930014976926, -0.19124451503435622, 0.24401121604892273, -0.05620708200149238, -0.11333977144885697, 0.08733715702008123, 0.23563980350076263, 0.09530426224749257, -0.206953169555584, -0.009635219868679127, -0.024771077770378385, 0.21213094944328958, 0.026815443082517987, 0.023526423423092312, 0.2702547435673934, 0.27239794393222944, 0.00363464257940511, 0.09628002003309623, -0.051405624382253455, -0.1058225228278307, -0.2516666714913462, -0.10218416836891156, -0.15021047915450172, 0.014470320970772195, -0.0801510285140222, -0.14391725927368917, 0.39053186282876934, 0.2592729852715535, 0.19264544732868671, 0.05499787138403157, 0.32574362140896024, -0.01640938779811806, 0.09913430660233291, 0.025385085287861833, 0.20591860884147237, 0.029367174520574288, 0.1650490902299965, -0.15082771445098056, 0.08493035461809208, 0.01198486148539597]
|
1,803.07617
|
Online Learning: Sufficient Statistics and the Burkholder Method
|
We uncover a fairly general principle in online learning: If regret can be
(approximately) expressed as a function of certain "sufficient statistics" for
the data sequence, then there exists a special Burkholder function that 1) can
be used algorithmically to achieve the regret bound and 2) only depends on
these sufficient statistics, not the entire data sequence, so that the online
strategy is only required to keep the sufficient statistics in memory. This
characterization is achieved by bringing the full power of the Burkholder
Method --- originally developed for certifying probabilistic martingale
inequalities --- to bear on the online learning setting.
To demonstrate the scope and effectiveness of the Burkholder method, we
develop a novel online strategy for matrix prediction that attains a regret
bound corresponding to the variance term in matrix concentration inequalities.
We also present a linear-time/space prediction strategy for parameter free
supervised learning with linear classes and general smooth norms.
|
cs.LG math.OC stat.ML
|
we uncover a fairly general principle in online learning if regret can be approximately expressed as a function of certain sufficient statistics for the data sequence then there exists a special burkholder function that 1 can be used algorithmically to achieve the regret bound and 2 only depends on these sufficient statistics not the entire data sequence so that the online strategy is only required to keep the sufficient statistics in memory this characterization is achieved by bringing the full power of the burkholder method originally developed for certifying probabilistic martingale inequalities to bear on the online learning setting to demonstrate the scope and effectiveness of the burkholder method we develop a novel online strategy for matrix prediction that attains a regret bound corresponding to the variance term in matrix concentration inequalities we also present a lineartimespace prediction strategy for parameter free supervised learning with linear classes and general smooth norms
|
[['we', 'uncover', 'a', 'fairly', 'general', 'principle', 'in', 'online', 'learning', 'if', 'regret', 'can', 'be', 'approximately', 'expressed', 'as', 'a', 'function', 'of', 'certain', 'sufficient', 'statistics', 'for', 'the', 'data', 'sequence', 'then', 'there', 'exists', 'a', 'special', 'burkholder', 'function', 'that', '1', 'can', 'be', 'used', 'algorithmically', 'to', 'achieve', 'the', 'regret', 'bound', 'and', '2', 'only', 'depends', 'on', 'these', 'sufficient', 'statistics', 'not', 'the', 'entire', 'data', 'sequence', 'so', 'that', 'the', 'online', 'strategy', 'is', 'only', 'required', 'to', 'keep', 'the', 'sufficient', 'statistics', 'in', 'memory', 'this', 'characterization', 'is', 'achieved', 'by', 'bringing', 'the', 'full', 'power', 'of', 'the', 'burkholder', 'method', 'originally', 'developed', 'for', 'certifying', 'probabilistic', 'martingale', 'inequalities', 'to', 'bear', 'on', 'the', 'online', 'learning', 'setting', 'to', 'demonstrate', 'the', 'scope', 'and', 'effectiveness', 'of', 'the', 'burkholder', 'method', 'we', 'develop', 'a', 'novel', 'online', 'strategy', 'for', 'matrix', 'prediction', 'that', 'attains', 'a', 'regret', 'bound', 'corresponding', 'to', 'the', 'variance', 'term', 'in', 'matrix', 'concentration', 'inequalities', 'we', 'also', 'present', 'a', 'lineartimespace', 'prediction', 'strategy', 'for', 'parameter', 'free', 'supervised', 'learning', 'with', 'linear', 'classes', 'and', 'general', 'smooth', 'norms']]
|
[-0.04809974325704389, 0.04780012589180842, -0.11358719969080994, 0.12702276582907265, -0.1093227064392219, -0.1777723799707989, 0.08794863449952875, 0.38014210923885305, -0.2965040069445968, -0.31458826932435235, 0.13247038553779325, -0.20806636709875118, -0.17549326815952856, 0.21015625435238083, -0.14049560002982617, 0.08395951267176618, 0.06778567983147998, 0.07406166482095917, -0.05791855740050475, -0.30997969369093575, 0.2891356695955619, 0.043954591626922286, 0.2902352939173579, 0.05884570340315501, 0.1312910806767953, 0.020861690424693127, 0.010978517468708256, 0.023242932346183808, -0.1530304352372089, 0.13972072690725326, 0.31017926284422476, 0.21907933290426929, 0.3694492650280396, -0.35371401299722494, -0.14718783133265484, 0.1815393833228154, 0.1193540298162649, 0.08536856869856517, -0.06562180194014218, -0.26365510387035707, 0.0815281378943473, -0.14648774626820038, -0.07328879459140202, -0.14718691402425368, -0.03151898198450605, 0.010610550797233978, -0.37229408306690553, 0.07562954313257554, 0.07993775457609445, 0.026815109093828747, -0.042577726356685164, -0.10016903711638103, 0.06011890717161199, 0.11000060832127928, 0.017807827303186058, 0.017287729801610113, 0.09713239590326946, -0.10055012042168528, -0.12356683128358176, 0.2996677873035272, -0.08224318932431439, -0.22678113671019673, 0.1259336112641419, -0.1054463720228523, -0.14649594347147893, 0.10799390428777163, 0.20590915973608692, 0.13468022137880326, -0.1673561184791227, 0.08132722761365585, -0.07512219268207748, 0.18674522163967291, 0.03271444628946483, 0.0259709179502291, 0.08239156641997397, 0.1604815317504108, 0.1377625198289752, 0.13150295281006644, -0.020973893279830614, -0.07611005333562693, -0.3048141377232969, -0.14637078745057808, -0.2312714603357017, 0.018922131063203174, -0.1302986302813709, -0.14989402043943603, 0.35743466900661586, 0.1275084112600113, 0.1674930214850853, 0.16242404472082853, 0.2719400473148562, 0.11951769651806292, 0.06133867807065447, 0.12306657938597103, 0.21752280804522647, 0.09507317733174811, 0.09329784898087383, -0.16917014116887003, 0.11710191402273873, 0.1067926866794005]
|
1,803.07618
|
Coherent multi-heterodyne spectroscopy using acousto-optic frequency
combs
|
We propose and characterize experimentally a new source of optical frequency
combs for performing multi-heterodyne spectrometry. This comb modality is based
on a frequency shifting loop seeded with a CW monochromatic laser. The comb
lines are generated by successive passes of the CW laser through an
acousto-optic frequency shifter. We report the generation of frequency combs
with more than 1500 mutually coherent lines, without resorting to non-linear
broadening phenomena or external electronic modulation. The comb line spacing
is easily reconfigurable from tens of MHz down to the kHz region. We first use
a single acousto-optic frequency comb to conduct self-heterodyne interferometry
with a high frequency resolution (500 kHz). By increasing the line spacing to
80 MHz, we demonstrate molecular spectroscopy on the sub-millisecond time
scale. In order to reduce the detection bandwidth, we subsequently implement an
acousto-optic dual-comb spectrometer with the aid of two mutually coherent
frequency shifting loops. In each architecture, the potentiality of
acousto-optic frequency combs for spectroscopy is validated by spectral
measurements of hydrogen cyanide in the near-infrared region.
|
physics.optics
|
we propose and characterize experimentally a new source of optical frequency combs for performing multiheterodyne spectrometry this comb modality is based on a frequency shifting loop seeded with a cw monochromatic laser the comb lines are generated by successive passes of the cw laser through an acoustooptic frequency shifter we report the generation of frequency combs with more than 1500 mutually coherent lines without resorting to nonlinear broadening phenomena or external electronic modulation the comb line spacing is easily reconfigurable from tens of mhz down to the khz region we first use a single acoustooptic frequency comb to conduct selfheterodyne interferometry with a high frequency resolution 500 khz by increasing the line spacing to 80 mhz we demonstrate molecular spectroscopy on the submillisecond time scale in order to reduce the detection bandwidth we subsequently implement an acoustooptic dualcomb spectrometer with the aid of two mutually coherent frequency shifting loops in each architecture the potentiality of acoustooptic frequency combs for spectroscopy is validated by spectral measurements of hydrogen cyanide in the nearinfrared region
|
[['we', 'propose', 'and', 'characterize', 'experimentally', 'a', 'new', 'source', 'of', 'optical', 'frequency', 'combs', 'for', 'performing', 'multiheterodyne', 'spectrometry', 'this', 'comb', 'modality', 'is', 'based', 'on', 'a', 'frequency', 'shifting', 'loop', 'seeded', 'with', 'a', 'cw', 'monochromatic', 'laser', 'the', 'comb', 'lines', 'are', 'generated', 'by', 'successive', 'passes', 'of', 'the', 'cw', 'laser', 'through', 'an', 'acoustooptic', 'frequency', 'shifter', 'we', 'report', 'the', 'generation', 'of', 'frequency', 'combs', 'with', 'more', 'than', '1500', 'mutually', 'coherent', 'lines', 'without', 'resorting', 'to', 'nonlinear', 'broadening', 'phenomena', 'or', 'external', 'electronic', 'modulation', 'the', 'comb', 'line', 'spacing', 'is', 'easily', 'reconfigurable', 'from', 'tens', 'of', 'mhz', 'down', 'to', 'the', 'khz', 'region', 'we', 'first', 'use', 'a', 'single', 'acoustooptic', 'frequency', 'comb', 'to', 'conduct', 'selfheterodyne', 'interferometry', 'with', 'a', 'high', 'frequency', 'resolution', '500', 'khz', 'by', 'increasing', 'the', 'line', 'spacing', 'to', '80', 'mhz', 'we', 'demonstrate', 'molecular', 'spectroscopy', 'on', 'the', 'submillisecond', 'time', 'scale', 'in', 'order', 'to', 'reduce', 'the', 'detection', 'bandwidth', 'we', 'subsequently', 'implement', 'an', 'acoustooptic', 'dualcomb', 'spectrometer', 'with', 'the', 'aid', 'of', 'two', 'mutually', 'coherent', 'frequency', 'shifting', 'loops', 'in', 'each', 'architecture', 'the', 'potentiality', 'of', 'acoustooptic', 'frequency', 'combs', 'for', 'spectroscopy', 'is', 'validated', 'by', 'spectral', 'measurements', 'of', 'hydrogen', 'cyanide', 'in', 'the', 'nearinfrared', 'region']]
|
[-0.15202405503179423, 0.19863427317918544, -0.004189241721855239, -0.07163686179393512, -0.09315967838669759, -0.1580410887254402, 0.12435981926919762, 0.5543010318976676, -0.22865146937845057, -0.26401233499555654, 0.08363106462977242, -0.22362235963052182, -0.04433526292437861, 0.29717029634792747, -0.009235572227247081, 0.04301080632640785, 0.040704634982746006, -0.06897681665628455, 0.03501444171063688, -0.06355210343733847, 0.22988971216918164, 0.12043971208236884, 0.3235009216194496, 0.001127595899539978, 0.1380622615268844, -0.04375990070565062, -0.025438927421968995, -0.13124596670562358, -0.10453305069931111, 0.11835393703171745, 0.27133776491025985, 0.04898973552477654, 0.2815873511677045, -0.35854561615337316, -0.23078917328073362, 0.04480422610893499, 0.14128385394098247, 0.10781965035468687, -0.05025723464504429, -0.31035466516542054, 0.058081633914911814, -0.16262368122007437, -0.13599644216091566, -0.04596513828538835, -0.03598541502710865, 0.058548854493406105, -0.25268538447562605, 0.010128521077540639, -0.01639115650390903, 0.1343353109604809, -0.03310115725887658, -0.01091962547019817, 0.02043883463768505, 0.04692465493720848, -0.12156832894868065, 0.007355829015872333, 0.15218561255748025, -0.0361206894632169, -0.17610958630359883, 0.35409495909021477, -0.14290820094826157, -0.0671943336221671, 0.15472559415773207, -0.21535267883933387, -0.015450549533937213, 0.20710963773985155, 0.1289614573169126, 0.11424684223480695, -0.11155901125870472, -0.02808144652361841, 0.06092361658358091, 0.33743205104635077, 0.2456629036405925, 0.12198041346828388, 0.22478335586425222, 0.18915351479162656, 0.04646138223104699, 0.1846498682706476, -0.20716818013542526, 0.03209675784590979, -0.20317541181413068, -0.06945708722314732, -0.18634652290060078, 0.02553806641561434, -0.06413926832845941, -0.09807509249942593, 0.4487644120601417, 0.14561116154885007, 0.14825784228336022, -0.025836030941803093, 0.389173113556882, 0.1678454272041563, 0.10825456145793459, -0.04673182188674028, 0.271053115512396, 0.15353583140558627, 0.14793955857139948, -0.26700728086532677, -0.09313538192966303, 0.00021419330648292766]
|
1,803.07619
|
Geometric decomposition of the conformation tensor in viscoelastic
turbulence
|
This work introduces a mathematical approach to analysing the polymer
dynamics in turbulent viscoelastic flows that uses a new geometric
decomposition of the conformation tensor, along with associated scalar measures
of the polymer fluctuations. The approach circumvents an inherent difficulty in
traditional Reynolds decompositions of the conformation tensor: the fluctuating
tensor fields are not positive-definite and so do not retain the physical
meaning of the tensor. The geometric decomposition of the conformation tensor
yields both mean and fluctuating tensor fields that are positive-definite. The
fluctuating tensor in the present decomposition has a clear physical
interpretation as a polymer deformation relative to the mean configuration.
Scalar measures of this fluctuating conformation tensor are developed based on
the non-Euclidean geometry of the set of positive-definite tensors.
Drag-reduced viscoelastic turbulent channel flow is then used an example case
study. The conformation tensor field, obtained using direct numerical
simulations, is analysed using the proposed framework.
|
physics.flu-dyn
|
this work introduces a mathematical approach to analysing the polymer dynamics in turbulent viscoelastic flows that uses a new geometric decomposition of the conformation tensor along with associated scalar measures of the polymer fluctuations the approach circumvents an inherent difficulty in traditional reynolds decompositions of the conformation tensor the fluctuating tensor fields are not positivedefinite and so do not retain the physical meaning of the tensor the geometric decomposition of the conformation tensor yields both mean and fluctuating tensor fields that are positivedefinite the fluctuating tensor in the present decomposition has a clear physical interpretation as a polymer deformation relative to the mean configuration scalar measures of this fluctuating conformation tensor are developed based on the noneuclidean geometry of the set of positivedefinite tensors dragreduced viscoelastic turbulent channel flow is then used an example case study the conformation tensor field obtained using direct numerical simulations is analysed using the proposed framework
|
[['this', 'work', 'introduces', 'a', 'mathematical', 'approach', 'to', 'analysing', 'the', 'polymer', 'dynamics', 'in', 'turbulent', 'viscoelastic', 'flows', 'that', 'uses', 'a', 'new', 'geometric', 'decomposition', 'of', 'the', 'conformation', 'tensor', 'along', 'with', 'associated', 'scalar', 'measures', 'of', 'the', 'polymer', 'fluctuations', 'the', 'approach', 'circumvents', 'an', 'inherent', 'difficulty', 'in', 'traditional', 'reynolds', 'decompositions', 'of', 'the', 'conformation', 'tensor', 'the', 'fluctuating', 'tensor', 'fields', 'are', 'not', 'positivedefinite', 'and', 'so', 'do', 'not', 'retain', 'the', 'physical', 'meaning', 'of', 'the', 'tensor', 'the', 'geometric', 'decomposition', 'of', 'the', 'conformation', 'tensor', 'yields', 'both', 'mean', 'and', 'fluctuating', 'tensor', 'fields', 'that', 'are', 'positivedefinite', 'the', 'fluctuating', 'tensor', 'in', 'the', 'present', 'decomposition', 'has', 'a', 'clear', 'physical', 'interpretation', 'as', 'a', 'polymer', 'deformation', 'relative', 'to', 'the', 'mean', 'configuration', 'scalar', 'measures', 'of', 'this', 'fluctuating', 'conformation', 'tensor', 'are', 'developed', 'based', 'on', 'the', 'noneuclidean', 'geometry', 'of', 'the', 'set', 'of', 'positivedefinite', 'tensors', 'dragreduced', 'viscoelastic', 'turbulent', 'channel', 'flow', 'is', 'then', 'used', 'an', 'example', 'case', 'study', 'the', 'conformation', 'tensor', 'field', 'obtained', 'using', 'direct', 'numerical', 'simulations', 'is', 'analysed', 'using', 'the', 'proposed', 'framework']]
|
[-0.1560006423915426, 0.14442730417960167, -0.1442083239989976, 0.02229368291795254, -0.09461928323221704, -0.07619215755412977, -0.12141522362207373, 0.34919114942972856, -0.29180509670462923, -0.22105081995328268, 0.05921585496903087, -0.19584472437389194, -0.19891483149801692, 0.09859532834418738, -0.02335740953683853, 0.055097381146624685, 0.06017676685626308, 0.029753556239108244, -0.0774369560011352, -0.1497441809135489, 0.3213947615865618, 0.07254841498409709, 0.3222645575242738, 0.046863127313554284, 0.14967718758620321, -0.018515372831995287, -0.05041581617978712, 0.09094078588687504, -0.14622533565746076, 0.1547371617052704, 0.18687145008395115, 0.0987338700486968, 0.23523802095092833, -0.46541537282367546, -0.23064673880115152, 0.08911674748485288, 0.11476209669994811, 0.10933624266957244, 0.013713134066977849, -0.24025430844941487, 0.08598150122600297, -0.17965130507946014, -0.09025063648819924, -0.14902794871479272, -0.01119261177489534, -0.017870648448976376, -0.23822507836855947, 0.13631467956739168, 0.05054144835589492, 0.06987615859135986, -0.12003950588094692, -0.1407985378211985, -0.02139718651616325, 0.10763705506687984, 0.08484044212149457, 0.005258880870727201, 0.20011157604865729, -0.14030006900740166, -0.06891957037926962, 0.38360085311035313, -0.06922149183228613, -0.3120196432573721, 0.1521624983889827, -0.08448279685651262, -0.09463492088330289, 0.1428497166171049, 0.16468439425652226, 0.12714602888872226, -0.1359980702927957, 0.08158382053409392, -0.04843886616950234, 0.13578174726727107, 0.040018786387518046, -0.023389729422827563, 0.1729179020350178, 0.12447449202959736, 0.042207580697722735, 0.17968052050409217, -0.05872334427394283, -0.16193891268999627, -0.31587199165175356, -0.19054625774229256, -0.24072296424458425, 0.07837540161504876, -0.15602897481255543, -0.2357383124344051, 0.4012665033712983, 0.09138644514605403, 0.14485928572442694, 0.06722532676222424, 0.29384152855724094, 0.051717647958333446, 0.057636722636719546, 0.06562701954816778, 0.2574666368961334, 0.26179648463924726, 0.13198208500631153, -0.20887454110508163, 0.05266813078196719, 0.09933168690341214]
|
1,803.0762
|
Selective Area Superconductor Epitaxy to Ballistic Semiconductor
Nanowires
|
Semiconductor nanowires such as InAs and InSb are promising materials for
studying Majorana zero-modes and demonstrating non-Abelian particle exchange
relevant for topological quantum computing. While evidence for Majorana bound
states in nanowires has been shown, the majority of these experiments are
marked by significant disorder. In particular, the interfacial inhomogeneity
between the superconductor and nanowire is strongly believed to be the main
culprit for disorder and the resulting soft superconducting gap ubiquitous in
tunneling studies of hybrid semiconductor-superconductor systems. Additionally,
a lack of ballistic transport in nanowire systems can create bound states that
mimic Majorana signatures. We resolve these problems through the development of
selective-area epitaxy of Al to InSb nanowires, a technique applicable to other
nanowires and superconductors. Epitaxial InSb-Al devices generically possess a
hard superconducting gap and demonstrate ballistic 1D superconductivity and
near perfect transmission of supercurrents in the single mode regime,
requisites for engineering and controlling 1D topological superconductivity.
Additionally, we demonstrate that epitaxial InSb-Al superconducting island
devices, the building blocks for Majorana based quantum computing applications,
prepared using selective area epitaxy can achieve micron scale ballistic 1D
transport. Our results pave the way for the development of networks of
ballistic superconducting electronics for quantum device applications.
|
cond-mat.mes-hall
|
semiconductor nanowires such as inas and insb are promising materials for studying majorana zeromodes and demonstrating nonabelian particle exchange relevant for topological quantum computing while evidence for majorana bound states in nanowires has been shown the majority of these experiments are marked by significant disorder in particular the interfacial inhomogeneity between the superconductor and nanowire is strongly believed to be the main culprit for disorder and the resulting soft superconducting gap ubiquitous in tunneling studies of hybrid semiconductorsuperconductor systems additionally a lack of ballistic transport in nanowire systems can create bound states that mimic majorana signatures we resolve these problems through the development of selectivearea epitaxy of al to insb nanowires a technique applicable to other nanowires and superconductors epitaxial insbal devices generically possess a hard superconducting gap and demonstrate ballistic 1d superconductivity and near perfect transmission of supercurrents in the single mode regime requisites for engineering and controlling 1d topological superconductivity additionally we demonstrate that epitaxial insbal superconducting island devices the building blocks for majorana based quantum computing applications prepared using selective area epitaxy can achieve micron scale ballistic 1d transport our results pave the way for the development of networks of ballistic superconducting electronics for quantum device applications
|
[['semiconductor', 'nanowires', 'such', 'as', 'inas', 'and', 'insb', 'are', 'promising', 'materials', 'for', 'studying', 'majorana', 'zeromodes', 'and', 'demonstrating', 'nonabelian', 'particle', 'exchange', 'relevant', 'for', 'topological', 'quantum', 'computing', 'while', 'evidence', 'for', 'majorana', 'bound', 'states', 'in', 'nanowires', 'has', 'been', 'shown', 'the', 'majority', 'of', 'these', 'experiments', 'are', 'marked', 'by', 'significant', 'disorder', 'in', 'particular', 'the', 'interfacial', 'inhomogeneity', 'between', 'the', 'superconductor', 'and', 'nanowire', 'is', 'strongly', 'believed', 'to', 'be', 'the', 'main', 'culprit', 'for', 'disorder', 'and', 'the', 'resulting', 'soft', 'superconducting', 'gap', 'ubiquitous', 'in', 'tunneling', 'studies', 'of', 'hybrid', 'semiconductorsuperconductor', 'systems', 'additionally', 'a', 'lack', 'of', 'ballistic', 'transport', 'in', 'nanowire', 'systems', 'can', 'create', 'bound', 'states', 'that', 'mimic', 'majorana', 'signatures', 'we', 'resolve', 'these', 'problems', 'through', 'the', 'development', 'of', 'selectivearea', 'epitaxy', 'of', 'al', 'to', 'insb', 'nanowires', 'a', 'technique', 'applicable', 'to', 'other', 'nanowires', 'and', 'superconductors', 'epitaxial', 'insbal', 'devices', 'generically', 'possess', 'a', 'hard', 'superconducting', 'gap', 'and', 'demonstrate', 'ballistic', '1d', 'superconductivity', 'and', 'near', 'perfect', 'transmission', 'of', 'supercurrents', 'in', 'the', 'single', 'mode', 'regime', 'requisites', 'for', 'engineering', 'and', 'controlling', '1d', 'topological', 'superconductivity', 'additionally', 'we', 'demonstrate', 'that', 'epitaxial', 'insbal', 'superconducting', 'island', 'devices', 'the', 'building', 'blocks', 'for', 'majorana', 'based', 'quantum', 'computing', 'applications', 'prepared', 'using', 'selective', 'area', 'epitaxy', 'can', 'achieve', 'micron', 'scale', 'ballistic', '1d', 'transport', 'our', 'results', 'pave', 'the', 'way', 'for', 'the', 'development', 'of', 'networks', 'of', 'ballistic', 'superconducting', 'electronics', 'for', 'quantum', 'device', 'applications']]
|
[-0.20300413592660335, 0.21430680314428174, -0.024489026935771107, 0.013159688830928645, -0.011189532075077295, -0.24431541168945842, 0.06318821436841972, 0.40091616729274393, -0.21118470129091294, -0.31768619797192515, -0.005240002452046611, -0.29688874825835226, -0.16283759792917407, 0.26771779475559015, 0.01629786116303876, 0.13496454145293682, 0.020927593685046306, -0.15673954216064886, -0.07503727313131094, -0.20877916385652498, 0.27856816865038125, 0.009545639234711417, 0.40778500378597526, 0.13416474043158813, 0.0004535142530221492, -0.03449004336027429, 0.12904697085497902, -0.014225107349921018, -0.16111991486490296, 0.08253971724479925, 0.3169670725183096, -0.13425320302252658, 0.18340465100947767, -0.5181183230411261, -0.25121615679294335, 0.01003079931717366, 0.21595409601926804, 0.16713217816199177, -0.12920083155389875, -0.31093106508255003, 0.11862407608190552, -0.1295812056073919, -0.09571657374952337, -0.07363897183444351, -0.022570259001804517, -0.034070864946988876, -0.20183697544853202, 0.05631414491101168, 0.054925914250779896, 0.04706962496973574, -0.0014209933528036346, -0.08185590090695768, -0.04078466152132023, 0.05603641689987853, -0.03393990425975062, -0.03210625019157305, 0.20316813538316636, -0.13916566327097826, -0.1923454735497944, 0.3130812430719379, -0.026431470627430828, -0.07871465646428988, 0.1789468602638226, -0.10116084089269861, -0.05585067734122276, 0.09411171697080135, 0.12081140920054168, 0.06521095974720083, -0.14768617356196045, 0.08692429840215482, 0.01890752275940031, 0.1560708652914036, 0.04758267137105577, 0.16572208797559143, 0.30564859240024816, 0.2460159207531251, 0.07019653445619042, 0.12330662642692915, -0.111879600280663, -0.055691613973176575, -0.21492268453817814, -0.2650869230850367, -0.2782014422705106, 0.06835240641259588, -0.02797554802556988, -0.2374645793477248, 0.38848181995446796, 0.17483133562258446, 0.11097779002506286, -0.058154108964372425, 0.22134648218518124, 0.0818862709836685, 0.0989731069561094, 0.04022369184880517, 0.2297563384915702, 0.18237911482458002, 0.10693226297269576, -0.2834767462860327, 0.0681359740300104, -0.03673517032060772]
|
1,803.07621
|
Measurement driven single temperature engine
|
A four stroke quantum engine which alternately interacts with a measurement
apparatus and a single heat bath is discussed in detail with respect to the
average work and heat as well as to the fluctuations of work and heat. The
efficiency and the reliability of such an engine with a harmonic oscillator as
working substance are analyzed under different conditions such as different
speeds of the work strokes, different temperatures of the heat bath and various
strengths of the energy supplying measurement. For imperfect thermalization
strokes of finite duration also the power of the engine is analyzed. A
comparison with a two-temperature Otto engine is provided in the particular
case of adiabatic work and ideal thermalization strokes.
|
cond-mat.stat-mech quant-ph
|
a four stroke quantum engine which alternately interacts with a measurement apparatus and a single heat bath is discussed in detail with respect to the average work and heat as well as to the fluctuations of work and heat the efficiency and the reliability of such an engine with a harmonic oscillator as working substance are analyzed under different conditions such as different speeds of the work strokes different temperatures of the heat bath and various strengths of the energy supplying measurement for imperfect thermalization strokes of finite duration also the power of the engine is analyzed a comparison with a twotemperature otto engine is provided in the particular case of adiabatic work and ideal thermalization strokes
|
[['a', 'four', 'stroke', 'quantum', 'engine', 'which', 'alternately', 'interacts', 'with', 'a', 'measurement', 'apparatus', 'and', 'a', 'single', 'heat', 'bath', 'is', 'discussed', 'in', 'detail', 'with', 'respect', 'to', 'the', 'average', 'work', 'and', 'heat', 'as', 'well', 'as', 'to', 'the', 'fluctuations', 'of', 'work', 'and', 'heat', 'the', 'efficiency', 'and', 'the', 'reliability', 'of', 'such', 'an', 'engine', 'with', 'a', 'harmonic', 'oscillator', 'as', 'working', 'substance', 'are', 'analyzed', 'under', 'different', 'conditions', 'such', 'as', 'different', 'speeds', 'of', 'the', 'work', 'strokes', 'different', 'temperatures', 'of', 'the', 'heat', 'bath', 'and', 'various', 'strengths', 'of', 'the', 'energy', 'supplying', 'measurement', 'for', 'imperfect', 'thermalization', 'strokes', 'of', 'finite', 'duration', 'also', 'the', 'power', 'of', 'the', 'engine', 'is', 'analyzed', 'a', 'comparison', 'with', 'a', 'twotemperature', 'otto', 'engine', 'is', 'provided', 'in', 'the', 'particular', 'case', 'of', 'adiabatic', 'work', 'and', 'ideal', 'thermalization', 'strokes']]
|
[-0.08827504578532062, 0.16667017533006565, -0.03195177935039959, 0.0017800881979095503, -0.022192608977023225, -0.1525806422687621, 0.044234863934146926, 0.3592346686328578, -0.2286390038445974, -0.30721908349108, 0.09943760255486983, -0.30364096854240274, -0.018302004598280113, 0.27348855164093083, -0.032714513488687, 0.06812265430155218, 0.05704624898349627, 0.09842361891632263, -0.03030919326115081, -0.16720543887951753, 0.27207717277173304, 0.1546018828277707, 0.2928540656008782, 0.08165674108333297, 0.10958413000847413, -0.04580509125674939, 0.024737002765839428, 0.044628983258038886, -0.08554013325777064, 0.04654794290629972, 0.21963847660196897, 0.04891349592556556, 0.25875639921038324, -0.4387126170640063, -0.25123150808275, 0.09071343230545266, 0.07649292732971028, 0.07838134575360574, -0.035457958489941016, -0.20731525731066036, -0.01031862910832955, -0.19977638255963978, -0.0808840400308498, -0.04964660542470335, 0.027412487854623895, 0.08205021793643634, -0.2677183215144194, 0.07531565778443995, 0.12525249307043104, 0.09533677621879894, -0.05979433055951172, -0.033660557160838545, -0.009818082861403305, 0.14730099049739093, 0.03404301451320131, -0.015126067452514783, 0.22425567347190192, -0.13764382854231402, -0.0912804980802103, 0.39309747415220636, -0.10007744658993095, -0.17257007224182797, 0.2126791486237994, -0.08773439709479228, -0.0689502839341314, 0.059590450221370175, 0.1272765931307187, 0.13449014771857068, -0.19966540408147096, -0.007506950673822345, 0.01355665454115623, 0.12648635922779894, 0.07634114601816504, 0.026467105676221032, 0.19748254018461603, 0.18378993338491353, -0.0144980223929016, 0.2519592453056994, -0.07182371960236476, -0.11462169501166312, -0.32996137235632056, -0.20972326705749664, -0.20847218417618266, 0.06666053518748437, -0.08793591367778304, -0.11654230141136636, 0.43718841856616175, 0.12761340590400827, 0.1759671503658064, 0.008966562941393807, 0.3299707326815169, 0.13742644801879159, -0.011807687397504974, 0.08914813195140316, 0.21827538158649054, 0.13713898207259995, 0.1570057902389612, -0.298273107319529, 0.011087911975625744, 0.015635195958356444]
|
1,803.07622
|
Long term availability of raw experimental data in experimental fracture
mechanics
|
Experimental data availability is a cornerstone for reproducibility in
experimental fracture mechanics, which is crucial to the scientific method.
This short communication focuses on the accessibility and long term
availability of raw experimental data. The corresponding authors of the eleven
most cited papers, related to experimental fracture mechanics, for every year
from 2000 up to 2016, were kindly asked about the availability of the raw
experimental data associated with each publication. For the 187 e-mails sent:
22.46% resulted in outdated contact information, 57.75% of the authors did
received our request and did not reply, and 19.79 replied to our request. The
availability of data is generally low with only $11$ available data sets
(5.9%). The authors identified two main issues for the lacking availability of
raw experimental data. First, the ability to retrieve data is strongly attached
to the the possibility to contact the corresponding author. This study suggests
that institutional e-mail addresses are insufficient means for obtaining
experimental data sets. Second, lack of experimental data is also due that
submission and publication does not require to make the raw experimental data
available. The following solutions are proposed: (1) Requirement of unique
identifiers, like ORCID or ResearcherID, to detach the author(s) from their
institutional e-mail address, (2) Provide DOIs, like Zenodo or Dataverse, to
make raw experimental data citable, and (3) grant providing organizations
should ensure that experimental data by public funded projects is available to
the public.
|
cs.DL stat.AP
|
experimental data availability is a cornerstone for reproducibility in experimental fracture mechanics which is crucial to the scientific method this short communication focuses on the accessibility and long term availability of raw experimental data the corresponding authors of the eleven most cited papers related to experimental fracture mechanics for every year from 2000 up to 2016 were kindly asked about the availability of the raw experimental data associated with each publication for the 187 emails sent 2246 resulted in outdated contact information 5775 of the authors did received our request and did not reply and 1979 replied to our request the availability of data is generally low with only 11 available data sets 59 the authors identified two main issues for the lacking availability of raw experimental data first the ability to retrieve data is strongly attached to the the possibility to contact the corresponding author this study suggests that institutional email addresses are insufficient means for obtaining experimental data sets second lack of experimental data is also due that submission and publication does not require to make the raw experimental data available the following solutions are proposed 1 requirement of unique identifiers like orcid or researcherid to detach the authors from their institutional email address 2 provide dois like zenodo or dataverse to make raw experimental data citable and 3 grant providing organizations should ensure that experimental data by public funded projects is available to the public
|
[['experimental', 'data', 'availability', 'is', 'a', 'cornerstone', 'for', 'reproducibility', 'in', 'experimental', 'fracture', 'mechanics', 'which', 'is', 'crucial', 'to', 'the', 'scientific', 'method', 'this', 'short', 'communication', 'focuses', 'on', 'the', 'accessibility', 'and', 'long', 'term', 'availability', 'of', 'raw', 'experimental', 'data', 'the', 'corresponding', 'authors', 'of', 'the', 'eleven', 'most', 'cited', 'papers', 'related', 'to', 'experimental', 'fracture', 'mechanics', 'for', 'every', 'year', 'from', '2000', 'up', 'to', '2016', 'were', 'kindly', 'asked', 'about', 'the', 'availability', 'of', 'the', 'raw', 'experimental', 'data', 'associated', 'with', 'each', 'publication', 'for', 'the', '187', 'emails', 'sent', '2246', 'resulted', 'in', 'outdated', 'contact', 'information', '5775', 'of', 'the', 'authors', 'did', 'received', 'our', 'request', 'and', 'did', 'not', 'reply', 'and', '1979', 'replied', 'to', 'our', 'request', 'the', 'availability', 'of', 'data', 'is', 'generally', 'low', 'with', 'only', '11', 'available', 'data', 'sets', '59', 'the', 'authors', 'identified', 'two', 'main', 'issues', 'for', 'the', 'lacking', 'availability', 'of', 'raw', 'experimental', 'data', 'first', 'the', 'ability', 'to', 'retrieve', 'data', 'is', 'strongly', 'attached', 'to', 'the', 'the', 'possibility', 'to', 'contact', 'the', 'corresponding', 'author', 'this', 'study', 'suggests', 'that', 'institutional', 'email', 'addresses', 'are', 'insufficient', 'means', 'for', 'obtaining', 'experimental', 'data', 'sets', 'second', 'lack', 'of', 'experimental', 'data', 'is', 'also', 'due', 'that', 'submission', 'and', 'publication', 'does', 'not', 'require', 'to', 'make', 'the', 'raw', 'experimental', 'data', 'available', 'the', 'following', 'solutions', 'are', 'proposed', '1', 'requirement', 'of', 'unique', 'identifiers', 'like', 'orcid', 'or', 'researcherid', 'to', 'detach', 'the', 'authors', 'from', 'their', 'institutional', 'email', 'address', '2', 'provide', 'dois', 'like', 'zenodo', 'or', 'dataverse', 'to', 'make', 'raw', 'experimental', 'data', 'citable', 'and', '3', 'grant', 'providing', 'organizations', 'should', 'ensure', 'that', 'experimental', 'data', 'by', 'public', 'funded', 'projects', 'is', 'available', 'to', 'the', 'public']]
|
[-0.0884483314786711, 0.035013896904488584, -0.0448159567010002, 0.03761393219788222, -0.1600847436015361, -0.15185861542680057, 0.09890035546517797, 0.3544545602796897, -0.21909208395449883, -0.37366576483003605, 0.14991649098673782, -0.3845635108794516, -0.06229350152019482, 0.20124369713149087, -0.13337710400957206, 0.08683809373618745, 0.13474625798662296, 0.041588099768405835, 0.013992581206389522, -0.3445112492508615, 0.28296366059651773, 0.09879956107406619, 0.3459832948288184, 0.09078079288602345, 0.03860102699528558, 0.001211202670399397, -0.15208451239198462, -0.05962740926428095, -0.11712864170115937, 0.16835261194794557, 0.3246295206598985, 0.21921104551566875, 0.2881937421635263, -0.4205921707715704, -0.14801361290111886, 0.04723496039832371, 0.08315681486719233, 0.10529332912278541, -0.02510672901950761, -0.3179046192006873, 0.08390809604976357, -0.17323747996882605, -0.07467214758860088, -0.07051942493578717, 0.04943579826073549, 0.02368057391580836, -0.22371733067884939, 0.059072782698712516, 0.0051695039459629406, 0.11637184571693926, -0.07321554831690899, -0.12041115687432222, -0.026127806659637483, 0.20122953273449876, 0.07024733293478713, 0.059096045367529285, 0.10496430785445097, -0.08829049043506071, -0.11643368219604575, 0.39098261459143596, 0.013629015269390886, -0.11204563131743744, 0.18696810157985247, -0.10467948842409239, -0.1730037557622496, 0.11762398252549323, 0.14187224779939359, 0.005770210497582159, -0.1914926878316768, 0.0025794801561253833, -0.020742686273639694, 0.2140097473082798, 0.07522293528348223, -0.007491788979494521, 0.15149425210611223, 0.1402395258583285, -0.016182140505896146, 0.07942331688304455, -0.06555765903943234, -0.04853843379581833, -0.26887926864907336, -0.12035991129183657, -0.20639377787314012, 0.05153176790319027, 0.0008767995645977877, -0.11009123626002698, 0.3455506478037153, 0.21063426306995586, 0.1397019351124294, 0.01840433183550725, 0.287043058203862, -0.03790246156834755, 0.09536898621665402, 0.07966389636334986, 0.21034924031094404, 0.003742451165184504, 0.217885657708638, -0.10644098990628625, 0.12688387382360755, -0.03162058439373431]
|
1,803.07623
|
Resummation for (boosted) top-quark pair production at NNLO+NNLL' in QCD
|
We construct predictions for top quark pair differential distributions at
hadron colliders that combine state-of-the-art NNLO QCD calculations with
double resummation at NNLL' accuracy of threshold logarithms arising from soft
gluon emissions and of small mass logarithms. This is the first time a resummed
calculation at full NNLO+NNLL' accuracy in QCD for a process with non-trivial
color structure has been completed at the differential level. Of main interest
to us is the stability of the M_{tt} and top-quark p_T distributions in the
boosted regime where fixed order calculations may become strongly dependent on
the choice of dynamic scales. With the help of numeric and analytic arguments
we confirm that the choice for the factorization and renormalization scales
advocated recently by some of the authors is indeed optimal. We further derive
a set of optimized kinematics-dependent scales for the matching functions which
appear in the resummed calculations. Our NNLO+NNLL' prediction for the top-pair
invariant mass is significantly less sensitive to the choice of factorization
scale than the fixed order prediction, even at NNLO. Notably, the resummed and
fixed order calculations are in nearly perfect agreement with each other in the
full M_{tt} range when the optimal dynamic scale is used. For the top-quark p_T
distribution the resummation performed here has less of an impact and instead
we find that upgrading the matching with fixed-order from NLO+NNLL' to
NNLO+NNLL' to be an important effect, a point to be kept in mind when using
NLO-based Monte Carlo event generators to calculate this distribution.
|
hep-ph hep-ex
|
we construct predictions for top quark pair differential distributions at hadron colliders that combine stateoftheart nnlo qcd calculations with double resummation at nnll accuracy of threshold logarithms arising from soft gluon emissions and of small mass logarithms this is the first time a resummed calculation at full nnlonnll accuracy in qcd for a process with nontrivial color structure has been completed at the differential level of main interest to us is the stability of the m_tt and topquark p_t distributions in the boosted regime where fixed order calculations may become strongly dependent on the choice of dynamic scales with the help of numeric and analytic arguments we confirm that the choice for the factorization and renormalization scales advocated recently by some of the authors is indeed optimal we further derive a set of optimized kinematicsdependent scales for the matching functions which appear in the resummed calculations our nnlonnll prediction for the toppair invariant mass is significantly less sensitive to the choice of factorization scale than the fixed order prediction even at nnlo notably the resummed and fixed order calculations are in nearly perfect agreement with each other in the full m_tt range when the optimal dynamic scale is used for the topquark p_t distribution the resummation performed here has less of an impact and instead we find that upgrading the matching with fixedorder from nlonnll to nnlonnll to be an important effect a point to be kept in mind when using nlobased monte carlo event generators to calculate this distribution
|
[['we', 'construct', 'predictions', 'for', 'top', 'quark', 'pair', 'differential', 'distributions', 'at', 'hadron', 'colliders', 'that', 'combine', 'stateoftheart', 'nnlo', 'qcd', 'calculations', 'with', 'double', 'resummation', 'at', 'nnll', 'accuracy', 'of', 'threshold', 'logarithms', 'arising', 'from', 'soft', 'gluon', 'emissions', 'and', 'of', 'small', 'mass', 'logarithms', 'this', 'is', 'the', 'first', 'time', 'a', 'resummed', 'calculation', 'at', 'full', 'nnlonnll', 'accuracy', 'in', 'qcd', 'for', 'a', 'process', 'with', 'nontrivial', 'color', 'structure', 'has', 'been', 'completed', 'at', 'the', 'differential', 'level', 'of', 'main', 'interest', 'to', 'us', 'is', 'the', 'stability', 'of', 'the', 'm_tt', 'and', 'topquark', 'p_t', 'distributions', 'in', 'the', 'boosted', 'regime', 'where', 'fixed', 'order', 'calculations', 'may', 'become', 'strongly', 'dependent', 'on', 'the', 'choice', 'of', 'dynamic', 'scales', 'with', 'the', 'help', 'of', 'numeric', 'and', 'analytic', 'arguments', 'we', 'confirm', 'that', 'the', 'choice', 'for', 'the', 'factorization', 'and', 'renormalization', 'scales', 'advocated', 'recently', 'by', 'some', 'of', 'the', 'authors', 'is', 'indeed', 'optimal', 'we', 'further', 'derive', 'a', 'set', 'of', 'optimized', 'kinematicsdependent', 'scales', 'for', 'the', 'matching', 'functions', 'which', 'appear', 'in', 'the', 'resummed', 'calculations', 'our', 'nnlonnll', 'prediction', 'for', 'the', 'toppair', 'invariant', 'mass', 'is', 'significantly', 'less', 'sensitive', 'to', 'the', 'choice', 'of', 'factorization', 'scale', 'than', 'the', 'fixed', 'order', 'prediction', 'even', 'at', 'nnlo', 'notably', 'the', 'resummed', 'and', 'fixed', 'order', 'calculations', 'are', 'in', 'nearly', 'perfect', 'agreement', 'with', 'each', 'other', 'in', 'the', 'full', 'm_tt', 'range', 'when', 'the', 'optimal', 'dynamic', 'scale', 'is', 'used', 'for', 'the', 'topquark', 'p_t', 'distribution', 'the', 'resummation', 'performed', 'here', 'has', 'less', 'of', 'an', 'impact', 'and', 'instead', 'we', 'find', 'that', 'upgrading', 'the', 'matching', 'with', 'fixedorder', 'from', 'nlonnll', 'to', 'nnlonnll', 'to', 'be', 'an', 'important', 'effect', 'a', 'point', 'to', 'be', 'kept', 'in', 'mind', 'when', 'using', 'nlobased', 'monte', 'carlo', 'event', 'generators', 'to', 'calculate', 'this', 'distribution']]
|
[-0.060373278599487795, 0.11900150532387817, -0.14598930016114947, 0.11790638026900524, -0.043673561683634385, -0.07404318923199166, 0.024136726013121886, 0.37336740527872836, -0.20570986688553897, -0.29064977184809265, 0.06047092173755499, -0.3118558532911383, -0.019989808961268393, 0.15150967171329313, 0.031701622217247684, 0.1347732960975038, 0.07689804754280034, 0.012017298700107683, -0.09679963702764062, -0.23807589356663578, 0.32758921531832685, 0.11263346112889028, 0.21645824958743046, 0.11845593410731864, 0.09258098066821994, 0.046756219143243204, -0.07513228152416676, 0.00023398696324757992, -0.1403508309491489, 0.07797826691662081, 0.27364866972329177, -0.001980060365073563, 0.20054749934760982, -0.34376800049193984, -0.12788273893050744, 0.05855599990219719, 0.1477943800376623, 0.12339595280906407, -0.03240335004961854, -0.2123811247968866, 0.15495210679833807, -0.2384222731212034, -0.13222508686369344, -0.11664014703203593, -0.031039252164426274, -0.026452880602465163, -0.3435773210106662, 0.05061176533608006, -0.04365565854447683, 0.007460399131706518, 0.03704367384935106, -0.16712595768378027, -0.05040435557771895, 0.101305016200997, 0.08540031888778979, 0.07586687342923289, 0.13578881439189577, -0.18906239196545474, -0.169070304993863, 0.3887851629744194, -0.05999186663023964, -0.17369184892008743, 0.14204278890763583, -0.21480279588497303, -0.18366483170088502, 0.1651040716495763, 0.18921460758522904, 0.13233402145523276, -0.12819778623569647, 0.11036172113897684, 0.0046873599647134995, 0.19815493989869626, 0.07695751589152121, 0.03358055307736293, 0.157216063899649, 0.17476259725123283, 0.02030663233580849, 0.06306720799846281, -0.06902879257141913, -0.13283945757552096, -0.3723118874064136, -0.06722876631031413, -0.11576331955110354, 0.03117509133317658, -0.13579938724280743, -0.15274808297099005, 0.3715458534237358, 0.18492205520376429, 0.24509778436021729, 0.08433008832798805, 0.3179896352962861, 0.1682595843938015, 0.09067162094476272, 0.08462065226781453, 0.2557669074032615, 0.10252124027559353, 0.08040795450271558, -0.22864611826521614, 0.06428160242367378, 0.08258216114594571]
|
1,803.07624
|
Dynamic Filtering with Large Sampling Field for ConvNets
|
We propose a dynamic filtering strategy with large sampling field for
ConvNets (LS-DFN), where the position-specific kernels learn from not only the
identical position but also multiple sampled neighbor regions. During sampling,
residual learning is introduced to ease training and an attention mechanism is
applied to fuse features from different samples. Such multiple samples enlarge
the kernels' receptive fields significantly without requiring more parameters.
While LS-DFN inherits the advantages of DFN, namely avoiding feature map
blurring by position-wise kernels while keeping translation invariance, it also
efficiently alleviates the overfitting issue caused by much more parameters
than normal CNNs. Our model is efficient and can be trained end-to-end via
standard back-propagation. We demonstrate the merits of our LS-DFN on both
sparse and dense prediction tasks involving object detection, semantic
segmentation, and flow estimation. Our results show LS-DFN enjoys stronger
recognition abilities in object detection and semantic segmentation tasks on
VOC benchmark and sharper responses in flow estimation on FlyingChairs dataset
compared to strong baselines.
|
cs.CV cs.LG
|
we propose a dynamic filtering strategy with large sampling field for convnets lsdfn where the positionspecific kernels learn from not only the identical position but also multiple sampled neighbor regions during sampling residual learning is introduced to ease training and an attention mechanism is applied to fuse features from different samples such multiple samples enlarge the kernels receptive fields significantly without requiring more parameters while lsdfn inherits the advantages of dfn namely avoiding feature map blurring by positionwise kernels while keeping translation invariance it also efficiently alleviates the overfitting issue caused by much more parameters than normal cnns our model is efficient and can be trained endtoend via standard backpropagation we demonstrate the merits of our lsdfn on both sparse and dense prediction tasks involving object detection semantic segmentation and flow estimation our results show lsdfn enjoys stronger recognition abilities in object detection and semantic segmentation tasks on voc benchmark and sharper responses in flow estimation on flyingchairs dataset compared to strong baselines
|
[['we', 'propose', 'a', 'dynamic', 'filtering', 'strategy', 'with', 'large', 'sampling', 'field', 'for', 'convnets', 'lsdfn', 'where', 'the', 'positionspecific', 'kernels', 'learn', 'from', 'not', 'only', 'the', 'identical', 'position', 'but', 'also', 'multiple', 'sampled', 'neighbor', 'regions', 'during', 'sampling', 'residual', 'learning', 'is', 'introduced', 'to', 'ease', 'training', 'and', 'an', 'attention', 'mechanism', 'is', 'applied', 'to', 'fuse', 'features', 'from', 'different', 'samples', 'such', 'multiple', 'samples', 'enlarge', 'the', 'kernels', 'receptive', 'fields', 'significantly', 'without', 'requiring', 'more', 'parameters', 'while', 'lsdfn', 'inherits', 'the', 'advantages', 'of', 'dfn', 'namely', 'avoiding', 'feature', 'map', 'blurring', 'by', 'positionwise', 'kernels', 'while', 'keeping', 'translation', 'invariance', 'it', 'also', 'efficiently', 'alleviates', 'the', 'overfitting', 'issue', 'caused', 'by', 'much', 'more', 'parameters', 'than', 'normal', 'cnns', 'our', 'model', 'is', 'efficient', 'and', 'can', 'be', 'trained', 'endtoend', 'via', 'standard', 'backpropagation', 'we', 'demonstrate', 'the', 'merits', 'of', 'our', 'lsdfn', 'on', 'both', 'sparse', 'and', 'dense', 'prediction', 'tasks', 'involving', 'object', 'detection', 'semantic', 'segmentation', 'and', 'flow', 'estimation', 'our', 'results', 'show', 'lsdfn', 'enjoys', 'stronger', 'recognition', 'abilities', 'in', 'object', 'detection', 'and', 'semantic', 'segmentation', 'tasks', 'on', 'voc', 'benchmark', 'and', 'sharper', 'responses', 'in', 'flow', 'estimation', 'on', 'flyingchairs', 'dataset', 'compared', 'to', 'strong', 'baselines']]
|
[-0.005637477175187991, 0.028200216638448544, -0.04495121252589992, 0.07088269682486126, -0.13789305139784208, -0.19563685916364193, 0.02212081194250781, 0.49216527975401525, -0.27668526646050606, -0.34199166472029424, 0.06775118455562672, -0.2517215958912134, -0.15976785355636572, 0.2029082679771095, -0.1578519100942273, 0.07993956370082517, 0.1823252728628284, 0.0175655094880657, -0.09547297366003951, -0.26874600715215047, 0.25379709114453625, 0.06719717080704868, 0.368768073872935, -0.0064786414222456285, 0.14488462586626874, -0.01830159525404343, -0.05599591115154095, -0.01724087435937261, -0.00887525405428193, 0.13914639424816097, 0.2637700742278364, 0.15861898536869087, 0.3035686792146345, -0.3943155654922984, -0.2663201290813292, 0.104938489477503, 0.1478858668044765, 0.09520981219012915, -0.028528129886394738, -0.38594469808111465, 0.09776606587461711, -0.12726750690923852, 0.058617252373477875, -0.17040538424857377, -0.04650769600288954, -0.02980891296492531, -0.3218074686281522, 0.0716979471378763, 0.11132106549317676, 0.06161143752942961, -0.03863175815659697, -0.1269260207294148, 0.0034405184918378266, 0.1404253929124578, 0.04155975967929091, 0.05730765372202356, 0.1582952813447456, -0.247911695573155, -0.09631241445562669, 0.34523917315238567, -0.055769486730699196, -0.2377531022232558, 0.23180394582392544, -0.03174090603083048, -0.12264426539056235, 0.13414299927119697, 0.2008770134591755, 0.12350642346192776, -0.1206745055275651, 0.009284594337027868, -0.01533213069211252, 0.18508096631928722, 0.07195115503594741, -0.009020077764571453, 0.14217129114997915, 0.22744963412398692, 0.07387853460892549, 0.16038400246920817, -0.18834149187448093, -0.08673438607420055, -0.17294994549122958, -0.056051661414441345, -0.18566523602822368, -0.0653446779038825, -0.15988251696697217, -0.12433819810584006, 0.4075344833603233, 0.25609720622692606, 0.2362524888299981, 0.13262289328651028, 0.35576487982989813, 0.025397099038985158, 0.17893275148842647, 0.11197676306289638, 0.18276253017750194, 0.028808153862052637, 0.0886721102960454, -0.1777304294779434, 0.10578873142403383, 0.0685665221358447]
|
1,803.07625
|
Efficient treatment of bilinear forms in global optimization
|
We efficiently treat bilinear forms in the context of global optimization, by
applying McCormick convexification and by extending an approach of Saxena,
Bonami and Lee for symmetric quadratic forms to bilinear forms. A key
application of our work is in treating "structural convexity" in a symmetric
quadratic form.
|
math.OC
|
we efficiently treat bilinear forms in the context of global optimization by applying mccormick convexification and by extending an approach of saxena bonami and lee for symmetric quadratic forms to bilinear forms a key application of our work is in treating structural convexity in a symmetric quadratic form
|
[['we', 'efficiently', 'treat', 'bilinear', 'forms', 'in', 'the', 'context', 'of', 'global', 'optimization', 'by', 'applying', 'mccormick', 'convexification', 'and', 'by', 'extending', 'an', 'approach', 'of', 'saxena', 'bonami', 'and', 'lee', 'for', 'symmetric', 'quadratic', 'forms', 'to', 'bilinear', 'forms', 'a', 'key', 'application', 'of', 'our', 'work', 'is', 'in', 'treating', 'structural', 'convexity', 'in', 'a', 'symmetric', 'quadratic', 'form']]
|
[-0.12289849245765556, -0.014937350475217196, -0.08077922401328881, 0.05379282962773383, -0.11120068072341383, -0.11182895417247589, 0.016578068665694445, 0.2878406729238729, -0.32223278158926405, -0.2454238022425367, 0.10427566609238663, -0.21654320172577476, -0.25778737214083475, 0.19424726406577975, -0.06990346888778731, 0.07426627019109826, -0.06380264271380535, -0.04974840759920577, -0.15570786972724213, -0.2920013947101931, 0.3766725042757268, 0.032744877389632165, 0.17435835635599992, 0.030908728658687323, 0.06071436435255843, 0.10680450950167142, -0.016207461633409064, -0.02203199886328851, -0.06999095061716314, 0.20600328002668297, 0.2672578640728413, 0.1124321195917825, 0.30871860690725345, -0.4120517805761968, -0.18666304019279778, 0.08536920838135605, 0.08354148800329615, 0.06266455651105692, -0.09942402799303333, -0.2681813928453873, 0.07546922645512193, -0.1704643391033945, -0.12810280110958652, -0.15117843623738736, -0.010403370096658668, 0.02156437731658419, -0.36073470072976005, 0.09939466114155948, 0.14766997644134486, 0.053320210601668805, -0.1347191141200407, -0.10708283754259658, 0.04586862519014782, -0.0036173766517701247, 0.003777070878034768, 0.05701770325928616, 0.03557441667847646, -0.08943114643140386, -0.11729308698947231, 0.32923765666782856, -0.09661532665874499, -0.2488668116275221, 0.12468876274457823, -0.016131099585133295, -0.14999079417126873, 0.05462553059138978, 0.1971780271657432, 0.17577714360474297, -0.17411916811640063, 0.20463647274057925, -0.08868713090972354, 0.07619307215888209, 0.14461183216189966, -0.06722647902400543, 0.10472033709083917, 0.09394017176236957, 0.10381289748086904, 0.24193780180454874, 0.04103883010369221, -0.18829089732995877, -0.2616640165021333, -0.18051454203668982, -0.16257534802813703, 0.04009476472371413, -0.08330436104188266, -0.1050424119263577, 0.4079811724514002, 0.05060461846490701, 0.19434832457530624, 0.06157964837620966, 0.2690250386149273, 0.11040488451302129, 0.10368064922901492, 0.08409849085728638, 0.17949182927259244, 0.19161873311774494, 0.025932341086445376, -0.17463824021979235, 0.041030904928144686, 0.15203119990959144]
|
1,803.07626
|
Mechanisms for Primordial Black Hole Production in String Theory
|
We consider mechanisms for producing a significant population of primordial
black holes (PBHs) within string inspired single field models of inflation. The
production of PBHs requires a large amplification in the power spectrum of
curvature perturbations between scales associated with CMB and PBH formation.
In principle, this can be achieved by temporarily breaking the slow-roll
conditions during inflation. In this work, we identify two string setups that
can realise this process. In string axion models of inflation, subleading
non-perturbative effects can superimpose steep cliffs and gentle plateaus onto
the leading axion potential. The cliffs can momentarily violate the slow-roll
conditions, and the plateaus can lead to phases of ultra slow-roll inflation.
We thus achieve a string motivated model which both matches the Planck
observations at CMB scales and produces a population of light PBHs, which can
account for an order one fraction of dark matter. In DBI models of inflation, a
sharp increase in the speed of sound sourced by a steep downward step in the
warp factor can drive the amplification. In this scenario, discovery of PBHs
could indicate non-trivial dynamics in the bulk, such as flux-antibrane
annihilation at the tip of a warped throat.
|
hep-th astro-ph.CO
|
we consider mechanisms for producing a significant population of primordial black holes pbhs within string inspired single field models of inflation the production of pbhs requires a large amplification in the power spectrum of curvature perturbations between scales associated with cmb and pbh formation in principle this can be achieved by temporarily breaking the slowroll conditions during inflation in this work we identify two string setups that can realise this process in string axion models of inflation subleading nonperturbative effects can superimpose steep cliffs and gentle plateaus onto the leading axion potential the cliffs can momentarily violate the slowroll conditions and the plateaus can lead to phases of ultra slowroll inflation we thus achieve a string motivated model which both matches the planck observations at cmb scales and produces a population of light pbhs which can account for an order one fraction of dark matter in dbi models of inflation a sharp increase in the speed of sound sourced by a steep downward step in the warp factor can drive the amplification in this scenario discovery of pbhs could indicate nontrivial dynamics in the bulk such as fluxantibrane annihilation at the tip of a warped throat
|
[['we', 'consider', 'mechanisms', 'for', 'producing', 'a', 'significant', 'population', 'of', 'primordial', 'black', 'holes', 'pbhs', 'within', 'string', 'inspired', 'single', 'field', 'models', 'of', 'inflation', 'the', 'production', 'of', 'pbhs', 'requires', 'a', 'large', 'amplification', 'in', 'the', 'power', 'spectrum', 'of', 'curvature', 'perturbations', 'between', 'scales', 'associated', 'with', 'cmb', 'and', 'pbh', 'formation', 'in', 'principle', 'this', 'can', 'be', 'achieved', 'by', 'temporarily', 'breaking', 'the', 'slowroll', 'conditions', 'during', 'inflation', 'in', 'this', 'work', 'we', 'identify', 'two', 'string', 'setups', 'that', 'can', 'realise', 'this', 'process', 'in', 'string', 'axion', 'models', 'of', 'inflation', 'subleading', 'nonperturbative', 'effects', 'can', 'superimpose', 'steep', 'cliffs', 'and', 'gentle', 'plateaus', 'onto', 'the', 'leading', 'axion', 'potential', 'the', 'cliffs', 'can', 'momentarily', 'violate', 'the', 'slowroll', 'conditions', 'and', 'the', 'plateaus', 'can', 'lead', 'to', 'phases', 'of', 'ultra', 'slowroll', 'inflation', 'we', 'thus', 'achieve', 'a', 'string', 'motivated', 'model', 'which', 'both', 'matches', 'the', 'planck', 'observations', 'at', 'cmb', 'scales', 'and', 'produces', 'a', 'population', 'of', 'light', 'pbhs', 'which', 'can', 'account', 'for', 'an', 'order', 'one', 'fraction', 'of', 'dark', 'matter', 'in', 'dbi', 'models', 'of', 'inflation', 'a', 'sharp', 'increase', 'in', 'the', 'speed', 'of', 'sound', 'sourced', 'by', 'a', 'steep', 'downward', 'step', 'in', 'the', 'warp', 'factor', 'can', 'drive', 'the', 'amplification', 'in', 'this', 'scenario', 'discovery', 'of', 'pbhs', 'could', 'indicate', 'nontrivial', 'dynamics', 'in', 'the', 'bulk', 'such', 'as', 'fluxantibrane', 'annihilation', 'at', 'the', 'tip', 'of', 'a', 'warped', 'throat']]
|
[-0.18690527143935937, 0.22242794807064525, -0.11197300280133883, 0.13816434494493035, -0.07161857705228986, -0.12472883499919986, 0.001293179717583534, 0.2917419839363832, -0.21734741390085754, -0.33133740902711184, 0.05303645066690082, -0.2260276851650232, -0.08079266523799071, 0.18733900893503466, -0.06004765837883147, 0.011263918690383434, 0.012707952396848646, -0.01975493240886583, 0.0017822377252368592, -0.256808981190746, 0.30959191976043465, 0.12124446938411357, 0.2241580227151131, 0.03152113341463682, 0.04769322600406714, -0.12380421564926226, 0.022937058127568796, -0.010278557637372078, -0.13836190738638368, 0.05222612311585974, 0.1804923404011695, 0.1165818764278904, 0.2055604719497168, -0.48371964621071056, -0.2772669773310041, 0.1576440337806558, 0.18456949476057138, 0.17010918254964053, -0.06728883521117938, -0.25501351951119994, 0.05535699803358278, -0.19010614185080602, -0.0979565940080927, -0.04914363450490129, -0.007298398062658425, -0.06973808732552406, -0.2867938568445448, 0.13449027753936557, 0.009287759441977891, -0.07881384822898187, -0.05738874274210479, -0.0028973824069954647, -0.046194111854315566, 0.013070698779744979, 0.13150405731061116, 0.029114616652711842, 0.19230067690189642, -0.20868157470622697, -0.09729716458525031, 0.382131004663041, -0.1687514037783377, -0.05856360253185416, 0.09360547508232486, -0.16982716242312632, -0.15921465100672766, 0.11930448135647637, 0.16040113292192706, 0.09333634402764102, -0.101469098180025, 0.12646753665429947, 0.0783157948929912, 0.17346884009893984, 0.14489027669724935, 0.04814573141674583, 0.40348568183298295, 0.14385831744338456, 0.04382851521651714, 0.13275765704456716, -0.08038973045589115, -0.06929116118162011, -0.3705251517610099, -0.06700213745069236, -0.1326182060683958, 0.08304992409017033, -0.17118498416444383, -0.17359726164872066, 0.3973181916735111, 0.11087108076944087, 0.24198408015788747, 0.03676545349522852, 0.27099870736451404, 0.08860854190798143, 0.07454472727333315, 0.061786362151495924, 0.3316856165440419, 0.07134938683623496, 0.11756781400718655, -0.21536377378954338, 0.009880087445848264, 0.01493240397136945]
|
1,803.07627
|
Diagonal reduction of matrices over commutative semihereditary Bezout
rings
|
It is proven that every commutative semihereditary Bezout ring in which any
regular element is Gelfand (adequate), is an elementary divisor ring.
|
math.RA math.AC
|
it is proven that every commutative semihereditary bezout ring in which any regular element is gelfand adequate is an elementary divisor ring
|
[['it', 'is', 'proven', 'that', 'every', 'commutative', 'semihereditary', 'bezout', 'ring', 'in', 'which', 'any', 'regular', 'element', 'is', 'gelfand', 'adequate', 'is', 'an', 'elementary', 'divisor', 'ring']]
|
[-0.2287325909445909, 0.02029583025895673, -0.18802157787352122, 0.12883845487588338, -0.16544453232464465, -0.29442631114612927, -0.18474076463925568, 0.3687104235657237, -0.4080532564866272, 0.010133482939140364, 0.1099941699331711, -0.22089128331704574, -0.061213512145596644, 0.175451475110921, -0.19236286666074937, -0.11882159181616524, 0.06488730987025933, 0.1790362416173924, 0.017087986258874564, -0.3144633492285555, 0.3400379570031708, 0.013774855697358196, 0.17604990062219175, 0.02902330938641998, 0.06022725355896083, 0.05219128150069578, 0.011497241698882797, -0.008751525924625721, -0.10973680767777048, 0.09314162711697546, 0.43599990010261536, 0.08587857424704866, 0.19076442189345305, -0.3607412207678532, -0.03401106545193629, 0.2940269459716298, 0.171981922255575, -0.028036412005101076, -0.03653099167753349, -0.17632096421650864, 0.19707385323603044, -0.2705034241926941, -0.2268261083571071, -0.03908272155306556, 0.24926993216980586, 0.008172242648222229, -0.36645274846391246, -0.11826607944782484, 0.20317226047204298, 0.16668991901149804, 0.04966437520289963, -0.0235770280811597, -0.00984896905720234, -0.03416445648128336, -0.1605960777431557, 0.0415732819925655, 0.09854043617749332, 0.04629939525726844, -0.04664648582481525, 0.3562852032482624, -0.008480423130095005, -0.23476866861297327, 0.09308221411298621, -0.20937176738781008, -0.05327981206673113, 0.2149066762490706, -0.17852778030051428, 0.23194801214743743, -0.07374570815061982, 0.34458586323836987, -0.3361809194426645, 0.18455745906315066, 0.15207247351380912, 0.01493802838112143, 0.15148716400356285, 0.11791107820516283, 0.12774484380497597, 0.05730820468372919, 0.11886610988188874, 0.014361508444628933, -0.331814374351366, -0.22188826481049712, -0.236580675129186, 0.18537647831677037, -0.10028517131947658, -0.19460500505837527, 0.3637718114663254, 0.04006622994149273, 0.022543596971610732, 0.009359718263360926, 0.25131739934229036, 0.1106235861608928, 0.1292084697104821, 0.11502866237424314, 0.06686422412961045, 0.25872770290483127, -0.06468811224807393, -0.11410014896484261, -0.028363824271681635, 0.27119758450002834]
|
1,803.07628
|
On Bethe vectors in $\mathfrak{gl}_3$-invariant integrable models
|
We consider quantum integrable models solvable by the nested algebraic Bethe
ansatz and possessing $\mathfrak{gl}_3$-invariant $R$-matrix. We study a new
recently proposed approach to construct on-shell Bethe vectors of these models.
We prove that the vectors constructed by this method are semi-on-shell Bethe
vectors for arbitrary values of Bethe parameters. They thus do become on-shell
vectors provided the system of Bethe equations is fulfilled.
|
math-ph cond-mat.stat-mech hep-th math.MP
|
we consider quantum integrable models solvable by the nested algebraic bethe ansatz and possessing mathfrakgl_3invariant rmatrix we study a new recently proposed approach to construct onshell bethe vectors of these models we prove that the vectors constructed by this method are semionshell bethe vectors for arbitrary values of bethe parameters they thus do become onshell vectors provided the system of bethe equations is fulfilled
|
[['we', 'consider', 'quantum', 'integrable', 'models', 'solvable', 'by', 'the', 'nested', 'algebraic', 'bethe', 'ansatz', 'and', 'possessing', 'mathfrakgl_3invariant', 'rmatrix', 'we', 'study', 'a', 'new', 'recently', 'proposed', 'approach', 'to', 'construct', 'onshell', 'bethe', 'vectors', 'of', 'these', 'models', 'we', 'prove', 'that', 'the', 'vectors', 'constructed', 'by', 'this', 'method', 'are', 'semionshell', 'bethe', 'vectors', 'for', 'arbitrary', 'values', 'of', 'bethe', 'parameters', 'they', 'thus', 'do', 'become', 'onshell', 'vectors', 'provided', 'the', 'system', 'of', 'bethe', 'equations', 'is', 'fulfilled']]
|
[-0.18066305836333732, 0.12712928583283747, -0.06964077728076114, 0.1261223844060349, -0.11681457558676364, -0.18692370833429908, 0.004426688543476519, 0.35234970942376154, -0.27303542300230926, -0.18322484755504226, 0.05953036264205972, -0.25564955903719816, -0.16167357715497177, 0.15235277323148375, 0.05594369864630853, 0.10698797371047217, 0.13199784590433988, 0.05204754542662866, -0.2015949845783383, -0.29594042205754373, 0.36330577535998254, -0.0005121750199043798, 0.29462589181604837, -0.057953697141437305, 0.21666536304271883, 0.0552301286712348, 0.039943019371657146, -0.021173274735846216, -0.16585751933783444, 0.17926952480855915, 0.2845274923155167, 0.14787073317723023, 0.13505860057378571, -0.4276663069391534, -0.1776378514866034, 0.09486514560523487, 0.23691137184551547, 0.21115762045577405, 0.06745615394209467, -0.30331865831145216, 0.06975063507533855, -0.24237155555451792, -0.2309397549205829, -0.1929621243524173, -0.039388728313266286, 0.0017296879382301417, -0.24730477026028055, 0.04882832533044238, 0.04300355987386808, 0.05376101405070383, -0.10676025215625054, -0.18781715379067002, -0.009368547859291235, 0.022175039985172805, 0.027231736106812836, -0.035387944781206666, 0.014303246357788643, -0.07613721145095215, -0.13699697098502564, 0.2784108189895513, 0.022229028566341315, -0.315139356764063, 0.13185821429249786, -0.04708683169964287, -0.15774382150451105, 0.08796678102087407, 0.1078426856843252, 0.08406606587093501, -0.2158379452303052, 0.20560061095544832, -0.13184338564141876, 0.06343588756308668, 0.046995999505891214, -0.016553516329694835, 0.1558091410746177, 0.004359671993861123, -0.051872029275973404, 0.15585624802088927, 0.062070144946494744, -0.14326764965089894, -0.30182070769960917, -0.09865286657291036, -0.19740339191186995, 0.1000121207612138, -0.12505948419349142, -0.23425131368022117, 0.35683255967876265, 0.2068310680074824, 0.18745665824306862, 0.10909042862569174, 0.19231004794202153, 0.2230884207796956, 0.06383573495235945, 0.13079526713709272, 0.1831358086672567, 0.1827559726144601, -0.012043821714108898, -0.19738872441747743, -0.02676060577736251, 0.2595411228119499]
|
1,803.07629
|
Towards observation of three-nucleon short-range correlations in high
Q^2 A(e, e')X reactions
|
We present a detailed study of kinematical and dynamical conditions necessary
for probing highly elusive three-nucleon short range correlations~(3N-SRCs) in
nuclei through inclusive electron scattering. The kinematic requirements that
should be satisfied in order to isolate 3N-SRCs in inclusive processes are
derived. We demonstrate that a sequence of two short-range NN interactions
represents the main mechanism for 3N-SRCs in inclusive processes. Within this
mechanism we predict a quadratic dependence of the inclusive cross section
ratios of nuclei to $^3$He in the 3N-SRC region to the same ratio measured in
2N-SRC domain. The extended analysis of the available data satisfying the
necessary 3N-SRC kinematical conditions is presented. This analysis provides
tantalizing signatures of scaling associated with the onset of 3N-SRC
dominance. The same data are also consistent with the prediction of the
quadratic relation between the ratios measured in the 3N and 2N-SRC regions for
nuclei ranging $4 \le A \le 197$. This agreement made it possible to extract
$a_3(A)$, the probability of 3N-SRCs relative to the A=3 nucleus. We find
$a_3(A)$ to be significantly larger in magnitude than the analogous parameter,
$a_2(A)$, for 2N-SRCs.
|
nucl-th hep-ex hep-ph nucl-ex
|
we present a detailed study of kinematical and dynamical conditions necessary for probing highly elusive threenucleon short range correlations3nsrcs in nuclei through inclusive electron scattering the kinematic requirements that should be satisfied in order to isolate 3nsrcs in inclusive processes are derived we demonstrate that a sequence of two shortrange nn interactions represents the main mechanism for 3nsrcs in inclusive processes within this mechanism we predict a quadratic dependence of the inclusive cross section ratios of nuclei to 3he in the 3nsrc region to the same ratio measured in 2nsrc domain the extended analysis of the available data satisfying the necessary 3nsrc kinematical conditions is presented this analysis provides tantalizing signatures of scaling associated with the onset of 3nsrc dominance the same data are also consistent with the prediction of the quadratic relation between the ratios measured in the 3n and 2nsrc regions for nuclei ranging 4 le a le 197 this agreement made it possible to extract a_3a the probability of 3nsrcs relative to the a3 nucleus we find a_3a to be significantly larger in magnitude than the analogous parameter a_2a for 2nsrcs
|
[['we', 'present', 'a', 'detailed', 'study', 'of', 'kinematical', 'and', 'dynamical', 'conditions', 'necessary', 'for', 'probing', 'highly', 'elusive', 'threenucleon', 'short', 'range', 'correlations3nsrcs', 'in', 'nuclei', 'through', 'inclusive', 'electron', 'scattering', 'the', 'kinematic', 'requirements', 'that', 'should', 'be', 'satisfied', 'in', 'order', 'to', 'isolate', '3nsrcs', 'in', 'inclusive', 'processes', 'are', 'derived', 'we', 'demonstrate', 'that', 'a', 'sequence', 'of', 'two', 'shortrange', 'nn', 'interactions', 'represents', 'the', 'main', 'mechanism', 'for', '3nsrcs', 'in', 'inclusive', 'processes', 'within', 'this', 'mechanism', 'we', 'predict', 'a', 'quadratic', 'dependence', 'of', 'the', 'inclusive', 'cross', 'section', 'ratios', 'of', 'nuclei', 'to', '3he', 'in', 'the', '3nsrc', 'region', 'to', 'the', 'same', 'ratio', 'measured', 'in', '2nsrc', 'domain', 'the', 'extended', 'analysis', 'of', 'the', 'available', 'data', 'satisfying', 'the', 'necessary', '3nsrc', 'kinematical', 'conditions', 'is', 'presented', 'this', 'analysis', 'provides', 'tantalizing', 'signatures', 'of', 'scaling', 'associated', 'with', 'the', 'onset', 'of', '3nsrc', 'dominance', 'the', 'same', 'data', 'are', 'also', 'consistent', 'with', 'the', 'prediction', 'of', 'the', 'quadratic', 'relation', 'between', 'the', 'ratios', 'measured', 'in', 'the', '3n', 'and', '2nsrc', 'regions', 'for', 'nuclei', 'ranging', '4', 'le', 'a', 'le', '197', 'this', 'agreement', 'made', 'it', 'possible', 'to', 'extract', 'a_3a', 'the', 'probability', 'of', '3nsrcs', 'relative', 'to', 'the', 'a3', 'nucleus', 'we', 'find', 'a_3a', 'to', 'be', 'significantly', 'larger', 'in', 'magnitude', 'than', 'the', 'analogous', 'parameter', 'a_2a', 'for', '2nsrcs']]
|
[-0.09678887201524856, 0.12959220236581231, -0.09323268824082334, 0.13391626684072738, -0.015243739114763837, -0.08439732282228457, 0.035484906712210634, 0.34168335610690215, -0.21642538516575263, -0.2947988751771239, -0.004720209970966809, -0.2933058654992945, -0.043966643393246664, 0.17153184107737615, 0.039462210258514256, 0.029979536173373667, 0.02574868858403837, 0.00673802774399519, -0.0741340809750707, -0.18348465729504823, 0.3058074245953725, 0.06642910625733849, 0.23254765600625735, 0.09592409720971773, 0.05357614919776097, 0.032065167104721896, -0.05731405628224214, -0.02083675172697339, -0.17192130568736402, 0.0871203589408348, 0.2679495632473845, 0.07138378688444694, 0.15364661978997496, -0.3803819350587825, -0.13045763005502523, 0.12675537936285966, 0.17735234718032492, 0.07201385023848464, -0.04063302904978627, -0.23606854907443953, 0.10274034087520299, -0.17814188373417386, -0.14639574095361038, -0.0541747697810125, 0.06184573129543828, 0.013347450950338196, -0.30796225463143656, 0.10488011365766094, 0.012109296503129169, 0.04853394776453367, -0.09037910258242239, -0.15363375730877224, -0.005678925702037911, 0.09652351202546722, 0.0557369594125905, 0.0421767154100558, 0.13083696860056887, -0.12955944393632104, -0.08458399187851076, 0.3775367506262329, -0.02294909153562104, -0.13436594410902925, 0.18508935982309696, -0.2046807698355729, -0.16322678264825502, 0.15652665784323794, 0.18106730374921526, 0.09954067931652794, -0.17720734728241547, 0.03501542922846663, -0.01248087307645215, 0.18815552120536772, 0.03958795968339675, 0.05818083709742091, 0.1370536564124955, 0.1904395429094115, -0.003853405350431179, 0.0912649773402437, -0.12240382774066852, -0.09695918894301737, -0.3527321445238259, -0.11124834632953733, -0.07836170745172745, 0.0328260633111414, -0.08661522161095894, -0.07975800912051151, 0.3335683642524398, 0.14138226738359663, 0.26925635042393375, 0.025425721544565426, 0.2641784348550977, 0.08730334277626955, 0.08513054551504966, 0.02205449626263645, 0.31378754549142385, 0.1502297387872305, 0.07846121435027777, -0.228440447724683, 0.07909048246995856, 0.02199342027823958]
|
1,803.0763
|
The Effects of Bandpass Variations on Foreground Removal Forecasts for
Future CMB Experiments
|
Time-dependent and systematic variations in band gain and central frequencies
of instruments used to study the Cosmic Microwave Background are important
factors in the data-to-map analysis pipeline. If not properly characterized,
they could limit the ability of next-generation experiments to remove
astrophysical foreground contamination. Uncertainties include the instrument
detector band, which could systematically change across the focal plane, as
well as the calibration of the instrument used to measure the bands. A
potentially major effect is time-dependent gain and band uncertainties caused
by atmospheric fluctuations. More specifically, changes in atmospheric
conditions lead to frequency-dependent changes in the atmospheric transmission
which, in turn, leads to variations in the effective gain and central frequency
of the instrument's bandpass. Using atmospheric modeling software and ACTPol
bandpasses, we simulate the expected variations in band gain and central
frequency for 20, 40, 90, 150, and 240 GHz bands as a function of precipitable
water vapor, observing angle, and ground temperature. Combining these effects
enables us to set maximum and minimum limits on the expected uncertainties in
band gain and central frequency over the course of a full observing season. We
then introduce the uncertainties to parametric maximum-likelihood component
separation methods on simulated CMB maps to forecast foreground removal
performance and likelihoods on the tensor-to-scalar ratio r. We conclude that
to measure a $\sigma(r=0)$ ~ $10^{-3}$ with a bias on the recovered $r$ under
control, the limit on the uncertainty in the relative gain and central
frequency of the bandpass must be <2% and <1%, respectively. We also comment on
the possibility of self-calibrating bandpass uncertainties.
|
astro-ph.IM astro-ph.CO
|
timedependent and systematic variations in band gain and central frequencies of instruments used to study the cosmic microwave background are important factors in the datatomap analysis pipeline if not properly characterized they could limit the ability of nextgeneration experiments to remove astrophysical foreground contamination uncertainties include the instrument detector band which could systematically change across the focal plane as well as the calibration of the instrument used to measure the bands a potentially major effect is timedependent gain and band uncertainties caused by atmospheric fluctuations more specifically changes in atmospheric conditions lead to frequencydependent changes in the atmospheric transmission which in turn leads to variations in the effective gain and central frequency of the instruments bandpass using atmospheric modeling software and actpol bandpasses we simulate the expected variations in band gain and central frequency for 20 40 90 150 and 240 ghz bands as a function of precipitable water vapor observing angle and ground temperature combining these effects enables us to set maximum and minimum limits on the expected uncertainties in band gain and central frequency over the course of a full observing season we then introduce the uncertainties to parametric maximumlikelihood component separation methods on simulated cmb maps to forecast foreground removal performance and likelihoods on the tensortoscalar ratio r we conclude that to measure a sigmar0 103 with a bias on the recovered r under control the limit on the uncertainty in the relative gain and central frequency of the bandpass must be 2 and 1 respectively we also comment on the possibility of selfcalibrating bandpass uncertainties
|
[['timedependent', 'and', 'systematic', 'variations', 'in', 'band', 'gain', 'and', 'central', 'frequencies', 'of', 'instruments', 'used', 'to', 'study', 'the', 'cosmic', 'microwave', 'background', 'are', 'important', 'factors', 'in', 'the', 'datatomap', 'analysis', 'pipeline', 'if', 'not', 'properly', 'characterized', 'they', 'could', 'limit', 'the', 'ability', 'of', 'nextgeneration', 'experiments', 'to', 'remove', 'astrophysical', 'foreground', 'contamination', 'uncertainties', 'include', 'the', 'instrument', 'detector', 'band', 'which', 'could', 'systematically', 'change', 'across', 'the', 'focal', 'plane', 'as', 'well', 'as', 'the', 'calibration', 'of', 'the', 'instrument', 'used', 'to', 'measure', 'the', 'bands', 'a', 'potentially', 'major', 'effect', 'is', 'timedependent', 'gain', 'and', 'band', 'uncertainties', 'caused', 'by', 'atmospheric', 'fluctuations', 'more', 'specifically', 'changes', 'in', 'atmospheric', 'conditions', 'lead', 'to', 'frequencydependent', 'changes', 'in', 'the', 'atmospheric', 'transmission', 'which', 'in', 'turn', 'leads', 'to', 'variations', 'in', 'the', 'effective', 'gain', 'and', 'central', 'frequency', 'of', 'the', 'instruments', 'bandpass', 'using', 'atmospheric', 'modeling', 'software', 'and', 'actpol', 'bandpasses', 'we', 'simulate', 'the', 'expected', 'variations', 'in', 'band', 'gain', 'and', 'central', 'frequency', 'for', '20', '40', '90', '150', 'and', '240', 'ghz', 'bands', 'as', 'a', 'function', 'of', 'precipitable', 'water', 'vapor', 'observing', 'angle', 'and', 'ground', 'temperature', 'combining', 'these', 'effects', 'enables', 'us', 'to', 'set', 'maximum', 'and', 'minimum', 'limits', 'on', 'the', 'expected', 'uncertainties', 'in', 'band', 'gain', 'and', 'central', 'frequency', 'over', 'the', 'course', 'of', 'a', 'full', 'observing', 'season', 'we', 'then', 'introduce', 'the', 'uncertainties', 'to', 'parametric', 'maximumlikelihood', 'component', 'separation', 'methods', 'on', 'simulated', 'cmb', 'maps', 'to', 'forecast', 'foreground', 'removal', 'performance', 'and', 'likelihoods', 'on', 'the', 'tensortoscalar', 'ratio', 'r', 'we', 'conclude', 'that', 'to', 'measure', 'a', 'sigmar0', '103', 'with', 'a', 'bias', 'on', 'the', 'recovered', 'r', 'under', 'control', 'the', 'limit', 'on', 'the', 'uncertainty', 'in', 'the', 'relative', 'gain', 'and', 'central', 'frequency', 'of', 'the', 'bandpass', 'must', 'be', '2', 'and', '1', 'respectively', 'we', 'also', 'comment', 'on', 'the', 'possibility', 'of', 'selfcalibrating', 'bandpass', 'uncertainties']]
|
[-0.09051696167206065, 0.09990434068461684, -0.05116565860735419, 0.07623161683049313, -0.054847632144335, -0.07071081250733859, 0.09831267828801248, 0.40989579798758813, -0.2434833811139434, -0.37128090523255824, 0.12555936126333775, -0.277439209397933, -0.07377874306294385, 0.2175509606203579, -0.0787781015842979, 0.036216395230355025, 0.059384146876495465, -0.08064173579538524, -0.06306814591777203, -0.1871265903702332, 0.26430052149758204, 0.16332472167213372, 0.2679420062830012, 0.05578991941313154, 0.08198980789573623, -0.007458138326726535, -0.08437824582659317, 0.016588197344305278, -0.13060188968498862, 0.05776936693733299, 0.2748354775822044, 0.09372759280103016, 0.20807448645930463, -0.3589335049317737, -0.2275280430695542, 0.10505545892705598, 0.09926815903229197, 0.05430024739170034, 0.042805494090751926, -0.26367856439108805, 0.025599223313353056, -0.16341849592340393, -0.10308714866446121, -0.011139428330012796, 0.007702534682215246, -0.004010826358317981, -0.27554020807980506, 0.05816384247555814, 0.0009523529179382014, 0.07193541495991936, -0.051934153568597534, -0.15488477026253708, -0.0431073655787464, 0.13397990741245158, 0.0025960062349628266, 0.011866318211430532, 0.19703326875557725, -0.09012912219056882, -0.03355808077101027, 0.39201396644266745, -0.1369324467074242, -0.1339143710464587, 0.14871136456046702, -0.19488376575967856, -0.09816823080580696, 0.166164590635134, 0.21149681559999398, 0.020631091170926156, -0.15176232542175844, 0.024486090304150613, 0.09217232629178447, 0.23488424180242223, 0.09460169960135877, 0.06928377404468358, 0.2637325346946412, 0.12939771164230393, 0.09747063532718077, 0.1059766001677764, -0.23945282155952274, -0.0017370661206050607, -0.2644101679180151, -0.06435890759953845, -0.1118389846782421, 0.032663078864110934, -0.11215360378156868, -0.12342893389861756, 0.4257648280325277, 0.19831307273691498, 0.14765087693589032, 0.021518066652179858, 0.3186494662672832, 0.10933304652722294, 0.0678008993877395, 0.02359017640205484, 0.29707244349868267, 0.13521607239197955, 0.09185905986264392, -0.22343367490290522, 0.029190115550902566, -0.06724425829704199]
|
1,803.07631
|
Smooth deformations of singular contractions of class VII surfaces
|
We consider normal compact surfaces $Y$ obtained from a minimal class VII
surface $X$ by contraction of a cycle $C$ of $r$ rational curves with $C^2<0$.
Our main result states that, if the obtained cusp is smoothable, then $Y$ is
globally smoothable. The proof is based on a vanishing theorem for
$H^2(\Theta_Y)$.
If $r<b_2(X)$ any smooth small deformation of $Y$ is rational, and if
$r=b_2(X)$ (i.e. when $X$ is a half-Inoue surface) any smooth small deformation
of $Y$ is an Enriques surface.
The condition "the cusp is smoothable" in our main theorem can be checked in
terms of the intersection numbers of the cycle, using the Looijenga conjecture
(which has recently become a theorem). Therefore this is a "decidable"
condition. We prove that this condition is always satisfied if $r<b_2(X)\leq
11$. Therefore the singular surface $Y$ obtained by contracting a cycle $C$ of
$r$ rational curves in a minimal class VII surface $X$ with $r<b_2(X)\leq 11$
is always smoothable by rational surfaces. The statement holds even for unknown
class VII surfaces.
|
math.CV math.AG
|
we consider normal compact surfaces y obtained from a minimal class vii surface x by contraction of a cycle c of r rational curves with c20 our main result states that if the obtained cusp is smoothable then y is globally smoothable the proof is based on a vanishing theorem for h2theta_y if rb_2x any smooth small deformation of y is rational and if rb_2x ie when x is a halfinoue surface any smooth small deformation of y is an enriques surface the condition the cusp is smoothable in our main theorem can be checked in terms of the intersection numbers of the cycle using the looijenga conjecture which has recently become a theorem therefore this is a decidable condition we prove that this condition is always satisfied if rb_2xleq 11 therefore the singular surface y obtained by contracting a cycle c of r rational curves in a minimal class vii surface x with rb_2xleq 11 is always smoothable by rational surfaces the statement holds even for unknown class vii surfaces
|
[['we', 'consider', 'normal', 'compact', 'surfaces', 'y', 'obtained', 'from', 'a', 'minimal', 'class', 'vii', 'surface', 'x', 'by', 'contraction', 'of', 'a', 'cycle', 'c', 'of', 'r', 'rational', 'curves', 'with', 'c20', 'our', 'main', 'result', 'states', 'that', 'if', 'the', 'obtained', 'cusp', 'is', 'smoothable', 'then', 'y', 'is', 'globally', 'smoothable', 'the', 'proof', 'is', 'based', 'on', 'a', 'vanishing', 'theorem', 'for', 'h2theta_y', 'if', 'rb_2x', 'any', 'smooth', 'small', 'deformation', 'of', 'y', 'is', 'rational', 'and', 'if', 'rb_2x', 'ie', 'when', 'x', 'is', 'a', 'halfinoue', 'surface', 'any', 'smooth', 'small', 'deformation', 'of', 'y', 'is', 'an', 'enriques', 'surface', 'the', 'condition', 'the', 'cusp', 'is', 'smoothable', 'in', 'our', 'main', 'theorem', 'can', 'be', 'checked', 'in', 'terms', 'of', 'the', 'intersection', 'numbers', 'of', 'the', 'cycle', 'using', 'the', 'looijenga', 'conjecture', 'which', 'has', 'recently', 'become', 'a', 'theorem', 'therefore', 'this', 'is', 'a', 'decidable', 'condition', 'we', 'prove', 'that', 'this', 'condition', 'is', 'always', 'satisfied', 'if', 'rb_2xleq', '11', 'therefore', 'the', 'singular', 'surface', 'y', 'obtained', 'by', 'contracting', 'a', 'cycle', 'c', 'of', 'r', 'rational', 'curves', 'in', 'a', 'minimal', 'class', 'vii', 'surface', 'x', 'with', 'rb_2xleq', '11', 'is', 'always', 'smoothable', 'by', 'rational', 'surfaces', 'the', 'statement', 'holds', 'even', 'for', 'unknown', 'class', 'vii', 'surfaces']]
|
[-0.19290315477798384, 0.11786937510786988, -0.10952602313323455, 0.06403021612063502, -0.0370582209787134, -0.21687294467154777, 0.02556909124620936, 0.3206714112819596, -0.26896792903090966, -0.19134861790208202, 0.11244775092610243, -0.22992325445326667, -0.1612457027433045, 0.23146255331706594, -0.15675411858722907, -0.03790967691633286, 0.05581129477500464, 0.07099617791051666, -0.10070000306533819, -0.32426666744533134, 0.3918954682621089, -0.07963134467047922, 0.19659363487029843, 0.08983044030539918, 0.10979823702664086, 0.0055964807140161145, 0.048320979275035134, 0.04216797785325484, -0.14913135906443295, 0.11336169463554115, 0.2697883678586081, 0.08973519647860843, 0.21720100496754502, -0.3378057118731015, -0.20042647226205604, 0.1922427626637121, 0.0660702328197658, 0.01614083199211481, -0.014209343372336165, -0.19297996865529002, 0.17005560295515215, -0.08243504545340935, -0.2382861861422884, -0.01588354241102934, 0.11243501749228348, 0.011767030721812538, -0.2448659809814258, 0.008434220019615057, 0.15810098271026757, 0.11240349492114601, -0.03670964246107773, -0.07520317289357384, -0.15186859111329823, 0.0310203621610223, 0.018553993122115957, 0.12690993231918776, 0.08214338728364302, -0.06108053467716232, -0.019646209613843398, 0.3408131982185737, -0.09893480853149385, -0.2080039197861245, 0.12214488038426322, -0.17568597489770388, -0.14407134291179705, 0.19355165534793878, 0.03423983700234782, 0.194035925854449, -0.060967342757750446, 0.20657398765589194, -0.11418487015533063, 0.1268632403292665, 0.11235144538522669, -0.08588304779859203, 0.16716461014073117, 0.09128527688568062, 0.11668802018305569, 0.08286521103811648, -0.0607676061900389, 0.033038233155666875, -0.3898762309472218, -0.21195071979679844, -0.17244573547787062, 0.14408262079073625, -0.08345876132044588, -0.1955947054437164, 0.3204921245010513, -0.03095132772330985, 0.19127465220676226, 0.0975214245143544, 0.21260131126213255, 0.10228857449396993, 0.010594628418965095, 0.09255879665019386, 0.1698383378937389, 0.15888171519830147, -0.010080476599096349, -0.1119151767272728, 0.07202355520461093, 0.17528123498301615]
|
1,803.07632
|
Spin Temperature and Density of Cold and Warm HI in the Galactic Disk -
Hidden HI -
|
We present a method to determine the spin temperature $T_{\rm S}$ and volume
density $n$ of HI gas simultaneously along the tangent-point circle of galactic
rotation in the Milky Way by using the least-$\chi^2$ method. The best-fit
$T_{\rm S}$ is shown to range either in $T_{\rm S}=100-120$ K or in $1000-3000$
K, indicating that the gas is either in cold HI phase with high density and
large optical depth, or in warm HI with low density and small optical depth.
Averaged values at $3\le R \le 8$ kpc are obtained to be $T_{\rm S}=106.7 \pm
16.0$ K and $n=1.53\pm 0.86$ H cm$^{-3}$ for cold HI, and $1720 \pm 1060$ K and
$0.38 \pm 0.10$ H cm$^{-3}$ for warm HI, where $R=8\ |\sin \ l|$ kpc is the
galacto-centric distance along the tangent-point circle. The cold HI appears in
spiral arms and rings, whereas warm HI in the inter-arm regions. The cold HI is
denser by a factor of $\sim 4$ than warm HI. The present analysis has revealed
the hidden HI mass in cold and optically thick phase in the galactic disk. The
total HI mass inside the solar circle is shown to be greater by a factor of $2
- 2.5$ than the current estimation by optically thin assumption.
|
astro-ph.GA
|
we present a method to determine the spin temperature t_rm s and volume density n of hi gas simultaneously along the tangentpoint circle of galactic rotation in the milky way by using the leastchi2 method the bestfit t_rm s is shown to range either in t_rm s100120 k or in 10003000 k indicating that the gas is either in cold hi phase with high density and large optical depth or in warm hi with low density and small optical depth averaged values at 3le r le 8 kpc are obtained to be t_rm s1067 pm 160 k and n153pm 086 h cm3 for cold hi and 1720 pm 1060 k and 038 pm 010 h cm3 for warm hi where r8 sin l kpc is the galactocentric distance along the tangentpoint circle the cold hi appears in spiral arms and rings whereas warm hi in the interarm regions the cold hi is denser by a factor of sim 4 than warm hi the present analysis has revealed the hidden hi mass in cold and optically thick phase in the galactic disk the total hi mass inside the solar circle is shown to be greater by a factor of 2 25 than the current estimation by optically thin assumption
|
[['we', 'present', 'a', 'method', 'to', 'determine', 'the', 'spin', 'temperature', 't_rm', 's', 'and', 'volume', 'density', 'n', 'of', 'hi', 'gas', 'simultaneously', 'along', 'the', 'tangentpoint', 'circle', 'of', 'galactic', 'rotation', 'in', 'the', 'milky', 'way', 'by', 'using', 'the', 'leastchi2', 'method', 'the', 'bestfit', 't_rm', 's', 'is', 'shown', 'to', 'range', 'either', 'in', 't_rm', 's100120', 'k', 'or', 'in', '10003000', 'k', 'indicating', 'that', 'the', 'gas', 'is', 'either', 'in', 'cold', 'hi', 'phase', 'with', 'high', 'density', 'and', 'large', 'optical', 'depth', 'or', 'in', 'warm', 'hi', 'with', 'low', 'density', 'and', 'small', 'optical', 'depth', 'averaged', 'values', 'at', '3le', 'r', 'le', '8', 'kpc', 'are', 'obtained', 'to', 'be', 't_rm', 's1067', 'pm', '160', 'k', 'and', 'n153pm', '086', 'h', 'cm3', 'for', 'cold', 'hi', 'and', '1720', 'pm', '1060', 'k', 'and', '038', 'pm', '010', 'h', 'cm3', 'for', 'warm', 'hi', 'where', 'r8', 'sin', 'l', 'kpc', 'is', 'the', 'galactocentric', 'distance', 'along', 'the', 'tangentpoint', 'circle', 'the', 'cold', 'hi', 'appears', 'in', 'spiral', 'arms', 'and', 'rings', 'whereas', 'warm', 'hi', 'in', 'the', 'interarm', 'regions', 'the', 'cold', 'hi', 'is', 'denser', 'by', 'a', 'factor', 'of', 'sim', '4', 'than', 'warm', 'hi', 'the', 'present', 'analysis', 'has', 'revealed', 'the', 'hidden', 'hi', 'mass', 'in', 'cold', 'and', 'optically', 'thick', 'phase', 'in', 'the', 'galactic', 'disk', 'the', 'total', 'hi', 'mass', 'inside', 'the', 'solar', 'circle', 'is', 'shown', 'to', 'be', 'greater', 'by', 'a', 'factor', 'of', '2', '25', 'than', 'the', 'current', 'estimation', 'by', 'optically', 'thin', 'assumption']]
|
[-0.0914603441482319, 0.1673123470121404, 0.02629815671343084, -0.005418102142242033, -0.00019325233609756318, -0.07745675563012966, 0.03529182829462537, 0.4222953738599289, -0.1799945591381047, -0.34415608595420677, 0.046337527590349495, -0.31166967018620995, 0.05031959190623971, 0.14878895175870416, 0.03291233192402415, -0.024201039468412424, -0.07904798238695793, -0.06358443341223614, -0.0764461963176273, -0.22911227493115316, 0.21363218749089666, 0.053274155066280464, 0.12372665035640594, 0.012794645789374665, 0.061121162067723986, -0.1344801224404719, -0.030910247680163237, -0.03921913781725779, -0.21149637097533275, 0.024090372198602047, 0.25283551255536335, 0.06281269495716182, 0.19267710761235254, -0.3455634602822545, -0.1966154569839468, 0.08296965729422504, 0.20561534568735557, -0.007637581198544401, 0.00570948154824536, -0.2764155143468709, 0.07504056693486325, -0.16831358254248477, -0.20625755666050968, 0.0786310564646378, 0.1141401205348169, -0.01940811901784888, -0.24903445458408763, 0.20233828620303695, -0.012281569395577762, 0.1309099352759559, -0.04651451277910028, -0.16032581857644113, -0.07100355859800446, -0.0570904475114331, -0.024570536196072836, 0.15808188225335737, 0.26471699638201335, -0.08629323867967398, 0.10072124452137093, 0.40840264768907575, -0.16833826146591113, 0.020875655992592616, 0.1794069099989606, -0.2420139418188028, -0.11455211332067847, 0.21162300341558166, 0.09252210301460653, 0.06258325910922594, -0.08397621572381113, 0.07115047801550047, -0.10550494459968787, 0.25876885045138076, 0.09450413679431488, 0.02515905521492042, 0.3162473878755075, 0.06523519883602404, 0.10911791309140759, 0.04963585593377058, -0.25677062122196687, -0.012654022915606819, -0.20201470077537545, -0.1189856825328273, -0.1257561948877282, 0.0724750126717703, -0.18937094910694968, -0.05107630395483816, 0.2776916886793404, 0.09366131972566974, 0.31036063852470097, 0.025608782504299064, 0.3523223775666116, 0.07527166245641505, 0.09687283550638978, 0.1993543690592959, 0.23802159629853034, 0.21061974911405365, 0.04067930223359215, -0.2324816086681605, 0.026009092349331915, -0.017384957790193035]
|
1,803.07633
|
The Menger and projective Menger properties of function spaces with the
set-open topology
|
For a Tychonoff space $X$ and a family $\lambda$ of subsets of $X$, we denote
by $C_{\lambda}(X)$ the space of all real-valued continuous functions on $X$
with the set-open topology. In this paper, we study the Menger and projective
Menger properties of a Hausdorff space $C_{\lambda}(X)$. Our main results state
that if $\lambda$ is a $\pi$-network of $X$ then (1) $C_{\lambda}(X)$ is Menger
space if and only if it is $\sigma$-compact, if $Y$ is a dense subset of $X$
then (2) $C_{p}(Y\vert X)$ is projective Menger space if and only if it is
$\sigma$-pseudocompact.
|
math.GN
|
for a tychonoff space x and a family lambda of subsets of x we denote by c_lambdax the space of all realvalued continuous functions on x with the setopen topology in this paper we study the menger and projective menger properties of a hausdorff space c_lambdax our main results state that if lambda is a pinetwork of x then 1 c_lambdax is menger space if and only if it is sigmacompact if y is a dense subset of x then 2 c_pyvert x is projective menger space if and only if it is sigmapseudocompact
|
[['for', 'a', 'tychonoff', 'space', 'x', 'and', 'a', 'family', 'lambda', 'of', 'subsets', 'of', 'x', 'we', 'denote', 'by', 'c_lambdax', 'the', 'space', 'of', 'all', 'realvalued', 'continuous', 'functions', 'on', 'x', 'with', 'the', 'setopen', 'topology', 'in', 'this', 'paper', 'we', 'study', 'the', 'menger', 'and', 'projective', 'menger', 'properties', 'of', 'a', 'hausdorff', 'space', 'c_lambdax', 'our', 'main', 'results', 'state', 'that', 'if', 'lambda', 'is', 'a', 'pinetwork', 'of', 'x', 'then', '1', 'c_lambdax', 'is', 'menger', 'space', 'if', 'and', 'only', 'if', 'it', 'is', 'sigmacompact', 'if', 'y', 'is', 'a', 'dense', 'subset', 'of', 'x', 'then', '2', 'c_pyvert', 'x', 'is', 'projective', 'menger', 'space', 'if', 'and', 'only', 'if', 'it', 'is', 'sigmapseudocompact']]
|
[-0.13586149137508083, 0.1461156657896936, -0.08320570173724504, 0.03135232571231017, -0.06533289771875019, -0.09844296484428285, 0.05908175364551185, 0.42609494547922533, -0.3333672733752282, -0.1094246459203762, 0.12480826124646138, -0.3199821468954394, -0.12737766043334217, 0.17604785908402487, -0.11762987485585305, -0.049581681234905355, 0.027115798294339535, 0.10763180392006269, -0.092764908593061, -0.32923414975732235, 0.44787054369737817, -0.12264835068976486, 0.17214808827470784, 0.033475019017254914, 0.19385374119955595, 0.007213417988188647, 0.06603530609652727, 0.06834553727198259, -0.17906331085987903, 0.09676509409001773, 0.21646200436177654, 0.16676657768426933, 0.2659560819002953, -0.2529565922834061, -0.21752307248419497, 0.268914971464815, 0.07723659767185921, -0.14502093838630142, 0.041018188576684794, -0.3014630707298088, 0.18312032182015234, -0.08921062996467718, -0.08119801298336504, -0.08177307348923532, 0.1632650023336512, 0.016790506099913637, -0.26927496971828596, -0.06344660702110319, 0.08778075435055563, 0.0005935867992485618, -0.05392688245174813, -0.052113104018044996, -0.1482765748201368, 0.05523177723983651, -0.042248099320824004, 0.19362005759491124, 0.03013391625954882, -0.026142548173563658, -0.03830805095424364, 0.3794259413850371, -0.05888959977284565, -0.26853986845894173, 0.11721655015403834, -0.27538279214218914, -0.16561372873915747, 0.13609789863003643, 0.0676230571161096, 0.1851069033555277, -0.024714552817845736, 0.2922231246548408, -0.16396266699175013, 0.20294909574255182, 0.02455210263052812, 0.047409331802135475, 0.08298173800602064, 0.19131257892637463, 0.1429804684082558, 0.09648035887557153, -0.03844607300841464, 0.051873063893763574, -0.3861677984369325, -0.2225123435606832, -0.2262678447775645, 0.16126966312691404, -0.08445809876922375, -0.14152877661143684, 0.2991103076498833, 0.03521811921190429, 0.20994703129834527, 0.07295966976332469, 0.23696770729845043, 0.013765105984050903, -0.062457643630965565, 0.1165636203937478, 0.08521879780116481, 0.1218622532995561, -0.04839469500111191, -0.058803905407990235, 0.049049245221745016, 0.16640084391398416]
|
1,803.07634
|
Domain Adaptation with Randomized Expectation Maximization
|
Domain adaptation (DA) is the task of classifying an unlabeled dataset
(target) using a labeled dataset (source) from a related domain. The majority
of successful DA methods try to directly match the distributions of the source
and target data by transforming the feature space. Despite their success, state
of the art methods based on this approach are either involved or unable to
directly scale to data with many features. This article shows that domain
adaptation can be successfully performed by using a very simple randomized
expectation maximization (EM) method. We consider two instances of the method,
which involve logistic regression and support vector machine, respectively. The
underlying assumption of the proposed method is the existence of a good single
linear classifier for both source and target domain. The potential limitations
of this assumption are alleviated by the flexibility of the method, which can
directly incorporate deep features extracted from a pre-trained deep neural
network. The resulting algorithm is strikingly easy to implement and apply. We
test its performance on 36 real-life adaptation tasks over text and image data
with diverse characteristics. The method achieves state-of-the-art results,
competitive with those of involved end-to-end deep transfer-learning methods.
|
stat.ML cs.LG
|
domain adaptation da is the task of classifying an unlabeled dataset target using a labeled dataset source from a related domain the majority of successful da methods try to directly match the distributions of the source and target data by transforming the feature space despite their success state of the art methods based on this approach are either involved or unable to directly scale to data with many features this article shows that domain adaptation can be successfully performed by using a very simple randomized expectation maximization em method we consider two instances of the method which involve logistic regression and support vector machine respectively the underlying assumption of the proposed method is the existence of a good single linear classifier for both source and target domain the potential limitations of this assumption are alleviated by the flexibility of the method which can directly incorporate deep features extracted from a pretrained deep neural network the resulting algorithm is strikingly easy to implement and apply we test its performance on 36 reallife adaptation tasks over text and image data with diverse characteristics the method achieves stateoftheart results competitive with those of involved endtoend deep transferlearning methods
|
[['domain', 'adaptation', 'da', 'is', 'the', 'task', 'of', 'classifying', 'an', 'unlabeled', 'dataset', 'target', 'using', 'a', 'labeled', 'dataset', 'source', 'from', 'a', 'related', 'domain', 'the', 'majority', 'of', 'successful', 'da', 'methods', 'try', 'to', 'directly', 'match', 'the', 'distributions', 'of', 'the', 'source', 'and', 'target', 'data', 'by', 'transforming', 'the', 'feature', 'space', 'despite', 'their', 'success', 'state', 'of', 'the', 'art', 'methods', 'based', 'on', 'this', 'approach', 'are', 'either', 'involved', 'or', 'unable', 'to', 'directly', 'scale', 'to', 'data', 'with', 'many', 'features', 'this', 'article', 'shows', 'that', 'domain', 'adaptation', 'can', 'be', 'successfully', 'performed', 'by', 'using', 'a', 'very', 'simple', 'randomized', 'expectation', 'maximization', 'em', 'method', 'we', 'consider', 'two', 'instances', 'of', 'the', 'method', 'which', 'involve', 'logistic', 'regression', 'and', 'support', 'vector', 'machine', 'respectively', 'the', 'underlying', 'assumption', 'of', 'the', 'proposed', 'method', 'is', 'the', 'existence', 'of', 'a', 'good', 'single', 'linear', 'classifier', 'for', 'both', 'source', 'and', 'target', 'domain', 'the', 'potential', 'limitations', 'of', 'this', 'assumption', 'are', 'alleviated', 'by', 'the', 'flexibility', 'of', 'the', 'method', 'which', 'can', 'directly', 'incorporate', 'deep', 'features', 'extracted', 'from', 'a', 'pretrained', 'deep', 'neural', 'network', 'the', 'resulting', 'algorithm', 'is', 'strikingly', 'easy', 'to', 'implement', 'and', 'apply', 'we', 'test', 'its', 'performance', 'on', '36', 'reallife', 'adaptation', 'tasks', 'over', 'text', 'and', 'image', 'data', 'with', 'diverse', 'characteristics', 'the', 'method', 'achieves', 'stateoftheart', 'results', 'competitive', 'with', 'those', 'of', 'involved', 'endtoend', 'deep', 'transferlearning', 'methods']]
|
[-0.015837734128133607, -0.03098659798949181, -0.08992249186886535, 0.05860758958957516, -0.13918806946812531, -0.16038896333163558, 0.05741096490767235, 0.4525082044972059, -0.28892318076776485, -0.3448043521995155, 0.10307134218418446, -0.24366682786972094, -0.1527341221160709, 0.21970206439362253, -0.09172102885368542, 0.09135471428416143, 0.1453457596890915, 0.049987474024200285, -0.047475686945164436, -0.2957742378032074, 0.3415389987628143, 0.02225993300552289, 0.37981213975626116, -0.0018242281133261247, 0.14588568040038435, -0.02968532023951411, -0.04576701305042475, -0.009922745566701708, -0.03883935935599043, 0.1868487244615188, 0.28155100611157907, 0.22232428529323675, 0.2913635093671007, -0.3838012772922715, -0.22476645090067998, 0.09917927325631563, 0.12139364101518041, 0.11598820977796538, -0.022077652029931928, -0.3274358047506748, 0.0931583252741406, -0.14025983950123191, -0.024766529217744485, -0.14124955881673557, -0.0613389472112967, 0.02146290913522721, -0.29498536901500744, 0.05419089254469443, 0.07266658649254494, 0.03776230302710946, -0.06476577330344858, -0.1376062485784925, 0.033559174890606065, 0.1408106976081259, 0.04250375940404737, 0.08509742433432108, 0.12627760741907434, -0.17717028100115176, -0.1409540409867007, 0.35437401977296057, -0.09222547244280577, -0.22914930503443778, 0.21944641281898397, -0.026018832405455983, -0.122190357474849, 0.13336224430658591, 0.2135212156539544, 0.1377454339311673, -0.1797388321146942, 0.039939681988340824, -0.03899388056582748, 0.17908932817084955, 0.01723663557607394, -0.034382147213014275, 0.1540664277982731, 0.2351647233697944, -0.002362937659610254, 0.13666877444678296, -0.15158918655286424, -0.06568866895081905, -0.22633378552034114, -0.06599338703329126, -0.23859888972022023, -0.035471654060678794, -0.08989739735119749, -0.13138749201973088, 0.3890295715638786, 0.20395420212418033, 0.227772712509315, 0.09194896449096118, 0.33066929067747713, 0.02816983072944612, 0.10373809238752493, 0.0818758073880767, 0.1693486984890814, 0.026047309688650645, 0.1172250973392063, -0.19592332404990417, 0.09113886668705024, 0.029818609093005457]
|
1,803.07635
|
Learning Robotic Assembly from CAD
|
In this work, motivated by recent manufacturing trends, we investigate
autonomous robotic assembly. Industrial assembly tasks require contact-rich
manipulation skills, which are challenging to acquire using classical control
and motion planning approaches. Consequently, robot controllers for assembly
domains are presently engineered to solve a particular task, and cannot easily
handle variations in the product or environment. Reinforcement learning (RL) is
a promising approach for autonomously acquiring robot skills that involve
contact-rich dynamics. However, RL relies on random exploration for learning a
control policy, which requires many robot executions, and often gets trapped in
locally suboptimal solutions. Instead, we posit that prior knowledge, when
available, can improve RL performance. We exploit the fact that in modern
assembly domains, geometric information about the task is readily available via
the CAD design files. We propose to leverage this prior knowledge by guiding RL
along a geometric motion plan, calculated using the CAD data. We show that our
approach effectively improves over traditional control approaches for tracking
the motion plan, and can solve assembly tasks that require high precision, even
without accurate state estimation. In addition, we propose a neural network
architecture that can learn to track the motion plan, and generalize the
assembly controller to changes in the object positions.
|
cs.RO cs.LG
|
in this work motivated by recent manufacturing trends we investigate autonomous robotic assembly industrial assembly tasks require contactrich manipulation skills which are challenging to acquire using classical control and motion planning approaches consequently robot controllers for assembly domains are presently engineered to solve a particular task and cannot easily handle variations in the product or environment reinforcement learning rl is a promising approach for autonomously acquiring robot skills that involve contactrich dynamics however rl relies on random exploration for learning a control policy which requires many robot executions and often gets trapped in locally suboptimal solutions instead we posit that prior knowledge when available can improve rl performance we exploit the fact that in modern assembly domains geometric information about the task is readily available via the cad design files we propose to leverage this prior knowledge by guiding rl along a geometric motion plan calculated using the cad data we show that our approach effectively improves over traditional control approaches for tracking the motion plan and can solve assembly tasks that require high precision even without accurate state estimation in addition we propose a neural network architecture that can learn to track the motion plan and generalize the assembly controller to changes in the object positions
|
[['in', 'this', 'work', 'motivated', 'by', 'recent', 'manufacturing', 'trends', 'we', 'investigate', 'autonomous', 'robotic', 'assembly', 'industrial', 'assembly', 'tasks', 'require', 'contactrich', 'manipulation', 'skills', 'which', 'are', 'challenging', 'to', 'acquire', 'using', 'classical', 'control', 'and', 'motion', 'planning', 'approaches', 'consequently', 'robot', 'controllers', 'for', 'assembly', 'domains', 'are', 'presently', 'engineered', 'to', 'solve', 'a', 'particular', 'task', 'and', 'can', 'not', 'easily', 'handle', 'variations', 'in', 'the', 'product', 'or', 'environment', 'reinforcement', 'learning', 'rl', 'is', 'a', 'promising', 'approach', 'for', 'autonomously', 'acquiring', 'robot', 'skills', 'that', 'involve', 'contactrich', 'dynamics', 'however', 'rl', 'relies', 'on', 'random', 'exploration', 'for', 'learning', 'a', 'control', 'policy', 'which', 'requires', 'many', 'robot', 'executions', 'and', 'often', 'gets', 'trapped', 'in', 'locally', 'suboptimal', 'solutions', 'instead', 'we', 'posit', 'that', 'prior', 'knowledge', 'when', 'available', 'can', 'improve', 'rl', 'performance', 'we', 'exploit', 'the', 'fact', 'that', 'in', 'modern', 'assembly', 'domains', 'geometric', 'information', 'about', 'the', 'task', 'is', 'readily', 'available', 'via', 'the', 'cad', 'design', 'files', 'we', 'propose', 'to', 'leverage', 'this', 'prior', 'knowledge', 'by', 'guiding', 'rl', 'along', 'a', 'geometric', 'motion', 'plan', 'calculated', 'using', 'the', 'cad', 'data', 'we', 'show', 'that', 'our', 'approach', 'effectively', 'improves', 'over', 'traditional', 'control', 'approaches', 'for', 'tracking', 'the', 'motion', 'plan', 'and', 'can', 'solve', 'assembly', 'tasks', 'that', 'require', 'high', 'precision', 'even', 'without', 'accurate', 'state', 'estimation', 'in', 'addition', 'we', 'propose', 'a', 'neural', 'network', 'architecture', 'that', 'can', 'learn', 'to', 'track', 'the', 'motion', 'plan', 'and', 'generalize', 'the', 'assembly', 'controller', 'to', 'changes', 'in', 'the', 'object', 'positions']]
|
[-0.053762450412390396, 0.045853193576196924, -0.08100783859397499, 0.02749747319663024, -0.18866907060146332, -0.17806034926280306, 0.01776435751526151, 0.4955182494416546, -0.27812487444204564, -0.4003920069215103, 0.12421915116395282, -0.17863018646200474, -0.19046103329814146, 0.21278492031874172, -0.19739292652285748, 0.09064747294849859, 0.1604928106938202, 0.0006895694801082405, -0.03765580659091938, -0.2292066435385585, 0.2658580336742139, -0.004154809871509384, 0.29793818545966555, -0.033978782293091245, 0.16171592669909912, 0.053125260780619174, 0.005003918105593095, -0.010457860539855365, -0.07854288939912434, 0.17523438582405176, 0.3691332163714553, 0.20263692803340605, 0.3231774352920743, -0.4444355770157507, -0.2168785404098274, 0.0950548390907128, 0.18089196909344396, 0.11875324319071996, -0.044492350260462936, -0.3158385020886691, 0.06036907358819777, -0.15552168165987285, -0.04600455563810941, -0.1663866691154768, -0.038434670763448454, -0.01372594280390051, -0.2813057199740657, -0.022956545977369666, 0.051558187870586365, 0.03604863209329778, -0.07874329276203823, -0.060732087487569794, 0.04645175385947088, 0.21146518445213866, -0.021371207157454383, 0.044973908873754014, 0.24518260248721793, -0.1829193328292324, -0.18368748459033668, 0.3613009392642058, 0.0241830232861013, -0.24805843806559727, 0.22126537209931904, -0.05811723469658038, -0.1495839311929348, 0.1075214132702408, 0.23114568261035645, 0.12442698765796824, -0.188437893759818, 0.05081503724543906, 0.021082463445894133, 0.20258456003368616, 0.025213600417303566, -0.05373793638591451, 0.20145368775187167, 0.23331337201167257, 0.12208618196997961, 0.1004557846530448, -0.035842854605736926, -0.1265976548557564, -0.18175224386840666, -0.1138830071794683, -0.1539830721449107, -0.005760625628192009, -0.04629037351773709, -0.10462663384120018, 0.3264571368076409, 0.2512690828261839, 0.16857444707420655, 0.10122597057152934, 0.38522297727020205, 0.013416574742362943, 0.10802051395708426, 0.10631558976680165, 0.20502687543138073, -0.023404395915209673, 0.18061480984705178, -0.23042035640593475, 0.13040545076308682, 0.011383692900730798]
|
1,803.07636
|
A micro-SQUID with dispersive readout for magnetic scanning microscopy
|
We have designed and characterized a micro-SQUID with dispersive readout for
use in low temperature scanning probe microscopy systems. The design features a
capacitively shunted RF SQUID with a tunable resonance frequency from 5 to 12
GHz, micrometer spatial resolution and integrated superconducting coils for
local application of magnetic fields. The SQUID is operated as a nonlinear
oscillator with a flux- and power-dependent resonance frequency. Measurements
for device characterization and noise benchmarking were carried out at 4 K. The
measured flux noise above 10 kHz at 4 K is $80\;\mathrm{n}\Phi_0
\mathrm{Hz}^{-1/2}$ at a bandwidth of 200 MHz. Estimations suggest that one can
benefit from parametric gain based on inherent nonlinearity of the Josephson
junction and reduce the flux noise to $30\;\mathrm{n}\Phi_0\mathrm{Hz}^{-1/2}$
at 100 mK, which corresponds to $7.5\;\mathrm{\mu_B Hz^{-1/2}}$ for a magnetic
moment located at the center of the pickup loop.
|
cond-mat.supr-con cond-mat.mes-hall
|
we have designed and characterized a microsquid with dispersive readout for use in low temperature scanning probe microscopy systems the design features a capacitively shunted rf squid with a tunable resonance frequency from 5 to 12 ghz micrometer spatial resolution and integrated superconducting coils for local application of magnetic fields the squid is operated as a nonlinear oscillator with a flux and powerdependent resonance frequency measurements for device characterization and noise benchmarking were carried out at 4 k the measured flux noise above 10 khz at 4 k is 80mathrmnphi_0 mathrmhz12 at a bandwidth of 200 mhz estimations suggest that one can benefit from parametric gain based on inherent nonlinearity of the josephson junction and reduce the flux noise to 30mathrmnphi_0mathrmhz12 at 100 mk which corresponds to 75mathrmmu_b hz12 for a magnetic moment located at the center of the pickup loop
|
[['we', 'have', 'designed', 'and', 'characterized', 'a', 'microsquid', 'with', 'dispersive', 'readout', 'for', 'use', 'in', 'low', 'temperature', 'scanning', 'probe', 'microscopy', 'systems', 'the', 'design', 'features', 'a', 'capacitively', 'shunted', 'rf', 'squid', 'with', 'a', 'tunable', 'resonance', 'frequency', 'from', '5', 'to', '12', 'ghz', 'micrometer', 'spatial', 'resolution', 'and', 'integrated', 'superconducting', 'coils', 'for', 'local', 'application', 'of', 'magnetic', 'fields', 'the', 'squid', 'is', 'operated', 'as', 'a', 'nonlinear', 'oscillator', 'with', 'a', 'flux', 'and', 'powerdependent', 'resonance', 'frequency', 'measurements', 'for', 'device', 'characterization', 'and', 'noise', 'benchmarking', 'were', 'carried', 'out', 'at', '4', 'k', 'the', 'measured', 'flux', 'noise', 'above', '10', 'khz', 'at', '4', 'k', 'is', '80mathrmnphi_0', 'mathrmhz12', 'at', 'a', 'bandwidth', 'of', '200', 'mhz', 'estimations', 'suggest', 'that', 'one', 'can', 'benefit', 'from', 'parametric', 'gain', 'based', 'on', 'inherent', 'nonlinearity', 'of', 'the', 'josephson', 'junction', 'and', 'reduce', 'the', 'flux', 'noise', 'to', '30mathrmnphi_0mathrmhz12', 'at', '100', 'mk', 'which', 'corresponds', 'to', '75mathrmmu_b', 'hz12', 'for', 'a', 'magnetic', 'moment', 'located', 'at', 'the', 'center', 'of', 'the', 'pickup', 'loop']]
|
[-0.1512306058438549, 0.15048600748127353, 0.030709010289064136, -0.02652878180294689, -0.01687618294195947, -0.2195171635172775, 0.07636667655753916, 0.40766879446480586, -0.18600005954773963, -0.3641164631083392, 0.07134389507405432, -0.2957651478818793, -0.026174323575949107, 0.2800080280892713, 0.017602167072017557, 0.029919717768359038, -0.005283961698085583, 0.007156178669032195, -0.053302459154730204, -0.11917839620086917, 0.2208111176395492, 0.10397417828494655, 0.3226201276048559, 0.02705874818417689, 0.15885127429931384, -0.07056656289521766, 0.06145128273013709, -0.0038269256896244874, -0.10862136589882236, 0.028057554445695132, 0.27157401912373264, -0.0426195235104651, 0.21755158671758312, -0.4153499390754471, -0.1931170773408983, 0.02608988887589911, 0.1110728204999443, 0.05984091947607669, 0.009843322982424465, -0.2787692616018804, 0.106304357343765, -0.1100620166061149, -0.11791785446373557, -0.02913176827807573, -0.028872265153146094, 0.03640055651034134, -0.3028765824400698, 0.07111404062100295, 0.013259129761549495, 0.1382031602366571, -0.01638160301271178, -0.10652617464285763, 0.030676302317853853, 0.037371854488467936, -0.10037761634094236, 0.059478739802084485, 0.24908814432801327, -0.07339035158646226, -0.10384457581001671, 0.24533316245651804, -0.09142230429511139, -0.07934454121572924, 0.13915562079342056, -0.19897850072416273, -0.048427955257584865, 0.22540768088799887, 0.1285248591557847, 0.019971045638448086, -0.171937460881199, 0.02137971124118295, 0.094894357570582, 0.26037246692061855, 0.17518330308877816, 0.07348506969561719, 0.238785388766437, 0.21251883510199876, 0.09034298868093596, 0.1668300163696783, -0.2416236680195046, 0.04623527181051348, -0.26938174107192975, -0.08193610573484414, -0.17617733684786852, 0.10404920144566754, -0.04230344985167587, -0.10530230230179385, 0.39473668714661314, 0.15813802834937646, 0.16697855147978533, -0.02562408849168434, 0.3391504075000252, 0.1359345174877081, 0.11929532128683143, 0.027424200079015765, 0.2515638448446449, 0.2210378728206337, 0.17536772526058275, -0.27538705427381815, -0.0728196329774632, -0.07864504832431904]
|
1,803.07637
|
The Applegate mechanism in Post-Common-Envelope Binaries: Investigating
the role of rotation
|
Eclipsing time variations (ETVs) are observed in many close binary systems.
In particular, for several post-common-envelope binaries (PCEBs) that consist
of a white dwarf and a main sequence star, the O-C diagram suggests that real
or apparent orbital period variations are driven by Jupiter-mass planets or as
a result of magnetic activity, the so-called Applegate mechanism. The latter
explains orbital period variations as a result of changes in the stellar
quadrupole moment due to magnetic activity. We explore the feasibility of
driving ETVs via the Applegate mechanism for a sample of PCEB systems,
including a range of different rotations. Using the MESA code we evolve 12
stars with different masses and rotation rates. We apply a simple dynamo model
to their radial profiles to investigate on which scale the predicted activity
cycle matches the observed modulation period, and quantify the uncertainty, and
further calculate the required energies to drive que Applegate mechanism. We
show that the Applegate mechanism is energetically feasible in 5 PCEB systems,
and note that these are the systems with the highest rotation rate compared to
the critical rotation rate of the main-sequence star. The results suggest that
the ratio of physical to critical rotation in the main sequence star is an
important indicator for the feasibility of Applegate's mechanism, but exploring
larger samples will be necessary to probe this hypothesis.
|
astro-ph.SR
|
eclipsing time variations etvs are observed in many close binary systems in particular for several postcommonenvelope binaries pcebs that consist of a white dwarf and a main sequence star the oc diagram suggests that real or apparent orbital period variations are driven by jupitermass planets or as a result of magnetic activity the socalled applegate mechanism the latter explains orbital period variations as a result of changes in the stellar quadrupole moment due to magnetic activity we explore the feasibility of driving etvs via the applegate mechanism for a sample of pceb systems including a range of different rotations using the mesa code we evolve 12 stars with different masses and rotation rates we apply a simple dynamo model to their radial profiles to investigate on which scale the predicted activity cycle matches the observed modulation period and quantify the uncertainty and further calculate the required energies to drive que applegate mechanism we show that the applegate mechanism is energetically feasible in 5 pceb systems and note that these are the systems with the highest rotation rate compared to the critical rotation rate of the mainsequence star the results suggest that the ratio of physical to critical rotation in the main sequence star is an important indicator for the feasibility of applegates mechanism but exploring larger samples will be necessary to probe this hypothesis
|
[['eclipsing', 'time', 'variations', 'etvs', 'are', 'observed', 'in', 'many', 'close', 'binary', 'systems', 'in', 'particular', 'for', 'several', 'postcommonenvelope', 'binaries', 'pcebs', 'that', 'consist', 'of', 'a', 'white', 'dwarf', 'and', 'a', 'main', 'sequence', 'star', 'the', 'oc', 'diagram', 'suggests', 'that', 'real', 'or', 'apparent', 'orbital', 'period', 'variations', 'are', 'driven', 'by', 'jupitermass', 'planets', 'or', 'as', 'a', 'result', 'of', 'magnetic', 'activity', 'the', 'socalled', 'applegate', 'mechanism', 'the', 'latter', 'explains', 'orbital', 'period', 'variations', 'as', 'a', 'result', 'of', 'changes', 'in', 'the', 'stellar', 'quadrupole', 'moment', 'due', 'to', 'magnetic', 'activity', 'we', 'explore', 'the', 'feasibility', 'of', 'driving', 'etvs', 'via', 'the', 'applegate', 'mechanism', 'for', 'a', 'sample', 'of', 'pceb', 'systems', 'including', 'a', 'range', 'of', 'different', 'rotations', 'using', 'the', 'mesa', 'code', 'we', 'evolve', '12', 'stars', 'with', 'different', 'masses', 'and', 'rotation', 'rates', 'we', 'apply', 'a', 'simple', 'dynamo', 'model', 'to', 'their', 'radial', 'profiles', 'to', 'investigate', 'on', 'which', 'scale', 'the', 'predicted', 'activity', 'cycle', 'matches', 'the', 'observed', 'modulation', 'period', 'and', 'quantify', 'the', 'uncertainty', 'and', 'further', 'calculate', 'the', 'required', 'energies', 'to', 'drive', 'que', 'applegate', 'mechanism', 'we', 'show', 'that', 'the', 'applegate', 'mechanism', 'is', 'energetically', 'feasible', 'in', '5', 'pceb', 'systems', 'and', 'note', 'that', 'these', 'are', 'the', 'systems', 'with', 'the', 'highest', 'rotation', 'rate', 'compared', 'to', 'the', 'critical', 'rotation', 'rate', 'of', 'the', 'mainsequence', 'star', 'the', 'results', 'suggest', 'that', 'the', 'ratio', 'of', 'physical', 'to', 'critical', 'rotation', 'in', 'the', 'main', 'sequence', 'star', 'is', 'an', 'important', 'indicator', 'for', 'the', 'feasibility', 'of', 'applegates', 'mechanism', 'but', 'exploring', 'larger', 'samples', 'will', 'be', 'necessary', 'to', 'probe', 'this', 'hypothesis']]
|
[-0.16946378870696727, 0.15677941266825915, -0.052943232627252916, 0.13445503312634952, -0.06130919068319989, -0.0733862949034249, 0.0835229968529997, 0.372255553325106, -0.22885628913770364, -0.3522687114413462, 0.0912806672827823, -0.21815276216200022, -0.12764088438000595, 0.24240682583955017, -0.08341762696467672, 7.379582738004891e-05, 0.08925441135631575, -0.01361164725286861, -0.034126700096489264, -0.24516398129604308, 0.3117651061740097, 0.05946466794453694, 0.17159395671998418, -0.026310039523585665, 0.039328530969214626, -0.0647720812849002, 0.0011518211167640402, -0.06264849160548433, -0.14073244130723392, 0.04141995425512895, 0.18552889779467868, 0.11054581770128737, 0.19668183718126134, -0.3585759842908049, -0.2002829952664667, 0.08360061713028699, 0.15772696743078995, 0.09734213580200698, -0.07052308170126967, -0.20236949021792888, 0.10367683406392254, -0.19760021655890472, -0.1559415818347978, -0.03254031808527153, 0.08842239275898985, 0.05974012239104403, -0.2846015453479985, 0.10065380579752466, 0.09414876093589035, 0.09673833114460909, -0.15482890444919967, -0.09431053263584285, -0.06726330812359395, 0.11172161698024345, 0.07864539939535982, 0.0762109230230895, 0.1350562620313472, -0.0667993101752862, -0.0958456392691005, 0.3891467632516391, -0.07973302760780955, -0.06588863716388005, 0.22241231819914123, -0.20279949397289393, -0.1441317021609783, 0.1238032020015193, 0.1861519980988565, 0.13311740050266962, -0.1505423805380945, -0.04798225799588961, 0.024011820649320725, 0.21261875737608144, 0.04593820583665677, 0.03799595174548033, 0.3189355187766653, 0.1617603473995197, 0.018007278784092966, 0.08954458952575806, -0.17412685149403323, -0.08846674677209064, -0.2040848411395148, -0.10074513311181883, -0.11901687682334991, 0.037251485242450144, -0.08151300042475539, -0.12145705305634433, 0.3763830020429201, 0.14453281534640286, 0.21733602501002938, 0.018081911674796305, 0.2667976959949426, 0.11239087799653394, 0.09271143242007643, 0.06186089372827804, 0.2970574506460772, 0.16538201845521275, 0.09268544998589537, -0.30570560028614374, 0.12171868350040833, 0.00743706542432067]
|
1,803.07638
|
Photoproduction of light vector mesons in Xe-Xe ultraperipheral
collisions at the LHC and the nuclear density of Xe-129
|
We make predictions for cross sections of $\rho$ and $\phi$ vector meson
photoproduction in ultraperipheral Xe-Xe collisions at $\sqrt{s_{NN}}=5.44$
TeV. Analyzing the momentum transfer distribution of $\rho$ mesons in this
process, we explore the feasibility of extracting the nuclear density of
$^{129}$Xe, which is needed in searches for dark matter with Xenon-based
detectors.
|
hep-ph nucl-th
|
we make predictions for cross sections of rho and phi vector meson photoproduction in ultraperipheral xexe collisions at sqrts_nn544 tev analyzing the momentum transfer distribution of rho mesons in this process we explore the feasibility of extracting the nuclear density of 129xe which is needed in searches for dark matter with xenonbased detectors
|
[['we', 'make', 'predictions', 'for', 'cross', 'sections', 'of', 'rho', 'and', 'phi', 'vector', 'meson', 'photoproduction', 'in', 'ultraperipheral', 'xexe', 'collisions', 'at', 'sqrts_nn544', 'tev', 'analyzing', 'the', 'momentum', 'transfer', 'distribution', 'of', 'rho', 'mesons', 'in', 'this', 'process', 'we', 'explore', 'the', 'feasibility', 'of', 'extracting', 'the', 'nuclear', 'density', 'of', '129xe', 'which', 'is', 'needed', 'in', 'searches', 'for', 'dark', 'matter', 'with', 'xenonbased', 'detectors']]
|
[-0.09252852162803119, 0.25013116703210575, -0.15846116237236924, 0.15023231633433237, 0.011996259455973247, -0.0908838810996627, -0.04743780428543687, 0.349149068922929, -0.1692379720614485, -0.2533290988220921, -0.11511474106030292, -0.3899708594775425, 0.1048732515565067, 0.09603240832967579, 0.16007482601364828, 0.14282618297861432, 0.09687685202104303, 0.04163768428887399, -0.032395217637970763, -0.16453154125901046, 0.3342535422306578, 0.09556458848264981, 0.16736682782055073, 0.18789025401380263, 0.04876121184085759, 0.11302964850592445, -0.04869502133531672, -0.12355169059954724, -0.1623842773853608, 0.11601732156013209, 0.33506738422614224, 0.11417120609010728, 0.10124648907573296, -0.3830893903197545, -0.10325346280873385, 0.21713056626184932, 0.12960585828800247, 0.07529250306367241, -0.09985614541636885, -0.31831696010985466, 0.13177466265997798, -0.24239448904288266, -0.11485289585477901, -0.12044305957080621, 0.051375200809418875, -0.0012089266037603593, -0.3109864002128817, 0.0938151165720005, -0.09085791408664214, 0.03281299748791838, -0.07595049415029725, -0.24427362464649496, 0.012073321101027277, -0.04673082852419817, 0.08161100642788575, 0.08643580677058056, 0.2443288392738773, -0.268294939896496, -0.11085371936689008, 0.37050562654182595, -0.05236104396084007, -0.16985964574763235, 0.11217104387030287, -0.23970619808741897, -0.1593808781856425, 0.1414567121779019, 0.2936719798676248, 0.10226618867578371, -0.18485448042255878, 0.09150617395611128, -0.007443140342146299, 0.18341197229192574, 0.1021207107652752, 0.05838822708948392, 0.19540104612637804, 0.2630161512115935, -0.038306757955996425, 0.03551783071576073, -0.1673256847655998, -0.0487675388730219, -0.43431121620507734, -0.14499277637322555, -0.08634429403914595, 0.04976755844095265, -0.011711178290084409, 0.024347203766118805, 0.3080452160101454, 0.07538256032462672, 0.31374906832879446, -0.019762566908403247, 0.35043980993049323, 0.0629145711625241, 0.021556931231522334, 0.1086604187335327, 0.3158714140080056, 0.22664797607862022, 0.1909166637737796, -0.24180042340402613, 0.01153951787547964, -0.008434096909180845]
|
1,803.07639
|
Adaptive Greedy Algorithms for Stochastic Set Cover Problems
|
We study adaptive greedy algorithms for the problems of stochastic set cover
with perfect and imperfect coverages. In stochastic set cover with perfect
coverage, we are given a set of items and a ground set B. Evaluating an item
reveals its state which is a random subset of B drawn from the state
distribution of the item. Every element in B is assumed to be present in the
state of some item with probability 1. For this problem, we show that the
adaptive greedy algorithm has an approximation ratio of H(|B|), the |B|th
Harmonic number. In stochastic set cover with imperfect coverage, an element in
the ground set need not be present in the state of any item. We show a
reduction from this problem to the former problem; the adaptive greedy
algorithm for the reduced instance has an approxiation ratio of H(|E|), where E
is the set of pairs (F, e) such that the state of item F contains e with
positive probability.
|
cs.DS
|
we study adaptive greedy algorithms for the problems of stochastic set cover with perfect and imperfect coverages in stochastic set cover with perfect coverage we are given a set of items and a ground set b evaluating an item reveals its state which is a random subset of b drawn from the state distribution of the item every element in b is assumed to be present in the state of some item with probability 1 for this problem we show that the adaptive greedy algorithm has an approximation ratio of hb the bth harmonic number in stochastic set cover with imperfect coverage an element in the ground set need not be present in the state of any item we show a reduction from this problem to the former problem the adaptive greedy algorithm for the reduced instance has an approxiation ratio of he where e is the set of pairs f e such that the state of item f contains e with positive probability
|
[['we', 'study', 'adaptive', 'greedy', 'algorithms', 'for', 'the', 'problems', 'of', 'stochastic', 'set', 'cover', 'with', 'perfect', 'and', 'imperfect', 'coverages', 'in', 'stochastic', 'set', 'cover', 'with', 'perfect', 'coverage', 'we', 'are', 'given', 'a', 'set', 'of', 'items', 'and', 'a', 'ground', 'set', 'b', 'evaluating', 'an', 'item', 'reveals', 'its', 'state', 'which', 'is', 'a', 'random', 'subset', 'of', 'b', 'drawn', 'from', 'the', 'state', 'distribution', 'of', 'the', 'item', 'every', 'element', 'in', 'b', 'is', 'assumed', 'to', 'be', 'present', 'in', 'the', 'state', 'of', 'some', 'item', 'with', 'probability', '1', 'for', 'this', 'problem', 'we', 'show', 'that', 'the', 'adaptive', 'greedy', 'algorithm', 'has', 'an', 'approximation', 'ratio', 'of', 'hb', 'the', 'bth', 'harmonic', 'number', 'in', 'stochastic', 'set', 'cover', 'with', 'imperfect', 'coverage', 'an', 'element', 'in', 'the', 'ground', 'set', 'need', 'not', 'be', 'present', 'in', 'the', 'state', 'of', 'any', 'item', 'we', 'show', 'a', 'reduction', 'from', 'this', 'problem', 'to', 'the', 'former', 'problem', 'the', 'adaptive', 'greedy', 'algorithm', 'for', 'the', 'reduced', 'instance', 'has', 'an', 'approxiation', 'ratio', 'of', 'he', 'where', 'e', 'is', 'the', 'set', 'of', 'pairs', 'f', 'e', 'such', 'that', 'the', 'state', 'of', 'item', 'f', 'contains', 'e', 'with', 'positive', 'probability']]
|
[-0.10949389441824443, 0.04371974180006862, -0.05362091843964406, -0.008125856937983423, -0.04777070723382607, -0.13605992262611635, 0.11069751402043218, 0.38816227837311434, -0.2942422742561146, -0.2851313857898756, 0.07022043582653442, -0.29594989605190836, -0.09599272860642637, 0.12040996050999209, -0.08271499461225845, 0.04327835699656201, 0.09189845834704448, 0.10661168226206595, 0.013521435553425111, -0.2883794649041321, 0.315332092813279, 0.004322675279587324, 0.2302103116151311, -0.02060368302866725, 0.11242146698038089, 0.03362297723241196, -0.016782049726740533, 0.07530806992385834, -0.12216662596298762, 0.08703846846452909, 0.27603851752412834, 0.21691613808914195, 0.31611800576600196, -0.3561546250203256, -0.15666391636513494, 0.1779367431164062, 0.07164256460482592, 0.09635843256805549, -0.028257556415328677, -0.23868373736590603, 0.12666295545655618, -0.17228530233074552, -0.062384143585990544, -0.010099333830954838, 0.044293824612998446, 0.031099913806077437, -0.37038831875882355, -0.0012420678934070963, 0.04456317493480636, 0.03250170005713961, -0.05765670294904841, -0.1720938176556599, 0.022096963037959546, 0.10149413584360133, -0.015009740133629827, 0.07077600605974396, 0.05144616186103149, -0.12241897684721237, -0.12066049495014859, 0.3887492867323793, -0.06300483889266437, -0.2360567170155286, 0.13772492937992206, -0.13859716749984335, -0.11237095537212638, 0.17388697506779907, 0.14609430152694322, 0.12790640573084433, -0.10366173747332733, 0.12532937077825398, -0.11555150601290812, 0.16498645263626896, 0.019605110122313713, 0.011084421297843837, 0.1535373353513609, 0.17835713485312973, 0.15819371985043026, 0.1404827722373984, -0.08607938110634136, -0.04031475380411589, -0.29608419596966057, -0.1455992526786139, -0.2092272925856266, 0.053119255054225725, -0.10027763361744782, -0.20094041054942674, 0.3656399415383127, 0.11857382352378197, 0.22447140138893407, 0.05349384334889681, 0.24146989990665685, 0.13511111457720384, -0.04728068027143978, 0.11127881794536566, 0.1592089927527108, 0.06635700741017157, 0.050911194856272886, -0.19592256276679734, 0.10327881595199825, 0.07929074138751471]
|
1,803.0764
|
AllenNLP: A Deep Semantic Natural Language Processing Platform
|
This paper describes AllenNLP, a platform for research on deep learning
methods in natural language understanding. AllenNLP is designed to support
researchers who want to build novel language understanding models quickly and
easily. It is built on top of PyTorch, allowing for dynamic computation graphs,
and provides (1) a flexible data API that handles intelligent batching and
padding, (2) high-level abstractions for common operations in working with
text, and (3) a modular and extensible experiment framework that makes doing
good science easy. It also includes reference implementations of high quality
approaches for both core semantic problems (e.g. semantic role labeling (Palmer
et al., 2005)) and language understanding applications (e.g. machine
comprehension (Rajpurkar et al., 2016)). AllenNLP is an ongoing open-source
effort maintained by engineers and researchers at the Allen Institute for
Artificial Intelligence.
|
cs.CL
|
this paper describes allennlp a platform for research on deep learning methods in natural language understanding allennlp is designed to support researchers who want to build novel language understanding models quickly and easily it is built on top of pytorch allowing for dynamic computation graphs and provides 1 a flexible data api that handles intelligent batching and padding 2 highlevel abstractions for common operations in working with text and 3 a modular and extensible experiment framework that makes doing good science easy it also includes reference implementations of high quality approaches for both core semantic problems eg semantic role labeling palmer et al 2005 and language understanding applications eg machine comprehension rajpurkar et al 2016 allennlp is an ongoing opensource effort maintained by engineers and researchers at the allen institute for artificial intelligence
|
[['this', 'paper', 'describes', 'allennlp', 'a', 'platform', 'for', 'research', 'on', 'deep', 'learning', 'methods', 'in', 'natural', 'language', 'understanding', 'allennlp', 'is', 'designed', 'to', 'support', 'researchers', 'who', 'want', 'to', 'build', 'novel', 'language', 'understanding', 'models', 'quickly', 'and', 'easily', 'it', 'is', 'built', 'on', 'top', 'of', 'pytorch', 'allowing', 'for', 'dynamic', 'computation', 'graphs', 'and', 'provides', '1', 'a', 'flexible', 'data', 'api', 'that', 'handles', 'intelligent', 'batching', 'and', 'padding', '2', 'highlevel', 'abstractions', 'for', 'common', 'operations', 'in', 'working', 'with', 'text', 'and', '3', 'a', 'modular', 'and', 'extensible', 'experiment', 'framework', 'that', 'makes', 'doing', 'good', 'science', 'easy', 'it', 'also', 'includes', 'reference', 'implementations', 'of', 'high', 'quality', 'approaches', 'for', 'both', 'core', 'semantic', 'problems', 'eg', 'semantic', 'role', 'labeling', 'palmer', 'et', 'al', '2005', 'and', 'language', 'understanding', 'applications', 'eg', 'machine', 'comprehension', 'rajpurkar', 'et', 'al', '2016', 'allennlp', 'is', 'an', 'ongoing', 'opensource', 'effort', 'maintained', 'by', 'engineers', 'and', 'researchers', 'at', 'the', 'allen', 'institute', 'for', 'artificial', 'intelligence']]
|
[-0.03860654473948972, 0.02211782892151032, -0.052940064918641984, 0.07988047741591595, -0.20596947481757716, -0.2045328905420812, 0.04787137415487655, 0.4192733797979982, -0.23202437759005934, -0.41647811123359024, 0.059530157756928666, -0.24163979700332353, -0.18425198462336584, 0.2358066230956325, -0.14495832158258723, 0.09783624754728455, 0.11402892678471885, -0.03480072254385043, 0.015225628821557402, -0.2534511749373567, 0.2215254265653964, 0.12889285541215695, 0.34595614918192524, 0.050960227542493804, 0.08711566709601705, 0.033028284483414175, -0.07957301965102385, -0.03884609331397858, -0.10209572066334549, 0.20236136752383826, 0.39754276854438286, 0.2655351674499312, 0.3486320742798087, -0.43162833207419943, -0.16514244659530714, 0.0128783750543861, 0.0875882319727461, 0.08298436991075628, -0.0372488362858198, -0.3141501610188332, 0.0716757204338096, -0.1973380651745133, -0.047028661576008664, -0.16636914113342596, 0.08406950911871136, -0.05037381184677754, -0.2723639487521723, -0.07224583349044476, 0.11137195397020691, 0.15057434490050323, -0.004983221054693362, -0.11672909323238116, 0.052804641159517426, 0.15739298341060548, -0.07085487376583419, 0.12446899114078597, 0.13633702023136884, -0.14548681889086457, -0.1679465861647929, 0.36987506672459886, 0.0018510720587538597, -0.14414970107250533, 0.2639521108169977, 0.04376888449856997, -0.21093034885536627, 0.018725191143208315, 0.22778089913098434, 0.04758257255714415, -0.17377263869340986, 0.1332820810423989, 0.005756772546923922, 0.19318008280352206, 0.07246121110156514, -0.06751162897011168, 0.2131151186050217, 0.2454606420535566, 0.002186162677800101, 0.08083127257309126, 0.006550653011335018, -0.06842800643018454, -0.18586627221701288, -0.18186123559209413, -0.1419897290875372, -0.04430167808169429, -0.013334654148294297, -0.1338506387126513, 0.3530206466303732, 0.210998923902897, 0.10828490275539514, 0.052932498074369505, 0.3312299017115195, -0.02683677749106086, 0.09824139505092587, 0.1724427292977733, 0.10965840544383552, 0.02622468356582287, 0.20850517975754643, -0.09855920681379791, 0.08076571114886467, 0.04877415828448825]
|
1,803.07641
|
An ADMM-based Coordination and Control Strategy for PV and Storage to
Dispatch Stochastic Prosumers: Theory and Experimental Validation
|
This paper describes a two-layer control and coordination framework for
distributed energy resources. The lower layer is a real-time model predictive
control (MPC) executed at 10 s resolution to achieve fine tuning of a given
energy set-point. The upper layer is a slower MPC coordination mechanism based
on distributed optimization, and solved with the alternating direction method
of multipliers (ADMM) at 5 minutes resolution. It is needed to coordinate the
power flow among the controllable resources such that enough power is available
in real-time to achieve a pre-established energy trajectory in the long term.
Although the formulation is generic, it is developed for the case of a battery
system and a curtailable PV facility to dispatch stochastic prosumption
according to a trajectory at 5 minutes resolution established the day before
the operation. The proposed method is experimentally validated in a real-life
setup to dispatch the operation of a building with rooftop PV generation (i.e.,
101 kW average load, 350 kW peak demand, 82 kW peak PV generation) by
controlling a 560 kWh/720 kVA battery and a 13 kW peak curtailable PV facility.
|
cs.SY
|
this paper describes a twolayer control and coordination framework for distributed energy resources the lower layer is a realtime model predictive control mpc executed at 10 s resolution to achieve fine tuning of a given energy setpoint the upper layer is a slower mpc coordination mechanism based on distributed optimization and solved with the alternating direction method of multipliers admm at 5 minutes resolution it is needed to coordinate the power flow among the controllable resources such that enough power is available in realtime to achieve a preestablished energy trajectory in the long term although the formulation is generic it is developed for the case of a battery system and a curtailable pv facility to dispatch stochastic prosumption according to a trajectory at 5 minutes resolution established the day before the operation the proposed method is experimentally validated in a reallife setup to dispatch the operation of a building with rooftop pv generation ie 101 kw average load 350 kw peak demand 82 kw peak pv generation by controlling a 560 kwh720 kva battery and a 13 kw peak curtailable pv facility
|
[['this', 'paper', 'describes', 'a', 'twolayer', 'control', 'and', 'coordination', 'framework', 'for', 'distributed', 'energy', 'resources', 'the', 'lower', 'layer', 'is', 'a', 'realtime', 'model', 'predictive', 'control', 'mpc', 'executed', 'at', '10', 's', 'resolution', 'to', 'achieve', 'fine', 'tuning', 'of', 'a', 'given', 'energy', 'setpoint', 'the', 'upper', 'layer', 'is', 'a', 'slower', 'mpc', 'coordination', 'mechanism', 'based', 'on', 'distributed', 'optimization', 'and', 'solved', 'with', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'at', '5', 'minutes', 'resolution', 'it', 'is', 'needed', 'to', 'coordinate', 'the', 'power', 'flow', 'among', 'the', 'controllable', 'resources', 'such', 'that', 'enough', 'power', 'is', 'available', 'in', 'realtime', 'to', 'achieve', 'a', 'preestablished', 'energy', 'trajectory', 'in', 'the', 'long', 'term', 'although', 'the', 'formulation', 'is', 'generic', 'it', 'is', 'developed', 'for', 'the', 'case', 'of', 'a', 'battery', 'system', 'and', 'a', 'curtailable', 'pv', 'facility', 'to', 'dispatch', 'stochastic', 'prosumption', 'according', 'to', 'a', 'trajectory', 'at', '5', 'minutes', 'resolution', 'established', 'the', 'day', 'before', 'the', 'operation', 'the', 'proposed', 'method', 'is', 'experimentally', 'validated', 'in', 'a', 'reallife', 'setup', 'to', 'dispatch', 'the', 'operation', 'of', 'a', 'building', 'with', 'rooftop', 'pv', 'generation', 'ie', '101', 'kw', 'average', 'load', '350', 'kw', 'peak', 'demand', '82', 'kw', 'peak', 'pv', 'generation', 'by', 'controlling', 'a', '560', 'kwh720', 'kva', 'battery', 'and', 'a', '13', 'kw', 'peak', 'curtailable', 'pv', 'facility']]
|
[-0.15728540502704721, 0.0700059548417204, -0.011445412593340573, -0.009674223547657304, -0.05334765428564002, -0.2102278875012095, 0.10099753904997665, 0.38827387674696207, -0.2801730296065136, -0.3804190691190036, 0.1319062215394568, -0.24415133747616938, -0.01528973529856261, 0.227981197772527, -0.08251171328258593, 0.07114968470874042, 0.053226336165979625, 0.01949415808075329, 0.005754165936683341, -0.21379193021447618, 0.15256515552208744, 0.14271440402249605, 0.3517279177389586, 0.03829924931533594, 0.15566926386184188, -0.04171833203711871, 0.025973040220584626, -0.017310856369773288, -0.06503529690588902, 0.12898142177364608, 0.2458157825376324, 0.10298343157416302, 0.30553601224500254, -0.4177428218664715, -0.19764219365116126, 0.07094618607986491, 0.06845873334423834, 0.002845416617327632, -0.03255375279358058, -0.17365603945835478, 0.14503432207905498, -0.22518001070750351, -0.1218544797410993, -0.007823248458151494, 0.01886632991568777, 0.02709414030924357, -0.33520850311779515, 0.024267486138372214, -0.002465933567756859, 0.06430290273673066, -0.08506048051897663, -0.0647039174852193, 0.0032381320150970424, 0.06740764125368624, -0.027763679293653212, 0.05260730640787775, 0.17304331431028983, -0.07897246822596461, -0.10665360106912941, 0.3796194296597776, -0.009554032561142841, -0.13408357809035323, 0.09611266425255048, -0.08192357253437625, -0.08267620267945944, 0.15030059428340165, 0.20437178415508725, 0.13197705228890175, -0.18356228975427352, 0.03269954462592279, 0.017620315609978336, 0.23698161052570818, 0.07814356685585204, -0.02965815677641999, 0.16234005493554415, 0.24555022573196303, 0.14956476861991772, 0.10600404146989906, -0.1331976002123392, -0.11497720418425884, -0.2736747441504624, -0.11343330655823261, -0.15429675223457612, 0.03329448343655969, -0.06026398109173073, -0.05663519794152257, 0.4501043269153458, 0.1283916983012501, 0.13618133426065046, 0.07490722477585283, 0.3715083289129958, 0.12999445488624975, 0.09644188427042154, 0.13093356380769108, 0.21017326871820763, 0.03440122133589128, 0.21997575887134144, -0.24539224028288906, 0.025707433267769236, 0.03809443862661102]
|
1,803.07642
|
Local criteria for triangulation of manifolds
|
We present criteria for establishing a triangulation of a manifold. Given a
manifold M, a simplicial complex A, and a map H from the underlying space of A
to M, our criteria are presented in local coordinate charts for M, and ensure
that H is a homeomorphism. These criteria do not require a differentiable
structure, or even an explicit metric on M. No Delaunay property of A is
assumed. The result provides a triangulation guarantee for algorithms that
construct a simplicial complex by working in local coordinate patches. Because
the criteria are easily verified in such a setting, they are expected to be of
general use.
|
cs.CG math.DG
|
we present criteria for establishing a triangulation of a manifold given a manifold m a simplicial complex a and a map h from the underlying space of a to m our criteria are presented in local coordinate charts for m and ensure that h is a homeomorphism these criteria do not require a differentiable structure or even an explicit metric on m no delaunay property of a is assumed the result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches because the criteria are easily verified in such a setting they are expected to be of general use
|
[['we', 'present', 'criteria', 'for', 'establishing', 'a', 'triangulation', 'of', 'a', 'manifold', 'given', 'a', 'manifold', 'm', 'a', 'simplicial', 'complex', 'a', 'and', 'a', 'map', 'h', 'from', 'the', 'underlying', 'space', 'of', 'a', 'to', 'm', 'our', 'criteria', 'are', 'presented', 'in', 'local', 'coordinate', 'charts', 'for', 'm', 'and', 'ensure', 'that', 'h', 'is', 'a', 'homeomorphism', 'these', 'criteria', 'do', 'not', 'require', 'a', 'differentiable', 'structure', 'or', 'even', 'an', 'explicit', 'metric', 'on', 'm', 'no', 'delaunay', 'property', 'of', 'a', 'is', 'assumed', 'the', 'result', 'provides', 'a', 'triangulation', 'guarantee', 'for', 'algorithms', 'that', 'construct', 'a', 'simplicial', 'complex', 'by', 'working', 'in', 'local', 'coordinate', 'patches', 'because', 'the', 'criteria', 'are', 'easily', 'verified', 'in', 'such', 'a', 'setting', 'they', 'are', 'expected', 'to', 'be', 'of', 'general', 'use']]
|
[-0.1565549151251479, 0.026587841570084116, -0.13125697369599398, 0.10252478514262035, -0.09562170053041487, -0.14246267135219895, 0.03878254353569575, 0.40688574208684686, -0.25045345699028027, -0.27436861351905567, 0.1373119812056791, -0.2003104656985258, -0.16666943686443186, 0.17621301640734463, -0.12778364197913347, 0.003570732849491936, 0.0927312953731502, 0.06570482782509951, -0.0829488173641159, -0.24326819943852793, 0.33975858618241717, 0.005502696318182883, 0.20681753592073637, 0.002836173729760186, 0.14206392640019502, -0.029396416553524585, -0.04440702110054499, 0.10133913538845933, -0.15091768487530677, 0.10770339796425037, 0.2541886668054844, 0.1496262512551972, 0.24672410734006608, -0.3847783913238431, -0.18271619425910823, 0.15630955557022594, 0.09784061474426878, 0.06446407889982439, -0.03542794930015005, -0.2636847259511925, 0.13409652080351733, -0.06711975096303197, -0.13242286501259035, -0.09483581274170715, 0.0281089124058918, -0.004271361836284961, -0.3418613337930336, -0.04077716457727804, 0.11519606307925676, 0.08725839935875726, -0.02707598350265608, -0.04185357784197824, -0.0607915665044994, 0.10608593274109979, -0.07948438162071947, 0.0898321142446531, 0.11468064663975658, -0.07231259397846067, -0.08965402196780867, 0.410243686402814, -0.028356631453377457, -0.308052546278802, 0.2002977816682344, -0.09389738115605037, -0.13216827796631545, 0.13492730683383514, 0.11577771506206361, 0.16814133976498302, -0.13571302845847863, 0.14608867272607245, -0.08125896459744084, 0.13637099559155275, 0.0393130871563939, 0.003179065146777814, 0.17032736418593042, 0.12081433879650848, 0.18733326794430263, 0.0895067905416308, -0.004966410507342585, -0.0390595832250942, -0.3431723079872581, -0.2116154156194754, -0.19242793948934325, 0.088896264060854, -0.11707958730156226, -0.1922144560178496, 0.3406294090277955, 0.052548021411980096, 0.26335676030457933, 0.08550018798872908, 0.24965313029528227, 0.03748201120332902, 0.07144442948670333, 0.10616851243067463, 0.17764229265278872, 0.11234855721924314, 0.036974936332729344, -0.08602609541398948, 0.057334549250608345, 0.13403995545088965]
|
1,803.07643
|
On the Dynamics of Distributed Energy Adoption: Equilibrium, Stability,
and Limiting Capacity
|
The death spiral hypothesis in electric utility represents a positive
feedback phenomenon in which a regulated utility is driven to financial
instability by rising prices and declining demand. We establish conditions for
the existence of death spiral and conditions of stable adoption of distributed
energy resources. We show in particular that linear tariffs always induce death
spiral when the fixed operating cost of the utility rises beyond a certain
threshold. For two-part tariffs with connection and volumetric charges, the
Ramsey pricing that optimizes myopically social welfare subject to the revenue
adequacy constraint induces a stable equilibrium. The Ramsey pricing, however,
inhibits renewable adoption with a high connection charge. In contrast, a
two-part tariff with a small connection charge results in a stable adoption
process with a higher level of renewable adoption and greater long-term total
consumer surplus. Market data are used to illustrate various solar adoption
scenarios.
|
math.OC math.DS
|
the death spiral hypothesis in electric utility represents a positive feedback phenomenon in which a regulated utility is driven to financial instability by rising prices and declining demand we establish conditions for the existence of death spiral and conditions of stable adoption of distributed energy resources we show in particular that linear tariffs always induce death spiral when the fixed operating cost of the utility rises beyond a certain threshold for twopart tariffs with connection and volumetric charges the ramsey pricing that optimizes myopically social welfare subject to the revenue adequacy constraint induces a stable equilibrium the ramsey pricing however inhibits renewable adoption with a high connection charge in contrast a twopart tariff with a small connection charge results in a stable adoption process with a higher level of renewable adoption and greater longterm total consumer surplus market data are used to illustrate various solar adoption scenarios
|
[['the', 'death', 'spiral', 'hypothesis', 'in', 'electric', 'utility', 'represents', 'a', 'positive', 'feedback', 'phenomenon', 'in', 'which', 'a', 'regulated', 'utility', 'is', 'driven', 'to', 'financial', 'instability', 'by', 'rising', 'prices', 'and', 'declining', 'demand', 'we', 'establish', 'conditions', 'for', 'the', 'existence', 'of', 'death', 'spiral', 'and', 'conditions', 'of', 'stable', 'adoption', 'of', 'distributed', 'energy', 'resources', 'we', 'show', 'in', 'particular', 'that', 'linear', 'tariffs', 'always', 'induce', 'death', 'spiral', 'when', 'the', 'fixed', 'operating', 'cost', 'of', 'the', 'utility', 'rises', 'beyond', 'a', 'certain', 'threshold', 'for', 'twopart', 'tariffs', 'with', 'connection', 'and', 'volumetric', 'charges', 'the', 'ramsey', 'pricing', 'that', 'optimizes', 'myopically', 'social', 'welfare', 'subject', 'to', 'the', 'revenue', 'adequacy', 'constraint', 'induces', 'a', 'stable', 'equilibrium', 'the', 'ramsey', 'pricing', 'however', 'inhibits', 'renewable', 'adoption', 'with', 'a', 'high', 'connection', 'charge', 'in', 'contrast', 'a', 'twopart', 'tariff', 'with', 'a', 'small', 'connection', 'charge', 'results', 'in', 'a', 'stable', 'adoption', 'process', 'with', 'a', 'higher', 'level', 'of', 'renewable', 'adoption', 'and', 'greater', 'longterm', 'total', 'consumer', 'surplus', 'market', 'data', 'are', 'used', 'to', 'illustrate', 'various', 'solar', 'adoption', 'scenarios']]
|
[-0.18147081759485867, 0.10458452585089927, -0.015516755110932654, 0.09170471954119692, -0.0944556499448079, -0.14108471528367222, 0.15115547144696825, 0.3901269574123783, -0.26520706487654827, -0.25483164845706047, 0.09637398701272018, -0.2569704297676581, -0.13779017440721292, 0.14603667657150804, -0.14571072554633935, -0.013552229025489873, 0.02027681336633633, -0.006624088427812165, 0.012644381602500648, -0.25286790405457116, 0.2898171103803352, 0.08027909116975514, 0.3589319353606425, 0.054078127140318656, 0.08989921799262188, -0.0457238079869144, 0.02127259557902002, 0.009050749635900416, -0.13374862630289686, 0.13802555046316717, 0.2893422567824117, 0.1605506323778457, 0.4274392976444595, -0.4369242142436101, -0.18076675001105774, 0.15075297890623815, 0.048426779655448234, 0.023938252425081016, -0.09353856084358302, -0.18843888961171515, 0.04382646802914183, -0.27511675508303224, -0.15485085159552847, -0.037096367046541096, 0.020701317230657656, 0.08648427188939972, -0.3497763924604776, 0.06698693476061393, 0.009180821668432683, 0.05580476913791226, -0.08313256283259006, -0.045271342460281486, -0.10088586345153423, 0.1099401132774232, 0.09970587254743421, -0.03055164272097877, 0.1855053444690749, -0.16932301786823237, -0.16063129897451117, 0.37257763468121896, -0.06906979209363308, -0.11701922374648806, 0.13655859022242886, -0.1634197152460463, -0.10876141166548897, 0.1634932938237757, 0.18962508320593002, 0.0319479322029265, -0.14012071842117454, 0.020206729585279515, 0.0063830709819789645, 0.13331798577307388, 0.11680059326134723, 0.03885086896658248, 0.22567015371941107, 0.21834187424063783, 0.18598379586905647, 0.12375975478928358, -0.005425671109182089, -0.1970138305316673, -0.238597297169851, -0.11111471639173169, -0.13217102297816147, 0.08918705546258723, -0.11328284972668848, -0.14590696823865582, 0.37599160972044987, 0.115187851788134, 0.11240454475699486, 0.10450350683337699, 0.28983826630552406, 0.1424684326867668, 0.015301648551142034, 0.10980781113576828, 0.191385521000583, 0.05424227534958041, 0.17958366535889098, -0.22966951527474386, 0.14983360437030085, -0.023361936978184852]
|
1,803.07644
|
Effective Field Theory description of Phantom Fields
|
In this work I show that a simple Field Theory on a non trivial gauge
background may behave as a phantom field and contribute to an effective $w<-1$
state equation fluid contribution to cosmology.
|
hep-ph gr-qc hep-th
|
in this work i show that a simple field theory on a non trivial gauge background may behave as a phantom field and contribute to an effective w1 state equation fluid contribution to cosmology
|
[['in', 'this', 'work', 'i', 'show', 'that', 'a', 'simple', 'field', 'theory', 'on', 'a', 'non', 'trivial', 'gauge', 'background', 'may', 'behave', 'as', 'a', 'phantom', 'field', 'and', 'contribute', 'to', 'an', 'effective', 'w1', 'state', 'equation', 'fluid', 'contribution', 'to', 'cosmology']]
|
[-0.12586695354377084, 0.1526830805134309, -0.15804344021222172, 0.06977460630279143, -0.14464995303355596, -0.17124930869185312, -0.03321411744485993, 0.32245894198251124, -0.23424574030179748, -0.2748080973568208, -0.002621398803860168, -0.26113367858616743, -0.1360113341909121, 0.13296591150848305, -0.07265909336616888, -0.09750257566680803, 0.004552003872745177, 0.07186799107448143, -0.0032713286756702207, -0.24303201399743557, 0.3254313037374659, 0.044526882334406874, 0.2617704874890692, 0.013019145685521996, 0.09388122017330983, -0.04602231778314009, 0.0342192839118926, 0.11900397844831734, -0.16105853539642445, 0.002330407335915986, 0.23418057559277206, 0.043415504877510315, 0.21220576001659913, -0.4225667616462006, -0.25418196029632406, 0.10501450072864399, 0.1536931253683767, 0.18730327155550613, -0.07223829204175512, -0.2519582559847656, 0.024114096287281856, -0.19150551715317896, -0.1523209638955236, -0.08741480842753149, -0.016561235979144627, -0.12366506846292931, -0.22650508018320098, 0.08850924171736765, 0.04803171328625039, 0.002228149103329462, -0.11590317680555232, -0.08555397925460163, 0.025350706857245636, 0.03672506009666797, 0.06907228984431747, 0.1421317766447935, 0.14697642109411604, -0.27829925468711947, -0.06762161218177747, 0.3729009758681059, -0.1812722694594413, -0.2336279963800574, 0.16592833166942, -0.07313789621762493, -0.13522930506288128, 0.10517679478096612, 0.15192350832855, 0.10137751501272707, -0.10555928904453621, 0.17475782950949745, 0.01444817619288669, 0.1662326491136542, 0.0016476030680624878, -0.0529940366772387, 0.2572187925962841, 0.06965488617253654, 0.05013899633880047, 0.07892341191387352, 0.020388797959586716, -0.09924255952458172, -0.39846901551765557, -0.22047209778033636, -0.13269485205904963, 0.15736362447633462, -0.047494985176479744, -0.25732348159448626, 0.3453417918370927, 0.15980983225916348, 0.16962486669859467, 0.023115358479759273, 0.27927302919766483, 0.09310713341384304, -0.02732892379657749, 0.057923544472193014, 0.28332745897419315, 0.1365090891280595, 0.12150240749778117, -0.18416841640411055, -0.12322749890496626, 0.00510223103029763]
|
1,803.07645
|
V-Splines and Bayes Estimate
|
Smoothing splines can be thought of as the posterior mean of a Gaussian
process regression in a certain limit. By constructing a reproducing kernel
Hilbert space with an appropriate inner product, the Bayesian form of the
V-spline is derived when the penalty term is a fixed constant instead of a
function. An extension to the usual generalized cross-validation formula is
utilized to find the optimal V-spline parameters.
|
math.ST stat.TH
|
smoothing splines can be thought of as the posterior mean of a gaussian process regression in a certain limit by constructing a reproducing kernel hilbert space with an appropriate inner product the bayesian form of the vspline is derived when the penalty term is a fixed constant instead of a function an extension to the usual generalized crossvalidation formula is utilized to find the optimal vspline parameters
|
[['smoothing', 'splines', 'can', 'be', 'thought', 'of', 'as', 'the', 'posterior', 'mean', 'of', 'a', 'gaussian', 'process', 'regression', 'in', 'a', 'certain', 'limit', 'by', 'constructing', 'a', 'reproducing', 'kernel', 'hilbert', 'space', 'with', 'an', 'appropriate', 'inner', 'product', 'the', 'bayesian', 'form', 'of', 'the', 'vspline', 'is', 'derived', 'when', 'the', 'penalty', 'term', 'is', 'a', 'fixed', 'constant', 'instead', 'of', 'a', 'function', 'an', 'extension', 'to', 'the', 'usual', 'generalized', 'crossvalidation', 'formula', 'is', 'utilized', 'to', 'find', 'the', 'optimal', 'vspline', 'parameters']]
|
[-0.06446033332552482, 0.04300420212519439, -0.13737438038102726, 0.13630641764999082, -0.10951956484115807, -0.11872534247448863, 0.03685019106548557, 0.353189197827631, -0.31953261720378007, -0.23887685096975583, 0.13445642984423564, -0.18522942388680444, -0.14307312996807828, 0.1729838719118887, -0.09995689531162714, 0.08096543816265775, 0.024452121466148034, 0.05267890204967403, -0.13646140298458623, -0.24561699716124072, 0.33144518566220554, 0.11073561380235061, 0.2325765288282019, -0.061408659194790716, 0.14327172217751616, 0.03029860524154866, -0.008768369596618326, -0.028468843376170148, -0.1413879783115169, 0.13054650183072064, 0.23805588622118778, 0.09132448499744285, 0.36946881334505866, -0.31882197389017736, -0.24136199312868403, 0.16516854086501606, 0.1436092990742468, 0.043656870378737354, 0.04222068874471223, -0.23779989926339085, 0.01744188073633322, -0.18888510652442478, -0.13011254442494308, -0.07701121452750999, -0.028005865944632842, 0.0056081590756996355, -0.40849525750433996, 0.06827405382489869, 0.06008567418486102, 0.0322787262110123, -0.054388923431510354, -0.13772552433326396, -0.01669997434173502, 0.06757176243361267, 0.01569654193746774, 0.07946390853916753, 0.12426107725147645, -0.11607127961938951, -0.06577974192297725, 0.31688999451363264, -0.1280273466845349, -0.30966262063428535, 0.06363475302915408, -0.07685842882814024, -0.05548823070225876, 0.11222549213735915, 0.11639565166864377, 0.12919852324525144, -0.161310255969918, 0.12556074780703924, -0.07569385365645553, 0.12918051929949825, 0.0501789020569022, -0.04599569568327114, 0.133582981664743, 0.13944673283136824, 0.10720734483798716, 0.173420091686117, -0.09297467795992966, -0.10439162236402061, -0.35780529766830044, -0.16360197367786028, -0.23174551104320518, 0.025697310409967356, -0.19964145560429167, -0.24601064294354238, 0.3260866825628692, 0.04715882404359864, 0.25686277104402655, 0.09299368515555094, 0.270531674235392, 0.21685434760935882, 0.09087242353221041, 0.07374267157083794, 0.18100442599727593, 0.13753385799450438, -0.03112752507649251, -0.1560423409760888, 0.10438175285471787, 0.1184746633325495]
|
1,803.07646
|
Optical and Near-Infrared Radial Velocity Content of M Dwarfs: Testing
Models with Barnard's Star
|
High precision radial velocity (RV) measurements have been central in the
study of exoplanets during the last two decades, from the early discovery of
hot Jupiters, to the recent mass measurements of Earth-sized planets uncovered
by transit surveys. While optical radial-velocity is now a mature field, there
is currently a strong effort to push the technique into the near-infrared (nIR)
domain (chiefly $Y$, $J$, $H$ and $K$ band passes) to probe planetary systems
around late-type stars. The combined lower mass and luminosity of M dwarfs
leads to an increased reflex RV signal for planets in the habitable zone
compared to Sun-like stars. The estimates on the detectability of planets rely
on various instrumental characteristics, but also on a prior knowledge of the
stellar spectrum. While the overall properties of M dwarf spectra have been
extensively tested against observations, the same is not true for their
detailed line profiles, which leads to significant uncertainties when
converting a given signal-to-noise ratio to a corresponding RV precision as
attainable on a given spectrograph. By combining archival CRIRES and HARPS data
with ESPaDOnS data of Barnard's star, we show that state-of-the-art atmosphere
models over-predict the $Y$ and $J$-band RV content by more than a factor of
$\sim$$2$, while under-predicting the $H$ and $K$-band content by half.
|
astro-ph.IM astro-ph.SR
|
high precision radial velocity rv measurements have been central in the study of exoplanets during the last two decades from the early discovery of hot jupiters to the recent mass measurements of earthsized planets uncovered by transit surveys while optical radialvelocity is now a mature field there is currently a strong effort to push the technique into the nearinfrared nir domain chiefly y j h and k band passes to probe planetary systems around latetype stars the combined lower mass and luminosity of m dwarfs leads to an increased reflex rv signal for planets in the habitable zone compared to sunlike stars the estimates on the detectability of planets rely on various instrumental characteristics but also on a prior knowledge of the stellar spectrum while the overall properties of m dwarf spectra have been extensively tested against observations the same is not true for their detailed line profiles which leads to significant uncertainties when converting a given signaltonoise ratio to a corresponding rv precision as attainable on a given spectrograph by combining archival crires and harps data with espadons data of barnards star we show that stateoftheart atmosphere models overpredict the y and jband rv content by more than a factor of sim2 while underpredicting the h and kband content by half
|
[['high', 'precision', 'radial', 'velocity', 'rv', 'measurements', 'have', 'been', 'central', 'in', 'the', 'study', 'of', 'exoplanets', 'during', 'the', 'last', 'two', 'decades', 'from', 'the', 'early', 'discovery', 'of', 'hot', 'jupiters', 'to', 'the', 'recent', 'mass', 'measurements', 'of', 'earthsized', 'planets', 'uncovered', 'by', 'transit', 'surveys', 'while', 'optical', 'radialvelocity', 'is', 'now', 'a', 'mature', 'field', 'there', 'is', 'currently', 'a', 'strong', 'effort', 'to', 'push', 'the', 'technique', 'into', 'the', 'nearinfrared', 'nir', 'domain', 'chiefly', 'y', 'j', 'h', 'and', 'k', 'band', 'passes', 'to', 'probe', 'planetary', 'systems', 'around', 'latetype', 'stars', 'the', 'combined', 'lower', 'mass', 'and', 'luminosity', 'of', 'm', 'dwarfs', 'leads', 'to', 'an', 'increased', 'reflex', 'rv', 'signal', 'for', 'planets', 'in', 'the', 'habitable', 'zone', 'compared', 'to', 'sunlike', 'stars', 'the', 'estimates', 'on', 'the', 'detectability', 'of', 'planets', 'rely', 'on', 'various', 'instrumental', 'characteristics', 'but', 'also', 'on', 'a', 'prior', 'knowledge', 'of', 'the', 'stellar', 'spectrum', 'while', 'the', 'overall', 'properties', 'of', 'm', 'dwarf', 'spectra', 'have', 'been', 'extensively', 'tested', 'against', 'observations', 'the', 'same', 'is', 'not', 'true', 'for', 'their', 'detailed', 'line', 'profiles', 'which', 'leads', 'to', 'significant', 'uncertainties', 'when', 'converting', 'a', 'given', 'signaltonoise', 'ratio', 'to', 'a', 'corresponding', 'rv', 'precision', 'as', 'attainable', 'on', 'a', 'given', 'spectrograph', 'by', 'combining', 'archival', 'crires', 'and', 'harps', 'data', 'with', 'espadons', 'data', 'of', 'barnards', 'star', 'we', 'show', 'that', 'stateoftheart', 'atmosphere', 'models', 'overpredict', 'the', 'y', 'and', 'jband', 'rv', 'content', 'by', 'more', 'than', 'a', 'factor', 'of', 'sim2', 'while', 'underpredicting', 'the', 'h', 'and', 'kband', 'content', 'by', 'half']]
|
[-0.07115478198019841, 0.109865449248214, -0.07140494654046257, 0.03436098149527339, -0.14291000620787084, -0.0922920408324813, 0.09914522825516234, 0.3936142775862706, -0.14660517529492215, -0.37329338328201184, 0.10474802025940867, -0.3149182580297215, -0.020353992972610833, 0.23402535316494802, -0.0946218378551937, 0.05241202074597273, 0.17225409175032083, -0.04024334531057767, -0.04254345314133526, -0.3078649826292915, 0.2708331690829375, 0.09184079110306108, 0.12636069314214424, -0.0414319380586264, 0.028961569672661287, -0.07447874927366117, -0.11846268405524996, -0.029221779192530963, -0.17683409892571328, 0.048579521440979934, 0.23686988324933272, 0.13888245152928955, 0.22495693821714804, -0.3380577187163685, -0.2329529601144868, 0.07030217687243526, 0.1685927650322347, -0.00035140352084231125, -0.04682261047793941, -0.2822756416621214, 0.0868451258783747, -0.14039968741609593, -0.12940638625713172, 0.015598193188812936, 0.09317709273880541, 0.006292763337766683, -0.2518923743616983, 0.056743681641544856, 0.026501942151401826, 0.19016457467893455, -0.11613216093754536, -0.16970123759831107, -0.07957619938061503, 0.08168757095219642, 0.013254504812275112, 0.059752503068904055, 0.12132591871327264, -0.14118024837093884, -0.02208789109520368, 0.3918651717249304, -0.17239541048328183, -0.00922871173693324, 0.22454084405666744, -0.24364353705939995, -0.1313483608718566, 0.15913769813531237, 0.17922904345927373, 0.13586926110580844, -0.18728878917009184, 0.037244264009784256, -0.0073602873467365805, 0.21285578040209108, 0.07521963327352116, 0.06692969982560619, 0.34305731814249224, 0.12389130460401505, 0.07914692464609684, 0.020977205649580596, -0.24987205127166268, -0.004727455304676386, -0.14373114994751238, -0.1220470272676738, -0.15054946202281774, 0.033718565831530316, -0.09467071018648227, -0.08764479932471898, 0.36129763265764164, 0.1385372901579172, 0.21075696914175632, 0.03807730511004404, 0.3618623097075747, 0.09793106340067373, 0.13266414392273873, 0.07771019865912474, 0.33640332096300246, 0.19438377236683835, 0.12464847346165937, -0.24177464338146887, 0.0962360839179348, -0.021310492163910618]
|
1,803.07647
|
The bunkbed conjecture on the complete graph
|
The bunkbed conjecture was first posed by Kasteleyn. If $G=(V,E)$ is a finite
graph and $H$ some subset of $V$, then the bunkbed of the pair $(G,H)$ is the
graph $G\times\{1,2\}$ plus $|H|$ extra edges to connect for every $v\in H$ the
vertices $(v,1)$ and $(v,2)$. The conjecture asserts that $(v,1)$ is more
likely to connect with $(w,1)$ than with $(w,2)$ in the independent bond
percolation model for any $v,w\in V$. This is intuitive because $(v,1)$ is in
some sense closer to $(w,1)$ than it is to $(w,2)$. The conjecture has however
resisted several attempts of proof. This paper settles the conjecture in the
case of a constant percolation parameter and $G$ the complete graph.
|
math.CO
|
the bunkbed conjecture was first posed by kasteleyn if gve is a finite graph and h some subset of v then the bunkbed of the pair gh is the graph gtimes12 plus h extra edges to connect for every vin h the vertices v1 and v2 the conjecture asserts that v1 is more likely to connect with w1 than with w2 in the independent bond percolation model for any vwin v this is intuitive because v1 is in some sense closer to w1 than it is to w2 the conjecture has however resisted several attempts of proof this paper settles the conjecture in the case of a constant percolation parameter and g the complete graph
|
[['the', 'bunkbed', 'conjecture', 'was', 'first', 'posed', 'by', 'kasteleyn', 'if', 'gve', 'is', 'a', 'finite', 'graph', 'and', 'h', 'some', 'subset', 'of', 'v', 'then', 'the', 'bunkbed', 'of', 'the', 'pair', 'gh', 'is', 'the', 'graph', 'gtimes12', 'plus', 'h', 'extra', 'edges', 'to', 'connect', 'for', 'every', 'vin', 'h', 'the', 'vertices', 'v1', 'and', 'v2', 'the', 'conjecture', 'asserts', 'that', 'v1', 'is', 'more', 'likely', 'to', 'connect', 'with', 'w1', 'than', 'with', 'w2', 'in', 'the', 'independent', 'bond', 'percolation', 'model', 'for', 'any', 'vwin', 'v', 'this', 'is', 'intuitive', 'because', 'v1', 'is', 'in', 'some', 'sense', 'closer', 'to', 'w1', 'than', 'it', 'is', 'to', 'w2', 'the', 'conjecture', 'has', 'however', 'resisted', 'several', 'attempts', 'of', 'proof', 'this', 'paper', 'settles', 'the', 'conjecture', 'in', 'the', 'case', 'of', 'a', 'constant', 'percolation', 'parameter', 'and', 'g', 'the', 'complete', 'graph']]
|
[-0.12627337889627374, 0.10395749618315644, -0.04984906257800104, -0.004568489881134347, -0.12001448454899027, -0.2107308623299264, 0.013612600403895047, 0.37171431656992227, -0.24282819748316942, -0.2740238707659668, 0.05354622791607031, -0.3447107699732378, -0.12064604127060688, 0.09470490417279825, -0.10168004109756, -0.01681089626416858, 0.07832946951231479, 0.09245577830363784, 0.04171001435800766, -0.27973159112566226, 0.30147871998416487, -0.05098218446303355, 0.16113932485479796, 0.13712571030931972, 0.05452721710561922, 0.01294749360654111, -0.0034258261919348386, 0.022406143552966808, -0.195525089397594, 0.0902761903738505, 0.21925635731027446, 0.11176246120189796, 0.29877954045016514, -0.34554816040148134, -0.1855098143252626, 0.1979164402000606, 0.11380548847087643, 0.047581701014566706, 0.05685767103045292, -0.22986439994756916, 0.1545014815168096, -0.0993663522794234, -0.13221323976636326, 0.04836481869253412, 0.1877361870811958, -0.057485149157225364, -0.28489916175277086, 0.04248405544683664, 0.12095403212955907, 0.01292628281149327, 0.006660275914902358, -0.13485009315129565, -0.10704925530508422, 0.06944621396005939, -0.02010506628951254, 0.1766438460051033, -0.002791620640333317, -0.12606356326866439, -0.11530238989712017, 0.41896444019910534, -0.035351642829482444, -0.12982351327592737, 0.12124160129838345, -0.1683829379423211, -0.177874997474678, 0.106265117230482, 0.022000954042213333, 0.10484321499570158, -0.07645269447382082, 0.15537929743081086, -0.11844237019683708, 0.10216300995824368, 0.10601667757554535, -0.04188785498978145, 0.0999556705764119, 0.10425471296950586, 0.15071525078740688, 0.14030866914739212, -0.028949468167858164, 0.025344730346676028, -0.32779526466242315, -0.15061492795173667, -0.2354675274870252, 0.09032734959557849, -0.13430519259431126, -0.13079777654881278, 0.34331405123597697, 0.12731146599215112, 0.24203316614914097, 0.07263987074634713, 0.20322215512574635, 0.09990231919494506, 0.044011245058898474, 0.16743966553915748, 0.1544955833677178, 0.18736975226886243, 0.03232838618650771, -0.1127960175610752, 0.0705370888820637, 0.13406829232872838]
|
1,803.07648
|
Identifying Relevant Information Cues for Vulnerability Assessment Using
CVSS
|
The assessment of new vulnerabilities is an activity that accounts for
information from several data sources and produces a `severity' score for the
vulnerability. The Common Vulnerability Scoring System (\CVSS) is the reference
standard for this assessment. Yet, no guidance currently exists on \emph{which
information} aids a correct assessment and should therefore be considered.
In this paper we address this problem by evaluating which information cues
increase (or decrease) assessment accuracy.
We devise a block design experiment with 67 software engineering students
with varying vulnerability information and measure scoring accuracy under
different information sets.
We find that baseline vulnerability descriptions provided by standard
vulnerability sources provide only part of the information needed to achieve an
accurate vulnerability assessment. Further, we find that additional information
on \texttt{assets}, \texttt{attacks}, and \texttt{vulnerability type}
contributes in increasing the accuracy of the assessment; conversely,
information on \texttt{known threats} misleads the assessor and decreases
assessment accuracy and should be avoided when assessing vulnerabilities. These
results go in the direction of formalizing the vulnerability communication to,
for example, fully automate security assessments.
|
cs.CR
|
the assessment of new vulnerabilities is an activity that accounts for information from several data sources and produces a severity score for the vulnerability the common vulnerability scoring system cvss is the reference standard for this assessment yet no guidance currently exists on emphwhich information aids a correct assessment and should therefore be considered in this paper we address this problem by evaluating which information cues increase or decrease assessment accuracy we devise a block design experiment with 67 software engineering students with varying vulnerability information and measure scoring accuracy under different information sets we find that baseline vulnerability descriptions provided by standard vulnerability sources provide only part of the information needed to achieve an accurate vulnerability assessment further we find that additional information on textttassets textttattacks and textttvulnerability type contributes in increasing the accuracy of the assessment conversely information on textttknown threats misleads the assessor and decreases assessment accuracy and should be avoided when assessing vulnerabilities these results go in the direction of formalizing the vulnerability communication to for example fully automate security assessments
|
[['the', 'assessment', 'of', 'new', 'vulnerabilities', 'is', 'an', 'activity', 'that', 'accounts', 'for', 'information', 'from', 'several', 'data', 'sources', 'and', 'produces', 'a', 'severity', 'score', 'for', 'the', 'vulnerability', 'the', 'common', 'vulnerability', 'scoring', 'system', 'cvss', 'is', 'the', 'reference', 'standard', 'for', 'this', 'assessment', 'yet', 'no', 'guidance', 'currently', 'exists', 'on', 'emphwhich', 'information', 'aids', 'a', 'correct', 'assessment', 'and', 'should', 'therefore', 'be', 'considered', 'in', 'this', 'paper', 'we', 'address', 'this', 'problem', 'by', 'evaluating', 'which', 'information', 'cues', 'increase', 'or', 'decrease', 'assessment', 'accuracy', 'we', 'devise', 'a', 'block', 'design', 'experiment', 'with', '67', 'software', 'engineering', 'students', 'with', 'varying', 'vulnerability', 'information', 'and', 'measure', 'scoring', 'accuracy', 'under', 'different', 'information', 'sets', 'we', 'find', 'that', 'baseline', 'vulnerability', 'descriptions', 'provided', 'by', 'standard', 'vulnerability', 'sources', 'provide', 'only', 'part', 'of', 'the', 'information', 'needed', 'to', 'achieve', 'an', 'accurate', 'vulnerability', 'assessment', 'further', 'we', 'find', 'that', 'additional', 'information', 'on', 'textttassets', 'textttattacks', 'and', 'textttvulnerability', 'type', 'contributes', 'in', 'increasing', 'the', 'accuracy', 'of', 'the', 'assessment', 'conversely', 'information', 'on', 'textttknown', 'threats', 'misleads', 'the', 'assessor', 'and', 'decreases', 'assessment', 'accuracy', 'and', 'should', 'be', 'avoided', 'when', 'assessing', 'vulnerabilities', 'these', 'results', 'go', 'in', 'the', 'direction', 'of', 'formalizing', 'the', 'vulnerability', 'communication', 'to', 'for', 'example', 'fully', 'automate', 'security', 'assessments']]
|
[-0.07671437021618818, -0.006677925872773973, -0.05155871266718296, 0.11788358440937693, -0.1071712406064548, -0.16604860838886132, 0.107577876489856, 0.3826645225505618, -0.1943995893549393, -0.3501460552736021, 0.14907327389365116, -0.32083116039250265, -0.16192710159812124, 0.17693559506990233, -0.16063062251162002, 0.04713502028642003, 0.1102120077210095, 0.04084594422584975, -0.043233261450522524, -0.26229216527632054, 0.29217000601210574, 0.10228256451869931, 0.34505502080599615, 0.1225316887950826, 0.0638229876243071, 0.00014056700473541722, -0.07980221051804941, 0.01597190997837221, -0.10928134356470443, 0.1215470618027372, 0.3382505789618282, 0.2294283009819029, 0.3780603954678073, -0.3710947853622629, -0.22156154447344734, 0.09542229450581705, 0.10429396601941655, 0.09103094121811035, -0.04886283242376521, -0.31392347752390537, 0.0855688642080435, -0.20925584149766055, -0.09577190757263451, -0.1284552253454047, -0.02639077487264705, -0.00942978864426122, -0.2802346661796465, 0.03479251835276099, 0.03554162062047159, 0.1489403248490656, -0.04021194613374331, -0.08507049636134659, 0.010417420575943062, 0.21041159760292538, 0.03668891484575237, 0.05024441381478134, 0.1812824625768425, -0.14842512342695366, -0.14079228940707467, 0.3467637205222512, -0.023357950641965382, -0.21260979934321605, 0.1479143260156407, -0.017707832039826933, -0.15595920342705485, 0.10528595493832493, 0.20977781832437306, 0.005109529110246941, -0.1984948947379427, -0.06480803455513738, 0.05963568003738628, 0.24645634790992035, 0.043561648338457895, 0.046143285897971294, 0.20306746754247476, 0.20936597518362654, 0.05672060193439179, 0.11798454057699179, -0.09333893939003568, -0.04871058046598645, -0.25864893390646426, -0.1670106997103122, -0.11881638580987997, 0.00417093208662289, -0.10488522260206724, -0.1460731095764512, 0.4059564154376002, 0.2579657080651754, 0.09504200178746353, 0.060381058973999806, 0.3594012638574521, 0.0339233189355582, 0.06508729672127897, 0.0833443876602413, 0.24019428024493047, -0.0267770870561328, 0.07140627459157259, -0.16359641659073532, 0.19493544795276488, -0.017374512635390547]
|
1,803.07649
|
An Online Algorithm for Power-proportional Data Centers with Switching
Cost
|
Recent studies have shown that power-proportional data centers can save
energy cost by dynamically "right-sizing" the data centers based on real-time
workload. More servers are activated when the workload increases while some
servers can be put into the sleep mode during periods of low load. In this
paper, we revisit the dynamic right-sizing problem for heterogeneous data
centers with various operational cost and switching cost. We propose a new
online algorithm based on a regularization technique, which achieves a better
competitive ratio compared to the state-of-the-art greedy algorithm. We further
introduce a switching cost offset into the model and extend our algorithm to
this new setting. Simulations based on real workload and renewable energy
traces show that our algorithms outperform the greedy algorithm in both
settings.
|
cs.NI
|
recent studies have shown that powerproportional data centers can save energy cost by dynamically rightsizing the data centers based on realtime workload more servers are activated when the workload increases while some servers can be put into the sleep mode during periods of low load in this paper we revisit the dynamic rightsizing problem for heterogeneous data centers with various operational cost and switching cost we propose a new online algorithm based on a regularization technique which achieves a better competitive ratio compared to the stateoftheart greedy algorithm we further introduce a switching cost offset into the model and extend our algorithm to this new setting simulations based on real workload and renewable energy traces show that our algorithms outperform the greedy algorithm in both settings
|
[['recent', 'studies', 'have', 'shown', 'that', 'powerproportional', 'data', 'centers', 'can', 'save', 'energy', 'cost', 'by', 'dynamically', 'rightsizing', 'the', 'data', 'centers', 'based', 'on', 'realtime', 'workload', 'more', 'servers', 'are', 'activated', 'when', 'the', 'workload', 'increases', 'while', 'some', 'servers', 'can', 'be', 'put', 'into', 'the', 'sleep', 'mode', 'during', 'periods', 'of', 'low', 'load', 'in', 'this', 'paper', 'we', 'revisit', 'the', 'dynamic', 'rightsizing', 'problem', 'for', 'heterogeneous', 'data', 'centers', 'with', 'various', 'operational', 'cost', 'and', 'switching', 'cost', 'we', 'propose', 'a', 'new', 'online', 'algorithm', 'based', 'on', 'a', 'regularization', 'technique', 'which', 'achieves', 'a', 'better', 'competitive', 'ratio', 'compared', 'to', 'the', 'stateoftheart', 'greedy', 'algorithm', 'we', 'further', 'introduce', 'a', 'switching', 'cost', 'offset', 'into', 'the', 'model', 'and', 'extend', 'our', 'algorithm', 'to', 'this', 'new', 'setting', 'simulations', 'based', 'on', 'real', 'workload', 'and', 'renewable', 'energy', 'traces', 'show', 'that', 'our', 'algorithms', 'outperform', 'the', 'greedy', 'algorithm', 'in', 'both', 'settings']]
|
[-0.11666939572617412, 0.04451816537603736, -0.10091104452311993, 0.048537954466417434, -0.07960325075872242, -0.1694856010749936, 0.15193872029613703, 0.45022915679216385, -0.24248735640197994, -0.3292415572702885, 0.10692620591260493, -0.2351883950543124, -0.14735859395936132, 0.23042713346891106, -0.1454748537912965, 0.07122994146775455, 0.13144706213846802, 0.004561575349420309, -0.0053037198539823294, -0.30962866068817674, 0.2583650558162481, 0.10152645904570817, 0.367083185762167, 0.030641314316540956, 0.08245859654899687, -0.00809733716212213, -0.002869250573217869, 0.02788254235126078, -0.06204664439952467, 0.13562167996075003, 0.2645744649618864, 0.17974322440102697, 0.33402643660828474, -0.47433122427761554, -0.19396960685402154, 0.1273214736096561, 0.1254324062820524, 0.07240314077865333, -0.05808116499858443, -0.2531376470327377, 0.10266775805130601, -0.18153382585942746, -0.0019028224553912878, -0.11496389578282833, -0.05102022426202893, 0.037922079435084015, -0.303893874425441, 0.03327677669748664, -0.021539978169836105, -0.003540129030123353, -0.08699494920112193, -0.13313803019560874, 0.0303400297453627, 0.08602339130663313, 0.033795814006589354, 0.02999884096905589, 0.1604987458884716, -0.06644727588491514, -0.19742057721316814, 0.3572595630586147, -0.017294784106314184, -0.15704415783286094, 0.16411988265626132, -0.026315722975879908, -0.17154752246220595, 0.12566550667956472, 0.2774171411991119, 0.10907782159745694, -0.15385049421957228, 0.0320744640219491, 0.003019754357635975, 0.18254917113482952, 0.020032946046441794, 0.018834475575946273, 0.09494423253834247, 0.25021515767090025, 0.1401574100572616, 0.18305580229591578, -0.07594180724956096, -0.11580136640742421, -0.17472549490630626, -0.1254006859473884, -0.18471777673787437, -0.027999384459108115, -0.1428289128706092, -0.08153218606184237, 0.3662107802554965, 0.20517139365524054, 0.21586134921014308, 0.14868749131879302, 0.3991820927262306, 0.10217598499916494, 0.08640419825911522, 0.18898912978172303, 0.14645491509069689, -0.026479813857004045, 0.16777266797656193, -0.24868481708317994, 0.07342843230185099, 0.01143830893561244]
|
1,803.0765
|
Quantifying resilience to recurrent ecosystem disturbances using
flow-kick dynamics
|
Shifting ecosystem disturbance patterns due to climate change (e.g. storms,
droughts, wildfires) or direct human interference (e.g. harvests, nutrient
loading) highlight the importance of quantifying and strengthening the
resilience of desired ecological regimes. Although existing metrics capture
resilience to isolated shocks, gradual parameter changes, and continuous noise,
quantifying resilience to repeated, discrete disturbances requires novel
analytical tools. Here we introduce a flow-kick framework that quantifies
resilience to disturbances explicitly in terms of their magnitude and
frequency. We present a resilience boundary between disturbances that cause
either escape from a basin of attraction or stabilization within it, and use
the resilience boundary to build resilience metrics tailored to repeated,
discrete disturbances. The flow-kick model suggests that the
distance-to-threshold resilience metric overestimates resilience in the context
of repeated disturbances. It also reveals counterintuitive triggers for regime
shifts, such as increasing recovery times between disturbances, or increasing
disturbance magnitude and recovery times proportionately.
|
q-bio.PE math.DS nlin.AO
|
shifting ecosystem disturbance patterns due to climate change eg storms droughts wildfires or direct human interference eg harvests nutrient loading highlight the importance of quantifying and strengthening the resilience of desired ecological regimes although existing metrics capture resilience to isolated shocks gradual parameter changes and continuous noise quantifying resilience to repeated discrete disturbances requires novel analytical tools here we introduce a flowkick framework that quantifies resilience to disturbances explicitly in terms of their magnitude and frequency we present a resilience boundary between disturbances that cause either escape from a basin of attraction or stabilization within it and use the resilience boundary to build resilience metrics tailored to repeated discrete disturbances the flowkick model suggests that the distancetothreshold resilience metric overestimates resilience in the context of repeated disturbances it also reveals counterintuitive triggers for regime shifts such as increasing recovery times between disturbances or increasing disturbance magnitude and recovery times proportionately
|
[['shifting', 'ecosystem', 'disturbance', 'patterns', 'due', 'to', 'climate', 'change', 'eg', 'storms', 'droughts', 'wildfires', 'or', 'direct', 'human', 'interference', 'eg', 'harvests', 'nutrient', 'loading', 'highlight', 'the', 'importance', 'of', 'quantifying', 'and', 'strengthening', 'the', 'resilience', 'of', 'desired', 'ecological', 'regimes', 'although', 'existing', 'metrics', 'capture', 'resilience', 'to', 'isolated', 'shocks', 'gradual', 'parameter', 'changes', 'and', 'continuous', 'noise', 'quantifying', 'resilience', 'to', 'repeated', 'discrete', 'disturbances', 'requires', 'novel', 'analytical', 'tools', 'here', 'we', 'introduce', 'a', 'flowkick', 'framework', 'that', 'quantifies', 'resilience', 'to', 'disturbances', 'explicitly', 'in', 'terms', 'of', 'their', 'magnitude', 'and', 'frequency', 'we', 'present', 'a', 'resilience', 'boundary', 'between', 'disturbances', 'that', 'cause', 'either', 'escape', 'from', 'a', 'basin', 'of', 'attraction', 'or', 'stabilization', 'within', 'it', 'and', 'use', 'the', 'resilience', 'boundary', 'to', 'build', 'resilience', 'metrics', 'tailored', 'to', 'repeated', 'discrete', 'disturbances', 'the', 'flowkick', 'model', 'suggests', 'that', 'the', 'distancetothreshold', 'resilience', 'metric', 'overestimates', 'resilience', 'in', 'the', 'context', 'of', 'repeated', 'disturbances', 'it', 'also', 'reveals', 'counterintuitive', 'triggers', 'for', 'regime', 'shifts', 'such', 'as', 'increasing', 'recovery', 'times', 'between', 'disturbances', 'or', 'increasing', 'disturbance', 'magnitude', 'and', 'recovery', 'times', 'proportionately']]
|
[-0.18036239567162418, 0.13526130504367365, -0.02933989802211825, 0.08902844494976406, -0.026951507816242205, -0.10813245249320627, 0.09128437689631372, 0.35037856568532016, -0.2798631599273633, -0.31013178032495686, 0.10692513752823092, -0.2605038518463639, -0.21665644086110783, 0.1329364543033424, -0.18258906498935223, 0.05364557956597088, 0.05928517247839655, -0.03871793692736458, -0.0072145849463177494, -0.1619724218805975, 0.26101429231238327, 0.10602897028100514, 0.30325059529482007, 0.04558146867045277, 0.06750750380672037, -0.025759050200675218, -0.03783144431921805, 0.05572942490264698, -0.09925613906843127, 0.06557498538023611, 0.24842787932956945, 0.1606758945193645, 0.36219423322158084, -0.46862553275265806, -0.3011802420164836, 0.14919740826401204, 0.09341085601870971, 0.07814903119799203, -0.0048917623858574805, -0.3282772056055192, 0.035323875956237316, -0.1954181434813182, -0.14834050419016717, -0.07620709103562026, 0.050460756498363776, 0.046800550526461086, -0.2910385481396539, 0.12210052244414771, 0.07842803549185093, 0.10471685577460842, -0.06522631279910235, -0.016563064790003607, -0.06356330042881136, 0.17612578607371984, 0.10498437255768836, -0.006013778839858148, 0.23973679029684816, -0.10123501922321707, -0.10967757824117733, 0.35524303784493255, -0.03570574806636196, -0.17031044232961093, 0.23742603022932401, -0.09431632751727954, -0.07896311171164082, 0.15781880630734, 0.24054843337413528, -0.024251616707801616, -0.09820173600471478, -0.03320105494247007, 0.09898240646076817, 0.18514486129169125, 0.12164837845154358, 0.07702950624799407, 0.14462825257922649, 0.15750257595838676, 0.1783892285740286, 0.1471392889507115, -0.07610473694827256, -0.10673871433765099, -0.2279932519320298, -0.05433245853369904, -0.08808409793591881, 0.022404566520472634, -0.13669923255450134, -0.20416766779601095, 0.4107665775620655, 0.21551239107911652, 0.1572921321400114, 0.05644527100643294, 0.3351658792801302, 0.07230575039402293, 0.004330842275915013, 0.08643879103348465, 0.2396792547110267, 0.08932473039808306, 0.09237083691530987, -0.2551556837483863, 0.20911608115027383, -0.009558446581060117]
|
1,803.07651
|
Distributed Model Predictive Control for Linear Systems with Adaptive
Terminal Sets
|
In this paper, we propose a distributed model predictive control (DMPC)
scheme for linear time-invariant constrained systems which admit a separable
structure. To exploit the merits of distributed computation algorithms, the
stabilizing terminal controller, value function and invariant terminal set of
the DMPC optimization problem need to respect the loosely coupled structure of
the system. Although existing methods in the literature address this task, they
typically decouple the synthesis of terminal controllers and value functions
from the one of terminal sets. In addition, these approaches do not explicitly
consider the effect of the current state of the system in the synthesis
process. These limitations can lead the resulting DMPC scheme to poor
performance since it may admit small or even empty terminal sets. Unlike other
approaches, this paper presents a unified framework to encapsulate the
synthesis of both the stabilizing terminal controller and invariant terminal
set into the DMPC formulation. Conditions for Lyapunov stability and invariance
are imposed in the synthesis problem in a way that allows the value function
and invariant terminal set to admit the desired distributed structure. We
illustrate the effectiveness of the proposed method on several examples
including a benchmark spring-mass-damper problem.
|
math.OC cs.MA cs.SY
|
in this paper we propose a distributed model predictive control dmpc scheme for linear timeinvariant constrained systems which admit a separable structure to exploit the merits of distributed computation algorithms the stabilizing terminal controller value function and invariant terminal set of the dmpc optimization problem need to respect the loosely coupled structure of the system although existing methods in the literature address this task they typically decouple the synthesis of terminal controllers and value functions from the one of terminal sets in addition these approaches do not explicitly consider the effect of the current state of the system in the synthesis process these limitations can lead the resulting dmpc scheme to poor performance since it may admit small or even empty terminal sets unlike other approaches this paper presents a unified framework to encapsulate the synthesis of both the stabilizing terminal controller and invariant terminal set into the dmpc formulation conditions for lyapunov stability and invariance are imposed in the synthesis problem in a way that allows the value function and invariant terminal set to admit the desired distributed structure we illustrate the effectiveness of the proposed method on several examples including a benchmark springmassdamper problem
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'distributed', 'model', 'predictive', 'control', 'dmpc', 'scheme', 'for', 'linear', 'timeinvariant', 'constrained', 'systems', 'which', 'admit', 'a', 'separable', 'structure', 'to', 'exploit', 'the', 'merits', 'of', 'distributed', 'computation', 'algorithms', 'the', 'stabilizing', 'terminal', 'controller', 'value', 'function', 'and', 'invariant', 'terminal', 'set', 'of', 'the', 'dmpc', 'optimization', 'problem', 'need', 'to', 'respect', 'the', 'loosely', 'coupled', 'structure', 'of', 'the', 'system', 'although', 'existing', 'methods', 'in', 'the', 'literature', 'address', 'this', 'task', 'they', 'typically', 'decouple', 'the', 'synthesis', 'of', 'terminal', 'controllers', 'and', 'value', 'functions', 'from', 'the', 'one', 'of', 'terminal', 'sets', 'in', 'addition', 'these', 'approaches', 'do', 'not', 'explicitly', 'consider', 'the', 'effect', 'of', 'the', 'current', 'state', 'of', 'the', 'system', 'in', 'the', 'synthesis', 'process', 'these', 'limitations', 'can', 'lead', 'the', 'resulting', 'dmpc', 'scheme', 'to', 'poor', 'performance', 'since', 'it', 'may', 'admit', 'small', 'or', 'even', 'empty', 'terminal', 'sets', 'unlike', 'other', 'approaches', 'this', 'paper', 'presents', 'a', 'unified', 'framework', 'to', 'encapsulate', 'the', 'synthesis', 'of', 'both', 'the', 'stabilizing', 'terminal', 'controller', 'and', 'invariant', 'terminal', 'set', 'into', 'the', 'dmpc', 'formulation', 'conditions', 'for', 'lyapunov', 'stability', 'and', 'invariance', 'are', 'imposed', 'in', 'the', 'synthesis', 'problem', 'in', 'a', 'way', 'that', 'allows', 'the', 'value', 'function', 'and', 'invariant', 'terminal', 'set', 'to', 'admit', 'the', 'desired', 'distributed', 'structure', 'we', 'illustrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'on', 'several', 'examples', 'including', 'a', 'benchmark', 'springmassdamper', 'problem']]
|
[-0.13751395492415344, -0.005442885971837202, -0.07764719857249827, 0.004502697184678403, -0.07051549075356665, -0.17132892077598644, 0.04812132993983865, 0.37626260304728487, -0.33299960392736355, -0.3162165688560463, 0.12243770693385159, -0.2115951714009238, -0.14449261923496404, 0.1787223757478665, -0.1117431158982443, 0.12044169377221974, 0.06052558455017528, 0.010920188451489928, -0.07264852837234147, -0.24237016898791344, 0.33118659609451184, -0.005391949260303256, 0.3274383086815704, 0.002279326797234921, 0.16393173506901582, -0.032059094035651714, 0.030810666542585786, 0.05711978947392152, -0.09982649111136234, 0.14680902398433726, 0.2360522442269234, 0.14931102012217576, 0.30612026618161636, -0.42273089882670617, -0.18939150445168002, 0.10801407713823173, 0.12925096788819004, 0.11478457307117534, -0.04022766940345589, -0.2292994704639197, 0.11295992711901057, -0.1729757243254203, -0.09283273906223666, -0.07723825071387146, -0.05108565762781595, 0.016222083898337215, -0.29321077974882614, 0.04122671371590755, 0.04911661259378591, -0.0007115363841876388, -0.10528626908192991, -0.11878699539775713, -0.02124985505479901, 0.12642776770208372, 0.003956919545943288, -0.011948536341411195, 0.14198112062995835, -0.09757278455487851, -0.13083888687833678, 0.36767579287727725, -0.01778513746459645, -0.2737338734732475, 0.19725393324945484, -0.0551129246501214, -0.151434740938997, 0.12311360552225128, 0.2187392352165521, 0.16132262918613471, -0.16928440563906963, 0.10140943288540571, -0.03864639473850934, 0.1575836461151437, 0.009794345004389025, 0.044494720562007775, 0.16678783487842172, 0.17624100688987468, 0.13616735908103042, 0.1414250075352041, -0.014925395840617391, -0.15418981067237578, -0.29516629229907937, -0.10250489778902229, -0.10715938850997339, -0.002953697722901148, -0.043259593367927625, -0.17605724600999026, 0.40490817106981514, 0.16916174867264072, 0.18330907454115472, 0.08601421187334808, 0.333066231932263, 0.1166562835328199, 0.04824722345861397, 0.08787196406789305, 0.20187289320640456, 0.07269355311410083, 0.08298760050471471, -0.2588817965541016, 0.10810174638814084, 0.04329227761137394]
|
1,803.07652
|
ALLEGRO Core Degradation Study using MELCOR 2.1
|
ALLEGRO is an experimental high-temperature gas (He)-cooled fast reactor
(GFR) under development by the European Consortium V4G4 Centre of Excellence on
basis of the concept ALLEGRO presented by CEA in 2009. Its main purpose is to
demonstrate the viability of GFR in pilot scale and simultaneously serve as a
test bed for GFR-related technologies, above all the high-temperature resistant
refractory fuel in the conventional oxide fuel driver core. Severe accident
studies of the concept with the first core (oxide fuel in stainless steel
claddings) are an important part of safety analyses leading to improves in
reactor design and safety. This paper extends our previous study using the
MELCOR code. Major difference between the previous and this work is decrease of
thermal power and power density to 50 MWth and 66,6 MWth/m3 respectively.
Analyses are focused on protected scenarios based on total station blackout
individually aggravated by loss of primary coolant, water ingress into primary
coolant or malfunction of check valves in the decay heat removal system. The
results indicate the timing and extent of core degradation and provide valuable
data for design of the core catcher in ALLEGRO.
|
physics.ins-det
|
allegro is an experimental hightemperature gas hecooled fast reactor gfr under development by the european consortium v4g4 centre of excellence on basis of the concept allegro presented by cea in 2009 its main purpose is to demonstrate the viability of gfr in pilot scale and simultaneously serve as a test bed for gfrrelated technologies above all the hightemperature resistant refractory fuel in the conventional oxide fuel driver core severe accident studies of the concept with the first core oxide fuel in stainless steel claddings are an important part of safety analyses leading to improves in reactor design and safety this paper extends our previous study using the melcor code major difference between the previous and this work is decrease of thermal power and power density to 50 mwth and 666 mwthm3 respectively analyses are focused on protected scenarios based on total station blackout individually aggravated by loss of primary coolant water ingress into primary coolant or malfunction of check valves in the decay heat removal system the results indicate the timing and extent of core degradation and provide valuable data for design of the core catcher in allegro
|
[['allegro', 'is', 'an', 'experimental', 'hightemperature', 'gas', 'hecooled', 'fast', 'reactor', 'gfr', 'under', 'development', 'by', 'the', 'european', 'consortium', 'v4g4', 'centre', 'of', 'excellence', 'on', 'basis', 'of', 'the', 'concept', 'allegro', 'presented', 'by', 'cea', 'in', '2009', 'its', 'main', 'purpose', 'is', 'to', 'demonstrate', 'the', 'viability', 'of', 'gfr', 'in', 'pilot', 'scale', 'and', 'simultaneously', 'serve', 'as', 'a', 'test', 'bed', 'for', 'gfrrelated', 'technologies', 'above', 'all', 'the', 'hightemperature', 'resistant', 'refractory', 'fuel', 'in', 'the', 'conventional', 'oxide', 'fuel', 'driver', 'core', 'severe', 'accident', 'studies', 'of', 'the', 'concept', 'with', 'the', 'first', 'core', 'oxide', 'fuel', 'in', 'stainless', 'steel', 'claddings', 'are', 'an', 'important', 'part', 'of', 'safety', 'analyses', 'leading', 'to', 'improves', 'in', 'reactor', 'design', 'and', 'safety', 'this', 'paper', 'extends', 'our', 'previous', 'study', 'using', 'the', 'melcor', 'code', 'major', 'difference', 'between', 'the', 'previous', 'and', 'this', 'work', 'is', 'decrease', 'of', 'thermal', 'power', 'and', 'power', 'density', 'to', '50', 'mwth', 'and', '666', 'mwthm3', 'respectively', 'analyses', 'are', 'focused', 'on', 'protected', 'scenarios', 'based', 'on', 'total', 'station', 'blackout', 'individually', 'aggravated', 'by', 'loss', 'of', 'primary', 'coolant', 'water', 'ingress', 'into', 'primary', 'coolant', 'or', 'malfunction', 'of', 'check', 'valves', 'in', 'the', 'decay', 'heat', 'removal', 'system', 'the', 'results', 'indicate', 'the', 'timing', 'and', 'extent', 'of', 'core', 'degradation', 'and', 'provide', 'valuable', 'data', 'for', 'design', 'of', 'the', 'core', 'catcher', 'in', 'allegro']]
|
[-0.08124815545506663, 0.10131026100214433, -0.02691046401709932, -0.012124089597709027, -0.017883145861880303, -0.10106463006385448, 0.06895915709325921, 0.34343139834415454, -0.1980156742502004, -0.31450820061030216, 0.15721531207916317, -0.2893090088861984, -0.07632102541354291, 0.220242281591489, -0.10257875031259443, 0.07733355975769982, 0.06578704483735447, -0.037594856540666084, -0.0015722085813899616, -0.2089561211549073, 0.26458198014790046, 0.1718039363417979, 0.33274749214479515, 0.11330427541646973, 0.03623144776153552, -0.04792756304160211, -0.04789907570575251, -0.07300720019982411, -0.07255530362350068, 0.08590544789394998, 0.2673074698707621, 0.15686112506171832, 0.27081856163152096, -0.4840901359240269, -0.22069284095746147, 0.05198048309686563, 0.06807830630914195, 0.014135621508562958, -0.08095623799382227, -0.23343974141695711, 0.09036455697451647, -0.23167211761964218, -0.13883410989956746, -0.004870670196436509, 0.0006681244275379148, 0.039346568702187924, -0.2377076331004091, 0.04686738867415013, 0.04208473511971533, 0.07348235504660797, -0.0857690335539231, -0.16617819189751562, -0.012286151435666278, 0.135186123755085, 0.04617991742734275, 0.008736424108424767, 0.19896980644341886, -0.08012156924335184, -0.06340209593366995, 0.37249425321735524, -0.03664789421376414, -0.08803931497303503, 0.1796787264923166, -0.11449846115787156, -0.13123307426352626, 0.1261017671146604, 0.19347045053619186, 0.06652122964258345, -0.17484460366316712, -0.018729576131950674, 0.005388726149608923, 0.18396496935875492, 0.08165891378718827, -0.015590161819440814, 0.23625452066311142, 0.28592753568459506, 0.0581474258707693, 0.16532462965383624, -0.11364453133825049, -0.0423219755169127, -0.26030987417382945, -0.17279059920142723, -0.12020330193035489, 0.006365392111487441, -0.0289337397995181, -0.10450166236138442, 0.3619710816950588, 0.1318939165596001, 0.11610311221658856, -0.032409011102332685, 0.34344025792369803, 0.017400367368411804, 0.09276399104395411, 0.054287329339166426, 0.2579565260426274, 0.10728450417953574, 0.12765449162951292, -0.2637148177747584, 0.11590472870611247, 0.008574093550003574]
|
1,803.07653
|
The Webster scalar curvature and sharp upper and lower bounds for the
first positive eigenvalue of the Kohn-Laplacian on real hypersurfaces
|
Let $(M,\theta)$ be a compact strictly pseudoconvex pseudohermitian manifold
which is CR embedded into a complex space. In an earlier paper, Lin and the
authors gave several sharp upper bounds for the first positive eigenvalue
$\lambda_1$ of the Kohn-Laplacian $\Box_b$ on $(M,\theta)$. In the present
paper, we give a sharp upper bound for $\lambda_1$, generalizing and extending
some previous results. As a corollary, we obtain a Reilly-type estimate when
$M$ is embedded into the standard sphere. In another direction, using a
Lichnerowicz-type estimate by Chanillo, Chiu, and Yang and an explicit formula
for the Webster scalar curvature, we give a lower bound for $\lambda_1$ when
the pseudohermitian structure $\theta$ is volume-normalized.
|
math.CV
|
let mtheta be a compact strictly pseudoconvex pseudohermitian manifold which is cr embedded into a complex space in an earlier paper lin and the authors gave several sharp upper bounds for the first positive eigenvalue lambda_1 of the kohnlaplacian box_b on mtheta in the present paper we give a sharp upper bound for lambda_1 generalizing and extending some previous results as a corollary we obtain a reillytype estimate when m is embedded into the standard sphere in another direction using a lichnerowicztype estimate by chanillo chiu and yang and an explicit formula for the webster scalar curvature we give a lower bound for lambda_1 when the pseudohermitian structure theta is volumenormalized
|
[['let', 'mtheta', 'be', 'a', 'compact', 'strictly', 'pseudoconvex', 'pseudohermitian', 'manifold', 'which', 'is', 'cr', 'embedded', 'into', 'a', 'complex', 'space', 'in', 'an', 'earlier', 'paper', 'lin', 'and', 'the', 'authors', 'gave', 'several', 'sharp', 'upper', 'bounds', 'for', 'the', 'first', 'positive', 'eigenvalue', 'lambda_1', 'of', 'the', 'kohnlaplacian', 'box_b', 'on', 'mtheta', 'in', 'the', 'present', 'paper', 'we', 'give', 'a', 'sharp', 'upper', 'bound', 'for', 'lambda_1', 'generalizing', 'and', 'extending', 'some', 'previous', 'results', 'as', 'a', 'corollary', 'we', 'obtain', 'a', 'reillytype', 'estimate', 'when', 'm', 'is', 'embedded', 'into', 'the', 'standard', 'sphere', 'in', 'another', 'direction', 'using', 'a', 'lichnerowicztype', 'estimate', 'by', 'chanillo', 'chiu', 'and', 'yang', 'and', 'an', 'explicit', 'formula', 'for', 'the', 'webster', 'scalar', 'curvature', 'we', 'give', 'a', 'lower', 'bound', 'for', 'lambda_1', 'when', 'the', 'pseudohermitian', 'structure', 'theta', 'is', 'volumenormalized']]
|
[-0.1620098961609508, 0.08003709055425658, -0.07674449040378267, 0.0603386134167227, -0.11267961685017154, -0.16656356417733403, -0.005216108291065908, 0.2942069534648646, -0.16622408204250508, -0.2523232696762493, 0.11426696570082526, -0.26755489980768377, -0.15385592820831817, 0.21660373374811365, -0.07550647348870297, -0.030938970785051048, 0.017019263218547142, 0.08776592150716497, -0.08280555216012406, -0.2266474447720726, 0.360077555486429, -7.44298612279398e-05, 0.14828982189935339, 0.14134093121466068, 0.044375751599635894, -0.02953649673879415, 0.0401045992123047, -0.02935172788204147, -0.25682129369847273, 0.1640223929142529, 0.21198248661643415, 0.07724763097258301, 0.239109687219785, -0.36320828466869154, -0.17752723250672356, 0.15727662188546346, 0.17129488848149776, 0.0032379788143123995, -0.05117688279049387, -0.3227643525513174, 0.09895650729083934, -0.08508520852774382, -0.14987838188152727, -0.04101150697684503, 0.03975734846909774, -0.04898027038051713, -0.3185990215053673, 0.06845912067135712, 0.1654005742522779, 0.03692070315413697, -0.10208197014809058, -0.18067188259331626, 0.008795282442693238, 0.06446627440058987, -0.022638569529344503, 0.106538146093429, 0.027767478681362427, -0.014012654118978226, -0.07148029547507732, 0.2736122308483532, -0.12653829458878618, -0.2646502427093953, 0.07416184882524314, -0.12376921639047764, -0.15478591391447563, 0.09176681790530246, 0.13894380999913625, 0.16834347711053785, -0.06921063008301824, 0.20534164843837488, -0.12226224906725792, 0.09582709303746621, 0.10894647187779884, -0.029731419330215298, 0.07188993819091502, 0.08839215393134116, 0.18093513573209444, 0.1627645006619377, -0.0041924749421341735, -0.017408001208300324, -0.33079332854758176, -0.23415407523835866, -0.20704933145998028, 0.15962967811034875, -0.12612226949784452, -0.14005122911751372, 0.334605986650966, 0.003974071767827211, 0.2565692251145437, 0.1477954715903563, 0.2511928443637517, 0.12705012891170997, -0.03553215489798301, 0.14930714865273856, 0.19475929314183565, 0.21680432132042543, 0.05627219045853561, -0.11191972343435695, -0.018561497190128173, 0.19065061295488933]
|
1,803.07654
|
Fermi-LAT observations of the 2017 September 10$^{th}$ solar flare
|
The Fermi-Large Area Telescope (LAT) detection of the X8.2 GOES class solar
flare of 2017 September 10 provides for the first time observations of a long
duration high-energy gamma-ray flare associated with a Ground Level Enhancement
(GLE). The >100 MeV emission from this flare lasted for more than 12 hours
covering both the impulsive and extended phase. We present the localization of
the gamma-ray emission and find that it is consistent with the active region
(AR) from which the flare occurred over a period lasting more than 6 hours
contrary to what was found for the 2012 March 7 flares. The temporal variation
of the proton index inferred from the gamma-ray data seems to suggest two
phases in acceleration of the proton population. Based on timing arguments we
interpret the second phase to be tied to the acceleration mechanism powering
the GLE, believed to be particle acceleration at a coronal shock driven by the
CME.
|
astro-ph.HE astro-ph.SR
|
the fermilarge area telescope lat detection of the x82 goes class solar flare of 2017 september 10 provides for the first time observations of a long duration highenergy gammaray flare associated with a ground level enhancement gle the 100 mev emission from this flare lasted for more than 12 hours covering both the impulsive and extended phase we present the localization of the gammaray emission and find that it is consistent with the active region ar from which the flare occurred over a period lasting more than 6 hours contrary to what was found for the 2012 march 7 flares the temporal variation of the proton index inferred from the gammaray data seems to suggest two phases in acceleration of the proton population based on timing arguments we interpret the second phase to be tied to the acceleration mechanism powering the gle believed to be particle acceleration at a coronal shock driven by the cme
|
[['the', 'fermilarge', 'area', 'telescope', 'lat', 'detection', 'of', 'the', 'x82', 'goes', 'class', 'solar', 'flare', 'of', '2017', 'september', '10', 'provides', 'for', 'the', 'first', 'time', 'observations', 'of', 'a', 'long', 'duration', 'highenergy', 'gammaray', 'flare', 'associated', 'with', 'a', 'ground', 'level', 'enhancement', 'gle', 'the', '100', 'mev', 'emission', 'from', 'this', 'flare', 'lasted', 'for', 'more', 'than', '12', 'hours', 'covering', 'both', 'the', 'impulsive', 'and', 'extended', 'phase', 'we', 'present', 'the', 'localization', 'of', 'the', 'gammaray', 'emission', 'and', 'find', 'that', 'it', 'is', 'consistent', 'with', 'the', 'active', 'region', 'ar', 'from', 'which', 'the', 'flare', 'occurred', 'over', 'a', 'period', 'lasting', 'more', 'than', '6', 'hours', 'contrary', 'to', 'what', 'was', 'found', 'for', 'the', '2012', 'march', '7', 'flares', 'the', 'temporal', 'variation', 'of', 'the', 'proton', 'index', 'inferred', 'from', 'the', 'gammaray', 'data', 'seems', 'to', 'suggest', 'two', 'phases', 'in', 'acceleration', 'of', 'the', 'proton', 'population', 'based', 'on', 'timing', 'arguments', 'we', 'interpret', 'the', 'second', 'phase', 'to', 'be', 'tied', 'to', 'the', 'acceleration', 'mechanism', 'powering', 'the', 'gle', 'believed', 'to', 'be', 'particle', 'acceleration', 'at', 'a', 'coronal', 'shock', 'driven', 'by', 'the', 'cme']]
|
[-0.05453187656033063, 0.20589804980423182, -0.03715169559863787, 0.16237440333972053, -0.07552139267509413, -0.0844350231142955, 0.04169752623194889, 0.41595576801487516, -0.16715300628434746, -0.4073093574013441, 0.07672515652788382, -0.2824921211167689, -0.05692162669053481, 0.2559800558644647, -0.021182171512402655, -0.036785586622934185, 0.10393374185828913, 0.005530498884317856, -0.04615601635868511, -0.2079784194788625, 0.21237310181942678, 0.1582075196303307, 0.19476410942152142, 0.016493639060025735, 0.09225695390149109, -0.08540067660412, -0.04327185924048536, -0.07525528642018475, -0.07432978354838504, 0.0641219450521373, 0.18160291141079318, 0.10463250339511902, 0.21284701395178995, -0.4084055506924708, -0.26282460583494077, 0.05853279747694145, 0.1018336186726247, -0.028333527021740953, 0.004648822652468939, -0.31703321022251923, 0.01923730400007879, -0.1940077055966662, -0.13513911312085486, 0.11660038004629314, 0.0871591942835479, -0.006798075609690239, -0.21853154031860253, 0.1062577648291124, 0.015158523900073863, 0.07002456050155864, -0.11672723477278205, -0.016859779485140836, 0.0074112362881761885, 0.07726874629996958, 0.11302377779126889, 0.10747836973431761, 0.13088248785765422, -0.07092037796523543, -0.1409314260757979, 0.35893171667421775, -0.020340196939463158, 0.06996056599121901, 0.16386539878684186, -0.2329843567046825, -0.18268022764053557, 0.2869002106787276, 0.1356042382968289, 0.0754667233840953, -0.13321939628691443, -0.025885795177084454, 0.028297636950869235, 0.24195301149400972, 0.06597570179691238, -0.02024070645134235, 0.2352437487007269, 0.17072464069576873, 0.05564059925626122, 0.13016988981905725, -0.3079449410929585, -0.055526266667631365, -0.31267484315941413, -0.10321513864947783, -0.1229815867954805, 0.1049656848017607, -0.05951398066113583, -0.1174945835504801, 0.4668881453859109, 0.13734767737182518, 0.19219942151178276, 0.005379894568825201, 0.21330862103270426, 0.11204068553784201, 0.059369137489345795, 0.1669587537819039, 0.3497030705303675, 0.1023395165966283, 0.20991107542593512, -0.1801973223868352, 0.07368800732637605, 0.045932296777684845]
|
1,803.07655
|
On Multi-Server Coded Caching in the Low Memory Regime
|
In this paper we determine the delivery time for a multi-server coded caching
problem when the cache size of each user is small. We propose an achievable
scheme based on coded cache content placement, and employ zero-forcing
techniques at the content delivery phase. Surprisingly, in contrast to previous
multi-server results which were proved to be order-optimal within a
multiplicative factor of 2, for the low memory regime we prove that our
achievable scheme is optimal. Moreover, we compare the performance of our
scheme with the uncoded solution, and show our proposal improvement over the
uncoded scheme. Our results also apply to Degrees-of-Freedom (DoF) analysis of
Multiple-Input Single-Output Broadcast Channels (MISO-BC) with cache-enabled
users, where the multiple-antenna transmitter replaces the role of multiple
servers. This shows that interference management in the low memory regime needs
different caching techniques compared with medium-high memory regimes discussed
in previous works.
|
cs.IT cs.NI math.IT
|
in this paper we determine the delivery time for a multiserver coded caching problem when the cache size of each user is small we propose an achievable scheme based on coded cache content placement and employ zeroforcing techniques at the content delivery phase surprisingly in contrast to previous multiserver results which were proved to be orderoptimal within a multiplicative factor of 2 for the low memory regime we prove that our achievable scheme is optimal moreover we compare the performance of our scheme with the uncoded solution and show our proposal improvement over the uncoded scheme our results also apply to degreesoffreedom dof analysis of multipleinput singleoutput broadcast channels misobc with cacheenabled users where the multipleantenna transmitter replaces the role of multiple servers this shows that interference management in the low memory regime needs different caching techniques compared with mediumhigh memory regimes discussed in previous works
|
[['in', 'this', 'paper', 'we', 'determine', 'the', 'delivery', 'time', 'for', 'a', 'multiserver', 'coded', 'caching', 'problem', 'when', 'the', 'cache', 'size', 'of', 'each', 'user', 'is', 'small', 'we', 'propose', 'an', 'achievable', 'scheme', 'based', 'on', 'coded', 'cache', 'content', 'placement', 'and', 'employ', 'zeroforcing', 'techniques', 'at', 'the', 'content', 'delivery', 'phase', 'surprisingly', 'in', 'contrast', 'to', 'previous', 'multiserver', 'results', 'which', 'were', 'proved', 'to', 'be', 'orderoptimal', 'within', 'a', 'multiplicative', 'factor', 'of', '2', 'for', 'the', 'low', 'memory', 'regime', 'we', 'prove', 'that', 'our', 'achievable', 'scheme', 'is', 'optimal', 'moreover', 'we', 'compare', 'the', 'performance', 'of', 'our', 'scheme', 'with', 'the', 'uncoded', 'solution', 'and', 'show', 'our', 'proposal', 'improvement', 'over', 'the', 'uncoded', 'scheme', 'our', 'results', 'also', 'apply', 'to', 'degreesoffreedom', 'dof', 'analysis', 'of', 'multipleinput', 'singleoutput', 'broadcast', 'channels', 'misobc', 'with', 'cacheenabled', 'users', 'where', 'the', 'multipleantenna', 'transmitter', 'replaces', 'the', 'role', 'of', 'multiple', 'servers', 'this', 'shows', 'that', 'interference', 'management', 'in', 'the', 'low', 'memory', 'regime', 'needs', 'different', 'caching', 'techniques', 'compared', 'with', 'mediumhigh', 'memory', 'regimes', 'discussed', 'in', 'previous', 'works']]
|
[-0.24836792765593488, -0.0005098397751643373, -0.03400674963382724, -0.0196817026294972, -0.02325860534679808, -0.2553363704690327, 0.16672788578012243, 0.40010127638887666, -0.23197762853121512, -0.2644065172149966, 0.08124730482455088, -0.2472304215220964, -0.17409245679410149, 0.13138726951988183, -0.1630951758324207, 0.05510183136068182, 0.028773050742953048, 0.023202212482741843, -0.035776793475148, -0.3658924381159348, 0.2909652958735696, 0.11552742126793282, 0.3959039494089068, 0.037855938855201415, 0.0705060518796441, 0.011701538935558845, -0.03573688002277727, -0.05495192839649238, -0.12398761977198014, 0.0374524687561972, 0.35429615134449854, 0.17408292545228943, 0.2448718343057657, -0.3992399103454735, -0.24901138188649122, 0.02399570864229782, 0.20787222161873128, 0.08614085992074201, -0.07060604699335558, -0.24333795022270452, 0.16393494698432695, -0.259201505502099, -0.006589641807320183, 0.00393103966840275, -0.08919760155848751, 0.0395451092913951, -0.3839807489772059, 0.0059797060913135205, 0.0034842962424640788, -0.006480930079642224, -0.05838426476510318, -0.13712849695401344, 0.10369028428996824, 0.1378761110215349, 0.01755345343892807, -0.003010301034234158, 0.07702869744269714, -0.06739008759327028, -0.1353429375050513, 0.3655536162510693, -0.028009660105055123, -0.22547473695945658, 0.12539719950171724, -0.08724763296857119, -0.12286602649662312, 0.15262247730733838, 0.23308241007568903, 0.11659868830362054, -0.14109563808587192, 0.03485239766759811, -0.06192818472332525, 0.2254604026133016, 0.1000706558514463, 0.17480501134828855, 0.04663362555773546, 0.2537717763031514, 0.1346525638970253, 0.17259808723760564, -0.11933631126367016, -0.15730439710800778, -0.2051179208063157, -0.12719098338857293, -0.19110150359832515, -0.01718747518296443, -0.1471494915191489, -0.01566998867879379, 0.31228077528575254, 0.1790867991428918, 0.11244606664914587, 0.1570673303635574, 0.43129482186616286, 0.0888275098636083, 0.055353784786971054, 0.20218685639971126, 0.16156551205674313, 0.04828784078015142, 0.17573932010587942, -0.23981068281246323, 0.061035429800490607, -0.0033756052733922045]
|
1,803.07656
|
The puzzling two-proton decay of $^{67}$Kr
|
Two-proton (2$p$) radioactivity is a rare decay mode found in a few
proton-unbound nuclei. The $2p$-decay lifetime and properties of emitted
protons carry invaluable information on nuclear structure in the presence of
low-lying proton continuum. The recently measured $2p$ decay of $^{67}$Kr
[Phys. Rev. Lett. 117, 162501 (2016)] turned out to be unexpectedly fast. Since
$^{67}$Kr is expected to be a deformed system, we investigate the impact of
deformation effects on the $2p$ radioactivity. We apply the recently developed
Gamow coupled-channel framework, which allows for a precise description of
three-body systems in the presence of rotational and vibrational couplings.
This is the first application of a three-body approach to a two-nucleon decay
from a deformed nucleus. We show that deformation couplings significantly
increase the $2p$ decay width of $^{67}$Kr; this finding explains the puzzling
experimental data. The calculated angular proton-proton correlations reflect a
competition between $1p$ and $2p$ decay modes in this nucleus.
|
nucl-th
|
twoproton 2p radioactivity is a rare decay mode found in a few protonunbound nuclei the 2pdecay lifetime and properties of emitted protons carry invaluable information on nuclear structure in the presence of lowlying proton continuum the recently measured 2p decay of 67kr phys rev lett 117 162501 2016 turned out to be unexpectedly fast since 67kr is expected to be a deformed system we investigate the impact of deformation effects on the 2p radioactivity we apply the recently developed gamow coupledchannel framework which allows for a precise description of threebody systems in the presence of rotational and vibrational couplings this is the first application of a threebody approach to a twonucleon decay from a deformed nucleus we show that deformation couplings significantly increase the 2p decay width of 67kr this finding explains the puzzling experimental data the calculated angular protonproton correlations reflect a competition between 1p and 2p decay modes in this nucleus
|
[['twoproton', '2p', 'radioactivity', 'is', 'a', 'rare', 'decay', 'mode', 'found', 'in', 'a', 'few', 'protonunbound', 'nuclei', 'the', '2pdecay', 'lifetime', 'and', 'properties', 'of', 'emitted', 'protons', 'carry', 'invaluable', 'information', 'on', 'nuclear', 'structure', 'in', 'the', 'presence', 'of', 'lowlying', 'proton', 'continuum', 'the', 'recently', 'measured', '2p', 'decay', 'of', '67kr', 'phys', 'rev', 'lett', '117', '162501', '2016', 'turned', 'out', 'to', 'be', 'unexpectedly', 'fast', 'since', '67kr', 'is', 'expected', 'to', 'be', 'a', 'deformed', 'system', 'we', 'investigate', 'the', 'impact', 'of', 'deformation', 'effects', 'on', 'the', '2p', 'radioactivity', 'we', 'apply', 'the', 'recently', 'developed', 'gamow', 'coupledchannel', 'framework', 'which', 'allows', 'for', 'a', 'precise', 'description', 'of', 'threebody', 'systems', 'in', 'the', 'presence', 'of', 'rotational', 'and', 'vibrational', 'couplings', 'this', 'is', 'the', 'first', 'application', 'of', 'a', 'threebody', 'approach', 'to', 'a', 'twonucleon', 'decay', 'from', 'a', 'deformed', 'nucleus', 'we', 'show', 'that', 'deformation', 'couplings', 'significantly', 'increase', 'the', '2p', 'decay', 'width', 'of', '67kr', 'this', 'finding', 'explains', 'the', 'puzzling', 'experimental', 'data', 'the', 'calculated', 'angular', 'protonproton', 'correlations', 'reflect', 'a', 'competition', 'between', '1p', 'and', '2p', 'decay', 'modes', 'in', 'this', 'nucleus']]
|
[-0.054815645101449345, 0.17429264922570809, -0.09450378625141766, 0.11537751763814671, -0.006299628752795671, -0.09474494339187402, 0.06400481610873479, 0.32193266816856647, -0.21105768454156273, -0.27938168537833835, -0.06923034461523524, -0.31493397665047007, -0.07959021507941236, 0.1254415458672686, 0.041980285217541435, 0.029113802488350514, 0.0956427249132304, 0.0084009455156124, -0.07206318882950859, -0.14704217138354797, 0.24439073020795865, 0.11245136383600188, 0.23477324446206851, 0.11978609147583773, -0.02470762409741639, 0.01077056221744132, 0.028517016934366615, -0.07553759287574038, -0.15122851400293252, 0.10831638495283609, 0.20861101752306668, 0.06630288049291869, 0.20533151993534177, -0.4014160108215959, -0.15796950033292273, 0.11006754934664396, 0.17467768051791072, 0.15760168496716692, -0.04802458888052389, -0.3613594105738579, 0.02890128150755009, -0.2351777730016223, -0.15248138248451695, -0.11383041275652829, 0.1128669940228173, -0.010524743477141621, -0.26972092393768754, 0.10006577746683595, 0.015269957327080384, 0.03329863554076446, -0.10206881627503671, -0.13143389773114109, -0.025497783308491014, 0.054910938189186104, 0.09726198367305741, 0.028287958317522625, 0.16227799880361518, -0.05509036116221833, -0.09432350665589931, 0.3842659408214274, -0.008311357188026192, -0.10338421929504303, 0.14132200773120765, -0.18507131465420817, -0.1510213809920512, 0.23263964280547783, 0.17732308316198703, 0.11015544403714454, -0.136174100346706, 0.09786593197383887, -0.01640993334500995, 0.2262135752124422, 0.08028523374151512, 0.07918898294685989, 0.16288792503695465, 0.18442558528568645, -0.06406873975269842, 0.09646306955178471, -0.16483993682122192, -0.06689894057509438, -0.3028955873323987, -0.120906480954997, -0.14580941827569174, 0.09917135260357762, 0.052654690531969826, -0.10084693058585094, 0.38598054823225103, 0.033108776941007334, 0.23946305772055262, -0.051949178771461234, 0.22049588329522618, 0.08618568618541324, 0.05604364001808922, 0.05213010873312488, 0.35752919641946324, 0.21885895839466757, 0.057137029146427126, -0.3443126471925971, 0.04491718596970009, 0.03945167578597991]
|
1,803.07657
|
Bounds for modified Struve functions of the first kind and their ratios
|
We obtain a simple two-sided inequality for the ratio
$\mathbf{L}_\nu(x)/\mathbf{L}_{\nu-1}(x)$ in terms of the ratio
$I_\nu(x)/I_{\nu-1}(x)$, where $\mathbf{L}_\nu(x)$ is the modified Struve
function of the first kind and $I_\nu(x)$ is the modified Bessel function of
the first kind. This result allows one to use the extensive literature on
bounds for $I_\nu(x)/I_{\nu-1}(x)$ to immediately deduce bounds for
$\mathbf{L}_\nu(x)/\mathbf{L}_{\nu-1}(x)$. We note some consequences and obtain
further bounds for $\mathbf{L}_\nu(x)/\mathbf{L}_{\nu-1}(x)$ by adapting
techniques used to bound the ratio $I_\nu(x)/I_{\nu-1}(x)$. We apply these
results to obtain new bounds for the condition numbers
$x\mathbf{L}_\nu'(x)/\mathbf{L}_\nu(x)$, the ratio
$\mathbf{L}_\nu(x)/\mathbf{L}_\nu(y)$ and the modified Struve function
$\mathbf{L}_\nu(x)$ itself. Amongst other results, we obtain two-sided
inequalities for $x\mathbf{L}_\nu'(x)/\mathbf{L}_\nu(x)$ and
$\mathbf{L}_\nu(x)/\mathbf{L}_\nu(y)$ that are given in terms of
$xI_\nu'(x)/I_\nu(x)$ and $I_\nu(x)/I_\nu(y)$, respectively, which again allows
one to exploit the substantial literature on bounds for these quantities. The
results obtained in this paper complement and improve existing bounds in the
literature.
|
math.CA
|
we obtain a simple twosided inequality for the ratio mathbfl_nuxmathbfl_nu1x in terms of the ratio i_nuxi_nu1x where mathbfl_nux is the modified struve function of the first kind and i_nux is the modified bessel function of the first kind this result allows one to use the extensive literature on bounds for i_nuxi_nu1x to immediately deduce bounds for mathbfl_nuxmathbfl_nu1x we note some consequences and obtain further bounds for mathbfl_nuxmathbfl_nu1x by adapting techniques used to bound the ratio i_nuxi_nu1x we apply these results to obtain new bounds for the condition numbers xmathbfl_nuxmathbfl_nux the ratio mathbfl_nuxmathbfl_nuy and the modified struve function mathbfl_nux itself amongst other results we obtain twosided inequalities for xmathbfl_nuxmathbfl_nux and mathbfl_nuxmathbfl_nuy that are given in terms of xi_nuxi_nux and i_nuxi_nuy respectively which again allows one to exploit the substantial literature on bounds for these quantities the results obtained in this paper complement and improve existing bounds in the literature
|
[['we', 'obtain', 'a', 'simple', 'twosided', 'inequality', 'for', 'the', 'ratio', 'mathbfl_nuxmathbfl_nu1x', 'in', 'terms', 'of', 'the', 'ratio', 'i_nuxi_nu1x', 'where', 'mathbfl_nux', 'is', 'the', 'modified', 'struve', 'function', 'of', 'the', 'first', 'kind', 'and', 'i_nux', 'is', 'the', 'modified', 'bessel', 'function', 'of', 'the', 'first', 'kind', 'this', 'result', 'allows', 'one', 'to', 'use', 'the', 'extensive', 'literature', 'on', 'bounds', 'for', 'i_nuxi_nu1x', 'to', 'immediately', 'deduce', 'bounds', 'for', 'mathbfl_nuxmathbfl_nu1x', 'we', 'note', 'some', 'consequences', 'and', 'obtain', 'further', 'bounds', 'for', 'mathbfl_nuxmathbfl_nu1x', 'by', 'adapting', 'techniques', 'used', 'to', 'bound', 'the', 'ratio', 'i_nuxi_nu1x', 'we', 'apply', 'these', 'results', 'to', 'obtain', 'new', 'bounds', 'for', 'the', 'condition', 'numbers', 'xmathbfl_nuxmathbfl_nux', 'the', 'ratio', 'mathbfl_nuxmathbfl_nuy', 'and', 'the', 'modified', 'struve', 'function', 'mathbfl_nux', 'itself', 'amongst', 'other', 'results', 'we', 'obtain', 'twosided', 'inequalities', 'for', 'xmathbfl_nuxmathbfl_nux', 'and', 'mathbfl_nuxmathbfl_nuy', 'that', 'are', 'given', 'in', 'terms', 'of', 'xi_nuxi_nux', 'and', 'i_nuxi_nuy', 'respectively', 'which', 'again', 'allows', 'one', 'to', 'exploit', 'the', 'substantial', 'literature', 'on', 'bounds', 'for', 'these', 'quantities', 'the', 'results', 'obtained', 'in', 'this', 'paper', 'complement', 'and', 'improve', 'existing', 'bounds', 'in', 'the', 'literature']]
|
[-0.06164211808690723, 0.03665403931231146, -0.08438285125393263, 0.09949566850530535, -0.09888842857023045, -0.1016738259358148, 0.06748238587702796, 0.2894981331782232, -0.2315189461682884, -0.30938004661338325, 0.12833996098422984, -0.24751172168528773, -0.16059209558043733, 0.2919869794064319, -0.07796866020423845, 0.054046724644214124, 0.030110327805667907, 0.04214920017386223, -0.10113947964634117, -0.27176927110101556, 0.3190289256884388, 0.0376696363911295, 0.23380199033753868, 0.12338730083281686, 0.049860258406342964, -0.009965137599862482, -0.044374942628692994, -0.020642235320927182, -0.26795885612407055, 0.14678923409222297, 0.19806286747383714, 0.13856138330294002, 0.21473172928770662, -0.39027987362843164, -0.12695540473296332, 0.13395309493168664, 0.1275496755720077, 0.06837338815413704, -0.032725108390006655, -0.25004886057962417, 0.08968995844545237, -0.14220488842078288, -0.13782747497152484, -0.07757475918394999, -0.030767671209694425, 0.07120031665380992, -0.3229402136582304, 0.0727597939171894, 0.07446692634741185, -0.030892485666620007, -0.05780892329975884, -0.1831559776230125, 0.08003584403728306, 0.12686546163922044, 0.05598213803678961, -0.001203119884323801, 0.045892379144993674, -0.08947569781153554, -0.10353137062810047, 0.31466035030677286, -0.11988008911655822, -0.23216140966757504, 0.1452277525898699, -0.14038206187968838, -0.18862034007578984, 0.038179112317919414, 0.1509375703803093, 0.12915253377532665, -0.12825228486039583, 0.0642248761494198, -0.06632939962552152, 0.09804082535613905, 0.10066450483978949, 0.07756467805978592, 0.07672506778068106, 0.0580674266888642, 0.0962626061034979, 0.2015284105604941, -0.06220079710195497, -0.05893986989271788, -0.3143023721558947, -0.1855625401199369, -0.17877005277083477, -0.012611672606870112, -0.12107284194080677, -0.11506005395761311, 0.34783377882722816, 0.13332764447082987, 0.1914791306939868, 0.1440256983312306, 0.27690666878569714, 0.18011761885661054, 0.04349696890018146, 0.04893361388797492, 0.26457704818323025, 0.1473346527036227, 0.09201542699289783, -0.14154301997533225, 0.08024608347774811, 0.14461413044548055]
|
1,803.07658
|
Graph-based regularization for regression problems with alignment and
highly-correlated designs
|
Sparse models for high-dimensional linear regression and machine learning
have received substantial attention over the past two decades. Model selection,
or determining which features or covariates are the best explanatory variables,
is critical to the interpretability of a learned model. Much of the current
literature assumes that covariates are only mildly correlated. However, in many
modern applications covariates are highly correlated and do not exhibit key
properties (such as the restricted eigenvalue condition, restricted isometry
property, or other related assumptions). This work considers a high-dimensional
regression setting in which a graph governs both correlations among the
covariates and the similarity among regression coefficients -- meaning there is
\emph{alignment} between the covariates and regression coefficients. Using side
information about the strength of correlations among features, we form a graph
with edge weights corresponding to pairwise covariances. This graph is used to
define a graph total variation regularizer that promotes similar weights for
correlated features.
This work shows how the proposed graph-based regularization yields
mean-squared error guarantees for a broad range of covariance graph structures.
These guarantees are optimal for many specific covariance graphs, including
block and lattice graphs. Our proposed approach outperforms other methods for
highly-correlated design in a variety of experiments on synthetic data and real
biochemistry data.
|
stat.ML cs.LG
|
sparse models for highdimensional linear regression and machine learning have received substantial attention over the past two decades model selection or determining which features or covariates are the best explanatory variables is critical to the interpretability of a learned model much of the current literature assumes that covariates are only mildly correlated however in many modern applications covariates are highly correlated and do not exhibit key properties such as the restricted eigenvalue condition restricted isometry property or other related assumptions this work considers a highdimensional regression setting in which a graph governs both correlations among the covariates and the similarity among regression coefficients meaning there is emphalignment between the covariates and regression coefficients using side information about the strength of correlations among features we form a graph with edge weights corresponding to pairwise covariances this graph is used to define a graph total variation regularizer that promotes similar weights for correlated features this work shows how the proposed graphbased regularization yields meansquared error guarantees for a broad range of covariance graph structures these guarantees are optimal for many specific covariance graphs including block and lattice graphs our proposed approach outperforms other methods for highlycorrelated design in a variety of experiments on synthetic data and real biochemistry data
|
[['sparse', 'models', 'for', 'highdimensional', 'linear', 'regression', 'and', 'machine', 'learning', 'have', 'received', 'substantial', 'attention', 'over', 'the', 'past', 'two', 'decades', 'model', 'selection', 'or', 'determining', 'which', 'features', 'or', 'covariates', 'are', 'the', 'best', 'explanatory', 'variables', 'is', 'critical', 'to', 'the', 'interpretability', 'of', 'a', 'learned', 'model', 'much', 'of', 'the', 'current', 'literature', 'assumes', 'that', 'covariates', 'are', 'only', 'mildly', 'correlated', 'however', 'in', 'many', 'modern', 'applications', 'covariates', 'are', 'highly', 'correlated', 'and', 'do', 'not', 'exhibit', 'key', 'properties', 'such', 'as', 'the', 'restricted', 'eigenvalue', 'condition', 'restricted', 'isometry', 'property', 'or', 'other', 'related', 'assumptions', 'this', 'work', 'considers', 'a', 'highdimensional', 'regression', 'setting', 'in', 'which', 'a', 'graph', 'governs', 'both', 'correlations', 'among', 'the', 'covariates', 'and', 'the', 'similarity', 'among', 'regression', 'coefficients', 'meaning', 'there', 'is', 'emphalignment', 'between', 'the', 'covariates', 'and', 'regression', 'coefficients', 'using', 'side', 'information', 'about', 'the', 'strength', 'of', 'correlations', 'among', 'features', 'we', 'form', 'a', 'graph', 'with', 'edge', 'weights', 'corresponding', 'to', 'pairwise', 'covariances', 'this', 'graph', 'is', 'used', 'to', 'define', 'a', 'graph', 'total', 'variation', 'regularizer', 'that', 'promotes', 'similar', 'weights', 'for', 'correlated', 'features', 'this', 'work', 'shows', 'how', 'the', 'proposed', 'graphbased', 'regularization', 'yields', 'meansquared', 'error', 'guarantees', 'for', 'a', 'broad', 'range', 'of', 'covariance', 'graph', 'structures', 'these', 'guarantees', 'are', 'optimal', 'for', 'many', 'specific', 'covariance', 'graphs', 'including', 'block', 'and', 'lattice', 'graphs', 'our', 'proposed', 'approach', 'outperforms', 'other', 'methods', 'for', 'highlycorrelated', 'design', 'in', 'a', 'variety', 'of', 'experiments', 'on', 'synthetic', 'data', 'and', 'real', 'biochemistry', 'data']]
|
[-0.07697459803399256, 0.03340999440094321, -0.060503005441548165, 0.09953203121794091, -0.1495520434182605, -0.20663689714653985, 0.01941682370761994, 0.44067849416807653, -0.29605539389188595, -0.2864061680257968, 0.09791711139310476, -0.303573004298524, -0.19749818709206537, 0.17088919562559826, -0.10413805265227054, 0.1141612900663977, 0.10295632904675463, 0.053669235498109015, -0.061880879846496, -0.27817631259423925, 0.30080970337362467, 0.025940650062869497, 0.3103630386589878, -0.002101559727340217, 0.11191012998854467, 0.04329720008128507, -0.05916406384698489, 0.04298425397491488, -0.07349708401475716, 0.1419882776512616, 0.3254527513244886, 0.1518918316707843, 0.3482901416224054, -0.3685899578700751, -0.26934134707772645, 0.16380103308806457, 0.11169889803687875, 0.06711991553662731, 0.005765357657092745, -0.23791948968211665, 0.035814829618368606, -0.1265629563900442, 0.009782257141176484, -0.12626262391233536, 0.002249032701028214, 0.02300828215519893, -0.34833026632828556, 0.09935756129604104, 0.08380866569696345, 0.08039417693274464, -0.021457124989623752, -0.18263335099583267, 0.009543912155679674, 0.11398451182437871, 0.07216151135834159, -0.001891021050427307, 0.12177967508705918, -0.14840990485025093, -0.13414439787145632, 0.34967854511946583, -0.011416676057196685, -0.23915937606578216, 0.19170653246172167, -0.09993614729916776, -0.1879076496799193, 0.078953692705285, 0.23075424082541235, 0.06430901523121602, -0.14857493228490515, 0.06381580983862227, -0.07975936594648637, 0.17582062436357718, 0.023433706581289994, 0.06249195907224456, 0.13809036397642865, 0.16066087540778992, 0.06871492657889185, 0.0837139108410591, -0.0673805641482884, -0.09397763661041424, -0.2448162699955097, -0.0732622827011822, -0.2264595572411528, -0.04555734540531266, -0.18262161418600437, -0.19151894026323432, 0.4210969171192101, 0.1710481686025643, 0.22812029826207367, 0.0880621576277935, 0.25849230343966345, 0.05754041143103642, 0.08990165282148814, 0.11576600109591433, 0.1754099653745835, 0.14998601576772289, 0.029978302769151467, -0.1627519215155699, 0.16385130907615852, 0.014702440448699223]
|
1,803.07659
|
A New Equation for Activity Calculation in Pulse Irradiation:
Derivation, Simulation and Experimental Validation
|
To calculate the radioactivity of product nuclides generated in pulse
irradiation, it is generally assumed that the irradiation is approximately
continues in the entire irradiation period ($t_i$) and the flux of incoming
irradiation particle can be obtained by averaging their intensity in each pulse
period ($T$). However, this approximation fails to acknowledge the fact that
the product nuclides are not created in each pulse period ($T$) evenly: they
are only produced in a very short pulse width ($t_p$) and then decay in a
relative long rest time ($t_r=T-t_p$). Given by the enormous number of pulses,
the sum of these decays may not be negligible. To make the activity calculation
in accordance with the real situation in pulse irradiation, we scrutinize the
details of irradiation and decay processes in each pulse, applies the geometric
series to obtain the activity superimposition of millions of pulses, and
derives a novel activity equation particularly suitable for pulse irradiation.
The experimental results, numerical simulations, and activity measurements from
photon activation driven by a pulsed electron LINAC have confirmed the validity
of this new equation. The comparison between the new and traditional equations
indicates that their discrepancy could be significant under certain conditions.
The limitations of the new activity equation for pulse irradiation are
discussed as well.
|
physics.ins-det physics.app-ph
|
to calculate the radioactivity of product nuclides generated in pulse irradiation it is generally assumed that the irradiation is approximately continues in the entire irradiation period t_i and the flux of incoming irradiation particle can be obtained by averaging their intensity in each pulse period t however this approximation fails to acknowledge the fact that the product nuclides are not created in each pulse period t evenly they are only produced in a very short pulse width t_p and then decay in a relative long rest time t_rtt_p given by the enormous number of pulses the sum of these decays may not be negligible to make the activity calculation in accordance with the real situation in pulse irradiation we scrutinize the details of irradiation and decay processes in each pulse applies the geometric series to obtain the activity superimposition of millions of pulses and derives a novel activity equation particularly suitable for pulse irradiation the experimental results numerical simulations and activity measurements from photon activation driven by a pulsed electron linac have confirmed the validity of this new equation the comparison between the new and traditional equations indicates that their discrepancy could be significant under certain conditions the limitations of the new activity equation for pulse irradiation are discussed as well
|
[['to', 'calculate', 'the', 'radioactivity', 'of', 'product', 'nuclides', 'generated', 'in', 'pulse', 'irradiation', 'it', 'is', 'generally', 'assumed', 'that', 'the', 'irradiation', 'is', 'approximately', 'continues', 'in', 'the', 'entire', 'irradiation', 'period', 't_i', 'and', 'the', 'flux', 'of', 'incoming', 'irradiation', 'particle', 'can', 'be', 'obtained', 'by', 'averaging', 'their', 'intensity', 'in', 'each', 'pulse', 'period', 't', 'however', 'this', 'approximation', 'fails', 'to', 'acknowledge', 'the', 'fact', 'that', 'the', 'product', 'nuclides', 'are', 'not', 'created', 'in', 'each', 'pulse', 'period', 't', 'evenly', 'they', 'are', 'only', 'produced', 'in', 'a', 'very', 'short', 'pulse', 'width', 't_p', 'and', 'then', 'decay', 'in', 'a', 'relative', 'long', 'rest', 'time', 't_rtt_p', 'given', 'by', 'the', 'enormous', 'number', 'of', 'pulses', 'the', 'sum', 'of', 'these', 'decays', 'may', 'not', 'be', 'negligible', 'to', 'make', 'the', 'activity', 'calculation', 'in', 'accordance', 'with', 'the', 'real', 'situation', 'in', 'pulse', 'irradiation', 'we', 'scrutinize', 'the', 'details', 'of', 'irradiation', 'and', 'decay', 'processes', 'in', 'each', 'pulse', 'applies', 'the', 'geometric', 'series', 'to', 'obtain', 'the', 'activity', 'superimposition', 'of', 'millions', 'of', 'pulses', 'and', 'derives', 'a', 'novel', 'activity', 'equation', 'particularly', 'suitable', 'for', 'pulse', 'irradiation', 'the', 'experimental', 'results', 'numerical', 'simulations', 'and', 'activity', 'measurements', 'from', 'photon', 'activation', 'driven', 'by', 'a', 'pulsed', 'electron', 'linac', 'have', 'confirmed', 'the', 'validity', 'of', 'this', 'new', 'equation', 'the', 'comparison', 'between', 'the', 'new', 'and', 'traditional', 'equations', 'indicates', 'that', 'their', 'discrepancy', 'could', 'be', 'significant', 'under', 'certain', 'conditions', 'the', 'limitations', 'of', 'the', 'new', 'activity', 'equation', 'for', 'pulse', 'irradiation', 'are', 'discussed', 'as', 'well']]
|
[-0.09509447479282417, 0.21488052364217028, -0.08785040451413287, 0.0791734342552012, -0.013028500192532582, -0.11695953544667212, 0.037165147953644576, 0.4299910657595666, -0.2676176382494824, -0.31001627742800686, 0.07470670511691077, -0.2723134834829363, -0.028508180286735296, 0.24045169585317905, -0.058049153454513065, 0.032010534119659234, 0.09452675936599483, 0.028031741625939806, -0.047595824666565194, -0.2207753206359311, 0.24174121058590356, 0.09326770424931533, 0.2597483134362847, 0.053428351995812376, 0.04714562745676154, -0.0061140661424447205, -0.02748875074695596, -0.05279836427874952, -0.08612034337624902, 0.039466467497515534, 0.2143894563650801, 0.10261641561186739, 0.22858595068766072, -0.4572460446284995, -0.2330799362976991, 0.08394362055031317, 0.1409343410926383, 0.07464914700956017, -0.08253842850127036, -0.23991981778027757, 0.047969649454639045, -0.1576771125419154, -0.10759174240464787, -0.014013028338861961, 0.06182800617202052, 0.105932762924355, -0.26955803147118007, 0.0523241692408365, 0.028090939974485776, 0.037722236263964856, -0.08220468514399337, -0.07119192108733668, -0.013988102852766002, 0.09390231846066724, 0.10041681835538752, 0.03788147393192741, 0.1727579903367552, -0.10077167789540475, -0.05907035738096705, 0.3493299779304791, -0.0718338332360699, -0.1117908048044358, 0.13657357570759598, -0.20552771964021738, -0.10282083172129379, 0.20961793096835857, 0.12915072114140327, 0.1268795736993308, -0.1725987305687297, 3.484299328799049e-05, 0.013928635997165527, 0.20256595114742162, 0.1303498996310823, 0.016881626702490306, 0.19468533390955556, 0.1620149693407473, 0.00701420740224421, 0.12500034757679152, -0.08971922958709391, -0.037642377377709466, -0.3198428985795804, -0.09268453359226918, -0.16226233839988707, 0.08527259206623837, -0.03326368317232534, -0.12440451028163634, 0.4403034629499806, 0.13405772125448234, 0.17276351515514154, -0.00038476401075188604, 0.2672489055033241, 0.1654783617056507, 0.060931745389340604, 0.03026125043629907, 0.2449211546009229, 0.15123218591768472, 0.10306837674496429, -0.2439956965135588, 0.09879140170246717, -0.01598613744135946]
|
1,803.0766
|
Decentralized decision making for networks of uncertain systems
|
Distributed model predictive control (MPC) has been proven a successful
method in regulating the operation of large-scale networks of constrained
dynamical systems. This paper is concerned with cooperative distributed MPC in
which the decision actions of the systems are usually derived by the solution
of a system-wide optimization problem. However, formulating and solving such
large-scale optimization problems is often a hard task which requires extensive
information communication among the individual systems and fails to address
privacy concerns in the network. Hence, the main challenge is to design
decision policies with a prescribed structure so that the resulting system-wide
optimization problem to admit a loosely coupled structure and be amendable to
distributed computation algorithms. In this paper, we propose a decentralized
problem synthesis scheme which only requires each system to communicate sets
which bound its states evolution to neighboring systems. The proposed method
alleviates concerns on privacy since this limited communication scheme does not
reveal the exact characteristics of the dynamics within each system. In
addition, it enables a distributed computation of the solution, making our
method highly scalable. We demonstrate in a number of numerical studies,
inspired by engineering and finance, the efficacy of the proposed approach
which leads to solutions that closely approximate those obtained by the
centralized formulation only at a fraction of the computational effort.
|
math.OC cs.MA cs.SY
|
distributed model predictive control mpc has been proven a successful method in regulating the operation of largescale networks of constrained dynamical systems this paper is concerned with cooperative distributed mpc in which the decision actions of the systems are usually derived by the solution of a systemwide optimization problem however formulating and solving such largescale optimization problems is often a hard task which requires extensive information communication among the individual systems and fails to address privacy concerns in the network hence the main challenge is to design decision policies with a prescribed structure so that the resulting systemwide optimization problem to admit a loosely coupled structure and be amendable to distributed computation algorithms in this paper we propose a decentralized problem synthesis scheme which only requires each system to communicate sets which bound its states evolution to neighboring systems the proposed method alleviates concerns on privacy since this limited communication scheme does not reveal the exact characteristics of the dynamics within each system in addition it enables a distributed computation of the solution making our method highly scalable we demonstrate in a number of numerical studies inspired by engineering and finance the efficacy of the proposed approach which leads to solutions that closely approximate those obtained by the centralized formulation only at a fraction of the computational effort
|
[['distributed', 'model', 'predictive', 'control', 'mpc', 'has', 'been', 'proven', 'a', 'successful', 'method', 'in', 'regulating', 'the', 'operation', 'of', 'largescale', 'networks', 'of', 'constrained', 'dynamical', 'systems', 'this', 'paper', 'is', 'concerned', 'with', 'cooperative', 'distributed', 'mpc', 'in', 'which', 'the', 'decision', 'actions', 'of', 'the', 'systems', 'are', 'usually', 'derived', 'by', 'the', 'solution', 'of', 'a', 'systemwide', 'optimization', 'problem', 'however', 'formulating', 'and', 'solving', 'such', 'largescale', 'optimization', 'problems', 'is', 'often', 'a', 'hard', 'task', 'which', 'requires', 'extensive', 'information', 'communication', 'among', 'the', 'individual', 'systems', 'and', 'fails', 'to', 'address', 'privacy', 'concerns', 'in', 'the', 'network', 'hence', 'the', 'main', 'challenge', 'is', 'to', 'design', 'decision', 'policies', 'with', 'a', 'prescribed', 'structure', 'so', 'that', 'the', 'resulting', 'systemwide', 'optimization', 'problem', 'to', 'admit', 'a', 'loosely', 'coupled', 'structure', 'and', 'be', 'amendable', 'to', 'distributed', 'computation', 'algorithms', 'in', 'this', 'paper', 'we', 'propose', 'a', 'decentralized', 'problem', 'synthesis', 'scheme', 'which', 'only', 'requires', 'each', 'system', 'to', 'communicate', 'sets', 'which', 'bound', 'its', 'states', 'evolution', 'to', 'neighboring', 'systems', 'the', 'proposed', 'method', 'alleviates', 'concerns', 'on', 'privacy', 'since', 'this', 'limited', 'communication', 'scheme', 'does', 'not', 'reveal', 'the', 'exact', 'characteristics', 'of', 'the', 'dynamics', 'within', 'each', 'system', 'in', 'addition', 'it', 'enables', 'a', 'distributed', 'computation', 'of', 'the', 'solution', 'making', 'our', 'method', 'highly', 'scalable', 'we', 'demonstrate', 'in', 'a', 'number', 'of', 'numerical', 'studies', 'inspired', 'by', 'engineering', 'and', 'finance', 'the', 'efficacy', 'of', 'the', 'proposed', 'approach', 'which', 'leads', 'to', 'solutions', 'that', 'closely', 'approximate', 'those', 'obtained', 'by', 'the', 'centralized', 'formulation', 'only', 'at', 'a', 'fraction', 'of', 'the', 'computational', 'effort']]
|
[-0.16387360539167709, -0.010822600038367571, -0.05727563346270205, 0.020344555204538758, -0.08209474862407927, -0.16902146257573328, 0.07917631108585078, 0.37195698605901606, -0.31456431942146035, -0.3529297590678677, 0.13165339349627275, -0.21113704420453142, -0.19630890530870518, 0.1783105586794282, -0.11413947753303838, 0.12317323731338614, 0.09135536654529786, 0.012369282282525759, -0.027036354644224048, -0.25519711682593654, 0.28690914656868666, 0.07077554206218604, 0.3266566854168943, 0.021102695213203584, 0.13510847280716198, -0.008362956981627492, -0.019184267203913096, 0.031018316707842976, -0.05465701809763073, 0.18940061555001586, 0.30562753333932285, 0.18749210059134408, 0.3816172576535049, -0.41480697259956273, -0.22091767094162112, 0.10948141372854471, 0.17638298562181037, 0.11610412527112837, -0.04229749436116427, -0.2596831910841919, 0.10304069185176642, -0.16465668828619662, -0.08150623398918419, -0.07876693200824116, -0.04480956275434737, 0.0016692603661661643, -0.2915199255670096, 0.0453457384148117, 0.02366859719855177, -0.005208815565469478, -0.05202062216260547, -0.05050185425826476, 0.029494156803585452, 0.11617390952636958, 0.023022287489457584, -0.0027818985271626452, 0.13319235043002103, -0.12142076657405722, -0.15474213399644515, 0.4040876015115085, 0.04361895585823548, -0.22521611124943566, 0.1929990644545354, -0.033817662539199815, -0.1735821165819439, 0.13986967475828502, 0.21766051569491104, 0.15229202641137884, -0.1999731326070956, 0.07412455128099975, -0.033598926903064784, 0.20463016840689088, -0.022711127622634036, 0.026702833159064656, 0.16624985600089004, 0.2194264175662976, 0.13646559504399058, 0.11741793170141979, 0.005753008478936321, -0.16474437476947493, -0.2162125427585625, -0.10106717705285527, -0.17518277720915615, -0.0038199289412843276, -0.03741977038476061, -0.1561895324656347, 0.35809569748517295, 0.18285823645339339, 0.16179411913644215, 0.07877809162211066, 0.3604449980012184, 0.10120309007176788, 0.06728401959878008, 0.13196920102580723, 0.210861070620947, 0.09048607858611322, 0.12551604652587206, -0.23884586237452138, 0.10718427447243295, 0.034817704896724554]
|
1,803.07661
|
Efficient Recurrent Neural Networks using Structured Matrices in FPGAs
|
Recurrent Neural Networks (RNNs) are becoming increasingly important for time
series-related applications which require efficient and real-time
implementations. The recent pruning based work ESE suffers from degradation of
performance/energy efficiency due to the irregular network structure after
pruning. We propose block-circulant matrices for weight matrix representation
in RNNs, thereby achieving simultaneous model compression and acceleration. We
aim to implement RNNs in FPGA with highest performance and energy efficiency,
with certain accuracy requirement (negligible accuracy degradation).
Experimental results on actual FPGA deployments shows that the proposed
framework achieves a maximum energy efficiency improvement of 35.7$\times$
compared with ESE.
|
cs.LG cs.NA stat.ML
|
recurrent neural networks rnns are becoming increasingly important for time seriesrelated applications which require efficient and realtime implementations the recent pruning based work ese suffers from degradation of performanceenergy efficiency due to the irregular network structure after pruning we propose blockcirculant matrices for weight matrix representation in rnns thereby achieving simultaneous model compression and acceleration we aim to implement rnns in fpga with highest performance and energy efficiency with certain accuracy requirement negligible accuracy degradation experimental results on actual fpga deployments shows that the proposed framework achieves a maximum energy efficiency improvement of 357times compared with ese
|
[['recurrent', 'neural', 'networks', 'rnns', 'are', 'becoming', 'increasingly', 'important', 'for', 'time', 'seriesrelated', 'applications', 'which', 'require', 'efficient', 'and', 'realtime', 'implementations', 'the', 'recent', 'pruning', 'based', 'work', 'ese', 'suffers', 'from', 'degradation', 'of', 'performanceenergy', 'efficiency', 'due', 'to', 'the', 'irregular', 'network', 'structure', 'after', 'pruning', 'we', 'propose', 'blockcirculant', 'matrices', 'for', 'weight', 'matrix', 'representation', 'in', 'rnns', 'thereby', 'achieving', 'simultaneous', 'model', 'compression', 'and', 'acceleration', 'we', 'aim', 'to', 'implement', 'rnns', 'in', 'fpga', 'with', 'highest', 'performance', 'and', 'energy', 'efficiency', 'with', 'certain', 'accuracy', 'requirement', 'negligible', 'accuracy', 'degradation', 'experimental', 'results', 'on', 'actual', 'fpga', 'deployments', 'shows', 'that', 'the', 'proposed', 'framework', 'achieves', 'a', 'maximum', 'energy', 'efficiency', 'improvement', 'of', '357times', 'compared', 'with', 'ese']]
|
[-0.1157601327341246, -0.027363473301949468, -0.0060601322470526945, 0.029511353768114198, -0.06333941328094193, -0.19343096778090846, 0.0747561707014316, 0.5087282190589528, -0.21304037311653556, -0.3425484796250729, 0.0891123210888748, -0.19986288402915786, -0.1973651200925049, 0.21847921788055252, -0.12623589575094613, 0.1496179461822306, 0.2094852486429246, 0.01143431310100775, -0.09519407192588245, -0.299907559786286, 0.20817576482597935, 0.20167906421579812, 0.4148115449609529, 0.0710907678965381, 0.1397833865626078, -0.04067383772252422, -0.017246373503861066, -0.07643890644693258, 0.0022535432634820034, 0.178501658742071, 0.2867624790652802, 0.1511395724643463, 0.2975116138223951, -0.4555387271574306, -0.24587403786809822, 0.10783608218556956, 0.1306163909783783, 0.05068667275022323, -0.05310696532680212, -0.22930391322037108, 0.14351196032581165, -0.20357119479265653, -0.010917120162201555, -0.13184663346772524, -0.022976733606896903, 0.011386058489350896, -0.2967950465151501, 0.09137887001821869, 0.05739480513485001, 0.0024897477736598567, -0.009270450389502864, -0.1641222880516005, 0.04978166121597353, 0.08954937374709468, 0.015106435452195767, 0.04688471647371587, 0.1416571680768883, -0.16564082989077034, -0.15256345168638386, 0.34290903975304804, -0.04288830335350021, -0.1769769082881363, 0.1865550943135627, 0.002507261465009498, -0.14866424292129907, 0.15944433357370527, 0.21636652354347077, 0.04153897370652933, -0.10460829999555196, 0.03303270897595212, 0.08694454923664269, 0.1940714086602001, 0.07532422921105632, 0.08390837344586065, 0.11680005801792599, 0.3052041107543597, 0.05221870528828157, 0.1457977350678687, -0.10516300656538653, -0.11274856322101856, -0.15768095906823873, -0.08702293899596522, -0.14928376690582618, 0.026777970151191478, -0.13526333177440775, -0.10690735808916782, 0.4064552140765284, 0.23850772602385598, 0.18182299504252641, 0.15819979883656887, 0.40136810424492547, 0.051633828973373104, 0.12766922456457427, 0.15793412828375278, 0.18089987767468158, 0.06868365132494976, 0.16233855952128867, -0.22159806304415197, 0.09149045778322033, 0.04000838433337202]
|
1,803.07662
|
Sur les paquets d'Arthur des groupes classiques et unitaires non
quasi-d\'eploy\'es
|
Nous \'etendons aux groupes orthogonaux et unitaires non quasi-d\'eploy\'es
sur un corps local des r\'esultats de J. Arthur et de la premi\`ere auteure
\'etablis dans le cas quasi-d\'eploy\'e. En particulier, nous obtenons une
classification de Langlands compl\`ete pour les repr\'esentations temp\'er\'ees
dans le cas $p$-adique. Nous en d\'eduisons en utilisant l'involution
d'Aubert-Schneider-Stuhler un r\'esultat de multiplicit\'e un dans les paquets
unipotents, et par des m\'ethodes globales, le m\^eme r\'esultat pour les
paquets unipotents dans le cas archim\'edien.
We extend to non quasi-split orthogonal and unitary groups over a local field
some results of J. Arthur and the first author established in the quasi-split
case. In particular, we obtain a full Langlands classification for tempered
representations in the $p$-adic case. Using Aubert-Schneider-Stuhler
involution, we deduce from this a multiplicity one result for unipotent
packets, and by global methods, the same result for unipotent packets in the
archimedean case.
|
math.RT
|
nous etendons aux groupes orthogonaux et unitaires non quasideployes sur un corps local des resultats de j arthur et de la premiere auteure etablis dans le cas quasideploye en particulier nous obtenons une classification de langlands complete pour les representations temperees dans le cas padique nous en deduisons en utilisant linvolution daubertschneiderstuhler un resultat de multiplicite un dans les paquets unipotents et par des methodes globales le meme resultat pour les paquets unipotents dans le cas archimedien we extend to non quasisplit orthogonal and unitary groups over a local field some results of j arthur and the first author established in the quasisplit case in particular we obtain a full langlands classification for tempered representations in the padic case using aubertschneiderstuhler involution we deduce from this a multiplicity one result for unipotent packets and by global methods the same result for unipotent packets in the archimedean case
|
[['nous', 'etendons', 'aux', 'groupes', 'orthogonaux', 'et', 'unitaires', 'non', 'quasideployes', 'sur', 'un', 'corps', 'local', 'des', 'resultats', 'de', 'j', 'arthur', 'et', 'de', 'la', 'premiere', 'auteure', 'etablis', 'dans', 'le', 'cas', 'quasideploye', 'en', 'particulier', 'nous', 'obtenons', 'une', 'classification', 'de', 'langlands', 'complete', 'pour', 'les', 'representations', 'temperees', 'dans', 'le', 'cas', 'padique', 'nous', 'en', 'deduisons', 'en', 'utilisant', 'linvolution', 'daubertschneiderstuhler', 'un', 'resultat', 'de', 'multiplicite', 'un', 'dans', 'les', 'paquets', 'unipotents', 'et', 'par', 'des', 'methodes', 'globales', 'le', 'meme', 'resultat', 'pour', 'les', 'paquets', 'unipotents', 'dans', 'le', 'cas', 'archimedien', 'we', 'extend', 'to', 'non', 'quasisplit', 'orthogonal', 'and', 'unitary', 'groups', 'over', 'a', 'local', 'field', 'some', 'results', 'of', 'j', 'arthur', 'and', 'the', 'first', 'author', 'established', 'in', 'the', 'quasisplit', 'case', 'in', 'particular', 'we', 'obtain', 'a', 'full', 'langlands', 'classification', 'for', 'tempered', 'representations', 'in', 'the', 'padic', 'case', 'using', 'aubertschneiderstuhler', 'involution', 'we', 'deduce', 'from', 'this', 'a', 'multiplicity', 'one', 'result', 'for', 'unipotent', 'packets', 'and', 'by', 'global', 'methods', 'the', 'same', 'result', 'for', 'unipotent', 'packets', 'in', 'the', 'archimedean', 'case']]
|
[-0.24163588168153513, -0.019987513520417437, -0.23816457299677574, 0.04237061686496642, -0.12109955137028643, -0.11338750862152032, -0.20197114828582582, 0.04935891983315241, -0.1870228881859963, -0.24194700624523818, 0.04826923680451253, -0.33823662063619797, -0.20358668526877527, 0.17323685526523902, -0.32170440041311626, -0.08072713030686947, -0.11673020925440326, -0.07817942600872746, 0.022984813848186448, -0.3673966530899423, 0.27165682598580676, 0.12458183786614993, 0.2975274904372096, -0.12336396114509282, 0.1779177963693181, 0.2638341997601632, 0.04941382333028899, -0.27613721929652535, -0.32639088318008336, 0.0305838193744421, 0.4765081210382472, 0.14894492991700553, 0.20433417392854133, -0.344185761405506, -0.033306451686455504, 0.19557377157152456, 0.14861501664584637, -0.0012868440961397753, 0.05012967501175623, -0.4765688262262341, 0.17002243422768146, -0.29331910706325975, -0.020736965251263176, -0.05828374561657994, -0.10957981005186161, 0.031201543125738997, -0.2372936998102544, 0.16439290211090576, 0.08342124534554887, 0.24508273473981282, -0.06645371700785514, -0.2744349021316115, -0.20897088911168385, 0.0027380864324885, -0.15488313787711272, 0.11150674778374209, 0.005376586826362957, 0.03710097390517215, -0.042849038084766464, 0.26418678936939954, -0.12806650362503919, -0.0580290002491919, 0.1859543238044379, -0.10045166558373476, -0.3745032109259425, 0.041397559437968266, 0.08109287759187915, 0.1867656862444204, 0.2545480630090595, 0.36111212577679247, -0.05035839602013753, 0.05068128957055455, 0.26084323585087404, -0.11442759784572906, 0.08946758101228625, -0.04035835044350529, -0.03387413095375793, -0.24300093806949377, 0.01596992794193152, 0.05693517677296979, -0.20891705473911934, -0.3970695222876426, -0.033624531218674085, 0.10878226858820172, -0.04745144542423499, -0.21747741811956023, 0.19018590793458987, 0.018116723273651325, 0.12539477967589663, 0.14909142795680225, 0.07849900645500832, -0.21301937722128586, -0.13745894997070232, 0.11128737176161098, 0.05887777578291075, 0.095302472471435, 0.18572226006358836, -0.1828797210422952, -0.11142016791711574, 0.3697582741902358]
|
1,803.07663
|
Impact of dissipation on the energy spectrum of experimental turbulence
of gravity surface waves
|
We discuss the impact of dissipation on the development of the energy
spectrum in wave turbulence of gravity surface waves with emphasis on the
effect of surface contamination. We performed experiments in the Coriolis
facility which is a 13-m diameter wave tank. We took care of cleaning surface
contamination as well as possible considering that the surface of water exceeds
100~m$^2$. We observe that for the cleanest condition the frequency energy
spectrum shows a power law decay extending up to the gravity capillary
crossover (14 Hz) with a spectral exponent that is increasing with the forcing
strength and decaying with surface contamination. Although slightly higher than
reported previously in the literature, the exponent for the cleanest water
remains significantly below the prediction from the Weak Turbulence Theory. By
discussing length and time scales, we show that weak turbulence cannot be
expected at frequencies above 3 Hz. We observe with a stereoscopic
reconstruction technique that the increase with the forcing strength of energy
spectrum beyond 3~Hz is mostly due to the formation and strenghtening of bound
waves.
|
physics.flu-dyn
|
we discuss the impact of dissipation on the development of the energy spectrum in wave turbulence of gravity surface waves with emphasis on the effect of surface contamination we performed experiments in the coriolis facility which is a 13m diameter wave tank we took care of cleaning surface contamination as well as possible considering that the surface of water exceeds 100m2 we observe that for the cleanest condition the frequency energy spectrum shows a power law decay extending up to the gravity capillary crossover 14 hz with a spectral exponent that is increasing with the forcing strength and decaying with surface contamination although slightly higher than reported previously in the literature the exponent for the cleanest water remains significantly below the prediction from the weak turbulence theory by discussing length and time scales we show that weak turbulence cannot be expected at frequencies above 3 hz we observe with a stereoscopic reconstruction technique that the increase with the forcing strength of energy spectrum beyond 3hz is mostly due to the formation and strenghtening of bound waves
|
[['we', 'discuss', 'the', 'impact', 'of', 'dissipation', 'on', 'the', 'development', 'of', 'the', 'energy', 'spectrum', 'in', 'wave', 'turbulence', 'of', 'gravity', 'surface', 'waves', 'with', 'emphasis', 'on', 'the', 'effect', 'of', 'surface', 'contamination', 'we', 'performed', 'experiments', 'in', 'the', 'coriolis', 'facility', 'which', 'is', 'a', '13m', 'diameter', 'wave', 'tank', 'we', 'took', 'care', 'of', 'cleaning', 'surface', 'contamination', 'as', 'well', 'as', 'possible', 'considering', 'that', 'the', 'surface', 'of', 'water', 'exceeds', '100m2', 'we', 'observe', 'that', 'for', 'the', 'cleanest', 'condition', 'the', 'frequency', 'energy', 'spectrum', 'shows', 'a', 'power', 'law', 'decay', 'extending', 'up', 'to', 'the', 'gravity', 'capillary', 'crossover', '14', 'hz', 'with', 'a', 'spectral', 'exponent', 'that', 'is', 'increasing', 'with', 'the', 'forcing', 'strength', 'and', 'decaying', 'with', 'surface', 'contamination', 'although', 'slightly', 'higher', 'than', 'reported', 'previously', 'in', 'the', 'literature', 'the', 'exponent', 'for', 'the', 'cleanest', 'water', 'remains', 'significantly', 'below', 'the', 'prediction', 'from', 'the', 'weak', 'turbulence', 'theory', 'by', 'discussing', 'length', 'and', 'time', 'scales', 'we', 'show', 'that', 'weak', 'turbulence', 'can', 'not', 'be', 'expected', 'at', 'frequencies', 'above', '3', 'hz', 'we', 'observe', 'with', 'a', 'stereoscopic', 'reconstruction', 'technique', 'that', 'the', 'increase', 'with', 'the', 'forcing', 'strength', 'of', 'energy', 'spectrum', 'beyond', '3hz', 'is', 'mostly', 'due', 'to', 'the', 'formation', 'and', 'strenghtening', 'of', 'bound', 'waves']]
|
[-0.13847790798698525, 0.19098916029462876, -0.05359787056564569, 0.06239340953610437, -0.05572053474718758, -0.09855653816770951, 0.044477057552470244, 0.3155698081436383, -0.23039992228360837, -0.3320798129685181, 0.08628522547811669, -0.2841564050302078, -0.09090607044008156, 0.2405277636996602, 0.011301941375148162, 0.02159080836437853, 0.042581792132886875, 0.01986574963008785, -0.05020205794056183, -0.16754932529792863, 0.3139197663390893, 0.1479406020114735, 0.27593948685243136, 0.09874749454632822, 0.038847722881342056, -0.06336389264811389, -0.00946491795176335, 0.0194345213838532, -0.17456168077836282, 0.027745896534689066, 0.190861629398466, 0.05989152759755567, 0.232738558292431, -0.3886056278469199, -0.2764271836790998, 0.0694250856055273, 0.11116480706016255, 0.09950781410946748, -0.030113883110652495, -0.2546921078178842, 0.06829932325987914, -0.1497398311914192, -0.14331408545090737, 0.030069582503667827, 0.02309931634193928, 0.01590631868049639, -0.23404264867589888, 0.1302136553248843, 0.04776344531841213, 0.07453402486435101, -0.0898171399449035, -0.11147901920159742, -0.053078348389274235, 0.07954613384553942, 0.10285750481182983, 0.054789510568719633, 0.15135096377393198, -0.14580471563879085, -0.032660767820132316, 0.373797669680526, -0.134011821252163, -0.13431203487134502, 0.20287474061199331, -0.22616126872125572, -0.0798439333231141, 0.18676505712687044, 0.16072993387210335, 0.0489749550829016, -0.07128987277102904, 0.058084202392650296, 0.016873924743211803, 0.2254248032830445, 0.13295553922311187, 0.038522415530031266, 0.19240951017604216, 0.19302778034655135, 0.08566942841661726, 0.13476396260630485, -0.1842607975356007, -0.01012556129404854, -0.2845729403697628, -0.10843086938175114, -0.16630723141791498, 0.04833588071388132, -0.03342821175144725, -0.12430032583658641, 0.3810419549502559, 0.13665701427607466, 0.1516788510532029, 0.07658533655477971, 0.29458741525893156, 0.13788741873445695, 0.08204630997931679, 0.07994359902942837, 0.32027088460317776, 0.11466310324218376, 0.10003538707555351, -0.24830348845597588, 0.018715996766136694, 0.012312930483781433]
|
1,803.07664
|
Order of tangency between manifolds
|
We study the order of tangency between two manifolds of same dimension and
give that notion three quite different geometric interpretations. Related
aspects of the order of tangency, e.g., regular separation exponents, are also
discussed.
|
math.AG math.DG
|
we study the order of tangency between two manifolds of same dimension and give that notion three quite different geometric interpretations related aspects of the order of tangency eg regular separation exponents are also discussed
|
[['we', 'study', 'the', 'order', 'of', 'tangency', 'between', 'two', 'manifolds', 'of', 'same', 'dimension', 'and', 'give', 'that', 'notion', 'three', 'quite', 'different', 'geometric', 'interpretations', 'related', 'aspects', 'of', 'the', 'order', 'of', 'tangency', 'eg', 'regular', 'separation', 'exponents', 'are', 'also', 'discussed']]
|
[-0.22322381945060832, 0.10053816200899227, -0.09774753068174635, 0.133666566280382, -0.060785161743738825, -0.16341182978025504, -0.07044129973011358, 0.3091709242767787, -0.2827955862241132, -0.26713792724268776, 0.11588729478618397, -0.2760172778208341, -0.1970088561198541, 0.18149496146610805, -0.07398777859551565, 0.0100833193265966, -0.013688787884478058, 0.06245649212173053, -0.14404571244626174, -0.2537043638527393, 0.4647333526152319, -0.05832507149981601, 0.24353028642279761, 0.08258273048392896, 0.0638211438698428, -0.05464303810149431, -0.028364791188921247, 0.0875540750500347, -0.2202033579160343, 0.14093684749677776, 0.23988238370844295, 0.06838617602230183, 0.17804848006261245, -0.38200569546648433, -0.14886691587577974, 0.13542498712028775, 0.10003056017407548, -0.001097259803542069, 0.03260120427502053, -0.2383300290043865, 0.10186033405895745, -0.10355043075978757, -0.18905235504997628, -0.07930217385292053, 0.01647587973358376, 0.05387789239175618, -0.1657207729028804, 0.02995735698828607, 0.13294302105371442, 0.13199171245630298, -0.05028053470222013, -0.13714405221066306, -0.03230950558957245, 0.14675867405520485, 0.09269210869180304, -0.04965223395265639, 0.048364270571619274, -0.06225822490773031, -0.19341650921186165, 0.3819430391570287, 0.06561069431980805, -0.21291983744927814, 0.2740872236766985, -0.16965745597013404, -0.17418085409860526, 0.11038417576013931, 0.14083560524242264, 0.11614696688817015, -0.12001348829695156, 0.032720902400823045, 0.0033169763162732126, 0.08188341669738293, 0.18389754315306034, 0.10522939481639436, 0.13589088687939302, 0.06295187436044217, 0.12312493973544665, 0.17779571134597064, -0.052686985794987, -0.1848443002040897, -0.37644583731889725, -0.12987245265394448, -0.0872854834156377, 0.035447365258421216, -0.17187326088772223, -0.15546784877244915, 0.4339521143851536, 0.14591586094881806, 0.2638179524668625, 0.05732455950097314, 0.2383373077426638, 0.04202070092516286, -0.04141632243990898, -0.0003912953726415123, 0.19133295406188283, 0.15275524226682527, 0.031490702022399224, -0.15660288568053926, 0.03270059060305357, 0.16745728109963237]
|
1,803.07665
|
Cavallo's Multiplier for in situ Generation of High Voltage
|
A classic electrostatic induction machine, Cavallo's multiplier, is suggested
for in situ production of very high voltage in cryogenic environments. The
device is suitable for generating a large electrostatic field under conditions
of very small load current. Operation of the Cavallo multiplier is analyzed,
with quantitative description in terms of mutual capacitances between
electrodes in the system. A demonstration apparatus was constructed, and
measured voltages are compared to predictions based on measured capacitances in
the system. The simplicity of the Cavallo multiplier makes it amenable to
electrostatic analysis using finite element software, and electrode shapes can
be optimized to take advantage of a high dielectric strength medium such as
liquid helium. A design study is presented for a Cavallo multiplier in a
large-scale, cryogenic experiment to measure the neutron electric dipole
moment.
|
physics.ins-det
|
a classic electrostatic induction machine cavallos multiplier is suggested for in situ production of very high voltage in cryogenic environments the device is suitable for generating a large electrostatic field under conditions of very small load current operation of the cavallo multiplier is analyzed with quantitative description in terms of mutual capacitances between electrodes in the system a demonstration apparatus was constructed and measured voltages are compared to predictions based on measured capacitances in the system the simplicity of the cavallo multiplier makes it amenable to electrostatic analysis using finite element software and electrode shapes can be optimized to take advantage of a high dielectric strength medium such as liquid helium a design study is presented for a cavallo multiplier in a largescale cryogenic experiment to measure the neutron electric dipole moment
|
[['a', 'classic', 'electrostatic', 'induction', 'machine', 'cavallos', 'multiplier', 'is', 'suggested', 'for', 'in', 'situ', 'production', 'of', 'very', 'high', 'voltage', 'in', 'cryogenic', 'environments', 'the', 'device', 'is', 'suitable', 'for', 'generating', 'a', 'large', 'electrostatic', 'field', 'under', 'conditions', 'of', 'very', 'small', 'load', 'current', 'operation', 'of', 'the', 'cavallo', 'multiplier', 'is', 'analyzed', 'with', 'quantitative', 'description', 'in', 'terms', 'of', 'mutual', 'capacitances', 'between', 'electrodes', 'in', 'the', 'system', 'a', 'demonstration', 'apparatus', 'was', 'constructed', 'and', 'measured', 'voltages', 'are', 'compared', 'to', 'predictions', 'based', 'on', 'measured', 'capacitances', 'in', 'the', 'system', 'the', 'simplicity', 'of', 'the', 'cavallo', 'multiplier', 'makes', 'it', 'amenable', 'to', 'electrostatic', 'analysis', 'using', 'finite', 'element', 'software', 'and', 'electrode', 'shapes', 'can', 'be', 'optimized', 'to', 'take', 'advantage', 'of', 'a', 'high', 'dielectric', 'strength', 'medium', 'such', 'as', 'liquid', 'helium', 'a', 'design', 'study', 'is', 'presented', 'for', 'a', 'cavallo', 'multiplier', 'in', 'a', 'largescale', 'cryogenic', 'experiment', 'to', 'measure', 'the', 'neutron', 'electric', 'dipole', 'moment']]
|
[-0.14279372202595056, 0.10163267699731443, -0.06610469062428723, 0.029609785575192164, -0.03892807464669849, -0.1646697367754772, 0.011105433748484028, 0.3856037470675607, -0.2257059825449215, -0.3094167342935582, 0.048080033112587475, -0.22621752683896187, -0.05888817451880065, 0.2629939604849192, -0.06501858468160375, 0.06609042914129282, 0.060226429106297955, 0.0021219422315595714, -0.06060235278026862, -0.1549825295885911, 0.22526411014744116, 0.11808618917734227, 0.3254013899998128, 0.08759368418045839, 0.12942725382674172, -0.030046354925956663, 0.020534540866483857, 0.05908534235768873, -0.07059550486533468, 0.0637614827759507, 0.28253931649391834, 0.032768730753108516, 0.23864144566006787, -0.46768559688943945, -0.14547620723019566, 0.0441080309416857, 0.057497115165460855, 0.08600215167020454, -0.11977022169388916, -0.2405335903665378, 0.10706317041581141, -0.19505484117095478, -0.11282641323681437, -0.08493016077959128, 0.025072327110283645, 0.07863936272608862, -0.32828433177156646, 0.004273232051263784, 0.008996234236299309, 0.09213466870506073, -0.06706174036473718, -0.10271282600174936, 0.05273235293517586, 0.07717982006373901, -0.010885051416076777, 0.0117516330450432, 0.24646621371996197, -0.10529404854089136, -0.03909886760267479, 0.3456288191369017, -0.08684748742828956, -0.19652766247816697, 0.18980238195650906, -0.16528343014376423, -0.03404620134641367, 0.11559456958211532, 0.12977704671673648, 0.08176521568751062, -0.20863669876094537, 0.0716404742092509, 0.03255816716842979, 0.17734682454571185, 0.09139821729231767, -0.008054486419010253, 0.20948496718272452, 0.23209075662236348, 0.053798830294839416, 0.16097605599264636, -0.09637954953937074, -0.028305706280134332, -0.29088938924064506, -0.18488344820287392, -0.18509759867336345, 0.03862977327107103, -0.03772862224625459, -0.18522829561003748, 0.37300145545021723, 0.12417331052844534, 0.13573783010294135, -0.036284984899898065, 0.3515908714981025, 0.11780569620540664, 0.11115756436901608, -0.018993686442196775, 0.2614675465729514, 0.2097153865398114, 0.12880040706625875, -0.25201361130199657, 0.06748520281478648, 0.0561395064422875]
|
1,803.07666
|
Exciton Control in a Room-Temperature Bulk Semiconductor with Coherent
Strain Pulses
|
The coherent manipulation of excitons in bulk semiconductors via the lattice
degrees of freedom is key to the development of acousto-optic and
acousto-excitonic devices. Wide-bandgap transition metal oxides exhibit
strongly bound excitons that are interesting for applications in the
deep-ultraviolet, but their properties have remained elusive due to the lack of
efficient generation and detection schemes in this spectral range. Here, we
perform ultrafast broadband deep-ultraviolet spectroscopy on anatase TiO$_2$
single crystals at room temperature, and reveal a dramatic modulation of the
exciton peak amplitude due to coherent acoustic phonons. This modulation is
comparable to those of nanostructures where exciton-phonon coupling is enhanced
by quantum confinement, and is accompanied by a giant exciton shift of 30-50
meV. We model these results by many-body perturbation theory and show that the
deformation potential coupling within the nonlinear regime is the main
mechanism for the generation and detection of the coherent acoustic phonons.
Our findings pave the way to the design of exciton control schemes in the
deep-ultraviolet with propagating strain pulses.
|
cond-mat.mtrl-sci
|
the coherent manipulation of excitons in bulk semiconductors via the lattice degrees of freedom is key to the development of acoustooptic and acoustoexcitonic devices widebandgap transition metal oxides exhibit strongly bound excitons that are interesting for applications in the deepultraviolet but their properties have remained elusive due to the lack of efficient generation and detection schemes in this spectral range here we perform ultrafast broadband deepultraviolet spectroscopy on anatase tio_2 single crystals at room temperature and reveal a dramatic modulation of the exciton peak amplitude due to coherent acoustic phonons this modulation is comparable to those of nanostructures where excitonphonon coupling is enhanced by quantum confinement and is accompanied by a giant exciton shift of 3050 mev we model these results by manybody perturbation theory and show that the deformation potential coupling within the nonlinear regime is the main mechanism for the generation and detection of the coherent acoustic phonons our findings pave the way to the design of exciton control schemes in the deepultraviolet with propagating strain pulses
|
[['the', 'coherent', 'manipulation', 'of', 'excitons', 'in', 'bulk', 'semiconductors', 'via', 'the', 'lattice', 'degrees', 'of', 'freedom', 'is', 'key', 'to', 'the', 'development', 'of', 'acoustooptic', 'and', 'acoustoexcitonic', 'devices', 'widebandgap', 'transition', 'metal', 'oxides', 'exhibit', 'strongly', 'bound', 'excitons', 'that', 'are', 'interesting', 'for', 'applications', 'in', 'the', 'deepultraviolet', 'but', 'their', 'properties', 'have', 'remained', 'elusive', 'due', 'to', 'the', 'lack', 'of', 'efficient', 'generation', 'and', 'detection', 'schemes', 'in', 'this', 'spectral', 'range', 'here', 'we', 'perform', 'ultrafast', 'broadband', 'deepultraviolet', 'spectroscopy', 'on', 'anatase', 'tio_2', 'single', 'crystals', 'at', 'room', 'temperature', 'and', 'reveal', 'a', 'dramatic', 'modulation', 'of', 'the', 'exciton', 'peak', 'amplitude', 'due', 'to', 'coherent', 'acoustic', 'phonons', 'this', 'modulation', 'is', 'comparable', 'to', 'those', 'of', 'nanostructures', 'where', 'excitonphonon', 'coupling', 'is', 'enhanced', 'by', 'quantum', 'confinement', 'and', 'is', 'accompanied', 'by', 'a', 'giant', 'exciton', 'shift', 'of', '3050', 'mev', 'we', 'model', 'these', 'results', 'by', 'manybody', 'perturbation', 'theory', 'and', 'show', 'that', 'the', 'deformation', 'potential', 'coupling', 'within', 'the', 'nonlinear', 'regime', 'is', 'the', 'main', 'mechanism', 'for', 'the', 'generation', 'and', 'detection', 'of', 'the', 'coherent', 'acoustic', 'phonons', 'our', 'findings', 'pave', 'the', 'way', 'to', 'the', 'design', 'of', 'exciton', 'control', 'schemes', 'in', 'the', 'deepultraviolet', 'with', 'propagating', 'strain', 'pulses']]
|
[-0.1426087341096718, 0.22326607745760288, -0.032893771243314926, 0.00505204594117545, -0.0381856133485382, -0.13930939323645794, 0.07668047604758092, 0.4578080669799376, -0.2552883531454773, -0.28093538456596434, 0.022517115664890126, -0.2824184452155827, -0.1605534569223112, 0.23600977354466782, 0.018921630646911495, 0.020817954647576527, 0.014617954835384375, -0.09307803492022988, -0.020985167545621238, -0.16056190091655612, 0.25995289923490156, 0.05779458850832141, 0.3517596882274596, 0.13628374364426626, 0.05709682521964645, -0.0026924491144849788, 0.0794255512605776, -0.08917101586675494, -0.12743089721204473, 0.15488741172538584, 0.2768529890260349, -0.0725930261625243, 0.23844225670576893, -0.4194118428055108, -0.2689371873864383, 0.012482895143052918, 0.16762618807340568, 0.19498911234993666, -0.11234922195199899, -0.2786842813449247, 0.06432636872133506, -0.12416052940257248, -0.1025045801721024, -0.09471950189132865, -0.00214591150316188, 0.00625108322163301, -0.2104908356115976, 0.10883578425827659, 0.045924471608097, 0.04309178427294163, -0.08080169359337083, -0.058668218077183976, -0.01602697694796093, 0.05059690252389936, 0.010169536604995042, 0.010628725747145447, 0.16852568586043726, -0.1531845414304241, -0.1458329819724895, 0.4132410577343156, -0.07857788348614815, -0.0573097499381263, 0.18302820363273245, -0.15514630506957128, -0.02095660385453985, 0.1857982211762906, 0.1557179243051602, 0.1380997537108626, -0.10254835438432305, 0.039300292597978286, 0.05248238476980034, 0.197711817410198, 0.060116741470881696, 0.19120577180625073, 0.2354514766844832, 0.21076924333188107, 0.02922414955156412, 0.1055195851104578, -0.09360164705625114, -0.04038906685032305, -0.22289007447016912, -0.14201010170100267, -0.20598378944365928, 0.07142012548588571, -0.04537936563307691, -0.15339637188506977, 0.4319133588135065, 0.1507770301000814, 0.13971543691808447, -0.0552114964673473, 0.28033729173919364, 0.13472356461612175, 0.0946497171424285, -0.015869562214772617, 0.32830580449219615, 0.1917184312547934, 0.09741822429489166, -0.3073422168852717, 0.02905456027587033, -0.01744584383309952]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.