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.07467
Laser Cooling at Resonance
We show experimentally that 3-D laser cooling of lithium atoms is achieved when the laser light is tuned exactly to resonance with the atomic transition. For a theoretical description of this surprising phenomenon we resolve to a full model which takes into account both the entire atomic structure and the laser light polarization. Here we build such a model for $^7$Li atoms cooled on the $D_{2}$-line in a $\sigma^+-\sigma^-$ laser configuration. We take all 24 Zeeman sub-levels into account and obtain good agreement with the experimental data. Moreover, by means of Monte-Carlo simulations we show that coherent processes play an important role in showing consistency between the theory and the experimental results.
cond-mat.quant-gas physics.atom-ph
we show experimentally that 3d laser cooling of lithium atoms is achieved when the laser light is tuned exactly to resonance with the atomic transition for a theoretical description of this surprising phenomenon we resolve to a full model which takes into account both the entire atomic structure and the laser light polarization here we build such a model for 7li atoms cooled on the d_2line in a sigmasigma laser configuration we take all 24 zeeman sublevels into account and obtain good agreement with the experimental data moreover by means of montecarlo simulations we show that coherent processes play an important role in showing consistency between the theory and the experimental results
[['we', 'show', 'experimentally', 'that', '3d', 'laser', 'cooling', 'of', 'lithium', 'atoms', 'is', 'achieved', 'when', 'the', 'laser', 'light', 'is', 'tuned', 'exactly', 'to', 'resonance', 'with', 'the', 'atomic', 'transition', 'for', 'a', 'theoretical', 'description', 'of', 'this', 'surprising', 'phenomenon', 'we', 'resolve', 'to', 'a', 'full', 'model', 'which', 'takes', 'into', 'account', 'both', 'the', 'entire', 'atomic', 'structure', 'and', 'the', 'laser', 'light', 'polarization', 'here', 'we', 'build', 'such', 'a', 'model', 'for', '7li', 'atoms', 'cooled', 'on', 'the', 'd_2line', 'in', 'a', 'sigmasigma', 'laser', 'configuration', 'we', 'take', 'all', '24', 'zeeman', 'sublevels', 'into', 'account', 'and', 'obtain', 'good', 'agreement', 'with', 'the', 'experimental', 'data', 'moreover', 'by', 'means', 'of', 'montecarlo', 'simulations', 'we', 'show', 'that', 'coherent', 'processes', 'play', 'an', 'important', 'role', 'in', 'showing', 'consistency', 'between', 'the', 'theory', 'and', 'the', 'experimental', 'results']]
[-0.06342979917761048, 0.17448392971159224, -0.07226712692545743, 0.06674192026614102, 0.01824986987520714, -0.1214263475550389, 0.07609247076136337, 0.45310653118534133, -0.24155684841612168, -0.3041278606297465, -0.014226097787671664, -0.2539314654894878, -0.09535070589684823, 0.22473740260964176, 0.04222470580501616, 0.020930207628119098, 0.09953230337516682, -0.03129023101667429, -0.018279801361967583, -0.18746682839061193, 0.2761035352349617, 0.062020232483822234, 0.2778089852282056, 0.08600367836419258, 0.12881730764219118, 0.007525722869579588, 0.057227225852542904, 0.005572053452802671, -0.14829991668578643, 0.09065622285109114, 0.22253885202797818, 0.058267137937684045, 0.22321738010935216, -0.48396544571261146, -0.2213994019354383, 0.0764310808940413, 0.13520531023266255, 0.19433074835834707, -0.09869176771613425, -0.2803831763213148, 0.024660067200694268, -0.11291896303075256, -0.11031117881354582, -0.1131540479490886, -0.01912275095562543, -0.0012619033002772846, -0.3088050390208803, -0.008644679468964134, 0.076049907370009, 0.07209228840866336, -0.11577966488763555, -0.07279368367482413, 0.0010470494414000092, 0.10411272600722113, -0.01989791167035766, 0.033746269225302314, 0.11231170633707095, -0.09453016837433753, -0.0682089922987428, 0.40822917884761084, -0.11038473269457484, -0.10246276941089073, 0.1237197254893479, -0.17862129826014778, -0.09478806745395199, 0.12577983153027458, 0.12247657890406412, 0.07074088455169453, -0.08051877341619672, 0.04429408452140067, -0.056508419724802174, 0.22172600924045788, 0.050097063899057, 0.05321101343980519, 0.20884306236749162, 0.20773677011691705, -0.015606829005100572, 0.1529835858025697, -0.10247124552617672, -0.12459269415603967, -0.2763576345132278, -0.14660279507127902, -0.13059525623988896, 0.05818200078902993, -0.04621833204860728, -0.08915598191287336, 0.3795667419520517, 0.18406203197030066, 0.2311821760324476, -0.04391653498378792, 0.3390153794851456, 0.12611382595171128, 0.03968161409028579, -0.0001910394351291764, 0.29643978294811574, 0.14842225540102133, 0.04388562264759933, -0.2848474036331649, 0.020103817553939047, 0.0029334779073660437]
1,803.07468
Equiangular tight frames from group divisible designs
An equiangular tight frame (ETF) is a type of optimal packing of lines in a real or complex Hilbert space. In the complex case, the existence of an ETF of a given size remains an open problem in many cases. In this paper, we observe that many of the known constructions of ETFs are of one of two types. We further provide a new method for combining a given ETF of one of these two types with an appropriate group divisible design (GDD) in order to produce a larger ETF of the same type. By applying this method to known families of ETFs and GDDs, we obtain several new infinite families of ETFs. The real instances of these ETFs correspond to several new infinite families of strongly regular graphs. Our approach was inspired by a seminal paper of Davis and Jedwab which both unified and generalized McFarland and Spence difference sets. We provide combinatorial analogs of their algebraic results, unifying Steiner ETFs with hyperoval ETFs and Tremain ETFs.
math.FA math.CO
an equiangular tight frame etf is a type of optimal packing of lines in a real or complex hilbert space in the complex case the existence of an etf of a given size remains an open problem in many cases in this paper we observe that many of the known constructions of etfs are of one of two types we further provide a new method for combining a given etf of one of these two types with an appropriate group divisible design gdd in order to produce a larger etf of the same type by applying this method to known families of etfs and gdds we obtain several new infinite families of etfs the real instances of these etfs correspond to several new infinite families of strongly regular graphs our approach was inspired by a seminal paper of davis and jedwab which both unified and generalized mcfarland and spence difference sets we provide combinatorial analogs of their algebraic results unifying steiner etfs with hyperoval etfs and tremain etfs
[['an', 'equiangular', 'tight', 'frame', 'etf', 'is', 'a', 'type', 'of', 'optimal', 'packing', 'of', 'lines', 'in', 'a', 'real', 'or', 'complex', 'hilbert', 'space', 'in', 'the', 'complex', 'case', 'the', 'existence', 'of', 'an', 'etf', 'of', 'a', 'given', 'size', 'remains', 'an', 'open', 'problem', 'in', 'many', 'cases', 'in', 'this', 'paper', 'we', 'observe', 'that', 'many', 'of', 'the', 'known', 'constructions', 'of', 'etfs', 'are', 'of', 'one', 'of', 'two', 'types', 'we', 'further', 'provide', 'a', 'new', 'method', 'for', 'combining', 'a', 'given', 'etf', 'of', 'one', 'of', 'these', 'two', 'types', 'with', 'an', 'appropriate', 'group', 'divisible', 'design', 'gdd', 'in', 'order', 'to', 'produce', 'a', 'larger', 'etf', 'of', 'the', 'same', 'type', 'by', 'applying', 'this', 'method', 'to', 'known', 'families', 'of', 'etfs', 'and', 'gdds', 'we', 'obtain', 'several', 'new', 'infinite', 'families', 'of', 'etfs', 'the', 'real', 'instances', 'of', 'these', 'etfs', 'correspond', 'to', 'several', 'new', 'infinite', 'families', 'of', 'strongly', 'regular', 'graphs', 'our', 'approach', 'was', 'inspired', 'by', 'a', 'seminal', 'paper', 'of', 'davis', 'and', 'jedwab', 'which', 'both', 'unified', 'and', 'generalized', 'mcfarland', 'and', 'spence', 'difference', 'sets', 'we', 'provide', 'combinatorial', 'analogs', 'of', 'their', 'algebraic', 'results', 'unifying', 'steiner', 'etfs', 'with', 'hyperoval', 'etfs', 'and', 'tremain', 'etfs']]
[-0.131208516183326, 0.06507890555808253, -0.05525369052796117, 0.09115700856963742, -0.04477997238240288, -0.10564245916847251, 0.04825982424252092, 0.374050708153023, -0.26534682545813726, -0.2883333969766464, 0.10674513849268756, -0.26114409248495174, -0.1866230092431045, 0.26204640162665355, -0.12623927700974627, 0.022346980825155793, 0.022244915028777488, 0.015074861841345998, -0.07310309849917704, -0.33040340919839495, 0.35342333822031535, -0.006114652774207472, 0.2398271767623321, 0.015822116645264946, 0.10168193352776775, -0.004434951679961627, -0.03478055677661104, 0.04626229332546621, -0.11930246786570803, 0.23084756614247193, 0.26054935319722816, 0.14723954739015616, 0.26572445739886, -0.3575826606261516, -0.1561974172151374, 0.16549524879166688, 0.11719913871869624, 0.1010771900726326, -0.05965901780343743, -0.2465680651868621, 0.036931681036837624, -0.16171986389972134, -0.13591136799812942, -0.0608694463533288, 0.05952604051991672, 0.06186963421777783, -0.2575513483777999, -0.006120718767431504, 0.10224521048868934, 0.05172669237289957, -0.08539459387308912, -0.13302307600966895, 0.051216221251385564, 0.11531543336713876, -0.0030817211045141885, -0.03658599347088062, -0.013406182173639536, -0.029112688720945693, -0.17049736122483622, 0.38186672092052903, -0.026181070666974914, -0.21980829346188885, 0.19481773087810614, -0.10168269799721098, -0.17474677550612006, 0.11352046313807145, 0.18547012375299624, 0.12893960011487235, -0.12254676298087763, 0.10118397894074226, -0.15822021225969235, 0.11922100840155928, 0.1379025629094194, 0.03948107219724999, 0.144854856108477, 0.11399395613091813, 0.08821696921357673, 0.18189834319313006, 0.010367095003372984, -0.08180134598734583, -0.28154435501751784, -0.15382385990877975, -0.14366747506944363, 0.027610699846939056, -0.15775816494968098, -0.22948958390687932, 0.4001517722879475, 0.08394503937114008, 0.2053315223440037, 0.0947504449798865, 0.20334226116858714, 0.05030083006964495, 0.04526392235504296, 0.07409350360983503, 0.18978251161577994, 0.10869314055611005, 0.016241343623629497, -0.1047937351858946, -0.014294008513519396, 0.10202760197233386]
1,803.07469
MAGSAC: marginalizing sample consensus
A method called, sigma-consensus, is proposed to eliminate the need for a user-defined inlier-outlier threshold in RANSAC. Instead of estimating the noise sigma, it is marginalized over a range of noise scales. The optimized model is obtained by weighted least-squares fitting where the weights come from the marginalization over sigma of the point likelihoods of being inliers. A new quality function is proposed not requiring sigma and, thus, a set of inliers to determine the model quality. Also, a new termination criterion for RANSAC is built on the proposed marginalization approach. Applying sigma-consensus, MAGSAC is proposed with no need for a user-defined sigma and improving the accuracy of robust estimation significantly. It is superior to the state-of-the-art in terms of geometric accuracy on publicly available real-world datasets for epipolar geometry (F and E) and homography estimation. In addition, applying sigma-consensus only once as a post-processing step to the RANSAC output always improved the model quality on a wide range of vision problems without noticeable deterioration in processing time, adding a few milliseconds. The source code is at https://github.com/danini/magsac.
cs.CV
a method called sigmaconsensus is proposed to eliminate the need for a userdefined inlieroutlier threshold in ransac instead of estimating the noise sigma it is marginalized over a range of noise scales the optimized model is obtained by weighted leastsquares fitting where the weights come from the marginalization over sigma of the point likelihoods of being inliers a new quality function is proposed not requiring sigma and thus a set of inliers to determine the model quality also a new termination criterion for ransac is built on the proposed marginalization approach applying sigmaconsensus magsac is proposed with no need for a userdefined sigma and improving the accuracy of robust estimation significantly it is superior to the stateoftheart in terms of geometric accuracy on publicly available realworld datasets for epipolar geometry f and e and homography estimation in addition applying sigmaconsensus only once as a postprocessing step to the ransac output always improved the model quality on a wide range of vision problems without noticeable deterioration in processing time adding a few milliseconds the source code is at httpsgithubcomdaninimagsac
[['a', 'method', 'called', 'sigmaconsensus', 'is', 'proposed', 'to', 'eliminate', 'the', 'need', 'for', 'a', 'userdefined', 'inlieroutlier', 'threshold', 'in', 'ransac', 'instead', 'of', 'estimating', 'the', 'noise', 'sigma', 'it', 'is', 'marginalized', 'over', 'a', 'range', 'of', 'noise', 'scales', 'the', 'optimized', 'model', 'is', 'obtained', 'by', 'weighted', 'leastsquares', 'fitting', 'where', 'the', 'weights', 'come', 'from', 'the', 'marginalization', 'over', 'sigma', 'of', 'the', 'point', 'likelihoods', 'of', 'being', 'inliers', 'a', 'new', 'quality', 'function', 'is', 'proposed', 'not', 'requiring', 'sigma', 'and', 'thus', 'a', 'set', 'of', 'inliers', 'to', 'determine', 'the', 'model', 'quality', 'also', 'a', 'new', 'termination', 'criterion', 'for', 'ransac', 'is', 'built', 'on', 'the', 'proposed', 'marginalization', 'approach', 'applying', 'sigmaconsensus', 'magsac', 'is', 'proposed', 'with', 'no', 'need', 'for', 'a', 'userdefined', 'sigma', 'and', 'improving', 'the', 'accuracy', 'of', 'robust', 'estimation', 'significantly', 'it', 'is', 'superior', 'to', 'the', 'stateoftheart', 'in', 'terms', 'of', 'geometric', 'accuracy', 'on', 'publicly', 'available', 'realworld', 'datasets', 'for', 'epipolar', 'geometry', 'f', 'and', 'e', 'and', 'homography', 'estimation', 'in', 'addition', 'applying', 'sigmaconsensus', 'only', 'once', 'as', 'a', 'postprocessing', 'step', 'to', 'the', 'ransac', 'output', 'always', 'improved', 'the', 'model', 'quality', 'on', 'a', 'wide', 'range', 'of', 'vision', 'problems', 'without', 'noticeable', 'deterioration', 'in', 'processing', 'time', 'adding', 'a', 'few', 'milliseconds', 'the', 'source', 'code', 'is', 'at', 'httpsgithubcomdaninimagsac']]
[-0.05612910131258624, -0.016869506913104227, -0.0726922028431935, 0.04973162425814995, -0.09306805321680647, -0.16692767318604249, 0.0755590924088444, 0.4000465694389173, -0.2601514143975718, -0.36319149882565915, 0.10275103369727731, -0.23717651355479444, -0.08923298685013184, 0.23344849946110377, -0.1057441624945828, 0.10773866280381168, 0.11757635203589287, 0.043261903127921476, -0.10799136312678456, -0.28486701624068833, 0.25208335101205326, 0.07488790335266718, 0.2844375114675079, 0.008366035811736115, 0.14275009922130266, -0.0003788945810603244, -0.047500653446851566, 0.03966726544712271, -0.06343687029688486, 0.11804699758866004, 0.23121286817959377, 0.17897966844961047, 0.29250739623925515, -0.31686498974449934, -0.2645041701437107, 0.12700201723258941, 0.12580403905228846, 0.08291457466731247, -0.01709897602642221, -0.2864040052717818, 0.12453547644828047, -0.14410309688587275, -0.0264641271052616, -0.08719230712391436, -0.018534223181860786, -0.03148547679984144, -0.3395876402434494, 0.06926473335878525, 0.04113417039492301, 0.057656358161142895, -0.018224001140998942, -0.14493726616592278, -0.0015745791007897685, 0.10743203257077506, -0.0033736816427803466, 0.09227248288092336, 0.1311610568501055, -0.14940966032977615, -0.08335299723116416, 0.3716156821165766, -0.06439728948620281, -0.25170623275318316, 0.1350607797011201, -0.04479281028067427, -0.11526274009208594, 0.17447028338909149, 0.17699597888759205, 0.10452815167871969, -0.15666039092998418, 0.06339413571171462, -0.00606238595193385, 0.2126656200405809, 0.06525710021810872, -0.03542874425183982, 0.14901667943290833, 0.20339433066546916, 0.09708262017262834, 0.12039817917559828, -0.14361627607988858, -0.037902117151367876, -0.29919570458254646, -0.0881781280652753, -0.20980655300830092, -0.025561961788334885, -0.13114010351543715, -0.17746297770845038, 0.4187102989692773, 0.19986261623778515, 0.196165697894425, 0.09863050880110158, 0.354351172399308, 0.10274604195071983, 0.09044302025144654, 0.07125685090731297, 0.19987455852861916, 0.060218356492779485, 0.034102307866061374, -0.17389775463113827, 0.1002664378152362, 0.04602354198428137]
1,803.0747
Finding Dynamics for Fractals
The famous Laplace's Demon is not only of strict physical determinism, but also related to the power of differential equations. When deterministically extended structures are taken into consideration, it is admissible that fractals are dense both in the nature and in the dynamics. In particular, this is true because fractal structures are closely related to chaos. This implies that dynamics have to be an instrument of the extension. Oppositely, one can animate the arguments for the Demon if dynamics will be investigated with fractals. To make advances in the direction, first of all, one should consider fractals as states of dynamics. In other words, instead of single points and finite/infinite dimensional vectors, fractals should be points of trajectories as well as trajectories themselves. If one realizes this approach, fractals will be proved to be dense in the universe, since modeling the real world is based on differential equations and their developments. Our main goal is to initiate the involvement of fractals as states of dynamical systems, and in the first step we answer the simple question "How can fractals be mapped?". In the present study Julia and Mandelbrot sets are considered as initial points for the trajectories of the dynamics.
math.DS
the famous laplaces demon is not only of strict physical determinism but also related to the power of differential equations when deterministically extended structures are taken into consideration it is admissible that fractals are dense both in the nature and in the dynamics in particular this is true because fractal structures are closely related to chaos this implies that dynamics have to be an instrument of the extension oppositely one can animate the arguments for the demon if dynamics will be investigated with fractals to make advances in the direction first of all one should consider fractals as states of dynamics in other words instead of single points and finiteinfinite dimensional vectors fractals should be points of trajectories as well as trajectories themselves if one realizes this approach fractals will be proved to be dense in the universe since modeling the real world is based on differential equations and their developments our main goal is to initiate the involvement of fractals as states of dynamical systems and in the first step we answer the simple question how can fractals be mapped in the present study julia and mandelbrot sets are considered as initial points for the trajectories of the dynamics
[['the', 'famous', 'laplaces', 'demon', 'is', 'not', 'only', 'of', 'strict', 'physical', 'determinism', 'but', 'also', 'related', 'to', 'the', 'power', 'of', 'differential', 'equations', 'when', 'deterministically', 'extended', 'structures', 'are', 'taken', 'into', 'consideration', 'it', 'is', 'admissible', 'that', 'fractals', 'are', 'dense', 'both', 'in', 'the', 'nature', 'and', 'in', 'the', 'dynamics', 'in', 'particular', 'this', 'is', 'true', 'because', 'fractal', 'structures', 'are', 'closely', 'related', 'to', 'chaos', 'this', 'implies', 'that', 'dynamics', 'have', 'to', 'be', 'an', 'instrument', 'of', 'the', 'extension', 'oppositely', 'one', 'can', 'animate', 'the', 'arguments', 'for', 'the', 'demon', 'if', 'dynamics', 'will', 'be', 'investigated', 'with', 'fractals', 'to', 'make', 'advances', 'in', 'the', 'direction', 'first', 'of', 'all', 'one', 'should', 'consider', 'fractals', 'as', 'states', 'of', 'dynamics', 'in', 'other', 'words', 'instead', 'of', 'single', 'points', 'and', 'finiteinfinite', 'dimensional', 'vectors', 'fractals', 'should', 'be', 'points', 'of', 'trajectories', 'as', 'well', 'as', 'trajectories', 'themselves', 'if', 'one', 'realizes', 'this', 'approach', 'fractals', 'will', 'be', 'proved', 'to', 'be', 'dense', 'in', 'the', 'universe', 'since', 'modeling', 'the', 'real', 'world', 'is', 'based', 'on', 'differential', 'equations', 'and', 'their', 'developments', 'our', 'main', 'goal', 'is', 'to', 'initiate', 'the', 'involvement', 'of', 'fractals', 'as', 'states', 'of', 'dynamical', 'systems', 'and', 'in', 'the', 'first', 'step', 'we', 'answer', 'the', 'simple', 'question', 'how', 'can', 'fractals', 'be', 'mapped', 'in', 'the', 'present', 'study', 'julia', 'and', 'mandelbrot', 'sets', 'are', 'considered', 'as', 'initial', 'points', 'for', 'the', 'trajectories', 'of', 'the', 'dynamics']]
[-0.10783155178069137, 0.1274456409674167, -0.13492053559100894, 0.09484064008807763, -0.08058221221202984, -0.1113349532391294, -0.014284208903554828, 0.3307387816160917, -0.3090869988920167, -0.24405772432219236, 0.1295011126366444, -0.284714076093951, -0.18133557242224924, 0.20684551715414273, -0.07889419361832552, 0.03442326460964978, 0.05032870714552701, 0.03641603232827038, 0.015019493114086799, -0.25726208777283316, 0.34992199319181966, 0.02716111718909815, 0.23864864554372617, 0.026387285859091208, 0.07189169940538705, -0.043443935936593334, 0.00215375594314537, 0.050466687984298916, -0.08433302104043833, 0.09581618043186609, 0.2681600345717743, 0.13117342270328664, 0.25955230796709655, -0.43774014374706893, -0.2205630608741194, 0.10648118557641283, 0.1584814034739975, 0.0917482230468886, 0.009527663045446388, -0.2909603303298354, 0.08716834508464671, -0.07550019552116283, -0.16520077065331862, -0.08761218418367207, 0.045478093990823254, 0.06017400339595042, -0.19965972140489613, 0.03812481208806275, 0.0926205106404086, 0.025028880848549307, -0.04482474439981161, -0.05173126947833225, -0.03905040463199839, 0.1578317852523469, 0.005892879042253298, -0.002502353199524805, 0.11471898401854559, -0.08548862230196391, -0.15951343801571055, 0.4281106697022915, -0.015629359651939012, -0.26838064479641616, 0.20846719676745123, -0.18665785459568723, -0.16651777359831613, 0.09869716755405535, 0.17804517914366444, 0.09777225871803238, -0.1626829927360086, 0.09091011376294773, -0.0689276081044227, 0.15301427983213217, 0.06795490879623685, 0.017611371488310396, 0.21937156644649802, 0.16009084134129808, 0.06408992881537415, 0.13747919410612666, -0.003782021884107962, -0.14734413559781387, -0.28397325630299747, -0.16371674208028708, -0.18941235503240023, 0.06023540448986751, -0.03555326998197415, -0.16390546922862995, 0.36214283361216076, 0.16636802535183962, 0.2298646788741462, 0.00271638207254, 0.24564522589789703, 0.12867395511828364, 0.0606092259043362, 0.06784919082652778, 0.2106344365561381, 0.10348553321149666, 0.09190014954656363, -0.14225169105804525, 0.05004879020852968, 0.08877860893961043]
1,803.07471
Collective dissolution of microbubbles
A microscopic bubble of soluble gas always dissolves in finite time in an under-saturated fluid. This diffusive process is driven by the difference between the gas concentration near the bubble, whose value is governed by the internal pressure through Henry's law, and the concentration in the far field. The presence of neighbouring bubbles can significantly slow down this process by increasing the effective background concentration and reducing the diffusing flux of dissolved gas experienced by each bubble. We develop theoretical modelling of such diffusive shielding process in the case of small microbubbles whose internal pressure is dominated by Laplace pressure. We first use an exact semi-analytical solution to capture the case of two bubbles, analyse in detail the shielding effect and show that hydrodynamic effects are mostly negligible except in the case of almost-touching bubbles. In order to tackle the case of multiple bubbles, we then derive and validate two analytical approximate yet generic frameworks, first using the method of reflections and then by proposing a self-consistent continuum description. Using both modelling frameworks, we examine the dissolution of regular 1D, 2D and 3D bubble lattices. Bubbles located at the edge of the lattices dissolve first, while innermost bubbles benefit from the diffusive shielding effect, leading to the inward propagation of a dissolution front within the lattice. We show that diffusive shielding leads to severalfold increases in the dissolution time which grows logarithmically with the number of bubbles in 1D-lattices and algebraically in two and three dimensions, scaling respectively as its square root and 2/3-power. We further illustrate the sensitivity of the dissolution patterns to initial fluctuations in bubble size or arrangement in the case of large and dense lattices, as well as non-intuitive oscillatory effects.
physics.flu-dyn cond-mat.soft
a microscopic bubble of soluble gas always dissolves in finite time in an undersaturated fluid this diffusive process is driven by the difference between the gas concentration near the bubble whose value is governed by the internal pressure through henrys law and the concentration in the far field the presence of neighbouring bubbles can significantly slow down this process by increasing the effective background concentration and reducing the diffusing flux of dissolved gas experienced by each bubble we develop theoretical modelling of such diffusive shielding process in the case of small microbubbles whose internal pressure is dominated by laplace pressure we first use an exact semianalytical solution to capture the case of two bubbles analyse in detail the shielding effect and show that hydrodynamic effects are mostly negligible except in the case of almosttouching bubbles in order to tackle the case of multiple bubbles we then derive and validate two analytical approximate yet generic frameworks first using the method of reflections and then by proposing a selfconsistent continuum description using both modelling frameworks we examine the dissolution of regular 1d 2d and 3d bubble lattices bubbles located at the edge of the lattices dissolve first while innermost bubbles benefit from the diffusive shielding effect leading to the inward propagation of a dissolution front within the lattice we show that diffusive shielding leads to severalfold increases in the dissolution time which grows logarithmically with the number of bubbles in 1dlattices and algebraically in two and three dimensions scaling respectively as its square root and 23power we further illustrate the sensitivity of the dissolution patterns to initial fluctuations in bubble size or arrangement in the case of large and dense lattices as well as nonintuitive oscillatory effects
[['a', 'microscopic', 'bubble', 'of', 'soluble', 'gas', 'always', 'dissolves', 'in', 'finite', 'time', 'in', 'an', 'undersaturated', 'fluid', 'this', 'diffusive', 'process', 'is', 'driven', 'by', 'the', 'difference', 'between', 'the', 'gas', 'concentration', 'near', 'the', 'bubble', 'whose', 'value', 'is', 'governed', 'by', 'the', 'internal', 'pressure', 'through', 'henrys', 'law', 'and', 'the', 'concentration', 'in', 'the', 'far', 'field', 'the', 'presence', 'of', 'neighbouring', 'bubbles', 'can', 'significantly', 'slow', 'down', 'this', 'process', 'by', 'increasing', 'the', 'effective', 'background', 'concentration', 'and', 'reducing', 'the', 'diffusing', 'flux', 'of', 'dissolved', 'gas', 'experienced', 'by', 'each', 'bubble', 'we', 'develop', 'theoretical', 'modelling', 'of', 'such', 'diffusive', 'shielding', 'process', 'in', 'the', 'case', 'of', 'small', 'microbubbles', 'whose', 'internal', 'pressure', 'is', 'dominated', 'by', 'laplace', 'pressure', 'we', 'first', 'use', 'an', 'exact', 'semianalytical', 'solution', 'to', 'capture', 'the', 'case', 'of', 'two', 'bubbles', 'analyse', 'in', 'detail', 'the', 'shielding', 'effect', 'and', 'show', 'that', 'hydrodynamic', 'effects', 'are', 'mostly', 'negligible', 'except', 'in', 'the', 'case', 'of', 'almosttouching', 'bubbles', 'in', 'order', 'to', 'tackle', 'the', 'case', 'of', 'multiple', 'bubbles', 'we', 'then', 'derive', 'and', 'validate', 'two', 'analytical', 'approximate', 'yet', 'generic', 'frameworks', 'first', 'using', 'the', 'method', 'of', 'reflections', 'and', 'then', 'by', 'proposing', 'a', 'selfconsistent', 'continuum', 'description', 'using', 'both', 'modelling', 'frameworks', 'we', 'examine', 'the', 'dissolution', 'of', 'regular', '1d', '2d', 'and', '3d', 'bubble', 'lattices', 'bubbles', 'located', 'at', 'the', 'edge', 'of', 'the', 'lattices', 'dissolve', 'first', 'while', 'innermost', 'bubbles', 'benefit', 'from', 'the', 'diffusive', 'shielding', 'effect', 'leading', 'to', 'the', 'inward', 'propagation', 'of', 'a', 'dissolution', 'front', 'within', 'the', 'lattice', 'we', 'show', 'that', 'diffusive', 'shielding', 'leads', 'to', 'severalfold', 'increases', 'in', 'the', 'dissolution', 'time', 'which', 'grows', 'logarithmically', 'with', 'the', 'number', 'of', 'bubbles', 'in', '1dlattices', 'and', 'algebraically', 'in', 'two', 'and', 'three', 'dimensions', 'scaling', 'respectively', 'as', 'its', 'square', 'root', 'and', '23power', 'we', 'further', 'illustrate', 'the', 'sensitivity', 'of', 'the', 'dissolution', 'patterns', 'to', 'initial', 'fluctuations', 'in', 'bubble', 'size', 'or', 'arrangement', 'in', 'the', 'case', 'of', 'large', 'and', 'dense', 'lattices', 'as', 'well', 'as', 'nonintuitive', 'oscillatory', 'effects']]
[-0.09260187019711663, 0.17969627389875603, -0.04596491755799196, 0.032384951419890735, -0.013416548350055837, -0.07494502291478243, 0.05170764265435521, 0.3458237066114644, -0.2823344943691177, -0.28823441343362255, 0.09679210614149751, -0.2818182773522822, -0.11415061481912413, 0.13285851757644343, 0.00858380351307746, -0.009336954557999981, -0.010381118569468797, -0.014053779953676062, -0.037544511962441775, -0.2156077242594594, 0.30194069018551273, 0.0737663932200587, 0.2691207929232977, 0.07783785865266969, 0.07107603998999555, -0.045125237204522786, -0.027950077557890238, 0.07282378406892448, -0.15180056713310247, 0.04853967884423823, 0.1724357891004276, 0.018666688053352042, 0.2436752190086135, -0.5058422700597415, -0.22865351273056264, 0.06695047235725178, 0.20070434677046017, 0.1240257457249992, -0.06187632759208643, -0.2502596917506242, 0.026269330421393546, -0.17317590537125593, -0.19802124162826543, -0.009041184541364546, 0.027120349080097784, 0.035732584358596116, -0.23044672042835676, 0.13943487695982276, 0.06261910589587917, 0.0361873482188618, -0.08519011756113991, -0.07055865531267315, -0.03069638762978488, 0.10449068438074166, 0.0656979849500139, -0.011830588508983119, 0.183311505172428, -0.15707710619634116, -0.038035239336531704, 0.3900841121058319, -0.08448929467909828, -0.1625062227874415, 0.22423208145549778, -0.19548878131971972, -0.052181911605921186, 0.20327334538062658, 0.17070381930459935, 0.08780357523364374, -0.13622176945670228, 0.051687872847262444, -0.006594621296642947, 0.12819512616332898, 0.10296045949225159, -0.03240884499305155, 0.2100104888729988, 0.19530378532342535, 0.027802481245275838, 0.1885183863144355, -0.11386080560777928, -0.11365233573983605, -0.28482961080813707, -0.14996323518886134, -0.1559184929602796, 0.017853077700980297, -0.11522363509944568, -0.17612421903068154, 0.3227178536762949, 0.12072104797945374, 0.1816389073075582, 0.01840441255762765, 0.2843506344965932, 0.09076636389774918, 0.03178487334551797, 0.10269162683325961, 0.23304846044300723, 0.11092807814666455, 0.07432292752188396, -0.27696434987376545, 0.06055300920879198, 0.06297652087052592]
1,803.07472
Acoustic funnel and buncher for nanoparticle injection
Acoustics-based techniques are investigated to focus and bunch nanoparticle beams. This allows to overcome the prominent problem of the longitudinal and transverse mismatch of particle stream and x-ray beam in single-particle/single molecule imaging at x-ray free-electron lasers (XFEL). It will also enable synchronised injection of particle streams at kHz repetition rates. Transverse focusing concentrates the particle flux to the (sub)micrometer x-ray focus. In the longitudinal direction, focused acoustic waves can be used to bunch the particle to the same repetition rate as the x-ray pulses. The acoustic manipulation is based on simple mechanical recoil effects and could be advantageous over light-pressure-based methods, which rely on absorption. The acoustic equipment is easy to implement and can be conveniently inserted into current XFEL endstations. With the proposed method, data collection times could be reduced by a factor of $10^4$. This work does not just provide an efficient method for acoustic manipulation of streams of arbitrary gas phase particles, but also opens up wide avenues for acoustics-based particle optics.
physics.app-ph
acousticsbased techniques are investigated to focus and bunch nanoparticle beams this allows to overcome the prominent problem of the longitudinal and transverse mismatch of particle stream and xray beam in singleparticlesingle molecule imaging at xray freeelectron lasers xfel it will also enable synchronised injection of particle streams at khz repetition rates transverse focusing concentrates the particle flux to the submicrometer xray focus in the longitudinal direction focused acoustic waves can be used to bunch the particle to the same repetition rate as the xray pulses the acoustic manipulation is based on simple mechanical recoil effects and could be advantageous over lightpressurebased methods which rely on absorption the acoustic equipment is easy to implement and can be conveniently inserted into current xfel endstations with the proposed method data collection times could be reduced by a factor of 104 this work does not just provide an efficient method for acoustic manipulation of streams of arbitrary gas phase particles but also opens up wide avenues for acousticsbased particle optics
[['acousticsbased', 'techniques', 'are', 'investigated', 'to', 'focus', 'and', 'bunch', 'nanoparticle', 'beams', 'this', 'allows', 'to', 'overcome', 'the', 'prominent', 'problem', 'of', 'the', 'longitudinal', 'and', 'transverse', 'mismatch', 'of', 'particle', 'stream', 'and', 'xray', 'beam', 'in', 'singleparticlesingle', 'molecule', 'imaging', 'at', 'xray', 'freeelectron', 'lasers', 'xfel', 'it', 'will', 'also', 'enable', 'synchronised', 'injection', 'of', 'particle', 'streams', 'at', 'khz', 'repetition', 'rates', 'transverse', 'focusing', 'concentrates', 'the', 'particle', 'flux', 'to', 'the', 'submicrometer', 'xray', 'focus', 'in', 'the', 'longitudinal', 'direction', 'focused', 'acoustic', 'waves', 'can', 'be', 'used', 'to', 'bunch', 'the', 'particle', 'to', 'the', 'same', 'repetition', 'rate', 'as', 'the', 'xray', 'pulses', 'the', 'acoustic', 'manipulation', 'is', 'based', 'on', 'simple', 'mechanical', 'recoil', 'effects', 'and', 'could', 'be', 'advantageous', 'over', 'lightpressurebased', 'methods', 'which', 'rely', 'on', 'absorption', 'the', 'acoustic', 'equipment', 'is', 'easy', 'to', 'implement', 'and', 'can', 'be', 'conveniently', 'inserted', 'into', 'current', 'xfel', 'endstations', 'with', 'the', 'proposed', 'method', 'data', 'collection', 'times', 'could', 'be', 'reduced', 'by', 'a', 'factor', 'of', '104', 'this', 'work', 'does', 'not', 'just', 'provide', 'an', 'efficient', 'method', 'for', 'acoustic', 'manipulation', 'of', 'streams', 'of', 'arbitrary', 'gas', 'phase', 'particles', 'but', 'also', 'opens', 'up', 'wide', 'avenues', 'for', 'acousticsbased', 'particle', 'optics']]
[-0.07685569804566401, 0.20779868038081942, -0.06218208175254759, 0.05159231561247441, -0.10799482465358223, -0.16416462304116022, 0.009518822858808562, 0.45862031541764736, -0.25317513359257693, -0.31318101508503143, 0.08295117136482831, -0.24913873940448222, -0.01861517994718558, 0.3012718115769974, -0.027320657640258303, 0.0906641226767267, 0.07099087512767988, -0.03025055127683317, -0.006321688845651451, -0.18618591989283365, 0.23445755862290177, 0.12443969181523, 0.33335206750212465, 0.07350823255369394, 0.14387523497400873, 0.05183378304922726, -0.009567411573853617, -0.029387444734755085, -0.0960138008472646, 0.09705907508955201, 0.26490057798147926, 0.07985937668623902, 0.23440663910629908, -0.47299321847627074, -0.22888004764482925, 0.035276182586463485, 0.2038403635549291, 0.15383416938626707, -0.07937714837556463, -0.23024036799040737, 0.045342106877530854, -0.16751728722507633, -0.13461691180312232, -0.036484345600644986, -0.012734846984995983, 0.06353536812679433, -0.24457002855076387, 0.054562656831765755, 0.01674073780943617, 0.012087415313211882, -0.02653389266676485, -0.0461975108298314, 0.04695049296814676, 0.04981133079996741, 0.03236440738106555, 0.06382308477498931, 0.2110357905987213, -0.09521136401368804, -0.13071348727680743, 0.39057460659547005, -0.036028720483200896, -0.15112517843386386, 0.18679173355609768, -0.18603328947352654, -0.04274828730877943, 0.1918348061622166, 0.213443642050573, 0.11071277748816079, -0.14804252231118792, 0.0061457046593692746, 0.04397281086095041, 0.22214302401024302, 0.14780799813125645, 0.06238348665079329, 0.2548376166250375, 0.1817762867984839, 0.06541200046904566, 0.13973228864246842, -0.16993533218245407, 0.03137134006899986, -0.21618402877640797, -0.10568191599464272, -0.15586299840474455, 0.024274568769192782, -0.034470898561621874, -0.1263460319392701, 0.4125537525567158, 0.149765934726552, 0.1394519981695339, -0.05387512611000935, 0.34398734805787484, 0.11790648437880275, 0.08564248245504753, 0.040698240187427986, 0.24762839388752514, 0.10983118426946287, 0.13539540943925316, -0.2332511605991607, 0.005604001849594458, -0.00402717308156198]
1,803.07473
Multipole vectors of completely random microwave skies for $l \leq 50$
The statistical cosmological principle states that observables on the celestial sphere are sampled from a rotationally invariant distribution. Previously certain large scale anomalies which violate this principle have been found, for example an alignment of the lowest multipoles with the cosmic dipole direction. In this work we continue the search for possible anomalies using multipole vectors which represent a convenient tool for this purpose. In order to study the statistical behavior of multipole vectors, we revisit several construction methods. We investigate all four full-sky foreground-cleaned maps from the Planck 2015 release with respect to four meaningful physical directions using computationally cheap statistics that have a simple geometric interpretation. We find that the full-sky SEVEM map deviates from all the other cleaned maps, as it shows a strong correlation with the Galactic Pole and Galactic Center. The other three maps COMMANDER, NILC and SMICA show a consistent behavior. On the largest angular scales, $l \leq 5$, as well as on intermediate scales, $l = 20, 21, 22, 23, 24$, all of them are unusually correlated with the cosmic dipole direction. These scales coincide with the scales on which the angular power spectrum deviates from the Planck 2015 best-fit {\Lambda}CDM model. In the range $2 \leq l \leq 50$ as a whole there is no unusual behavior visible globally. We do not find abnormal intramultipole correlation, i.e. correlation of multipole vectors inside a given multipole without reference to any outer direction.
astro-ph.CO gr-qc hep-ph
the statistical cosmological principle states that observables on the celestial sphere are sampled from a rotationally invariant distribution previously certain large scale anomalies which violate this principle have been found for example an alignment of the lowest multipoles with the cosmic dipole direction in this work we continue the search for possible anomalies using multipole vectors which represent a convenient tool for this purpose in order to study the statistical behavior of multipole vectors we revisit several construction methods we investigate all four fullsky foregroundcleaned maps from the planck 2015 release with respect to four meaningful physical directions using computationally cheap statistics that have a simple geometric interpretation we find that the fullsky sevem map deviates from all the other cleaned maps as it shows a strong correlation with the galactic pole and galactic center the other three maps commander nilc and smica show a consistent behavior on the largest angular scales l leq 5 as well as on intermediate scales l 20 21 22 23 24 all of them are unusually correlated with the cosmic dipole direction these scales coincide with the scales on which the angular power spectrum deviates from the planck 2015 bestfit lambdacdm model in the range 2 leq l leq 50 as a whole there is no unusual behavior visible globally we do not find abnormal intramultipole correlation ie correlation of multipole vectors inside a given multipole without reference to any outer direction
[['the', 'statistical', 'cosmological', 'principle', 'states', 'that', 'observables', 'on', 'the', 'celestial', 'sphere', 'are', 'sampled', 'from', 'a', 'rotationally', 'invariant', 'distribution', 'previously', 'certain', 'large', 'scale', 'anomalies', 'which', 'violate', 'this', 'principle', 'have', 'been', 'found', 'for', 'example', 'an', 'alignment', 'of', 'the', 'lowest', 'multipoles', 'with', 'the', 'cosmic', 'dipole', 'direction', 'in', 'this', 'work', 'we', 'continue', 'the', 'search', 'for', 'possible', 'anomalies', 'using', 'multipole', 'vectors', 'which', 'represent', 'a', 'convenient', 'tool', 'for', 'this', 'purpose', 'in', 'order', 'to', 'study', 'the', 'statistical', 'behavior', 'of', 'multipole', 'vectors', 'we', 'revisit', 'several', 'construction', 'methods', 'we', 'investigate', 'all', 'four', 'fullsky', 'foregroundcleaned', 'maps', 'from', 'the', 'planck', '2015', 'release', 'with', 'respect', 'to', 'four', 'meaningful', 'physical', 'directions', 'using', 'computationally', 'cheap', 'statistics', 'that', 'have', 'a', 'simple', 'geometric', 'interpretation', 'we', 'find', 'that', 'the', 'fullsky', 'sevem', 'map', 'deviates', 'from', 'all', 'the', 'other', 'cleaned', 'maps', 'as', 'it', 'shows', 'a', 'strong', 'correlation', 'with', 'the', 'galactic', 'pole', 'and', 'galactic', 'center', 'the', 'other', 'three', 'maps', 'commander', 'nilc', 'and', 'smica', 'show', 'a', 'consistent', 'behavior', 'on', 'the', 'largest', 'angular', 'scales', 'l', 'leq', '5', 'as', 'well', 'as', 'on', 'intermediate', 'scales', 'l', '20', '21', '22', '23', '24', 'all', 'of', 'them', 'are', 'unusually', 'correlated', 'with', 'the', 'cosmic', 'dipole', 'direction', 'these', 'scales', 'coincide', 'with', 'the', 'scales', 'on', 'which', 'the', 'angular', 'power', 'spectrum', 'deviates', 'from', 'the', 'planck', '2015', 'bestfit', 'lambdacdm', 'model', 'in', 'the', 'range', '2', 'leq', 'l', 'leq', '50', 'as', 'a', 'whole', 'there', 'is', 'no', 'unusual', 'behavior', 'visible', 'globally', 'we', 'do', 'not', 'find', 'abnormal', 'intramultipole', 'correlation', 'ie', 'correlation', 'of', 'multipole', 'vectors', 'inside', 'a', 'given', 'multipole', 'without', 'reference', 'to', 'any', 'outer', 'direction']]
[-0.10623699097740877, 0.11324473419321263, -0.06739542421586182, 0.11151694245086315, -0.08221667647589674, -0.08408074996130588, -0.013002017364573943, 0.36358703279136856, -0.2429275381170559, -0.3238647103946723, 0.07243386629766506, -0.3226342032573143, -0.08273502595856283, 0.19993486928995227, 0.04407875910023117, 0.016299769682979175, 0.004471994418737317, 0.011105348673385846, -0.08401223124846824, -0.19197268636242923, 0.276042578252669, 0.10390336927957833, 0.2718394216668757, -0.027669929830015556, 0.1047005745865216, -0.028962824921976413, -0.07856396974736377, 0.04243158082279302, -0.13266057473307605, 0.07027316233413372, 0.21429071808233857, 0.11104002239709163, 0.17608943763326554, -0.3392041001630012, -0.18690693367040276, 0.13286896373974436, 0.14243681652212067, 0.11821694260331476, -0.01247634171441449, -0.23438978147150688, 0.06914756639923444, -0.1459771708510659, -0.13515389956659657, -0.0744801189196355, 0.037731005758133554, 0.00583263774813086, -0.24167293016818442, 0.1222027976759454, 0.04532398648789931, 0.09553826079587943, -0.06943145595031165, -0.16329473752984267, -0.022840163329584752, 0.11081907757310362, 0.038525514924537214, 0.07601243778493429, 0.12246832643136508, -0.060266940315147934, -0.0879771671332085, 0.3840225138740795, -0.09309414480537774, -0.15144950367081988, 0.1661130874534383, -0.2121398728429281, -0.20186597615370394, 0.12516652785422366, 0.13971469287253632, 0.09611001994287917, -0.14995666186596396, 0.09873005682907071, -0.04822036437493776, 0.19823685435790428, 0.09781011493821562, 0.020226153662479346, 0.2699017495915042, 0.06559840217588828, 0.09704586103625344, 0.09563500570960516, -0.1666012833835331, -0.0342153329483257, -0.3146544954811227, -0.06945122294444768, -0.1827675507444189, 0.06275867322418802, -0.12684862653001305, -0.1289186362247867, 0.3682042323426198, 0.15840640897594416, 0.25993422478759654, 0.09166003463500992, 0.2793859066372887, 0.032445651874484546, 0.08774461173000529, 0.1030639347007286, 0.28139607722670595, 0.08894461811862037, 0.1004844388339024, -0.17424531657649558, -0.005310668236721417, 0.005129099847112275]
1,803.07474
An Improved Evaluation Framework for Generative Adversarial Networks
In this paper, we propose an improved quantitative evaluation framework for Generative Adversarial Networks (GANs) on generating domain-specific images, where we improve conventional evaluation methods on two levels: the feature representation and the evaluation metric. Unlike most existing evaluation frameworks which transfer the representation of ImageNet inception model to map images onto the feature space, our framework uses a specialized encoder to acquire fine-grained domain-specific representation. Moreover, for datasets with multiple classes, we propose Class-Aware Frechet Distance (CAFD), which employs a Gaussian mixture model on the feature space to better fit the multi-manifold feature distribution. Experiments and analysis on both the feature level and the image level were conducted to demonstrate improvements of our proposed framework over the recently proposed state-of-the-art FID method. To our best knowledge, we are the first to provide counter examples where FID gives inconsistent results with human judgments. It is shown in the experiments that our framework is able to overcome the shortness of FID and improves robustness. Code will be made available.
cs.CV
in this paper we propose an improved quantitative evaluation framework for generative adversarial networks gans on generating domainspecific images where we improve conventional evaluation methods on two levels the feature representation and the evaluation metric unlike most existing evaluation frameworks which transfer the representation of imagenet inception model to map images onto the feature space our framework uses a specialized encoder to acquire finegrained domainspecific representation moreover for datasets with multiple classes we propose classaware frechet distance cafd which employs a gaussian mixture model on the feature space to better fit the multimanifold feature distribution experiments and analysis on both the feature level and the image level were conducted to demonstrate improvements of our proposed framework over the recently proposed stateoftheart fid method to our best knowledge we are the first to provide counter examples where fid gives inconsistent results with human judgments it is shown in the experiments that our framework is able to overcome the shortness of fid and improves robustness code will be made available
[['in', 'this', 'paper', 'we', 'propose', 'an', 'improved', 'quantitative', 'evaluation', 'framework', 'for', 'generative', 'adversarial', 'networks', 'gans', 'on', 'generating', 'domainspecific', 'images', 'where', 'we', 'improve', 'conventional', 'evaluation', 'methods', 'on', 'two', 'levels', 'the', 'feature', 'representation', 'and', 'the', 'evaluation', 'metric', 'unlike', 'most', 'existing', 'evaluation', 'frameworks', 'which', 'transfer', 'the', 'representation', 'of', 'imagenet', 'inception', 'model', 'to', 'map', 'images', 'onto', 'the', 'feature', 'space', 'our', 'framework', 'uses', 'a', 'specialized', 'encoder', 'to', 'acquire', 'finegrained', 'domainspecific', 'representation', 'moreover', 'for', 'datasets', 'with', 'multiple', 'classes', 'we', 'propose', 'classaware', 'frechet', 'distance', 'cafd', 'which', 'employs', 'a', 'gaussian', 'mixture', 'model', 'on', 'the', 'feature', 'space', 'to', 'better', 'fit', 'the', 'multimanifold', 'feature', 'distribution', 'experiments', 'and', 'analysis', 'on', 'both', 'the', 'feature', 'level', 'and', 'the', 'image', 'level', 'were', 'conducted', 'to', 'demonstrate', 'improvements', 'of', 'our', 'proposed', 'framework', 'over', 'the', 'recently', 'proposed', 'stateoftheart', 'fid', 'method', 'to', 'our', 'best', 'knowledge', 'we', 'are', 'the', 'first', 'to', 'provide', 'counter', 'examples', 'where', 'fid', 'gives', 'inconsistent', 'results', 'with', 'human', 'judgments', 'it', 'is', 'shown', 'in', 'the', 'experiments', 'that', 'our', 'framework', 'is', 'able', 'to', 'overcome', 'the', 'shortness', 'of', 'fid', 'and', 'improves', 'robustness', 'code', 'will', 'be', 'made', 'available']]
[0.01085585146420217, -0.0605021664728292, -0.09670968497908133, 0.057860251661797174, -0.10394333456057364, -0.13362283729195237, 0.009435156473895524, 0.46506170243649425, -0.23380037295439665, -0.3317780404903753, 0.041727701041702474, -0.2774271851358099, -0.19547175388493224, 0.22218291086429162, -0.11333471502060305, 0.10023695583285172, 0.14399034486634624, 0.03483334279352169, -0.07864001491051278, -0.28218892874742696, 0.31857554773621616, 0.06875125703005912, 0.3825800938944438, 0.038986649537113255, 0.15003050219066844, -0.050776667186860025, -0.043233809804454626, -0.034528895571596455, -0.07258047951646965, 0.20940457344400937, 0.28099488302602427, 0.21910539734550935, 0.2626676872222054, -0.385206810895822, -0.23526319770719634, 0.07449970031603279, 0.1080812964805201, 0.09059902437145942, -0.02334091422276315, -0.37200548768623504, 0.10394507103939792, -0.17536489753063747, 0.03215789434313216, -0.1854566801339388, -0.06434752317396422, -0.04731232787323502, -0.3239088850709314, 0.0068493208312568905, 0.10015778257762512, 0.03483029257807278, -0.07316165492161662, -0.14618209859880502, 0.05006736205768086, 0.15560597063092416, 0.02584020578174177, 0.09107099952417409, 0.11230445458012783, -0.12544809194688802, -0.14182003339596405, 0.32807152740612716, -0.10675220527619257, -0.2372942860586803, 0.21578567885531635, -0.048239346328721254, -0.1257455231939738, 0.07899133533150136, 0.21226541032668894, 0.11624417038534038, -0.13475678767451268, 0.023209816245027555, -0.047968696360197474, 0.2024712105153385, 0.02549501823004848, -0.007537890303723827, 0.13082682594244263, 0.24957084980330424, 0.015477295644291325, 0.15392987192036797, -0.14481492366217924, -0.09877916404414186, -0.26199393285317124, -0.1219964629585693, -0.195808887685242, -0.057264903053490745, -0.08281131122717188, -0.13776302189356368, 0.4169783989681366, 0.2579542984725896, 0.22338181533320936, 0.12186688017713541, 0.3530570657890357, 0.021381064058800123, 0.11254421074478747, 0.08135225456542597, 0.17541974150815498, 0.016186084948245905, 0.06666021181959213, -0.15019321637395436, 0.07925950220652192, 0.07833666795680667]
1,803.07475
A parabolic-hyperbolic system modeling the growth of a tumor
In this paper, we consider a model with tumor microenvironment involving nutrient density, extracellular matrix and matrix-degrading enzymes, which satisfy a coupled system of PDEs with a free boundary. For this coupled parabolic-hyperbolic free boundary problem, we prove that there is a unique radially symmetric solution globally in time. The stationary problem involves an ODE system which is transformed into a singular integro-differential equation. We establish a well-posed theorem for such general types of equations by the shooting method; the theorem is then applied to our problem for the existence of a stationary solution. In addition, for this highly nonlinear problem, we also prove the uniqueness of the stationary solution, which is a nontrivial result. In addition, numerical simulations indicate that the stationary solution is likely locally asymptotically stable for reasonable range of parameters.
math.AP
in this paper we consider a model with tumor microenvironment involving nutrient density extracellular matrix and matrixdegrading enzymes which satisfy a coupled system of pdes with a free boundary for this coupled parabolichyperbolic free boundary problem we prove that there is a unique radially symmetric solution globally in time the stationary problem involves an ode system which is transformed into a singular integrodifferential equation we establish a wellposed theorem for such general types of equations by the shooting method the theorem is then applied to our problem for the existence of a stationary solution in addition for this highly nonlinear problem we also prove the uniqueness of the stationary solution which is a nontrivial result in addition numerical simulations indicate that the stationary solution is likely locally asymptotically stable for reasonable range of parameters
[['in', 'this', 'paper', 'we', 'consider', 'a', 'model', 'with', 'tumor', 'microenvironment', 'involving', 'nutrient', 'density', 'extracellular', 'matrix', 'and', 'matrixdegrading', 'enzymes', 'which', 'satisfy', 'a', 'coupled', 'system', 'of', 'pdes', 'with', 'a', 'free', 'boundary', 'for', 'this', 'coupled', 'parabolichyperbolic', 'free', 'boundary', 'problem', 'we', 'prove', 'that', 'there', 'is', 'a', 'unique', 'radially', 'symmetric', 'solution', 'globally', 'in', 'time', 'the', 'stationary', 'problem', 'involves', 'an', 'ode', 'system', 'which', 'is', 'transformed', 'into', 'a', 'singular', 'integrodifferential', 'equation', 'we', 'establish', 'a', 'wellposed', 'theorem', 'for', 'such', 'general', 'types', 'of', 'equations', 'by', 'the', 'shooting', 'method', 'the', 'theorem', 'is', 'then', 'applied', 'to', 'our', 'problem', 'for', 'the', 'existence', 'of', 'a', 'stationary', 'solution', 'in', 'addition', 'for', 'this', 'highly', 'nonlinear', 'problem', 'we', 'also', 'prove', 'the', 'uniqueness', 'of', 'the', 'stationary', 'solution', 'which', 'is', 'a', 'nontrivial', 'result', 'in', 'addition', 'numerical', 'simulations', 'indicate', 'that', 'the', 'stationary', 'solution', 'is', 'likely', 'locally', 'asymptotically', 'stable', 'for', 'reasonable', 'range', 'of', 'parameters']]
[-0.12158314379184205, 0.06482879435952098, -0.08113880272730625, 0.03041352586876741, -0.04424828621103687, -0.16132996735492147, -0.0037945847375374427, 0.3021344485503614, -0.3023300458067902, -0.19716326995311598, 0.13898850111527145, -0.256077580399027, -0.18236862034781984, 0.17478746259620034, -0.06621396674991663, 0.08424425090109944, 0.11519747136398814, 0.030670606807798595, -0.03358987617985647, -0.19525240141289182, 0.36692303213942096, -0.06233059153436942, 0.254691818729043, 0.040063686903454084, 0.17922056959486826, -0.026853815274299087, 0.03833455037539195, 0.03895127572315304, -0.1578566901132165, 0.08063795939753098, 0.27398942745136645, 0.08713672701899607, 0.3202070993812461, -0.43156693300190274, -0.2249940003205399, 0.13388443521497057, 0.1472383383801557, 0.12625012510452643, -0.09235429369907518, -0.2703291995632917, 0.11170306938693375, -0.1268007111949216, -0.22818747882318116, -0.04898150476164892, 0.009518962290446112, 0.02815270947670578, -0.3634545282667321, 0.13654879924882365, 0.06653912758272618, -0.03348142992270956, -0.1923652490061757, -0.011033172902118946, -0.010677191301045897, 0.05928019322262363, 0.058194532911678344, 0.002987881551699755, 0.041093322802054924, -0.1012482292533509, -0.039983385673170925, 0.3491431566102332, -0.05484310604449838, -0.31899419351291836, 0.15955390416337809, -0.07326741756073066, -0.1340462068880075, 0.1449938850561367, 0.16947815754219778, 0.202897469212014, -0.18695141326397993, 0.11189063730486844, -0.11287831620722868, 0.17648145535004964, 0.06503651082809818, -0.05083576902962479, 0.1415618658923593, 0.17462774605273193, 0.17748709291191703, 0.1673029770276376, 0.026896591286903204, -0.12847754115210777, -0.31924469710180636, -0.1739049965666285, -0.12818097049734534, 0.09587120955557864, -0.11485084684736785, -0.24067941937889709, 0.38445121811744865, 0.12956917285218947, 0.11466662366909527, 0.07954668703916154, 0.23653119709167658, 0.19552993035395594, -0.041404519699289835, 0.09240822275204205, 0.1899779088220986, 0.14203414821444094, 0.10826319689981471, -0.22310510071614212, 0.04524141098757772, 0.1279201142619455]
1,803.07476
Compact objects in scalar-tensor theories after GW170817
The recent observations of neutron star mergers have changed our perspective on scalar- tensor theories of gravity, favouring models where gravitational waves travel at the speed of light. In this work we consider a scalar-tensor set-up with such a property, belonging to a beyond Horndeski system, and we numerically investigate the physics of locally asymptotically flat black holes and relativistic stars. We first determine regular black hole solutions equipped with horizons: they are characterized by a deficit angle at infinity, and by large contributions of the scalar to the geometry in the near horizon region. We then study configurations of incompressible relativistic stars. We show that their compactness can be much higher than stars with the same energy density in General Relativity, and the scalar field profile imposes stringent constraints on the star properties. These results can suggest new ways to probe the efficiency of screening mechanisms in strong gravity regimes, and can help to build specific observational tests for scalar-tensor gravity models with unit speed for gravitational waves.
gr-qc hep-th
the recent observations of neutron star mergers have changed our perspective on scalar tensor theories of gravity favouring models where gravitational waves travel at the speed of light in this work we consider a scalartensor setup with such a property belonging to a beyond horndeski system and we numerically investigate the physics of locally asymptotically flat black holes and relativistic stars we first determine regular black hole solutions equipped with horizons they are characterized by a deficit angle at infinity and by large contributions of the scalar to the geometry in the near horizon region we then study configurations of incompressible relativistic stars we show that their compactness can be much higher than stars with the same energy density in general relativity and the scalar field profile imposes stringent constraints on the star properties these results can suggest new ways to probe the efficiency of screening mechanisms in strong gravity regimes and can help to build specific observational tests for scalartensor gravity models with unit speed for gravitational waves
[['the', 'recent', 'observations', 'of', 'neutron', 'star', 'mergers', 'have', 'changed', 'our', 'perspective', 'on', 'scalar', 'tensor', 'theories', 'of', 'gravity', 'favouring', 'models', 'where', 'gravitational', 'waves', 'travel', 'at', 'the', 'speed', 'of', 'light', 'in', 'this', 'work', 'we', 'consider', 'a', 'scalartensor', 'setup', 'with', 'such', 'a', 'property', 'belonging', 'to', 'a', 'beyond', 'horndeski', 'system', 'and', 'we', 'numerically', 'investigate', 'the', 'physics', 'of', 'locally', 'asymptotically', 'flat', 'black', 'holes', 'and', 'relativistic', 'stars', 'we', 'first', 'determine', 'regular', 'black', 'hole', 'solutions', 'equipped', 'with', 'horizons', 'they', 'are', 'characterized', 'by', 'a', 'deficit', 'angle', 'at', 'infinity', 'and', 'by', 'large', 'contributions', 'of', 'the', 'scalar', 'to', 'the', 'geometry', 'in', 'the', 'near', 'horizon', 'region', 'we', 'then', 'study', 'configurations', 'of', 'incompressible', 'relativistic', 'stars', 'we', 'show', 'that', 'their', 'compactness', 'can', 'be', 'much', 'higher', 'than', 'stars', 'with', 'the', 'same', 'energy', 'density', 'in', 'general', 'relativity', 'and', 'the', 'scalar', 'field', 'profile', 'imposes', 'stringent', 'constraints', 'on', 'the', 'star', 'properties', 'these', 'results', 'can', 'suggest', 'new', 'ways', 'to', 'probe', 'the', 'efficiency', 'of', 'screening', 'mechanisms', 'in', 'strong', 'gravity', 'regimes', 'and', 'can', 'help', 'to', 'build', 'specific', 'observational', 'tests', 'for', 'scalartensor', 'gravity', 'models', 'with', 'unit', 'speed', 'for', 'gravitational', 'waves']]
[-0.14157796459762964, 0.14539410258207977, -0.08243525719418901, 0.12478680027161101, -0.12686336971543863, -0.13660279449802884, 0.006250496285543199, 0.3210925761604759, -0.18583836675671167, -0.3228819990308801, 0.06408605115493682, -0.28931578730932883, -0.08401787424179004, 0.1947514545833747, -0.04198520879564978, 0.02335052189731298, 0.02991624389907356, 0.023513064773466725, -0.09884126529169197, -0.21728798052772724, 0.3794503634101188, 0.08810549636079362, 0.2141366601572372, 0.00859357621079895, 0.07422578186051612, -0.05483079606876571, 0.010002707602379061, 0.07297345115279658, -0.18429937362609763, 0.0528453971154591, 0.19649719833948315, 0.13794276491220842, 0.21938553660248333, -0.459729816819701, -0.28446231376291553, 0.055991471535663986, 0.126323395893639, 0.1395985363588597, -0.07622163474887676, -0.2837620441135041, 0.0745862952027795, -0.1842100625050381, -0.17597664154779452, -0.04058835807272933, 0.014907707959639471, 0.0035458760385638512, -0.23236758010076172, 0.07718836966441867, 0.017387978975060423, -0.031978518452554575, -0.0973505065666192, -0.046115760703174365, -0.01924507024686938, 0.047727016628769464, 0.13426101613223565, 0.03266378520221929, 0.1336731286884765, -0.15697610345613983, -0.09311638416215424, 0.39639387135366366, -0.12105525582803195, -0.19395976586366545, 0.21292835680117622, -0.2542479471551508, -0.14283989846620973, 0.06180932327206715, 0.2121799080246872, 0.19491931601835982, -0.12285621583009877, 0.08910289258364114, 0.0259526617826409, 0.14145860523150783, 0.10083142092407367, 0.0763604293509177, 0.37564977945914196, 0.1177505819986646, 0.03778624187014203, 0.11033333146864736, -0.08011441051094799, -0.07080532385300867, -0.30777851618914565, -0.12406961190288324, -0.09833695571842058, 0.05788894440047443, -0.15217107385849876, -0.11988536862535237, 0.3570323175304299, 0.11577417135947128, 0.11607055204607734, 0.07356636630668795, 0.24645312083723625, 0.09349580633126132, 0.06855707308801012, 0.11810982702906139, 0.3631400794993546, 0.1490517503378042, 0.10176826938132606, -0.22417159288978347, -0.024654515447872057, 0.04147895059297578]
1,803.07477
Berkeley 51, a young open cluster with four yellow supergiants
The heavily obscured open cluster Berkeley~51 shows characteristics typical of young massive clusters, even though the few previous studies have suggested older ages. We combine optical ($UBV$) and 2MASS photometry of the cluster field with multi-object and long-slit optical spectroscopy for a large sample of stars. We apply classical photometric analysis techniques to determine the reddening to the cluster, and then derive cluster parameters via isochrone fitting. We find a large population of B-type stars, with a main sequence turn-off at B3$\,$V, as well as a large number of supergiants with spectral types ranging from F to M. We use intermediate resolution spectra of the evolved cool stars to derive their stellar parameters and find an essentially solar iron abundance. Under the plausible assumption that our photometry reaches stars still close to the ZAMS, the cluster is located at $d\approx5.5\:$kpc and has an age of $\sim60\:$Ma, though a slightly younger and more distant cluster cannot be ruled out. Despite the apparent good fit of isochrones, evolved stars seem to reside in positions of the CMD far away from the locations where stellar tracks predict Helium burning to occur. Of particular interest is the presence of four yellow supergiants, two on the ascending branch and two others close to or inside the instability strip.
astro-ph.SR astro-ph.GA
the heavily obscured open cluster berkeley51 shows characteristics typical of young massive clusters even though the few previous studies have suggested older ages we combine optical ubv and 2mass photometry of the cluster field with multiobject and longslit optical spectroscopy for a large sample of stars we apply classical photometric analysis techniques to determine the reddening to the cluster and then derive cluster parameters via isochrone fitting we find a large population of btype stars with a main sequence turnoff at b3v as well as a large number of supergiants with spectral types ranging from f to m we use intermediate resolution spectra of the evolved cool stars to derive their stellar parameters and find an essentially solar iron abundance under the plausible assumption that our photometry reaches stars still close to the zams the cluster is located at dapprox55kpc and has an age of sim60ma though a slightly younger and more distant cluster cannot be ruled out despite the apparent good fit of isochrones evolved stars seem to reside in positions of the cmd far away from the locations where stellar tracks predict helium burning to occur of particular interest is the presence of four yellow supergiants two on the ascending branch and two others close to or inside the instability strip
[['the', 'heavily', 'obscured', 'open', 'cluster', 'berkeley51', 'shows', 'characteristics', 'typical', 'of', 'young', 'massive', 'clusters', 'even', 'though', 'the', 'few', 'previous', 'studies', 'have', 'suggested', 'older', 'ages', 'we', 'combine', 'optical', 'ubv', 'and', '2mass', 'photometry', 'of', 'the', 'cluster', 'field', 'with', 'multiobject', 'and', 'longslit', 'optical', 'spectroscopy', 'for', 'a', 'large', 'sample', 'of', 'stars', 'we', 'apply', 'classical', 'photometric', 'analysis', 'techniques', 'to', 'determine', 'the', 'reddening', 'to', 'the', 'cluster', 'and', 'then', 'derive', 'cluster', 'parameters', 'via', 'isochrone', 'fitting', 'we', 'find', 'a', 'large', 'population', 'of', 'btype', 'stars', 'with', 'a', 'main', 'sequence', 'turnoff', 'at', 'b3v', 'as', 'well', 'as', 'a', 'large', 'number', 'of', 'supergiants', 'with', 'spectral', 'types', 'ranging', 'from', 'f', 'to', 'm', 'we', 'use', 'intermediate', 'resolution', 'spectra', 'of', 'the', 'evolved', 'cool', 'stars', 'to', 'derive', 'their', 'stellar', 'parameters', 'and', 'find', 'an', 'essentially', 'solar', 'iron', 'abundance', 'under', 'the', 'plausible', 'assumption', 'that', 'our', 'photometry', 'reaches', 'stars', 'still', 'close', 'to', 'the', 'zams', 'the', 'cluster', 'is', 'located', 'at', 'dapprox55kpc', 'and', 'has', 'an', 'age', 'of', 'sim60ma', 'though', 'a', 'slightly', 'younger', 'and', 'more', 'distant', 'cluster', 'can', 'not', 'be', 'ruled', 'out', 'despite', 'the', 'apparent', 'good', 'fit', 'of', 'isochrones', 'evolved', 'stars', 'seem', 'to', 'reside', 'in', 'positions', 'of', 'the', 'cmd', 'far', 'away', 'from', 'the', 'locations', 'where', 'stellar', 'tracks', 'predict', 'helium', 'burning', 'to', 'occur', 'of', 'particular', 'interest', 'is', 'the', 'presence', 'of', 'four', 'yellow', 'supergiants', 'two', 'on', 'the', 'ascending', 'branch', 'and', 'two', 'others', 'close', 'to', 'or', 'inside', 'the', 'instability', 'strip']]
[-0.007731115226457292, 0.1226130735287189, -0.10108460571122536, 0.0801947644362182, -0.11668368979076904, -0.09367211805038614, 0.11959595330803262, 0.42734251243958327, -0.1777453519725594, -0.3814285698002513, 0.06372090695995254, -0.28587087210691514, -0.008924181027982332, 0.2100552361551231, -0.10729590349199507, -0.06443106418837445, 0.14632711931318265, -0.0007348603975045455, -0.03923440208045878, -0.2838955700874187, 0.3132036744056367, 0.00602229927794487, 0.13611498895714774, -0.09526840933202435, 0.02143229093287864, -0.10171605517063731, -0.06463153370086687, -0.03357392760717544, -0.15268633642275425, 0.0463909863972136, 0.23381370612446625, 0.11606050841730989, 0.2335789677338295, -0.3334280226898743, -0.1902067450376424, 0.0696425273268532, 0.2599151811972967, 0.06677088390327372, -0.06040748232520148, -0.24237147459354233, 0.10075825920645191, -0.15108070927241737, -0.21972621947315066, 0.051546505771542045, 0.03696848827103038, 0.05694006724168339, -0.21939213985082875, 0.098348205574232, -0.00732566850972737, 0.14554478914004648, -0.11655326201624604, -0.18078560248443248, -0.08677800760882513, 0.14847892430893442, 0.005162092537058615, 0.05746307195565924, 0.14036047676858443, -0.13171203505309625, 0.020193928806331907, 0.3698261275984594, -0.06267105388869995, 0.010131515041699906, 0.2687689716876948, -0.17759473362752187, -0.17855762668236455, 0.09279786235480723, 0.11571637247534583, 0.1615144358241657, -0.185435757855333, -0.0037683183445939485, -0.0006826756871305406, 0.20939234700396003, 0.057175689334959076, 0.05739820260395653, 0.32549612436435843, 0.1216619739968824, 0.014165414392427316, 0.09625915243672163, -0.24494709800465378, -0.07778207393875125, -0.19486303631463464, -0.06537747015636988, -0.11245207994943485, 0.06655451825438387, -0.13419268042974944, -0.19913482852269795, 0.32236905717175074, 0.11801183219834659, 0.22199256010397703, 0.033243001706542895, 0.2829031068125466, 0.08572858092827519, 0.1380971810058801, 0.12163783338525602, 0.30475772974485205, 0.21176717598962275, 0.06521956115338721, -0.23462324889356898, 0.047572825207723685, -0.01364738078814406]
1,803.07478
Neutrinos from Choked Jets Accompanied by Type-II Supernovae
The origin of the IceCube neutrinos is still an open question. Upper limits from diffuse gamma-ray observations suggest that the neutrino sources are either distant or hidden from gamma-ray observations. It is possible that the neutrinos are produced in jets that are formed in the core-collapsing massive stars and fail to break out, the so-called choked jets. We study neutrinos from the jets choked in the hydrogen envelopes of red supergiant stars. Fast photo-meson cooling softens the neutrino spectrum, making it difficult to explain the PeV neutrinos observed by IceCube in a one-component scenario, but a two-component model can explain the spectrum. Furthermore, we predict that a newly born jet-driven type-II supernova may be observed to be associated with a neutrino burst detected by IceCube.
astro-ph.HE hep-ph
the origin of the icecube neutrinos is still an open question upper limits from diffuse gammaray observations suggest that the neutrino sources are either distant or hidden from gammaray observations it is possible that the neutrinos are produced in jets that are formed in the corecollapsing massive stars and fail to break out the socalled choked jets we study neutrinos from the jets choked in the hydrogen envelopes of red supergiant stars fast photomeson cooling softens the neutrino spectrum making it difficult to explain the pev neutrinos observed by icecube in a onecomponent scenario but a twocomponent model can explain the spectrum furthermore we predict that a newly born jetdriven typeii supernova may be observed to be associated with a neutrino burst detected by icecube
[['the', 'origin', 'of', 'the', 'icecube', 'neutrinos', 'is', 'still', 'an', 'open', 'question', 'upper', 'limits', 'from', 'diffuse', 'gammaray', 'observations', 'suggest', 'that', 'the', 'neutrino', 'sources', 'are', 'either', 'distant', 'or', 'hidden', 'from', 'gammaray', 'observations', 'it', 'is', 'possible', 'that', 'the', 'neutrinos', 'are', 'produced', 'in', 'jets', 'that', 'are', 'formed', 'in', 'the', 'corecollapsing', 'massive', 'stars', 'and', 'fail', 'to', 'break', 'out', 'the', 'socalled', 'choked', 'jets', 'we', 'study', 'neutrinos', 'from', 'the', 'jets', 'choked', 'in', 'the', 'hydrogen', 'envelopes', 'of', 'red', 'supergiant', 'stars', 'fast', 'photomeson', 'cooling', 'softens', 'the', 'neutrino', 'spectrum', 'making', 'it', 'difficult', 'to', 'explain', 'the', 'pev', 'neutrinos', 'observed', 'by', 'icecube', 'in', 'a', 'onecomponent', 'scenario', 'but', 'a', 'twocomponent', 'model', 'can', 'explain', 'the', 'spectrum', 'furthermore', 'we', 'predict', 'that', 'a', 'newly', 'born', 'jetdriven', 'typeii', 'supernova', 'may', 'be', 'observed', 'to', 'be', 'associated', 'with', 'a', 'neutrino', 'burst', 'detected', 'by', 'icecube']]
[-0.06403983486257493, 0.2678010008233832, -0.029533735604956746, 0.2672566141281277, -0.1412859928905964, -0.11073241073265672, 0.07440592105314135, 0.4127107426002622, -0.20960344014689325, -0.3053919144868851, 0.02722364044189453, -0.32505445916950704, -0.017651559272781014, 0.19120373339578509, 0.025844462674111127, -0.08340313407033682, 0.12116230265051127, -0.07046358175575733, -0.017597410176414998, -0.21476054018735885, 0.2852011573985219, 0.15090090669319034, 0.15878514752537012, -0.00950687162950635, 0.040275614090263846, -0.18678961204737424, -0.055325438644737004, -0.08668805698677898, -0.03469048277405091, -0.0006463608029298484, 0.21477783436479514, 0.15484664109908045, 0.09667448657483328, -0.4267875964939594, -0.2820408866927028, 0.17444235184788703, 0.2083556835912168, 0.019367263555526735, -0.07508299465477467, -0.3333113507926464, 0.07813066835096107, -0.2313133877441287, -0.2086334296427667, 0.06647001635283231, -0.07552173829078675, 0.0009419952463358641, -0.21180190136656166, 0.09568549088574946, 0.006766860256437212, -0.05697073494107462, -0.08072262283228337, -0.053871052922680976, -0.0266118051558733, 0.011217280527576805, 0.15123194242548196, 0.01271808453463018, 0.11465790041349828, -0.17230193062871696, -0.09590072113275527, 0.4191521845459938, -0.04348827150091529, -0.010333194877952338, 0.20148203568719328, -0.19882926313206553, -0.20835112839192152, 0.22908747714757918, 0.13924519868567586, 0.06679163778759539, -0.21470692922361195, 0.007962757750879974, -0.09680711945705116, 0.15870324637088926, 0.03232441789470613, 0.009407386299979408, 0.37343386337161066, 0.1779176451638341, 0.02769418392330408, 0.03493727201037109, -0.22613832425139843, 0.014039501816499978, -0.29693799798190595, -0.06552090073376894, -0.14268829491734505, 0.14071152039896698, -0.02372848742187489, -0.1021824174853973, 0.34637669354863465, 0.10897804669383913, 0.2129853759035468, -0.05161183791980147, 0.2880923354253173, 0.08518679628521204, 0.0725459462236613, 0.15702710186690091, 0.3928842731937766, 0.15019385724887252, 0.10996939573111013, -0.20391732660867273, 0.06573804123327136, 0.03788740888983011]
1,803.07479
Hydrodynamical phase transition for domain-wall melting in the XY chain
We study the melting of a domain wall, prepared as a certain low-energy excitation above the ferromagnetic ground state of the XY chain. In a well defined parameter regime the time-evolved magnetization profile develops sharp kink-like structures in the bulk, showing features of a phase transition in the hydrodynamic scaling limit. The transition is of purely dynamical nature and can be attributed to the appearance of a negative effective mass term in the dispersion. The signatures are also clearly visible in the entanglement profile measured along the front region, which can be obtained by covariance-matrix methods despite the state being non-Gaussian.
cond-mat.stat-mech quant-ph
we study the melting of a domain wall prepared as a certain lowenergy excitation above the ferromagnetic ground state of the xy chain in a well defined parameter regime the timeevolved magnetization profile develops sharp kinklike structures in the bulk showing features of a phase transition in the hydrodynamic scaling limit the transition is of purely dynamical nature and can be attributed to the appearance of a negative effective mass term in the dispersion the signatures are also clearly visible in the entanglement profile measured along the front region which can be obtained by covariancematrix methods despite the state being nongaussian
[['we', 'study', 'the', 'melting', 'of', 'a', 'domain', 'wall', 'prepared', 'as', 'a', 'certain', 'lowenergy', 'excitation', 'above', 'the', 'ferromagnetic', 'ground', 'state', 'of', 'the', 'xy', 'chain', 'in', 'a', 'well', 'defined', 'parameter', 'regime', 'the', 'timeevolved', 'magnetization', 'profile', 'develops', 'sharp', 'kinklike', 'structures', 'in', 'the', 'bulk', 'showing', 'features', 'of', 'a', 'phase', 'transition', 'in', 'the', 'hydrodynamic', 'scaling', 'limit', 'the', 'transition', 'is', 'of', 'purely', 'dynamical', 'nature', 'and', 'can', 'be', 'attributed', 'to', 'the', 'appearance', 'of', 'a', 'negative', 'effective', 'mass', 'term', 'in', 'the', 'dispersion', 'the', 'signatures', 'are', 'also', 'clearly', 'visible', 'in', 'the', 'entanglement', 'profile', 'measured', 'along', 'the', 'front', 'region', 'which', 'can', 'be', 'obtained', 'by', 'covariancematrix', 'methods', 'despite', 'the', 'state', 'being', 'nongaussian']]
[-0.16313918915319045, 0.1953747469844241, -0.12385076553061147, 0.062447532413223074, -0.024563687060507808, -0.10262711335199488, 0.03303725059872659, 0.3511715807518599, -0.27994123964321493, -0.27341279651195105, 0.07720567628921074, -0.27672034195891704, -0.09468710236020829, 0.13690896406954173, 0.030006457334280586, 0.03730068749536087, -0.0013516423186416377, 0.0342280677160119, -0.09184707049971981, -0.12313079556892856, 0.3119159752300175, 0.0140479616682497, 0.3108738184731343, 0.06944700024588642, 0.03344433804476025, -0.05464122076011678, 0.08683514334480416, 0.053769760652177846, -0.14730155699578631, 0.018096251145816675, 0.2187092932261582, -0.013125409760442101, 0.18714624110351105, -0.369845730298669, -0.25071570193302806, 0.07603468535246678, 0.18364596739065567, 0.1459243202911653, -0.023254618040599518, -0.3319486331858552, 0.009507437429023735, -0.13448411533793453, -0.172941845671117, -0.059118182361494784, -0.030707837245830493, -0.005255843902301818, -0.23855911129808957, 0.1433851564848233, 0.07964164490718165, 0.05410352192062995, -0.06888257034381132, -0.060981386933604824, -0.08388603087468534, 0.09462372540026018, 0.044246321814918506, 0.04277865226394358, 0.15594725658982245, -0.17763896753532019, -0.07007171155534464, 0.33738899069589257, -0.11515324023704386, -0.12770248070764956, 0.16689685135065477, -0.19314750016086024, -0.058826083687392276, 0.1860896788980111, 0.10592099854556641, 0.09463369720477131, -0.11753462233331681, 0.06702693466426768, 0.00013429015450695954, 0.1750064292705922, 0.04233702349633273, 0.040392372462123925, 0.24869668794828145, 0.15709951744843642, 0.019090324460464245, 0.1976365490348567, -0.10733685469125757, -0.12075413546829235, -0.2967365773597566, -0.12792132049741334, -0.22246968553005025, 0.021952060128488386, -0.08092512685496078, -0.18891055238811244, 0.43241988803665754, 0.1027856172523021, 0.25256705072035296, -0.014290585942188332, 0.2448794513774833, 0.15047785894147647, 0.04140093063216398, 0.05020989759682244, 0.2899214786910775, 0.13447245289479373, 0.1290067440719519, -0.25964949147702, 0.09483023607264282, 0.03543375654717778]
1,803.0748
AC/DC: In-Database Learning Thunderstruck
We report on the design and implementation of the AC/DC gradient descent solver for a class of optimization problems over normalized databases. AC/DC decomposes an optimization problem into a set of aggregates over the join of the database relations. It then uses the answers to these aggregates to iteratively improve the solution to the problem until it converges. The challenges faced by AC/DC are the large database size, the mixture of continuous and categorical features, and the large number of aggregates to compute. AC/DC addresses these challenges by employing a sparse data representation, factorized computation, problem reparameterization under functional dependencies, and a data structure that supports shared computation of aggregates. To train polynomial regression models and factorization machines of up to 154K features over the natural join of all relations from a real-world dataset of up to 86M tuples, AC/DC needs up to 30 minutes on one core of a commodity machine. This is up to three orders of magnitude faster than its competitors R, MadLib, libFM, and TensorFlow whenever they finish and thus do not exceed memory limitation, 24-hour timeout, or internal design limitations.
cs.DB
we report on the design and implementation of the acdc gradient descent solver for a class of optimization problems over normalized databases acdc decomposes an optimization problem into a set of aggregates over the join of the database relations it then uses the answers to these aggregates to iteratively improve the solution to the problem until it converges the challenges faced by acdc are the large database size the mixture of continuous and categorical features and the large number of aggregates to compute acdc addresses these challenges by employing a sparse data representation factorized computation problem reparameterization under functional dependencies and a data structure that supports shared computation of aggregates to train polynomial regression models and factorization machines of up to 154k features over the natural join of all relations from a realworld dataset of up to 86m tuples acdc needs up to 30 minutes on one core of a commodity machine this is up to three orders of magnitude faster than its competitors r madlib libfm and tensorflow whenever they finish and thus do not exceed memory limitation 24hour timeout or internal design limitations
[['we', 'report', 'on', 'the', 'design', 'and', 'implementation', 'of', 'the', 'acdc', 'gradient', 'descent', 'solver', 'for', 'a', 'class', 'of', 'optimization', 'problems', 'over', 'normalized', 'databases', 'acdc', 'decomposes', 'an', 'optimization', 'problem', 'into', 'a', 'set', 'of', 'aggregates', 'over', 'the', 'join', 'of', 'the', 'database', 'relations', 'it', 'then', 'uses', 'the', 'answers', 'to', 'these', 'aggregates', 'to', 'iteratively', 'improve', 'the', 'solution', 'to', 'the', 'problem', 'until', 'it', 'converges', 'the', 'challenges', 'faced', 'by', 'acdc', 'are', 'the', 'large', 'database', 'size', 'the', 'mixture', 'of', 'continuous', 'and', 'categorical', 'features', 'and', 'the', 'large', 'number', 'of', 'aggregates', 'to', 'compute', 'acdc', 'addresses', 'these', 'challenges', 'by', 'employing', 'a', 'sparse', 'data', 'representation', 'factorized', 'computation', 'problem', 'reparameterization', 'under', 'functional', 'dependencies', 'and', 'a', 'data', 'structure', 'that', 'supports', 'shared', 'computation', 'of', 'aggregates', 'to', 'train', 'polynomial', 'regression', 'models', 'and', 'factorization', 'machines', 'of', 'up', 'to', '154k', 'features', 'over', 'the', 'natural', 'join', 'of', 'all', 'relations', 'from', 'a', 'realworld', 'dataset', 'of', 'up', 'to', '86m', 'tuples', 'acdc', 'needs', 'up', 'to', '30', 'minutes', 'on', 'one', 'core', 'of', 'a', 'commodity', 'machine', 'this', 'is', 'up', 'to', 'three', 'orders', 'of', 'magnitude', 'faster', 'than', 'its', 'competitors', 'r', 'madlib', 'libfm', 'and', 'tensorflow', 'whenever', 'they', 'finish', 'and', 'thus', 'do', 'not', 'exceed', 'memory', 'limitation', '24hour', 'timeout', 'or', 'internal', 'design', 'limitations']]
[-0.08263832530272859, 0.03276818766647881, -0.05739918005253587, 0.015377835828585776, -0.10584906044103982, -0.12703166149075623, 0.0844744662357658, 0.38396662923988406, -0.3652789670370192, -0.3518548641625055, 0.13527610025414685, -0.29606198286725616, -0.09346383273637351, 0.21055962920002128, -0.07455327432918628, 0.0934593114553526, 0.11469940270379103, 0.016440218979758874, -0.06370887141303763, -0.31789232230525216, 0.28095444677024056, 0.019147492725156492, 0.27754110485381844, 0.008994185736410545, 0.1557951217765439, -0.027986988482023283, -0.027332484149015866, 0.01770410935425169, -0.051946725781597924, 0.16169201977618786, 0.2685166850776943, 0.20517242320680193, 0.3320745415652969, -0.4324961622286547, -0.14678102631520373, 0.08721054524469835, 0.12933558165505118, 0.055007868292894994, 0.045500177709682545, -0.23986929635629878, 0.1298632920811792, -0.18526366317342802, -0.036851764434007006, -0.13585353520657908, 0.015123385580379393, 0.0015139968369852056, -0.27437468911399604, 0.006027813560769453, 0.05729084999868544, 0.036562491955419815, -0.05203120182728865, -0.11494137549000168, 0.03628393537416072, 0.10942173137452331, 0.027500774464467644, 0.021430860900391754, 0.14805016251841233, -0.14717615912489307, -0.1397614154042318, 0.38395257275756245, -0.040345639818502144, -0.173428953957877, 0.17196349334099667, -0.044677777125008894, -0.13791823351006074, 0.12839738404471682, 0.22809217072470667, 0.11171235477776972, -0.13861344204633497, 0.05074661295729239, -0.043114048459536425, 0.1986128272345433, 0.072475780298611, -0.030652281733557253, 0.16531578246452897, 0.20406148744143218, 0.08280211966612715, 0.15801117931119074, -0.05171298829500901, -0.10721135155456447, -0.23247103752622095, -0.12598259406225695, -0.17280365691512597, -0.0036284956353643634, -0.11893943045488213, -0.17608204263436433, 0.3995864396495233, 0.17709890607191803, 0.20271133084443735, 0.11890256417669602, 0.3288019875289647, 0.045176524658137956, 0.15348565530615274, 0.14538142154412856, 0.10873809427145746, 0.07325129870678411, 0.10593881853896124, -0.1856366459115224, 0.06556408954298144, 0.035835551824625375]
1,803.07481
Topological phase transition with nanoscale inhomogeneity in (Bi$_{1-x}$In$_{x}$)$_{2}$Se$_{3}$
Topological insulators are a class of band insulators with non-trivial topology, a result of band inversion due to the strong spin-orbit coupling. The transition between topological and normal insulator can be realized by tuning the spin-orbit coupling strength, and has been observed experimentally. However, the impact of chemical disorders on the topological phase transition was not addressed in previous studies. Herein, we report a systematic scanning tunneling microscopy/spectroscopy and first-principles study of the topological phase transition in single crystals of In doped Bi$_2$Se$_3$. Surprisingly, no band gap closure was observed across the transition. Furthermore, our spectroscopic-imaging results reveal that In defects are extremely effective "suppressors" of the band inversion, which leads to microscopic phase separation of topological-insulator-like and normal-insulator-like nano regions across the "transition". The observed topological electronic inhomogeneity demonstrates the significant impact of chemical disorders in topological materials, shedding new light on the fundamental understanding of topological phase transition.
cond-mat.str-el
topological insulators are a class of band insulators with nontrivial topology a result of band inversion due to the strong spinorbit coupling the transition between topological and normal insulator can be realized by tuning the spinorbit coupling strength and has been observed experimentally however the impact of chemical disorders on the topological phase transition was not addressed in previous studies herein we report a systematic scanning tunneling microscopyspectroscopy and firstprinciples study of the topological phase transition in single crystals of in doped bi_2se_3 surprisingly no band gap closure was observed across the transition furthermore our spectroscopicimaging results reveal that in defects are extremely effective suppressors of the band inversion which leads to microscopic phase separation of topologicalinsulatorlike and normalinsulatorlike nano regions across the transition the observed topological electronic inhomogeneity demonstrates the significant impact of chemical disorders in topological materials shedding new light on the fundamental understanding of topological phase transition
[['topological', 'insulators', 'are', 'a', 'class', 'of', 'band', 'insulators', 'with', 'nontrivial', 'topology', 'a', 'result', 'of', 'band', 'inversion', 'due', 'to', 'the', 'strong', 'spinorbit', 'coupling', 'the', 'transition', 'between', 'topological', 'and', 'normal', 'insulator', 'can', 'be', 'realized', 'by', 'tuning', 'the', 'spinorbit', 'coupling', 'strength', 'and', 'has', 'been', 'observed', 'experimentally', 'however', 'the', 'impact', 'of', 'chemical', 'disorders', 'on', 'the', 'topological', 'phase', 'transition', 'was', 'not', 'addressed', 'in', 'previous', 'studies', 'herein', 'we', 'report', 'a', 'systematic', 'scanning', 'tunneling', 'microscopyspectroscopy', 'and', 'firstprinciples', 'study', 'of', 'the', 'topological', 'phase', 'transition', 'in', 'single', 'crystals', 'of', 'in', 'doped', 'bi_2se_3', 'surprisingly', 'no', 'band', 'gap', 'closure', 'was', 'observed', 'across', 'the', 'transition', 'furthermore', 'our', 'spectroscopicimaging', 'results', 'reveal', 'that', 'in', 'defects', 'are', 'extremely', 'effective', 'suppressors', 'of', 'the', 'band', 'inversion', 'which', 'leads', 'to', 'microscopic', 'phase', 'separation', 'of', 'topologicalinsulatorlike', 'and', 'normalinsulatorlike', 'nano', 'regions', 'across', 'the', 'transition', 'the', 'observed', 'topological', 'electronic', 'inhomogeneity', 'demonstrates', 'the', 'significant', 'impact', 'of', 'chemical', 'disorders', 'in', 'topological', 'materials', 'shedding', 'new', 'light', 'on', 'the', 'fundamental', 'understanding', 'of', 'topological', 'phase', 'transition']]
[-0.20360384598638662, 0.21047223890845262, -0.05574048143761182, 0.024230598534985975, -0.048523785332469524, -0.14928686926833581, 0.14977157252409645, 0.4149412907710349, -0.24649665982626076, -0.3358899593051221, -0.008613609349373979, -0.298080948807576, -0.21313306368333665, 0.14914411255410193, 0.015509559993153892, 0.03914771636128363, -0.045457608123133715, -0.10507315180321047, -0.15578886611557036, -0.15148992565195227, 0.30939778062590473, -0.019650215570928175, 0.3600014446089296, 0.14668393894916754, -0.032483359336274095, -0.06243480666229073, 0.0855694285018143, 0.03828372243741477, -0.15596632507176028, 0.04039949760772288, 0.2754061427093237, -0.12063361273298191, 0.1738412536215037, -0.441536745257877, -0.2867521187542258, 0.01080861281937089, 0.11035940197069903, 0.14754506457530944, -0.12889284848367694, -0.34451041540533706, 0.05144642633260102, -0.11943662922665779, -0.05531518110955084, -0.11538880737498403, 0.002469721734775482, -0.043049665396825434, -0.17833908980970295, 0.07012350130035712, 0.03918922140036483, 0.13094975669692094, -0.07723187781694169, -0.0659525349729921, -0.12365112204035442, 0.09860022695785439, 0.043676445738890686, 0.04063139205666359, 0.12753366162222526, -0.11846276101769528, -0.13194677033587485, 0.3910380960064563, -0.04012221359723323, -0.05796385347855756, 0.19836268783861621, -0.20149496537507386, -0.1068625719273916, 0.18065404738425403, 0.10495267315717363, 0.07698027820899025, -0.07994176076121025, 0.0975666278328218, 0.019899684329150635, 0.18441472508365642, -0.00462495894297152, 0.11275544792737786, 0.2668544818942964, 0.22374376967687765, 0.03274588853221487, 0.14354840284480863, -0.14122060776257106, -0.05271176648848514, -0.20950707987523512, -0.18752676443152785, -0.2644140172491756, 0.047110693279210934, -0.044113985603011364, -0.22387025885384632, 0.46751372792091017, 0.1449010599486379, 0.1668740451222638, -0.0858658594846241, 0.20632085465272335, 0.09995176616782397, 0.0805691005158666, -0.045910066522255134, 0.32006072462536395, 0.15905224179024682, 0.09574718310220821, -0.2885914533603559, 0.11335570107188982, 0.012199716847798964]
1,803.07482
Natural Gradient Deep Q-learning
We present a novel algorithm to train a deep Q-learning agent using natural-gradient techniques. We compare the original deep Q-network (DQN) algorithm to its natural-gradient counterpart, which we refer to as NGDQN, on a collection of classic control domains. Without employing target networks, NGDQN significantly outperforms DQN without target networks, and performs no worse than DQN with target networks, suggesting that NGDQN stabilizes training and can help reduce the need for additional hyperparameter tuning. We also find that NGDQN is less sensitive to hyperparameter optimization relative to DQN. Together these results suggest that natural-gradient techniques can improve value-function optimization in deep reinforcement learning.
cs.LG cs.AI stat.ML
we present a novel algorithm to train a deep qlearning agent using naturalgradient techniques we compare the original deep qnetwork dqn algorithm to its naturalgradient counterpart which we refer to as ngdqn on a collection of classic control domains without employing target networks ngdqn significantly outperforms dqn without target networks and performs no worse than dqn with target networks suggesting that ngdqn stabilizes training and can help reduce the need for additional hyperparameter tuning we also find that ngdqn is less sensitive to hyperparameter optimization relative to dqn together these results suggest that naturalgradient techniques can improve valuefunction optimization in deep reinforcement learning
[['we', 'present', 'a', 'novel', 'algorithm', 'to', 'train', 'a', 'deep', 'qlearning', 'agent', 'using', 'naturalgradient', 'techniques', 'we', 'compare', 'the', 'original', 'deep', 'qnetwork', 'dqn', 'algorithm', 'to', 'its', 'naturalgradient', 'counterpart', 'which', 'we', 'refer', 'to', 'as', 'ngdqn', 'on', 'a', 'collection', 'of', 'classic', 'control', 'domains', 'without', 'employing', 'target', 'networks', 'ngdqn', 'significantly', 'outperforms', 'dqn', 'without', 'target', 'networks', 'and', 'performs', 'no', 'worse', 'than', 'dqn', 'with', 'target', 'networks', 'suggesting', 'that', 'ngdqn', 'stabilizes', 'training', 'and', 'can', 'help', 'reduce', 'the', 'need', 'for', 'additional', 'hyperparameter', 'tuning', 'we', 'also', 'find', 'that', 'ngdqn', 'is', 'less', 'sensitive', 'to', 'hyperparameter', 'optimization', 'relative', 'to', 'dqn', 'together', 'these', 'results', 'suggest', 'that', 'naturalgradient', 'techniques', 'can', 'improve', 'valuefunction', 'optimization', 'in', 'deep', 'reinforcement', 'learning']]
[0.004368661658711804, -0.030848359621301728, -0.09170503549060775, 0.09846778049979142, -0.18613959772928249, -0.25494666688722895, 0.12311213559841791, 0.5415058716299753, -0.26222541693200185, -0.3372751457381596, 0.04932570503007404, -0.23112151405132078, -0.23112831702365458, 0.18621323023497768, -0.17563876938255665, 0.049413332746712293, 0.14296275372752576, 0.004907348966316402, -0.10786479844675553, -0.30892764513371784, 0.25437670454238226, 0.06250892655140702, 0.29383594850394695, -0.02958841129992772, 0.15564944728919602, 0.01878422998723764, 0.06077642341537708, 0.009953170042774342, -0.030644787554513296, 0.15010679183184233, 0.2748895477055961, 0.2250794455164917, 0.3706881695074364, -0.40960503103735957, -0.2500134613364935, 0.1527953039610632, 0.1913723133649062, 0.1043244720497666, -0.002169318267458471, -0.3020193407366287, 0.11508454102740252, -0.18457379120682338, 0.010900517921099096, -0.22058018678528013, -0.11516485893104261, 0.03709525869056148, -0.3350813221548078, -0.030545388188188246, 0.06970158353872039, -0.01646364722581743, -0.06079569172896264, -0.18259519636088495, 0.0436441035719715, 0.08637062394742863, 0.00951855122880305, 0.13209840717264315, 0.17883801619856826, -0.19599855376534092, -0.21033230850482088, 0.26988987543267534, -0.10580493355900596, -0.18070533929519284, 0.20463251452599154, 0.05411136810875778, -0.1409110655280246, 0.12510006872991336, 0.24274510958964385, 0.14877286563329037, -0.10571175316366756, 0.008189732863260343, -0.009742333675797993, 0.20739695390921484, 0.012974989668294353, -0.030401156773311493, 0.050328482263405055, 0.26965068849606116, 0.12920644988748922, 0.15857001398328366, -0.11615342608182827, -0.12299316955133549, -0.15004822252842698, -0.07973127064150441, -0.13784911696916646, 0.0035781900769153844, -0.1156126821582608, -0.09920072519374125, 0.31057762420618706, 0.24338994012440293, 0.21665704433887617, 0.15984922755188624, 0.3352342758472394, 0.02720964927276036, 0.14898495631715175, 0.14356171136758136, 0.2402133185674156, -0.0050617065145046386, 0.14472287064146938, -0.1965298550067813, 0.1039920475342971, 0.0348723420412144]
1,803.07483
A framework for performance characterization of energy-resolving photon-counting detectors
Photon-counting energy resolving detectors are subject to intense research interest, and there is a need for a general framework for performance assessment of these detectors. The commonly used linear-systems theory framework, which measures detector performance in terms of noise-equivalent quanta (NEQ) and detective quantum efficiency (DQE) is widely used for characterizing conventional X-ray detectors but does not take energy-resolving capabilities into account. We extend this framework to encompass energy-resolving photon-counting detectors and elucidate how the imperfect energy response of real-world detectors affects imaging performance. We generalize NEQ and DQE to matrix-valued quantities as functions of spatial frequency, and show how these can be calculated from simple Monte Carlo simulations. To demonstrate how the new metrics can be interpreted, we compute them for simplified models of fluorescence and Compton scatter in a photon-counting detector and for a Monte Carlo model of a CdTe detector with 0.5 x 0.5 mm^2 pixels. Our results show that the ideal-linear-observer performance for any detection or material quantification task can be calculated from the proposed metrics. Off-diagonal elements in these matrices are shown to be related to imperfect energy resolution. The Monte Carlo model of the CdTe detector predicts a zero-frequency dose efficiency relative to an ideal detector of 0.86 and 0.65 for detecting water and bone, respectively. When the task instead is to quantify these materials, the corresponding values are 0.34 for water and 0.26 for bone. We have shown that the matrix-valued NEQ and DQE metrics contain sufficient information for calculating the dose efficiency for both detection or quantification tasks, the task having any spatial and energy dependence. This framework will be beneficial for the development of photon-counting X-ray detectors.
physics.med-ph
photoncounting energy resolving detectors are subject to intense research interest and there is a need for a general framework for performance assessment of these detectors the commonly used linearsystems theory framework which measures detector performance in terms of noiseequivalent quanta neq and detective quantum efficiency dqe is widely used for characterizing conventional xray detectors but does not take energyresolving capabilities into account we extend this framework to encompass energyresolving photoncounting detectors and elucidate how the imperfect energy response of realworld detectors affects imaging performance we generalize neq and dqe to matrixvalued quantities as functions of spatial frequency and show how these can be calculated from simple monte carlo simulations to demonstrate how the new metrics can be interpreted we compute them for simplified models of fluorescence and compton scatter in a photoncounting detector and for a monte carlo model of a cdte detector with 05 x 05 mm2 pixels our results show that the ideallinearobserver performance for any detection or material quantification task can be calculated from the proposed metrics offdiagonal elements in these matrices are shown to be related to imperfect energy resolution the monte carlo model of the cdte detector predicts a zerofrequency dose efficiency relative to an ideal detector of 086 and 065 for detecting water and bone respectively when the task instead is to quantify these materials the corresponding values are 034 for water and 026 for bone we have shown that the matrixvalued neq and dqe metrics contain sufficient information for calculating the dose efficiency for both detection or quantification tasks the task having any spatial and energy dependence this framework will be beneficial for the development of photoncounting xray detectors
[['photoncounting', 'energy', 'resolving', 'detectors', 'are', 'subject', 'to', 'intense', 'research', 'interest', 'and', 'there', 'is', 'a', 'need', 'for', 'a', 'general', 'framework', 'for', 'performance', 'assessment', 'of', 'these', 'detectors', 'the', 'commonly', 'used', 'linearsystems', 'theory', 'framework', 'which', 'measures', 'detector', 'performance', 'in', 'terms', 'of', 'noiseequivalent', 'quanta', 'neq', 'and', 'detective', 'quantum', 'efficiency', 'dqe', 'is', 'widely', 'used', 'for', 'characterizing', 'conventional', 'xray', 'detectors', 'but', 'does', 'not', 'take', 'energyresolving', 'capabilities', 'into', 'account', 'we', 'extend', 'this', 'framework', 'to', 'encompass', 'energyresolving', 'photoncounting', 'detectors', 'and', 'elucidate', 'how', 'the', 'imperfect', 'energy', 'response', 'of', 'realworld', 'detectors', 'affects', 'imaging', 'performance', 'we', 'generalize', 'neq', 'and', 'dqe', 'to', 'matrixvalued', 'quantities', 'as', 'functions', 'of', 'spatial', 'frequency', 'and', 'show', 'how', 'these', 'can', 'be', 'calculated', 'from', 'simple', 'monte', 'carlo', 'simulations', 'to', 'demonstrate', 'how', 'the', 'new', 'metrics', 'can', 'be', 'interpreted', 'we', 'compute', 'them', 'for', 'simplified', 'models', 'of', 'fluorescence', 'and', 'compton', 'scatter', 'in', 'a', 'photoncounting', 'detector', 'and', 'for', 'a', 'monte', 'carlo', 'model', 'of', 'a', 'cdte', 'detector', 'with', '05', 'x', '05', 'mm2', 'pixels', 'our', 'results', 'show', 'that', 'the', 'ideallinearobserver', 'performance', 'for', 'any', 'detection', 'or', 'material', 'quantification', 'task', 'can', 'be', 'calculated', 'from', 'the', 'proposed', 'metrics', 'offdiagonal', 'elements', 'in', 'these', 'matrices', 'are', 'shown', 'to', 'be', 'related', 'to', 'imperfect', 'energy', 'resolution', 'the', 'monte', 'carlo', 'model', 'of', 'the', 'cdte', 'detector', 'predicts', 'a', 'zerofrequency', 'dose', 'efficiency', 'relative', 'to', 'an', 'ideal', 'detector', 'of', '086', 'and', '065', 'for', 'detecting', 'water', 'and', 'bone', 'respectively', 'when', 'the', 'task', 'instead', 'is', 'to', 'quantify', 'these', 'materials', 'the', 'corresponding', 'values', 'are', '034', 'for', 'water', 'and', '026', 'for', 'bone', 'we', 'have', 'shown', 'that', 'the', 'matrixvalued', 'neq', 'and', 'dqe', 'metrics', 'contain', 'sufficient', 'information', 'for', 'calculating', 'the', 'dose', 'efficiency', 'for', 'both', 'detection', 'or', 'quantification', 'tasks', 'the', 'task', 'having', 'any', 'spatial', 'and', 'energy', 'dependence', 'this', 'framework', 'will', 'be', 'beneficial', 'for', 'the', 'development', 'of', 'photoncounting', 'xray', 'detectors']]
[-0.028871932400927544, 0.11075031273769101, -0.05563941298657688, 0.08540401432576528, -0.010690977644807503, -0.16027489556747415, -0.01681135409047664, 0.42700076645688856, -0.20366940584822293, -0.3446907364970658, 0.069269700537106, -0.3279270113379538, -0.10498698332761652, 0.24278482639512905, -0.07866514358248045, 0.09041681307046989, 0.09741325193869943, -0.012684867329841112, -0.09474975537733059, -0.19546094074349063, 0.22502143618168077, 0.11818058713956185, 0.31516646644454044, 0.10125551468957841, 0.12984586607224655, -0.003641117542615011, -0.017834965139627457, 0.01490238023221656, -0.12892440593714127, 0.07058592971387136, 0.3347150213227049, 0.12906708459821903, 0.22282344514986732, -0.4070882196189754, -0.23626693192509132, 0.1332600473427982, 0.11597744681970998, 0.037363920601706846, -0.034682782155284864, -0.2822129317035858, 0.09281563791310428, -0.18446641255775126, -0.07335241739918566, -0.08179883111648968, -0.0431254070819811, 0.016759265992572926, -0.2872212020744889, 0.063409324614739, 0.013365819105453812, 0.017349344806959783, -0.04740622975476032, -0.13556498001341497, 0.04030053739106269, 0.11751063949996554, -0.015279512166153524, -0.0007845792332222263, 0.1635391191557308, -0.13685908066435976, -0.11775494282079493, 0.3397999346752508, -0.025827264587010807, -0.2290431060836766, 0.15602877543156585, -0.1445636691110902, -0.08030469294970542, 0.15985338824264106, 0.17948558992182795, 0.11602794142596315, -0.16601377110113602, 0.026427997892253426, 0.055588362000909816, 0.21291844946345873, 0.04631047306776074, 0.06714657523068532, 0.20660875609015406, 0.18869390738040318, 0.015993761260701466, 0.12260620077563378, -0.1820956056940337, -0.043346589197061386, -0.2660329690896464, -0.1892304127767383, -0.16948856566658746, 0.05550061508484846, -0.09025809700013628, -0.13840003251875616, 0.3764321824134647, 0.20982285100885117, 0.11529622344898373, 0.055855359733835486, 0.31312110217587247, 0.10662564988665275, 0.07539279662398961, 0.01692913961065695, 0.25554784541324216, 0.10458510231743329, 0.06815400415433258, -0.198869130241066, 0.07049814432206815, 0.005835179585358468]
1,803.07484
Collective Schedules: Scheduling Meets Computational Social Choice
When scheduling public works or events in a shared facility one needs to accommodate preferences of a population. We formalize this problem by introducing the notion of a collective schedule. We show how to extend fundamental tools from social choice theory---positional scoring rules, the Kemeny rule and the Condorcet principle---to collective scheduling. We study the computational complexity of finding collective schedules. We also experimentally demonstrate that optimal collective schedules can be found for instances with realistic sizes.
cs.GT cs.MA
when scheduling public works or events in a shared facility one needs to accommodate preferences of a population we formalize this problem by introducing the notion of a collective schedule we show how to extend fundamental tools from social choice theorypositional scoring rules the kemeny rule and the condorcet principleto collective scheduling we study the computational complexity of finding collective schedules we also experimentally demonstrate that optimal collective schedules can be found for instances with realistic sizes
[['when', 'scheduling', 'public', 'works', 'or', 'events', 'in', 'a', 'shared', 'facility', 'one', 'needs', 'to', 'accommodate', 'preferences', 'of', 'a', 'population', 'we', 'formalize', 'this', 'problem', 'by', 'introducing', 'the', 'notion', 'of', 'a', 'collective', 'schedule', 'we', 'show', 'how', 'to', 'extend', 'fundamental', 'tools', 'from', 'social', 'choice', 'theorypositional', 'scoring', 'rules', 'the', 'kemeny', 'rule', 'and', 'the', 'condorcet', 'principleto', 'collective', 'scheduling', 'we', 'study', 'the', 'computational', 'complexity', 'of', 'finding', 'collective', 'schedules', 'we', 'also', 'experimentally', 'demonstrate', 'that', 'optimal', 'collective', 'schedules', 'can', 'be', 'found', 'for', 'instances', 'with', 'realistic', 'sizes']]
[-0.12050248250986138, 0.11215076113430163, -0.1050315061211586, 0.12049137939233333, -0.15886724983652434, -0.179253195853283, 0.19884166105339923, 0.4209326946735382, -0.3137596338490645, -0.33046399061878523, 0.05062581340316683, -0.21821347028017044, -0.1831388238351792, 0.15494948595451813, -0.13344863314181565, 0.05684488932291667, 0.09164922499408325, 0.03180926634619633, 0.02687088003770138, -0.29320802496125303, 0.2897993951290846, 0.0559095960482955, 0.32405136914302907, 0.03460104160631696, 0.07448929927622279, 0.04029802655878787, -0.021271922923624516, 0.06076292528926085, -0.11758397604076891, 0.1023260184082513, 0.3438327186057965, 0.23936309196054936, 0.37759568721055986, -0.3928594520812233, -0.1722458319614331, 0.13824287279198566, 0.12676430465032656, 0.1317679511817793, 0.006769291566063961, -0.23610207402147354, 0.05468213342130184, -0.18911518151561418, -0.11048209166154266, -0.09581718395153681, -0.01761308002906541, 0.04860985815214614, -0.2998384277522564, 0.005606183480704203, 8.116580545902252e-05, 0.032049108172456424, -0.06876395801703135, -0.08397068577508132, 0.04979399479925632, 0.13674761094346952, 0.06279435762514671, -0.07331945491644243, 0.14790455914568157, -0.11472099967611332, -0.2661319347284734, 0.43487877130508423, 0.03073480092609922, -0.20890251653889816, 0.13540358558297158, -0.044636552513887484, -0.17721397614106535, 0.06889802837666745, 0.2181277353813251, 0.12854055155689517, -0.18303398728157239, -0.02234072638132299, -0.09783495323654885, 0.19045223026225963, 0.06719811807076136, 0.01924738417689999, 0.15338423629601797, 0.21861964579361182, 0.10381904614468415, 0.1787446111207828, -0.0012678569089621305, -0.1365581157927712, -0.22782263742449382, -0.08659674826660194, -0.12905632564177116, 0.03495576294759909, -0.0733128983277129, -0.08424181135992209, 0.3954622296616435, 0.18780308083941538, 0.13571436584034624, 0.11510160281012456, 0.2833804989233613, 0.05534948636777699, 0.06629737223188083, 0.1252918785934647, 0.1682099725306034, -0.020616962173953653, 0.09498450097938378, -0.27672816534526645, 0.12237009877339006, 0.020060252191809316]
1,803.07485
Actor and Action Video Segmentation from a Sentence
This paper strives for pixel-level segmentation of actors and their actions in video content. Different from existing works, which all learn to segment from a fixed vocabulary of actor and action pairs, we infer the segmentation from a natural language input sentence. This allows to distinguish between fine-grained actors in the same super-category, identify actor and action instances, and segment pairs that are outside of the actor and action vocabulary. We propose a fully-convolutional model for pixel-level actor and action segmentation using an encoder-decoder architecture optimized for video. To show the potential of actor and action video segmentation from a sentence, we extend two popular actor and action datasets with more than 7,500 natural language descriptions. Experiments demonstrate the quality of the sentence-guided segmentations, the generalization ability of our model, and its advantage for traditional actor and action segmentation compared to the state-of-the-art.
cs.CV
this paper strives for pixellevel segmentation of actors and their actions in video content different from existing works which all learn to segment from a fixed vocabulary of actor and action pairs we infer the segmentation from a natural language input sentence this allows to distinguish between finegrained actors in the same supercategory identify actor and action instances and segment pairs that are outside of the actor and action vocabulary we propose a fullyconvolutional model for pixellevel actor and action segmentation using an encoderdecoder architecture optimized for video to show the potential of actor and action video segmentation from a sentence we extend two popular actor and action datasets with more than 7500 natural language descriptions experiments demonstrate the quality of the sentenceguided segmentations the generalization ability of our model and its advantage for traditional actor and action segmentation compared to the stateoftheart
[['this', 'paper', 'strives', 'for', 'pixellevel', 'segmentation', 'of', 'actors', 'and', 'their', 'actions', 'in', 'video', 'content', 'different', 'from', 'existing', 'works', 'which', 'all', 'learn', 'to', 'segment', 'from', 'a', 'fixed', 'vocabulary', 'of', 'actor', 'and', 'action', 'pairs', 'we', 'infer', 'the', 'segmentation', 'from', 'a', 'natural', 'language', 'input', 'sentence', 'this', 'allows', 'to', 'distinguish', 'between', 'finegrained', 'actors', 'in', 'the', 'same', 'supercategory', 'identify', 'actor', 'and', 'action', 'instances', 'and', 'segment', 'pairs', 'that', 'are', 'outside', 'of', 'the', 'actor', 'and', 'action', 'vocabulary', 'we', 'propose', 'a', 'fullyconvolutional', 'model', 'for', 'pixellevel', 'actor', 'and', 'action', 'segmentation', 'using', 'an', 'encoderdecoder', 'architecture', 'optimized', 'for', 'video', 'to', 'show', 'the', 'potential', 'of', 'actor', 'and', 'action', 'video', 'segmentation', 'from', 'a', 'sentence', 'we', 'extend', 'two', 'popular', 'actor', 'and', 'action', 'datasets', 'with', 'more', 'than', '7500', 'natural', 'language', 'descriptions', 'experiments', 'demonstrate', 'the', 'quality', 'of', 'the', 'sentenceguided', 'segmentations', 'the', 'generalization', 'ability', 'of', 'our', 'model', 'and', 'its', 'advantage', 'for', 'traditional', 'actor', 'and', 'action', 'segmentation', 'compared', 'to', 'the', 'stateoftheart']]
[-0.02271392578373886, -0.0177760708274305, -0.06968792177684291, 0.05763502069257043, -0.14807585922141991, -0.16712412420778314, 0.03223819211600873, 0.47348662924913454, -0.2685914330682914, -0.34630053525488874, 0.005904564451964074, -0.28998738957389053, -0.15290533155727554, 0.1238722889257831, -0.19441141260945252, 0.0335271260172332, 0.18005356678909715, 0.15596171314368995, -0.021005723938595136, -0.24427403286624122, 0.3052967342951427, -0.015456491133565424, 0.330522742786471, 0.014128636470405569, 0.18385722361583734, -0.017775945017822613, -0.04162166595072026, -0.03506037435481246, -0.027935411710823758, 0.20963404284016243, 0.3285189302634894, 0.23247443773114765, 0.27412678980150484, -0.40436077043807633, -0.19878567549281975, 0.04613370627236985, 0.10205000388094972, 0.10633730587992624, 0.0016173693054465537, -0.4106086110433852, 0.10593502707844994, -0.22110882419830477, 0.09334585507413451, -0.10158699131767515, 0.02780579286955402, -0.03166092174704856, -0.32263307082368403, -0.01661176801639491, 0.11780091343303277, 0.08060212446506623, -0.1069855551578885, -0.044205094154753634, 0.0012295822872006347, 0.25360906360880797, 0.05762080102011194, 0.1191912623365003, 0.16623969055371177, -0.2474133801961344, -0.1425789313908981, 0.419302043085262, -0.07617156716724809, -0.22624531652594745, 0.2364705856102453, -0.02837077324593466, -0.12584185339576026, 0.053562568938425204, 0.20558885698088666, 0.1514382473075054, -0.15955440540024093, -0.006066284110461375, -0.05308352337336876, 0.1889198033543284, 0.09803817794546747, 0.0015867611517946065, 0.20809850548590783, 0.24926828941933707, 0.015061252258150694, 0.1472138572693003, -0.12332115281196179, -0.09383789180043403, -0.23374537913732127, -0.12882403910002657, -0.12176438196788503, -0.0565816200843317, -0.11469778471891146, -0.13610284412937634, 0.4387762546014618, 0.2827945985883789, 0.2010058861350457, 0.1687963608083394, 0.3387863926087755, -0.05691314932913191, 0.14086778546375237, 0.07050956251808035, 0.08789526601403978, -0.05103142437702176, 0.08713536677327872, -0.16747151851788505, 0.06218428639563876, 0.11215081652232879]
1,803.07486
The Gerstenhaber product $\HH^2(A)\times \HH^2(A)\to \HH^3(A)$ of affine toric varieties
For an affine toric variety $\spec(A)$, we give a convex geometric interpretation of the Gerstenhaber product $\HH^2(A)\times \HH^2(A)\to \HH^3(A)$ between the Hochschild cohomology groups. In the case of Gorenstein toric surfaces we prove that the Gerstenhaber product is the zero map. As an application in commutative deformation theory we find the equations of the versal base space (in special lattice degrees) up to second order for not necessarily isolated toric Gorenstein singularities. Our construction reproves and generalizes results obtained in [1] and [13].
math.AG
for an affine toric variety speca we give a convex geometric interpretation of the gerstenhaber product hh2atimes hh2ato hh3a between the hochschild cohomology groups in the case of gorenstein toric surfaces we prove that the gerstenhaber product is the zero map as an application in commutative deformation theory we find the equations of the versal base space in special lattice degrees up to second order for not necessarily isolated toric gorenstein singularities our construction reproves and generalizes results obtained in 1 and 13
[['for', 'an', 'affine', 'toric', 'variety', 'speca', 'we', 'give', 'a', 'convex', 'geometric', 'interpretation', 'of', 'the', 'gerstenhaber', 'product', 'hh2atimes', 'hh2ato', 'hh3a', 'between', 'the', 'hochschild', 'cohomology', 'groups', 'in', 'the', 'case', 'of', 'gorenstein', 'toric', 'surfaces', 'we', 'prove', 'that', 'the', 'gerstenhaber', 'product', 'is', 'the', 'zero', 'map', 'as', 'an', 'application', 'in', 'commutative', 'deformation', 'theory', 'we', 'find', 'the', 'equations', 'of', 'the', 'versal', 'base', 'space', 'in', 'special', 'lattice', 'degrees', 'up', 'to', 'second', 'order', 'for', 'not', 'necessarily', 'isolated', 'toric', 'gorenstein', 'singularities', 'our', 'construction', 'reproves', 'and', 'generalizes', 'results', 'obtained', 'in', '1', 'and', '13']]
[-0.18858887679525652, -0.027968580709057278, -0.08407179429195821, 0.07880411382793681, -0.08118100257124752, -0.13714573160395957, -0.081188137405843, 0.31149373574880884, -0.374384680314688, -0.17952297714073212, 0.08758517359383404, -0.21614138529694174, -0.17907615444855765, 0.16808305137092247, -0.21873745669145137, -0.053234681859612464, 0.04280216924380511, 0.06886441236711108, -0.15390320985752623, -0.3610227808356285, 0.45676446240977386, -0.007335887296358123, 0.23485162034630774, 0.08871202897425974, 0.10655183859053068, 0.03262750669382512, 0.018723707483150064, -0.02093303229812591, -0.21826832855922476, 0.09114192376146094, 0.3598841693950817, 0.032925336572225204, 0.10875095409573987, -0.3853418097947724, -0.0942408746075671, 0.16791898568044417, 0.1147859816730488, 0.07430785562610254, -0.0012754221112118102, -0.23465222175291273, 0.08256244583753869, -0.22438815069617704, -0.1974067666917108, -0.11413165374542586, 0.035371147375553844, -0.0037586279679089783, -0.2269336394558195, -0.014977914816699921, 0.12192978508537636, 0.17378744651796296, -0.09585543086286634, -0.0827325915102847, -0.1145410747936694, 0.056538761977571995, -0.05748425912897801, 0.05921107265749015, 0.10442801946192048, -0.09103428869275376, -0.17788419071002864, 0.35944741187850016, -0.035368502374331, -0.25007445497321895, 0.10779606332071126, -0.19827386374818162, -0.19417794185283127, 0.15974562639166834, 0.02911217075306922, 0.1813158019213006, 0.026797110179904847, 0.18436636244150578, -0.10536314249620773, 0.03507523670559749, 0.11284990973072126, -0.00454274415387772, 0.12941967307415325, 0.0920018081786111, 0.10231900305952876, 0.14246578560268972, 0.003996986208949238, -0.09152998705976642, -0.39508234676904974, -0.2268016694146354, -0.12727331531932579, 0.19839803575614495, -0.1620302005783742, -0.17120957346924115, 0.37653908255160784, 0.0508052468590904, 0.1827223517058883, 0.1184791338047944, 0.2163740560237784, -0.019072712474735454, 0.051129801070783285, 0.04730215322342701, 0.13430468378355725, 0.25309244603849945, -0.011205910868011416, -0.11166971218226536, -0.07130295604001731, 0.2458694234257564]
1,803.07487
FastDeRain: A Novel Video Rain Streak Removal Method Using Directional Gradient Priors
Rain streak removal is an important issue in outdoor vision systems and has recently been investigated extensively. In this paper, we propose a novel video rain streak removal approach FastDeRain, which fully considers the discriminative characteristics of rain streaks and the clean video in the gradient domain. Specifically, on the one hand, rain streaks are sparse and smooth along the direction of the raindrops, whereas on the other hand, clean videos exhibit piecewise smoothness along the rain-perpendicular direction and continuity along the temporal direction. Theses smoothness and continuity results in the sparse distribution in the different directional gradient domain, respectively. Thus, we minimize 1) the $\ell_1$ norm to enhance the sparsity of the underlying rain streaks, 2) two $\ell_1$ norm of unidirectional Total Variation (TV) regularizers to guarantee the anisotropic spatial smoothness, and 3) an $\ell_1$ norm of the time-directional difference operator to characterize the temporal continuity. A split augmented Lagrangian shrinkage algorithm (SALSA) based algorithm is designed to solve the proposed minimization model. Experiments conducted on synthetic and real data demonstrate the effectiveness and efficiency of the proposed method. According to comprehensive quantitative performance measures, our approach outperforms other state-of-the-art methods especially on account of the running time. The code of FastDeRain can be downloaded at https://github.com/TaiXiangJiang/FastDeRain.
cs.CV
rain streak removal is an important issue in outdoor vision systems and has recently been investigated extensively in this paper we propose a novel video rain streak removal approach fastderain which fully considers the discriminative characteristics of rain streaks and the clean video in the gradient domain specifically on the one hand rain streaks are sparse and smooth along the direction of the raindrops whereas on the other hand clean videos exhibit piecewise smoothness along the rainperpendicular direction and continuity along the temporal direction theses smoothness and continuity results in the sparse distribution in the different directional gradient domain respectively thus we minimize 1 the ell_1 norm to enhance the sparsity of the underlying rain streaks 2 two ell_1 norm of unidirectional total variation tv regularizers to guarantee the anisotropic spatial smoothness and 3 an ell_1 norm of the timedirectional difference operator to characterize the temporal continuity a split augmented lagrangian shrinkage algorithm salsa based algorithm is designed to solve the proposed minimization model experiments conducted on synthetic and real data demonstrate the effectiveness and efficiency of the proposed method according to comprehensive quantitative performance measures our approach outperforms other stateoftheart methods especially on account of the running time the code of fastderain can be downloaded at httpsgithubcomtaixiangjiangfastderain
[['rain', 'streak', 'removal', 'is', 'an', 'important', 'issue', 'in', 'outdoor', 'vision', 'systems', 'and', 'has', 'recently', 'been', 'investigated', 'extensively', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'video', 'rain', 'streak', 'removal', 'approach', 'fastderain', 'which', 'fully', 'considers', 'the', 'discriminative', 'characteristics', 'of', 'rain', 'streaks', 'and', 'the', 'clean', 'video', 'in', 'the', 'gradient', 'domain', 'specifically', 'on', 'the', 'one', 'hand', 'rain', 'streaks', 'are', 'sparse', 'and', 'smooth', 'along', 'the', 'direction', 'of', 'the', 'raindrops', 'whereas', 'on', 'the', 'other', 'hand', 'clean', 'videos', 'exhibit', 'piecewise', 'smoothness', 'along', 'the', 'rainperpendicular', 'direction', 'and', 'continuity', 'along', 'the', 'temporal', 'direction', 'theses', 'smoothness', 'and', 'continuity', 'results', 'in', 'the', 'sparse', 'distribution', 'in', 'the', 'different', 'directional', 'gradient', 'domain', 'respectively', 'thus', 'we', 'minimize', '1', 'the', 'ell_1', 'norm', 'to', 'enhance', 'the', 'sparsity', 'of', 'the', 'underlying', 'rain', 'streaks', '2', 'two', 'ell_1', 'norm', 'of', 'unidirectional', 'total', 'variation', 'tv', 'regularizers', 'to', 'guarantee', 'the', 'anisotropic', 'spatial', 'smoothness', 'and', '3', 'an', 'ell_1', 'norm', 'of', 'the', 'timedirectional', 'difference', 'operator', 'to', 'characterize', 'the', 'temporal', 'continuity', 'a', 'split', 'augmented', 'lagrangian', 'shrinkage', 'algorithm', 'salsa', 'based', 'algorithm', 'is', 'designed', 'to', 'solve', 'the', 'proposed', 'minimization', 'model', 'experiments', 'conducted', 'on', 'synthetic', 'and', 'real', 'data', 'demonstrate', 'the', 'effectiveness', 'and', 'efficiency', 'of', 'the', 'proposed', 'method', 'according', 'to', 'comprehensive', 'quantitative', 'performance', 'measures', 'our', 'approach', 'outperforms', 'other', 'stateoftheart', 'methods', 'especially', 'on', 'account', 'of', 'the', 'running', 'time', 'the', 'code', 'of', 'fastderain', 'can', 'be', 'downloaded', 'at', 'httpsgithubcomtaixiangjiangfastderain']]
[-0.07382333606102631, 0.03283421013532229, -0.09296035651256235, 0.08153461610873267, -0.1030455727082239, -0.11051203520950295, -0.034971919283384965, 0.4650669991604838, -0.3174708907392022, -0.2735212777156894, 0.12824977802137807, -0.26938963516195324, -0.15376938505134746, 0.1382394630048771, -0.14884481159057103, 0.09569914440547947, 0.08613652376887188, 0.02895279479779157, -0.07554293048166323, -0.28010987794122605, 0.28309708914728654, 0.0338801593455833, 0.353590184352452, 0.06692052815524935, 0.1417459522872734, -0.017163385116659543, -0.07024374350593836, 0.005026209127012693, -0.06689622063034524, 0.1276639202203346, 0.21710052667642196, 0.13910840231498392, 0.3129982579243826, -0.435429806296038, -0.2527340051225003, 0.09386694298454505, 0.12630691156835597, 0.036135587322539374, -0.06064609231543727, -0.3091757405371241, 0.11568620799145862, -0.0995525109465234, -0.03194045740212245, -0.07665004818380683, -0.04927141413288921, 0.025371424369879214, -0.2994940242428771, 0.09223245245783462, 0.07552309928681045, 0.05132890823662427, -0.08241542649863963, -0.13499511542784817, -0.0018714612279105566, 0.10953951738181286, 0.0704135148798563, 0.04670572793111205, 0.12043045883240434, -0.12315395213469553, -0.0942935493732483, 0.3560870472962658, -0.09325797585644942, -0.22786270081768653, 0.18863429215864516, -0.06956714045429858, -0.10371827651568524, 0.13519741558268958, 0.24806735090290508, 0.1397989867780102, -0.12588287828097522, 0.031664545026918255, -0.03728290976084513, 0.15250027171215133, 0.09783045029582675, 0.017724831574870384, 0.0974151512331731, 0.18079512491000488, 0.14390764322260843, 0.1323154600823353, -0.17859726059980982, -0.06680397704065613, -0.22552997076355477, -0.1123941458531144, -0.1998543793006855, -0.09859203778700355, -0.1268554867051802, -0.1419592310980364, 0.4414939402548971, 0.18415780530274645, 0.20077439215417733, 0.05201215896351427, 0.3842874454042199, 0.03894913354238002, 0.062037118336793, 0.07787098096998628, 0.18285232126101048, 0.07530602119867598, 0.1252113062815339, -0.2380820547479351, 0.09118918351847313, 0.0988656607794338]
1,803.07488
Dynamic Variational Autoencoders for Visual Process Modeling
This work studies the problem of modeling visual processes by leveraging deep generative architectures for learning linear, Gaussian representations from observed sequences. We propose a joint learning framework, combining a vector autoregressive model and Variational Autoencoders. This results in an architecture that allows Variational Autoencoders to simultaneously learn a non-linear observation as well as a linear state model from sequences of frames. We validate our approach on artificial sequences and dynamic textures.
cs.NE cs.MM
this work studies the problem of modeling visual processes by leveraging deep generative architectures for learning linear gaussian representations from observed sequences we propose a joint learning framework combining a vector autoregressive model and variational autoencoders this results in an architecture that allows variational autoencoders to simultaneously learn a nonlinear observation as well as a linear state model from sequences of frames we validate our approach on artificial sequences and dynamic textures
[['this', 'work', 'studies', 'the', 'problem', 'of', 'modeling', 'visual', 'processes', 'by', 'leveraging', 'deep', 'generative', 'architectures', 'for', 'learning', 'linear', 'gaussian', 'representations', 'from', 'observed', 'sequences', 'we', 'propose', 'a', 'joint', 'learning', 'framework', 'combining', 'a', 'vector', 'autoregressive', 'model', 'and', 'variational', 'autoencoders', 'this', 'results', 'in', 'an', 'architecture', 'that', 'allows', 'variational', 'autoencoders', 'to', 'simultaneously', 'learn', 'a', 'nonlinear', 'observation', 'as', 'well', 'as', 'a', 'linear', 'state', 'model', 'from', 'sequences', 'of', 'frames', 'we', 'validate', 'our', 'approach', 'on', 'artificial', 'sequences', 'and', 'dynamic', 'textures']]
[-0.001221235906187859, 0.007295181898977414, -0.10348038835864928, 0.07943456621918206, -0.1090801787795499, -0.1635741370717167, 0.03592461655433807, 0.47538139629695153, -0.34869275339749745, -0.30190175236202776, 0.02636420897680283, -0.2316176480027126, -0.3098692151058155, 0.16044807852530438, -0.1115781092343645, 0.1687761656422582, 0.11823609093618062, 0.001953284424315724, -0.0778556452876526, -0.20048389374925238, 0.31061244231952717, 0.03202190110096126, 0.334138284295073, -0.10766283876728266, 0.21249870157205603, 0.01993206570882143, -0.0020877471833955497, -0.05672643571678135, -0.07670376818522426, 0.2322489439377225, 0.2982776817451749, 0.1963428179199885, 0.3614170243931262, -0.4226475455280807, -0.32723818318400943, 0.06649825699989581, 0.12426338907486449, 0.15235372273147935, -0.03175151226039614, -0.38582453775840503, 0.036589855121241674, -0.15368057141960081, 0.031402198280880436, -0.18822427974858633, -0.09147729429726799, 0.002521785419958178, -0.37202968826103544, 0.037454254640680223, 0.15032009375378644, 0.05432527996082273, -0.13515327792669674, -0.1077990039355225, 0.0694495492530728, 0.08997448483326782, 0.015130979122154208, 0.0503799955218306, 0.07574644380818224, -0.16797921395886484, -0.21212173032108694, 0.2909317923282894, -0.10934660488662, -0.24147396301850677, 0.18283168957956755, 0.029102183134657227, -0.17719143716385588, 0.05286290338780317, 0.3043650184602787, 0.15448883816780937, -0.20113165016906956, 0.026348513500933122, -0.08530552704016575, 0.16569135746653452, -0.01012107904534787, -0.02245877034470646, 0.20133743779863128, 0.2800049085635692, -0.0005712847406458524, 0.15522310668731937, -0.14642348710589836, -0.09392015065532178, -0.22721525985333654, -0.06676708907939934, -0.20360765373010914, -0.017635806612411722, -0.09168377687415664, -0.12521252326102209, 0.39501359262633035, 0.20565704747827518, 0.27362784394063056, 0.17733677553931354, 0.33903341287643546, 0.056401366644422524, 0.07951710985798854, 0.0807954612084561, 0.12751631170976907, 0.12871724789147265, 0.1277423747879867, -0.1306458662212309, 0.06184039910375658, 0.06309027998941019]
1,803.07489
Test beam results of a Cylindrical GEM detector for the BESIII experiment
Gas detector are very light instrument used in high energy physics to measure the particle properties: position and momentum. Through high electric field is possible to use the Gas Electron Multiplier (GEM) technology to detect the charged particles and to exploit their properties to construct a large area detector, such as the new IT for BESIII. The state of the art in the GEM production allows to create very large area GEM foils (up to 50x100 $\mathrm{cm}^2$) and thanks to the small thickness of these foils is it possible to shape it to the desired form: a Cylindrical Gas Electron Multiplier (CGEM) is then proposed. The innovative construction technique based on Rohacell, a PMI foam, will give solidity to cathode and anode with a very low impact on material budget. The entire detector is sustained by Permaglass rings glued at the edges. These rings are used to assembly the CGEM, together with a dedicated Vertical Insertion System and moreover they host the On-Detector electronic. The anode has been improved w.r.t. the state of the art through a jagged readout that minimize the inter-strip capacitance. The mechanical challenge of this detector requires a precision of the entire geometry within few hundreds of microns in the whole area. In this contribution an overview of the construction technique, the validation of this technique through the realization of a CGEM, and its first tests will be presented. These activities are performed within the framework of the BESIIICGEM Project (645664), funded by the European Commission in the action H2020-RISE-MSCA-2014.
physics.ins-det hep-ex
gas detector are very light instrument used in high energy physics to measure the particle properties position and momentum through high electric field is possible to use the gas electron multiplier gem technology to detect the charged particles and to exploit their properties to construct a large area detector such as the new it for besiii the state of the art in the gem production allows to create very large area gem foils up to 50x100 mathrmcm2 and thanks to the small thickness of these foils is it possible to shape it to the desired form a cylindrical gas electron multiplier cgem is then proposed the innovative construction technique based on rohacell a pmi foam will give solidity to cathode and anode with a very low impact on material budget the entire detector is sustained by permaglass rings glued at the edges these rings are used to assembly the cgem together with a dedicated vertical insertion system and moreover they host the ondetector electronic the anode has been improved wrt the state of the art through a jagged readout that minimize the interstrip capacitance the mechanical challenge of this detector requires a precision of the entire geometry within few hundreds of microns in the whole area in this contribution an overview of the construction technique the validation of this technique through the realization of a cgem and its first tests will be presented these activities are performed within the framework of the besiiicgem project 645664 funded by the european commission in the action h2020risemsca2014
[['gas', 'detector', 'are', 'very', 'light', 'instrument', 'used', 'in', 'high', 'energy', 'physics', 'to', 'measure', 'the', 'particle', 'properties', 'position', 'and', 'momentum', 'through', 'high', 'electric', 'field', 'is', 'possible', 'to', 'use', 'the', 'gas', 'electron', 'multiplier', 'gem', 'technology', 'to', 'detect', 'the', 'charged', 'particles', 'and', 'to', 'exploit', 'their', 'properties', 'to', 'construct', 'a', 'large', 'area', 'detector', 'such', 'as', 'the', 'new', 'it', 'for', 'besiii', 'the', 'state', 'of', 'the', 'art', 'in', 'the', 'gem', 'production', 'allows', 'to', 'create', 'very', 'large', 'area', 'gem', 'foils', 'up', 'to', '50x100', 'mathrmcm2', 'and', 'thanks', 'to', 'the', 'small', 'thickness', 'of', 'these', 'foils', 'is', 'it', 'possible', 'to', 'shape', 'it', 'to', 'the', 'desired', 'form', 'a', 'cylindrical', 'gas', 'electron', 'multiplier', 'cgem', 'is', 'then', 'proposed', 'the', 'innovative', 'construction', 'technique', 'based', 'on', 'rohacell', 'a', 'pmi', 'foam', 'will', 'give', 'solidity', 'to', 'cathode', 'and', 'anode', 'with', 'a', 'very', 'low', 'impact', 'on', 'material', 'budget', 'the', 'entire', 'detector', 'is', 'sustained', 'by', 'permaglass', 'rings', 'glued', 'at', 'the', 'edges', 'these', 'rings', 'are', 'used', 'to', 'assembly', 'the', 'cgem', 'together', 'with', 'a', 'dedicated', 'vertical', 'insertion', 'system', 'and', 'moreover', 'they', 'host', 'the', 'ondetector', 'electronic', 'the', 'anode', 'has', 'been', 'improved', 'wrt', 'the', 'state', 'of', 'the', 'art', 'through', 'a', 'jagged', 'readout', 'that', 'minimize', 'the', 'interstrip', 'capacitance', 'the', 'mechanical', 'challenge', 'of', 'this', 'detector', 'requires', 'a', 'precision', 'of', 'the', 'entire', 'geometry', 'within', 'few', 'hundreds', 'of', 'microns', 'in', 'the', 'whole', 'area', 'in', 'this', 'contribution', 'an', 'overview', 'of', 'the', 'construction', 'technique', 'the', 'validation', 'of', 'this', 'technique', 'through', 'the', 'realization', 'of', 'a', 'cgem', 'and', 'its', 'first', 'tests', 'will', 'be', 'presented', 'these', 'activities', 'are', 'performed', 'within', 'the', 'framework', 'of', 'the', 'besiiicgem', 'project', '645664', 'funded', 'by', 'the', 'european', 'commission', 'in', 'the', 'action', 'h2020risemsca2014']]
[-0.07388384536413166, 0.10157083177404436, -0.07247718680186205, 0.005817776103129977, -0.046128679748557236, -0.11533092298399074, 0.018358269928913398, 0.37194152896004506, -0.24004764378774, -0.35077992370015526, 0.11022111212967495, -0.291320847404476, -0.050334704538898906, 0.20738966854889485, -0.07204399797990618, 0.08282731543552228, 0.06186119377534522, -0.007000842044713447, -0.0646429048593055, -0.23820820858844194, 0.23583128449252722, 0.16126044420151406, 0.29295103001617734, 0.06780795791339743, 0.14096610935944429, -0.034204833040560455, -0.025743744055316018, 0.0017335519202083469, -0.11949226489196738, 0.12714372836422722, 0.2557702445047328, 0.08880780759850988, 0.240959074641821, -0.4529666272646572, -0.13363350170218463, 0.03165371514703465, 0.07845377937954173, 0.05464899958107605, -0.08517612555030599, -0.26266506048345784, 0.08673934630271661, -0.2197350535259384, -0.15664758765321957, -0.039571142372073057, 0.0035404472646441863, 0.04356681768329866, -0.21975468381132227, -0.03209319615168085, 0.011500357027468553, 0.0011884886897673987, -0.03786168561432039, -0.09051345264956161, 0.000697498935383247, 0.11151919514127824, 0.008976293786196974, 0.049802410042279935, 0.19958848570544557, -0.11646551607704037, -0.054531338772396125, 0.32643893273195707, -0.0547274188122181, -0.17690940038207545, 0.19690393008774212, -0.18366252664237256, -0.06339234037579124, 0.17700124140754042, 0.1813100351798666, 0.08661749001861696, -0.1930674019505281, 0.06371227512475063, 0.011236709020807442, 0.16971737150678853, 0.06061118489961667, 0.04042967683055913, 0.2514562688947442, 0.2412873454107697, 0.07175416778586056, 0.1478104253059223, -0.1637847009498297, -0.029403421298944837, -0.29193168039242906, -0.2051822355946986, -0.1547386081876181, 0.031898577208537233, -0.015301660050747422, -0.1664820074526421, 0.409932737578133, 0.13160314482083194, 0.16562690946972933, -0.04355399596157024, 0.31106595158666733, 0.03683025127647998, 0.14012659112614276, 0.01985479752536878, 0.2610686053877255, 0.13720437928053703, 0.13277774053928723, -0.21094926913272605, 0.04056441818642613, 0.04122288429096947]
1,803.0749
The VO: A powerful tool for global astronomy
Since its inception in the early 2000, the Virtual Observatory (VO), developed as a collaboration of many national and international projects, has become a major factor in the discovery and dissemination of astronomical information worldwide. The IVOA has been coordinating all these efforts worldwide to ensure a common VO framework that enables transparent access to and interoperability of astronomy resources (data and software) around the world. The VO is not a magic solution to all astronomy data management challenges but it does bring useful solutions in many areas borne out by the fact that VO interfaces are broadly found in astronomy major data centres and projects worldwide. Astronomy data centres have been building VO services on top of their existing data services to increase interoperability with other VO-compliant data resources to take advantage of the continuous and increasing development of VO applications. VO applications have made multi-instrument and multi-wavelength science, a difficult and fruitful part of astronomy, somewhat easier. More recently, several major new astronomy projects have been directly adopting VO standards to build their data management infrastructure, giving birth to VO built-in archives. Embracing the VO framework from the beginning brings the double gain of not needing to reinvent the wheel and ensuring from the start interoperability with other astronomy VO resources. Some of the IVOA standards are also starting to be used by neighbour disciplines like planetary sciences. There is still quite a lot to be done on the VO, in particular tackling the upcoming big data challenge and how to find interoperable solutions to the new data analysis paradigm of bringing and running the software close to the data.
astro-ph.IM
since its inception in the early 2000 the virtual observatory vo developed as a collaboration of many national and international projects has become a major factor in the discovery and dissemination of astronomical information worldwide the ivoa has been coordinating all these efforts worldwide to ensure a common vo framework that enables transparent access to and interoperability of astronomy resources data and software around the world the vo is not a magic solution to all astronomy data management challenges but it does bring useful solutions in many areas borne out by the fact that vo interfaces are broadly found in astronomy major data centres and projects worldwide astronomy data centres have been building vo services on top of their existing data services to increase interoperability with other vocompliant data resources to take advantage of the continuous and increasing development of vo applications vo applications have made multiinstrument and multiwavelength science a difficult and fruitful part of astronomy somewhat easier more recently several major new astronomy projects have been directly adopting vo standards to build their data management infrastructure giving birth to vo builtin archives embracing the vo framework from the beginning brings the double gain of not needing to reinvent the wheel and ensuring from the start interoperability with other astronomy vo resources some of the ivoa standards are also starting to be used by neighbour disciplines like planetary sciences there is still quite a lot to be done on the vo in particular tackling the upcoming big data challenge and how to find interoperable solutions to the new data analysis paradigm of bringing and running the software close to the data
[['since', 'its', 'inception', 'in', 'the', 'early', '2000', 'the', 'virtual', 'observatory', 'vo', 'developed', 'as', 'a', 'collaboration', 'of', 'many', 'national', 'and', 'international', 'projects', 'has', 'become', 'a', 'major', 'factor', 'in', 'the', 'discovery', 'and', 'dissemination', 'of', 'astronomical', 'information', 'worldwide', 'the', 'ivoa', 'has', 'been', 'coordinating', 'all', 'these', 'efforts', 'worldwide', 'to', 'ensure', 'a', 'common', 'vo', 'framework', 'that', 'enables', 'transparent', 'access', 'to', 'and', 'interoperability', 'of', 'astronomy', 'resources', 'data', 'and', 'software', 'around', 'the', 'world', 'the', 'vo', 'is', 'not', 'a', 'magic', 'solution', 'to', 'all', 'astronomy', 'data', 'management', 'challenges', 'but', 'it', 'does', 'bring', 'useful', 'solutions', 'in', 'many', 'areas', 'borne', 'out', 'by', 'the', 'fact', 'that', 'vo', 'interfaces', 'are', 'broadly', 'found', 'in', 'astronomy', 'major', 'data', 'centres', 'and', 'projects', 'worldwide', 'astronomy', 'data', 'centres', 'have', 'been', 'building', 'vo', 'services', 'on', 'top', 'of', 'their', 'existing', 'data', 'services', 'to', 'increase', 'interoperability', 'with', 'other', 'vocompliant', 'data', 'resources', 'to', 'take', 'advantage', 'of', 'the', 'continuous', 'and', 'increasing', 'development', 'of', 'vo', 'applications', 'vo', 'applications', 'have', 'made', 'multiinstrument', 'and', 'multiwavelength', 'science', 'a', 'difficult', 'and', 'fruitful', 'part', 'of', 'astronomy', 'somewhat', 'easier', 'more', 'recently', 'several', 'major', 'new', 'astronomy', 'projects', 'have', 'been', 'directly', 'adopting', 'vo', 'standards', 'to', 'build', 'their', 'data', 'management', 'infrastructure', 'giving', 'birth', 'to', 'vo', 'builtin', 'archives', 'embracing', 'the', 'vo', 'framework', 'from', 'the', 'beginning', 'brings', 'the', 'double', 'gain', 'of', 'not', 'needing', 'to', 'reinvent', 'the', 'wheel', 'and', 'ensuring', 'from', 'the', 'start', 'interoperability', 'with', 'other', 'astronomy', 'vo', 'resources', 'some', 'of', 'the', 'ivoa', 'standards', 'are', 'also', 'starting', 'to', 'be', 'used', 'by', 'neighbour', 'disciplines', 'like', 'planetary', 'sciences', 'there', 'is', 'still', 'quite', 'a', 'lot', 'to', 'be', 'done', 'on', 'the', 'vo', 'in', 'particular', 'tackling', 'the', 'upcoming', 'big', 'data', 'challenge', 'and', 'how', 'to', 'find', 'interoperable', 'solutions', 'to', 'the', 'new', 'data', 'analysis', 'paradigm', 'of', 'bringing', 'and', 'running', 'the', 'software', 'close', 'to', 'the', 'data']]
[-0.08570684968050474, 0.04259578883819118, -0.05537484573056538, 0.056885075398467426, -0.15621320854680723, -0.14037513549213626, 0.06158151537837351, 0.4078117211465724, -0.2651596782157225, -0.37137019045664654, 0.17050015224145576, -0.3061696197683512, -0.08486874191037393, 0.2308118966183803, -0.08464618236073018, 0.048401757977712005, 0.1309839462114991, -0.049089577583157844, 0.028424074659329456, -0.26521850401545904, 0.2527357787544401, 0.12497597363065271, 0.34914138751457147, 0.0929752673349439, 0.007628445569186143, -0.037382945879311166, -0.11140464574076331, -0.0804325230389676, -0.0574136585361938, 0.2061355200723269, 0.41742975099751833, 0.2621372396901921, 0.33786813845033653, -0.4554372262209654, -0.1889703690649185, 0.05275125524830775, 0.13714985660215676, 0.05877043739789823, -0.08187449579145323, -0.3297015614259769, 0.013120647352051866, -0.2288803621672474, -0.15894421941073447, -0.06816275554079124, 0.04154359603725264, 0.006149026068348629, -0.16554497573045357, -0.09278844669215151, -0.05779676656825091, 0.10907938007029075, -0.04115320692097371, -0.11641372650089632, -0.030545723867630038, 0.24604174769688947, 0.04139786901064594, 0.06071939175393816, 0.09241954592717401, -0.13731917504928254, -0.11753611982909634, 0.44581559104228613, -0.02959514202837668, -0.058280727243982255, 0.23918243981611073, -0.10028895173865535, -0.21235973009606823, 0.07513023281952723, 0.17314525662796393, 0.0021655282272310134, -0.2406798245621544, 0.11066373577962034, 0.07329683641214882, 0.16106198538909666, 0.054409297512714096, 0.03642689774877748, 0.24499537522206083, 0.18161476242633345, 0.07994909994372659, 0.027238880884611075, -0.05767352169941125, -0.11694413677083931, -0.1728460266457499, -0.16145009836370317, -0.13704909886634115, -0.012067902226643876, -0.01597269938199187, -0.15697462934921907, 0.3494408621105215, 0.19064469300621353, 0.08539041216906351, -0.04789410985711798, 0.34005672860846115, 0.0007959915053695167, 0.18457110787344658, 0.09776475021071211, 0.2197579514969916, 0.007693267591735896, 0.2575341237915221, -0.0743193489691775, 0.09344271740059519, -0.05052091560312821]
1,803.07491
BOPfox program for tight-binding and analytic bond-order potential calculations
Bond-order potentials (BOPs) provide a local and physically transparent description of the interatomic interaction. Here we describe the efficient implementation of analytic BOPs in the BOPfox program and library. We discuss the integration of the underlying non-magnetic, collinear-magnetic and noncollinear-magnetic tight-binding models that are evaluated by the analytic BOPs. We summarize the flow of an analytic BOP calculation including the determination of self-returning paths for computing the moments, the self-consistency cycle, the estimation of the band-width from the recursion coefficients, and the termination of the BOP expansion. We discuss the implementation of the calculations of forces, stresses and magnetic torques with analytic BOPs. We show the scaling of analytic BOP calculations with the number of atoms and moments, present options for speeding up the calculations and outline different concepts of parallelisation. In the appendix we compile the implemented equations of the analytic BOP methodology and comments on the implementation. This description should be relevant for other implementations and further developments of analytic bond-order potentials.
physics.comp-ph cond-mat.mtrl-sci
bondorder potentials bops provide a local and physically transparent description of the interatomic interaction here we describe the efficient implementation of analytic bops in the bopfox program and library we discuss the integration of the underlying nonmagnetic collinearmagnetic and noncollinearmagnetic tightbinding models that are evaluated by the analytic bops we summarize the flow of an analytic bop calculation including the determination of selfreturning paths for computing the moments the selfconsistency cycle the estimation of the bandwidth from the recursion coefficients and the termination of the bop expansion we discuss the implementation of the calculations of forces stresses and magnetic torques with analytic bops we show the scaling of analytic bop calculations with the number of atoms and moments present options for speeding up the calculations and outline different concepts of parallelisation in the appendix we compile the implemented equations of the analytic bop methodology and comments on the implementation this description should be relevant for other implementations and further developments of analytic bondorder potentials
[['bondorder', 'potentials', 'bops', 'provide', 'a', 'local', 'and', 'physically', 'transparent', 'description', 'of', 'the', 'interatomic', 'interaction', 'here', 'we', 'describe', 'the', 'efficient', 'implementation', 'of', 'analytic', 'bops', 'in', 'the', 'bopfox', 'program', 'and', 'library', 'we', 'discuss', 'the', 'integration', 'of', 'the', 'underlying', 'nonmagnetic', 'collinearmagnetic', 'and', 'noncollinearmagnetic', 'tightbinding', 'models', 'that', 'are', 'evaluated', 'by', 'the', 'analytic', 'bops', 'we', 'summarize', 'the', 'flow', 'of', 'an', 'analytic', 'bop', 'calculation', 'including', 'the', 'determination', 'of', 'selfreturning', 'paths', 'for', 'computing', 'the', 'moments', 'the', 'selfconsistency', 'cycle', 'the', 'estimation', 'of', 'the', 'bandwidth', 'from', 'the', 'recursion', 'coefficients', 'and', 'the', 'termination', 'of', 'the', 'bop', 'expansion', 'we', 'discuss', 'the', 'implementation', 'of', 'the', 'calculations', 'of', 'forces', 'stresses', 'and', 'magnetic', 'torques', 'with', 'analytic', 'bops', 'we', 'show', 'the', 'scaling', 'of', 'analytic', 'bop', 'calculations', 'with', 'the', 'number', 'of', 'atoms', 'and', 'moments', 'present', 'options', 'for', 'speeding', 'up', 'the', 'calculations', 'and', 'outline', 'different', 'concepts', 'of', 'parallelisation', 'in', 'the', 'appendix', 'we', 'compile', 'the', 'implemented', 'equations', 'of', 'the', 'analytic', 'bop', 'methodology', 'and', 'comments', 'on', 'the', 'implementation', 'this', 'description', 'should', 'be', 'relevant', 'for', 'other', 'implementations', 'and', 'further', 'developments', 'of', 'analytic', 'bondorder', 'potentials']]
[-0.13983077428420074, 0.04083460040646969, -0.07904868016485125, 0.06920293123839656, -0.06069139894098043, -0.06414273880363908, 0.06672704449592856, 0.37677082925802097, -0.22086960885790177, -0.2817633901373483, 0.06836911429854808, -0.25982000956428236, -0.1447589601855725, 0.21619314683048288, 0.05446982549910899, 0.04620699040242471, 0.052993216275353916, -0.023830724101389932, -0.12679623047097266, -0.21588765785927536, 0.26954336597341355, 0.057193361810641365, 0.21996110605832656, 0.11997094526304863, 0.052440453896997495, 0.024882476194761693, -0.05580808567174245, -0.028068595664808526, -0.20638789081153847, 0.19124219899240416, 0.21557438915835975, 0.10145766529076354, 0.20327827192668338, -0.5018411193508655, -0.16643811553076376, -0.02522222992129173, 0.09747279380389955, 0.1632712463216194, -0.05952916815131175, -0.2610769691236783, 0.03792352792224847, -0.20092581760254688, -0.16426359077449887, -0.1774132809834555, 0.029873077574302444, 0.09117321189551149, -0.25850570083130153, 0.020954316639108583, 0.03320887890658923, 0.07190831586945023, -0.091981017535727, -0.14180803695344366, 0.010319839976727963, 0.10158915505016922, 0.029847202602832114, -0.0017086092761019246, 0.14108437225804665, -0.1174077497991675, -0.12356050286325626, 0.3782401318661869, -0.03811982452753, -0.17559872868150705, 0.16566307165485342, -0.08385969349183142, -0.11521003390080295, 0.05711971744021867, 0.1444469095687964, 0.10178244597045705, -0.1601599068089854, 0.12520246742315067, 0.02811990828777198, 0.10441539887397085, 0.022608535971085076, -0.0026384864089777694, 0.1506965841166675, 0.14617266082204877, -0.018412889051978708, 0.13593300225875282, -0.05392350993206492, -0.12495299633592367, -0.3661187931662425, -0.16865412084735, -0.17505812078015878, 0.0034452316613169387, -0.1285113594777613, -0.20492554686497896, 0.44218512340448796, 0.2057269151438959, 0.14383079687249847, 0.08069012198830024, 0.3385608916694764, 0.13705939177016263, 0.0519717245719221, 0.08625376136333215, 0.20747137509169988, 0.12901056266127853, 0.05042139923752984, -0.25373772795283, 0.04182284211856313, 0.0920014875693596]
1,803.07492
Identifying a $Z'$ behind $b \to s \ell \ell$ anomalies at the LHC
Recent $b\to s\ell\ell$ anomalies may imply the existence of a new $Z'$ boson with left-handed $Z'bs$ and $Z'\mu\mu$ couplings. Such a $Z'$ may be directly observed at LHC via $b \bar s \to Z' \to \mu^+\mu^-$, and its relevance to $b\to s\ell\ell$ may be studied by searching for the process $gs \to Z'b \to \mu^+\mu^- b$. In this paper, we analyze the capability of the 14 TeV LHC to observe the $Z'$ in the $\mu^+ \mu^-$ and $\mu^+\mu^- b$ modes based on an effective model with major phenomenological constraints imposed. We find that both modes can be discovered with 3000 fb$^{-1}$ data if the $Z'bs$ coupling saturates the latest $B_s-\bar B_s$ mixing limit from UTfit at around $2\sigma$. Besides, a tiny right-handed $Z'bs$ coupling, if it exists, opens up the possibility of a relatively large left-handed counterpart, due to cancellation in the $B_s-\bar B_s$ mixing amplitude. In this case, we show that even a data sample of $\mathcal{O}(100)$ fb$^{-1}$ would enable discovery of both modes. We further study the impact of a $Z'bb$ coupling as large as the $Z'bs$ coupling. This scenario enables discovery of the $Z'$ in both modes with milder effects on the $B_s-\bar B_s$ mixing, but obscures the relevance of the $Z'$ to $b \to s\ell\ell$. Discrimination between the $Z'bs$ and $Z'bb$ couplings may come from the production cross section for the $Z'b\bar{b}$ final state. However, we do not find the prospect for this to be promising.
hep-ph hep-ex
recent bto sellell anomalies may imply the existence of a new z boson with lefthanded zbs and zmumu couplings such a z may be directly observed at lhc via b bar s to z to mumu and its relevance to bto sellell may be studied by searching for the process gs to zb to mumu b in this paper we analyze the capability of the 14 tev lhc to observe the z in the mu mu and mumu b modes based on an effective model with major phenomenological constraints imposed we find that both modes can be discovered with 3000 fb1 data if the zbs coupling saturates the latest b_sbar b_s mixing limit from utfit at around 2sigma besides a tiny righthanded zbs coupling if it exists opens up the possibility of a relatively large lefthanded counterpart due to cancellation in the b_sbar b_s mixing amplitude in this case we show that even a data sample of mathcalo100 fb1 would enable discovery of both modes we further study the impact of a zbb coupling as large as the zbs coupling this scenario enables discovery of the z in both modes with milder effects on the b_sbar b_s mixing but obscures the relevance of the z to b to sellell discrimination between the zbs and zbb couplings may come from the production cross section for the zbbarb final state however we do not find the prospect for this to be promising
[['recent', 'bto', 'sellell', 'anomalies', 'may', 'imply', 'the', 'existence', 'of', 'a', 'new', 'z', 'boson', 'with', 'lefthanded', 'zbs', 'and', 'zmumu', 'couplings', 'such', 'a', 'z', 'may', 'be', 'directly', 'observed', 'at', 'lhc', 'via', 'b', 'bar', 's', 'to', 'z', 'to', 'mumu', 'and', 'its', 'relevance', 'to', 'bto', 'sellell', 'may', 'be', 'studied', 'by', 'searching', 'for', 'the', 'process', 'gs', 'to', 'zb', 'to', 'mumu', 'b', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'capability', 'of', 'the', '14', 'tev', 'lhc', 'to', 'observe', 'the', 'z', 'in', 'the', 'mu', 'mu', 'and', 'mumu', 'b', 'modes', 'based', 'on', 'an', 'effective', 'model', 'with', 'major', 'phenomenological', 'constraints', 'imposed', 'we', 'find', 'that', 'both', 'modes', 'can', 'be', 'discovered', 'with', '3000', 'fb1', 'data', 'if', 'the', 'zbs', 'coupling', 'saturates', 'the', 'latest', 'b_sbar', 'b_s', 'mixing', 'limit', 'from', 'utfit', 'at', 'around', '2sigma', 'besides', 'a', 'tiny', 'righthanded', 'zbs', 'coupling', 'if', 'it', 'exists', 'opens', 'up', 'the', 'possibility', 'of', 'a', 'relatively', 'large', 'lefthanded', 'counterpart', 'due', 'to', 'cancellation', 'in', 'the', 'b_sbar', 'b_s', 'mixing', 'amplitude', 'in', 'this', 'case', 'we', 'show', 'that', 'even', 'a', 'data', 'sample', 'of', 'mathcalo100', 'fb1', 'would', 'enable', 'discovery', 'of', 'both', 'modes', 'we', 'further', 'study', 'the', 'impact', 'of', 'a', 'zbb', 'coupling', 'as', 'large', 'as', 'the', 'zbs', 'coupling', 'this', 'scenario', 'enables', 'discovery', 'of', 'the', 'z', 'in', 'both', 'modes', 'with', 'milder', 'effects', 'on', 'the', 'b_sbar', 'b_s', 'mixing', 'but', 'obscures', 'the', 'relevance', 'of', 'the', 'z', 'to', 'b', 'to', 'sellell', 'discrimination', 'between', 'the', 'zbs', 'and', 'zbb', 'couplings', 'may', 'come', 'from', 'the', 'production', 'cross', 'section', 'for', 'the', 'zbbarb', 'final', 'state', 'however', 'we', 'do', 'not', 'find', 'the', 'prospect', 'for', 'this', 'to', 'be', 'promising']]
[-0.11760444225898634, 0.23203324874296716, -0.013314418378286064, 0.080391968115426, -0.09569065719648885, -0.16781653117892953, 0.13324999681159777, 0.30209356694637485, -0.25404045065127623, -0.2802099549366782, 0.03834093762707198, -0.31666599463981887, -0.03999497427770014, 0.14972170825106634, 0.0622873940235877, 0.03364224082227641, 0.07925675186367395, -0.020743603373800094, -0.052859448399976826, -0.20653655057346137, 0.23584849295439198, 0.028775091506152723, 0.21431188735781082, 0.11571355818596203, -0.004928762550116516, -0.02688088744956379, -0.02192619754083959, -0.07754727083180721, -0.1428731829377284, 0.03465801332446669, 0.1964368033882541, 0.09868108786613447, 0.1577558569687729, -0.3228001701682842, -0.08608886091921401, 0.1829325696725088, 0.16771345144952648, 0.09229944628896192, -0.06423677482428805, -0.3414129096772134, 0.1326848103024531, -0.18312264783501936, -0.07307702631806023, -0.07460404695981802, 0.02087119535426609, -0.12271117509226315, -0.36585101186453056, 0.09503460226636283, -0.022150782915802362, 0.0009083802743892496, 0.03456804722821592, -0.17516865370950352, -0.06705955799746638, 0.016573392832651735, 0.14293305316956928, 0.06586137137395175, 0.10500980202244439, -0.15119650240182334, -0.1548413204436656, 0.39413526027152934, -0.11941968084235365, -0.14683052672189661, 0.21323820612354513, -0.22081659259856679, -0.16092571277501216, 0.12040762557492903, 0.22850016287411562, 0.024762500839036267, -0.1685838171571959, 0.16464698143051162, 0.003227700090307432, 0.16211413343650444, 0.0419148057155932, 0.0952836757399685, 0.24243748404126866, 0.17266320968046783, 0.02194487706049889, 0.052400086626100045, -0.13016077274417814, -0.007120322453556582, -0.36915981930214914, -0.12072040582230935, -0.05978819768448981, 0.10085412680255104, -0.05081671328637943, -0.06908857878200554, 0.3532552463390554, 0.1507232814299641, 0.30030575341079385, 0.012610960178426467, 0.26300541875874234, 0.08088395234954078, 0.10224563087394926, 0.050231358191619314, 0.3666361466709835, 0.14104429284070646, 0.11417578317708224, -0.2498064285503157, 0.050938532171130646, -0.017904799305445824]
1,803.07493
Entropic Dynamics: Reconstructing Quantum Field Theory in Curved Space-time
The Entropic Dynamics reconstruction of quantum mechanics is extended to quantum field theory in curved space-time. The Entropic Dynamics framework, which derives quantum theory as an application of the method of maximum entropy, is combined with the covariant methods of Dirac, Hojman, Kucha\v{r}, and Teitelboim, which they used to develop a framework for classical covariant Hamiltonian theories. The goal is to formulate an information-based alternative to current approaches based on algebraic quantum field theory. One key ingredient is the adoption of a local notion of entropic time in which instants are defined on curved three-dimensional surfaces and time evolution consists of the accumulation of changes induced by local deformations of these surfaces. The resulting dynamics is a non-dissipative diffusion that is constrained by the requirements of foliation invariance and incorporates the necessary local quantum potentials. As applications of the formalism we derive the Ehrenfest relations for fields in curved-spacetime and briefly discuss the nature of divergences in quantum field theory.
gr-qc hep-th quant-ph
the entropic dynamics reconstruction of quantum mechanics is extended to quantum field theory in curved spacetime the entropic dynamics framework which derives quantum theory as an application of the method of maximum entropy is combined with the covariant methods of dirac hojman kuchavr and teitelboim which they used to develop a framework for classical covariant hamiltonian theories the goal is to formulate an informationbased alternative to current approaches based on algebraic quantum field theory one key ingredient is the adoption of a local notion of entropic time in which instants are defined on curved threedimensional surfaces and time evolution consists of the accumulation of changes induced by local deformations of these surfaces the resulting dynamics is a nondissipative diffusion that is constrained by the requirements of foliation invariance and incorporates the necessary local quantum potentials as applications of the formalism we derive the ehrenfest relations for fields in curvedspacetime and briefly discuss the nature of divergences in quantum field theory
[['the', 'entropic', 'dynamics', 'reconstruction', 'of', 'quantum', 'mechanics', 'is', 'extended', 'to', 'quantum', 'field', 'theory', 'in', 'curved', 'spacetime', 'the', 'entropic', 'dynamics', 'framework', 'which', 'derives', 'quantum', 'theory', 'as', 'an', 'application', 'of', 'the', 'method', 'of', 'maximum', 'entropy', 'is', 'combined', 'with', 'the', 'covariant', 'methods', 'of', 'dirac', 'hojman', 'kuchavr', 'and', 'teitelboim', 'which', 'they', 'used', 'to', 'develop', 'a', 'framework', 'for', 'classical', 'covariant', 'hamiltonian', 'theories', 'the', 'goal', 'is', 'to', 'formulate', 'an', 'informationbased', 'alternative', 'to', 'current', 'approaches', 'based', 'on', 'algebraic', 'quantum', 'field', 'theory', 'one', 'key', 'ingredient', 'is', 'the', 'adoption', 'of', 'a', 'local', 'notion', 'of', 'entropic', 'time', 'in', 'which', 'instants', 'are', 'defined', 'on', 'curved', 'threedimensional', 'surfaces', 'and', 'time', 'evolution', 'consists', 'of', 'the', 'accumulation', 'of', 'changes', 'induced', 'by', 'local', 'deformations', 'of', 'these', 'surfaces', 'the', 'resulting', 'dynamics', 'is', 'a', 'nondissipative', 'diffusion', 'that', 'is', 'constrained', 'by', 'the', 'requirements', 'of', 'foliation', 'invariance', 'and', 'incorporates', 'the', 'necessary', 'local', 'quantum', 'potentials', 'as', 'applications', 'of', 'the', 'formalism', 'we', 'derive', 'the', 'ehrenfest', 'relations', 'for', 'fields', 'in', 'curvedspacetime', 'and', 'briefly', 'discuss', 'the', 'nature', 'of', 'divergences', 'in', 'quantum', 'field', 'theory']]
[-0.1386815327918157, 0.14962385193812225, -0.14553298231912776, 0.09219150658464059, -0.05474544500466436, -0.1251479516417021, -0.03479262323817238, 0.2915182002703659, -0.27500965457729765, -0.2703536815708503, 0.04136947601873544, -0.21916241098078898, -0.20182114832568915, 0.16312594837290817, -0.09393804922001436, 0.07594665990036446, -0.027264429512433706, 0.050718018115730956, -0.0916094263222476, -0.22639046298063475, 0.33447149560233813, 0.061166147632320644, 0.29115428202785554, 0.05358416194358142, 0.13707023515598848, 0.048862355569872305, -0.007767184393014759, 0.05683157202438451, -0.15442974050843078, 0.16895177248629806, 0.23042644939851015, 0.11303853077988606, 0.24545610458881129, -0.46560285312589256, -0.2627486427023541, 0.026707959332270548, 0.08005614901412628, 0.14927152004165692, -0.029156496704672463, -0.29136704391858076, 0.0334446111577563, -0.13969713623810093, -0.16715233754948713, -0.10250630080117844, 0.012155425437231315, -0.03644023189553991, -0.2099747968284646, 0.11522305164398858, 0.07611475751218677, 0.05146428516600281, -0.05189184378104983, -0.015728643279726385, 0.01168385833298089, 0.09062577114091255, 0.029134166762014503, 0.030450728865980638, 0.15978005224387742, -0.12427862046752125, -0.17648231861603564, 0.40160318501293657, -0.05824059573933482, -0.23401464774942723, 0.15162198329198873, -0.06978503153950441, -0.1236431934259599, 0.06710659398813731, 0.13486932637169957, 0.15368051539408042, -0.17132730510202238, 0.18090195674449205, 0.032188264554133636, 0.08757603539852425, 0.01865145658084657, 0.05611567643645685, 0.2071271623382927, 0.10166458259191131, 0.08030682732642162, 0.11293446132549434, -0.05248592957505025, -0.22934247674857033, -0.37790083398576824, -0.2014318140534897, -0.1785370903497096, 0.08921601303300122, -0.08286293692035543, -0.18640601860824974, 0.37725617352407426, 0.15104868567395896, 0.1330911982106045, 0.02615155788589618, 0.26354877711855806, 0.14951271296886262, 0.04409781729336828, 0.052631174336420374, 0.22458600039826707, 0.21470422103302553, 0.0649240195969469, -0.23399680240545423, -0.0003931211555027403, 0.14347409398542368]
1,803.07494
Elliptic problems on complete non-compact Riemannian manifolds with asymptotically non-negative Ricci curvature
In this paper we discuss the existence and non--existence of weak solutions to parametric equations involving the Laplace-Beltrami operator $\Delta_g$ in a complete non-compact $d$--dimensional ($d\geq 3$) Riemannian manifold $(\mathcal{M},g)$ with asymptotically non--negative Ricci curvature and intrinsic metric $d_g$. Namely, our simple model is the following problem $$ \left\{ \begin{array}{ll} -\Delta_gw+V(\sigma)w=\lambda \alpha(\sigma)f(w) & \mbox{ in } \mathcal{M}\\ w\geq 0 & \mbox{ in } \mathcal{M} \end{array}\right. $$ where $V$ is a positive coercive potential, $\alpha$ is a positive bounded function, $\lambda$ is a real parameter and $f$ is a suitable continuous nonlinear term. The existence of at least two non--trivial bounded weak solutions is established for large value of the parameter $\lambda$ requiring that the nonlinear term $f$ is non--trivial, continuous, superlinear at zero and sublinear at infinity. Our approach is based on variational methods. No assumptions on the sectional curvature, as well as symmetry theoretical arguments, are requested in our approach.
math.AP
in this paper we discuss the existence and nonexistence of weak solutions to parametric equations involving the laplacebeltrami operator delta_g in a complete noncompact ddimensional dgeq 3 riemannian manifold mathcalmg with asymptotically nonnegative ricci curvature and intrinsic metric d_g namely our simple model is the following problem left beginarrayll delta_gwvsigmawlambda alphasigmafw mbox in mathcalm wgeq 0 mbox in mathcalm endarrayright where v is a positive coercive potential alpha is a positive bounded function lambda is a real parameter and f is a suitable continuous nonlinear term the existence of at least two nontrivial bounded weak solutions is established for large value of the parameter lambda requiring that the nonlinear term f is nontrivial continuous superlinear at zero and sublinear at infinity our approach is based on variational methods no assumptions on the sectional curvature as well as symmetry theoretical arguments are requested in our approach
[['in', 'this', 'paper', 'we', 'discuss', 'the', 'existence', 'and', 'nonexistence', 'of', 'weak', 'solutions', 'to', 'parametric', 'equations', 'involving', 'the', 'laplacebeltrami', 'operator', 'delta_g', 'in', 'a', 'complete', 'noncompact', 'ddimensional', 'dgeq', '3', 'riemannian', 'manifold', 'mathcalmg', 'with', 'asymptotically', 'nonnegative', 'ricci', 'curvature', 'and', 'intrinsic', 'metric', 'd_g', 'namely', 'our', 'simple', 'model', 'is', 'the', 'following', 'problem', 'left', 'beginarrayll', 'delta_gwvsigmawlambda', 'alphasigmafw', 'mbox', 'in', 'mathcalm', 'wgeq', '0', 'mbox', 'in', 'mathcalm', 'endarrayright', 'where', 'v', 'is', 'a', 'positive', 'coercive', 'potential', 'alpha', 'is', 'a', 'positive', 'bounded', 'function', 'lambda', 'is', 'a', 'real', 'parameter', 'and', 'f', 'is', 'a', 'suitable', 'continuous', 'nonlinear', 'term', 'the', 'existence', 'of', 'at', 'least', 'two', 'nontrivial', 'bounded', 'weak', 'solutions', 'is', 'established', 'for', 'large', 'value', 'of', 'the', 'parameter', 'lambda', 'requiring', 'that', 'the', 'nonlinear', 'term', 'f', 'is', 'nontrivial', 'continuous', 'superlinear', 'at', 'zero', 'and', 'sublinear', 'at', 'infinity', 'our', 'approach', 'is', 'based', 'on', 'variational', 'methods', 'no', 'assumptions', 'on', 'the', 'sectional', 'curvature', 'as', 'well', 'as', 'symmetry', 'theoretical', 'arguments', 'are', 'requested', 'in', 'our', 'approach']]
[-0.19641549250280316, 0.08094635906538086, -0.02422053399788854, 0.047399033504942026, -0.14536935531605893, -0.20823679440752504, -0.05211676140983387, 0.3392200840317963, -0.2702662192543128, -0.17998393798585643, 0.13306574731449747, -0.34527051868894093, -0.11826063487418256, 0.14789315451985108, -0.05499398234866924, 0.0791894113710085, 0.01545697606943704, 0.10029905747583175, -0.07688951704136611, -0.20449331556153777, 0.4079454372168056, -0.1000588398713332, 0.19007932379112377, 0.1061700617314896, 0.14823223191510457, -0.06835810354279055, 0.058360202589651924, 0.031218339389489664, -0.21901034089677415, 0.05307005726328524, 0.2200160320633306, 0.0769623636326694, 0.33909871820132476, -0.3488126936648692, -0.19790062319891938, 0.1943686054172841, 0.10471124597011017, -0.015510267258940877, -0.02925317185618296, -0.29921201703796435, 0.149074792298586, -0.06603956332925212, -0.18744862063297793, -0.05063690855395752, 0.06690138463464963, -0.010505379931073167, -0.35302009706717585, 0.13817317787088923, 0.1262922705048565, 0.04025857033813698, -0.09975096347788186, -0.1441482388303726, -0.05156461001696208, 0.03150556749058562, 0.037927469568346604, 0.11231382773746248, 0.023468421528708528, -0.07449927209824375, -0.05166739527578954, 0.31638324825977254, -0.14645238258465604, -0.3052639021225586, 0.10652888694393833, -0.14680543447799094, -0.12541568493861313, 0.08011624149870701, 0.13456621107163388, 0.22406571338252795, -0.07209517349736518, 0.26580774036913435, -0.05682813265145971, 0.15940171237253434, 0.07331256831221127, -0.016410571116778246, 0.07790930427194058, 0.11941604495009446, 0.18391493115561097, 0.08564060934252672, 0.024904393574704864, -0.06612281708398482, -0.41719844009909596, -0.11467052141035144, -0.19911585059839176, 0.17874021761093314, -0.16479237477247882, -0.1874649591281541, 0.3344535710732941, 0.02148155086524003, 0.19575445478378267, 0.12744898678591618, 0.23906298890755467, 0.15265518034909284, -0.023982231550804384, 0.1006420348295486, 0.17318750218442686, 0.14496562011349437, 0.09313474336990735, -0.19896336645702017, -0.005131848980314457, 0.10815463393622964]
1,803.07495
Generic Library Interception for Improved Performance Measurement and Insight
As applications grow in capability, they also grow in complexity. This complexity in turn gets pushed into modules and libraries. In addition, hardware configurations become increasingly elaborate, too. These two trends make understanding, debugging and analyzing the performance of applications more and more difficult. To enable detailed insight into library usage of applications, we present an approach and implementation in Score-P that supports intuitive and robust creation of wrappers for arbitrary C/C++ libraries. Runtime analysis then uses these wrappers to keep track of how applications interact with libraries, how they interact with each other, and record the exact timing of their functions.
cs.SE
as applications grow in capability they also grow in complexity this complexity in turn gets pushed into modules and libraries in addition hardware configurations become increasingly elaborate too these two trends make understanding debugging and analyzing the performance of applications more and more difficult to enable detailed insight into library usage of applications we present an approach and implementation in scorep that supports intuitive and robust creation of wrappers for arbitrary cc libraries runtime analysis then uses these wrappers to keep track of how applications interact with libraries how they interact with each other and record the exact timing of their functions
[['as', 'applications', 'grow', 'in', 'capability', 'they', 'also', 'grow', 'in', 'complexity', 'this', 'complexity', 'in', 'turn', 'gets', 'pushed', 'into', 'modules', 'and', 'libraries', 'in', 'addition', 'hardware', 'configurations', 'become', 'increasingly', 'elaborate', 'too', 'these', 'two', 'trends', 'make', 'understanding', 'debugging', 'and', 'analyzing', 'the', 'performance', 'of', 'applications', 'more', 'and', 'more', 'difficult', 'to', 'enable', 'detailed', 'insight', 'into', 'library', 'usage', 'of', 'applications', 'we', 'present', 'an', 'approach', 'and', 'implementation', 'in', 'scorep', 'that', 'supports', 'intuitive', 'and', 'robust', 'creation', 'of', 'wrappers', 'for', 'arbitrary', 'cc', 'libraries', 'runtime', 'analysis', 'then', 'uses', 'these', 'wrappers', 'to', 'keep', 'track', 'of', 'how', 'applications', 'interact', 'with', 'libraries', 'how', 'they', 'interact', 'with', 'each', 'other', 'and', 'record', 'the', 'exact', 'timing', 'of', 'their', 'functions']]
[-0.0636543236951362, 0.06507520599181732, -0.1047539630877402, 0.1049448955043986, -0.12567640376259007, -0.20369696108551294, 0.030809281670942667, 0.4339798630087399, -0.263090560669262, -0.3588930930800773, 0.11839302289002922, -0.26553342198980423, -0.13899043972567454, 0.2660266086208068, -0.05312164312265083, 0.027951285083248626, 0.10405892466067099, -0.015581536355574488, -0.050103951199893276, -0.27787931694411766, 0.2255149351127044, 0.08454796524864494, 0.2765895183855558, 0.046760484220131356, -0.002575159218965792, 0.01900789982356204, -0.08020067036918857, -0.004243437155131616, -0.0671850870545028, 0.19407491959339263, 0.3202316666686195, 0.23234896721574022, 0.2895721000089657, -0.5225974889289514, -0.11952302466128387, 0.05016848588289291, 0.20768954990176008, 0.0982199051946986, -0.07853794956777253, -0.23028536053264842, 0.08851744422249527, -0.21342005402616718, -0.12016245168542453, -0.16772365710679807, 0.022682866355513826, 0.04310631050326515, -0.1951892178610661, -0.05543392405682015, 0.043246411421683194, 0.04328611116929382, -0.024144018534570932, -0.09786129801753252, -0.014916883735899247, 0.2010536612394978, 0.01956000699497321, -0.018313267624334377, 0.16965692143832498, -0.1401202370773307, -0.1077290117813676, 0.3569684683655699, 0.01176041651371063, -0.20035125295102013, 0.2832024684678033, -0.04584799424286329, -0.17319791095859746, 0.09902713753114108, 0.24760269928839418, 0.06808743848666257, -0.13320483216175846, 0.06916773668147952, 0.11121392620079146, 0.2114311509637856, 0.07053514186444255, 0.10984040662536726, 0.21221511019622066, 0.18397511865067132, 0.044065326851719586, 0.151359804911087, 0.0326795163906782, -0.09586125137467011, -0.21846686527543865, -0.1829145282413354, -0.0739840584734053, -0.0204613032812417, -0.059386807479313575, -0.201682148382579, 0.3776292347225963, 0.24673624176020717, 0.1814467725286936, 0.06736979361477435, 0.3538390191673648, 0.01358882528695497, 0.11988602033314094, 0.10458835408858516, 0.13556120610412428, 0.0625793534586681, 0.1585929857420863, -0.14944043086942138, 0.08280544005809169, -0.0248341901483489]
1,803.07496
Mobile Social Services with Network Externality: From Separate Pricing to Bundled Pricing
Today, many wireless device providers choose to sell devices bundled with complementary mobile social services, which exhibit strong positive network externality. This paper aims to quantify the benefits of selling devices and complementary services under the following three strategies: separate pricing, bundled pricing, and hybrid pricing (both the separate and bundled options are offered). A comprehensive comparison of the above three strategies is carried out for two popular service models, namely physical connectivity sharing and virtual content sharing, respectively. We first study the physical service model where the provider (e.g., FON) offers users customized WiFi devices for indoor Internet access, and allows service subscribers to physically access all device owners' WiFi when traveling. Observing that all device-owners contribute to the connectivity sharing, we show, via a Stackelberg game theoretic approach, that bundled pricing outperforms separate pricing as long as the total cost of device and service is reasonably low to stimulate network externality. Further, hybrid pricing strictly dominates bundled pricing thanks to the pricing flexibility to keep high marginal profit of device-selling. Next, we investigate the virtual sharing service model where the provider (e.g., Apple) sells devices and device-supported applications. Different from the connectivity service model, in this model service subscribers directly contribute to the virtual content sharing, and the network externality can be fairly strong. We prove that hybrid pricing degenerates to bundled pricing if the network externality degree is larger than the average device valuation, which is in stark contrast with the connectivity service model in which hybrid pricing always outperforms bundled pricing.
cs.GT
today many wireless device providers choose to sell devices bundled with complementary mobile social services which exhibit strong positive network externality this paper aims to quantify the benefits of selling devices and complementary services under the following three strategies separate pricing bundled pricing and hybrid pricing both the separate and bundled options are offered a comprehensive comparison of the above three strategies is carried out for two popular service models namely physical connectivity sharing and virtual content sharing respectively we first study the physical service model where the provider eg fon offers users customized wifi devices for indoor internet access and allows service subscribers to physically access all device owners wifi when traveling observing that all deviceowners contribute to the connectivity sharing we show via a stackelberg game theoretic approach that bundled pricing outperforms separate pricing as long as the total cost of device and service is reasonably low to stimulate network externality further hybrid pricing strictly dominates bundled pricing thanks to the pricing flexibility to keep high marginal profit of deviceselling next we investigate the virtual sharing service model where the provider eg apple sells devices and devicesupported applications different from the connectivity service model in this model service subscribers directly contribute to the virtual content sharing and the network externality can be fairly strong we prove that hybrid pricing degenerates to bundled pricing if the network externality degree is larger than the average device valuation which is in stark contrast with the connectivity service model in which hybrid pricing always outperforms bundled pricing
[['today', 'many', 'wireless', 'device', 'providers', 'choose', 'to', 'sell', 'devices', 'bundled', 'with', 'complementary', 'mobile', 'social', 'services', 'which', 'exhibit', 'strong', 'positive', 'network', 'externality', 'this', 'paper', 'aims', 'to', 'quantify', 'the', 'benefits', 'of', 'selling', 'devices', 'and', 'complementary', 'services', 'under', 'the', 'following', 'three', 'strategies', 'separate', 'pricing', 'bundled', 'pricing', 'and', 'hybrid', 'pricing', 'both', 'the', 'separate', 'and', 'bundled', 'options', 'are', 'offered', 'a', 'comprehensive', 'comparison', 'of', 'the', 'above', 'three', 'strategies', 'is', 'carried', 'out', 'for', 'two', 'popular', 'service', 'models', 'namely', 'physical', 'connectivity', 'sharing', 'and', 'virtual', 'content', 'sharing', 'respectively', 'we', 'first', 'study', 'the', 'physical', 'service', 'model', 'where', 'the', 'provider', 'eg', 'fon', 'offers', 'users', 'customized', 'wifi', 'devices', 'for', 'indoor', 'internet', 'access', 'and', 'allows', 'service', 'subscribers', 'to', 'physically', 'access', 'all', 'device', 'owners', 'wifi', 'when', 'traveling', 'observing', 'that', 'all', 'deviceowners', 'contribute', 'to', 'the', 'connectivity', 'sharing', 'we', 'show', 'via', 'a', 'stackelberg', 'game', 'theoretic', 'approach', 'that', 'bundled', 'pricing', 'outperforms', 'separate', 'pricing', 'as', 'long', 'as', 'the', 'total', 'cost', 'of', 'device', 'and', 'service', 'is', 'reasonably', 'low', 'to', 'stimulate', 'network', 'externality', 'further', 'hybrid', 'pricing', 'strictly', 'dominates', 'bundled', 'pricing', 'thanks', 'to', 'the', 'pricing', 'flexibility', 'to', 'keep', 'high', 'marginal', 'profit', 'of', 'deviceselling', 'next', 'we', 'investigate', 'the', 'virtual', 'sharing', 'service', 'model', 'where', 'the', 'provider', 'eg', 'apple', 'sells', 'devices', 'and', 'devicesupported', 'applications', 'different', 'from', 'the', 'connectivity', 'service', 'model', 'in', 'this', 'model', 'service', 'subscribers', 'directly', 'contribute', 'to', 'the', 'virtual', 'content', 'sharing', 'and', 'the', 'network', 'externality', 'can', 'be', 'fairly', 'strong', 'we', 'prove', 'that', 'hybrid', 'pricing', 'degenerates', 'to', 'bundled', 'pricing', 'if', 'the', 'network', 'externality', 'degree', 'is', 'larger', 'than', 'the', 'average', 'device', 'valuation', 'which', 'is', 'in', 'stark', 'contrast', 'with', 'the', 'connectivity', 'service', 'model', 'in', 'which', 'hybrid', 'pricing', 'always', 'outperforms', 'bundled', 'pricing']]
[-0.184979634533178, -0.024306130079027738, -0.04148987817415406, 0.07608461318609659, -0.14178938535504074, -0.27749428394368836, 0.168980562485226, 0.4681582373921715, -0.29589035353135495, -0.2772061608672615, 0.062253479351980674, -0.3072644728541375, -0.1236030865517918, 0.12952658667627331, -0.1418255365967366, -0.01033833240009179, 0.004221700048046408, 0.006229178854338233, 0.08106832567483209, -0.2811856805457778, 0.27319702508698573, 0.031689931529514964, 0.3970833470017487, 0.1088677085675059, 0.03477460147982966, 0.0237293133328739, -0.014086561361586468, -0.03415460680936656, -0.0915908263226782, 0.16911681589766567, 0.3308610717711504, 0.15312709102519356, 0.36380493405851577, -0.4705117947407185, -0.1883319577073197, 0.10272903459432807, 0.10618281352926426, -0.02171499376501223, -0.02161885332362357, -0.259177652246777, 0.10365470835988942, -0.3246982560732928, -0.051010669352965325, -0.06907504362249119, -0.06261497535299332, 0.0739109751381283, -0.3234328983152019, -0.07444845852539099, -0.10038759165059125, 0.007672892683850867, -0.058976772527251066, -0.0961010084350756, -0.05877904930625052, 0.20814541348642837, 0.07070890063787663, -0.0741175547679184, 0.1696433984140481, -0.1472952324908138, -0.17767287050706468, 0.41518232061542454, -0.0166694917654298, -0.13773392259867656, 0.15008514086539868, -0.0348069358742722, -0.13672842989705267, 0.09139382626883508, 0.20568612777990186, 0.0401082651630517, -0.2478832580726746, 0.01768376993023262, -0.026650212573937127, 0.1398217972785619, 0.07370348758801508, 0.0902167215466588, 0.17251040654567382, 0.23895904281276412, 0.1924767580420603, 0.10138812052115562, -0.012587636494861236, -0.17163921064408016, -0.18831853856450864, -0.15376258679362576, -0.15256470617457543, 0.04336760463821332, -0.13095711354426817, -0.12819296228496121, 0.3967810414494976, 0.17911431458335192, 0.06828855394685109, 0.10122686262114994, 0.4032258597712609, 0.062266286444066773, 0.07993882945147417, 0.1556063971957118, 0.10283511021314928, -0.06612919360798385, 0.2200890439340756, -0.14683634337658683, 0.1680792418349209, -0.03327176733208554]
1,803.07497
Discrete Cubical and Path Homologies of Graphs
In this paper we study and compare two homology theories for (simple and undirected) graphs. The first, which was developed by Barcelo, Caprano, and White, is based on graph maps from hypercubes to the graph. The second theory was developed by Grigor'yan, Lin, Muranov, and Yau, and is based on paths in the graph. Results in both settings imply that the respective homology groups are isomorphic in homological dimension one. We show that, for several infinite classes of graphs, the two theories lead to isomorphic homology groups in all dimensions. However, we provide an example for which the homology groups of the two theories are not isomorphic at least in dimensions two and three. We establish a natural map from the cubical to the path homology groups which is an isomorphism in dimension one and surjective in dimension two. Again our example shows that in general the map is not surjective in dimension three and not injective in dimension two. In the process we develop tools to compute the homology groups for both theories in all dimensions.
math.CO math.AT
in this paper we study and compare two homology theories for simple and undirected graphs the first which was developed by barcelo caprano and white is based on graph maps from hypercubes to the graph the second theory was developed by grigoryan lin muranov and yau and is based on paths in the graph results in both settings imply that the respective homology groups are isomorphic in homological dimension one we show that for several infinite classes of graphs the two theories lead to isomorphic homology groups in all dimensions however we provide an example for which the homology groups of the two theories are not isomorphic at least in dimensions two and three we establish a natural map from the cubical to the path homology groups which is an isomorphism in dimension one and surjective in dimension two again our example shows that in general the map is not surjective in dimension three and not injective in dimension two in the process we develop tools to compute the homology groups for both theories in all dimensions
[['in', 'this', 'paper', 'we', 'study', 'and', 'compare', 'two', 'homology', 'theories', 'for', 'simple', 'and', 'undirected', 'graphs', 'the', 'first', 'which', 'was', 'developed', 'by', 'barcelo', 'caprano', 'and', 'white', 'is', 'based', 'on', 'graph', 'maps', 'from', 'hypercubes', 'to', 'the', 'graph', 'the', 'second', 'theory', 'was', 'developed', 'by', 'grigoryan', 'lin', 'muranov', 'and', 'yau', 'and', 'is', 'based', 'on', 'paths', 'in', 'the', 'graph', 'results', 'in', 'both', 'settings', 'imply', 'that', 'the', 'respective', 'homology', 'groups', 'are', 'isomorphic', 'in', 'homological', 'dimension', 'one', 'we', 'show', 'that', 'for', 'several', 'infinite', 'classes', 'of', 'graphs', 'the', 'two', 'theories', 'lead', 'to', 'isomorphic', 'homology', 'groups', 'in', 'all', 'dimensions', 'however', 'we', 'provide', 'an', 'example', 'for', 'which', 'the', 'homology', 'groups', 'of', 'the', 'two', 'theories', 'are', 'not', 'isomorphic', 'at', 'least', 'in', 'dimensions', 'two', 'and', 'three', 'we', 'establish', 'a', 'natural', 'map', 'from', 'the', 'cubical', 'to', 'the', 'path', 'homology', 'groups', 'which', 'is', 'an', 'isomorphism', 'in', 'dimension', 'one', 'and', 'surjective', 'in', 'dimension', 'two', 'again', 'our', 'example', 'shows', 'that', 'in', 'general', 'the', 'map', 'is', 'not', 'surjective', 'in', 'dimension', 'three', 'and', 'not', 'injective', 'in', 'dimension', 'two', 'in', 'the', 'process', 'we', 'develop', 'tools', 'to', 'compute', 'the', 'homology', 'groups', 'for', 'both', 'theories', 'in', 'all', 'dimensions']]
[-0.12016148017243143, 0.08323698485979879, -0.07788447570849465, 0.0808731968421212, -0.038693624704716385, -0.14425589359333654, -0.038549678545678034, 0.3900639752656306, -0.2808576906417412, -0.2526525914171626, 0.137620544385837, -0.2763086406336118, -0.20746238734467293, 0.18984996163370935, -0.14537502929504792, -0.027748118921987374, 0.033258804059269925, 0.09028388532417674, -0.027127169018389064, -0.30465681591406546, 0.40261330305198, -0.061605024561603466, 0.22070542777443983, 0.08859407230259174, 0.07869045244346622, -0.014185245281127705, -0.03575370218393139, 0.051953306633301756, -0.1623358428365381, 0.12167283319550651, 0.2994768406179818, 0.07818046244078274, 0.1809891203163054, -0.40466788837114687, -0.17072158528026193, 0.1647347713852386, 0.11817298671336506, 0.05914502255208473, -0.012127237602147612, -0.23225506670265036, 0.11217392537086694, -0.1561627887422219, -0.05775523730765351, -0.06727706690054963, 0.04324376935520294, -0.025757145591011398, -0.2173935475267089, -0.010769939610988578, 0.0951457594664217, 0.09619973922169513, -0.06461044696201994, -0.08290201847756345, -0.025592603351635098, 0.15784090496956857, -0.009476171462665661, 0.019615782127154736, 0.03652867104657079, -0.09757978574039457, -0.2159562924114818, 0.3769401702080689, -0.043465053091164337, -0.22824485382046655, 0.21383779211001555, -0.160729779089293, -0.25971463681939483, 0.10162535690787164, 0.07838886805323207, 0.14791637801946225, -0.08483555786502124, 0.14096306544326415, -0.06739109301733234, 0.11297466918106445, 0.07927276081913574, -0.04414378248772912, 0.11189985757718288, 0.0992862029816024, 0.12055669402153316, 0.16763761359272228, -0.00824914438999258, -0.0655594920813614, -0.2757486365947195, -0.1929578507207969, -0.15201398486335, 0.05323721084964332, -0.12419116283920383, -0.1408579960817323, 0.41008603369647806, 0.13777275750312998, 0.18243332369655202, 0.1356452885394736, 0.2532827076078816, 0.026403583615981253, 0.06380288042286834, 0.101560258211314, 0.17434907761741092, 0.1955975128618196, -0.015254975227766077, -0.09981825992624428, -0.034358649182567286, 0.22996093370867046]
1,803.07498
Yang-Baxter Deformations Beyond Coset Spaces (a slick way to do TsT)
Yang-Baxter string sigma-models provide a systematic way to deform coset geometries, such as $AdS_p \times S^p$, while retaining the $\sigma$-model integrability. It has been shown that the Yang-Baxter deformation in target space is simply an open-closed string map that can be defined for any geometry, not just coset spaces. Given a geometry with an isometry group and a bivector that is assumed to be a linear combination of antisymmetric products of Killing vectors, we show the equations of motion of (generalized) supergravity reduce to the Classical Yang-Baxter Equation associated with the isometry group, proving the statement made in [1]. These results bring us closer to the proof of the "YB solution generating technique" for (generalized) supergravity advertised in [1] and in particular provide an economical way to perform TsT transformations.
hep-th
yangbaxter string sigmamodels provide a systematic way to deform coset geometries such as ads_p times sp while retaining the sigmamodel integrability it has been shown that the yangbaxter deformation in target space is simply an openclosed string map that can be defined for any geometry not just coset spaces given a geometry with an isometry group and a bivector that is assumed to be a linear combination of antisymmetric products of killing vectors we show the equations of motion of generalized supergravity reduce to the classical yangbaxter equation associated with the isometry group proving the statement made in 1 these results bring us closer to the proof of the yb solution generating technique for generalized supergravity advertised in 1 and in particular provide an economical way to perform tst transformations
[['yangbaxter', 'string', 'sigmamodels', 'provide', 'a', 'systematic', 'way', 'to', 'deform', 'coset', 'geometries', 'such', 'as', 'ads_p', 'times', 'sp', 'while', 'retaining', 'the', 'sigmamodel', 'integrability', 'it', 'has', 'been', 'shown', 'that', 'the', 'yangbaxter', 'deformation', 'in', 'target', 'space', 'is', 'simply', 'an', 'openclosed', 'string', 'map', 'that', 'can', 'be', 'defined', 'for', 'any', 'geometry', 'not', 'just', 'coset', 'spaces', 'given', 'a', 'geometry', 'with', 'an', 'isometry', 'group', 'and', 'a', 'bivector', 'that', 'is', 'assumed', 'to', 'be', 'a', 'linear', 'combination', 'of', 'antisymmetric', 'products', 'of', 'killing', 'vectors', 'we', 'show', 'the', 'equations', 'of', 'motion', 'of', 'generalized', 'supergravity', 'reduce', 'to', 'the', 'classical', 'yangbaxter', 'equation', 'associated', 'with', 'the', 'isometry', 'group', 'proving', 'the', 'statement', 'made', 'in', '1', 'these', 'results', 'bring', 'us', 'closer', 'to', 'the', 'proof', 'of', 'the', 'yb', 'solution', 'generating', 'technique', 'for', 'generalized', 'supergravity', 'advertised', 'in', '1', 'and', 'in', 'particular', 'provide', 'an', 'economical', 'way', 'to', 'perform', 'tst', 'transformations']]
[-0.10387401371934595, 0.07749933482163425, -0.08591649246652826, 0.06303206528178774, -0.1541804357360189, -0.17018494885101412, -0.03205336770042777, 0.35074726352468133, -0.296176973117802, -0.23089831391206153, 0.10708541092709101, -0.25376466148031446, -0.1747244188060554, 0.1672631754969748, -0.11876416050542432, 0.02512697123635847, 0.019186757083606117, 0.09142769901843097, -0.1525452185440092, -0.27299261504354383, 0.31769556102987667, 0.027863879045113348, 0.2813228740858344, -0.04932946065584054, 0.15018855826033709, -0.022111113987809333, 0.02231388339916101, -0.02542031992320867, -0.11796020938776425, 0.13253564056582176, 0.2717450349282724, 0.10914325293762465, 0.13049121246888087, -0.4388113308411378, -0.2112993013122692, 0.11864096948948617, 0.16500303865267107, 0.1282166451162014, -0.017967430932017473, -0.32224020098980805, 0.06509340322361543, -0.16107224605690976, -0.18902172259269998, -0.13092860837395376, 0.04004483791068196, -0.0655951607976861, -0.23124900240128718, 0.013543589413166046, 0.08016948458523704, 0.017580426919560594, -0.07938400974559884, -0.05308869972135513, -0.06088959548908931, 0.08649984650636235, 0.050400981387624944, 0.10809891743298906, 0.09944532113866164, -0.11424250424338075, -0.12654817264455442, 0.3777438618815862, -0.029125797333052525, -0.30373511585192037, 0.09713031934001125, -0.12271412813033049, -0.17332062690447156, 0.11235274851250533, 0.0898458175182056, 0.10004734793463005, -0.1389887674460904, 0.18047258719855633, -0.0537933296810549, 0.13891178116273994, 0.10928361157241923, 0.013414559778399192, 0.1760325448659177, 0.10023471099646905, 0.0952234678892777, 0.12749322836573881, 0.03938638075711564, -0.09120149738647831, -0.37199591887183486, -0.1684448982696407, -0.08836455704787603, 0.15071435868930377, -0.13005078332476283, -0.17082989805516824, 0.3361395077493328, 0.0911459322810585, 0.16071020895794322, 0.06718282118941156, 0.16579513284019554, 0.11241808034604989, 0.0973960088333115, 0.05538438871646156, 0.21415678546674408, 0.19925095342063848, 0.012874554171083638, -0.17180334183100898, -0.07905723108336903, 0.18588977180815375]
1,803.07499
Dynamics of one fold symmetric patches for the aggregation equation and collapse to singular measure
We are concerned with the dynamics of one fold symmetric patches for the two-dimensional aggregation equation associated to the Newtonian potential. We reformulate a suitable graph model and prove a local well-posedness result in sub-critical and critical spaces. The global existence is obtained only for small initial data using a weak damping property hidden in the velocity terms. This allows to analyze the concentration phenomenon of the aggregation patches near the blow up time. In particular, we prove that the patch collapses to a collection of disjoint segments and we provide a description of the singular measure through a careful study of the asymptotic behavior of the graph.
math.AP
we are concerned with the dynamics of one fold symmetric patches for the twodimensional aggregation equation associated to the newtonian potential we reformulate a suitable graph model and prove a local wellposedness result in subcritical and critical spaces the global existence is obtained only for small initial data using a weak damping property hidden in the velocity terms this allows to analyze the concentration phenomenon of the aggregation patches near the blow up time in particular we prove that the patch collapses to a collection of disjoint segments and we provide a description of the singular measure through a careful study of the asymptotic behavior of the graph
[['we', 'are', 'concerned', 'with', 'the', 'dynamics', 'of', 'one', 'fold', 'symmetric', 'patches', 'for', 'the', 'twodimensional', 'aggregation', 'equation', 'associated', 'to', 'the', 'newtonian', 'potential', 'we', 'reformulate', 'a', 'suitable', 'graph', 'model', 'and', 'prove', 'a', 'local', 'wellposedness', 'result', 'in', 'subcritical', 'and', 'critical', 'spaces', 'the', 'global', 'existence', 'is', 'obtained', 'only', 'for', 'small', 'initial', 'data', 'using', 'a', 'weak', 'damping', 'property', 'hidden', 'in', 'the', 'velocity', 'terms', 'this', 'allows', 'to', 'analyze', 'the', 'concentration', 'phenomenon', 'of', 'the', 'aggregation', 'patches', 'near', 'the', 'blow', 'up', 'time', 'in', 'particular', 'we', 'prove', 'that', 'the', 'patch', 'collapses', 'to', 'a', 'collection', 'of', 'disjoint', 'segments', 'and', 'we', 'provide', 'a', 'description', 'of', 'the', 'singular', 'measure', 'through', 'a', 'careful', 'study', 'of', 'the', 'asymptotic', 'behavior', 'of', 'the', 'graph']]
[-0.1645235423153887, 0.04726394076607431, -0.09354235515584824, 0.07550707067518185, -0.03961745360693722, -0.08990225540818991, 0.04050675478194737, 0.30514083721640484, -0.3118509560763077, -0.22086470208079037, 0.11732388212274397, -0.27196212251106366, -0.13493022737438204, 0.13332687439698795, -0.03344252163380453, 0.0511252756782428, 0.06796335983003869, 0.060601805788691204, -0.06447915671419145, -0.211812696879389, 0.3573358726635989, -0.01291784305740967, 0.2722468904297178, 0.0352116239912532, 0.12070965506589143, 0.00574867956823221, -0.012224674845735231, 0.061748822931096785, -0.1923120149944966, 0.11628240214971204, 0.1915428906364401, 0.07971225783047783, 0.29705564558281805, -0.41561216748905955, -0.20982077975619445, 0.14839207422833336, 0.13762859338506436, 0.1288414868026006, -0.041640211739663584, -0.28204701673584404, 0.1248351556326573, -0.09584749510503132, -0.20737227129198058, -0.06832564281756748, 0.01745561516360828, 0.0592037612805143, -0.28180680187263835, 0.0998712273668153, 0.09141568272995453, 0.04035338946980321, -0.09792579369483671, -0.015810924663027335, -0.024240827213765845, 0.12244051690127149, 0.04130984709654176, 0.0018370094519384482, 0.0899441496434587, -0.13989104762785481, -0.04662887908246679, 0.35663545327649143, -0.08427790728725355, -0.20443953221264463, 0.1944120810755218, -0.15233490854640236, -0.12467786834006095, 0.12988772657182482, 0.18199203732958133, 0.1259410557233625, -0.1265254747381227, 0.09808418829763671, -0.06584449278414939, 0.14512124404858764, 0.09628655660155884, -0.0018041247665813124, 0.14941715087991692, 0.18249754365576706, 0.12295665151301634, 0.18289297785129208, -0.07303744394771962, -0.10308792709137951, -0.33307275305398637, -0.16128981001330195, -0.15607932437625197, 0.06976113240751955, -0.13221492274641167, -0.20760738925525435, 0.411284543498402, 0.12869389007661353, 0.25615936431481884, 0.08361901270863772, 0.23814404568703915, 0.10656742511006694, 0.020772169905723312, 0.06632402957054889, 0.21209138823259208, 0.11319994419399235, 0.10335506085323652, -0.19335628047378528, 0.03506024854895831, 0.13000012597896987]
1,803.075
$\mathbb{Z}_2$ boundary twist fields and the moduli space of D-branes
We revisit the boundary conformal field theory of twist fields. Based on the equivalence between twisted bosons on a circle and the orbifold theory at the critical radius, we provide a bosonized representation of boundary twist fields and thus a free field representation of the latter. One advantage of this formulation is that it considerably simplifies the calculation of correlation functions involving twist fields. At the same time this also gives access to higher order terms in the operator product expansions of the latter which, in turn, allows to explore the moduli space of marginal deformation of bound states of D-branes. In the process we also generalize some results on correlation functions with excited twist fields.
hep-th
we revisit the boundary conformal field theory of twist fields based on the equivalence between twisted bosons on a circle and the orbifold theory at the critical radius we provide a bosonized representation of boundary twist fields and thus a free field representation of the latter one advantage of this formulation is that it considerably simplifies the calculation of correlation functions involving twist fields at the same time this also gives access to higher order terms in the operator product expansions of the latter which in turn allows to explore the moduli space of marginal deformation of bound states of dbranes in the process we also generalize some results on correlation functions with excited twist fields
[['we', 'revisit', 'the', 'boundary', 'conformal', 'field', 'theory', 'of', 'twist', 'fields', 'based', 'on', 'the', 'equivalence', 'between', 'twisted', 'bosons', 'on', 'a', 'circle', 'and', 'the', 'orbifold', 'theory', 'at', 'the', 'critical', 'radius', 'we', 'provide', 'a', 'bosonized', 'representation', 'of', 'boundary', 'twist', 'fields', 'and', 'thus', 'a', 'free', 'field', 'representation', 'of', 'the', 'latter', 'one', 'advantage', 'of', 'this', 'formulation', 'is', 'that', 'it', 'considerably', 'simplifies', 'the', 'calculation', 'of', 'correlation', 'functions', 'involving', 'twist', 'fields', 'at', 'the', 'same', 'time', 'this', 'also', 'gives', 'access', 'to', 'higher', 'order', 'terms', 'in', 'the', 'operator', 'product', 'expansions', 'of', 'the', 'latter', 'which', 'in', 'turn', 'allows', 'to', 'explore', 'the', 'moduli', 'space', 'of', 'marginal', 'deformation', 'of', 'bound', 'states', 'of', 'dbranes', 'in', 'the', 'process', 'we', 'also', 'generalize', 'some', 'results', 'on', 'correlation', 'functions', 'with', 'excited', 'twist', 'fields']]
[-0.1631547599741868, 0.15521556518546403, -0.12007214976394356, 0.08237442742501085, -0.06252332598549025, -0.06938710620482291, 0.02734978951248822, 0.326262672194922, -0.23883284948734118, -0.24686327432121696, 0.07327225899367978, -0.20855251671196912, -0.1508880927195323, 0.15461099163853917, -0.01733643561952892, 0.007781392228307909, 0.018510017074355536, 0.07541948461986411, -0.1272878424517393, -0.24617744612322864, 0.3981092741215152, 0.027145868592799223, 0.28305080760238244, 0.0909250078477961, 0.0815636136023135, 0.0583469713375711, 0.0029376626078938617, -0.017058790701788704, -0.13648319184402022, 0.17138378584410208, 0.17996085907236256, 0.031118603796569694, 0.19037160105152248, -0.42726010011894433, -0.18324425970685893, 0.06031333328353177, 0.13915563859487082, 0.08809232758659195, 0.019037546480580328, -0.25814941417875475, 0.02486517450948856, -0.15850049774925193, -0.15845954793119996, -0.09455886681901356, -0.0004483152738900791, -0.04556686759541004, -0.2746924871161323, 0.059598494368777934, 0.04504837552165805, 0.05535995989358243, -0.08685472589999775, -0.09029088785133228, -0.0315613722797997, 0.11382874720007309, 0.09616901279164737, 0.09293796039780537, 0.11470216971918426, -0.20374510633550455, -0.10851471204659902, 0.3265767606810249, -0.06333539489323498, -0.2473647695291659, 0.15789967908821037, -0.20040420998401684, -0.15140741216500514, 0.12748500203577287, 0.14118010018237642, 0.13417982054745842, -0.07024808846221402, 0.15235171032615874, -0.05194130424382005, 0.11317867649205286, 0.09533697428836102, 0.03371736681558481, 0.1736526837540341, 0.06244247133747257, 0.08882810609768434, 0.19196789140275133, -0.032816358446545, -0.13858453780292243, -0.38294434043225545, -0.18868415356976992, -0.13383661316515044, 0.07165217910821003, -0.1250987528531776, -0.20550916835280328, 0.43688452572577857, 0.14468342134594045, 0.19568534051710418, 0.06883299657533042, 0.2314575335958266, 0.14790315206507862, 0.12702221143990755, 0.0333412405967026, 0.21661445784813058, 0.203893977976083, 0.053632296799433196, -0.1931704664843735, -0.04948958823585819, 0.16614918776081297]
1,803.07501
On a problem of Bermond and Bollob\'as
Let $n(k, d)$ be the order of the largest undirected graphs of maximum degree $k$ and diameter $d$, and let $M(k,d)$ be the corresponding Moore bound. In this paper, we give a positive answer to the question of Bermond and Bollob\'as concerning the Degree/Diameter Problem: Given a positive integer $c>0$, does there exist a pair $k$ and $d$, such that $n(k, d)\leq M(k,d)-c?$
math.CO
let nk d be the order of the largest undirected graphs of maximum degree k and diameter d and let mkd be the corresponding moore bound in this paper we give a positive answer to the question of bermond and bollobas concerning the degreediameter problem given a positive integer c0 does there exist a pair k and d such that nk dleq mkdc
[['let', 'nk', 'd', 'be', 'the', 'order', 'of', 'the', 'largest', 'undirected', 'graphs', 'of', 'maximum', 'degree', 'k', 'and', 'diameter', 'd', 'and', 'let', 'mkd', 'be', 'the', 'corresponding', 'moore', 'bound', 'in', 'this', 'paper', 'we', 'give', 'a', 'positive', 'answer', 'to', 'the', 'question', 'of', 'bermond', 'and', 'bollobas', 'concerning', 'the', 'degreediameter', 'problem', 'given', 'a', 'positive', 'integer', 'c0', 'does', 'there', 'exist', 'a', 'pair', 'k', 'and', 'd', 'such', 'that', 'nk', 'dleq', 'mkdc']]
[-0.22587902753824188, 0.15850326767934847, -0.01923892770390657, 0.0026507415309277994, -0.05739607298070745, -0.25815277050189195, 0.06122040167458415, 0.2942973172232028, -0.26724856710361855, -0.32858959507317315, 0.054090486431960016, -0.3239828342752111, -0.12901421782425454, 0.07613787768528826, -0.049407545454619874, -0.0012551036167180076, 0.03425538648791131, 0.1403757014852618, 0.022555284342923834, -0.33492922721310486, 0.2865938208246183, -0.0305006502932238, 0.08598050335422158, 0.17538575664342893, 0.061904610547747825, 0.0011056799877194627, 0.026565541490732182, 0.07469372685638166, -0.25980003082041814, 0.1261315237441581, 0.31432601421951284, 0.19627026113260898, 0.2611869977967393, -0.29691307437455944, -0.15076515517918573, 0.2998263587153727, 0.14225923322374, 0.008851648004154765, 0.0515796352298029, -0.18898292057095997, 0.197701656469895, -0.06275528878740583, -0.14072407199250114, 0.01900651215785934, 0.1918391187434956, -0.05265808216626606, -0.32974805053503764, 0.014180189753401904, 0.18286944586302964, 0.08800294486084773, 0.0112468236005835, -0.2381242522519202, 0.006019365831067966, 0.08449646095264583, -0.06881579943319593, 0.12995131248082484, -0.05511317601157052, -0.046790862146149116, -0.1551029792115573, 0.3085300315832419, -0.056377737041217305, -0.16911797591995809, 0.10297318215992662, -0.17575830726268432, -0.0913097285815785, 0.08693475043401122, 0.16396115297797106, 0.1882253764047017, 0.00010168891129714828, 0.20675738060831902, -0.17685974052836817, 0.14231037220827514, 0.17885923987975524, -0.023489937208773147, 0.1303355632680318, 0.05637306001247658, 0.14081728226324963, 0.14808409645657747, 0.02922482810719239, 0.04337657359428704, -0.307925786312309, -0.14609904707157834, -0.24251902019304614, 0.18983541448570548, -0.1565106160358541, -0.13996851402184657, 0.33069684138641725, 0.07953618034239739, 0.23544617624382577, 0.13195861909057824, 0.1587759571810884, 0.05636979666568579, -0.044003919412892674, 0.2013458661554802, 0.05325604923024413, 0.2137411759955989, -0.0041952352189729295, -0.2138556278406477, 0.06218156532474583, 0.13196639793234005]
1,803.07502
Chemical bonding in carbide MXene nanosheets
The chemical bonding in the carbide core and the surface chemistry in a new group of transition-metal carbides Tin+1Cn-Tx (n=1,2) called MXenes have been investigated by surface-sensitive valence band X-ray photoelectron spectroscopy. Changes in band structures of stacked nano sheets of different thicknesses are analyzed in connection to known hybridization regions of TiC and TiO2 that affect elastic and transport properties. By employing high excitation energy, the photoelectron cross-section for the C 2s - Ti 3d hybridization region at the bottom of the valence band is enhanced. As shown in this work, the O 2p and F 2p bands are shown to strongly depend both on the bond lengths to the surface groups and the adsorption sites. The effect of surface oxidation and Ar+ sputtering on the electronic structure is also discussed.
cond-mat.mtrl-sci physics.comp-ph
the chemical bonding in the carbide core and the surface chemistry in a new group of transitionmetal carbides tin1cntx n12 called mxenes have been investigated by surfacesensitive valence band xray photoelectron spectroscopy changes in band structures of stacked nano sheets of different thicknesses are analyzed in connection to known hybridization regions of tic and tio2 that affect elastic and transport properties by employing high excitation energy the photoelectron crosssection for the c 2s ti 3d hybridization region at the bottom of the valence band is enhanced as shown in this work the o 2p and f 2p bands are shown to strongly depend both on the bond lengths to the surface groups and the adsorption sites the effect of surface oxidation and ar sputtering on the electronic structure is also discussed
[['the', 'chemical', 'bonding', 'in', 'the', 'carbide', 'core', 'and', 'the', 'surface', 'chemistry', 'in', 'a', 'new', 'group', 'of', 'transitionmetal', 'carbides', 'tin1cntx', 'n12', 'called', 'mxenes', 'have', 'been', 'investigated', 'by', 'surfacesensitive', 'valence', 'band', 'xray', 'photoelectron', 'spectroscopy', 'changes', 'in', 'band', 'structures', 'of', 'stacked', 'nano', 'sheets', 'of', 'different', 'thicknesses', 'are', 'analyzed', 'in', 'connection', 'to', 'known', 'hybridization', 'regions', 'of', 'tic', 'and', 'tio2', 'that', 'affect', 'elastic', 'and', 'transport', 'properties', 'by', 'employing', 'high', 'excitation', 'energy', 'the', 'photoelectron', 'crosssection', 'for', 'the', 'c', '2s', 'ti', '3d', 'hybridization', 'region', 'at', 'the', 'bottom', 'of', 'the', 'valence', 'band', 'is', 'enhanced', 'as', 'shown', 'in', 'this', 'work', 'the', 'o', '2p', 'and', 'f', '2p', 'bands', 'are', 'shown', 'to', 'strongly', 'depend', 'both', 'on', 'the', 'bond', 'lengths', 'to', 'the', 'surface', 'groups', 'and', 'the', 'adsorption', 'sites', 'the', 'effect', 'of', 'surface', 'oxidation', 'and', 'ar', 'sputtering', 'on', 'the', 'electronic', 'structure', 'is', 'also', 'discussed']]
[-0.07458143445770614, 0.17421708341705827, 0.008640459093909997, 0.036741790808558175, 0.04375063066120045, -0.12925796979823365, 0.10183643498637068, 0.4680737095956619, -0.27962344547805307, -0.31193028699893216, -0.03582829939864146, -0.34305159139375274, -0.12452140951242585, 0.1176084840670228, 0.045201488972704214, 0.003957683705868056, 0.009928841373095146, -0.12027898680848571, -0.10000852170722703, -0.18132642613938796, 0.30812404167193636, 0.08887173070643957, 0.31152254001309093, 0.1574074586486229, -0.05504505588458135, -0.023663317890336308, 0.07455627681830755, 0.008495700667397334, -0.15060011822346356, 0.13627241344158672, 0.2506489364287028, -0.07944704392530884, 0.1621862260141195, -0.4811972619679112, -0.23425217404281004, -0.07303627347842288, 0.12110834644319346, 0.06853033935185522, -0.07046766909591567, -0.24630488611112994, 0.06763996689652021, -0.11604349285614891, -0.08495085990199676, -0.029979879735933187, 0.04953004289060258, 0.03293174390430347, -0.1834895091117897, 0.034932031129406266, -0.00011126325071717685, 0.08345340877377357, -0.14208571231350875, -0.18417449448472606, -0.21628034588200254, 0.06345972393352825, 0.02456571587647956, 0.01051289120693512, 0.18909631439198096, -0.08360860486908887, -0.08056503625770207, 0.4039145051573332, -0.03252357140971491, -0.07822516947411574, 0.20606468198820949, -0.2094329907773779, -0.11337038799493503, 0.21686887316262493, 0.10510816304729535, 0.13927875549550384, -0.09416894765185693, 0.1231532669491851, 0.023291199560312986, 0.17381552445272413, 0.11575401246261138, 0.08234893036648058, 0.18026455650643375, 0.1735881359791025, 0.01328215211755238, 0.08950687409378588, -0.18848282889677928, 0.020167311223653648, -0.17538364905720719, -0.22219467727610698, -0.21868858885091658, 0.008720585198786397, -0.03582431837679066, -0.21524320142657066, 0.4072960067862788, 0.003971907797341163, 0.1554566541650834, -0.09698761348397686, 0.17341529859158283, 0.07655636365883625, 0.06450039301730262, 0.02772999845015315, 0.27039384032384706, 0.19143914746013113, 0.0739503375863513, -0.2905112325294445, 0.11347824626673873, 0.03640483509426793]
1,803.07503
Reliable and Practical Computational Prediction of Molecular Crystal Polymorphs
The ability to reliably predict the structures and stabilities of a molecular crystal and its polymorphs without any prior experimental information would be an invaluable tool for a number of fields, with specific and immediate applications in the design and formulation of pharmaceuticals. In this case, detailed knowledge of the polymorphic energy landscape for an active pharmaceutical ingredient yields profound insight regarding the existence and likelihood of late-appearing polymorphs. However, the computational prediction of the structures and stabilities of molecular crystal polymorphs is particularly challenging due to the high dimensionality of conformational and crystallographic space accompanied by the need for relative (free) energies to within $\approx$ 1 kJ/mol per molecule. In this work, we combine the most successful crystal structure sampling strategy with the most accurate energy ranking strategy of the latest blind test of organic crystal structure prediction (CSP), organized by the Cambridge Crystallographic Data Centre (CCDC). Our final energy ranking is based on first-principles density functional theory (DFT) calculations that include three key physical contributions: (i) a sophisticated treatment of Pauli exchange-repulsion and electron correlation effects with hybrid functionals, (ii) inclusion of many-body van der Waals dispersion interactions, and (iii) account of vibrational free energies. In doing so, this combined approach has an optimal success rate in producing the crystal structures corresponding to the five blind-test molecules. With this practical approach, we demonstrate the feasibility of obtaining reliable structures and stabilities for molecular crystals of pharmaceutical importance, paving the way towards an enhanced fundamental understanding of polymorphic energy landscapes and routine industrial application of molecular CSP methods.
physics.chem-ph
the ability to reliably predict the structures and stabilities of a molecular crystal and its polymorphs without any prior experimental information would be an invaluable tool for a number of fields with specific and immediate applications in the design and formulation of pharmaceuticals in this case detailed knowledge of the polymorphic energy landscape for an active pharmaceutical ingredient yields profound insight regarding the existence and likelihood of lateappearing polymorphs however the computational prediction of the structures and stabilities of molecular crystal polymorphs is particularly challenging due to the high dimensionality of conformational and crystallographic space accompanied by the need for relative free energies to within approx 1 kjmol per molecule in this work we combine the most successful crystal structure sampling strategy with the most accurate energy ranking strategy of the latest blind test of organic crystal structure prediction csp organized by the cambridge crystallographic data centre ccdc our final energy ranking is based on firstprinciples density functional theory dft calculations that include three key physical contributions i a sophisticated treatment of pauli exchangerepulsion and electron correlation effects with hybrid functionals ii inclusion of manybody van der waals dispersion interactions and iii account of vibrational free energies in doing so this combined approach has an optimal success rate in producing the crystal structures corresponding to the five blindtest molecules with this practical approach we demonstrate the feasibility of obtaining reliable structures and stabilities for molecular crystals of pharmaceutical importance paving the way towards an enhanced fundamental understanding of polymorphic energy landscapes and routine industrial application of molecular csp methods
[['the', 'ability', 'to', 'reliably', 'predict', 'the', 'structures', 'and', 'stabilities', 'of', 'a', 'molecular', 'crystal', 'and', 'its', 'polymorphs', 'without', 'any', 'prior', 'experimental', 'information', 'would', 'be', 'an', 'invaluable', 'tool', 'for', 'a', 'number', 'of', 'fields', 'with', 'specific', 'and', 'immediate', 'applications', 'in', 'the', 'design', 'and', 'formulation', 'of', 'pharmaceuticals', 'in', 'this', 'case', 'detailed', 'knowledge', 'of', 'the', 'polymorphic', 'energy', 'landscape', 'for', 'an', 'active', 'pharmaceutical', 'ingredient', 'yields', 'profound', 'insight', 'regarding', 'the', 'existence', 'and', 'likelihood', 'of', 'lateappearing', 'polymorphs', 'however', 'the', 'computational', 'prediction', 'of', 'the', 'structures', 'and', 'stabilities', 'of', 'molecular', 'crystal', 'polymorphs', 'is', 'particularly', 'challenging', 'due', 'to', 'the', 'high', 'dimensionality', 'of', 'conformational', 'and', 'crystallographic', 'space', 'accompanied', 'by', 'the', 'need', 'for', 'relative', 'free', 'energies', 'to', 'within', 'approx', '1', 'kjmol', 'per', 'molecule', 'in', 'this', 'work', 'we', 'combine', 'the', 'most', 'successful', 'crystal', 'structure', 'sampling', 'strategy', 'with', 'the', 'most', 'accurate', 'energy', 'ranking', 'strategy', 'of', 'the', 'latest', 'blind', 'test', 'of', 'organic', 'crystal', 'structure', 'prediction', 'csp', 'organized', 'by', 'the', 'cambridge', 'crystallographic', 'data', 'centre', 'ccdc', 'our', 'final', 'energy', 'ranking', 'is', 'based', 'on', 'firstprinciples', 'density', 'functional', 'theory', 'dft', 'calculations', 'that', 'include', 'three', 'key', 'physical', 'contributions', 'i', 'a', 'sophisticated', 'treatment', 'of', 'pauli', 'exchangerepulsion', 'and', 'electron', 'correlation', 'effects', 'with', 'hybrid', 'functionals', 'ii', 'inclusion', 'of', 'manybody', 'van', 'der', 'waals', 'dispersion', 'interactions', 'and', 'iii', 'account', 'of', 'vibrational', 'free', 'energies', 'in', 'doing', 'so', 'this', 'combined', 'approach', 'has', 'an', 'optimal', 'success', 'rate', 'in', 'producing', 'the', 'crystal', 'structures', 'corresponding', 'to', 'the', 'five', 'blindtest', 'molecules', 'with', 'this', 'practical', 'approach', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'obtaining', 'reliable', 'structures', 'and', 'stabilities', 'for', 'molecular', 'crystals', 'of', 'pharmaceutical', 'importance', 'paving', 'the', 'way', 'towards', 'an', 'enhanced', 'fundamental', 'understanding', 'of', 'polymorphic', 'energy', 'landscapes', 'and', 'routine', 'industrial', 'application', 'of', 'molecular', 'csp', 'methods']]
[-0.07441137822758015, 0.0839257710044823, -0.07615206590223993, 0.0543286464987223, -0.05615363236523962, -0.10225591717780738, 0.09657353651834423, 0.38769865694459427, -0.24954214404497463, -0.34306049500936314, 0.015924784959591057, -0.24925648764768754, -0.13281779592686446, 0.18057427595094108, 0.011477338669730514, 0.0626258768914956, 0.05637721932793927, -0.03533284591713826, -0.057029305856696653, -0.20393401100517683, 0.26947848986678463, 0.11631050886013744, 0.31878996139722027, 0.07972284963314606, 0.07078086796573613, 0.02497521230719027, 0.0024698442011230884, -0.006482341783488141, -0.17655616842771646, 0.19402278669301695, 0.2957614047257121, 0.06807068752211877, 0.29305803880153464, -0.4507042533837636, -0.21852767537483866, 0.05861848841805432, 0.09832754667172505, 0.14674063103730112, -0.08986918345053639, -0.24221409070450478, 0.05499164593779275, -0.1518430334324713, -0.1262187031985547, -0.13140112452991742, -0.011141013932062842, 0.037599951725050894, -0.2103109768349931, 0.09252239642701028, 0.01163651512955349, 0.07480139151309659, -0.10914370292618306, -0.16627619905054844, -0.04623118518346174, 0.11820400961953784, 0.014766786348052932, 0.009142516647893138, 0.1749152955540242, -0.14549822802202422, -0.11778817506885729, 0.44238902067453945, 0.0037461574187553, -0.133508081772593, 0.19210384995665253, -0.08978394523456852, -0.17714508970590592, 0.1762637964464318, 0.13709094304458241, 0.08742271563056803, -0.13723152704946406, 0.06726440712053089, 0.05509270038054839, 0.19841302678773565, 0.05841282177861447, 0.05724357497689934, 0.19584229499453149, 0.20938819662417768, 0.03498820610460372, 0.09652990005785375, -0.08515620103798052, -0.0949420559730522, -0.23354188968782613, -0.20449348530909436, -0.17515312555945453, 0.03534267117823782, -0.09728296001375869, -0.1733333367133216, 0.3877097151771275, 0.12097690169205065, 0.1208928130500939, -0.02189584064400657, 0.26641811000215837, 0.026384488281301053, 0.054397745793576605, 0.002490048218837392, 0.2262052025732943, 0.13308484941301504, 0.06631804491888826, -0.24163764653770897, 0.08809900938910124, 0.027707387008323744]
1,803.07504
Pt, Ni and Ti Schottky barrier contacts to \{beta}-(Al0.19Ga0.81)2O3 grown by Molecular Beam Epitaxy on Sn doped \{beta}-Ga2O3 substrate
A comprehensive current-voltage (I-V) characterization is performed for three different Schottky contacts; Pt, Ni and Ti, to unintentionally doped (UID) \{beta}-(Al0.19Ga0.81)2O3 grown by molecular beam epitaxy (MBE) on \{beta}-Ga2O3 for temperatures ranging between 25C -300C. Reciprocal space mapping shows the (Al0.19Ga0.81)2O3 films are strained and lattice matched to the substrate. Schottky Barrier Height (SBH), ideality factor (n), and series resistance (Rs) are extracted from the I-V characteristics for the three types of metals and temperatures. Room temperature capacitance-voltage (C-V) measurements revealed fully depleted \{beta}-(Al0.19Ga0.81)2O3 layer. Extracted room temperature SBHs after zero field correction for Pt, Ni and Ti were 2.39 eV, 2.21 eV, and 1.22 eV respectively. Variation of SBHs with metal clearly indicates the dependence on work function.
physics.app-ph cond-mat.mtrl-sci
a comprehensive currentvoltage iv characterization is performed for three different schottky contacts pt ni and ti to unintentionally doped uid betaal019ga0812o3 grown by molecular beam epitaxy mbe on betaga2o3 for temperatures ranging between 25c 300c reciprocal space mapping shows the al019ga0812o3 films are strained and lattice matched to the substrate schottky barrier height sbh ideality factor n and series resistance rs are extracted from the iv characteristics for the three types of metals and temperatures room temperature capacitancevoltage cv measurements revealed fully depleted betaal019ga0812o3 layer extracted room temperature sbhs after zero field correction for pt ni and ti were 239 ev 221 ev and 122 ev respectively variation of sbhs with metal clearly indicates the dependence on work function
[['a', 'comprehensive', 'currentvoltage', 'iv', 'characterization', 'is', 'performed', 'for', 'three', 'different', 'schottky', 'contacts', 'pt', 'ni', 'and', 'ti', 'to', 'unintentionally', 'doped', 'uid', 'betaal019ga0812o3', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'mbe', 'on', 'betaga2o3', 'for', 'temperatures', 'ranging', 'between', '25c', '300c', 'reciprocal', 'space', 'mapping', 'shows', 'the', 'al019ga0812o3', 'films', 'are', 'strained', 'and', 'lattice', 'matched', 'to', 'the', 'substrate', 'schottky', 'barrier', 'height', 'sbh', 'ideality', 'factor', 'n', 'and', 'series', 'resistance', 'rs', 'are', 'extracted', 'from', 'the', 'iv', 'characteristics', 'for', 'the', 'three', 'types', 'of', 'metals', 'and', 'temperatures', 'room', 'temperature', 'capacitancevoltage', 'cv', 'measurements', 'revealed', 'fully', 'depleted', 'betaal019ga0812o3', 'layer', 'extracted', 'room', 'temperature', 'sbhs', 'after', 'zero', 'field', 'correction', 'for', 'pt', 'ni', 'and', 'ti', 'were', '239', 'ev', '221', 'ev', 'and', '122', 'ev', 'respectively', 'variation', 'of', 'sbhs', 'with', 'metal', 'clearly', 'indicates', 'the', 'dependence', 'on', 'work', 'function']]
[-0.09559124847874045, 0.1497621794395823, 0.0005879307181799207, -0.0358527746314488, 0.05334490568152275, -0.2614710502751003, 0.1420147637073914, 0.4602834444597428, -0.2281892304750288, -0.3629135212957345, -0.03434629860366213, -0.39128829308400126, -0.028138376826597058, 0.2382255936812224, 0.046639311039049565, 0.01522421855519622, -0.0688924844103769, -0.15753271954700127, -0.16186489475939167, -0.2022566326958095, 0.26308176671917516, 0.054219486366491765, 0.3518454222137044, 0.12130951794498632, 0.027707870885055382, -0.05854010619303404, 0.11286857078084722, 0.035169072220390986, -0.19059445008089573, -0.015494246931007967, 0.27123627568402425, -0.15304381934251507, 0.13608026127897982, -0.4152552188486503, -0.21566093928915256, -0.08052605932080668, 0.08544477616468894, 0.06655751390318418, -0.1192453605171036, -0.23868209126421475, 0.13185995005890086, -0.08955956143648203, -0.051356382613825004, 0.0225762904637718, 0.01414913375528754, 0.00024293407051149626, -0.23385931002397636, 0.09764365566862297, 0.006975385047302678, 0.1714561497471456, -0.08201194994536967, -0.23190336834623254, -0.15044424630669428, 0.043312409595618474, -0.011913926206159824, 0.022598548314598357, 0.2940903351931223, 0.0015583010666385486, -0.04523476672053722, 0.2997213343784598, -0.05949607138032222, 0.006358145174152893, 0.14139352402858565, -0.18640010166062235, -0.013849963124937796, 0.20277206696056085, 0.07949998657668716, 0.10981996227176218, -0.15367536335091653, 0.05150235852262744, 0.07879179238405978, 0.23712162854519256, 0.13675269753479496, 0.02197483370626538, 0.2159924631785794, 0.18275223333581253, -0.03855775303361889, 0.07055437942196069, -0.18748975641110205, 0.020554646387985296, -0.1712562320914505, -0.22413825719408562, -0.16275081480050396, 0.12752697901029525, -0.10881096815037067, -0.1780568353394207, 0.3752171974910166, 0.08295574083779778, 0.19465418478698823, -0.03268752416499473, 0.2161018118776124, 0.08273230806787915, 0.06861516937000299, 0.014920781432763385, 0.1999583800226964, 0.18349404143097264, 0.15233639077733047, -0.2482516607610862, 0.11359640307210643, -0.03184345501760053]
1,803.07505
Non-Asymptotic Classical Data Compression with Quantum Side Information
In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian-Wolf protocol) in the so-called large and moderate deviation regimes. In the non-asymptotic setting, the protocol involves compressing classical sequences of finite length $n$ and decoding them with the assistance of quantum side information. In the large deviation regime, the compression rate is fixed, and we obtain bounds on the error exponent function, which characterizes the minimal probability of error as a function of the rate. Devetak and Winter showed that the asymptotic data compression limit for this protocol is given by a conditional entropy. For any protocol with a rate below this quantity, the probability of error converges to one asymptotically and its speed of convergence is given by the strong converse exponent function. We obtain finite blocklength bounds on this function, and determine exactly its asymptotic value. In the moderate deviation regime for the compression rate, the latter is no longer considered to be fixed. It is allowed to depend on the blocklength $n$, but assumed to decay slowly to the asymptotic data compression limit. Starting from a rate above this limit, we determine the speed of convergence of the error probability to zero and show that it is given in terms of the conditional information variance. Our results complement earlier results obtained by Tomamichel and Hayashi, in which they analyzed the so-called small deviation regime of this protocol.
quant-ph cs.IT math.IT
in this paper we analyze classical data compression with quantum side information also known as the classicalquantum slepianwolf protocol in the socalled large and moderate deviation regimes in the nonasymptotic setting the protocol involves compressing classical sequences of finite length n and decoding them with the assistance of quantum side information in the large deviation regime the compression rate is fixed and we obtain bounds on the error exponent function which characterizes the minimal probability of error as a function of the rate devetak and winter showed that the asymptotic data compression limit for this protocol is given by a conditional entropy for any protocol with a rate below this quantity the probability of error converges to one asymptotically and its speed of convergence is given by the strong converse exponent function we obtain finite blocklength bounds on this function and determine exactly its asymptotic value in the moderate deviation regime for the compression rate the latter is no longer considered to be fixed it is allowed to depend on the blocklength n but assumed to decay slowly to the asymptotic data compression limit starting from a rate above this limit we determine the speed of convergence of the error probability to zero and show that it is given in terms of the conditional information variance our results complement earlier results obtained by tomamichel and hayashi in which they analyzed the socalled small deviation regime of this protocol
[['in', 'this', 'paper', 'we', 'analyze', 'classical', 'data', 'compression', 'with', 'quantum', 'side', 'information', 'also', 'known', 'as', 'the', 'classicalquantum', 'slepianwolf', 'protocol', 'in', 'the', 'socalled', 'large', 'and', 'moderate', 'deviation', 'regimes', 'in', 'the', 'nonasymptotic', 'setting', 'the', 'protocol', 'involves', 'compressing', 'classical', 'sequences', 'of', 'finite', 'length', 'n', 'and', 'decoding', 'them', 'with', 'the', 'assistance', 'of', 'quantum', 'side', 'information', 'in', 'the', 'large', 'deviation', 'regime', 'the', 'compression', 'rate', 'is', 'fixed', 'and', 'we', 'obtain', 'bounds', 'on', 'the', 'error', 'exponent', 'function', 'which', 'characterizes', 'the', 'minimal', 'probability', 'of', 'error', 'as', 'a', 'function', 'of', 'the', 'rate', 'devetak', 'and', 'winter', 'showed', 'that', 'the', 'asymptotic', 'data', 'compression', 'limit', 'for', 'this', 'protocol', 'is', 'given', 'by', 'a', 'conditional', 'entropy', 'for', 'any', 'protocol', 'with', 'a', 'rate', 'below', 'this', 'quantity', 'the', 'probability', 'of', 'error', 'converges', 'to', 'one', 'asymptotically', 'and', 'its', 'speed', 'of', 'convergence', 'is', 'given', 'by', 'the', 'strong', 'converse', 'exponent', 'function', 'we', 'obtain', 'finite', 'blocklength', 'bounds', 'on', 'this', 'function', 'and', 'determine', 'exactly', 'its', 'asymptotic', 'value', 'in', 'the', 'moderate', 'deviation', 'regime', 'for', 'the', 'compression', 'rate', 'the', 'latter', 'is', 'no', 'longer', 'considered', 'to', 'be', 'fixed', 'it', 'is', 'allowed', 'to', 'depend', 'on', 'the', 'blocklength', 'n', 'but', 'assumed', 'to', 'decay', 'slowly', 'to', 'the', 'asymptotic', 'data', 'compression', 'limit', 'starting', 'from', 'a', 'rate', 'above', 'this', 'limit', 'we', 'determine', 'the', 'speed', 'of', 'convergence', 'of', 'the', 'error', 'probability', 'to', 'zero', 'and', 'show', 'that', 'it', 'is', 'given', 'in', 'terms', 'of', 'the', 'conditional', 'information', 'variance', 'our', 'results', 'complement', 'earlier', 'results', 'obtained', 'by', 'tomamichel', 'and', 'hayashi', 'in', 'which', 'they', 'analyzed', 'the', 'socalled', 'small', 'deviation', 'regime', 'of', 'this', 'protocol']]
[-0.14340573112272947, 0.11102832559136157, -0.09990158339007561, 0.08577551845922879, 0.011897855408454486, -0.16141710948285123, 0.14420798854675426, 0.29734958589327437, -0.28485484044811055, -0.2500437299267021, 0.13236928164240896, -0.25239649443190637, -0.10432378033091932, 0.21784346530159168, -0.11298063444560628, 0.09419521545950214, 0.04122356649394296, 0.10290620444702502, -0.0689906912817651, -0.2806816073359546, 0.26847231563204166, 0.1035432966754717, 0.32076041154884305, 0.05459427731816007, 0.09039689006847369, 0.015237552047308003, 0.0028417316508017668, -0.020529701953612957, -0.2004341639027693, 0.0737275296876974, 0.2245831715036966, 0.1292308723180312, 0.2688068073211598, -0.33886642089630126, -0.19401271744169482, 0.11489566504718549, 0.13903333914579682, 0.1371020302988448, -0.01691609944809745, -0.25330230455548197, 0.1212840312367947, -0.15848923844242266, -0.10206547173467942, 0.001256114846298925, 0.011259124232769138, 0.04694047079523321, -0.3241839295433161, 0.10984736894139484, 0.09426662806390214, 0.031076171435415745, -0.0011897114249329794, -0.08558048253503292, 0.04286272535315801, 0.13764365735765108, 0.09267025879738822, 0.06010832813443193, 0.10394717862586464, -0.1222687506844767, -0.06386608661919393, 0.2989928550517359, -0.10175327088257313, -0.2010778431279757, 0.13939328303271042, -0.18324728354913408, -0.09052331259810686, 0.12773235064555555, 0.1485039268976406, 0.10045299022028051, -0.10149697060970699, 0.10598639846278526, -0.036203788583628646, 0.18910370072537735, 0.08693394714872502, 0.08753254360806964, 0.09536052169669576, 0.11428830683419183, 0.10598808651674586, 0.17550916084383825, -0.09285240783172703, -0.12820993011480808, -0.33310854220528063, -0.14276858427984437, -0.23834685315260618, 0.05490542379278345, -0.15668671343039267, -0.14206760367202503, 0.3130189705886604, 0.13451523531547224, 0.19916687722458748, 0.1598801412981614, 0.3003572071745929, 0.15839395650511826, 0.011870400377983587, 0.1413321519004447, 0.24516633134814636, 0.1406288157044049, 0.0667126945810815, -0.21075458053407503, 0.11588874926101886, 0.09435533927244862]
1,803.07506
Ideas from Developmental Robotics and Embodied AI on the Questions of Ethics in Robots
Advances in Artificial Intelligence and robotics are currently questioning theethical framework of their applications to deal with potential drifts, as well as the way inwhich these algorithms learn because they will have a strong impact on the behavior ofrobots and the type of robots. interactions with people. We would like to highlight someprinciples and ideas from cognitive neuroscience and development sciences based on theimportance of the body for intelligence, contrary to the theory of the all-brain or all-algorithm, to represent the world and interacting with others, and their current applicationsin embodied AI and developmental robotics to propose models of architectures andmechanisms for agency, representation of the body, recognition of the intention of others,predictive coding, active inference, the role of feedback and error, imitation, artificialcuriosity and contextual learning. We will explain how these are important for the design ofautonomous systems and beyond what they can tell us for the ethics of systems.
cs.RO cs.HC
advances in artificial intelligence and robotics are currently questioning theethical framework of their applications to deal with potential drifts as well as the way inwhich these algorithms learn because they will have a strong impact on the behavior ofrobots and the type of robots interactions with people we would like to highlight someprinciples and ideas from cognitive neuroscience and development sciences based on theimportance of the body for intelligence contrary to the theory of the allbrain or allalgorithm to represent the world and interacting with others and their current applicationsin embodied ai and developmental robotics to propose models of architectures andmechanisms for agency representation of the body recognition of the intention of otherspredictive coding active inference the role of feedback and error imitation artificialcuriosity and contextual learning we will explain how these are important for the design ofautonomous systems and beyond what they can tell us for the ethics of systems
[['advances', 'in', 'artificial', 'intelligence', 'and', 'robotics', 'are', 'currently', 'questioning', 'theethical', 'framework', 'of', 'their', 'applications', 'to', 'deal', 'with', 'potential', 'drifts', 'as', 'well', 'as', 'the', 'way', 'inwhich', 'these', 'algorithms', 'learn', 'because', 'they', 'will', 'have', 'a', 'strong', 'impact', 'on', 'the', 'behavior', 'ofrobots', 'and', 'the', 'type', 'of', 'robots', 'interactions', 'with', 'people', 'we', 'would', 'like', 'to', 'highlight', 'someprinciples', 'and', 'ideas', 'from', 'cognitive', 'neuroscience', 'and', 'development', 'sciences', 'based', 'on', 'theimportance', 'of', 'the', 'body', 'for', 'intelligence', 'contrary', 'to', 'the', 'theory', 'of', 'the', 'allbrain', 'or', 'allalgorithm', 'to', 'represent', 'the', 'world', 'and', 'interacting', 'with', 'others', 'and', 'their', 'current', 'applicationsin', 'embodied', 'ai', 'and', 'developmental', 'robotics', 'to', 'propose', 'models', 'of', 'architectures', 'andmechanisms', 'for', 'agency', 'representation', 'of', 'the', 'body', 'recognition', 'of', 'the', 'intention', 'of', 'otherspredictive', 'coding', 'active', 'inference', 'the', 'role', 'of', 'feedback', 'and', 'error', 'imitation', 'artificialcuriosity', 'and', 'contextual', 'learning', 'we', 'will', 'explain', 'how', 'these', 'are', 'important', 'for', 'the', 'design', 'ofautonomous', 'systems', 'and', 'beyond', 'what', 'they', 'can', 'tell', 'us', 'for', 'the', 'ethics', 'of', 'systems']]
[-0.05394544648339174, 0.07508832256176642, -0.08361137916674904, 0.07450658460812909, -0.1350741144535797, -0.14587213696047133, 0.021103244594996795, 0.40060792094362635, -0.2655097576423681, -0.3676156305441899, 0.11496373457651186, -0.2708187411306426, -0.25141035878997564, 0.2007962051695878, -0.14613874063361437, 0.04003349829498412, 0.033704731965969716, 0.07776978770104637, 0.0014047733715934945, -0.23383460676663423, 0.31851647994148413, 0.05385929380842883, 0.27098062774831694, 0.03720644203879472, 0.09156815591933472, -0.010249156957226141, -0.02691114141156764, -0.010200398145077219, -0.07687950990844651, 0.23957795387832448, 0.32401583961195035, 0.2359017862339637, 0.36110032879348314, -0.47323179260295417, -0.22430716866095152, 0.08643600789697042, 0.15729638611166072, 0.10059854151414974, -0.030742353962601294, -0.3414908664301038, 0.02660587186941744, -0.17359888686665467, -0.09450946400008564, -0.12001879294402898, 0.02949207147051181, 0.05311469494581615, -0.22121113806746767, -0.024241587187030487, 0.07654662886052392, 0.09144254504436893, -0.07241979146908437, -0.12091947765355664, 0.05835961684019172, 0.22670520774138692, 0.0669050963025906, 0.008277751784771682, 0.18980681232974997, -0.230292887552475, -0.19945227080357394, 0.41322065949040865, 0.028089634448822055, -0.1724005994253925, 0.28354697878904905, -0.07809999619411039, -0.15528182390345527, 0.00747899699656825, 0.2742950332326083, 0.043232718507559706, -0.12158222863716739, 0.049679291476994486, 0.04823946474519159, 0.12457945891323366, 0.0013684787496458738, 0.03973375550205154, 0.24920987297913857, 0.19484746587861862, 0.04206968643702567, 0.04612338042102887, -0.04936345639705126, -0.14912923885110232, -0.2194310807090785, -0.1414563026212688, -0.11694384302910683, 0.02381111575357084, -0.026076135360926855, -0.13580631888274053, 0.3416571099610467, 0.23807522645552776, 0.13311884773845253, 0.04913744512305129, 0.27930426118296703, 0.027279182871071887, 0.09231955871717738, 0.04758601408518318, 0.25732372489042715, 0.07492367782230888, 0.17877046367752233, -0.1926084915159403, 0.10005084187557389, -0.015367684031038413]
1,803.07507
Polarization-dependent resonant inelastic X-ray scattering study at the Cu L and O K-edge of YBa$_2$Cu$_3$O$_{7-x}$
We present a study on the high-Tc superconductor (HTSC) YBa2Cu3O7-x (YBCO) using polarization-dependent X-ray absorption and resonant inelastic X-ray scattering. High-resolution measurements using synchrotron-radiation are compared with calculations using a quasi-atomic multiplet approach performed at the Cu 2p3/2-edge of YBCO. We use a multiplet approach within the single impurity Anderson model to reproduce and understand the character of the localized low-energy excitations in YBCO. We observe a distinct peak at about 0.5 eV in O K RIXS. This peak shows dependence on doping, incident energy, and momentum transfer that suggests that it has a different origin than the previously discussed cuprate bi-magnons. Therefore, we assign it to multi-magnon excitations between the Zhang Rice bands and/or the Upper Hubbard bands, respectively.
cond-mat.mtrl-sci physics.comp-ph
we present a study on the hightc superconductor htsc yba2cu3o7x ybco using polarizationdependent xray absorption and resonant inelastic xray scattering highresolution measurements using synchrotronradiation are compared with calculations using a quasiatomic multiplet approach performed at the cu 2p32edge of ybco we use a multiplet approach within the single impurity anderson model to reproduce and understand the character of the localized lowenergy excitations in ybco we observe a distinct peak at about 05 ev in o k rixs this peak shows dependence on doping incident energy and momentum transfer that suggests that it has a different origin than the previously discussed cuprate bimagnons therefore we assign it to multimagnon excitations between the zhang rice bands andor the upper hubbard bands respectively
[['we', 'present', 'a', 'study', 'on', 'the', 'hightc', 'superconductor', 'htsc', 'yba2cu3o7x', 'ybco', 'using', 'polarizationdependent', 'xray', 'absorption', 'and', 'resonant', 'inelastic', 'xray', 'scattering', 'highresolution', 'measurements', 'using', 'synchrotronradiation', 'are', 'compared', 'with', 'calculations', 'using', 'a', 'quasiatomic', 'multiplet', 'approach', 'performed', 'at', 'the', 'cu', '2p32edge', 'of', 'ybco', 'we', 'use', 'a', 'multiplet', 'approach', 'within', 'the', 'single', 'impurity', 'anderson', 'model', 'to', 'reproduce', 'and', 'understand', 'the', 'character', 'of', 'the', 'localized', 'lowenergy', 'excitations', 'in', 'ybco', 'we', 'observe', 'a', 'distinct', 'peak', 'at', 'about', '05', 'ev', 'in', 'o', 'k', 'rixs', 'this', 'peak', 'shows', 'dependence', 'on', 'doping', 'incident', 'energy', 'and', 'momentum', 'transfer', 'that', 'suggests', 'that', 'it', 'has', 'a', 'different', 'origin', 'than', 'the', 'previously', 'discussed', 'cuprate', 'bimagnons', 'therefore', 'we', 'assign', 'it', 'to', 'multimagnon', 'excitations', 'between', 'the', 'zhang', 'rice', 'bands', 'andor', 'the', 'upper', 'hubbard', 'bands', 'respectively']]
[-0.0966451782244062, 0.14875638723166018, -0.050412327544215846, 0.08527681971763205, -0.03962124405945299, -0.16243328753185748, 0.13312840455078653, 0.4426726173265141, -0.1865494372244893, -0.2950560023397708, -0.05821412953375956, -0.40815456340699885, -0.07252108890881435, 0.16034550301558456, 0.08138824907863247, -0.01964844119570711, -0.01842634487865853, -0.06537781901532362, -0.09813393692352942, -0.18692365983313247, 0.28468054936643095, 0.05422926871712562, 0.31597101537338573, 0.09675008567253582, 0.010795126974332232, 0.06645913878964464, 0.10051242396736346, -0.03718734302503221, -0.1736983983791404, 0.07761705152987808, 0.30469229905239986, -0.10163355603454118, 0.1343775291833244, -0.41900210318100806, -0.23153007896656186, -0.049261662079913525, 0.15455495665131622, 0.11664640116544456, -0.0237401728577004, -0.23225086946783885, 0.04494667341228293, -0.15038107625138358, -0.09651338972616941, -0.06877411949299589, -0.030033970979519754, -0.06089316219866213, -0.23284075820051572, 0.08322716931452458, -0.0060503434374177155, 0.10246748590621532, -0.1547862085623338, -0.13892549611315005, -0.08060606270871994, -0.02511236212067619, 0.04661890390786898, 0.05149267239402197, 0.12364790193392199, -0.07374658822884173, -0.11170014080067142, 0.3098803457985984, -0.07073890056890071, -0.022908144016131882, 0.1570608899459055, -0.20751712474377215, -0.11930605223277162, 0.17410535473149552, 0.07911432805733301, 0.12131493107392256, -0.12565488942474237, 0.07541074496038462, -0.06524431101289116, 0.23224845369142957, 0.10224302950463876, 0.09931330146960632, 0.22920349150301278, 0.2122638719723787, -0.02719660972816353, 0.1030344360257585, -0.21452085524719178, 0.035583425947159776, -0.22653246780920053, -0.11259780832988937, -0.20695314528381437, 0.063321568424023, -0.003899771478168956, -0.15857038441888927, 0.3895638697240658, 0.16217555208601245, 0.22827759439501316, -0.06890790356213555, 0.21753071831586232, 0.13922644084018163, 0.07285461778372933, 0.06339793646132902, 0.24468457428816737, 0.17006208025654698, 0.13068950310850344, -0.3209564127575825, 0.04362392250424987, 0.016796751345014748]
1,803.07508
Influence of the $Z-Z'$ mixing on the $Z'$ production cross section in the model-independent approach
The new module SMZp is developed for the Monte-Carlo generator Sherpa that extends simulations of the Standard model (SM) processes with the Abelian $Z'$ boson in the model-independent approach. The special derived earlier relations between the $Z'$ couplings to the SM fields proper to the renormalizable theories are taken into account. Using this module, dependence of the $Z'$ production cross section on the $Z-Z'$ mixing angle $\theta_0$ in the Drell-Yan process is investigated within the range of 1 TeV $\leq m_{Z'} \leq$ 5 TeV. It is shown that if it is essential to keep the $Z'$ theory renormalizable, $\theta_0$ cannot be neglected as it is often done, even if it is small.
hep-ph
the new module smzp is developed for the montecarlo generator sherpa that extends simulations of the standard model sm processes with the abelian z boson in the modelindependent approach the special derived earlier relations between the z couplings to the sm fields proper to the renormalizable theories are taken into account using this module dependence of the z production cross section on the zz mixing angle theta_0 in the drellyan process is investigated within the range of 1 tev leq m_z leq 5 tev it is shown that if it is essential to keep the z theory renormalizable theta_0 cannot be neglected as it is often done even if it is small
[['the', 'new', 'module', 'smzp', 'is', 'developed', 'for', 'the', 'montecarlo', 'generator', 'sherpa', 'that', 'extends', 'simulations', 'of', 'the', 'standard', 'model', 'sm', 'processes', 'with', 'the', 'abelian', 'z', 'boson', 'in', 'the', 'modelindependent', 'approach', 'the', 'special', 'derived', 'earlier', 'relations', 'between', 'the', 'z', 'couplings', 'to', 'the', 'sm', 'fields', 'proper', 'to', 'the', 'renormalizable', 'theories', 'are', 'taken', 'into', 'account', 'using', 'this', 'module', 'dependence', 'of', 'the', 'z', 'production', 'cross', 'section', 'on', 'the', 'zz', 'mixing', 'angle', 'theta_0', 'in', 'the', 'drellyan', 'process', 'is', 'investigated', 'within', 'the', 'range', 'of', '1', 'tev', 'leq', 'm_z', 'leq', '5', 'tev', 'it', 'is', 'shown', 'that', 'if', 'it', 'is', 'essential', 'to', 'keep', 'the', 'z', 'theory', 'renormalizable', 'theta_0', 'can', 'not', 'be', 'neglected', 'as', 'it', 'is', 'often', 'done', 'even', 'if', 'it', 'is', 'small']]
[-0.0852524173439763, 0.20535857500674734, -0.055341843948034306, 0.1539890206846946, -0.061319410210541846, -0.16777722472657583, -0.010027257631008979, 0.39227480246751967, -0.27842684738737133, -0.2538319503738811, 0.012124141568035287, -0.255383803103801, -0.028414522800760875, 0.1833176128379169, 0.048016718212498484, 0.01976360350298429, 0.04946690749784466, 0.010297395392886497, -0.027913732948945835, -0.28669201916116954, 0.267580580055697, 0.08032612246461213, 0.2022027779644954, 0.06128799962711388, 0.10444256460427173, 0.06419866109666016, -0.02914778361394253, -0.059540456194164496, -0.1528421936097532, 0.039377866974453876, 0.2080585821760386, 0.07457785871728058, 0.15787272818852216, -0.28957510066019104, -0.1601936043184001, 0.13533318782823958, 0.14741431828380364, 0.047748666984261945, -0.016869191956564982, -0.28617940417773624, 0.1537535844420615, -0.22527559671392997, -0.1045246501733865, -0.030032472221396996, 0.013101541092120377, -0.08022799709994745, -0.3247217702820698, 0.07287247441126965, 0.018401950800450453, 0.041887291384357796, 0.04818476661083488, -0.15364692543516867, -0.09414942288172565, 0.07112460467968569, 0.12005522879059884, 0.08663626313292687, 0.13718121321913454, -0.12944410293753858, -0.10957964964576863, 0.39777173130797955, -0.05780454779492824, -0.21238108425002014, 0.14774635026904953, -0.2079762825877489, -0.16224693943487573, 0.14141669543979724, 0.15059144093122864, 0.10942776395365529, -0.18511083998185182, 0.2581877862810091, -0.038907802040089985, 0.17840836320829112, 0.010523916768891337, -0.023059017756687745, 0.1672308201627207, 0.17267824169747265, -0.0008399941975117794, 0.003664739919518719, -0.07106226497022103, -0.06679496652213857, -0.4319445522601849, -0.11459681298375861, -0.09132340939582459, 0.06897825699304251, -0.07517093742561494, -0.07708505679615232, 0.30857080829446204, 0.1836509079980065, 0.22128304249677708, 0.03351280332676002, 0.2971303276717663, 0.1330474581492516, 0.12909045914420858, 0.04038518154993653, 0.3101752226575627, 0.1799609423822923, 0.07102554541363913, -0.1213788734998421, 0.017424613432792415, 0.08415529423759185]
1,803.07509
Workforce migration and its economic implications: A perspective from social media in China
The workforce remains the most basic element of social production, even in modern societies. Its migration, especially for developing economies such as China, plays a strong role in the reallocation of productive resources and offers a promising proxy for understanding socio-economic issues. Nevertheless, due to long cycle, expensive cost and coarse granularity, conventional surveys face challenges in comprehensively profiling it. With the permeation of smart and mobile devices in recent decades, booming social media has essentially broken spatio-temporal constraints and enabled the continuous sensing of the real-time mobility of massive numbers of individuals. In this study, we demonstrate that similar to a natural shock, the Spring Festival culturally drives workforce travel between workplaces and hometowns, and the trajectory footprints from social media therefore open a window with unparalleled richness and fine granularity to explore laws in national-level workforce migration. To understand the core driving forces of workforce migration flux between cities in China, various indicators reflecting the benefits and costs of migration are introduced into our prediction model. We find that urban GDP (gross domestic product) and travel time are two excellent indicators to help make predictions. Diverse migration patterns are then revealed by clustering the trajectories, which give important clues to help understand the different roles of Chinese cities in their own development and in regional economic development. These patterns are further explained as a joint effect of the subjective will to seek personal benefits and the capacity requirements of local labour markets. Our study implies that the non-negligible entanglement between social media and macroeconomic behaviours can be insightful for policymaking in social-economic issues.
cs.SI physics.soc-ph
the workforce remains the most basic element of social production even in modern societies its migration especially for developing economies such as china plays a strong role in the reallocation of productive resources and offers a promising proxy for understanding socioeconomic issues nevertheless due to long cycle expensive cost and coarse granularity conventional surveys face challenges in comprehensively profiling it with the permeation of smart and mobile devices in recent decades booming social media has essentially broken spatiotemporal constraints and enabled the continuous sensing of the realtime mobility of massive numbers of individuals in this study we demonstrate that similar to a natural shock the spring festival culturally drives workforce travel between workplaces and hometowns and the trajectory footprints from social media therefore open a window with unparalleled richness and fine granularity to explore laws in nationallevel workforce migration to understand the core driving forces of workforce migration flux between cities in china various indicators reflecting the benefits and costs of migration are introduced into our prediction model we find that urban gdp gross domestic product and travel time are two excellent indicators to help make predictions diverse migration patterns are then revealed by clustering the trajectories which give important clues to help understand the different roles of chinese cities in their own development and in regional economic development these patterns are further explained as a joint effect of the subjective will to seek personal benefits and the capacity requirements of local labour markets our study implies that the nonnegligible entanglement between social media and macroeconomic behaviours can be insightful for policymaking in socialeconomic issues
[['the', 'workforce', 'remains', 'the', 'most', 'basic', 'element', 'of', 'social', 'production', 'even', 'in', 'modern', 'societies', 'its', 'migration', 'especially', 'for', 'developing', 'economies', 'such', 'as', 'china', 'plays', 'a', 'strong', 'role', 'in', 'the', 'reallocation', 'of', 'productive', 'resources', 'and', 'offers', 'a', 'promising', 'proxy', 'for', 'understanding', 'socioeconomic', 'issues', 'nevertheless', 'due', 'to', 'long', 'cycle', 'expensive', 'cost', 'and', 'coarse', 'granularity', 'conventional', 'surveys', 'face', 'challenges', 'in', 'comprehensively', 'profiling', 'it', 'with', 'the', 'permeation', 'of', 'smart', 'and', 'mobile', 'devices', 'in', 'recent', 'decades', 'booming', 'social', 'media', 'has', 'essentially', 'broken', 'spatiotemporal', 'constraints', 'and', 'enabled', 'the', 'continuous', 'sensing', 'of', 'the', 'realtime', 'mobility', 'of', 'massive', 'numbers', 'of', 'individuals', 'in', 'this', 'study', 'we', 'demonstrate', 'that', 'similar', 'to', 'a', 'natural', 'shock', 'the', 'spring', 'festival', 'culturally', 'drives', 'workforce', 'travel', 'between', 'workplaces', 'and', 'hometowns', 'and', 'the', 'trajectory', 'footprints', 'from', 'social', 'media', 'therefore', 'open', 'a', 'window', 'with', 'unparalleled', 'richness', 'and', 'fine', 'granularity', 'to', 'explore', 'laws', 'in', 'nationallevel', 'workforce', 'migration', 'to', 'understand', 'the', 'core', 'driving', 'forces', 'of', 'workforce', 'migration', 'flux', 'between', 'cities', 'in', 'china', 'various', 'indicators', 'reflecting', 'the', 'benefits', 'and', 'costs', 'of', 'migration', 'are', 'introduced', 'into', 'our', 'prediction', 'model', 'we', 'find', 'that', 'urban', 'gdp', 'gross', 'domestic', 'product', 'and', 'travel', 'time', 'are', 'two', 'excellent', 'indicators', 'to', 'help', 'make', 'predictions', 'diverse', 'migration', 'patterns', 'are', 'then', 'revealed', 'by', 'clustering', 'the', 'trajectories', 'which', 'give', 'important', 'clues', 'to', 'help', 'understand', 'the', 'different', 'roles', 'of', 'chinese', 'cities', 'in', 'their', 'own', 'development', 'and', 'in', 'regional', 'economic', 'development', 'these', 'patterns', 'are', 'further', 'explained', 'as', 'a', 'joint', 'effect', 'of', 'the', 'subjective', 'will', 'to', 'seek', 'personal', 'benefits', 'and', 'the', 'capacity', 'requirements', 'of', 'local', 'labour', 'markets', 'our', 'study', 'implies', 'that', 'the', 'nonnegligible', 'entanglement', 'between', 'social', 'media', 'and', 'macroeconomic', 'behaviours', 'can', 'be', 'insightful', 'for', 'policymaking', 'in', 'socialeconomic', 'issues']]
[-0.11145815997700786, 0.11528542542935542, -0.07162565208602485, 0.11402504999599121, -0.10615580592453831, -0.12306504676048205, 0.07456905290436106, 0.38728787703615314, -0.28503906539035084, -0.3340233104364982, 0.09808050233712595, -0.2863953010196675, -0.18718363995452955, 0.18356880943394124, -0.11627986717020285, 0.012778715907710271, 0.06535235208301049, -0.031965837772619334, 0.050036226621310596, -0.24459090713007411, 0.2655507755698636, 0.09370251649382243, 0.3577128946280353, 0.11047143087039245, 0.05812417595424329, -0.03773957460169804, -0.09080525183158417, 0.01221514200299697, -0.08854778472920068, 0.18802842358478677, 0.34446247161348476, 0.18373974594375436, 0.38806611778882316, -0.5011484521072147, -0.21646759099687257, 0.07899673846989588, 0.13325744454511704, 0.02834498723254996, -0.03991664863929574, -0.28636750624919277, 0.018720674202426003, -0.21251857907353144, -0.13280071608534408, -0.07715377414045539, 0.07150197678310401, 0.035580669590799176, -0.21962271599749209, 0.06380056166562321, -0.024524880961497436, 0.11100067865951338, -0.05464516297221087, -0.07803381138990792, -0.03349442098087649, 0.26020386882009916, 0.11421734632326747, -0.04646569135739415, 0.17696804794887044, -0.17633545578562848, -0.13736535533735494, 0.427490155897894, 0.013528765439284298, -0.11793883555400721, 0.22619446990484338, -0.1421436383880956, -0.13824485436978065, 0.03946073041385356, 0.24203771827918177, 0.0010321107157066746, -0.17568724572412528, -0.01174411039957601, 0.021746190372889617, 0.14627968378514403, 0.06717307202974862, 0.04898118978093888, 0.23737209196606615, 0.23528504239852135, 0.09696879834991019, 0.06029155914812296, -0.02675176139762801, -0.14037517034196084, -0.16975119840178007, -0.16975346315247974, -0.0941578383636573, 0.04279277072165091, -0.12075622764016274, -0.1277316999138456, 0.3789682869764291, 0.16146190243615013, 0.14266410952034178, 0.018996694903240872, 0.2800766737884534, 0.0050791032199378845, 0.08613783105381957, 0.08107155267992672, 0.18361973809254056, 0.009706303646418987, 0.21688364052986903, -0.2083509317722242, 0.15071729604936784, -0.013236649498730055]
1,803.0751
Resonant intersubband polariton-LO phonon scattering in an optically pumped polaritonic device
We report experimental evidence of longitudinal optical (LO) phonon-intersubband polariton scattering processes under resonant injection of light. The scattering process is resonant with both the initial (upper polariton) and final (lower polariton) states and is induced by the interaction of confined electrons with longitudinal optical phonons. The system is optically pumped with a mid-IR laser tuned between 1094 cm-1 and 1134 cm-1 (lambda=9.14 um and lambda=8.82 um). The demonstration is provided for both GaAs/AlGaAs and InGaAs/AlInAs doped quantum well systems whose intersubband plasmon lies at lambda=10 um wavelength. In addition to elucidating the microscopic mechanism of the polariton-phonon scattering, that is found to differ substantially from the standard single particle electron-LO phonon scattering mechanism, this work constitutes the first step towards the hopefully forthcoming demonstration of an intersubband polariton laser.
cond-mat.mes-hall cond-mat.other
we report experimental evidence of longitudinal optical lo phononintersubband polariton scattering processes under resonant injection of light the scattering process is resonant with both the initial upper polariton and final lower polariton states and is induced by the interaction of confined electrons with longitudinal optical phonons the system is optically pumped with a midir laser tuned between 1094 cm1 and 1134 cm1 lambda914 um and lambda882 um the demonstration is provided for both gaasalgaas and ingaasalinas doped quantum well systems whose intersubband plasmon lies at lambda10 um wavelength in addition to elucidating the microscopic mechanism of the polaritonphonon scattering that is found to differ substantially from the standard single particle electronlo phonon scattering mechanism this work constitutes the first step towards the hopefully forthcoming demonstration of an intersubband polariton laser
[['we', 'report', 'experimental', 'evidence', 'of', 'longitudinal', 'optical', 'lo', 'phononintersubband', 'polariton', 'scattering', 'processes', 'under', 'resonant', 'injection', 'of', 'light', 'the', 'scattering', 'process', 'is', 'resonant', 'with', 'both', 'the', 'initial', 'upper', 'polariton', 'and', 'final', 'lower', 'polariton', 'states', 'and', 'is', 'induced', 'by', 'the', 'interaction', 'of', 'confined', 'electrons', 'with', 'longitudinal', 'optical', 'phonons', 'the', 'system', 'is', 'optically', 'pumped', 'with', 'a', 'midir', 'laser', 'tuned', 'between', '1094', 'cm1', 'and', '1134', 'cm1', 'lambda914', 'um', 'and', 'lambda882', 'um', 'the', 'demonstration', 'is', 'provided', 'for', 'both', 'gaasalgaas', 'and', 'ingaasalinas', 'doped', 'quantum', 'well', 'systems', 'whose', 'intersubband', 'plasmon', 'lies', 'at', 'lambda10', 'um', 'wavelength', 'in', 'addition', 'to', 'elucidating', 'the', 'microscopic', 'mechanism', 'of', 'the', 'polaritonphonon', 'scattering', 'that', 'is', 'found', 'to', 'differ', 'substantially', 'from', 'the', 'standard', 'single', 'particle', 'electronlo', 'phonon', 'scattering', 'mechanism', 'this', 'work', 'constitutes', 'the', 'first', 'step', 'towards', 'the', 'hopefully', 'forthcoming', 'demonstration', 'of', 'an', 'intersubband', 'polariton', 'laser']]
[-0.10335254580457146, 0.24365099895423312, -0.058081049890088755, -0.02059984628212128, -0.014325727671971471, -0.1528566560458656, 0.05047162017449516, 0.4390028951630935, -0.21694189713769188, -0.26836152028248417, -0.03764159958461285, -0.3175888404756139, -0.06998109735922492, 0.23335923887624252, 0.05620061406754514, 0.03995022363960743, 0.015825276593054372, -0.12430854952219492, 0.06849911727018537, -0.13642835329602085, 0.25878091480612286, 0.07886588435407406, 0.331454729734678, 0.1411189297337899, 0.10115587739933898, 0.03416471769409914, 0.06000038810939653, -0.14839413189365874, -0.13447790959783268, 0.10214944985121356, 0.27104741934087406, -0.09140836516409878, 0.2010414711012703, -0.4021424255003845, -0.17987818863814858, -0.003798891804877698, 0.1990065922315313, 0.18392799923372433, -0.04687901389029786, -0.2995872339774583, -0.021007748236366378, -0.07493964488632743, -0.1137089019340617, 0.0067385490057901955, 0.0013517939749606482, -0.029336884170477317, -0.24747722265200586, 0.06564715407664089, 0.057211070234417974, 0.07309246604701167, -0.10720124525040037, -0.09922774272006533, -0.08921279312903428, 0.02964656097139782, -0.025258414726200197, 0.04457287887279971, 0.21440366804086436, -0.10468590419004327, -0.12530608231744428, 0.37067029880557767, -0.12459742956002808, -0.03680890532738463, 0.18947765362030994, -0.19860155839751673, 0.04802618126978907, 0.20909218981451405, 0.12866512990343992, 0.0962213003993269, -0.12104046664303389, 0.05023913091831422, 0.0026572952633650286, 0.2231961853149545, 0.09482791440677829, 0.1700233386803829, 0.24452093009301645, 0.23851138842842123, -0.007137160544745683, 0.1268365927458572, -0.15126321991533406, -0.01388457937403967, -0.2907716529407194, -0.12144647163382959, -0.18269958281449564, 0.06962110503488697, -0.03074552193153411, -0.12273518932528618, 0.38062846509915754, 0.10210902950514243, 0.15683026376041018, 0.00025633406297369737, 0.31621317718706027, 0.19713216474441092, 0.03991106343932274, 0.018575040139551236, 0.35356402491021344, 0.15539134369510424, 0.11666408646118454, -0.312123903375867, -0.012910323906836546, -0.03435554783552973]
1,803.07511
Relative trace formula for compact quotient and pseudocoefficients for relative discrete series
We introduce the notion of relative pseudocoefficient for relative discrete series of real spherical homogeneous spaces of reductive groups. We prove that such relative pseudocoefficient does not exist for semisimple symmetric spaces of type G(C)/G(R) and construct strong relative pseudocoefficients for some hyperbolic spaces. We establish a toy model for the relative trace formula of H.Jacquet for compact discrete quotient {\Gamma}\G. This allows us to prove that a relative discrete series which admits strong pseudocoefficient with sufficiently small support occurs in the spectral decomposition of L^2({\Gamma}\G) with a nonzero period.
math.RT
we introduce the notion of relative pseudocoefficient for relative discrete series of real spherical homogeneous spaces of reductive groups we prove that such relative pseudocoefficient does not exist for semisimple symmetric spaces of type gcgr and construct strong relative pseudocoefficients for some hyperbolic spaces we establish a toy model for the relative trace formula of hjacquet for compact discrete quotient gammag this allows us to prove that a relative discrete series which admits strong pseudocoefficient with sufficiently small support occurs in the spectral decomposition of l2gammag with a nonzero period
[['we', 'introduce', 'the', 'notion', 'of', 'relative', 'pseudocoefficient', 'for', 'relative', 'discrete', 'series', 'of', 'real', 'spherical', 'homogeneous', 'spaces', 'of', 'reductive', 'groups', 'we', 'prove', 'that', 'such', 'relative', 'pseudocoefficient', 'does', 'not', 'exist', 'for', 'semisimple', 'symmetric', 'spaces', 'of', 'type', 'gcgr', 'and', 'construct', 'strong', 'relative', 'pseudocoefficients', 'for', 'some', 'hyperbolic', 'spaces', 'we', 'establish', 'a', 'toy', 'model', 'for', 'the', 'relative', 'trace', 'formula', 'of', 'hjacquet', 'for', 'compact', 'discrete', 'quotient', 'gammag', 'this', 'allows', 'us', 'to', 'prove', 'that', 'a', 'relative', 'discrete', 'series', 'which', 'admits', 'strong', 'pseudocoefficient', 'with', 'sufficiently', 'small', 'support', 'occurs', 'in', 'the', 'spectral', 'decomposition', 'of', 'l2gammag', 'with', 'a', 'nonzero', 'period']]
[-0.15351731109636269, 0.08856645049848433, -0.11822505034078126, 0.09418145125469557, -0.12151972902403481, -0.12693336379082723, -0.0018888692821151223, 0.3731731333095452, -0.29238568915418167, -0.19312201309735064, 0.08178072127154974, -0.17540007500240884, -0.12552151557100916, 0.20854266500368115, -0.13739165280552196, -0.043668300887548375, 0.05139242529323132, 0.0934876075801279, -0.12707809077297477, -0.21505669577464717, 0.39672697985266475, -0.0840512422587851, 0.2469688476138245, 0.04852704065798343, 0.13536536805973998, 0.02685852290998245, -0.05913789327498579, 0.020135846502822023, -0.16066401556282084, 0.1443800585499654, 0.24660381145946597, 0.06684772957694428, 0.2653999126425291, -0.3531609306904091, -0.1586606551561205, 0.25654086495225115, 0.10126627903784914, 0.02782188817435854, -0.02248525751711822, -0.25314086754859866, 0.14238473316440467, -0.21252766998763056, -0.1878991938897291, -0.12101920379389977, 0.08544766932897184, 0.045092758372019245, -0.2923899149982494, 0.06877991664705091, 0.09892253532999692, 0.0856923386775728, -0.0920601013583538, -0.04916425934596651, -0.02793617070459857, 0.0945388697216223, -0.013384894929537228, -0.005219707306977576, 0.025418216673036415, -0.014212498866856611, -0.08308711528628208, 0.3892374561521514, -0.12681013173370184, -0.21286098145205398, 0.17405805541951766, -0.18077323720897495, -0.17395104811494722, 0.12093043941790345, 0.14018537103059306, 0.16288670599888797, 0.02595942492072267, 0.1556861257473617, -0.11890582831833384, 0.11372751141925096, 0.09112556249802482, 0.0268353425025212, 0.12232806058814642, 0.06154180847204708, 0.13296324238662832, 0.14831874109590534, -0.03155522439602077, -0.06250069732041816, -0.3677466557329071, -0.20304919747186118, -0.13784471854310612, 0.1010138052490596, -0.1492086054070454, -0.2517189330009251, 0.3456527625007191, 0.03690803368929131, 0.17720813193925838, 0.14633396212359484, 0.17704277708270083, 0.08372354770852682, 0.027708219497594392, 0.062332094122452296, 0.14624903880590948, 0.22747693848849712, -0.011304325017350158, -0.1634083037852074, -0.013396975536156317, 0.16856777477452808]
1,803.07512
Fusion of stereo and still monocular depth estimates in a self-supervised learning context
We study how autonomous robots can learn by themselves to improve their depth estimation capability. In particular, we investigate a self-supervised learning setup in which stereo vision depth estimates serve as targets for a convolutional neural network (CNN) that transforms a single still image to a dense depth map. After training, the stereo and mono estimates are fused with a novel fusion method that preserves high confidence stereo estimates, while leveraging the CNN estimates in the low-confidence regions. The main contribution of the article is that it is shown that the fused estimates lead to a higher performance than the stereo vision estimates alone. Experiments are performed on the KITTI dataset, and on board of a Parrot SLAMDunk, showing that even rather limited CNNs can help provide stereo vision equipped robots with more reliable depth maps for autonomous navigation.
cs.CV cs.RO
we study how autonomous robots can learn by themselves to improve their depth estimation capability in particular we investigate a selfsupervised learning setup in which stereo vision depth estimates serve as targets for a convolutional neural network cnn that transforms a single still image to a dense depth map after training the stereo and mono estimates are fused with a novel fusion method that preserves high confidence stereo estimates while leveraging the cnn estimates in the lowconfidence regions the main contribution of the article is that it is shown that the fused estimates lead to a higher performance than the stereo vision estimates alone experiments are performed on the kitti dataset and on board of a parrot slamdunk showing that even rather limited cnns can help provide stereo vision equipped robots with more reliable depth maps for autonomous navigation
[['we', 'study', 'how', 'autonomous', 'robots', 'can', 'learn', 'by', 'themselves', 'to', 'improve', 'their', 'depth', 'estimation', 'capability', 'in', 'particular', 'we', 'investigate', 'a', 'selfsupervised', 'learning', 'setup', 'in', 'which', 'stereo', 'vision', 'depth', 'estimates', 'serve', 'as', 'targets', 'for', 'a', 'convolutional', 'neural', 'network', 'cnn', 'that', 'transforms', 'a', 'single', 'still', 'image', 'to', 'a', 'dense', 'depth', 'map', 'after', 'training', 'the', 'stereo', 'and', 'mono', 'estimates', 'are', 'fused', 'with', 'a', 'novel', 'fusion', 'method', 'that', 'preserves', 'high', 'confidence', 'stereo', 'estimates', 'while', 'leveraging', 'the', 'cnn', 'estimates', 'in', 'the', 'lowconfidence', 'regions', 'the', 'main', 'contribution', 'of', 'the', 'article', 'is', 'that', 'it', 'is', 'shown', 'that', 'the', 'fused', 'estimates', 'lead', 'to', 'a', 'higher', 'performance', 'than', 'the', 'stereo', 'vision', 'estimates', 'alone', 'experiments', 'are', 'performed', 'on', 'the', 'kitti', 'dataset', 'and', 'on', 'board', 'of', 'a', 'parrot', 'slamdunk', 'showing', 'that', 'even', 'rather', 'limited', 'cnns', 'can', 'help', 'provide', 'stereo', 'vision', 'equipped', 'robots', 'with', 'more', 'reliable', 'depth', 'maps', 'for', 'autonomous', 'navigation']]
[-0.034935505002858525, 0.04601145131122051, -0.08453538589199762, 0.06452295605677004, -0.10651792998871078, -0.1831816470324723, -0.006068993258573439, 0.4866995229723229, -0.24075655710370536, -0.35069033104683395, 0.1010281462905645, -0.2733244069959914, -0.1949720375806741, 0.24843166510749987, -0.19986128365027084, 0.1035891662189818, 0.22394084663170835, 0.04311508641673582, -0.09276339419496556, -0.24920310035931703, 0.24021026491443964, 0.06500874609564958, 0.30906761846626585, -0.009232067314071068, 0.1449968775909772, -0.018047123857220446, -0.019524958448660007, 0.0014713526141586835, -0.07218985494013844, 0.21306126439257228, 0.2856532955083294, 0.16935718992212112, 0.28035718879486987, -0.44386689321718353, -0.22356570062591977, 0.08150913577064521, 0.15088115323780346, 0.035770290967353714, -0.0460476699067774, -0.3865039015553244, 0.09588138264792877, -0.13449360440363703, -0.00524806484674522, -0.12368292901901178, -0.04168779241676996, -0.0003515590860447644, -0.3132810254954139, 0.00039459887615310544, 0.06137872208247258, 0.0766127887789322, -0.08509125900994716, -0.05296059152232888, -0.002000174876572429, 0.21111660732455767, -0.040609251906879355, 0.08137986822343984, 0.1552331460390132, -0.25392875594653835, -0.0829253930369041, 0.34786312189796753, -0.05604611188006685, -0.18838755216827427, 0.2149742068655357, -0.05696322644412841, -0.14858147748273567, 0.10932122966598558, 0.23549961848344747, 0.0990495974521922, -0.1584607472953697, -0.010787914072642561, -0.0800678513849667, 0.18207442337154425, 0.0610811896537822, -0.015611197627351983, 0.1674095298808095, 0.2587754447536165, 0.1300649593712465, 0.10773722330897885, -0.19971830354315107, -0.007566848623843027, -0.2100448620816072, -0.10125401310548457, -0.18850495179008314, -0.06498471209509434, -0.09173693053531494, -0.10571967930719847, 0.3710253449575301, 0.26895935450802033, 0.2531670634103332, 0.1093385689090465, 0.4011476810184726, 0.03719164849388872, 0.13049114295416445, 0.08351117193165734, 0.23659542617911095, 0.03405128869032352, 0.1297000661590204, -0.12211566565193883, 0.0629459566173508, 0.11189657827312856]
1,803.07513
Robust Formation Control in SE(3) for Tree-Graph Structures with Prescribed Transient and Steady State Performance
This paper presents a novel control protocol for distance and orientation formation control of rigid bodies, whose sensing graph is a static and undirected tree, in the special Euclidean group SE(3). The proposed control laws are decentralized, in the sense that each agent uses only local relative information from its neighbors to calculate its control signal, as well as robust with respect to modeling (parametric and structural) uncertainties and external disturbances. The proposed methodology guarantees the satisfaction of inter-agent distance constraints that resemble collision avoidance and connectivity maintenance properties. Moreover, certain predefined functions characterize the transient and steady state performance of the closed loop system. Finally, simulation results verify the validity and efficiency of the proposed approach.
cs.SY
this paper presents a novel control protocol for distance and orientation formation control of rigid bodies whose sensing graph is a static and undirected tree in the special euclidean group se3 the proposed control laws are decentralized in the sense that each agent uses only local relative information from its neighbors to calculate its control signal as well as robust with respect to modeling parametric and structural uncertainties and external disturbances the proposed methodology guarantees the satisfaction of interagent distance constraints that resemble collision avoidance and connectivity maintenance properties moreover certain predefined functions characterize the transient and steady state performance of the closed loop system finally simulation results verify the validity and efficiency of the proposed approach
[['this', 'paper', 'presents', 'a', 'novel', 'control', 'protocol', 'for', 'distance', 'and', 'orientation', 'formation', 'control', 'of', 'rigid', 'bodies', 'whose', 'sensing', 'graph', 'is', 'a', 'static', 'and', 'undirected', 'tree', 'in', 'the', 'special', 'euclidean', 'group', 'se3', 'the', 'proposed', 'control', 'laws', 'are', 'decentralized', 'in', 'the', 'sense', 'that', 'each', 'agent', 'uses', 'only', 'local', 'relative', 'information', 'from', 'its', 'neighbors', 'to', 'calculate', 'its', 'control', 'signal', 'as', 'well', 'as', 'robust', 'with', 'respect', 'to', 'modeling', 'parametric', 'and', 'structural', 'uncertainties', 'and', 'external', 'disturbances', 'the', 'proposed', 'methodology', 'guarantees', 'the', 'satisfaction', 'of', 'interagent', 'distance', 'constraints', 'that', 'resemble', 'collision', 'avoidance', 'and', 'connectivity', 'maintenance', 'properties', 'moreover', 'certain', 'predefined', 'functions', 'characterize', 'the', 'transient', 'and', 'steady', 'state', 'performance', 'of', 'the', 'closed', 'loop', 'system', 'finally', 'simulation', 'results', 'verify', 'the', 'validity', 'and', 'efficiency', 'of', 'the', 'proposed', 'approach']]
[-0.1574165814757172, 0.025826886204732023, -0.07347099524007267, 0.024427179485941544, -0.10217707548449692, -0.14876176678360656, 0.07106105984650297, 0.4046912475162719, -0.3061774961777732, -0.3102122245472856, 0.10885334311602399, -0.2130946845202269, -0.16880489609693775, 0.14397823929977724, -0.12489248538572882, 0.11978088466860513, 0.07032026408208358, 0.08225402080167371, -0.03788109245495154, -0.1994740379027501, 0.2841790963967259, 0.06393110116497956, 0.322961529609389, 0.019474996054847527, 0.1323005373064333, 0.051002664981075585, -0.0056532190388275515, 0.05594464981506587, -0.12244436390457662, 0.11356674105179711, 0.23289519307227471, 0.16461652807859528, 0.2725757875113597, -0.4098781706351373, -0.2054468078745736, 0.10160428707479921, 0.10505774097903194, 0.06567337442762576, -0.034893115260041296, -0.3119776018608648, 0.11349141376857193, -0.18699522103923252, -0.12387111203538047, -0.06656092214676687, 0.0059582024422657285, 0.09068937598862964, -0.2766669033668362, 0.041161230148381404, 0.060082981790106, 0.04692870399588321, -0.1132224526308063, -0.046110324542690866, -0.04374655443203882, 0.17111884136525038, -0.006523083112377705, 0.013484782298517406, 0.2015107884270768, -0.10810324659125291, -0.17987540405359057, 0.38380060134740135, 0.022973321908070013, -0.21300448986809128, 0.2011012954908049, -0.08795461942577082, -0.11166669925252914, 0.09998784361817102, 0.22080777880823255, 0.10885713337801206, -0.19003700715704605, 0.06417548755615647, -0.011415386072988821, 0.14319152881701788, 0.036226545404802024, 0.05672053711759484, 0.12486403914861, 0.16799339478532982, 0.1627177889060834, 0.13842139991087854, -0.046831233548318855, -0.13943199992466432, -0.3013317137896919, -0.09514287738209097, -0.16051833488297865, -0.04368814415871524, -0.13760785761194275, -0.15999489943792897, 0.4022629728071137, 0.15652465150078648, 0.1643733428711565, 0.11960598779046255, 0.3584873344357181, 0.07117382657682347, 0.01313866562066743, 0.12192221369960496, 0.2321933511740122, 0.1507176619150445, 0.056242954693376444, -0.27170799164555204, 0.13433125635019988, 0.04584825403180419]
1,803.07514
Testing for Unobserved Heterogeneous Treatment Effects with Observational Data
Unobserved heterogeneous treatment effects have been emphasized in the recent policy evaluation literature (see e.g., Heckman and Vytlacil, 2005). This paper proposes a nonparametric test for unobserved heterogeneous treatment effects in a treatment effect model with a binary treatment assignment, allowing for individuals' self-selection to the treatment. Under the standard local average treatment effects assumptions, i.e., the no defiers condition, we derive testable model restrictions for the hypothesis of unobserved heterogeneous treatment effects. Also, we show that if the treatment outcomes satisfy a monotonicity assumption, these model restrictions are also sufficient. Then, we propose a modified Kolmogorov-Smirnov-type test which is consistent and simple to implement. Monte Carlo simulations show that our test performs well in finite samples. For illustration, we apply our test to study heterogeneous treatment effects of the Job Training Partnership Act on earnings and the impacts of fertility on family income, where the null hypothesis of homogeneous treatment effects gets rejected in the second case but fails to be rejected in the first application.
econ.EM
unobserved heterogeneous treatment effects have been emphasized in the recent policy evaluation literature see eg heckman and vytlacil 2005 this paper proposes a nonparametric test for unobserved heterogeneous treatment effects in a treatment effect model with a binary treatment assignment allowing for individuals selfselection to the treatment under the standard local average treatment effects assumptions ie the no defiers condition we derive testable model restrictions for the hypothesis of unobserved heterogeneous treatment effects also we show that if the treatment outcomes satisfy a monotonicity assumption these model restrictions are also sufficient then we propose a modified kolmogorovsmirnovtype test which is consistent and simple to implement monte carlo simulations show that our test performs well in finite samples for illustration we apply our test to study heterogeneous treatment effects of the job training partnership act on earnings and the impacts of fertility on family income where the null hypothesis of homogeneous treatment effects gets rejected in the second case but fails to be rejected in the first application
[['unobserved', 'heterogeneous', 'treatment', 'effects', 'have', 'been', 'emphasized', 'in', 'the', 'recent', 'policy', 'evaluation', 'literature', 'see', 'eg', 'heckman', 'and', 'vytlacil', '2005', 'this', 'paper', 'proposes', 'a', 'nonparametric', 'test', 'for', 'unobserved', 'heterogeneous', 'treatment', 'effects', 'in', 'a', 'treatment', 'effect', 'model', 'with', 'a', 'binary', 'treatment', 'assignment', 'allowing', 'for', 'individuals', 'selfselection', 'to', 'the', 'treatment', 'under', 'the', 'standard', 'local', 'average', 'treatment', 'effects', 'assumptions', 'ie', 'the', 'no', 'defiers', 'condition', 'we', 'derive', 'testable', 'model', 'restrictions', 'for', 'the', 'hypothesis', 'of', 'unobserved', 'heterogeneous', 'treatment', 'effects', 'also', 'we', 'show', 'that', 'if', 'the', 'treatment', 'outcomes', 'satisfy', 'a', 'monotonicity', 'assumption', 'these', 'model', 'restrictions', 'are', 'also', 'sufficient', 'then', 'we', 'propose', 'a', 'modified', 'kolmogorovsmirnovtype', 'test', 'which', 'is', 'consistent', 'and', 'simple', 'to', 'implement', 'monte', 'carlo', 'simulations', 'show', 'that', 'our', 'test', 'performs', 'well', 'in', 'finite', 'samples', 'for', 'illustration', 'we', 'apply', 'our', 'test', 'to', 'study', 'heterogeneous', 'treatment', 'effects', 'of', 'the', 'job', 'training', 'partnership', 'act', 'on', 'earnings', 'and', 'the', 'impacts', 'of', 'fertility', 'on', 'family', 'income', 'where', 'the', 'null', 'hypothesis', 'of', 'homogeneous', 'treatment', 'effects', 'gets', 'rejected', 'in', 'the', 'second', 'case', 'but', 'fails', 'to', 'be', 'rejected', 'in', 'the', 'first', 'application']]
[-0.0482118641040429, 0.07323481995386608, -0.11448757827959277, 0.13583098358869777, -0.12312682246450674, -0.17382201471958647, 0.11018878868710476, 0.3821568970935363, -0.17351039278772518, -0.3042877090615079, 0.08937018473816076, -0.2324223496640722, -0.1449473849300182, 0.15146004873977015, -0.08465449093685797, 0.026309098413383417, 0.10089500872982722, -0.0049779381349005485, -0.02726138818049521, -0.29690266367838236, 0.2845871856182136, 0.07281252749292462, 0.32254756087380826, 0.04509868162197315, 0.08236602624934732, 0.05118988351896405, -0.07392759266817435, 0.0536850671763673, -0.1325215279411306, 0.025513553537408976, 0.21560931368307634, 0.13840477436526932, 0.34855247302488845, -0.43654310388603446, -0.2516507383379521, 0.1404802687296813, 0.05409114933316948, 0.12389782311493587, -0.039197563845664266, -0.2544569120283775, 0.042046545141453284, -0.20887043387487983, -0.1238168633796952, -0.06302418421220148, -0.02657113330664508, -0.014424700833236178, -0.36753978287293154, 0.12704438149724437, 0.0631643816892227, 0.06855747005196683, -0.08763024796675327, -0.12961942406201904, 0.017799107943463958, 0.10359894610221752, 0.08965536041721475, -0.051780378977965676, 0.11649584004824812, -0.08536805857138736, -0.10713575985423769, 0.3826444865186755, -0.03207514424892989, -0.2554013317295661, 0.17613142932285414, -0.13404091476660335, -0.1903388227117389, 0.02834759920581498, 0.220184749991379, 0.11490938123950566, -0.18684308263049884, 0.04302684934139534, -0.04713446242226796, 0.11963650884078533, 0.026007752930463264, -0.026084295631329895, 0.14889933976739872, 0.15855440139544733, 0.019886020769957793, 0.12765286726467875, -0.07272928455336528, -0.10751127480303474, -0.33591267605679054, -0.12993005733146812, -0.10433761165336226, 0.040739226279159386, -0.04341642643919454, -0.19328129508278585, 0.3280433735725555, 0.21601190579751733, 0.13781753525025014, 0.10138238232201811, 0.2841813706313119, 0.06986004736126315, 0.035749330710281024, 0.054826465398637635, 0.18216782264185674, 0.06894504088118221, 0.002810122834687883, -0.21216160173150428, 0.18498150668826632, 0.00026357448007205896]
1,803.07515
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
The Harary-Hill conjecture states that for every $n>0$ the complete graph on $n$ vertices $K_n$, the minimum number of crossings over all its possible drawings equals \begin{align*} H(n) := \frac{1}{4}\Big\lfloor\frac{n}{2}\Big\rfloor\Big\lfloor\frac{n-1}{2}\Big\rfloor\Big\lfloor\frac{n-2}{2}\Big\rfloor\Big\lfloor\frac{n-3}{2}\Big\rfloor\text{.} \end{align*} So far, the lower bound of the conjecture could only be verified for arbitrary drawings of $K_n$ with $n\leq 12$. In recent years, progress has been made in verifying the conjecture for certain classes of drawings, for example $2$-page-book, $x$-monotone, $x$-bounded, shellable and bishellable drawings. Up to now, the class of bishellable drawings was the broadest class for which the Harary-Hill conjecture has been verified, as it contains all beforehand mentioned classes. In this work, we introduce the class of seq-shellable drawings and verify the Harary-Hill conjecture for this new class. We show that bishellability implies seq-shellability and exhibit a non-bishellable but seq-shellable drawing of $K_{11}$, therefore the class of seq-shellable drawings strictly contains the class of bishellable drawings.
cs.CG math.CO
the hararyhill conjecture states that for every n0 the complete graph on n vertices k_n the minimum number of crossings over all its possible drawings equals beginalign hn frac14biglfloorfracn2bigrfloorbiglfloorfracn12bigrfloorbiglfloorfracn22bigrfloorbiglfloorfracn32bigrfloortext endalign so far the lower bound of the conjecture could only be verified for arbitrary drawings of k_n with nleq 12 in recent years progress has been made in verifying the conjecture for certain classes of drawings for example 2pagebook xmonotone xbounded shellable and bishellable drawings up to now the class of bishellable drawings was the broadest class for which the hararyhill conjecture has been verified as it contains all beforehand mentioned classes in this work we introduce the class of seqshellable drawings and verify the hararyhill conjecture for this new class we show that bishellability implies seqshellability and exhibit a nonbishellable but seqshellable drawing of k_11 therefore the class of seqshellable drawings strictly contains the class of bishellable drawings
[['the', 'hararyhill', 'conjecture', 'states', 'that', 'for', 'every', 'n0', 'the', 'complete', 'graph', 'on', 'n', 'vertices', 'k_n', 'the', 'minimum', 'number', 'of', 'crossings', 'over', 'all', 'its', 'possible', 'drawings', 'equals', 'beginalign', 'hn', 'frac14biglfloorfracn2bigrfloorbiglfloorfracn12bigrfloorbiglfloorfracn22bigrfloorbiglfloorfracn32bigrfloortext', 'endalign', 'so', 'far', 'the', 'lower', 'bound', 'of', 'the', 'conjecture', 'could', 'only', 'be', 'verified', 'for', 'arbitrary', 'drawings', 'of', 'k_n', 'with', 'nleq', '12', 'in', 'recent', 'years', 'progress', 'has', 'been', 'made', 'in', 'verifying', 'the', 'conjecture', 'for', 'certain', 'classes', 'of', 'drawings', 'for', 'example', '2pagebook', 'xmonotone', 'xbounded', 'shellable', 'and', 'bishellable', 'drawings', 'up', 'to', 'now', 'the', 'class', 'of', 'bishellable', 'drawings', 'was', 'the', 'broadest', 'class', 'for', 'which', 'the', 'hararyhill', 'conjecture', 'has', 'been', 'verified', 'as', 'it', 'contains', 'all', 'beforehand', 'mentioned', 'classes', 'in', 'this', 'work', 'we', 'introduce', 'the', 'class', 'of', 'seqshellable', 'drawings', 'and', 'verify', 'the', 'hararyhill', 'conjecture', 'for', 'this', 'new', 'class', 'we', 'show', 'that', 'bishellability', 'implies', 'seqshellability', 'and', 'exhibit', 'a', 'nonbishellable', 'but', 'seqshellable', 'drawing', 'of', 'k_11', 'therefore', 'the', 'class', 'of', 'seqshellable', 'drawings', 'strictly', 'contains', 'the', 'class', 'of', 'bishellable', 'drawings']]
[-0.16482542493193048, 0.08817209916742286, -0.006768637091024882, 0.03650649302451509, -0.06287387847098419, -0.14725704092739356, 0.011906655375949211, 0.3800958784397355, -0.18694010797642274, -0.3389827270422959, 0.0968750391079488, -0.30858365245027625, -0.13412486026289924, 0.20106694649439305, -0.13348068656503326, 0.07294090398055333, 0.10152165343283236, 0.03407132691871892, 0.005196981430748969, -0.3092049838089426, 0.2560326323469376, -0.08364724336166142, 0.19481487265147734, 0.1098343323780379, 0.0591315357709795, -0.009268915823971232, 0.05202201478661866, 0.06311865342377132, -0.19148072213334266, 0.10525165977297649, 0.24084639350702572, 0.201531366943123, 0.25630845139837927, -0.3460909697999644, -0.15901779844716657, 0.20280260880503598, 0.12092346084439971, 0.0608233046473793, -0.013222805092583358, -0.21988236700417474, 0.11445189810021678, -0.08060597826261073, -0.16027958065872858, -0.006406214714742318, 0.11032832503163566, -0.04001658372807368, -0.223746577701402, -0.040232924624837726, 0.13439743423401118, 0.07838598636185957, 0.03272989516537766, -0.17154909560607243, -0.048942583412604615, 0.12426350898102909, -0.013882137789753161, 0.06614084238309362, -0.06594152363484479, -0.10293238187336505, -0.15160839050076902, 0.34723934369523907, 0.033351804259129696, -0.1291100821221739, 0.08525672332163797, -0.1873408392259282, -0.2623648862677833, 0.15764915265754098, 0.07659052344064952, 0.19011174244224094, -0.05516226570923916, 0.11461759199422279, -0.2070578124807475, 0.09263444840002598, 0.18197644233522522, 0.00019836616896403333, 0.15284388500084686, 0.09401340936892666, 0.09572368282048653, 0.18106615967715495, 0.0038290950421166294, 0.008329057478476898, -0.30224034597631544, -0.18297993333423315, -0.18679690363933332, 0.084323115595099, -0.0585990540919536, -0.18963693207802457, 0.40471453940133667, 0.11484682101420024, 0.1472418850624106, 0.17753813672283691, 0.16869171474698103, 0.052262649456679355, 0.05583623284150639, 0.14291397304946762, 0.18367052858229727, 0.143840997117675, -0.0069954125930154175, -0.09568229292765157, 0.08589408321050643, 0.1297780459766121]
1,803.07516
Hydrogen-regulated chiral nanoplasmonics
Chirality is a highly important topic in modern chemistry, given the dramatically different pharmacological effects that enantiomers can have on the body. Chirality of natural molecules can be controlled by reconfiguration of molecular structures through external stimuli. Despite the rapid progress in plasmonics, active regulation of plasmonic chirality, particularly in the visible spectral range, still faces significant challenges. In this Letter, we demonstrate a new class of hybrid plasmonic metamolecules composed of magnesium and gold nanoparticles. The plasmonic chirality from such plasmonic metamolecules can be dynamically controlled by hydrogen in real time without introducing macroscopic structural reconfiguration. We experimentally investigate the switching dynamics of the hydrogen-regulated chiroptical response in the visible spectral range using circular dichroism spectroscopy. In addition, energy dispersive X-ray spectroscopy is used to examine the morphology changes of the magnesium particles through hydrogenation and dehydrogenation processes. Our study can enable plasmonic chiral platforms for a variety of gas detection schemes by exploiting the high sensitivity of circular dichroism spectroscopy.
physics.optics physics.app-ph
chirality is a highly important topic in modern chemistry given the dramatically different pharmacological effects that enantiomers can have on the body chirality of natural molecules can be controlled by reconfiguration of molecular structures through external stimuli despite the rapid progress in plasmonics active regulation of plasmonic chirality particularly in the visible spectral range still faces significant challenges in this letter we demonstrate a new class of hybrid plasmonic metamolecules composed of magnesium and gold nanoparticles the plasmonic chirality from such plasmonic metamolecules can be dynamically controlled by hydrogen in real time without introducing macroscopic structural reconfiguration we experimentally investigate the switching dynamics of the hydrogenregulated chiroptical response in the visible spectral range using circular dichroism spectroscopy in addition energy dispersive xray spectroscopy is used to examine the morphology changes of the magnesium particles through hydrogenation and dehydrogenation processes our study can enable plasmonic chiral platforms for a variety of gas detection schemes by exploiting the high sensitivity of circular dichroism spectroscopy
[['chirality', 'is', 'a', 'highly', 'important', 'topic', 'in', 'modern', 'chemistry', 'given', 'the', 'dramatically', 'different', 'pharmacological', 'effects', 'that', 'enantiomers', 'can', 'have', 'on', 'the', 'body', 'chirality', 'of', 'natural', 'molecules', 'can', 'be', 'controlled', 'by', 'reconfiguration', 'of', 'molecular', 'structures', 'through', 'external', 'stimuli', 'despite', 'the', 'rapid', 'progress', 'in', 'plasmonics', 'active', 'regulation', 'of', 'plasmonic', 'chirality', 'particularly', 'in', 'the', 'visible', 'spectral', 'range', 'still', 'faces', 'significant', 'challenges', 'in', 'this', 'letter', 'we', 'demonstrate', 'a', 'new', 'class', 'of', 'hybrid', 'plasmonic', 'metamolecules', 'composed', 'of', 'magnesium', 'and', 'gold', 'nanoparticles', 'the', 'plasmonic', 'chirality', 'from', 'such', 'plasmonic', 'metamolecules', 'can', 'be', 'dynamically', 'controlled', 'by', 'hydrogen', 'in', 'real', 'time', 'without', 'introducing', 'macroscopic', 'structural', 'reconfiguration', 'we', 'experimentally', 'investigate', 'the', 'switching', 'dynamics', 'of', 'the', 'hydrogenregulated', 'chiroptical', 'response', 'in', 'the', 'visible', 'spectral', 'range', 'using', 'circular', 'dichroism', 'spectroscopy', 'in', 'addition', 'energy', 'dispersive', 'xray', 'spectroscopy', 'is', 'used', 'to', 'examine', 'the', 'morphology', 'changes', 'of', 'the', 'magnesium', 'particles', 'through', 'hydrogenation', 'and', 'dehydrogenation', 'processes', 'our', 'study', 'can', 'enable', 'plasmonic', 'chiral', 'platforms', 'for', 'a', 'variety', 'of', 'gas', 'detection', 'schemes', 'by', 'exploiting', 'the', 'high', 'sensitivity', 'of', 'circular', 'dichroism', 'spectroscopy']]
[-0.13374120011449914, 0.18503424510799393, -0.025834780680999068, -0.03238642529525898, -0.06273942696428077, -0.11240474206702032, 0.03072247413125884, 0.4936470860002204, -0.2853984722537885, -0.3336169144705586, 0.01941767132693543, -0.2381422161609108, -0.20530631260148116, 0.18047345858009428, -0.022964091497178405, 0.05815605772948413, 0.01939029247147141, -0.0993189429199057, 0.0028623103587859257, -0.12108960294928287, 0.24631663784529342, 0.04924260218402151, 0.3042420875454634, 0.11121306683208725, 0.03806428507065129, 0.005044227181095051, 0.03901425522740537, 0.0006011297090430252, -0.07996463408189868, 0.1474094280918575, 0.2813314199664555, 0.012648898792910094, 0.24333182970489958, -0.5031506778059168, -0.2495370556930115, 0.058136774400561496, 0.1779695574110316, 0.1201167433459011, -0.1328585888844805, -0.26786304721088144, 0.046288609600868884, -0.11756249300424032, -0.13163887521668527, -0.09944162872816603, -0.014949794999694, 0.0436986527819279, -0.19998991904781716, 0.03159725301760185, 0.009280159812050392, 0.11518838826960288, -0.06611015274253043, -0.05676076651741722, -0.032035738534889883, 0.07395618148610829, -0.0038155741058290005, -0.062263124456096976, 0.25089333424350446, -0.15059912539960713, -0.1505701152914383, 0.4069216008535268, -0.08221590501742194, -0.1279398685000166, 0.20772284260945198, -0.17454513736497262, -0.09443965665012691, 0.1770635016959577, 0.1864038051759697, 0.1581522805431152, -0.16844867088583224, 0.04992909846402219, -0.009470344561597576, 0.20731042430415078, 0.11520512646457516, 0.11454490640472552, 0.2879034232938234, 0.22614032678271395, -0.0004977811061378036, 0.15737875161717085, -0.11486506042134317, -0.009894748114234542, -0.17754252215049096, -0.15453819665726656, -0.18198915903011095, 0.032614659887495574, -0.08333701431814158, -0.14174630284390372, 0.4099614285308613, 0.1194829010514554, 0.14078215999175905, -0.08000933950047821, 0.3014134892966795, 0.05657595163500457, 0.10703025439823544, -0.04942508301298533, 0.29801993189894405, 0.14850525904348502, 0.10648700382606768, -0.32522072294663334, 0.09567094755648947, -0.05787020119309125]
1,803.07517
Explanation Methods in Deep Learning: Users, Values, Concerns and Challenges
Issues regarding explainable AI involve four components: users, laws & regulations, explanations and algorithms. Together these components provide a context in which explanation methods can be evaluated regarding their adequacy. The goal of this chapter is to bridge the gap between expert users and lay users. Different kinds of users are identified and their concerns revealed, relevant statements from the General Data Protection Regulation are analyzed in the context of Deep Neural Networks (DNNs), a taxonomy for the classification of existing explanation methods is introduced, and finally, the various classes of explanation methods are analyzed to verify if user concerns are justified. Overall, it is clear that (visual) explanations can be given about various aspects of the influence of the input on the output. However, it is noted that explanation methods or interfaces for lay users are missing and we speculate which criteria these methods / interfaces should satisfy. Finally it is noted that two important concerns are difficult to address with explanation methods: the concern about bias in datasets that leads to biased DNNs, as well as the suspicion about unfair outcomes.
cs.AI cs.LG stat.ML
issues regarding explainable ai involve four components users laws regulations explanations and algorithms together these components provide a context in which explanation methods can be evaluated regarding their adequacy the goal of this chapter is to bridge the gap between expert users and lay users different kinds of users are identified and their concerns revealed relevant statements from the general data protection regulation are analyzed in the context of deep neural networks dnns a taxonomy for the classification of existing explanation methods is introduced and finally the various classes of explanation methods are analyzed to verify if user concerns are justified overall it is clear that visual explanations can be given about various aspects of the influence of the input on the output however it is noted that explanation methods or interfaces for lay users are missing and we speculate which criteria these methods interfaces should satisfy finally it is noted that two important concerns are difficult to address with explanation methods the concern about bias in datasets that leads to biased dnns as well as the suspicion about unfair outcomes
[['issues', 'regarding', 'explainable', 'ai', 'involve', 'four', 'components', 'users', 'laws', 'regulations', 'explanations', 'and', 'algorithms', 'together', 'these', 'components', 'provide', 'a', 'context', 'in', 'which', 'explanation', 'methods', 'can', 'be', 'evaluated', 'regarding', 'their', 'adequacy', 'the', 'goal', 'of', 'this', 'chapter', 'is', 'to', 'bridge', 'the', 'gap', 'between', 'expert', 'users', 'and', 'lay', 'users', 'different', 'kinds', 'of', 'users', 'are', 'identified', 'and', 'their', 'concerns', 'revealed', 'relevant', 'statements', 'from', 'the', 'general', 'data', 'protection', 'regulation', 'are', 'analyzed', 'in', 'the', 'context', 'of', 'deep', 'neural', 'networks', 'dnns', 'a', 'taxonomy', 'for', 'the', 'classification', 'of', 'existing', 'explanation', 'methods', 'is', 'introduced', 'and', 'finally', 'the', 'various', 'classes', 'of', 'explanation', 'methods', 'are', 'analyzed', 'to', 'verify', 'if', 'user', 'concerns', 'are', 'justified', 'overall', 'it', 'is', 'clear', 'that', 'visual', 'explanations', 'can', 'be', 'given', 'about', 'various', 'aspects', 'of', 'the', 'influence', 'of', 'the', 'input', 'on', 'the', 'output', 'however', 'it', 'is', 'noted', 'that', 'explanation', 'methods', 'or', 'interfaces', 'for', 'lay', 'users', 'are', 'missing', 'and', 'we', 'speculate', 'which', 'criteria', 'these', 'methods', 'interfaces', 'should', 'satisfy', 'finally', 'it', 'is', 'noted', 'that', 'two', 'important', 'concerns', 'are', 'difficult', 'to', 'address', 'with', 'explanation', 'methods', 'the', 'concern', 'about', 'bias', 'in', 'datasets', 'that', 'leads', 'to', 'biased', 'dnns', 'as', 'well', 'as', 'the', 'suspicion', 'about', 'unfair', 'outcomes']]
[-0.10789980980675688, 0.014083013649211775, -0.07123511561413826, 0.16434488352902688, -0.12467323800096114, -0.20095280449302322, 0.06494293854641342, 0.425123150712548, -0.23161021365449014, -0.35744832670161736, 0.10819615759482885, -0.27896794648738116, -0.19989791429969508, 0.20654080087030874, -0.1339341523717492, 0.04761104331511325, 0.07712203271890275, 0.017149084815093012, -0.022734082998574108, -0.29384425981227535, 0.3270395934705247, 0.036512617308495934, 0.30911281763045995, 0.08957345486304708, 0.049683333974645486, -0.07415777280700306, -0.09733485756056044, 0.029464437729210813, -0.09234273255733871, 0.14744627934196214, 0.3415970956567078, 0.20913696268223514, 0.322827424774286, -0.42045102427965697, -0.21006292686669042, 0.07679662606498813, 0.13856275019992287, 0.09931390490892629, -0.00045370891833683034, -0.29462169154253864, 0.1283485876751333, -0.1534421339178283, -0.08016938286015342, -0.12077225056780472, 0.005533317266062972, 0.03358664818156963, -0.22462175982021496, 0.040264850425744916, 0.1020275281738356, 0.09395174617179314, -0.06752254495664772, -0.16526598644054377, 0.02772118367553169, 0.190970804088219, 0.13947788355691945, -0.047160546117827544, 0.12177977704273238, -0.15259463865006373, -0.17315105247975054, 0.38280728671349873, 0.05335455339656659, -0.18696386801871312, 0.22708939807489514, -0.050383403534532745, -0.14719753015017167, 0.044124498444632496, 0.16606529467631112, 0.05431550786604086, -0.1806615223819956, -0.0083559959479196, -0.01913978573377373, 0.15607480653330108, 0.06792863507726801, 0.05687205892381675, 0.26388344236582684, 0.17726295665729772, 0.019101815230585507, 0.07632856892077097, -0.011143799173196736, -0.09775433026303058, -0.2646708053778548, -0.1305697131824798, -0.11719525255888665, 0.0017471149105846224, -0.03882076708786125, -0.10292706637030971, 0.3649224833243151, 0.23474695275213509, 0.19246584670978356, 0.016916814703977982, 0.31302318330571177, 0.08922999228597799, 0.0812680005802873, 0.06220191820828213, 0.21242614536165408, 0.08282253904607743, 0.10996089305070059, -0.1301347915487086, 0.16168867750607885, -0.004728598700249722]
1,803.07518
Hidden strongly interacting massive particles
We consider dark matter as Strongly Interacting Massive Particles (SIMPs) in a hidden sector, thermally decoupled from the Standard Model heat bath. Due to its strong interactions, the number-changing processes of the SIMP lead to its thermalization at temperature $T_{\rm{D}}$ different from the visible sector temperature $T$, and subsequent decoupling as the Universe expands. We study the evolution of the dark SIMP abundance in detail and find that a hidden SIMP provides for a consistent framework for self-interacting dark matter. Thermalization and decoupling of a composite SIMP can be treated within the domain of validity of chiral perturbation theory unlike the simplest realizations of the SIMP, where the SIMP is in thermal equilibrium with the Standard Model.
hep-ph
we consider dark matter as strongly interacting massive particles simps in a hidden sector thermally decoupled from the standard model heat bath due to its strong interactions the numberchanging processes of the simp lead to its thermalization at temperature t_rmd different from the visible sector temperature t and subsequent decoupling as the universe expands we study the evolution of the dark simp abundance in detail and find that a hidden simp provides for a consistent framework for selfinteracting dark matter thermalization and decoupling of a composite simp can be treated within the domain of validity of chiral perturbation theory unlike the simplest realizations of the simp where the simp is in thermal equilibrium with the standard model
[['we', 'consider', 'dark', 'matter', 'as', 'strongly', 'interacting', 'massive', 'particles', 'simps', 'in', 'a', 'hidden', 'sector', 'thermally', 'decoupled', 'from', 'the', 'standard', 'model', 'heat', 'bath', 'due', 'to', 'its', 'strong', 'interactions', 'the', 'numberchanging', 'processes', 'of', 'the', 'simp', 'lead', 'to', 'its', 'thermalization', 'at', 'temperature', 't_rmd', 'different', 'from', 'the', 'visible', 'sector', 'temperature', 't', 'and', 'subsequent', 'decoupling', 'as', 'the', 'universe', 'expands', 'we', 'study', 'the', 'evolution', 'of', 'the', 'dark', 'simp', 'abundance', 'in', 'detail', 'and', 'find', 'that', 'a', 'hidden', 'simp', 'provides', 'for', 'a', 'consistent', 'framework', 'for', 'selfinteracting', 'dark', 'matter', 'thermalization', 'and', 'decoupling', 'of', 'a', 'composite', 'simp', 'can', 'be', 'treated', 'within', 'the', 'domain', 'of', 'validity', 'of', 'chiral', 'perturbation', 'theory', 'unlike', 'the', 'simplest', 'realizations', 'of', 'the', 'simp', 'where', 'the', 'simp', 'is', 'in', 'thermal', 'equilibrium', 'with', 'the', 'standard', 'model']]
[-0.09962678670678449, 0.2364910073931618, -0.13186059942607495, 0.09041340155065349, -0.049479301768989334, -0.12575289932208072, 0.0003858952058463133, 0.2805241847908574, -0.23744076301729114, -0.30114757312975565, 0.05040561528735923, -0.26365851142026225, -0.028721524510885877, 0.08625380386164862, 0.058283888209001, -0.015564125330299782, -0.012373516712927838, 0.049236669044556286, -0.0050664012729800464, -0.21036875426592627, 0.2850514605866167, 0.03490831489787148, 0.2004654272981309, 0.041322222095914185, 0.05871088939301412, 0.028051772556299794, -0.010941951840730577, -0.04369510899715383, -0.11731854190174058, 0.027206000498624455, 0.1500753530477784, 0.05031872104757048, 0.1691255184825799, -0.4314800275264886, -0.2790861573664407, 0.16433053079526871, 0.1654808192899258, 0.1134355304248888, -0.08910451943139096, -0.29594870337188756, 0.023970016818252747, -0.18801181957703725, -0.15466627836677022, -0.04890212596089033, -0.05182233056181978, -0.06558167158650106, -0.2733260060034307, 0.19222672235477586, 0.010558055549185595, -0.052036365999936544, -0.05809613019589271, -0.08957319727352146, -0.058546779814762355, -0.008811979887782243, 0.09563553261325759, -0.032449811064750596, 0.20999920401112016, -0.23126093299802522, -0.056774988216508566, 0.44268177327667846, -0.20869398799901506, -0.11088464138547666, 0.2587869302931659, -0.08104935311712325, -0.1502897097761261, 0.12352172140602087, 0.14755470974115928, 0.14049976739374087, -0.19842957834520475, 0.15766438664838367, -0.033580342271557914, 0.16738676697975186, -0.0020883583909318106, 0.07080323092543103, 0.33096052506729834, 0.24839579675884532, 0.024758918981613785, 0.11397439026260489, -0.06545193010443372, -0.1843034522126204, -0.3631208207747289, -0.15143271432868366, -0.13385257441229348, 0.010213042513049882, -0.09501538169934065, -0.13417863299476046, 0.35966983534684727, 0.17168278069283557, 0.1864058433225025, 0.012089233112858673, 0.28884351476705794, 0.07722623324912876, 0.01959079107398103, 0.04101987649558176, 0.3063204549092414, 0.17851329137217894, 0.10482457071414282, -0.2697787033072833, -0.014875715823266012, -0.021969579706161188]
1,803.07519
DeepGauge: Multi-Granularity Testing Criteria for Deep Learning Systems
Deep learning (DL) defines a new data-driven programming paradigm that constructs the internal system logic of a crafted neuron network through a set of training data. We have seen wide adoption of DL in many safety-critical scenarios. However, a plethora of studies have shown that the state-of-the-art DL systems suffer from various vulnerabilities which can lead to severe consequences when applied to real-world applications. Currently, the testing adequacy of a DL system is usually measured by the accuracy of test data. Considering the limitation of accessible high quality test data, good accuracy performance on test data can hardly provide confidence to the testing adequacy and generality of DL systems. Unlike traditional software systems that have clear and controllable logic and functionality, the lack of interpretability in a DL system makes system analysis and defect detection difficult, which could potentially hinder its real-world deployment. In this paper, we propose DeepGauge, a set of multi-granularity testing criteria for DL systems, which aims at rendering a multi-faceted portrayal of the testbed. The in-depth evaluation of our proposed testing criteria is demonstrated on two well-known datasets, five DL systems, and with four state-of-the-art adversarial attack techniques against DL. The potential usefulness of DeepGauge sheds light on the construction of more generic and robust DL systems.
cs.SE cs.CR cs.LG stat.ML
deep learning dl defines a new datadriven programming paradigm that constructs the internal system logic of a crafted neuron network through a set of training data we have seen wide adoption of dl in many safetycritical scenarios however a plethora of studies have shown that the stateoftheart dl systems suffer from various vulnerabilities which can lead to severe consequences when applied to realworld applications currently the testing adequacy of a dl system is usually measured by the accuracy of test data considering the limitation of accessible high quality test data good accuracy performance on test data can hardly provide confidence to the testing adequacy and generality of dl systems unlike traditional software systems that have clear and controllable logic and functionality the lack of interpretability in a dl system makes system analysis and defect detection difficult which could potentially hinder its realworld deployment in this paper we propose deepgauge a set of multigranularity testing criteria for dl systems which aims at rendering a multifaceted portrayal of the testbed the indepth evaluation of our proposed testing criteria is demonstrated on two wellknown datasets five dl systems and with four stateoftheart adversarial attack techniques against dl the potential usefulness of deepgauge sheds light on the construction of more generic and robust dl systems
[['deep', 'learning', 'dl', 'defines', 'a', 'new', 'datadriven', 'programming', 'paradigm', 'that', 'constructs', 'the', 'internal', 'system', 'logic', 'of', 'a', 'crafted', 'neuron', 'network', 'through', 'a', 'set', 'of', 'training', 'data', 'we', 'have', 'seen', 'wide', 'adoption', 'of', 'dl', 'in', 'many', 'safetycritical', 'scenarios', 'however', 'a', 'plethora', 'of', 'studies', 'have', 'shown', 'that', 'the', 'stateoftheart', 'dl', 'systems', 'suffer', 'from', 'various', 'vulnerabilities', 'which', 'can', 'lead', 'to', 'severe', 'consequences', 'when', 'applied', 'to', 'realworld', 'applications', 'currently', 'the', 'testing', 'adequacy', 'of', 'a', 'dl', 'system', 'is', 'usually', 'measured', 'by', 'the', 'accuracy', 'of', 'test', 'data', 'considering', 'the', 'limitation', 'of', 'accessible', 'high', 'quality', 'test', 'data', 'good', 'accuracy', 'performance', 'on', 'test', 'data', 'can', 'hardly', 'provide', 'confidence', 'to', 'the', 'testing', 'adequacy', 'and', 'generality', 'of', 'dl', 'systems', 'unlike', 'traditional', 'software', 'systems', 'that', 'have', 'clear', 'and', 'controllable', 'logic', 'and', 'functionality', 'the', 'lack', 'of', 'interpretability', 'in', 'a', 'dl', 'system', 'makes', 'system', 'analysis', 'and', 'defect', 'detection', 'difficult', 'which', 'could', 'potentially', 'hinder', 'its', 'realworld', 'deployment', 'in', 'this', 'paper', 'we', 'propose', 'deepgauge', 'a', 'set', 'of', 'multigranularity', 'testing', 'criteria', 'for', 'dl', 'systems', 'which', 'aims', 'at', 'rendering', 'a', 'multifaceted', 'portrayal', 'of', 'the', 'testbed', 'the', 'indepth', 'evaluation', 'of', 'our', 'proposed', 'testing', 'criteria', 'is', 'demonstrated', 'on', 'two', 'wellknown', 'datasets', 'five', 'dl', 'systems', 'and', 'with', 'four', 'stateoftheart', 'adversarial', 'attack', 'techniques', 'against', 'dl', 'the', 'potential', 'usefulness', 'of', 'deepgauge', 'sheds', 'light', 'on', 'the', 'construction', 'of', 'more', 'generic', 'and', 'robust', 'dl', 'systems']]
[-0.12277409135203576, -0.058893445640820205, -0.05730874040141773, 0.07198084589722233, -0.10687972923615974, -0.20247464254721287, 0.07444044879912544, 0.3577499014445754, -0.21767066074543606, -0.34120870276430004, 0.10919890328227992, -0.24310440268216021, -0.17321906275334256, 0.2625986293992072, -0.11998766961699112, 0.13615658848505227, 0.12276350286495137, -0.00298799696235258, -0.06140589179208226, -0.26747119372140205, 0.31739579570484144, 0.03561524059676396, 0.38426614975730516, 0.06401273331484583, 0.07849477241305929, -0.012984075049343898, 0.000248486814467887, 0.023705057473964633, -0.034856365593093165, 0.1473476530128475, 0.31579781819188424, 0.2808801289714659, 0.3394094180208787, -0.410313848535303, -0.23878595468565336, 0.06510145945305174, 0.1550231869165389, 0.07960655412902114, -0.040755974023915384, -0.3135160250125818, 0.10948079041401415, -0.2246753845896358, -0.04360108594432402, -0.14777111227102757, 0.0010443534568379941, -0.0036306231172363226, -0.27601993686417076, -0.007276237409775765, 0.08805968807163564, 0.1122282142906882, -0.0238372024319148, -0.10634248103705819, 0.026490562337530894, 0.12276898659768505, 0.029799110347485287, -0.0051420946426145985, 0.1393497153586356, -0.16088850535430085, -0.16445702768229484, 0.38983443979191723, -0.02035360877473424, -0.18412774110003485, 0.288347919425887, -0.038889335765855376, -0.14026769827026428, 0.08780268872263686, 0.24693096335531706, 0.07634848526664498, -0.19105013906344398, 0.0551687402402287, 0.030283192188242835, 0.18804382665515054, 0.027168480995775124, 0.0485558547124124, 0.20422181540222295, 0.27431461765374054, 0.004894875284923802, 0.11422759664755172, -0.09780717573939648, -0.07565484382212162, -0.21482457013847528, -0.11427452825536198, -0.1570187050840287, -0.02147209727590788, -0.08180874771214064, -0.14483648978001618, 0.38504549509034663, 0.2445420410760353, 0.1524208864792023, 0.07712154736036088, 0.3465419459874122, 0.04683138482547231, 0.1052889385241912, 0.03487612854056595, 0.24258432331613072, 0.02629820359246939, 0.1254625089562517, -0.1730295048556491, 0.10531356732882381, -0.0585237578422045]
1,803.0752
Optically addressing single rare-earth ions in a nanophotonic cavity
We demonstrate optical probing of spectrally resolved single Nd rare-earth ions in yttrium orthovanadate. The ions are coupled to a photonic crystal resonator and show strong enhancement of the optical emission rate via the Purcell effect, resulting in near radiatively limited single photon emission. The measured high coupling cooperativity between a single photon and the ion allows for the observation of coherent optical Rabi oscillations. This could enable optically controlled spin qubits, quantum logic gates, and spin-photon interfaces for future quantum networks.
quant-ph
we demonstrate optical probing of spectrally resolved single nd rareearth ions in yttrium orthovanadate the ions are coupled to a photonic crystal resonator and show strong enhancement of the optical emission rate via the purcell effect resulting in near radiatively limited single photon emission the measured high coupling cooperativity between a single photon and the ion allows for the observation of coherent optical rabi oscillations this could enable optically controlled spin qubits quantum logic gates and spinphoton interfaces for future quantum networks
[['we', 'demonstrate', 'optical', 'probing', 'of', 'spectrally', 'resolved', 'single', 'nd', 'rareearth', 'ions', 'in', 'yttrium', 'orthovanadate', 'the', 'ions', 'are', 'coupled', 'to', 'a', 'photonic', 'crystal', 'resonator', 'and', 'show', 'strong', 'enhancement', 'of', 'the', 'optical', 'emission', 'rate', 'via', 'the', 'purcell', 'effect', 'resulting', 'in', 'near', 'radiatively', 'limited', 'single', 'photon', 'emission', 'the', 'measured', 'high', 'coupling', 'cooperativity', 'between', 'a', 'single', 'photon', 'and', 'the', 'ion', 'allows', 'for', 'the', 'observation', 'of', 'coherent', 'optical', 'rabi', 'oscillations', 'this', 'could', 'enable', 'optically', 'controlled', 'spin', 'qubits', 'quantum', 'logic', 'gates', 'and', 'spinphoton', 'interfaces', 'for', 'future', 'quantum', 'networks']]
[-0.16199061511334303, 0.2577789975216658, 0.06119324348685218, -0.013560238705661216, 0.0009856721181876775, -0.24984401027194975, 0.08321048213146263, 0.48612684630448133, -0.2552212131005235, -0.27730521664773, -0.052741459261330705, -0.3027792037381271, -0.0013874850587964785, 0.25963995355627184, 0.05121640655887881, 0.06690509286254825, 0.014431554652330262, -0.0966247644661585, 0.00022908589496027407, -0.09631653986132999, 0.18676985916823557, 0.07645678794772433, 0.3277787218188367, 0.08935155803564845, 0.12779440679700999, -0.007658245269118286, 0.08917453165007073, -0.07047247534572351, -0.06138006674261372, 0.12025603569090003, 0.2782681012844167, -0.05269845584322267, 0.21508889436358358, -0.4623367665676264, -0.1903597208580411, 0.05662051691650981, 0.19729207152331804, 0.24001244512363906, -0.099952787785541, -0.31211012267939203, -0.05047516977746699, -0.12939240669877064, -0.07110680028705335, -0.07319354893435247, -0.038413398825313624, -0.0010612528578082963, -0.2690897536600327, 0.04630519561015251, 0.02231583925725029, 0.0692534440242481, 0.008365463751521552, 0.03999687970059401, -0.03036799093015583, 0.013490019400217912, -0.1217250901887693, -0.029065056499548075, 0.263919952490208, -0.08923165885470354, -0.19175536039557944, 0.3337032249106503, -0.12237203820812993, -0.06326883448651288, 0.12423439992296441, -0.21678451935919682, -0.050501938403879364, 0.17731630070725593, 0.13420954520853873, 0.12654018339632853, -0.10913253584649504, 0.014684334224822545, 0.035668394766838814, 0.26805714764242755, 0.08467087606763149, 0.21796005103373672, 0.28620245959609747, 0.17474777998953558, -0.02544541600183016, 0.18862416977563265, -0.16547866814724374, -0.031232405067762224, -0.22549995209272133, -0.1691361133629604, -0.18233945906707427, 0.11063060377974336, -0.10090646459440639, -0.13762085135776278, 0.3724691120328427, 0.09970591553322199, 0.11967714253540446, -0.08190127391731594, 0.3016840926167078, 0.11637575828992738, 0.08737810890519673, 0.0010979404479901239, 0.3750432117092537, 0.22005960039749015, 0.10589101295009619, -0.39667786594207693, 0.020304042306478795, -0.05421321152243763]
1,803.07521
OSSOS. VIII. The Transition Between Two Size Distribution Slopes in the Scattering Disk
The scattering trans-Neptunian Objects (TNOs) can be measured to smaller sizes than any other distant small-body population. We use the largest sample yet obtained, 68 discoveries, primarily by the Outer Solar System Origins Survey (OSSOS), to constrain the slope of its luminosity distribution, with sensitivity to much fainter absolute $H$ magnitudes than previous work. Using the analysis technique in Shankman et al. (2016), we confirm that a single slope for the $H$-distribution is not an accurate representation of the scattering TNOs and Centaurs, and that a break in the distribution is required, in support of previous conclusions. A bright-end slope of $\alpha_b=0.9$ transitioning to a faint-end slope $\alpha_f$ of 0.4-0.5 with a differential number contrast $c$ from 1 (a knee) to 10 (a divot) provides an acceptable match to our data. We find that break magnitudes $H_b$ of 7.7 and 8.3, values both previously suggested for dynamically hot Kuiper belt populations, are equally non-rejectable for a range of $\alpha_f$ and $c$ in our statistical analysis. Our preferred divot $H$-distribution transitions to $\alpha_f=0.5$ with a divot of contrast $c=3$ at $H_b=8.3$, while our preferred knee $H$-distribution transitions to $\alpha_f=0.4$ at $H_b=7.7$. The intrinsic population of scattering TNOs required to match the OSSOS detections is $3\times10^6$ for $H_r<12$, and $9\times10^4$ for $H_r<8.66$ ($D\gtrsim100$~km), with Centaurs having an intrinsic population two orders of magnitude smaller.
astro-ph.EP
the scattering transneptunian objects tnos can be measured to smaller sizes than any other distant smallbody population we use the largest sample yet obtained 68 discoveries primarily by the outer solar system origins survey ossos to constrain the slope of its luminosity distribution with sensitivity to much fainter absolute h magnitudes than previous work using the analysis technique in shankman et al 2016 we confirm that a single slope for the hdistribution is not an accurate representation of the scattering tnos and centaurs and that a break in the distribution is required in support of previous conclusions a brightend slope of alpha_b09 transitioning to a faintend slope alpha_f of 0405 with a differential number contrast c from 1 a knee to 10 a divot provides an acceptable match to our data we find that break magnitudes h_b of 77 and 83 values both previously suggested for dynamically hot kuiper belt populations are equally nonrejectable for a range of alpha_f and c in our statistical analysis our preferred divot hdistribution transitions to alpha_f05 with a divot of contrast c3 at h_b83 while our preferred knee hdistribution transitions to alpha_f04 at h_b77 the intrinsic population of scattering tnos required to match the ossos detections is 3times106 for h_r12 and 9times104 for h_r866 dgtrsim100km with centaurs having an intrinsic population two orders of magnitude smaller
[['the', 'scattering', 'transneptunian', 'objects', 'tnos', 'can', 'be', 'measured', 'to', 'smaller', 'sizes', 'than', 'any', 'other', 'distant', 'smallbody', 'population', 'we', 'use', 'the', 'largest', 'sample', 'yet', 'obtained', '68', 'discoveries', 'primarily', 'by', 'the', 'outer', 'solar', 'system', 'origins', 'survey', 'ossos', 'to', 'constrain', 'the', 'slope', 'of', 'its', 'luminosity', 'distribution', 'with', 'sensitivity', 'to', 'much', 'fainter', 'absolute', 'h', 'magnitudes', 'than', 'previous', 'work', 'using', 'the', 'analysis', 'technique', 'in', 'shankman', 'et', 'al', '2016', 'we', 'confirm', 'that', 'a', 'single', 'slope', 'for', 'the', 'hdistribution', 'is', 'not', 'an', 'accurate', 'representation', 'of', 'the', 'scattering', 'tnos', 'and', 'centaurs', 'and', 'that', 'a', 'break', 'in', 'the', 'distribution', 'is', 'required', 'in', 'support', 'of', 'previous', 'conclusions', 'a', 'brightend', 'slope', 'of', 'alpha_b09', 'transitioning', 'to', 'a', 'faintend', 'slope', 'alpha_f', 'of', '0405', 'with', 'a', 'differential', 'number', 'contrast', 'c', 'from', '1', 'a', 'knee', 'to', '10', 'a', 'divot', 'provides', 'an', 'acceptable', 'match', 'to', 'our', 'data', 'we', 'find', 'that', 'break', 'magnitudes', 'h_b', 'of', '77', 'and', '83', 'values', 'both', 'previously', 'suggested', 'for', 'dynamically', 'hot', 'kuiper', 'belt', 'populations', 'are', 'equally', 'nonrejectable', 'for', 'a', 'range', 'of', 'alpha_f', 'and', 'c', 'in', 'our', 'statistical', 'analysis', 'our', 'preferred', 'divot', 'hdistribution', 'transitions', 'to', 'alpha_f05', 'with', 'a', 'divot', 'of', 'contrast', 'c3', 'at', 'h_b83', 'while', 'our', 'preferred', 'knee', 'hdistribution', 'transitions', 'to', 'alpha_f04', 'at', 'h_b77', 'the', 'intrinsic', 'population', 'of', 'scattering', 'tnos', 'required', 'to', 'match', 'the', 'ossos', 'detections', 'is', '3times106', 'for', 'h_r12', 'and', '9times104', 'for', 'h_r866', 'dgtrsim100km', 'with', 'centaurs', 'having', 'an', 'intrinsic', 'population', 'two', 'orders', 'of', 'magnitude', 'smaller']]
[-0.036675685638878144, 0.11452197289622316, -0.10242967195325654, 0.08003221596711983, -0.07781790032596239, -0.0726452800642945, 0.06658307983477398, 0.3724180597077203, -0.148457160551224, -0.425263937413341, 0.03325245583886808, -0.3133818968155263, -0.03568376090876178, 0.19816807271332815, -0.09342272664125974, 0.019583458677379036, 0.033743838871881926, -0.0693115089538964, -0.007414166644525292, -0.22917378796615973, 0.2460364427448817, 0.06610772881178045, 0.1738635644191472, -0.0551364646591949, 0.031551282814998215, -0.045588692577713925, -0.02258894111376853, -0.027462939556055475, -0.14669478225753338, 0.1054413674162033, 0.22026190909948024, 0.08025121921893069, 0.20922646612227666, -0.2953352893586751, -0.17374720811549538, 0.1089406730321605, 0.18774886187473488, 0.0699853235894824, 1.180008765450626e-05, -0.26036573944608943, 0.08667674098415894, -0.15572296222012913, -0.19112269287568712, 0.03849594561352377, 0.10901091380548918, -0.024519229641366522, -0.25819795664162637, 0.10966747139475115, 0.05028590491867431, 0.11245167638336634, -0.10846857511315425, -0.1803862322690207, -0.05967773446145485, 0.08680095836379619, 0.019121483869999997, 0.06269227977806949, 0.1518307949223046, -0.09409918651898515, -0.06475604278527482, 0.3690524579315196, -0.061178934504634935, -0.0440336527557657, 0.22149035530955583, -0.217494942236885, -0.13592964906755062, 0.1777583493654537, 0.12266555518891557, 0.10380022200568521, -0.12368707957305233, -0.0012965677978738896, -0.0236551494003748, 0.25008831824338557, 0.044996344310864106, 0.05152668836658364, 0.2387493941405753, 0.12968810898073913, 0.053558661580472344, 0.05828142712548384, -0.17578477452548644, -0.0392847235288739, -0.24219437048853956, -0.09748470465665549, -0.15322328041272484, 0.045634098405983266, -0.09759844490951575, -0.11041480618669598, 0.3538263937555043, 0.16307463943914352, 0.27912891677356727, 0.1228804758534781, 0.2805876348800254, 0.08329815710543322, 0.11170183385080956, 0.10994428081354478, 0.3296420133699013, 0.09724495181800658, 0.057362314209315646, -0.21357528404398593, 0.08659064560320848, -0.04474703259414659]
1,803.07522
Program Repair via Direct State Manipulation
The goal of program repair is to automatically fix programs to meet a specification. We propose a new specification mechanism, direct manipulation, in which the programmer can visualize the trace of a buggy program on a failing input and convey the intended program behavior by manipulating variable values at some location. The repair problem is to find a program that, on the same input, reaches the location identified by the programmer with variable values equal to the manipulated ones. Since a single program execution under-specifies the overall program behavior, we augment our repair problem with quantitative objectives to find the program that agrees with the specification and is closest to the original one with respect to some distance. We formalize the repair problem, build a program repair tool JDial based on the Sketch synthesizer, and show the effectiveness of JDial on representative buggy benchmarks from introductory programming assignments.
cs.PL
the goal of program repair is to automatically fix programs to meet a specification we propose a new specification mechanism direct manipulation in which the programmer can visualize the trace of a buggy program on a failing input and convey the intended program behavior by manipulating variable values at some location the repair problem is to find a program that on the same input reaches the location identified by the programmer with variable values equal to the manipulated ones since a single program execution underspecifies the overall program behavior we augment our repair problem with quantitative objectives to find the program that agrees with the specification and is closest to the original one with respect to some distance we formalize the repair problem build a program repair tool jdial based on the sketch synthesizer and show the effectiveness of jdial on representative buggy benchmarks from introductory programming assignments
[['the', 'goal', 'of', 'program', 'repair', 'is', 'to', 'automatically', 'fix', 'programs', 'to', 'meet', 'a', 'specification', 'we', 'propose', 'a', 'new', 'specification', 'mechanism', 'direct', 'manipulation', 'in', 'which', 'the', 'programmer', 'can', 'visualize', 'the', 'trace', 'of', 'a', 'buggy', 'program', 'on', 'a', 'failing', 'input', 'and', 'convey', 'the', 'intended', 'program', 'behavior', 'by', 'manipulating', 'variable', 'values', 'at', 'some', 'location', 'the', 'repair', 'problem', 'is', 'to', 'find', 'a', 'program', 'that', 'on', 'the', 'same', 'input', 'reaches', 'the', 'location', 'identified', 'by', 'the', 'programmer', 'with', 'variable', 'values', 'equal', 'to', 'the', 'manipulated', 'ones', 'since', 'a', 'single', 'program', 'execution', 'underspecifies', 'the', 'overall', 'program', 'behavior', 'we', 'augment', 'our', 'repair', 'problem', 'with', 'quantitative', 'objectives', 'to', 'find', 'the', 'program', 'that', 'agrees', 'with', 'the', 'specification', 'and', 'is', 'closest', 'to', 'the', 'original', 'one', 'with', 'respect', 'to', 'some', 'distance', 'we', 'formalize', 'the', 'repair', 'problem', 'build', 'a', 'program', 'repair', 'tool', 'jdial', 'based', 'on', 'the', 'sketch', 'synthesizer', 'and', 'show', 'the', 'effectiveness', 'of', 'jdial', 'on', 'representative', 'buggy', 'benchmarks', 'from', 'introductory', 'programming', 'assignments']]
[-0.09953935130274501, -0.030207023115282686, -0.09368449285112579, 0.07567035127672013, -0.15071525053153265, -0.1887725356067049, 0.10393650017614509, 0.35496688757477135, -0.30451276250954334, -0.37658041396282677, 0.12740676508943455, -0.26019407100012076, -0.08462246795795088, 0.1695112748713843, -0.10807660516223003, 0.08161671118477584, 0.06671699085112276, 0.048989685355075474, -0.06152561447615253, -0.24531616477359985, 0.2738116975488334, 0.07320269629487704, 0.23799948453389366, 0.0013682989435720033, 0.07202304300113485, 0.044619752665788964, -0.008124507608791364, 0.001267248510126153, -0.08330739516140652, 0.12671881614830988, 0.29925022011879704, 0.26978535591464103, 0.3198857276732552, -0.401047245519043, -0.11924146122042219, 0.03261163806992358, 0.054239294688008595, 0.13956095746092112, -0.0033582661911074458, -0.2630422778941434, 0.10674121616857833, -0.1299218146772734, -0.07142921061222923, -0.06751895300273238, -0.017818666227033427, -0.018607512585304936, -0.25948215999865326, -0.07407810339575698, 0.011072183874885327, 0.05532459222454706, -0.06187114938772444, -0.08489836543669989, -0.030988856156131832, 0.1528310387106291, 0.04157127391001017, 0.08908548900568537, 0.15273897721400034, -0.10134094689555209, -0.1627991348553192, 0.3842568653153962, -0.018737417453065, -0.18505450835901088, 0.18908184175941578, -0.0672146885463133, -0.15743912655282125, 0.13395956678733487, 0.1963148550933291, 0.12133148814198272, -0.15960708032522736, 0.037539345063349425, -0.033991745974997, 0.25519199146214744, 0.040142123381896266, -0.011404257800815434, 0.2309326456024729, 0.18374240683062515, 0.06525326263849977, 0.21946208424994657, -0.013965384655728422, -0.03820195145391185, -0.34153509815705235, -0.15223332672893744, -0.1546007490620531, -0.0399150421521787, -0.0259506240634625, -0.14348193385461666, 0.41806364289388576, 0.22208488793915201, 0.16697771230648303, 0.15574079987769626, 0.3150634907442948, 0.05957312372689746, 0.13594828513731924, 0.11063852833005888, 0.14588348796021128, 0.02633306607282881, 0.10087069272994995, -0.2639734068901503, 0.16841222122632737, 0.06066036824907722]
1,803.07523
Correlation between quantum entanglement and quantum coherence in the case of XY spin chains with the Dzyaloshinskii-Moriya interaction
Recently, there has been an increased interest in studying quantum entanglement and quantum coherence. Since both of these properties are attributed to the existence of quantum superposition, it would be useful to determine if some type of correlation between them exists. Hence, the purpose of this paper is to explore the type of the correlation in several systems with different types of anisotropy. The focus will be on the XY spin chains with the Dzyaloshinskii-Moriya interaction and the type of the mentioned bond will be explored using the quantum renormalization group method.
cond-mat.str-el quant-ph
recently there has been an increased interest in studying quantum entanglement and quantum coherence since both of these properties are attributed to the existence of quantum superposition it would be useful to determine if some type of correlation between them exists hence the purpose of this paper is to explore the type of the correlation in several systems with different types of anisotropy the focus will be on the xy spin chains with the dzyaloshinskiimoriya interaction and the type of the mentioned bond will be explored using the quantum renormalization group method
[['recently', 'there', 'has', 'been', 'an', 'increased', 'interest', 'in', 'studying', 'quantum', 'entanglement', 'and', 'quantum', 'coherence', 'since', 'both', 'of', 'these', 'properties', 'are', 'attributed', 'to', 'the', 'existence', 'of', 'quantum', 'superposition', 'it', 'would', 'be', 'useful', 'to', 'determine', 'if', 'some', 'type', 'of', 'correlation', 'between', 'them', 'exists', 'hence', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'explore', 'the', 'type', 'of', 'the', 'correlation', 'in', 'several', 'systems', 'with', 'different', 'types', 'of', 'anisotropy', 'the', 'focus', 'will', 'be', 'on', 'the', 'xy', 'spin', 'chains', 'with', 'the', 'dzyaloshinskiimoriya', 'interaction', 'and', 'the', 'type', 'of', 'the', 'mentioned', 'bond', 'will', 'be', 'explored', 'using', 'the', 'quantum', 'renormalization', 'group', 'method']]
[-0.1423779397332312, 0.17484100040636133, -0.08609486371278763, 0.0666243465890622, -0.03776425850051253, -0.14660852561380877, -0.027743174364213304, 0.3836908692534527, -0.2986769702528482, -0.26822143280372507, 0.0990003478262857, -0.2635474967284371, -0.13052858414290391, 0.2116802841850111, 0.014390853188081604, 0.01893957316592012, 0.007700879147033329, 0.055065291351638734, -0.09426214674528202, -0.2527446927421767, 0.34336541547520977, 0.013991357875056565, 0.2835200455586385, 0.10102430662727388, 0.03612704550766427, 0.011996732432516697, 0.006405333983306976, 0.042299729706112135, -0.13941421054566847, 0.12643866461914274, 0.2540774388503253, 0.07773619528060131, 0.2522315247308301, -0.4105321299082235, -0.22279241128379237, 0.14887191363326882, 0.137777647433762, 0.13902851317897844, -0.044205006076599995, -0.29604592081159353, 0.08219158950977663, -0.18964473578228574, -0.12314946733860542, -0.08242556333298916, 0.03866828777624861, 0.027727250060390517, -0.1868120235588361, 0.04535649209182062, 0.07228166508392188, 0.053725275565343705, 0.004486462293678652, -0.06967945130663397, 0.0036883318655030885, 0.16623740055618566, 0.06035562118505249, 0.007004574201899864, 0.05059386526598879, -0.1110494764314195, -0.13779118719748626, 0.37685839532186155, -0.014925827049528774, -0.1916141345206162, 0.22051889720150147, -0.12007646577220167, -0.1471096745884532, 0.06416554317895687, 0.12784154643304646, 0.06421916802292285, -0.16536279988434652, 0.08735095952895632, -0.00582550269673052, 0.16554995846894124, 0.022599497794821535, 0.1053207133524626, 0.23859181077948408, 0.12716399775008144, 0.0563283227181629, 0.15910174135427477, -0.0911753147529848, -0.11755923143810713, -0.2615003620233873, -0.19021455826156813, -0.2168156013763307, 0.08122358592885101, -0.057284729939609584, -0.13629253191428017, 0.401788119348171, 0.16787688215718727, 0.14982655382229257, -0.039259863366960024, 0.18611079938684427, 0.12820955540013054, 0.08118692232781778, 0.017941063143434407, 0.289307925401258, 0.17809663669449155, 0.05452418647726755, -0.2608316547095614, 0.09752469863135206, 0.050863697892054915]
1,803.07524
Design flow for readout ASICs in High-energy Physics experiments
In the large-scale high energy physics experiments multi-channel readout application specific integrated circuits (ASICs) are widely used. The ASICs for such experiments are complicated systems, which usually include both analog and digital building blocks. The complexity and large number of channels in such ASICs require the proper methodological approach to their design. The paper represents the mixed-signal design flow of the ASICs for high energy physics. This flow was successfully implemented in the development of the readout ASIC prototypes for the muon chambers of the CBM experiment. The approach was approved in UMC CMOS MMRF 180 nm process. The design flow enables to analyze the mixed-signal system operation on the different levels: functional, behavioral, schematic and post-layout including parasitic elements. The proposed design flow allows reducing the simulation period and eliminating the functionality mismatches on the very early stage of the design.
physics.ins-det hep-ex nucl-ex
in the largescale high energy physics experiments multichannel readout application specific integrated circuits asics are widely used the asics for such experiments are complicated systems which usually include both analog and digital building blocks the complexity and large number of channels in such asics require the proper methodological approach to their design the paper represents the mixedsignal design flow of the asics for high energy physics this flow was successfully implemented in the development of the readout asic prototypes for the muon chambers of the cbm experiment the approach was approved in umc cmos mmrf 180 nm process the design flow enables to analyze the mixedsignal system operation on the different levels functional behavioral schematic and postlayout including parasitic elements the proposed design flow allows reducing the simulation period and eliminating the functionality mismatches on the very early stage of the design
[['in', 'the', 'largescale', 'high', 'energy', 'physics', 'experiments', 'multichannel', 'readout', 'application', 'specific', 'integrated', 'circuits', 'asics', 'are', 'widely', 'used', 'the', 'asics', 'for', 'such', 'experiments', 'are', 'complicated', 'systems', 'which', 'usually', 'include', 'both', 'analog', 'and', 'digital', 'building', 'blocks', 'the', 'complexity', 'and', 'large', 'number', 'of', 'channels', 'in', 'such', 'asics', 'require', 'the', 'proper', 'methodological', 'approach', 'to', 'their', 'design', 'the', 'paper', 'represents', 'the', 'mixedsignal', 'design', 'flow', 'of', 'the', 'asics', 'for', 'high', 'energy', 'physics', 'this', 'flow', 'was', 'successfully', 'implemented', 'in', 'the', 'development', 'of', 'the', 'readout', 'asic', 'prototypes', 'for', 'the', 'muon', 'chambers', 'of', 'the', 'cbm', 'experiment', 'the', 'approach', 'was', 'approved', 'in', 'umc', 'cmos', 'mmrf', '180', 'nm', 'process', 'the', 'design', 'flow', 'enables', 'to', 'analyze', 'the', 'mixedsignal', 'system', 'operation', 'on', 'the', 'different', 'levels', 'functional', 'behavioral', 'schematic', 'and', 'postlayout', 'including', 'parasitic', 'elements', 'the', 'proposed', 'design', 'flow', 'allows', 'reducing', 'the', 'simulation', 'period', 'and', 'eliminating', 'the', 'functionality', 'mismatches', 'on', 'the', 'very', 'early', 'stage', 'of', 'the', 'design']]
[-0.10129047873836587, 0.07835967767275345, -0.017918423556027487, -0.014261266629354152, -0.052089892363857845, -0.15683091291501908, -0.011486111665132265, 0.3804165119892249, -0.22797964259155723, -0.3746858226909289, 0.14439781215988776, -0.2492646313774355, -0.12826964116825815, 0.2591008530457465, -0.06021912466131256, 0.14798750006265834, 0.0655517981438504, -0.043953703006427786, -0.03655413296471291, -0.21021623053000976, 0.19804299408307588, 0.13377803299103824, 0.37485295998483475, 0.0271250232332714, 0.13822414686011386, -0.01433217600906189, -0.043967539212759914, -0.05828441131382879, -0.06803130292625521, 0.10494876878244251, 0.32001743062963367, 0.13597355996468433, 0.23986836542493442, -0.5093487691290801, -0.16795706219682602, 0.05288773565963042, 0.06731095254211358, 0.06577448428421556, -0.08356100512819338, -0.2421159282667746, 0.11649622804891895, -0.19199363394758442, -0.06562544426447908, -0.04855653807573335, -0.03869862495068933, 0.028057870809251154, -0.236155766772408, -0.04589735494572407, 0.023209034862049237, 0.04990706091392523, -0.012502670324568204, -0.16454790138662465, 0.02507247281437871, 0.13431782277733822, -0.07248120751862355, -0.02197705477830285, 0.1974424432707347, -0.11744523793622903, -0.1334341110491102, 0.3313254414267287, 0.020336057307874182, -0.1582810208972045, 0.19286835682906314, -0.08201469014592233, -0.0798838706818265, 0.12288341174085796, 0.23545573953158733, 0.049632852460900455, -0.19014961700755315, 0.06514673548075042, 0.07625547596450213, 0.1984657668443003, 0.03746658458840102, 0.046228957637934616, 0.1729634050820941, 0.2936334239128767, 0.02255226830086133, 0.13700694051033385, -0.14906338490275206, -0.0642677817352667, -0.3024935574520012, -0.18812927633891224, -0.13300279099461426, -0.012402227638669732, -0.047034037992617274, -0.13900657637621944, 0.42970629996607, 0.14745815720216085, 0.10448305377028358, -0.007685938070390479, 0.3649814797329231, 0.06289211675708353, 0.16467828599502035, 0.034268772401715775, 0.21144931659128674, 0.11499508728706082, 0.20545735574019156, -0.23920493001531495, 0.04809293757737155, -0.002515682960453797]
1,803.07525
Dimensions: A Competitor to Scopus and the Web of Science?
Dimensions is a partly free scholarly database launched by Digital Science in January 2018. Dimensions includes journal articles and citation counts, making it a potential new source of impact data. This article explores the value of Dimensions from an impact assessment perspective with an examination of Food Science research 2008-2018 and a random sample of 10,000 Scopus articles from 2012. The results include high correlations between citation counts from Scopus and Dimensions (0.96 by narrow field in 2012) as well as similar average counts. Almost all Scopus articles with DOIs were found in Dimensions (97% in 2012). Thus, the scholarly database component of Dimensions seems to be a plausible alternative to Scopus and the Web of Science for general citation analyses and for citation data in support of some types of research evaluations.
cs.DL
dimensions is a partly free scholarly database launched by digital science in january 2018 dimensions includes journal articles and citation counts making it a potential new source of impact data this article explores the value of dimensions from an impact assessment perspective with an examination of food science research 20082018 and a random sample of 10000 scopus articles from 2012 the results include high correlations between citation counts from scopus and dimensions 096 by narrow field in 2012 as well as similar average counts almost all scopus articles with dois were found in dimensions 97 in 2012 thus the scholarly database component of dimensions seems to be a plausible alternative to scopus and the web of science for general citation analyses and for citation data in support of some types of research evaluations
[['dimensions', 'is', 'a', 'partly', 'free', 'scholarly', 'database', 'launched', 'by', 'digital', 'science', 'in', 'january', '2018', 'dimensions', 'includes', 'journal', 'articles', 'and', 'citation', 'counts', 'making', 'it', 'a', 'potential', 'new', 'source', 'of', 'impact', 'data', 'this', 'article', 'explores', 'the', 'value', 'of', 'dimensions', 'from', 'an', 'impact', 'assessment', 'perspective', 'with', 'an', 'examination', 'of', 'food', 'science', 'research', '20082018', 'and', 'a', 'random', 'sample', 'of', '10000', 'scopus', 'articles', 'from', '2012', 'the', 'results', 'include', 'high', 'correlations', 'between', 'citation', 'counts', 'from', 'scopus', 'and', 'dimensions', '096', 'by', 'narrow', 'field', 'in', '2012', 'as', 'well', 'as', 'similar', 'average', 'counts', 'almost', 'all', 'scopus', 'articles', 'with', 'dois', 'were', 'found', 'in', 'dimensions', '97', 'in', '2012', 'thus', 'the', 'scholarly', 'database', 'component', 'of', 'dimensions', 'seems', 'to', 'be', 'a', 'plausible', 'alternative', 'to', 'scopus', 'and', 'the', 'web', 'of', 'science', 'for', 'general', 'citation', 'analyses', 'and', 'for', 'citation', 'data', 'in', 'support', 'of', 'some', 'types', 'of', 'research', 'evaluations']]
[-0.018838335423038876, 0.06996320104460182, -0.02970528966133398, 0.06844673232020189, -0.09855368734464388, -0.07431394917269547, 0.07619795170048195, 0.3501584989823062, -0.13876505094142913, -0.4364185008982366, 0.0558834476899144, -0.3797843160643948, -0.12087659113405441, 0.23262293123865896, -0.10700172281146726, -0.0032513608845571675, 0.09241058828422066, -0.0040071783728446025, 0.029450172860048373, -0.37619918471936026, 0.26878598361573686, 0.10095434525812214, 0.3858320139009844, 0.05966787619135258, -0.0009412316827696155, -0.018661769689060748, -0.21272004814112955, 0.03666007696775716, -0.15573616495892179, 0.15405677678769059, 0.34913367732907785, 0.2128002394985577, 0.31125618326195487, -0.3163103269530301, -0.1789944152031129, 0.010783584846649319, 0.08226433222774755, 0.06041454923141635, -0.003860745515505021, -0.33608616502588673, 0.016106649259613318, -0.2195709484036673, -0.06281168905623032, -0.024535904761940015, 0.14440693852057765, 0.03996820943288957, -0.21288011735657963, 0.1136344040243068, 0.008345182259235475, 0.20798499432081977, -0.02238147320211724, -0.14345772653221944, -0.006681979847295831, 0.1674307945473684, 0.09116841090320976, 0.07140175690239464, 0.1203047995469674, -0.1544283484060102, -0.18302343591825443, 0.3857709375830988, -0.01225169683863042, -0.08448019771921364, 0.15763780774520428, -0.10709245889235965, -0.1504364411459502, 0.0927550996703124, 0.2275023707964768, 0.0033642718018117275, -0.1944591646774136, 0.06451493754028695, -0.03467017060470288, 0.2265970693110968, 0.13143065703104984, -0.02756583832590629, 0.2118007033396597, 0.10935726213607598, 0.012592752548781309, 0.11750266425907753, -0.07074128719272488, -0.07545010196080318, -0.2526778370410091, -0.1511819756618052, -0.1681756044492817, 0.07326638281599364, -0.08855430545075003, -0.15868111368212284, 0.4387778347485106, 0.14656920244416335, 0.1279982929047423, -0.018726077582510752, 0.25596063444390893, -0.008575070513567576, 0.06464771806041068, 0.09597904833076014, 0.16884037379327999, 0.04365121877829855, 0.23347131326568848, 0.01083974427522414, 0.026142432703636587, -0.007082437835351536]
1,803.07526
Studies on generalized Yule models
We present a generalization of the Yule model for macroevolution in which, for the appearance of genera, we consider point processes with the order statistics property, while for the growth of species we use nonlinear time-fractional pure birth processes or a critical birth-death process. Further, in specific cases we derive the explicit form of the distribution of the number of species of a genus chosen uniformly at random for each time. Besides, we introduce a time-changed mixed Poisson process with the same marginal distribution as that of the time-fractional Poisson process.
math.PR
we present a generalization of the yule model for macroevolution in which for the appearance of genera we consider point processes with the order statistics property while for the growth of species we use nonlinear timefractional pure birth processes or a critical birthdeath process further in specific cases we derive the explicit form of the distribution of the number of species of a genus chosen uniformly at random for each time besides we introduce a timechanged mixed poisson process with the same marginal distribution as that of the timefractional poisson process
[['we', 'present', 'a', 'generalization', 'of', 'the', 'yule', 'model', 'for', 'macroevolution', 'in', 'which', 'for', 'the', 'appearance', 'of', 'genera', 'we', 'consider', 'point', 'processes', 'with', 'the', 'order', 'statistics', 'property', 'while', 'for', 'the', 'growth', 'of', 'species', 'we', 'use', 'nonlinear', 'timefractional', 'pure', 'birth', 'processes', 'or', 'a', 'critical', 'birthdeath', 'process', 'further', 'in', 'specific', 'cases', 'we', 'derive', 'the', 'explicit', 'form', 'of', 'the', 'distribution', 'of', 'the', 'number', 'of', 'species', 'of', 'a', 'genus', 'chosen', 'uniformly', 'at', 'random', 'for', 'each', 'time', 'besides', 'we', 'introduce', 'a', 'timechanged', 'mixed', 'poisson', 'process', 'with', 'the', 'same', 'marginal', 'distribution', 'as', 'that', 'of', 'the', 'timefractional', 'poisson', 'process']]
[-0.06999963299872783, 0.12800038119798507, -0.06460808747507533, 0.062053341369551915, -0.023380956192920497, -0.11618993431329727, 0.08502008336862284, 0.3337509905110922, -0.29554270315342224, -0.2293668022113187, 0.08575071754691364, -0.24906155056125678, -0.13879846383633276, 0.1339980866939116, -0.025093444735630528, 0.057846247658624755, 0.011089546342411048, 0.05108864414045117, -0.02102633523959462, -0.2417905549979308, 0.38150965704347245, 0.028243682122083155, 0.24359027241039408, -0.03630796365010051, 0.16192257003653998, 0.010000122905514398, -0.025144036455018507, -0.0512108665091316, -0.16096027754543024, 0.07941812119615561, 0.2047436818848927, 0.08770961192539499, 0.26486852552209583, -0.4039317461979258, -0.24056780449841375, 0.1631188513915781, 0.13509503510719226, 0.10540318566727565, -0.05093774554104759, -0.22013605195660513, 0.041015715463660084, -0.14343912164670425, -0.18254246760497464, -0.015597595055434075, 0.016603726576399674, 0.09004518005147494, -0.32676953164307954, 0.12637083314277314, 0.10502708929457835, 0.032993954228484175, -0.04115957811802298, -0.14300661033229226, -0.02446876438129898, 0.11946428999826722, 0.028182128154235167, -0.06587478586544211, 0.07917910210460752, -0.16584169510547275, -0.13801209148208887, 0.3612689208239317, -0.1011185870866629, -0.24773202431234684, 0.16995314582875307, -0.18364227538580422, -0.2130711566001832, 0.12492370035673318, 0.21270810471397344, 0.15171184029256168, -0.1718586346871414, 0.07035812240728474, -0.001331217387425048, 0.06623268795902022, 0.07306584678360026, -0.017843446018849754, 0.1559392989684756, 0.19056413175313028, 0.07595258495120516, 0.1886758193332743, -0.08739808955035366, -0.1686445621589383, -0.3472427084407472, -0.21180025926166837, -0.1489687831739762, 0.09105407557921014, -0.14678248428422344, -0.21915663057262755, 0.3888782318655893, 0.13848792620218783, 0.22014789653757771, 0.12875316204160328, 0.20503420998843816, 0.18992684253332828, -0.01617686149592583, 0.03825963166757272, 0.0746763507543889, 0.12770010469542756, 0.09298478599873136, -0.16458419055529552, 0.12303816157669484, 0.08650760204213989]
1,803.07527
Broadcasting on Bounded Degree DAGs
We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node $X$. Let the collection of nodes at distance $k$ from $X$ be called the $k$th layer. At time zero, the source node is given a bit. At time $k\geq 1$, each node in the $(k-1)$th layer inspects its inputs and sends a bit to its descendants in the $k$th layer. Each bit is flipped with a probability of error $\delta \in \left(0,\frac{1}{2}\right)$ in the process of transmission. The goal is to be able to recover the original bit with probability of error better than $\frac{1}{2}$ from the values of all nodes at an arbitrarily deep layer $k$. Besides its natural broadcast interpretation, the DAG broadcast is a natural model of noisy computation. Some special cases of the model represent information flow in biological networks, and other cases represent noisy finite automata models. We show that there exist DAGs with bounded degree and layers of size $\omega(\log(k))$ that permit recovery provided $\delta$ is sufficiently small and find the critical $\delta$ for the DAGs constructed. Our result demonstrates a doubly-exponential advantage for storing a bit in bounded degree DAGs compared to trees. On the negative side, we show that if the DAG is a two-dimensional regular grid, then recovery is impossible for any $\delta \in \left(0,\frac{1}{2}\right)$ provided all nodes use either AND or XOR for their processing functions.
cs.IT math.IT math.PR math.ST stat.TH
we study the following generalization of the wellknown model of broadcasting on trees consider an infinite directed acyclic graph dag with a unique source node x let the collection of nodes at distance k from x be called the kth layer at time zero the source node is given a bit at time kgeq 1 each node in the k1th layer inspects its inputs and sends a bit to its descendants in the kth layer each bit is flipped with a probability of error delta in left0frac12right in the process of transmission the goal is to be able to recover the original bit with probability of error better than frac12 from the values of all nodes at an arbitrarily deep layer k besides its natural broadcast interpretation the dag broadcast is a natural model of noisy computation some special cases of the model represent information flow in biological networks and other cases represent noisy finite automata models we show that there exist dags with bounded degree and layers of size omegalogk that permit recovery provided delta is sufficiently small and find the critical delta for the dags constructed our result demonstrates a doublyexponential advantage for storing a bit in bounded degree dags compared to trees on the negative side we show that if the dag is a twodimensional regular grid then recovery is impossible for any delta in left0frac12right provided all nodes use either and or xor for their processing functions
[['we', 'study', 'the', 'following', 'generalization', 'of', 'the', 'wellknown', 'model', 'of', 'broadcasting', 'on', 'trees', 'consider', 'an', 'infinite', 'directed', 'acyclic', 'graph', 'dag', 'with', 'a', 'unique', 'source', 'node', 'x', 'let', 'the', 'collection', 'of', 'nodes', 'at', 'distance', 'k', 'from', 'x', 'be', 'called', 'the', 'kth', 'layer', 'at', 'time', 'zero', 'the', 'source', 'node', 'is', 'given', 'a', 'bit', 'at', 'time', 'kgeq', '1', 'each', 'node', 'in', 'the', 'k1th', 'layer', 'inspects', 'its', 'inputs', 'and', 'sends', 'a', 'bit', 'to', 'its', 'descendants', 'in', 'the', 'kth', 'layer', 'each', 'bit', 'is', 'flipped', 'with', 'a', 'probability', 'of', 'error', 'delta', 'in', 'left0frac12right', 'in', 'the', 'process', 'of', 'transmission', 'the', 'goal', 'is', 'to', 'be', 'able', 'to', 'recover', 'the', 'original', 'bit', 'with', 'probability', 'of', 'error', 'better', 'than', 'frac12', 'from', 'the', 'values', 'of', 'all', 'nodes', 'at', 'an', 'arbitrarily', 'deep', 'layer', 'k', 'besides', 'its', 'natural', 'broadcast', 'interpretation', 'the', 'dag', 'broadcast', 'is', 'a', 'natural', 'model', 'of', 'noisy', 'computation', 'some', 'special', 'cases', 'of', 'the', 'model', 'represent', 'information', 'flow', 'in', 'biological', 'networks', 'and', 'other', 'cases', 'represent', 'noisy', 'finite', 'automata', 'models', 'we', 'show', 'that', 'there', 'exist', 'dags', 'with', 'bounded', 'degree', 'and', 'layers', 'of', 'size', 'omegalogk', 'that', 'permit', 'recovery', 'provided', 'delta', 'is', 'sufficiently', 'small', 'and', 'find', 'the', 'critical', 'delta', 'for', 'the', 'dags', 'constructed', 'our', 'result', 'demonstrates', 'a', 'doublyexponential', 'advantage', 'for', 'storing', 'a', 'bit', 'in', 'bounded', 'degree', 'dags', 'compared', 'to', 'trees', 'on', 'the', 'negative', 'side', 'we', 'show', 'that', 'if', 'the', 'dag', 'is', 'a', 'twodimensional', 'regular', 'grid', 'then', 'recovery', 'is', 'impossible', 'for', 'any', 'delta', 'in', 'left0frac12right', 'provided', 'all', 'nodes', 'use', 'either', 'and', 'or', 'xor', 'for', 'their', 'processing', 'functions']]
[-0.15968428946320445, 0.08190775574274319, -0.010204034954545192, 0.03019087484445433, -0.0555704723989506, -0.2207477694914456, 0.10412429189464054, 0.37309952375490635, -0.33196989554985273, -0.2608192787926907, 0.0814708227591678, -0.3061046857411946, -0.11762609007126841, 0.13913568787598457, -0.0968625569655473, 0.022248685024536207, 0.0853058399272217, 0.16432695016187626, -0.01929646639065929, -0.2695637723500792, 0.28368382057449415, 0.02249574646847883, 0.2259324408488694, 0.00994726187932108, 0.12132763102673828, 0.003344992423020458, 0.012770967507305945, 0.0035238734551861686, -0.11909425165320053, 0.07200694679817826, 0.26100022077176216, 0.1579591307578477, 0.2568272714545618, -0.4093608880469661, -0.21748394563627965, 0.1633648157073378, 0.11818519960055167, 0.08871085497384497, 0.00725739889515417, -0.23756712095723082, 0.16831603904517514, -0.13491795488734173, -0.05398507379149995, 0.013330398515809744, 0.03422510396897854, 0.01683178113404414, -0.3186819417154826, 0.025110710562975824, 0.07424885873910797, 0.03347239396623017, 0.005275966748846424, -0.14055292313161047, -0.04544306255169831, 0.15066340045435392, -0.03374183474794992, 0.09165207931000925, 0.048073321898734485, -0.1314321456731131, -0.1383929958620642, 0.3484110323735416, -0.019485592523590212, -0.2209917109235503, 0.12679223245525678, -0.1294467637829359, -0.13705147666319495, 0.11647417865687773, 0.15379723549542246, 0.1098216291250375, -0.08507716762388891, 0.07976989313275108, -0.06259499857186715, 0.19249718544687844, 0.10043006989703016, 0.03584488491910313, 0.15330736433190614, 0.16014419684521816, 0.12991135556702946, 0.16137626309540024, -0.08445018038918801, -0.06867530829702113, -0.29156252268954913, -0.14094122023132333, -0.24375304611519566, 0.038811260305878344, -0.17287781621063567, -0.16003351523183457, 0.3760097553427969, 0.13660907968241118, 0.22303634526834076, 0.15214023848075836, 0.29263775981383017, 0.09262448366665227, 0.05050887690284154, 0.1642236918813831, 0.0946547493278928, 0.13283093924575226, 0.05890659774611105, -0.1385723161216462, 0.13197570343509596, 0.05715647591816559]
1,803.07528
Global well-posedness for the 2D stable Muskat problem in $H^{3/2}$
We prove a global existence result of a unique strong solution in $\dot H^{5/2} \cap \dot H^{3/2}$ with small $\dot H^{3/2}$ semi-norm for the 2D Muskat problem, hence allowing the interface to have arbitrary large finite slopes and finite energy (thanks to the $L^{2}$ maximum principle). The proof is based on the use of a new formulation of the Muskat equation that involves oscillatory terms. Then, a careful use of interpolation inequalities in homogeneneous Besov spaces allows us to close the {\emph{a priori}} estimates.
math.AP math-ph math.FA math.MP
we prove a global existence result of a unique strong solution in dot h52 cap dot h32 with small dot h32 seminorm for the 2d muskat problem hence allowing the interface to have arbitrary large finite slopes and finite energy thanks to the l2 maximum principle the proof is based on the use of a new formulation of the muskat equation that involves oscillatory terms then a careful use of interpolation inequalities in homogeneneous besov spaces allows us to close the empha priori estimates
[['we', 'prove', 'a', 'global', 'existence', 'result', 'of', 'a', 'unique', 'strong', 'solution', 'in', 'dot', 'h52', 'cap', 'dot', 'h32', 'with', 'small', 'dot', 'h32', 'seminorm', 'for', 'the', '2d', 'muskat', 'problem', 'hence', 'allowing', 'the', 'interface', 'to', 'have', 'arbitrary', 'large', 'finite', 'slopes', 'and', 'finite', 'energy', 'thanks', 'to', 'the', 'l2', 'maximum', 'principle', 'the', 'proof', 'is', 'based', 'on', 'the', 'use', 'of', 'a', 'new', 'formulation', 'of', 'the', 'muskat', 'equation', 'that', 'involves', 'oscillatory', 'terms', 'then', 'a', 'careful', 'use', 'of', 'interpolation', 'inequalities', 'in', 'homogeneneous', 'besov', 'spaces', 'allows', 'us', 'to', 'close', 'the', 'empha', 'priori', 'estimates']]
[-0.1228450151182801, 0.0357767729683364, -0.10573430695425136, 0.079494482154554, -0.11931927701884723, -0.15842404582324515, 0.052572764013052345, 0.28606149412871124, -0.3045367412942361, -0.2501191007736397, 0.13218925641050158, -0.2426889332781717, -0.08406694704128137, 0.20985643621758523, -0.11082711070775986, 0.1002869023773146, 0.08196871704141419, -0.01558014682034053, -0.10753745899580598, -0.17093658236034934, 0.36211086069065407, -0.03733353275267116, 0.25803296132776216, 0.09767837261399591, 0.13355429424534002, 0.02095352592092591, 0.04072095517136426, -0.004260575095842402, -0.22958464302301074, 0.14775194500219527, 0.21875967230389726, 0.006298127755275871, 0.3376707885952958, -0.4098184181669031, -0.1591591108926987, 0.1496261326001441, 0.1294164977342182, 0.07441889587789774, -0.025792587143144603, -0.26606620702309064, 0.09821562785430844, -0.11342804422265435, -0.17667545186894307, -0.05170990001544895, 0.003926427586071463, 0.064162147915866, -0.34621493302914036, 0.11026937845555773, 0.06502105898002207, -0.0025651856053463488, -0.1311392770772968, -0.04217057512983321, 0.012156439496271581, 0.09379206464839089, 0.028760657833709596, 0.06864394088197186, 0.03759929612391146, -0.06355284906345902, -0.04584950438128358, 0.31302823278918324, -0.10834302577044232, -0.2541212882981243, 0.15849067397830807, -0.16181717525763684, -0.08326108620154211, 0.11304712291043925, 0.14677194755030684, 0.1512417614911276, -0.10284959701035755, 0.18120314988675135, -0.07249628329447594, 0.1752506604485483, 0.07305786999346442, 0.03426650560921036, 0.11575145579605217, 0.13559853885861406, 0.2091954552697534, 0.1449869723937261, -0.07780593297940802, -0.09673046000534669, -0.33759835954890194, -0.1982240823647344, -0.19761591934296022, 0.10459455716457353, -0.166671052395404, -0.23933660857244787, 0.3282797889929848, 0.07645302563793509, 0.17166020252169614, 0.06074542463027749, 0.22019584555493063, 0.15868474231157675, 0.030908908549112726, 0.06401945524905102, 0.22522103733730964, 0.19243852228924901, 0.10106608209323632, -0.20392846703916473, 0.032909894721156144, 0.16753007600039063]
1,803.07529
The Bright $\gamma$-ray Flare of 3C 279 in June 2015: AGILE Detection and Multifrequency Follow-up Observations
We report the AGILE detection and the results of the multifrequency follow-up observations of a bright $\gamma$-ray flare of the blazar 3C 279 in June 2015. We use AGILE-GRID and Fermi-LAT $\gamma$-ray data, together with Swift-XRT, Swift-UVOT, and ground-based GASP-WEBT optical observations, including polarization information, to study the source variability and the overall spectral energy distribution during the $\gamma$-ray flare. The $\gamma$-ray flaring data, compared with as yet unpublished simultaneous optical data which allow to set constraints on the big blue bump disk luminosity, show very high Compton dominance values of $\sim 100$, with a ratio of $\gamma$-ray to optical emission rising by a factor of three in a few hours. The multi-wavelength behavior of the source during the flare challenges one-zone leptonic theoretical models. The new observations during the June 2015 flare are also compared with already published data and non-simultaneous historical 3C 279 archival data.
astro-ph.HE
we report the agile detection and the results of the multifrequency followup observations of a bright gammaray flare of the blazar 3c 279 in june 2015 we use agilegrid and fermilat gammaray data together with swiftxrt swiftuvot and groundbased gaspwebt optical observations including polarization information to study the source variability and the overall spectral energy distribution during the gammaray flare the gammaray flaring data compared with as yet unpublished simultaneous optical data which allow to set constraints on the big blue bump disk luminosity show very high compton dominance values of sim 100 with a ratio of gammaray to optical emission rising by a factor of three in a few hours the multiwavelength behavior of the source during the flare challenges onezone leptonic theoretical models the new observations during the june 2015 flare are also compared with already published data and nonsimultaneous historical 3c 279 archival data
[['we', 'report', 'the', 'agile', 'detection', 'and', 'the', 'results', 'of', 'the', 'multifrequency', 'followup', 'observations', 'of', 'a', 'bright', 'gammaray', 'flare', 'of', 'the', 'blazar', '3c', '279', 'in', 'june', '2015', 'we', 'use', 'agilegrid', 'and', 'fermilat', 'gammaray', 'data', 'together', 'with', 'swiftxrt', 'swiftuvot', 'and', 'groundbased', 'gaspwebt', 'optical', 'observations', 'including', 'polarization', 'information', 'to', 'study', 'the', 'source', 'variability', 'and', 'the', 'overall', 'spectral', 'energy', 'distribution', 'during', 'the', 'gammaray', 'flare', 'the', 'gammaray', 'flaring', 'data', 'compared', 'with', 'as', 'yet', 'unpublished', 'simultaneous', 'optical', 'data', 'which', 'allow', 'to', 'set', 'constraints', 'on', 'the', 'big', 'blue', 'bump', 'disk', 'luminosity', 'show', 'very', 'high', 'compton', 'dominance', 'values', 'of', 'sim', '100', 'with', 'a', 'ratio', 'of', 'gammaray', 'to', 'optical', 'emission', 'rising', 'by', 'a', 'factor', 'of', 'three', 'in', 'a', 'few', 'hours', 'the', 'multiwavelength', 'behavior', 'of', 'the', 'source', 'during', 'the', 'flare', 'challenges', 'onezone', 'leptonic', 'theoretical', 'models', 'the', 'new', 'observations', 'during', 'the', 'june', '2015', 'flare', 'are', 'also', 'compared', 'with', 'already', 'published', 'data', 'and', 'nonsimultaneous', 'historical', '3c', '279', 'archival', 'data']]
[-0.01939400869618062, 0.09647257290590479, -0.05060342240913891, 0.12294875426680407, -0.17311939096623133, -0.09043445157482713, 0.06677393333948388, 0.5201195567960337, -0.1392734979285675, -0.43023458944925036, 0.12294923091468839, -0.35061237162777353, 0.005317399135733746, 0.25710962363677164, -0.024311604507292816, 0.02464329247249268, 0.19653807036882762, -0.15554259236122728, -0.010551748246502537, -0.23954466975303557, 0.21245319665200552, 0.18636144142040387, 0.23012668304272046, -0.0015467696119936146, 0.06960482367387257, -0.05835413520832603, -0.1269653484789135, -0.13281921763606622, -0.06588892640900754, 0.07507486029711812, 0.22365050873241318, 0.14208034174666276, 0.16986014910650496, -0.3590388849098869, -0.25476587542845885, 0.061280407702081464, 0.08423367951922182, -0.06157943113235009, 0.014980938777384557, -0.34705733987629467, -0.049104916684164786, -0.203720158029373, -0.13881778680294954, 0.08197213292476677, 0.05136474716432747, 0.03104521159944283, -0.1922127066756643, 0.09273027450770463, -0.05473814120113875, 0.12233966351391709, -0.1956419268857409, -0.027502452618866958, -0.024195414576616114, 0.03839960425053121, 0.1001147587980036, 0.07437375288529537, 0.08588896467204706, -0.10542115014518427, -0.166690956560426, 0.35201627768886584, -0.0654747576379933, 0.1306704248231994, 0.14877625462261732, -0.20739757720987648, -0.28083160326049544, 0.21221110438072713, 0.16924884129984014, 0.036232991286610464, -0.1544639301410287, 0.0009130348057840907, -0.003565532573479779, 0.21227937254921667, 0.005219564846000907, 0.059607995518793665, 0.25349186740967694, 0.14142202815281696, -0.03937019745116027, 0.15721659192682377, -0.35699757407767835, 0.04412851728448251, -0.31420255545526743, -0.005011814494370197, -0.16105516045750276, 0.12174599879376945, -0.10879998969270128, -0.09908871654560472, 0.45802073402418975, 0.06143724982987861, 0.24094633717995873, 0.02030200652895356, 0.3121957959239783, 0.04967829290958403, 0.023785157731043644, 0.15416717026889526, 0.3962944356382501, 0.09521805822728899, 0.22295526454389905, -0.17006315694501004, 0.03310624903486091, -0.0623078147411904]
1,803.0753
Unitarity-limited behavior of three-body collisions in a p-wave interacting Fermi gas
We experimentally investigate the unitarity-limited behavior of the three-body loss near a p-wave Feshbach resonance in a single-component Fermi gas of $^6$Li atoms. At the unitarity limit, the three-body loss coefficient $L_{3}$ exhibits universality in the sense that it is independent of the interaction strength and follows the predicted temperature scaling law of $L_3 \propto T^{-2}$. When decreasing the interaction strength from the unitarity regime, the three-body loss coefficient as a function of the interaction strength and temperature can be described by the theory based on the association of an excited resonant quasibound state and its relaxation into a deep stable dimer by collision with a third atom in the framework of the standard Breit-Wigner theoretical approach. The results reported here are important to understand the properties of a resonant p-wave Fermi gas in the prospect of quantum few- and many-body physics.
cond-mat.quant-gas physics.atom-ph quant-ph
we experimentally investigate the unitaritylimited behavior of the threebody loss near a pwave feshbach resonance in a singlecomponent fermi gas of 6li atoms at the unitarity limit the threebody loss coefficient l_3 exhibits universality in the sense that it is independent of the interaction strength and follows the predicted temperature scaling law of l_3 propto t2 when decreasing the interaction strength from the unitarity regime the threebody loss coefficient as a function of the interaction strength and temperature can be described by the theory based on the association of an excited resonant quasibound state and its relaxation into a deep stable dimer by collision with a third atom in the framework of the standard breitwigner theoretical approach the results reported here are important to understand the properties of a resonant pwave fermi gas in the prospect of quantum few and manybody physics
[['we', 'experimentally', 'investigate', 'the', 'unitaritylimited', 'behavior', 'of', 'the', 'threebody', 'loss', 'near', 'a', 'pwave', 'feshbach', 'resonance', 'in', 'a', 'singlecomponent', 'fermi', 'gas', 'of', '6li', 'atoms', 'at', 'the', 'unitarity', 'limit', 'the', 'threebody', 'loss', 'coefficient', 'l_3', 'exhibits', 'universality', 'in', 'the', 'sense', 'that', 'it', 'is', 'independent', 'of', 'the', 'interaction', 'strength', 'and', 'follows', 'the', 'predicted', 'temperature', 'scaling', 'law', 'of', 'l_3', 'propto', 't2', 'when', 'decreasing', 'the', 'interaction', 'strength', 'from', 'the', 'unitarity', 'regime', 'the', 'threebody', 'loss', 'coefficient', 'as', 'a', 'function', 'of', 'the', 'interaction', 'strength', 'and', 'temperature', 'can', 'be', 'described', 'by', 'the', 'theory', 'based', 'on', 'the', 'association', 'of', 'an', 'excited', 'resonant', 'quasibound', 'state', 'and', 'its', 'relaxation', 'into', 'a', 'deep', 'stable', 'dimer', 'by', 'collision', 'with', 'a', 'third', 'atom', 'in', 'the', 'framework', 'of', 'the', 'standard', 'breitwigner', 'theoretical', 'approach', 'the', 'results', 'reported', 'here', 'are', 'important', 'to', 'understand', 'the', 'properties', 'of', 'a', 'resonant', 'pwave', 'fermi', 'gas', 'in', 'the', 'prospect', 'of', 'quantum', 'few', 'and', 'manybody', 'physics']]
[-0.12871355395911682, 0.19238758935278666, -0.09064108165863141, 0.073527517155449, 0.015337058054414434, -0.1620942955462813, 0.08027401012384897, 0.31488263348615925, -0.26731038514629635, -0.2494126488520226, -0.048323661587397815, -0.33200471537371334, -0.1016021658613963, 0.15016280657375677, 0.08802862920549134, 0.10375028895173209, 0.02543472461271244, 0.043046393635040016, -0.07924673729740135, -0.18461618762673207, 0.33281745814429725, 0.05505552642030189, 0.2386822318510664, 0.15234156286435752, 0.018413337609979888, 0.023741071176323524, 0.11800133345425654, -0.037741054459409396, -0.1493872108652103, 0.07463226285041638, 0.20139330386513726, -0.007531976495825597, 0.21251918132823538, -0.3847545588218515, -0.20019904268302127, 0.030982932311968064, 0.17114136423456522, 0.10805230232244226, -0.013807128712331588, -0.3090784206894607, -0.03458429773298787, -0.1997576780079431, -0.18428694919197702, -0.06932994478028005, 0.0303693996368527, -0.01896429126000058, -0.2696151658367943, 0.14200618975258, 0.06618317858886603, 0.05010532804856628, -0.08664901896861946, -0.09686940767093968, 0.0015548008594917736, 0.027858676237396858, 0.05031860232661465, 0.03086749687922043, 0.18104306502844875, -0.18027515784824188, -0.0751412716558085, 0.38842578482335355, -0.11806862311057327, -0.10420266174199716, 0.20410406896614955, -0.1738136371427124, -0.06695161808387075, 0.1492646141469636, 0.13886990682812225, 0.0577182900630414, -0.1374788874106254, 0.11557992104229617, -0.043024469737593135, 0.16950430563637908, 0.061033049406496884, 0.055259786823331575, 0.21819266094498233, 0.18025113723378525, -0.011376370938206223, 0.13064441541422972, -0.14025098593203797, -0.11187463519688119, -0.28789197393811083, -0.10258226405540613, -0.22110306356154696, 0.026028302084969382, -0.05308639218097776, -0.13475878586710602, 0.3600003736775736, 0.0836273349965447, 0.27154797566136424, -0.0060809556539104855, 0.271286671077767, 0.17604429725619872, 0.06318448804987883, 0.028212849693504016, 0.33794990033698336, 0.16432063970026153, 0.04429571507957725, -0.35654843128843783, 0.043964541979580066, 0.04923159139506309]
1,803.07531
Hybrid Contact Preintegration for Visual-Inertial-Contact State Estimation Using Factor Graphs
The factor graph framework is a convenient modeling technique for robotic state estimation where states are represented as nodes, and measurements are modeled as factors. When designing a sensor fusion framework for legged robots, one often has access to visual, inertial, joint encoder, and contact sensors. While visual-inertial odometry has been studied extensively in this framework, the addition of a preintegrated contact factor for legged robots has been only recently proposed. This allowed for integration of encoder and contact measurements into existing factor graphs, however, new nodes had to be added to the graph every time contact was made or broken. In this work, to cope with the problem of switching contact frames, we propose a hybrid contact preintegration theory that allows contact information to be integrated through an arbitrary number of contact switches. The proposed hybrid modeling approach reduces the number of required variables in the nonlinear optimization problem by only requiring new states to be added alongside camera or selected keyframes. This method is evaluated using real experimental data collected from a Cassie-series robot where the trajectory of the robot produced by a motion capture system is used as a proxy for ground truth. The evaluation shows that inclusion of the proposed preintegrated hybrid contact factor alongside visual-inertial navigation systems improves estimation accuracy as well as robustness to vision failure, while its generalization makes it more accessible for legged platforms.
cs.RO
the factor graph framework is a convenient modeling technique for robotic state estimation where states are represented as nodes and measurements are modeled as factors when designing a sensor fusion framework for legged robots one often has access to visual inertial joint encoder and contact sensors while visualinertial odometry has been studied extensively in this framework the addition of a preintegrated contact factor for legged robots has been only recently proposed this allowed for integration of encoder and contact measurements into existing factor graphs however new nodes had to be added to the graph every time contact was made or broken in this work to cope with the problem of switching contact frames we propose a hybrid contact preintegration theory that allows contact information to be integrated through an arbitrary number of contact switches the proposed hybrid modeling approach reduces the number of required variables in the nonlinear optimization problem by only requiring new states to be added alongside camera or selected keyframes this method is evaluated using real experimental data collected from a cassieseries robot where the trajectory of the robot produced by a motion capture system is used as a proxy for ground truth the evaluation shows that inclusion of the proposed preintegrated hybrid contact factor alongside visualinertial navigation systems improves estimation accuracy as well as robustness to vision failure while its generalization makes it more accessible for legged platforms
[['the', 'factor', 'graph', 'framework', 'is', 'a', 'convenient', 'modeling', 'technique', 'for', 'robotic', 'state', 'estimation', 'where', 'states', 'are', 'represented', 'as', 'nodes', 'and', 'measurements', 'are', 'modeled', 'as', 'factors', 'when', 'designing', 'a', 'sensor', 'fusion', 'framework', 'for', 'legged', 'robots', 'one', 'often', 'has', 'access', 'to', 'visual', 'inertial', 'joint', 'encoder', 'and', 'contact', 'sensors', 'while', 'visualinertial', 'odometry', 'has', 'been', 'studied', 'extensively', 'in', 'this', 'framework', 'the', 'addition', 'of', 'a', 'preintegrated', 'contact', 'factor', 'for', 'legged', 'robots', 'has', 'been', 'only', 'recently', 'proposed', 'this', 'allowed', 'for', 'integration', 'of', 'encoder', 'and', 'contact', 'measurements', 'into', 'existing', 'factor', 'graphs', 'however', 'new', 'nodes', 'had', 'to', 'be', 'added', 'to', 'the', 'graph', 'every', 'time', 'contact', 'was', 'made', 'or', 'broken', 'in', 'this', 'work', 'to', 'cope', 'with', 'the', 'problem', 'of', 'switching', 'contact', 'frames', 'we', 'propose', 'a', 'hybrid', 'contact', 'preintegration', 'theory', 'that', 'allows', 'contact', 'information', 'to', 'be', 'integrated', 'through', 'an', 'arbitrary', 'number', 'of', 'contact', 'switches', 'the', 'proposed', 'hybrid', 'modeling', 'approach', 'reduces', 'the', 'number', 'of', 'required', 'variables', 'in', 'the', 'nonlinear', 'optimization', 'problem', 'by', 'only', 'requiring', 'new', 'states', 'to', 'be', 'added', 'alongside', 'camera', 'or', 'selected', 'keyframes', 'this', 'method', 'is', 'evaluated', 'using', 'real', 'experimental', 'data', 'collected', 'from', 'a', 'cassieseries', 'robot', 'where', 'the', 'trajectory', 'of', 'the', 'robot', 'produced', 'by', 'a', 'motion', 'capture', 'system', 'is', 'used', 'as', 'a', 'proxy', 'for', 'ground', 'truth', 'the', 'evaluation', 'shows', 'that', 'inclusion', 'of', 'the', 'proposed', 'preintegrated', 'hybrid', 'contact', 'factor', 'alongside', 'visualinertial', 'navigation', 'systems', 'improves', 'estimation', 'accuracy', 'as', 'well', 'as', 'robustness', 'to', 'vision', 'failure', 'while', 'its', 'generalization', 'makes', 'it', 'more', 'accessible', 'for', 'legged', 'platforms']]
[-0.12191710986572334, 0.048899515787431076, -0.07221057898854709, -0.013803727362442416, -0.10579360417764762, -0.22424716364937544, 0.027542885827956366, 0.4169619842673299, -0.2436030764305354, -0.3663422429918087, 0.07581736156235225, -0.2538937396091506, -0.17140760972036112, 0.1955293060384755, -0.11900197813118776, 0.1376464796041295, 0.1322414236050902, 0.056105429662897346, -0.01853910944292097, -0.20394895675693486, 0.2635186644299116, 0.049471030031844714, 0.2717582044033093, 0.029630304604230835, 0.16524895368513234, 0.05447129397512542, 0.0002886497532017529, 0.06425219149667978, -0.06185777223969314, 0.1212877084160874, 0.29842580883294056, 0.12188554782940252, 0.2720103729456053, -0.4100822964456115, -0.246210177592604, 0.07828936180208232, 0.13651835615244887, 0.0836210929174458, -0.017013679068158722, -0.36205873406363714, 0.07920828747868153, -0.2033798368115797, -0.0593963585480855, -0.09351554132219211, 0.015465486056075013, -0.021070989141850894, -0.29483268688159897, -0.009055674058015876, 0.011892105979345145, 0.05917527606131977, -0.0504612914647341, -0.07603998899766934, 0.010826260751667273, 0.19924633780352324, 0.0028386264367045127, 0.05513953071555267, 0.16856228434034135, -0.1339996296868274, -0.13615053968006297, 0.3885862411658183, 0.0025392573553635256, -0.23673934474535255, 0.18386714860339295, -0.027104101888434, -0.12963187469546844, 0.13297427269722464, 0.2153352348250337, 0.11405455571805541, -0.20329177547739227, 0.03617311699304866, 0.0006955062051239455, 0.16350530046600334, 0.052104775040161574, -0.0214426232105952, 0.15095691661177812, 0.2513359354574089, 0.09509581156628977, 0.1313556824868007, -0.0945051539958262, -0.10243410494488138, -0.22306264477284177, -0.15185608640152576, -0.2030647239288524, -0.01684082403592364, -0.060754734482668875, -0.12495706271749504, 0.3525457470878509, 0.16107932905313269, 0.19991835616709633, 0.05695237859918993, 0.37017856066211546, 0.08422931011591572, 0.11512659507671147, 0.08298659553813571, 0.22069540940995874, 0.07582729485279585, 0.10517012741986727, -0.15929373141311928, 0.11031502376085725, 0.026567356985620353]
1,803.07532
Model-independent constraints on the Abelian $Z'$ couplings within the ATLAS data on the dilepton production processes at $\sqrt{s} =$ 13 TeV
The study of lepton pair production is a powerful test of the Standard Model (SM) and can be used to search for phenomena beyond the SM. New heavy neutral bosons $Z'$ decaying to charged lepton pairs $l^+l^-$ ($l=e, \mu$) are predicted by many scenarios of new physics, including models with extended gauge sector. We estimate the LHC $Z'$ discovery potential with Run 2 data comprised of 36.1 fb$^{-1}$ of $pp$ collisions at $\sqrt{s}=13$ TeV and recorded by ATLAS detector at the CERN LHC. The model-independent constraints on the $Z'$ fermion couplings were obtained for the first time for a selected set of $Z'$ signal mass points of $M_{Z'}=2$, 3, and 4 TeV by using the ATLAS data collected at the LHC. The analysis is based on the derived earlier special relations between the $Z'$ couplings proper to the renormalizable theories. Taking into account the dependence of $Z-Z'$ mixing angle $\theta_0$ on the $Z'$ axial-vector coupling $a$, the limits on $\theta_0$ are established as $\theta_0 < 10^{-4} - 10^{-3}$ in the investigated $Z'$ mass range.
hep-ph
the study of lepton pair production is a powerful test of the standard model sm and can be used to search for phenomena beyond the sm new heavy neutral bosons z decaying to charged lepton pairs ll le mu are predicted by many scenarios of new physics including models with extended gauge sector we estimate the lhc z discovery potential with run 2 data comprised of 361 fb1 of pp collisions at sqrts13 tev and recorded by atlas detector at the cern lhc the modelindependent constraints on the z fermion couplings were obtained for the first time for a selected set of z signal mass points of m_z2 3 and 4 tev by using the atlas data collected at the lhc the analysis is based on the derived earlier special relations between the z couplings proper to the renormalizable theories taking into account the dependence of zz mixing angle theta_0 on the z axialvector coupling a the limits on theta_0 are established as theta_0 104 103 in the investigated z mass range
[['the', 'study', 'of', 'lepton', 'pair', 'production', 'is', 'a', 'powerful', 'test', 'of', 'the', 'standard', 'model', 'sm', 'and', 'can', 'be', 'used', 'to', 'search', 'for', 'phenomena', 'beyond', 'the', 'sm', 'new', 'heavy', 'neutral', 'bosons', 'z', 'decaying', 'to', 'charged', 'lepton', 'pairs', 'll', 'le', 'mu', 'are', 'predicted', 'by', 'many', 'scenarios', 'of', 'new', 'physics', 'including', 'models', 'with', 'extended', 'gauge', 'sector', 'we', 'estimate', 'the', 'lhc', 'z', 'discovery', 'potential', 'with', 'run', '2', 'data', 'comprised', 'of', '361', 'fb1', 'of', 'pp', 'collisions', 'at', 'sqrts13', 'tev', 'and', 'recorded', 'by', 'atlas', 'detector', 'at', 'the', 'cern', 'lhc', 'the', 'modelindependent', 'constraints', 'on', 'the', 'z', 'fermion', 'couplings', 'were', 'obtained', 'for', 'the', 'first', 'time', 'for', 'a', 'selected', 'set', 'of', 'z', 'signal', 'mass', 'points', 'of', 'm_z2', '3', 'and', '4', 'tev', 'by', 'using', 'the', 'atlas', 'data', 'collected', 'at', 'the', 'lhc', 'the', 'analysis', 'is', 'based', 'on', 'the', 'derived', 'earlier', 'special', 'relations', 'between', 'the', 'z', 'couplings', 'proper', 'to', 'the', 'renormalizable', 'theories', 'taking', 'into', 'account', 'the', 'dependence', 'of', 'zz', 'mixing', 'angle', 'theta_0', 'on', 'the', 'z', 'axialvector', 'coupling', 'a', 'the', 'limits', 'on', 'theta_0', 'are', 'established', 'as', 'theta_0', '104', '103', 'in', 'the', 'investigated', 'z', 'mass', 'range']]
[-0.08135318297481295, 0.22593283532782957, -0.03456136523502294, 0.1380974131184197, -0.035082148746749774, -0.1791239000862291, 0.0332244380409721, 0.29792256561124175, -0.1919355661131788, -0.3435647137961242, 0.025097033563259513, -0.33124724043083786, 0.06887444986543499, 0.17049219891927098, 0.13014618250836488, 0.07659359060520263, 0.07208734616599327, -0.028342850151645064, -0.0634153398609352, -0.2613595994940667, 0.25607460985220104, 0.057150842968461124, 0.20570189657358473, 0.053466224195543935, 0.08436331448285993, 0.04562511628352885, -0.06751440163751858, -0.0926689911081434, -0.15279878496915253, 0.0642896909850479, 0.18816732444088832, 0.09143615265506817, 0.13220808466051726, -0.30860370743023446, -0.09597421330291518, 0.15194467821180127, 0.1443600942743509, 0.026461829237780687, -0.07862968238335925, -0.3755582491704804, 0.1384207751482812, -0.1957398576967873, -0.11107436424327018, 0.01902586602887442, 0.007629812454133359, -0.06247865614280928, -0.35412800103036124, 0.10790024694802543, -0.07099855253148045, 0.08893764049672997, 0.023592297158333973, -0.20579465961240795, -0.09636794488882473, -0.006167477475977395, 0.1151820521055163, 0.05062190454715841, 0.15952149657451353, -0.16596515602120848, -0.17959463916350762, 0.3632933499053294, -0.07419838717878731, -0.13670659220376766, 0.22292170444026935, -0.1915644286119184, -0.15393572487326226, 0.13344623743851539, 0.28017127194420194, 0.051468600694978134, -0.2209320954198754, 0.21743498701327427, -0.01859313151853289, 0.1641511807372512, 0.05418721394515921, 0.032799808382257, 0.2222637352804372, 0.2077366634174575, -0.009438407096367459, 0.011092511779320057, -0.13960158942283543, -0.025687051146442808, -0.4546544281332645, -0.08934308359667464, -0.10097277845218128, 0.04971084744753424, -0.07803186080068265, -0.013123923292665114, 0.36624512360106376, 0.11694418628386027, 0.3018638549594555, 0.022420407094191328, 0.23363609176784278, 0.08557699776539203, 0.08194277704108593, 0.025357160706419583, 0.33198707888909984, 0.12473200060708751, 0.1287479079707504, -0.16122036845813137, -0.027843791144076993, 0.082758522194507]
1,803.07533
Void Lensing as a Test of Gravity
We investigate the potential of weak lensing by voids to test for deviations from General Relativity. We calculate the expected lensing signal of a scalar field with derivative couplings, finding that it has the potential to boost the tangential shear both within and outside the void radius. We use voids traced by Luminous Red Galaxies in SDSS to demonstrate the methodology of testing these predictions. We find that the void central density parameter, as inferred from the lensing signal, can shift from its GR value by up to 20% in some galileon gravity models. Since this parameter can be estimated independently using the galaxy tracer profiles of voids, our method provides a consistency check of the gravity theory. Although galileon gravity is now disfavoured as a source of cosmic acceleration by other datasets, the methods we demonstrate here can be used to test for more general fifth force effects with upcoming void lensing data.
astro-ph.CO gr-qc hep-ph
we investigate the potential of weak lensing by voids to test for deviations from general relativity we calculate the expected lensing signal of a scalar field with derivative couplings finding that it has the potential to boost the tangential shear both within and outside the void radius we use voids traced by luminous red galaxies in sdss to demonstrate the methodology of testing these predictions we find that the void central density parameter as inferred from the lensing signal can shift from its gr value by up to 20 in some galileon gravity models since this parameter can be estimated independently using the galaxy tracer profiles of voids our method provides a consistency check of the gravity theory although galileon gravity is now disfavoured as a source of cosmic acceleration by other datasets the methods we demonstrate here can be used to test for more general fifth force effects with upcoming void lensing data
[['we', 'investigate', 'the', 'potential', 'of', 'weak', 'lensing', 'by', 'voids', 'to', 'test', 'for', 'deviations', 'from', 'general', 'relativity', 'we', 'calculate', 'the', 'expected', 'lensing', 'signal', 'of', 'a', 'scalar', 'field', 'with', 'derivative', 'couplings', 'finding', 'that', 'it', 'has', 'the', 'potential', 'to', 'boost', 'the', 'tangential', 'shear', 'both', 'within', 'and', 'outside', 'the', 'void', 'radius', 'we', 'use', 'voids', 'traced', 'by', 'luminous', 'red', 'galaxies', 'in', 'sdss', 'to', 'demonstrate', 'the', 'methodology', 'of', 'testing', 'these', 'predictions', 'we', 'find', 'that', 'the', 'void', 'central', 'density', 'parameter', 'as', 'inferred', 'from', 'the', 'lensing', 'signal', 'can', 'shift', 'from', 'its', 'gr', 'value', 'by', 'up', 'to', '20', 'in', 'some', 'galileon', 'gravity', 'models', 'since', 'this', 'parameter', 'can', 'be', 'estimated', 'independently', 'using', 'the', 'galaxy', 'tracer', 'profiles', 'of', 'voids', 'our', 'method', 'provides', 'a', 'consistency', 'check', 'of', 'the', 'gravity', 'theory', 'although', 'galileon', 'gravity', 'is', 'now', 'disfavoured', 'as', 'a', 'source', 'of', 'cosmic', 'acceleration', 'by', 'other', 'datasets', 'the', 'methods', 'we', 'demonstrate', 'here', 'can', 'be', 'used', 'to', 'test', 'for', 'more', 'general', 'fifth', 'force', 'effects', 'with', 'upcoming', 'void', 'lensing', 'data']]
[-0.05836834529242418, 0.05214346761440302, -0.11854836644904156, 0.11952136430583966, -0.11873978535741471, -0.08561247571480352, -0.006173347556122953, 0.35292719817091406, -0.2037549113504008, -0.34790051148527046, 0.04160543156684945, -0.2745987167944769, -0.10168887897358313, 0.19509905261834143, 0.0010791975784103399, 0.015987143552084998, 0.016221657961564648, -0.01610934157559479, -0.053800159794665486, -0.28893601701008276, 0.30208712638742835, 0.10822189959104765, 0.22553015180240543, -0.01385658341097077, 0.06234005382118214, -0.07564928144966433, -0.06963137649574208, 0.09648265392223204, -0.1661852052192054, 0.05600706580270372, 0.21257394836118385, 0.15450865376813264, 0.23251746427993497, -0.3653006122943449, -0.24483338294720108, 0.10569296800314112, 0.1504957088716812, 0.16875917015549222, -0.08337384529682798, -0.3436344314681052, 0.08039841015653854, -0.17118491301186045, -0.15584633110224136, -0.04738552215835684, -0.0012916251253518095, 0.023245714532283992, -0.2521223993057252, 0.19162862956548085, -0.026536122898801, 0.005087007680762704, -0.03904740003847771, -0.04749072429968963, -0.03919441981978908, 0.05704843430997586, 0.09694067681625534, 0.06606129481451126, 0.2013174239969389, -0.1631366702706807, -0.031650165995498275, 0.46241581127918385, -0.1442338904447539, -0.13306566623535443, 0.13760597210425835, -0.20233349651461105, -0.15295959711558632, 0.050117793901784814, 0.16202499975704335, 0.06433297482169122, -0.17096952040966634, 0.08881595631563952, 0.03097227245702275, 0.17479890112972263, 0.08044146003304412, -0.03362738937749936, 0.3151283481267172, 0.09512563567009888, 0.07863956464034227, 0.10365440245444112, -0.17844054346009122, 0.00018221852157942274, -0.3074818426114205, -0.08040511376502646, -0.17700336868088548, 0.039065562227934406, -0.18340508722956822, -0.14210998082182721, 0.35147592651373527, 0.19653083488357243, 0.15811170606084723, 0.10018682244608736, 0.2922899517678208, 0.06782609581351642, 0.12601977417641622, 0.04121275068118612, 0.3760630284572495, 0.16400786581775778, 0.05470588627156451, -0.200448281759118, 0.01610418052379308, 0.006431628110842755]
1,803.07534
Stacked Neural Networks for end-to-end ciliary motion analysis
Cilia are hairlike structures protruding from nearly every cell in the body. Diseases known as ciliopathies, where cilia function is disrupted, can result in a wide spectrum of disorders. However, most techniques for assessing ciliary motion rely on manual identification and tracking of cilia; this process is laborious and error-prone, and does not scale well. Even where automated ciliary motion analysis tools exist, their applicability is limited. Here, we propose an end-to-end computational machine learning pipeline that automatically identifies regions of cilia from videos, extracts patches of cilia, and classifies patients as exhibiting normal or abnormal ciliary motion. In particular, we demonstrate how convolutional LSTM are able to encode complex features while remaining sensitive enough to differentiate between a variety of motion patterns. Our framework achieves 90% with only a few hundred training epochs. We find that the combination of segmentation and classification networks in a single pipeline yields performance comparable to existing computational pipelines, while providing the additional benefit of an end-to-end, fully-automated analysis toolbox for ciliary motion.
cs.LG stat.ML
cilia are hairlike structures protruding from nearly every cell in the body diseases known as ciliopathies where cilia function is disrupted can result in a wide spectrum of disorders however most techniques for assessing ciliary motion rely on manual identification and tracking of cilia this process is laborious and errorprone and does not scale well even where automated ciliary motion analysis tools exist their applicability is limited here we propose an endtoend computational machine learning pipeline that automatically identifies regions of cilia from videos extracts patches of cilia and classifies patients as exhibiting normal or abnormal ciliary motion in particular we demonstrate how convolutional lstm are able to encode complex features while remaining sensitive enough to differentiate between a variety of motion patterns our framework achieves 90 with only a few hundred training epochs we find that the combination of segmentation and classification networks in a single pipeline yields performance comparable to existing computational pipelines while providing the additional benefit of an endtoend fullyautomated analysis toolbox for ciliary motion
[['cilia', 'are', 'hairlike', 'structures', 'protruding', 'from', 'nearly', 'every', 'cell', 'in', 'the', 'body', 'diseases', 'known', 'as', 'ciliopathies', 'where', 'cilia', 'function', 'is', 'disrupted', 'can', 'result', 'in', 'a', 'wide', 'spectrum', 'of', 'disorders', 'however', 'most', 'techniques', 'for', 'assessing', 'ciliary', 'motion', 'rely', 'on', 'manual', 'identification', 'and', 'tracking', 'of', 'cilia', 'this', 'process', 'is', 'laborious', 'and', 'errorprone', 'and', 'does', 'not', 'scale', 'well', 'even', 'where', 'automated', 'ciliary', 'motion', 'analysis', 'tools', 'exist', 'their', 'applicability', 'is', 'limited', 'here', 'we', 'propose', 'an', 'endtoend', 'computational', 'machine', 'learning', 'pipeline', 'that', 'automatically', 'identifies', 'regions', 'of', 'cilia', 'from', 'videos', 'extracts', 'patches', 'of', 'cilia', 'and', 'classifies', 'patients', 'as', 'exhibiting', 'normal', 'or', 'abnormal', 'ciliary', 'motion', 'in', 'particular', 'we', 'demonstrate', 'how', 'convolutional', 'lstm', 'are', 'able', 'to', 'encode', 'complex', 'features', 'while', 'remaining', 'sensitive', 'enough', 'to', 'differentiate', 'between', 'a', 'variety', 'of', 'motion', 'patterns', 'our', 'framework', 'achieves', '90', 'with', 'only', 'a', 'few', 'hundred', 'training', 'epochs', 'we', 'find', 'that', 'the', 'combination', 'of', 'segmentation', 'and', 'classification', 'networks', 'in', 'a', 'single', 'pipeline', 'yields', 'performance', 'comparable', 'to', 'existing', 'computational', 'pipelines', 'while', 'providing', 'the', 'additional', 'benefit', 'of', 'an', 'endtoend', 'fullyautomated', 'analysis', 'toolbox', 'for', 'ciliary', 'motion']]
[-0.10106493313443414, 0.05037299559297112, -0.030341842738423674, 0.033770120461938516, -0.12319933751686699, -0.1739157097694087, 0.004561551125897538, 0.43120809230077567, -0.2696148627638606, -0.32917579932836816, 0.07794712440296453, -0.25504628611573327, -0.23264313630698735, 0.2454938565344838, -0.1563080142590306, 0.033408072325983085, 0.14787203927560422, 0.014456921950026992, 0.012986201808200263, -0.1941119544457511, 0.21460162168313263, 0.007498210320980954, 0.3237935372412072, -0.010289775432154005, 0.14369337983884006, -0.024452334605268248, -0.030623195712299395, -0.00016696213112611855, -0.06614456150358212, 0.15259697408847778, 0.31801938520567047, 0.17557845471656902, 0.27714859502434375, -0.44686674089583295, -0.22855881104312306, 0.0778185801249319, 0.22738056156473854, 0.12321567881735973, -0.015475317472702869, -0.29402821532650186, 0.10507829435352635, -0.14342826512265242, -0.053641525034825985, -0.1702521707629785, -0.006468806291065578, 0.01023848604139251, -0.2397846038414476, 0.11719191989340332, 0.0853335664869519, 0.13113125929625571, -0.07175555586166281, -0.05900753373030706, -0.0121664331042363, 0.20832673701529747, 0.046622829948145886, 0.03799795214893363, 0.22282012945912097, -0.1953974762637656, -0.12484956864015355, 0.3828981650849095, -0.007951684501243844, -0.22073886037105694, 0.2500701035550308, -0.07663634532391803, -0.1355570579284436, 0.17228350589894467, 0.19765402937212326, 0.12309084643216227, -0.17603004885105683, -0.030850272042568707, 0.006463129411540216, 0.2114529526249195, 0.07844840658037269, -0.02778909725713588, 0.2078370241880683, 0.27307605679241187, 0.03521058978505954, 0.1135905222645739, -0.1741240020090204, -0.041443391484097536, -0.21874665273796945, -0.10361707000300244, -0.12650988316939524, -0.015910304998171688, -0.07098328168294324, -0.188813581663583, 0.3801707810877512, 0.16860785808655368, 0.18960155479033433, 0.09800748800071665, 0.337126062981995, -0.05459084251820708, 0.13733097716716916, 0.08823189496373136, 0.20281524718752952, 0.003350384925614067, 0.10639228593382064, -0.17804586219530652, 0.09612580215547323, 0.016132290987852252]
1,803.07535
Tropical Tree Cover in a Heterogeneous Environment: a Reaction-diffusion Model
Observed bimodal tree cover distributions at particular environmental conditions and theoretical models indicate that some areas in the tropics can be in either of the alternative stable vegetation states forest or savanna. However, when including spatial interaction in nonspatial differential equation models of a bistable quantity, only the state with the lowest potential energy remains stable. Our recent reaction-diffusion model of Amazonian tree cover confirmed this and was able to reproduce the observed spatial distribution of forest versus savanna satisfactorily when forced by heterogeneous environmental and anthropogenic variables, even though bistability was underestimated. These conclusions were solely based on simulation results. Here, we perform an analytical and numerical analysis of the model. We derive the Maxwell point (MP) of the homogeneous reaction-diffusion equation without savanna trees as a function of rainfall and human impact and show that the front between forest and nonforest settles at this point as long as savanna tree cover near the front remains sufficiently low. For parameters resulting in higher savanna tree cover near the front, we also find irregular forest-savanna cycles and woodland-savanna bistability, which can both explain the remaining observed bimodality.
q-bio.PE math.DS
observed bimodal tree cover distributions at particular environmental conditions and theoretical models indicate that some areas in the tropics can be in either of the alternative stable vegetation states forest or savanna however when including spatial interaction in nonspatial differential equation models of a bistable quantity only the state with the lowest potential energy remains stable our recent reactiondiffusion model of amazonian tree cover confirmed this and was able to reproduce the observed spatial distribution of forest versus savanna satisfactorily when forced by heterogeneous environmental and anthropogenic variables even though bistability was underestimated these conclusions were solely based on simulation results here we perform an analytical and numerical analysis of the model we derive the maxwell point mp of the homogeneous reactiondiffusion equation without savanna trees as a function of rainfall and human impact and show that the front between forest and nonforest settles at this point as long as savanna tree cover near the front remains sufficiently low for parameters resulting in higher savanna tree cover near the front we also find irregular forestsavanna cycles and woodlandsavanna bistability which can both explain the remaining observed bimodality
[['observed', 'bimodal', 'tree', 'cover', 'distributions', 'at', 'particular', 'environmental', 'conditions', 'and', 'theoretical', 'models', 'indicate', 'that', 'some', 'areas', 'in', 'the', 'tropics', 'can', 'be', 'in', 'either', 'of', 'the', 'alternative', 'stable', 'vegetation', 'states', 'forest', 'or', 'savanna', 'however', 'when', 'including', 'spatial', 'interaction', 'in', 'nonspatial', 'differential', 'equation', 'models', 'of', 'a', 'bistable', 'quantity', 'only', 'the', 'state', 'with', 'the', 'lowest', 'potential', 'energy', 'remains', 'stable', 'our', 'recent', 'reactiondiffusion', 'model', 'of', 'amazonian', 'tree', 'cover', 'confirmed', 'this', 'and', 'was', 'able', 'to', 'reproduce', 'the', 'observed', 'spatial', 'distribution', 'of', 'forest', 'versus', 'savanna', 'satisfactorily', 'when', 'forced', 'by', 'heterogeneous', 'environmental', 'and', 'anthropogenic', 'variables', 'even', 'though', 'bistability', 'was', 'underestimated', 'these', 'conclusions', 'were', 'solely', 'based', 'on', 'simulation', 'results', 'here', 'we', 'perform', 'an', 'analytical', 'and', 'numerical', 'analysis', 'of', 'the', 'model', 'we', 'derive', 'the', 'maxwell', 'point', 'mp', 'of', 'the', 'homogeneous', 'reactiondiffusion', 'equation', 'without', 'savanna', 'trees', 'as', 'a', 'function', 'of', 'rainfall', 'and', 'human', 'impact', 'and', 'show', 'that', 'the', 'front', 'between', 'forest', 'and', 'nonforest', 'settles', 'at', 'this', 'point', 'as', 'long', 'as', 'savanna', 'tree', 'cover', 'near', 'the', 'front', 'remains', 'sufficiently', 'low', 'for', 'parameters', 'resulting', 'in', 'higher', 'savanna', 'tree', 'cover', 'near', 'the', 'front', 'we', 'also', 'find', 'irregular', 'forestsavanna', 'cycles', 'and', 'woodlandsavanna', 'bistability', 'which', 'can', 'both', 'explain', 'the', 'remaining', 'observed', 'bimodality']]
[-0.07446809124414121, 0.13648765952822703, -0.0823081306399494, 0.10393655834005862, -0.02575108513701707, -0.12922232405221817, 0.07934223395979802, 0.36593155573000724, -0.2515895502077436, -0.3156362289319868, 0.12520621455421307, -0.256789609673433, -0.18307569357630596, 0.14678689362430622, -0.056207322649677975, 0.03220265454159665, 0.06543036857834997, 0.00481211194900148, 0.03720272509710175, -0.21720946703103633, 0.29275803478642204, 0.04770157244765078, 0.2756247833262339, 0.04087929607561344, 0.09995062397438628, -0.045213705038844164, -0.023485517425401864, 0.03410846742032015, -0.1277882082255098, 0.01204131657362703, 0.24694480109440559, 0.10360846163593637, 0.21728818461997434, -0.4324952171224615, -0.2909255836604406, 0.12962671975686174, 0.16742240529730107, 0.11746185476848674, -0.0052735125753552775, -0.23264441731811056, 0.053125066166419696, -0.1326179983962388, -0.17483680628483061, -0.024842716141036995, 0.026594086901952876, 0.06192451773677021, -0.24596885385740871, 0.10965297664006357, 0.04487410541016446, 0.07450059582175605, -0.08137507817414387, -0.1433292437982543, -0.1064226785535499, 0.12027695667252968, -0.00037806111211703745, 0.009815884506046448, 0.10891726242540323, -0.16341357263378165, -0.07343515266573218, 0.3447815020361146, -0.09521497874115796, -0.14400550095271444, 0.2197585749887841, -0.18226709581516765, -0.14574186921210797, 0.13370623354010447, 0.17554437340510523, 0.06614391230370688, -0.12624797796524945, 0.03844888421909949, -0.05182827369350454, 0.1516441938877941, 0.09834095110367659, -0.04858196057561461, 0.21279135398799554, 0.19764921214664355, 0.05631344897024657, 0.10221741109157649, -0.10403219037992961, -0.12114423260841843, -0.24081737250494567, -0.0638308904548783, -0.11882971221379905, 0.008194236569460887, -0.11525485357307606, -0.19637162678966136, 0.3697979454781212, 0.16265132262323395, 0.2050094122532755, 0.06841528758788785, 0.2562976829510223, 0.12290445101351234, 0.023189669905822604, 0.08451227067828017, 0.21847286927289172, 0.09756434374645798, 0.10566416480730328, -0.22687128361101952, 0.138955060004778, -0.009279611825426717]
1,803.07536
Automorphism groups of cyclic products of groups
This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at least five groups, we show that the action of the cyclic product on its Davis complex extends to an action of the whole automorphism group. This action allows us to completely compute the automorphism group and to derive several of its properties: Tits Alternative, acylindrical hyperbolicity, lack of property (T).
math.GR math.MG
this article initiates a geometric study of the automorphism groups of general graph products of groups and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups for a cyclic product of at least five groups we show that the action of the cyclic product on its davis complex extends to an action of the whole automorphism group this action allows us to completely compute the automorphism group and to derive several of its properties tits alternative acylindrical hyperbolicity lack of property t
[['this', 'article', 'initiates', 'a', 'geometric', 'study', 'of', 'the', 'automorphism', 'groups', 'of', 'general', 'graph', 'products', 'of', 'groups', 'and', 'investigates', 'the', 'algebraic', 'and', 'geometric', 'structure', 'of', 'automorphism', 'groups', 'of', 'cyclic', 'product', 'of', 'groups', 'for', 'a', 'cyclic', 'product', 'of', 'at', 'least', 'five', 'groups', 'we', 'show', 'that', 'the', 'action', 'of', 'the', 'cyclic', 'product', 'on', 'its', 'davis', 'complex', 'extends', 'to', 'an', 'action', 'of', 'the', 'whole', 'automorphism', 'group', 'this', 'action', 'allows', 'us', 'to', 'completely', 'compute', 'the', 'automorphism', 'group', 'and', 'to', 'derive', 'several', 'of', 'its', 'properties', 'tits', 'alternative', 'acylindrical', 'hyperbolicity', 'lack', 'of', 'property', 't']]
[-0.22654437258218726, 0.0766266174040716, -0.1571928440518249, 0.007143449891979496, -0.13346817407585765, -0.037843259463579144, 0.04089230431736201, 0.35985722852035845, -0.36469043071660073, -0.25637709376155987, 0.14620895369577852, -0.2184232907590855, -0.15388387641815962, 0.16431792096192038, -0.16052286742233682, -0.07810884346013311, 0.019384600548608893, 0.1632652779045547, -0.12195755948912053, -0.2683206527890643, 0.4194192738545224, 0.008900849127221382, 0.22669676190841642, 0.043399123702433776, 0.11016506708665998, 0.028148042873061937, -0.0911935756207797, -0.03244137607686136, -0.13165209127428484, 0.14561405475519, 0.22984764881260777, 0.07886556734534345, 0.1911289155210272, -0.356710906386718, -0.17269627806655635, 0.18630966804279336, 0.09834742365169456, 0.013128886705842512, -0.038918793036859356, -0.26707732875499574, 0.1029244658762011, -0.24705384513256193, -0.1632604144898982, -0.047711834985891294, 0.06578613786112475, -0.05681625315009606, -0.18373410899162657, -0.014663793151962689, 0.10132823729266723, 0.146447643498494, -0.06109472218400467, -0.06631806021524143, -0.02673716597451732, 0.20736214838622288, 0.01569762895547453, -0.03666741440029836, 0.11764436336662407, -0.06339516691413932, -0.1266415713250573, 0.4452146240135377, -0.02872411928128922, -0.1380291804028996, 0.19621887726537968, -0.17451420845999116, -0.22400525751812705, 0.12642512068516393, 0.1497926178506051, 0.16900470833047881, -0.06685123370021004, 0.1624213924675634, -0.10785554123549969, 0.06607302496659345, 0.06760024695774947, -0.02534495463030113, 0.0685455777907166, 0.09857024179621675, 0.13254767952850838, 0.1835539586328227, 0.08676471032641143, -0.011638587929479692, -0.2962162697516467, -0.22182894070450773, -0.04454505747590942, 0.11954742733217862, -0.14269240569251712, -0.2146701874216783, 0.48502729023838864, 0.0754496098111983, 0.11859570218292975, 0.10718184161460263, 0.20027658835738554, -0.032713784177883946, 0.07367876164572335, 0.05480208742464411, 0.08810014198480666, 0.2749867991212456, -0.13674530132684384, -0.2042568116877014, 0.0002070139456625985, 0.21430055764450254]
1,803.07537
NLO PDFs from the ABMP16 fit
We perform a global fit of parton distribution functions (PDFs) together with the strong coupling constant $\alpha_s$ and the quark masses $m_c$, $m_b$ and $m_t$ at next-to-leading order (NLO) in QCD. The analysis applies the $\overline{\mathrm{MS}}\, $ renormalization scheme for $\alpha_s$ and all quark masses. It is performed in the fixed-flavor number scheme for $n_f=3, 4, 5$ and uses the same data as the previous fit of the ABMP16 PDF at next-to-next-to-leading order (NNLO). The new NLO PDFs complement the set of ABMP16 PDFs and are to be used consistently with NLO QCD predictions for hard scattering processes. At NLO we obtain the value $\alpha_s^{(n_f=5)}(M_Z) = 0.1191 \pm 0.0011$ compared to $\alpha_s^{(n_f=5)}(M_Z) = 0.1147 \pm 0.0008$ at NNLO.
hep-ph
we perform a global fit of parton distribution functions pdfs together with the strong coupling constant alpha_s and the quark masses m_c m_b and m_t at nexttoleading order nlo in qcd the analysis applies the overlinemathrmms renormalization scheme for alpha_s and all quark masses it is performed in the fixedflavor number scheme for n_f3 4 5 and uses the same data as the previous fit of the abmp16 pdf at nexttonexttoleading order nnlo the new nlo pdfs complement the set of abmp16 pdfs and are to be used consistently with nlo qcd predictions for hard scattering processes at nlo we obtain the value alpha_sn_f5m_z 01191 pm 00011 compared to alpha_sn_f5m_z 01147 pm 00008 at nnlo
[['we', 'perform', 'a', 'global', 'fit', 'of', 'parton', 'distribution', 'functions', 'pdfs', 'together', 'with', 'the', 'strong', 'coupling', 'constant', 'alpha_s', 'and', 'the', 'quark', 'masses', 'm_c', 'm_b', 'and', 'm_t', 'at', 'nexttoleading', 'order', 'nlo', 'in', 'qcd', 'the', 'analysis', 'applies', 'the', 'overlinemathrmms', 'renormalization', 'scheme', 'for', 'alpha_s', 'and', 'all', 'quark', 'masses', 'it', 'is', 'performed', 'in', 'the', 'fixedflavor', 'number', 'scheme', 'for', 'n_f3', '4', '5', 'and', 'uses', 'the', 'same', 'data', 'as', 'the', 'previous', 'fit', 'of', 'the', 'abmp16', 'pdf', 'at', 'nexttonexttoleading', 'order', 'nnlo', 'the', 'new', 'nlo', 'pdfs', 'complement', 'the', 'set', 'of', 'abmp16', 'pdfs', 'and', 'are', 'to', 'be', 'used', 'consistently', 'with', 'nlo', 'qcd', 'predictions', 'for', 'hard', 'scattering', 'processes', 'at', 'nlo', 'we', 'obtain', 'the', 'value', 'alpha_sn_f5m_z', '01191', 'pm', '00011', 'compared', 'to', 'alpha_sn_f5m_z', '01147', 'pm', '00008', 'at', 'nnlo']]
[-0.04982257736599551, 0.12870302180701917, -0.14262714077908117, 0.13282332481688663, -0.011447737780523248, -0.0404585237713712, 0.049694191494470345, 0.39495913898654744, -0.10771365390381718, -0.2739562589872991, 0.021448488102039007, -0.3751509588013972, 0.12005290606644302, 0.09360657624315173, 0.09768879660858518, 0.21409430990275818, 0.04452603333938735, -0.04855271076898923, -0.11151750991120934, -0.2651545730505996, 0.303748126279777, 0.007322200668761424, 0.17540819867847868, 0.17554160119734902, 0.0377351327745689, 0.013338401283145743, -0.10263114022420702, -0.11973132269737204, -0.1704180539066417, 0.008389398698752697, 0.23302773948639335, -0.01768197184346155, 0.11125023548070968, -0.2774363069308806, -0.04039001128990698, 0.018806452541488463, 0.13801695673058914, 0.10878194630376797, 0.05670782868684459, -0.2432792291078156, 0.1300262067368073, -0.29188417656701554, -0.1768775594264137, -0.16538079619094465, -0.06183039296863485, -0.042934188388485825, -0.42412518990943127, 0.11328316201348748, -0.12599565644245758, -0.007380685991549914, 0.08577170123271974, -0.2688371397192236, -0.0843157182773163, 0.08946438131244046, 0.10508668288563798, 0.20456068568030553, 0.089386662435347, -0.18228559641052136, -0.16410471102329943, 0.4441507499154031, -0.0854499570889382, -0.12091758098881857, 0.05156823065527509, -0.21630344806914836, -0.18259450073757794, 0.15861241881883975, 0.2322623871464645, 0.10175892872224866, -0.154605051955884, 0.12605636489146957, 0.027759329716683226, 0.23975086105426988, 0.073872339231811, 0.028245801975604442, 0.12284790860917584, 0.15519448022852111, -0.025770357331936864, -0.05559486715407399, -0.057665279156227586, -0.08449700509766693, -0.4449351451862439, 0.004911721972501383, -0.09426116389613928, 0.04065570429037531, -0.2257193060816148, -0.0926893854810469, 0.3503118838964363, 0.19326669667575475, 0.2643413409689623, 0.15734532169288898, 0.35502179318099425, 0.13982435584336672, 0.10705317693259732, 0.12879567061328387, 0.28962837395348906, 0.18257882217752985, 0.11046908678388041, -0.23400440250432727, 0.012636428208510696, 0.11192051555953128]
1,803.07538
Connes distance and optimal transport
We give a brief overview on the relation between Connes spectral distance in noncommutative geometry and the Wasserstein distance of order 1 in optimal transport. We first recall how these two distances coincide on the space of probability measures on a Riemannian manifold. Then we work out a simple example on a discrete space, showing that the spectral distance between arbitrary states does not coincide with the Wasserstein distance with cost the spectral distance between pure states.
math-ph math.MP math.OA
we give a brief overview on the relation between connes spectral distance in noncommutative geometry and the wasserstein distance of order 1 in optimal transport we first recall how these two distances coincide on the space of probability measures on a riemannian manifold then we work out a simple example on a discrete space showing that the spectral distance between arbitrary states does not coincide with the wasserstein distance with cost the spectral distance between pure states
[['we', 'give', 'a', 'brief', 'overview', 'on', 'the', 'relation', 'between', 'connes', 'spectral', 'distance', 'in', 'noncommutative', 'geometry', 'and', 'the', 'wasserstein', 'distance', 'of', 'order', '1', 'in', 'optimal', 'transport', 'we', 'first', 'recall', 'how', 'these', 'two', 'distances', 'coincide', 'on', 'the', 'space', 'of', 'probability', 'measures', 'on', 'a', 'riemannian', 'manifold', 'then', 'we', 'work', 'out', 'a', 'simple', 'example', 'on', 'a', 'discrete', 'space', 'showing', 'that', 'the', 'spectral', 'distance', 'between', 'arbitrary', 'states', 'does', 'not', 'coincide', 'with', 'the', 'wasserstein', 'distance', 'with', 'cost', 'the', 'spectral', 'distance', 'between', 'pure', 'states']]
[-0.11955721138117763, 0.06541952542815503, -0.13224024323190187, 0.13324701886430576, -0.04752379838473998, -0.1120792164697082, 0.054947934343249766, 0.4482261177104015, -0.2862931049622402, -0.2629805743549164, 0.051498814827653686, -0.28156880618302854, -0.14244401135010185, 0.1714024882364486, -0.137727933560873, 0.016480485080172875, 0.06520660342527675, 0.08436678202411571, -0.1960216842224374, -0.19560065617869524, 0.4281928955906905, 0.05408281512413319, 0.24918039573066228, 0.07512630060218371, 0.12829954670621202, -0.0030980097952407674, -0.01476744334999617, 0.05112233441005545, -0.20348107182564798, 0.1695353794138419, 0.19241064540171005, 0.11374770173827162, 0.23719345475849393, -0.3631611996656888, -0.17738860372042695, 0.13607380810109052, 0.062287312527126694, 0.029159860637087327, 0.0029378511168836772, -0.28564964020140954, 0.012439746349179125, -0.1217633681734661, -0.07023683535056068, -0.02679594815708697, 0.046420450914989815, 0.026146670005151203, -0.18417560902436253, 0.05367461931831264, 0.06368262920673791, 0.056383454216668356, -0.056106018573771434, -0.09690930429459005, 0.0004458227799600595, 0.14249059631694833, -0.009424235187954717, 0.061689176886983506, 0.04731562092005239, 0.01687836636752858, -0.14346124007451264, 0.295042315449614, -0.0933961186923885, -0.23125088650902564, 0.20042766112828167, -0.14461037199702356, -0.09554889519977106, 0.040658099371214194, 0.18867122943138148, 0.14202508333973685, -0.09117695903284596, 0.12312769808114035, -0.02586690912797273, 0.14657757062972945, 0.09023507796953638, 0.09830932058514906, 0.158660128083709, 0.09646377482681305, 0.1687247028767869, 0.09535012310733657, -0.10467737853563354, -0.1577414472514836, -0.3772899814240344, -0.18932586668857507, -0.24716528913598845, 0.129782821405747, -0.1673122607955827, -0.14111702810585885, 0.3845613689657736, 0.10028751962515828, 0.27302302522947647, 0.13617604906827985, 0.24963812849351338, 0.05560350430185919, -0.02288860564011258, 0.12097792280837893, 0.23092317300570475, 0.16089525235841026, 0.03573768570196706, -0.1932185529973116, -0.0006368575472529833, 0.14724075148341717]
1,803.07539
Exceptional poles of local spinor $L$-functions of $\mathrm{GSp}(4)$ with anisotropic Bessel models
For non-cuspidal irreducible admissible representations of $\mathrm{GSp}(4,k)$ over a local non-archimedean field $k$, we determine the exceptional poles of the spinor $L$-factor attached to anisotropic Bessel models by Piatetski-Shapiro.
math.RT
for noncuspidal irreducible admissible representations of mathrmgsp4k over a local nonarchimedean field k we determine the exceptional poles of the spinor lfactor attached to anisotropic bessel models by piatetskishapiro
[['for', 'noncuspidal', 'irreducible', 'admissible', 'representations', 'of', 'mathrmgsp4k', 'over', 'a', 'local', 'nonarchimedean', 'field', 'k', 'we', 'determine', 'the', 'exceptional', 'poles', 'of', 'the', 'spinor', 'lfactor', 'attached', 'to', 'anisotropic', 'bessel', 'models', 'by', 'piatetskishapiro']]
[-0.24867818584399565, 0.08172668404638118, -0.18083331494459084, 0.056096940633973906, -0.15484134799667768, -0.08345409846931164, -0.03416504404906716, 0.33310190588235855, -0.29647561721503735, -0.15886722578267967, -0.0050858076358833515, -0.2126485693401524, -0.13314947033567087, 0.19628133438527584, -0.01566475596544998, -0.029777939381477023, -0.03259324022967901, 0.18245564614023482, -0.10049684452990602, -0.34665423784671084, 0.39023346413991283, -0.09233487277690854, 0.19105900225362607, -0.043430777599236796, 0.16093309250261104, 0.06846638000570238, 0.013693187585366624, -0.12744191068590485, -0.15112950689425425, 0.17081830417737365, 0.3861076763357362, -0.027013126644305885, 0.17537888464617676, -0.376379992945918, -0.12388519876237426, 0.2526728376812701, 0.18414597035319144, -0.0648160724750986, 0.07566146935485969, -0.32658658675583346, 0.0740773454641125, -0.11607171741447278, -0.2380118804617918, -0.13076577698146657, 0.09045242126947935, 0.04536050571394818, -0.2967603686930878, 0.0028308830889207976, 0.09965361634801541, 0.22466171073860355, -0.14496392294365382, -0.18806737821016992, -0.01949474448338151, 0.017936910851858556, -0.021516843998272504, 0.06416107105490353, 0.07386432185636035, -0.19585619333000587, -0.08134127980364221, 0.2963491877807038, -0.12052483131576862, -0.184885238239076, 0.10636456902804119, -0.18453476486528025, -0.07842525626931872, 0.21510769260515059, 0.12138875021732279, 0.1371485125273466, -0.03802211808839014, 0.24283998299922263, -0.12171833865743663, -0.05334224081681376, 0.18427533742838673, -0.08417137370478096, 0.22894805456910813, -0.0497635144607297, 0.029786481937792684, 0.13734547820474421, 0.018390156494985734, 0.012123106579695429, -0.37564130613048163, -0.19080297316291503, -0.13383109760304382, 0.16218508592075004, -0.12709641913949912, -0.19548087121386612, 0.4864551579313619, 0.08810913815562214, 0.13960054969148977, 0.08753879085582282, 0.1508683731164118, 0.08184352290949651, 0.12602732270689948, 0.03161455484639321, 0.07549409428611398, 0.27138105474711793, -0.09607007236835281, -0.20822532701173, -0.11048179638705083, 0.19351848460999982]
1,803.0754
Enslaving the Algorithm: From a "Right to an Explanation" to a "Right to Better Decisions"?
As concerns about unfairness and discrimination in "black box" machine learning systems rise, a legal "right to an explanation" has emerged as a compellingly attractive approach for challenge and redress. We outline recent debates on the limited provisions in European data protection law, and introduce and analyze newer explanation rights in French administrative law and the draft modernized Council of Europe Convention 108. While individual rights can be useful, in privacy law they have historically unreasonably burdened the average data subject. "Meaningful information" about algorithmic logics is more technically possible than commonly thought, but this exacerbates a new "transparency fallacy"---an illusion of remedy rather than anything substantively helpful. While rights-based approaches deserve a firm place in the toolbox, other forms of governance, such as impact assessments, "soft law," judicial review, and model repositories deserve more attention, alongside catalyzing agencies acting for users to control algorithmic system design.
cs.AI cs.HC
as concerns about unfairness and discrimination in black box machine learning systems rise a legal right to an explanation has emerged as a compellingly attractive approach for challenge and redress we outline recent debates on the limited provisions in european data protection law and introduce and analyze newer explanation rights in french administrative law and the draft modernized council of europe convention 108 while individual rights can be useful in privacy law they have historically unreasonably burdened the average data subject meaningful information about algorithmic logics is more technically possible than commonly thought but this exacerbates a new transparency fallacyan illusion of remedy rather than anything substantively helpful while rightsbased approaches deserve a firm place in the toolbox other forms of governance such as impact assessments soft law judicial review and model repositories deserve more attention alongside catalyzing agencies acting for users to control algorithmic system design
[['as', 'concerns', 'about', 'unfairness', 'and', 'discrimination', 'in', 'black', 'box', 'machine', 'learning', 'systems', 'rise', 'a', 'legal', 'right', 'to', 'an', 'explanation', 'has', 'emerged', 'as', 'a', 'compellingly', 'attractive', 'approach', 'for', 'challenge', 'and', 'redress', 'we', 'outline', 'recent', 'debates', 'on', 'the', 'limited', 'provisions', 'in', 'european', 'data', 'protection', 'law', 'and', 'introduce', 'and', 'analyze', 'newer', 'explanation', 'rights', 'in', 'french', 'administrative', 'law', 'and', 'the', 'draft', 'modernized', 'council', 'of', 'europe', 'convention', '108', 'while', 'individual', 'rights', 'can', 'be', 'useful', 'in', 'privacy', 'law', 'they', 'have', 'historically', 'unreasonably', 'burdened', 'the', 'average', 'data', 'subject', 'meaningful', 'information', 'about', 'algorithmic', 'logics', 'is', 'more', 'technically', 'possible', 'than', 'commonly', 'thought', 'but', 'this', 'exacerbates', 'a', 'new', 'transparency', 'fallacyan', 'illusion', 'of', 'remedy', 'rather', 'than', 'anything', 'substantively', 'helpful', 'while', 'rightsbased', 'approaches', 'deserve', 'a', 'firm', 'place', 'in', 'the', 'toolbox', 'other', 'forms', 'of', 'governance', 'such', 'as', 'impact', 'assessments', 'soft', 'law', 'judicial', 'review', 'and', 'model', 'repositories', 'deserve', 'more', 'attention', 'alongside', 'catalyzing', 'agencies', 'acting', 'for', 'users', 'to', 'control', 'algorithmic', 'system', 'design']]
[-0.07112284733689037, 0.04002241601230143, -0.10783530108566428, 0.1504726630828247, -0.19238393604072968, -0.23491068235759077, 0.13024966725758438, 0.3502949942031811, -0.2092871630114728, -0.349470728032034, 0.12335353301886212, -0.31759870674396895, -0.09413405901607896, 0.2144072450970396, -0.20358495667319873, 0.03771598999677547, 0.015484234950794228, 0.010633065123617818, 0.03676279909338738, -0.22086560621472268, 0.23881111919382136, 0.1002223157388126, 0.35239344467890676, 0.07240190267691325, 0.04768900509506207, -0.03471440544255592, -0.07651280346487103, -0.007097630238096262, -0.0916809231492466, 0.1518140244233454, 0.32886196253339534, 0.23642671141966148, 0.40810332069623056, -0.4590602103363851, -0.1779547700465753, 0.08081195186582747, 0.14394799278535206, 0.08178343748962828, -0.0685062188592916, -0.3071983926383586, 0.003859292783228488, -0.2905422164480491, -0.10907401933238424, -0.12537997372705362, 0.06752052912890012, -0.04963475312347171, -0.19677996003101098, 0.04283164757592925, 0.08173647544563523, 0.1455955323039673, -0.04618455715766498, -0.13159261296326616, 0.02615318083814506, 0.15883649164682317, 0.10107008137595679, -0.0015139563474804163, 0.16320845356797156, -0.1562035524888478, -0.14412556771702809, 0.4276777796832652, 0.05786580839575718, -0.13134141995346751, 0.1532385386655043, -0.08579427438210054, -0.17151332071436376, 0.01973309012467106, 0.21003198930311243, 0.03151578076830102, -0.20255589177832006, 0.011961738117328235, 0.005514624303784864, 0.18051754488400987, 0.09065645543119774, 0.07781594137918076, 0.26504632697665487, 0.2019236191689711, 0.07166391364379048, 0.0899293916649185, 0.05002830979446399, -0.1255116089283296, -0.22583604855784054, -0.1348203127657802, -0.06806576683603484, 0.07202809204614384, -0.030850096759265932, -0.12013404988523187, 0.30778454574595754, 0.19058604011440586, 0.1077142225674771, 0.01479814228890785, 0.31391836556140335, 0.007720932763487357, 0.11645199348828916, 0.05445920970965305, 0.20058261033003058, 0.017288760033261498, 0.19785300119266172, -0.08766760178761364, 0.1715077051146213, -0.02315233693747171]
1,803.07541
An interaction index for multichoice games
Models in Multicriteria Decision Analysis (MCDA) can be analyzed by means of an importance index and an interaction index for every group of criteria. We consider first discrete models in MCDA, without further restriction, which amounts to considering multichoice games, that is, cooperative games with several levels of participation. We propose and axiomatize an interaction index for multichoice games. In a second part, we consider the continuous case, supposing that the continuous model is obtained from a discrete one by means of the Choquet integral.
cs.GT
models in multicriteria decision analysis mcda can be analyzed by means of an importance index and an interaction index for every group of criteria we consider first discrete models in mcda without further restriction which amounts to considering multichoice games that is cooperative games with several levels of participation we propose and axiomatize an interaction index for multichoice games in a second part we consider the continuous case supposing that the continuous model is obtained from a discrete one by means of the choquet integral
[['models', 'in', 'multicriteria', 'decision', 'analysis', 'mcda', 'can', 'be', 'analyzed', 'by', 'means', 'of', 'an', 'importance', 'index', 'and', 'an', 'interaction', 'index', 'for', 'every', 'group', 'of', 'criteria', 'we', 'consider', 'first', 'discrete', 'models', 'in', 'mcda', 'without', 'further', 'restriction', 'which', 'amounts', 'to', 'considering', 'multichoice', 'games', 'that', 'is', 'cooperative', 'games', 'with', 'several', 'levels', 'of', 'participation', 'we', 'propose', 'and', 'axiomatize', 'an', 'interaction', 'index', 'for', 'multichoice', 'games', 'in', 'a', 'second', 'part', 'we', 'consider', 'the', 'continuous', 'case', 'supposing', 'that', 'the', 'continuous', 'model', 'is', 'obtained', 'from', 'a', 'discrete', 'one', 'by', 'means', 'of', 'the', 'choquet', 'integral']]
[-0.09434801276896478, 0.058242505415418075, -0.10326520002940122, 0.08099729946047506, -0.04504407172036522, -0.12585139827912345, 0.08486165617976119, 0.4268870597705245, -0.28758655978805003, -0.2734529743957169, 0.11940827094264986, -0.23999692347338972, -0.17275863745633294, 0.14891995761050458, -0.10444792125593214, -0.006050509102094699, 0.039421863010262743, 0.04986821498502703, 0.010813999959432026, -0.22636968329932322, 0.379297954359037, 0.004130108873633778, 0.22017226796049405, 0.03637430457507863, 0.08878333064837053, 0.09140913260224111, -0.05092326058622669, 0.06526429715621121, -0.0942513111165574, 0.12485690577065243, 0.2614069187298917, 0.15519745469312457, 0.3699281277463717, -0.3715913625581272, -0.23429200756911409, 0.1614456831231056, 0.08251278073910405, 0.037708673181067055, -0.03697687683298307, -0.2996533608694068, 0.07400612870559972, -0.2213684738449314, -0.08734665071482167, -0.051919262450845806, 0.009504682373474627, -0.0062199871370788, -0.3335357280721998, 0.008311652956420884, 0.03241807926884469, 0.0819214534781435, -0.12115943889297984, -0.0809946082861108, 0.009394413868294043, 0.14175786103724558, 0.02261376684285043, -0.06009044576545849, 0.03656386755447944, -0.14116300721926725, -0.22669160828432616, 0.4111901161425254, -0.07207786781329881, -0.21775629316620967, 0.13421695598072428, -0.04851331602343741, -0.17735916312016986, 0.10162788809770171, 0.16040291564867776, 0.14897174985312364, -0.15094525211435908, 0.0889130432583282, -0.06917845553663723, 0.21461426909355558, 0.024639235919012743, -0.040865417778053706, 0.1373295413932818, 0.15322465735542423, 0.09820064502384733, 0.19069838551119628, -0.004017062411260079, -0.1161228209213518, -0.28566102552063327, -0.16065409477142728, -0.15173526847844615, 0.014692328066345961, -0.11221028937485672, -0.12480901400832568, 0.34696172064937214, 0.1166245781159138, 0.12167359536842388, 0.08794071544098722, 0.2447756280136459, 0.17990036754704575, 0.01743215906313066, 0.04226254826302037, 0.1752636385643307, 0.08574201234013719, 0.0697486000628594, -0.15490700423970874, 0.060322542450226405, 0.10367348441744552]
1,803.07542
Exponential stochastic stabilization of a two-level quantum system via strict Lyapunov control
This article provides a novel continuous-time state feedback control strategy to stabilize an eigenstate of the Hermitian measurement operator of a two-level quantum system. In open loop, such system converges stochastically to one of the eigenstates of the measurement operator. Previous work has proposed state feedback that destabilizes the undesired eigenstates and relies on a probabilistic analysis to prove convergence. In contrast, we here associate the state observer to an adaptive version of so-called Markovian feedback (essentially, proportional control) and we show that this leads to a global exponential convergence property with a strict Lyapunov function. Furthermore, besides the instantaneous measurement output, our controller only depends on the single coordinate along the measurement axis, which opens the way to replacing the full state observer by lower-complexity filters in the future.
quant-ph
this article provides a novel continuoustime state feedback control strategy to stabilize an eigenstate of the hermitian measurement operator of a twolevel quantum system in open loop such system converges stochastically to one of the eigenstates of the measurement operator previous work has proposed state feedback that destabilizes the undesired eigenstates and relies on a probabilistic analysis to prove convergence in contrast we here associate the state observer to an adaptive version of socalled markovian feedback essentially proportional control and we show that this leads to a global exponential convergence property with a strict lyapunov function furthermore besides the instantaneous measurement output our controller only depends on the single coordinate along the measurement axis which opens the way to replacing the full state observer by lowercomplexity filters in the future
[['this', 'article', 'provides', 'a', 'novel', 'continuoustime', 'state', 'feedback', 'control', 'strategy', 'to', 'stabilize', 'an', 'eigenstate', 'of', 'the', 'hermitian', 'measurement', 'operator', 'of', 'a', 'twolevel', 'quantum', 'system', 'in', 'open', 'loop', 'such', 'system', 'converges', 'stochastically', 'to', 'one', 'of', 'the', 'eigenstates', 'of', 'the', 'measurement', 'operator', 'previous', 'work', 'has', 'proposed', 'state', 'feedback', 'that', 'destabilizes', 'the', 'undesired', 'eigenstates', 'and', 'relies', 'on', 'a', 'probabilistic', 'analysis', 'to', 'prove', 'convergence', 'in', 'contrast', 'we', 'here', 'associate', 'the', 'state', 'observer', 'to', 'an', 'adaptive', 'version', 'of', 'socalled', 'markovian', 'feedback', 'essentially', 'proportional', 'control', 'and', 'we', 'show', 'that', 'this', 'leads', 'to', 'a', 'global', 'exponential', 'convergence', 'property', 'with', 'a', 'strict', 'lyapunov', 'function', 'furthermore', 'besides', 'the', 'instantaneous', 'measurement', 'output', 'our', 'controller', 'only', 'depends', 'on', 'the', 'single', 'coordinate', 'along', 'the', 'measurement', 'axis', 'which', 'opens', 'the', 'way', 'to', 'replacing', 'the', 'full', 'state', 'observer', 'by', 'lowercomplexity', 'filters', 'in', 'the', 'future']]
[-0.15682489223634968, 0.09828212514291339, -0.11631919815599058, -0.009491913452243003, -0.0707067328505218, -0.18311768036443166, 0.08187920808917484, 0.34988624032300253, -0.30404754934760814, -0.22693568680238407, 0.09763966086051928, -0.25375952885772746, -0.11698385418052427, 0.16144045405089855, -0.09248369368724525, 0.08584572047066803, 0.08863372405847678, 0.0557733620928887, -0.07300366973325323, -0.18070719697727608, 0.33623560054514273, 0.10075327928375023, 0.2928556203483962, -0.022288181446492673, 0.16977034838368688, 0.040742094399264225, 0.008427295178318252, -0.029828540336949608, -0.07969652292119393, 0.0676327937300532, 0.19237352498592092, 0.11870778234711346, 0.3148336932636224, -0.3809652426495002, -0.1557946536403436, 0.12443673044729692, 0.17015046480183418, 0.13965237588317206, -0.05037746342400519, -0.2920938042923808, 0.047952971186112754, -0.17825034719247085, -0.14922785566976438, -0.0631136014788913, -0.044579305152337136, -0.016685844492964792, -0.308490854057555, 0.04467841789771158, 0.09326870325737847, 0.005874591897456692, -0.08137977400508065, -0.027898634323635353, 0.0009989263400292168, 0.1058334117468733, -0.02137461599105826, 0.049090479582977985, 0.17102585031221118, -0.06355129600180169, -0.1537636367416081, 0.2995845403522253, -0.07594844232707355, -0.2464299129895293, 0.1461721203254106, -0.1260369733728182, -0.10160538656637072, 0.09899802414270548, 0.1509659126544228, 0.096595896465274, -0.1491316870177308, 0.07534049863909156, -0.03991830428489126, 0.2073814119060094, -0.0119979084111177, 0.07231412587973934, 0.1300082022539125, 0.1458995197684719, 0.18555293371900916, 0.1640007575472387, -0.019397249909413335, -0.19110616840905725, -0.3134898647128676, -0.16387937302396705, -0.17023404316367724, 0.083486207414311, -0.05882523514200539, -0.18403949339229328, 0.42862922246926105, 0.1794745448618554, 0.19322322050396065, 0.07250354737849334, 0.32076910050370944, 0.15681815051849787, 0.029049978147332484, 0.0673095110223445, 0.2715131048028035, 0.13058302730787547, 0.10482108580629126, -0.29466259823306107, 0.08879964757495774, 0.07576822190223119]
1,803.07543
On How Kelsenian Jurisprudence and Intuitionistic Logic help to avoid Contrary-to-Duty paradoxes in Legal Ontologies
In this article we show how Hans Kelsen jurisprudence and Intuitionistic logic are used to avoid the well-known contrary-to-duty (CTD) paradoxes, such as Chisholm paradoxes and its variants. This article uses an intuitionistic version of the ALC description logic, named iALC, to show how an ontology based on individually valid legal statements is able to avoid CTDs by providing models to them.
cs.LO
in this article we show how hans kelsen jurisprudence and intuitionistic logic are used to avoid the wellknown contrarytoduty ctd paradoxes such as chisholm paradoxes and its variants this article uses an intuitionistic version of the alc description logic named ialc to show how an ontology based on individually valid legal statements is able to avoid ctds by providing models to them
[['in', 'this', 'article', 'we', 'show', 'how', 'hans', 'kelsen', 'jurisprudence', 'and', 'intuitionistic', 'logic', 'are', 'used', 'to', 'avoid', 'the', 'wellknown', 'contrarytoduty', 'ctd', 'paradoxes', 'such', 'as', 'chisholm', 'paradoxes', 'and', 'its', 'variants', 'this', 'article', 'uses', 'an', 'intuitionistic', 'version', 'of', 'the', 'alc', 'description', 'logic', 'named', 'ialc', 'to', 'show', 'how', 'an', 'ontology', 'based', 'on', 'individually', 'valid', 'legal', 'statements', 'is', 'able', 'to', 'avoid', 'ctds', 'by', 'providing', 'models', 'to', 'them']]
[-0.01479081854584717, -0.03321907416712718, -0.1063976653798994, 0.1744462295131187, -0.18325634769374324, -0.14406060405646362, 0.06805869143816733, 0.33262767967197204, -0.2959423021548578, -0.27185656286535725, 0.09089898071326916, -0.27923410638205465, -0.1403732463236778, 0.14347150310453388, -0.2545284704500509, 0.028323873455989204, -0.014778826522806118, 0.028846366240853263, 0.006399993957470982, -0.2608601325041344, 0.2756332630561965, 0.04930750389523324, 0.23993531087668793, 0.06421879732947526, 0.14339164851023065, 0.060947634655261235, -0.005508745442174615, 0.04626616967781898, -0.12990396005672314, 0.1356582885097352, 0.35536028728934216, 0.28152734597754336, 0.3249172116479566, -0.45151649181160236, -0.09204769220143076, 0.05979323409677994, 0.10886887668992483, 0.1069854503167012, 0.047532302517098404, -0.3328038205602957, 0.05432852164601847, -0.21111411034625263, -0.09300791301704463, -0.1475417486790027, 0.019269780135683475, -0.010755694771726285, -0.1760983992322919, -0.002541700265400352, 0.18812076400424685, 0.04078757007899243, 0.004748041071223035, -0.07672933906677269, 0.052363722059395046, 0.04763647859104939, 0.006793758152202974, 0.0022156513070747735, 0.055305564723488305, -0.02144493803291792, -0.26569540451671325, 0.3627168677987591, 0.007812820405008332, -0.20335302425308094, 0.15502437435826588, 0.005643063746843367, -0.16745461792414706, -0.008186518154557674, 0.05367183596676876, 0.10371215073692222, -0.17352745223850494, 0.0607538934057248, -0.03105967508388623, 0.22374109256892435, 0.12845135444865352, 0.041245620397310105, 0.17719288679560827, 0.15479367289451823, -0.018146619876666416, 0.15613727714686143, 0.02043869226913704, -0.10058019021826406, -0.30105373704047395, -0.15033791089550622, -0.07078289905668146, -0.014712103514841968, 0.0015432966667445257, -0.18594440712683624, 0.3232439147353533, 0.2611163330166751, 0.10305787107696937, 0.1260576997883618, 0.2988822754893091, 0.05648171900951814, 0.08499544388013741, 0.03516686755052257, 0.1582960391477231, 0.12644884426281938, 0.12473448210455958, -0.13279655113846303, 0.08850574565322829, 0.11268114166018824]
1,803.07544
C3PO: Database and Benchmark for Early-stage Malicious Activity Detection in 3D Printing
Increasing malicious users have sought practices to leverage 3D printing technology to produce unlawful tools in criminal activities. Current regulations are inadequate to deal with the rapid growth of 3D printers. It is of vital importance to enable 3D printers to identify the objects to be printed, so that the manufacturing procedure of an illegal weapon can be terminated at the early stage. Deep learning yields significant rises in performance in the object recognition tasks. However, the lack of large-scale databases in 3D printing domain stalls the advancement of automatic illegal weapon recognition. This paper presents a new 3D printing image database, namely C3PO, which compromises two subsets for the different system working scenarios. We extract images from the numerical control programming code files of 22 3D models, and then categorize the images into 10 distinct labels. The first set consists of 62,200 images which represent the object projections on the three planes in a Cartesian coordinate system. And the second sets consists of sequences of total 671,677 images to simulate the cameras' captures of the printed objects. Importantly, we demonstrate that the weapons can be recognized in either scenario using deep learning based approaches using our proposed database. % We also use the trained deep models to build a prototype of object-aware 3D printer. The quantitative results are promising, and the future exploration of the database and the crime prevention in 3D printing are demanding tasks.
cs.CV
increasing malicious users have sought practices to leverage 3d printing technology to produce unlawful tools in criminal activities current regulations are inadequate to deal with the rapid growth of 3d printers it is of vital importance to enable 3d printers to identify the objects to be printed so that the manufacturing procedure of an illegal weapon can be terminated at the early stage deep learning yields significant rises in performance in the object recognition tasks however the lack of largescale databases in 3d printing domain stalls the advancement of automatic illegal weapon recognition this paper presents a new 3d printing image database namely c3po which compromises two subsets for the different system working scenarios we extract images from the numerical control programming code files of 22 3d models and then categorize the images into 10 distinct labels the first set consists of 62200 images which represent the object projections on the three planes in a cartesian coordinate system and the second sets consists of sequences of total 671677 images to simulate the cameras captures of the printed objects importantly we demonstrate that the weapons can be recognized in either scenario using deep learning based approaches using our proposed database we also use the trained deep models to build a prototype of objectaware 3d printer the quantitative results are promising and the future exploration of the database and the crime prevention in 3d printing are demanding tasks
[['increasing', 'malicious', 'users', 'have', 'sought', 'practices', 'to', 'leverage', '3d', 'printing', 'technology', 'to', 'produce', 'unlawful', 'tools', 'in', 'criminal', 'activities', 'current', 'regulations', 'are', 'inadequate', 'to', 'deal', 'with', 'the', 'rapid', 'growth', 'of', '3d', 'printers', 'it', 'is', 'of', 'vital', 'importance', 'to', 'enable', '3d', 'printers', 'to', 'identify', 'the', 'objects', 'to', 'be', 'printed', 'so', 'that', 'the', 'manufacturing', 'procedure', 'of', 'an', 'illegal', 'weapon', 'can', 'be', 'terminated', 'at', 'the', 'early', 'stage', 'deep', 'learning', 'yields', 'significant', 'rises', 'in', 'performance', 'in', 'the', 'object', 'recognition', 'tasks', 'however', 'the', 'lack', 'of', 'largescale', 'databases', 'in', '3d', 'printing', 'domain', 'stalls', 'the', 'advancement', 'of', 'automatic', 'illegal', 'weapon', 'recognition', 'this', 'paper', 'presents', 'a', 'new', '3d', 'printing', 'image', 'database', 'namely', 'c3po', 'which', 'compromises', 'two', 'subsets', 'for', 'the', 'different', 'system', 'working', 'scenarios', 'we', 'extract', 'images', 'from', 'the', 'numerical', 'control', 'programming', 'code', 'files', 'of', '22', '3d', 'models', 'and', 'then', 'categorize', 'the', 'images', 'into', '10', 'distinct', 'labels', 'the', 'first', 'set', 'consists', 'of', '62200', 'images', 'which', 'represent', 'the', 'object', 'projections', 'on', 'the', 'three', 'planes', 'in', 'a', 'cartesian', 'coordinate', 'system', 'and', 'the', 'second', 'sets', 'consists', 'of', 'sequences', 'of', 'total', '671677', 'images', 'to', 'simulate', 'the', 'cameras', 'captures', 'of', 'the', 'printed', 'objects', 'importantly', 'we', 'demonstrate', 'that', 'the', 'weapons', 'can', 'be', 'recognized', 'in', 'either', 'scenario', 'using', 'deep', 'learning', 'based', 'approaches', 'using', 'our', 'proposed', 'database', 'we', 'also', 'use', 'the', 'trained', 'deep', 'models', 'to', 'build', 'a', 'prototype', 'of', 'objectaware', '3d', 'printer', 'the', 'quantitative', 'results', 'are', 'promising', 'and', 'the', 'future', 'exploration', 'of', 'the', 'database', 'and', 'the', 'crime', 'prevention', 'in', '3d', 'printing', 'are', 'demanding', 'tasks']]
[-0.06136651961013484, -0.007991043181577995, -0.04222330959557564, 0.03315318001480972, -0.09788179284948696, -0.1576885858940709, -9.032376021003493e-05, 0.40486729581657255, -0.25425844205643894, -0.36162018032473886, 0.11602892640542287, -0.3029583622400478, -0.13414975832630363, 0.21151518889575496, -0.1631005763824488, 0.07189207904649755, 0.11394899603552543, -0.01527889529402312, -0.04697830695260921, -0.2593890260397576, 0.291684301605878, 0.02682917470644272, 0.3440829535198008, -0.0044005166960116, 0.08869754815768674, -0.02985944524884988, -0.06483176888293053, -0.014136048533324884, -0.05867339093674673, 0.16273027517943262, 0.33151884147297, 0.22183900781803662, 0.2729073209512947, -0.4769378789286647, -0.1974021245677693, 0.060087447070604205, 0.14462164826725976, 0.12053555850851007, -0.0716839991002463, -0.3364511387995802, 0.10897081364100425, -0.18378420141684768, -0.03899310131628926, -0.10362185468444746, 0.004195930069097533, -0.011380289067587871, -0.25018552761986596, -0.022816785053140085, 0.018730094528894594, 0.09666544757186411, -0.0627741436404375, -0.05886644663181729, -0.023026816776265096, 0.24949269657397372, 0.003773434476680162, 0.03717540233778075, 0.16466531031526244, -0.21078642052857, -0.13077199844216617, 0.4097295154650242, 0.004101244511846931, -0.16814547432133825, 0.2173987745036745, -0.0652778482872547, -0.13036042557925814, 0.14108217945003992, 0.24579927399077922, 0.1227884205067172, -0.16867816937355024, -0.006363596475651313, -0.008581462979881873, 0.1888293377472024, 0.04737507350793562, -0.03755646142372304, 0.24483949429918733, 0.2515600740424015, -0.008477411806507785, 0.1456582564696407, -0.1549116826017236, -0.03806248957163885, -0.19187997962929246, -0.17382965348541546, -0.1641876667730001, -0.02473234595794581, -0.06870349486628109, -0.18256794512729582, 0.38197495266158354, 0.24942326713671797, 0.14727232998419099, 0.01670003600747416, 0.356820239024794, -0.006021630844739604, 0.14906223162135077, 0.0460484191789252, 0.18400035770391074, -0.02448541671435675, 0.16018587169854337, -0.14051589888182736, 0.07954948342257999, 0.04342735935555787]
1,803.07545
A compactness result for BV functions in metric spaces
We prove a compactness result for bounded sequences $(u_j)_j$ of functions with bounded variation in metric spaces $(X,d_j)$ where the space $X$ is fixed but the metric may vary with $j$. We also provide an application to Carnot-Carath\'eodory spaces.
math.FA math.MG
we prove a compactness result for bounded sequences u_j_j of functions with bounded variation in metric spaces xd_j where the space x is fixed but the metric may vary with j we also provide an application to carnotcaratheodory spaces
[['we', 'prove', 'a', 'compactness', 'result', 'for', 'bounded', 'sequences', 'u_j_j', 'of', 'functions', 'with', 'bounded', 'variation', 'in', 'metric', 'spaces', 'xd_j', 'where', 'the', 'space', 'x', 'is', 'fixed', 'but', 'the', 'metric', 'may', 'vary', 'with', 'j', 'we', 'also', 'provide', 'an', 'application', 'to', 'carnotcaratheodory', 'spaces']]
[-0.13699735006881192, 0.12033317498227054, -0.06181338223579683, 0.10084879517518475, -0.10790908056629919, -0.07338070727296565, 0.01828928169255194, 0.42780173442473535, -0.33350766175671626, -0.22055359527860818, 0.12792005633481926, -0.2748263963302107, -0.12949960521961512, 0.19049814426781317, -0.19946447098137518, -0.0018179349258149926, 0.019110888818671044, 0.06872325239313987, -0.16038096181460118, -0.2818616693349261, 0.4481460748142318, -0.059312926899445687, 0.1788347427171079, 0.09501472367954097, 0.1434269642249044, 0.004329451997029154, -0.015672509129600304, 0.02601073306026305, -0.20501686394900867, 0.14592207838340024, 0.24905775658982365, 0.114645263847993, 0.2657389260436359, -0.2814058723222268, -0.21652326561314494, 0.21966560509693073, 0.10620889268619449, -0.021079587627594407, -0.012103069604276434, -0.30718581780399146, 0.10478606628940294, -0.108578777823009, -0.14746635078795647, -0.09609960147032612, 0.08166499226354063, 0.09371073803815402, -0.3360544213731038, -0.010698670675322463, 0.10658634249366035, 0.056146342699465, -0.1595684619755239, -0.06084731016553154, -0.02715964440109306, 0.10972323030919622, 0.030437129666097462, 0.1766577644126588, 0.08331725979223847, 0.0032204454764723778, -0.08884140775587998, 0.32314779425628093, -0.12047188758457962, -0.332451796649318, 0.13181818745981314, -0.1980538785359577, -0.1481360386762964, 0.02981910160987785, 0.12762956003854542, 0.19248787421537072, -0.02488883621500511, 0.1803279561113174, -0.04711450303071424, 0.1452733865497928, 0.10544766292074009, 0.10850152537520778, 0.04082419684671454, 0.11868902292151592, 0.21641768861905133, 0.16431373864485832, -3.857623883768132e-05, -0.03859203109995609, -0.34898308144980356, -0.14567480304915653, -0.1778862061052534, 0.08584628148788684, -0.18529377702476554, -0.22619120869785547, 0.27506547321957586, 0.03517492206638532, 0.23179633332122312, 0.16072107910325653, 0.1699934381207353, 0.09548002574592829, -0.019317928147134615, 0.113329889510121, 0.1686506307879953, 0.13889311038349805, 0.0756936558571301, -0.06040791241991285, 0.026821917756981412, 0.1408556560567568]
1,803.07546
On generalized Hartshorne's conjecture and local cohomology modules
Let $\mathfrak{a}$ denote an ideal of a commutative Noetherian ring $R$. Let $M$ and $N$ be two $R$-modules. In this paper, we give partial answers on the extension of Hartshorne's conjecture about the cofiniteness of torsion and extension functors. For this purpose, we study the cofiniteness of the generalized local cohomology module $H^{i}_{\mathfrak{a}}(M, N)$ for a new class of modules, called $\mathfrak{a}$-weakly finite modules, in the local and non-local case. Furthermore, we derive some results on attached primes of top generalized local cohomology modules.
math.AC
let mathfraka denote an ideal of a commutative noetherian ring r let m and n be two rmodules in this paper we give partial answers on the extension of hartshornes conjecture about the cofiniteness of torsion and extension functors for this purpose we study the cofiniteness of the generalized local cohomology module hi_mathfrakam n for a new class of modules called mathfrakaweakly finite modules in the local and nonlocal case furthermore we derive some results on attached primes of top generalized local cohomology modules
[['let', 'mathfraka', 'denote', 'an', 'ideal', 'of', 'a', 'commutative', 'noetherian', 'ring', 'r', 'let', 'm', 'and', 'n', 'be', 'two', 'rmodules', 'in', 'this', 'paper', 'we', 'give', 'partial', 'answers', 'on', 'the', 'extension', 'of', 'hartshornes', 'conjecture', 'about', 'the', 'cofiniteness', 'of', 'torsion', 'and', 'extension', 'functors', 'for', 'this', 'purpose', 'we', 'study', 'the', 'cofiniteness', 'of', 'the', 'generalized', 'local', 'cohomology', 'module', 'hi_mathfrakam', 'n', 'for', 'a', 'new', 'class', 'of', 'modules', 'called', 'mathfrakaweakly', 'finite', 'modules', 'in', 'the', 'local', 'and', 'nonlocal', 'case', 'furthermore', 'we', 'derive', 'some', 'results', 'on', 'attached', 'primes', 'of', 'top', 'generalized', 'local', 'cohomology', 'modules']]
[-0.2338719397510697, 0.010837730101384961, -0.07467406129509938, 0.04149076150355452, -0.08816081024252059, -0.18825968131195844, -0.064531870162194, 0.2637017691371644, -0.3863824232475741, -0.1737681369001909, 0.06445591405556514, -0.2166697688417782, -0.10565089882442319, 0.17061672694753946, -0.1593169521301894, -0.10411518675888456, 0.03642411791810357, 0.11149041724345851, -0.04600511682106227, -0.3097877539694309, 0.4306794806587987, -0.006401640973508176, 0.1802099882965771, 0.06428359191092413, 0.09979043606805002, 0.04980637265437442, -0.038704125346933925, 0.005381355524949003, -0.22676677155740013, 0.15081668341682838, 0.33125168174255365, 0.03724229659476295, 0.2492011521897483, -0.4171865422891953, -0.032330841970311976, 0.24899119145532206, 0.13210899759333852, -0.051087946534474814, 0.003307619532456667, -0.2584361029397015, 0.19529160527830444, -0.25197662373368696, -0.13866053305271014, -0.058267776490893305, 0.07733332768945796, 0.009920992295076026, -0.30812237637256634, -0.03012566214779437, 0.1129855774059074, 0.17822029010290508, -0.09071760095383335, -0.09295707895624929, 0.001998455956487394, 0.022002084396506954, -0.11432437980320395, -0.018795174583451958, 0.083572114124985, -0.06737607403476609, -0.1383259298007299, 0.31388097724354846, -0.11155986658399697, -0.234810790827884, 0.10502597290977109, -0.1769438080415811, -0.15579893509715387, 0.03798083943973591, 0.046587220455588, 0.20011601224541664, -0.029752657805546756, 0.23632347179227509, -0.21019497129884435, 0.05547957399451151, 0.08759377895649977, 0.031806476618640306, 0.13722141963861337, 0.0834233092496217, 0.0846608476716849, 0.16623028228236875, 0.02377680778253551, 0.051981137122777174, -0.4061487034508368, -0.2599031743934242, -0.11059481582445342, 0.1698243100786718, -0.08607016271672342, -0.14271067160113557, 0.4615582026904676, 0.12582308518495866, 0.15854724042299317, 0.1780993232571679, 0.18499640663858594, -0.008364928818148811, 0.03346538423310693, 0.049326963109395855, 0.029995981463665573, 0.2736035590173631, -0.031446527099100556, -0.1091178967844604, -0.024224186470879743, 0.25498097887966875]
1,803.07547
High magnetic fields for fundamental physics
Various fundamental-physics experiments such as measurement of the birefringence of the vacuum, searches for ultralight dark matter (e.g., axions), and precision spectroscopy of complex systems (including exotic atoms containing antimatter constituents) are enabled by high-field magnets. We give an overview of current and future experiments and discuss the state-of-the-art DC- and pulsed-magnet technologies and prospects for future developments.
physics.ins-det astro-ph.IM physics.atom-ph
various fundamentalphysics experiments such as measurement of the birefringence of the vacuum searches for ultralight dark matter eg axions and precision spectroscopy of complex systems including exotic atoms containing antimatter constituents are enabled by highfield magnets we give an overview of current and future experiments and discuss the stateoftheart dc and pulsedmagnet technologies and prospects for future developments
[['various', 'fundamentalphysics', 'experiments', 'such', 'as', 'measurement', 'of', 'the', 'birefringence', 'of', 'the', 'vacuum', 'searches', 'for', 'ultralight', 'dark', 'matter', 'eg', 'axions', 'and', 'precision', 'spectroscopy', 'of', 'complex', 'systems', 'including', 'exotic', 'atoms', 'containing', 'antimatter', 'constituents', 'are', 'enabled', 'by', 'highfield', 'magnets', 'we', 'give', 'an', 'overview', 'of', 'current', 'and', 'future', 'experiments', 'and', 'discuss', 'the', 'stateoftheart', 'dc', 'and', 'pulsedmagnet', 'technologies', 'and', 'prospects', 'for', 'future', 'developments']]
[-0.1510947518205891, 0.20814662625050181, -0.0006578458603798298, 0.03808916356872048, -0.0972103098807693, -0.1366566812390821, -0.01774230615742374, 0.337282147519944, -0.18861867201498203, -0.3752680281503943, 0.11825451850400943, -0.3329893710549202, -0.05991440851306706, 0.2986185674212481, 0.08685558535191312, 0.1118979496358518, 0.04913447389640568, -0.018781038131891636, -0.0681250727114578, -0.22078025179482147, 0.2579564912726678, 0.06544551115254299, 0.24475882035729132, 0.12114182090092647, 0.09661313126745977, 0.010565515893527814, -0.05832874501254736, -0.017881451043904872, -0.1308932015825504, 0.12157085309981515, 0.2548980641080753, 0.13715310046743406, 0.1540012151828003, -0.517937402126559, -0.19700752665991322, 0.1556184216516844, 0.1215379082670807, 0.1318242622768147, -0.18074994223813215, -0.38029840248718594, -0.0027281234077619096, -0.17131415414297135, -0.12202394271490018, -0.18589041316718385, -0.0036633889713700405, 0.0924085160296639, -0.23828868809760662, 0.022927092821255587, -0.020906411818016255, 0.03821358306888949, -0.07149132423658382, -0.21214445445098376, 0.12018774693888988, -0.003924072899839334, 0.02477458279514522, -0.013610654200116793, 0.23726969938561843, -0.2738185360090268, -0.2250887780131674, 0.4018715630171069, -0.10393051832522217, -0.040432775752586234, 0.19630122325268753, -0.13057868011916676, -0.11634614357005871, 0.04412911254749225, 0.17944633614337235, 0.08145282493103623, -0.10625421126748909, 0.11953157363684129, 0.04098406956906904, 0.1052230763853642, 0.044491763447264306, 0.17374997563137298, 0.38970374887841835, 0.2568930179991743, 0.02914235133906467, 0.05273038902107561, -0.10343715979864723, -0.006682271971122215, -0.2959290201399933, -0.22599591329497726, -0.07671560744117749, 0.041785285350654205, -0.011290033567204597, -0.07821760060706813, 0.3500136023289279, 0.1633408705850965, 0.14715884109803787, -0.09848437894936324, 0.35538806276101814, -0.030817887224992246, 0.002461446612550501, -0.0699596028415519, 0.31147313340191257, 0.14344725689622, 0.1288267367053777, -0.21294116911788782, -0.050804341432491414, -0.06204008582260525]
1,803.07548
Exploring dimension learning via a penalized probabilistic principal component analysis
Establishing a low-dimensional representation of the data leads to efficient data learning strategies. In many cases, the reduced dimension needs to be explicitly stated and estimated from the data. We explore the estimation of dimension in finite samples as a constrained optimization problem, where the estimated dimension is a maximizer of a penalized profile likelihood criterion within the framework of a probabilistic principal components analysis. Unlike other penalized maximization problems that require an "optimal" penalty tuning parameter, we propose a data-averaging procedure whereby the estimated dimension emerges as the most favourable choice over a range of plausible penalty parameters. The proposed heuristic is compared to a large number of alternative criteria in simulations and an application to gene expression data. Extensive simulation studies reveal that none of the methods uniformly dominate the other and highlight the importance of subject-specific knowledge in choosing statistical methods for dimension learning. Our application results also suggest that gene expression data have a higher intrinsic dimension than previously thought. Overall, our proposed heuristic strikes a good balance and is the method of choice when model assumptions deviated moderately.
stat.ME
establishing a lowdimensional representation of the data leads to efficient data learning strategies in many cases the reduced dimension needs to be explicitly stated and estimated from the data we explore the estimation of dimension in finite samples as a constrained optimization problem where the estimated dimension is a maximizer of a penalized profile likelihood criterion within the framework of a probabilistic principal components analysis unlike other penalized maximization problems that require an optimal penalty tuning parameter we propose a dataaveraging procedure whereby the estimated dimension emerges as the most favourable choice over a range of plausible penalty parameters the proposed heuristic is compared to a large number of alternative criteria in simulations and an application to gene expression data extensive simulation studies reveal that none of the methods uniformly dominate the other and highlight the importance of subjectspecific knowledge in choosing statistical methods for dimension learning our application results also suggest that gene expression data have a higher intrinsic dimension than previously thought overall our proposed heuristic strikes a good balance and is the method of choice when model assumptions deviated moderately
[['establishing', 'a', 'lowdimensional', 'representation', 'of', 'the', 'data', 'leads', 'to', 'efficient', 'data', 'learning', 'strategies', 'in', 'many', 'cases', 'the', 'reduced', 'dimension', 'needs', 'to', 'be', 'explicitly', 'stated', 'and', 'estimated', 'from', 'the', 'data', 'we', 'explore', 'the', 'estimation', 'of', 'dimension', 'in', 'finite', 'samples', 'as', 'a', 'constrained', 'optimization', 'problem', 'where', 'the', 'estimated', 'dimension', 'is', 'a', 'maximizer', 'of', 'a', 'penalized', 'profile', 'likelihood', 'criterion', 'within', 'the', 'framework', 'of', 'a', 'probabilistic', 'principal', 'components', 'analysis', 'unlike', 'other', 'penalized', 'maximization', 'problems', 'that', 'require', 'an', 'optimal', 'penalty', 'tuning', 'parameter', 'we', 'propose', 'a', 'dataaveraging', 'procedure', 'whereby', 'the', 'estimated', 'dimension', 'emerges', 'as', 'the', 'most', 'favourable', 'choice', 'over', 'a', 'range', 'of', 'plausible', 'penalty', 'parameters', 'the', 'proposed', 'heuristic', 'is', 'compared', 'to', 'a', 'large', 'number', 'of', 'alternative', 'criteria', 'in', 'simulations', 'and', 'an', 'application', 'to', 'gene', 'expression', 'data', 'extensive', 'simulation', 'studies', 'reveal', 'that', 'none', 'of', 'the', 'methods', 'uniformly', 'dominate', 'the', 'other', 'and', 'highlight', 'the', 'importance', 'of', 'subjectspecific', 'knowledge', 'in', 'choosing', 'statistical', 'methods', 'for', 'dimension', 'learning', 'our', 'application', 'results', 'also', 'suggest', 'that', 'gene', 'expression', 'data', 'have', 'a', 'higher', 'intrinsic', 'dimension', 'than', 'previously', 'thought', 'overall', 'our', 'proposed', 'heuristic', 'strikes', 'a', 'good', 'balance', 'and', 'is', 'the', 'method', 'of', 'choice', 'when', 'model', 'assumptions', 'deviated', 'moderately']]
[-0.05529932496598461, -0.003885153748682229, -0.09661785195898878, 0.10369810111088944, -0.09902789115945419, -0.16691341743917093, 0.08232839931900214, 0.3667581642026102, -0.2505593574868136, -0.3327310148263248, 0.11021490391487113, -0.2363116184536081, -0.1629995047652091, 0.20888730276063863, -0.08102359735678144, 0.0550227016984526, 0.10165782073502438, 0.029540584885111017, -0.07249767686672774, -0.252595169820999, 0.2828174365267342, 0.07048717171342654, 0.32684450029589973, -0.0012272474903531453, 0.1283675758046169, 0.00595030330881415, -0.042836239824972144, 0.04910052190017258, -0.14588604531321095, 0.14944142624121773, 0.3057122029169657, 0.18165753544103558, 0.3446925642112127, -0.3630324631090184, -0.258580248288626, 0.13083011223064675, 0.15118142064906412, 0.10027590194450957, -0.026508603497039894, -0.22100074058987076, 0.0678416304453404, -0.16056971697924802, -0.11266457388794132, -0.10506075128892457, -0.028607076760586145, -0.01947177233363778, -0.35878364350595565, 0.08164906968822534, 0.04970097741889921, 0.06678783566087157, -0.08110984506029226, -0.16817435570787842, 0.00025570122038966024, 0.0908053298584751, 0.09381133112045782, 0.011513395833649806, 0.14167397655546665, -0.11984113020730297, -0.12133763949188486, 0.34297168961531677, -0.02421504723659402, -0.24085940296792394, 0.18361035330671366, -0.051781188150366336, -0.13351557078351686, 0.12966487262683285, 0.17541072266892746, 0.1333864958583285, -0.14791426285859877, 0.053013673703349966, -0.05336237976207285, 0.1791623090086812, 0.010786905154268575, -0.009185636955298034, 0.11264473206624594, 0.1984698737301137, 0.09592336548391088, 0.12371538825215424, -0.09743621296653586, -0.10004764656244604, -0.2752234717513752, -0.10785552808646481, -0.2174139572844769, -0.003913745298792332, -0.181982357788941, -0.14281120683465684, 0.3637308142465222, 0.1834333266392555, 0.21060176514559886, 0.06077208176030071, 0.3216431818104216, 0.09934981759371501, 0.06914843302035809, 0.08096013754570427, 0.20745234490035788, 0.08346397743898105, 0.03162312479932782, -0.20239762913123552, 0.12288864411843511, 0.038702195163580824]
1,803.07549
Learning Category-Specific Mesh Reconstruction from Image Collections
We present a learning framework for recovering the 3D shape, camera, and texture of an object from a single image. The shape is represented as a deformable 3D mesh model of an object category where a shape is parameterized by a learned mean shape and per-instance predicted deformation. Our approach allows leveraging an annotated image collection for training, where the deformable model and the 3D prediction mechanism are learned without relying on ground-truth 3D or multi-view supervision. Our representation enables us to go beyond existing 3D prediction approaches by incorporating texture inference as prediction of an image in a canonical appearance space. Additionally, we show that semantic keypoints can be easily associated with the predicted shapes. We present qualitative and quantitative results of our approach on CUB and PASCAL3D datasets and show that we can learn to predict diverse shapes and textures across objects using only annotated image collections. The project website can be found at https://akanazawa.github.io/cmr/.
cs.CV
we present a learning framework for recovering the 3d shape camera and texture of an object from a single image the shape is represented as a deformable 3d mesh model of an object category where a shape is parameterized by a learned mean shape and perinstance predicted deformation our approach allows leveraging an annotated image collection for training where the deformable model and the 3d prediction mechanism are learned without relying on groundtruth 3d or multiview supervision our representation enables us to go beyond existing 3d prediction approaches by incorporating texture inference as prediction of an image in a canonical appearance space additionally we show that semantic keypoints can be easily associated with the predicted shapes we present qualitative and quantitative results of our approach on cub and pascal3d datasets and show that we can learn to predict diverse shapes and textures across objects using only annotated image collections the project website can be found at httpsakanazawagithubiocmr
[['we', 'present', 'a', 'learning', 'framework', 'for', 'recovering', 'the', '3d', 'shape', 'camera', 'and', 'texture', 'of', 'an', 'object', 'from', 'a', 'single', 'image', 'the', 'shape', 'is', 'represented', 'as', 'a', 'deformable', '3d', 'mesh', 'model', 'of', 'an', 'object', 'category', 'where', 'a', 'shape', 'is', 'parameterized', 'by', 'a', 'learned', 'mean', 'shape', 'and', 'perinstance', 'predicted', 'deformation', 'our', 'approach', 'allows', 'leveraging', 'an', 'annotated', 'image', 'collection', 'for', 'training', 'where', 'the', 'deformable', 'model', 'and', 'the', '3d', 'prediction', 'mechanism', 'are', 'learned', 'without', 'relying', 'on', 'groundtruth', '3d', 'or', 'multiview', 'supervision', 'our', 'representation', 'enables', 'us', 'to', 'go', 'beyond', 'existing', '3d', 'prediction', 'approaches', 'by', 'incorporating', 'texture', 'inference', 'as', 'prediction', 'of', 'an', 'image', 'in', 'a', 'canonical', 'appearance', 'space', 'additionally', 'we', 'show', 'that', 'semantic', 'keypoints', 'can', 'be', 'easily', 'associated', 'with', 'the', 'predicted', 'shapes', 'we', 'present', 'qualitative', 'and', 'quantitative', 'results', 'of', 'our', 'approach', 'on', 'cub', 'and', 'pascal3d', 'datasets', 'and', 'show', 'that', 'we', 'can', 'learn', 'to', 'predict', 'diverse', 'shapes', 'and', 'textures', 'across', 'objects', 'using', 'only', 'annotated', 'image', 'collections', 'the', 'project', 'website', 'can', 'be', 'found', 'at', 'httpsakanazawagithubiocmr']]
[0.016453068440732282, -0.014739629865895646, -0.09080221071503904, 0.05313101700710085, -0.11659587194952063, -0.1466643600903738, -0.024003005273138676, 0.4814558309287979, -0.2736887829497648, -0.4018965028047275, 0.04908244259795771, -0.26687338673489136, -0.18673696693888184, 0.1793896248519349, -0.16186032448417675, 0.07401493032319614, 0.13629123329137188, 0.0466459169327162, -0.10219374213678141, -0.19337025462524393, 0.3145256544797657, 1.2876621137062708e-05, 0.3104806179359842, -0.004767684257762411, 0.14169517329905945, -0.002141103148460388, -0.04208782803900062, 0.049387941109904576, -0.06979986661360435, 0.21100545494864958, 0.25810425718261215, 0.1825003511600162, 0.19705440617056014, -0.4244082635984971, -0.22771177935012532, 0.051006931533965356, 0.15838194006079367, 0.14996463614182012, -0.057043953031564176, -0.40621005669713783, 0.08448962365545389, -0.14322090841746196, -0.0036623127018220914, -0.169281990858368, -0.043449163696585365, -0.05321548777954796, -0.3287474810480116, 0.024307929715201355, 0.07399320163322279, 0.07816108065740898, -0.10857364309702415, -0.05740186777219582, -0.038015495058901325, 0.20507182367295265, -0.006068052409458547, 0.07260579560310222, 0.15783096695593438, -0.23747922277424294, -0.10797299613776164, 0.39823610783936697, -0.032502212370626435, -0.24302086138525808, 0.18529219702124977, -0.06510536059235725, -0.09585692456517464, 0.12333929564994879, 0.21143914388719565, 0.1470163277386186, -0.11560487543913321, 0.022891696766750194, -0.098723150672203, 0.22034040523561624, 0.02772669702804146, -0.07649315988498692, 0.2347666355363356, 0.26029001098747057, -0.0011224898760421919, 0.1449078398798473, -0.21169818604987364, -0.031071815323323395, -0.24901384401779908, -0.09497804446772744, -0.20411285169374865, -0.03791551192840322, -0.13326636977273246, -0.17072209258661203, 0.4072430625241489, 0.2144274338691806, 0.2602133065647183, 0.11233082587531475, 0.31729775252274406, -0.016488605379634418, 0.11115897074341774, 0.03755953517527534, 0.16329338806323135, -0.0341662341185535, 0.0764385525507327, -0.12890772721789873, 0.08012025102149122, 0.10344990518970941]
1,803.0755
Riesz bases for $L^2(\partial \Omega)$ and regularity for the Laplace equation in Lipschitz domains
In a paper from 1996, D. Jerison and C. Kenig among other results provided a $H^{1/2}$ regularity result for the Dirichlet problem for the Laplace equation in Lipschitz domains. In this article, we adopt a Hilbertian approach to construct two Riesz bases for $L^2(\partial \Omega),$ which will allow to find in a different way some of the results of D. Jerison and C. Kenig, and G. Savar\'{e} (1998) about the regularity issue of the Laplace equation.
math.AP math.FA
in a paper from 1996 d jerison and c kenig among other results provided a h12 regularity result for the dirichlet problem for the laplace equation in lipschitz domains in this article we adopt a hilbertian approach to construct two riesz bases for l2partial omega which will allow to find in a different way some of the results of d jerison and c kenig and g savare 1998 about the regularity issue of the laplace equation
[['in', 'a', 'paper', 'from', '1996', 'd', 'jerison', 'and', 'c', 'kenig', 'among', 'other', 'results', 'provided', 'a', 'h12', 'regularity', 'result', 'for', 'the', 'dirichlet', 'problem', 'for', 'the', 'laplace', 'equation', 'in', 'lipschitz', 'domains', 'in', 'this', 'article', 'we', 'adopt', 'a', 'hilbertian', 'approach', 'to', 'construct', 'two', 'riesz', 'bases', 'for', 'l2partial', 'omega', 'which', 'will', 'allow', 'to', 'find', 'in', 'a', 'different', 'way', 'some', 'of', 'the', 'results', 'of', 'd', 'jerison', 'and', 'c', 'kenig', 'and', 'g', 'savare', '1998', 'about', 'the', 'regularity', 'issue', 'of', 'the', 'laplace', 'equation']]
[-0.09612023793344729, 0.007174795076839234, -0.1116619101437544, 0.04964429653390605, -0.12125443881622662, -0.11471271446268809, 0.024444392853183672, 0.30906651943529906, -0.2999043417849431, -0.24198743058858732, 0.1130203155089954, -0.30033469234446164, -0.1257398484372779, 0.18890911893226744, -0.12083659759771667, 0.08041162961652797, 0.06005917877988204, 0.0034577555580701876, -0.04626304914831723, -0.2500696315699698, 0.3664118080939117, -0.07370436902305014, 0.1786622172098999, 0.07233754317521264, 0.031655861732648, -0.017213794249600095, -0.05169910424094843, -0.04499515998912485, -0.25481009331078414, 0.17496133639054423, 0.25684933325177745, 0.07797700312527779, 0.3324533520070346, -0.3583603992960171, -0.20279888572220348, 0.11563088770612683, 0.0901410645241604, 0.030561098784490145, 0.0025799995087972525, -0.32640483302652445, 0.07801651421591248, -0.12192615949989934, -0.190567268426285, -0.057557838147898256, 0.10232610674574971, 0.03071035890944155, -0.3434219745625007, 0.0971252589523302, 0.16328416477986857, 0.047100562590027324, -0.13185810526269243, -0.15887232699529513, 0.0038128861985904606, 0.01674514058609738, 0.029599456018523165, 0.10049938580241839, -0.01390170008189192, -0.039371434360203385, -0.08967943522638004, 0.31962345862810154, -0.09225164742613408, -0.2602251609787345, 0.1578673620120083, -0.16285546808151258, -0.16978038196133352, 0.006832405740983392, 0.12839537998048686, 0.16754883530819298, -0.14935650471842996, 0.19413745477810918, -0.06820516944495275, 0.06323590454351354, 0.17032422989263737, -0.038120579023502375, 0.007885517828215501, 0.07093983634044171, 0.10993530896590337, 0.1160608197043123, -0.01649218132890957, -0.023189327244548814, -0.32514675638001217, -0.18648803425266555, -0.17743507880521447, 0.10055479045810276, -0.0869126323555783, -0.14693539251426332, 0.33480445418114724, 0.1326065438946611, 0.1834753951698076, 0.07549716169964277, 0.179566434633575, 0.07553226125769709, -0.0647168935408301, 0.13118684815095835, 0.1446536994331645, 0.1796992900352435, 0.18680689351535157, -0.17046753144026489, -0.01127590205348832, 0.1477337495797608]
1,803.07551
Meta Reinforcement Learning with Latent Variable Gaussian Processes
Learning from small data sets is critical in many practical applications where data collection is time consuming or expensive, e.g., robotics, animal experiments or drug design. Meta learning is one way to increase the data efficiency of learning algorithms by generalizing learned concepts from a set of training tasks to unseen, but related, tasks. Often, this relationship between tasks is hard coded or relies in some other way on human expertise. In this paper, we frame meta learning as a hierarchical latent variable model and infer the relationship between tasks automatically from data. We apply our framework in a model-based reinforcement learning setting and show that our meta-learning model effectively generalizes to novel tasks by identifying how new tasks relate to prior ones from minimal data. This results in up to a 60% reduction in the average interaction time needed to solve tasks compared to strong baselines.
stat.ML cs.LG
learning from small data sets is critical in many practical applications where data collection is time consuming or expensive eg robotics animal experiments or drug design meta learning is one way to increase the data efficiency of learning algorithms by generalizing learned concepts from a set of training tasks to unseen but related tasks often this relationship between tasks is hard coded or relies in some other way on human expertise in this paper we frame meta learning as a hierarchical latent variable model and infer the relationship between tasks automatically from data we apply our framework in a modelbased reinforcement learning setting and show that our metalearning model effectively generalizes to novel tasks by identifying how new tasks relate to prior ones from minimal data this results in up to a 60 reduction in the average interaction time needed to solve tasks compared to strong baselines
[['learning', 'from', 'small', 'data', 'sets', 'is', 'critical', 'in', 'many', 'practical', 'applications', 'where', 'data', 'collection', 'is', 'time', 'consuming', 'or', 'expensive', 'eg', 'robotics', 'animal', 'experiments', 'or', 'drug', 'design', 'meta', 'learning', 'is', 'one', 'way', 'to', 'increase', 'the', 'data', 'efficiency', 'of', 'learning', 'algorithms', 'by', 'generalizing', 'learned', 'concepts', 'from', 'a', 'set', 'of', 'training', 'tasks', 'to', 'unseen', 'but', 'related', 'tasks', 'often', 'this', 'relationship', 'between', 'tasks', 'is', 'hard', 'coded', 'or', 'relies', 'in', 'some', 'other', 'way', 'on', 'human', 'expertise', 'in', 'this', 'paper', 'we', 'frame', 'meta', 'learning', 'as', 'a', 'hierarchical', 'latent', 'variable', 'model', 'and', 'infer', 'the', 'relationship', 'between', 'tasks', 'automatically', 'from', 'data', 'we', 'apply', 'our', 'framework', 'in', 'a', 'modelbased', 'reinforcement', 'learning', 'setting', 'and', 'show', 'that', 'our', 'metalearning', 'model', 'effectively', 'generalizes', 'to', 'novel', 'tasks', 'by', 'identifying', 'how', 'new', 'tasks', 'relate', 'to', 'prior', 'ones', 'from', 'minimal', 'data', 'this', 'results', 'in', 'up', 'to', 'a', '60', 'reduction', 'in', 'the', 'average', 'interaction', 'time', 'needed', 'to', 'solve', 'tasks', 'compared', 'to', 'strong', 'baselines']]
[-0.01025353600017625, 0.030041884706944834, -0.07897440211801492, 0.0699031746345984, -0.17078011654963604, -0.18654486449549393, 0.09083563295988126, 0.4364048331804878, -0.30257704212539355, -0.40196666094873634, 0.057466089675998075, -0.26724594985419997, -0.1857885871047699, 0.22632692667313528, -0.17778761806536694, 0.090620331130415, 0.12824595789583462, 0.04382635711622583, -0.06208030079161989, -0.2740098113609085, 0.311468693877564, 0.01617162572029902, 0.3254334185221771, 0.004912606164889068, 0.110280124075413, -0.01954423030679982, -0.03310894536576709, -0.037107634069841536, -0.04841437408896393, 0.18287082081723985, 0.40253998970234334, 0.232700978146017, 0.36076397668620963, -0.3948571278545752, -0.2331435996658948, 0.12073263488890093, 0.13377102380204664, 0.10083817546794406, -0.013969918244144543, -0.30802968388968177, 0.04686406278843377, -0.15244208036155318, 0.021248981714578105, -0.15744821236589226, -0.01601566292890379, -0.018977461167338755, -0.2974304073509209, 0.042544649300944745, 0.06435719625010682, 0.07661805168700209, -0.05612656345343864, -0.08398708493328419, 0.07663742646568639, 0.16694099108726546, 0.09198866211999283, 0.07434551299670014, 0.16466146950819055, -0.1732570734334362, -0.1910726765446289, 0.3837188321615563, -0.02041229951594557, -0.20876766957950835, 0.24117789990553745, -0.01781563460193321, -0.19120821325412515, 0.08681960034557953, 0.25489696720298255, 0.13171238246766634, -0.1823791381697088, 0.02057615498977327, -0.023728958204337933, 0.1814322244363273, 0.028051537287351835, -0.049492352352664505, 0.14721753317102484, 0.261332953614848, 0.05069028506123581, 0.14680533450560923, -0.06413831249937466, -0.08941294822040438, -0.2095437433323538, -0.09771699835958124, -0.20156630351949406, -0.027916177042893002, -0.1048111973002119, -0.09667898682152004, 0.33979491000919015, 0.2538795692174613, 0.2507944303274877, 0.1067503742037379, 0.35890332988121226, -0.014001001008262789, 0.11497311435875857, 0.09635660250601517, 0.136969130002572, 0.0036352383587382685, 0.15695799354679224, -0.16643818703378696, 0.08483100791309713, -0.00038034657212797883]
1,803.07552
Phonon coupling between a nanomechanical resonator and a quantum fluid
Owing to their extraordinary sensitivity to external forces, nanomechanical systems have become important tools for studying a variety of mesoscopic physical systems and realizing hybrid quantum systems. While nanomechanics has been widely applied in solid-state systems, its use in liquid is scantily studied. There it finds unique applications such as biosensing, rheological sensing, and studying fluid dynamics in unexplored regimes. Its use in quantum fluids offers new opportunities in studying fluids at low excitation levels all the way down to the quantum limit and in nano-metric scales reaching the fluid coherence length. Transduction and control of the low-loss excitations also facilitate long-life quantum information storage. In this work we demonstrate efficient coupling of a nanomechanical resonator to phonons in a bosonic quantum fluid -- superfluid $^4$He. By operating an ultra-high frequency nano-optomechanical microdisk resonator immersed in superfluid $^4$He, we show that the resonator dynamics is predominately determined by phonon-coupling to the superfluid. A high phonon exchange efficiency $>92\%$ and minimum excitation rate of 0.25 phonons per oscillations period are achieved. We further show that the nanomechanical resonator can strongly couple to superfluid cavity phonons with cooperativity up to 880. Our study opens up new opportunities in control and manipulation of superfluids in nano-scale and low-excitation level.
cond-mat.mes-hall
owing to their extraordinary sensitivity to external forces nanomechanical systems have become important tools for studying a variety of mesoscopic physical systems and realizing hybrid quantum systems while nanomechanics has been widely applied in solidstate systems its use in liquid is scantily studied there it finds unique applications such as biosensing rheological sensing and studying fluid dynamics in unexplored regimes its use in quantum fluids offers new opportunities in studying fluids at low excitation levels all the way down to the quantum limit and in nanometric scales reaching the fluid coherence length transduction and control of the lowloss excitations also facilitate longlife quantum information storage in this work we demonstrate efficient coupling of a nanomechanical resonator to phonons in a bosonic quantum fluid superfluid 4he by operating an ultrahigh frequency nanooptomechanical microdisk resonator immersed in superfluid 4he we show that the resonator dynamics is predominately determined by phononcoupling to the superfluid a high phonon exchange efficiency 92 and minimum excitation rate of 025 phonons per oscillations period are achieved we further show that the nanomechanical resonator can strongly couple to superfluid cavity phonons with cooperativity up to 880 our study opens up new opportunities in control and manipulation of superfluids in nanoscale and lowexcitation level
[['owing', 'to', 'their', 'extraordinary', 'sensitivity', 'to', 'external', 'forces', 'nanomechanical', 'systems', 'have', 'become', 'important', 'tools', 'for', 'studying', 'a', 'variety', 'of', 'mesoscopic', 'physical', 'systems', 'and', 'realizing', 'hybrid', 'quantum', 'systems', 'while', 'nanomechanics', 'has', 'been', 'widely', 'applied', 'in', 'solidstate', 'systems', 'its', 'use', 'in', 'liquid', 'is', 'scantily', 'studied', 'there', 'it', 'finds', 'unique', 'applications', 'such', 'as', 'biosensing', 'rheological', 'sensing', 'and', 'studying', 'fluid', 'dynamics', 'in', 'unexplored', 'regimes', 'its', 'use', 'in', 'quantum', 'fluids', 'offers', 'new', 'opportunities', 'in', 'studying', 'fluids', 'at', 'low', 'excitation', 'levels', 'all', 'the', 'way', 'down', 'to', 'the', 'quantum', 'limit', 'and', 'in', 'nanometric', 'scales', 'reaching', 'the', 'fluid', 'coherence', 'length', 'transduction', 'and', 'control', 'of', 'the', 'lowloss', 'excitations', 'also', 'facilitate', 'longlife', 'quantum', 'information', 'storage', 'in', 'this', 'work', 'we', 'demonstrate', 'efficient', 'coupling', 'of', 'a', 'nanomechanical', 'resonator', 'to', 'phonons', 'in', 'a', 'bosonic', 'quantum', 'fluid', 'superfluid', '4he', 'by', 'operating', 'an', 'ultrahigh', 'frequency', 'nanooptomechanical', 'microdisk', 'resonator', 'immersed', 'in', 'superfluid', '4he', 'we', 'show', 'that', 'the', 'resonator', 'dynamics', 'is', 'predominately', 'determined', 'by', 'phononcoupling', 'to', 'the', 'superfluid', 'a', 'high', 'phonon', 'exchange', 'efficiency', '92', 'and', 'minimum', 'excitation', 'rate', 'of', '025', 'phonons', 'per', 'oscillations', 'period', 'are', 'achieved', 'we', 'further', 'show', 'that', 'the', 'nanomechanical', 'resonator', 'can', 'strongly', 'couple', 'to', 'superfluid', 'cavity', 'phonons', 'with', 'cooperativity', 'up', 'to', '880', 'our', 'study', 'opens', 'up', 'new', 'opportunities', 'in', 'control', 'and', 'manipulation', 'of', 'superfluids', 'in', 'nanoscale', 'and', 'lowexcitation', 'level']]
[-0.18183923110411299, 0.25359225362012583, -0.05215265265007208, -0.036137204426312367, -0.014381529188646776, -0.20059482012988955, 0.05025832533734147, 0.3755125722177781, -0.2670978761187232, -0.28331973432994834, -0.006057962450119326, -0.29195222537055976, -0.1058067077526641, 0.251294220479705, -0.007538552481181375, 0.10412906067071073, 0.006829946094033558, -0.04925069492991741, 0.005677573771284121, -0.15544499943441734, 0.2000122838040314, 0.058010806516096816, 0.35223384065008384, 0.09347123134563246, 0.13007948783726045, -0.04852795602026873, 0.08849028125107175, -0.0366877415836448, -0.1584100765061122, 0.09668989735428335, 0.33295881507986386, -0.033026418554392166, 0.27236835749411004, -0.4563578681066269, -0.26044013355631473, 0.049405657931936554, 0.1979644526943292, 0.1835143449046172, -0.07115116620481741, -0.24716396481707328, 0.024794429258965866, -0.1822774548049471, -0.13042965991104521, -0.1557722919666004, 0.0331724109309839, -0.007724850471898141, -0.16678804756062696, 0.06439746248339893, 0.02967608634200765, 0.09913788493080264, -0.05659680018306528, -0.033545786049216986, 0.03623826579963107, 0.08348512645333823, -0.048500035445364874, 0.0003147376827588986, 0.2292607010887345, -0.1762188683831837, -0.10934020717310287, 0.4065711252118756, -0.07510342893202039, -0.13360085008458644, 0.23870046333205408, -0.13628377982574266, -0.059698771616080545, 0.13746981304366052, 0.1773024377041133, 0.06924219918100123, -0.15643746167500844, 0.04296962717227161, 0.055091605035633574, 0.19810017519062612, 0.0972920612977227, 0.1524563380812363, 0.2690617532923636, 0.25015985803854673, 0.030598652427561764, 0.1684050527969148, -0.07366826699864937, -0.06990177143768339, -0.2068369770115923, -0.17718781639889972, -0.1817987155265788, 0.07086839081446936, -0.04636125003006139, -0.11983840341066442, 0.360847691784999, 0.15136427209604666, 0.11983450332929085, -0.06280859274471678, 0.2855687406572809, 0.07956380078046606, 0.06373464439111115, 0.04174850399537784, 0.32753197253431854, 0.21776224233539457, 0.09869952055671048, -0.31265700297180293, -0.04832754655991022, -0.04205094900481948]
1,803.07553
An intersection number formula for CM cycles in Lubin-Tate towers
We give an explicit formula for the arithmetic intersection number of CM cycles on Lubin-Tate spaces for all levels. We prove our formula by formulating the intersection number on the infinite level. Our CM cycles are constructed by choosing two separable quadratic extensions $K_1,K_2/F$ of non-Archimedean local fields $F$. Our formula works for all cases, $K_1$ and $K_2$ can be either the same or different, ramify or unramified. As applications, this formula translate the linear Arithmetic Fundamental Lemma (linear AFL) into a comparison of integrals. This formula can also be used to recover Gross and Keating's result on lifting endomorphism of formal modules.
math.NT math.AG
we give an explicit formula for the arithmetic intersection number of cm cycles on lubintate spaces for all levels we prove our formula by formulating the intersection number on the infinite level our cm cycles are constructed by choosing two separable quadratic extensions k_1k_2f of nonarchimedean local fields f our formula works for all cases k_1 and k_2 can be either the same or different ramify or unramified as applications this formula translate the linear arithmetic fundamental lemma linear afl into a comparison of integrals this formula can also be used to recover gross and keatings result on lifting endomorphism of formal modules
[['we', 'give', 'an', 'explicit', 'formula', 'for', 'the', 'arithmetic', 'intersection', 'number', 'of', 'cm', 'cycles', 'on', 'lubintate', 'spaces', 'for', 'all', 'levels', 'we', 'prove', 'our', 'formula', 'by', 'formulating', 'the', 'intersection', 'number', 'on', 'the', 'infinite', 'level', 'our', 'cm', 'cycles', 'are', 'constructed', 'by', 'choosing', 'two', 'separable', 'quadratic', 'extensions', 'k_1k_2f', 'of', 'nonarchimedean', 'local', 'fields', 'f', 'our', 'formula', 'works', 'for', 'all', 'cases', 'k_1', 'and', 'k_2', 'can', 'be', 'either', 'the', 'same', 'or', 'different', 'ramify', 'or', 'unramified', 'as', 'applications', 'this', 'formula', 'translate', 'the', 'linear', 'arithmetic', 'fundamental', 'lemma', 'linear', 'afl', 'into', 'a', 'comparison', 'of', 'integrals', 'this', 'formula', 'can', 'also', 'be', 'used', 'to', 'recover', 'gross', 'and', 'keatings', 'result', 'on', 'lifting', 'endomorphism', 'of', 'formal', 'modules']]
[-0.17631113673975268, 0.04958674416771864, -0.09671167874856308, 0.11392185452283535, -0.08485557897809413, -0.1366103818169841, 0.0327706678262174, 0.28585425341999765, -0.30281695594900465, -0.2728232809960252, 0.11623028886163293, -0.21354850583783544, -0.12264182277042235, 0.27776431036412275, -0.11816728577054668, -0.009587803818654306, 0.03227596981958071, 0.06311778707365219, -0.05474697310698799, -0.3314661033322463, 0.3097418335930324, -0.05858726881555106, 0.19151009679172593, 0.058706836500620044, 0.10312620759711112, 0.07610126755184189, -0.01078873740896435, -0.006335903446543483, -0.1414220336418931, 0.1531871084796984, 0.3483659733676969, 0.107946616673547, 0.22092914382124892, -0.4527839978437613, -0.14250606412095673, 0.19879675513170292, 0.11173782368780731, 0.067120100611286, 0.04682255295073005, -0.22906377780629267, 0.11990709186734466, -0.19196938636648184, -0.1348265162438597, -0.12928000813589827, 0.046815626010861214, 0.038939413269935635, -0.2539378544684536, -0.010187424700603461, 0.1393589095574444, 0.17580985749776631, -0.08265426875285731, -0.16664985744835864, -0.011854738332469496, 0.08797788880027757, 0.007226383753840138, 0.04371822883731151, 0.10134634470548665, -0.05736175076206132, -0.12631747275959737, 0.32384634217118274, -0.08651085653559, -0.21149980166631907, 0.10989629341713568, -0.10601961134130707, -0.1481155532384568, 0.07853987560109559, 0.09669237698677301, 0.1436962202228237, -0.023736329822994694, 0.16264454491026145, -0.12784024591714438, 0.08026889160201692, 0.166122582026453, -0.00036271607577063067, 0.138403502392057, -0.020370756603297915, 0.08980285441203245, 0.17020716760906918, 0.028619859937006737, -0.034456790636390414, -0.37435911267553224, -0.15568011209811314, -0.13893680653700807, 0.11277352311702601, -0.15415135773773636, -0.16473131910851685, 0.40300452410437093, 0.06026019590288991, 0.1711558446490971, 0.16276001546642568, 0.29158480461723735, 0.16033493690331016, 0.07814617432414157, 0.03459076058896982, 0.1101896582807571, 0.1888789705756941, -0.04505113095948749, -0.11351010972912894, 0.008866760799071133, 0.21289819136197394]
1,803.07554
Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis
In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for iterative stochastic procedures in the presence of probabilistic dependency. We demonstrate the power of this approach in analyzing two of the most important algorithms for matrix completion: (i) the non-convex approach based on Projected Gradient Descent (PGD) for a rank-constrained formulation, also known as the Singular Value Projection algorithm, and (ii) the convex relaxation approach based on nuclear norm minimization (NNM). Using this approach, we establish the first convergence guarantee for the original form of PGD without regularization or sample splitting}, and in particular shows that it converges linearly in the infinity norm. For NNM, we use this approach to study a fictitious iterative procedure that arises in the dual analysis. Our results show that \NNM recovers an $ d $-by-$ d $ rank-$ r $ matrix with $\mathcal{O}(\mu r \log(\mu r) d \log d )$ observed entries. This bound has optimal dependence on the matrix dimension and is independent of the condition number. To the best of our knowledge, this is the first sample complexity result for a tractable matrix completion algorithm that satisfies these two properties simultaneously.
stat.ML cs.IT cs.LG math.IT math.OC math.ST stat.TH
in this paper we introduce a powerful technique based on leaveoneout analysis to the study of lowrank matrix completion problems using this technique we develop a general approach for obtaining finegrained entrywise bounds for iterative stochastic procedures in the presence of probabilistic dependency we demonstrate the power of this approach in analyzing two of the most important algorithms for matrix completion i the nonconvex approach based on projected gradient descent pgd for a rankconstrained formulation also known as the singular value projection algorithm and ii the convex relaxation approach based on nuclear norm minimization nnm using this approach we establish the first convergence guarantee for the original form of pgd without regularization or sample splitting and in particular shows that it converges linearly in the infinity norm for nnm we use this approach to study a fictitious iterative procedure that arises in the dual analysis our results show that nnm recovers an d by d rank r matrix with mathcalomu r logmu r d log d observed entries this bound has optimal dependence on the matrix dimension and is independent of the condition number to the best of our knowledge this is the first sample complexity result for a tractable matrix completion algorithm that satisfies these two properties simultaneously
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'powerful', 'technique', 'based', 'on', 'leaveoneout', 'analysis', 'to', 'the', 'study', 'of', 'lowrank', 'matrix', 'completion', 'problems', 'using', 'this', 'technique', 'we', 'develop', 'a', 'general', 'approach', 'for', 'obtaining', 'finegrained', 'entrywise', 'bounds', 'for', 'iterative', 'stochastic', 'procedures', 'in', 'the', 'presence', 'of', 'probabilistic', 'dependency', 'we', 'demonstrate', 'the', 'power', 'of', 'this', 'approach', 'in', 'analyzing', 'two', 'of', 'the', 'most', 'important', 'algorithms', 'for', 'matrix', 'completion', 'i', 'the', 'nonconvex', 'approach', 'based', 'on', 'projected', 'gradient', 'descent', 'pgd', 'for', 'a', 'rankconstrained', 'formulation', 'also', 'known', 'as', 'the', 'singular', 'value', 'projection', 'algorithm', 'and', 'ii', 'the', 'convex', 'relaxation', 'approach', 'based', 'on', 'nuclear', 'norm', 'minimization', 'nnm', 'using', 'this', 'approach', 'we', 'establish', 'the', 'first', 'convergence', 'guarantee', 'for', 'the', 'original', 'form', 'of', 'pgd', 'without', 'regularization', 'or', 'sample', 'splitting', 'and', 'in', 'particular', 'shows', 'that', 'it', 'converges', 'linearly', 'in', 'the', 'infinity', 'norm', 'for', 'nnm', 'we', 'use', 'this', 'approach', 'to', 'study', 'a', 'fictitious', 'iterative', 'procedure', 'that', 'arises', 'in', 'the', 'dual', 'analysis', 'our', 'results', 'show', 'that', 'nnm', 'recovers', 'an', 'd', 'by', 'd', 'rank', 'r', 'matrix', 'with', 'mathcalomu', 'r', 'logmu', 'r', 'd', 'log', 'd', 'observed', 'entries', 'this', 'bound', 'has', 'optimal', 'dependence', 'on', 'the', 'matrix', 'dimension', 'and', 'is', 'independent', 'of', 'the', 'condition', 'number', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'sample', 'complexity', 'result', 'for', 'a', 'tractable', 'matrix', 'completion', 'algorithm', 'that', 'satisfies', 'these', 'two', 'properties', 'simultaneously']]
[-0.060431648068058716, -0.023248777006745547, -0.11319316156753272, 0.058234171183784295, -0.057562944753336134, -0.15870137460324824, 0.04517604879261792, 0.36971027473919094, -0.28905592942844327, -0.27302258262303813, 0.12114205620581346, -0.22944870552395663, -0.21220702482621367, 0.1504533895899644, -0.06959569577181168, 0.08457850764726142, 0.07497224530637371, 0.03996675445043157, -0.12757512793595496, -0.27290885236936413, 0.31178248061020924, 0.025534506583069428, 0.27572767990507613, 0.03297741406740071, 0.1126057405181287, 0.046939873846769155, -0.019170661537092553, 0.03165093505433114, -0.10538024293789618, 0.16358564750282495, 0.2464732744788938, 0.20840054992209694, 0.3317602552121514, -0.37469684296480044, -0.1505303960070727, 0.1337683572902892, 0.12932120206970255, 0.0962030501695323, -0.0391020745431122, -0.21496224357483631, 0.11964303096890022, -0.1334107309172117, -0.09210778041531077, -0.11432535130682103, -0.01294494339801888, -0.03483496681880652, -0.3524527541321644, 0.07137041017020447, 0.08777684412014328, 0.012225415804935842, -0.06553211889305469, -0.17389948991557325, 0.10418090079220359, 0.030244569528656323, 0.0632224375344189, 0.03389767161459087, 0.09585745199182423, -0.050377145695887755, -0.08515387255604864, 0.32410561983054725, -0.09639620618074776, -0.2167396231868603, 0.13601933741879663, -0.07781395612732378, -0.1712793194004847, 0.10766304277650049, 0.1982819212056946, 0.2063526298638275, -0.11846469737072453, 0.13739633136100257, -0.09826466143042134, 0.14837722577885434, 0.01589801135744775, -0.0017364736048740882, 0.05064081251576685, 0.17800556347147298, 0.16587339966049927, 0.14004185858837653, -0.0725554843972388, -0.06326123362888346, -0.30493370562114497, -0.12991285051300488, -0.2437707090919668, 0.032702433763062984, -0.14475138738293827, -0.15743530957355792, 0.3816027777552444, 0.14298739753614523, 0.2274858253745086, 0.1246575111942143, 0.332737857636296, 0.1125470530804309, 0.02105057515670728, 0.12271695645552788, 0.19801181610523272, 0.15779223829022115, 0.05325257545218716, -0.2617465105246414, 0.06671600142921628, 0.16716668844383442]
1,803.07555
Can Early Dark Energy Explain EDGES?
The Experiment to Detect the Global Epoch of Reionization Signature (EDGES) collaboration has reported the detection of an absorption feature in the sky-averaged spectrum at $\approx 78$ MHz. This signal has been interpreted as the absorption of cosmic microwave background (CMB) photons at redshifts $15 \lesssim z \lesssim 20$ by the 21cm hyperfine transition of neutral hydrogen, whose temperature is expected to be coupled to the gas temperature by the Wouthuysen-Field effect during this epoch. Because the gas is colder than the CMB, the 21cm signal is seen in absorption. However, the absorption depth reported by EDGES is more than twice the maximal value expected in the standard cosmological model, at $\approx 3.8\sigma$ significance. Here, we propose an explanation for this depth based on "early dark energy" (EDE), a scenario in which an additional component with equation of state $w=-1$ contributes to the cosmological energy density at early times, before decaying rapidly at a critical redshift, $z_c$. For $20 \lesssim z_c \lesssim 1000$, the accelerated expansion due to the EDE can produce an earlier decoupling of the gas temperature from the radiation temperature than that in the standard model, giving the gas additional time to cool adiabatically before the first luminous sources form. We show that the EDE scenario can successfully explain the large amplitude of the EDGES signal. However, such models are strongly ruled out by observations of the CMB temperature power spectrum. Moreover, the EDE models needed to explain the EDGES signal exacerbate the current tension in low- and high-redshift measurements of the Hubble constant. We conclude that non-finely-tuned modifications of the background cosmology are unlikely to explain the EDGES signal while remaining consistent with other cosmological observations.
astro-ph.CO
the experiment to detect the global epoch of reionization signature edges collaboration has reported the detection of an absorption feature in the skyaveraged spectrum at approx 78 mhz this signal has been interpreted as the absorption of cosmic microwave background cmb photons at redshifts 15 lesssim z lesssim 20 by the 21cm hyperfine transition of neutral hydrogen whose temperature is expected to be coupled to the gas temperature by the wouthuysenfield effect during this epoch because the gas is colder than the cmb the 21cm signal is seen in absorption however the absorption depth reported by edges is more than twice the maximal value expected in the standard cosmological model at approx 38sigma significance here we propose an explanation for this depth based on early dark energy ede a scenario in which an additional component with equation of state w1 contributes to the cosmological energy density at early times before decaying rapidly at a critical redshift z_c for 20 lesssim z_c lesssim 1000 the accelerated expansion due to the ede can produce an earlier decoupling of the gas temperature from the radiation temperature than that in the standard model giving the gas additional time to cool adiabatically before the first luminous sources form we show that the ede scenario can successfully explain the large amplitude of the edges signal however such models are strongly ruled out by observations of the cmb temperature power spectrum moreover the ede models needed to explain the edges signal exacerbate the current tension in low and highredshift measurements of the hubble constant we conclude that nonfinelytuned modifications of the background cosmology are unlikely to explain the edges signal while remaining consistent with other cosmological observations
[['the', 'experiment', 'to', 'detect', 'the', 'global', 'epoch', 'of', 'reionization', 'signature', 'edges', 'collaboration', 'has', 'reported', 'the', 'detection', 'of', 'an', 'absorption', 'feature', 'in', 'the', 'skyaveraged', 'spectrum', 'at', 'approx', '78', 'mhz', 'this', 'signal', 'has', 'been', 'interpreted', 'as', 'the', 'absorption', 'of', 'cosmic', 'microwave', 'background', 'cmb', 'photons', 'at', 'redshifts', '15', 'lesssim', 'z', 'lesssim', '20', 'by', 'the', '21cm', 'hyperfine', 'transition', 'of', 'neutral', 'hydrogen', 'whose', 'temperature', 'is', 'expected', 'to', 'be', 'coupled', 'to', 'the', 'gas', 'temperature', 'by', 'the', 'wouthuysenfield', 'effect', 'during', 'this', 'epoch', 'because', 'the', 'gas', 'is', 'colder', 'than', 'the', 'cmb', 'the', '21cm', 'signal', 'is', 'seen', 'in', 'absorption', 'however', 'the', 'absorption', 'depth', 'reported', 'by', 'edges', 'is', 'more', 'than', 'twice', 'the', 'maximal', 'value', 'expected', 'in', 'the', 'standard', 'cosmological', 'model', 'at', 'approx', '38sigma', 'significance', 'here', 'we', 'propose', 'an', 'explanation', 'for', 'this', 'depth', 'based', 'on', 'early', 'dark', 'energy', 'ede', 'a', 'scenario', 'in', 'which', 'an', 'additional', 'component', 'with', 'equation', 'of', 'state', 'w1', 'contributes', 'to', 'the', 'cosmological', 'energy', 'density', 'at', 'early', 'times', 'before', 'decaying', 'rapidly', 'at', 'a', 'critical', 'redshift', 'z_c', 'for', '20', 'lesssim', 'z_c', 'lesssim', '1000', 'the', 'accelerated', 'expansion', 'due', 'to', 'the', 'ede', 'can', 'produce', 'an', 'earlier', 'decoupling', 'of', 'the', 'gas', 'temperature', 'from', 'the', 'radiation', 'temperature', 'than', 'that', 'in', 'the', 'standard', 'model', 'giving', 'the', 'gas', 'additional', 'time', 'to', 'cool', 'adiabatically', 'before', 'the', 'first', 'luminous', 'sources', 'form', 'we', 'show', 'that', 'the', 'ede', 'scenario', 'can', 'successfully', 'explain', 'the', 'large', 'amplitude', 'of', 'the', 'edges', 'signal', 'however', 'such', 'models', 'are', 'strongly', 'ruled', 'out', 'by', 'observations', 'of', 'the', 'cmb', 'temperature', 'power', 'spectrum', 'moreover', 'the', 'ede', 'models', 'needed', 'to', 'explain', 'the', 'edges', 'signal', 'exacerbate', 'the', 'current', 'tension', 'in', 'low', 'and', 'highredshift', 'measurements', 'of', 'the', 'hubble', 'constant', 'we', 'conclude', 'that', 'nonfinelytuned', 'modifications', 'of', 'the', 'background', 'cosmology', 'are', 'unlikely', 'to', 'explain', 'the', 'edges', 'signal', 'while', 'remaining', 'consistent', 'with', 'other', 'cosmological', 'observations']]
[-0.0871874694141858, 0.1683630390590521, -0.03393783300320574, 0.061987493906961254, -0.06427865536096106, -0.10227352833061555, 0.01655105723603879, 0.35630160192942323, -0.20721989106153235, -0.34470875421372044, 0.06179713895444267, -0.3257897524396792, -0.00855717158085236, 0.16326821848569806, 0.04663231531091328, -0.016204555666634955, -0.006258250290935185, -0.00248775934453346, -0.010476143939675527, -0.25824261381955127, 0.2654237977185664, 0.18574118952176744, 0.2245116131864221, 0.03833127631989431, 0.06178420726927565, -0.11094548075550026, -0.06274937943465286, -0.024752503900211238, -0.1535773580091641, -0.01409764364812403, 0.23401937443766876, 0.11595195752909027, 0.1936148216982963, -0.3888076412187736, -0.2556571875211506, 0.1658605828307115, 0.16626034405810164, 0.12208177150338954, -0.03674476234874259, -0.27846998162484166, 0.042278741959438204, -0.13920938253872545, -0.13017386330398448, 0.02702426006450021, 0.011537768173709138, -0.06779721167583626, -0.23759808585775422, 0.17158797418525087, 0.0021533538999643485, 0.014275337091653765, -0.06359018086068546, -0.10436161604916884, -0.03799461498360006, -0.014677767306365955, 0.04406010698507069, 0.08243184298857727, 0.1765109075760756, -0.16953775450240113, -0.034207268629730496, 0.38283516377491017, -0.15234088951609753, -0.009694319118254928, 0.16468852035151327, -0.20887075255935392, -0.14197119615811815, 0.1890260233797507, 0.13213417506200933, 0.040522744632109094, -0.1320438367572503, 0.05530240939165245, 0.03696888579868488, 0.2354078506883968, 0.06675962132892461, 0.0320957271218647, 0.32420438926626916, 0.11868368867470959, 0.05537970543390067, 0.06644192827330556, -0.1562923402886414, 0.012538946388075695, -0.2698298851987781, -0.08983316728478051, -0.1657280869411445, 0.08629485751889432, -0.1401549020423557, -0.09506705296321816, 0.3751032542832459, 0.1914192249378403, 0.26567614613865304, 0.04566959517058252, 0.35238287207006236, 0.12266849569632508, 0.07586783881793233, 0.0775372355844238, 0.3505783162270022, 0.12346226567031957, 0.1097021219128656, -0.2126703241933471, 0.0649459182429144, -0.04167297439679744]
1,803.07556
Resolving the hydrostatic mass profiles of galaxy clusters at z~1 with XMM-Newton and Chandra
We present a detailed study of the integrated total hydrostatic mass profiles of the five most massive ($M^{\mathrm{SZ}}_{500} > 5 \times 10^{14}$ M$_{\odot}$) galaxy clusters selected at $z\sim1$ via the Sunyaev-Zel'dovich effect. These objects represent an ideal laboratory to test structure formation models where the primary driver is gravity. Optimally exploiting spatially-resolved spectroscopic information from XMM-Newton and Chandra observations, we used both parametric (forward, backward) and non-parametric methods to recover the mass profiles, finding that the results are extremely robust when density and temperature measurements are both available. Our X-ray masses at $R_{500}$ are higher than the weak lensing masses obtained from the Hubble Space Telescope (HST), with a mean ratio of $1.39^{+0.47}_{-0.35}$. This offset goes in the opposite direction to that expected in a scenario where the hydrostatic method yields a biased, underestimated, mass. We investigated halo shape parameters such as sparsity and concentration, and compared to local X-ray selected clusters, finding hints for evolution in the central regions (or for selection effects). The total baryonic content is in agreement with the cosmic value at $R_{500}$. Comparison with numerical simulations shows that the mass distribution and concentration are in line with expectations. These results illustrate the power of X-ray observations to probe the statistical properties of the gas and total mass profiles in this high-mass, high-redshift regime.
astro-ph.CO
we present a detailed study of the integrated total hydrostatic mass profiles of the five most massive mmathrmsz_500 5 times 1014 m_odot galaxy clusters selected at zsim1 via the sunyaevzeldovich effect these objects represent an ideal laboratory to test structure formation models where the primary driver is gravity optimally exploiting spatiallyresolved spectroscopic information from xmmnewton and chandra observations we used both parametric forward backward and nonparametric methods to recover the mass profiles finding that the results are extremely robust when density and temperature measurements are both available our xray masses at r_500 are higher than the weak lensing masses obtained from the hubble space telescope hst with a mean ratio of 139047_035 this offset goes in the opposite direction to that expected in a scenario where the hydrostatic method yields a biased underestimated mass we investigated halo shape parameters such as sparsity and concentration and compared to local xray selected clusters finding hints for evolution in the central regions or for selection effects the total baryonic content is in agreement with the cosmic value at r_500 comparison with numerical simulations shows that the mass distribution and concentration are in line with expectations these results illustrate the power of xray observations to probe the statistical properties of the gas and total mass profiles in this highmass highredshift regime
[['we', 'present', 'a', 'detailed', 'study', 'of', 'the', 'integrated', 'total', 'hydrostatic', 'mass', 'profiles', 'of', 'the', 'five', 'most', 'massive', 'mmathrmsz_500', '5', 'times', '1014', 'm_odot', 'galaxy', 'clusters', 'selected', 'at', 'zsim1', 'via', 'the', 'sunyaevzeldovich', 'effect', 'these', 'objects', 'represent', 'an', 'ideal', 'laboratory', 'to', 'test', 'structure', 'formation', 'models', 'where', 'the', 'primary', 'driver', 'is', 'gravity', 'optimally', 'exploiting', 'spatiallyresolved', 'spectroscopic', 'information', 'from', 'xmmnewton', 'and', 'chandra', 'observations', 'we', 'used', 'both', 'parametric', 'forward', 'backward', 'and', 'nonparametric', 'methods', 'to', 'recover', 'the', 'mass', 'profiles', 'finding', 'that', 'the', 'results', 'are', 'extremely', 'robust', 'when', 'density', 'and', 'temperature', 'measurements', 'are', 'both', 'available', 'our', 'xray', 'masses', 'at', 'r_500', 'are', 'higher', 'than', 'the', 'weak', 'lensing', 'masses', 'obtained', 'from', 'the', 'hubble', 'space', 'telescope', 'hst', 'with', 'a', 'mean', 'ratio', 'of', '139047_035', 'this', 'offset', 'goes', 'in', 'the', 'opposite', 'direction', 'to', 'that', 'expected', 'in', 'a', 'scenario', 'where', 'the', 'hydrostatic', 'method', 'yields', 'a', 'biased', 'underestimated', 'mass', 'we', 'investigated', 'halo', 'shape', 'parameters', 'such', 'as', 'sparsity', 'and', 'concentration', 'and', 'compared', 'to', 'local', 'xray', 'selected', 'clusters', 'finding', 'hints', 'for', 'evolution', 'in', 'the', 'central', 'regions', 'or', 'for', 'selection', 'effects', 'the', 'total', 'baryonic', 'content', 'is', 'in', 'agreement', 'with', 'the', 'cosmic', 'value', 'at', 'r_500', 'comparison', 'with', 'numerical', 'simulations', 'shows', 'that', 'the', 'mass', 'distribution', 'and', 'concentration', 'are', 'in', 'line', 'with', 'expectations', 'these', 'results', 'illustrate', 'the', 'power', 'of', 'xray', 'observations', 'to', 'probe', 'the', 'statistical', 'properties', 'of', 'the', 'gas', 'and', 'total', 'mass', 'profiles', 'in', 'this', 'highmass', 'highredshift', 'regime']]
[-0.05200232542905047, 0.08844542989221695, -0.07028680626996035, 0.10662788426243636, -0.07074113648688031, -0.053219609740081913, 0.04012713544287307, 0.41308714250145956, -0.17884210101707818, -0.37548377687154816, 0.06722696772018491, -0.3293910136749578, -0.009767304621853453, 0.20206152967740457, 0.01934700368925236, 0.021323834616842483, 0.0458788325912644, -0.04861997206435474, -0.09603021239840187, -0.25468709830432956, 0.29253706100158566, 0.11345161950042428, 0.24482334893803265, -0.026109040578892236, 0.05707061029645766, -0.055057388364044994, -0.08893874125598475, 0.042762065691694745, -0.17864071859942268, 0.04617172908416928, 0.23374264328058628, 0.10422316147989139, 0.22959223045361077, -0.3562002004145883, -0.20333749029872028, 0.0683237612994691, 0.1648011268939563, 0.06123417070308743, -0.10086551467498202, -0.26182922821405324, 0.07522688323149977, -0.14992896788767104, -0.16241915506029198, 0.028892478580738224, -0.017843242018851777, 0.03236720671682337, -0.2718662429560344, 0.18586076718868774, -0.053024546570296205, 0.034748226867685486, -0.12991985619003169, -0.12307877376632288, -0.06823909599496442, 0.07639536874512276, 0.04068586940898798, 0.0389652892719781, 0.20441582943177458, -0.1482957166987796, -0.021356103662401437, 0.37250767953146985, -0.06690221273558225, -0.06396217834485998, 0.20366005569176618, -0.21499608303420245, -0.19170262440389327, 0.11642654190533036, 0.16782935956211456, 0.09365190540895213, -0.1654583107003926, 0.004684060640080811, -0.034207394199857355, 0.23972494181158932, 0.04210450096721869, 0.037640395975803015, 0.2910279000459542, 0.12684142233987966, 0.052203983204915774, 0.08148023272799544, -0.2063303982860647, -0.03257046338863844, -0.2455324212414061, -0.07988342485542214, -0.12997242497377703, 0.050494942376606684, -0.15213190215635708, -0.08967079071674583, 0.3142330959092739, 0.15575107296625543, 0.2410297716556247, 0.0951366353509298, 0.33933323767296103, 0.10999687879487093, 0.07247188430236176, 0.08755654789788951, 0.3021473957139046, 0.18209256693547549, 0.08198100876572087, -0.248683586034404, 0.04114829915207486, -0.00885306243340723]
1,803.07557
The cone of supermodular games on finite distributive lattices
In this article we study supermodular functions on finite distributive lattices. Relaxing the assumption that the domain is a powerset of a finite set, we focus on geometrical properties of the polyhedral cone of such functions. Specifically, we generalize the criterion for extremality and study the face lattice of the supermodular cone. An explicit description of facets by the corresponding tight linear inequalities is provided.
math.CO
in this article we study supermodular functions on finite distributive lattices relaxing the assumption that the domain is a powerset of a finite set we focus on geometrical properties of the polyhedral cone of such functions specifically we generalize the criterion for extremality and study the face lattice of the supermodular cone an explicit description of facets by the corresponding tight linear inequalities is provided
[['in', 'this', 'article', 'we', 'study', 'supermodular', 'functions', 'on', 'finite', 'distributive', 'lattices', 'relaxing', 'the', 'assumption', 'that', 'the', 'domain', 'is', 'a', 'powerset', 'of', 'a', 'finite', 'set', 'we', 'focus', 'on', 'geometrical', 'properties', 'of', 'the', 'polyhedral', 'cone', 'of', 'such', 'functions', 'specifically', 'we', 'generalize', 'the', 'criterion', 'for', 'extremality', 'and', 'study', 'the', 'face', 'lattice', 'of', 'the', 'supermodular', 'cone', 'an', 'explicit', 'description', 'of', 'facets', 'by', 'the', 'corresponding', 'tight', 'linear', 'inequalities', 'is', 'provided']]
[-0.14299541627271817, 0.0594590423774207, -0.08633835445552204, 0.09089437192485023, -0.11096128443829142, -0.08082807046862749, 0.07752019184856461, 0.38483606731662384, -0.3229038042016327, -0.14509786563710525, 0.11811625347651827, -0.25054311185645367, -0.15596882695188888, 0.1498415932059288, -0.0999721739297876, 0.06272764876484871, 0.021703604959811156, 0.006286745049202671, -0.14721352267795457, -0.2833813796393, 0.41500121486874725, -0.00795163568825676, 0.2706811829470098, 0.13747901916145705, 0.12059955545331692, 0.07205152977437068, 0.004297801873718317, 0.06778367014888387, -0.2175961479012935, 0.1679610410848489, 0.19106445375543374, 0.16555279695357267, 0.24819844595443172, -0.4101466385790935, -0.1296915495799532, 0.11393323504867461, 0.032549570214289884, 0.06129238686452691, -0.026434671869859674, -0.2090502701054972, 0.10750419314091023, -0.12193375648214266, -0.1385601817845152, -0.07115488728651634, -0.0031266989186406135, 0.03955245717930106, -0.26338470498673044, -0.0020264147422634636, 0.17102906827170114, 0.13842713188272543, -0.07759041573959762, -0.11517227240479909, 0.018407642687312684, 0.039724736187893614, -0.01628347372349638, -0.007513607006806594, 0.05606934400991752, -0.10135805983311282, -0.12386462821875914, 0.3955315068077583, 0.0050080460711167405, -0.277703869715333, 0.16752440816221328, -0.14434744014333073, -0.11065177490146687, 0.06567966772529941, 0.20425536217024692, 0.18707199439119834, -0.12706467502105695, 0.1754014891348421, -0.19096645571004886, 0.1131831771049362, 0.0789420411707117, 0.06804892402142286, 0.14439263017848133, 0.124242492328183, 0.12637509051710366, 0.24014283573398224, 0.03677276187361433, -0.08641153165640739, -0.38163232046824236, -0.1444885174672191, -0.2099445092635086, 0.07052656730207113, -0.11741596736851184, -0.20613637946259517, 0.40696190804816207, 0.048421927290753675, 0.18810896411394842, 0.12929121132653493, 0.22163246176563778, 0.11169025283150125, 0.03327742058497209, 0.023666431299912243, 0.17558690646591668, 0.13009976097382606, -0.02120508670520324, -0.20709138644429353, 0.026376405967256197, 0.16905977715953038]
1,803.07558
Mixed Spectral Element Method for the Waveguide Problem with Bloch Periodic Boundary
The mixed spectral element method (MSEM) is applied to solve the waveguide problem with Bloch periodic boundary condition (BPBC). Based on the BPBC for the original Helmholtz equation and the periodic boundary condition (PBC) for the equivalent but modified Helmholtz equation, two equivalent mixed variational formulations are applied for the MSEM. Unlike the traditional finite element method and SEM, both these mixed SEM schemes are completely free of spurious modes because of their use of the Gauss' law and the curl-conforming vector basis functions structured by the Gauss-Legendre-Lobatto (GLL) points. A simple implementation method is used to deal with the BPBC and the PBC for the mixed variational formulations so that both schemes can save computational costs over the traditional methods. Several numerical results are also provided to verify that both schemes are free of spurious modes and have high accuracy with the propagation constants.
physics.comp-ph
the mixed spectral element method msem is applied to solve the waveguide problem with bloch periodic boundary condition bpbc based on the bpbc for the original helmholtz equation and the periodic boundary condition pbc for the equivalent but modified helmholtz equation two equivalent mixed variational formulations are applied for the msem unlike the traditional finite element method and sem both these mixed sem schemes are completely free of spurious modes because of their use of the gauss law and the curlconforming vector basis functions structured by the gausslegendrelobatto gll points a simple implementation method is used to deal with the bpbc and the pbc for the mixed variational formulations so that both schemes can save computational costs over the traditional methods several numerical results are also provided to verify that both schemes are free of spurious modes and have high accuracy with the propagation constants
[['the', 'mixed', 'spectral', 'element', 'method', 'msem', 'is', 'applied', 'to', 'solve', 'the', 'waveguide', 'problem', 'with', 'bloch', 'periodic', 'boundary', 'condition', 'bpbc', 'based', 'on', 'the', 'bpbc', 'for', 'the', 'original', 'helmholtz', 'equation', 'and', 'the', 'periodic', 'boundary', 'condition', 'pbc', 'for', 'the', 'equivalent', 'but', 'modified', 'helmholtz', 'equation', 'two', 'equivalent', 'mixed', 'variational', 'formulations', 'are', 'applied', 'for', 'the', 'msem', 'unlike', 'the', 'traditional', 'finite', 'element', 'method', 'and', 'sem', 'both', 'these', 'mixed', 'sem', 'schemes', 'are', 'completely', 'free', 'of', 'spurious', 'modes', 'because', 'of', 'their', 'use', 'of', 'the', 'gauss', 'law', 'and', 'the', 'curlconforming', 'vector', 'basis', 'functions', 'structured', 'by', 'the', 'gausslegendrelobatto', 'gll', 'points', 'a', 'simple', 'implementation', 'method', 'is', 'used', 'to', 'deal', 'with', 'the', 'bpbc', 'and', 'the', 'pbc', 'for', 'the', 'mixed', 'variational', 'formulations', 'so', 'that', 'both', 'schemes', 'can', 'save', 'computational', 'costs', 'over', 'the', 'traditional', 'methods', 'several', 'numerical', 'results', 'are', 'also', 'provided', 'to', 'verify', 'that', 'both', 'schemes', 'are', 'free', 'of', 'spurious', 'modes', 'and', 'have', 'high', 'accuracy', 'with', 'the', 'propagation', 'constants']]
[-0.07606214955288532, 0.0701286619240097, -0.09479540241561059, 0.05970982399062607, -0.08958678851867544, -0.16872389649586944, 0.003180133599531034, 0.38922429173414047, -0.2902692540195482, -0.257370269632545, 0.14817233280246628, -0.2470162778322039, -0.10914397386127504, 0.22179589206433117, -0.06272383571827206, 0.13608139895288082, 0.09728866679401234, 0.004409343916280516, -0.10186982320316522, -0.24629366614309878, 0.31444096632044893, -0.01858900044081283, 0.31954113194911643, 0.040718645849746875, 0.11569740351867573, -0.02232148362612673, -0.014330416850360303, 0.03678128007349783, -0.10064468579898701, 0.13520345058982614, 0.20970947539819212, 0.05870341414842626, 0.2815193339154638, -0.45186114262404115, -0.2474148219258621, 0.06993667208910759, 0.11582798944457016, 0.09929837219352866, -0.004480575587889501, -0.24691850310512659, 0.1136214570720391, -0.11934251543134451, -0.1303780996047988, -0.09896458091920819, -0.07368444114409645, 0.04957357045134594, -0.2949151610666565, 0.1118301851207246, 0.009446669935152448, 0.03378752827130515, -0.10592536847107112, -0.1554954991210252, -0.0102500111073384, 0.06295845196100658, 0.017673852103601756, -0.035351803044563736, 0.023930867327826805, -0.04711594150626454, -0.09967051820090876, 0.39179448181570603, -0.043579262000476494, -0.30931590009352256, 0.1874033623342884, -0.034356906281679804, -0.057232208768355435, 0.15400892924517393, 0.11217409190480951, 0.14052971470242984, -0.12261979980233671, 0.09350515733882464, 0.0004834590431559702, 0.14078574261531748, 0.08610070188497675, -0.006230071450358835, 0.08115839490843615, 0.0600040610802384, 0.08644829777406593, 0.1097553595169929, -0.07283022247800797, -0.10557390590808514, -0.2996599611151835, -0.14417656083944544, -0.18079208551809706, -0.05658735291518528, -0.08709425703604336, -0.22041958476063506, 0.3560810101314865, 0.11519010775754678, 0.08110960570750116, 0.04887337773267565, 0.2974444423705853, 0.17982082814620487, 0.04730016747007853, 0.08025895392457986, 0.19207589778374753, 0.18484052664857228, 0.08995020853532157, -0.2767365155564942, -0.013638564958467936, 0.12098911003819827]
1,803.07559
KELT-22Ab: A Massive Hot Jupiter Transiting a Near Solar Twin
We present the discovery of KELT-22Ab, a hot Jupiter from the KELT-South survey. KELT-22Ab transits the moderately bright ($V\sim 11.1$) Sun-like G2V star TYC 7518-468-1. The planet has an orbital period of $P = 1.3866529 \pm 0.0000027 $ days, a radius of $R_{P} = 1.285_{-0.071}^{+0.12}~R_{J}$, and a relatively large mass of $M_{P} = 3.47_{-0.14}^{+0.15}~ M_{J}$. The star has $R_{\star} = 1.099_{-0.046}^{+0.079}~ R_{\odot}$, $M_{\star} = 1.092_{-0.041}^{+0.045}~ M_{\odot}$, ${T_{\rm eff}\,} = 5767_{-49}^{+50}~$ K, ${\log{g_\star}} = 4.393_{-0.060}^{+0.039}~$ (cgs), and [m/H] = $+0.259_{-0.083}^{+0.085}~$, and thus, other than its slightly super-solar metallicity, appears to be a near solar twin. Surprisingly, KELT-22A exhibits kinematics and a Galactic orbit that are somewhat atypical for thin disk stars. Nevertheless, the star is rotating quite rapidly for its estimated age, shows evidence of chromospheric activity, and is somewhat metal rich. Imaging reveals a slightly fainter companion to KELT-22A that is likely bound, with a projected separation of 6\arcsec ($\sim$1400 AU). In addition to the orbital motion caused by the transiting planet, we detect a possible linear trend in the radial velocity of KELT-22A suggesting the presence of another relatively nearby body that is perhaps non-stellar. KELT-22Ab is highly irradiated (as a consequence of the small semi-major axis of $a/R_{\star} = 4.97$), and is mildly inflated. At such small separations, tidal forces become significant. The configuration of this system is optimal for measuring the rate of tidal dissipation within the host star. Our models predict that, due to tidal forces, the semi-major axis of KELT-22Ab is decreasing rapidly, and is thus predicted to spiral into the star within the next Gyr.
astro-ph.EP astro-ph.SR
we present the discovery of kelt22ab a hot jupiter from the keltsouth survey kelt22ab transits the moderately bright vsim 111 sunlike g2v star tyc 75184681 the planet has an orbital period of p 13866529 pm 00000027 days a radius of r_p 1285_0071012r_j and a relatively large mass of m_p 347_014015 m_j the star has r_star 1099_00460079 r_odot m_star 1092_00410045 m_odot t_rm eff 5767_4950 k logg_star 4393_00600039 cgs and mh 0259_00830085 and thus other than its slightly supersolar metallicity appears to be a near solar twin surprisingly kelt22a exhibits kinematics and a galactic orbit that are somewhat atypical for thin disk stars nevertheless the star is rotating quite rapidly for its estimated age shows evidence of chromospheric activity and is somewhat metal rich imaging reveals a slightly fainter companion to kelt22a that is likely bound with a projected separation of 6arcsec sim1400 au in addition to the orbital motion caused by the transiting planet we detect a possible linear trend in the radial velocity of kelt22a suggesting the presence of another relatively nearby body that is perhaps nonstellar kelt22ab is highly irradiated as a consequence of the small semimajor axis of ar_star 497 and is mildly inflated at such small separations tidal forces become significant the configuration of this system is optimal for measuring the rate of tidal dissipation within the host star our models predict that due to tidal forces the semimajor axis of kelt22ab is decreasing rapidly and is thus predicted to spiral into the star within the next gyr
[['we', 'present', 'the', 'discovery', 'of', 'kelt22ab', 'a', 'hot', 'jupiter', 'from', 'the', 'keltsouth', 'survey', 'kelt22ab', 'transits', 'the', 'moderately', 'bright', 'vsim', '111', 'sunlike', 'g2v', 'star', 'tyc', '75184681', 'the', 'planet', 'has', 'an', 'orbital', 'period', 'of', 'p', '13866529', 'pm', '00000027', 'days', 'a', 'radius', 'of', 'r_p', '1285_0071012r_j', 'and', 'a', 'relatively', 'large', 'mass', 'of', 'm_p', '347_014015', 'm_j', 'the', 'star', 'has', 'r_star', '1099_00460079', 'r_odot', 'm_star', '1092_00410045', 'm_odot', 't_rm', 'eff', '5767_4950', 'k', 'logg_star', '4393_00600039', 'cgs', 'and', 'mh', '0259_00830085', 'and', 'thus', 'other', 'than', 'its', 'slightly', 'supersolar', 'metallicity', 'appears', 'to', 'be', 'a', 'near', 'solar', 'twin', 'surprisingly', 'kelt22a', 'exhibits', 'kinematics', 'and', 'a', 'galactic', 'orbit', 'that', 'are', 'somewhat', 'atypical', 'for', 'thin', 'disk', 'stars', 'nevertheless', 'the', 'star', 'is', 'rotating', 'quite', 'rapidly', 'for', 'its', 'estimated', 'age', 'shows', 'evidence', 'of', 'chromospheric', 'activity', 'and', 'is', 'somewhat', 'metal', 'rich', 'imaging', 'reveals', 'a', 'slightly', 'fainter', 'companion', 'to', 'kelt22a', 'that', 'is', 'likely', 'bound', 'with', 'a', 'projected', 'separation', 'of', '6arcsec', 'sim1400', 'au', 'in', 'addition', 'to', 'the', 'orbital', 'motion', 'caused', 'by', 'the', 'transiting', 'planet', 'we', 'detect', 'a', 'possible', 'linear', 'trend', 'in', 'the', 'radial', 'velocity', 'of', 'kelt22a', 'suggesting', 'the', 'presence', 'of', 'another', 'relatively', 'nearby', 'body', 'that', 'is', 'perhaps', 'nonstellar', 'kelt22ab', 'is', 'highly', 'irradiated', 'as', 'a', 'consequence', 'of', 'the', 'small', 'semimajor', 'axis', 'of', 'ar_star', '497', 'and', 'is', 'mildly', 'inflated', 'at', 'such', 'small', 'separations', 'tidal', 'forces', 'become', 'significant', 'the', 'configuration', 'of', 'this', 'system', 'is', 'optimal', 'for', 'measuring', 'the', 'rate', 'of', 'tidal', 'dissipation', 'within', 'the', 'host', 'star', 'our', 'models', 'predict', 'that', 'due', 'to', 'tidal', 'forces', 'the', 'semimajor', 'axis', 'of', 'kelt22ab', 'is', 'decreasing', 'rapidly', 'and', 'is', 'thus', 'predicted', 'to', 'spiral', 'into', 'the', 'star', 'within', 'the', 'next', 'gyr']]
[-0.14637500704548717, 0.17573440140476732, -0.08310220779366095, 0.058404151770514265, -0.1086590981721507, -0.09963763770705313, 0.05318730897695228, 0.3663594901012991, -0.15869090732581204, -0.3480718083200489, 0.05623805649188266, -0.2869738387562242, -0.03757042558554606, 0.20708472994291435, -0.09657735400543359, -0.052740301947008926, 0.10479562492515598, -0.014763314876883172, -0.07120236083966607, -0.21086073283026868, 0.22961104937145077, 0.06017060542316852, 0.03183142751014764, -0.009267775820089016, 0.020514527572699556, -0.09303286198735963, 0.019301590197540904, -0.03967523866978424, -0.1676722757951347, 0.01720596201277311, 0.18850228283622245, 0.0885782072637462, 0.24058505059587015, -0.28960215423982666, -0.14876560089265334, 0.026782692527916298, 0.19580687046885736, 0.027133314078094058, -0.0703921639138284, -0.24950583066348822, 0.11218004872048123, -0.21868957190328042, -0.21396970911882818, 0.0722896040339845, 0.1620694389557118, -0.028050759856500258, -0.26426427283819914, 0.18253129507710625, 0.08876076568289046, 0.14141186970166275, -0.11750942130169263, -0.14205218672064515, -0.11535800029948756, 0.020953442889779683, 0.08043016817302856, 0.1405186599190057, 0.1897462386796367, -0.07911090492522073, 0.04282080805309781, 0.424812599270763, -0.08504891744869156, 0.02128386724724809, 0.24779073220843845, -0.22457397601101547, -0.11128584602635153, 0.1553902134721465, 0.14998997042836676, 0.16086464079823423, -0.1478214239261086, -0.017526416103906265, -0.008259368250320406, 0.23587053145486783, 0.07008872883436869, 0.025129562649582184, 0.4091610093374014, 0.1514580129902748, 0.08080416207619134, 0.04854366895153392, -0.2595805215699544, -0.05613551265680854, -0.1418757923005373, -0.0850010137095433, -0.1363387349507524, 0.06283909589133353, -0.14176032344354905, -0.127791896750822, 0.3132965161901787, 0.10053784816228317, 0.21920628782025542, 0.04675967243782156, 0.28358651176906535, 0.0824915733955476, 0.13829100607679162, 0.1387824541067944, 0.32972323934304143, 0.2031595992163274, 0.06553233381370671, -0.26669856915211776, 0.10240474440199922, -0.030301435391662093]
1,803.0756
Modelling turbulence via numerical functional integration using Burgers' equation
We investigate the feasibility of modelling turbulence via numeric functional integration. By transforming the Burgers' equation into a functional integral we are able to calculate equal-time spatial correlation of system variables using standard methods of multidimensional integration. In contrast to direct numerical simulation, our method allows for simple parallelization of the problem as the value of the integral within any region can be calculated separately from others. Thus the calculations required for obtaining one correlation data set can be distributed to several supercomputers and/or the cloud simultaneously. We present the mathematical background of our method and its numerical implementation. We are interested in a steady state system with isotropic and homogeneous turbulence, for which we use a lattice version of the functional integral used in the perturbative analysis of stochastic transport equations. The numeric implementation is composed of a fast serial program for evaluating the integral over a given volume and a parallel Python wrapper that divides the problem into subvolumes and distributes the work among available processes. The code is available at https://github.com/iljah/hdintegrator for anyone to download, use, study, modify and redistribute. We present velocity cross correlation for a 10x2 lattice in space and time respectively, and analyse the computational resources required for the integration. We also discuss potential improvements to the presented method.
physics.comp-ph
we investigate the feasibility of modelling turbulence via numeric functional integration by transforming the burgers equation into a functional integral we are able to calculate equaltime spatial correlation of system variables using standard methods of multidimensional integration in contrast to direct numerical simulation our method allows for simple parallelization of the problem as the value of the integral within any region can be calculated separately from others thus the calculations required for obtaining one correlation data set can be distributed to several supercomputers andor the cloud simultaneously we present the mathematical background of our method and its numerical implementation we are interested in a steady state system with isotropic and homogeneous turbulence for which we use a lattice version of the functional integral used in the perturbative analysis of stochastic transport equations the numeric implementation is composed of a fast serial program for evaluating the integral over a given volume and a parallel python wrapper that divides the problem into subvolumes and distributes the work among available processes the code is available at httpsgithubcomiljahhdintegrator for anyone to download use study modify and redistribute we present velocity cross correlation for a 10x2 lattice in space and time respectively and analyse the computational resources required for the integration we also discuss potential improvements to the presented method
[['we', 'investigate', 'the', 'feasibility', 'of', 'modelling', 'turbulence', 'via', 'numeric', 'functional', 'integration', 'by', 'transforming', 'the', 'burgers', 'equation', 'into', 'a', 'functional', 'integral', 'we', 'are', 'able', 'to', 'calculate', 'equaltime', 'spatial', 'correlation', 'of', 'system', 'variables', 'using', 'standard', 'methods', 'of', 'multidimensional', 'integration', 'in', 'contrast', 'to', 'direct', 'numerical', 'simulation', 'our', 'method', 'allows', 'for', 'simple', 'parallelization', 'of', 'the', 'problem', 'as', 'the', 'value', 'of', 'the', 'integral', 'within', 'any', 'region', 'can', 'be', 'calculated', 'separately', 'from', 'others', 'thus', 'the', 'calculations', 'required', 'for', 'obtaining', 'one', 'correlation', 'data', 'set', 'can', 'be', 'distributed', 'to', 'several', 'supercomputers', 'andor', 'the', 'cloud', 'simultaneously', 'we', 'present', 'the', 'mathematical', 'background', 'of', 'our', 'method', 'and', 'its', 'numerical', 'implementation', 'we', 'are', 'interested', 'in', 'a', 'steady', 'state', 'system', 'with', 'isotropic', 'and', 'homogeneous', 'turbulence', 'for', 'which', 'we', 'use', 'a', 'lattice', 'version', 'of', 'the', 'functional', 'integral', 'used', 'in', 'the', 'perturbative', 'analysis', 'of', 'stochastic', 'transport', 'equations', 'the', 'numeric', 'implementation', 'is', 'composed', 'of', 'a', 'fast', 'serial', 'program', 'for', 'evaluating', 'the', 'integral', 'over', 'a', 'given', 'volume', 'and', 'a', 'parallel', 'python', 'wrapper', 'that', 'divides', 'the', 'problem', 'into', 'subvolumes', 'and', 'distributes', 'the', 'work', 'among', 'available', 'processes', 'the', 'code', 'is', 'available', 'at', 'httpsgithubcomiljahhdintegrator', 'for', 'anyone', 'to', 'download', 'use', 'study', 'modify', 'and', 'redistribute', 'we', 'present', 'velocity', 'cross', 'correlation', 'for', 'a', '10x2', 'lattice', 'in', 'space', 'and', 'time', 'respectively', 'and', 'analyse', 'the', 'computational', 'resources', 'required', 'for', 'the', 'integration', 'we', 'also', 'discuss', 'potential', 'improvements', 'to', 'the', 'presented', 'method']]
[-0.1127793588970696, 0.022953240144035904, -0.09483416452391746, 0.07024217586190452, -0.06795160642698267, -0.09335741819157986, 0.04266840516821319, 0.3815608399268677, -0.29490257520884483, -0.2949216524270219, 0.10594242338217935, -0.25156793533393973, -0.09611319393977663, 0.22659578179927464, 0.029077096658451658, 0.07657209776250094, 0.0875787228808253, -0.013746331229438665, -0.0735133609749779, -0.24274775013655528, 0.3044055540594513, 0.05432122017086392, 0.24694483058785083, 0.021644208232649197, 0.11335289711733851, 0.02549951633836357, -0.08375471441661109, 0.040159271314970824, -0.12910900427758318, 0.15720499466182095, 0.2376996956780955, 0.1336734154116266, 0.27742970859885496, -0.4554887064973093, -0.20070713710372157, 0.056849895835473715, 0.1608511656084144, 0.10992356015974875, -0.03506238482665148, -0.2447046142841029, 0.07644994263460711, -0.17642155074090327, -0.11580698173099631, -0.13286885808816642, -0.012064507023426988, 0.039163975817907794, -0.2845825791695623, 0.08068963128539401, -0.03644560359991177, 0.03646265720030235, -0.0710092863314479, -0.10149305158933108, 0.012343082486262693, 0.13571720176590651, -0.004660673765793548, 0.01695135239175053, 0.1036895369944718, -0.09608219972343791, -0.09393962317156199, 0.3895525102647887, -0.06550224216112718, -0.243612561087417, 0.16655915430222284, -0.09605458085621957, -0.1287034663837403, 0.12653921429229628, 0.1938457878835569, 0.10590820760190697, -0.1688961031663061, 0.07963789933489006, 0.0005641268662443743, 0.16813364374110293, 0.010702784036552893, -0.013360482859048126, 0.15530175278444244, 0.17671463170259352, 0.031198391350895655, 0.16405314303679883, -0.0919711759626568, -0.12978101441168835, -0.3301946728166735, -0.20895761404702431, -0.18189724857324271, -0.010981998287749088, -0.07948037012836277, -0.15582485757046707, 0.3799143080149248, 0.19204667929402539, 0.12858672433821353, 0.08300925178279524, 0.3289146166941929, 0.12955912744781897, 0.07168953583090448, 0.11719662165094359, 0.15974986192468607, 0.10479092893864032, 0.1268830731781112, -0.22919004927651668, 0.029135803962038926, 0.06445922871544398]
1,803.07561
Neutrino masses and beyond-$\Lambda$CDM cosmology with LSST and future CMB experiments
Cosmological measurements over the next decade will enable us to shed light on the content and evolution of the Universe. Complementary measurements of the Cosmic Microwave Background (CMB) and Baryon Acoustic Oscillations are expected to allow an indirect determination of the sum of neutrino masses, within the framework of the flat $\Lambda$CDM model. However, possible deviations from $\Lambda$CDM such as a non-zero cosmological curvature or a dark energy equation of state with $w\neq -1$ would leave similar imprints on the expansion rate of the Universe and clustering of matter. We show how future CMB measurements can be combined with late-time measurements of galaxy clustering and cosmic shear from the Large Synoptic Survey Telescope to alleviate this degeneracy. Together, they are projected to reduce the uncertainty on the neutrino mass sum to 30 meV within this more general cosmological model. Achieving a 3$\sigma$ measurement of the minimal 60 meV mass (or 4$\sigma$ assuming $w=-1$) will require a five-fold improved measurement of the optical depth to reionization, obtainable through a large-scale CMB polarization measurement.
astro-ph.CO hep-ph
cosmological measurements over the next decade will enable us to shed light on the content and evolution of the universe complementary measurements of the cosmic microwave background cmb and baryon acoustic oscillations are expected to allow an indirect determination of the sum of neutrino masses within the framework of the flat lambdacdm model however possible deviations from lambdacdm such as a nonzero cosmological curvature or a dark energy equation of state with wneq 1 would leave similar imprints on the expansion rate of the universe and clustering of matter we show how future cmb measurements can be combined with latetime measurements of galaxy clustering and cosmic shear from the large synoptic survey telescope to alleviate this degeneracy together they are projected to reduce the uncertainty on the neutrino mass sum to 30 mev within this more general cosmological model achieving a 3sigma measurement of the minimal 60 mev mass or 4sigma assuming w1 will require a fivefold improved measurement of the optical depth to reionization obtainable through a largescale cmb polarization measurement
[['cosmological', 'measurements', 'over', 'the', 'next', 'decade', 'will', 'enable', 'us', 'to', 'shed', 'light', 'on', 'the', 'content', 'and', 'evolution', 'of', 'the', 'universe', 'complementary', 'measurements', 'of', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'and', 'baryon', 'acoustic', 'oscillations', 'are', 'expected', 'to', 'allow', 'an', 'indirect', 'determination', 'of', 'the', 'sum', 'of', 'neutrino', 'masses', 'within', 'the', 'framework', 'of', 'the', 'flat', 'lambdacdm', 'model', 'however', 'possible', 'deviations', 'from', 'lambdacdm', 'such', 'as', 'a', 'nonzero', 'cosmological', 'curvature', 'or', 'a', 'dark', 'energy', 'equation', 'of', 'state', 'with', 'wneq', '1', 'would', 'leave', 'similar', 'imprints', 'on', 'the', 'expansion', 'rate', 'of', 'the', 'universe', 'and', 'clustering', 'of', 'matter', 'we', 'show', 'how', 'future', 'cmb', 'measurements', 'can', 'be', 'combined', 'with', 'latetime', 'measurements', 'of', 'galaxy', 'clustering', 'and', 'cosmic', 'shear', 'from', 'the', 'large', 'synoptic', 'survey', 'telescope', 'to', 'alleviate', 'this', 'degeneracy', 'together', 'they', 'are', 'projected', 'to', 'reduce', 'the', 'uncertainty', 'on', 'the', 'neutrino', 'mass', 'sum', 'to', '30', 'mev', 'within', 'this', 'more', 'general', 'cosmological', 'model', 'achieving', 'a', '3sigma', 'measurement', 'of', 'the', 'minimal', '60', 'mev', 'mass', 'or', '4sigma', 'assuming', 'w1', 'will', 'require', 'a', 'fivefold', 'improved', 'measurement', 'of', 'the', 'optical', 'depth', 'to', 'reionization', 'obtainable', 'through', 'a', 'largescale', 'cmb', 'polarization', 'measurement']]
[-0.10139596334937419, 0.15294323399533358, -0.07476220751820176, 0.10270592988723196, -0.1280295252722152, -0.07987442210067583, 0.030089134967690983, 0.32846272790122255, -0.24338857172230302, -0.3484229209208807, 0.06453760136947642, -0.32371983502356627, 0.01534456795021935, 0.20407315758923286, 0.03677283167340901, 0.01900520452109895, 0.06794826738972239, -0.023225044556839262, -0.08247181227759642, -0.27611979201495607, 0.29063889889458067, 0.17823695243054696, 0.24679633834247672, 0.026303932720492054, 0.10370835265263828, -0.06478116264821268, -0.12346211932924424, 0.003948416908103756, -0.17869985816270306, 0.06415051455490378, 0.2026129406227102, 0.16620431310865422, 0.1653155496162579, -0.3960660240280599, -0.22552846254358544, 0.1953664177373528, 0.1587945325841564, 0.15157989497014948, -0.03692105415706634, -0.29150824801898884, 0.02965202890059012, -0.1589916794490459, -0.11888303792613103, -0.030555614480088183, -0.07502061962474917, -0.025100854664721506, -0.2411653124835602, 0.1713964597154192, -0.06364472026850075, -0.019703715178725677, -0.08163462924976768, -0.11058764755631104, -0.015343231271524631, 0.046657180611239094, 0.05086936994840196, 0.05533150349862787, 0.15437356240778002, -0.142719603981552, -0.06666796989630648, 0.4301475487909345, -0.14950681219370168, -0.07851862928256133, 0.09533751933283151, -0.2136558592813577, -0.1396889181179536, 0.09656646113699237, 0.1865817243659728, 0.0239105093032988, -0.13733097181068651, 0.07075349760355515, 0.014919104536475485, 0.21376192024069687, 0.07593858817072455, 0.05225037965088674, 0.3578758924268186, 0.1614821807719594, 0.11112499102776827, -0.007614246051796431, -0.1657748101715697, 0.013305139064255473, -0.3162802768239026, -0.08753961170915255, -0.1422847048460701, 0.13564063424006279, -0.15657440735924674, -0.1331636338835842, 0.38307810975726003, 0.16037113804283532, 0.21855133979481126, 0.06465710444527484, 0.33853890225399547, 0.01951248825969023, 0.07262662174126003, 0.011709112089213937, 0.35210784652465305, 0.14586196729891696, 0.10478747048622354, -0.22618568278402415, 0.0010986609660565507, -0.046799998373053105]
1,803.07562
Tycho-B: an unlikely companion for SN 1572
If some or all Type Ia SNe arise from accretion onto a massive WD from a companion, then the companion will remain in some form after the SN explosion. Tycho-B is an unusual, relatively hot star along the line of sight to Tycho's SNR -- conclusively shown to be a Type Ia -- and has been suggested as such a companion. If the interior of Tycho's SNR contains unshocked Fe, and if Tycho-B is either within the SNR shell or in the background, then one might hope to see evidence of this in the UV spectrum. Such is the case for SN\,1006, where spectra of the background Schweizer-Middleditch star, as well as two AGNs, show broad absorption lines of Fe II. To test this idea, we have used STIS on HST to obtain a UV spectrum of Tycho-B. The observed spectrum, however, shows no evidence of Fe II absorption. Furthermore, a luminosity distance estimate using UV and optical spectra of Tycho-B suggests that the star is consistent with a foreground interloper. We conclude either that Tycho B is nearer than Tycho's SNR, or that all of the Fe in the interior of Tycho's SNR is more highly ionized.
astro-ph.SR astro-ph.HE
if some or all type ia sne arise from accretion onto a massive wd from a companion then the companion will remain in some form after the sn explosion tychob is an unusual relatively hot star along the line of sight to tychos snr conclusively shown to be a type ia and has been suggested as such a companion if the interior of tychos snr contains unshocked fe and if tychob is either within the snr shell or in the background then one might hope to see evidence of this in the uv spectrum such is the case for sn1006 where spectra of the background schweizermiddleditch star as well as two agns show broad absorption lines of fe ii to test this idea we have used stis on hst to obtain a uv spectrum of tychob the observed spectrum however shows no evidence of fe ii absorption furthermore a luminosity distance estimate using uv and optical spectra of tychob suggests that the star is consistent with a foreground interloper we conclude either that tycho b is nearer than tychos snr or that all of the fe in the interior of tychos snr is more highly ionized
[['if', 'some', 'or', 'all', 'type', 'ia', 'sne', 'arise', 'from', 'accretion', 'onto', 'a', 'massive', 'wd', 'from', 'a', 'companion', 'then', 'the', 'companion', 'will', 'remain', 'in', 'some', 'form', 'after', 'the', 'sn', 'explosion', 'tychob', 'is', 'an', 'unusual', 'relatively', 'hot', 'star', 'along', 'the', 'line', 'of', 'sight', 'to', 'tychos', 'snr', 'conclusively', 'shown', 'to', 'be', 'a', 'type', 'ia', 'and', 'has', 'been', 'suggested', 'as', 'such', 'a', 'companion', 'if', 'the', 'interior', 'of', 'tychos', 'snr', 'contains', 'unshocked', 'fe', 'and', 'if', 'tychob', 'is', 'either', 'within', 'the', 'snr', 'shell', 'or', 'in', 'the', 'background', 'then', 'one', 'might', 'hope', 'to', 'see', 'evidence', 'of', 'this', 'in', 'the', 'uv', 'spectrum', 'such', 'is', 'the', 'case', 'for', 'sn1006', 'where', 'spectra', 'of', 'the', 'background', 'schweizermiddleditch', 'star', 'as', 'well', 'as', 'two', 'agns', 'show', 'broad', 'absorption', 'lines', 'of', 'fe', 'ii', 'to', 'test', 'this', 'idea', 'we', 'have', 'used', 'stis', 'on', 'hst', 'to', 'obtain', 'a', 'uv', 'spectrum', 'of', 'tychob', 'the', 'observed', 'spectrum', 'however', 'shows', 'no', 'evidence', 'of', 'fe', 'ii', 'absorption', 'furthermore', 'a', 'luminosity', 'distance', 'estimate', 'using', 'uv', 'and', 'optical', 'spectra', 'of', 'tychob', 'suggests', 'that', 'the', 'star', 'is', 'consistent', 'with', 'a', 'foreground', 'interloper', 'we', 'conclude', 'either', 'that', 'tycho', 'b', 'is', 'nearer', 'than', 'tychos', 'snr', 'or', 'that', 'all', 'of', 'the', 'fe', 'in', 'the', 'interior', 'of', 'tychos', 'snr', 'is', 'more', 'highly', 'ionized']]
[-0.03652213349198111, 0.029835350611262048, -0.05084881844142308, 0.08828884934146818, -0.12752088561701852, -0.13524458217553986, 0.05500258243618868, 0.46517446956191305, -0.19120372576304737, -0.2482638305769517, 0.0811148128257348, -0.3089682029034847, -0.04399486066898904, 0.17153534736269369, -0.04661284636061352, -0.11190441791684581, 0.09055486502997481, -0.002149657423918446, -0.0682844264826809, -0.23167656182478635, 0.31431721542508173, 0.0825382074353118, 0.14300896330521656, 0.00880577927097105, 0.01985564287005661, -0.10963549717830924, -0.03739111615726963, 0.026106171028163188, -0.09445462822850692, 0.028686256241053344, 0.20479735244328204, 0.19919933163417647, 0.19174950852966272, -0.34232614813133694, -0.2777431793785535, 0.09614856127554025, 0.2391782145994978, 0.06271855884637588, -0.05372918080277323, -0.2419048572341219, 0.09962223747936197, -0.20674074753545799, -0.17294550635016118, 0.10691146573935373, 0.02694773069367959, 0.028900506611889563, -0.24845048680794068, 0.08169296367499881, 0.04478007467427792, 0.06306939999787853, -0.09893750624659543, -0.09850888113455417, -0.06484844949550163, 0.015390343019643274, 0.06670263895096305, 0.0488947043607298, 0.07037477216516168, -0.12843902227692663, 0.0035547896765936644, 0.4252797536886273, -0.0671559871440807, 0.0001566543649786558, 0.24332666403064743, -0.1999345717080033, -0.14267458859592294, 0.21322480355604337, 0.08302156598044512, 0.08883372896876282, -0.1461679789524239, 0.030414683391184857, -0.04858628082781648, 0.19630537239166024, 0.04311087517282711, 0.0835962366223192, 0.30161382356324257, 0.0855509357025417, 0.03540678823916003, 0.103402879252397, -0.25351425916171416, 0.051127418842262184, -0.2700976889755111, -0.14200269365444398, -0.16632915850167568, 0.14671961784912035, -0.11657210204918952, -0.16426600210699968, 0.30507252043686234, 0.08468750344159512, 0.23659974886820867, -0.04453702193732636, 0.29456459756892844, 0.08506954890043021, 0.0439595670096027, 0.1441872707556169, 0.33900628281094564, 0.17288210359043799, 0.09003088185563683, -0.21830751463675346, 0.07902977302288398, 0.039079779687409215]
1,803.07563
Massive, Absorption-selected Galaxies at Intermediate Redshifts
The nature of absorption-selected galaxies and their connection to the general galaxy population have been open issues for more than three decades, with little information available on their gas properties. Here we show, using detections of carbon monoxide (CO) emission with the Atacama Large Millimeter/submillimeter Array (ALMA), that five of seven high-metallicity, absorption-selected galaxies at intermediate redshifts, $z \approx 0.5-0.8$, have large molecular gas masses, $M_{\rm Mol} \approx (0.6 - 8.2) \times 10^{10} \: {\rm M}_\odot$ and high molecular gas fractions ($f_{\rm Mol} \equiv \: M_{\rm Mol}/(M_\ast + M_{\rm Mol}) \approx 0.29-0.87)$. Their modest star formation rates (SFRs), $\approx (0.3-9.5) \: {\rm M}_\odot$ yr$^{-1}$, then imply long gas depletion timescales, $\approx (3 - 120)$ Gyr. The high-metallicity absorption-selected galaxies at $z \approx 0.5-0.8$ appear distinct from populations of star-forming galaxies at both $z \approx 1.3-2.5$, during the peak of star formation activity in the Universe, and lower redshifts, $z \lesssim 0.05$. Their relatively low SFRs, despite the large molecular gas reservoirs, may indicate a transition in the nature of star formation at intermediate redshifts, $z \approx 0.7$.
astro-ph.GA
the nature of absorptionselected galaxies and their connection to the general galaxy population have been open issues for more than three decades with little information available on their gas properties here we show using detections of carbon monoxide co emission with the atacama large millimetersubmillimeter array alma that five of seven highmetallicity absorptionselected galaxies at intermediate redshifts z approx 0508 have large molecular gas masses m_rm mol approx 06 82 times 1010 rm m_odot and high molecular gas fractions f_rm mol equiv m_rm molm_ast m_rm mol approx 029087 their modest star formation rates sfrs approx 0395 rm m_odot yr1 then imply long gas depletion timescales approx 3 120 gyr the highmetallicity absorptionselected galaxies at z approx 0508 appear distinct from populations of starforming galaxies at both z approx 1325 during the peak of star formation activity in the universe and lower redshifts z lesssim 005 their relatively low sfrs despite the large molecular gas reservoirs may indicate a transition in the nature of star formation at intermediate redshifts z approx 07
[['the', 'nature', 'of', 'absorptionselected', 'galaxies', 'and', 'their', 'connection', 'to', 'the', 'general', 'galaxy', 'population', 'have', 'been', 'open', 'issues', 'for', 'more', 'than', 'three', 'decades', 'with', 'little', 'information', 'available', 'on', 'their', 'gas', 'properties', 'here', 'we', 'show', 'using', 'detections', 'of', 'carbon', 'monoxide', 'co', 'emission', 'with', 'the', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'alma', 'that', 'five', 'of', 'seven', 'highmetallicity', 'absorptionselected', 'galaxies', 'at', 'intermediate', 'redshifts', 'z', 'approx', '0508', 'have', 'large', 'molecular', 'gas', 'masses', 'm_rm', 'mol', 'approx', '06', '82', 'times', '1010', 'rm', 'm_odot', 'and', 'high', 'molecular', 'gas', 'fractions', 'f_rm', 'mol', 'equiv', 'm_rm', 'molm_ast', 'm_rm', 'mol', 'approx', '029087', 'their', 'modest', 'star', 'formation', 'rates', 'sfrs', 'approx', '0395', 'rm', 'm_odot', 'yr1', 'then', 'imply', 'long', 'gas', 'depletion', 'timescales', 'approx', '3', '120', 'gyr', 'the', 'highmetallicity', 'absorptionselected', 'galaxies', 'at', 'z', 'approx', '0508', 'appear', 'distinct', 'from', 'populations', 'of', 'starforming', 'galaxies', 'at', 'both', 'z', 'approx', '1325', 'during', 'the', 'peak', 'of', 'star', 'formation', 'activity', 'in', 'the', 'universe', 'and', 'lower', 'redshifts', 'z', 'lesssim', '005', 'their', 'relatively', 'low', 'sfrs', 'despite', 'the', 'large', 'molecular', 'gas', 'reservoirs', 'may', 'indicate', 'a', 'transition', 'in', 'the', 'nature', 'of', 'star', 'formation', 'at', 'intermediate', 'redshifts', 'z', 'approx', '07']]
[-0.07474806468579753, 0.19373082658021087, 0.06134442101679081, 0.0963189638372698, 0.016384991887438843, -0.07587505811715178, 0.08925044969738236, 0.45758247181508666, -0.06993849417084508, -0.3885321156810638, 0.053101805970072746, -0.32111684996193857, 0.10050117041221296, 0.16046137759219525, 0.05354939498966174, -0.09492802918205291, 0.011225410383029362, -0.20992743074425535, -0.08573069831648478, -0.30832518757384314, 0.19420326873660088, 0.05324265447764839, 0.14768202137202024, 0.014079144196970575, 0.07468284493017413, -0.22291103721260142, -0.023259182798141646, -0.14493063086445426, -0.28370141879864313, -0.055300540415454416, 0.26081430399928174, 0.07988825215980103, 0.26090536311753754, -0.30465344698361213, -0.1277200589183795, 0.07781144428155082, 0.2471968933083007, 0.0060105014664049335, -0.07450813378771208, -0.24392438351628565, 0.08089196718898574, -0.22241445012478786, -0.14026335285585265, 0.14235571217888515, 0.10206035653283523, 0.0027091058147464984, -0.20570304839370343, 0.29451514916844423, -0.060112391786578186, 0.14279042587191218, -0.07580623866855195, -0.16907620563009235, -0.12647423555402185, -0.013112621574067462, -0.030024483806822867, 0.169295508160322, 0.24964723534077493, -0.15484368080306335, 0.06942452210657431, 0.41379962258244807, -0.08250108844996361, 0.12806064540869644, 0.29323446049669083, -0.29549595130023343, -0.27196825799096885, 0.20407516861846947, 0.14470687152586392, 0.10299462461348116, -0.13561456047615708, 0.004956859715535036, 0.022472703562134645, 0.2986608914357263, 0.06511749919041021, 0.09031907370158666, 0.3908483490248668, 0.10047043456018147, -0.024551720702855367, -0.03767239876620516, -0.25173394390954995, 0.012528738498786938, -0.11584685215541883, -0.08717603508635154, -0.09184323128356912, 0.21213678585588602, -0.22464554576563064, 0.021372429795078272, 0.22367967903261354, 0.08050820838795016, 0.30483454134943483, 0.14613385546191998, 0.24725628966057794, 0.04107540268754069, 0.13145929074862742, 0.12107119637888653, 0.2736408083104479, 0.2204603305714723, 0.061260983631698164, -0.2215415798137984, 0.02656523468070691, -0.039672049254450406]
1,803.07564
Further insight on the hypervelocity white dwarf, LP 40-365 (GD 492): a nearby emissary from a single-degenerate Type Ia supernova
The recently discovered hypervelocity white dwarf LP 40-65 (aka GD 492) has been suggested as the outcome of the failed disruption of a white dwarf in a sub-luminous Type Ia supernova (SN Ia). We present new observations confirming GD 492 as a single star with unique spectral features. Our spectroscopic analysis suggests that a helium-dominated atmosphere, with ~ 33 percent neon and 2 percent oxygen by mass, can reproduce most of the observed properties of this highly unusual star. Although our atmospheric model contrasts with the previous analysis in terms of dominant atmospheric species, we confirm that the atmosphere of GD 492 is strongly hydrogen deficient, log(H/He) < -5, and displays traces of eleven other alpha- and iron-group elements (with sulfur, chromium, manganese, and titanium as new detections), indicating nuclear processing of carbon and silicon. We measure a manganese-to-iron ratio seven times larger than Solar. While the observed abundances of GD 492 do not fully match any predicted nuclear yields of a partially-burned supernova remnant, the manganese excess strongly favors a link with a single-degenerate SN Ia event over alternative scenarios.
astro-ph.SR
the recently discovered hypervelocity white dwarf lp 4065 aka gd 492 has been suggested as the outcome of the failed disruption of a white dwarf in a subluminous type ia supernova sn ia we present new observations confirming gd 492 as a single star with unique spectral features our spectroscopic analysis suggests that a heliumdominated atmosphere with 33 percent neon and 2 percent oxygen by mass can reproduce most of the observed properties of this highly unusual star although our atmospheric model contrasts with the previous analysis in terms of dominant atmospheric species we confirm that the atmosphere of gd 492 is strongly hydrogen deficient loghhe 5 and displays traces of eleven other alpha and irongroup elements with sulfur chromium manganese and titanium as new detections indicating nuclear processing of carbon and silicon we measure a manganesetoiron ratio seven times larger than solar while the observed abundances of gd 492 do not fully match any predicted nuclear yields of a partiallyburned supernova remnant the manganese excess strongly favors a link with a singledegenerate sn ia event over alternative scenarios
[['the', 'recently', 'discovered', 'hypervelocity', 'white', 'dwarf', 'lp', '4065', 'aka', 'gd', '492', 'has', 'been', 'suggested', 'as', 'the', 'outcome', 'of', 'the', 'failed', 'disruption', 'of', 'a', 'white', 'dwarf', 'in', 'a', 'subluminous', 'type', 'ia', 'supernova', 'sn', 'ia', 'we', 'present', 'new', 'observations', 'confirming', 'gd', '492', 'as', 'a', 'single', 'star', 'with', 'unique', 'spectral', 'features', 'our', 'spectroscopic', 'analysis', 'suggests', 'that', 'a', 'heliumdominated', 'atmosphere', 'with', '33', 'percent', 'neon', 'and', '2', 'percent', 'oxygen', 'by', 'mass', 'can', 'reproduce', 'most', 'of', 'the', 'observed', 'properties', 'of', 'this', 'highly', 'unusual', 'star', 'although', 'our', 'atmospheric', 'model', 'contrasts', 'with', 'the', 'previous', 'analysis', 'in', 'terms', 'of', 'dominant', 'atmospheric', 'species', 'we', 'confirm', 'that', 'the', 'atmosphere', 'of', 'gd', '492', 'is', 'strongly', 'hydrogen', 'deficient', 'loghhe', '5', 'and', 'displays', 'traces', 'of', 'eleven', 'other', 'alpha', 'and', 'irongroup', 'elements', 'with', 'sulfur', 'chromium', 'manganese', 'and', 'titanium', 'as', 'new', 'detections', 'indicating', 'nuclear', 'processing', 'of', 'carbon', 'and', 'silicon', 'we', 'measure', 'a', 'manganesetoiron', 'ratio', 'seven', 'times', 'larger', 'than', 'solar', 'while', 'the', 'observed', 'abundances', 'of', 'gd', '492', 'do', 'not', 'fully', 'match', 'any', 'predicted', 'nuclear', 'yields', 'of', 'a', 'partiallyburned', 'supernova', 'remnant', 'the', 'manganese', 'excess', 'strongly', 'favors', 'a', 'link', 'with', 'a', 'singledegenerate', 'sn', 'ia', 'event', 'over', 'alternative', 'scenarios']]
[-0.026635812164220788, 0.1029396872049388, 0.006872892281866039, 0.06770672998787962, -0.05234018686248667, -0.12934097921772097, 0.1030210095063508, 0.38250587846745143, -0.12881772275498157, -0.3492214426832189, 0.03415801579930386, -0.36651952836704865, -0.05917901530404957, 0.1713329343705978, -0.04519274622328918, -0.06101577753923431, 0.1221014086728577, -0.03319679297419498, -0.11239546237365258, -0.2857115209441293, 0.23014342230453622, 0.09436024065309373, 0.17775703318495123, -0.05087428152910434, 0.028110912494329652, -0.11666684077301231, -0.054437435091875326, -0.04142796979497441, -0.12381406865568517, 0.040920650365561334, 0.21111601023006765, 0.13749001365530686, 0.15549909624017097, -0.36561565453038464, -0.2894451381077736, 0.08870137315402231, 0.17531845944838345, 0.04562648246114391, -0.12377969450740652, -0.22233411695395427, 0.07897783194229388, -0.22137122321344743, -0.14849958740524016, 0.060660613868425244, 0.018756649917287923, 0.05290658178835821, -0.2550598746536046, 0.11486547259714412, 0.07097465300202285, 0.10179617897797884, -0.1170261644424913, -0.20652527094766396, -0.1006267780242276, -0.008621053569103506, 0.010757536908468783, 0.0206723642464071, 0.12935866250931707, -0.0594166599978714, -0.032427447268591175, 0.4333487480663197, -0.14598950076048245, 0.0739075094501128, 0.25641851158897305, -0.19175308548173317, -0.15885835617188027, 0.18690113246239806, 0.0763003873554143, 0.12500538953463547, -0.20802582128883593, -0.022371370063906812, -0.0486655125092842, 0.21379493388865906, 0.02632965774815106, 0.09289419901101197, 0.28109509526455606, 0.2012799300150205, 0.00897760060946563, 0.0367379669283268, -0.24468428113720042, 0.011318192235194147, -0.18909707833981057, -0.15656847607963506, -0.09451678784667324, 0.1138169418793702, -0.12071763764924981, -0.162367360032063, 0.33694878086151386, 0.05412723840808295, 0.21345927028662778, -0.0643017211749049, 0.2298194304616614, 0.03012558546073375, 0.10367658331431978, 0.08500994684238156, 0.3187651838048954, 0.21343435332263735, 0.10644782106034902, -0.25135333329539705, 0.16131560439349746, 0.00923835898505455]
1,803.07565
Simulating one-dimensional systems with stationary Rydberg dark polaritons
Electromagnetically-induced transparency (EIT) with Rydberg atoms enables strong interactions between atoms to be controlled and measured by pulses of light. Consequently, Rydberg dark polaritons are a promising platform for quantum simulations. Of particular interest are simulations of one-dimensional systems, known to exhibit unique properties compared to their higher-dimensional counterparts. One limitation of standard EIT is that reducing the polariton group velocity to bring the dark polaritons to rest also implies activating strong Rydberg interactions. To achieve independent control of polariton speed and interaction strength, we propose a stationary light-scheme to bring Rydberg polaritons to a stand-still. This allows them to remain primarily photonic and, therefore, non-interacting, before Rydberg interactions are turned on. Once activated, in the dilute regime and in the presence of strong transverse confinement, the strong polarizabilities of Rydberg atoms give rise to an effective contact interaction between polaritons. By tuning the various parameters of the stationary-light scheme, the effective one-dimensional scattering length may be adjusted to yield various kinds of physics, including the regime of a Tonks-Girardeau gas, when polaritons exhibit fermionic behavior. We outline a protocol to observe the resulting spatial correlations between neighboring polaritons.
quant-ph physics.atom-ph
electromagneticallyinduced transparency eit with rydberg atoms enables strong interactions between atoms to be controlled and measured by pulses of light consequently rydberg dark polaritons are a promising platform for quantum simulations of particular interest are simulations of onedimensional systems known to exhibit unique properties compared to their higherdimensional counterparts one limitation of standard eit is that reducing the polariton group velocity to bring the dark polaritons to rest also implies activating strong rydberg interactions to achieve independent control of polariton speed and interaction strength we propose a stationary lightscheme to bring rydberg polaritons to a standstill this allows them to remain primarily photonic and therefore noninteracting before rydberg interactions are turned on once activated in the dilute regime and in the presence of strong transverse confinement the strong polarizabilities of rydberg atoms give rise to an effective contact interaction between polaritons by tuning the various parameters of the stationarylight scheme the effective onedimensional scattering length may be adjusted to yield various kinds of physics including the regime of a tonksgirardeau gas when polaritons exhibit fermionic behavior we outline a protocol to observe the resulting spatial correlations between neighboring polaritons
[['electromagneticallyinduced', 'transparency', 'eit', 'with', 'rydberg', 'atoms', 'enables', 'strong', 'interactions', 'between', 'atoms', 'to', 'be', 'controlled', 'and', 'measured', 'by', 'pulses', 'of', 'light', 'consequently', 'rydberg', 'dark', 'polaritons', 'are', 'a', 'promising', 'platform', 'for', 'quantum', 'simulations', 'of', 'particular', 'interest', 'are', 'simulations', 'of', 'onedimensional', 'systems', 'known', 'to', 'exhibit', 'unique', 'properties', 'compared', 'to', 'their', 'higherdimensional', 'counterparts', 'one', 'limitation', 'of', 'standard', 'eit', 'is', 'that', 'reducing', 'the', 'polariton', 'group', 'velocity', 'to', 'bring', 'the', 'dark', 'polaritons', 'to', 'rest', 'also', 'implies', 'activating', 'strong', 'rydberg', 'interactions', 'to', 'achieve', 'independent', 'control', 'of', 'polariton', 'speed', 'and', 'interaction', 'strength', 'we', 'propose', 'a', 'stationary', 'lightscheme', 'to', 'bring', 'rydberg', 'polaritons', 'to', 'a', 'standstill', 'this', 'allows', 'them', 'to', 'remain', 'primarily', 'photonic', 'and', 'therefore', 'noninteracting', 'before', 'rydberg', 'interactions', 'are', 'turned', 'on', 'once', 'activated', 'in', 'the', 'dilute', 'regime', 'and', 'in', 'the', 'presence', 'of', 'strong', 'transverse', 'confinement', 'the', 'strong', 'polarizabilities', 'of', 'rydberg', 'atoms', 'give', 'rise', 'to', 'an', 'effective', 'contact', 'interaction', 'between', 'polaritons', 'by', 'tuning', 'the', 'various', 'parameters', 'of', 'the', 'stationarylight', 'scheme', 'the', 'effective', 'onedimensional', 'scattering', 'length', 'may', 'be', 'adjusted', 'to', 'yield', 'various', 'kinds', 'of', 'physics', 'including', 'the', 'regime', 'of', 'a', 'tonksgirardeau', 'gas', 'when', 'polaritons', 'exhibit', 'fermionic', 'behavior', 'we', 'outline', 'a', 'protocol', 'to', 'observe', 'the', 'resulting', 'spatial', 'correlations', 'between', 'neighboring', 'polaritons']]
[-0.15697512507687592, 0.25693479576217754, -0.06761759755349014, 0.05470316714521725, -0.028389241635561623, -0.20213490093196246, 0.05642057284855215, 0.4271002200015999, -0.2531587584241432, -0.29926094291620253, -0.06956003118768345, -0.272594997866226, -0.07624464931878004, 0.2016375849984507, 0.041910298344520654, 0.024556829253808556, 0.041231203088016706, -0.04585101163668677, -0.011050740401805478, -0.22551170481490268, 0.2608914807899558, 0.03014761159392173, 0.30418207875807135, 0.1307442840585049, 0.08838373884189307, -0.004629057153385688, 0.09835088623630656, -0.03857404913039918, -0.11629249165510354, 0.1265206498061703, 0.23801896793636532, -0.030038778151565373, 0.2554820231682165, -0.474327566865039, -0.20950928429622165, 0.08819218171683656, 0.20056693678835724, 0.19868285115808249, -0.06439044215144253, -0.36856123253187917, -0.03852818262802952, -0.13624670873445638, -0.1536717136202261, -0.11015879902790518, 0.012766430122242805, 0.05880058330280627, -0.23929195195198694, 0.04545872132098822, 0.040596688729141184, 0.03360381823137125, -0.022473059834892603, 0.0001380290499234453, 0.011436365337973025, 0.09532361659620754, 0.0015580373001284897, -0.025540339398232508, 0.1798113328900109, -0.14925474395537056, -0.08242600368325935, 0.4104426246869596, -0.12104793167375821, -0.1266670869217512, 0.26311469477096056, -0.11413670729281024, -0.006396659379924073, 0.1688207485291988, 0.18995450853439483, 0.039617710078055875, -0.12837406920996416, 0.04362689179214748, -0.026765090007176424, 0.18979909680901402, 0.09136553053456814, 0.18430637075575662, 0.25137602572547313, 0.14639817311817363, 0.045673160452118264, 0.158904794965836, -0.0607235115403455, -0.11356577382205015, -0.21781283053272266, -0.1337923077455266, -0.16102772423046383, 0.04397230065289013, -0.04628088789653935, -0.1573239546442563, 0.37410485005802135, 0.14244092072972017, 0.17915313900943766, -0.028295117297873613, 0.2828004774612751, 0.13184154625645184, 0.057741829782397426, 0.022568297225664904, 0.3190114288739464, 0.19400042209073287, 0.04233315879606922, -0.3041860447401438, 0.00709657021178963, 0.015852518719026543]
1,803.07566
The Picard-Fuchs equation in classical and quantum physics: Application to higher-order WKB method
The Picard-Fuchs equation is a powerful mathematical tool which has numerous applications in physics, for it allows to evaluate integrals without resorting to direct integration techniques. We use this equation to calculate both the classical action and the higher-order WKB corrections to it, for the sextic double-well potential and the Lam\'e potential. Our development rests on the fact that the Picard-Fuchs method links an integral to solutions of a differential equation with the energy as a parameter. Employing the same argument we show that each higher-order correction in the WKB series for the quantum action is a combination of the classical action and its derivatives. From this, we obtain a computationally simple method of calculating higher-order quantum-mechanical corrections to the classical action, and demonstrate this by calculating the second-order correction for the sextic and the Lam\'e potential. This paper also serves as a self-consistent guide to the use of the Picard-Fuchs equation.
hep-th math-ph math.MP quant-ph
the picardfuchs equation is a powerful mathematical tool which has numerous applications in physics for it allows to evaluate integrals without resorting to direct integration techniques we use this equation to calculate both the classical action and the higherorder wkb corrections to it for the sextic doublewell potential and the lame potential our development rests on the fact that the picardfuchs method links an integral to solutions of a differential equation with the energy as a parameter employing the same argument we show that each higherorder correction in the wkb series for the quantum action is a combination of the classical action and its derivatives from this we obtain a computationally simple method of calculating higherorder quantummechanical corrections to the classical action and demonstrate this by calculating the secondorder correction for the sextic and the lame potential this paper also serves as a selfconsistent guide to the use of the picardfuchs equation
[['the', 'picardfuchs', 'equation', 'is', 'a', 'powerful', 'mathematical', 'tool', 'which', 'has', 'numerous', 'applications', 'in', 'physics', 'for', 'it', 'allows', 'to', 'evaluate', 'integrals', 'without', 'resorting', 'to', 'direct', 'integration', 'techniques', 'we', 'use', 'this', 'equation', 'to', 'calculate', 'both', 'the', 'classical', 'action', 'and', 'the', 'higherorder', 'wkb', 'corrections', 'to', 'it', 'for', 'the', 'sextic', 'doublewell', 'potential', 'and', 'the', 'lame', 'potential', 'our', 'development', 'rests', 'on', 'the', 'fact', 'that', 'the', 'picardfuchs', 'method', 'links', 'an', 'integral', 'to', 'solutions', 'of', 'a', 'differential', 'equation', 'with', 'the', 'energy', 'as', 'a', 'parameter', 'employing', 'the', 'same', 'argument', 'we', 'show', 'that', 'each', 'higherorder', 'correction', 'in', 'the', 'wkb', 'series', 'for', 'the', 'quantum', 'action', 'is', 'a', 'combination', 'of', 'the', 'classical', 'action', 'and', 'its', 'derivatives', 'from', 'this', 'we', 'obtain', 'a', 'computationally', 'simple', 'method', 'of', 'calculating', 'higherorder', 'quantummechanical', 'corrections', 'to', 'the', 'classical', 'action', 'and', 'demonstrate', 'this', 'by', 'calculating', 'the', 'secondorder', 'correction', 'for', 'the', 'sextic', 'and', 'the', 'lame', 'potential', 'this', 'paper', 'also', 'serves', 'as', 'a', 'selfconsistent', 'guide', 'to', 'the', 'use', 'of', 'the', 'picardfuchs', 'equation']]
[-0.09592320074941534, -0.013260551424154025, -0.1444710999525054, 0.09289402540889569, -0.13911728344637117, -0.10824006067061993, 0.01756576058304697, 0.2814007882139106, -0.3014633040385027, -0.2718891573726739, 0.07172965833466917, -0.27207478331442153, -0.2076494898340714, 0.23541543015131824, -0.029278496772014096, 0.08609408964395315, 0.044166379782836884, 0.04546815188797681, -0.08932556849475459, -0.23429519619553743, 0.3252277500133986, 0.028055840831305096, 0.2177835038915203, 0.07200589586711048, 0.12654108118180088, 0.03787480577930661, -0.011298275325986507, -0.03040395453832676, -0.12991602577494632, 0.15105950018378758, 0.22112361720983723, 0.04694153648482537, 0.27078988355596695, -0.41458420048614864, -0.22114501746316245, 0.08389560489817277, 0.13472766121604332, 0.1938378568271506, -0.036598587608559205, -0.27462218113635717, 0.04198665738620452, -0.19447370416080384, -0.21423200172323145, -0.1672838932044167, 0.02078970868483578, 0.031119577629540703, -0.26542494083313567, 0.053156143300791305, 0.02170053234103283, 0.0010964797723940329, -0.06871584983807559, -0.058872388148876395, 0.021335044780770612, 0.09515081428138442, 0.031326442335021534, 0.023673131626932638, 0.05839022037597667, -0.15259404839923119, -0.10000655294003848, 0.41836412991152, -0.10268035538779498, -0.2607442745693812, 0.13081400819570072, -0.09585484489798546, -0.11590420594745267, 0.10665571096347105, 0.11302639915620123, 0.16666378210127158, -0.17590968664367929, 0.12960892429040732, 0.05301271630205998, 0.12875676370152322, 0.05238487337421822, -0.02500314801919127, 0.1375576527237794, 0.10247979750611673, 0.039950691298336574, 0.14410471630062124, -0.05882828263872254, -0.14574890176912672, -0.35721788773509233, -0.1990311654057893, -0.1655916837457641, 0.05189626130863632, -0.10287317502977537, -0.21382738696411252, 0.40464477003919647, 0.15724179138602554, 0.13383007953923784, 0.06983409660307716, 0.33151887384194295, 0.23105037697256958, 0.06938411439707699, 0.01132289796307879, 0.23740365979718167, 0.15455046774801112, 0.09094029989424407, -0.26018332343588363, -0.012762932005755016, 0.14372938970643045]