id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0836 | Discrete parabolic groups in ${\rm PSL}(3, \Bbb{C})$ | We study and classify the purely parabolic discrete subgroups of
$PSL(3,\Bbb{C})$. This includes all discrete subgroups of the Heisenberg group
${\rm Heis}(3,\Bbb{C})$. While for $PSL(2,\Bbb{C})$ every purely parabolic
subgroup is Abelian and acts on $\Bbb{P}^1_\Bbb{C}$ with limit set a single
point, the case of $PSL(3,\Bbb{C})$ is far more subtle and intriguing. We show
that there are five families of purely parabolic discrete groups in
$PSL(3,\Bbb{C})$, and some of these actually split into subfamilies. We
classify all these by means of their limit set and the control group. We use
first the Lie-Kolchin Theorem and Borel's fixed point theorem to show that all
purely parabolic discrete groups in $PSL(3,\Bbb{C})$ are virtually
triangularizable. Then we prove that purely parabolic groups in
$PSL(3,\Bbb{C})$ are virtually solvable and polycyclic, hence finitely
presented. We then prove a slight generalization of the Lie-Kolchin Theorem for
these groups: they are either virtually unipotent or else Abelian of rank 2 and
of a very special type. All the virtually unipotent ones turn out to be
conjugate to subgroups of the Heisenberg group ${\rm Heis}(3,\Bbb{C})$. We
classify these using the obstructor dimension introduced by Bestvina, Kapovich
and Kleiner. We find that their Kulkarni limit set is either a projective line,
a cone of lines with base a circle or else the whole $\Bbb{P}^2_\Bbb{C}$. We
determine the relation with the Conze-Guivarc'h limit set of the action on the
dual projective space $\check{\Bbb{P}}^2_\Bbb{C}$ and we show that in all cases
the Kulkarni region of discontinuity is the largest open set where the group
acts properly discontinuously.
| math.DS | we study and classify the purely parabolic discrete subgroups of psl3bbbc this includes all discrete subgroups of the heisenberg group rm heis3bbbc while for psl2bbbc every purely parabolic subgroup is abelian and acts on bbbp1_bbbc with limit set a single point the case of psl3bbbc is far more subtle and intriguing we show that there are five families of purely parabolic discrete groups in psl3bbbc and some of these actually split into subfamilies we classify all these by means of their limit set and the control group we use first the liekolchin theorem and borels fixed point theorem to show that all purely parabolic discrete groups in psl3bbbc are virtually triangularizable then we prove that purely parabolic groups in psl3bbbc are virtually solvable and polycyclic hence finitely presented we then prove a slight generalization of the liekolchin theorem for these groups they are either virtually unipotent or else abelian of rank 2 and of a very special type all the virtually unipotent ones turn out to be conjugate to subgroups of the heisenberg group rm heis3bbbc we classify these using the obstructor dimension introduced by bestvina kapovich and kleiner we find that their kulkarni limit set is either a projective line a cone of lines with base a circle or else the whole bbbp2_bbbc we determine the relation with the conzeguivarch limit set of the action on the dual projective space checkbbbp2_bbbc and we show that in all cases the kulkarni region of discontinuity is the largest open set where the group acts properly discontinuously | [['we', 'study', 'and', 'classify', 'the', 'purely', 'parabolic', 'discrete', 'subgroups', 'of', 'psl3bbbc', 'this', 'includes', 'all', 'discrete', 'subgroups', 'of', 'the', 'heisenberg', 'group', 'rm', 'heis3bbbc', 'while', 'for', 'psl2bbbc', 'every', 'purely', 'parabolic', 'subgroup', 'is', 'abelian', 'and', 'acts', 'on', 'bbbp1_bbbc', 'with', 'limit', 'set', 'a', 'single', 'point', 'the', 'case', 'of', 'psl3bbbc', 'is', 'far', 'more', 'subtle', 'and', 'intriguing', 'we', 'show', 'that', 'there', 'are', 'five', 'families', 'of', 'purely', 'parabolic', 'discrete', 'groups', 'in', 'psl3bbbc', 'and', 'some', 'of', 'these', 'actually', 'split', 'into', 'subfamilies', 'we', 'classify', 'all', 'these', 'by', 'means', 'of', 'their', 'limit', 'set', 'and', 'the', 'control', 'group', 'we', 'use', 'first', 'the', 'liekolchin', 'theorem', 'and', 'borels', 'fixed', 'point', 'theorem', 'to', 'show', 'that', 'all', 'purely', 'parabolic', 'discrete', 'groups', 'in', 'psl3bbbc', 'are', 'virtually', 'triangularizable', 'then', 'we', 'prove', 'that', 'purely', 'parabolic', 'groups', 'in', 'psl3bbbc', 'are', 'virtually', 'solvable', 'and', 'polycyclic', 'hence', 'finitely', 'presented', 'we', 'then', 'prove', 'a', 'slight', 'generalization', 'of', 'the', 'liekolchin', 'theorem', 'for', 'these', 'groups', 'they', 'are', 'either', 'virtually', 'unipotent', 'or', 'else', 'abelian', 'of', 'rank', '2', 'and', 'of', 'a', 'very', 'special', 'type', 'all', 'the', 'virtually', 'unipotent', 'ones', 'turn', 'out', 'to', 'be', 'conjugate', 'to', 'subgroups', 'of', 'the', 'heisenberg', 'group', 'rm', 'heis3bbbc', 'we', 'classify', 'these', 'using', 'the', 'obstructor', 'dimension', 'introduced', 'by', 'bestvina', 'kapovich', 'and', 'kleiner', 'we', 'find', 'that', 'their', 'kulkarni', 'limit', 'set', 'is', 'either', 'a', 'projective', 'line', 'a', 'cone', 'of', 'lines', 'with', 'base', 'a', 'circle', 'or', 'else', 'the', 'whole', 'bbbp2_bbbc', 'we', 'determine', 'the', 'relation', 'with', 'the', 'conzeguivarch', 'limit', 'set', 'of', 'the', 'action', 'on', 'the', 'dual', 'projective', 'space', 'checkbbbp2_bbbc', 'and', 'we', 'show', 'that', 'in', 'all', 'cases', 'the', 'kulkarni', 'region', 'of', 'discontinuity', 'is', 'the', 'largest', 'open', 'set', 'where', 'the', 'group', 'acts', 'properly', 'discontinuously']] | [-0.14956090038732886, 0.09937987893053721, -0.07651304701557232, 0.04704280755803695, -0.10694257054016024, -0.1326827521308235, 0.06671728641771141, 0.38643011997543997, -0.31182825502436307, -0.20238080330478447, 0.14463976484389165, -0.28599082215523886, -0.10700318225163725, 0.23092396104649168, -0.10853490541088714, -0.045741242372734574, 0.01913238184211115, 0.08894024871950669, -0.04903015918135943, -0.26745690307730147, 0.37579188098747945, -0.09831462579501432, 0.2225426225247042, 0.009985046035933098, 0.08652203758585177, 0.025682120786739454, -0.04093341123042328, 0.028080946119387357, -0.11136594231054679, 0.08743709387847283, 0.26006481334690995, 0.041601870551652785, 0.21253814048794728, -0.34532953456243465, -0.17275121048442088, 0.2221152465076997, 0.12410145185722579, 0.05950296674235424, -0.024480611649485052, -0.286037173789678, 0.12445765223181356, -0.1653490241443515, -0.15008698005206703, -0.05389053145477045, 0.03856269565585535, 0.008289629175476054, -0.18176629091331345, 0.02632634736496144, 0.12509660898602656, 0.10522774192317698, -0.05046231034136708, -0.08748022574488254, -0.06964080399531315, 0.1424630410915744, 0.006641893733983799, -0.014212930369408681, 0.09659669926599411, -0.058649190927803095, -0.09162905079598029, 0.4302783871253562, -0.04701040305137154, -0.20676277779913957, 0.19443622334285698, -0.1855364400234389, -0.18364912104387318, 0.11026058701897837, 0.10040025795329242, 0.13676805134626543, -0.07463235330613961, 0.16854531537307682, -0.15113558257449297, 0.10696928280794377, 0.07291784220104737, -0.028188852806417874, 0.11159431658339716, 0.06677988404032564, 0.09247113214458354, 0.11228702546809326, 0.0120183473608772, -0.013505219831131399, -0.3688590276635237, -0.1710661283286754, -0.1016880090751182, 0.1087103401181183, -0.0718516976535724, -0.1840513457892455, 0.3757527216108546, 0.06030683445316108, 0.16854154693728854, 0.09884531146869244, 0.18389745749581995, 0.07404857073731452, 0.05042579024091303, 0.11820308419942928, 0.1646741302119916, 0.16320521971623925, -0.10542521745364572, -0.15044680186838377, -0.055299464576819446, 0.16596925550801378] |
1,802.08361 | Weighted cogrowth formula for free groups | We investigate the relationship between geometric, analytic and probabilistic
indices for quotients of the Cayley graph of the free group ${\rm Cay}(F_n)$
endowed with variable edge lengths, by an arbitrary subgroup $G$ of $F_n$. Our
main result, which generalizes Grigorchuk's cogrowth formula to variable edge
lengths, provides a formula relating the bottom of the spectrum of weighted
Laplacian on $G \backslash {\rm Cay}(F_n)$ to the Poincar\'e exponent of $G$.
Our main tool is the Patterson-Sullivan theory for Cayley graphs with variable
edge lengths.
| math.DS math.PR | we investigate the relationship between geometric analytic and probabilistic indices for quotients of the cayley graph of the free group rm cayf_n endowed with variable edge lengths by an arbitrary subgroup g of f_n our main result which generalizes grigorchuks cogrowth formula to variable edge lengths provides a formula relating the bottom of the spectrum of weighted laplacian on g backslash rm cayf_n to the poincare exponent of g our main tool is the pattersonsullivan theory for cayley graphs with variable edge lengths | [['we', 'investigate', 'the', 'relationship', 'between', 'geometric', 'analytic', 'and', 'probabilistic', 'indices', 'for', 'quotients', 'of', 'the', 'cayley', 'graph', 'of', 'the', 'free', 'group', 'rm', 'cayf_n', 'endowed', 'with', 'variable', 'edge', 'lengths', 'by', 'an', 'arbitrary', 'subgroup', 'g', 'of', 'f_n', 'our', 'main', 'result', 'which', 'generalizes', 'grigorchuks', 'cogrowth', 'formula', 'to', 'variable', 'edge', 'lengths', 'provides', 'a', 'formula', 'relating', 'the', 'bottom', 'of', 'the', 'spectrum', 'of', 'weighted', 'laplacian', 'on', 'g', 'backslash', 'rm', 'cayf_n', 'to', 'the', 'poincare', 'exponent', 'of', 'g', 'our', 'main', 'tool', 'is', 'the', 'pattersonsullivan', 'theory', 'for', 'cayley', 'graphs', 'with', 'variable', 'edge', 'lengths']] | [-0.17685598602380465, 0.13824494877980337, -0.11527235806563202, 0.051306207384051825, -0.1309235111995669, -0.10227778429786365, 0.03564145059373667, 0.3820420495107954, -0.3042615162910043, -0.2618680667753021, 0.07506237679770515, -0.28146515456085774, -0.11552410883783007, 0.18633086309587887, -0.1094483033966641, 0.03134479263314494, 0.035669369246511734, 0.12198953787698467, -0.030160769851832293, -0.16231201414807905, 0.341196246082998, -0.021213698689538388, 0.22720694461446486, 0.07116909940399367, 0.0523296744896122, 0.06110195625274454, -0.07105278076006123, -0.04652927900997945, -0.2285658068449041, 0.16170127723182057, 0.24462684653239486, 0.02061880170080213, 0.18015077521587597, -0.36316276603539327, -0.17524752884321373, 0.18195009424155692, 0.0916746653455459, -0.06236454301347013, 0.03687647620164272, -0.2711922124856048, 0.14901934853858417, -0.1401771972714751, -0.18922733746032105, 0.032427576252684734, 0.1290172680200618, 0.005127401424594867, -0.26837079709878675, 0.058312889516934245, 0.10697979970122284, 0.0819232577090094, 0.006065154557380779, -0.14607038864015062, -0.07947512234296696, 0.13570876654674424, 0.011697452075572478, 0.06394839996973593, 0.06189122054449938, -0.053559815028199446, -0.15053970623117538, 0.34640753123173373, -0.10276582810228667, -0.18188354855886213, 0.0768665503250596, -0.16185628905041535, -0.1763463713987558, 0.08749612957745055, 0.10247175119541309, 0.16369024204251206, -0.01438823879558455, 0.1666054085326772, -0.11949899302864517, 0.08618335160829219, 0.07660847890800164, 0.009250990667000965, 0.09575630186332597, 0.09166363465461742, 0.12479823270099766, 0.19597725980673675, 0.018135515860868274, 0.0005703707582052843, -0.3553652874665496, -0.1441916335190152, -0.1969111034485661, 0.10156321030018138, -0.23846921796697038, -0.22256407135936582, 0.41602005655474866, 0.04878326736528565, 0.17377577316199924, 0.1746150180798047, 0.197486755768711, 0.11130836231484549, 0.03416148649620605, 0.11669159810530183, 0.019082500160252102, 0.3079712407887672, -0.10917535223595706, -0.20213067834552975, 0.010047225405197636, 0.24955153550354786] |
1,802.08362 | Real-Time End-to-End Action Detection with Two-Stream Networks | Two-stream networks have been very successful for solving the problem of
action detection. However, prior work using two-stream networks train both
streams separately, which prevents the network from exploiting regularities
between the two streams. Moreover, unlike the visual stream, the dominant forms
of optical flow computation typically do not maximally exploit GPU parallelism.
We present a real-time end-to-end trainable two-stream network for action
detection. First, we integrate the optical flow computation in our framework by
using Flownet2. Second, we apply early fusion for the two streams and train the
whole pipeline jointly end-to-end. Finally, for better network initialization,
we transfer from the task of action recognition to action detection by
pre-training our framework using the recently released large-scale Kinetics
dataset. Our experimental results show that training the pipeline jointly
end-to-end with fine-tuning the optical flow for the objective of action
detection improves detection performance significantly. Additionally, we
observe an improvement when initializing with parameters pre-trained using
Kinetics. Last, we show that by integrating the optical flow computation, our
framework is more efficient, running at real-time speeds (up to 31 fps).
| cs.CV | twostream networks have been very successful for solving the problem of action detection however prior work using twostream networks train both streams separately which prevents the network from exploiting regularities between the two streams moreover unlike the visual stream the dominant forms of optical flow computation typically do not maximally exploit gpu parallelism we present a realtime endtoend trainable twostream network for action detection first we integrate the optical flow computation in our framework by using flownet2 second we apply early fusion for the two streams and train the whole pipeline jointly endtoend finally for better network initialization we transfer from the task of action recognition to action detection by pretraining our framework using the recently released largescale kinetics dataset our experimental results show that training the pipeline jointly endtoend with finetuning the optical flow for the objective of action detection improves detection performance significantly additionally we observe an improvement when initializing with parameters pretrained using kinetics last we show that by integrating the optical flow computation our framework is more efficient running at realtime speeds up to 31 fps | [['twostream', 'networks', 'have', 'been', 'very', 'successful', 'for', 'solving', 'the', 'problem', 'of', 'action', 'detection', 'however', 'prior', 'work', 'using', 'twostream', 'networks', 'train', 'both', 'streams', 'separately', 'which', 'prevents', 'the', 'network', 'from', 'exploiting', 'regularities', 'between', 'the', 'two', 'streams', 'moreover', 'unlike', 'the', 'visual', 'stream', 'the', 'dominant', 'forms', 'of', 'optical', 'flow', 'computation', 'typically', 'do', 'not', 'maximally', 'exploit', 'gpu', 'parallelism', 'we', 'present', 'a', 'realtime', 'endtoend', 'trainable', 'twostream', 'network', 'for', 'action', 'detection', 'first', 'we', 'integrate', 'the', 'optical', 'flow', 'computation', 'in', 'our', 'framework', 'by', 'using', 'flownet2', 'second', 'we', 'apply', 'early', 'fusion', 'for', 'the', 'two', 'streams', 'and', 'train', 'the', 'whole', 'pipeline', 'jointly', 'endtoend', 'finally', 'for', 'better', 'network', 'initialization', 'we', 'transfer', 'from', 'the', 'task', 'of', 'action', 'recognition', 'to', 'action', 'detection', 'by', 'pretraining', 'our', 'framework', 'using', 'the', 'recently', 'released', 'largescale', 'kinetics', 'dataset', 'our', 'experimental', 'results', 'show', 'that', 'training', 'the', 'pipeline', 'jointly', 'endtoend', 'with', 'finetuning', 'the', 'optical', 'flow', 'for', 'the', 'objective', 'of', 'action', 'detection', 'improves', 'detection', 'performance', 'significantly', 'additionally', 'we', 'observe', 'an', 'improvement', 'when', 'initializing', 'with', 'parameters', 'pretrained', 'using', 'kinetics', 'last', 'we', 'show', 'that', 'by', 'integrating', 'the', 'optical', 'flow', 'computation', 'our', 'framework', 'is', 'more', 'efficient', 'running', 'at', 'realtime', 'speeds', 'up', 'to', '31', 'fps']] | [-0.07636543857903841, 0.0013471927417008879, -0.06342353519026397, -0.00031944220148337384, -0.08349822500927581, -0.15570604688643166, -0.001760395681614884, 0.46556871122577126, -0.27845796787490446, -0.3404420420760289, 0.0802659786636165, -0.22272528545096673, -0.2109905053706219, 0.21716727413974393, -0.06410479469098694, 0.10562377253857752, 0.20589801681279724, 0.0346501562020017, -0.06601806789015731, -0.28913618525386686, 0.29616025800868456, 0.0608201411475117, 0.3488067322785759, 0.0317828817344788, 0.1568676763440534, -0.013883144246776485, -0.03440527945220108, -0.04801408410162872, -0.022618961423884483, 0.1870334778220341, 0.24520256106948687, 0.1791121653578658, 0.27936124812501173, -0.45385597879067063, -0.28333322007933426, 0.06445897227256663, 0.17698099423303373, 0.1436220882997279, -0.05873334765549064, -0.31766355500246085, 0.10246189263933855, -0.21406000438922396, 0.052086719754152, -0.13331973396966026, -0.022606369250247046, -0.035935085715674275, -0.29368699606404536, 0.052264293750178895, 0.04841947038140562, 0.043482301133270895, -0.0881960614817217, -0.047339788427214244, 0.022959897245487405, 0.18233334389466715, -0.004562450839310056, 0.06059710875463983, 0.1417267380295218, -0.2086947687384155, -0.12506270344989995, 0.3595907142541061, -0.11809949232685742, -0.18097802987322212, 0.18255958665007105, -0.019591534647366238, -0.1647224896057095, 0.12081831090876625, 0.24390922175597451, 0.12775926314708258, -0.18668412195895345, -0.03143363068585232, -0.018595858523622156, 0.1878555851083042, 0.07929280812645124, -0.03619970847956008, 0.15728163651527008, 0.27084680093943864, 0.04158101869850523, 0.1551074896104789, -0.16903910130883257, -0.0804989936761558, -0.22651967994170263, -0.08689982885391348, -0.15721825192837666, -0.031903851717733134, -0.08595092013056274, -0.06396999501933655, 0.40126134894995225, 0.2537610063355209, 0.21576987682298446, 0.15527731796674843, 0.3963828953810864, 0.059785128510298415, 0.12626180660703945, 0.16677807062288694, 0.24380856662238432, -0.012057043005350149, 0.1354435942808373, -0.22378816698668136, 0.03834103559169711, 0.09021797897100138] |
1,802.08363 | An efficient $k$-means-type algorithm for clustering datasets with
incomplete records | The $k$-means algorithm is arguably the most popular nonparametric clustering
method but cannot generally be applied to datasets with incomplete records. The
usual practice then is to either impute missing values under an assumed
missing-completely-at-random mechanism or to ignore the incomplete records, and
apply the algorithm on the resulting dataset. We develop an efficient version
of the $k$-means algorithm that allows for clustering in the presence of
incomplete records. Our extension is called $k_m$-means and reduces to the
$k$-means algorithm when all records are complete. We also provide
initialization strategies for our algorithm and methods to estimate the number
of groups in the dataset. Illustrations and simulations demonstrate the
efficacy of our approach in a variety of settings and patterns of missing data.
Our methods are also applied to the analysis of activation images obtained from
a functional Magnetic Resonance Imaging experiment.
| stat.ML astro-ph.HE cs.LG stat.CO stat.ME | the kmeans algorithm is arguably the most popular nonparametric clustering method but cannot generally be applied to datasets with incomplete records the usual practice then is to either impute missing values under an assumed missingcompletelyatrandom mechanism or to ignore the incomplete records and apply the algorithm on the resulting dataset we develop an efficient version of the kmeans algorithm that allows for clustering in the presence of incomplete records our extension is called k_mmeans and reduces to the kmeans algorithm when all records are complete we also provide initialization strategies for our algorithm and methods to estimate the number of groups in the dataset illustrations and simulations demonstrate the efficacy of our approach in a variety of settings and patterns of missing data our methods are also applied to the analysis of activation images obtained from a functional magnetic resonance imaging experiment | [['the', 'kmeans', 'algorithm', 'is', 'arguably', 'the', 'most', 'popular', 'nonparametric', 'clustering', 'method', 'but', 'can', 'not', 'generally', 'be', 'applied', 'to', 'datasets', 'with', 'incomplete', 'records', 'the', 'usual', 'practice', 'then', 'is', 'to', 'either', 'impute', 'missing', 'values', 'under', 'an', 'assumed', 'missingcompletelyatrandom', 'mechanism', 'or', 'to', 'ignore', 'the', 'incomplete', 'records', 'and', 'apply', 'the', 'algorithm', 'on', 'the', 'resulting', 'dataset', 'we', 'develop', 'an', 'efficient', 'version', 'of', 'the', 'kmeans', 'algorithm', 'that', 'allows', 'for', 'clustering', 'in', 'the', 'presence', 'of', 'incomplete', 'records', 'our', 'extension', 'is', 'called', 'k_mmeans', 'and', 'reduces', 'to', 'the', 'kmeans', 'algorithm', 'when', 'all', 'records', 'are', 'complete', 'we', 'also', 'provide', 'initialization', 'strategies', 'for', 'our', 'algorithm', 'and', 'methods', 'to', 'estimate', 'the', 'number', 'of', 'groups', 'in', 'the', 'dataset', 'illustrations', 'and', 'simulations', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'approach', 'in', 'a', 'variety', 'of', 'settings', 'and', 'patterns', 'of', 'missing', 'data', 'our', 'methods', 'are', 'also', 'applied', 'to', 'the', 'analysis', 'of', 'activation', 'images', 'obtained', 'from', 'a', 'functional', 'magnetic', 'resonance', 'imaging', 'experiment']] | [-0.02474284363405543, -0.01190550950774759, -0.13304646599801703, 0.12441237965634774, -0.09677516903177323, -0.11538036071537981, 0.04588696631458654, 0.41871289712127663, -0.261239219787301, -0.35381401811962504, 0.13889177972664007, -0.28178287996809265, -0.16472003144551475, 0.21491216952358308, -0.0950852391608453, 0.023282838070500335, 0.12486981449019112, 0.04938992175038307, -0.021645491534489875, -0.304116782378143, 0.28249276371698984, 0.0646409686051414, 0.32084137457750844, -0.00614396060536563, 0.08890760390327351, 0.026919313030920818, -0.05172463584015749, 0.04891902738263909, -0.06164261789749168, 0.13370337976064062, 0.2665774004310894, 0.20600811760334797, 0.2927258211043729, -0.4002897936135898, -0.17306307037229793, 0.1303007772428469, 0.1425978478018037, 0.14688210303390573, -0.04797561390695988, -0.2769777995835937, 0.1099758508982478, -0.1166841416737773, -0.05399036793116952, -0.1572326469254798, -0.03635807016218396, -0.009902661764653216, -0.3369052122497905, 0.1144493375933552, 0.016908910145169834, 0.028341795330945874, -0.08252479709499567, -0.14057129220446754, 0.04192163308583934, 0.0984948119134265, 0.059695409350162765, 0.010213765630524762, 0.125121006142007, -0.11012546638105537, -0.15922902687452734, 0.37288001603381316, -0.02712149334035184, -0.2018415036375149, 0.1920705586409485, -0.07216375721225017, -0.1476898675056463, 0.12386068935886445, 0.18842901358984307, 0.14627379212777694, -0.14941365369745205, 0.031187989251789783, -0.04783294760149864, 0.16206249079181695, -0.01371857889888572, -0.033304559816212824, 0.09623370712465594, 0.18172075491870793, 0.07211704532497785, 0.13467203102379538, -0.14115293716034577, -0.05620096397297588, -0.24730648204002162, -0.10222915859735558, -0.20822660566527318, -0.04494548377547738, -0.10553190595760177, -0.19443189589024693, 0.3914802381047376, 0.2435382508072661, 0.20445643202073768, 0.04521836079394733, 0.3477027605641896, 0.03998071012664324, 0.08424882140194237, 0.08678852157129473, 0.14954342963961018, 0.09401121399116139, 0.07747152630767694, -0.17881834868531885, 0.09426101073163601, 0.03853635888704112] |
1,802.08364 | On the Gas Content and Efficiency of AGN Feedback in Low-redshift
Quasars | The interstellar medium is crucial to understanding the physics of active
galaxies and the coevolution between supermassive black holes and their host
galaxies. However, direct gas measurements are limited by sensitivity and other
uncertainties. Dust provides an efficient indirect probe of the total gas. We
apply this technique to a large sample of quasars, whose total gas content
would be prohibitively expensive to measure. We present a comprehensive study
of the full (1 to 500 micron) infrared spectral energy distributions of 87
redshift <0.5 quasars selected from the Palomar-Green sample, using photometric
measurements from 2MASS, WISE, and Herschel, combined with Spitzer mid-infrared
(5 to 40 micron) spectra. With a newly developed Bayesian Markov Chain Monte
Carlo fitting method, we decompose various overlapping contributions to the
integrated spectral energy distribution, including starlight, warm dust from
the torus, and cooler dust on galaxy scales. This procedure yields a robust
dust mass, which we use to infer the gas mass, using a gas-to-dust ratio
constrained by the host galaxy stellar mass. Most (90%) quasar hosts have gas
fractions similar to those of massive, star-forming galaxies, although a
minority (10%) seem genuinely gas-deficient, resembling present-day massive
early-type galaxies. This result indicates that "quasar mode" feedback does not
occur or is ineffective in the host galaxies of low-redshift quasars. We also
find that quasars can boost the interstellar radiation field and heat dust on
galactic scales. This cautions against the common practice of using the
far-infrared luminosity to estimate the host galaxy star formation rate.
| astro-ph.GA astro-ph.HE | the interstellar medium is crucial to understanding the physics of active galaxies and the coevolution between supermassive black holes and their host galaxies however direct gas measurements are limited by sensitivity and other uncertainties dust provides an efficient indirect probe of the total gas we apply this technique to a large sample of quasars whose total gas content would be prohibitively expensive to measure we present a comprehensive study of the full 1 to 500 micron infrared spectral energy distributions of 87 redshift 05 quasars selected from the palomargreen sample using photometric measurements from 2mass wise and herschel combined with spitzer midinfrared 5 to 40 micron spectra with a newly developed bayesian markov chain monte carlo fitting method we decompose various overlapping contributions to the integrated spectral energy distribution including starlight warm dust from the torus and cooler dust on galaxy scales this procedure yields a robust dust mass which we use to infer the gas mass using a gastodust ratio constrained by the host galaxy stellar mass most 90 quasar hosts have gas fractions similar to those of massive starforming galaxies although a minority 10 seem genuinely gasdeficient resembling presentday massive earlytype galaxies this result indicates that quasar mode feedback does not occur or is ineffective in the host galaxies of lowredshift quasars we also find that quasars can boost the interstellar radiation field and heat dust on galactic scales this cautions against the common practice of using the farinfrared luminosity to estimate the host galaxy star formation rate | [['the', 'interstellar', 'medium', 'is', 'crucial', 'to', 'understanding', 'the', 'physics', 'of', 'active', 'galaxies', 'and', 'the', 'coevolution', 'between', 'supermassive', 'black', 'holes', 'and', 'their', 'host', 'galaxies', 'however', 'direct', 'gas', 'measurements', 'are', 'limited', 'by', 'sensitivity', 'and', 'other', 'uncertainties', 'dust', 'provides', 'an', 'efficient', 'indirect', 'probe', 'of', 'the', 'total', 'gas', 'we', 'apply', 'this', 'technique', 'to', 'a', 'large', 'sample', 'of', 'quasars', 'whose', 'total', 'gas', 'content', 'would', 'be', 'prohibitively', 'expensive', 'to', 'measure', 'we', 'present', 'a', 'comprehensive', 'study', 'of', 'the', 'full', '1', 'to', '500', 'micron', 'infrared', 'spectral', 'energy', 'distributions', 'of', '87', 'redshift', '05', 'quasars', 'selected', 'from', 'the', 'palomargreen', 'sample', 'using', 'photometric', 'measurements', 'from', '2mass', 'wise', 'and', 'herschel', 'combined', 'with', 'spitzer', 'midinfrared', '5', 'to', '40', 'micron', 'spectra', 'with', 'a', 'newly', 'developed', 'bayesian', 'markov', 'chain', 'monte', 'carlo', 'fitting', 'method', 'we', 'decompose', 'various', 'overlapping', 'contributions', 'to', 'the', 'integrated', 'spectral', 'energy', 'distribution', 'including', 'starlight', 'warm', 'dust', 'from', 'the', 'torus', 'and', 'cooler', 'dust', 'on', 'galaxy', 'scales', 'this', 'procedure', 'yields', 'a', 'robust', 'dust', 'mass', 'which', 'we', 'use', 'to', 'infer', 'the', 'gas', 'mass', 'using', 'a', 'gastodust', 'ratio', 'constrained', 'by', 'the', 'host', 'galaxy', 'stellar', 'mass', 'most', '90', 'quasar', 'hosts', 'have', 'gas', 'fractions', 'similar', 'to', 'those', 'of', 'massive', 'starforming', 'galaxies', 'although', 'a', 'minority', '10', 'seem', 'genuinely', 'gasdeficient', 'resembling', 'presentday', 'massive', 'earlytype', 'galaxies', 'this', 'result', 'indicates', 'that', 'quasar', 'mode', 'feedback', 'does', 'not', 'occur', 'or', 'is', 'ineffective', 'in', 'the', 'host', 'galaxies', 'of', 'lowredshift', 'quasars', 'we', 'also', 'find', 'that', 'quasars', 'can', 'boost', 'the', 'interstellar', 'radiation', 'field', 'and', 'heat', 'dust', 'on', 'galactic', 'scales', 'this', 'cautions', 'against', 'the', 'common', 'practice', 'of', 'using', 'the', 'farinfrared', 'luminosity', 'to', 'estimate', 'the', 'host', 'galaxy', 'star', 'formation', 'rate']] | [-0.007807029466377571, 0.09037079582602019, -0.06498481326922774, 0.137179807750741, -0.12574957838654519, -0.05301997210131958, 0.0686146867587231, 0.4435092136859894, -0.12371606144169346, -0.36170804981701077, 0.03346806066436693, -0.3024421458505094, 0.01383833117573522, 0.17087695285864174, -0.022902636915445328, -0.008442487006541342, 0.014689146418124438, -0.19146819070260973, -0.02017819710675394, -0.2929649105970748, 0.2946183820674196, 0.12893143351748584, 0.18544709764048456, -0.049335975537076596, 0.08173773994529619, -0.09694400950195267, -0.1505941390870139, -0.033676285052206364, -0.18579793033358874, 0.040118730778805914, 0.2657334695747122, 0.1293911352949217, 0.2277254432081245, -0.3275429914292763, -0.2095087012331933, 0.11873038880061358, 0.21084736168663948, 0.068038882185705, -0.08613796710874885, -0.2426276961248368, 0.06261910642264411, -0.20141801584884525, -0.1554490245077759, 0.05243235579738394, 0.0013924176101572812, 0.008822066791683028, -0.21740082014375367, 0.16481298569205682, -0.01772972618136555, 0.08423213686607778, -0.10699938889872283, -0.09384176334924996, -0.10242991458112374, 0.04533426607400179, -0.011849792146589606, 0.07773759320005774, 0.2766210452304222, -0.11883714865706861, -0.004688518927898258, 0.41297473261505363, -0.0715574108751025, 0.007832471366971731, 0.2672143008224666, -0.21341605433449148, -0.16647821376472713, 0.17527732307650148, 0.1875475824646419, 0.12536839088250418, -0.19671057880856097, -0.00751989751541987, -0.031193649288266897, 0.25821120298281314, -0.020539086250588298, 0.11813002660329221, 0.3511706180945039, 0.09103956040833146, 0.036396175707690416, 0.10263963221455924, -0.22887237216252834, -0.019068845646455883, -0.18198335330327972, -0.10547932965494693, -0.16828569324302953, 0.13849511269392678, -0.15969406888168305, -0.10255691226338967, 0.3092245732806623, 0.14220477487647804, 0.23448187085520475, 0.08428042125829961, 0.35747217678169546, 0.05305743905296549, 0.13377824000222607, 0.11736280070245265, 0.31836609029420654, 0.16431042085401715, 0.07626091503258794, -0.23827220727037637, 0.03397921117953956, -0.0070542742279358205] |
1,802.08365 | Budget Constrained Bidding by Model-free Reinforcement Learning in
Display Advertising | Real-time bidding (RTB) is an important mechanism in online display
advertising, where a proper bid for each page view plays an essential role for
good marketing results. Budget constrained bidding is a typical scenario in RTB
where the advertisers hope to maximize the total value of the winning
impressions under a pre-set budget constraint. However, the optimal bidding
strategy is hard to be derived due to the complexity and volatility of the
auction environment. To address these challenges, in this paper, we formulate
budget constrained bidding as a Markov Decision Process and propose a
model-free reinforcement learning framework to resolve the optimization
problem. Our analysis shows that the immediate reward from environment is
misleading under a critical resource constraint. Therefore, we innovate a
reward function design methodology for the reinforcement learning problems with
constraints. Based on the new reward design, we employ a deep neural network to
learn the appropriate reward so that the optimal policy can be learned
effectively. Different from the prior model-based work, which suffers from the
scalability problem, our framework is easy to be deployed in large-scale
industrial applications. The experimental evaluations demonstrate the
effectiveness of our framework on large-scale real datasets.
| cs.AI | realtime bidding rtb is an important mechanism in online display advertising where a proper bid for each page view plays an essential role for good marketing results budget constrained bidding is a typical scenario in rtb where the advertisers hope to maximize the total value of the winning impressions under a preset budget constraint however the optimal bidding strategy is hard to be derived due to the complexity and volatility of the auction environment to address these challenges in this paper we formulate budget constrained bidding as a markov decision process and propose a modelfree reinforcement learning framework to resolve the optimization problem our analysis shows that the immediate reward from environment is misleading under a critical resource constraint therefore we innovate a reward function design methodology for the reinforcement learning problems with constraints based on the new reward design we employ a deep neural network to learn the appropriate reward so that the optimal policy can be learned effectively different from the prior modelbased work which suffers from the scalability problem our framework is easy to be deployed in largescale industrial applications the experimental evaluations demonstrate the effectiveness of our framework on largescale real datasets | [['realtime', 'bidding', 'rtb', 'is', 'an', 'important', 'mechanism', 'in', 'online', 'display', 'advertising', 'where', 'a', 'proper', 'bid', 'for', 'each', 'page', 'view', 'plays', 'an', 'essential', 'role', 'for', 'good', 'marketing', 'results', 'budget', 'constrained', 'bidding', 'is', 'a', 'typical', 'scenario', 'in', 'rtb', 'where', 'the', 'advertisers', 'hope', 'to', 'maximize', 'the', 'total', 'value', 'of', 'the', 'winning', 'impressions', 'under', 'a', 'preset', 'budget', 'constraint', 'however', 'the', 'optimal', 'bidding', 'strategy', 'is', 'hard', 'to', 'be', 'derived', 'due', 'to', 'the', 'complexity', 'and', 'volatility', 'of', 'the', 'auction', 'environment', 'to', 'address', 'these', 'challenges', 'in', 'this', 'paper', 'we', 'formulate', 'budget', 'constrained', 'bidding', 'as', 'a', 'markov', 'decision', 'process', 'and', 'propose', 'a', 'modelfree', 'reinforcement', 'learning', 'framework', 'to', 'resolve', 'the', 'optimization', 'problem', 'our', 'analysis', 'shows', 'that', 'the', 'immediate', 'reward', 'from', 'environment', 'is', 'misleading', 'under', 'a', 'critical', 'resource', 'constraint', 'therefore', 'we', 'innovate', 'a', 'reward', 'function', 'design', 'methodology', 'for', 'the', 'reinforcement', 'learning', 'problems', 'with', 'constraints', 'based', 'on', 'the', 'new', 'reward', 'design', 'we', 'employ', 'a', 'deep', 'neural', 'network', 'to', 'learn', 'the', 'appropriate', 'reward', 'so', 'that', 'the', 'optimal', 'policy', 'can', 'be', 'learned', 'effectively', 'different', 'from', 'the', 'prior', 'modelbased', 'work', 'which', 'suffers', 'from', 'the', 'scalability', 'problem', 'our', 'framework', 'is', 'easy', 'to', 'be', 'deployed', 'in', 'largescale', 'industrial', 'applications', 'the', 'experimental', 'evaluations', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'framework', 'on', 'largescale', 'real', 'datasets']] | [-0.0610193533167167, -0.023356392309491342, -0.08836142585983461, 0.08361833207866265, -0.18597171033913157, -0.16992016943238145, 0.12971503425886075, 0.45937401506745695, -0.3054887761901803, -0.3315454970437045, 0.11899969179767697, -0.23262932883012488, -0.1959530512840316, 0.16400926297635068, -0.1639380831710492, 0.08021352389988927, 0.07642842022160411, 0.029990221207429255, 0.011429732442092227, -0.28810513807622223, 0.29333679666976364, 0.08836135022892802, 0.33386647201865455, 0.05235292833258056, 0.12884884401538163, 0.0038200261579750447, 0.01743371150936285, -0.01171866167796721, -0.10209193070722347, 0.13454190023808874, 0.36378753483675574, 0.22570126349039907, 0.4226893269776471, -0.39888905907021266, -0.16883351282770176, 0.13292423192155073, 0.09412619754272912, 0.0430779538179863, -0.07047041981333714, -0.27460977110099427, 0.06260501180611532, -0.19301887050066713, -0.004268161425062892, -0.09041140086910858, -0.054023584874812514, -0.032060266765219406, -0.37687880471847685, -0.02981127295951948, 0.005400995277248475, -0.011484432787181838, -0.08919651038726145, -0.1057809656675981, 0.04883487912118245, 0.1659840526420395, 0.0852191570767009, 0.04286288795992732, 0.2017015398655809, -0.18010398201116987, -0.19137221458486794, 0.41088672258834147, -0.007577339762213583, -0.17619849927129452, 0.11844508195348198, -5.492678551212409e-05, -0.17074991579224563, 0.11262521820085845, 0.2712705645612821, 0.14238448983904126, -0.19198458539369534, 0.05274625621766935, -0.07420009031549704, 0.17363715110636524, -0.030298732836464688, -0.0022176204330040788, 0.17885338499006453, 0.25884101603522286, 0.15201793742670242, 0.1513046693497537, -0.012108708700944423, -0.15081717024322086, -0.23688160870295513, -0.12473938030390334, -0.17362543070636577, 0.023174679428885445, -0.1140530936713081, -0.11654031166561217, 0.34373247915194655, 0.2290963546292172, 0.16571316242334433, 0.12148083047287976, 0.36671092476201606, 0.10671375694622913, 0.03208625402624662, 0.10921188367991613, 0.20970693080001795, -0.054274109333850996, 0.17147132603936277, -0.21533674732853222, 0.15903317018611624, -0.002250548091013821] |
1,802.08366 | Conformal boundary operators, T-curvatures, and conformal fractional
Laplacians of odd order | We construct continuously parametrised families of conformally invariant
boundary operators on densities. These may also be viewed as conformally
covariant boundary operators on functions and generalise to higher orders the
first-order conformal Robin operator and an analogous third-order operator of
Chang-Qing. Our families include operators of critical order on odd-dimensional
boundaries. Combined with the (conformal Laplacian power) GJMS operators, a
suitable selection of the boundary operators yields formally self-adjoint
elliptic conformal boundary problems. Working on a conformal manifold with
boundary, we show that the operators yield odd-order conformally invariant
fractional Laplacian pseudo-differential operators. To do this, we use
higher-order conformally invariant Dirichlet-to-Neumann constructions. We also
find and construct new curvature quantities associated to our new operator
families. These have links to the Branson Q-curvature and include higher-order
generalisations of the mean curvature and the T-curvature of Chang-Qing. In the
case of the standard conformal hemisphere, the boundary operator construction
is particularly simple; the resulting operators provide an elementary
construction of families of symmetry breaking intertwinors between the
spherical principal series representations of the conformal group of the
equator, as studied by Juhl and others. We use our constructions to shed light
on some conjectures of Juhl.
| math.DG math-ph math.AP math.MP | we construct continuously parametrised families of conformally invariant boundary operators on densities these may also be viewed as conformally covariant boundary operators on functions and generalise to higher orders the firstorder conformal robin operator and an analogous thirdorder operator of changqing our families include operators of critical order on odddimensional boundaries combined with the conformal laplacian power gjms operators a suitable selection of the boundary operators yields formally selfadjoint elliptic conformal boundary problems working on a conformal manifold with boundary we show that the operators yield oddorder conformally invariant fractional laplacian pseudodifferential operators to do this we use higherorder conformally invariant dirichlettoneumann constructions we also find and construct new curvature quantities associated to our new operator families these have links to the branson qcurvature and include higherorder generalisations of the mean curvature and the tcurvature of changqing in the case of the standard conformal hemisphere the boundary operator construction is particularly simple the resulting operators provide an elementary construction of families of symmetry breaking intertwinors between the spherical principal series representations of the conformal group of the equator as studied by juhl and others we use our constructions to shed light on some conjectures of juhl | [['we', 'construct', 'continuously', 'parametrised', 'families', 'of', 'conformally', 'invariant', 'boundary', 'operators', 'on', 'densities', 'these', 'may', 'also', 'be', 'viewed', 'as', 'conformally', 'covariant', 'boundary', 'operators', 'on', 'functions', 'and', 'generalise', 'to', 'higher', 'orders', 'the', 'firstorder', 'conformal', 'robin', 'operator', 'and', 'an', 'analogous', 'thirdorder', 'operator', 'of', 'changqing', 'our', 'families', 'include', 'operators', 'of', 'critical', 'order', 'on', 'odddimensional', 'boundaries', 'combined', 'with', 'the', 'conformal', 'laplacian', 'power', 'gjms', 'operators', 'a', 'suitable', 'selection', 'of', 'the', 'boundary', 'operators', 'yields', 'formally', 'selfadjoint', 'elliptic', 'conformal', 'boundary', 'problems', 'working', 'on', 'a', 'conformal', 'manifold', 'with', 'boundary', 'we', 'show', 'that', 'the', 'operators', 'yield', 'oddorder', 'conformally', 'invariant', 'fractional', 'laplacian', 'pseudodifferential', 'operators', 'to', 'do', 'this', 'we', 'use', 'higherorder', 'conformally', 'invariant', 'dirichlettoneumann', 'constructions', 'we', 'also', 'find', 'and', 'construct', 'new', 'curvature', 'quantities', 'associated', 'to', 'our', 'new', 'operator', 'families', 'these', 'have', 'links', 'to', 'the', 'branson', 'qcurvature', 'and', 'include', 'higherorder', 'generalisations', 'of', 'the', 'mean', 'curvature', 'and', 'the', 'tcurvature', 'of', 'changqing', 'in', 'the', 'case', 'of', 'the', 'standard', 'conformal', 'hemisphere', 'the', 'boundary', 'operator', 'construction', 'is', 'particularly', 'simple', 'the', 'resulting', 'operators', 'provide', 'an', 'elementary', 'construction', 'of', 'families', 'of', 'symmetry', 'breaking', 'intertwinors', 'between', 'the', 'spherical', 'principal', 'series', 'representations', 'of', 'the', 'conformal', 'group', 'of', 'the', 'equator', 'as', 'studied', 'by', 'juhl', 'and', 'others', 'we', 'use', 'our', 'constructions', 'to', 'shed', 'light', 'on', 'some', 'conjectures', 'of', 'juhl']] | [-0.1640973320938837, 0.1190301602653154, -0.07366707579503597, 0.09467344685476653, -0.15193542055975723, -0.1280307707766413, -0.08120349191167221, 0.32629376597113297, -0.23707088039788818, -0.2053142083067523, 0.13253091303192135, -0.31365283211926, -0.17478919585326885, 0.16292688444943396, -0.10250563193284859, 0.10041558237423245, 0.010557262458581934, 0.0700849852293352, -0.1541740140742242, -0.22573524465480324, 0.4551946015230247, -0.01389445926594947, 0.20919895160002444, 0.08201210341613492, 0.07410360302072855, -0.028170914987900426, -0.04296216327098331, -0.03387091557016568, -0.1597505832456331, 0.15512442153080233, 0.2284431358709057, 0.006200077009805459, 0.16647133101324305, -0.4122559910364525, -0.2067803047613445, 0.12633151099399417, 0.111851350892628, 0.027433719174765354, -0.0019132007563136856, -0.31830243463034036, 0.03902859476570762, -0.10401648253321824, -0.19460783064441414, -0.13258487545881878, -0.04729138973302075, -0.039824619620791354, -0.25900220778077004, 0.08230312139345855, 0.09734459815040375, 0.06753771500281837, -0.0925199782893974, -0.11475527995237511, -0.07790191595475855, 0.07016757418097434, 0.029179915074230532, 0.01082147893196504, 0.08980760385391626, -0.0452980492537252, -0.1426548840031408, 0.3129132541647295, -0.08982258261720726, -0.3069323189699148, 0.12322114672682875, -0.1473805373225703, -0.16987846240078155, 0.03508105191250085, 0.15451024524981574, 0.19546218748722338, -0.1141124630432424, 0.15407528372170232, -0.04929811966116065, 0.07974480966768911, 0.12451249333478663, 0.027162853846972694, 0.1300570616921486, 0.008744020320294539, 0.15255790286488374, 0.16010579352512985, 0.05270174384082677, -0.1223029248292881, -0.4093185457904652, -0.1601027555289151, -0.09976612099408343, 0.10217296933679253, -0.16735652164387996, -0.24178236841321543, 0.4137922404428982, 0.10122111807675314, 0.19378059424402916, 0.11122399777793492, 0.186446266331976, 0.16104790140050274, 0.13914076719388224, 0.08995232228617354, 0.16660271150523878, 0.21461170617305692, 0.08010724569464159, -0.1844141864365119, -0.10092734659211805, 0.21653398400296134] |
1,802.08367 | Effects of shock and turbulence properties on electron acceleration | Using test particle simulations we study electron acceleration at
collisionless shocks with a two-component model turbulent magnetic field with
slab component including dissipation range. We investigate the importance of
shock normal angle $\theta_{Bn}$, magnetic turbulence level
$\left(b/B_0\right)^2$, and shock thickness on the acceleration efficiency of
electrons. It is shown that at perpendicular shocks the electron acceleration
efficiency is enhanced with the decreasing of $\left(b/B_0\right)^2$, and at
$\left(b/B_0\right)^2=0.01$ the acceleration becomes significant due to strong
drift electric field with long time particles staying near the shock front for
shock drift acceleration (SDA). In addition, at parallel shocks the electron
acceleration efficiency is increasing with the increasing of
$\left(b/B_0\right)^2$, and at $\left(b/B_0\right)^2=10.0$ the acceleration is
very strong due to sufficient pitch-angle scattering for first-order Fermi
acceleration, as well as due to large local component of magnetic field
perpendicular to shock normal angle for SDA. On the other hand, the high
perpendicular shock acceleration with $\left(b/B_0\right)^2=0.01$ is stronger
than the high parallel shock acceleration with ($\left(b/B_0\right)^2=10.0$),
the reason might be the assumption that SDA is more efficient than first-order
Fermi acceleration. Furthermore, for oblique shocks, the acceleration
efficiency is small no matter the turbulence level is low or high. Moreover,
for the effect of shock thickness on electron acceleration at perpendicular
shocks, we show that there exists the bend-over thickness, $L_{\text{diff,b}}$.
The acceleration efficiency does not change evidently if the shock thickness is
much smaller than $L_{\text{diff,b}}$. However, if the shock thickness is much
larger than $L_{\text{diff,b}}$, the acceleration efficiency starts to drop
abruptly.
| astro-ph.HE | using test particle simulations we study electron acceleration at collisionless shocks with a twocomponent model turbulent magnetic field with slab component including dissipation range we investigate the importance of shock normal angle theta_bn magnetic turbulence level leftbb_0right2 and shock thickness on the acceleration efficiency of electrons it is shown that at perpendicular shocks the electron acceleration efficiency is enhanced with the decreasing of leftbb_0right2 and at leftbb_0right2001 the acceleration becomes significant due to strong drift electric field with long time particles staying near the shock front for shock drift acceleration sda in addition at parallel shocks the electron acceleration efficiency is increasing with the increasing of leftbb_0right2 and at leftbb_0right2100 the acceleration is very strong due to sufficient pitchangle scattering for firstorder fermi acceleration as well as due to large local component of magnetic field perpendicular to shock normal angle for sda on the other hand the high perpendicular shock acceleration with leftbb_0right2001 is stronger than the high parallel shock acceleration with leftbb_0right2100 the reason might be the assumption that sda is more efficient than firstorder fermi acceleration furthermore for oblique shocks the acceleration efficiency is small no matter the turbulence level is low or high moreover for the effect of shock thickness on electron acceleration at perpendicular shocks we show that there exists the bendover thickness l_textdiffb the acceleration efficiency does not change evidently if the shock thickness is much smaller than l_textdiffb however if the shock thickness is much larger than l_textdiffb the acceleration efficiency starts to drop abruptly | [['using', 'test', 'particle', 'simulations', 'we', 'study', 'electron', 'acceleration', 'at', 'collisionless', 'shocks', 'with', 'a', 'twocomponent', 'model', 'turbulent', 'magnetic', 'field', 'with', 'slab', 'component', 'including', 'dissipation', 'range', 'we', 'investigate', 'the', 'importance', 'of', 'shock', 'normal', 'angle', 'theta_bn', 'magnetic', 'turbulence', 'level', 'leftbb_0right2', 'and', 'shock', 'thickness', 'on', 'the', 'acceleration', 'efficiency', 'of', 'electrons', 'it', 'is', 'shown', 'that', 'at', 'perpendicular', 'shocks', 'the', 'electron', 'acceleration', 'efficiency', 'is', 'enhanced', 'with', 'the', 'decreasing', 'of', 'leftbb_0right2', 'and', 'at', 'leftbb_0right2001', 'the', 'acceleration', 'becomes', 'significant', 'due', 'to', 'strong', 'drift', 'electric', 'field', 'with', 'long', 'time', 'particles', 'staying', 'near', 'the', 'shock', 'front', 'for', 'shock', 'drift', 'acceleration', 'sda', 'in', 'addition', 'at', 'parallel', 'shocks', 'the', 'electron', 'acceleration', 'efficiency', 'is', 'increasing', 'with', 'the', 'increasing', 'of', 'leftbb_0right2', 'and', 'at', 'leftbb_0right2100', 'the', 'acceleration', 'is', 'very', 'strong', 'due', 'to', 'sufficient', 'pitchangle', 'scattering', 'for', 'firstorder', 'fermi', 'acceleration', 'as', 'well', 'as', 'due', 'to', 'large', 'local', 'component', 'of', 'magnetic', 'field', 'perpendicular', 'to', 'shock', 'normal', 'angle', 'for', 'sda', 'on', 'the', 'other', 'hand', 'the', 'high', 'perpendicular', 'shock', 'acceleration', 'with', 'leftbb_0right2001', 'is', 'stronger', 'than', 'the', 'high', 'parallel', 'shock', 'acceleration', 'with', 'leftbb_0right2100', 'the', 'reason', 'might', 'be', 'the', 'assumption', 'that', 'sda', 'is', 'more', 'efficient', 'than', 'firstorder', 'fermi', 'acceleration', 'furthermore', 'for', 'oblique', 'shocks', 'the', 'acceleration', 'efficiency', 'is', 'small', 'no', 'matter', 'the', 'turbulence', 'level', 'is', 'low', 'or', 'high', 'moreover', 'for', 'the', 'effect', 'of', 'shock', 'thickness', 'on', 'electron', 'acceleration', 'at', 'perpendicular', 'shocks', 'we', 'show', 'that', 'there', 'exists', 'the', 'bendover', 'thickness', 'l_textdiffb', 'the', 'acceleration', 'efficiency', 'does', 'not', 'change', 'evidently', 'if', 'the', 'shock', 'thickness', 'is', 'much', 'smaller', 'than', 'l_textdiffb', 'however', 'if', 'the', 'shock', 'thickness', 'is', 'much', 'larger', 'than', 'l_textdiffb', 'the', 'acceleration', 'efficiency', 'starts', 'to', 'drop', 'abruptly']] | [-0.13000653769070591, 0.2065089254240366, -0.010649590391047329, 0.09474600149933174, -0.09972320008845736, -0.1285410424268348, -0.038339512107841034, 0.4190743242952264, -0.28857090697446575, -0.31521466136853465, 0.011514857968952703, -0.2483937539865342, 0.03030348314360719, 0.24170249667129884, 0.04692759197054484, -0.05350546863095963, 0.04205407526839886, -0.014414099757729271, -0.04455107599044377, -0.16750173212966019, 0.2646068405427853, 0.19985270791928386, 0.2912313038226866, 0.09571424352103158, 0.1050742072371864, -0.0758361688905992, 0.07260078803526789, 0.05033458466971527, -0.09146079667209368, -0.010644235991333661, 0.12410344538441011, 0.014185267698532535, 0.29360320984653615, -0.4742579460747329, -0.24526847923609998, 0.0345662457497059, 0.18883145558798634, 0.06702723707589, -0.0729553463983916, -0.19135523792582484, 0.06613840633694097, -0.1339030362880574, -0.16632939587245404, 0.03413882853297388, 0.052151401100684, 0.06128475626578049, -0.26297007014914625, 0.1517771167472299, 0.06925213084742804, 0.05124544741035352, -0.06220267420476265, -0.038240028462308624, -0.030788488208169217, -0.01724018742517014, 0.15517923809910336, 0.12133698550977665, 0.2019709212286492, -0.17051193994368136, -0.03180217358136648, 0.4066817178145835, -0.0730770185360259, -0.13277562139914012, 0.2681157679564738, -0.2530427860861516, -0.032578027445204584, 0.2523066249151944, 0.15291091253762304, 0.05253890881820126, -0.03858911626602746, 0.025900967702291236, 0.03263357405358481, 0.13835642967177064, 0.1084979389443511, -0.04020922889354213, 0.22621624750134192, 0.1790579321534045, 0.0942497702394631, 0.09067552573653692, -0.19293523933606502, -0.03539364704855639, -0.2684602034608136, -0.1642541166485442, -0.1498561180290966, 0.019742103167284027, -0.1323851570183612, -0.16279788354545105, 0.33182619958512694, 0.1850447427313624, 0.12802737297738623, -0.012083623307542158, 0.3468559926751858, 0.18736862003221647, 0.03329102912548221, 0.18939103057932274, 0.3053433653721322, 0.1455749608500887, 0.12350166364863274, -0.27004762365754226, 0.13077994490132822, 0.0092365664980461] |
1,802.08368 | Quark-Meson-Coupling (QMC) model for finite nuclei, nuclear matter and
beyond | The Quark-Meson-Coupling model, which self-consistently relates the dynamics
of the internal quark structure of a hadron to the relativistic mean fields
arising in nuclear matter, provides a natural explanation to many open
questions in low energy nuclear physics, including the origin of many-body
nuclear forces and their saturation, the spin-orbit interaction and properties
of hadronic matter at a wide range of densities up to those occurring in the
cores of neutron stars. Here we focus on four aspects of the model (i) a full
comprehensive survey of the theory, including the latest developments, (ii)
extensive application of the model to ground state properties of finite nuclei
and hypernuclei, with a discussion of similarities and differences between the
QMC and Skyrme energy density functionals, (iii) equilibrium conditions and
composition of hadronic matter in cold and warm neutron stars and their
comparison with the outcome of relativistic mean-field theories and, (iv) tests
of the fundamental idea that hadron structure changes in-medium.
| nucl-th hep-ph | the quarkmesoncoupling model which selfconsistently relates the dynamics of the internal quark structure of a hadron to the relativistic mean fields arising in nuclear matter provides a natural explanation to many open questions in low energy nuclear physics including the origin of manybody nuclear forces and their saturation the spinorbit interaction and properties of hadronic matter at a wide range of densities up to those occurring in the cores of neutron stars here we focus on four aspects of the model i a full comprehensive survey of the theory including the latest developments ii extensive application of the model to ground state properties of finite nuclei and hypernuclei with a discussion of similarities and differences between the qmc and skyrme energy density functionals iii equilibrium conditions and composition of hadronic matter in cold and warm neutron stars and their comparison with the outcome of relativistic meanfield theories and iv tests of the fundamental idea that hadron structure changes inmedium | [['the', 'quarkmesoncoupling', 'model', 'which', 'selfconsistently', 'relates', 'the', 'dynamics', 'of', 'the', 'internal', 'quark', 'structure', 'of', 'a', 'hadron', 'to', 'the', 'relativistic', 'mean', 'fields', 'arising', 'in', 'nuclear', 'matter', 'provides', 'a', 'natural', 'explanation', 'to', 'many', 'open', 'questions', 'in', 'low', 'energy', 'nuclear', 'physics', 'including', 'the', 'origin', 'of', 'manybody', 'nuclear', 'forces', 'and', 'their', 'saturation', 'the', 'spinorbit', 'interaction', 'and', 'properties', 'of', 'hadronic', 'matter', 'at', 'a', 'wide', 'range', 'of', 'densities', 'up', 'to', 'those', 'occurring', 'in', 'the', 'cores', 'of', 'neutron', 'stars', 'here', 'we', 'focus', 'on', 'four', 'aspects', 'of', 'the', 'model', 'i', 'a', 'full', 'comprehensive', 'survey', 'of', 'the', 'theory', 'including', 'the', 'latest', 'developments', 'ii', 'extensive', 'application', 'of', 'the', 'model', 'to', 'ground', 'state', 'properties', 'of', 'finite', 'nuclei', 'and', 'hypernuclei', 'with', 'a', 'discussion', 'of', 'similarities', 'and', 'differences', 'between', 'the', 'qmc', 'and', 'skyrme', 'energy', 'density', 'functionals', 'iii', 'equilibrium', 'conditions', 'and', 'composition', 'of', 'hadronic', 'matter', 'in', 'cold', 'and', 'warm', 'neutron', 'stars', 'and', 'their', 'comparison', 'with', 'the', 'outcome', 'of', 'relativistic', 'meanfield', 'theories', 'and', 'iv', 'tests', 'of', 'the', 'fundamental', 'idea', 'that', 'hadron', 'structure', 'changes', 'inmedium']] | [-0.06547583571969057, 0.18218940403898182, -0.12782120436383118, 0.12549008610043325, -0.04845021854875223, -0.04653445001012124, 0.04684562184891822, 0.3164417712287333, -0.22872351927085305, -0.3380248317752713, 0.004034243254635319, -0.28955725812991645, -0.03350120141469645, 0.13226340866483655, 0.06647154145014514, 0.04261095043412357, 0.038959376900544705, 0.0224378073402042, -0.1208950053613469, -0.1917784783766611, 0.3536261017258578, 0.06864328461599613, 0.20753426039181416, 0.10793964605893407, 0.0760663628948665, -0.02497903378453375, -0.0267967984882775, 0.007821343279789266, -0.14742034665659787, 0.11509772989597448, 0.22602932109884075, 0.09436399175246603, 0.22176812971238694, -0.45426832770917025, -0.22524905991784455, 0.07873176219550974, 0.06485574503587384, 0.12315180557033152, -0.07694227810298919, -0.26557745180625775, 0.03519065234789613, -0.23317508647912447, -0.16976879936578515, -0.07815718552706845, 0.012127739684831983, 0.08872439764123762, -0.21567781992130708, 0.08485022484092042, 0.024735099412705866, 0.056084665475682645, -0.11834304362722912, -0.1676195248911661, -0.002709958242521908, 0.06523439405286836, 0.05989387866663132, 0.015050051270386661, 0.17435027875076486, -0.2456689614717667, -0.0887957861421501, 0.45307680986727933, -0.04380461465715249, -0.08973660458277606, 0.22508968159837542, -0.1722882095659913, -0.15825418828043547, 0.10242645036057224, 0.18012855427468535, 0.09876212342964404, -0.1446857835970081, 0.11397787099012244, -0.012435435291830709, 0.1493343366273392, -0.007415077003281353, 0.08756981870604667, 0.25855195964100836, 0.19097359211670248, -0.037376628691146045, 0.05639794132666393, -0.11238609707720999, -0.17006287648512414, -0.34020466959900547, -0.09524696628100374, -0.10607307844461417, 0.02970018843335316, -0.0642635162571795, -0.16301546121051289, 0.41472508068893504, 0.0970589635167388, 0.17299108981717168, -0.0484442644036498, 0.27273665355085014, 0.03273333187958917, 0.020009827701984055, 0.04659695382619499, 0.2629332061499685, 0.24846519396271347, 0.08677951169475538, -0.3107303842703033, 0.007562708979437374, 0.02691297892937964] |
1,802.08369 | Missing Data Reconstruction in Remote Sensing image with a Unified
Spatial-Temporal-Spectral Deep Convolutional Neural Network | Because of the internal malfunction of satellite sensors and poor atmospheric
conditions such as thick cloud, the acquired remote sensing data often suffer
from missing information, i.e., the data usability is greatly reduced. In this
paper, a novel method of missing information reconstruction in remote sensing
images is proposed. The unified spatial-temporal-spectral framework based on a
deep convolutional neural network (STS-CNN) employs a unified deep
convolutional neural network combined with spatial-temporal-spectral
supplementary information. In addition, to address the fact that most methods
can only deal with a single missing information reconstruction task, the
proposed approach can solve three typical missing information reconstruction
tasks: 1) dead lines in Aqua MODIS band 6; 2) the Landsat ETM+ Scan Line
Corrector (SLC)-off problem; and 3) thick cloud removal. It should be noted
that the proposed model can use multi-source data (spatial, spectral, and
temporal) as the input of the unified framework. The results of both simulated
and real-data experiments demonstrate that the proposed model exhibits high
effectiveness in the three missing information reconstruction tasks listed
above.
| cs.CV | because of the internal malfunction of satellite sensors and poor atmospheric conditions such as thick cloud the acquired remote sensing data often suffer from missing information ie the data usability is greatly reduced in this paper a novel method of missing information reconstruction in remote sensing images is proposed the unified spatialtemporalspectral framework based on a deep convolutional neural network stscnn employs a unified deep convolutional neural network combined with spatialtemporalspectral supplementary information in addition to address the fact that most methods can only deal with a single missing information reconstruction task the proposed approach can solve three typical missing information reconstruction tasks 1 dead lines in aqua modis band 6 2 the landsat etm scan line corrector slcoff problem and 3 thick cloud removal it should be noted that the proposed model can use multisource data spatial spectral and temporal as the input of the unified framework the results of both simulated and realdata experiments demonstrate that the proposed model exhibits high effectiveness in the three missing information reconstruction tasks listed above | [['because', 'of', 'the', 'internal', 'malfunction', 'of', 'satellite', 'sensors', 'and', 'poor', 'atmospheric', 'conditions', 'such', 'as', 'thick', 'cloud', 'the', 'acquired', 'remote', 'sensing', 'data', 'often', 'suffer', 'from', 'missing', 'information', 'ie', 'the', 'data', 'usability', 'is', 'greatly', 'reduced', 'in', 'this', 'paper', 'a', 'novel', 'method', 'of', 'missing', 'information', 'reconstruction', 'in', 'remote', 'sensing', 'images', 'is', 'proposed', 'the', 'unified', 'spatialtemporalspectral', 'framework', 'based', 'on', 'a', 'deep', 'convolutional', 'neural', 'network', 'stscnn', 'employs', 'a', 'unified', 'deep', 'convolutional', 'neural', 'network', 'combined', 'with', 'spatialtemporalspectral', 'supplementary', 'information', 'in', 'addition', 'to', 'address', 'the', 'fact', 'that', 'most', 'methods', 'can', 'only', 'deal', 'with', 'a', 'single', 'missing', 'information', 'reconstruction', 'task', 'the', 'proposed', 'approach', 'can', 'solve', 'three', 'typical', 'missing', 'information', 'reconstruction', 'tasks', '1', 'dead', 'lines', 'in', 'aqua', 'modis', 'band', '6', '2', 'the', 'landsat', 'etm', 'scan', 'line', 'corrector', 'slcoff', 'problem', 'and', '3', 'thick', 'cloud', 'removal', 'it', 'should', 'be', 'noted', 'that', 'the', 'proposed', 'model', 'can', 'use', 'multisource', 'data', 'spatial', 'spectral', 'and', 'temporal', 'as', 'the', 'input', 'of', 'the', 'unified', 'framework', 'the', 'results', 'of', 'both', 'simulated', 'and', 'realdata', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'model', 'exhibits', 'high', 'effectiveness', 'in', 'the', 'three', 'missing', 'information', 'reconstruction', 'tasks', 'listed', 'above']] | [-0.06048141759351866, 0.003769981707914694, -0.05027077871115779, 0.07470311356237236, -0.07886022974229996, -0.17546861665598915, 0.0030987621415902436, 0.4074490940854086, -0.28516389892268484, -0.40002479468687224, 0.12815085721282102, -0.26863760323699054, -0.16763650695104482, 0.15695407800100877, -0.15123755800794017, 0.10060329619518167, 0.15478930034200777, -0.009741496658448636, -0.064976952638692, -0.22770546038343004, 0.28416623392406876, 0.07169965333298411, 0.36590424747366085, 0.03959743940056516, 0.13182921869578335, 0.009325089442168952, -0.08031604333213095, -0.011466596252836022, -0.03144027257523983, 0.14500920810893772, 0.30258725779186163, 0.19226438164388618, 0.28690147048314296, -0.444759318511382, -0.2931198823484785, 0.05425133122428811, 0.16718619711388497, 0.07044080510107283, -0.06960678860592, -0.3069735288002787, 0.09083865085043587, -0.16823169617418898, -0.00978636886571815, -0.0821560271740092, -0.08842394186373932, -0.05284370488856407, -0.2886151838758354, 0.06812989417072275, 0.03598111695692648, 0.059787912167520565, -0.0753587145639374, -0.1211908776492167, -0.030728805832256227, 0.16642006045240446, -0.018653435058087198, 0.03292082165941023, 0.15022592292340836, -0.16109427261254447, -0.12015429154567464, 0.3501614760717697, -0.04613966141281837, -0.173398380840098, 0.17855074095881418, -0.06724872835705156, -0.17141992524651997, 0.1550683917948899, 0.2108537457303348, 0.09775361903122015, -0.18366598495634923, 0.008147295203456688, -0.05272110902632658, 0.18750642775144627, 0.03270966481533144, 0.019381514569942856, 0.16307608968958523, 0.2287844677769838, 0.02342816502043217, 0.12281171924582016, -0.23263819606495284, -0.03720393364893592, -0.22283419032481958, -0.09046056627753306, -0.2296498146861483, -0.05262486133917329, -0.09709869862565793, -0.11325009355112117, 0.3811520005482629, 0.2259552850299818, 0.2197018527155797, 0.01755772330440008, 0.41195559329711473, 0.008687937399372458, 0.12410353001147872, 0.06808414500166755, 0.1877081111671414, 0.04464850877136124, 0.16452572256954906, -0.15327581805838328, 0.05184165744342395, 0.001772006874430109] |
1,802.0837 | Do WaveNets Dream of Acoustic Waves? | Various sources have reported the WaveNet deep learning architecture being
able to generate high-quality speech, but to our knowledge there haven't been
studies on the interpretation or visualization of trained WaveNets. This study
investigates the possibility that WaveNet understands speech by unsupervisedly
learning an acoustically meaningful latent representation of the speech signals
in its receptive field; we also attempt to interpret the mechanism by which the
feature extraction is performed. Suggested by singular value decomposition and
linear regression analysis on the activations and known acoustic features (e.g.
F0), the key findings are (1) activations in the higher layers are highly
correlated with spectral features; (2) WaveNet explicitly performs pitch
extraction despite being trained to directly predict the next audio sample and
(3) for the said feature analysis to take place, the latent signal
representation is converted back and forth between baseband and wideband
components.
| cs.SD cs.NE | various sources have reported the wavenet deep learning architecture being able to generate highquality speech but to our knowledge there havent been studies on the interpretation or visualization of trained wavenets this study investigates the possibility that wavenet understands speech by unsupervisedly learning an acoustically meaningful latent representation of the speech signals in its receptive field we also attempt to interpret the mechanism by which the feature extraction is performed suggested by singular value decomposition and linear regression analysis on the activations and known acoustic features eg f0 the key findings are 1 activations in the higher layers are highly correlated with spectral features 2 wavenet explicitly performs pitch extraction despite being trained to directly predict the next audio sample and 3 for the said feature analysis to take place the latent signal representation is converted back and forth between baseband and wideband components | [['various', 'sources', 'have', 'reported', 'the', 'wavenet', 'deep', 'learning', 'architecture', 'being', 'able', 'to', 'generate', 'highquality', 'speech', 'but', 'to', 'our', 'knowledge', 'there', 'havent', 'been', 'studies', 'on', 'the', 'interpretation', 'or', 'visualization', 'of', 'trained', 'wavenets', 'this', 'study', 'investigates', 'the', 'possibility', 'that', 'wavenet', 'understands', 'speech', 'by', 'unsupervisedly', 'learning', 'an', 'acoustically', 'meaningful', 'latent', 'representation', 'of', 'the', 'speech', 'signals', 'in', 'its', 'receptive', 'field', 'we', 'also', 'attempt', 'to', 'interpret', 'the', 'mechanism', 'by', 'which', 'the', 'feature', 'extraction', 'is', 'performed', 'suggested', 'by', 'singular', 'value', 'decomposition', 'and', 'linear', 'regression', 'analysis', 'on', 'the', 'activations', 'and', 'known', 'acoustic', 'features', 'eg', 'f0', 'the', 'key', 'findings', 'are', '1', 'activations', 'in', 'the', 'higher', 'layers', 'are', 'highly', 'correlated', 'with', 'spectral', 'features', '2', 'wavenet', 'explicitly', 'performs', 'pitch', 'extraction', 'despite', 'being', 'trained', 'to', 'directly', 'predict', 'the', 'next', 'audio', 'sample', 'and', '3', 'for', 'the', 'said', 'feature', 'analysis', 'to', 'take', 'place', 'the', 'latent', 'signal', 'representation', 'is', 'converted', 'back', 'and', 'forth', 'between', 'baseband', 'and', 'wideband', 'components']] | [-0.039781780187493294, 0.04802923900903503, -0.06905923521197918, 0.05297888589444079, -0.15174106925001574, -0.18572973497470635, 0.004728495937241759, 0.44597622462444836, -0.29117473151483053, -0.3103191907830478, 0.07441528760601715, -0.2894216150274992, -0.2053875247058588, 0.1688421711199529, -0.06648120939240067, 0.06748666568334254, 0.07455718394663159, 0.07024515615194105, -0.030709160325285565, -0.21382729617956406, 0.2799622608112663, 0.05718939103967892, 0.3610289687074126, -0.04487470633628416, 0.13202578942097412, -0.048252664411847945, -0.0900060544833347, -0.10531105631364174, -0.03981414227933379, 0.15622126785051982, 0.34385085579318303, 0.18163051349337264, 0.28379844118737513, -0.4223321998140111, -0.26313913114265436, 0.07439814878630892, 0.14226347749222945, 0.08418334439354819, -0.020377294459548365, -0.3536255067091487, 0.1001861918015897, -0.12010568047116976, 0.039968507433918096, -0.14397572187913787, -0.024920912038295582, -0.041251631737395655, -0.2554600632833576, 0.03409887253959217, 0.12931609442542444, 0.04782559071867985, -0.07315162883363276, -0.12662100596046205, -0.008812938279232994, 0.1598920269089932, 0.04491765303424068, 0.07172159347424491, 0.13425450752967866, -0.17401713722008733, -0.09103844880115099, 0.32582470665592056, -0.06672504922446226, -0.20275166123691532, 0.1785461540437407, -0.07162107409547186, -0.12399422618424676, 0.11913574910593322, 0.23048954823752865, 0.048936454137826026, -0.17573679429996344, -0.02517194333753044, -0.012242732052173879, 0.22694143352338061, 0.06848233368913902, -0.008279988813834885, 0.2090158951452597, 0.18859048241979004, -0.04595462614780546, 0.14957165577733475, -0.16371097618765715, -0.0178405806752077, -0.20052536502731122, -0.06970524016934279, -0.20464933355126252, -0.025309716276145384, -0.08759632221204407, -0.12340365387232548, 0.4308427912247781, 0.20549079614769047, 0.2465894807311189, 0.0844874795139832, 0.32516495770930004, 0.07866007511054501, 0.14849317418379038, 0.07179622397315041, 0.2245043469269553, 0.08336337288427684, 0.13345265971454662, -0.15238097575881207, 0.10692264601756404, 0.032795748540795304] |
1,802.08371 | Emulating topological chiral magnetic effects in artificial Weyl
semimetals | We realized highly tunable Weyl semimetal-bands and subsequently emulated the
topological chiral magnetic effects in superconducting quantum circuits.
Driving the superconducting quantum circuits with elaborately designed
microwave fields, we mapped the momentum space of a lattice to the parameter
space, realizing the Hamiltonian of a Weyl semimetal. By measuring the energy
spectrum, we directly imaged the Weyl points of cubic lattices, whose
topological winding numbers were further determined from the Berry curvature
measurement. In particular, we used an additional microwave field to produce a
momentum-dependent chemical potential, from which the chiral magnetic
topological current was extracted in the presence of an artificial magnetic
field. This pure topological current is proportional to the magnetic field,
which is in contrast to the famous Ampere's law, and may have significant
impacts on topological materials and quantum devices.
| cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.other quant-ph | we realized highly tunable weyl semimetalbands and subsequently emulated the topological chiral magnetic effects in superconducting quantum circuits driving the superconducting quantum circuits with elaborately designed microwave fields we mapped the momentum space of a lattice to the parameter space realizing the hamiltonian of a weyl semimetal by measuring the energy spectrum we directly imaged the weyl points of cubic lattices whose topological winding numbers were further determined from the berry curvature measurement in particular we used an additional microwave field to produce a momentumdependent chemical potential from which the chiral magnetic topological current was extracted in the presence of an artificial magnetic field this pure topological current is proportional to the magnetic field which is in contrast to the famous amperes law and may have significant impacts on topological materials and quantum devices | [['we', 'realized', 'highly', 'tunable', 'weyl', 'semimetalbands', 'and', 'subsequently', 'emulated', 'the', 'topological', 'chiral', 'magnetic', 'effects', 'in', 'superconducting', 'quantum', 'circuits', 'driving', 'the', 'superconducting', 'quantum', 'circuits', 'with', 'elaborately', 'designed', 'microwave', 'fields', 'we', 'mapped', 'the', 'momentum', 'space', 'of', 'a', 'lattice', 'to', 'the', 'parameter', 'space', 'realizing', 'the', 'hamiltonian', 'of', 'a', 'weyl', 'semimetal', 'by', 'measuring', 'the', 'energy', 'spectrum', 'we', 'directly', 'imaged', 'the', 'weyl', 'points', 'of', 'cubic', 'lattices', 'whose', 'topological', 'winding', 'numbers', 'were', 'further', 'determined', 'from', 'the', 'berry', 'curvature', 'measurement', 'in', 'particular', 'we', 'used', 'an', 'additional', 'microwave', 'field', 'to', 'produce', 'a', 'momentumdependent', 'chemical', 'potential', 'from', 'which', 'the', 'chiral', 'magnetic', 'topological', 'current', 'was', 'extracted', 'in', 'the', 'presence', 'of', 'an', 'artificial', 'magnetic', 'field', 'this', 'pure', 'topological', 'current', 'is', 'proportional', 'to', 'the', 'magnetic', 'field', 'which', 'is', 'in', 'contrast', 'to', 'the', 'famous', 'amperes', 'law', 'and', 'may', 'have', 'significant', 'impacts', 'on', 'topological', 'materials', 'and', 'quantum', 'devices']] | [-0.23023094386453113, 0.25767917418352904, -0.04459387912595673, -0.004111914470645863, -0.09948534264104135, -0.13488396157427177, 0.0325971388322329, 0.3520555587819041, -0.2608147080459479, -0.3048724869071548, -0.0016744643981471212, -0.27445522827137986, -0.16546349428983323, 0.2022805080762995, 0.007184658776412704, 0.07457771865084573, -0.08566953557015244, 0.01054039389353746, -0.07423716471460995, -0.23123694926764427, 0.32353288307438477, 0.0233541785212887, 0.32188639720318035, 0.046902867782958296, 0.060782035817948186, -0.049050909099442735, 0.07072534085313942, 0.06660106018447984, -0.13106801183790023, 0.08788087295451716, 0.1982757358450387, -0.07219588662386496, 0.1467324230305628, -0.46598192791579596, -0.2361597574468869, 0.10794381040092836, 0.11097920187679466, 0.14088443278355886, -0.08102087033373902, -0.35896058185999075, 0.05723065955376725, -0.13073253856429748, -0.12751875571902657, -0.12150591827317406, -0.03274294318815471, -0.033015157237263226, -0.20564079780909997, 0.011078530569811031, 0.02542495056587174, 0.09227019804182338, -0.0688707085197953, -0.05544014345965723, -0.06462527862263483, 0.08728891971465479, -0.011265544252080926, 0.07197540669368385, 0.14840466324100965, -0.15351060808483344, -0.16794755647598364, 0.3630383447205314, -0.06114619034307717, -0.15116472633224529, 0.1120078744238187, -0.141313742370164, -0.06819227345134896, 0.11364053260646205, 0.14103600529800933, 0.046642054940338, -0.11844335766439673, 0.11676703632414799, 0.011909035343325823, 0.14494356661583227, 0.024367281753542042, 0.07574596663992574, 0.2987057802166595, 0.09785492188790675, 0.04585429760427631, 0.16855259946853257, -0.12626738440672824, -0.0696247609457307, -0.2777981087773927, -0.19320580999214035, -0.29913871220848176, 0.11712825987071021, -0.06506001794636475, -0.22036993939780505, 0.4458686223795721, 0.15417363606097956, 0.16552169043431753, -0.10109730509505954, 0.2757448992316625, 0.1393412653662598, 0.13862931256446598, 0.03391331517130637, 0.2598740017361272, 0.20339933139577843, 0.13179172908734363, -0.269256113691311, -0.035929410655829885, 0.03473982083221981] |
1,802.08372 | Approximation Algorithms for D-optimal Design | Experimental design is a classical statistics problem and its aim is to
estimate an unknown $m$-dimensional vector $\beta$ from linear measurements
where a Gaussian noise is introduced in each measurement. For the combinatorial
experimental design problem, the goal is to pick $k$ out of the given $n$
experiments so as to make the most accurate estimate of the unknown parameters,
denoted as $\hat{\beta}$. In this paper, we will study one of the most robust
measures of error estimation - $D$-optimality criterion, which corresponds to
minimizing the volume of the confidence ellipsoid for the estimation error
$\beta-\hat{\beta}$. The problem gives rise to two natural variants depending
on whether repetitions of experiments are allowed or not. We first propose an
approximation algorithm with a $\frac1e$-approximation for the $D$-optimal
design problem with and without repetitions, giving the first constant factor
approximation for the problem. We then analyze another sampling approximation
algorithm and prove that it is $(1-\epsilon)$-approximation if $k\geq
\frac{4m}{\epsilon}+\frac{12}{\epsilon^2}\log(\frac{1}{\epsilon})$ for any
$\epsilon \in (0,1)$. Finally, for $D$-optimal design with repetitions, we
study a different algorithm proposed by literature and show that it can improve
this asymptotic approximation ratio.
| stat.ML cs.DS | experimental design is a classical statistics problem and its aim is to estimate an unknown mdimensional vector beta from linear measurements where a gaussian noise is introduced in each measurement for the combinatorial experimental design problem the goal is to pick k out of the given n experiments so as to make the most accurate estimate of the unknown parameters denoted as hatbeta in this paper we will study one of the most robust measures of error estimation doptimality criterion which corresponds to minimizing the volume of the confidence ellipsoid for the estimation error betahatbeta the problem gives rise to two natural variants depending on whether repetitions of experiments are allowed or not we first propose an approximation algorithm with a frac1eapproximation for the doptimal design problem with and without repetitions giving the first constant factor approximation for the problem we then analyze another sampling approximation algorithm and prove that it is 1epsilonapproximation if kgeq frac4mepsilonfrac12epsilon2logfrac1epsilon for any epsilon in 01 finally for doptimal design with repetitions we study a different algorithm proposed by literature and show that it can improve this asymptotic approximation ratio | [['experimental', 'design', 'is', 'a', 'classical', 'statistics', 'problem', 'and', 'its', 'aim', 'is', 'to', 'estimate', 'an', 'unknown', 'mdimensional', 'vector', 'beta', 'from', 'linear', 'measurements', 'where', 'a', 'gaussian', 'noise', 'is', 'introduced', 'in', 'each', 'measurement', 'for', 'the', 'combinatorial', 'experimental', 'design', 'problem', 'the', 'goal', 'is', 'to', 'pick', 'k', 'out', 'of', 'the', 'given', 'n', 'experiments', 'so', 'as', 'to', 'make', 'the', 'most', 'accurate', 'estimate', 'of', 'the', 'unknown', 'parameters', 'denoted', 'as', 'hatbeta', 'in', 'this', 'paper', 'we', 'will', 'study', 'one', 'of', 'the', 'most', 'robust', 'measures', 'of', 'error', 'estimation', 'doptimality', 'criterion', 'which', 'corresponds', 'to', 'minimizing', 'the', 'volume', 'of', 'the', 'confidence', 'ellipsoid', 'for', 'the', 'estimation', 'error', 'betahatbeta', 'the', 'problem', 'gives', 'rise', 'to', 'two', 'natural', 'variants', 'depending', 'on', 'whether', 'repetitions', 'of', 'experiments', 'are', 'allowed', 'or', 'not', 'we', 'first', 'propose', 'an', 'approximation', 'algorithm', 'with', 'a', 'frac1eapproximation', 'for', 'the', 'doptimal', 'design', 'problem', 'with', 'and', 'without', 'repetitions', 'giving', 'the', 'first', 'constant', 'factor', 'approximation', 'for', 'the', 'problem', 'we', 'then', 'analyze', 'another', 'sampling', 'approximation', 'algorithm', 'and', 'prove', 'that', 'it', 'is', '1epsilonapproximation', 'if', 'kgeq', 'frac4mepsilonfrac12epsilon2logfrac1epsilon', 'for', 'any', 'epsilon', 'in', '01', 'finally', 'for', 'doptimal', 'design', 'with', 'repetitions', 'we', 'study', 'a', 'different', 'algorithm', 'proposed', 'by', 'literature', 'and', 'show', 'that', 'it', 'can', 'improve', 'this', 'asymptotic', 'approximation', 'ratio']] | [-0.09096084652816529, 0.0556353634777594, -0.06794876567149473, 0.05003594480017405, -0.08273564356604365, -0.17126416873473388, 0.08416680393517939, 0.37655729413605654, -0.2753353133595518, -0.3151167621887238, 0.1248828871751327, -0.24772364381639347, -0.18240293391256154, 0.1904705582112381, -0.08812482752402283, 0.09800418848421291, 0.04541542262586018, 0.06631012260913849, -0.0804852729715304, -0.2740373804379807, 0.2802061510661228, 0.05992434109506136, 0.2367863034903696, 0.019563731499487064, 0.12615290215071182, 0.00868586423310482, -0.021843690141155333, 0.005497671956078733, -0.18105237523087744, 0.10100927241952516, 0.26099242407388495, 0.1663359491126407, 0.3209078777376767, -0.3421030883513555, -0.14857002867099184, 0.17807435793264842, 0.13831982051040262, 0.10052172099892562, -0.013463589504161584, -0.2174454332728471, 0.1293927895667666, -0.10823912653978658, -0.08940684349419406, -0.06122951007161576, 0.015669089773267503, -0.014797450588238273, -0.36431986509290126, 0.03826032397030228, 0.05168379456250018, -0.0032701783834004797, -0.05709053512347944, -0.1480551739517538, 0.09756798956896291, 0.11456067458045884, 0.04001371394510248, 0.056115665406520875, 0.06909484227423321, -0.08463749491384479, -0.13234080573298282, 0.37494572764774275, -0.048295337723754855, -0.2563229101456722, 0.10299808303006812, -0.09506523411894975, -0.13399437694825683, 0.11276925064157695, 0.18624692948859384, 0.12430446603140988, -0.132408870870227, 0.06990938270234268, -0.06312783488717216, 0.18135211663832376, 0.05115424782027501, -0.011070944371397842, 0.11195032823073504, 0.17829789401794488, 0.15088456216943705, 0.16853279007853336, -0.09734936612581445, -0.05049710317033824, -0.31419920937700585, -0.14175235947322518, -0.20730201980024884, 0.02640355725340599, -0.11185177926269646, -0.17364688129368966, 0.36302246059198956, 0.18317491865997038, 0.21259226494949762, 0.10767614007300626, 0.3165384384529706, 0.1204288293240377, -0.025370502615460082, 0.08765899278076396, 0.20468806358729744, 0.1251237645481744, -0.007858049909962894, -0.19858671053425297, 0.09772342981279387, 0.07663648852382551] |
1,802.08373 | Dirac-Phase Thermal Leptogenesis in the extended Type-I Seesaw Model | Motivated by the fact that the Dirac phase in the PMNS matrix is the only
CP-violating parameter in the leptonic sector that can be measured in neutrino
oscillation experiments, we examine the possibility that it is the dominant
source of CP violation for leptogenesis caused by the out-of-equilibrium decays
of heavy singlet fermions. We do so within a low-scale extended type-I seesaw
model, featuring two Standard Model singlet fermions per family, in which
lepton number is approximately conserved such that the heavy singlet neutrinos
are pseudo-Dirac. We find that this produces a predictive model of
leptogenesis. Our results show that for low-scale thermal leptogenesis, a pure
inverse-seesaw scenario fails to produce the required asymmetry, even
accounting for resonance effects, because wash-out processes are too efficient.
Dirac-phase leptogenesis is, however, possible when the linear seesaw term is
switched on, with the aid of the resonance contributions naturally present in
the model. Degenerate and hierarchical spectra are considered -- both can
achieve Dirac-phase leptogenesis, although the latter is more constrained.
Finally, although unable to probe the parameter space of Dirac-phase
leptogenesis, the contributions to unitarity violation of the PMNS matrix,
collider constraints and charged-lepton flavour-violating processes are
calculated and we further estimate the impact of the future experiments MEG-II
and COMET for such models.
| hep-ph | motivated by the fact that the dirac phase in the pmns matrix is the only cpviolating parameter in the leptonic sector that can be measured in neutrino oscillation experiments we examine the possibility that it is the dominant source of cp violation for leptogenesis caused by the outofequilibrium decays of heavy singlet fermions we do so within a lowscale extended typei seesaw model featuring two standard model singlet fermions per family in which lepton number is approximately conserved such that the heavy singlet neutrinos are pseudodirac we find that this produces a predictive model of leptogenesis our results show that for lowscale thermal leptogenesis a pure inverseseesaw scenario fails to produce the required asymmetry even accounting for resonance effects because washout processes are too efficient diracphase leptogenesis is however possible when the linear seesaw term is switched on with the aid of the resonance contributions naturally present in the model degenerate and hierarchical spectra are considered both can achieve diracphase leptogenesis although the latter is more constrained finally although unable to probe the parameter space of diracphase leptogenesis the contributions to unitarity violation of the pmns matrix collider constraints and chargedlepton flavourviolating processes are calculated and we further estimate the impact of the future experiments megii and comet for such models | [['motivated', 'by', 'the', 'fact', 'that', 'the', 'dirac', 'phase', 'in', 'the', 'pmns', 'matrix', 'is', 'the', 'only', 'cpviolating', 'parameter', 'in', 'the', 'leptonic', 'sector', 'that', 'can', 'be', 'measured', 'in', 'neutrino', 'oscillation', 'experiments', 'we', 'examine', 'the', 'possibility', 'that', 'it', 'is', 'the', 'dominant', 'source', 'of', 'cp', 'violation', 'for', 'leptogenesis', 'caused', 'by', 'the', 'outofequilibrium', 'decays', 'of', 'heavy', 'singlet', 'fermions', 'we', 'do', 'so', 'within', 'a', 'lowscale', 'extended', 'typei', 'seesaw', 'model', 'featuring', 'two', 'standard', 'model', 'singlet', 'fermions', 'per', 'family', 'in', 'which', 'lepton', 'number', 'is', 'approximately', 'conserved', 'such', 'that', 'the', 'heavy', 'singlet', 'neutrinos', 'are', 'pseudodirac', 'we', 'find', 'that', 'this', 'produces', 'a', 'predictive', 'model', 'of', 'leptogenesis', 'our', 'results', 'show', 'that', 'for', 'lowscale', 'thermal', 'leptogenesis', 'a', 'pure', 'inverseseesaw', 'scenario', 'fails', 'to', 'produce', 'the', 'required', 'asymmetry', 'even', 'accounting', 'for', 'resonance', 'effects', 'because', 'washout', 'processes', 'are', 'too', 'efficient', 'diracphase', 'leptogenesis', 'is', 'however', 'possible', 'when', 'the', 'linear', 'seesaw', 'term', 'is', 'switched', 'on', 'with', 'the', 'aid', 'of', 'the', 'resonance', 'contributions', 'naturally', 'present', 'in', 'the', 'model', 'degenerate', 'and', 'hierarchical', 'spectra', 'are', 'considered', 'both', 'can', 'achieve', 'diracphase', 'leptogenesis', 'although', 'the', 'latter', 'is', 'more', 'constrained', 'finally', 'although', 'unable', 'to', 'probe', 'the', 'parameter', 'space', 'of', 'diracphase', 'leptogenesis', 'the', 'contributions', 'to', 'unitarity', 'violation', 'of', 'the', 'pmns', 'matrix', 'collider', 'constraints', 'and', 'chargedlepton', 'flavourviolating', 'processes', 'are', 'calculated', 'and', 'we', 'further', 'estimate', 'the', 'impact', 'of', 'the', 'future', 'experiments', 'megii', 'and', 'comet', 'for', 'such', 'models']] | [-0.10073885447273949, 0.2769147602673532, -0.020069352267265885, 0.1820960613944175, -0.08342002658835519, -0.19965878358304995, 0.04599373609266769, 0.3115143136428095, -0.24468789273272687, -0.2740527680309233, 0.060624257221465416, -0.28073327811170035, -0.0778813248434572, 0.13258327427044317, 0.042009601989646234, 0.037228421045476086, 0.057795507330182606, -0.04827675210108972, -0.05907752785817345, -0.2299669376890047, 0.2873179274721521, 0.05529816887977034, 0.2176799924571897, 0.08425301344076533, 0.04559502559515396, -0.07473175451645, 0.009639332971924042, -0.07402812656507854, -0.048190376226764316, 0.04217558127488076, 0.20502296128604128, 0.10668927073253592, 0.10804542785695803, -0.41105700513762883, -0.20328972719927535, 0.2036142771141118, 0.1721676129017961, 0.1079858993414582, -0.09791867900839775, -0.2716431098932762, 0.06338169755523371, -0.23120615958408297, -0.09487411995104986, -0.11090283536780361, -0.06348671277728973, -0.1440552266858633, -0.38923967286494177, 0.12576078033622054, -0.019467825297336868, -0.056777870827641394, 0.004468180570239422, -0.1513973702775906, -0.041484801413191226, 0.006080816628580242, 0.14965989718421127, -0.08146766594377174, 0.12030732446191258, -0.15292567609460644, -0.12409353411648316, 0.43722325172887727, -0.08366600928140663, -0.1601952046411933, 0.11643167539782187, -0.16456053766391077, -0.15523371927471064, 0.08443323528433827, 0.14144971278237875, 0.0817890518730599, -0.17180334416945559, 0.1586038118909153, -0.07814235094343246, 0.14572418139700147, 0.016328099946231002, 0.04137663403581122, 0.2619794956127058, 0.19434954313466424, 0.04984133193927036, 0.03744327012776128, -0.08411579050004518, -0.09257479302361123, -0.40023312150716994, -0.10203813405205955, -0.12062279917068021, 0.026625504534055978, -0.06734253690380523, -0.10045987520349252, 0.4248877893267456, 0.17371804567971996, 0.20753168285563942, 0.005141422545903702, 0.2930017844288305, 0.11158812271433295, 0.0821809321549507, 0.012728558874993046, 0.32597246631467935, 0.11702280288663697, 0.08633645896919036, -0.2967674448932808, 0.0687746658655859, 0.029493328350512268] |
1,802.08374 | Universal sums of $m$-gonal numbers | In this paper we study universal quadratic polynomials which arise as sums of
polygonal numbers. Specifically, we determine an asymptotic upper bound (as a
function of $m$) on the size of the set $S_m\subset\mathbb{N}$ such that if a
sum of $m$-gonal numbers represents $S_m$, then it represents $\mathbb{N}$.
| math.NT | in this paper we study universal quadratic polynomials which arise as sums of polygonal numbers specifically we determine an asymptotic upper bound as a function of m on the size of the set s_msubsetmathbbn such that if a sum of mgonal numbers represents s_m then it represents mathbbn | [['in', 'this', 'paper', 'we', 'study', 'universal', 'quadratic', 'polynomials', 'which', 'arise', 'as', 'sums', 'of', 'polygonal', 'numbers', 'specifically', 'we', 'determine', 'an', 'asymptotic', 'upper', 'bound', 'as', 'a', 'function', 'of', 'm', 'on', 'the', 'size', 'of', 'the', 'set', 's_msubsetmathbbn', 'such', 'that', 'if', 'a', 'sum', 'of', 'mgonal', 'numbers', 'represents', 's_m', 'then', 'it', 'represents', 'mathbbn']] | [-0.21307696857826508, 0.13792413454583322, -0.07089463148781276, 0.03334741916339052, -0.04117256131498737, -0.0650678085599174, 0.08504075103469114, 0.2587152576430681, -0.3050290225271849, -0.2659728897022123, 0.07426031993731777, -0.2722796104214293, -0.20812267136383564, 0.20898627166319242, -0.06684460333409778, 0.0025709457497330424, -0.011687856910631378, 0.11657987297215361, -0.059677533245586015, -0.2517581823618805, 0.3345270122133909, -0.05591432278619168, 0.1778549278511646, 0.04170280026192678, 0.105875415985096, 0.003634885300267884, 0.018871092405962818, 0.008955790205521787, -0.2051297950595828, 0.09900315627059404, 0.24120739027065166, 0.1622688867290445, 0.2682029301340276, -0.35242760472713, -0.08621042064252368, 0.24069421952392192, 0.18845633387644875, 0.0006163949270712886, 0.01940426027075328, -0.1434093014327215, 0.1004323273961571, -0.1759637526850751, -0.15757998218759894, -0.038947583200964836, 0.0951690183595774, 0.0733362903095227, -0.3358707147392821, 0.011077223831113982, 0.0952683011604909, 0.051832253781538655, 8.858413623764794e-05, -0.17917071506777343, 0.005699028563190331, 0.107864881271219, 0.031233334874219084, 0.03803311487996673, 0.03944953571648357, -0.087144883344584, -0.07086734883140455, 0.3492826667237789, -0.07193212269835095, -0.2411500146572894, 0.08157111488361941, -0.16742482702148723, -0.18655911773601744, 0.06233582962700661, 0.19384932892020554, 0.18594097451584296, -0.059063489687569595, 0.14380929999529046, -0.21173690933179348, 0.11927775765194538, 0.14421387841092778, 0.06801157176217183, 0.17974555484474974, 0.11058378391998246, 0.0935797087768925, 0.2220079984436644, -0.03976001484973475, -0.03183578335224314, -0.37850988727617774, -0.2001995355091454, -0.2558329091110128, 0.14001769195756616, -0.1294158260001147, -0.2591006026424943, 0.33169676601252657, 0.07564186645632094, 0.23566391955109986, 0.15916142933952443, 0.24389081052009096, 0.16784943185004833, 0.016603215161631716, 0.05980783229337094, 0.0892383586491478, 0.15005392995861142, -0.057072448504573485, -0.1611141674121485, 0.02499840600772741, 0.15083226591269386] |
1,802.08375 | Reusing Weights in Subword-aware Neural Language Models | We propose several ways of reusing subword embeddings and other weights in
subword-aware neural language models. The proposed techniques do not benefit a
competitive character-aware model, but some of them improve the performance of
syllable- and morpheme-aware models while showing significant reductions in
model sizes. We discover a simple hands-on principle: in a multi-layer input
embedding model, layers should be tied consecutively bottom-up if reused at
output. Our best morpheme-aware model with properly reused weights beats the
competitive word-level model by a large margin across multiple languages and
has 20%-87% fewer parameters.
| cs.CL cs.NE stat.ML | we propose several ways of reusing subword embeddings and other weights in subwordaware neural language models the proposed techniques do not benefit a competitive characteraware model but some of them improve the performance of syllable and morphemeaware models while showing significant reductions in model sizes we discover a simple handson principle in a multilayer input embedding model layers should be tied consecutively bottomup if reused at output our best morphemeaware model with properly reused weights beats the competitive wordlevel model by a large margin across multiple languages and has 2087 fewer parameters | [['we', 'propose', 'several', 'ways', 'of', 'reusing', 'subword', 'embeddings', 'and', 'other', 'weights', 'in', 'subwordaware', 'neural', 'language', 'models', 'the', 'proposed', 'techniques', 'do', 'not', 'benefit', 'a', 'competitive', 'characteraware', 'model', 'but', 'some', 'of', 'them', 'improve', 'the', 'performance', 'of', 'syllable', 'and', 'morphemeaware', 'models', 'while', 'showing', 'significant', 'reductions', 'in', 'model', 'sizes', 'we', 'discover', 'a', 'simple', 'handson', 'principle', 'in', 'a', 'multilayer', 'input', 'embedding', 'model', 'layers', 'should', 'be', 'tied', 'consecutively', 'bottomup', 'if', 'reused', 'at', 'output', 'our', 'best', 'morphemeaware', 'model', 'with', 'properly', 'reused', 'weights', 'beats', 'the', 'competitive', 'wordlevel', 'model', 'by', 'a', 'large', 'margin', 'across', 'multiple', 'languages', 'and', 'has', '2087', 'fewer', 'parameters']] | [-0.025621893535776253, 0.04761496861203668, -0.033577606877249276, 0.08906703932064303, -0.11755978260607866, -0.2474652041859004, 0.107097153112376, 0.4612695395611645, -0.3307114830973108, -0.32852767038242786, 0.011745055071392169, -0.2610398419619946, -0.1675369848779748, 0.18739513453655993, -0.114986083051713, 0.0638182924411605, 0.1705656484229846, 0.032317098387087996, -0.04302334283175093, -0.33813417349219993, 0.24938866629505926, 0.022141550929191407, 0.3156739036667715, -0.02143043949362937, 0.09287805223688378, -0.08337304868808623, -0.013206500717009722, 0.003973957496496399, -0.04391933675185683, 0.16330761835502272, 0.29694301125783473, 0.1848698239564226, 0.2904498160115621, -0.4377605028952775, -0.2672692724095469, 0.10391270883611581, 0.1459609865095843, 0.12469229314298358, 0.028010623874875268, -0.272232195056368, 0.09312076641121105, -0.22471786737755944, 0.041161619456422126, -0.11663065549362911, -0.06754513026811601, 0.004059434674151786, -0.2776570179763909, -0.010028567677886967, 0.1391294915543011, 0.0289273158296566, -0.03127299373435757, -0.1763522490280879, -0.013012600615306685, 0.1637118427145682, -0.006213651333014701, 0.035474874769871156, 0.07579682046401032, -0.1594854167772436, -0.1800271657954776, 0.3263858231935608, -0.08486557164846846, -0.2510534968368416, 0.22594637746054136, -0.03408231421405177, -0.15498662495127555, 0.05890083098993375, 0.1944004953420313, 0.08127076365053654, -0.14799383851919282, 0.02839771023849444, -0.05252997441154517, 0.2521214274103554, 0.0857707630801067, 0.0007767671656407667, 0.21725486122919352, 0.23504802928400342, -0.027277361400153362, 0.14406861408726113, -0.04013412254286951, -0.03998782683367935, -0.19238091129979662, -0.08170427186309956, -0.13519915597764462, -0.06795227712296928, -0.15959774839297444, -0.11874825123362662, 0.4418873361029317, 0.2090987743590069, 0.2252551032376758, 0.14422236314125808, 0.32925546476931383, 0.016649392408611817, 0.17789185704307608, 0.10176760559441166, 0.17191169269970263, -0.021035082567629686, 0.08676158861267601, -0.12145248795153175, 0.12886543215901244, 0.07101131609923551] |
1,802.08376 | LQG Control and Sensing Co-Design | We investigate a Linear-Quadratic-Gaussian (LQG) control and sensing
co-design problem, where one jointly designs sensing and control policies. We
focus on the realistic case where the sensing design is selected among a finite
set of available sensors, where each sensor is associated with a different cost
(e.g., power consumption). We consider two dual problem instances:
sensing-constrained LQG control, where one maximizes control performance
subject to a sensor cost budget, and minimum-sensing LQG control, where one
minimizes sensor cost subject to performance constraints. We prove no
polynomial time algorithm guarantees across all problem instances a constant
approximation factor from the optimal. Nonetheless, we present the first
polynomial time algorithms with per-instance suboptimality guarantees. To this
end, we leverage a separation principle, that partially decouples the design of
sensing and control. Then, we frame LQG co-design as the optimization of
approximately supermodular set functions; we develop novel algorithms to solve
the problems; and we prove original results on the performance of the
algorithms, and establish connections between their suboptimality and
control-theoretic quantities. We conclude the paper by discussing two
applications, namely, sensing-constrained formation control and
resource-constrained robot navigation.
| math.OC cs.MA cs.RO cs.SY eess.SY math.DS | we investigate a linearquadraticgaussian lqg control and sensing codesign problem where one jointly designs sensing and control policies we focus on the realistic case where the sensing design is selected among a finite set of available sensors where each sensor is associated with a different cost eg power consumption we consider two dual problem instances sensingconstrained lqg control where one maximizes control performance subject to a sensor cost budget and minimumsensing lqg control where one minimizes sensor cost subject to performance constraints we prove no polynomial time algorithm guarantees across all problem instances a constant approximation factor from the optimal nonetheless we present the first polynomial time algorithms with perinstance suboptimality guarantees to this end we leverage a separation principle that partially decouples the design of sensing and control then we frame lqg codesign as the optimization of approximately supermodular set functions we develop novel algorithms to solve the problems and we prove original results on the performance of the algorithms and establish connections between their suboptimality and controltheoretic quantities we conclude the paper by discussing two applications namely sensingconstrained formation control and resourceconstrained robot navigation | [['we', 'investigate', 'a', 'linearquadraticgaussian', 'lqg', 'control', 'and', 'sensing', 'codesign', 'problem', 'where', 'one', 'jointly', 'designs', 'sensing', 'and', 'control', 'policies', 'we', 'focus', 'on', 'the', 'realistic', 'case', 'where', 'the', 'sensing', 'design', 'is', 'selected', 'among', 'a', 'finite', 'set', 'of', 'available', 'sensors', 'where', 'each', 'sensor', 'is', 'associated', 'with', 'a', 'different', 'cost', 'eg', 'power', 'consumption', 'we', 'consider', 'two', 'dual', 'problem', 'instances', 'sensingconstrained', 'lqg', 'control', 'where', 'one', 'maximizes', 'control', 'performance', 'subject', 'to', 'a', 'sensor', 'cost', 'budget', 'and', 'minimumsensing', 'lqg', 'control', 'where', 'one', 'minimizes', 'sensor', 'cost', 'subject', 'to', 'performance', 'constraints', 'we', 'prove', 'no', 'polynomial', 'time', 'algorithm', 'guarantees', 'across', 'all', 'problem', 'instances', 'a', 'constant', 'approximation', 'factor', 'from', 'the', 'optimal', 'nonetheless', 'we', 'present', 'the', 'first', 'polynomial', 'time', 'algorithms', 'with', 'perinstance', 'suboptimality', 'guarantees', 'to', 'this', 'end', 'we', 'leverage', 'a', 'separation', 'principle', 'that', 'partially', 'decouples', 'the', 'design', 'of', 'sensing', 'and', 'control', 'then', 'we', 'frame', 'lqg', 'codesign', 'as', 'the', 'optimization', 'of', 'approximately', 'supermodular', 'set', 'functions', 'we', 'develop', 'novel', 'algorithms', 'to', 'solve', 'the', 'problems', 'and', 'we', 'prove', 'original', 'results', 'on', 'the', 'performance', 'of', 'the', 'algorithms', 'and', 'establish', 'connections', 'between', 'their', 'suboptimality', 'and', 'controltheoretic', 'quantities', 'we', 'conclude', 'the', 'paper', 'by', 'discussing', 'two', 'applications', 'namely', 'sensingconstrained', 'formation', 'control', 'and', 'resourceconstrained', 'robot', 'navigation']] | [-0.15961156615238586, 0.008448785372279785, -0.03641517249508635, 0.008358152588904912, -0.1056522246626382, -0.2129379996904046, 0.07901306212187519, 0.40298139358291757, -0.3314003380569252, -0.3158885938291614, 0.14059137126078478, -0.2332416877452586, -0.18601678462598373, 0.17423029395474776, -0.1662597083184566, 0.13367028571287723, 0.046985267550760025, 0.02013857170838762, -0.06219985204012561, -0.265485699186605, 0.2710424796243928, 0.02758998946488105, 0.2937525516526925, 0.016234361795618865, 0.18647718619353867, 0.03299668922617629, 0.01700943319907261, 0.04188026164633197, -0.1407426885180128, 0.12334306718517296, 0.31168123553632887, 0.2014609034525583, 0.3830863687184614, -0.4163205357218111, -0.16553495689421086, 0.13303882130295844, 0.09186181359746606, 0.06497906842646567, -0.07056190886887143, -0.23002194623160804, 0.08459592609716629, -0.13593458451733395, -0.02275179941175707, -0.016387020139420103, -0.05671853990973653, 5.705133080482483e-05, -0.33090116684199183, -0.02528162189331409, -0.013251440608370546, 0.005263750189663591, -0.12495463828782777, -0.09736418980047912, 0.08202677300904651, 0.15659853716355723, 0.00023597767702429682, -0.010097694110653891, 0.1779128470986679, -0.11165256753337344, -0.18538841256192207, 0.3891248679594011, 0.029523403182424402, -0.23689135844643053, 0.14349678213884298, -0.044251711100239205, -0.16534421147426237, 0.046294495594259855, 0.2484072746759331, 0.13733438398324055, -0.16976904617874203, 0.09838900537154562, -0.025545791138869685, 0.1751417830687117, 0.03628590981274642, 0.07187300414237119, 0.11606768231486549, 0.19421341410252846, 0.22442687344611498, 0.19113526537989242, -0.039930876586397455, -0.13758256421298595, -0.2766660480130766, -0.09818858858701345, -0.15650570004033176, 0.00541499669890146, -0.10596137772930937, -0.10960201408613372, 0.37781204252025563, 0.1773695389362606, 0.1726160549067867, 0.162631294240615, 0.36537415195961254, 0.0992139158778308, 0.015895109679046514, 0.15650504453208397, 0.20733485565067747, 0.07339734002268193, 0.08366697355098016, -0.2530339264096944, 0.04826971410043739, 0.0456006990242246] |
1,802.08377 | Chiral force of guided light on an atom | We calculate the force of a near-resonant guided light field of an ultrathin
optical fiber on a two-level atom. We show that, if the atomic dipole rotates
in the meridional plane, the magnitude of the force of the guided light depends
on the field propagation direction. The chirality of the force arises as a
consequence of the directional dependencies of the Rabi frequency of the guided
driving field and the spontaneous emission from the atom. This provides a
unique method for controlling atomic motion in the vicinity of an ultrathin
fiber.
| quant-ph | we calculate the force of a nearresonant guided light field of an ultrathin optical fiber on a twolevel atom we show that if the atomic dipole rotates in the meridional plane the magnitude of the force of the guided light depends on the field propagation direction the chirality of the force arises as a consequence of the directional dependencies of the rabi frequency of the guided driving field and the spontaneous emission from the atom this provides a unique method for controlling atomic motion in the vicinity of an ultrathin fiber | [['we', 'calculate', 'the', 'force', 'of', 'a', 'nearresonant', 'guided', 'light', 'field', 'of', 'an', 'ultrathin', 'optical', 'fiber', 'on', 'a', 'twolevel', 'atom', 'we', 'show', 'that', 'if', 'the', 'atomic', 'dipole', 'rotates', 'in', 'the', 'meridional', 'plane', 'the', 'magnitude', 'of', 'the', 'force', 'of', 'the', 'guided', 'light', 'depends', 'on', 'the', 'field', 'propagation', 'direction', 'the', 'chirality', 'of', 'the', 'force', 'arises', 'as', 'a', 'consequence', 'of', 'the', 'directional', 'dependencies', 'of', 'the', 'rabi', 'frequency', 'of', 'the', 'guided', 'driving', 'field', 'and', 'the', 'spontaneous', 'emission', 'from', 'the', 'atom', 'this', 'provides', 'a', 'unique', 'method', 'for', 'controlling', 'atomic', 'motion', 'in', 'the', 'vicinity', 'of', 'an', 'ultrathin', 'fiber']] | [-0.1999131618681681, 0.18573840669961392, -0.05725295905146625, -0.033190055848815694, -0.06367596669716168, -0.04546239065354342, 0.04730377493907217, 0.41688205919914195, -0.2939126961711016, -0.23541224442146064, -0.02035434331532547, -0.2362953894004062, -0.13226076461129135, 0.24544800959199994, 0.01933251774695876, -0.010710898551393996, -0.01163433279309954, 0.038713475034295855, 0.005765632188950594, -0.10542803725923647, 0.30525796693637147, 0.021012105979025364, 0.3069818581423753, 0.06125487045354241, 0.15498013504791064, 0.06673930768066874, 0.04761016972690493, -0.017209452546232348, -0.09386373682315065, 0.1534395353193139, 0.1035748769831076, 0.023377928238075513, 0.24880130439587347, -0.45846941563618054, -0.1798204133123323, 0.057706462656874416, 0.15031056330989595, 0.19374028612746969, -0.08714402073247174, -0.2963915476063778, -0.044523117112016286, -0.07749580635924588, -0.19799749114151513, -0.008513230574573134, 0.00821782906596027, 0.08763655161505544, -0.2603149929257867, 0.01860186845514473, 0.08324956950593412, 0.11266120619416892, -0.07984326159642947, -0.011996671035476438, -0.04002986301586114, 0.0827427620150067, 0.05217215722774739, 0.0849450336011884, 0.23999150671515163, -0.16751698352611408, -0.09680144293336096, 0.4283572827557941, -0.1551311140775087, -0.1336261132875314, 0.1045752384566835, -0.16168931058120586, -0.010427639080252458, 0.16255642138012164, 0.15888378864338437, 0.12178913305339577, -0.08203763167174268, 0.04492108310396261, -0.04267095195661698, 0.21533655186930856, 0.12020137732091186, 0.05583128161666976, 0.2491684685164428, 0.1838733478971235, 0.07877003499767282, 0.15141696773551322, -0.19586908372866174, -0.050851414583950906, -0.28908286217067924, -0.18175365650581177, -0.20974653647255645, 0.05144767592671317, -0.08958057566929051, -0.16981269804259333, 0.44895072067463465, 0.13594945813887394, 0.16423443774436855, -0.06635148601176646, 0.342383472187506, 0.14635342095369616, 0.05239367112261499, 0.008495178905182652, 0.3766124596061942, 0.18515184297543633, 0.07968367428447191, -0.3196388556811304, 0.0048061011123706355, 0.007862075510854414] |
1,802.08378 | Multi-Scale Spectrum Sensing in Dense Multi-Cell Cognitive Networks | Multi-scale spectrum sensing is proposed to overcome the cost of full network
state information on the spectrum occupancy of primary users (PUs) in dense
multi-cell cognitive networks. Secondary users (SUs) estimate the local
spectrum occupancies and aggregate them hierarchically to estimate spectrum
occupancy at multiple spatial scales. Thus, SUs obtain fine-grained estimates
of spectrum occupancies of nearby cells, more relevant to scheduling tasks, and
coarse-grained estimates of those of distant cells. An agglomerative clustering
algorithm is proposed to design a cost-effective aggregation tree, matched to
the structure of interference, robust to local estimation errors and delays.
Given these multi-scale estimates, the SU traffic is adapted in a decentralized
fashion in each cell, to optimize the trade-off among SU cell throughput,
interference caused to PUs, and mutual SU interference. Numerical evaluations
demonstrate a small degradation in SU cell throughput (up to 15% for a 0dB
interference-to-noise ratio experienced at PUs) compared to a scheme with full
network state information, using only one-third of the cost incurred in the
exchange of spectrum estimates. The proposed interference-matched design is
shown to significantly outperform a random tree design, by providing more
relevant information for network control, and a state-of-the-art
consensus-based algorithm, which does not leverage the spatio-temporal
structure of interference across the network.
| cs.IT math.IT | multiscale spectrum sensing is proposed to overcome the cost of full network state information on the spectrum occupancy of primary users pus in dense multicell cognitive networks secondary users sus estimate the local spectrum occupancies and aggregate them hierarchically to estimate spectrum occupancy at multiple spatial scales thus sus obtain finegrained estimates of spectrum occupancies of nearby cells more relevant to scheduling tasks and coarsegrained estimates of those of distant cells an agglomerative clustering algorithm is proposed to design a costeffective aggregation tree matched to the structure of interference robust to local estimation errors and delays given these multiscale estimates the su traffic is adapted in a decentralized fashion in each cell to optimize the tradeoff among su cell throughput interference caused to pus and mutual su interference numerical evaluations demonstrate a small degradation in su cell throughput up to 15 for a 0db interferencetonoise ratio experienced at pus compared to a scheme with full network state information using only onethird of the cost incurred in the exchange of spectrum estimates the proposed interferencematched design is shown to significantly outperform a random tree design by providing more relevant information for network control and a stateoftheart consensusbased algorithm which does not leverage the spatiotemporal structure of interference across the network | [['multiscale', 'spectrum', 'sensing', 'is', 'proposed', 'to', 'overcome', 'the', 'cost', 'of', 'full', 'network', 'state', 'information', 'on', 'the', 'spectrum', 'occupancy', 'of', 'primary', 'users', 'pus', 'in', 'dense', 'multicell', 'cognitive', 'networks', 'secondary', 'users', 'sus', 'estimate', 'the', 'local', 'spectrum', 'occupancies', 'and', 'aggregate', 'them', 'hierarchically', 'to', 'estimate', 'spectrum', 'occupancy', 'at', 'multiple', 'spatial', 'scales', 'thus', 'sus', 'obtain', 'finegrained', 'estimates', 'of', 'spectrum', 'occupancies', 'of', 'nearby', 'cells', 'more', 'relevant', 'to', 'scheduling', 'tasks', 'and', 'coarsegrained', 'estimates', 'of', 'those', 'of', 'distant', 'cells', 'an', 'agglomerative', 'clustering', 'algorithm', 'is', 'proposed', 'to', 'design', 'a', 'costeffective', 'aggregation', 'tree', 'matched', 'to', 'the', 'structure', 'of', 'interference', 'robust', 'to', 'local', 'estimation', 'errors', 'and', 'delays', 'given', 'these', 'multiscale', 'estimates', 'the', 'su', 'traffic', 'is', 'adapted', 'in', 'a', 'decentralized', 'fashion', 'in', 'each', 'cell', 'to', 'optimize', 'the', 'tradeoff', 'among', 'su', 'cell', 'throughput', 'interference', 'caused', 'to', 'pus', 'and', 'mutual', 'su', 'interference', 'numerical', 'evaluations', 'demonstrate', 'a', 'small', 'degradation', 'in', 'su', 'cell', 'throughput', 'up', 'to', '15', 'for', 'a', '0db', 'interferencetonoise', 'ratio', 'experienced', 'at', 'pus', 'compared', 'to', 'a', 'scheme', 'with', 'full', 'network', 'state', 'information', 'using', 'only', 'onethird', 'of', 'the', 'cost', 'incurred', 'in', 'the', 'exchange', 'of', 'spectrum', 'estimates', 'the', 'proposed', 'interferencematched', 'design', 'is', 'shown', 'to', 'significantly', 'outperform', 'a', 'random', 'tree', 'design', 'by', 'providing', 'more', 'relevant', 'information', 'for', 'network', 'control', 'and', 'a', 'stateoftheart', 'consensusbased', 'algorithm', 'which', 'does', 'not', 'leverage', 'the', 'spatiotemporal', 'structure', 'of', 'interference', 'across', 'the', 'network']] | [-0.18199697310662416, 0.009720875172556239, -0.041004152981958426, 0.0635902299965472, -0.07341218302966669, -0.20882346941009297, 0.1468985481254864, 0.39974908195738235, -0.2968033529110611, -0.33190704527973697, 0.02999763845526524, -0.26417629592246017, -0.1766306133476274, 0.09561782537807281, -0.14835475765329859, 0.049765492499808224, 0.08914570703256267, 0.05352661069907928, -0.00896311646311705, -0.25691105653934826, 0.24124040781301714, 0.1703225379572429, 0.3693479896711114, -0.019327121150966447, 0.07987648717356094, 0.0294489046198298, -0.052503869434496246, -0.03036480252005556, -0.08030332597823311, 0.14198552253051624, 0.31122346510640525, 0.16899602737248642, 0.2867268101030137, -0.40020236160713607, -0.2652405052615974, 0.08269224660650182, 0.17748803702348737, 0.05095928723424619, 0.0033229555521337227, -0.2868239526332428, 0.13931280732280216, -0.20670848762361296, -0.01315395904552693, -0.040062037021226175, -0.09717266354933739, 0.017100860490105473, -0.37478363594597724, 0.05749763305245254, -0.026264311394278102, -0.011714961222773686, -0.06864476251715902, -0.09059464616718917, -0.029527123329339353, 0.22054946072659312, 0.003698537970754282, -0.03429558588350819, 0.15733666423609696, -0.10080782108287586, -0.13383501631995806, 0.3607927712146193, 0.01489680528315008, -0.1918546102667908, 0.1725878989135918, -0.10496053991776605, -0.11485965044434684, 0.20895889134576115, 0.24215933156217664, 0.06809916870126752, -0.2001763654905237, -0.025249655055421708, 0.0389517421538655, 0.20027796453814517, 0.0849659373063612, 0.11555291858474867, 0.13522047987610747, 0.21133562732855074, 0.17382446281352223, 0.07713566153016962, -0.11374725529472365, -0.10200712469052703, -0.16062425256201934, -0.08440232196769032, -0.21632369138163854, -0.00871815329439694, -0.11887228781716448, -0.10444676812529416, 0.3892860545350826, 0.11561925086089804, 0.17069518095992792, 0.12559253587810068, 0.38385917549469295, 0.0649497890956879, 0.07166669106943747, 0.11832438692307243, 0.14685204218123823, 0.08739834304455704, 0.14673210618527194, -0.27311269230379437, 0.07343201755653493, 0.01803761963450457] |
1,802.08379 | EmotionLines: An Emotion Corpus of Multi-Party Conversations | Feeling emotion is a critical characteristic to distinguish people from
machines. Among all the multi-modal resources for emotion detection, textual
datasets are those containing the least additional information in addition to
semantics, and hence are adopted widely for testing the developed systems.
However, most of the textual emotional datasets consist of emotion labels of
only individual words, sentences or documents, which makes it challenging to
discuss the contextual flow of emotions. In this paper, we introduce
EmotionLines, the first dataset with emotions labeling on all utterances in
each dialogue only based on their textual content. Dialogues in EmotionLines
are collected from Friends TV scripts and private Facebook messenger dialogues.
Then one of seven emotions, six Ekman's basic emotions plus the neutral
emotion, is labeled on each utterance by 5 Amazon MTurkers. A total of 29,245
utterances from 2,000 dialogues are labeled in EmotionLines. We also provide
several strong baselines for emotion detection models on EmotionLines in this
paper.
| cs.CL | feeling emotion is a critical characteristic to distinguish people from machines among all the multimodal resources for emotion detection textual datasets are those containing the least additional information in addition to semantics and hence are adopted widely for testing the developed systems however most of the textual emotional datasets consist of emotion labels of only individual words sentences or documents which makes it challenging to discuss the contextual flow of emotions in this paper we introduce emotionlines the first dataset with emotions labeling on all utterances in each dialogue only based on their textual content dialogues in emotionlines are collected from friends tv scripts and private facebook messenger dialogues then one of seven emotions six ekmans basic emotions plus the neutral emotion is labeled on each utterance by 5 amazon mturkers a total of 29245 utterances from 2000 dialogues are labeled in emotionlines we also provide several strong baselines for emotion detection models on emotionlines in this paper | [['feeling', 'emotion', 'is', 'a', 'critical', 'characteristic', 'to', 'distinguish', 'people', 'from', 'machines', 'among', 'all', 'the', 'multimodal', 'resources', 'for', 'emotion', 'detection', 'textual', 'datasets', 'are', 'those', 'containing', 'the', 'least', 'additional', 'information', 'in', 'addition', 'to', 'semantics', 'and', 'hence', 'are', 'adopted', 'widely', 'for', 'testing', 'the', 'developed', 'systems', 'however', 'most', 'of', 'the', 'textual', 'emotional', 'datasets', 'consist', 'of', 'emotion', 'labels', 'of', 'only', 'individual', 'words', 'sentences', 'or', 'documents', 'which', 'makes', 'it', 'challenging', 'to', 'discuss', 'the', 'contextual', 'flow', 'of', 'emotions', 'in', 'this', 'paper', 'we', 'introduce', 'emotionlines', 'the', 'first', 'dataset', 'with', 'emotions', 'labeling', 'on', 'all', 'utterances', 'in', 'each', 'dialogue', 'only', 'based', 'on', 'their', 'textual', 'content', 'dialogues', 'in', 'emotionlines', 'are', 'collected', 'from', 'friends', 'tv', 'scripts', 'and', 'private', 'facebook', 'messenger', 'dialogues', 'then', 'one', 'of', 'seven', 'emotions', 'six', 'ekmans', 'basic', 'emotions', 'plus', 'the', 'neutral', 'emotion', 'is', 'labeled', 'on', 'each', 'utterance', 'by', '5', 'amazon', 'mturkers', 'a', 'total', 'of', '29245', 'utterances', 'from', '2000', 'dialogues', 'are', 'labeled', 'in', 'emotionlines', 'we', 'also', 'provide', 'several', 'strong', 'baselines', 'for', 'emotion', 'detection', 'models', 'on', 'emotionlines', 'in', 'this', 'paper']] | [-0.06125050593161573, 0.05952361771442856, -0.008026013082156006, 0.1266539598030086, -0.17728747645518383, -0.17854337524085379, 0.05341926596622962, 0.4466530232427594, -0.19050299559901945, -0.3466666776071995, 0.03444213052548898, -0.41204529352939856, -0.14110160051719645, 0.15367085095502447, -0.1342019630679622, -0.019158177399404872, 0.10430105545152074, 0.1778640689521219, 0.044095093002304055, -0.3293779931040123, 0.33968353093577885, -0.04144148203806999, 0.2867959711405162, 0.03106970292999624, 0.11002807364536402, -0.04672313975532187, -0.0923820091978623, -0.05831550139014442, -0.0010903114572358436, 0.20473010117600027, 0.40540561167544625, 0.26488258106669843, 0.33372316052181983, -0.373218713214812, -0.16444604735349855, 0.052459228556985274, 0.09872078642440148, 0.10381832401244304, 0.0036548232385076773, -0.41555402339257014, 0.0686241441946596, -0.20508615274966593, 0.12703996104373333, -0.10131219800752707, 0.06701386413083245, -0.01066860536677548, -0.2275236918552158, 0.044570792005031716, 0.04674967105436222, 0.19522113455623652, -0.06352394160617572, -0.12865591439633414, -0.0051499145547262365, 0.22557088567200714, 0.09828312796442053, -0.014627342022065885, 0.1454360574716702, -0.2117430571293554, -0.17916860970823714, 0.39813036549215514, -0.051412327044930026, -0.19899723615992862, 0.2406477361980181, -0.043209678338219724, -0.16407545630891734, 0.06550233386373386, 0.23496923540742734, 0.11676490400285007, -0.22005327975896832, -0.054236839184737526, -0.11086292016821411, 0.27455063358259696, 0.13491824882713935, 0.0001769609128435453, 0.2005312462002994, 0.19442883629399615, -0.0382613131734662, 0.10972177561593409, -0.06007003735822554, -0.009614438152848145, -0.19976807165613325, -0.12541636978634274, -0.1468842291401532, -0.028923758430979572, -0.06920688776340402, -0.1313347392864764, 0.3971628240781287, 0.23637392598156554, 0.16650226561483952, 0.09592299938249664, 0.3163704665449376, -0.04501687746065167, 0.09912520684809305, 0.07963502743484405, 0.10856722473190764, -0.06321816745614155, 0.1579353260846498, -0.11245978946233383, 0.12123471758334348, 0.05328187942695177] |
1,802.0838 | On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problems | We study the non-stationary stochastic multiarmed bandit (MAB) problem and
propose two generic algorithms, namely, the limited memory deterministic
sequencing of exploration and exploitation (LM-DSEE) and the Sliding-Window
Upper Confidence Bound# (SW-UCB#). We rigorously analyze these algorithms in
abruptly-changing and slowly-varying environments and characterize their
performance. We show that the expected cumulative regret for these algorithms
under either of the environments is upper bounded by sublinear functions of
time, i.e., the time average of the regret asymptotically converges to zero. We
complement our analytic results with numerical illustrations.
| stat.ML cs.LG | we study the nonstationary stochastic multiarmed bandit mab problem and propose two generic algorithms namely the limited memory deterministic sequencing of exploration and exploitation lmdsee and the slidingwindow upper confidence bound swucb we rigorously analyze these algorithms in abruptlychanging and slowlyvarying environments and characterize their performance we show that the expected cumulative regret for these algorithms under either of the environments is upper bounded by sublinear functions of time ie the time average of the regret asymptotically converges to zero we complement our analytic results with numerical illustrations | [['we', 'study', 'the', 'nonstationary', 'stochastic', 'multiarmed', 'bandit', 'mab', 'problem', 'and', 'propose', 'two', 'generic', 'algorithms', 'namely', 'the', 'limited', 'memory', 'deterministic', 'sequencing', 'of', 'exploration', 'and', 'exploitation', 'lmdsee', 'and', 'the', 'slidingwindow', 'upper', 'confidence', 'bound', 'swucb', 'we', 'rigorously', 'analyze', 'these', 'algorithms', 'in', 'abruptlychanging', 'and', 'slowlyvarying', 'environments', 'and', 'characterize', 'their', 'performance', 'we', 'show', 'that', 'the', 'expected', 'cumulative', 'regret', 'for', 'these', 'algorithms', 'under', 'either', 'of', 'the', 'environments', 'is', 'upper', 'bounded', 'by', 'sublinear', 'functions', 'of', 'time', 'ie', 'the', 'time', 'average', 'of', 'the', 'regret', 'asymptotically', 'converges', 'to', 'zero', 'we', 'complement', 'our', 'analytic', 'results', 'with', 'numerical', 'illustrations']] | [-0.12884473504827304, 0.05029510628322468, -0.06009354528094477, 0.1275346459560644, -0.06292039138429305, -0.13919250336201752, 0.15189534668975016, 0.42980164739796345, -0.2635106657001683, -0.30215083552004, 0.13862597159630455, -0.23657312388257945, -0.18618895071832572, 0.19261457047918262, -0.10947560426806484, 0.13300233519471744, 0.04003844615072012, 0.009536542820141596, -0.039291261845980495, -0.2990739006110851, 0.2680718531749923, 0.05134075489716933, 0.27040443348643534, -0.0012445200378458727, 0.10973946666618918, -0.028323906265637452, -0.043768976919133874, 0.020763758008423096, -0.19573058126646656, 0.08367488249342012, 0.2760926837430281, 0.20315357835908585, 0.33915862863992946, -0.4271388093995697, -0.132661126981325, 0.1664019230643616, 0.14999347968978863, 0.060849639828152516, -0.05866627777543138, -0.3047067164059947, 0.06925163438324543, -0.10617536379791358, -0.036057036412496336, -0.08351800224798567, -0.049541873501285034, 0.05622141927425914, -0.3209906554068713, 0.06255744266159394, 0.087745462478522, -0.023913454686921527, -0.09496331905042205, -0.14797348065630478, 0.09386636899400722, 0.10352962589000954, 0.06667372458066573, -0.010355526622494353, 0.11075447772574776, -0.13020035038592623, -0.20868332037044798, 0.29336558748036623, -0.10891581749653115, -0.20092225890497076, 0.21986229362733223, -0.13535361185341196, -0.11429923215114018, 0.09373525373418541, 0.2708094211671885, 0.18451826573513885, -0.15083932277253445, 0.15098704151905087, -0.05886442147414474, 0.11319315298186505, 0.049074083095525994, 0.07281118721755989, 0.05983068890705266, 0.1861499128589297, 0.16417084374629398, 0.18173116944346795, -0.05846926927128259, -0.1700620892293313, -0.2734248445424087, -0.11167940403786762, -0.17363842629334506, 0.0025415930842213772, -0.1804045945233049, -0.16023288833744387, 0.3374400997685049, 0.1777114187641179, 0.1636784766745918, 0.2552768123226569, 0.3522536979659515, 0.14182303328313592, -0.04890849665081238, 0.1979507934411659, 0.19401185717159772, 0.04926446822800619, 0.04459691733149264, -0.23864703075960278, 0.13056646697223187, 0.032702343774486935] |
1,802.08381 | K-stability of birationally superrigid Fano varieties | We prove that every birationally superrigid Fano variety whose alpha
invariant is greater than (resp. no smaller than) $\frac{1}{2}$ is K-stable
(resp. K-semistable). We also prove that the alpha invariant of a birationally
superrigid Fano variety of dimension $n$ is at least $\frac{1}{n+1}$ (under
mild assumptions) and that the moduli space (if exists) of birationally
superrigid Fano varieties is separated.
| math.AG math.DG | we prove that every birationally superrigid fano variety whose alpha invariant is greater than resp no smaller than frac12 is kstable resp ksemistable we also prove that the alpha invariant of a birationally superrigid fano variety of dimension n is at least frac1n1 under mild assumptions and that the moduli space if exists of birationally superrigid fano varieties is separated | [['we', 'prove', 'that', 'every', 'birationally', 'superrigid', 'fano', 'variety', 'whose', 'alpha', 'invariant', 'is', 'greater', 'than', 'resp', 'no', 'smaller', 'than', 'frac12', 'is', 'kstable', 'resp', 'ksemistable', 'we', 'also', 'prove', 'that', 'the', 'alpha', 'invariant', 'of', 'a', 'birationally', 'superrigid', 'fano', 'variety', 'of', 'dimension', 'n', 'is', 'at', 'least', 'frac1n1', 'under', 'mild', 'assumptions', 'and', 'that', 'the', 'moduli', 'space', 'if', 'exists', 'of', 'birationally', 'superrigid', 'fano', 'varieties', 'is', 'separated']] | [-0.2531971670066317, 0.11565419241475562, -0.07959316581642877, 0.12102903802103053, -0.03190883282416811, -0.33651369852789986, -0.08876250415535954, 0.3711134081706405, -0.2534153188268344, -0.11907041774441798, 0.0361178566973346, -0.31169154512075087, -0.1782903258727553, 0.23476533672461908, -0.16807236132832865, -0.0889539536399146, 0.015266752677659194, 0.08669355183374136, -0.11346394691693908, -0.3886244929706057, 0.45289835162305586, -0.14108417716731006, 0.19621792642089228, 0.06092253440195539, 0.1895810746277372, -0.02403026386164129, 0.12150759169210991, 0.00864105892784816, -0.22239597355740745, 0.08374208909614632, 0.2811566132431229, 0.06609270924624676, 0.18001658283174038, -0.22071842725611834, -0.10279289896716363, 0.35444325059652326, 0.1417906847782433, -0.03816426900836329, 0.09384638945339248, -0.19889586254333455, 0.2610108983547737, -0.052559343290825684, -0.22245441260747612, -0.07558022298229237, 0.1495763840774695, -0.05501172343889872, -0.23907664137271542, -0.03270019280850344, 0.15799040929608357, 0.16304870837678512, 0.03161453977227211, -0.16481308680959045, -0.17373786960573245, -0.07775113209499977, -0.0026495614477122825, 0.10362853870416681, 0.12814436636302465, -0.0665841862404098, -0.062354298603410525, 0.3735914119131242, -0.07880328843457392, -0.2479572826375564, 0.07857713744354745, -0.23511611863505094, -0.13901881923278173, 0.2936902765650302, 0.013315263018012048, 0.2005347742388646, 0.06717751766555011, 0.20107774240799092, -0.1716543666863193, 0.18146386651787907, 0.18885310501791536, 0.032493534201057626, 0.004810995065296689, 0.06333109329765042, 0.22194952329155057, 0.05175472802172105, 0.011079438682645559, 0.04572357917204499, -0.39381778159489234, -0.14789154982815186, -0.10395827429213872, 0.2893380023539066, -0.12384181811915672, -0.1371034632533944, 0.294751232295918, -0.027250201701341816, 0.21547118065257867, 0.11900487455228964, 0.22724929053608017, 0.02989069326625516, 0.002223238061803083, 0.12545675514265894, 0.15218740096315742, 0.15984981295963127, -0.16630275663919747, -0.08772771298730125, 0.03169818176732709, 0.1268540470705678] |
1,802.08382 | Inverse Doppler Effects in Pipe Instruments | Music is older than language, and for most of human history music holds our
culture together. The pipe instrument is one of the most popular musical
instruments of all time. Built on the foundation of previous flute and
flute-like acoustic metamaterial models, we herein report the experimental
results of the inverse Doppler effects discovered in two common pipe
instruments - recorder and clarinet. Our study shows that the inverse Doppler
effects can be detected at all seven pitches of an ascending musical scale when
there is a relative motion between a microphone (observer) and abovementioned
two pipe instruments (source). The calculated effective refractive indices of
these two pipe instruments are negative and varying across a set of pitches,
exhibiting a desired characteristic of broadband acoustic metamaterials. This
study suggests that recorder and clarinet may be the earliest man-made acoustic
metamaterials known so far, offering a new explanation why pipe instruments
have enjoyed wide popularity in Europe and Asia over the past hundreds and
thousands years. This newly discovered phenomenon would also offer a clue into
designing next-generation smart broadband double-negative acoustic
metamaterials with varying refractive index.
| physics.app-ph | music is older than language and for most of human history music holds our culture together the pipe instrument is one of the most popular musical instruments of all time built on the foundation of previous flute and flutelike acoustic metamaterial models we herein report the experimental results of the inverse doppler effects discovered in two common pipe instruments recorder and clarinet our study shows that the inverse doppler effects can be detected at all seven pitches of an ascending musical scale when there is a relative motion between a microphone observer and abovementioned two pipe instruments source the calculated effective refractive indices of these two pipe instruments are negative and varying across a set of pitches exhibiting a desired characteristic of broadband acoustic metamaterials this study suggests that recorder and clarinet may be the earliest manmade acoustic metamaterials known so far offering a new explanation why pipe instruments have enjoyed wide popularity in europe and asia over the past hundreds and thousands years this newly discovered phenomenon would also offer a clue into designing nextgeneration smart broadband doublenegative acoustic metamaterials with varying refractive index | [['music', 'is', 'older', 'than', 'language', 'and', 'for', 'most', 'of', 'human', 'history', 'music', 'holds', 'our', 'culture', 'together', 'the', 'pipe', 'instrument', 'is', 'one', 'of', 'the', 'most', 'popular', 'musical', 'instruments', 'of', 'all', 'time', 'built', 'on', 'the', 'foundation', 'of', 'previous', 'flute', 'and', 'flutelike', 'acoustic', 'metamaterial', 'models', 'we', 'herein', 'report', 'the', 'experimental', 'results', 'of', 'the', 'inverse', 'doppler', 'effects', 'discovered', 'in', 'two', 'common', 'pipe', 'instruments', 'recorder', 'and', 'clarinet', 'our', 'study', 'shows', 'that', 'the', 'inverse', 'doppler', 'effects', 'can', 'be', 'detected', 'at', 'all', 'seven', 'pitches', 'of', 'an', 'ascending', 'musical', 'scale', 'when', 'there', 'is', 'a', 'relative', 'motion', 'between', 'a', 'microphone', 'observer', 'and', 'abovementioned', 'two', 'pipe', 'instruments', 'source', 'the', 'calculated', 'effective', 'refractive', 'indices', 'of', 'these', 'two', 'pipe', 'instruments', 'are', 'negative', 'and', 'varying', 'across', 'a', 'set', 'of', 'pitches', 'exhibiting', 'a', 'desired', 'characteristic', 'of', 'broadband', 'acoustic', 'metamaterials', 'this', 'study', 'suggests', 'that', 'recorder', 'and', 'clarinet', 'may', 'be', 'the', 'earliest', 'manmade', 'acoustic', 'metamaterials', 'known', 'so', 'far', 'offering', 'a', 'new', 'explanation', 'why', 'pipe', 'instruments', 'have', 'enjoyed', 'wide', 'popularity', 'in', 'europe', 'and', 'asia', 'over', 'the', 'past', 'hundreds', 'and', 'thousands', 'years', 'this', 'newly', 'discovered', 'phenomenon', 'would', 'also', 'offer', 'a', 'clue', 'into', 'designing', 'nextgeneration', 'smart', 'broadband', 'doublenegative', 'acoustic', 'metamaterials', 'with', 'varying', 'refractive', 'index']] | [-0.12470862436284487, 0.16914311918198774, -0.07942781368572567, 0.04117350340663531, -0.16462197008265836, -0.15874310436539, -0.041338267952606485, 0.43959647404986457, -0.223225908689956, -0.34219889400929615, 0.10681721859208837, -0.29309093354118837, -0.168136915448751, 0.2918989848241688, -0.06122281703896619, 0.05309316620004137, 0.0644082843149836, -0.01789330403773567, 0.016154198751256274, -0.1532980084922668, 0.2385414847953094, 0.0696485618955292, 0.29859431801565195, 0.006998160692888337, 0.11621452904419621, -0.061645276740435635, -0.07374641986916194, 0.01771018682173579, -0.0729516517958522, 0.1243527012131479, 0.29996659106386564, 0.11389469712519565, 0.28947848184789354, -0.4034600711050066, -0.26044457741144644, 0.061275646146512715, 0.1405338698091942, 0.050441529173907394, -0.059550790691974796, -0.2930763242212502, 0.05490097065733091, -0.1699904158132503, -0.12668580585536923, 0.0174039061703543, 0.03723015984256022, 0.013889734353870153, -0.17386600221192616, 0.003256653942092246, 0.019723745907626957, 0.13227123788281067, -0.07432842170316223, -0.149668376089854, 0.039630807192392044, 0.16480605774637738, 0.04519597899949027, -0.03173144879134221, 0.12298544698073906, -0.11133099961774172, -0.11662973107367351, 0.3809084802010172, -0.05652295285061071, -0.09067520663870586, 0.17733470666650178, -0.1660340515846336, -0.0720701635009735, 0.1212997830825279, 0.18020707205743403, 0.0669615835328964, -0.14594040421581814, -0.03435982949276631, -0.05036757507619473, 0.2135547862853855, 0.14881487650343694, 0.05229392474819277, 0.28087531395659254, 0.2139340036051549, 0.012125825752957245, 0.11642874850816018, -0.11820079124960545, 0.00022924929555203464, -0.22978265020190863, -0.1370784214924316, -0.13708957885769574, 0.023413661642100764, -0.11153336093270194, -0.18057899489067494, 0.41880570923959887, 0.1487145020909658, 0.12768354686480518, 0.014647274196141626, 0.3064278639299241, 0.016519808241345517, 0.11366366554528311, 0.03030283077796166, 0.28204598301719574, 0.058489195193239564, 0.19292200880464971, -0.15903874050473443, 0.07255982378296352, -0.010970184562029316] |
1,802.08383 | A role of asymmetry in linear response of globally coupled oscillator
systems | The linear response is studied in globally coupled oscillator systems
including the Kuramoto model. We develop a linear response theory which can be
applied to systems whose coupling functions are generic. Based on the theory,
we examine the role of asymmetry introduced to the natural frequency
distribution, the coupling function, or the coupling constants. A remarkable
difference appears in coexistence of the divergence of susceptibility at the
critical point and a nonzero phase gap between the order parameter and the
applied external force. The coexistence is not allowed by the asymmetry in the
natural frequency distribution but can be realized by the other two types of
asymmetry. This theoretical prediction and the coupling-constant dependence of
the susceptibility are numerically verified by performing simulations in
$N$-body systems and in reduced systems obtained with the aid of the
Ott-Antonsen ansatz.
| nlin.AO cond-mat.stat-mech | the linear response is studied in globally coupled oscillator systems including the kuramoto model we develop a linear response theory which can be applied to systems whose coupling functions are generic based on the theory we examine the role of asymmetry introduced to the natural frequency distribution the coupling function or the coupling constants a remarkable difference appears in coexistence of the divergence of susceptibility at the critical point and a nonzero phase gap between the order parameter and the applied external force the coexistence is not allowed by the asymmetry in the natural frequency distribution but can be realized by the other two types of asymmetry this theoretical prediction and the couplingconstant dependence of the susceptibility are numerically verified by performing simulations in nbody systems and in reduced systems obtained with the aid of the ottantonsen ansatz | [['the', 'linear', 'response', 'is', 'studied', 'in', 'globally', 'coupled', 'oscillator', 'systems', 'including', 'the', 'kuramoto', 'model', 'we', 'develop', 'a', 'linear', 'response', 'theory', 'which', 'can', 'be', 'applied', 'to', 'systems', 'whose', 'coupling', 'functions', 'are', 'generic', 'based', 'on', 'the', 'theory', 'we', 'examine', 'the', 'role', 'of', 'asymmetry', 'introduced', 'to', 'the', 'natural', 'frequency', 'distribution', 'the', 'coupling', 'function', 'or', 'the', 'coupling', 'constants', 'a', 'remarkable', 'difference', 'appears', 'in', 'coexistence', 'of', 'the', 'divergence', 'of', 'susceptibility', 'at', 'the', 'critical', 'point', 'and', 'a', 'nonzero', 'phase', 'gap', 'between', 'the', 'order', 'parameter', 'and', 'the', 'applied', 'external', 'force', 'the', 'coexistence', 'is', 'not', 'allowed', 'by', 'the', 'asymmetry', 'in', 'the', 'natural', 'frequency', 'distribution', 'but', 'can', 'be', 'realized', 'by', 'the', 'other', 'two', 'types', 'of', 'asymmetry', 'this', 'theoretical', 'prediction', 'and', 'the', 'couplingconstant', 'dependence', 'of', 'the', 'susceptibility', 'are', 'numerically', 'verified', 'by', 'performing', 'simulations', 'in', 'nbody', 'systems', 'and', 'in', 'reduced', 'systems', 'obtained', 'with', 'the', 'aid', 'of', 'the', 'ottantonsen', 'ansatz']] | [-0.18138226342178287, 0.13675312554224164, -0.0872144860913977, 0.03874008934286868, -0.025526740588247776, -0.11902238886492948, 0.03976808411180568, 0.32121656853975594, -0.2772706326475178, -0.2894374181287012, 0.07750282933230282, -0.26093240726091294, -0.16651527135990615, 0.16707730859828493, 0.04069480557075661, 0.06994814269474127, -0.024250615092898734, 0.03426410971651026, -0.07263972633855714, -0.1911212091352723, 0.3311563391859333, 0.035046665387673544, 0.307820800266674, 0.04057202812797134, 0.07305139857951713, 0.0010255723820486362, 0.02560967052746834, 0.058698837277546954, -0.11535168820452216, 0.0871580030998566, 0.21998991514218674, 0.02765034277504985, 0.22138496364156404, -0.4022803344507364, -0.23283358823939942, 0.10542369854258563, 0.1300910884494205, 0.11222229029332031, -0.034903940941254354, -0.26962876502522337, 0.02249029199457795, -0.1655093340837545, -0.15229176435926658, -0.1022242283431916, -0.009320117755914513, 0.04737448901700639, -0.3006754119583554, 0.11811140394580645, 0.015398554156358907, 0.07936566878461103, -0.05257073101634835, -0.07890094507593608, -0.03172161857145366, 0.12194891650469272, 0.03919417138356526, 0.01757955866649855, 0.09689789385858762, -0.11752050665065485, -0.09662183310939472, 0.38054844274765987, -0.09865247639506866, -0.22692537620879602, 0.1766203651795218, -0.1555541871888293, -0.07192900712412877, 0.08144272336284157, 0.15188140636714903, 0.10047569516135137, -0.13523303376733448, 0.09781602325012395, 0.027914615871006812, 0.18342633910272169, 0.028285704438399145, -0.005480521496898238, 0.21529145478068487, 0.15037545488904352, 0.017140714832973004, 0.1537742535166098, -0.04675886081616003, -0.1503466036444044, -0.2801550985313952, -0.07938013879744255, -0.1854300180490574, 0.009154529768093726, -0.09048201433894143, -0.1330709816766498, 0.43023533214464027, 0.14542833201425232, 0.1958603767350829, 0.012960878653836477, 0.2566984051355984, 0.19855120639060286, 0.07690491366362118, 0.014392691259474857, 0.3011185005509659, 0.16423477889106108, 0.09320161727500027, -0.2980548391941989, 0.07073195090355433, 0.03829395384662717] |
1,802.08384 | Quantum improved measurement of time transfer | Accurate time transfer has become a crucial issue for future space
experiments which require increasing resolution over large distances. In 2008,
a scheme combining homodyne detection and mode-locked femtosecond lasers was
proposed that leads to a potential timing precision reaching the yoctosecond
range; with a multimode quantum frequency comb as the input field, the sub-shot
noise measurement for the time transfer can further improve the timing
precision. Based on this scheme and applying the multimode squeezing frequency
comb that was measured to have a phase quadrature quantum noise reduction of
1.5 dB at the analyzing frequency 2MHz, the measurable timing fluctuation was
reduced from a shot-noise limited value of 8.9E-23s to 7.5E-23s. To our
knowledge, this is the first experimental demonstration of the time transfer
measurement that achieves a precision beyond the standard quantum limit (SQL).
| quant-ph | accurate time transfer has become a crucial issue for future space experiments which require increasing resolution over large distances in 2008 a scheme combining homodyne detection and modelocked femtosecond lasers was proposed that leads to a potential timing precision reaching the yoctosecond range with a multimode quantum frequency comb as the input field the subshot noise measurement for the time transfer can further improve the timing precision based on this scheme and applying the multimode squeezing frequency comb that was measured to have a phase quadrature quantum noise reduction of 15 db at the analyzing frequency 2mhz the measurable timing fluctuation was reduced from a shotnoise limited value of 89e23s to 75e23s to our knowledge this is the first experimental demonstration of the time transfer measurement that achieves a precision beyond the standard quantum limit sql | [['accurate', 'time', 'transfer', 'has', 'become', 'a', 'crucial', 'issue', 'for', 'future', 'space', 'experiments', 'which', 'require', 'increasing', 'resolution', 'over', 'large', 'distances', 'in', '2008', 'a', 'scheme', 'combining', 'homodyne', 'detection', 'and', 'modelocked', 'femtosecond', 'lasers', 'was', 'proposed', 'that', 'leads', 'to', 'a', 'potential', 'timing', 'precision', 'reaching', 'the', 'yoctosecond', 'range', 'with', 'a', 'multimode', 'quantum', 'frequency', 'comb', 'as', 'the', 'input', 'field', 'the', 'subshot', 'noise', 'measurement', 'for', 'the', 'time', 'transfer', 'can', 'further', 'improve', 'the', 'timing', 'precision', 'based', 'on', 'this', 'scheme', 'and', 'applying', 'the', 'multimode', 'squeezing', 'frequency', 'comb', 'that', 'was', 'measured', 'to', 'have', 'a', 'phase', 'quadrature', 'quantum', 'noise', 'reduction', 'of', '15', 'db', 'at', 'the', 'analyzing', 'frequency', '2mhz', 'the', 'measurable', 'timing', 'fluctuation', 'was', 'reduced', 'from', 'a', 'shotnoise', 'limited', 'value', 'of', '89e23s', 'to', '75e23s', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'experimental', 'demonstration', 'of', 'the', 'time', 'transfer', 'measurement', 'that', 'achieves', 'a', 'precision', 'beyond', 'the', 'standard', 'quantum', 'limit', 'sql']] | [-0.11277745406789733, 0.14783524999867625, -0.08037929480057905, -0.014903758844506662, -0.03300379159679608, -0.15024644365436884, 0.11510281934604438, 0.4103267655443789, -0.24214807515199394, -0.3149231792976663, 0.11660503736721463, -0.2338572907775863, -0.04654408756768637, 0.2947034409874355, -0.08178591505110042, 0.13169050814389294, 0.11210445714454208, -0.0006191056193922882, -0.05004320396006163, -0.18957043569813023, 0.21886870770110511, 0.14751247088025227, 0.3323361849162116, 0.016460519562016673, 0.1591426927401726, 0.003370501438100169, -0.023045745236910324, -0.04957924602547167, -0.07829892908720562, 0.09598952824764176, 0.2686175883177723, 0.07841703647038718, 0.2823372695596329, -0.3340817147365479, -0.26300677840959336, 0.11073005442340761, 0.11540156789992784, 0.16992424316130883, -0.03134582285446101, -0.30938293581911874, 0.05745666959356002, -0.1834423440445993, -0.06686909308434645, -0.11188027015956703, 0.0026765844981019287, 0.01028648364260348, -0.28682834570645355, 0.07086766021041227, 0.04760305570619209, 0.05078058655081845, 0.021847297588438005, -0.06212834520404464, 0.04918943707129237, 0.13198285735101065, -0.08064884606118092, 0.06316320946328897, 0.14009035210152948, -0.10559642130383916, -0.15418300208628677, 0.3311387683480366, -0.1248771521443529, -0.11601935460843812, 0.11807510698971742, -0.17776682743899969, -0.04145782787714209, 0.16870579308371492, 0.14672583378043458, 0.0660112874631061, -0.10912573775502422, 0.03770980649582569, 0.0531557402782031, 0.3128222786654621, 0.1551590567965533, 0.12108272188794869, 0.18666789504880113, 0.24117000982662273, 0.07152671085100677, 0.08823185386883317, -0.18858417599468924, -0.07627266036423007, -0.26216618054018204, -0.11230414913028544, -0.2232409133019843, 0.08617566688743823, -0.09048859797632704, -0.0852679600748025, 0.4051834691696303, 0.21339130532274495, 0.13606283404176303, 0.04539502198102453, 0.3705645637836919, 0.1874941999419356, 0.0668557608871957, -0.013692927939483701, 0.3075814588245616, 0.1437480537283387, 0.14932665464063452, -0.24918025145272432, 0.01220351959745497, -0.037548446960038326] |
1,802.08385 | Chaotic Excitation and Tidal Damping in the GJ 876 System | The M-dwarf GJ 876 is the closest known star to harbor a multi-planetary
system. With three outer planets locked in a chaotic Laplace-type resonance and
an appreciably eccentric short-period Super-Earth, this system represents a
unique exposition of extrasolar planetary dynamics. A key question that
concerns the long-term evolution of this system, and the fate of close-in
planets in general, is how the significant eccentricity of the inner-most
planet is maintained against tidal circularization on timescales comparable to
the age of the universe. Here, we employ stochastic secular perturbation theory
and N-body simulations to show that the orbit of the inner-most planet is
shaped by a delicate balance between extrinsic chaotic forcing and tidal
dissipation. As such, the planet's orbital eccentricity represents an indirect
measure of its tidal quality factor. Based on the system's present-day
architecture, we estimate that the extrasolar Super-Earth GJ 876d has a tidal
Q~10,000-100,000 - a value characteristic of solar system gas giants.
| astro-ph.EP | the mdwarf gj 876 is the closest known star to harbor a multiplanetary system with three outer planets locked in a chaotic laplacetype resonance and an appreciably eccentric shortperiod superearth this system represents a unique exposition of extrasolar planetary dynamics a key question that concerns the longterm evolution of this system and the fate of closein planets in general is how the significant eccentricity of the innermost planet is maintained against tidal circularization on timescales comparable to the age of the universe here we employ stochastic secular perturbation theory and nbody simulations to show that the orbit of the innermost planet is shaped by a delicate balance between extrinsic chaotic forcing and tidal dissipation as such the planets orbital eccentricity represents an indirect measure of its tidal quality factor based on the systems presentday architecture we estimate that the extrasolar superearth gj 876d has a tidal q10000100000 a value characteristic of solar system gas giants | [['the', 'mdwarf', 'gj', '876', 'is', 'the', 'closest', 'known', 'star', 'to', 'harbor', 'a', 'multiplanetary', 'system', 'with', 'three', 'outer', 'planets', 'locked', 'in', 'a', 'chaotic', 'laplacetype', 'resonance', 'and', 'an', 'appreciably', 'eccentric', 'shortperiod', 'superearth', 'this', 'system', 'represents', 'a', 'unique', 'exposition', 'of', 'extrasolar', 'planetary', 'dynamics', 'a', 'key', 'question', 'that', 'concerns', 'the', 'longterm', 'evolution', 'of', 'this', 'system', 'and', 'the', 'fate', 'of', 'closein', 'planets', 'in', 'general', 'is', 'how', 'the', 'significant', 'eccentricity', 'of', 'the', 'innermost', 'planet', 'is', 'maintained', 'against', 'tidal', 'circularization', 'on', 'timescales', 'comparable', 'to', 'the', 'age', 'of', 'the', 'universe', 'here', 'we', 'employ', 'stochastic', 'secular', 'perturbation', 'theory', 'and', 'nbody', 'simulations', 'to', 'show', 'that', 'the', 'orbit', 'of', 'the', 'innermost', 'planet', 'is', 'shaped', 'by', 'a', 'delicate', 'balance', 'between', 'extrinsic', 'chaotic', 'forcing', 'and', 'tidal', 'dissipation', 'as', 'such', 'the', 'planets', 'orbital', 'eccentricity', 'represents', 'an', 'indirect', 'measure', 'of', 'its', 'tidal', 'quality', 'factor', 'based', 'on', 'the', 'systems', 'presentday', 'architecture', 'we', 'estimate', 'that', 'the', 'extrasolar', 'superearth', 'gj', '876d', 'has', 'a', 'tidal', 'q10000100000', 'a', 'value', 'characteristic', 'of', 'solar', 'system', 'gas', 'giants']] | [-0.21216911026133017, 0.11821907044289325, -0.11163777789983947, 0.07601219129766786, -0.11747092731272826, -0.03969316129790401, 0.030336223089880033, 0.2767040491370218, -0.1979934206147763, -0.30498225437235327, 0.0476270873026239, -0.2422637445065979, -0.16824972978755287, 0.21300827688839916, -0.12375167401676829, 0.0574906072394118, 0.18083278952595813, -0.025714129554228735, -0.00660072621290705, -0.26748165924876155, 0.3098366633692587, 0.08052486260935615, -0.0550488891252377, -0.04693666711909237, 0.05885033107547138, -0.07101671242868746, 0.04892281356703054, -0.11352147509089926, -0.21818548062881085, 0.04025408603982734, 0.1890704951675415, 0.11175966240441451, 0.276550152677704, -0.3765052591039279, -0.1974304267205298, 0.0347108415625808, 0.16389497494438054, 0.03261707675365078, -0.02954887474324651, -0.2684476294255416, 0.08440653408133703, -0.2615863596007542, -0.19085803275093338, 0.008304495618424633, 0.1374987130248564, -0.02458059104377186, -0.2776535411075048, 0.11296113946342043, 0.13281377690977283, 0.15802462403239173, -0.17593698373575417, -0.08916672503246091, -0.08558297855779529, 0.09110100303138546, 0.04712068341527279, 0.025970233637573465, 0.229538208142818, -0.03500528566769094, -0.028606972245910724, 0.4276801380207883, -0.1271251258984595, -0.06182377016196003, 0.28409804126048194, -0.23710636000826277, -0.0930222751052639, 0.11290479854940642, 0.18826225055260704, 0.13031697026514388, -0.17535173491417588, 0.02366146964154073, -0.03552500375655371, 0.23019095327608385, 0.07159399819959487, 0.057834640409657675, 0.4393980052539861, 0.20533644812115068, 0.11775808520131296, 0.045859117115327676, -0.18909255688172438, -0.10414529677673981, -0.12817269836419395, -0.12074432156635327, -0.17787037622909269, 0.05398497026256443, -0.10732487313617202, -0.16187827259169094, 0.3775298746256233, 0.15400839319404264, 0.15297187791302702, -0.012231685234802206, 0.35472240771904784, 0.09524387165876831, 0.07604688483172448, 0.12313939165928728, 0.3450815402479334, 0.16245150919126758, 0.06973645542506371, -0.355590445920825, 0.10793149485192322, 0.004428000833427944] |
1,802.08386 | Enhanced PeerHunter: Detecting Peer-to-peer Botnets through Network-Flow
Level Community Behavior Analysis | Peer-to-peer (P2P) botnets have become one of the major threats in network
security for serving as the fundamental infrastructure for various
cyber-crimes. More challenges are involved in the problem of detecting P2P
botnets, despite a few work claimed to detect centralized botnets effectively.
We propose Enhanced PeerHunter, a network-flow level community behavior
analysis based system, to detect P2P botnets. Our system starts from a P2P
network flow detection component. Then, it uses "mutual contacts" to cluster
bots into communities. Finally, it uses network-flow level community behavior
analysis to detect potential botnets. In the experimental evaluation, we
propose two evasion attacks, where we assume the adversaries know our
techniques in advance and attempt to evade our system by making the P2P bots
mimic the behavior of legitimate P2P applications. Our results showed that
Enhanced PeerHunter can obtain high detection rate with few false positives,
and high robustness against the proposed attacks.
| cs.CR cs.NI cs.SI | peertopeer p2p botnets have become one of the major threats in network security for serving as the fundamental infrastructure for various cybercrimes more challenges are involved in the problem of detecting p2p botnets despite a few work claimed to detect centralized botnets effectively we propose enhanced peerhunter a networkflow level community behavior analysis based system to detect p2p botnets our system starts from a p2p network flow detection component then it uses mutual contacts to cluster bots into communities finally it uses networkflow level community behavior analysis to detect potential botnets in the experimental evaluation we propose two evasion attacks where we assume the adversaries know our techniques in advance and attempt to evade our system by making the p2p bots mimic the behavior of legitimate p2p applications our results showed that enhanced peerhunter can obtain high detection rate with few false positives and high robustness against the proposed attacks | [['peertopeer', 'p2p', 'botnets', 'have', 'become', 'one', 'of', 'the', 'major', 'threats', 'in', 'network', 'security', 'for', 'serving', 'as', 'the', 'fundamental', 'infrastructure', 'for', 'various', 'cybercrimes', 'more', 'challenges', 'are', 'involved', 'in', 'the', 'problem', 'of', 'detecting', 'p2p', 'botnets', 'despite', 'a', 'few', 'work', 'claimed', 'to', 'detect', 'centralized', 'botnets', 'effectively', 'we', 'propose', 'enhanced', 'peerhunter', 'a', 'networkflow', 'level', 'community', 'behavior', 'analysis', 'based', 'system', 'to', 'detect', 'p2p', 'botnets', 'our', 'system', 'starts', 'from', 'a', 'p2p', 'network', 'flow', 'detection', 'component', 'then', 'it', 'uses', 'mutual', 'contacts', 'to', 'cluster', 'bots', 'into', 'communities', 'finally', 'it', 'uses', 'networkflow', 'level', 'community', 'behavior', 'analysis', 'to', 'detect', 'potential', 'botnets', 'in', 'the', 'experimental', 'evaluation', 'we', 'propose', 'two', 'evasion', 'attacks', 'where', 'we', 'assume', 'the', 'adversaries', 'know', 'our', 'techniques', 'in', 'advance', 'and', 'attempt', 'to', 'evade', 'our', 'system', 'by', 'making', 'the', 'p2p', 'bots', 'mimic', 'the', 'behavior', 'of', 'legitimate', 'p2p', 'applications', 'our', 'results', 'showed', 'that', 'enhanced', 'peerhunter', 'can', 'obtain', 'high', 'detection', 'rate', 'with', 'few', 'false', 'positives', 'and', 'high', 'robustness', 'against', 'the', 'proposed', 'attacks']] | [-0.1804214293988965, -0.011540269645241399, -0.056087646504553654, 0.07920690820241968, -0.08695904441333066, -0.23202136168052676, 0.12237963794420163, 0.33242596871530017, -0.2503427565315117, -0.34108436710511647, 0.09355472203964989, -0.3571870492647092, -0.23330208382258813, 0.14938463389175013, -0.13422125486812245, 0.07885906807457407, 0.05861475088323156, 0.02735621825636675, 0.07855798250840355, -0.30536906021647153, 0.31604577995215855, 0.06970549389564742, 0.3373638973509272, 0.10051177125579368, 0.025110328818360964, -0.007408820609562099, -0.03439028584087889, -0.030275084446184337, -0.0442219316092572, 0.10984169027690466, 0.37358633652639883, 0.2345827265953024, 0.33939981755490106, -0.4265235468496879, -0.23754232649691404, 0.12458260361105204, 0.19572798613303652, 0.1524631903630992, -0.08081232624953069, -0.3944835277584692, 0.16676013281879326, -0.2951755824374656, -0.10207297600184878, -0.11109251140616834, -0.03489432064311889, 0.009056514329276979, -0.18853052720427513, -0.01126307730252544, 0.003194639606711765, 0.05721047392425438, -0.009018966363122065, -0.054830657059792426, 0.04302214620169252, 0.1828185984802743, 0.0874053521702687, -0.038539463767083365, 0.2363046111026779, -0.13089297745066383, -0.17053107450405758, 0.3444370971247554, -0.03287362177739851, -0.13124265246558933, 0.21028244763457526, 0.013240522602573038, -0.19352353994113702, 0.10171532571005325, 0.27563514789100735, 0.0857591446613272, -0.16560442386815946, -0.05174403472415482, 0.015242266816397508, 0.20300746345116447, 0.029169066244115433, 0.024787561191866796, 0.17175000893572967, 0.22213530871396264, 0.14468413166236133, 0.08822366987510274, -0.09102974597675105, -0.09322768416876594, -0.14707677541843925, -0.11472964181991605, -0.1404109990193198, 0.014510973618210604, -0.035008071465223715, -0.13149887952332695, 0.3627202013383309, 0.2578921546569715, 0.12826501415421565, 0.07455716056749224, 0.3880644624183575, -0.026370128924027084, 0.09654916166483114, 0.14418513315729797, 0.2509382037236355, -0.0016296772301817933, 0.16089075721800328, -0.1474857932771556, 0.18381979615117114, -0.011796998750263204] |
1,802.08387 | On the rigidity of rank gradient in a group of intermediate growth | We introduce and investigate the rigidity property of rank gradient in the
case of the group $\mathcal G$ of intermediate growth constructed by the first
author. We show that $\mathcal G$ is normally $(f,g)$-RG rigid where
$f(n)=\log(n)$ and $g(n) =\log(\log(n)).$
| math.DS math.GR | we introduce and investigate the rigidity property of rank gradient in the case of the group mathcal g of intermediate growth constructed by the first author we show that mathcal g is normally fgrg rigid where fnlogn and gn loglogn | [['we', 'introduce', 'and', 'investigate', 'the', 'rigidity', 'property', 'of', 'rank', 'gradient', 'in', 'the', 'case', 'of', 'the', 'group', 'mathcal', 'g', 'of', 'intermediate', 'growth', 'constructed', 'by', 'the', 'first', 'author', 'we', 'show', 'that', 'mathcal', 'g', 'is', 'normally', 'fgrg', 'rigid', 'where', 'fnlogn', 'and', 'gn', 'loglogn']] | [-0.18455291220820264, 0.12600699103878518, -0.044207823119665444, -0.02147619092628654, -0.04021427542657444, -0.09968994442667616, -0.01580259669572115, 0.36595444360404816, -0.32218539028575544, -0.21902591298873486, 0.09135200233676617, -0.22983343678673632, -0.20110377669334412, 0.09909325146949605, -0.10891934748935073, -0.03399150441155622, 0.014834930286987832, 0.131310977776976, -0.05202407247117279, -0.2506558125728349, 0.37851213124629696, -0.047237260242629996, 0.23693637177348137, 0.016683628856155434, 0.08945130581330311, 0.029104232493984073, 0.0016319295268897947, 0.024998118071571776, -0.1960295566281466, 0.11109787095828276, 0.21979707224588646, 0.069416822546995, 0.27235547806087296, -0.36550767406036977, -0.16478140500227087, 0.17916835937649012, 0.09137899357531416, -0.0034263025246266472, -0.044654568118092264, -0.23096613163790225, 0.17976043427265004, -0.18668486393595995, -0.12252128649331433, -0.04026019296265746, 0.10570255664826714, 0.01694522715498399, -0.2690206945285593, 0.050519116688519716, 0.11296992469578981, 0.05305966038232375, 0.0011143934863962624, -0.09159292486545287, -0.08661431925812442, 0.09018546859978845, 0.023443901758199853, 0.04782976445398832, 0.07548896480645788, -0.06691857755772378, -0.05804604276291732, 0.40638540185203675, -0.11824590970124853, -0.1350076662278489, 0.11734299371509176, -0.19867713057043912, -0.1990632259679076, 0.02520375375292803, 0.1481193861875095, 0.20847724720078986, -0.009539194699180754, 0.20335663091330053, -0.10110553047668777, 0.10055416435199349, 0.059942682837381175, -0.06098735640070548, 0.011619229237303921, 0.12179693492668632, 0.11810038530414826, 0.1837771236406345, 0.013184327926290663, 0.05942028316080963, -0.3529139683385821, -0.1837593063614086, -0.17925217944675273, 0.10305776557345923, -0.0882822376619228, -0.13061936390831283, 0.37939339969307184, 0.07698773749564823, 0.21754713964305425, 0.14018492586910725, 0.19908205684470504, 0.0779422271114431, 0.03815122760562716, 0.13904480739055494, 0.18462572816612297, 0.17747829698246756, -0.08061551846759885, -0.18968104187699378, 0.0312540806511319, 0.22455055028886386] |
1,802.08388 | Search for Axion like particles using Laue-case conversion in a single
crystal | Axion Like Particles (ALPs) with a sub-keV range mass are searched by using
the light-shining-through-a-wall technique. A novel system is developed in
which injected X rays are converted and reconverted by the Laue-case conversion
within a silicon single crystal with dual blades. The resonant ALPs' mass of
the conversion is scanned by varying the X-ray injection angle to the crystal.
No significant signals are observed, and 90% C. L. upper limits on the ALP-two
photon coupling constant are obtained as follows, g_{a\gamma\gamma} < 4.2
\times 10^{-3} GeV^{-1} (m_a < 10 eV), g_{a\gamma\gamma} < 5.0 \times 10^{-3}
GeV^{-1} (46 eV < m_a < 1020 eV). These are the most stringent laboratorial
constraints on ALPs heavier than 300 eV.
| hep-ex physics.ins-det | axion like particles alps with a subkev range mass are searched by using the lightshiningthroughawall technique a novel system is developed in which injected x rays are converted and reconverted by the lauecase conversion within a silicon single crystal with dual blades the resonant alps mass of the conversion is scanned by varying the xray injection angle to the crystal no significant signals are observed and 90 c l upper limits on the alptwo photon coupling constant are obtained as follows g_agammagamma 42 times 103 gev1 m_a 10 ev g_agammagamma 50 times 103 gev1 46 ev m_a 1020 ev these are the most stringent laboratorial constraints on alps heavier than 300 ev | [['axion', 'like', 'particles', 'alps', 'with', 'a', 'subkev', 'range', 'mass', 'are', 'searched', 'by', 'using', 'the', 'lightshiningthroughawall', 'technique', 'a', 'novel', 'system', 'is', 'developed', 'in', 'which', 'injected', 'x', 'rays', 'are', 'converted', 'and', 'reconverted', 'by', 'the', 'lauecase', 'conversion', 'within', 'a', 'silicon', 'single', 'crystal', 'with', 'dual', 'blades', 'the', 'resonant', 'alps', 'mass', 'of', 'the', 'conversion', 'is', 'scanned', 'by', 'varying', 'the', 'xray', 'injection', 'angle', 'to', 'the', 'crystal', 'no', 'significant', 'signals', 'are', 'observed', 'and', '90', 'c', 'l', 'upper', 'limits', 'on', 'the', 'alptwo', 'photon', 'coupling', 'constant', 'are', 'obtained', 'as', 'follows', 'g_agammagamma', '42', 'times', '103', 'gev1', 'm_a', '10', 'ev', 'g_agammagamma', '50', 'times', '103', 'gev1', '46', 'ev', 'm_a', '1020', 'ev', 'these', 'are', 'the', 'most', 'stringent', 'laboratorial', 'constraints', 'on', 'alps', 'heavier', 'than', '300', 'ev']] | [-0.11883988947112549, 0.33059490957037285, 0.09403256031995018, 0.09204627388589051, -0.03834622071401493, -0.13278974932492585, 0.1101452727279802, 0.3798829616374663, -0.14877979222974563, -0.46769213115981034, 0.04802485359287276, -0.3221344084369841, 0.11293659969191025, 0.2717307546754947, 0.09753331915173377, 0.0020857990880891143, 0.022426854028274212, -0.03730402645961222, -0.03445825856682416, -0.16951744568844637, 0.12008728752298667, 0.07412320137367928, 0.2582319412665727, 0.07791567003136282, 0.11460946986518868, -0.06696969344331002, 0.06158817674847202, -0.12576504983846937, -0.1503305011470844, 0.057309769268088916, 0.1742697633437913, 0.05056844719660443, 0.15436700017501911, -0.37714373798587836, -0.14101224307281277, 0.08933104327586186, 0.13068579456575954, -0.05077259871492011, -0.07024598072592624, -0.3218167943561131, 0.09484428277255984, -0.16186538754609991, -0.050351009011973404, 0.0667034867848899, -0.0004558131635726035, -0.029854601665991486, -0.26866663186097733, 0.08652359080135923, -0.07446836072087355, -0.03507545185385499, -0.051035451841213414, -0.20801807081888993, -0.029516466091982684, -0.08145786645226516, 0.05506162428053784, 0.09460964639931246, 0.2640327060813302, -0.07752197741337859, -0.07425692391808371, 0.44003461252348414, -0.1288521037451967, -0.0835088330094476, 0.12337784850886008, -0.1457354888773045, -0.06916479176531236, 0.2451890619379376, 0.14199501379950996, 0.1227701795859019, -0.16694005703771705, 0.10554733176124156, -0.032897172181086766, 0.2686128947581794, 0.15204846867997837, 0.03330390074453946, 0.2601232127210981, 0.1792107464468761, 0.04939831708566294, 0.012573115393385157, -0.16534344662769554, 0.035015716061189035, -0.2704686407552537, -0.07001423397151804, -0.08778815476542658, 0.1296126522534938, -0.15505546483243732, -0.01769382082899143, 0.3142430670139892, 0.11451661860285041, 0.20336463982826686, -0.009972653419895281, 0.2609676497963232, 0.14586372793387822, 0.06438018114889157, 0.046490914725304186, 0.3897512536495924, 0.14308286786104576, 0.09416912867779936, -0.12411458702204195, -0.044676516773514786, -0.01288383962955695] |
1,802.08389 | Birational superrigidity and K-stability of Fano complete intersections
of index one (with an appendix written jointly with Charlie Stibitz) | We prove that every smooth Fano complete intersection of index $1$ and
codimension $r$ in $\mathbb{P}^{n+r}$ is birationally superrigid and K-stable
if $n\ge 10r$. We also propose a generalization of Tian's criterion of
K-stability and, as an application, prove the K-stability of the complete
intersection of a quadric and a cubic in $\mathbb{P}^5$. In the appendix
(written jointly with C. Stibitz), we prove the conditional birational
superrigidity of Fano complete intersections of higher index in large
dimension.
| math.AG math.DG | we prove that every smooth fano complete intersection of index 1 and codimension r in mathbbpnr is birationally superrigid and kstable if nge 10r we also propose a generalization of tians criterion of kstability and as an application prove the kstability of the complete intersection of a quadric and a cubic in mathbbp5 in the appendix written jointly with c stibitz we prove the conditional birational superrigidity of fano complete intersections of higher index in large dimension | [['we', 'prove', 'that', 'every', 'smooth', 'fano', 'complete', 'intersection', 'of', 'index', '1', 'and', 'codimension', 'r', 'in', 'mathbbpnr', 'is', 'birationally', 'superrigid', 'and', 'kstable', 'if', 'nge', '10r', 'we', 'also', 'propose', 'a', 'generalization', 'of', 'tians', 'criterion', 'of', 'kstability', 'and', 'as', 'an', 'application', 'prove', 'the', 'kstability', 'of', 'the', 'complete', 'intersection', 'of', 'a', 'quadric', 'and', 'a', 'cubic', 'in', 'mathbbp5', 'in', 'the', 'appendix', 'written', 'jointly', 'with', 'c', 'stibitz', 'we', 'prove', 'the', 'conditional', 'birational', 'superrigidity', 'of', 'fano', 'complete', 'intersections', 'of', 'higher', 'index', 'in', 'large', 'dimension']] | [-0.20007591308220415, -0.030426031801136955, -0.08262452614065763, 0.09103094470039061, -0.036274966425136536, -0.20912219345494099, -0.021356025207284336, 0.327697434236069, -0.25475054079465365, -0.17153277143684997, 0.06368967587115697, -0.24625533627899918, -0.1906540020671044, 0.17129996456394628, -0.2414916576314214, -0.03262762951891165, 0.011532229371368885, 0.058068261991531867, -0.08506392175017076, -0.3912770458673303, 0.41882746037397833, -0.10675005010971045, 0.2149446395200652, 0.16277854559892738, 0.13684825932068634, 0.06253529920217556, 0.031882042826681924, 0.032733659335487594, -0.203086048531888, 0.16476823111391953, 0.302659832947963, 0.12935282610281296, 0.17451834082100037, -0.3044918091583059, -0.11118436836939607, 0.21460939098048853, 0.11125565687748226, 0.02551540659388175, 0.028592619543102243, -0.22036075147145703, 0.1483922856985717, -0.1323420791886747, -0.24218924796661814, -0.08020045308748612, 0.0829009849175408, 0.028407730756805756, -0.2597490821058887, -0.015765338082486334, 0.19640668243723544, 0.19906042070805277, 0.0023615604543404, -0.06837121662809639, -0.14553463713240786, -0.012083027116966912, -0.04641953217985763, 0.07080754581712992, 0.023034351788983505, -0.06842273491359241, -0.13386471371946707, 0.35747405790371467, -0.10638754466246511, -0.21309124605377783, 0.06963939904361158, -0.1652884988516972, -0.14192151460746252, 0.1380213656009653, 0.15023651322651957, 0.21696054044406157, 0.03050650772009347, 0.16094100728593264, -0.10338356613961829, 0.11569134952072557, 0.15561762477296429, -0.026988844380940537, 0.07482424142732713, 0.09299207829895455, 0.16120018936517472, 0.1761291982052294, -0.007233622131516805, 0.0663288742983462, -0.4232100891201077, -0.24423771055818005, -0.11758290990129919, 0.2381090138334076, -0.1709100444591919, -0.16215192244665041, 0.407184617694568, 0.0007077899975450458, 0.23092865128372167, 0.10058829216034831, 0.24900610942544565, 0.007673819233172548, -0.045583400540242625, 0.10913490285669025, 0.16206038943366022, 0.19042434140637116, -0.04987560460545324, -0.06027692818001064, -0.04943645883326393, 0.18426121057741143] |
1,802.0839 | A Stochastic Lagrangian Basis for a Probabilistic Parameterization of
Moisture Condensation in Eulerian Models | In this paper we describe the construction of an efficient probabilistic
parameterization that could be used in a coarse-resolution numerical model in
which the variation of moisture is not properly resolved. An Eulerian model
using a coarse-grained field on a grid cannot properly resolve regions of
saturation---in which condensation occurs---that are smaller than the grid
boxes. Thus, in the absence of a parameterization scheme, either the grid box
must become saturated or condensation will be underestimated. On the other
hand, in a stochastic Lagrangian model of moisture transport, trajectories of
parcels tagged with humidity variables are tracked and small-scale moisture
variability can be retained; however, explicitly implementing such a scheme in
a global model would be computationally prohibitive. One way to introduce
subgrid-scale saturation into an Eulerian model is to assume the humidity
within a grid box has a probability distribution. To close the problem, this
distribution is conventionally determined by relating the required
subgrid-scale properties of the flow to the grid-scale properties using a
turbulence closure. Here, instead, we determine an assumed probability
distribution by using the statistical moments from a stochastic Lagrangian
version of the system. The stochastic system is governed by a Fokker--Planck
equation and we use that, rather than explicitly following the moisture
parcels, to determine the parameters of the assumed distribution. We are thus
able to parameterize subgrid-scale condensation in an Eulerian model in a
computationally efficient and theoretically well-founded way. In two idealized
advection--condensation problems we show that a coarse Eulerian model with the
subgrid parameterization is well able to mimic its Lagrangian counterpart.
| physics.ao-ph physics.flu-dyn physics.geo-ph | in this paper we describe the construction of an efficient probabilistic parameterization that could be used in a coarseresolution numerical model in which the variation of moisture is not properly resolved an eulerian model using a coarsegrained field on a grid cannot properly resolve regions of saturationin which condensation occursthat are smaller than the grid boxes thus in the absence of a parameterization scheme either the grid box must become saturated or condensation will be underestimated on the other hand in a stochastic lagrangian model of moisture transport trajectories of parcels tagged with humidity variables are tracked and smallscale moisture variability can be retained however explicitly implementing such a scheme in a global model would be computationally prohibitive one way to introduce subgridscale saturation into an eulerian model is to assume the humidity within a grid box has a probability distribution to close the problem this distribution is conventionally determined by relating the required subgridscale properties of the flow to the gridscale properties using a turbulence closure here instead we determine an assumed probability distribution by using the statistical moments from a stochastic lagrangian version of the system the stochastic system is governed by a fokkerplanck equation and we use that rather than explicitly following the moisture parcels to determine the parameters of the assumed distribution we are thus able to parameterize subgridscale condensation in an eulerian model in a computationally efficient and theoretically wellfounded way in two idealized advectioncondensation problems we show that a coarse eulerian model with the subgrid parameterization is well able to mimic its lagrangian counterpart | [['in', 'this', 'paper', 'we', 'describe', 'the', 'construction', 'of', 'an', 'efficient', 'probabilistic', 'parameterization', 'that', 'could', 'be', 'used', 'in', 'a', 'coarseresolution', 'numerical', 'model', 'in', 'which', 'the', 'variation', 'of', 'moisture', 'is', 'not', 'properly', 'resolved', 'an', 'eulerian', 'model', 'using', 'a', 'coarsegrained', 'field', 'on', 'a', 'grid', 'can', 'not', 'properly', 'resolve', 'regions', 'of', 'saturationin', 'which', 'condensation', 'occursthat', 'are', 'smaller', 'than', 'the', 'grid', 'boxes', 'thus', 'in', 'the', 'absence', 'of', 'a', 'parameterization', 'scheme', 'either', 'the', 'grid', 'box', 'must', 'become', 'saturated', 'or', 'condensation', 'will', 'be', 'underestimated', 'on', 'the', 'other', 'hand', 'in', 'a', 'stochastic', 'lagrangian', 'model', 'of', 'moisture', 'transport', 'trajectories', 'of', 'parcels', 'tagged', 'with', 'humidity', 'variables', 'are', 'tracked', 'and', 'smallscale', 'moisture', 'variability', 'can', 'be', 'retained', 'however', 'explicitly', 'implementing', 'such', 'a', 'scheme', 'in', 'a', 'global', 'model', 'would', 'be', 'computationally', 'prohibitive', 'one', 'way', 'to', 'introduce', 'subgridscale', 'saturation', 'into', 'an', 'eulerian', 'model', 'is', 'to', 'assume', 'the', 'humidity', 'within', 'a', 'grid', 'box', 'has', 'a', 'probability', 'distribution', 'to', 'close', 'the', 'problem', 'this', 'distribution', 'is', 'conventionally', 'determined', 'by', 'relating', 'the', 'required', 'subgridscale', 'properties', 'of', 'the', 'flow', 'to', 'the', 'gridscale', 'properties', 'using', 'a', 'turbulence', 'closure', 'here', 'instead', 'we', 'determine', 'an', 'assumed', 'probability', 'distribution', 'by', 'using', 'the', 'statistical', 'moments', 'from', 'a', 'stochastic', 'lagrangian', 'version', 'of', 'the', 'system', 'the', 'stochastic', 'system', 'is', 'governed', 'by', 'a', 'fokkerplanck', 'equation', 'and', 'we', 'use', 'that', 'rather', 'than', 'explicitly', 'following', 'the', 'moisture', 'parcels', 'to', 'determine', 'the', 'parameters', 'of', 'the', 'assumed', 'distribution', 'we', 'are', 'thus', 'able', 'to', 'parameterize', 'subgridscale', 'condensation', 'in', 'an', 'eulerian', 'model', 'in', 'a', 'computationally', 'efficient', 'and', 'theoretically', 'wellfounded', 'way', 'in', 'two', 'idealized', 'advectioncondensation', 'problems', 'we', 'show', 'that', 'a', 'coarse', 'eulerian', 'model', 'with', 'the', 'subgrid', 'parameterization', 'is', 'well', 'able', 'to', 'mimic', 'its', 'lagrangian', 'counterpart']] | [-0.07610792399189154, 0.11914505531305002, -0.11101997971476972, 0.09016888879208876, -0.06890755259141311, -0.09769654513676038, -0.004283539382082071, 0.361932411645503, -0.2963905871354852, -0.30543700397707696, 0.0910467257905506, -0.22273924441416135, -0.11756068013352161, 0.15789384239009407, -0.07710510605220618, 0.05595239555682489, 0.03551894709758475, -0.0047311856742594536, -0.02947520001704783, -0.19464248562025901, 0.2829107100310078, 0.08751799594322147, 0.23052539257242438, 0.013842672977755351, 0.11906255697723218, -0.06402812404792699, -0.030402082675533702, 0.08884961904900134, -0.13765594398630707, 0.08559446727230698, 0.1894295826317858, 0.09666577266716911, 0.2551645466393625, -0.4661337343340581, -0.26968178734787496, 0.11554550231062598, 0.16945118176384896, 0.12308666417230815, 0.006093937390151816, -0.21041427070794758, 0.07987139224933908, -0.19546388102832518, -0.12652571251987688, -0.07835513295049873, -0.019519521043971613, 0.030327630763097187, -0.3041483996970247, 0.07684478338071427, 0.03354890789167032, 0.05745569871045476, -0.04784293705281664, -0.0628315256989756, -0.044657073192146804, 0.10053835325763162, -0.011519073108897018, 0.023421999631998265, 0.1336927170280454, -0.14150653909120253, -0.045388786532363834, 0.4269445796295019, -0.06677684606634561, -0.29748356167952145, 0.16243181059988895, -0.10345165326184225, -0.10569649844208386, 0.13457726423949898, 0.17611044593351213, 0.13791435023647003, -0.19708166492366513, 0.040313821747788955, -0.07116216355429371, 0.18851787225675387, 0.0099609902132187, -0.051642664457317584, 0.21181562762931277, 0.1712806969375689, 0.07842404356717254, 0.11537819432095596, -0.07967444807277495, -0.12806120767373622, -0.2895426985648887, -0.12912212016741503, -0.18954241494720353, 0.029680381246680907, -0.07761344742987625, -0.18225932826085897, 0.3704851885469639, 0.20832793991796153, 0.19878926508619574, 0.04318515839535281, 0.3224831814336222, 0.13687753365122418, 0.052983024993134384, 0.1031427586319416, 0.19549124366572207, 0.10993168183129512, 0.07308538455079316, -0.20098076152431152, 0.10677483524629024, 0.10783928302441571] |
1,802.08391 | An Empirical Study on README contents for JavaScript Packages | Contemporary software projects often utilize a README.md to share crucial
information such as installation and usage examples related to their software.
Furthermore, these files serve as an important source of updated and useful
documentation for developers and prospective users of the software.
Nonetheless, both novice and seasoned developers are sometimes unsure of what
is required for a good README file. To understand the contents of a README, we
investigate the contents of 43,900 JavaScript packages. Results show that these
packages contain common content themes (i.e., usage, install and license).
Furthermore, we find that application-specific packages more frequently
included content themes such as options, while library-based packages more
frequently included other specific content themes (i.e., install and license).
| cs.SE | contemporary software projects often utilize a readmemd to share crucial information such as installation and usage examples related to their software furthermore these files serve as an important source of updated and useful documentation for developers and prospective users of the software nonetheless both novice and seasoned developers are sometimes unsure of what is required for a good readme file to understand the contents of a readme we investigate the contents of 43900 javascript packages results show that these packages contain common content themes ie usage install and license furthermore we find that applicationspecific packages more frequently included content themes such as options while librarybased packages more frequently included other specific content themes ie install and license | [['contemporary', 'software', 'projects', 'often', 'utilize', 'a', 'readmemd', 'to', 'share', 'crucial', 'information', 'such', 'as', 'installation', 'and', 'usage', 'examples', 'related', 'to', 'their', 'software', 'furthermore', 'these', 'files', 'serve', 'as', 'an', 'important', 'source', 'of', 'updated', 'and', 'useful', 'documentation', 'for', 'developers', 'and', 'prospective', 'users', 'of', 'the', 'software', 'nonetheless', 'both', 'novice', 'and', 'seasoned', 'developers', 'are', 'sometimes', 'unsure', 'of', 'what', 'is', 'required', 'for', 'a', 'good', 'readme', 'file', 'to', 'understand', 'the', 'contents', 'of', 'a', 'readme', 'we', 'investigate', 'the', 'contents', 'of', '43900', 'javascript', 'packages', 'results', 'show', 'that', 'these', 'packages', 'contain', 'common', 'content', 'themes', 'ie', 'usage', 'install', 'and', 'license', 'furthermore', 'we', 'find', 'that', 'applicationspecific', 'packages', 'more', 'frequently', 'included', 'content', 'themes', 'such', 'as', 'options', 'while', 'librarybased', 'packages', 'more', 'frequently', 'included', 'other', 'specific', 'content', 'themes', 'ie', 'install', 'and', 'license']] | [-0.05574415518254366, 0.0016486192194228669, -0.053599314419957605, 0.14281881650727565, -0.17811534670384033, -0.23860280771699288, 0.029622799789775972, 0.4424271155310714, -0.24706659410958703, -0.389715027630977, 0.14516777431936528, -0.32688724446798795, -0.08050823077235533, 0.2178078624865283, -0.09442141642186629, 0.030204008414369564, 0.10071657384219376, 0.04524576803264411, -0.032772033457117884, -0.30841991622810777, 0.25220524161730123, 0.126412534640859, 0.3025060459809459, 0.07336452236075117, -0.014184650911382683, -0.005787617992609739, -0.1403036494941815, -0.069803462230155, -0.10832225919116552, 0.12555658677592874, 0.4265593523564546, 0.29411259762127884, 0.2892321484487342, -0.4652488045880328, -0.1180527231873661, -0.03414811425369091, 0.12917065465235678, 0.03875102880815773, -0.07891443239793222, -0.2548100134762733, 0.08807862729502275, -0.264664343205969, -0.11193944726382261, -0.10795875696222419, 0.005261381423991659, 0.06446772900703565, -0.21849180917184718, -0.07000279376161811, 0.007557488800502261, 0.10102718445755865, 0.033880263988090596, -0.15377958658272806, -0.06331233939196429, 0.26540666808495705, 0.09214075257743547, -0.0016475241504731062, 0.17915479539205198, -0.1815425078344086, -0.09041694235866485, 0.4545320324599743, 0.05084169716979175, -0.17329756107748204, 0.2112028555215701, 0.018056576867061466, -0.18093903923569166, 0.04510612547316629, 0.22899877564252719, 0.05984371223527452, -0.22757310710199502, 0.002824763626710552, 0.032352944738838985, 0.2588173073756954, 0.06560928535536337, 0.07884788799059132, 0.22809432148933412, 0.1181318794498625, -0.008840554021298885, 0.10756490340142551, 0.03499349186439877, -0.05016036215440735, -0.28145282559258783, -0.21109354267625705, -0.08630630271306829, -0.028748671261026808, -0.01584166618716984, -0.1918260020730288, 0.3628558136765724, 0.23350920005633152, 0.038052799516236004, -0.030555467603161284, 0.3231522658920806, -0.0759282039873221, 0.151167814253384, 0.1757289512325888, 0.030545855054388876, -0.0634404721852068, 0.19794115955617442, -0.08709391852354874, 0.11263917380053064, -0.07486404041638194] |
1,802.08392 | Globally F-regular type of moduli spaces and Verlinde formula | We prove that moduli spaces of semistable parabolic bundles and generalized
parabolic sheaves (GPS) with a fixed determinant on a smooth projective curve
are globally F-regular type. As an application, we prove vanishing theorems on
the moduli spaces of semistable parabolic sheaves on a singular curve, which
combining with Factorization theorems in [24] and [25] give two recurrence
relations among dimensions of spaces of generalized theta functions. By using
of these recurrence relations, we prove an explicit formula (Verlinde formula)
for the dimension of spaces of generalized theta functions.
| math.AG | we prove that moduli spaces of semistable parabolic bundles and generalized parabolic sheaves gps with a fixed determinant on a smooth projective curve are globally fregular type as an application we prove vanishing theorems on the moduli spaces of semistable parabolic sheaves on a singular curve which combining with factorization theorems in 24 and 25 give two recurrence relations among dimensions of spaces of generalized theta functions by using of these recurrence relations we prove an explicit formula verlinde formula for the dimension of spaces of generalized theta functions | [['we', 'prove', 'that', 'moduli', 'spaces', 'of', 'semistable', 'parabolic', 'bundles', 'and', 'generalized', 'parabolic', 'sheaves', 'gps', 'with', 'a', 'fixed', 'determinant', 'on', 'a', 'smooth', 'projective', 'curve', 'are', 'globally', 'fregular', 'type', 'as', 'an', 'application', 'we', 'prove', 'vanishing', 'theorems', 'on', 'the', 'moduli', 'spaces', 'of', 'semistable', 'parabolic', 'sheaves', 'on', 'a', 'singular', 'curve', 'which', 'combining', 'with', 'factorization', 'theorems', 'in', '24', 'and', '25', 'give', 'two', 'recurrence', 'relations', 'among', 'dimensions', 'of', 'spaces', 'of', 'generalized', 'theta', 'functions', 'by', 'using', 'of', 'these', 'recurrence', 'relations', 'we', 'prove', 'an', 'explicit', 'formula', 'verlinde', 'formula', 'for', 'the', 'dimension', 'of', 'spaces', 'of', 'generalized', 'theta', 'functions']] | [-0.2005907915286678, 0.06283191159293003, -0.13125305119483324, 0.1389746442541815, -0.0846029670903815, -0.1861351748269177, 0.005380255431773957, 0.3189771238170313, -0.3252681632515755, -0.12025340213283395, 0.13102517629518393, -0.22450676383032056, -0.19287043460383174, 0.2908507315965181, -0.16616372496943943, 0.03638960166802902, 0.00924913969748978, 0.03778869968975026, -0.1773403317777419, -0.31705386585587364, 0.5105969793675991, -0.1405994843500614, 0.25440785300321456, 0.05103089218812712, 0.17008668565180865, 0.07635600160116728, -0.036245255029938195, -0.05802916002909789, -0.174826004257667, 0.18525601395280258, 0.3152132325078455, 0.019325562951604973, 0.17148952489310687, -0.3558174114088329, -0.14125175040026897, 0.23426165799034782, 0.10507532577501254, -0.04161001044571441, 0.041180891417793596, -0.2584064926617266, 0.07709268237767594, -0.1476910797109974, -0.24942404397480775, -0.12032830989344066, 0.06899840373211027, 0.10374897304043341, -0.23900425383883916, 0.024712504798106934, 0.07745620467061742, 0.16497865548420154, -0.1368958536232037, -0.10292082421188609, -0.08450287375913075, -0.013595115343694774, 0.004027684878432349, 0.00018156930448466472, 0.04108303546738089, -0.08370900239921018, -0.13338682976331603, 0.2808245957823826, -0.08448139377189486, -0.2671192144828566, 0.061150757920289976, -0.11780534110168057, -0.1585083873366958, 0.10806027417897843, 0.10511178003226439, 0.20003634477766713, 0.021134463295842825, 0.1565834313638906, -0.13508521328062822, 0.07650394163230496, 0.1513575206280508, 0.015732187866704182, 0.09326300273251752, 0.061021441797820035, 0.07971280654159825, 0.11696937766051695, -0.014408057532011626, -0.06529233668501792, -0.4096383527758416, -0.21597609267664258, -0.0831396569278133, 0.18822531897072378, -0.22950350604604752, -0.20758743130267085, 0.35140623378284863, -0.00422648431503036, 0.21936670848785828, 0.2270896708333781, 0.18753197251850467, 0.10534055700023355, 0.018691084345049236, 0.02960189390604468, 0.17712587685837003, 0.2415511171370117, -0.007159491543124398, -0.06835627962123561, -0.041605755419920336, 0.32531859764431637] |
1,802.08393 | Boltzmann transport theory for many body localization | We investigate a many-body localization transition based on a Boltzmann
transport theory. Introducing weak localization corrections into a Boltzmann
equation, Hershfield and Ambegaokar re-derived the Wolfle-Vollhardt
self-consistent equation for the diffusion coefficient [Phys. Rev. B {\bf 34},
2147 (1986)]. We generalize this Boltzmann equation framework, introducing
electron-electron interactions into the Hershfield-Ambegaokar Boltzmann
transport theory based on the study of Zala-Narozhny-Aleiner [Phys. Rev. B {\bf
64}, 214204 (2001)]. Here, not only Altshuler-Aronov corrections but also
dephasing effects are taken into account. As a result, we obtain a
self-consistent equation for the diffusion coefficient in terms of the disorder
strength and temperature, which extends the Wolfle-Vollhardt self-consistent
equation in the presence of electron correlations. Solving our self-consistent
equation numerically, we find a many-body localization insulator-metal
transition, where a metallic phase appears from dephasing effects dominantly
instead of renormalization effects at high temperatures. Although this
mechanism is consistent with that of recent seminal papers [Ann. Phys. (N. Y).
{\bf 321}, 1126 (2006); Phys. Rev. Lett. {\bf 95}, 206603 (2005)], we find that
our three-dimensional metal-insulator transition belongs to the first order
transition, which differs from the Anderson metal-insulator transition
described by the Wolfle-Vollhardt self-consistent theory. We speculate that a
bimodal distribution function for the diffusion coefficient is responsible for
this first order phase transition.
| cond-mat.dis-nn cond-mat.str-el | we investigate a manybody localization transition based on a boltzmann transport theory introducing weak localization corrections into a boltzmann equation hershfield and ambegaokar rederived the wolflevollhardt selfconsistent equation for the diffusion coefficient phys rev b bf 34 2147 1986 we generalize this boltzmann equation framework introducing electronelectron interactions into the hershfieldambegaokar boltzmann transport theory based on the study of zalanarozhnyaleiner phys rev b bf 64 214204 2001 here not only altshuleraronov corrections but also dephasing effects are taken into account as a result we obtain a selfconsistent equation for the diffusion coefficient in terms of the disorder strength and temperature which extends the wolflevollhardt selfconsistent equation in the presence of electron correlations solving our selfconsistent equation numerically we find a manybody localization insulatormetal transition where a metallic phase appears from dephasing effects dominantly instead of renormalization effects at high temperatures although this mechanism is consistent with that of recent seminal papers ann phys n y bf 321 1126 2006 phys rev lett bf 95 206603 2005 we find that our threedimensional metalinsulator transition belongs to the first order transition which differs from the anderson metalinsulator transition described by the wolflevollhardt selfconsistent theory we speculate that a bimodal distribution function for the diffusion coefficient is responsible for this first order phase transition | [['we', 'investigate', 'a', 'manybody', 'localization', 'transition', 'based', 'on', 'a', 'boltzmann', 'transport', 'theory', 'introducing', 'weak', 'localization', 'corrections', 'into', 'a', 'boltzmann', 'equation', 'hershfield', 'and', 'ambegaokar', 'rederived', 'the', 'wolflevollhardt', 'selfconsistent', 'equation', 'for', 'the', 'diffusion', 'coefficient', 'phys', 'rev', 'b', 'bf', '34', '2147', '1986', 'we', 'generalize', 'this', 'boltzmann', 'equation', 'framework', 'introducing', 'electronelectron', 'interactions', 'into', 'the', 'hershfieldambegaokar', 'boltzmann', 'transport', 'theory', 'based', 'on', 'the', 'study', 'of', 'zalanarozhnyaleiner', 'phys', 'rev', 'b', 'bf', '64', '214204', '2001', 'here', 'not', 'only', 'altshuleraronov', 'corrections', 'but', 'also', 'dephasing', 'effects', 'are', 'taken', 'into', 'account', 'as', 'a', 'result', 'we', 'obtain', 'a', 'selfconsistent', 'equation', 'for', 'the', 'diffusion', 'coefficient', 'in', 'terms', 'of', 'the', 'disorder', 'strength', 'and', 'temperature', 'which', 'extends', 'the', 'wolflevollhardt', 'selfconsistent', 'equation', 'in', 'the', 'presence', 'of', 'electron', 'correlations', 'solving', 'our', 'selfconsistent', 'equation', 'numerically', 'we', 'find', 'a', 'manybody', 'localization', 'insulatormetal', 'transition', 'where', 'a', 'metallic', 'phase', 'appears', 'from', 'dephasing', 'effects', 'dominantly', 'instead', 'of', 'renormalization', 'effects', 'at', 'high', 'temperatures', 'although', 'this', 'mechanism', 'is', 'consistent', 'with', 'that', 'of', 'recent', 'seminal', 'papers', 'ann', 'phys', 'n', 'y', 'bf', '321', '1126', '2006', 'phys', 'rev', 'lett', 'bf', '95', '206603', '2005', 'we', 'find', 'that', 'our', 'threedimensional', 'metalinsulator', 'transition', 'belongs', 'to', 'the', 'first', 'order', 'transition', 'which', 'differs', 'from', 'the', 'anderson', 'metalinsulator', 'transition', 'described', 'by', 'the', 'wolflevollhardt', 'selfconsistent', 'theory', 'we', 'speculate', 'that', 'a', 'bimodal', 'distribution', 'function', 'for', 'the', 'diffusion', 'coefficient', 'is', 'responsible', 'for', 'this', 'first', 'order', 'phase', 'transition']] | [-0.09923483040476228, 0.1487770176038218, -0.06601951787375354, -0.013159733964692675, -0.05032098511625351, -0.13103682027706778, 0.08712792089310191, 0.2878924094923381, -0.19829314038357676, -0.255058113998477, -0.07056699880592274, -0.3022604285073489, -0.18317142333317962, 0.11517399742947397, 0.00958309204493096, 0.007537868727514001, -0.007944185431857688, -0.08026647396697235, -0.11117330416902035, -0.21188758345149852, 0.2178592399900986, 0.05193003071140237, 0.28817052794350445, 0.10138382721615838, 0.06859227937110812, 0.050101778780420624, 0.04347785608842969, 0.006222533610995841, -0.22088205165525415, -0.02069472687786832, 0.19479083696353264, -0.05590324038594673, 0.24665286395122896, -0.39343236023020267, -0.28830051954930136, 0.02910978424673279, 0.10157399337765748, 0.16915613222430834, -0.008477427696377255, -0.35433648028219755, 0.013739519508483546, -0.20110880911737178, -0.10987089408318633, -0.10030320933481492, 0.10709525598550512, -0.0325674239291859, -0.321906343460137, 0.23366040587388676, 0.07249047608308243, 0.027646691352803853, -0.06091283869610173, -0.09117081018326723, -0.011191296053753384, -0.003456546011682294, -0.030349078365480123, 0.0925904538669142, 0.09955685967826937, -0.058610781589702926, -0.09693823205442101, 0.3753087193534174, -0.08471535894050204, -0.11951672006848353, 0.1668223483433974, -0.15202757857311383, -0.12466958545908728, 0.14913377567117916, 0.14799469672053475, 0.14879322415870133, -0.19974697555149884, 0.14922824529158363, -0.04984720262242166, 0.13933327389714548, 0.03302928555873785, -0.007411928269292278, 0.14744839128016848, 0.12763228644346952, -0.0765646837161323, 0.07645283888346079, -0.09210002602748393, -0.14133333398033707, -0.31620186375193116, -0.12838666936256676, -0.22413586977653313, 0.13813909781532382, -0.005225919027208769, -0.16702519373907504, 0.3774700507539626, 0.22246343182210904, 0.20271847507318005, 0.008375131211284062, 0.17746795035205817, 0.18981855491497937, -0.029823864090868277, 0.15190990138259056, 0.2508472004648892, 0.21152219903578864, 0.11247364106894008, -0.2758346585025966, 0.016402688030949863, 0.13704629262870208] |
1,802.08394 | Dispersion features of complex waves in a graphene-coated semiconductor
nanowire | Dispersion features of a graphene-coated semiconductor nanowire operating in
the terahertz frequency band are consistently studied in the framework of a
special theory of complex waves. Detailed classification of the waveguide modes
was carried out based on the analysis of characteristics of the phase and
attenuation constants obtained from the complex roots of characteristic
equation. With such a treatment, the waves are attributed to the group of
either 'proper' or 'improper' waves, wherein their type is determined as the
trapped surface waves, fast and slow leaky waves, and surface plasmons. The
dispersion curves of axially symmetric TM0n and TE0n modes, as well as
non-symmetric hybrid EH1n and HE1n modes were plotted and analyzed in details,
and both radiative regime of leaky waves and guided regime of trapped surface
waves are identified. Peculiarities of propagation of the TM modes of surface
plasmons were revealed. Two sub-regions of existence of surface plasmons were
found out where they appear as propagating and reactive waves. The cut-off
conditions for higher order modes were correctly determined.
| physics.optics physics.class-ph | dispersion features of a graphenecoated semiconductor nanowire operating in the terahertz frequency band are consistently studied in the framework of a special theory of complex waves detailed classification of the waveguide modes was carried out based on the analysis of characteristics of the phase and attenuation constants obtained from the complex roots of characteristic equation with such a treatment the waves are attributed to the group of either proper or improper waves wherein their type is determined as the trapped surface waves fast and slow leaky waves and surface plasmons the dispersion curves of axially symmetric tm0n and te0n modes as well as nonsymmetric hybrid eh1n and he1n modes were plotted and analyzed in details and both radiative regime of leaky waves and guided regime of trapped surface waves are identified peculiarities of propagation of the tm modes of surface plasmons were revealed two subregions of existence of surface plasmons were found out where they appear as propagating and reactive waves the cutoff conditions for higher order modes were correctly determined | [['dispersion', 'features', 'of', 'a', 'graphenecoated', 'semiconductor', 'nanowire', 'operating', 'in', 'the', 'terahertz', 'frequency', 'band', 'are', 'consistently', 'studied', 'in', 'the', 'framework', 'of', 'a', 'special', 'theory', 'of', 'complex', 'waves', 'detailed', 'classification', 'of', 'the', 'waveguide', 'modes', 'was', 'carried', 'out', 'based', 'on', 'the', 'analysis', 'of', 'characteristics', 'of', 'the', 'phase', 'and', 'attenuation', 'constants', 'obtained', 'from', 'the', 'complex', 'roots', 'of', 'characteristic', 'equation', 'with', 'such', 'a', 'treatment', 'the', 'waves', 'are', 'attributed', 'to', 'the', 'group', 'of', 'either', 'proper', 'or', 'improper', 'waves', 'wherein', 'their', 'type', 'is', 'determined', 'as', 'the', 'trapped', 'surface', 'waves', 'fast', 'and', 'slow', 'leaky', 'waves', 'and', 'surface', 'plasmons', 'the', 'dispersion', 'curves', 'of', 'axially', 'symmetric', 'tm0n', 'and', 'te0n', 'modes', 'as', 'well', 'as', 'nonsymmetric', 'hybrid', 'eh1n', 'and', 'he1n', 'modes', 'were', 'plotted', 'and', 'analyzed', 'in', 'details', 'and', 'both', 'radiative', 'regime', 'of', 'leaky', 'waves', 'and', 'guided', 'regime', 'of', 'trapped', 'surface', 'waves', 'are', 'identified', 'peculiarities', 'of', 'propagation', 'of', 'the', 'tm', 'modes', 'of', 'surface', 'plasmons', 'were', 'revealed', 'two', 'subregions', 'of', 'existence', 'of', 'surface', 'plasmons', 'were', 'found', 'out', 'where', 'they', 'appear', 'as', 'propagating', 'and', 'reactive', 'waves', 'the', 'cutoff', 'conditions', 'for', 'higher', 'order', 'modes', 'were', 'correctly', 'determined']] | [-0.1787521748574908, 0.1771428249581176, -0.05301251262356667, 0.039534508365152043, -0.06921959765573328, -0.12362665348249895, 0.01140845737010129, 0.3924181836540114, -0.21818753881212657, -0.2699447987701543, 0.0741449175130654, -0.29041465562712515, -0.1587251828562379, 0.22268015890337617, 0.057904552388099766, 0.06846766948454573, 0.015171378047880298, -0.02700263468693652, -0.01878343716969234, -0.11354518440429366, 0.29056549983511787, 0.048051959243854005, 0.30805384404511155, 0.023646164024639094, 0.06122026179811198, -0.02311850977436957, -0.01392178901075246, 0.0111253444763447, -0.12290210606429927, 0.0447072339994264, 0.2556093580195468, -0.004336309677804123, 0.20704174849266063, -0.49517613071056005, -0.28483444076968345, 0.006054927210161786, 0.1771667335687127, 0.11115924437728314, -0.026171361386893084, -0.3026431236293412, 0.02485269459220999, -0.0721362551568288, -0.1668115798718558, -0.01627318493876896, 0.009097927980526478, 0.06416406436290094, -0.19232796510670355, 0.08641137111050907, 0.06667680743437618, 0.08197230261243033, -0.07698629445725394, -0.10282980835533695, -0.13175866345897272, 0.07405205773228701, 0.06757085044689834, -0.03823875585671314, 0.139281537991664, -0.10239001394188155, -0.06195478218267421, 0.39223472267656984, -0.09709455998137616, -0.18132266635458616, 0.2090908860087863, -0.16522091433101244, 0.020882099482069115, 0.1993644424877269, 0.21125407551811215, 0.1443428836447817, -0.09955588245309867, 0.02928209172883824, 0.029239961004698882, 0.13737787657855136, 0.1601367788417209, 0.07815951795155505, 0.24843486809746146, 0.1249993569301274, -0.05919516616302938, 0.12070940130510127, -0.12140854301410699, -0.01647153190298084, -0.28810281290890216, -0.14014302543434176, -0.1522500068897348, -0.018203574657289612, -0.034711248789893734, -0.21205366389793873, 0.44375229800889593, 0.01160719178193165, 0.12392978490369316, -0.007007400851005209, 0.22299143308383262, 0.151781649091755, 0.05835295949984498, 0.0748741392515752, 0.3205538645197085, 0.19329653335679434, 0.035378390357099075, -0.2500976329672145, -0.011276045371150921, -0.0016485279241944858] |
1,802.08395 | Towards end-to-end spoken language understanding | Spoken language understanding system is traditionally designed as a pipeline
of a number of components. First, the audio signal is processed by an automatic
speech recognizer for transcription or n-best hypotheses. With the recognition
results, a natural language understanding system classifies the text to
structured data as domain, intent and slots for down-streaming consumers, such
as dialog system, hands-free applications. These components are usually
developed and optimized independently. In this paper, we present our study on
an end-to-end learning system for spoken language understanding. With this
unified approach, we can infer the semantic meaning directly from audio
features without the intermediate text representation. This study showed that
the trained model can achieve reasonable good result and demonstrated that the
model can capture the semantic attention directly from the audio features.
| cs.CL | spoken language understanding system is traditionally designed as a pipeline of a number of components first the audio signal is processed by an automatic speech recognizer for transcription or nbest hypotheses with the recognition results a natural language understanding system classifies the text to structured data as domain intent and slots for downstreaming consumers such as dialog system handsfree applications these components are usually developed and optimized independently in this paper we present our study on an endtoend learning system for spoken language understanding with this unified approach we can infer the semantic meaning directly from audio features without the intermediate text representation this study showed that the trained model can achieve reasonable good result and demonstrated that the model can capture the semantic attention directly from the audio features | [['spoken', 'language', 'understanding', 'system', 'is', 'traditionally', 'designed', 'as', 'a', 'pipeline', 'of', 'a', 'number', 'of', 'components', 'first', 'the', 'audio', 'signal', 'is', 'processed', 'by', 'an', 'automatic', 'speech', 'recognizer', 'for', 'transcription', 'or', 'nbest', 'hypotheses', 'with', 'the', 'recognition', 'results', 'a', 'natural', 'language', 'understanding', 'system', 'classifies', 'the', 'text', 'to', 'structured', 'data', 'as', 'domain', 'intent', 'and', 'slots', 'for', 'downstreaming', 'consumers', 'such', 'as', 'dialog', 'system', 'handsfree', 'applications', 'these', 'components', 'are', 'usually', 'developed', 'and', 'optimized', 'independently', 'in', 'this', 'paper', 'we', 'present', 'our', 'study', 'on', 'an', 'endtoend', 'learning', 'system', 'for', 'spoken', 'language', 'understanding', 'with', 'this', 'unified', 'approach', 'we', 'can', 'infer', 'the', 'semantic', 'meaning', 'directly', 'from', 'audio', 'features', 'without', 'the', 'intermediate', 'text', 'representation', 'this', 'study', 'showed', 'that', 'the', 'trained', 'model', 'can', 'achieve', 'reasonable', 'good', 'result', 'and', 'demonstrated', 'that', 'the', 'model', 'can', 'capture', 'the', 'semantic', 'attention', 'directly', 'from', 'the', 'audio', 'features']] | [-0.0483159727936324, -3.448457327277328e-05, -0.05445846138665309, 0.08144778900761873, -0.1490608948497818, -0.16210384447342502, 0.012957749608904123, 0.42713576844678475, -0.2858503045944067, -0.35084899957157456, 0.047258094385660324, -0.2683026493562815, -0.19461142135103449, 0.20898694252917685, -0.12868765782063396, 0.0748057210746293, 0.14642961206756389, 0.11763725304402985, -0.01101614692642425, -0.22092767361587343, 0.29226207829868567, 0.013813617675063701, 0.34740862981058085, 0.004139019269496202, 0.13285134103280144, -0.03857948121686394, -0.04903283124574675, -0.08968716418424334, -0.031199845281774358, 0.17352710149895686, 0.3902571282707728, 0.2262580374148316, 0.27231493944732044, -0.4071686354958309, -0.23724082494154572, 0.04366699365827326, 0.16486001334806832, 0.11940464846288355, -0.0326095851084504, -0.39352266163780136, 0.12291272157230056, -0.19172816779016733, 0.0641494633952299, -0.1221050455664786, -0.006354073710882893, -0.010819858253503649, -0.2809740748731061, -0.016293436700764757, 0.17167974788373194, 0.10542852240256392, -0.08041956869598765, -0.06908127303378513, 0.03108421947287682, 0.22216753509934417, 0.03530537152233032, 0.08624657083911678, 0.14030281246030846, -0.16760283135629903, -0.1172469837913433, 0.40620198719776596, -0.0881498669489072, -0.23288313968536944, 0.2095764614140185, 0.004256770047000967, -0.15416030531677488, 0.0659793447667303, 0.2407992481110761, 0.06889067045771159, -0.2325392647359807, -0.005060026688554969, -0.055278119595291525, 0.2923737717541651, 0.055505668400571896, -0.0035350058156137284, 0.24110567204815408, 0.2664151235232846, -0.049075739756069825, 0.1411330639017531, -0.05959596879368361, 0.003191400215459558, -0.21916311801626132, -0.14409246411389456, -0.18661497961729764, -0.04705743350339337, -0.06469158463576324, -0.10952902899231189, 0.4029518519814771, 0.20824935445920206, 0.19327854240456452, 0.11110077442672964, 0.3510136912075373, 0.04706438413212219, 0.0846845629123541, 0.03247531437171766, 0.10537389461936142, -0.04046356456461721, 0.1707051968667656, -0.15189239732706203, 0.12283158471915298, 0.0684724699670019] |
1,802.08396 | Bounds on the Zero-Error List-Decoding Capacity of the $q/(q-1)$ Channel | We consider the problem of determining the zero-error list-decoding capacity
of the $q/(q-1)$ channel studied by Elias (1988). The $q/(q-1)$ channel has
input and output alphabet consisting of $q$ symbols, say, $Q =
\{x_1,x_2,\ldots, x_q\}$; when the channel receives an input $x \in Q$, it
outputs a symbol other than $x$ itself. Let $n(m,q,\ell)$ be the smallest $n$
for which there is a code $C \subseteq Q^n$ of $m$ elements such that for every
list $w_1, w_2, \ldots, w_{\ell+1}$ of distinct code-words from $C$, there is a
coordinate $j \in [n]$ that satisfies $\{w_1[j], w_2[j], \ldots,
w_{\ell+1}[j]\} = Q$. We show that for $\epsilon<1/6$, for all large $q$ and
large enough $m$, $n(m,q, \epsilon q\ln{q}) \geq
\Omega(\exp{(q^{1-6\epsilon}/8)}\log_2{m})$. The lower bound obtained by
Fredman and Koml\'{o}s (1984) for perfect hashing implies that $n(m,q,q-1) =
\exp(\Omega(q)) \log_2 m$; similarly, the lower bound obtained by K\"{o}rner
(1986) for nearly-perfect hashing implies that $n(m,q,q) = \exp(\Omega(q))
\log_2 m$. These results show that the zero-error list-decoding capacity of the
$q/(q-1)$ channel with lists of size at most $q$ is exponentially small.
Extending these bounds, Chakraborty et al. (2006) showed that the capacity
remains exponentially small even if the list size is allowed to be as large as
$1.58q$. Our result implies that the zero-error list-decoding capacity of the
$q/(q-1)$ channel with list size $\epsilon q$ for $\epsilon<1/6$ is
$\exp{(\Omega(q^{1-6\epsilon}))}$. This resolves the conjecture raised by
Chakraborty et al. (2006) about the zero-error list-decoding capcity of the
$q/(q-1)$ channel at larger list sizes.
| cs.IT math.IT | we consider the problem of determining the zeroerror listdecoding capacity of the qq1 channel studied by elias 1988 the qq1 channel has input and output alphabet consisting of q symbols say q x_1x_2ldots x_q when the channel receives an input x in q it outputs a symbol other than x itself let nmqell be the smallest n for which there is a code c subseteq qn of m elements such that for every list w_1 w_2 ldots w_ell1 of distinct codewords from c there is a coordinate j in n that satisfies w_1j w_2j ldots w_ell1j q we show that for epsilon16 for all large q and large enough m nmq epsilon qlnq geq omegaexpq16epsilon8log_2m the lower bound obtained by fredman and komlos 1984 for perfect hashing implies that nmqq1 expomegaq log_2 m similarly the lower bound obtained by korner 1986 for nearlyperfect hashing implies that nmqq expomegaq log_2 m these results show that the zeroerror listdecoding capacity of the qq1 channel with lists of size at most q is exponentially small extending these bounds chakraborty et al 2006 showed that the capacity remains exponentially small even if the list size is allowed to be as large as 158q our result implies that the zeroerror listdecoding capacity of the qq1 channel with list size epsilon q for epsilon16 is expomegaq16epsilon this resolves the conjecture raised by chakraborty et al 2006 about the zeroerror listdecoding capcity of the qq1 channel at larger list sizes | [['we', 'consider', 'the', 'problem', 'of', 'determining', 'the', 'zeroerror', 'listdecoding', 'capacity', 'of', 'the', 'qq1', 'channel', 'studied', 'by', 'elias', '1988', 'the', 'qq1', 'channel', 'has', 'input', 'and', 'output', 'alphabet', 'consisting', 'of', 'q', 'symbols', 'say', 'q', 'x_1x_2ldots', 'x_q', 'when', 'the', 'channel', 'receives', 'an', 'input', 'x', 'in', 'q', 'it', 'outputs', 'a', 'symbol', 'other', 'than', 'x', 'itself', 'let', 'nmqell', 'be', 'the', 'smallest', 'n', 'for', 'which', 'there', 'is', 'a', 'code', 'c', 'subseteq', 'qn', 'of', 'm', 'elements', 'such', 'that', 'for', 'every', 'list', 'w_1', 'w_2', 'ldots', 'w_ell1', 'of', 'distinct', 'codewords', 'from', 'c', 'there', 'is', 'a', 'coordinate', 'j', 'in', 'n', 'that', 'satisfies', 'w_1j', 'w_2j', 'ldots', 'w_ell1j', 'q', 'we', 'show', 'that', 'for', 'epsilon16', 'for', 'all', 'large', 'q', 'and', 'large', 'enough', 'm', 'nmq', 'epsilon', 'qlnq', 'geq', 'omegaexpq16epsilon8log_2m', 'the', 'lower', 'bound', 'obtained', 'by', 'fredman', 'and', 'komlos', '1984', 'for', 'perfect', 'hashing', 'implies', 'that', 'nmqq1', 'expomegaq', 'log_2', 'm', 'similarly', 'the', 'lower', 'bound', 'obtained', 'by', 'korner', '1986', 'for', 'nearlyperfect', 'hashing', 'implies', 'that', 'nmqq', 'expomegaq', 'log_2', 'm', 'these', 'results', 'show', 'that', 'the', 'zeroerror', 'listdecoding', 'capacity', 'of', 'the', 'qq1', 'channel', 'with', 'lists', 'of', 'size', 'at', 'most', 'q', 'is', 'exponentially', 'small', 'extending', 'these', 'bounds', 'chakraborty', 'et', 'al', '2006', 'showed', 'that', 'the', 'capacity', 'remains', 'exponentially', 'small', 'even', 'if', 'the', 'list', 'size', 'is', 'allowed', 'to', 'be', 'as', 'large', 'as', '158q', 'our', 'result', 'implies', 'that', 'the', 'zeroerror', 'listdecoding', 'capacity', 'of', 'the', 'qq1', 'channel', 'with', 'list', 'size', 'epsilon', 'q', 'for', 'epsilon16', 'is', 'expomegaq16epsilon', 'this', 'resolves', 'the', 'conjecture', 'raised', 'by', 'chakraborty', 'et', 'al', '2006', 'about', 'the', 'zeroerror', 'listdecoding', 'capcity', 'of', 'the', 'qq1', 'channel', 'at', 'larger', 'list', 'sizes']] | [-0.21100414188895944, 0.13728561269697137, -0.0002796806641101967, 0.005770780739890956, -0.014007760226313741, -0.26904240166605753, 0.1046098538712033, 0.28318677658843505, -0.2787691766765237, -0.3012317814441005, 0.06412439194266932, -0.2912795968856012, -0.08447673313998857, 0.17426219787936673, -0.12528193498632206, 0.03635021955370659, 0.05500961517200306, 0.0776504426340544, -0.015507163951177492, -0.3409530774204215, 0.2647301341390733, 0.06034439587436909, 0.1971617349324083, 0.027557583811477347, 0.047061704029024105, 0.051049143017481154, 0.008145572158089111, -0.028918118585932056, -0.20886714863473974, 0.043230716457822276, 0.2675560529772843, 0.18960299650329168, 0.23081520314869272, -0.2791954371746473, -0.17621485973244705, 0.14425024025215397, 0.15047985583764406, 0.0365524800655973, -0.0013463106860435166, -0.21101972364259305, 0.20187817654759505, -0.15780342705385134, -0.049137046103117636, 0.035409667133658666, 0.17036804144461862, -0.024642502769063265, -0.35994725401094385, 0.025353960684748718, 0.15975405103384668, 0.005409097498258388, 0.04038381520313044, -0.24600263267112937, -0.01113064978353061, 0.10060584941417829, -0.025719789879124075, 0.125389738848197, -0.0032237308065805534, -0.06845154290648754, -0.09767956089423603, 0.3083407177435291, -0.043169576911915065, -0.14729485582706708, 0.08068035789165548, -0.15121278622671636, -0.11258694362586698, 0.14048303876836749, 0.10984440886783596, 0.1332527804292645, -0.03599878852124739, 0.1985797336130346, -0.17909873884545402, 0.1980122785576046, 0.1603014757978734, 0.07927555771032145, 0.08193575750271827, 0.061622341241744476, 0.06361253621304758, 0.15541448189564838, -0.035940502978547166, -0.020873367986702827, -0.3025174383562074, -0.13614935687220528, -0.25800160860274735, 0.1274601212828766, -0.1438137731468737, -0.07701996945334785, 0.23037953126065303, 0.08355566731340955, 0.22904759240804412, 0.1388682602303851, 0.2190991367892602, 0.04933353344041561, 0.043252289932684804, 0.24314179499613275, 0.12602193488060257, 0.16902782801563107, 0.018119896463155094, -0.19087701800023105, 0.09800962395112002, 0.11403002812604392] |
1,802.08397 | Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix
Estimation | Low-rank modeling plays a pivotal role in signal processing and machine
learning, with applications ranging from collaborative filtering, video
surveillance, medical imaging, to dimensionality reduction and adaptive
filtering. Many modern high-dimensional data and interactions thereof can be
modeled as lying approximately in a low-dimensional subspace or manifold,
possibly with additional structures, and its proper exploitations lead to
significant reduction of costs in sensing, computation and storage. In recent
years, there is a plethora of progress in understanding how to exploit low-rank
structures using computationally efficient procedures in a provable manner,
including both convex and nonconvex approaches. On one side, convex relaxations
such as nuclear norm minimization often lead to statistically optimal
procedures for estimating low-rank matrices, where first-order methods are
developed to address the computational challenges; on the other side, there is
emerging evidence that properly designed nonconvex procedures, such as
projected gradient descent, often provide globally optimal solutions with a
much lower computational cost in many problems. This survey article will
provide a unified overview of these recent advances on low-rank matrix
estimation from incomplete measurements. Attention is paid to rigorous
characterization of the performance of these algorithms, and to problems where
the low-rank matrix have additional structural properties that require new
algorithmic designs and theoretical analysis.
| stat.ML cs.IT cs.LG eess.SP math.IT | lowrank modeling plays a pivotal role in signal processing and machine learning with applications ranging from collaborative filtering video surveillance medical imaging to dimensionality reduction and adaptive filtering many modern highdimensional data and interactions thereof can be modeled as lying approximately in a lowdimensional subspace or manifold possibly with additional structures and its proper exploitations lead to significant reduction of costs in sensing computation and storage in recent years there is a plethora of progress in understanding how to exploit lowrank structures using computationally efficient procedures in a provable manner including both convex and nonconvex approaches on one side convex relaxations such as nuclear norm minimization often lead to statistically optimal procedures for estimating lowrank matrices where firstorder methods are developed to address the computational challenges on the other side there is emerging evidence that properly designed nonconvex procedures such as projected gradient descent often provide globally optimal solutions with a much lower computational cost in many problems this survey article will provide a unified overview of these recent advances on lowrank matrix estimation from incomplete measurements attention is paid to rigorous characterization of the performance of these algorithms and to problems where the lowrank matrix have additional structural properties that require new algorithmic designs and theoretical analysis | [['lowrank', 'modeling', 'plays', 'a', 'pivotal', 'role', 'in', 'signal', 'processing', 'and', 'machine', 'learning', 'with', 'applications', 'ranging', 'from', 'collaborative', 'filtering', 'video', 'surveillance', 'medical', 'imaging', 'to', 'dimensionality', 'reduction', 'and', 'adaptive', 'filtering', 'many', 'modern', 'highdimensional', 'data', 'and', 'interactions', 'thereof', 'can', 'be', 'modeled', 'as', 'lying', 'approximately', 'in', 'a', 'lowdimensional', 'subspace', 'or', 'manifold', 'possibly', 'with', 'additional', 'structures', 'and', 'its', 'proper', 'exploitations', 'lead', 'to', 'significant', 'reduction', 'of', 'costs', 'in', 'sensing', 'computation', 'and', 'storage', 'in', 'recent', 'years', 'there', 'is', 'a', 'plethora', 'of', 'progress', 'in', 'understanding', 'how', 'to', 'exploit', 'lowrank', 'structures', 'using', 'computationally', 'efficient', 'procedures', 'in', 'a', 'provable', 'manner', 'including', 'both', 'convex', 'and', 'nonconvex', 'approaches', 'on', 'one', 'side', 'convex', 'relaxations', 'such', 'as', 'nuclear', 'norm', 'minimization', 'often', 'lead', 'to', 'statistically', 'optimal', 'procedures', 'for', 'estimating', 'lowrank', 'matrices', 'where', 'firstorder', 'methods', 'are', 'developed', 'to', 'address', 'the', 'computational', 'challenges', 'on', 'the', 'other', 'side', 'there', 'is', 'emerging', 'evidence', 'that', 'properly', 'designed', 'nonconvex', 'procedures', 'such', 'as', 'projected', 'gradient', 'descent', 'often', 'provide', 'globally', 'optimal', 'solutions', 'with', 'a', 'much', 'lower', 'computational', 'cost', 'in', 'many', 'problems', 'this', 'survey', 'article', 'will', 'provide', 'a', 'unified', 'overview', 'of', 'these', 'recent', 'advances', 'on', 'lowrank', 'matrix', 'estimation', 'from', 'incomplete', 'measurements', 'attention', 'is', 'paid', 'to', 'rigorous', 'characterization', 'of', 'the', 'performance', 'of', 'these', 'algorithms', 'and', 'to', 'problems', 'where', 'the', 'lowrank', 'matrix', 'have', 'additional', 'structural', 'properties', 'that', 'require', 'new', 'algorithmic', 'designs', 'and', 'theoretical', 'analysis']] | [-0.05848783407782321, -0.007760546158981294, -0.06833070453607294, 0.06544576886013741, -0.11905831303178835, -0.1739906195524292, 0.013251808410411915, 0.4358388838523891, -0.3164143549376884, -0.31951184245945813, 0.19078580200360962, -0.25505540293838397, -0.20184990239795297, 0.19872663706281365, -0.14363380083397295, 0.12927413642459074, 0.11185479291284886, -0.026721193280256836, -0.12472599986050717, -0.25005008574058035, 0.23861974834905525, 0.05449207159780109, 0.3026503430502579, 0.02369671149062924, 0.09859219916227001, 0.018013872897427063, -0.05309610565312211, 0.03251780067792144, -0.0738483015809554, 0.20657563952352995, 0.392848841981434, 0.21691290823554693, 0.3765710308843364, -0.48466708832935324, -0.23049007315869227, 0.13216868867479767, 0.1532453119759269, 0.1065695511665231, -0.1203319795173369, -0.2427719928046617, 0.04597714205178468, -0.1334114205181742, -0.028097613390015725, -0.17455971472918463, -0.02750852186895477, -0.011510719728763573, -0.28933227678275075, 0.061756780760613486, 0.056110615652869456, 0.07786547183870705, -0.035376351761582416, -0.1906482293852605, 0.08838979231390673, 0.09520617142753998, 0.0708894334395434, 0.0411047697147856, 0.13415508429618336, -0.14021999095544183, -0.14757112414988044, 0.37327870370175403, 0.013515574873263877, -0.2117746761214221, 0.21819253174068692, -0.03365117512014247, -0.18893406093187737, 0.15296131105648014, 0.26774447176453225, 0.07812413730649635, -0.1501148853522654, 0.09143529313755258, -0.002658956807303744, 0.1519019779516384, 0.01846950188673173, 0.08628442692525613, 0.1590830525036346, 0.19693995246556228, 0.15670235738322774, 0.0870443689052011, -0.04248389695063592, -0.11231437624799302, -0.2224700585536014, -0.08418326262415995, -0.17620998915383376, 0.016937069568554692, -0.11335397688750302, -0.18371833500882181, 0.3368672795656424, 0.1366083912524538, 0.19623616419630707, 0.015090097252910849, 0.36357627113634056, 0.05535776459370167, 0.05755517437669019, 0.08130621299586402, 0.19448857504287914, 0.1395528117338052, 0.09887177931208359, -0.17011407722020522, 0.07548152788792951, 0.03968853049781711] |
1,802.08398 | Using first-principles calculations to screen for fragile magnetism:
Case study of LaCrGe3 and LaCrSb3 | In this paper, we present a coupled experimental/theoretical investigation of
pressure effect on the ferromagnetism of LaCrGe3 and LaCrSb3 compounds. The
magnetic, electronic, elastic and mechanical properties of LaCrGe3 and LaCrSb3
at ambient condition are studied by first-principles density functional theory
calculations. The pressure dependences of the magnetic properties of LaCrGe3
and LaCrSb3 are also investigated. The ferromagnetism in LaCrGe3 is rather
fragile with a ferro- to paramagnetic transition at a relatively small pressure
(around 7 GPa from our calculations, and 2 GPa in experiments). The key
parameter controlling the magnetic properties of LaCrGe3 is found to be the
proximity of the Cr DOS to the Fermi surface, a proximity that is strongly
correlated to the distance between Cr atoms along the c-axis, suggesting that
there would be a simple way to suppress magnetism in systems with one
dimensional arrangement of magnetic atoms. By contrast, the ferromagnetism in
LaCrSb3 is not fragile. Our calculation results are consistent with our
experimental results and demonstrate the feasibility of using first-principles
calculations to aid experimental explorations in screening for materials with
fragile magnetism.
| cond-mat.mtrl-sci | in this paper we present a coupled experimentaltheoretical investigation of pressure effect on the ferromagnetism of lacrge3 and lacrsb3 compounds the magnetic electronic elastic and mechanical properties of lacrge3 and lacrsb3 at ambient condition are studied by firstprinciples density functional theory calculations the pressure dependences of the magnetic properties of lacrge3 and lacrsb3 are also investigated the ferromagnetism in lacrge3 is rather fragile with a ferro to paramagnetic transition at a relatively small pressure around 7 gpa from our calculations and 2 gpa in experiments the key parameter controlling the magnetic properties of lacrge3 is found to be the proximity of the cr dos to the fermi surface a proximity that is strongly correlated to the distance between cr atoms along the caxis suggesting that there would be a simple way to suppress magnetism in systems with one dimensional arrangement of magnetic atoms by contrast the ferromagnetism in lacrsb3 is not fragile our calculation results are consistent with our experimental results and demonstrate the feasibility of using firstprinciples calculations to aid experimental explorations in screening for materials with fragile magnetism | [['in', 'this', 'paper', 'we', 'present', 'a', 'coupled', 'experimentaltheoretical', 'investigation', 'of', 'pressure', 'effect', 'on', 'the', 'ferromagnetism', 'of', 'lacrge3', 'and', 'lacrsb3', 'compounds', 'the', 'magnetic', 'electronic', 'elastic', 'and', 'mechanical', 'properties', 'of', 'lacrge3', 'and', 'lacrsb3', 'at', 'ambient', 'condition', 'are', 'studied', 'by', 'firstprinciples', 'density', 'functional', 'theory', 'calculations', 'the', 'pressure', 'dependences', 'of', 'the', 'magnetic', 'properties', 'of', 'lacrge3', 'and', 'lacrsb3', 'are', 'also', 'investigated', 'the', 'ferromagnetism', 'in', 'lacrge3', 'is', 'rather', 'fragile', 'with', 'a', 'ferro', 'to', 'paramagnetic', 'transition', 'at', 'a', 'relatively', 'small', 'pressure', 'around', '7', 'gpa', 'from', 'our', 'calculations', 'and', '2', 'gpa', 'in', 'experiments', 'the', 'key', 'parameter', 'controlling', 'the', 'magnetic', 'properties', 'of', 'lacrge3', 'is', 'found', 'to', 'be', 'the', 'proximity', 'of', 'the', 'cr', 'dos', 'to', 'the', 'fermi', 'surface', 'a', 'proximity', 'that', 'is', 'strongly', 'correlated', 'to', 'the', 'distance', 'between', 'cr', 'atoms', 'along', 'the', 'caxis', 'suggesting', 'that', 'there', 'would', 'be', 'a', 'simple', 'way', 'to', 'suppress', 'magnetism', 'in', 'systems', 'with', 'one', 'dimensional', 'arrangement', 'of', 'magnetic', 'atoms', 'by', 'contrast', 'the', 'ferromagnetism', 'in', 'lacrsb3', 'is', 'not', 'fragile', 'our', 'calculation', 'results', 'are', 'consistent', 'with', 'our', 'experimental', 'results', 'and', 'demonstrate', 'the', 'feasibility', 'of', 'using', 'firstprinciples', 'calculations', 'to', 'aid', 'experimental', 'explorations', 'in', 'screening', 'for', 'materials', 'with', 'fragile', 'magnetism']] | [-0.14416372026058122, 0.19181344053552796, -0.05002497482217021, 0.008398217301065516, -0.01446951421805554, -0.09991741454383979, 0.08684820826682779, 0.38973478699206476, -0.24594643831046092, -0.29093694715864127, 0.014598410813293109, -0.3330445402405328, -0.1537152352044359, 0.17242676517538105, 0.04576822936554284, -0.005000804763080346, -0.018440405817495453, -0.029500746344112688, -0.1224512874847278, -0.2130696768549064, 0.30404159975393363, 0.07258077035658062, 0.28312856054657864, 0.11900935950947719, -0.008046971512441006, -0.031867705929067194, 0.12596289080101997, 0.08581170883618243, -0.14426763148035712, 0.09752513647027727, 0.2546338698865535, -0.06619872477992127, 0.2165338133772214, -0.4445831310003996, -0.21581078488379718, -0.014078759577953154, 0.06077115652280756, 0.12235963160379065, -0.0923354511440266, -0.2819172543163101, 0.12098714388493034, -0.10069214008593311, -0.14430746995947427, -0.14084362021078253, -0.03476391721309887, 0.013645104831084609, -0.23939943755200754, 0.11625337496952852, 0.03279298402032711, 0.13102980472115935, -0.15130346464122543, -0.11618737696876956, -0.05897243134936111, 0.02045998948160559, 0.05608862347693907, 0.07594364568875689, 0.1698212176742446, -0.0926287996665552, -0.08975405720993876, 0.39435688524196544, -0.027941343286592098, -0.07776995232949654, 0.2256762283595486, -0.1801541173675408, -0.11907548735228678, 0.14769207456459602, 0.11679942963722473, 0.07818925965111703, -0.12672949408232753, 0.06902648868983507, 0.0014325092918524105, 0.17373232866326968, -0.005138919190762358, 0.04491008410469577, 0.20666909624511998, 0.1918877384573635, 0.01781325546714167, 0.11563992320831555, -0.09611149686647372, -0.03888395193239881, -0.21904390127294593, -0.17333921457951268, -0.209037130088028, 0.033961472540088126, -0.05069523238748338, -0.16880761282259804, 0.3395805687240985, 0.16749178834822184, 0.17583556292423358, -0.06702386355933009, 0.25133793897564627, 0.052702527650399136, 0.060104927407681114, 0.05707621596520766, 0.28126934591370323, 0.2076044966544335, 0.07916795240146005, -0.2846156800786654, 0.10740144986193627, -0.011487327672916258] |
1,802.08399 | Phonon Interferometry for Measuring Quantum Decoherence | Experimental observation of the decoherence of macroscopic objects is of
fundamental importance to the study of quantum collapse models and the quantum
to classical transition. Optomechanics is a promising field for the study of
such models because of its fine control and readout of mechanical motion.
Nevertheless, it is challenging to monitor a mechanical superposition state for
long enough to investigate this transition. We present a scheme for entangling
two mechanical resonators in spatial superposition states such that all quantum
information is stored in the mechanical resonators. The scheme is general and
applies to any optomechanical system with multiple mechanical modes. By
analytic and numeric modeling, we show that the scheme is resilient to
experimental imperfections such as incomplete pre-cooling, faulty postselection
and inefficient optomechanical coupling. This proposed procedure overcomes
limitations of previously proposed schemes that have so far hindered the study
of macroscopic quantum dynamics.
| quant-ph physics.optics | experimental observation of the decoherence of macroscopic objects is of fundamental importance to the study of quantum collapse models and the quantum to classical transition optomechanics is a promising field for the study of such models because of its fine control and readout of mechanical motion nevertheless it is challenging to monitor a mechanical superposition state for long enough to investigate this transition we present a scheme for entangling two mechanical resonators in spatial superposition states such that all quantum information is stored in the mechanical resonators the scheme is general and applies to any optomechanical system with multiple mechanical modes by analytic and numeric modeling we show that the scheme is resilient to experimental imperfections such as incomplete precooling faulty postselection and inefficient optomechanical coupling this proposed procedure overcomes limitations of previously proposed schemes that have so far hindered the study of macroscopic quantum dynamics | [['experimental', 'observation', 'of', 'the', 'decoherence', 'of', 'macroscopic', 'objects', 'is', 'of', 'fundamental', 'importance', 'to', 'the', 'study', 'of', 'quantum', 'collapse', 'models', 'and', 'the', 'quantum', 'to', 'classical', 'transition', 'optomechanics', 'is', 'a', 'promising', 'field', 'for', 'the', 'study', 'of', 'such', 'models', 'because', 'of', 'its', 'fine', 'control', 'and', 'readout', 'of', 'mechanical', 'motion', 'nevertheless', 'it', 'is', 'challenging', 'to', 'monitor', 'a', 'mechanical', 'superposition', 'state', 'for', 'long', 'enough', 'to', 'investigate', 'this', 'transition', 'we', 'present', 'a', 'scheme', 'for', 'entangling', 'two', 'mechanical', 'resonators', 'in', 'spatial', 'superposition', 'states', 'such', 'that', 'all', 'quantum', 'information', 'is', 'stored', 'in', 'the', 'mechanical', 'resonators', 'the', 'scheme', 'is', 'general', 'and', 'applies', 'to', 'any', 'optomechanical', 'system', 'with', 'multiple', 'mechanical', 'modes', 'by', 'analytic', 'and', 'numeric', 'modeling', 'we', 'show', 'that', 'the', 'scheme', 'is', 'resilient', 'to', 'experimental', 'imperfections', 'such', 'as', 'incomplete', 'precooling', 'faulty', 'postselection', 'and', 'inefficient', 'optomechanical', 'coupling', 'this', 'proposed', 'procedure', 'overcomes', 'limitations', 'of', 'previously', 'proposed', 'schemes', 'that', 'have', 'so', 'far', 'hindered', 'the', 'study', 'of', 'macroscopic', 'quantum', 'dynamics']] | [-0.15071388356043153, 0.14927041077705688, -0.06477701158760345, 0.008214202924385948, -0.054949981106241066, -0.19704360563359033, 0.03967149880848672, 0.3702592032974305, -0.26185811374795764, -0.2734257207086233, 0.06604193607648222, -0.22731336085317172, -0.15512594647629008, 0.22617480448408894, -0.07581098196034923, 0.1438667849104928, 0.08011080642320113, -0.011418398496796926, 0.0019485420038706737, -0.17069885148571115, 0.2940377435146206, 0.04744123041387392, 0.32075819357342966, 0.03912866003619992, 0.15069203703482445, -0.025498026358410204, 0.05612716234722876, -0.00102366520768057, -0.09836807786976426, 0.09972623981852786, 0.27360403520113524, 0.09062980587294402, 0.295869163285354, -0.44742532309195765, -0.24503524314567499, 0.08693213214258957, 0.11840330492322372, 0.21145947354730882, -0.02475357145606859, -0.28658292290103965, 0.0759471063223055, -0.1711975760432598, -0.09969535816703247, -0.14849345748988937, 0.0165600807650002, -0.010351254316110623, -0.2290127128745391, 0.058645891066328046, 0.07626908242922557, 0.027579610523040574, -0.03523241266869774, -0.011165320527203993, 0.05053655824254025, 0.1263494659530171, -0.025586108463395336, -0.0203173742621614, 0.17292002706839513, -0.1365901064414735, -0.15041314537177652, 0.40055686410848207, -0.0022629812417220172, -0.18593987015599053, 0.21725155914374564, -0.10555475078561433, -0.09330718288332071, 0.10102283785339726, 0.13848042166999172, 0.09263595687353039, -0.13663100005344372, 0.03196731986827217, 0.019623449008452566, 0.18389699835177153, 0.034022603917560755, 0.14368077824474312, 0.18824770034463081, 0.18749504580404863, 0.03466353272821448, 0.1712310957580435, -0.06620488749587372, -0.13102460859266862, -0.2991420146694235, -0.16904899649113123, -0.2364033462626426, 0.08359124732191024, -0.047329030037448545, -0.17467841576172471, 0.3635910770974502, 0.19543584337424524, 0.14644515872869182, -0.019857841834094222, 0.3600212853618783, 0.09166815481866289, 0.06357820656099548, 0.010114077437184241, 0.3215532373662477, 0.16109099109140415, 0.050585001668803496, -0.30513689688036905, 0.034630681507684904, -0.01838338364247386] |
1,802.084 | The Squared Coefficient of Variation for MMPP is Greater than Unity | Folklore often treats the Markov Modulated Poisson Process as bursty because
the variance divided by the expectation of counts is greater than unity. When
viewed through the lens of the inter-event process, this ideally corresponds to
a squared coefficient of variation greater than unity. As this has not been
proved to date, we provide a proof together with an associated stochastic order
relation.
| math.PR | folklore often treats the markov modulated poisson process as bursty because the variance divided by the expectation of counts is greater than unity when viewed through the lens of the interevent process this ideally corresponds to a squared coefficient of variation greater than unity as this has not been proved to date we provide a proof together with an associated stochastic order relation | [['folklore', 'often', 'treats', 'the', 'markov', 'modulated', 'poisson', 'process', 'as', 'bursty', 'because', 'the', 'variance', 'divided', 'by', 'the', 'expectation', 'of', 'counts', 'is', 'greater', 'than', 'unity', 'when', 'viewed', 'through', 'the', 'lens', 'of', 'the', 'interevent', 'process', 'this', 'ideally', 'corresponds', 'to', 'a', 'squared', 'coefficient', 'of', 'variation', 'greater', 'than', 'unity', 'as', 'this', 'has', 'not', 'been', 'proved', 'to', 'date', 'we', 'provide', 'a', 'proof', 'together', 'with', 'an', 'associated', 'stochastic', 'order', 'relation']] | [-0.10126525692693475, 0.11520139993716305, -0.08588344118897877, 0.11860340153679505, -0.08491350805002545, -0.10631614519904058, 0.015632563217040447, 0.34196391165079104, -0.2625468035527904, -0.2962076696788981, 0.1000690876934973, -0.26053650458417243, -0.12947563373941987, 0.2020297964946145, -0.0901924444672962, 0.008308245135205132, -0.0027090060997695203, 0.09565796948172936, -0.029727747207433576, -0.2464488252021727, 0.28162993712809, 0.13167416027909706, 0.26425701031638754, -0.021458942265737625, 0.15303027263236424, 0.019242575399518486, -0.07254219690840395, 0.003468319138009397, -0.11237518501187128, 0.07218264853433957, 0.22721705216145704, 0.07355824040086378, 0.3081718004116463, -0.36843310128010454, -0.2051713043705575, 0.17459889421505587, 0.2127395496654716, 0.0447648326969809, 0.041387134627069506, -0.24380479760039303, 0.11155495964108951, -0.1713123990754996, -0.12190260091752168, 0.018007337430303562, 0.015112988340357939, 0.012836819603329613, -0.2643308561842238, 0.11856111740723016, 0.08947384886680142, 0.06892909807345224, 0.03300122224858829, -0.14825687636547383, 0.0005090341326736269, 0.09534104901508221, 0.09145653662401149, 0.05585369874911737, 0.0895769395422013, -0.08903308090798202, -0.12365474114342341, 0.3905877200886607, -0.06935275849814172, -0.2248863972509132, 0.1438361123529455, -0.1691674161776309, -0.08717551670732006, 0.19148361141837777, 0.12076070308426602, 0.08845209328102924, -0.1517670800558768, 0.009966275499512752, -0.01611677354704293, 0.2192944152361994, 0.056040060248166795, 0.0015645450247185571, 0.18793343847233152, 0.16616698139761057, 0.10472010468531932, 0.17426794733379095, -0.027678190199251745, -0.1485188581818153, -0.28296963557867066, -0.16582785326514451, -0.21393149629944846, 0.13822748009803787, -0.11418866417888138, -0.17581045068615664, 0.304905071765894, 0.1365833112910863, 0.24527370066396773, 0.11284714842599536, 0.2801984746068243, 0.2338420035694504, 0.08501502223283289, 0.015000277225645111, 0.18881209858412307, 0.15538339635416393, 0.08272167876185406, -0.12052889751447808, 0.16654952079619442, 0.05129794776439667] |
1,802.08401 | Novel Approaches to Accelerating the Convergence Rate of Markov Decision
Process for Search Result Diversification | Recently, some studies have utilized the Markov Decision Process for
diversifying (MDP-DIV) the search results in information retrieval. Though
promising performances can be delivered, MDP-DIV suffers from a very slow
convergence, which hinders its usability in real applications. In this paper,
we aim to promote the performance of MDP-DIV by speeding up the convergence
rate without much accuracy sacrifice. The slow convergence is incurred by two
main reasons: the large action space and data scarcity. On the one hand, the
sequential decision making at each position needs to evaluate the
query-document relevance for all the candidate set, which results in a huge
searching space for MDP; on the other hand, due to the data scarcity, the agent
has to proceed more "trial and error" interactions with the environment. To
tackle this problem, we propose MDP-DIV-kNN and MDP-DIV-NTN methods. The
MDP-DIV-kNN method adopts a $k$ nearest neighbor strategy, i.e., discarding the
$k$ nearest neighbors of the recently-selected action (document), to reduce the
diversification searching space. The MDP-DIV-NTN employs a pre-trained
diversification neural tensor network (NTN-DIV) as the evaluation model, and
combines the results with MDP to produce the final ranking solution. The
experiment results demonstrate that the two proposed methods indeed accelerate
the convergence rate of the MDP-DIV, which is 3x faster, while the accuracies
produced barely degrade, or even are better.
| cs.IR | recently some studies have utilized the markov decision process for diversifying mdpdiv the search results in information retrieval though promising performances can be delivered mdpdiv suffers from a very slow convergence which hinders its usability in real applications in this paper we aim to promote the performance of mdpdiv by speeding up the convergence rate without much accuracy sacrifice the slow convergence is incurred by two main reasons the large action space and data scarcity on the one hand the sequential decision making at each position needs to evaluate the querydocument relevance for all the candidate set which results in a huge searching space for mdp on the other hand due to the data scarcity the agent has to proceed more trial and error interactions with the environment to tackle this problem we propose mdpdivknn and mdpdivntn methods the mdpdivknn method adopts a k nearest neighbor strategy ie discarding the k nearest neighbors of the recentlyselected action document to reduce the diversification searching space the mdpdivntn employs a pretrained diversification neural tensor network ntndiv as the evaluation model and combines the results with mdp to produce the final ranking solution the experiment results demonstrate that the two proposed methods indeed accelerate the convergence rate of the mdpdiv which is 3x faster while the accuracies produced barely degrade or even are better | [['recently', 'some', 'studies', 'have', 'utilized', 'the', 'markov', 'decision', 'process', 'for', 'diversifying', 'mdpdiv', 'the', 'search', 'results', 'in', 'information', 'retrieval', 'though', 'promising', 'performances', 'can', 'be', 'delivered', 'mdpdiv', 'suffers', 'from', 'a', 'very', 'slow', 'convergence', 'which', 'hinders', 'its', 'usability', 'in', 'real', 'applications', 'in', 'this', 'paper', 'we', 'aim', 'to', 'promote', 'the', 'performance', 'of', 'mdpdiv', 'by', 'speeding', 'up', 'the', 'convergence', 'rate', 'without', 'much', 'accuracy', 'sacrifice', 'the', 'slow', 'convergence', 'is', 'incurred', 'by', 'two', 'main', 'reasons', 'the', 'large', 'action', 'space', 'and', 'data', 'scarcity', 'on', 'the', 'one', 'hand', 'the', 'sequential', 'decision', 'making', 'at', 'each', 'position', 'needs', 'to', 'evaluate', 'the', 'querydocument', 'relevance', 'for', 'all', 'the', 'candidate', 'set', 'which', 'results', 'in', 'a', 'huge', 'searching', 'space', 'for', 'mdp', 'on', 'the', 'other', 'hand', 'due', 'to', 'the', 'data', 'scarcity', 'the', 'agent', 'has', 'to', 'proceed', 'more', 'trial', 'and', 'error', 'interactions', 'with', 'the', 'environment', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'mdpdivknn', 'and', 'mdpdivntn', 'methods', 'the', 'mdpdivknn', 'method', 'adopts', 'a', 'k', 'nearest', 'neighbor', 'strategy', 'ie', 'discarding', 'the', 'k', 'nearest', 'neighbors', 'of', 'the', 'recentlyselected', 'action', 'document', 'to', 'reduce', 'the', 'diversification', 'searching', 'space', 'the', 'mdpdivntn', 'employs', 'a', 'pretrained', 'diversification', 'neural', 'tensor', 'network', 'ntndiv', 'as', 'the', 'evaluation', 'model', 'and', 'combines', 'the', 'results', 'with', 'mdp', 'to', 'produce', 'the', 'final', 'ranking', 'solution', 'the', 'experiment', 'results', 'demonstrate', 'that', 'the', 'two', 'proposed', 'methods', 'indeed', 'accelerate', 'the', 'convergence', 'rate', 'of', 'the', 'mdpdiv', 'which', 'is', '3x', 'faster', 'while', 'the', 'accuracies', 'produced', 'barely', 'degrade', 'or', 'even', 'are', 'better']] | [-0.056812608671417936, 0.03277332353037457, -0.042787661179521146, 0.07144125675039567, -0.11056427958064041, -0.144418000668114, 0.10469719711203822, 0.40715870680341626, -0.28278622983976504, -0.31265850026420383, 0.13224937433680128, -0.27847129963338374, -0.12460616960861655, 0.18046472249687975, -0.07434014100094087, 0.05730016788570644, 0.13515304450465496, 0.06706348968626455, -0.06897092123927419, -0.3225319996725248, 0.2789800061129553, 0.10382828942694983, 0.31797386715621795, 0.022216801598754735, 0.09600047418782705, -0.012189159213110458, -0.03217073488807262, -0.02393350529167693, -0.05434598030950901, 0.14367454369541605, 0.2622982130429253, 0.18633378218794458, 0.3551190957080486, -0.3831685985893358, -0.18766686575998942, 0.1350856629568477, 0.13987555660220774, 0.1103558857573283, -0.045029513899109676, -0.3029404464015347, 0.11358065840160084, -0.15852884407653364, -0.05364904044802452, -0.11826067477434896, -0.04032352965455069, -0.001014573140838725, -0.283828575402325, 0.020975512933245927, 0.055869598915464745, 0.0024919479416661656, -0.046048298627029846, -0.1307727061926799, 0.01458885817420344, 0.15598788656792495, 0.088874165490026, 0.07372153627139322, 0.12179672405080394, -0.15698425931024207, -0.14776592987378367, 0.4026165470740823, -0.06986777889325695, -0.19987735964011313, 0.22857830715149122, -0.09366615082971146, -0.1250093084391813, 0.16532491704443644, 0.2031757092249558, 0.11843475372182628, -0.15679898619175303, 0.04007013712273261, 0.03635241648853692, 0.15174360170224033, 0.04302925990981071, 0.014517760191242709, 0.1419996792374742, 0.23384159092986306, 0.08694446601385121, 0.13757331614073928, -0.10135709850637373, -0.1132383197047856, -0.19593580509860847, -0.13807793123712547, -0.1904676834451641, -0.01970460844783892, -0.11856535993933374, -0.09702702370407276, 0.36682029143354833, 0.22537620670790243, 0.20133879735529814, 0.08497176246533474, 0.32726301420913184, 0.07087477404782602, 0.0846731198919114, 0.10335845486910711, 0.22509814269020395, 0.018862533520603943, 0.10881058578812626, -0.22175307819987972, 0.14665406859848043, 0.06653641007494095] |
1,802.08402 | Adaptive specular reflection detection and inpainting in colonoscopy
video frames | Colonoscopy video frames might be contaminated by bright spots with
unsaturated values known as specular reflection. Detection and removal of such
reflections could enhance the quality of colonoscopy images and facilitate
diagnosis procedure. In this paper we propose a novel two-phase method for this
purpose, consisting of detection and removal phases. In the detection phase, we
employ both HSV and RGB color space information for segmentation of specular
reflections. We first train a non-linear SVM for selecting a color space based
on image statistical features extracted from each channel of the color spaces.
Then, a cost function for detection of specular reflections is introduced. In
the removal phase, we propose a two-step inpainting method which consists of
appropriate replacement patch selection and removal of the blockiness effects.
The proposed method is evaluated by testing on an available colonoscopy image
database where accuracy and Dice score of 99.68% and 71.79% are achieved
respectively.
| cs.CV | colonoscopy video frames might be contaminated by bright spots with unsaturated values known as specular reflection detection and removal of such reflections could enhance the quality of colonoscopy images and facilitate diagnosis procedure in this paper we propose a novel twophase method for this purpose consisting of detection and removal phases in the detection phase we employ both hsv and rgb color space information for segmentation of specular reflections we first train a nonlinear svm for selecting a color space based on image statistical features extracted from each channel of the color spaces then a cost function for detection of specular reflections is introduced in the removal phase we propose a twostep inpainting method which consists of appropriate replacement patch selection and removal of the blockiness effects the proposed method is evaluated by testing on an available colonoscopy image database where accuracy and dice score of 9968 and 7179 are achieved respectively | [['colonoscopy', 'video', 'frames', 'might', 'be', 'contaminated', 'by', 'bright', 'spots', 'with', 'unsaturated', 'values', 'known', 'as', 'specular', 'reflection', 'detection', 'and', 'removal', 'of', 'such', 'reflections', 'could', 'enhance', 'the', 'quality', 'of', 'colonoscopy', 'images', 'and', 'facilitate', 'diagnosis', 'procedure', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'twophase', 'method', 'for', 'this', 'purpose', 'consisting', 'of', 'detection', 'and', 'removal', 'phases', 'in', 'the', 'detection', 'phase', 'we', 'employ', 'both', 'hsv', 'and', 'rgb', 'color', 'space', 'information', 'for', 'segmentation', 'of', 'specular', 'reflections', 'we', 'first', 'train', 'a', 'nonlinear', 'svm', 'for', 'selecting', 'a', 'color', 'space', 'based', 'on', 'image', 'statistical', 'features', 'extracted', 'from', 'each', 'channel', 'of', 'the', 'color', 'spaces', 'then', 'a', 'cost', 'function', 'for', 'detection', 'of', 'specular', 'reflections', 'is', 'introduced', 'in', 'the', 'removal', 'phase', 'we', 'propose', 'a', 'twostep', 'inpainting', 'method', 'which', 'consists', 'of', 'appropriate', 'replacement', 'patch', 'selection', 'and', 'removal', 'of', 'the', 'blockiness', 'effects', 'the', 'proposed', 'method', 'is', 'evaluated', 'by', 'testing', 'on', 'an', 'available', 'colonoscopy', 'image', 'database', 'where', 'accuracy', 'and', 'dice', 'score', 'of', '9968', 'and', '7179', 'are', 'achieved', 'respectively']] | [-0.03714387882994303, 0.030006463492280706, -0.08594092385171118, 0.01376656525681992, -0.06906320290356283, -0.13052259096012309, 0.05522828753374591, 0.4527457035732585, -0.21483681183185008, -0.3164036844653503, 0.11280772461330778, -0.2737366361111797, -0.15349516760872442, 0.13233411456735816, -0.1659110432848433, 0.050886740707672844, 0.09041721628059861, 0.026874369679524605, -0.0658591756028962, -0.24528346723639438, 0.29595314709867493, 0.0037352602191836827, 0.33961951326184125, 0.027349807217174414, 0.12336925940359912, 0.07401034223002116, -0.08839072556148549, -0.002538625764990509, -0.0494102333542823, 0.11226817922333614, 0.28966972418129444, 0.138525853365265, 0.23913552701189522, -0.36965622664090025, -0.2389849035735458, 0.07617076884242799, 0.1229921702248513, 0.08697646349862785, -0.1146810017788277, -0.36506674433472436, 0.08316489160430944, -0.10492242159439862, -0.003588758792962558, -0.07297149183543164, -0.022587548968357508, -0.04735829184041513, -0.3279858569781117, 0.09026853413327246, 0.04887118643775755, 0.064616972828802, -0.09423906397188564, -0.10805775148528844, 0.004464474068769556, 0.13884948300111372, -0.034014571863627496, 0.03757665977298301, 0.1321457670724007, -0.19144961406131406, -0.1133339019382021, 0.39617332707572456, -0.06859748676073867, -0.18258928181295167, 0.1630975806192088, -0.035589871727741966, -0.10202297832298753, 0.17393764149743002, 0.2083662350820871, 0.16452917401734368, -0.16964944736686666, -0.06618903257185593, -0.01393396016487864, 0.16014973241959188, 0.12309068595622019, -0.0059462386053919, 0.1818626503959693, 0.22808579797702316, 0.030732361822996584, 0.18677958872227848, -0.2641660030221949, 0.04448412574553209, -0.2744203660519954, -0.1432321003841742, -0.18689164673502476, -0.06802421703391912, -0.08285556885574571, -0.16852724708814099, 0.3999325465966041, 0.19336581599223274, 0.20189240597965602, 0.012205766792261097, 0.3711113681144001, 0.07001125374546781, 0.09133653298933182, 0.01718330120094219, 0.17754489027999884, 0.04351626333644897, 0.04471935611526599, -0.18595098012546385, 0.0774745498691371, 0.10474038791429523] |
1,802.08403 | Blow up of solutions for semilinear wave equations with noneffective
damping | In this paper, we study the finite-time blow up of solutions to the following
semilinear wave equation with time-dependent damping \[ \partial_t^2u-\Delta
u+\frac{\mu}{1+t}\partial_tu=|u|^p \] in $\mathbb{R}_{+}\times\mathbb{R}^n$.
More precisely, for $0\leq\mu\leq 2,\mu \neq1$ and $n\geq 2$, there is no
global solution for $1<p<p_S(n+\mu)$, where $p_S(k)$ is the $k$-dimensional
Strauss exponent and a life-span of the blow up solution will be obtained. Our
work is an extension of \cite{IS}, where the authors proved a similar blow up
result with a larger range of $\mu$. However, we obtain a better life-span
estimate when $\mu\in(0,1)\cup(1,2)$ by using a different method.
| math.AP | in this paper we study the finitetime blow up of solutions to the following semilinear wave equation with timedependent damping partial_t2udelta ufracmu1tpartial_tuup in mathbbr_timesmathbbrn more precisely for 0leqmuleq 2mu neq1 and ngeq 2 there is no global solution for 1pp_snmu where p_sk is the kdimensional strauss exponent and a lifespan of the blow up solution will be obtained our work is an extension of citeis where the authors proved a similar blow up result with a larger range of mu however we obtain a better lifespan estimate when muin01cup12 by using a different method | [['in', 'this', 'paper', 'we', 'study', 'the', 'finitetime', 'blow', 'up', 'of', 'solutions', 'to', 'the', 'following', 'semilinear', 'wave', 'equation', 'with', 'timedependent', 'damping', 'partial_t2udelta', 'ufracmu1tpartial_tuup', 'in', 'mathbbr_timesmathbbrn', 'more', 'precisely', 'for', '0leqmuleq', '2mu', 'neq1', 'and', 'ngeq', '2', 'there', 'is', 'no', 'global', 'solution', 'for', '1pp_snmu', 'where', 'p_sk', 'is', 'the', 'kdimensional', 'strauss', 'exponent', 'and', 'a', 'lifespan', 'of', 'the', 'blow', 'up', 'solution', 'will', 'be', 'obtained', 'our', 'work', 'is', 'an', 'extension', 'of', 'citeis', 'where', 'the', 'authors', 'proved', 'a', 'similar', 'blow', 'up', 'result', 'with', 'a', 'larger', 'range', 'of', 'mu', 'however', 'we', 'obtain', 'a', 'better', 'lifespan', 'estimate', 'when', 'muin01cup12', 'by', 'using', 'a', 'different', 'method']] | [-0.10629286372300836, 0.06261662662115575, -0.06668118211901052, 0.03608199867591176, -0.055281376897694606, -0.1396520465944262, 0.026510223801162136, 0.2727822570194458, -0.252449516372905, -0.23917086524674777, 0.15244730587730226, -0.29819901665437154, -0.11546641129307213, 0.2410177705895113, -0.037669727006049335, 0.06889391536342687, 0.03236183464184575, 0.04656339997704002, -0.05524166350268984, -0.2602778371295025, 0.3659254935056228, -0.01580027189378723, 0.1732076782219369, 0.06047022979620887, 0.08737352611389997, -0.07555677882133416, 0.0260290057724877, 0.013791394237985557, -0.23669293023988433, 0.07326733381433904, 0.2182777952563403, 0.07455799923192752, 0.3269980958523764, -0.35795181348448857, -0.21788317318363437, 0.1690678338884194, 0.18719477565081297, 0.11211674191303894, -0.04005528080639103, -0.2770793926313348, 0.17203487086527305, -0.1482462282131972, -0.21057415844059024, -0.04151576359210343, 0.07611581280656245, 0.04152024474166248, -0.32482216454742624, 0.0969345347805955, 0.0843543329158391, 0.02725417222613576, -0.11881719220258381, -0.053611724150377786, 0.03130393347103448, 0.09002970833359447, 0.06692928450728028, 0.11896075214387784, 0.00042587532073088075, -0.0921804098567615, -0.057085910126909445, 0.33936169884842016, -0.10613927176093747, -0.2349245897547781, 0.15322245641654336, -0.17919513236345916, -0.09798875804348238, 0.15154771234882974, 0.16199176186085518, 0.16370357676334252, -0.13821894299568763, 0.09606212959223395, -0.06045978288845314, 0.1859873739477975, 0.15330803593427972, -0.04437980119636732, 0.05610913287409335, 0.20721329570662272, 0.17972080652794703, 0.10298899496469283, 0.003938028913382013, -0.04253709318929876, -0.30452449825303307, -0.19291079576373443, -0.13649927048232063, 0.14088379511467164, -0.10204783892064977, -0.11019458492211569, 0.37459107629697896, 0.13365471708834514, 0.19964126223462753, 0.10652827701381483, 0.21660618338434176, 0.17373306409257797, 0.00781072483494364, 0.1445870865136385, 0.20918742648657712, 0.07883515550176902, 0.11993833160263369, -0.18014077826981142, 0.003974659603902663, 0.09064609856055729] |
1,802.08404 | Kernel Recursive ABC: Point Estimation with Intractable Likelihood | We propose a novel approach to parameter estimation for simulator-based
statistical models with intractable likelihood. Our proposed method involves
recursive application of kernel ABC and kernel herding to the same observed
data. We provide a theoretical explanation regarding why the approach works,
showing (for the population setting) that, under a certain assumption, point
estimates obtained with this method converge to the true parameter, as
recursion proceeds. We have conducted a variety of numerical experiments,
including parameter estimation for a real-world pedestrian flow simulator, and
show that in most cases our method outperforms existing approaches.
| stat.ML | we propose a novel approach to parameter estimation for simulatorbased statistical models with intractable likelihood our proposed method involves recursive application of kernel abc and kernel herding to the same observed data we provide a theoretical explanation regarding why the approach works showing for the population setting that under a certain assumption point estimates obtained with this method converge to the true parameter as recursion proceeds we have conducted a variety of numerical experiments including parameter estimation for a realworld pedestrian flow simulator and show that in most cases our method outperforms existing approaches | [['we', 'propose', 'a', 'novel', 'approach', 'to', 'parameter', 'estimation', 'for', 'simulatorbased', 'statistical', 'models', 'with', 'intractable', 'likelihood', 'our', 'proposed', 'method', 'involves', 'recursive', 'application', 'of', 'kernel', 'abc', 'and', 'kernel', 'herding', 'to', 'the', 'same', 'observed', 'data', 'we', 'provide', 'a', 'theoretical', 'explanation', 'regarding', 'why', 'the', 'approach', 'works', 'showing', 'for', 'the', 'population', 'setting', 'that', 'under', 'a', 'certain', 'assumption', 'point', 'estimates', 'obtained', 'with', 'this', 'method', 'converge', 'to', 'the', 'true', 'parameter', 'as', 'recursion', 'proceeds', 'we', 'have', 'conducted', 'a', 'variety', 'of', 'numerical', 'experiments', 'including', 'parameter', 'estimation', 'for', 'a', 'realworld', 'pedestrian', 'flow', 'simulator', 'and', 'show', 'that', 'in', 'most', 'cases', 'our', 'method', 'outperforms', 'existing', 'approaches']] | [-0.05028640868716893, -0.04617731397020373, -0.13637788411467633, 0.0873176471577608, -0.09590023421147402, -0.17663451024093368, 0.09508475492351708, 0.41007740431009454, -0.21482197581815157, -0.3158034495018581, 0.0854410108840192, -0.22492184698026865, -0.22654192635363482, 0.2709616912192011, -0.07819778394905176, 0.12654420233237498, 0.14089952868488717, -0.014178365208592484, -0.06189040873853609, -0.2580850699066898, 0.29144265635454275, 0.019041839818608887, 0.3236563184912852, 0.01221218140129535, 0.14392553632608318, -0.005195969871760524, -0.02225165066502473, 0.039526408502442406, -0.15609941037667127, 0.12360361517045369, 0.2701154609099405, 0.17946919061719102, 0.311671658121842, -0.3698598213018255, -0.2664285158897017, 0.11800482911503617, 0.15184840577297865, 0.11570408595032355, -0.06470374018944641, -0.2791791283030142, 0.08760160467329811, -0.17317493188199884, -0.11041465131169621, -0.1657892100394089, -0.06367015504238611, -0.010586524471402802, -0.3565183638061268, 0.10432582681731103, 0.06487412334598125, 0.03966690171906288, -0.044760557572714035, -0.16054545510857504, 0.0694109928705036, 0.06905198851699366, 0.09912720057082937, -0.01570952497422695, 0.11180264151040861, -0.11785000139857306, -0.14896460812776646, 0.32951326894157745, -0.05781466361665306, -0.2275844837162406, 0.18789342083433208, -0.06918359907502507, -0.18726226853261246, 0.07704147992487204, 0.1662013308650398, 0.14299527333524237, -0.10631724424719652, 0.048491679908499674, -0.08863813270061732, 0.12647447745133678, -0.017805415494218865, -0.0548718293702745, 0.10698874617005362, 0.22705558958919125, 0.0686824491651273, 0.1247271630378004, -0.1281694493930232, -0.14465247742593923, -0.27946136816543465, -0.11837909807094392, -0.19762843662991803, -0.028234722726839655, -0.12406466826468339, -0.18223951824326465, 0.37014593972646176, 0.27631489852284813, 0.21419087959889402, 0.12687946890451093, 0.33943286930468486, 0.10728073532400811, 0.022112744602751224, 0.09640757751680831, 0.17415931230371304, 0.04759564490473651, 0.07430839422158897, -0.18520358886614324, 0.11332960398818188, 0.08315256233772937] |
1,802.08405 | Local moment matching: A unified methodology for symmetric functional
estimation and distribution estimation under Wasserstein distance | We present \emph{Local Moment Matching (LMM)}, a unified methodology for
symmetric functional estimation and distribution estimation under Wasserstein
distance. We construct an efficiently computable estimator that achieves the
minimax rates in estimating the distribution up to permutation, and show that
the plug-in approach of our unlabeled distribution estimator is "universal" in
estimating symmetric functionals of discrete distributions. Instead of doing
best polynomial approximation explicitly as in existing literature of
functional estimation, the plug-in approach conducts polynomial approximation
implicitly and attains the optimal sample complexity for the entropy, power sum
and support size functionals.
| stat.ME cs.IT cs.LG math.IT | we present emphlocal moment matching lmm a unified methodology for symmetric functional estimation and distribution estimation under wasserstein distance we construct an efficiently computable estimator that achieves the minimax rates in estimating the distribution up to permutation and show that the plugin approach of our unlabeled distribution estimator is universal in estimating symmetric functionals of discrete distributions instead of doing best polynomial approximation explicitly as in existing literature of functional estimation the plugin approach conducts polynomial approximation implicitly and attains the optimal sample complexity for the entropy power sum and support size functionals | [['we', 'present', 'emphlocal', 'moment', 'matching', 'lmm', 'a', 'unified', 'methodology', 'for', 'symmetric', 'functional', 'estimation', 'and', 'distribution', 'estimation', 'under', 'wasserstein', 'distance', 'we', 'construct', 'an', 'efficiently', 'computable', 'estimator', 'that', 'achieves', 'the', 'minimax', 'rates', 'in', 'estimating', 'the', 'distribution', 'up', 'to', 'permutation', 'and', 'show', 'that', 'the', 'plugin', 'approach', 'of', 'our', 'unlabeled', 'distribution', 'estimator', 'is', 'universal', 'in', 'estimating', 'symmetric', 'functionals', 'of', 'discrete', 'distributions', 'instead', 'of', 'doing', 'best', 'polynomial', 'approximation', 'explicitly', 'as', 'in', 'existing', 'literature', 'of', 'functional', 'estimation', 'the', 'plugin', 'approach', 'conducts', 'polynomial', 'approximation', 'implicitly', 'and', 'attains', 'the', 'optimal', 'sample', 'complexity', 'for', 'the', 'entropy', 'power', 'sum', 'and', 'support', 'size', 'functionals']] | [-0.04212707834899105, -0.009999817521255012, -0.13385292775528404, 0.12795370719796148, -0.0528697995869543, -0.1271240732066774, 0.08100725409026528, 0.38306205615561495, -0.2923161113254165, -0.2993313132294564, 0.06467452805153825, -0.25057278020978374, -0.14067955756740225, 0.15627304276311269, -0.1283503028474027, 0.1470206843999525, 0.02638609106752581, 0.01613217869132597, -0.12452754572093967, -0.2831681812362325, 0.26435903564185625, 0.055325373857011716, 0.3694135227731319, -0.015435636126791798, 0.1476288599723209, 0.034450624474845024, -0.021211232939955367, 0.007144152582372709, -0.1617946094660882, 0.16858387495496222, 0.2709732623720762, 0.19377379966599326, 0.30952761275693774, -0.31948432325777004, -0.18024090623422975, 0.1392633539213929, 0.13359244249921332, 0.059989067170047955, -0.04028053148098851, -0.2235232268770536, 0.09731187594939343, -0.20969743375736538, -0.0826977494082624, -0.14269818534814221, -0.013822156715617385, 0.05198736815282735, -0.40435924781586535, 0.1453976195946496, 0.05876658077762332, 0.035882835747093285, -0.0706276993532615, -0.18218633022800249, 0.06593739067865236, 0.08824762736537284, 0.052447544853954066, 0.028601927667736046, 0.12663784787379284, -0.065064793067073, -0.09386174770895772, 0.2591867446298561, -0.10299002544789185, -0.2617263609858891, 0.08385709160438148, -0.10663600439225794, -0.14267252787186574, 0.08503791187659547, 0.2198345227021804, 0.1616439771067391, -0.18475670928275714, 0.13578959563696977, -0.06757295956354469, 0.12587681908150433, 0.04058909940943923, 0.00428915007780957, 0.07756333063126251, 0.12814940683423512, 0.184512123735922, 0.1586571170007109, -0.09517250593215908, -0.1467961853930867, -0.32898113483022295, -0.12943502828999554, -0.28839586873448664, -0.022096925442637777, -0.19970581927824946, -0.22690450628438302, 0.3684143974415718, 0.16439416135601218, 0.13731442992224968, 0.21212106976678136, 0.31745663716868366, 0.16027239977972962, -0.003790071354277672, 0.16701929474009142, 0.14893061797114548, 0.11992349706950688, -0.04243639054875921, -0.19802690535202944, 0.1673740914331809, 0.12419605617391406] |
1,802.08406 | Solving Linear Inverse Problems Using GAN Priors: An Algorithm with
Provable Guarantees | In recent works, both sparsity-based methods as well as learning-based
methods have proven to be successful in solving several challenging linear
inverse problems. However, sparsity priors for natural signals and images
suffer from poor discriminative capability, while learning-based methods seldom
provide concrete theoretical guarantees. In this work, we advocate the idea of
replacing hand-crafted priors, such as sparsity, with a Generative Adversarial
Network (GAN) to solve linear inverse problems such as compressive sensing. In
particular, we propose a projected gradient descent (PGD) algorithm for
effective use of GAN priors for linear inverse problems, and also provide
theoretical guarantees on the rate of convergence of this algorithm. Moreover,
we show empirically that our algorithm demonstrates superior performance over
an existing method of leveraging GANs for compressive sensing.
| stat.ML cs.LG | in recent works both sparsitybased methods as well as learningbased methods have proven to be successful in solving several challenging linear inverse problems however sparsity priors for natural signals and images suffer from poor discriminative capability while learningbased methods seldom provide concrete theoretical guarantees in this work we advocate the idea of replacing handcrafted priors such as sparsity with a generative adversarial network gan to solve linear inverse problems such as compressive sensing in particular we propose a projected gradient descent pgd algorithm for effective use of gan priors for linear inverse problems and also provide theoretical guarantees on the rate of convergence of this algorithm moreover we show empirically that our algorithm demonstrates superior performance over an existing method of leveraging gans for compressive sensing | [['in', 'recent', 'works', 'both', 'sparsitybased', 'methods', 'as', 'well', 'as', 'learningbased', 'methods', 'have', 'proven', 'to', 'be', 'successful', 'in', 'solving', 'several', 'challenging', 'linear', 'inverse', 'problems', 'however', 'sparsity', 'priors', 'for', 'natural', 'signals', 'and', 'images', 'suffer', 'from', 'poor', 'discriminative', 'capability', 'while', 'learningbased', 'methods', 'seldom', 'provide', 'concrete', 'theoretical', 'guarantees', 'in', 'this', 'work', 'we', 'advocate', 'the', 'idea', 'of', 'replacing', 'handcrafted', 'priors', 'such', 'as', 'sparsity', 'with', 'a', 'generative', 'adversarial', 'network', 'gan', 'to', 'solve', 'linear', 'inverse', 'problems', 'such', 'as', 'compressive', 'sensing', 'in', 'particular', 'we', 'propose', 'a', 'projected', 'gradient', 'descent', 'pgd', 'algorithm', 'for', 'effective', 'use', 'of', 'gan', 'priors', 'for', 'linear', 'inverse', 'problems', 'and', 'also', 'provide', 'theoretical', 'guarantees', 'on', 'the', 'rate', 'of', 'convergence', 'of', 'this', 'algorithm', 'moreover', 'we', 'show', 'empirically', 'that', 'our', 'algorithm', 'demonstrates', 'superior', 'performance', 'over', 'an', 'existing', 'method', 'of', 'leveraging', 'gans', 'for', 'compressive', 'sensing']] | [0.037196754049214104, -0.06390296126748639, -0.08039956181384032, 0.08250777520764146, -0.12664745323034743, -0.19058737287940902, 0.0016881498020319711, 0.5007393754767402, -0.331818307428399, -0.3137441320508342, 0.11148682873444779, -0.2022847491094754, -0.2462809278929074, 0.20849388715116277, -0.18696967425889202, 0.20215828615492062, 0.09516819231655627, -0.02013551832374466, -0.12990151502613334, -0.2781245286857325, 0.2571502007781491, 0.06997369332534689, 0.3553153399585022, 0.010536012635196722, 0.15496857300223338, -0.025112380765171513, 0.00886599791221439, 0.03198236376989544, -0.06187115397586326, 0.17760165396427352, 0.34425492287938675, 0.2351083695371522, 0.38184080216737964, -0.4384743521241323, -0.28847604306111674, 0.09359954685963218, 0.16878927852367126, 0.1370551402972538, -0.13268573086298557, -0.2922519380818047, 0.12556605935761972, -0.13338952506005408, 0.03320583473846671, -0.17435630849961722, -0.09161010332357523, 0.010840064763287378, -0.35588276927315055, 0.09224460652839052, 0.1125478527281389, 0.06649040916402425, -0.061144008999690413, -0.18816164656290932, 0.11933155504188367, 0.05645007595774673, 0.09538935915020014, 0.01437025900102324, 0.10994358493813447, -0.16029131020389734, -0.17146434500953922, 0.3496308864375192, -0.07599276780993455, -0.21169851800206946, 0.19080378419704855, 0.030908870923754182, -0.1711056992644444, 0.08999484577881438, 0.2603171174839464, 0.18125246394248234, -0.11068490271397408, 0.09920150842720879, -0.04318168828548449, 0.11261673252068696, 0.02725733255243136, 0.032581614522588634, 0.09281880889893583, 0.22285779278599732, 0.14442051230331085, 0.1272074791726597, -0.09780083941702272, -0.034462608596576114, -0.1813090161715139, -0.07288970860342185, -0.23024041786242927, -0.038724436106840295, -0.12097527886096883, -0.1684754881231735, 0.36982028495283825, 0.24265451584425238, 0.23143154762626167, 0.1410910661834928, 0.3970211830197109, 0.04859859704147167, 0.060030189820007226, 0.0856674563782733, 0.2539109925606421, 0.097699935111912, 0.09568456353505127, -0.1776685880040676, 0.07286150862429557, 0.048904287370128766] |
1,802.08407 | Exponentially Consistent Kernel Two-Sample Tests | Given two sets of independent samples from unknown distributions $P$ and $Q$,
a two-sample test decides whether to reject the null hypothesis that $P=Q$.
Recent attention has focused on kernel two-sample tests as the test statistics
are easy to compute, converge fast, and have low bias with their finite sample
estimates. However, there still lacks an exact characterization on the
asymptotic performance of such tests, and in particular, the rate at which the
type-II error probability decays to zero in the large sample limit. In this
work, we establish that a class of kernel two-sample tests are exponentially
consistent with Polish, locally compact Hausdorff sample space, e.g., $\mathbb
R^d$. The obtained exponential decay rate is further shown to be optimal among
all two-sample tests satisfying the level constraint, and is independent of
particular kernels provided that they are bounded continuous and
characteristic. Our results gain new insights into related issues such as fair
alternative for testing and kernel selection strategy. Finally, as an
application, we show that a kernel based test achieves the optimal detection
for off-line change detection in the nonparametric setting.
| stat.ML cs.IT cs.LG math.IT | given two sets of independent samples from unknown distributions p and q a twosample test decides whether to reject the null hypothesis that pq recent attention has focused on kernel twosample tests as the test statistics are easy to compute converge fast and have low bias with their finite sample estimates however there still lacks an exact characterization on the asymptotic performance of such tests and in particular the rate at which the typeii error probability decays to zero in the large sample limit in this work we establish that a class of kernel twosample tests are exponentially consistent with polish locally compact hausdorff sample space eg mathbb rd the obtained exponential decay rate is further shown to be optimal among all twosample tests satisfying the level constraint and is independent of particular kernels provided that they are bounded continuous and characteristic our results gain new insights into related issues such as fair alternative for testing and kernel selection strategy finally as an application we show that a kernel based test achieves the optimal detection for offline change detection in the nonparametric setting | [['given', 'two', 'sets', 'of', 'independent', 'samples', 'from', 'unknown', 'distributions', 'p', 'and', 'q', 'a', 'twosample', 'test', 'decides', 'whether', 'to', 'reject', 'the', 'null', 'hypothesis', 'that', 'pq', 'recent', 'attention', 'has', 'focused', 'on', 'kernel', 'twosample', 'tests', 'as', 'the', 'test', 'statistics', 'are', 'easy', 'to', 'compute', 'converge', 'fast', 'and', 'have', 'low', 'bias', 'with', 'their', 'finite', 'sample', 'estimates', 'however', 'there', 'still', 'lacks', 'an', 'exact', 'characterization', 'on', 'the', 'asymptotic', 'performance', 'of', 'such', 'tests', 'and', 'in', 'particular', 'the', 'rate', 'at', 'which', 'the', 'typeii', 'error', 'probability', 'decays', 'to', 'zero', 'in', 'the', 'large', 'sample', 'limit', 'in', 'this', 'work', 'we', 'establish', 'that', 'a', 'class', 'of', 'kernel', 'twosample', 'tests', 'are', 'exponentially', 'consistent', 'with', 'polish', 'locally', 'compact', 'hausdorff', 'sample', 'space', 'eg', 'mathbb', 'rd', 'the', 'obtained', 'exponential', 'decay', 'rate', 'is', 'further', 'shown', 'to', 'be', 'optimal', 'among', 'all', 'twosample', 'tests', 'satisfying', 'the', 'level', 'constraint', 'and', 'is', 'independent', 'of', 'particular', 'kernels', 'provided', 'that', 'they', 'are', 'bounded', 'continuous', 'and', 'characteristic', 'our', 'results', 'gain', 'new', 'insights', 'into', 'related', 'issues', 'such', 'as', 'fair', 'alternative', 'for', 'testing', 'and', 'kernel', 'selection', 'strategy', 'finally', 'as', 'an', 'application', 'we', 'show', 'that', 'a', 'kernel', 'based', 'test', 'achieves', 'the', 'optimal', 'detection', 'for', 'offline', 'change', 'detection', 'in', 'the', 'nonparametric', 'setting']] | [-0.04845981339763728, 0.05820168852007724, -0.09362893580596467, 0.11379674737929504, -0.08192294117322833, -0.18712423340534495, 0.09031787603811102, 0.3895229755040726, -0.22100742064833723, -0.26146652257131014, 0.1406091564650459, -0.27340044424731713, -0.08020478102780594, 0.24623571246190637, -0.0762502260752979, 0.11867121064048158, 0.06612783909744782, 0.0504018177018791, -0.07576532250262613, -0.2979232185454072, 0.3007055922815973, 0.0709871683839729, 0.3573235384432874, 0.001318886965167164, 0.0922948827819461, -0.02604949593167406, -0.05869408254893344, 0.024741734014639548, -0.13611160092837626, 0.06822949586610458, 0.2586990868942456, 0.17242524739858361, 0.32364665150204724, -0.3616579716581526, -0.1590356601165516, 0.17450561724053543, 0.12458988009273556, 0.024816095634984475, -0.07217176202201167, -0.2622126933400992, 0.13198554220665348, -0.12346863793225099, -0.0983075257823319, -0.08969559474425808, 0.019527510660980407, 0.038060025056910606, -0.3603794680999928, 0.06586801742402013, 0.09406249166613882, 0.042756744515395066, -0.040371040547714454, -0.12422784928313858, 0.06112419573534178, 0.1066842780122788, 0.09001031677528727, 0.041149263970758715, 0.09879028514699369, -0.0866758386856403, -0.12274721397030997, 0.31523096452523125, -0.058187985815339384, -0.2410217968866616, 0.21435171255175167, -0.16673825751185986, -0.16430331008315413, 0.0932851373141662, 0.20691521015384648, 0.1129771788500229, -0.1268615390382748, 0.10464179076593436, -0.05927159171297006, 0.13407920407833623, 0.053281726883062736, 0.03695395133391918, 0.14576615857041844, 0.15844246811269086, 0.09859934106056929, 0.1266691708063218, -0.09381739898773084, -0.05148948348875417, -0.34769169252386184, -0.14421892787210255, -0.2189399081433721, 0.0395496935975519, -0.12242585352954043, -0.20076936512948218, 0.34300590012619486, 0.14118573343021226, 0.19190844693704626, 0.12601582588986723, 0.2501657047077423, 0.10572623641133472, 0.015301031056699938, 0.10572765755563017, 0.20035383634299772, 0.09228131075801908, -0.020414095714846064, -0.1803361439092665, 0.0955999311863806, 0.02746676784948652] |
1,802.08408 | Comparative study of anomalous size dependence of charged and neutral
solute diffusion in water | In this work, we perform a comparative study of the size dependence of
diffusion of charged and neutral solutes in water. The neutral solute in water
shows a nonmonotonicity in the size dependence of diffusion. This is usually
connected to the well known Levitation effect where it is found that when
solute diffuses through the transient solvent cages then for attractive
solute-solvent interaction and for a particular size of the solute there is a
force balance which leads to the maximum in diffusion. Similar maximum in
diffusion of charged solutes has also been observed and connected to Levitation
effect. However, earlier studies of ionic diffusion connects this
nonmonotonicity to the interplay between hard sphere repulsion and Coulombic
attraction. In this work, we show that although the size dependence of both
charged and neutral solutes have a nonmonotonicity, there is a stark difference
in their behaviour. For charged solute with increase in attraction the maximum
shifts to higher solute sizes and has a lower value whereas for neutral solute
it remains at the same place and has a higher value. We show by studying the
ionic and non-ionic part of the potential that for larger solutes it is the
nonionic part which dominates and for smaller solutes the ionic part and the is
a transition between them. As the charge on the solute increases, this
transition takes place at larger solute sizes which leads to the shift in the
diffusivity maxima and reduction of the peak value. We show that although the
charged solutes also explore the solvent cage even before we reach the size
which Levitates due to Coulombic attraction the diffusion value drops. Thus the
origin of diffusivity maxima in charged and neutral solute diffusion is
different.
| cond-mat.soft | in this work we perform a comparative study of the size dependence of diffusion of charged and neutral solutes in water the neutral solute in water shows a nonmonotonicity in the size dependence of diffusion this is usually connected to the well known levitation effect where it is found that when solute diffuses through the transient solvent cages then for attractive solutesolvent interaction and for a particular size of the solute there is a force balance which leads to the maximum in diffusion similar maximum in diffusion of charged solutes has also been observed and connected to levitation effect however earlier studies of ionic diffusion connects this nonmonotonicity to the interplay between hard sphere repulsion and coulombic attraction in this work we show that although the size dependence of both charged and neutral solutes have a nonmonotonicity there is a stark difference in their behaviour for charged solute with increase in attraction the maximum shifts to higher solute sizes and has a lower value whereas for neutral solute it remains at the same place and has a higher value we show by studying the ionic and nonionic part of the potential that for larger solutes it is the nonionic part which dominates and for smaller solutes the ionic part and the is a transition between them as the charge on the solute increases this transition takes place at larger solute sizes which leads to the shift in the diffusivity maxima and reduction of the peak value we show that although the charged solutes also explore the solvent cage even before we reach the size which levitates due to coulombic attraction the diffusion value drops thus the origin of diffusivity maxima in charged and neutral solute diffusion is different | [['in', 'this', 'work', 'we', 'perform', 'a', 'comparative', 'study', 'of', 'the', 'size', 'dependence', 'of', 'diffusion', 'of', 'charged', 'and', 'neutral', 'solutes', 'in', 'water', 'the', 'neutral', 'solute', 'in', 'water', 'shows', 'a', 'nonmonotonicity', 'in', 'the', 'size', 'dependence', 'of', 'diffusion', 'this', 'is', 'usually', 'connected', 'to', 'the', 'well', 'known', 'levitation', 'effect', 'where', 'it', 'is', 'found', 'that', 'when', 'solute', 'diffuses', 'through', 'the', 'transient', 'solvent', 'cages', 'then', 'for', 'attractive', 'solutesolvent', 'interaction', 'and', 'for', 'a', 'particular', 'size', 'of', 'the', 'solute', 'there', 'is', 'a', 'force', 'balance', 'which', 'leads', 'to', 'the', 'maximum', 'in', 'diffusion', 'similar', 'maximum', 'in', 'diffusion', 'of', 'charged', 'solutes', 'has', 'also', 'been', 'observed', 'and', 'connected', 'to', 'levitation', 'effect', 'however', 'earlier', 'studies', 'of', 'ionic', 'diffusion', 'connects', 'this', 'nonmonotonicity', 'to', 'the', 'interplay', 'between', 'hard', 'sphere', 'repulsion', 'and', 'coulombic', 'attraction', 'in', 'this', 'work', 'we', 'show', 'that', 'although', 'the', 'size', 'dependence', 'of', 'both', 'charged', 'and', 'neutral', 'solutes', 'have', 'a', 'nonmonotonicity', 'there', 'is', 'a', 'stark', 'difference', 'in', 'their', 'behaviour', 'for', 'charged', 'solute', 'with', 'increase', 'in', 'attraction', 'the', 'maximum', 'shifts', 'to', 'higher', 'solute', 'sizes', 'and', 'has', 'a', 'lower', 'value', 'whereas', 'for', 'neutral', 'solute', 'it', 'remains', 'at', 'the', 'same', 'place', 'and', 'has', 'a', 'higher', 'value', 'we', 'show', 'by', 'studying', 'the', 'ionic', 'and', 'nonionic', 'part', 'of', 'the', 'potential', 'that', 'for', 'larger', 'solutes', 'it', 'is', 'the', 'nonionic', 'part', 'which', 'dominates', 'and', 'for', 'smaller', 'solutes', 'the', 'ionic', 'part', 'and', 'the', 'is', 'a', 'transition', 'between', 'them', 'as', 'the', 'charge', 'on', 'the', 'solute', 'increases', 'this', 'transition', 'takes', 'place', 'at', 'larger', 'solute', 'sizes', 'which', 'leads', 'to', 'the', 'shift', 'in', 'the', 'diffusivity', 'maxima', 'and', 'reduction', 'of', 'the', 'peak', 'value', 'we', 'show', 'that', 'although', 'the', 'charged', 'solutes', 'also', 'explore', 'the', 'solvent', 'cage', 'even', 'before', 'we', 'reach', 'the', 'size', 'which', 'levitates', 'due', 'to', 'coulombic', 'attraction', 'the', 'diffusion', 'value', 'drops', 'thus', 'the', 'origin', 'of', 'diffusivity', 'maxima', 'in', 'charged', 'and', 'neutral', 'solute', 'diffusion', 'is', 'different']] | [-0.07740034165100143, 0.19279168961394236, -0.0449714540720581, 0.032963646817734116, 0.001923998572035796, -0.1297704572223463, 0.04834721532420695, 0.3427842441241309, -0.2509676378750656, -0.29312993284798317, 0.007716127812374098, -0.3287956335504229, -0.10436920065613878, 0.07970101384691791, 0.015535886881278, -0.03367376560668668, -0.0005099966272407781, 0.014164945489028469, -0.017087137547302216, -0.18564028746509897, 0.25405036297403666, 0.06129898634066598, 0.2677183665299607, 0.19598478840554082, 0.0664748046478457, -0.01504297918775895, 0.04019672734365384, 0.09397053664724808, -0.15653508533321453, 0.08425990063228204, 0.1938172337074017, -0.028416348109506846, 0.2631492985326784, -0.41654785154646057, -0.21491750509529892, 0.1246530952149543, 0.15498469811387217, 0.1487755409325473, -0.08590700881904922, -0.21416642609417774, 0.027257866221286047, -0.1299782428403786, -0.1279747728698971, 0.003174427052726969, 0.12652022653007103, 0.04729697644143016, -0.277710573701673, 0.14932940182896143, 0.07672740743025012, 0.04743642926486144, -0.10162372366499363, -0.1409201550058141, -0.044539049850653906, 0.1165376396348721, 0.12155786853003923, -0.01417722328268509, 0.2258339947357955, -0.13759379212974132, -0.0044047466087957015, 0.4156217752186219, -0.08909011429043151, -0.19015135738623534, 0.2396808785124449, -0.18844151766582704, -0.06586640497991741, 0.21475879108038498, 0.1579111288107621, 0.10921726974710408, -0.14057690674422296, 0.05804743688349845, -0.029871779959648848, 0.1839701832545365, 0.09082279613438812, -0.02334802821820227, 0.19690956124557285, 0.19987623191587367, 0.09988480534229893, 0.16660496272056158, -0.103766530820192, -0.13915378905706652, -0.2171596592213771, -0.21723030092996648, -0.18297685450670542, 0.02683249377231631, -0.10663548895718122, -0.18484098136670785, 0.3230008620400137, 0.13593046550522558, 0.20762332674672102, 0.026564683070723225, 0.24053826797939515, 0.0903527610167253, 0.0777458582007158, 0.04809258788494238, 0.2797396761509137, 0.1081889734115167, 0.14506326936275904, -0.30537267636302406, 0.13536750277085552, 0.04847050949158276] |
1,802.08409 | Correspondence between trace ideals and birational extensions with
application to the analysis of the Gorenstein property of rings | Over an arbitrary commutative ring, correspondences among three sets, the set
of trace ideals, the set of stable ideals, and the set of birational extensions
of the base ring, are studied. The correspondences are well-behaved, if the
base ring is a Gorenstein ring of dimension one. It is shown that with one
extremal exception, the surjectivity of one of the correspondences
characterizes the Gorenstein property of the base ring, provided it is a
Cohen-Macaulay local ring of dimension one. Over a commutative Noetherian ring,
a characterization of modules in which every submodule is a trace module is
given. The notion of anti-stable rings is introduced, exploring their basic
properties.
| math.AC | over an arbitrary commutative ring correspondences among three sets the set of trace ideals the set of stable ideals and the set of birational extensions of the base ring are studied the correspondences are wellbehaved if the base ring is a gorenstein ring of dimension one it is shown that with one extremal exception the surjectivity of one of the correspondences characterizes the gorenstein property of the base ring provided it is a cohenmacaulay local ring of dimension one over a commutative noetherian ring a characterization of modules in which every submodule is a trace module is given the notion of antistable rings is introduced exploring their basic properties | [['over', 'an', 'arbitrary', 'commutative', 'ring', 'correspondences', 'among', 'three', 'sets', 'the', 'set', 'of', 'trace', 'ideals', 'the', 'set', 'of', 'stable', 'ideals', 'and', 'the', 'set', 'of', 'birational', 'extensions', 'of', 'the', 'base', 'ring', 'are', 'studied', 'the', 'correspondences', 'are', 'wellbehaved', 'if', 'the', 'base', 'ring', 'is', 'a', 'gorenstein', 'ring', 'of', 'dimension', 'one', 'it', 'is', 'shown', 'that', 'with', 'one', 'extremal', 'exception', 'the', 'surjectivity', 'of', 'one', 'of', 'the', 'correspondences', 'characterizes', 'the', 'gorenstein', 'property', 'of', 'the', 'base', 'ring', 'provided', 'it', 'is', 'a', 'cohenmacaulay', 'local', 'ring', 'of', 'dimension', 'one', 'over', 'a', 'commutative', 'noetherian', 'ring', 'a', 'characterization', 'of', 'modules', 'in', 'which', 'every', 'submodule', 'is', 'a', 'trace', 'module', 'is', 'given', 'the', 'notion', 'of', 'antistable', 'rings', 'is', 'introduced', 'exploring', 'their', 'basic', 'properties']] | [-0.24852844530934418, -0.03627629676679418, -0.07821228387637423, 0.04232979865548192, -0.04148509558461128, -0.19004595037464292, -0.1272405603422074, 0.3185578629784628, -0.4146335835850567, -0.11131083566712541, 0.11703202373096121, -0.24588118715707316, -0.07281430694060999, 0.17443792619357962, -0.13251538720802156, -0.06303277667056462, 0.028915931735563716, 0.15356488736910284, -0.06741890974915288, -0.3476376504116102, 0.44343431707505787, 0.03706530172702506, 0.21667285736889466, -0.0008162872805986383, 0.12575599886989647, 0.0169127491012284, -0.04102662929820768, 0.0663330942699942, -0.1442903480047297, 0.14779508205284492, 0.31720579738532184, 0.1234357021620856, 0.2174196713219542, -0.3362214192435671, -0.07447376823343269, 0.2326589757790191, 0.08455071240287582, -0.019801245857331336, 0.004366150482583347, -0.19453052282675143, 0.1614066407750916, -0.23166113691148135, -0.1678129690058461, -0.0563807731895887, 0.1143908661612899, 0.04871982909363071, -0.3026592988999338, -0.05917115332644193, 0.1330497719597396, 0.18550709219769054, -0.04801925942472635, -0.012127766915417592, -0.07234069491830578, 0.06140025054241334, -0.08654337980647768, -0.019431894175161463, 0.15508468745547613, -0.09959927966835302, -0.10991230288012073, 0.35613890476695714, 0.0013350820886569286, -0.18730141096235758, 0.18169870698790347, -0.2202496645809792, -0.0662191234477753, 0.16558536480035668, -0.05686544603027335, 0.17866404084574192, -0.054949156905806394, 0.21342384950161716, -0.23448846073940807, 0.08403052919792063, 0.13367472125063523, 0.07962705056533353, 0.21262977303031388, 0.14511910757613838, 0.11279560791498366, 0.1406707155492601, -0.004803420104291461, -0.012995849585656178, -0.34741616490886573, -0.1960525399484082, -0.15895561743185882, 0.09326679887967783, -0.10588527492601574, -0.150591331090588, 0.47515673675668346, 0.0791683149066916, 0.19438772177785088, 0.04596235498961129, 0.24866779628978752, -0.0261682238438596, 0.1188424869094454, 0.07491560551175556, 0.11997028605568164, 0.2640204541214289, -0.04628560053176084, -0.10273483568170202, 0.009129814748062726, 0.2137610218274074] |
1,802.0841 | Superintegrable systems, polynomial algebra structures and exact
derivations of spectra | Superintegrable systems are a class of physical systems which possess more
conserved quantities than their degrees of freedom. The study of these systems
has a long history and continues to attract significant international
attention. This thesis investigates finite dimensional quantum superintegrable
systems with scalar potentials as well as vector potentials with monopole type
interactions. We introduce new families of $N$-dimensional superintegrable
Kepler-Coulomb systems with non-central terms and double singular harmonic
oscillators in the Euclidean space, and new families of superintegrable Kepler,
MIC-harmonic oscillator and deformed Kepler systems interacting with
Yang-Coulomb monopoles in the flat and curved Taub-NUT spaces. We show their
multiseparability and obtain their Schr\"{o}dinger wave functions in different
coordinate systems. We show that the wave functions are given by (exceptional)
orthogonal polynomials and Painlev\'{e} transcendents (of hypergeometric type).
We construct higher-order algebraically independent integrals of motion of the
systems via the direct and constructive approaches. These integrals form
(higher-rank) polynomial algebras with structure constants involving Casimir
operators of certain Lie algebras. We obtain finite dimensional unitary
representations of the polynomial algebras and present the algebraic
derivations for degenerate energy spectra of these systems. Finally, we present
a generalized superintegrable Kepler-Coulomb model from exceptional orthogonal
polynomials and obtain its energy spectrum using both the separation of
variable and the algebraic methods.
| math-ph math.MP | superintegrable systems are a class of physical systems which possess more conserved quantities than their degrees of freedom the study of these systems has a long history and continues to attract significant international attention this thesis investigates finite dimensional quantum superintegrable systems with scalar potentials as well as vector potentials with monopole type interactions we introduce new families of ndimensional superintegrable keplercoulomb systems with noncentral terms and double singular harmonic oscillators in the euclidean space and new families of superintegrable kepler micharmonic oscillator and deformed kepler systems interacting with yangcoulomb monopoles in the flat and curved taubnut spaces we show their multiseparability and obtain their schrodinger wave functions in different coordinate systems we show that the wave functions are given by exceptional orthogonal polynomials and painleve transcendents of hypergeometric type we construct higherorder algebraically independent integrals of motion of the systems via the direct and constructive approaches these integrals form higherrank polynomial algebras with structure constants involving casimir operators of certain lie algebras we obtain finite dimensional unitary representations of the polynomial algebras and present the algebraic derivations for degenerate energy spectra of these systems finally we present a generalized superintegrable keplercoulomb model from exceptional orthogonal polynomials and obtain its energy spectrum using both the separation of variable and the algebraic methods | [['superintegrable', 'systems', 'are', 'a', 'class', 'of', 'physical', 'systems', 'which', 'possess', 'more', 'conserved', 'quantities', 'than', 'their', 'degrees', 'of', 'freedom', 'the', 'study', 'of', 'these', 'systems', 'has', 'a', 'long', 'history', 'and', 'continues', 'to', 'attract', 'significant', 'international', 'attention', 'this', 'thesis', 'investigates', 'finite', 'dimensional', 'quantum', 'superintegrable', 'systems', 'with', 'scalar', 'potentials', 'as', 'well', 'as', 'vector', 'potentials', 'with', 'monopole', 'type', 'interactions', 'we', 'introduce', 'new', 'families', 'of', 'ndimensional', 'superintegrable', 'keplercoulomb', 'systems', 'with', 'noncentral', 'terms', 'and', 'double', 'singular', 'harmonic', 'oscillators', 'in', 'the', 'euclidean', 'space', 'and', 'new', 'families', 'of', 'superintegrable', 'kepler', 'micharmonic', 'oscillator', 'and', 'deformed', 'kepler', 'systems', 'interacting', 'with', 'yangcoulomb', 'monopoles', 'in', 'the', 'flat', 'and', 'curved', 'taubnut', 'spaces', 'we', 'show', 'their', 'multiseparability', 'and', 'obtain', 'their', 'schrodinger', 'wave', 'functions', 'in', 'different', 'coordinate', 'systems', 'we', 'show', 'that', 'the', 'wave', 'functions', 'are', 'given', 'by', 'exceptional', 'orthogonal', 'polynomials', 'and', 'painleve', 'transcendents', 'of', 'hypergeometric', 'type', 'we', 'construct', 'higherorder', 'algebraically', 'independent', 'integrals', 'of', 'motion', 'of', 'the', 'systems', 'via', 'the', 'direct', 'and', 'constructive', 'approaches', 'these', 'integrals', 'form', 'higherrank', 'polynomial', 'algebras', 'with', 'structure', 'constants', 'involving', 'casimir', 'operators', 'of', 'certain', 'lie', 'algebras', 'we', 'obtain', 'finite', 'dimensional', 'unitary', 'representations', 'of', 'the', 'polynomial', 'algebras', 'and', 'present', 'the', 'algebraic', 'derivations', 'for', 'degenerate', 'energy', 'spectra', 'of', 'these', 'systems', 'finally', 'we', 'present', 'a', 'generalized', 'superintegrable', 'keplercoulomb', 'model', 'from', 'exceptional', 'orthogonal', 'polynomials', 'and', 'obtain', 'its', 'energy', 'spectrum', 'using', 'both', 'the', 'separation', 'of', 'variable', 'and', 'the', 'algebraic', 'methods']] | [-0.20165146720779067, 0.11782923652043671, -0.04736749644040895, 0.06546438127956002, -0.10634179833402224, -0.17841379209377645, -0.05229419766362967, 0.3283969729058093, -0.25799274662474414, -0.211142657202216, 0.07986815986036815, -0.2942187895774314, -0.1963201554850148, 0.19392934871314726, -0.04553813732697031, 0.07187201949424013, 0.06752614809402246, 0.06855807125893475, -0.15238686822649128, -0.26495655754554737, 0.40513345656942856, -0.030283556785434484, 0.1747269033166615, -0.033095844955412006, 0.13133577720200607, 0.03488037709085236, 0.006374396838441069, -0.04090682396960098, -0.13281362134659744, 0.14663339273252893, 0.27053982226226375, 0.04362468383812981, 0.17993088256027373, -0.3585470519127447, -0.18941148795310478, 0.1725813765474156, 0.19580114529169393, 0.09507056331659562, -0.007995976305707855, -0.32116989232380083, -0.024533642965527076, -0.20985797314272034, -0.22388329487271993, -0.16016164694842444, 0.048141214078432824, 0.10308457186713568, -0.21132891710747675, 0.09215529800232342, 0.08598431634314727, 0.13365662549095192, -0.11608294761170773, -0.12099181115407637, -0.03996813543610943, 0.059451661966653226, -0.022554819582509017, -0.032949903214411845, 0.05878412460398702, -0.07245614261451268, -0.17739606242383094, 0.40496639151429265, -0.012175769480958444, -0.2726303206642492, 0.17607640740154135, -0.16222665087047541, -0.15322492089790274, 0.08184613585296385, 0.1863083721642088, 0.1476633376441896, -0.1312744389027291, 0.1626549923722742, -0.007581591360199041, 0.07473698093606387, 0.0860317641965834, 0.08538035935950729, 0.20853263119187312, 0.04570846001338653, 0.03160377328925467, 0.1687457650451798, 0.039763005002278765, -0.14119456386065138, -0.3185077402389275, -0.15234304335858467, -0.1355465612873816, 0.081662860742791, -0.124281819829295, -0.20804483241419186, 0.41707075482897704, 0.07150643197753695, 0.12859384735765042, 0.07826735050569042, 0.1933302574764656, 0.14752403016691976, 0.09309399578575361, 0.0417671700926357, 0.2124647944858122, 0.2207862029196958, 0.0904705680397181, -0.16396648931989166, -0.13982335099992166, 0.17113658216922492] |
1,802.08411 | Cegrell classes and a variational approach for the quaternionic
Monge-Ampere equation | In this paper, we introduce finite energy classes of quaternionic
plurisubharmonic functions of Cegrell type and study the quaternionic
Monge-Ampere operator on these classes on quaternionic hyperconvex domains of
Hn. We extend the domain of definition of quaternionic Monge-Ampere operator to
some Cegrell classes, the functions of which are not necessarily bounded. We
show that integration by parts and comparison principle are valid on some
classes. Moreover, we use the variational method to solve the quaternionic
Monge-Ampere equations when the right hand side is a positive mea- sure of
finite energy.
| math.CV | in this paper we introduce finite energy classes of quaternionic plurisubharmonic functions of cegrell type and study the quaternionic mongeampere operator on these classes on quaternionic hyperconvex domains of hn we extend the domain of definition of quaternionic mongeampere operator to some cegrell classes the functions of which are not necessarily bounded we show that integration by parts and comparison principle are valid on some classes moreover we use the variational method to solve the quaternionic mongeampere equations when the right hand side is a positive mea sure of finite energy | [['in', 'this', 'paper', 'we', 'introduce', 'finite', 'energy', 'classes', 'of', 'quaternionic', 'plurisubharmonic', 'functions', 'of', 'cegrell', 'type', 'and', 'study', 'the', 'quaternionic', 'mongeampere', 'operator', 'on', 'these', 'classes', 'on', 'quaternionic', 'hyperconvex', 'domains', 'of', 'hn', 'we', 'extend', 'the', 'domain', 'of', 'definition', 'of', 'quaternionic', 'mongeampere', 'operator', 'to', 'some', 'cegrell', 'classes', 'the', 'functions', 'of', 'which', 'are', 'not', 'necessarily', 'bounded', 'we', 'show', 'that', 'integration', 'by', 'parts', 'and', 'comparison', 'principle', 'are', 'valid', 'on', 'some', 'classes', 'moreover', 'we', 'use', 'the', 'variational', 'method', 'to', 'solve', 'the', 'quaternionic', 'mongeampere', 'equations', 'when', 'the', 'right', 'hand', 'side', 'is', 'a', 'positive', 'mea', 'sure', 'of', 'finite', 'energy']] | [-0.13445886432264859, 0.0334954372719749, -0.0621170141672777, 0.11760970635933209, -0.1553622883550086, -0.14291319800131433, 0.003589912365026936, 0.36709652255688396, -0.29572504962497687, -0.14561557655151075, 0.1351055332630934, -0.29336714003603537, -0.16001084840416416, 0.2158399071124802, -0.11268690151704865, 0.028635956142302396, 0.06081665833327141, 0.03850831701369076, -0.1662468391823695, -0.24034235461430808, 0.49878681328270463, -0.12916311338175457, 0.20270220810486064, 0.12725658716818133, 0.11876387641366039, -0.032390522762268247, -0.012219662696204997, -0.0009234183094372133, -0.14222103487586688, 0.1591905309424664, 0.24595676180343706, 0.09109904390381096, 0.28288631182123014, -0.38937808782026007, -0.17468072742141866, 0.23715958322633754, 0.11497398816908781, -0.01875793136487418, -0.002354744503243857, -0.3131281042696683, 0.0826156327800293, -0.08481617745748915, -0.17733987113000355, -0.10559462068172601, -0.026878933217581155, 0.07968005521355995, -0.2338206278375135, 0.08066495316381986, 0.09985931386536621, 0.0579056517006113, -0.12955102680639907, -0.12333742076797145, 0.004223750754525619, 0.05811079313555108, -0.009158655903865021, 0.01261623374795398, 0.0643857309676625, -0.025153170117166834, -0.07838135091894931, 0.31273472045578965, -0.04186608593726715, -0.3480867036224271, 0.1546848770640381, -0.19228858882970698, -0.15347556515013452, 0.03554996870621875, 0.1593608165794349, 0.22551184839947702, -0.12030828871926073, 0.1888005946811473, -0.10671420145657036, 0.11838781070168856, 0.11644421407318377, 0.02710207710861341, 0.04233329852654056, 0.06932141258800914, 0.1520116611762525, 0.12139900943653269, 0.040682326564769986, -0.11535950050597171, -0.3751930625965962, -0.21391610014201193, -0.1583340818594609, 0.12875703094651217, -0.09565474205505829, -0.22332869296136137, 0.4206283844004457, 0.07239917982472005, 0.12910558934998953, 0.14538370080133592, 0.2212950469578033, 0.10862203279592014, 0.0421004764573229, 0.06157039617096166, 0.14353859240181518, 0.1930894219178379, 0.1115964465815533, -0.15921714318312377, -0.0317951123189222, 0.1938906869098511] |
1,802.08412 | A Game Problem for Heat Equation | In this paper, we consider a two-person game problem governed by a linear
heat equation. The existence of Nash equilibrium for this problem is
considered. Moreover, the bang-bang property of Nash equilibrium is discussed.
| math.OC | in this paper we consider a twoperson game problem governed by a linear heat equation the existence of nash equilibrium for this problem is considered moreover the bangbang property of nash equilibrium is discussed | [['in', 'this', 'paper', 'we', 'consider', 'a', 'twoperson', 'game', 'problem', 'governed', 'by', 'a', 'linear', 'heat', 'equation', 'the', 'existence', 'of', 'nash', 'equilibrium', 'for', 'this', 'problem', 'is', 'considered', 'moreover', 'the', 'bangbang', 'property', 'of', 'nash', 'equilibrium', 'is', 'discussed']] | [-0.18818956619019017, 0.013936247525955825, -0.12611812638009295, 0.09052556742201834, -0.023703421192134127, -0.21022563857738585, 0.10149566514540792, 0.30385483039871736, -0.3684194514199215, -0.17991283535957336, 0.11667193061165403, -0.2582762667306644, -0.1971883195288041, 0.06803264622302617, -0.09968220754800473, 0.09140329637482543, 0.06331365161082324, 0.017382251427454108, 0.027502657462130573, -0.23034396456034087, 0.44311702196650643, -0.013012122965472587, 0.2286838065175449, 0.04987560103044791, 0.1630507006912547, -0.02792646793429466, 0.07721194629009594, 0.1371690521345419, -0.2075562881278422, 0.026145981289172435, 0.3267820743734346, 0.14730819955687313, 0.4135652622755836, -0.3731656906140201, -0.17738705429741564, 0.2538363371482667, 0.08593153000316199, 0.09892833879327073, -0.08031724505674313, -0.19672365596189217, 0.09179489475483184, -0.15261237693758792, -0.17978569773464081, 0.010410810902933864, -0.006489902679972789, 0.017950605327153906, -0.3287117353585713, 0.08863201688098557, 0.12310620189151343, 0.06354266728329308, -0.1250388429445379, -0.08149789197041708, 0.023644319625900072, 0.039948377128252215, 0.010650831928668433, -0.081190814894131, 0.09116571059669643, -0.1312257864868597, -0.17650308705496548, 0.41115664712646427, -0.08644617272212225, -0.24846653903231902, 0.08109775351305656, -0.021125106702503914, -0.11339504599078175, 0.0758981089491178, 0.11169267391019008, 0.23783493151559548, -0.22925664802246234, 0.1425000450519078, -0.15290135766982155, 0.0902302155873793, 0.0744601663421182, -0.018328066326349098, 0.11215959198992043, 0.2042280578547541, 0.25441436373683457, 0.24482006000300102, 0.11679111603263985, -0.26339091919362545, -0.28850435649099593, -0.15059171649901307, -0.14607696114655802, 0.15153234181514777, -0.026377400616183877, -0.16245426774463234, 0.3657974756377585, 0.10026745991233517, 0.03446354815626845, 0.07546252354650813, 0.24035152557360775, 0.23127632347099922, -0.1886656534693697, 0.11687180145150598, 0.2631740024422898, 0.13632639070890626, 0.18474229189622052, -0.3240900269421913, 0.12380483245257945, 0.13055447252768584] |
1,802.08413 | Pontryagin's maximum principle and second order optimality condition for
optimal control problems for the nonlocal Cahn-Hilliard-Navier-Stokes systems
in two dimensions | In this work, we address some optimal control problems related to the
evolution of two isothermal, incompressible, immisible fluids in a two
dimensional bounded domain. A distributed optimal control problem is formulated
as the minimization of a suitable cost functional subject to the controlled
nonlocal Cahn-Hilliard-Navier-Stokes equations. We describe the first order
necessary conditions of optimality via Pontryagin minimum principle and prove
second order necessary and sufficient conditions of optimality for the problem.
| math.OC | in this work we address some optimal control problems related to the evolution of two isothermal incompressible immisible fluids in a two dimensional bounded domain a distributed optimal control problem is formulated as the minimization of a suitable cost functional subject to the controlled nonlocal cahnhilliardnavierstokes equations we describe the first order necessary conditions of optimality via pontryagin minimum principle and prove second order necessary and sufficient conditions of optimality for the problem | [['in', 'this', 'work', 'we', 'address', 'some', 'optimal', 'control', 'problems', 'related', 'to', 'the', 'evolution', 'of', 'two', 'isothermal', 'incompressible', 'immisible', 'fluids', 'in', 'a', 'two', 'dimensional', 'bounded', 'domain', 'a', 'distributed', 'optimal', 'control', 'problem', 'is', 'formulated', 'as', 'the', 'minimization', 'of', 'a', 'suitable', 'cost', 'functional', 'subject', 'to', 'the', 'controlled', 'nonlocal', 'cahnhilliardnavierstokes', 'equations', 'we', 'describe', 'the', 'first', 'order', 'necessary', 'conditions', 'of', 'optimality', 'via', 'pontryagin', 'minimum', 'principle', 'and', 'prove', 'second', 'order', 'necessary', 'and', 'sufficient', 'conditions', 'of', 'optimality', 'for', 'the', 'problem']] | [-0.18447972577996552, 0.04069695158654617, -0.050480797563472554, 0.08889020526678199, -0.08970900094007245, -0.14132231968687847, 0.027612854797755264, 0.29830038381624036, -0.33690430502691826, -0.2941821586444146, 0.19080695294865613, -0.14883787457882944, -0.15610020376172745, 0.13562294496740732, -0.11643616018247688, 0.20472274249833491, 0.014409745137931572, 0.01717935109304057, -0.08782447098201374, -0.27425150036449647, 0.3404404510737449, -0.03886936114092047, 0.2677755363337282, 0.0807182185494134, 0.18073687222527546, -0.020388116471521143, 0.04085813971404503, 0.07148549294409652, -0.2282652586323416, 0.1074764830894613, 0.29731535974941736, 0.08769036773527558, 0.3795666004039554, -0.48393654018744, -0.18781124068320626, 0.13610104161004224, 0.07759711094614533, 0.06500766621643884, -0.01792864300174794, -0.20027008998052528, 0.09602476756036696, -0.1035855430074864, -0.14973084109240314, -0.045530342332009845, -0.056110389129672616, 0.02708090899735301, -0.36387655237275696, 0.10792222438612953, 0.07683725852984935, 0.029342387757626258, -0.18354143663115488, -0.03959043383494847, 0.03137657757745021, 0.10483337233502728, 0.010034379064260671, -0.02563028905165589, 0.06324622703929587, -0.10229825853022906, -0.10980574546071391, 0.40311544347140527, -0.029905863989066955, -0.25567837504463065, 0.16088796559617752, -0.04043938544216669, -0.12613884416835694, 0.09589219648235787, 0.20155154259797806, 0.19186779596040854, -0.22868507409778735, 0.08099480954923718, -0.0366607774178394, 0.11857460244532882, 0.08150632269098423, 0.002055355037252108, 0.08327957012483643, 0.14967996169192097, 0.22398696234449744, 0.21560022383669597, 0.017190832023819286, -0.12886445962875667, -0.3789634029898379, -0.16071657540224907, -0.18020532314807902, 0.023938975672030613, -0.07747796808406646, -0.12734178098617122, 0.35449283238914275, 0.14742327275436967, 0.11858785092287387, 0.055861480456466474, 0.26499722910941476, 0.15296493830990382, -0.04971464209827698, 0.09193135673154353, 0.19617970790528083, 0.19754377147182822, 0.12565188558720466, -0.2808298430015081, 0.04724794077628758, 0.1305548354937653] |
1,802.08414 | Topological structures of generalized Volterra-type integral operators | We study the generalized Volterra-type integral and composition operators
acting on the classical Fock spaces. We first characterize various properties
of the operators in terms of growth and integrability conditions which are
simpler to apply than those already known Berezin type characterizations. Then,
we apply these conditions to study the compact and Schatten $\mathcal{S}_p$
class difference topological structures of the space of the operators. In
particular, we proved that the difference of two Volterra-type integral
operators is compact if and only if both are compact.
| math.FA math.CV | we study the generalized volterratype integral and composition operators acting on the classical fock spaces we first characterize various properties of the operators in terms of growth and integrability conditions which are simpler to apply than those already known berezin type characterizations then we apply these conditions to study the compact and schatten mathcals_p class difference topological structures of the space of the operators in particular we proved that the difference of two volterratype integral operators is compact if and only if both are compact | [['we', 'study', 'the', 'generalized', 'volterratype', 'integral', 'and', 'composition', 'operators', 'acting', 'on', 'the', 'classical', 'fock', 'spaces', 'we', 'first', 'characterize', 'various', 'properties', 'of', 'the', 'operators', 'in', 'terms', 'of', 'growth', 'and', 'integrability', 'conditions', 'which', 'are', 'simpler', 'to', 'apply', 'than', 'those', 'already', 'known', 'berezin', 'type', 'characterizations', 'then', 'we', 'apply', 'these', 'conditions', 'to', 'study', 'the', 'compact', 'and', 'schatten', 'mathcals_p', 'class', 'difference', 'topological', 'structures', 'of', 'the', 'space', 'of', 'the', 'operators', 'in', 'particular', 'we', 'proved', 'that', 'the', 'difference', 'of', 'two', 'volterratype', 'integral', 'operators', 'is', 'compact', 'if', 'and', 'only', 'if', 'both', 'are', 'compact']] | [-0.12142238967558917, 0.12611498201594634, -0.06218650864218088, 0.1426556560115012, -0.11978457509266104, -0.04221809538190856, -0.03926674110047958, 0.38671508106567404, -0.27703823640066033, -0.1939481596517212, 0.1829514778999831, -0.25512152587830583, -0.19378773613887676, 0.23461814538082656, -0.08755052857758368, 0.010663202333757105, 0.026520125858266564, 0.06704701632261276, -0.17559623630333912, -0.26129429721656966, 0.4859228932463071, -0.07072158973691438, 0.20716536289957516, 0.02595406119876048, 0.06426478548194556, -0.014269125182181597, -0.03936622918528669, 0.006813218800337328, -0.1548123707259519, 0.15825665323885488, 0.20513021924039898, 0.07255667682714856, 0.21804940218434615, -0.41618641051737704, -0.17807376954485388, 0.17935186126954197, 0.08000732765752165, -0.02664073351359762, -0.01237626731642248, -0.29510308852528827, 0.08969185168252272, -0.12891700577319545, -0.15299757678499992, -0.1260051701875294, 0.03268864150980816, 0.07361140247119372, -0.2695899709182627, 0.030736622115706696, 0.10425979484091787, 0.00041923481861458106, -0.15638538492733942, -0.0962491919998737, -0.032155106163254996, 0.10935304504545296, -0.05150365089066326, -0.04459770860917428, 0.062314716644366, -0.06510847258819814, -0.09236197402043378, 0.3277860305326826, -0.07058037725253277, -0.24421775532228981, 0.21392301193931523, -0.2297063883722705, -0.15982826006982256, 0.038076355483602074, 0.13425125210162472, 0.19617673224386048, -0.174373763898278, 0.1429763374165358, -0.046143684711526425, 0.06859330782557235, 0.09509032725849573, 0.14532752118676023, 0.05082416633034453, 0.07471533950473018, 0.12355884256608346, 0.16586414200856406, -0.00798336733954356, -0.09992146742023418, -0.35128456359619603, -0.21401290729203645, -0.14682319655137904, 0.047131954297861635, -0.059941735698649766, -0.17922218622749342, 0.3837092105901855, 0.08363968187819838, 0.1524624626535703, 0.0666566310573698, 0.20084728265509885, 0.14697638106094124, 0.07460377960575416, 0.07067767629290328, 0.1775959161165006, 0.21612805180689867, 0.036682819783249325, -0.18366228189209804, -0.014538673333385412, 0.1773768290219938] |
1,802.08415 | TARANET: Traffic-Analysis Resistant Anonymity at the NETwork layer | Modern low-latency anonymity systems, no matter whether constructed as an
overlay or implemented at the network layer, offer limited security guarantees
against traffic analysis. On the other hand, high-latency anonymity systems
offer strong security guarantees at the cost of computational overhead and long
delays, which are excessive for interactive applications. We propose TARANET,
an anonymity system that implements protection against traffic analysis at the
network layer, and limits the incurred latency and overhead. In TARANET's setup
phase, traffic analysis is thwarted by mixing. In the data transmission phase,
end hosts and ASes coordinate to shape traffic into constant-rate transmission
using packet splitting. Our prototype implementation shows that TARANET can
forward anonymous traffic at over 50~Gbps using commodity hardware.
| cs.CR | modern lowlatency anonymity systems no matter whether constructed as an overlay or implemented at the network layer offer limited security guarantees against traffic analysis on the other hand highlatency anonymity systems offer strong security guarantees at the cost of computational overhead and long delays which are excessive for interactive applications we propose taranet an anonymity system that implements protection against traffic analysis at the network layer and limits the incurred latency and overhead in taranets setup phase traffic analysis is thwarted by mixing in the data transmission phase end hosts and ases coordinate to shape traffic into constantrate transmission using packet splitting our prototype implementation shows that taranet can forward anonymous traffic at over 50gbps using commodity hardware | [['modern', 'lowlatency', 'anonymity', 'systems', 'no', 'matter', 'whether', 'constructed', 'as', 'an', 'overlay', 'or', 'implemented', 'at', 'the', 'network', 'layer', 'offer', 'limited', 'security', 'guarantees', 'against', 'traffic', 'analysis', 'on', 'the', 'other', 'hand', 'highlatency', 'anonymity', 'systems', 'offer', 'strong', 'security', 'guarantees', 'at', 'the', 'cost', 'of', 'computational', 'overhead', 'and', 'long', 'delays', 'which', 'are', 'excessive', 'for', 'interactive', 'applications', 'we', 'propose', 'taranet', 'an', 'anonymity', 'system', 'that', 'implements', 'protection', 'against', 'traffic', 'analysis', 'at', 'the', 'network', 'layer', 'and', 'limits', 'the', 'incurred', 'latency', 'and', 'overhead', 'in', 'taranets', 'setup', 'phase', 'traffic', 'analysis', 'is', 'thwarted', 'by', 'mixing', 'in', 'the', 'data', 'transmission', 'phase', 'end', 'hosts', 'and', 'ases', 'coordinate', 'to', 'shape', 'traffic', 'into', 'constantrate', 'transmission', 'using', 'packet', 'splitting', 'our', 'prototype', 'implementation', 'shows', 'that', 'taranet', 'can', 'forward', 'anonymous', 'traffic', 'at', 'over', '50gbps', 'using', 'commodity', 'hardware']] | [-0.2668933110033864, -0.018411508734540182, -0.07610870270965327, 0.03791696966008953, -0.04985053535844935, -0.2682228225136274, 0.16663119717288696, 0.41333873305273683, -0.2621162233367693, -0.3215983282251839, 0.13640901840316424, -0.2807448030482128, -0.11535306699296231, 0.19524072986218685, -0.13724058371837855, 0.11011408265116379, 0.0839222499921003, -0.018655060408555232, 0.0035164842428409763, -0.278154050546347, 0.26347400963570916, 0.09215125579819933, 0.392719097312932, 0.09439102436513885, 0.07972139881473451, 0.030914225834095033, -0.008645930409170034, -0.038114247674106115, -0.013621333719608006, 0.05136993137727443, 0.2991343012688224, 0.19048330438192607, 0.28051101374276505, -0.5062101029937989, -0.23650889318403706, 0.06665640391139804, 0.15094744353841075, 0.07276045312398326, -0.08076789310271443, -0.31712525262775126, 0.10928607671194825, -0.24442664827955396, -0.07135183107222251, -0.07186362243935532, -0.07114112534838025, 0.007030031235333075, -0.24312345549390701, -0.02380929675704816, -0.04856436213543802, 0.09897514944334448, 0.04411951033806984, -0.029539966141894917, -0.052008619293031334, 0.13489752897804833, 0.01776042048157634, -0.03742487133856405, 0.1660712712460704, -0.1061324868514611, -0.1388119071713861, 0.3639471547416689, -0.011095564565294537, -0.14147563734124496, 0.19003903037427286, 0.037974640298144596, -0.15490090996925637, 0.15515611228418716, 0.27922251770270806, -0.033461099459887726, -0.16805611607994428, 0.006113910285772331, 0.025924285628685827, 0.2477349744611338, 0.06925740146502983, 0.12958120942634546, 0.15722336935434947, 0.2604461438267639, 0.15822870968922711, 0.09448885762085729, -0.07665040730417036, -0.11242611789585728, -0.23082683920419136, -0.10295867295568123, -0.1508919350177932, -0.010072159986297617, -0.09389433800191782, -0.08165173359999531, 0.3481576228718551, 0.1682859110980899, 0.10342314145772864, 0.14054259682674647, 0.46851403736754466, 0.04054747968748735, 0.09368784967483136, 0.2058365345532238, 0.16081974091388188, -0.026183469995055674, 0.2054882649599836, -0.20176883710583002, 0.17572216122215123, -0.0010817294609487842] |
1,802.08416 | Interior and exterior curves of finite Blaschke products | In this paper, for a Blaschke product of degree d, we give some geometrical
properties that lie between the interior curve and the exterior curve.
| math.CV | in this paper for a blaschke product of degree d we give some geometrical properties that lie between the interior curve and the exterior curve | [['in', 'this', 'paper', 'for', 'a', 'blaschke', 'product', 'of', 'degree', 'd', 'we', 'give', 'some', 'geometrical', 'properties', 'that', 'lie', 'between', 'the', 'interior', 'curve', 'and', 'the', 'exterior', 'curve']] | [-0.20979440566152335, 0.006641252897679806, -0.15690176568925382, -0.019786385488696396, -0.13909228034317495, -0.07175370601937175, 0.04096635181922466, 0.3723457112908363, -0.3199103012681007, -0.21472338408231736, 0.12058508358430117, -0.20843794241547584, -0.19919268913567068, 0.1933128695189953, -0.1253298769891262, -0.0461472487449646, 0.03940136913210154, 0.1043559018522501, -0.1480304220598191, -0.2384401597827673, 0.4350426967442036, -0.05073625102639198, 0.1261082835495472, 0.07578097186982631, 0.054081941731274126, 0.003268215507268906, 0.06284929048269987, 0.006587333083152771, -0.2630769851538935, 0.18505736611783505, 0.22698260009288787, 0.1587564907222986, 0.13401915594935418, -0.35765622213482856, -0.16010625166818498, 0.199176970385015, 0.11533126162365079, -0.06123676925897598, -0.05569719050079584, -0.16899812243878842, 0.05517596837133169, -0.14077751712466124, -0.23444716390222312, -0.02808065414428711, 0.12135717820376157, 0.007317162677645683, -0.1944759024679661, 0.06546127047389745, 0.12812231555581094, 0.16836262177675962, -0.04882163521833718, -0.12132192607969046, -0.02848333176225424, 0.06663019981235266, -0.014239584878087044, 0.027557264417409896, 0.020780762676149606, -0.07842540598474443, -0.044616188779473306, 0.3503886898048222, -0.039025621004402634, -0.23119105905294418, 0.1288916949927807, -0.2371967339515686, -0.09600721791386604, 0.10128187289461493, 0.17418521396815778, 0.15355779707431794, -0.099954703040421, 0.149822948386427, -0.07373872235417366, 0.05692051980644464, 0.1432690240815282, 0.0341836996562779, 0.18620986111462115, 0.05235435582697392, 0.06840236712247133, 0.17761721681803466, -0.044630603417754176, -0.024553022906184198, -0.41642345011234283, -0.23950060248374938, -0.11335498556494712, 0.11087587170302868, -0.2081748715409776, -0.19305047802627087, 0.4273182004271075, 0.04686888918280602, 0.25091308712959287, 0.04034923497587442, 0.24242404028773307, 0.03931102007627487, -0.024619016610085965, 0.11640251096338033, 0.20871756455511786, 0.20803644753992556, 0.039367822632193565, -0.19227102987468242, 0.023371909875422717, 0.16604493390768765] |
1,802.08417 | Geometric Lower Bounds for Distributed Parameter Estimation under
Communication Constraints | We consider parameter estimation in distributed networks, where each sensor
in the network observes an independent sample from an underlying distribution
and has $k$ bits to communicate its sample to a centralized processor which
computes an estimate of a desired parameter. We develop lower bounds for the
minimax risk of estimating the underlying parameter for a large class of losses
and distributions. Our results show that under mild regularity conditions, the
communication constraint reduces the effective sample size by a factor of $d$
when $k$ is small, where $d$ is the dimension of the estimated parameter.
Furthermore, this penalty reduces at most exponentially with increasing $k$,
which is the case for some models, e.g., estimating high-dimensional
distributions. For other models however, we show that the sample size reduction
is re-mediated only linearly with increasing $k$, e.g. when some sub-Gaussian
structure is available. We apply our results to the distributed setting with
product Bernoulli model, multinomial model, Gaussian location models, and
logistic regression which recover or strengthen existing results.
Our approach significantly deviates from existing approaches for developing
information-theoretic lower bounds for communication-efficient estimation. We
circumvent the need for strong data processing inequalities used in prior work
and develop a geometric approach which builds on a new representation of the
communication constraint. This approach allows us to strengthen and generalize
existing results with simpler and more transparent proofs.
| cs.DC cs.IT math.IT stat.ME | we consider parameter estimation in distributed networks where each sensor in the network observes an independent sample from an underlying distribution and has k bits to communicate its sample to a centralized processor which computes an estimate of a desired parameter we develop lower bounds for the minimax risk of estimating the underlying parameter for a large class of losses and distributions our results show that under mild regularity conditions the communication constraint reduces the effective sample size by a factor of d when k is small where d is the dimension of the estimated parameter furthermore this penalty reduces at most exponentially with increasing k which is the case for some models eg estimating highdimensional distributions for other models however we show that the sample size reduction is remediated only linearly with increasing k eg when some subgaussian structure is available we apply our results to the distributed setting with product bernoulli model multinomial model gaussian location models and logistic regression which recover or strengthen existing results our approach significantly deviates from existing approaches for developing informationtheoretic lower bounds for communicationefficient estimation we circumvent the need for strong data processing inequalities used in prior work and develop a geometric approach which builds on a new representation of the communication constraint this approach allows us to strengthen and generalize existing results with simpler and more transparent proofs | [['we', 'consider', 'parameter', 'estimation', 'in', 'distributed', 'networks', 'where', 'each', 'sensor', 'in', 'the', 'network', 'observes', 'an', 'independent', 'sample', 'from', 'an', 'underlying', 'distribution', 'and', 'has', 'k', 'bits', 'to', 'communicate', 'its', 'sample', 'to', 'a', 'centralized', 'processor', 'which', 'computes', 'an', 'estimate', 'of', 'a', 'desired', 'parameter', 'we', 'develop', 'lower', 'bounds', 'for', 'the', 'minimax', 'risk', 'of', 'estimating', 'the', 'underlying', 'parameter', 'for', 'a', 'large', 'class', 'of', 'losses', 'and', 'distributions', 'our', 'results', 'show', 'that', 'under', 'mild', 'regularity', 'conditions', 'the', 'communication', 'constraint', 'reduces', 'the', 'effective', 'sample', 'size', 'by', 'a', 'factor', 'of', 'd', 'when', 'k', 'is', 'small', 'where', 'd', 'is', 'the', 'dimension', 'of', 'the', 'estimated', 'parameter', 'furthermore', 'this', 'penalty', 'reduces', 'at', 'most', 'exponentially', 'with', 'increasing', 'k', 'which', 'is', 'the', 'case', 'for', 'some', 'models', 'eg', 'estimating', 'highdimensional', 'distributions', 'for', 'other', 'models', 'however', 'we', 'show', 'that', 'the', 'sample', 'size', 'reduction', 'is', 'remediated', 'only', 'linearly', 'with', 'increasing', 'k', 'eg', 'when', 'some', 'subgaussian', 'structure', 'is', 'available', 'we', 'apply', 'our', 'results', 'to', 'the', 'distributed', 'setting', 'with', 'product', 'bernoulli', 'model', 'multinomial', 'model', 'gaussian', 'location', 'models', 'and', 'logistic', 'regression', 'which', 'recover', 'or', 'strengthen', 'existing', 'results', 'our', 'approach', 'significantly', 'deviates', 'from', 'existing', 'approaches', 'for', 'developing', 'informationtheoretic', 'lower', 'bounds', 'for', 'communicationefficient', 'estimation', 'we', 'circumvent', 'the', 'need', 'for', 'strong', 'data', 'processing', 'inequalities', 'used', 'in', 'prior', 'work', 'and', 'develop', 'a', 'geometric', 'approach', 'which', 'builds', 'on', 'a', 'new', 'representation', 'of', 'the', 'communication', 'constraint', 'this', 'approach', 'allows', 'us', 'to', 'strengthen', 'and', 'generalize', 'existing', 'results', 'with', 'simpler', 'and', 'more', 'transparent', 'proofs']] | [-0.07159266303347768, 0.06776746105173724, -0.07634625986571289, 0.02652276292548921, -0.0974841734244681, -0.20939639870011728, 0.09035730655489711, 0.350471624969156, -0.27145925883895056, -0.3234626055809993, 0.10933099978342899, -0.26025722196100265, -0.12414667698362891, 0.207675671799053, -0.10690722768379597, 0.06577075999009624, 0.05459182420109567, 0.04356101140921468, -0.07854169338843109, -0.2709142123420809, 0.30552970416667474, 0.05170821413676775, 0.29990623267223887, 0.002792535612558626, 0.07848622741245373, 0.02564257671019331, -0.04176494349327579, -0.0018709247879528067, -0.15547949329485536, 0.16446390930185759, 0.2514738681325211, 0.16284409084375656, 0.30557013446740017, -0.381983915456065, -0.24284799200470358, 0.13619075832470004, 0.1280410296691629, 0.10809273835341343, -0.015825144070190877, -0.25039935248313133, 0.10020263222998033, -0.14201044081684636, -0.09338006903191758, -0.07319274324398603, -0.00478781912617369, -0.00047188002610012953, -0.374952248559438, 0.06769023827184299, 0.0862156631966585, 0.018112034637928175, -0.057688902903272304, -0.16263099635298886, 0.044378379305480005, 0.09907493599365355, 0.04716275902854746, 0.030345534452438223, 0.11542697192891808, -0.12483238870286206, -0.10041683462103788, 0.31826387164757347, -0.05847936584552676, -0.2199508075311058, 0.17867785044135484, -0.10946889235514999, -0.1601207830865215, 0.1044017608003898, 0.2216642048283755, 0.11867110514685118, -0.12429457876330245, 0.09930508687019364, -0.06494254300100032, 0.1851361333782321, 0.01492841896654357, 0.022809336511192574, 0.08135050891217517, 0.17247188779718287, 0.14515904351937614, 0.1602715931974848, -0.1045192153129464, -0.09279188007067085, -0.27502860877630075, -0.11881092400802915, -0.21165308345002554, 0.006868263848109524, -0.17365429154866466, -0.1364157030631743, 0.3272663015761466, 0.1963044089995456, 0.2336193596624199, 0.1547578534466268, 0.3221486196381405, 0.12042785308011993, 0.06524973214370104, 0.13447939957972074, 0.16726564564398544, 0.10867123097070547, 0.040813982488776226, -0.14845459361043697, 0.12757034916102492, 0.0075976799861712605] |
1,802.08418 | Non-Abelian adiabatic geometric transformations in a cold Strontium gas | Topology, geometry, and gauge fields play key roles in quantum physics as
exemplified by fundamental phenomena such as the Aharonov-Bohm effect, the
integer quantum Hall effect, the spin Hall, and topological insulators. The
concept of topological protection has also become a salient ingredient in many
schemes for quantum information processing and fault-tolerant quantum
computation. The physical properties of such systems crucially depend on the
symmetry group of the underlying holonomy. We study here a laser-cooled gas of
strontium atoms coupled to laser fields through a 4-level resonant tripod
scheme. By cycling the relative phases of the tripod beams, we realize
non-Abelian SU(2) geometrical transformations acting on the dark-states of the
system and demonstrate their non-Abelian character. We also reveal how the
gauge field imprinted on the atoms impact their internal state dynamics. It
leads to a new thermometry method based on the interferometric displacement of
atoms in the tripod beams.
| quant-ph cond-mat.quant-gas | topology geometry and gauge fields play key roles in quantum physics as exemplified by fundamental phenomena such as the aharonovbohm effect the integer quantum hall effect the spin hall and topological insulators the concept of topological protection has also become a salient ingredient in many schemes for quantum information processing and faulttolerant quantum computation the physical properties of such systems crucially depend on the symmetry group of the underlying holonomy we study here a lasercooled gas of strontium atoms coupled to laser fields through a 4level resonant tripod scheme by cycling the relative phases of the tripod beams we realize nonabelian su2 geometrical transformations acting on the darkstates of the system and demonstrate their nonabelian character we also reveal how the gauge field imprinted on the atoms impact their internal state dynamics it leads to a new thermometry method based on the interferometric displacement of atoms in the tripod beams | [['topology', 'geometry', 'and', 'gauge', 'fields', 'play', 'key', 'roles', 'in', 'quantum', 'physics', 'as', 'exemplified', 'by', 'fundamental', 'phenomena', 'such', 'as', 'the', 'aharonovbohm', 'effect', 'the', 'integer', 'quantum', 'hall', 'effect', 'the', 'spin', 'hall', 'and', 'topological', 'insulators', 'the', 'concept', 'of', 'topological', 'protection', 'has', 'also', 'become', 'a', 'salient', 'ingredient', 'in', 'many', 'schemes', 'for', 'quantum', 'information', 'processing', 'and', 'faulttolerant', 'quantum', 'computation', 'the', 'physical', 'properties', 'of', 'such', 'systems', 'crucially', 'depend', 'on', 'the', 'symmetry', 'group', 'of', 'the', 'underlying', 'holonomy', 'we', 'study', 'here', 'a', 'lasercooled', 'gas', 'of', 'strontium', 'atoms', 'coupled', 'to', 'laser', 'fields', 'through', 'a', '4level', 'resonant', 'tripod', 'scheme', 'by', 'cycling', 'the', 'relative', 'phases', 'of', 'the', 'tripod', 'beams', 'we', 'realize', 'nonabelian', 'su2', 'geometrical', 'transformations', 'acting', 'on', 'the', 'darkstates', 'of', 'the', 'system', 'and', 'demonstrate', 'their', 'nonabelian', 'character', 'we', 'also', 'reveal', 'how', 'the', 'gauge', 'field', 'imprinted', 'on', 'the', 'atoms', 'impact', 'their', 'internal', 'state', 'dynamics', 'it', 'leads', 'to', 'a', 'new', 'thermometry', 'method', 'based', 'on', 'the', 'interferometric', 'displacement', 'of', 'atoms', 'in', 'the', 'tripod', 'beams']] | [-0.1775254667274809, 0.24270475653310616, -0.0884635078192999, 0.02599484823954602, -0.040416036281579484, -0.16120349151392777, 0.03942420011153445, 0.3679302747733891, -0.26072086283316215, -0.26775992557561645, 0.036567600702401254, -0.22493636459112168, -0.18719724272067348, 0.22154940743620197, -0.020341780148252536, 0.06183672378460566, -0.011384910773485898, 0.006824363050982356, -0.047131874185676374, -0.23011421750391794, 0.32697903765986364, 0.037613641784215966, 0.33912415147759023, 0.05149824726395309, 0.12826452090715368, 0.017630361875053496, 0.043031695801764726, -0.03012209730843703, -0.1031890159814308, 0.08664278956595808, 0.1907397998465846, -0.005343201599704722, 0.18223301017656923, -0.4875523952891429, -0.21062365654235085, 0.05307852821579824, 0.11121012723694244, 0.18292388306930663, -0.10562758682916562, -0.34867041625703377, -0.019320286264022192, -0.158082533814013, -0.1115716447820887, -0.1305886451814634, -0.002346371110373487, -0.019068377863926192, -0.18892190018047889, 0.006469504859802934, 0.06816555413596992, 0.12055889701625953, -0.017224492652652166, -0.038676544378977266, -0.03356313762875895, 0.10069994026174148, -0.03894902836997062, -0.0033747720927931367, 0.20708109697715069, -0.16322273357771336, -0.18827128514647484, 0.4429243111230123, -0.04536983778079351, -0.1880038249058028, 0.17406700110528617, -0.1232416472833332, -0.1144592326072355, 0.07327615733879309, 0.1626289665636917, 0.09843070177982251, -0.054963760506361724, 0.1085978920214499, -0.019166276917482416, 0.1500339181550468, 0.045246014948934314, 0.17531876754636566, 0.26615372081597644, 0.143370845609655, 0.06823813351220451, 0.1421464005485177, -0.08882834145954499, -0.13210071119169395, -0.28455160059655704, -0.20799049076934656, -0.20062460302375257, 0.08154994045714072, -0.039284554685388384, -0.1681477604775379, 0.41796873321686384, 0.15798741179440792, 0.1362634423840791, -0.12895360893725108, 0.2881699546178182, 0.0892222922683383, 0.05288170539153119, -0.009791198233142496, 0.22702547357417643, 0.23389669350348413, 0.051399988505678874, -0.3405292360748475, -0.007677253990744551, 0.09854445992658535] |
1,802.08419 | Path connected components of the space of Volterra-type integral
operators | We study the topological structure of the space of Volterra-type integral
operators on Fock spaces endowed with the operator norm. We proved that the
space has the same connected and path connected components which is the set of
all compact operators acting on the Fock spaces. We also obtained a
characterization of isolated points of the space of the operators and showed
that there exists no essentially isolated Volterra-type integral operator.
| math.FA math.CV | we study the topological structure of the space of volterratype integral operators on fock spaces endowed with the operator norm we proved that the space has the same connected and path connected components which is the set of all compact operators acting on the fock spaces we also obtained a characterization of isolated points of the space of the operators and showed that there exists no essentially isolated volterratype integral operator | [['we', 'study', 'the', 'topological', 'structure', 'of', 'the', 'space', 'of', 'volterratype', 'integral', 'operators', 'on', 'fock', 'spaces', 'endowed', 'with', 'the', 'operator', 'norm', 'we', 'proved', 'that', 'the', 'space', 'has', 'the', 'same', 'connected', 'and', 'path', 'connected', 'components', 'which', 'is', 'the', 'set', 'of', 'all', 'compact', 'operators', 'acting', 'on', 'the', 'fock', 'spaces', 'we', 'also', 'obtained', 'a', 'characterization', 'of', 'isolated', 'points', 'of', 'the', 'space', 'of', 'the', 'operators', 'and', 'showed', 'that', 'there', 'exists', 'no', 'essentially', 'isolated', 'volterratype', 'integral', 'operator']] | [-0.20470355561291667, 0.13577409972712187, -0.082337163044812, 0.07134410562682372, -0.06893109861092353, -0.019974678630192935, 0.00350032390003473, 0.4006537559481574, -0.2506708880020699, -0.16317114946235653, 0.12554649958177141, -0.30903902053045973, -0.16612828398307025, 0.2095850883576442, -0.04742449114072911, 0.007728436489550161, 0.09251465662185784, 0.11832251863449182, -0.12221339375803798, -0.22668238534775734, 0.5151684761873748, -0.06560391654312925, 0.19367858095907828, 0.006377274865730548, 0.1933955995654556, 0.052262849023591886, -0.05517195862993388, 0.033995738704311725, -0.1232613805285081, 0.17588303953041912, 0.209790401816578, 0.07068919126783878, 0.23142296687411276, -0.4045472787037282, -0.18508655699888166, 0.20857862493311854, 0.08899779407910897, -0.06572638275790435, -0.012647129323097393, -0.30757820249443324, 0.047474303486114235, -0.11673627499963196, -0.17407822862765948, -0.1002785794463166, 0.0395657188967395, 0.003036100545268453, -0.25814027037278053, -0.021375043577150588, 0.09236408012237032, 0.009428549702213684, -0.16573225060136806, -0.08114753083758791, -0.09445019094863723, 0.11310823547037345, -0.06806280312102131, 0.06978453146490518, 0.06088223627073244, -0.054994161955644966, -0.12888285614104128, 0.3055419086439299, -0.06377181885632831, -0.23487271333087079, 0.16109958469447955, -0.20859491863799556, -0.10881772549481879, 0.0783782035381284, 0.07606877967662795, 0.1477010019228492, -0.09211421434023143, 0.20979333632055042, -0.0931743815160868, 0.09624396036313453, 0.06060354450953678, 0.12235459491682672, 0.05928238821972217, 0.1162724511199434, 0.1790992760673964, 0.1253565337220338, 0.019408009487243607, -0.08702884546094115, -0.3772789564141085, -0.2068316513692147, -0.21338463004868688, 0.06875685218092002, -0.09330938947280462, -0.24500833081842308, 0.38122585545044757, 0.033011251814584704, 0.19529754232982516, 0.02620372621008051, 0.2191998623229537, 0.1636942435126886, 0.10955732614851334, 0.108962980105581, 0.15049083511227032, 0.17525216875414193, 0.031118285806167503, -0.19330786566682895, -0.02229945509838806, 0.17786904082069516] |
1,802.0842 | New Bounds on Axion-Like Particles From the Fermi Large Area Telescope
observation of PKS $2155-304$ | The axion-like particle (ALP)-photon mixing in the magnetic field around
$\gamma$-ray sources or along the line-of-sight could induce oscillation
between photons and ALPs, which then causes irregularities in the $\gamma$-ray
spectra. In this work we try to search for such spectral irregularities in the
spectrum of PKS $2155-304$ using 8.6 years of the Fermi Large Area Telescope
(Fermi-LAT) data. No significant evidence for the presence of ALP-photon
oscillation is obtained, and the parameter space of ALPs is constrained. The
exclusion region sensitively depends on the poorly known magnetic field of host
galaxy cluster of PKS $2155-304$. If the magnetic field is as high as $\sim
10~{\rm \mu G}$, the "hole"-like parameter region allowed in Ref.~\cite{Fermi}
can be ruled out.
| hep-ph astro-ph.HE | the axionlike particle alpphoton mixing in the magnetic field around gammaray sources or along the lineofsight could induce oscillation between photons and alps which then causes irregularities in the gammaray spectra in this work we try to search for such spectral irregularities in the spectrum of pks 2155304 using 86 years of the fermi large area telescope fermilat data no significant evidence for the presence of alpphoton oscillation is obtained and the parameter space of alps is constrained the exclusion region sensitively depends on the poorly known magnetic field of host galaxy cluster of pks 2155304 if the magnetic field is as high as sim 10rm mu g the holelike parameter region allowed in refcitefermi can be ruled out | [['the', 'axionlike', 'particle', 'alpphoton', 'mixing', 'in', 'the', 'magnetic', 'field', 'around', 'gammaray', 'sources', 'or', 'along', 'the', 'lineofsight', 'could', 'induce', 'oscillation', 'between', 'photons', 'and', 'alps', 'which', 'then', 'causes', 'irregularities', 'in', 'the', 'gammaray', 'spectra', 'in', 'this', 'work', 'we', 'try', 'to', 'search', 'for', 'such', 'spectral', 'irregularities', 'in', 'the', 'spectrum', 'of', 'pks', '2155304', 'using', '86', 'years', 'of', 'the', 'fermi', 'large', 'area', 'telescope', 'fermilat', 'data', 'no', 'significant', 'evidence', 'for', 'the', 'presence', 'of', 'alpphoton', 'oscillation', 'is', 'obtained', 'and', 'the', 'parameter', 'space', 'of', 'alps', 'is', 'constrained', 'the', 'exclusion', 'region', 'sensitively', 'depends', 'on', 'the', 'poorly', 'known', 'magnetic', 'field', 'of', 'host', 'galaxy', 'cluster', 'of', 'pks', '2155304', 'if', 'the', 'magnetic', 'field', 'is', 'as', 'high', 'as', 'sim', '10rm', 'mu', 'g', 'the', 'holelike', 'parameter', 'region', 'allowed', 'in', 'refcitefermi', 'can', 'be', 'ruled', 'out']] | [-0.12744972193850426, 0.22404984946824388, -0.026009408259859024, 0.13972177436985708, -0.1412265476991691, -0.0862456364793924, 0.06514195335429099, 0.3920844809183756, -0.18964118380652015, -0.4055182646123408, 0.03472574810809219, -0.28165923056618897, -0.02491085663224744, 0.2520528788119949, 0.009660968911672264, -0.049038574719107, 0.039423039489844026, -0.031391144388797296, 0.006475443348004404, -0.1831065056316744, 0.2574884423520416, 0.12749938936943536, 0.2168702883922132, 0.04819763702403564, 0.0915612448386698, -0.03322241106465206, -0.017178990605871303, -0.030180284583998324, -0.1219640407648127, 0.0038416874437135155, 0.184930698710328, 0.07251716266638773, 0.16699443815149745, -0.3376174711038248, -0.2132431697100401, 0.19146171933675374, 0.20805775780641175, 0.003454788729067008, -0.018979321472678272, -0.34918001556169176, 0.014606767566874623, -0.12979576271816584, -0.1522758042881802, 0.029355729944901383, 0.012104052232412652, 0.015567339024944546, -0.20506587161650977, 0.12955855064970143, -0.027492183797314006, 0.05336365712928917, -0.1198211217050488, -0.06339320198680132, -0.05623283884113149, 0.03939907891888929, 0.12756668539694116, 0.08036552618161018, 0.17118000666121558, -0.14165862527048467, -0.0709376792014987, 0.38153653145546756, -0.08748617243826769, -0.0536511860851009, 0.13995854463625573, -0.2374629781194726, -0.21936743633853176, 0.1786563551305967, 0.1807612643095712, 0.0758727218450631, -0.11278867905848991, 0.11724246328724232, -0.04299872798718891, 0.20809303570570328, 0.05253436824433127, 0.061413470712037545, 0.3074914550535002, 0.1470505806076798, 0.10509909893054578, 0.08696286332442314, -0.3006110309319318, 0.007500789072995974, -0.296398244987605, -0.07819460028529925, -0.18026396005130293, 0.0725631564163743, -0.1137518914161404, -0.12991790159682395, 0.404705243765266, 0.09686470912548445, 0.20685003416896877, -0.07559212547296784, 0.25697444047841983, 0.07911469434758932, 0.059772688054905855, 0.10484381843460881, 0.37847381675521197, 0.14558715053628815, 0.11015744270930478, -0.20955046602811908, 0.028924797136746977, -0.02637953993911713] |
1,802.08421 | Direct Multipixel Imaging and Spectroscopy of an Exoplanet with a Solar
Gravity Lens Mission | The remarkable optical properties of the solar gravitational lens (SGL)
include major brightness amplification (~1e11 at wavelength of 1 um) and
extreme angular resolution (~1e-10 arcsec) in a narrow field of view. A mission
to the SGL carrying a modest telescope and coronagraph opens up a possibility
for direct megapixel imaging and high-resolution spectroscopy of a habitable
Earth-like exoplanet at a distance of up to 100 light years. The entire image
of such a planet is compressed by the SGL into a region with a diameter of ~1.3
km in the vicinity of the focal line. The telescope, acting as a single pixel
detector while traversing this region, can build an image of the exoplanet with
kilometer-scale resolution of its surface, enough to see its surface features
and signs of habitability. We report here on the results of our initial study
of a mission to the deep outer regions of our solar system, with the primary
mission objective of conducting direct megapixel high-resolution imaging and
spectroscopy of a potentially habitable exoplanet by exploiting the remarkable
optical properties of the SGL. Our main goal was to investigate what it takes
to operate spacecraft at such enormous distances with the needed precision.
Specifically, we studied i) how a space mission to the focal region of the SGL
may be used to obtain high-resolution direct imaging and spectroscopy of an
exoplanet by detecting, tracking, and studying the Einstein ring around the
Sun, and ii) how such information could be used to detect signs of life on
another planet. Our results indicate that a mission to the SGL with an
objective of direct imaging and spectroscopy of a distant exoplanet is
challenging, but possible. We composed a list of recommendations on the mission
architectures with risk and return tradeoffs and discuss an enabling technology
development program.
| astro-ph.IM gr-qc | the remarkable optical properties of the solar gravitational lens sgl include major brightness amplification 1e11 at wavelength of 1 um and extreme angular resolution 1e10 arcsec in a narrow field of view a mission to the sgl carrying a modest telescope and coronagraph opens up a possibility for direct megapixel imaging and highresolution spectroscopy of a habitable earthlike exoplanet at a distance of up to 100 light years the entire image of such a planet is compressed by the sgl into a region with a diameter of 13 km in the vicinity of the focal line the telescope acting as a single pixel detector while traversing this region can build an image of the exoplanet with kilometerscale resolution of its surface enough to see its surface features and signs of habitability we report here on the results of our initial study of a mission to the deep outer regions of our solar system with the primary mission objective of conducting direct megapixel highresolution imaging and spectroscopy of a potentially habitable exoplanet by exploiting the remarkable optical properties of the sgl our main goal was to investigate what it takes to operate spacecraft at such enormous distances with the needed precision specifically we studied i how a space mission to the focal region of the sgl may be used to obtain highresolution direct imaging and spectroscopy of an exoplanet by detecting tracking and studying the einstein ring around the sun and ii how such information could be used to detect signs of life on another planet our results indicate that a mission to the sgl with an objective of direct imaging and spectroscopy of a distant exoplanet is challenging but possible we composed a list of recommendations on the mission architectures with risk and return tradeoffs and discuss an enabling technology development program | [['the', 'remarkable', 'optical', 'properties', 'of', 'the', 'solar', 'gravitational', 'lens', 'sgl', 'include', 'major', 'brightness', 'amplification', '1e11', 'at', 'wavelength', 'of', '1', 'um', 'and', 'extreme', 'angular', 'resolution', '1e10', 'arcsec', 'in', 'a', 'narrow', 'field', 'of', 'view', 'a', 'mission', 'to', 'the', 'sgl', 'carrying', 'a', 'modest', 'telescope', 'and', 'coronagraph', 'opens', 'up', 'a', 'possibility', 'for', 'direct', 'megapixel', 'imaging', 'and', 'highresolution', 'spectroscopy', 'of', 'a', 'habitable', 'earthlike', 'exoplanet', 'at', 'a', 'distance', 'of', 'up', 'to', '100', 'light', 'years', 'the', 'entire', 'image', 'of', 'such', 'a', 'planet', 'is', 'compressed', 'by', 'the', 'sgl', 'into', 'a', 'region', 'with', 'a', 'diameter', 'of', '13', 'km', 'in', 'the', 'vicinity', 'of', 'the', 'focal', 'line', 'the', 'telescope', 'acting', 'as', 'a', 'single', 'pixel', 'detector', 'while', 'traversing', 'this', 'region', 'can', 'build', 'an', 'image', 'of', 'the', 'exoplanet', 'with', 'kilometerscale', 'resolution', 'of', 'its', 'surface', 'enough', 'to', 'see', 'its', 'surface', 'features', 'and', 'signs', 'of', 'habitability', 'we', 'report', 'here', 'on', 'the', 'results', 'of', 'our', 'initial', 'study', 'of', 'a', 'mission', 'to', 'the', 'deep', 'outer', 'regions', 'of', 'our', 'solar', 'system', 'with', 'the', 'primary', 'mission', 'objective', 'of', 'conducting', 'direct', 'megapixel', 'highresolution', 'imaging', 'and', 'spectroscopy', 'of', 'a', 'potentially', 'habitable', 'exoplanet', 'by', 'exploiting', 'the', 'remarkable', 'optical', 'properties', 'of', 'the', 'sgl', 'our', 'main', 'goal', 'was', 'to', 'investigate', 'what', 'it', 'takes', 'to', 'operate', 'spacecraft', 'at', 'such', 'enormous', 'distances', 'with', 'the', 'needed', 'precision', 'specifically', 'we', 'studied', 'i', 'how', 'a', 'space', 'mission', 'to', 'the', 'focal', 'region', 'of', 'the', 'sgl', 'may', 'be', 'used', 'to', 'obtain', 'highresolution', 'direct', 'imaging', 'and', 'spectroscopy', 'of', 'an', 'exoplanet', 'by', 'detecting', 'tracking', 'and', 'studying', 'the', 'einstein', 'ring', 'around', 'the', 'sun', 'and', 'ii', 'how', 'such', 'information', 'could', 'be', 'used', 'to', 'detect', 'signs', 'of', 'life', 'on', 'another', 'planet', 'our', 'results', 'indicate', 'that', 'a', 'mission', 'to', 'the', 'sgl', 'with', 'an', 'objective', 'of', 'direct', 'imaging', 'and', 'spectroscopy', 'of', 'a', 'distant', 'exoplanet', 'is', 'challenging', 'but', 'possible', 'we', 'composed', 'a', 'list', 'of', 'recommendations', 'on', 'the', 'mission', 'architectures', 'with', 'risk', 'and', 'return', 'tradeoffs', 'and', 'discuss', 'an', 'enabling', 'technology', 'development', 'program']] | [-0.09938097503724344, 0.08632691022388742, -0.08329708241636515, 0.0077987738028446225, -0.11116830920738889, -0.07303512252756203, 0.05175975203168708, 0.3833110837716091, -0.22901915977493126, -0.37640062902764176, 0.1329228689547918, -0.2886180910096806, -0.12397218601884542, 0.24322193379541673, -0.07003806675705267, 0.05134387034421713, 0.11502568944725855, -0.027840464592553578, -0.048418891441349914, -0.23109146683563214, 0.265199296792818, 0.148094474249238, 0.15878755832090974, 0.016140813156746526, 0.12414141753087105, -0.01673942367740543, -0.05110975942614532, -0.011046786559071077, -0.14222629670765802, 0.13750250729507094, 0.2690738080838843, 0.16775925424326185, 0.26269289187235845, -0.37571953394333063, -0.2171138882658611, 0.05842186970991277, 0.11751087688623514, 0.016530269987430943, -0.05797912178843263, -0.31188130820176213, 0.07846018137249923, -0.13412849765212356, -0.17174161769394203, 0.0070460471891279994, 0.02272015506446374, -0.002321689648496678, -0.25225032182542967, -0.012823015309574193, 0.007900941171004924, 0.10626597299906641, -0.10337740223467758, -0.0698071909672889, -0.015861811974418924, 0.1350318063651859, -0.01911573685452786, 0.07165503589126485, 0.13624154184852413, -0.14666454892490066, -0.039775562577877836, 0.3903764617283958, -0.08783716754216873, -0.04315557827115281, 0.2135458042126593, -0.21330309447150875, -0.0725641008019324, 0.1519739852989993, 0.19135177327514263, 0.13734824940352547, -0.1344846169998567, 0.016217543759355506, -0.008898686163515987, 0.2070206976545796, 0.07836755646071983, 0.07807737328451349, 0.32775623138704096, 0.21542896583232263, 0.11347636430524675, 0.11031495556404926, -0.27071386231772526, 0.006725357559205817, -0.2439879896736007, -0.19751467438844889, -0.16946092578011954, 0.046988856209293994, -0.07661723209814275, -0.11343280148433385, 0.3968420967394918, 0.17049954878513252, 0.1693027970775814, -0.001542755807379865, 0.3506440751081863, 0.023462911390865974, 0.12822018873443, -0.0036681274326814226, 0.32344037978848234, 0.12110715228617068, 0.11278006686314028, -0.21055075952733884, 0.010044602207709967, -0.02891439208814825] |
1,802.08422 | The discrete Laplacian of a 2-simplicial complex | In this paper, we introduce the notion of oriented faces especially triangles
in a connected oriented locally finite graph. This framework then permits to
define the Laplace operator on this structure of the 2-simplicial complex. We
develop the notion of $\chi$-completeness for the graphs, based on the cutoff
functions. Moreover, we study essential self-adjointness of the discrete
Laplacian from the $\chi$-completeness geometric hypothesis.
| math.SP math.FA | in this paper we introduce the notion of oriented faces especially triangles in a connected oriented locally finite graph this framework then permits to define the laplace operator on this structure of the 2simplicial complex we develop the notion of chicompleteness for the graphs based on the cutoff functions moreover we study essential selfadjointness of the discrete laplacian from the chicompleteness geometric hypothesis | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'oriented', 'faces', 'especially', 'triangles', 'in', 'a', 'connected', 'oriented', 'locally', 'finite', 'graph', 'this', 'framework', 'then', 'permits', 'to', 'define', 'the', 'laplace', 'operator', 'on', 'this', 'structure', 'of', 'the', '2simplicial', 'complex', 'we', 'develop', 'the', 'notion', 'of', 'chicompleteness', 'for', 'the', 'graphs', 'based', 'on', 'the', 'cutoff', 'functions', 'moreover', 'we', 'study', 'essential', 'selfadjointness', 'of', 'the', 'discrete', 'laplacian', 'from', 'the', 'chicompleteness', 'geometric', 'hypothesis']] | [-0.13061554531459926, 0.07378237438388169, -0.11323718891524878, 0.07119040186784123, -0.11443575649125287, -0.04498635332451248, 0.014804867052350987, 0.3869605570054445, -0.304798316699071, -0.2301680859575262, 0.08871921682806655, -0.23019331587539588, -0.2175916051644771, 0.09639156368545822, -0.13876715957446664, 0.03682326315520484, 0.0435671618544176, 0.07388859986495531, -0.0474522342508445, -0.1545839122993696, 0.44908470687929725, -0.0022193518329839236, 0.2566822908482835, 0.11375827955456115, 0.09257049392527122, 0.05596718468443781, -0.04530094112803946, 0.04024715019298381, -0.18107394545842878, 0.23609717054765855, 0.21603083595267084, 0.09694424592966183, 0.24747173998459074, -0.43413339011737556, -0.1506878367079361, 0.16510984631346876, 0.1030836394820057, 0.027821920502961416, -0.006070484380527842, -0.25726411943552924, 0.13099358623969506, -0.12159295636610906, -0.1316378587960899, -0.03835462926902243, -0.024988597579544684, -0.016051610050051183, -0.2254016008962816, 0.00696103058785933, 0.12778994141787778, 0.07623886083420671, -0.045826013566407024, -0.05860082217354755, 0.02830702914535755, 0.08389627446466294, -0.04911424204340724, -0.005345539651719518, 0.045117215352652014, -0.05285802747640133, -0.12432238845093573, 0.3806430409265468, -0.0353378932465051, -0.28049988125557784, 0.12429080793985212, -0.1438419697443634, -0.20032034578473598, 0.0187429670916229, 0.2022664878120432, 0.19263994637266046, -0.12284811432034419, 0.15762560938286488, -0.0728075003373574, 0.08271013878163744, 0.04598050704989277, -0.00021864463132424434, 0.12950473419222674, 0.15854985459295454, 0.15189047339448675, 0.22788712159409874, -0.041248102315518335, -0.07644749878043094, -0.33006591959016734, -0.16929205870408504, -0.18504707495010167, 0.06049776743318824, -0.13598318878927682, -0.27478532152647367, 0.47581233426195674, 0.1491926737725124, 0.1997078752744424, 0.11725310944249762, 0.2653436486067281, 0.11340710380282558, 0.05385807645888847, 0.10084785192777387, 0.11306625225230074, 0.17544129190080968, 0.05203944038538659, -0.16114997080924204, 0.029086094116792083, 0.15791190230119667] |
1,802.08423 | Independence of surface morphology and reconstruction during the thermal
preparation of perovskite oxide surfaces | Using a CO$_2$ laser to directly heat the crystals from the back side,
SrTiO$_3$ substrates may be thermally prepared in situ for epitaxy without the
need for ex-situ etching and annealing. We find that the formation of large
terraces with straight steps at 900-1100 {\deg}C is independent from the
formation of the ideal surface reconstruction for epitaxy, which requires
temperatures in excess of 1200 {\deg}C to complete. The process may be
universal, at least for perovskite oxide surfaces, as it also works, at
different temperatures, for LaAlO$_3$ and NdGaO$_3$, two other widely used
oxide substrate materials.
| cond-mat.mtrl-sci | using a co_2 laser to directly heat the crystals from the back side srtio_3 substrates may be thermally prepared in situ for epitaxy without the need for exsitu etching and annealing we find that the formation of large terraces with straight steps at 9001100 degc is independent from the formation of the ideal surface reconstruction for epitaxy which requires temperatures in excess of 1200 degc to complete the process may be universal at least for perovskite oxide surfaces as it also works at different temperatures for laalo_3 and ndgao_3 two other widely used oxide substrate materials | [['using', 'a', 'co_2', 'laser', 'to', 'directly', 'heat', 'the', 'crystals', 'from', 'the', 'back', 'side', 'srtio_3', 'substrates', 'may', 'be', 'thermally', 'prepared', 'in', 'situ', 'for', 'epitaxy', 'without', 'the', 'need', 'for', 'exsitu', 'etching', 'and', 'annealing', 'we', 'find', 'that', 'the', 'formation', 'of', 'large', 'terraces', 'with', 'straight', 'steps', 'at', '9001100', 'degc', 'is', 'independent', 'from', 'the', 'formation', 'of', 'the', 'ideal', 'surface', 'reconstruction', 'for', 'epitaxy', 'which', 'requires', 'temperatures', 'in', 'excess', 'of', '1200', 'degc', 'to', 'complete', 'the', 'process', 'may', 'be', 'universal', 'at', 'least', 'for', 'perovskite', 'oxide', 'surfaces', 'as', 'it', 'also', 'works', 'at', 'different', 'temperatures', 'for', 'laalo_3', 'and', 'ndgao_3', 'two', 'other', 'widely', 'used', 'oxide', 'substrate', 'materials']] | [-0.01818401077374195, 0.23106551378926574, -0.08194917167566018, -0.061512061317652446, 0.012918323501556491, -0.18686471003942037, 0.08640309690963477, 0.4768335148692131, -0.27746775837537524, -0.3172520609611335, 0.08126944065588759, -0.2902969649003353, -0.03365380717514199, 0.24843798324582167, 0.015778659808953915, 0.06015345988513824, -0.014222908178150343, -0.15904388011889145, -0.09802966457937146, -0.25445793862309074, 0.2621454645995982, 0.09737009923749913, 0.3065306017524563, 0.10581251980086866, 0.06220176614200076, -0.05867832991255758, 0.16462490085298973, -0.03259926344132206, -0.19398291148331737, 0.019044726117499522, 0.31988400351595675, -0.08858512811707442, 0.18838550303674614, -0.5447089750960004, -0.26053130754674686, -0.004289074383753662, 0.10775767057202756, 0.13314089909545146, -0.12754982966968478, -0.1652392649120884, 0.0663709257478331, -0.028709119408934686, -0.06622020578167091, -0.008472464891383424, -0.04253162232150013, -0.035477810962523414, -0.2705124937153111, 0.05779214390198225, 0.013402167479701651, 0.12578727107999535, -0.07212285286611102, -0.16377506379891807, -0.14203314318244034, 0.056065371444371216, 0.00451848746373192, 0.05186078777721074, 0.2722326770017389, -0.05600515355278427, -0.06619621952510595, 0.33231090994862217, -0.05943930185943221, -0.03374342995327121, 0.2336839072947138, -0.15662112145582796, -0.08030993632079723, 0.22417447364811474, 0.09437676413169054, 0.1611031749829029, -0.19588450641943686, 0.022090751181773765, 0.05911711337588107, 0.2047129889833741, 0.19806744527886622, -0.018347228059913807, 0.2519821778247812, 0.21784379492358616, 0.030406008843177307, 0.15778014013570404, -0.12532404747616965, 0.03318421530032841, -0.19636948027376397, -0.26707647037498344, -0.18419010604945166, 0.07622448375089637, -0.09378561453892569, -0.181345367176012, 0.3326546890602913, 0.11362939117195008, 0.1543004957784433, -0.053805125461318916, 0.2646051848229642, 0.024237443609308684, 0.10768219018063974, 0.02273313002175807, 0.2055283707450144, 0.11740942292575103, 0.11339035636046901, -0.20097801828039033, 0.15652943599949745, -0.021688220265787095] |
1,802.08424 | Contextuality and bundle diagrams | Contextuality describes the nontrivial dependence of measurement outcomes on
particular choices of jointly measurable observables. In this work we review
and generalize the bundle diagram representation introduced in [S. Abramsky et
al., 24th EACSL Annual Conference on Computer Science Logic, 41, 211-228,
(2015)] in order to graphically demonstrate the contextuality of diverse
empirical models.
| quant-ph | contextuality describes the nontrivial dependence of measurement outcomes on particular choices of jointly measurable observables in this work we review and generalize the bundle diagram representation introduced in s abramsky et al 24th eacsl annual conference on computer science logic 41 211228 2015 in order to graphically demonstrate the contextuality of diverse empirical models | [['contextuality', 'describes', 'the', 'nontrivial', 'dependence', 'of', 'measurement', 'outcomes', 'on', 'particular', 'choices', 'of', 'jointly', 'measurable', 'observables', 'in', 'this', 'work', 'we', 'review', 'and', 'generalize', 'the', 'bundle', 'diagram', 'representation', 'introduced', 'in', 's', 'abramsky', 'et', 'al', '24th', 'eacsl', 'annual', 'conference', 'on', 'computer', 'science', 'logic', '41', '211228', '2015', 'in', 'order', 'to', 'graphically', 'demonstrate', 'the', 'contextuality', 'of', 'diverse', 'empirical', 'models']] | [-0.11178677754019792, 0.07870254474077022, -0.0952723604398516, 0.04884939214416762, -0.12564711343883625, -0.08654233085799892, 0.03707774201372884, 0.29374989803511437, -0.19788762070414312, -0.39200804101408654, -0.010434536287508343, -0.26332995759428673, -0.21521554985698663, 0.16859839564927345, -0.20922624730979497, 0.06632343543482558, 0.04525948038219281, -0.01707751381228555, -0.06372383154296088, -0.3348043520236388, 0.2588824977711687, 0.08297536845477123, 0.3388736258559632, 0.048754094023573794, 0.08943990106641683, 0.05895200583486343, -0.1357122913029326, 0.010059708659097834, -0.21128527858768995, 0.10170220833201453, 0.32913352682933106, 0.19637508579652826, 0.22430543374338294, -0.37129218595207863, -0.16984682914994234, 0.0658243854424723, 0.008151166334326537, 0.0490667017985065, 0.035501446271807235, -0.3423792624248649, -0.05479470261521989, -0.23863932936680768, -0.036218195202549534, -0.09382900469145684, 0.14350431591694085, -0.029906486110533325, -0.21320741985186512, 0.06199877847970094, 0.0900713681102783, 0.15694106684751669, -0.03624146284957258, -0.1075490642040265, 0.012845695598648404, 0.04369262848400845, -0.05036234368904019, 0.02683823843890766, 0.09545981844465407, -0.0431630400246677, -0.2693036999553442, 0.3095392991419671, -0.03100119456692757, -0.11216592482804048, 0.1485286615437494, -0.17254304421960182, -0.25665019345601564, -0.01964339388991302, 0.21050351784336116, 0.08090223874984626, -0.12029884943633147, 0.15010008772830744, -0.07234533548899838, 0.17755838059205212, 0.10507803008768637, 0.013881381706527944, 0.18602169421062154, 0.14260770824632413, -0.045109878575323885, 0.05837505243999778, 0.01112899033546026, -0.15346147751387315, -0.3712055735676637, -0.15648572125805998, -0.1582588361497125, 0.020809675725001208, -0.013035503786907284, -0.09727049411608363, 0.41565148766099846, 0.2092209637938243, 0.1800851809159624, -0.02501787222429829, 0.21917841993360165, 0.03912734815341262, -0.034041434528639995, 0.026352824537821534, 0.2348490237732822, 0.17853546925416253, 0.16944869268545001, -0.18624332056486242, 0.09023215978863244, 0.07908155145738625] |
1,802.08425 | Challenges of Growing Social Media Networks From the Bottom-Up Through
the Agent Perspective | We develop an agent-based model in order to understand agent/node behaviors
that generate social media networks. We use simple rules to synthetically
generate a backcloth (friend/follow) network collected using Twitter's API. The
Twitter network was collected using seeds for known terrorist propaganda
accounts in 2015. Model parameter adjustments were made to reproduce the
collected network's summary statistics, stylized facts and general structural
measures. We produced an approximate network in line with the general
properties of our collected data. We present our findings with a focus on the
challenging aspects of this reproduction. We find that while it is possible to
generate a social media network utilizing a few simple rules, numerous
challenges arise requiring departure from the agent viewpoint and the
development of more useful methods. We present numerous weaknesses and
challenges in our reproduction and propose potential solutions for future
efforts.
| cs.SI nlin.AO physics.soc-ph | we develop an agentbased model in order to understand agentnode behaviors that generate social media networks we use simple rules to synthetically generate a backcloth friendfollow network collected using twitters api the twitter network was collected using seeds for known terrorist propaganda accounts in 2015 model parameter adjustments were made to reproduce the collected networks summary statistics stylized facts and general structural measures we produced an approximate network in line with the general properties of our collected data we present our findings with a focus on the challenging aspects of this reproduction we find that while it is possible to generate a social media network utilizing a few simple rules numerous challenges arise requiring departure from the agent viewpoint and the development of more useful methods we present numerous weaknesses and challenges in our reproduction and propose potential solutions for future efforts | [['we', 'develop', 'an', 'agentbased', 'model', 'in', 'order', 'to', 'understand', 'agentnode', 'behaviors', 'that', 'generate', 'social', 'media', 'networks', 'we', 'use', 'simple', 'rules', 'to', 'synthetically', 'generate', 'a', 'backcloth', 'friendfollow', 'network', 'collected', 'using', 'twitters', 'api', 'the', 'twitter', 'network', 'was', 'collected', 'using', 'seeds', 'for', 'known', 'terrorist', 'propaganda', 'accounts', 'in', '2015', 'model', 'parameter', 'adjustments', 'were', 'made', 'to', 'reproduce', 'the', 'collected', 'networks', 'summary', 'statistics', 'stylized', 'facts', 'and', 'general', 'structural', 'measures', 'we', 'produced', 'an', 'approximate', 'network', 'in', 'line', 'with', 'the', 'general', 'properties', 'of', 'our', 'collected', 'data', 'we', 'present', 'our', 'findings', 'with', 'a', 'focus', 'on', 'the', 'challenging', 'aspects', 'of', 'this', 'reproduction', 'we', 'find', 'that', 'while', 'it', 'is', 'possible', 'to', 'generate', 'a', 'social', 'media', 'network', 'utilizing', 'a', 'few', 'simple', 'rules', 'numerous', 'challenges', 'arise', 'requiring', 'departure', 'from', 'the', 'agent', 'viewpoint', 'and', 'the', 'development', 'of', 'more', 'useful', 'methods', 'we', 'present', 'numerous', 'weaknesses', 'and', 'challenges', 'in', 'our', 'reproduction', 'and', 'propose', 'potential', 'solutions', 'for', 'future', 'efforts']] | [-0.07518357127861341, 0.003250873096751237, -0.07018392229546531, 0.10448573862718379, -0.14022735543817066, -0.1278725142202092, 0.061137499869801104, 0.4370077730779596, -0.23675850850844876, -0.3305841894827033, 0.08189370393712851, -0.3378911562290766, -0.23574222908456846, 0.18857201829338247, -0.07316316951990878, 0.036458785893569746, 0.10216243947661824, -0.005565358982454959, 0.03245838093294983, -0.26967519026571257, 0.30658869475474676, 0.05348043893832419, 0.33055401908354365, 0.04247416734440829, 0.09288324518279983, -0.03015597707344045, -0.07587765803118404, 0.010365924380029545, -0.13153936905925004, 0.18005362776838404, 0.2940605328177109, 0.22538324923542657, 0.30116903780550836, -0.49859759590769415, -0.24935135177819046, 0.10282009050146201, 0.09352011633567887, 0.15240927728181103, -0.0726648658216075, -0.32845983839855136, 0.07132009909406184, -0.20977463485277761, -0.12901175558138236, -0.1373059619837876, 0.0023125173614474293, 0.010923442576941531, -0.28388289310265896, 0.01533995936591205, -0.013321141355583887, 0.10646992965045271, -0.002771799516254406, -0.08092601827794699, 0.012700439254893996, 0.19073788132250524, 0.061809673231587536, -0.03902697957140936, 0.14777539743499146, -0.1534916400970563, -0.17447248840597357, 0.3855295842714447, -0.016326731557475417, -0.14302046764507997, 0.19705888744872466, -0.040566444472349486, -0.17536263557807577, 0.06583048451504261, 0.24989698635977056, 0.09327681040518629, -0.21119618164576429, -0.03904936685421163, -0.049106649277235966, 0.17674800904263346, 7.407664046656314e-05, -0.016516250252502588, 0.1750647514462203, 0.2373617253929591, -0.008946496262985597, 0.128365269969318, -0.06618855589927047, -0.09969062366223017, -0.24947204818721297, -0.054995200392394826, -0.13675593680588247, 0.009477090546961794, -0.06329145123168706, -0.1261541300835155, 0.41526059290434386, 0.24579201133506332, 0.22639768210904698, 0.0680235643308315, 0.26731862396373673, 0.028307929205399998, 0.0728071375411647, 0.07600388353315296, 0.18283771167060348, 0.02087435163323024, 0.19582935902725557, -0.11268408092328434, 0.11705495007905653, -0.009492898755204334] |
1,802.08426 | Relevance of the minimum degree to dynamic fluctuation in strongly
heterogeneous networks | The fluctuation of dynamic variables in complex networks is known to depend
on the dimension and the heterogeneity of the substrate networks. Previous
studies, however, have reported inconsistent results for the scaling behavior
of fluctuation in strongly heterogeneous networks. To understand the origin of
this conflict, we study the dynamic fluctuation on scale-free networks with a
common small degree exponent but different mean degrees and minimum degrees
constructed by using the configuration model and the static model. It turns out
that the global fluctuation of dynamic variables diverges algebraically and
logarithmically with the system size when the minimum degree is one and two,
respectively. Such different global fluctuations are traced back to different,
linear and sub-linear, growth of local fluctuation at individual nodes with
their degrees, implying a crucial role of degree-one nodes in controlling
correlation between distinct hubs.
| physics.soc-ph cond-mat.stat-mech | the fluctuation of dynamic variables in complex networks is known to depend on the dimension and the heterogeneity of the substrate networks previous studies however have reported inconsistent results for the scaling behavior of fluctuation in strongly heterogeneous networks to understand the origin of this conflict we study the dynamic fluctuation on scalefree networks with a common small degree exponent but different mean degrees and minimum degrees constructed by using the configuration model and the static model it turns out that the global fluctuation of dynamic variables diverges algebraically and logarithmically with the system size when the minimum degree is one and two respectively such different global fluctuations are traced back to different linear and sublinear growth of local fluctuation at individual nodes with their degrees implying a crucial role of degreeone nodes in controlling correlation between distinct hubs | [['the', 'fluctuation', 'of', 'dynamic', 'variables', 'in', 'complex', 'networks', 'is', 'known', 'to', 'depend', 'on', 'the', 'dimension', 'and', 'the', 'heterogeneity', 'of', 'the', 'substrate', 'networks', 'previous', 'studies', 'however', 'have', 'reported', 'inconsistent', 'results', 'for', 'the', 'scaling', 'behavior', 'of', 'fluctuation', 'in', 'strongly', 'heterogeneous', 'networks', 'to', 'understand', 'the', 'origin', 'of', 'this', 'conflict', 'we', 'study', 'the', 'dynamic', 'fluctuation', 'on', 'scalefree', 'networks', 'with', 'a', 'common', 'small', 'degree', 'exponent', 'but', 'different', 'mean', 'degrees', 'and', 'minimum', 'degrees', 'constructed', 'by', 'using', 'the', 'configuration', 'model', 'and', 'the', 'static', 'model', 'it', 'turns', 'out', 'that', 'the', 'global', 'fluctuation', 'of', 'dynamic', 'variables', 'diverges', 'algebraically', 'and', 'logarithmically', 'with', 'the', 'system', 'size', 'when', 'the', 'minimum', 'degree', 'is', 'one', 'and', 'two', 'respectively', 'such', 'different', 'global', 'fluctuations', 'are', 'traced', 'back', 'to', 'different', 'linear', 'and', 'sublinear', 'growth', 'of', 'local', 'fluctuation', 'at', 'individual', 'nodes', 'with', 'their', 'degrees', 'implying', 'a', 'crucial', 'role', 'of', 'degreeone', 'nodes', 'in', 'controlling', 'correlation', 'between', 'distinct', 'hubs']] | [-0.19306251973335853, 0.142560306216235, -0.06574363829300021, 0.06725022353302258, -0.017033631912107654, -0.13314945548236798, 0.054641255418763315, 0.32436793319639756, -0.2929894125571461, -0.3020906567895155, 0.06408937959245024, -0.2981765985173984, -0.1744633108719165, 0.12433637309109243, -0.004539479508245591, 0.03289951633481081, -0.011427945866108798, 0.05659963816518245, -0.020824374544782656, -0.25345504174441125, 0.3300935425745363, 0.07343187471081188, 0.3240073759832399, 0.0334854772634362, 0.0903968479578122, 0.02622571941163632, -0.039623582226445346, 0.09514718333245825, -0.11569552933454903, 0.08849864433311837, 0.2010833802976371, 0.06283194293341726, 0.25931882790939736, -0.41794805891356235, -0.24577657485769377, 0.13452062449709465, 0.13340753300966388, 0.07006964016464545, 0.0650416091653994, -0.23310034386579134, 0.10225716200255179, -0.10459683610234416, -0.1509259399663148, -0.051686672426813796, 0.04220425151623518, 0.06891590247739764, -0.23415628061906213, 0.1221585173173238, 0.05792035538830506, 0.10123680956936408, -0.016788768811526595, -0.12852373169718323, -0.0633291893290262, 0.17295691466629806, 0.06714271249671688, 0.012313825515494179, 0.1354566380580914, -0.14609196602715274, -0.09723851710294956, 0.31369761744406904, -0.01256858756960028, -0.17646439770310313, 0.23093216957544518, -0.1589183439835638, -0.13494997252308155, 0.10444808241964834, 0.18306342283893617, 0.08650526093493263, -0.13889359556290945, 0.03329641087459762, -0.002067895921067797, 0.19602036735264036, 0.03896061978101891, 0.07816062396787536, 0.19863190656367072, 0.1573966873806345, 0.07546651741513219, 0.13727443233105563, -0.05500431540974905, -0.16631630290862467, -0.2574452698337946, -0.07608561864350553, -0.18906544220278695, 0.055147835981476004, -0.18878718804867048, -0.15347579273683348, 0.41208008085813025, 0.12405891493364847, 0.22024177247323365, 0.07028933181996933, 0.23306198830870414, 0.09621121801382346, 0.10280670071349031, 0.10899000850894737, 0.22990379358554702, 0.1325234742382903, 0.10183346812217998, -0.24972571366300753, 0.11913119673581539, 0.0010019065929482952] |
1,802.08427 | Implications of Neutron Star Properties for the Existence of Light Dark
Matter | It was recently suggested that the discrepancy between two methods of
measuring the lifetime of the neutron may be a result of an unseen decay mode
into a dark matter particle which is almost degenerate with the neutron. We
explore the consequences of this for the properties of neutron stars, finding
that their known properties are in conflict with the existence of such a
particle.
| nucl-th hep-ph | it was recently suggested that the discrepancy between two methods of measuring the lifetime of the neutron may be a result of an unseen decay mode into a dark matter particle which is almost degenerate with the neutron we explore the consequences of this for the properties of neutron stars finding that their known properties are in conflict with the existence of such a particle | [['it', 'was', 'recently', 'suggested', 'that', 'the', 'discrepancy', 'between', 'two', 'methods', 'of', 'measuring', 'the', 'lifetime', 'of', 'the', 'neutron', 'may', 'be', 'a', 'result', 'of', 'an', 'unseen', 'decay', 'mode', 'into', 'a', 'dark', 'matter', 'particle', 'which', 'is', 'almost', 'degenerate', 'with', 'the', 'neutron', 'we', 'explore', 'the', 'consequences', 'of', 'this', 'for', 'the', 'properties', 'of', 'neutron', 'stars', 'finding', 'that', 'their', 'known', 'properties', 'are', 'in', 'conflict', 'with', 'the', 'existence', 'of', 'such', 'a', 'particle']] | [-0.09614624745713976, 0.19593213321126174, -0.14963724134633175, 0.09427874326132811, -0.08237608992136441, -0.03801493669788425, 0.03529272260001073, 0.31502810822656524, -0.2549833051287211, -0.36202975288033484, 0.06749944293047659, -0.27836781586878573, -0.07185445273151765, 0.21552029935857997, 0.00999249631825548, 0.027175979778313868, 0.061368051472191626, 0.07519319125522787, -0.08042558271151323, -0.2248203258871889, 0.36706669496802186, 0.042845228113807164, 0.18804408386349677, 0.056018724815490153, 0.06854508984117554, -0.049464559497741555, -0.017655702186031984, 0.007401567396636193, -0.12834794007783504, 0.09248179723150456, 0.19713240609719204, 0.14172753526900822, 0.21382251396560326, -0.38797820814383716, -0.22281120342130845, 0.16946255003925986, 0.12310181578907829, 0.10160336887213187, -0.12208325843541667, -0.2678306519125517, 0.10175510933264517, -0.18816606651705045, -0.16448172835203317, -0.017938544500905734, 0.023684576318527644, 0.05479341771167058, -0.24038375942752913, 0.07174024674504136, 0.10670095966913952, -0.042882183810266164, -0.09512190475271871, -0.10174116714356038, 0.013147331258425345, 0.10066475645424082, 0.13322132311116616, -0.004530978811761508, 0.08383406874222252, -0.16647515031509103, -0.13059276553730553, 0.38446627706289294, -0.058303131621617536, -0.1433093986688898, 0.21691600789244359, -0.15119582701187867, -0.13511722004041077, 0.10500817722999133, 0.09555521315106978, 0.158656496153428, -0.16692595606705604, 0.024821818046844923, -0.08737063571237601, 0.1585302773863077, 0.07059714688847844, 0.07567731713911949, 0.30245739235900915, 0.23369081266081104, 0.031055806921078608, 0.10302957042586058, -0.15328621114962376, -0.05704145174330244, -0.2696478868691394, -0.1860487432147448, -0.1577651449707516, 0.04178649314607565, -0.047551694949372454, -0.1670673139106769, 0.36462560582619447, 0.07862358131410124, 0.21610767771131717, -0.016288100969261275, 0.27047072012837114, 0.11234592163505462, 0.06935193953820719, 0.04000729287508875, 0.3464036839799239, 0.184288055378084, 0.047847074212936255, -0.2779331744935077, 0.0776847925180426, -0.0015811185352504254] |
1,802.08428 | Multilevel quantum Otto heat engines with identical particles | A quantum Otto heat engine is studied with multilevel identical particles
trapped in one-dimensional box potential as working substance. The symmetrical
wave function for Bosons and the anti-symmetrical wave function for Fermions
are considered. In two-particle case, we focus on the ratios of $W^i$ ($i=B,F$)
to $W_s$, where $W^B$ and $W^F$ are the work done by two Bosons and Fermions
respectively, and $W_s$ is the work output of a single particle under the same
conditions. Due to the symmetric of the wave functions, the ratios are not
equal to $2$. Three different regimes, low temperature regime, high temperature
regime, and intermediate temperature regime, are analyzed, and the effects of
energy level number and the differences between the two baths are calculated.
In the multiparticle case, we calculate the ratios of $W^i_M/M$ to $W_s$, where
$W^i_M/M$ can be seen as the average work done by a single particle in
multiparticle heat engine.
For other working substances whose energy spectrum have the form of $E_n\sim
n^2$, the results are similar. For the case $E_n\sim n$, two different
conclusions are obtained.
| quant-ph cond-mat.stat-mech | a quantum otto heat engine is studied with multilevel identical particles trapped in onedimensional box potential as working substance the symmetrical wave function for bosons and the antisymmetrical wave function for fermions are considered in twoparticle case we focus on the ratios of wi ibf to w_s where wb and wf are the work done by two bosons and fermions respectively and w_s is the work output of a single particle under the same conditions due to the symmetric of the wave functions the ratios are not equal to 2 three different regimes low temperature regime high temperature regime and intermediate temperature regime are analyzed and the effects of energy level number and the differences between the two baths are calculated in the multiparticle case we calculate the ratios of wi_mm to w_s where wi_mm can be seen as the average work done by a single particle in multiparticle heat engine for other working substances whose energy spectrum have the form of e_nsim n2 the results are similar for the case e_nsim n two different conclusions are obtained | [['a', 'quantum', 'otto', 'heat', 'engine', 'is', 'studied', 'with', 'multilevel', 'identical', 'particles', 'trapped', 'in', 'onedimensional', 'box', 'potential', 'as', 'working', 'substance', 'the', 'symmetrical', 'wave', 'function', 'for', 'bosons', 'and', 'the', 'antisymmetrical', 'wave', 'function', 'for', 'fermions', 'are', 'considered', 'in', 'twoparticle', 'case', 'we', 'focus', 'on', 'the', 'ratios', 'of', 'wi', 'ibf', 'to', 'w_s', 'where', 'wb', 'and', 'wf', 'are', 'the', 'work', 'done', 'by', 'two', 'bosons', 'and', 'fermions', 'respectively', 'and', 'w_s', 'is', 'the', 'work', 'output', 'of', 'a', 'single', 'particle', 'under', 'the', 'same', 'conditions', 'due', 'to', 'the', 'symmetric', 'of', 'the', 'wave', 'functions', 'the', 'ratios', 'are', 'not', 'equal', 'to', '2', 'three', 'different', 'regimes', 'low', 'temperature', 'regime', 'high', 'temperature', 'regime', 'and', 'intermediate', 'temperature', 'regime', 'are', 'analyzed', 'and', 'the', 'effects', 'of', 'energy', 'level', 'number', 'and', 'the', 'differences', 'between', 'the', 'two', 'baths', 'are', 'calculated', 'in', 'the', 'multiparticle', 'case', 'we', 'calculate', 'the', 'ratios', 'of', 'wi_mm', 'to', 'w_s', 'where', 'wi_mm', 'can', 'be', 'seen', 'as', 'the', 'average', 'work', 'done', 'by', 'a', 'single', 'particle', 'in', 'multiparticle', 'heat', 'engine', 'for', 'other', 'working', 'substances', 'whose', 'energy', 'spectrum', 'have', 'the', 'form', 'of', 'e_nsim', 'n2', 'the', 'results', 'are', 'similar', 'for', 'the', 'case', 'e_nsim', 'n', 'two', 'different', 'conclusions', 'are', 'obtained']] | [-0.13139303255593404, 0.22819705656465059, -0.011831208439120515, 0.060973163756319664, 0.034346353516659954, -0.17251460831241935, 0.01618703003028217, 0.3431041860233315, -0.1804153892841317, -0.28270911951866845, 0.05721124159489674, -0.31262352361756546, -0.056681862896022554, 0.19802654301086228, 0.04785197648545198, 0.06446709784689698, 0.012513805391129361, 0.049801249406300485, -0.05266612422895956, -0.20497365257258274, 0.3133881103686607, 0.04470926584789678, 0.27443651723760093, 0.07428995450391085, 0.05727732404788681, -0.0059951760737352415, 0.01201298803524961, 0.017752274362878365, -0.114294168864779, 0.017194291539701888, 0.22280771715503017, 0.009248109670641663, 0.21252991483462128, -0.41731378340839664, -0.1832451608960665, 0.10687851029532877, 0.14127899769598365, 0.07940868810560046, -0.00893467125834749, -0.22969645325925245, 0.04112978888918984, -0.16766754640014947, -0.11281556635830467, -0.010116317450328179, 0.00772503410751762, 0.05324559216982876, -0.2794004057200668, 0.09646403925514525, 0.04382745528354545, 0.03563808821226386, -0.04031578192635524, -0.1513653305406809, -0.027889945545625364, 0.12148628310321576, 0.03689924293642186, 0.0016831041994009865, 0.15366474934589033, -0.1388731493048412, -0.08259596999216062, 0.3802334765152244, -0.09223625065483661, -0.23841499055693435, 0.21067757505277934, -0.17194059196679684, -0.09923805766605008, 0.10165514991041907, 0.1502281008764509, 0.11785807400288335, -0.14699208250518, 0.07849242918729776, -0.021685980776055658, 0.1072604794414722, 0.08219907338868572, 0.05633520425974645, 0.19236077545528216, 0.10263023427581754, -0.0171220728675094, 0.17964941965494124, -0.08320453635199308, -0.12308153100986435, -0.28609865488331043, -0.1602881383256648, -0.20687510798134925, 0.02582291561520833, -0.07176992873635092, -0.1111081997574233, 0.37729950532428286, 0.08694470377205024, 0.20907402591546997, 0.03680753647991382, 0.2423558657438579, 0.18309082694494547, 0.021436628814130512, 0.07003844803495501, 0.26055511540934356, 0.12550605696477843, 0.12150482406749771, -0.2350621665973449, -0.002533767216267403, 0.05783000361407176] |
1,802.08429 | Exact Sampling of Determinantal Point Processes without
Eigendecomposition | Determinantal point processes (DPPs) enable the modeling of repulsion: they
provide diverse sets of points. The repulsion is encoded in a kernel $K$ that
can be seen as a matrix storing the similarity between points. The diversity
comes from the fact that the inclusion probability of a subset is equal to the
determinant of a submatrice of $K$. The exact algorithm to sample DPPs uses the
spectral decomposition of $K$, a computation that becomes costly when dealing
with a high number of points. Here, we present an alternative exact algorithm
in the discrete setting that avoids the eigenvalues and the eigenvectors
computation. Instead, it relies on Cholesky decompositions. This is a two steps
strategy: first, it samples a Bernoulli point process with an appropriate
distribution, then it samples the target DPP distribution through a thinning
procedure. Not only is the method used here innovative, but this algorithm can
be competitive with the original algorithm or even faster for some applications
specified here.
| stat.ML | determinantal point processes dpps enable the modeling of repulsion they provide diverse sets of points the repulsion is encoded in a kernel k that can be seen as a matrix storing the similarity between points the diversity comes from the fact that the inclusion probability of a subset is equal to the determinant of a submatrice of k the exact algorithm to sample dpps uses the spectral decomposition of k a computation that becomes costly when dealing with a high number of points here we present an alternative exact algorithm in the discrete setting that avoids the eigenvalues and the eigenvectors computation instead it relies on cholesky decompositions this is a two steps strategy first it samples a bernoulli point process with an appropriate distribution then it samples the target dpp distribution through a thinning procedure not only is the method used here innovative but this algorithm can be competitive with the original algorithm or even faster for some applications specified here | [['determinantal', 'point', 'processes', 'dpps', 'enable', 'the', 'modeling', 'of', 'repulsion', 'they', 'provide', 'diverse', 'sets', 'of', 'points', 'the', 'repulsion', 'is', 'encoded', 'in', 'a', 'kernel', 'k', 'that', 'can', 'be', 'seen', 'as', 'a', 'matrix', 'storing', 'the', 'similarity', 'between', 'points', 'the', 'diversity', 'comes', 'from', 'the', 'fact', 'that', 'the', 'inclusion', 'probability', 'of', 'a', 'subset', 'is', 'equal', 'to', 'the', 'determinant', 'of', 'a', 'submatrice', 'of', 'k', 'the', 'exact', 'algorithm', 'to', 'sample', 'dpps', 'uses', 'the', 'spectral', 'decomposition', 'of', 'k', 'a', 'computation', 'that', 'becomes', 'costly', 'when', 'dealing', 'with', 'a', 'high', 'number', 'of', 'points', 'here', 'we', 'present', 'an', 'alternative', 'exact', 'algorithm', 'in', 'the', 'discrete', 'setting', 'that', 'avoids', 'the', 'eigenvalues', 'and', 'the', 'eigenvectors', 'computation', 'instead', 'it', 'relies', 'on', 'cholesky', 'decompositions', 'this', 'is', 'a', 'two', 'steps', 'strategy', 'first', 'it', 'samples', 'a', 'bernoulli', 'point', 'process', 'with', 'an', 'appropriate', 'distribution', 'then', 'it', 'samples', 'the', 'target', 'dpp', 'distribution', 'through', 'a', 'thinning', 'procedure', 'not', 'only', 'is', 'the', 'method', 'used', 'here', 'innovative', 'but', 'this', 'algorithm', 'can', 'be', 'competitive', 'with', 'the', 'original', 'algorithm', 'or', 'even', 'faster', 'for', 'some', 'applications', 'specified', 'here']] | [-0.09703491258099443, 0.07755812320743272, -0.14401039451950734, 0.07057869186527857, -0.0723672398128865, -0.14151422964894902, 0.11330540175983532, 0.4034884141653961, -0.292587955424458, -0.26342626615653036, 0.09850614980551535, -0.2703774251038012, -0.1782869807399682, 0.16433321147063829, -0.03186462400155721, 0.04599889447935712, 0.10146764694765117, 0.03786040708203569, -0.07552852393315977, -0.25169138505661526, 0.2987272905349234, 0.05350912427197078, 0.2693566207597553, -0.00894388450043542, 0.12541767219023675, 0.003533360322717554, -0.014337059049664633, 0.014176582569771255, -0.05045064234247819, 0.12905868615012223, 0.2560755835227113, 0.16576785843252487, 0.3136338826691188, -0.37051796727438324, -0.16953019255783802, 0.17106715825773913, 0.1556223041684546, 0.1255693659562363, -0.027384596004046684, -0.2362674615513649, 0.09384658910198172, -0.12093694108648237, -0.11182832542621757, -0.09336248847875767, 0.006958879325076104, 0.008096863888782559, -0.3270494020775377, 0.030287663527527212, 0.0910653836897904, 0.016813159784336822, 0.004800559902239753, -0.15899505525225807, 0.02573572097473448, 0.09872269872897767, 0.017875565759518028, 0.022397271771076487, 0.10684406803920865, -0.09740077259065294, -0.10071205202148799, 0.36576191810254727, -0.0004966533372268335, -0.23071474310034895, 0.1877153218718049, -0.08379640856537945, -0.12144188863306266, 0.19010140001195372, 0.13916062183066427, 0.15244773287407082, -0.13957718161980676, 0.10893931434170187, -0.05866231908154043, 0.15957895480421724, 0.044573380988559785, -0.0025812043224154794, 0.15673855500966774, 0.15393498638226877, 0.11749244440832864, 0.1396321759180322, -0.0713929547921043, -0.08350712696078771, -0.2926913645127152, -0.17140155159347684, -0.2850431016015803, 0.05250880304698309, -0.15210311562508005, -0.2028168430074656, 0.3482263726587205, 0.1645864790265003, 0.2513111395203156, 0.0638302634556934, 0.318326073959007, 0.1340533988716613, 0.05304291696679599, 0.08326244306524996, 0.12157307650408743, 0.09188864531099611, 0.06049101036157667, -0.16745430304269707, 0.08945962712053002, 0.08532400595845643] |
1,802.0843 | Orbital degeneracy loci II: Gorenstein orbits | In [BFMT17] we introduced orbital degeneracy loci as generalizations of
degeneracy loci of morphisms between vector bundles. Orbital degeneracy loci
can be constructed from any stable subvariety of a representation of an
algebraic group. In this paper we show that their canonical bundles can be
conveniently controlled in the case where the affine coordinate ring of the
subvariety is Gorenstein. We then study in a systematic way the subvarieties
obtained as orbit closures in representations with finitely many orbits, and we
determine the canonical bundles of the corresponding orbital degeneracy loci in
the Gorenstein cases. Applications are given to the construction of low
dimensional varieties with negative or trivial canonical bundle.
| math.AG | in bfmt17 we introduced orbital degeneracy loci as generalizations of degeneracy loci of morphisms between vector bundles orbital degeneracy loci can be constructed from any stable subvariety of a representation of an algebraic group in this paper we show that their canonical bundles can be conveniently controlled in the case where the affine coordinate ring of the subvariety is gorenstein we then study in a systematic way the subvarieties obtained as orbit closures in representations with finitely many orbits and we determine the canonical bundles of the corresponding orbital degeneracy loci in the gorenstein cases applications are given to the construction of low dimensional varieties with negative or trivial canonical bundle | [['in', 'bfmt17', 'we', 'introduced', 'orbital', 'degeneracy', 'loci', 'as', 'generalizations', 'of', 'degeneracy', 'loci', 'of', 'morphisms', 'between', 'vector', 'bundles', 'orbital', 'degeneracy', 'loci', 'can', 'be', 'constructed', 'from', 'any', 'stable', 'subvariety', 'of', 'a', 'representation', 'of', 'an', 'algebraic', 'group', 'in', 'this', 'paper', 'we', 'show', 'that', 'their', 'canonical', 'bundles', 'can', 'be', 'conveniently', 'controlled', 'in', 'the', 'case', 'where', 'the', 'affine', 'coordinate', 'ring', 'of', 'the', 'subvariety', 'is', 'gorenstein', 'we', 'then', 'study', 'in', 'a', 'systematic', 'way', 'the', 'subvarieties', 'obtained', 'as', 'orbit', 'closures', 'in', 'representations', 'with', 'finitely', 'many', 'orbits', 'and', 'we', 'determine', 'the', 'canonical', 'bundles', 'of', 'the', 'corresponding', 'orbital', 'degeneracy', 'loci', 'in', 'the', 'gorenstein', 'cases', 'applications', 'are', 'given', 'to', 'the', 'construction', 'of', 'low', 'dimensional', 'varieties', 'with', 'negative', 'or', 'trivial', 'canonical', 'bundle']] | [-0.223803097399121, 0.058987431609817904, -0.08510394937528128, 0.0695614058270373, -0.06730554511304945, -0.13836626290259035, -0.008513595450627194, 0.35627733576534826, -0.3615782473955981, -0.19494065861641005, 0.0637439065485854, -0.20390260234813798, -0.15972340958065945, 0.177495360550132, -0.1774603782729669, -0.04463830718516626, 0.06804809606083753, 0.05400649989552965, -0.1484725994989276, -0.3123597795916298, 0.4454009096984836, -0.020714287167753687, 0.19664691479199312, -0.0055479644078084015, 0.12256831895052032, 0.01447185214016248, 0.041404808244921945, -0.0047395094264919115, -0.13913577133743357, 0.13724535665559498, 0.3544175777584314, 0.07030621348372237, 0.15757448455869136, -0.339390562821857, -0.11716816356082828, 0.24126803374595263, 0.2015491249928759, 0.0923026035846719, 0.03154639549849724, -0.24092715393370864, 0.06741649310530523, -0.1828024868387729, -0.20518043670295313, -0.13821596513417633, 0.04101029366932132, 0.04216757992240177, -0.19886495515873487, -0.012331716318360783, 0.07575219601223415, 0.19770819881549953, -0.08829068437599662, -0.09140121266986667, -0.1820187547413463, 0.044368516793474554, 0.03145568779542703, 0.008684481161815876, 0.11094171517443928, -0.08430506702259828, -0.13436709034933964, 0.3799700000916015, -0.055871544960378244, -0.2773783579299396, 0.15157236866229637, -0.18457104107365013, -0.15628429361703722, 0.13853273777799172, 0.09659186565655876, 0.17952859769998628, -0.008139205470003866, 0.16345067907479296, -0.09151044178500094, 0.04185571242441338, 0.09159864878535948, -0.004900346057150852, 0.24732746935703537, 0.08060924748636104, 0.0548457583949626, 0.10044883369171823, -0.05271662480451844, -0.06660199867222796, -0.32612592058086937, -0.20695408192616677, -0.08940211731559512, 0.1332428442801095, -0.09273753591630586, -0.1502598946427249, 0.40972260478037326, 0.06820569947436028, 0.2788791336119175, 0.055582226584242146, 0.24294443813956934, 0.04460053589322011, 0.048950108739716766, 0.025715947883542287, 0.16444578168659724, 0.2181316662241112, -0.08778857659887183, -0.14662843381149948, -0.027121293402954258, 0.17698938931253824] |
1,802.08431 | Anomalous Hall effect in semiconductor quantum wells in proximity to
chiral p-wave superconductors | By using the gauge-invariant optical Bloch equation, we perform a microscopic
kinetic investigation on the anomalous Hall effect in chiral p-wave
superconducting states. Specifically, the intrinsic anomalous Hall conductivity
in the absence of the magnetic field is zero as a consequence of Galilean
invariance in our description. As for the extrinsic channel, a finite anomalous
Hall current is obtained from the impurity scattering with the optically
excited normal quasiparticle current even at zero temperature. From our kinetic
description, it can be clearly seen that the excited normal quasiparticle
current is due to an induced center-of-mass momentum of Cooper pairs through
the acceleration driven by ac electric field. For the induced anomalous Hall
current, we show that the conventional skew-scattering channel in the linear
response makes the dominant contribution in the strong impurity interaction. In
this case, our kinetic description as a supplementary viewpoint mostly confirms
the results of Kubo formalism in the literature. Nevertheless, in the weak
impurity interaction, this skew-scattering channel becomes marginal and we
reveal that a novel induction channel from the Born contribution dominates the
anomalous Hall current. This novel channel, which has long been overlooked in
the literature, is due to the particle-hole asymmetry by nonlinear optical
excitation. Finally, we study the case in the chiral p-wave superconducting
state with a transverse conical magnetization, which breaks the Galilean
invariance. In this situation, the intrinsic anomalous Hall conductivity is no
longer zero. Comparison of this intrinsic channel with the extrinsic one from
impurity scattering is addressed.
| cond-mat.supr-con | by using the gaugeinvariant optical bloch equation we perform a microscopic kinetic investigation on the anomalous hall effect in chiral pwave superconducting states specifically the intrinsic anomalous hall conductivity in the absence of the magnetic field is zero as a consequence of galilean invariance in our description as for the extrinsic channel a finite anomalous hall current is obtained from the impurity scattering with the optically excited normal quasiparticle current even at zero temperature from our kinetic description it can be clearly seen that the excited normal quasiparticle current is due to an induced centerofmass momentum of cooper pairs through the acceleration driven by ac electric field for the induced anomalous hall current we show that the conventional skewscattering channel in the linear response makes the dominant contribution in the strong impurity interaction in this case our kinetic description as a supplementary viewpoint mostly confirms the results of kubo formalism in the literature nevertheless in the weak impurity interaction this skewscattering channel becomes marginal and we reveal that a novel induction channel from the born contribution dominates the anomalous hall current this novel channel which has long been overlooked in the literature is due to the particlehole asymmetry by nonlinear optical excitation finally we study the case in the chiral pwave superconducting state with a transverse conical magnetization which breaks the galilean invariance in this situation the intrinsic anomalous hall conductivity is no longer zero comparison of this intrinsic channel with the extrinsic one from impurity scattering is addressed | [['by', 'using', 'the', 'gaugeinvariant', 'optical', 'bloch', 'equation', 'we', 'perform', 'a', 'microscopic', 'kinetic', 'investigation', 'on', 'the', 'anomalous', 'hall', 'effect', 'in', 'chiral', 'pwave', 'superconducting', 'states', 'specifically', 'the', 'intrinsic', 'anomalous', 'hall', 'conductivity', 'in', 'the', 'absence', 'of', 'the', 'magnetic', 'field', 'is', 'zero', 'as', 'a', 'consequence', 'of', 'galilean', 'invariance', 'in', 'our', 'description', 'as', 'for', 'the', 'extrinsic', 'channel', 'a', 'finite', 'anomalous', 'hall', 'current', 'is', 'obtained', 'from', 'the', 'impurity', 'scattering', 'with', 'the', 'optically', 'excited', 'normal', 'quasiparticle', 'current', 'even', 'at', 'zero', 'temperature', 'from', 'our', 'kinetic', 'description', 'it', 'can', 'be', 'clearly', 'seen', 'that', 'the', 'excited', 'normal', 'quasiparticle', 'current', 'is', 'due', 'to', 'an', 'induced', 'centerofmass', 'momentum', 'of', 'cooper', 'pairs', 'through', 'the', 'acceleration', 'driven', 'by', 'ac', 'electric', 'field', 'for', 'the', 'induced', 'anomalous', 'hall', 'current', 'we', 'show', 'that', 'the', 'conventional', 'skewscattering', 'channel', 'in', 'the', 'linear', 'response', 'makes', 'the', 'dominant', 'contribution', 'in', 'the', 'strong', 'impurity', 'interaction', 'in', 'this', 'case', 'our', 'kinetic', 'description', 'as', 'a', 'supplementary', 'viewpoint', 'mostly', 'confirms', 'the', 'results', 'of', 'kubo', 'formalism', 'in', 'the', 'literature', 'nevertheless', 'in', 'the', 'weak', 'impurity', 'interaction', 'this', 'skewscattering', 'channel', 'becomes', 'marginal', 'and', 'we', 'reveal', 'that', 'a', 'novel', 'induction', 'channel', 'from', 'the', 'born', 'contribution', 'dominates', 'the', 'anomalous', 'hall', 'current', 'this', 'novel', 'channel', 'which', 'has', 'long', 'been', 'overlooked', 'in', 'the', 'literature', 'is', 'due', 'to', 'the', 'particlehole', 'asymmetry', 'by', 'nonlinear', 'optical', 'excitation', 'finally', 'we', 'study', 'the', 'case', 'in', 'the', 'chiral', 'pwave', 'superconducting', 'state', 'with', 'a', 'transverse', 'conical', 'magnetization', 'which', 'breaks', 'the', 'galilean', 'invariance', 'in', 'this', 'situation', 'the', 'intrinsic', 'anomalous', 'hall', 'conductivity', 'is', 'no', 'longer', 'zero', 'comparison', 'of', 'this', 'intrinsic', 'channel', 'with', 'the', 'extrinsic', 'one', 'from', 'impurity', 'scattering', 'is', 'addressed']] | [-0.17842515921556806, 0.1973330679861665, -0.07782062893381798, 0.0705243231402336, -0.07952117267248023, -0.12302515808732276, 0.02891147038319623, 0.33837663904430876, -0.2707090512811988, -0.24028303188993688, 0.0043062803940473494, -0.2860470617855768, -0.12102182281117542, 0.1518089497652668, 0.01723176033991617, 0.011762615732743916, -0.028768326508827567, 0.008543063511503449, -0.07191978784719384, -0.16016556091202086, 0.32721895806633505, 0.01651776830168314, 0.3363782000170654, 0.10059545786273348, 0.0528230714952072, 0.0482556554500526, 0.019554163157251704, 0.03942990162032076, -0.0966342386941743, 0.025406826680935694, 0.22318817280096387, -0.11139192189890368, 0.16834872373824858, -0.4377512432425376, -0.20198185456146198, 0.02466028794107667, 0.14184979743877776, 0.21785750697800763, -0.05475687716075829, -0.2902556363414659, 0.019937532094127713, -0.1946189829249339, -0.12857075753232772, -0.061765548727291834, 0.02141351889104519, -0.08161556669211681, -0.24005760764703155, 0.1522924223020355, 0.10913143174659207, 0.07070020821888044, -0.07508830290641187, -0.13729760321848333, -0.038822853007357584, 0.06080465056525775, 0.09597238600927305, 0.05660048072660215, 0.15046396623641425, -0.18019556767217457, -0.12892757149190684, 0.3323979444453964, -0.1151714059470472, -0.1671032608294089, 0.15393985966435564, -0.2015243986692564, -0.05647804622817036, 0.17811593889299945, 0.10981437212873595, 0.055678958093829785, -0.17067539933171258, 0.10773549952621882, -0.05079945748911265, 0.10587223650219973, 0.0011926148602005888, 0.07986875373008007, 0.23940817839148115, 0.16782338808227076, 0.027639518721949263, 0.15066113965408165, -0.13824809288108594, -0.05896024713778951, -0.3244199211265982, -0.14971858504064717, -0.22152363174561276, 0.12786443567980665, -0.012521115380344467, -0.15918181523172012, 0.38289886186213556, 0.18182090770518203, 0.18467982839157124, -0.044531784408415355, 0.3366344312924039, 0.19275087195992785, 0.08703623197778282, 0.06440377359214916, 0.2989230733701443, 0.18347726236555695, 0.13209253948847632, -0.3682370320276683, 0.05200910451915489, 0.020441074076718295] |
1,802.08432 | Inference from modelling the chemodynamical evolution of the Milky Way
disc | In this thesis, the field star Initial Mass Function (IMF) and chemical
evolution parameters for the Milky Way (MW) are derived using a forward
modelling technique in combination with Bayesian statistics. Starting from a
local MM disc model, observations of stellar samples in the Solar Neighbourhood
are synthesised and compared to the corresponding volume-complete observational
samples of Hipparcos stars. The resulting IMF, derived from observations in the
range from 0.5 to 8Msun, is a two-slope broken power law with powers of -1.49
+- 0.08 and -3.02 +- 0.06 for the low-mass slope and the high-mass slope,
respectively, with a break at 1.39 +- 0.05Msun. In order to constrain the IMF
for stars more massive than 8Msun, a fast and flexible chemical enrichment
code, Chempy, was developed, which is also able to reproduce spatial and
stellar population selections of observational samples. The inferred high-mass
slope for stellar masses above 6Msun is -2.28 +- 0.09, accounting for the
systematic effects of different yield sets from the literature. This shows that
constraints from chemical modelling, similarly to hydrodynamical simulations of
the Galaxy, demand a Salpeter high-mass index. This is hard to recover from
star count analysis given the rareness of high-mass stars.
| astro-ph.GA | in this thesis the field star initial mass function imf and chemical evolution parameters for the milky way mw are derived using a forward modelling technique in combination with bayesian statistics starting from a local mm disc model observations of stellar samples in the solar neighbourhood are synthesised and compared to the corresponding volumecomplete observational samples of hipparcos stars the resulting imf derived from observations in the range from 05 to 8msun is a twoslope broken power law with powers of 149 008 and 302 006 for the lowmass slope and the highmass slope respectively with a break at 139 005msun in order to constrain the imf for stars more massive than 8msun a fast and flexible chemical enrichment code chempy was developed which is also able to reproduce spatial and stellar population selections of observational samples the inferred highmass slope for stellar masses above 6msun is 228 009 accounting for the systematic effects of different yield sets from the literature this shows that constraints from chemical modelling similarly to hydrodynamical simulations of the galaxy demand a salpeter highmass index this is hard to recover from star count analysis given the rareness of highmass stars | [['in', 'this', 'thesis', 'the', 'field', 'star', 'initial', 'mass', 'function', 'imf', 'and', 'chemical', 'evolution', 'parameters', 'for', 'the', 'milky', 'way', 'mw', 'are', 'derived', 'using', 'a', 'forward', 'modelling', 'technique', 'in', 'combination', 'with', 'bayesian', 'statistics', 'starting', 'from', 'a', 'local', 'mm', 'disc', 'model', 'observations', 'of', 'stellar', 'samples', 'in', 'the', 'solar', 'neighbourhood', 'are', 'synthesised', 'and', 'compared', 'to', 'the', 'corresponding', 'volumecomplete', 'observational', 'samples', 'of', 'hipparcos', 'stars', 'the', 'resulting', 'imf', 'derived', 'from', 'observations', 'in', 'the', 'range', 'from', '05', 'to', '8msun', 'is', 'a', 'twoslope', 'broken', 'power', 'law', 'with', 'powers', 'of', '149', '008', 'and', '302', '006', 'for', 'the', 'lowmass', 'slope', 'and', 'the', 'highmass', 'slope', 'respectively', 'with', 'a', 'break', 'at', '139', '005msun', 'in', 'order', 'to', 'constrain', 'the', 'imf', 'for', 'stars', 'more', 'massive', 'than', '8msun', 'a', 'fast', 'and', 'flexible', 'chemical', 'enrichment', 'code', 'chempy', 'was', 'developed', 'which', 'is', 'also', 'able', 'to', 'reproduce', 'spatial', 'and', 'stellar', 'population', 'selections', 'of', 'observational', 'samples', 'the', 'inferred', 'highmass', 'slope', 'for', 'stellar', 'masses', 'above', '6msun', 'is', '228', '009', 'accounting', 'for', 'the', 'systematic', 'effects', 'of', 'different', 'yield', 'sets', 'from', 'the', 'literature', 'this', 'shows', 'that', 'constraints', 'from', 'chemical', 'modelling', 'similarly', 'to', 'hydrodynamical', 'simulations', 'of', 'the', 'galaxy', 'demand', 'a', 'salpeter', 'highmass', 'index', 'this', 'is', 'hard', 'to', 'recover', 'from', 'star', 'count', 'analysis', 'given', 'the', 'rareness', 'of', 'highmass', 'stars']] | [-0.003270887407010959, 0.09759210876954873, -0.10635392508978389, 0.10975193580163681, -0.0891285579262743, -0.05881288840157008, 0.08578009164133638, 0.3842016212334952, -0.16571270317780143, -0.42507454262057454, 0.014175759019334945, -0.2762691110478157, 0.027733128078720838, 0.2047663921713541, -0.045702911606154493, 0.027838706299626585, 0.06683890408711489, -0.08358101082063213, -0.07294707962782267, -0.21080447701718083, 0.30266723429217707, 0.06229131441016096, 0.17108069878304377, -0.08540441408830206, 0.031918816318250616, -0.10165397815895987, -0.07890156911177196, -0.042689602811864014, -0.19131203609676678, 0.042059305798473584, 0.21988220052366367, 0.12244292551389963, 0.2026584550483901, -0.3235120906244925, -0.2135421582161612, 0.06389406757477549, 0.15043192323220453, 0.04806156227420343, -0.09501003026105667, -0.21314617512344392, 0.1165645509835551, -0.18646573169113703, -0.1775130010426006, 0.0691524933478747, 0.028268302460177083, 0.03479620698628198, -0.310030889340926, 0.15212409362990828, -0.023222671518073484, 0.09920394338521724, -0.11469822208224267, -0.14703489965567193, -0.09636303970527825, 0.08498187810506615, 0.03573441923987217, 0.11117182951660577, 0.16026476095670583, -0.12543063150171535, 0.0030252380925470715, 0.3995269574849031, -0.06096281043588983, -0.05227820992772227, 0.1942839547871737, -0.20083739023569241, -0.20315974400397965, 0.11338436535857234, 0.15181871774647213, 0.09590122958522358, -0.19713042882996007, 0.01325895225679617, 0.009243924605189678, 0.239998937441641, 0.04340780277066797, -0.007782363211517054, 0.30034018074613567, 0.13361503149749718, -0.0036706520489311403, 0.07417004165352448, -0.1880610889134708, -0.06530438401477084, -0.21780061069395892, -0.06089477103261143, -0.11700224800553825, 0.0981427851539902, -0.1661067873297425, -0.11360699113592812, 0.34281279433389034, 0.1198578451834523, 0.22846434816007608, 0.1252411890255297, 0.29101688862230973, 0.1170917316483929, 0.10230000187479651, 0.10095354430761534, 0.27213063741045207, 0.199816980943463, 0.10902947723474257, -0.2207471804060858, 0.07858211587701645, -0.01653693859782262] |
1,802.08433 | Critical Liouville measure as a limit of subcritical measures | We study how the Gaussian multiplicative chaos (GMC) measures $\mu^\gamma$
corresponding to the 2D Gaussian free field change when $\gamma$ approaches the
critical parameter $2$. In particular, we show that as $\gamma\to 2^{-}$,
$(2-\gamma)^{-1}\mu^\gamma$ converges in probability to $2\mu'$, where $\mu'$
is the critical GMC measure.
| math.PR math-ph math.MP | we study how the gaussian multiplicative chaos gmc measures mugamma corresponding to the 2d gaussian free field change when gamma approaches the critical parameter 2 in particular we show that as gammato 2 2gamma1mugamma converges in probability to 2mu where mu is the critical gmc measure | [['we', 'study', 'how', 'the', 'gaussian', 'multiplicative', 'chaos', 'gmc', 'measures', 'mugamma', 'corresponding', 'to', 'the', '2d', 'gaussian', 'free', 'field', 'change', 'when', 'gamma', 'approaches', 'the', 'critical', 'parameter', '2', 'in', 'particular', 'we', 'show', 'that', 'as', 'gammato', '2', '2gamma1mugamma', 'converges', 'in', 'probability', 'to', '2mu', 'where', 'mu', 'is', 'the', 'critical', 'gmc', 'measure']] | [-0.07300647321260638, 0.20073503920963656, -0.08840775122452113, 0.11321792249929988, 0.02878869716078043, -0.12317616113771995, 0.05730550264318784, 0.3450288766995072, -0.28959027330080667, -0.16662218436184856, 0.045908584942420325, -0.2812460324002637, -0.16911538866245085, 0.14079785854038265, -0.023049460930956736, 0.10374128176934189, -0.022117470008217625, 0.09737280938360426, -0.03806934205090834, -0.1766558836110764, 0.391293315237595, 0.04078755662259129, 0.24223738325656288, 0.02812849481900533, 0.025891906892259915, -0.05175934851997428, 0.006388219264853332, -0.04103747708722949, -0.28279667199256237, -0.00476088532143169, 0.19765988161994352, 0.09340799360458428, 0.2871994437856807, -0.279734401529034, -0.18854362215432857, 0.21221441527207693, 0.18678930902646648, -0.019797933101654053, 0.0681536743003461, -0.2718563289278083, 0.15428722169664172, -0.16083063499795067, -0.1433371375211411, -0.04340457136018409, 0.06656900403452003, 0.0633730919772966, -0.3473948023385472, 0.10794517826288938, 0.06626126389924644, 0.011091302790575557, -0.009554651441673438, -0.12582757123228577, 0.015590586389104525, 0.09555714201608984, 0.058696959472985734, 0.1570362014747742, 0.22336586380584372, -0.13870673982633486, -0.11579297863774829, 0.3651068336433835, -0.14980412062464488, -0.23282652782897154, 0.15418446874246, -0.25989167485386133, -0.15423720574213398, 0.1294851357738177, 0.1530340985705455, 0.026006043164266482, -0.09631702191771992, 0.17018793185965883, -0.005169098700086276, 0.146504980015258, 0.06761337204111947, 0.010266517216546669, 0.06699593717025386, 0.11108411286647121, 0.14122146835757626, 0.11255809979306328, -0.16258490342232917, -0.12783727910783554, -0.30431671084629164, -0.17931284970707365, -0.19279117568965173, 0.14099247151364883, -0.15429069542636473, -0.17443557062910664, 0.30902409644590484, 0.16631459502710236, 0.22816070620384482, 0.08286815112353199, 0.24861759096384048, 0.20756778437385542, -0.038289994888732005, 0.1019306334770388, 0.13340408047661184, 0.12482523159641358, 0.030989142631491027, -0.17564501175656916, 0.0007175475721144014, 0.003346049164732297] |
1,802.08434 | Observation of Interface Superconductivity in a SnSe2-Epitaxial Graphene
van der Waals Heterostructure | We report on the direct observation of interface superconductivity in
single-unit-cell SnSe2 films grown on graphitized SiC(0001) substrate by means
of van der Waals epitaxy. Tunneling spectrum in the superconducting state
reveals rather conventional character with a fully gapped order parameter. The
occurrence of superconductivity is further confirmed by the presence of
vortices under external magnetic field. Through interface engineering, we
unravel the mechanism of superconductivity that originates from a
two-dimensional electron gas formed at the interface of SnSe2 and graphene. Our
finding opens up novel strategies to hunt for and understand interface
superconductivity based on van der Waals heterostructures.
| cond-mat.supr-con cond-mat.mtrl-sci | we report on the direct observation of interface superconductivity in singleunitcell snse2 films grown on graphitized sic0001 substrate by means of van der waals epitaxy tunneling spectrum in the superconducting state reveals rather conventional character with a fully gapped order parameter the occurrence of superconductivity is further confirmed by the presence of vortices under external magnetic field through interface engineering we unravel the mechanism of superconductivity that originates from a twodimensional electron gas formed at the interface of snse2 and graphene our finding opens up novel strategies to hunt for and understand interface superconductivity based on van der waals heterostructures | [['we', 'report', 'on', 'the', 'direct', 'observation', 'of', 'interface', 'superconductivity', 'in', 'singleunitcell', 'snse2', 'films', 'grown', 'on', 'graphitized', 'sic0001', 'substrate', 'by', 'means', 'of', 'van', 'der', 'waals', 'epitaxy', 'tunneling', 'spectrum', 'in', 'the', 'superconducting', 'state', 'reveals', 'rather', 'conventional', 'character', 'with', 'a', 'fully', 'gapped', 'order', 'parameter', 'the', 'occurrence', 'of', 'superconductivity', 'is', 'further', 'confirmed', 'by', 'the', 'presence', 'of', 'vortices', 'under', 'external', 'magnetic', 'field', 'through', 'interface', 'engineering', 'we', 'unravel', 'the', 'mechanism', 'of', 'superconductivity', 'that', 'originates', 'from', 'a', 'twodimensional', 'electron', 'gas', 'formed', 'at', 'the', 'interface', 'of', 'snse2', 'and', 'graphene', 'our', 'finding', 'opens', 'up', 'novel', 'strategies', 'to', 'hunt', 'for', 'and', 'understand', 'interface', 'superconductivity', 'based', 'on', 'van', 'der', 'waals', 'heterostructures']] | [-0.20841261632245733, 0.15879418848082424, -0.07387213135603815, -0.047219756384147334, -0.05209627831354737, -0.172971554370597, 0.13078424330800772, 0.35791553914546964, -0.24730928059667348, -0.2875544190499932, -0.07128367743454873, -0.3164265818335116, -0.18092693456099368, 0.2135882738046348, 0.08569397589191795, 0.024829147034324706, -0.054735590480268, -0.1965287842415273, -0.07534145787591115, -0.22891200207173823, 0.38318733996595256, 0.04601372235454619, 0.349862118922174, 0.14456861494749318, 0.03065360511187464, 0.02762993230018765, 0.1372295558359474, -0.0010882197320461274, -0.2481731402202422, 0.0791868202900514, 0.24999356369953601, -0.19979517059982754, 0.24389125963672995, -0.5226843090169132, -0.23083441494032741, -0.09727109031518921, 0.11236708592623472, 0.1665140470955521, -0.15693315316806547, -0.33272118168883025, 0.07231703476980328, -0.12459251198451966, -0.0683666942990385, -0.06643368692137301, -0.08071733455057256, -0.021171503732912243, -0.1940094823774416, 0.11501359904650599, 0.046141082246322185, 0.0972496094647795, -0.09412075546570123, -0.08048545040655881, -0.08806456233607605, -0.007491526458179579, -0.009620614864397794, 0.04128220878541469, 0.21435714876279235, -0.1274999429890886, -0.0946781994914636, 0.35021626404486594, -0.05075821329257451, -0.012861102595925331, 0.23134372968459502, -0.13764994601719083, -0.031186759867705405, 0.15726304030045868, 0.07045191527809948, 0.04986730834469199, -0.13949704414233566, 0.11238127510878257, 0.029435327015817164, 0.21786415247013793, 0.10916528739733622, 0.03751545417588204, 0.29742071066051723, 0.252424420453608, 0.03564047251828015, 0.12976098572835326, -0.0980914036766626, -0.0047095846850425, -0.16491643304005266, -0.24818658053234685, -0.2544279466014996, 0.09051583600929007, -0.009124665946583264, -0.2539889582619071, 0.3602894009789452, 0.1469305257173255, 0.12853878982597963, -0.12180384775623679, 0.21317448431625963, 0.049635201446944846, 0.06563279162161052, 0.000515700001269579, 0.2803398620150983, 0.14907108375336975, 0.10829856293275952, -0.2675847752415575, 0.1300247158529237, 0.06001369036734104] |
1,802.08435 | Efficient Neural Audio Synthesis | Sequential models achieve state-of-the-art results in audio, visual and
textual domains with respect to both estimating the data distribution and
generating high-quality samples. Efficient sampling for this class of models
has however remained an elusive problem. With a focus on text-to-speech
synthesis, we describe a set of general techniques for reducing sampling time
while maintaining high output quality. We first describe a single-layer
recurrent neural network, the WaveRNN, with a dual softmax layer that matches
the quality of the state-of-the-art WaveNet model. The compact form of the
network makes it possible to generate 24kHz 16-bit audio 4x faster than real
time on a GPU. Second, we apply a weight pruning technique to reduce the number
of weights in the WaveRNN. We find that, for a constant number of parameters,
large sparse networks perform better than small dense networks and this
relationship holds for sparsity levels beyond 96%. The small number of weights
in a Sparse WaveRNN makes it possible to sample high-fidelity audio on a mobile
CPU in real time. Finally, we propose a new generation scheme based on
subscaling that folds a long sequence into a batch of shorter sequences and
allows one to generate multiple samples at once. The Subscale WaveRNN produces
16 samples per step without loss of quality and offers an orthogonal method for
increasing sampling efficiency.
| cs.SD cs.LG eess.AS | sequential models achieve stateoftheart results in audio visual and textual domains with respect to both estimating the data distribution and generating highquality samples efficient sampling for this class of models has however remained an elusive problem with a focus on texttospeech synthesis we describe a set of general techniques for reducing sampling time while maintaining high output quality we first describe a singlelayer recurrent neural network the wavernn with a dual softmax layer that matches the quality of the stateoftheart wavenet model the compact form of the network makes it possible to generate 24khz 16bit audio 4x faster than real time on a gpu second we apply a weight pruning technique to reduce the number of weights in the wavernn we find that for a constant number of parameters large sparse networks perform better than small dense networks and this relationship holds for sparsity levels beyond 96 the small number of weights in a sparse wavernn makes it possible to sample highfidelity audio on a mobile cpu in real time finally we propose a new generation scheme based on subscaling that folds a long sequence into a batch of shorter sequences and allows one to generate multiple samples at once the subscale wavernn produces 16 samples per step without loss of quality and offers an orthogonal method for increasing sampling efficiency | [['sequential', 'models', 'achieve', 'stateoftheart', 'results', 'in', 'audio', 'visual', 'and', 'textual', 'domains', 'with', 'respect', 'to', 'both', 'estimating', 'the', 'data', 'distribution', 'and', 'generating', 'highquality', 'samples', 'efficient', 'sampling', 'for', 'this', 'class', 'of', 'models', 'has', 'however', 'remained', 'an', 'elusive', 'problem', 'with', 'a', 'focus', 'on', 'texttospeech', 'synthesis', 'we', 'describe', 'a', 'set', 'of', 'general', 'techniques', 'for', 'reducing', 'sampling', 'time', 'while', 'maintaining', 'high', 'output', 'quality', 'we', 'first', 'describe', 'a', 'singlelayer', 'recurrent', 'neural', 'network', 'the', 'wavernn', 'with', 'a', 'dual', 'softmax', 'layer', 'that', 'matches', 'the', 'quality', 'of', 'the', 'stateoftheart', 'wavenet', 'model', 'the', 'compact', 'form', 'of', 'the', 'network', 'makes', 'it', 'possible', 'to', 'generate', '24khz', '16bit', 'audio', '4x', 'faster', 'than', 'real', 'time', 'on', 'a', 'gpu', 'second', 'we', 'apply', 'a', 'weight', 'pruning', 'technique', 'to', 'reduce', 'the', 'number', 'of', 'weights', 'in', 'the', 'wavernn', 'we', 'find', 'that', 'for', 'a', 'constant', 'number', 'of', 'parameters', 'large', 'sparse', 'networks', 'perform', 'better', 'than', 'small', 'dense', 'networks', 'and', 'this', 'relationship', 'holds', 'for', 'sparsity', 'levels', 'beyond', '96', 'the', 'small', 'number', 'of', 'weights', 'in', 'a', 'sparse', 'wavernn', 'makes', 'it', 'possible', 'to', 'sample', 'highfidelity', 'audio', 'on', 'a', 'mobile', 'cpu', 'in', 'real', 'time', 'finally', 'we', 'propose', 'a', 'new', 'generation', 'scheme', 'based', 'on', 'subscaling', 'that', 'folds', 'a', 'long', 'sequence', 'into', 'a', 'batch', 'of', 'shorter', 'sequences', 'and', 'allows', 'one', 'to', 'generate', 'multiple', 'samples', 'at', 'once', 'the', 'subscale', 'wavernn', 'produces', '16', 'samples', 'per', 'step', 'without', 'loss', 'of', 'quality', 'and', 'offers', 'an', 'orthogonal', 'method', 'for', 'increasing', 'sampling', 'efficiency']] | [-0.08903888245748187, 0.05016132938445397, -0.02986469073009423, 0.050601136602927, -0.08573572409169918, -0.15210109969431704, 0.08978808757647956, 0.452708604732867, -0.2570311369882389, -0.33204508619515266, 0.06151455408068035, -0.23677575692477562, -0.127738842908928, 0.23073927645719694, -0.0944333903438581, 0.09756987561016682, 0.12304664192700081, 0.03729015586008741, -0.08145097886286252, -0.2908299137287858, 0.2629548561208966, 0.06922978123290126, 0.33983460409058763, -0.04723158336921849, 0.15115130720474884, -0.012703025891360912, -0.020169218274002726, -0.036681342655157836, -0.04427663018891921, 0.16126013502706138, 0.22772486559052513, 0.16206704133020883, 0.3379563342674043, -0.4322465061451856, -0.20939212483988906, 0.09797996571710842, 0.12097548404073512, 0.12811341570499776, -0.058741271273571656, -0.2196530336302451, 0.15136684152848004, -0.1518581548382909, -0.019003395856866105, -0.11670822285073386, -0.003545409053648737, -0.0035087913716614076, -0.3231082366694781, 0.04850174267723394, 0.044111351502678274, 0.02066462771035731, -0.03717740425252652, -0.11456424254680644, 0.020489564663942226, 0.14734008112361402, -0.01317430863299788, 0.06896487660494378, 0.0846861728697232, -0.16111148554588328, -0.11780271008610725, 0.35470216976140034, -0.07878391822702145, -0.20701516603585332, 0.1947758885915391, -0.06742081951180642, -0.15030434216499666, 0.15354255029339003, 0.2308779883050275, 0.13123615236571906, -0.11526082215238023, 0.006841519464135424, -0.03734024366871877, 0.23189506157386033, 0.07518996383613823, 0.036514633045457726, 0.14349629886194387, 0.2669497102985836, 0.06839439423797145, 0.17343386631056837, -0.13033720993063816, -0.035659345327241514, -0.19273340466501065, -0.13947118430144406, -0.2074830657051114, 0.00934577085982627, -0.13175148889389343, -0.17925166230310094, 0.4149594763744145, 0.19589981851591307, 0.24848755916834556, 0.16433373097838325, 0.3430489441295239, 0.057695372013801136, 0.11908213025837375, 0.08413516964805735, 0.13920323758608322, 0.044753929280506616, 0.09939200525510718, -0.16415128948349528, 0.06963847328615057, 0.04053100388687612] |
1,802.08436 | Del Pezzo surfaces and Mori fiber spaces in positive characteristic | We settle a question that originates from results and remarks by Koll\'ar on
extremal ray in the minimal model program: In positive characteristics, there
are no Mori fibrations on threefolds with only terminal singularities whose
generic fibers are geometrically non-normal surfaces. To show this we establish
some general structure results for del Pezzo surfaces over imperfect ground
fields. This relies on Reid's classification of non-normal del Pezzo surfaces
over algebraically closed fields, combined with a detailed analysis of
geometrical non-reducedness over imperfect fields of p-degree one.
| math.AG | we settle a question that originates from results and remarks by kollar on extremal ray in the minimal model program in positive characteristics there are no mori fibrations on threefolds with only terminal singularities whose generic fibers are geometrically nonnormal surfaces to show this we establish some general structure results for del pezzo surfaces over imperfect ground fields this relies on reids classification of nonnormal del pezzo surfaces over algebraically closed fields combined with a detailed analysis of geometrical nonreducedness over imperfect fields of pdegree one | [['we', 'settle', 'a', 'question', 'that', 'originates', 'from', 'results', 'and', 'remarks', 'by', 'kollar', 'on', 'extremal', 'ray', 'in', 'the', 'minimal', 'model', 'program', 'in', 'positive', 'characteristics', 'there', 'are', 'no', 'mori', 'fibrations', 'on', 'threefolds', 'with', 'only', 'terminal', 'singularities', 'whose', 'generic', 'fibers', 'are', 'geometrically', 'nonnormal', 'surfaces', 'to', 'show', 'this', 'we', 'establish', 'some', 'general', 'structure', 'results', 'for', 'del', 'pezzo', 'surfaces', 'over', 'imperfect', 'ground', 'fields', 'this', 'relies', 'on', 'reids', 'classification', 'of', 'nonnormal', 'del', 'pezzo', 'surfaces', 'over', 'algebraically', 'closed', 'fields', 'combined', 'with', 'a', 'detailed', 'analysis', 'of', 'geometrical', 'nonreducedness', 'over', 'imperfect', 'fields', 'of', 'pdegree', 'one']] | [-0.21094035779039355, 0.023170505774878832, -0.09907318064184903, 0.1277187224775336, -0.07201506879700478, -0.2113011523128249, -0.0035445386717139287, 0.3588010224427075, -0.2366944733833851, -0.23951485283066368, 0.09542166053176705, -0.28512508926241725, -0.147466094105851, 0.2645778037407327, -0.20839687710801183, -0.03482571578324707, 0.05880043774215115, 0.012096228050934367, -0.10495355961097101, -0.40130391963595136, 0.4514163791927574, -0.0386094312037363, 0.22200945829756039, 0.09424298359514323, 0.14567723186946538, 0.06695272709611197, 0.013697836699700632, 0.006366762375935565, -0.19225378051106778, 0.11185296571835182, 0.33552696843913127, 0.04995285632456978, 0.12748444785613047, -0.4294926427997822, -0.24219285661008122, 0.16469042084374746, 0.04131528681014166, 0.0696359148281518, -0.02102021956247776, -0.24373455318557316, 0.07379238716824803, -0.0742449720382019, -0.18556422070426823, -0.09683249077521437, -0.03376866683775429, 0.04269796499419351, -0.1404158534288547, -0.02555245195168915, 0.12833269454706678, 0.2160429963855571, -0.03317895091848101, -0.09695424308301881, -0.08081562758618316, 0.002831112026226122, 0.04031206328329782, 0.006373553838699969, 0.049107357265351904, -0.11758570680611355, -0.10767750872494003, 0.2849360671067654, -0.09122128864793583, -0.21332093159841417, 0.1679625935489745, -0.1442985296503879, -0.12153575069346834, 0.20146753937872344, 0.13955703007901998, 0.2011662224784147, -0.028098769313357988, 0.18785627536018118, -0.10985799408842657, 0.09597772277545097, 0.12930033506479027, -0.054622188571239495, 0.20129033948056574, 0.0927499994570606, 0.06023846074483942, 0.06151374249697425, -0.02951176706863957, -0.07552795656306972, -0.39129978991763364, -0.16402340413417754, -0.0762593803689057, 0.18409283419794858, -0.07276777027605973, -0.1806383324830338, 0.42139824718063656, 0.004957966621542826, 0.18320709030512114, 0.07757008671149718, 0.22076751837550207, -0.08385843814480616, -0.0016313569002979716, 0.07913289642973997, 0.18429464365113365, 0.18666737281641554, -0.043018591453505374, -0.11060482863239338, 0.021742973195085693, 0.10330940071536704] |
1,802.08437 | Abstract Completion, Formalized | Completion is one of the most studied techniques in term rewriting and
fundamental to automated reasoning with equalities. In this paper we present
new correctness proofs of abstract completion, both for finite and infinite
runs. For the special case of ground completion we present a new proof based on
random descent. We moreover extend the results to ordered completion, an
important extension of completion that aims to produce ground-complete
presentations of the initial equations. We present new proofs concerning the
completeness of ordered completion for two settings. Moreover, we revisit and
extend results of M\'etivier concerning canonicity of rewrite systems. All
proofs presented in the paper have been formalized in Isabelle/HOL.
| cs.LO | completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities in this paper we present new correctness proofs of abstract completion both for finite and infinite runs for the special case of ground completion we present a new proof based on random descent we moreover extend the results to ordered completion an important extension of completion that aims to produce groundcomplete presentations of the initial equations we present new proofs concerning the completeness of ordered completion for two settings moreover we revisit and extend results of metivier concerning canonicity of rewrite systems all proofs presented in the paper have been formalized in isabellehol | [['completion', 'is', 'one', 'of', 'the', 'most', 'studied', 'techniques', 'in', 'term', 'rewriting', 'and', 'fundamental', 'to', 'automated', 'reasoning', 'with', 'equalities', 'in', 'this', 'paper', 'we', 'present', 'new', 'correctness', 'proofs', 'of', 'abstract', 'completion', 'both', 'for', 'finite', 'and', 'infinite', 'runs', 'for', 'the', 'special', 'case', 'of', 'ground', 'completion', 'we', 'present', 'a', 'new', 'proof', 'based', 'on', 'random', 'descent', 'we', 'moreover', 'extend', 'the', 'results', 'to', 'ordered', 'completion', 'an', 'important', 'extension', 'of', 'completion', 'that', 'aims', 'to', 'produce', 'groundcomplete', 'presentations', 'of', 'the', 'initial', 'equations', 'we', 'present', 'new', 'proofs', 'concerning', 'the', 'completeness', 'of', 'ordered', 'completion', 'for', 'two', 'settings', 'moreover', 'we', 'revisit', 'and', 'extend', 'results', 'of', 'metivier', 'concerning', 'canonicity', 'of', 'rewrite', 'systems', 'all', 'proofs', 'presented', 'in', 'the', 'paper', 'have', 'been', 'formalized', 'in', 'isabellehol']] | [-0.10449788039854334, 0.03555413328547991, -0.10777010722505348, 0.08767628127725811, -0.11541107294846091, -0.1030842440311906, 0.0348852120868459, 0.3390314489359724, -0.2460853664072331, -0.26323037352916356, 0.16019734260332477, -0.23334199948832057, -0.1432135157782148, 0.18850502248450712, -0.1474620219013813, 0.05039863267951217, 0.08775094373420149, 0.02773925677982268, -0.1082420664365395, -0.3042169892321433, 0.3419613303734107, -0.010726118191808194, 0.21702386943942253, 0.0842209038920365, 0.09488899817455325, 0.0961050150563588, -0.07641978659205609, 0.02534202192616355, -0.16246132868131558, 0.1721532785644134, 0.3100615722706189, 0.2030522576847894, 0.2640772667705073, -0.4322043036169431, -0.1245054535584541, 0.08240882002723378, 0.13445595597328097, 0.12460870540759585, -0.05742350836213141, -0.2658689307481017, 0.1279476923749547, -0.1734778859258235, -0.0898179986539322, -0.11348905995685339, 0.00629965068252237, 0.016079705275662312, -0.2338625231237562, -0.03011217493949844, 0.1624258704198239, 0.09864083384709046, -0.09698309771808888, -0.11582729642002566, 0.10067782207048154, 0.09876778558198665, 0.04208964570467402, -0.03507850650563702, 0.022657053068968223, -0.09445232656146693, -0.18665627823085398, 0.37015230446919667, -0.08357680755088458, -0.14037107005883176, 0.20251983612868096, -0.05371124161038179, -0.24500434385058847, 0.05107002280472132, 0.15577979176095477, 0.18432187179925744, -0.13211251957224565, 0.13666547564967946, -0.09308618640208298, 0.13444263370590168, 0.08043340325087041, 0.037875340710318575, 0.09300816889751602, 0.18365231507902477, 0.07314801584669128, 0.19020126376150026, 0.04952544584945851, -0.0978882320032262, -0.38013901339994893, -0.18682334861541922, -0.11476816245467981, 0.012246387712825258, -0.031178193149678117, -0.17927409862881308, 0.38295370231273473, 0.2307408664644033, 0.13962975760653346, 0.15242830930521023, 0.28942694746561953, 0.08998871033776316, 0.020412334538828413, 0.05908912652579078, 0.16935992426436125, 0.18660269455715744, 0.09501816028192102, -0.13516755324373073, 0.05039186151027008, 0.17071373842505588] |
1,802.08438 | The Brown-Halmos theorem for a pair of abstract Hardy spaces | Let $H[X]$ and $H[Y]$ be abstract Hardy spaces built upon Banach function
spaces $X$ and $Y$ over the unit circle $\mathbb{T}$. We prove an analogue of
the Brown-Halmos theorem for Toeplitz operators $T_a$ acting from $H[X]$ to
$H[Y]$ under the only assumption that the space $X$ is separable and the Riesz
projection $P$ is bounded on the space $Y$. We specify our results to the case
of variable Lebesgue spaces $X=L^{p(\cdot)}$ and $Y=L^{q(\cdot)}$ and to the
case of Lorentz spaces $X=Y=L^{p,q}(w)$, $1<p<\infty$, $1\le q<\infty$ with
Muckenhoupt weights $w\in A_p(\mathbb{T})$.
| math.FA | let hx and hy be abstract hardy spaces built upon banach function spaces x and y over the unit circle mathbbt we prove an analogue of the brownhalmos theorem for toeplitz operators t_a acting from hx to hy under the only assumption that the space x is separable and the riesz projection p is bounded on the space y we specify our results to the case of variable lebesgue spaces xlpcdot and ylqcdot and to the case of lorentz spaces xylpqw 1pinfty 1le qinfty with muckenhoupt weights win a_pmathbbt | [['let', 'hx', 'and', 'hy', 'be', 'abstract', 'hardy', 'spaces', 'built', 'upon', 'banach', 'function', 'spaces', 'x', 'and', 'y', 'over', 'the', 'unit', 'circle', 'mathbbt', 'we', 'prove', 'an', 'analogue', 'of', 'the', 'brownhalmos', 'theorem', 'for', 'toeplitz', 'operators', 't_a', 'acting', 'from', 'hx', 'to', 'hy', 'under', 'the', 'only', 'assumption', 'that', 'the', 'space', 'x', 'is', 'separable', 'and', 'the', 'riesz', 'projection', 'p', 'is', 'bounded', 'on', 'the', 'space', 'y', 'we', 'specify', 'our', 'results', 'to', 'the', 'case', 'of', 'variable', 'lebesgue', 'spaces', 'xlpcdot', 'and', 'ylqcdot', 'and', 'to', 'the', 'case', 'of', 'lorentz', 'spaces', 'xylpqw', '1pinfty', '1le', 'qinfty', 'with', 'muckenhoupt', 'weights', 'win', 'a_pmathbbt']] | [-0.09910214166978702, 0.12328805081042982, -0.06523548725663739, 0.09048971839742187, -0.08215083886650117, -0.1247424687313683, 0.02962520461091224, 0.4287808378391406, -0.3790638237205498, -0.06537950983072412, 0.11229850475621574, -0.29966032581732555, -0.05027396898059284, 0.20340141589369845, -0.16781018294174882, 0.030574863238314934, 0.00999002966153271, 0.08614837465643445, -0.16334149967605138, -0.32711108471540845, 0.4366987564107951, -0.07663404570125482, 0.17296738816315638, -0.006003065498354023, 0.13702628203249975, 0.08128207213080982, 0.020216567562345196, -0.09141834839041728, -0.2002731254355989, 0.1114904866718194, 0.2503539274720585, 0.07381929972428171, 0.3197688664583599, -0.3275802136042758, -0.1660122946014299, 0.26172366834738675, 0.07035079573226326, -0.18825942275443058, 0.04546484637265916, -0.3489258365760393, 0.047782890772556555, -0.08822995723389528, -0.12027426210834699, -0.10923085741233081, 0.09084374584695872, 0.04624042119556929, -0.4132106549161322, 0.002399239070056116, 0.16368562562719863, 0.01889115933000165, -0.1826953591532348, -0.14283194860772175, -0.0755541400408701, 0.03577778563451241, -0.031147619419019012, 0.20749949547736085, 0.10552113815484677, 0.054749269958804636, -0.08354670639862033, 0.33230445669854386, -0.06505380061400287, -0.2964710485190153, 0.08612509455038782, -0.2617725775960614, -0.1430611625806812, 0.025708835692528416, 0.09710355413091533, 0.1631850004524869, 0.009009200605728171, 0.2858499874052701, -0.11455746522063719, 0.11626523543587503, 0.08329826945110279, 0.08151509340797715, -0.0010173258755136938, 0.0532010278719313, 0.1769623905639438, 0.10181615107336685, 0.0010821350440999274, -0.015483098288121468, -0.38160780243137304, -0.17996111379607635, -0.21039053946733474, 0.1375040228752529, -0.14060879611488952, -0.15647296771845398, 0.2544662954943145, 0.031107354887268124, 0.16819536024841536, 0.11547766911852009, 0.1188642950509401, 0.08881457242703832, 0.008109761659494218, 0.062028548592591985, 0.060319347022210854, 0.20831690540482453, 0.09249106995651828, -0.1022350690957597, -0.002936868539408726, 0.26966614153506646] |
1,802.08439 | Ratio ergodic theorems: From Hopf to Birkhoff and Kingman | Hopf's ratio ergodic theorem has an inherent symmetry which we exploit to
provide a simplification of standard proofs of Hopf's and Birkhoff's ergodic
theorems. We also present a ratio ergodic theorem for conservative
transformations on a $\sigma$-finite measure space, generalizing Kingman's
ergodic theorem for subadditive sequences and generalizing previous results by
Akcoglu and Sucheston.
| math.DS math.PR | hopfs ratio ergodic theorem has an inherent symmetry which we exploit to provide a simplification of standard proofs of hopfs and birkhoffs ergodic theorems we also present a ratio ergodic theorem for conservative transformations on a sigmafinite measure space generalizing kingmans ergodic theorem for subadditive sequences and generalizing previous results by akcoglu and sucheston | [['hopfs', 'ratio', 'ergodic', 'theorem', 'has', 'an', 'inherent', 'symmetry', 'which', 'we', 'exploit', 'to', 'provide', 'a', 'simplification', 'of', 'standard', 'proofs', 'of', 'hopfs', 'and', 'birkhoffs', 'ergodic', 'theorems', 'we', 'also', 'present', 'a', 'ratio', 'ergodic', 'theorem', 'for', 'conservative', 'transformations', 'on', 'a', 'sigmafinite', 'measure', 'space', 'generalizing', 'kingmans', 'ergodic', 'theorem', 'for', 'subadditive', 'sequences', 'and', 'generalizing', 'previous', 'results', 'by', 'akcoglu', 'and', 'sucheston']] | [-0.12942674641282176, 0.07685256696922292, -0.16992844265165194, 0.1597804883319252, -0.05224996084733954, -0.16265924382111374, 0.14788568291795562, 0.2868788685860499, -0.25193934599464796, -0.14041604647711622, 0.12041645555071673, -0.2389152055465669, -0.1237560663622681, 0.23786396598267667, -0.24466526798271346, 0.06109057792093394, 0.03657511298386556, 0.009495031119890968, -0.08676029692562122, -0.21446009275485883, 0.3268832269845144, -0.0030592164587018625, 0.305785968495568, 0.1198907621767161, 0.16734139280358576, 0.11366762876299755, -0.11741352878194654, -0.0402166617354422, -0.25128290276833865, 0.11982038662821617, 0.26357237001845857, 0.11678140801114012, 0.2315448212595481, -0.2656412050127983, -0.18598643881883822, 0.1820520619809065, 0.08984126741031431, 0.023241111821987015, -0.05097278600277485, -0.3503874780012752, 0.10143048107132034, -0.14062235941934698, -0.1605584890370802, -0.1463725376382189, -0.007081266035729984, 0.03257862777220753, -0.30404844939849285, 0.09903362153904108, 0.31329813256930067, 0.10626984426294858, -0.033221270045581855, -0.06938788727066426, 0.054139689858651384, 0.08544339217632166, 0.07516060671154058, 0.05656232721752153, 0.1244284232918015, 0.059565701943664055, -0.20201439410448074, 0.31083318724666004, -0.09598899857615525, -0.27689018813928346, 0.17040883074953872, -0.08762050528114415, -0.27540471202711453, 0.12306847751035162, 0.10216019401010477, 0.09795870050295906, -0.13096096821761918, 0.1713037627698625, -0.16268042740324196, 0.0956912296209133, 0.1401410466587206, 0.09931501469197068, 0.10606212980764092, 0.05874637749819261, 0.1710043005504698, 0.14722351714494233, 0.06697724201224463, -0.15239523389851148, -0.2520889324961968, -0.17701206233282135, -0.1396027008238477, 0.18480331740640807, -0.1453043079294181, -0.16692301026492748, 0.26210051900619324, 0.09390812121520592, 0.05754158501776884, 0.27360535449269313, 0.23453712596927048, 0.16894926997077353, -0.043134249470038515, 0.04434658316368202, 0.1500327828305088, 0.29443233499285887, 0.07115961369654199, -0.08696998365856004, 0.00030160808654607464, 0.2680268458108295] |
1,802.0844 | Tuning the electronic and chemisorption properties of hexagonal MgO
nanotubes by doping - Theoretical study | Oxide materials offer a wide range of interesting physical and chemical
properties. Even more versatile behavior of oxides is seen at the nanoscale,
qualifying these materials for a number of applications. In this study we used
DFT calculations to investigate the physical and chemical properties of small
hexagonal MgO nanotubes of different length. We analyzed the effect of Li, B,
C, N, and F doping on the properties of the nanotubes. We find that all dopants
favor the edge positions when, incorporated into the nanotubes. Doping results
in the net magnetization whose value depends on the type of the impurity. Using
the CO molecule as a probe, we studied the adsorption properties of pristine
and doped MgO nanotubes. Our results show that the dopant sites are also the
centers of significantly altered chemical reactivity. While pristine MgO
nanotubes adsorb CO weakly, very strong adsorption at the dopant sites (B-, C-,
and N-doped nanotubes) or neighboring edge atoms (F- and Li-doped nanotubes) is
observed. Our results suggest that impurity engineering in oxide materials can
be a promising strategy for the development of novel materials with possible
use as selective adsorbents or catalysts.
| cond-mat.mtrl-sci | oxide materials offer a wide range of interesting physical and chemical properties even more versatile behavior of oxides is seen at the nanoscale qualifying these materials for a number of applications in this study we used dft calculations to investigate the physical and chemical properties of small hexagonal mgo nanotubes of different length we analyzed the effect of li b c n and f doping on the properties of the nanotubes we find that all dopants favor the edge positions when incorporated into the nanotubes doping results in the net magnetization whose value depends on the type of the impurity using the co molecule as a probe we studied the adsorption properties of pristine and doped mgo nanotubes our results show that the dopant sites are also the centers of significantly altered chemical reactivity while pristine mgo nanotubes adsorb co weakly very strong adsorption at the dopant sites b c and ndoped nanotubes or neighboring edge atoms f and lidoped nanotubes is observed our results suggest that impurity engineering in oxide materials can be a promising strategy for the development of novel materials with possible use as selective adsorbents or catalysts | [['oxide', 'materials', 'offer', 'a', 'wide', 'range', 'of', 'interesting', 'physical', 'and', 'chemical', 'properties', 'even', 'more', 'versatile', 'behavior', 'of', 'oxides', 'is', 'seen', 'at', 'the', 'nanoscale', 'qualifying', 'these', 'materials', 'for', 'a', 'number', 'of', 'applications', 'in', 'this', 'study', 'we', 'used', 'dft', 'calculations', 'to', 'investigate', 'the', 'physical', 'and', 'chemical', 'properties', 'of', 'small', 'hexagonal', 'mgo', 'nanotubes', 'of', 'different', 'length', 'we', 'analyzed', 'the', 'effect', 'of', 'li', 'b', 'c', 'n', 'and', 'f', 'doping', 'on', 'the', 'properties', 'of', 'the', 'nanotubes', 'we', 'find', 'that', 'all', 'dopants', 'favor', 'the', 'edge', 'positions', 'when', 'incorporated', 'into', 'the', 'nanotubes', 'doping', 'results', 'in', 'the', 'net', 'magnetization', 'whose', 'value', 'depends', 'on', 'the', 'type', 'of', 'the', 'impurity', 'using', 'the', 'co', 'molecule', 'as', 'a', 'probe', 'we', 'studied', 'the', 'adsorption', 'properties', 'of', 'pristine', 'and', 'doped', 'mgo', 'nanotubes', 'our', 'results', 'show', 'that', 'the', 'dopant', 'sites', 'are', 'also', 'the', 'centers', 'of', 'significantly', 'altered', 'chemical', 'reactivity', 'while', 'pristine', 'mgo', 'nanotubes', 'adsorb', 'co', 'weakly', 'very', 'strong', 'adsorption', 'at', 'the', 'dopant', 'sites', 'b', 'c', 'and', 'ndoped', 'nanotubes', 'or', 'neighboring', 'edge', 'atoms', 'f', 'and', 'lidoped', 'nanotubes', 'is', 'observed', 'our', 'results', 'suggest', 'that', 'impurity', 'engineering', 'in', 'oxide', 'materials', 'can', 'be', 'a', 'promising', 'strategy', 'for', 'the', 'development', 'of', 'novel', 'materials', 'with', 'possible', 'use', 'as', 'selective', 'adsorbents', 'or', 'catalysts']] | [-0.09558784713083635, 0.1549190583648599, 0.029565224762279442, -0.009190106731217784, 0.019838165026158094, -0.1900091315400226, 0.13962090447488978, 0.46819238351043607, -0.24511260799185924, -0.2853294304859732, -0.0174595451912555, -0.31289451641971683, -0.13680172209013547, 0.1533902302440451, 0.040490483974852644, -0.012001884720868465, 0.03707299891558198, -0.09496118256539418, -0.07065605102332445, -0.24312437272445342, 0.2293340358810002, 0.05962094585917139, 0.31275367483262617, 0.14747887040873628, -0.014429509705566454, -0.028664768456496025, 0.12448324139732185, 0.04679817890447287, -0.17678641498813993, 0.11195916871412862, 0.25042115363380163, -0.06915421397376474, 0.20465680786423113, -0.507304430212728, -0.23531502640820767, 0.007892608384491146, 0.12170004232113703, 0.14326623603287128, -0.13180118482358782, -0.2387367450090915, 0.08220193823598354, -0.08491374642578446, -0.13157859247382633, -0.058531083605442374, 0.02522242195046073, 0.0668889518058615, -0.23354395782253193, 0.03340385365040841, 0.04312978393802936, 0.07501681280015031, -0.12134984665408886, -0.2233858810474423, -0.13663040112743047, 0.061815023424831604, 0.026902605078539064, -0.011631993150840762, 0.2942046547961953, -0.09004460403290991, -0.05962433704755303, 0.4235690879045513, -0.06752943147354179, -0.09258468633429855, 0.23324461623597206, -0.14896373695837753, -0.11481001485304916, 0.13175954879871057, 0.09636760156367617, 0.15809198646655023, -0.15736941535384527, 0.07735000344795413, -0.009913958488422305, 0.1659345380396275, 0.07432439622678916, 0.11034508976483162, 0.24698685066950024, 0.21359778935557808, 0.03824544601942076, 0.12954016836818444, -0.10118480917817245, 0.020162783094733, -0.15822321472138517, -0.24987572364275057, -0.22184400939741, 0.08056381271898512, -0.10573351279913487, -0.21410852833041502, 0.37822153707673645, 0.11762408874392588, 0.17553677121226077, -0.07226526393574609, 0.17560563564144505, 0.02922693465553536, 0.09707892340600627, -0.023987949137083443, 0.21454509785057518, 0.14414523896719791, 0.10062867660119311, -0.2647725892111815, 0.13429155804129092, -0.016170223904846733] |
1,802.08441 | (No) Influence of Continuous Integration on the Commit Activity in
GitHub Projects | A core goal of Continuous Integration (CI) is to make small incremental
changes to software projects, which are integrated frequently into a mainline
repository or branch. This paper presents an empirical study that investigates
if developers adjust their commit activity towards the above-mentioned goal
after projects start using CI. We analyzed the commit and merge activity in 93
GitHub projects that introduced the hosted CI system Travis CI, but have
previously been developed for at least one year before introducing CI. In our
analysis, we only found one non-negligible effect, an increased merge ratio,
meaning that there were more merging commits in relation to all commits after
the projects started using Travis CI. This effect has also been reported in
related work. However, we observed the same effect in a random sample of 60
GitHub projects not using CI. Thus, it is unlikely that the effect is caused by
the introduction of CI alone. We conclude that: (1) in our sample of projects,
the introduction of CI did not lead to major changes in developers' commit
activity, and (2) it is important to compare the commit activity to a baseline
before attributing an effect to a treatment that may not be the cause for the
observed effect.
| cs.SE | a core goal of continuous integration ci is to make small incremental changes to software projects which are integrated frequently into a mainline repository or branch this paper presents an empirical study that investigates if developers adjust their commit activity towards the abovementioned goal after projects start using ci we analyzed the commit and merge activity in 93 github projects that introduced the hosted ci system travis ci but have previously been developed for at least one year before introducing ci in our analysis we only found one nonnegligible effect an increased merge ratio meaning that there were more merging commits in relation to all commits after the projects started using travis ci this effect has also been reported in related work however we observed the same effect in a random sample of 60 github projects not using ci thus it is unlikely that the effect is caused by the introduction of ci alone we conclude that 1 in our sample of projects the introduction of ci did not lead to major changes in developers commit activity and 2 it is important to compare the commit activity to a baseline before attributing an effect to a treatment that may not be the cause for the observed effect | [['a', 'core', 'goal', 'of', 'continuous', 'integration', 'ci', 'is', 'to', 'make', 'small', 'incremental', 'changes', 'to', 'software', 'projects', 'which', 'are', 'integrated', 'frequently', 'into', 'a', 'mainline', 'repository', 'or', 'branch', 'this', 'paper', 'presents', 'an', 'empirical', 'study', 'that', 'investigates', 'if', 'developers', 'adjust', 'their', 'commit', 'activity', 'towards', 'the', 'abovementioned', 'goal', 'after', 'projects', 'start', 'using', 'ci', 'we', 'analyzed', 'the', 'commit', 'and', 'merge', 'activity', 'in', '93', 'github', 'projects', 'that', 'introduced', 'the', 'hosted', 'ci', 'system', 'travis', 'ci', 'but', 'have', 'previously', 'been', 'developed', 'for', 'at', 'least', 'one', 'year', 'before', 'introducing', 'ci', 'in', 'our', 'analysis', 'we', 'only', 'found', 'one', 'nonnegligible', 'effect', 'an', 'increased', 'merge', 'ratio', 'meaning', 'that', 'there', 'were', 'more', 'merging', 'commits', 'in', 'relation', 'to', 'all', 'commits', 'after', 'the', 'projects', 'started', 'using', 'travis', 'ci', 'this', 'effect', 'has', 'also', 'been', 'reported', 'in', 'related', 'work', 'however', 'we', 'observed', 'the', 'same', 'effect', 'in', 'a', 'random', 'sample', 'of', '60', 'github', 'projects', 'not', 'using', 'ci', 'thus', 'it', 'is', 'unlikely', 'that', 'the', 'effect', 'is', 'caused', 'by', 'the', 'introduction', 'of', 'ci', 'alone', 'we', 'conclude', 'that', '1', 'in', 'our', 'sample', 'of', 'projects', 'the', 'introduction', 'of', 'ci', 'did', 'not', 'lead', 'to', 'major', 'changes', 'in', 'developers', 'commit', 'activity', 'and', '2', 'it', 'is', 'important', 'to', 'compare', 'the', 'commit', 'activity', 'to', 'a', 'baseline', 'before', 'attributing', 'an', 'effect', 'to', 'a', 'treatment', 'that', 'may', 'not', 'be', 'the', 'cause', 'for', 'the', 'observed', 'effect']] | [-0.08791712004801591, 0.06694816373217488, -0.07934873260260708, 0.06257619471165492, -0.06387307076008568, -0.13954798695473855, 0.08744003763028695, 0.41670546270648223, -0.20487878779776098, -0.332350984517179, 0.11574395122692654, -0.2817099164869942, -0.11526568921548337, 0.14991019727495739, -0.07062437925130813, -0.019830033756738554, 0.07901028094921207, -0.0007115848526102153, -0.028037491209517068, -0.30021298465269486, 0.2818503733578134, 0.1261697406925549, 0.2596286738331875, 0.050030315144140504, 0.015779157410992155, -0.03980541464440741, -0.08713270885338961, 0.01699230602491368, -0.05649675882036476, 0.06945798822498941, 0.281191063794006, 0.18713750522178801, 0.3504038085297182, -0.4149189270075477, -0.1487773322828726, 0.08927610376624813, 0.1504751228241493, 0.0970656246026744, -0.021310283142551983, -0.26955907752766645, 0.09624654809147984, -0.23003737830921359, -0.10969433557593088, -0.011601196194814456, 0.0809580282992031, -0.03615650069587167, -0.2027782186863557, 0.01677812759948395, 0.05786834356761965, 0.08629384627304229, -0.03305204883290923, -0.13105159019095292, -0.02855124755038507, 0.1705523498079645, 0.06869164583889614, 0.07622322079034945, 0.145769090320834, -0.052536318199692185, -0.10470451870123329, 0.36940005328956144, -0.0381619423157693, -0.10986179049668951, 0.21227315942428393, -0.11118254027383374, -0.20788637965080747, 0.13197111192942207, 0.1732566070963363, 0.06269751449007595, -0.1752127844993259, -0.021005865292745115, 0.03234994383461341, 0.24009948319436056, 0.04932619835776479, -0.03656189563427714, 0.21809720841420877, 0.14062257579377074, 0.022994630053360464, 0.12215414898782735, -0.06990340080760095, -0.08035426605087907, -0.22794948344384341, -0.13812854918898734, -0.12263711714545705, 0.03868799554913784, 0.016539524089019736, -0.1437187882203267, 0.3667265164361061, 0.22054910683466777, 0.15260137076341157, 0.0027567980218237797, 0.25718723555153983, 0.07303659785831357, 0.13486123482802442, 0.09936070963425409, 0.2554838565956567, 0.009799398695555142, 0.11577906929955319, -0.18220650994754284, 0.14495727387234425, -0.005398418637923896] |
1,802.08442 | Building a coverage hole-free communication tree | Wireless networks are present everywhere but their management can be tricky
since their coverage may contain holes even if the network is fully connected.
In this paper we propose an algorithm that can build a communication tree
between nodes of a wireless network with guarantee that there is no coverage
hole in the tree. We use simplicial homology to compute mathematically the
coverage, and Prim's algorithm principle to build the communication tree. Some
simulation results are given to study the performance of the algorithm and
compare different metrics. In the end, we show that our algorithm can be used
to create coverage hole-free communication groups with a limited number of
hops.
| cs.NI cs.CG | wireless networks are present everywhere but their management can be tricky since their coverage may contain holes even if the network is fully connected in this paper we propose an algorithm that can build a communication tree between nodes of a wireless network with guarantee that there is no coverage hole in the tree we use simplicial homology to compute mathematically the coverage and prims algorithm principle to build the communication tree some simulation results are given to study the performance of the algorithm and compare different metrics in the end we show that our algorithm can be used to create coverage holefree communication groups with a limited number of hops | [['wireless', 'networks', 'are', 'present', 'everywhere', 'but', 'their', 'management', 'can', 'be', 'tricky', 'since', 'their', 'coverage', 'may', 'contain', 'holes', 'even', 'if', 'the', 'network', 'is', 'fully', 'connected', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'that', 'can', 'build', 'a', 'communication', 'tree', 'between', 'nodes', 'of', 'a', 'wireless', 'network', 'with', 'guarantee', 'that', 'there', 'is', 'no', 'coverage', 'hole', 'in', 'the', 'tree', 'we', 'use', 'simplicial', 'homology', 'to', 'compute', 'mathematically', 'the', 'coverage', 'and', 'prims', 'algorithm', 'principle', 'to', 'build', 'the', 'communication', 'tree', 'some', 'simulation', 'results', 'are', 'given', 'to', 'study', 'the', 'performance', 'of', 'the', 'algorithm', 'and', 'compare', 'different', 'metrics', 'in', 'the', 'end', 'we', 'show', 'that', 'our', 'algorithm', 'can', 'be', 'used', 'to', 'create', 'coverage', 'holefree', 'communication', 'groups', 'with', 'a', 'limited', 'number', 'of', 'hops']] | [-0.1902791085623641, 0.046074610943030274, -0.0672604576726486, 0.06572677386895258, -0.08513835050702633, -0.16332810310445525, 0.07837842081291685, 0.46300115130908853, -0.26755108669198846, -0.3347574667417788, 0.10710411958148922, -0.25312972384261656, -0.2063245177268982, 0.1377260458764729, -0.14367402484220965, 0.0018346361513878848, 0.10942706490052981, 0.05088775598251068, -0.005218102349186534, -0.2876853866519423, 0.28746753787361756, 0.059176406816805936, 0.2809079327276564, 0.08092501834202726, 0.04505514144071017, -0.030242954971277162, -0.03248650088134381, 0.056031668007579374, -0.1285202054228599, 0.13169418097901586, 0.32675062955634016, 0.21499274135777005, 0.2610184418557732, -0.4352601022870691, -0.20206300583710005, 0.17578616522688856, 0.16436436622999273, 0.1115358420941341, -0.019389794845771684, -0.24715892926932456, 0.15462585173647952, -0.2014875536163648, -0.060191544494381896, -0.07719716189747995, -0.049352130433125, 0.028097913720066082, -0.25465667891307725, -0.0233895628931219, -0.013089282073181224, -0.010683255354026417, -0.006668452616059431, -0.033358102328739724, -0.023993505280347424, 0.18560736286579757, -0.019518646361255967, 0.03843665693106281, 0.07599126121557846, -0.08590864432033839, -0.1585311673178866, 0.37512415615204087, -0.006234915348122249, -0.22717807712956323, 0.19579953476492953, -0.09518158232527345, -0.15667240608164723, 0.13463692914963038, 0.2125422416023096, 0.10382245562400098, -0.16698532049787473, 0.05135028193776101, -0.03446801696685856, 0.15929002402065037, 0.06544611696153879, 0.043591920852237426, 0.17032482720668185, 0.19915663584362012, 0.146136405877769, 0.13698264104859517, -0.07301123131712613, -0.06916471412992692, -0.2323547243518201, -0.1361028369482573, -0.22122062636153386, 0.02101241365528187, -0.10548718878553619, -0.18666828604339547, 0.3597186158352473, 0.19535359660234838, 0.165266880850509, 0.17800360045454525, 0.32074885576432344, 0.06516438024642936, 0.06402024990451094, 0.1717491583428807, 0.18994766560740778, 0.0790417671312687, 0.0933228166824257, -0.11537571955337986, 0.08163081621960946, 0.03874995933451295] |
1,802.08443 | Another Identity for Complete Bell Polynomials based on Ramanujan's
Congruences | Let $p(n)$ be the number of partition of a positive integer $n$. We derive a
new identity for complete Bell polynomials based on a generating function of
$p(7n+5)$ given by Ramanujan.
| math.CO | let pn be the number of partition of a positive integer n we derive a new identity for complete bell polynomials based on a generating function of p7n5 given by ramanujan | [['let', 'pn', 'be', 'the', 'number', 'of', 'partition', 'of', 'a', 'positive', 'integer', 'n', 'we', 'derive', 'a', 'new', 'identity', 'for', 'complete', 'bell', 'polynomials', 'based', 'on', 'a', 'generating', 'function', 'of', 'p7n5', 'given', 'by', 'ramanujan']] | [-0.22822918485229213, 0.07274804573971778, -0.10224302553882202, 0.014600274727369349, -0.1084239666039745, -0.17876582026171187, 0.05923144618670146, 0.20899469768628479, -0.22245692703751654, -0.2718753094474475, 0.02280239840038121, -0.2405361071228981, -0.16516774809764076, 0.2152565958055978, -0.018682039498041075, 0.032081221664945286, -0.0100985378647844, 0.08449724499757091, -0.07373664903764923, -0.3189444623887539, 0.35698215924203397, -0.05878259486829241, 0.12413570151353875, 0.040598926972597836, 0.1210316194842259, 0.05262244699212412, 0.010077495003739993, 0.020138866974351306, -0.12888524007673066, 0.14250456790129343, 0.24303750097751617, 0.22124286224134265, 0.2880063256869713, -0.40873569746812183, -0.08599682431668043, 0.19381139948964118, 0.14080143092821043, 0.0026463149193053444, -0.06993816490673149, -0.24990194675823052, 0.13990170809750754, -0.1561955499773224, -0.16518336554678778, -0.04995919200591743, 0.11695126519383242, 0.09407774327943723, -0.4089844306310018, 0.009128360124304891, 0.017093508938948312, 0.10256991004571318, 0.04859148116471867, -0.20985853091503184, 0.03840677831321955, 0.0921872737351805, -0.12122299956778686, 0.08276368335743124, -0.03235516310669482, -0.08705026193832358, -0.161509355607753, 0.3237580252190431, -0.04671652565399806, -0.2813295541952054, 0.017142137271972994, -0.17968637420174977, -0.17021087383230527, 0.11584770927826564, 0.16741875481481353, 0.1881797516097625, -0.07955746262644728, 0.10375951938331127, -0.1674982087376217, 0.11994567457586527, 0.13920713504776358, 0.010806356774022181, 0.2086248178035021, 0.018091018746296563, 0.06537014856003225, 0.24777750437691187, 0.039991346971752745, 0.04071074384264648, -0.3670471018801133, -0.2366334067036708, -0.3360624220222235, 0.23237744892636936, -0.15651068670364718, -0.21827959486593804, 0.41377072806159654, 0.04753098404034972, 0.21728364309916895, 0.18184330683822433, 0.19232960895945628, 0.191340816176186, 0.016993091938396297, 0.0036116995848715304, 0.006209085136651993, 0.18016449180431665, -0.0617845315951854, -0.1423561591344575, 0.08641561252685885, 0.22270202569973965] |
1,802.08444 | Deterministic factoring with oracles | We revisit the problem of integer factorization with number-theoretic
oracles, including a well-known problem: can we factor an integer $N$
unconditionally, in deterministic polynomial time, given the value of the Euler
totient $$\Phi$(N)$? We show that this can be done, under certain size
conditions on the prime factors of N. The key technique is lattice basis
reduction using the LLL algorithm. Among our results, we show for example that
if $N$ is a squarefree integer with a prime factor $p > $\sqrt$ N$ , then we
can recover p in deterministic polynomial time given $$\Phi$(N)$. We also shed
some light on the analogous problems for Carmichael's function, and the order
oracle that is used in Shor's quantum factoring algorithm.
| math.NT cs.CC | we revisit the problem of integer factorization with numbertheoretic oracles including a wellknown problem can we factor an integer n unconditionally in deterministic polynomial time given the value of the euler totient phin we show that this can be done under certain size conditions on the prime factors of n the key technique is lattice basis reduction using the lll algorithm among our results we show for example that if n is a squarefree integer with a prime factor p sqrt n then we can recover p in deterministic polynomial time given phin we also shed some light on the analogous problems for carmichaels function and the order oracle that is used in shors quantum factoring algorithm | [['we', 'revisit', 'the', 'problem', 'of', 'integer', 'factorization', 'with', 'numbertheoretic', 'oracles', 'including', 'a', 'wellknown', 'problem', 'can', 'we', 'factor', 'an', 'integer', 'n', 'unconditionally', 'in', 'deterministic', 'polynomial', 'time', 'given', 'the', 'value', 'of', 'the', 'euler', 'totient', 'phin', 'we', 'show', 'that', 'this', 'can', 'be', 'done', 'under', 'certain', 'size', 'conditions', 'on', 'the', 'prime', 'factors', 'of', 'n', 'the', 'key', 'technique', 'is', 'lattice', 'basis', 'reduction', 'using', 'the', 'lll', 'algorithm', 'among', 'our', 'results', 'we', 'show', 'for', 'example', 'that', 'if', 'n', 'is', 'a', 'squarefree', 'integer', 'with', 'a', 'prime', 'factor', 'p', 'sqrt', 'n', 'then', 'we', 'can', 'recover', 'p', 'in', 'deterministic', 'polynomial', 'time', 'given', 'phin', 'we', 'also', 'shed', 'some', 'light', 'on', 'the', 'analogous', 'problems', 'for', 'carmichaels', 'function', 'and', 'the', 'order', 'oracle', 'that', 'is', 'used', 'in', 'shors', 'quantum', 'factoring', 'algorithm']] | [-0.17582382381551415, 0.09723805699760639, -0.13258011501409814, 0.0804734772696104, -0.037858639718391575, -0.19561888777022052, 0.02711439182639568, 0.33332668459759307, -0.33365477502951, -0.2798565061938049, 0.06041743730604808, -0.23911465699466056, -0.1979380386053688, 0.22457505823869225, -0.0540071911791451, 0.13743990428077105, 0.03202669921482348, 0.05526441228217804, -0.03166329245576555, -0.3754710583265027, 0.31789015380180097, -0.020264300566493, 0.14687062298449186, 0.05560933084288835, 0.08347111980781023, 0.01996382087883022, 0.03319954320501823, 0.014885924274945615, -0.14415204671750584, 0.0482058294941313, 0.27395460137532246, 0.15534388715735611, 0.28201917031358004, -0.40945266605888164, -0.08914941102743913, 0.19676794777186507, 0.15853104119300523, 0.08557134571397661, -0.025032418123327006, -0.17862015912253568, 0.153378584380381, -0.09118349987090144, -0.12707358741392502, -0.0672301685787801, 0.057340466361652076, 0.014979805821218552, -0.356394506425748, 0.008211055800117727, 0.08028561488375004, 0.03599867897713159, -0.0011460307476102796, -0.21850807442226344, 0.12264701739375472, 0.0425930325833396, 0.0025385136011605845, 0.0680090568235351, 0.04498674480929079, -0.11233279093280116, -0.1687570858078125, 0.37616460969369125, -0.06499871514980386, -0.22245473252275053, 0.06600410132231112, -0.12047474365930161, -0.18550280653264645, 0.08972163448054503, 0.15520599864136714, 0.13625851921880475, -0.006211820130164807, 0.16954009308883697, -0.16685527303598374, 0.2207083358373652, 0.10139364392982207, 0.0033742113428938594, 0.06507494559304582, 0.10590798781118077, 0.07275594770908356, 0.1727046639067479, -0.02145114679160154, -0.032273586600636825, -0.3297091849560205, -0.190304974738795, -0.24727796436024782, 0.12239305404389006, -0.15939010536030998, -0.1115669802738688, 0.3375857017454731, 0.12698648835763207, 0.17468128745761524, 0.13362599704733008, 0.2713264130119585, 0.1877288377065705, 0.01108379334083989, 0.1226490912003777, 0.09611935525636077, 0.07990064020029819, 0.005669426730173266, -0.22889668371082625, 0.06327803757312334, 0.1632664631256181] |
1,802.08445 | A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary
Report | The assignment of weights to attacks in a classical Argumentation Framework
allows to compute semantics by taking into account the different importance of
each argument. We represent a Weighted Argumentation Framework by a non-binary
matrix, and we characterize the basic extensions (such as w-admissible, w-
stable, w-complete) by analysing sub-blocks of this matrix. Also, we show how
to reduce the matrix into another one of smaller size, that is equivalent to
the original one for the determination of extensions. Furthermore, we provide
two algorithms that allow to build incrementally w-grounded and w-preferred
extensions starting from a w-admissible extension.
| cs.AI | the assignment of weights to attacks in a classical argumentation framework allows to compute semantics by taking into account the different importance of each argument we represent a weighted argumentation framework by a nonbinary matrix and we characterize the basic extensions such as wadmissible w stable wcomplete by analysing subblocks of this matrix also we show how to reduce the matrix into another one of smaller size that is equivalent to the original one for the determination of extensions furthermore we provide two algorithms that allow to build incrementally wgrounded and wpreferred extensions starting from a wadmissible extension | [['the', 'assignment', 'of', 'weights', 'to', 'attacks', 'in', 'a', 'classical', 'argumentation', 'framework', 'allows', 'to', 'compute', 'semantics', 'by', 'taking', 'into', 'account', 'the', 'different', 'importance', 'of', 'each', 'argument', 'we', 'represent', 'a', 'weighted', 'argumentation', 'framework', 'by', 'a', 'nonbinary', 'matrix', 'and', 'we', 'characterize', 'the', 'basic', 'extensions', 'such', 'as', 'wadmissible', 'w', 'stable', 'wcomplete', 'by', 'analysing', 'subblocks', 'of', 'this', 'matrix', 'also', 'we', 'show', 'how', 'to', 'reduce', 'the', 'matrix', 'into', 'another', 'one', 'of', 'smaller', 'size', 'that', 'is', 'equivalent', 'to', 'the', 'original', 'one', 'for', 'the', 'determination', 'of', 'extensions', 'furthermore', 'we', 'provide', 'two', 'algorithms', 'that', 'allow', 'to', 'build', 'incrementally', 'wgrounded', 'and', 'wpreferred', 'extensions', 'starting', 'from', 'a', 'wadmissible', 'extension']] | [-0.04084238733508085, 0.07162629122796811, -0.10806657287635302, 0.09831007713402964, -0.09525263225169558, -0.16051434660820585, 0.06778843519522955, 0.34823597663229233, -0.30329404145871336, -0.2723430928872212, 0.09549703765170355, -0.23302425520853018, -0.1521612430260958, 0.15139544485627035, -0.06946211581020371, 0.013833660848046605, 0.051969409131101874, 0.039032248452023945, -0.09282786590292265, -0.23596328445955328, 0.3231222271208504, 5.073101553869875e-05, 0.21528051928862146, 0.014312367239280751, 0.08876418681098393, 0.07512872462209902, -0.05584313122457579, 0.04940973673211901, -0.10490760686638839, 0.1749109114887879, 0.2713121051704021, 0.20915105888423952, 0.3028403588423603, -0.42696005510852525, -0.1664088303161981, 0.11055697377673106, 0.11083050997143513, 0.12958179148692198, 0.011630966906484805, -0.26787077875954934, 0.15670250403743827, -0.2074141128037713, -0.09760125472553466, -0.09546786208244923, 0.01908060942506908, -0.0036433283680755843, -0.2755523229311956, -0.04945138368148994, 0.10167114101350308, -0.028542892497621083, -0.06331177400976518, -0.13238585565827396, 0.02255493452478396, 0.12232656369083807, 0.021589304396490518, -0.030048223280985106, 0.09782199372145298, -0.040347138816784874, -0.14254984958342423, 0.3835891247972062, -0.07196199854982918, -0.22896762455470468, 0.1318774949857279, -0.04423139432543202, -0.15444455856065217, 0.08672957418388443, 0.1732832540806971, 0.06839141239853282, -0.131278988954268, 0.07314079773342727, -0.05837342210702206, 0.14870112656468623, 0.05390638176743921, 0.026617852220998, 0.17248471208701008, 0.1542655157041736, 0.07549148738188179, 0.19480185571469757, -0.01953560255075756, -0.11354589917157826, -0.2829194538393303, -0.17113238190741917, -0.13016017740592362, 0.01218012837987197, -0.11029952702228911, -0.14670659910495343, 0.4489871195272396, 0.21432171982749806, 0.24328243067782176, 0.09149148429890996, 0.3007274324662591, 0.09295317491295894, 0.10840737903184307, 0.0628055231131025, 0.14244210663447646, 0.16782285721825535, 0.026211292288070055, -0.15988038290341042, 0.060185629908779736, 0.12568329042313914] |
1,802.08446 | Plasmonic modes in nanowire dimers: A study based on the hydrodynamic
Drude model including nonlocal and nonlinear effects | A combined analytical and numerical study of the modes in two distinct
plasmonic nanowire systems is presented. The computations are based on a
Discontinuous Galerkin Time-Domain approach and a fully nonlinear and nonlocal
hydrodynamic Drude model for the metal is utilized. In the linear regime, these
computations demonstrate the strong influence of nonlocality on the field
distributions as well as on the scattering and absorption spectra. Based on
these results, second-harmonic generation efficiencies are computed over a
frequency range that covers all relevant modes of the linear spectra. In order
to interprete the physical mechanisms that lead to corresponding field
distributions, the associated linear quasi-electrostatic problem is solved
analytically via conformal transformation techniques. This provides an
intuitive classification of the linear excitations of the systems that is then
applied to the full Maxwell case. Based on this classification, group theory
facilitates the determination of the selection rules for the efficient
excitation of modes, both in the linear and the nonlinear regime. This leads to
significantly enhanced second-harmonic generation via judiciously exploiting
the system symmetries. These results regarding the mode structure and
second-harmonic generation are of direct relevance to other nano-antenna
systems.
| physics.optics | a combined analytical and numerical study of the modes in two distinct plasmonic nanowire systems is presented the computations are based on a discontinuous galerkin timedomain approach and a fully nonlinear and nonlocal hydrodynamic drude model for the metal is utilized in the linear regime these computations demonstrate the strong influence of nonlocality on the field distributions as well as on the scattering and absorption spectra based on these results secondharmonic generation efficiencies are computed over a frequency range that covers all relevant modes of the linear spectra in order to interprete the physical mechanisms that lead to corresponding field distributions the associated linear quasielectrostatic problem is solved analytically via conformal transformation techniques this provides an intuitive classification of the linear excitations of the systems that is then applied to the full maxwell case based on this classification group theory facilitates the determination of the selection rules for the efficient excitation of modes both in the linear and the nonlinear regime this leads to significantly enhanced secondharmonic generation via judiciously exploiting the system symmetries these results regarding the mode structure and secondharmonic generation are of direct relevance to other nanoantenna systems | [['a', 'combined', 'analytical', 'and', 'numerical', 'study', 'of', 'the', 'modes', 'in', 'two', 'distinct', 'plasmonic', 'nanowire', 'systems', 'is', 'presented', 'the', 'computations', 'are', 'based', 'on', 'a', 'discontinuous', 'galerkin', 'timedomain', 'approach', 'and', 'a', 'fully', 'nonlinear', 'and', 'nonlocal', 'hydrodynamic', 'drude', 'model', 'for', 'the', 'metal', 'is', 'utilized', 'in', 'the', 'linear', 'regime', 'these', 'computations', 'demonstrate', 'the', 'strong', 'influence', 'of', 'nonlocality', 'on', 'the', 'field', 'distributions', 'as', 'well', 'as', 'on', 'the', 'scattering', 'and', 'absorption', 'spectra', 'based', 'on', 'these', 'results', 'secondharmonic', 'generation', 'efficiencies', 'are', 'computed', 'over', 'a', 'frequency', 'range', 'that', 'covers', 'all', 'relevant', 'modes', 'of', 'the', 'linear', 'spectra', 'in', 'order', 'to', 'interprete', 'the', 'physical', 'mechanisms', 'that', 'lead', 'to', 'corresponding', 'field', 'distributions', 'the', 'associated', 'linear', 'quasielectrostatic', 'problem', 'is', 'solved', 'analytically', 'via', 'conformal', 'transformation', 'techniques', 'this', 'provides', 'an', 'intuitive', 'classification', 'of', 'the', 'linear', 'excitations', 'of', 'the', 'systems', 'that', 'is', 'then', 'applied', 'to', 'the', 'full', 'maxwell', 'case', 'based', 'on', 'this', 'classification', 'group', 'theory', 'facilitates', 'the', 'determination', 'of', 'the', 'selection', 'rules', 'for', 'the', 'efficient', 'excitation', 'of', 'modes', 'both', 'in', 'the', 'linear', 'and', 'the', 'nonlinear', 'regime', 'this', 'leads', 'to', 'significantly', 'enhanced', 'secondharmonic', 'generation', 'via', 'judiciously', 'exploiting', 'the', 'system', 'symmetries', 'these', 'results', 'regarding', 'the', 'mode', 'structure', 'and', 'secondharmonic', 'generation', 'are', 'of', 'direct', 'relevance', 'to', 'other', 'nanoantenna', 'systems']] | [-0.12288571339519938, 0.08666018211821896, -0.06295077080462927, 0.02870427433484239, -0.08122046000241297, -0.10227729548841559, 0.016561360798132512, 0.3891197659065508, -0.2681609619876945, -0.24705135950048243, 0.08641700057741937, -0.2612013057994544, -0.1687795850253269, 0.24532134084187018, 0.02796475119225642, 0.08110572023717053, 0.03388260514353504, -0.027442111205845995, -0.05047334550211879, -0.18423941166686256, 0.3229558536105092, 0.05278081244043031, 0.3415512296210253, 0.0484885183133731, 0.08716676953609506, 0.01785506653911507, -0.02838667758608832, 0.0007207924134405183, -0.09908843143651577, 0.13363310462778133, 0.25163994612006463, 0.03448570072309587, 0.23243973789253902, -0.4259717241709769, -0.2357066559693069, 0.027825392348721077, 0.14618359306822312, 0.14851913008721868, -0.04898871324836954, -0.25172822851156185, 0.06788125683928972, -0.13955251326317003, -0.08843580320848064, -0.10913613010246638, -0.03931301618506888, 0.021743467772447782, -0.2992846571943352, 0.07568838021050787, 0.07248130648979595, 0.03984602969334856, -0.06798681187692113, -0.07993048530362099, -0.02443541678434228, 0.08477222632753287, 0.013402639727298804, -0.0470530435513627, 0.1043033339774982, -0.13885865090000418, -0.14528465104479518, 0.4041823833907774, -0.09039326266358796, -0.20995169532203714, 0.21354900300380877, -0.12989603470601335, -0.06295818750836754, 0.1397638466886942, 0.20096250190868906, 0.1504487268948508, -0.12491551742868263, 0.053541304883108286, -0.01104480028883871, 0.1683876638907783, 0.0346830272681387, 0.07132638666135166, 0.20408137379633506, 0.15489928312940981, 0.022506665431099568, 0.13191949091248303, -0.06592150690937318, -0.0761197537515332, -0.3081101716023075, -0.11047450130066654, -0.17259811520858678, -0.013572366988647203, -0.08100023554730673, -0.15372349834801013, 0.4372928776797785, 0.1401919887399792, 0.15190297151145926, 0.04220865854471727, 0.29188150240849525, 0.19231339598791333, 0.08045764313766937, 0.009995330356705094, 0.2913686488614861, 0.17640636423944023, 0.08704774248589278, -0.3095834078431783, 0.0034521568453192947, 0.06466478202065346] |
1,802.08447 | Luminosity of a collider with asymmetric beams | A formula for the collider luminosity is derived for a head-on collision of
two beams with different parameters. Three particular cases are presented: the
collision of two identical axially symmetric bunches, the collision of a bunch
with a coasting beam, and the collision of two coasting beams. The colliding
beams have coinciding longitudinal axes. The formula is valid for colliding
both counter propagating and co-propagating ("merging") beams.
| physics.acc-ph | a formula for the collider luminosity is derived for a headon collision of two beams with different parameters three particular cases are presented the collision of two identical axially symmetric bunches the collision of a bunch with a coasting beam and the collision of two coasting beams the colliding beams have coinciding longitudinal axes the formula is valid for colliding both counter propagating and copropagating merging beams | [['a', 'formula', 'for', 'the', 'collider', 'luminosity', 'is', 'derived', 'for', 'a', 'headon', 'collision', 'of', 'two', 'beams', 'with', 'different', 'parameters', 'three', 'particular', 'cases', 'are', 'presented', 'the', 'collision', 'of', 'two', 'identical', 'axially', 'symmetric', 'bunches', 'the', 'collision', 'of', 'a', 'bunch', 'with', 'a', 'coasting', 'beam', 'and', 'the', 'collision', 'of', 'two', 'coasting', 'beams', 'the', 'colliding', 'beams', 'have', 'coinciding', 'longitudinal', 'axes', 'the', 'formula', 'is', 'valid', 'for', 'colliding', 'both', 'counter', 'propagating', 'and', 'copropagating', 'merging', 'beams']] | [-0.2059360536843983, 0.22807783322102987, -0.1245755942593982, 0.0954841097239961, 0.028937167418536854, -0.19885243408715547, -0.14241833617187924, 0.4549064060200506, -0.156277097534013, -0.256563359760304, 0.01682304902308023, -0.30996612709627225, 0.12176575916193759, 0.22262284090158654, 0.09827149243775143, 0.08075406692866514, 0.12572287253465558, -0.01856897753288052, -0.07469358999949338, -0.1549755925340439, 0.34305369859533524, 0.0855632934670673, 0.28410831263372255, 0.00019243811326685238, 0.1861473224959823, 0.06474455058185467, 0.028547239559355068, -0.026372239120295245, -0.08280342066688325, 0.055415782934999956, 0.20255016271414153, 0.07791704350192823, 0.17860416532754758, -0.44226986681347463, -0.14877510292511156, 0.041571447111443796, 0.1843825216377293, 0.1380820063901926, -0.1168220501198475, -0.22106602387641794, -0.03653409087391042, -0.2546140078538612, -0.23058440750325793, 0.08340699178402994, 0.07439513521185562, 0.14649614848113104, -0.31186248705402686, 0.041130814961950056, 0.0213899110398714, 0.0263385841720251, -0.0570680063370782, -0.08954325351697295, -0.025258376721793145, -0.02057367385323368, 0.09668754878690217, -0.008118368379438102, 0.11796255787806724, -0.07615686870360774, -0.14245162351029134, 0.4015918663188593, 0.059008931935723145, -0.1592523503436971, 0.22200302968371605, -0.21429039457284693, 0.020704114587226912, 0.2101045867650589, 0.2305309455563773, 0.1079270921494645, -0.13771155479176442, -0.07021203815221175, -0.02955475624706318, 0.05330347577492192, 0.28444146028886647, -0.011074163273338284, 0.24069670262510207, 0.12908935342192537, 0.02127810920164712, 0.15251754018575397, -0.16898930017183075, -0.0787296422493102, -0.4102078268109863, -0.08654726291450658, -0.11000496793343727, -0.04916576707541053, -0.07812177446113079, -0.08123348218235951, 0.38151318882939533, 0.028600423695513483, 0.20290546260996542, -0.022809322617614446, 0.3190690030190927, 0.11182481085242175, -0.0032729942837222688, 0.07871690513492291, 0.29412377317116334, 0.15918104094800664, 0.11462404795769435, -0.23207654820671722, -0.03603932663881734, 0.022252574549126092] |
1,802.08448 | On the vibron nature in the system of two parallel macromolecular
chains: the influence of interchain coupling | We studied the properties of the intramolecular vibrational excitation
(vibron) at finite temperature in a system which consists of two parallel
macromolecular chains. It was assumed that vibron interacts exclusively with
dispersionless optical phonons and the whole system is considered to be in
thermal equilibrium. Particular attention has been paid to the examination of
the impact of the temperature and strength of the interchain coupling on the
\emph{small polaron} crossover. For that purpose we employed partial dressing
method which enables the study of the degree of the phonon dressing of the
vibron excitations in a wide area of system parameter space. We found that in
the non--adiabatic regime the degree of dressing as a function of coupling
constant continuously increases reflecting the smooth transition of the
slightly dressed, practically free vibron, to a heavily dressed one: small
polaron. As "adiabaticity" rises this transition becomes increasingly steeper,
and finally, in the adiabatic limit, a discontinuous "jump" of the degree of
dressing is observed. The interchain coupling manifests itself through the
increase of the effective adiabatic parameter of the system.
| cond-mat.mes-hall cond-mat.soft physics.bio-ph quant-ph | we studied the properties of the intramolecular vibrational excitation vibron at finite temperature in a system which consists of two parallel macromolecular chains it was assumed that vibron interacts exclusively with dispersionless optical phonons and the whole system is considered to be in thermal equilibrium particular attention has been paid to the examination of the impact of the temperature and strength of the interchain coupling on the emphsmall polaron crossover for that purpose we employed partial dressing method which enables the study of the degree of the phonon dressing of the vibron excitations in a wide area of system parameter space we found that in the nonadiabatic regime the degree of dressing as a function of coupling constant continuously increases reflecting the smooth transition of the slightly dressed practically free vibron to a heavily dressed one small polaron as adiabaticity rises this transition becomes increasingly steeper and finally in the adiabatic limit a discontinuous jump of the degree of dressing is observed the interchain coupling manifests itself through the increase of the effective adiabatic parameter of the system | [['we', 'studied', 'the', 'properties', 'of', 'the', 'intramolecular', 'vibrational', 'excitation', 'vibron', 'at', 'finite', 'temperature', 'in', 'a', 'system', 'which', 'consists', 'of', 'two', 'parallel', 'macromolecular', 'chains', 'it', 'was', 'assumed', 'that', 'vibron', 'interacts', 'exclusively', 'with', 'dispersionless', 'optical', 'phonons', 'and', 'the', 'whole', 'system', 'is', 'considered', 'to', 'be', 'in', 'thermal', 'equilibrium', 'particular', 'attention', 'has', 'been', 'paid', 'to', 'the', 'examination', 'of', 'the', 'impact', 'of', 'the', 'temperature', 'and', 'strength', 'of', 'the', 'interchain', 'coupling', 'on', 'the', 'emphsmall', 'polaron', 'crossover', 'for', 'that', 'purpose', 'we', 'employed', 'partial', 'dressing', 'method', 'which', 'enables', 'the', 'study', 'of', 'the', 'degree', 'of', 'the', 'phonon', 'dressing', 'of', 'the', 'vibron', 'excitations', 'in', 'a', 'wide', 'area', 'of', 'system', 'parameter', 'space', 'we', 'found', 'that', 'in', 'the', 'nonadiabatic', 'regime', 'the', 'degree', 'of', 'dressing', 'as', 'a', 'function', 'of', 'coupling', 'constant', 'continuously', 'increases', 'reflecting', 'the', 'smooth', 'transition', 'of', 'the', 'slightly', 'dressed', 'practically', 'free', 'vibron', 'to', 'a', 'heavily', 'dressed', 'one', 'small', 'polaron', 'as', 'adiabaticity', 'rises', 'this', 'transition', 'becomes', 'increasingly', 'steeper', 'and', 'finally', 'in', 'the', 'adiabatic', 'limit', 'a', 'discontinuous', 'jump', 'of', 'the', 'degree', 'of', 'dressing', 'is', 'observed', 'the', 'interchain', 'coupling', 'manifests', 'itself', 'through', 'the', 'increase', 'of', 'the', 'effective', 'adiabatic', 'parameter', 'of', 'the', 'system']] | [-0.18471629511868434, 0.21516440470776196, -0.057829366545611466, 0.02534940164651345, -0.041863127312036966, -0.1275833590149754, 0.07085980229822689, 0.358041424973962, -0.2559480079439249, -0.2354145802850469, 0.010998148344891419, -0.25414985068288914, -0.10690108013831162, 0.16817816347406989, 0.04983442254348794, 0.008207542921175783, 0.0025749571119131668, 0.04105368767357484, -0.04208520319563954, -0.1914640935667623, 0.3260109457972177, 0.05388866219763759, 0.29670451087563227, 0.10223059048039022, 0.09825209816499206, 0.019362860288617483, 0.07438754801523317, -0.008887173945582576, -0.13015380758052958, 0.06924053584487083, 0.22129654990027794, -0.03283443316696944, 0.2635250217804497, -0.3651456751473499, -0.20511880005824934, 0.06048942688235155, 0.18874978776524115, 0.15739027807211733, 0.012334377555898652, -0.24358629266302403, -0.03090419805231975, -0.17521869173635443, -0.16274212314904238, -0.064475709977926, 0.025951362910858367, 0.023560509461061925, -0.23302529014783044, 0.09288830618198118, 0.052746428469761034, 0.04858791134503325, -0.06049393100684948, -0.06337504228446214, -0.08753525618244004, 0.10126052831111246, 0.05456158528470675, 0.04548718572889842, 0.17794837693035018, -0.13723326483715242, -0.0027330838944344374, 0.37931728282462013, -0.10841991571517232, -0.136123816911759, 0.1994603071492584, -0.1532126001796549, -0.09578108367542187, 0.19833392101821354, 0.1154530505388792, 0.12054792786372846, -0.12392701150514604, 0.12135905786214679, 0.023053669852068585, 0.19194873067513737, 0.05837399045298441, 0.06252562499793476, 0.16643508920986258, 0.18139668616722598, 0.03928246698603871, 0.2002844617282187, -0.07392991944922532, -0.13625417917893592, -0.2539670664471773, -0.12437110210852592, -0.22407923274924665, 0.05110539867558381, -0.0822006017240281, -0.20089733374064392, 0.4312577565551181, 0.12507708776406054, 0.19509896961187295, -0.005654212534741572, 0.24614298328746823, 0.1917039803461449, 0.08006811970805623, 0.0022103759104365045, 0.2844164491306697, 0.16748559368601634, 0.0993499837480904, -0.3509505828044618, 0.031514784861408345, 0.03622929204328593] |
1,802.08449 | Possible charge-density-wave signatures in the anomalous resistivity of
Li-intercalated multilayer MoS2 | We fabricate ion-gated field-effect transistors (iFET) on mechanically
exfoliated multilayer MoS$_2$. We encapsulate the flake by Al$_2$O$_3$, leaving
the device channel exposed at the edges only. A stable Li$^+$ intercalation in
the MoS$_2$ lattice is induced by gating the samples with a Li-based polymeric
electrolyte above $\sim$ 330 K and the doping state is fixed by quenching the
device to $\sim$ 300 K. This intercalation process induces the emergence of
anomalies in the temperature dependence of the sheet resistance and its first
derivative, which are typically associated with structural/electronic/magnetic
phase transitions. We suggest that these anomalies in the resistivity of
MoS$_2$ can be naturally interpreted as the signature of a transition to a
charge-density-wave phase induced by lithiation, in accordance with recent
theoretical calculations.
| cond-mat.mes-hall cond-mat.mtrl-sci | we fabricate iongated fieldeffect transistors ifet on mechanically exfoliated multilayer mos_2 we encapsulate the flake by al_2o_3 leaving the device channel exposed at the edges only a stable li intercalation in the mos_2 lattice is induced by gating the samples with a libased polymeric electrolyte above sim 330 k and the doping state is fixed by quenching the device to sim 300 k this intercalation process induces the emergence of anomalies in the temperature dependence of the sheet resistance and its first derivative which are typically associated with structuralelectronicmagnetic phase transitions we suggest that these anomalies in the resistivity of mos_2 can be naturally interpreted as the signature of a transition to a chargedensitywave phase induced by lithiation in accordance with recent theoretical calculations | [['we', 'fabricate', 'iongated', 'fieldeffect', 'transistors', 'ifet', 'on', 'mechanically', 'exfoliated', 'multilayer', 'mos_2', 'we', 'encapsulate', 'the', 'flake', 'by', 'al_2o_3', 'leaving', 'the', 'device', 'channel', 'exposed', 'at', 'the', 'edges', 'only', 'a', 'stable', 'li', 'intercalation', 'in', 'the', 'mos_2', 'lattice', 'is', 'induced', 'by', 'gating', 'the', 'samples', 'with', 'a', 'libased', 'polymeric', 'electrolyte', 'above', 'sim', '330', 'k', 'and', 'the', 'doping', 'state', 'is', 'fixed', 'by', 'quenching', 'the', 'device', 'to', 'sim', '300', 'k', 'this', 'intercalation', 'process', 'induces', 'the', 'emergence', 'of', 'anomalies', 'in', 'the', 'temperature', 'dependence', 'of', 'the', 'sheet', 'resistance', 'and', 'its', 'first', 'derivative', 'which', 'are', 'typically', 'associated', 'with', 'structuralelectronicmagnetic', 'phase', 'transitions', 'we', 'suggest', 'that', 'these', 'anomalies', 'in', 'the', 'resistivity', 'of', 'mos_2', 'can', 'be', 'naturally', 'interpreted', 'as', 'the', 'signature', 'of', 'a', 'transition', 'to', 'a', 'chargedensitywave', 'phase', 'induced', 'by', 'lithiation', 'in', 'accordance', 'with', 'recent', 'theoretical', 'calculations']] | [-0.165312560258021, 0.2196744059968251, -0.023769571962117476, -0.08411807835630901, -0.00935137430473124, -0.1698462806955041, 0.1485263815027524, 0.41430374845045576, -0.2727774698134573, -0.29266419480020395, 0.006395733522129108, -0.3447762596741563, -0.15680264993799758, 0.1352016081189981, 0.0036270331942522137, 0.015367731447694212, -0.028654196986653765, -0.06481136734307301, -0.10163383952105326, -0.198043554654864, 0.2498113792494596, 0.06274202450361775, 0.2992488436771129, 0.09929015247349735, 0.02991124505146605, -0.06142781086296576, 0.13910557945719568, 0.041727096010304866, -0.16107630447445667, 0.02343516468192588, 0.2535477993612895, -0.12628311605276693, 0.19956914552288954, -0.4592778064371621, -0.2518313306032634, -0.029016797563450443, 0.08346394430006258, 0.11922753167426457, -0.08007262875879427, -0.26735621880831534, 0.12393480161592349, -0.13381650340056322, -0.050291144522861195, -0.050010488818964506, -0.013671162034400174, -0.03883733245406727, -0.22400471207029263, 0.10738458666858859, 0.04885291841575784, 0.058656449194415, -0.08737177986243251, -0.13860653075977605, -0.11059677055235341, 0.027257862363438138, 0.02840552072314599, 0.05323220887145058, 0.2640495938668791, -0.09253783100337118, -0.09481719449223554, 0.35176886741804786, -0.09869007963198619, -0.04639810972587496, 0.15547268838119754, -0.17807287375488487, -0.05067847113098308, 0.18393573256239729, 0.08241487120385052, 0.11067944281490245, -0.1499539660976925, 0.05022894452826013, 0.007549833050226701, 0.16619405846615307, 0.10649175664837487, 0.03622362836737369, 0.2489740588610656, 0.2386894203096506, 0.019873677668940336, 0.1331372224462417, -0.11198087092193194, 0.012404840851782775, -0.23724156440417932, -0.19671863804525527, -0.18923996445402258, 0.1315413136474147, -0.09011208286130092, -0.17781621552851112, 0.39046398573984453, 0.1326672015616243, 0.24554357938773808, -0.061107330805751814, 0.23017539431676878, 0.10051318241348185, 0.11725128404261759, 0.009982865559486825, 0.22803716504274577, 0.18565682064146413, 0.11484060775809234, -0.25723871547866184, 0.12950469281803054, -0.021334847275045563] |
1,802.0845 | Stark points and Hida-Rankin p-adic L-function | This article is devoted to the elliptic Stark conjecture formulated by
Darmon, Lauder and Rotger [DLR], which proposes a formula for the
transcendental part of a $p$-adic avatar of the leading term at $s=1$ of the
Hasse-Weil-Artin $L$-series $L(E,\varrho_1\otimes \varrho_2,s)$ of an elliptic
curve $E$ twisted by the tensor product $\varrho_1\otimes \varrho_2$ of two odd
$2$-dimensional Artin representations, when the order of vanishing is two. The
main ingredient of this formula is a $2\times 2$ $p$-adic regulator involving
the $p$-adic formal group logarithm of suitable Stark points on $E$. This
conjecture was proved in [DLR] in the setting where $\varrho_1$ and $\varrho_2$
are induced from characters of the same imaginary quadratic field $K$. In this
note we prove a refinement of this result, that was discovered experimentally
in Remark 3.4 of [DLR] in a few examples. Namely, we are able to determine the
algebraic constant up to which the main theorem of [DLR] holds in a particular
setting where the Hida-Rankin $p$-adic $L$-function associated to a pair of
Hida families can be exploited to provide an alternative proof of the same
result. This constant encodes local and global invariants of both $E$ and $K$.
| math.NT | this article is devoted to the elliptic stark conjecture formulated by darmon lauder and rotger dlr which proposes a formula for the transcendental part of a padic avatar of the leading term at s1 of the hasseweilartin lseries levarrho_1otimes varrho_2s of an elliptic curve e twisted by the tensor product varrho_1otimes varrho_2 of two odd 2dimensional artin representations when the order of vanishing is two the main ingredient of this formula is a 2times 2 padic regulator involving the padic formal group logarithm of suitable stark points on e this conjecture was proved in dlr in the setting where varrho_1 and varrho_2 are induced from characters of the same imaginary quadratic field k in this note we prove a refinement of this result that was discovered experimentally in remark 34 of dlr in a few examples namely we are able to determine the algebraic constant up to which the main theorem of dlr holds in a particular setting where the hidarankin padic lfunction associated to a pair of hida families can be exploited to provide an alternative proof of the same result this constant encodes local and global invariants of both e and k | [['this', 'article', 'is', 'devoted', 'to', 'the', 'elliptic', 'stark', 'conjecture', 'formulated', 'by', 'darmon', 'lauder', 'and', 'rotger', 'dlr', 'which', 'proposes', 'a', 'formula', 'for', 'the', 'transcendental', 'part', 'of', 'a', 'padic', 'avatar', 'of', 'the', 'leading', 'term', 'at', 's1', 'of', 'the', 'hasseweilartin', 'lseries', 'levarrho_1otimes', 'varrho_2s', 'of', 'an', 'elliptic', 'curve', 'e', 'twisted', 'by', 'the', 'tensor', 'product', 'varrho_1otimes', 'varrho_2', 'of', 'two', 'odd', '2dimensional', 'artin', 'representations', 'when', 'the', 'order', 'of', 'vanishing', 'is', 'two', 'the', 'main', 'ingredient', 'of', 'this', 'formula', 'is', 'a', '2times', '2', 'padic', 'regulator', 'involving', 'the', 'padic', 'formal', 'group', 'logarithm', 'of', 'suitable', 'stark', 'points', 'on', 'e', 'this', 'conjecture', 'was', 'proved', 'in', 'dlr', 'in', 'the', 'setting', 'where', 'varrho_1', 'and', 'varrho_2', 'are', 'induced', 'from', 'characters', 'of', 'the', 'same', 'imaginary', 'quadratic', 'field', 'k', 'in', 'this', 'note', 'we', 'prove', 'a', 'refinement', 'of', 'this', 'result', 'that', 'was', 'discovered', 'experimentally', 'in', 'remark', '34', 'of', 'dlr', 'in', 'a', 'few', 'examples', 'namely', 'we', 'are', 'able', 'to', 'determine', 'the', 'algebraic', 'constant', 'up', 'to', 'which', 'the', 'main', 'theorem', 'of', 'dlr', 'holds', 'in', 'a', 'particular', 'setting', 'where', 'the', 'hidarankin', 'padic', 'lfunction', 'associated', 'to', 'a', 'pair', 'of', 'hida', 'families', 'can', 'be', 'exploited', 'to', 'provide', 'an', 'alternative', 'proof', 'of', 'the', 'same', 'result', 'this', 'constant', 'encodes', 'local', 'and', 'global', 'invariants', 'of', 'both', 'e', 'and', 'k']] | [-0.19985595360526412, 0.06201580164637774, -0.1401416467559381, 0.056960689195274083, -0.0668259043229261, -0.10767381877155492, 0.00113018083992222, 0.2511942744373329, -0.28980950817032153, -0.2711381082935505, 0.06636928964440746, -0.2261669600761875, -0.1435125569293088, 0.22776338503149057, -0.11692991676597447, 0.026060479057450143, -0.011229742394924094, 0.1075972256525703, -0.0527103592274543, -0.29993512386347726, 0.3724261570251276, -0.01787231123892876, 0.20687349831744556, 0.08524002766768847, 0.09991368909474836, 0.030590636387132306, -0.01931989435402174, -0.0714530086627713, -0.129942639747078, 0.17465443139133247, 0.3118196792811865, 0.02771615344789569, 0.25602335712586644, -0.36010280977836046, -0.1228890017699943, 0.16681076799366604, 0.10695803217175934, 0.03558844853335469, 0.008865545596804214, -0.2418047814536347, 0.11765510063906688, -0.1833609405599495, -0.18397479468867892, -0.04791105993673521, 0.04722713286897276, 0.0030393497032857445, -0.28038961419259156, 0.038320258313977215, 0.11993380250635917, 0.1317058747496318, -0.08301026487683572, -0.11575998079768388, 0.014372540817709355, 0.06986722398611529, 0.052834502279650045, 0.08518780842571268, 0.04117079279767399, -0.08283698175437551, -0.10719832336953866, 0.3670188417589223, -0.09372807014302385, -0.1429201760316987, 0.10800597538787221, -0.1543277229586488, -0.1647360652152981, 0.10978923891252153, 0.10533534220257212, 0.16481011269445328, -0.07122022796475523, 0.15552561281855026, -0.11551478169886173, 0.08850998390975985, 0.117822106582699, -0.05895680035144169, 0.1284800381867816, 0.04320733251404904, 0.066802681379375, 0.1724247684223065, -0.009827049120782663, -0.06685971112911979, -0.3523272657840853, -0.20776970299865025, -0.15809728112441326, 0.11950989713751903, -0.08003944565792119, -0.14304694735381024, 0.39268365707347, 0.08474240687099241, 0.20611279574623234, 0.0900888905279023, 0.22213626424560234, 0.1398741490978787, 0.053335544123516355, 0.03873104551128265, 0.15478612603767525, 0.18841093130872916, 0.042368240528813904, -0.16176163179479003, -0.00869555369656405, 0.16915118168034252] |
1,802.08451 | Kinematics, Turbulence and Star Formation of z ~1 Strongly Lensed
Galaxies seen with MUSE | We analyse a sample of 8 highly magnified galaxies at redshift 0.6<z<1.5
observed with MUSE, exploring the resolved properties of these galaxies at
sub-kiloparsec scales. Combining multi-band HST photometry and MUSE spectra, we
derive the stellar mass, global star formation rates, extinction and
metallicity from multiple nebular lines, concluding that our sample is
representative of z~1 star-forming galaxies. We derive the 2D kinematics of
these galaxies from the [OII] emission and model it with a new method that
accounts for lensing effects and fits multiple images simultaneously. We use
these models to calculate the 2D beam-smearing correction and derive intrinsic
velocity dispersion maps. We find them to be fairly homogeneous, with
relatively constant velocity dispersions between 15 - 80 km/s and Gini
coefficient of <0.3. We do not find any evidence for higher (or lower) velocity
dispersions at the positions of bright star-forming clumps. We derive resolved
maps of dust attenuation and attenuation-corrected star formation rates from
emission lines for two objects in the sample. We use this information to study
the relation between resolved star formation rate and velocity dispersion. We
find that these quantities are not correlated, and the high-velocity
dispersions found for relatively low star-forming densities seems to indicate
that, at sub-kiloparsec scales, turbulence in high-z discs is mainly dominated
by gravitational instability rather than stellar feedback.
| astro-ph.GA | we analyse a sample of 8 highly magnified galaxies at redshift 06z15 observed with muse exploring the resolved properties of these galaxies at subkiloparsec scales combining multiband hst photometry and muse spectra we derive the stellar mass global star formation rates extinction and metallicity from multiple nebular lines concluding that our sample is representative of z1 starforming galaxies we derive the 2d kinematics of these galaxies from the oii emission and model it with a new method that accounts for lensing effects and fits multiple images simultaneously we use these models to calculate the 2d beamsmearing correction and derive intrinsic velocity dispersion maps we find them to be fairly homogeneous with relatively constant velocity dispersions between 15 80 kms and gini coefficient of 03 we do not find any evidence for higher or lower velocity dispersions at the positions of bright starforming clumps we derive resolved maps of dust attenuation and attenuationcorrected star formation rates from emission lines for two objects in the sample we use this information to study the relation between resolved star formation rate and velocity dispersion we find that these quantities are not correlated and the highvelocity dispersions found for relatively low starforming densities seems to indicate that at subkiloparsec scales turbulence in highz discs is mainly dominated by gravitational instability rather than stellar feedback | [['we', 'analyse', 'a', 'sample', 'of', '8', 'highly', 'magnified', 'galaxies', 'at', 'redshift', '06z15', 'observed', 'with', 'muse', 'exploring', 'the', 'resolved', 'properties', 'of', 'these', 'galaxies', 'at', 'subkiloparsec', 'scales', 'combining', 'multiband', 'hst', 'photometry', 'and', 'muse', 'spectra', 'we', 'derive', 'the', 'stellar', 'mass', 'global', 'star', 'formation', 'rates', 'extinction', 'and', 'metallicity', 'from', 'multiple', 'nebular', 'lines', 'concluding', 'that', 'our', 'sample', 'is', 'representative', 'of', 'z1', 'starforming', 'galaxies', 'we', 'derive', 'the', '2d', 'kinematics', 'of', 'these', 'galaxies', 'from', 'the', 'oii', 'emission', 'and', 'model', 'it', 'with', 'a', 'new', 'method', 'that', 'accounts', 'for', 'lensing', 'effects', 'and', 'fits', 'multiple', 'images', 'simultaneously', 'we', 'use', 'these', 'models', 'to', 'calculate', 'the', '2d', 'beamsmearing', 'correction', 'and', 'derive', 'intrinsic', 'velocity', 'dispersion', 'maps', 'we', 'find', 'them', 'to', 'be', 'fairly', 'homogeneous', 'with', 'relatively', 'constant', 'velocity', 'dispersions', 'between', '15', '80', 'kms', 'and', 'gini', 'coefficient', 'of', '03', 'we', 'do', 'not', 'find', 'any', 'evidence', 'for', 'higher', 'or', 'lower', 'velocity', 'dispersions', 'at', 'the', 'positions', 'of', 'bright', 'starforming', 'clumps', 'we', 'derive', 'resolved', 'maps', 'of', 'dust', 'attenuation', 'and', 'attenuationcorrected', 'star', 'formation', 'rates', 'from', 'emission', 'lines', 'for', 'two', 'objects', 'in', 'the', 'sample', 'we', 'use', 'this', 'information', 'to', 'study', 'the', 'relation', 'between', 'resolved', 'star', 'formation', 'rate', 'and', 'velocity', 'dispersion', 'we', 'find', 'that', 'these', 'quantities', 'are', 'not', 'correlated', 'and', 'the', 'highvelocity', 'dispersions', 'found', 'for', 'relatively', 'low', 'starforming', 'densities', 'seems', 'to', 'indicate', 'that', 'at', 'subkiloparsec', 'scales', 'turbulence', 'in', 'highz', 'discs', 'is', 'mainly', 'dominated', 'by', 'gravitational', 'instability', 'rather', 'than', 'stellar', 'feedback']] | [-0.05106199164276755, 0.09083030149612978, -0.08053927536660788, 0.1335200381987523, -0.07818713328062019, -0.08183090271718732, 0.028429966111274418, 0.48749006389204513, -0.16734881972073826, -0.33635624844170764, 0.01463950621370021, -0.27602992205957483, -0.030493110085094192, 0.20019170582116103, 0.016203936364570067, -0.04085356182922874, 0.03184016729136843, -0.1587617737508097, -0.07022189409540135, -0.2677195966249084, 0.33098600087089275, 0.042567860841892076, 0.1947204626118337, -0.022345546750488495, 0.08531550482693, -0.12969915280033142, -0.11951908053949885, 0.00854312265217048, -0.22527213912543204, 0.0471339470668431, 0.22258398663584014, 0.09264804897594923, 0.20112566096674, -0.3149047222398897, -0.21059440242583435, 0.045867750881487555, 0.21966287813046861, 0.09879342545466839, -0.0799885540047165, -0.25746021347564707, 0.060699765443366124, -0.1346079903748741, -0.16870144844576374, 0.03240786256362607, 0.026710254984476323, 0.035733106065331706, -0.231062249058362, 0.21806959089622277, -0.021452688403777915, 0.12438417914742177, -0.13337085816855415, -0.06499518469027286, -0.1104057756361526, 0.08484975712634452, -0.020799878402613103, 0.026730073911219048, 0.18886385587847218, -0.16812090718170303, 0.034307770119176816, 0.40369870992368856, -0.08812555210450461, -0.02931267283685984, 0.2567218837815277, -0.2568911658194121, -0.18559624283219936, 0.156806486695065, 0.17693728907781422, 0.1048945061974078, -0.14974674470765398, -0.052417529889071626, -0.012366369956198636, 0.2329708428107151, 0.04517305248690376, 0.0981037180823778, 0.3139461244866594, 0.034707475103301196, 0.03273242494463066, 0.06735187726108136, -0.2542164552557109, -0.009973595307610177, -0.23747889271674574, -0.08863314385141391, -0.1078575517161997, 0.09162057602338583, -0.15413516525059262, -0.09901444539331634, 0.29306981997103043, 0.12275200274157756, 0.26038553251953234, 0.1411574900880832, 0.3041596204008258, 0.1058907129181284, 0.13507813073207683, 0.1480484285323513, 0.2944016772719664, 0.17854496302753858, 0.06174658959007335, -0.2456855869941721, 0.05811650531768047, 0.004051220960009399] |
1,802.08452 | Sequence-Aware Recommender Systems | Recommender systems are one of the most successful applications of data
mining and machine learning technology in practice. Academic research in the
field is historically often based on the matrix completion problem formulation,
where for each user-item-pair only one interaction (e.g., a rating) is
considered. In many application domains, however, multiple user-item
interactions of different types can be recorded over time. And, a number of
recent works have shown that this information can be used to build richer
individual user models and to discover additional behavioral patterns that can
be leveraged in the recommendation process. In this work we review existing
works that consider information from such sequentially-ordered user- item
interaction logs in the recommendation process. Based on this review, we
propose a categorization of the corresponding recommendation tasks and goals,
summarize existing algorithmic solutions, discuss methodological approaches
when benchmarking what we call sequence-aware recommender systems, and outline
open challenges in the area.
| cs.IR cs.HC | recommender systems are one of the most successful applications of data mining and machine learning technology in practice academic research in the field is historically often based on the matrix completion problem formulation where for each useritempair only one interaction eg a rating is considered in many application domains however multiple useritem interactions of different types can be recorded over time and a number of recent works have shown that this information can be used to build richer individual user models and to discover additional behavioral patterns that can be leveraged in the recommendation process in this work we review existing works that consider information from such sequentiallyordered user item interaction logs in the recommendation process based on this review we propose a categorization of the corresponding recommendation tasks and goals summarize existing algorithmic solutions discuss methodological approaches when benchmarking what we call sequenceaware recommender systems and outline open challenges in the area | [['recommender', 'systems', 'are', 'one', 'of', 'the', 'most', 'successful', 'applications', 'of', 'data', 'mining', 'and', 'machine', 'learning', 'technology', 'in', 'practice', 'academic', 'research', 'in', 'the', 'field', 'is', 'historically', 'often', 'based', 'on', 'the', 'matrix', 'completion', 'problem', 'formulation', 'where', 'for', 'each', 'useritempair', 'only', 'one', 'interaction', 'eg', 'a', 'rating', 'is', 'considered', 'in', 'many', 'application', 'domains', 'however', 'multiple', 'useritem', 'interactions', 'of', 'different', 'types', 'can', 'be', 'recorded', 'over', 'time', 'and', 'a', 'number', 'of', 'recent', 'works', 'have', 'shown', 'that', 'this', 'information', 'can', 'be', 'used', 'to', 'build', 'richer', 'individual', 'user', 'models', 'and', 'to', 'discover', 'additional', 'behavioral', 'patterns', 'that', 'can', 'be', 'leveraged', 'in', 'the', 'recommendation', 'process', 'in', 'this', 'work', 'we', 'review', 'existing', 'works', 'that', 'consider', 'information', 'from', 'such', 'sequentiallyordered', 'user', 'item', 'interaction', 'logs', 'in', 'the', 'recommendation', 'process', 'based', 'on', 'this', 'review', 'we', 'propose', 'a', 'categorization', 'of', 'the', 'corresponding', 'recommendation', 'tasks', 'and', 'goals', 'summarize', 'existing', 'algorithmic', 'solutions', 'discuss', 'methodological', 'approaches', 'when', 'benchmarking', 'what', 'we', 'call', 'sequenceaware', 'recommender', 'systems', 'and', 'outline', 'open', 'challenges', 'in', 'the', 'area']] | [-0.06348726078050693, 0.0238774233830735, -0.05283923116736176, 0.07692823347737045, -0.14683771760677858, -0.18191111309527858, 0.022937396972976774, 0.4146886533804682, -0.27120895833717595, -0.32809709429444855, 0.12686833204399037, -0.3142227666415521, -0.21033999612493232, 0.18579587773635786, -0.11904311238399504, 0.04962599866550157, 0.100466649322493, 0.08941168340835844, -0.054055809772678265, -0.3139965490897538, 0.33053272156760294, -0.004447564926763244, 0.33600286494274406, 0.0646360257720661, 0.05049489636902407, 0.020440496050980906, -0.07932167185396449, 0.007605429038726139, -0.09386400013790266, 0.16375479255479125, 0.4087296533386043, 0.24835935002192855, 0.3544985764869643, -0.43174461428298067, -0.22460560719420924, 0.08055050998297057, 0.16997858778516137, 0.1027318682762122, -0.07165609566118593, -0.2938847028348126, 0.055494824633316835, -0.21793011428220876, -0.009486913415819209, -0.09227255887092886, 0.0006356083314606784, 0.023200509341168435, -0.26501886636043426, -0.025264084727706894, 0.042833511262749695, 0.062237870404558464, -0.01898132589189274, -0.12396520197958938, 0.09207640985483366, 0.17332057315267974, 0.09342983313134581, 0.0054659858031432754, 0.15259673564528295, -0.17765135743766283, -0.20253395466041438, 0.3920752503076531, -0.01828082486839089, -0.19512936078776785, 0.20738744199127945, -0.038970636451364005, -0.2160126372481024, 0.03843166238153415, 0.2507941527322971, 0.08851380679071788, -0.21241303139710443, 0.05110166411012695, -0.03457059319260598, 0.17643491637550715, 0.014262472381136867, 0.026806464216776734, 0.2055319053820945, 0.23949113019914767, 0.036120461896354865, 0.07391988916325673, -0.024739712128255344, -0.10489238407894574, -0.18780675871391775, -0.1278889315844273, -0.16775883455600415, 0.01436730440619667, -0.06295029146067524, -0.12402920108593056, 0.39702272042632103, 0.2754563169634056, 0.18393765919107868, -0.01274941164371095, 0.32815506875465644, 0.05396803587502399, 0.09013662037643179, 0.06360319337579391, 0.1631947519436528, -0.01765408076111548, 0.17009834243857383, -0.13019310576619197, 0.11392871741227041, 0.021554004302285365] |
1,802.08453 | Non-Relativistic Maxwell Chern-Simons Gravity | We consider a non-relativistic (NR) limit of $(2+1)$-dimensional Maxwell
Chern-Simons (CS) gravity with gauge algebra [Maxwell] $\oplus \ u(1)\oplus
u(1)$. We obtain a finite NR CS gravity with a degenerate invariant bilinear
form. We find two ways out of this difficulty: To consider i) [Maxwell]
$\oplus\ u(1)$, which does not contain Extended Bargmann gravity (EBG); or, ii)
the NR limit of [Maxwell] $\oplus\ u(1)\oplus u(1)\oplus u(1)$, which is a
Maxwellian generalization of the EBG.
| hep-th | we consider a nonrelativistic nr limit of 21dimensional maxwell chernsimons cs gravity with gauge algebra maxwell oplus u1oplus u1 we obtain a finite nr cs gravity with a degenerate invariant bilinear form we find two ways out of this difficulty to consider i maxwell oplus u1 which does not contain extended bargmann gravity ebg or ii the nr limit of maxwell oplus u1oplus u1oplus u1 which is a maxwellian generalization of the ebg | [['we', 'consider', 'a', 'nonrelativistic', 'nr', 'limit', 'of', '21dimensional', 'maxwell', 'chernsimons', 'cs', 'gravity', 'with', 'gauge', 'algebra', 'maxwell', 'oplus', 'u1oplus', 'u1', 'we', 'obtain', 'a', 'finite', 'nr', 'cs', 'gravity', 'with', 'a', 'degenerate', 'invariant', 'bilinear', 'form', 'we', 'find', 'two', 'ways', 'out', 'of', 'this', 'difficulty', 'to', 'consider', 'i', 'maxwell', 'oplus', 'u1', 'which', 'does', 'not', 'contain', 'extended', 'bargmann', 'gravity', 'ebg', 'or', 'ii', 'the', 'nr', 'limit', 'of', 'maxwell', 'oplus', 'u1oplus', 'u1oplus', 'u1', 'which', 'is', 'a', 'maxwellian', 'generalization', 'of', 'the', 'ebg']] | [-0.19879613191603798, 0.13295993156578034, -0.036180694319613994, 0.029476008747946727, -0.12842696212385207, -0.2211013032404119, -0.0691200632550945, 0.23979643900712874, -0.1441728607432483, -0.21516232593112614, 0.026639048042005464, -0.24942551344020725, -0.13909558741669234, 0.024588795783865736, -0.058986889364274396, -0.03223971489255559, -0.0625067533166084, 0.08432840868473461, -0.18373305023941275, -0.203221747262582, 0.2963827459575379, -0.04243989056614164, 0.22460726779974896, -0.05702932109443905, 0.14102560952975582, -0.024955481673552566, 0.03125146983114824, 0.008998969831338076, -0.1370716242834109, 0.029968111163439, 0.20854387041308906, 0.031177918535134155, 0.12541101244836408, -0.439511527269058, -0.1949043304034292, 0.12030225032175036, 0.14086715262128066, 0.08605530940646892, -0.016588699385166578, -0.3086764434582158, -0.0053015701498274935, -0.2538614202392836, -0.11577852620991994, -0.06705656508621696, 0.0017055645202324816, -0.09917175017451957, -0.33058411990330644, 0.07813349017898923, 0.08577243752828607, 0.01892483193680089, -0.04116790693202247, -0.11396512293499218, -0.041729320950602014, -0.053299509700107044, 0.06742351215766514, 0.0784572206743776, 0.1014910964024164, -0.1310674507292115, -0.06112196730220155, 0.48412030930184335, -0.15992145346196956, -0.2909791793495621, 0.12694318729376242, -0.17461418690820135, -0.19129527539448582, 0.0861780253073124, 0.07077398046544969, 0.1326518648253014, -0.08766782383294139, 0.2620669051060734, -0.14130210019137762, 0.11246886037366643, 0.08463596065260776, 0.05857719978547259, 0.25282771117532343, 0.039303111626881444, 0.0368593257009881, 0.11125788773882063, -0.024113757159458855, -0.07405786116747823, -0.4049650926193962, -0.22057664179488737, -0.12517054751515388, 0.22444474185862393, -0.10108628430186886, -0.13440084036388625, 0.28428928159521766, 0.1060793564386972, 0.07975670812677031, 0.07746335730428668, 0.19260328927090112, 0.1521982003564704, 0.11545725744409002, 0.08465548244477186, 0.2089963831726704, 0.19446046446922094, 0.08115708328183893, -0.24112500459089722, -0.27301371319551176, 0.19550117582707882] |
1,802.08454 | Faithful Semantical Embedding of a Dyadic Deontic Logic in HOL | A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones
in classical higher-order logic is presented. This embedding is proven sound
and complete, that is, faithful.
The work presented here provides the theoretical foundation for the
implementation and automation of dyadic deontic logic within off-the-shelf
higher-order theorem provers and proof assistants.
| cs.AI cs.LO math.LO | a shallow semantical embedding of a dyadic deontic logic by carmo and jones in classical higherorder logic is presented this embedding is proven sound and complete that is faithful the work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within offtheshelf higherorder theorem provers and proof assistants | [['a', 'shallow', 'semantical', 'embedding', 'of', 'a', 'dyadic', 'deontic', 'logic', 'by', 'carmo', 'and', 'jones', 'in', 'classical', 'higherorder', 'logic', 'is', 'presented', 'this', 'embedding', 'is', 'proven', 'sound', 'and', 'complete', 'that', 'is', 'faithful', 'the', 'work', 'presented', 'here', 'provides', 'the', 'theoretical', 'foundation', 'for', 'the', 'implementation', 'and', 'automation', 'of', 'dyadic', 'deontic', 'logic', 'within', 'offtheshelf', 'higherorder', 'theorem', 'provers', 'and', 'proof', 'assistants']] | [-0.07565298545415755, 0.008316318194071451, -0.14303385937172505, 0.1411307123877729, -0.19246939826687728, -0.16579712875601318, 0.0350261947174591, 0.3314798224579405, -0.26105041087053166, -0.25339398215766307, 0.07947828998159687, -0.22912301195578444, -0.14042790885152365, 0.22842786861238656, -0.175631620485715, 0.07639768379912884, 0.029866951414280467, 0.002078402304538974, 0.015489601029979962, -0.19791956383872916, 0.24589544325566817, -0.06371063775279456, 0.26312600020146754, 0.1283199785070287, 0.10730556108885342, 0.1403830717921395, -0.050603912142967736, 0.008184349129873293, -0.10022785856576606, 0.2302884669388058, 0.3882466437364066, 0.21620494362691212, 0.3177980061068579, -0.4372421922162175, -0.10128093883395195, 0.00479071466597142, 0.06227476770679156, 0.0975897157461279, -0.021277375096731162, -0.3608130987871576, 0.08725378163055414, -0.21297226619423815, -0.06982486273369028, -0.15278088763632156, 0.06242726004199573, -0.004901467227480478, -0.20476195098901237, -0.031226601192934647, 0.2885464845156228, 0.1489850325613386, 0.02640777246819602, -0.08816446831311893, 0.020605646694699924, 0.0334374425691311, -0.12544053851161152, 0.03444431461738767, 0.07480650755611283, -0.04103678088479986, -0.229144557448173, 0.34195629733235194, -0.05109001282188627, -0.20244195946940668, 0.16033767467295681, -0.01935051449712504, -0.16674022031603036, 0.017382754737304315, 0.07434282338039742, 0.10833404868565223, -0.13687113777699847, 0.1365149330339153, -0.049217795901414424, 0.24573941809056257, 0.11865556226715583, 0.07094764107562325, 0.13743597532932958, 0.24944841949683097, -0.0008307111587513376, 0.12571536327919197, 0.11950493924733666, -0.09798879147058835, -0.3432561213978463, -0.21342921981381047, -0.14244758807709096, -0.03902131303523978, -0.07302634320458984, -0.17572488982437384, 0.374582484399003, 0.15859505226641582, 0.0011689277986685436, 0.23555714266236732, 0.3918906569963804, 0.1174960834560571, 0.0655650888543783, 0.019980434492161428, 0.2019608824910527, 0.20326750494832932, 0.16900529036367382, -0.0673401115755378, 0.08434552377676247, 0.17746276333841873] |
1,802.08455 | Tibet$^\prime$s Window on Primordial Gravitational Waves | As an essential part of Chinaâs Gravitational Waves Program, the Ali CMB
Polarization Telescope (AliCPT) is a ground-based experiment aiming at the
Primordial Gravitational Waves (PGWs) by measuring B-mode polarization of
Cosmic Microwave Background (CMB). First proposed in 2014 and currently in fast
construction phase, AliCPT is Chinaâs first CMB project that plans for
commissioning in 2019. Led by the Institute of High Energy Physics (IHEP) under
the Chinese Academy of Sciences (CAS), the project is a worldwide collaboration
of more than fifteen universities and research institutes. Ali CMB Project is
briefly introduced.
| astro-ph.IM astro-ph.CO gr-qc hep-ph hep-th | as an essential part of chinaâs gravitational waves program the ali cmb polarization telescope alicpt is a groundbased experiment aiming at the primordial gravitational waves pgws by measuring bmode polarization of cosmic microwave background cmb first proposed in 2014 and currently in fast construction phase alicpt is chinaâs first cmb project that plans for commissioning in 2019 led by the institute of high energy physics ihep under the chinese academy of sciences cas the project is a worldwide collaboration of more than fifteen universities and research institutes ali cmb project is briefly introduced | [['as', 'an', 'essential', 'part', 'of', 'chinaâs', 'gravitational', 'waves', 'program', 'the', 'ali', 'cmb', 'polarization', 'telescope', 'alicpt', 'is', 'a', 'groundbased', 'experiment', 'aiming', 'at', 'the', 'primordial', 'gravitational', 'waves', 'pgws', 'by', 'measuring', 'bmode', 'polarization', 'of', 'cosmic', 'microwave', 'background', 'cmb', 'first', 'proposed', 'in', '2014', 'and', 'currently', 'in', 'fast', 'construction', 'phase', 'alicpt', 'is', 'chinaâs', 'first', 'cmb', 'project', 'that', 'plans', 'for', 'commissioning', 'in', '2019', 'led', 'by', 'the', 'institute', 'of', 'high', 'energy', 'physics', 'ihep', 'under', 'the', 'chinese', 'academy', 'of', 'sciences', 'cas', 'the', 'project', 'is', 'a', 'worldwide', 'collaboration', 'of', 'more', 'than', 'fifteen', 'universities', 'and', 'research', 'institutes', 'ali', 'cmb', 'project', 'is', 'briefly', 'introduced']] | [-0.09155815147544043, 0.191113595985251, -0.0709142625116958, 0.06949484653791392, -0.14127039114156595, -0.02810267865616869, -0.06631691274898392, 0.2706306905045614, -0.14208706351672554, -0.3528874535113573, 0.0830790473693204, -0.3360712682971588, -0.10136622581234365, 0.2795307860392463, 0.006172193516209558, 0.04436739053126875, 0.07265676727907343, -0.11683119443030311, 0.03047945859821534, -0.2808091382337427, 0.2463805094453414, 0.37256003502797297, 0.3465670863893088, -0.008651164650103425, 0.09826883801596832, -0.07841752550454688, -0.16061741368497137, -0.07379052751175649, -0.09446143406319527, 0.0660716050258418, 0.35589676260293185, 0.2820168019855743, 0.22737751118224728, -0.37590457683244904, -0.14673737600122086, 0.1056256998115434, 0.006113117008091329, 0.08382780482521751, -0.059092171882454476, -0.3557340623708544, -0.039598785555706575, -0.19810940569860266, -0.13493990958514776, 0.02622140255618513, 0.045967097087138954, -0.04737880140489254, -0.1747566788651786, 0.01345745825648799, -0.03744266564947563, 0.12433556170499586, -0.06505779355411305, -0.1790519244508347, 0.013579775690571866, 0.05465737724124075, 0.011761472151092776, 0.14312841717772964, 0.08148957233732709, -0.09757420617401354, -0.11587259741397676, 0.4051900371950079, -0.1001616678346821, 0.03998052687025987, 0.0770161984644921, -0.2664067856724384, -0.21233803545544436, 0.058263708402371994, 0.21618112572212958, 0.04897895502438257, -0.20216858025722123, 0.14383815468294076, 0.0883105106262879, 0.18873246146140846, 0.1795210247183894, -0.031687507109082004, 0.3732555213865343, 0.1800275979829686, 0.10360093991998788, 0.08868543516107641, -0.16650509982942963, 0.04353097374909199, -0.28630258612703163, -0.10470952304715936, -0.18324560353757588, 0.027471994819979254, -0.0008819123552881878, -0.0485526616019862, 0.4039900006398886, 0.11209208397501773, 0.021126050708027415, -0.04350857254486162, 0.3523207206463257, -0.057665751877261306, 0.025735942426823324, 0.03454811587305433, 0.37356670534463376, 0.11327138206675895, 0.254114530980587, -0.19477367373490398, 0.03087733516080694, 0.025956943721362074] |
1,802.08456 | Galaxy And Mass Assembly (GAMA): The environmental dependence of the
galaxy main sequence | Aims. We aim to investigate if the environment (characterised by the host
dark matter halo mass) plays any role in shaping the galaxy star formation main
sequence (MS).
Methods. The Galaxy and Mass Assembly project (GAMA) combines a spectroscopic
survey with photometric information in 21 bands from the far-ultraviolet (FUV)
to the far-infrared (FIR). Stellar masses and dust-corrected star-formation
rates (SFR) are derived from spectral energy distribution (SED) modelling using
MAGPHYS. We use the GAMA galaxy group catalogue to examine the variation of the
fraction of star-forming galaxies (SFG) and properties of the MS with respect
to the environment.
Results. We examine the environmental dependence for stellar mass selected
samples without preselecting star-forming galaxies and study any dependence on
the host halo mass separately for centrals and satellites out to z ~ 0.3. We
find the SFR distribution at fixed stellar mass can be described by the
combination of two Gaussians (referred to as the star-forming Gaussian and the
quiescent Gaussian). Using the observed bimodality to define SFG, we
investigate how the fraction of SFG F(SFG) and properties of the MS change with
environment. For centrals, the position of the MS is similar to the field but
with a larger scatter. No significant dependence on halo mass is observed. For
satellites, the position of the MS is almost always lower (by ~0.2 dex)
compared to the field and the width is almost always larger. F(SFG) is similar
between centrals (in different halo mass bins) and field galaxies. However, for
satellites F(SFG) decreases with increasing halo mass and this dependence is
stronger towards lower redshift.
| astro-ph.GA | aims we aim to investigate if the environment characterised by the host dark matter halo mass plays any role in shaping the galaxy star formation main sequence ms methods the galaxy and mass assembly project gama combines a spectroscopic survey with photometric information in 21 bands from the farultraviolet fuv to the farinfrared fir stellar masses and dustcorrected starformation rates sfr are derived from spectral energy distribution sed modelling using magphys we use the gama galaxy group catalogue to examine the variation of the fraction of starforming galaxies sfg and properties of the ms with respect to the environment results we examine the environmental dependence for stellar mass selected samples without preselecting starforming galaxies and study any dependence on the host halo mass separately for centrals and satellites out to z 03 we find the sfr distribution at fixed stellar mass can be described by the combination of two gaussians referred to as the starforming gaussian and the quiescent gaussian using the observed bimodality to define sfg we investigate how the fraction of sfg fsfg and properties of the ms change with environment for centrals the position of the ms is similar to the field but with a larger scatter no significant dependence on halo mass is observed for satellites the position of the ms is almost always lower by 02 dex compared to the field and the width is almost always larger fsfg is similar between centrals in different halo mass bins and field galaxies however for satellites fsfg decreases with increasing halo mass and this dependence is stronger towards lower redshift | [['aims', 'we', 'aim', 'to', 'investigate', 'if', 'the', 'environment', 'characterised', 'by', 'the', 'host', 'dark', 'matter', 'halo', 'mass', 'plays', 'any', 'role', 'in', 'shaping', 'the', 'galaxy', 'star', 'formation', 'main', 'sequence', 'ms', 'methods', 'the', 'galaxy', 'and', 'mass', 'assembly', 'project', 'gama', 'combines', 'a', 'spectroscopic', 'survey', 'with', 'photometric', 'information', 'in', '21', 'bands', 'from', 'the', 'farultraviolet', 'fuv', 'to', 'the', 'farinfrared', 'fir', 'stellar', 'masses', 'and', 'dustcorrected', 'starformation', 'rates', 'sfr', 'are', 'derived', 'from', 'spectral', 'energy', 'distribution', 'sed', 'modelling', 'using', 'magphys', 'we', 'use', 'the', 'gama', 'galaxy', 'group', 'catalogue', 'to', 'examine', 'the', 'variation', 'of', 'the', 'fraction', 'of', 'starforming', 'galaxies', 'sfg', 'and', 'properties', 'of', 'the', 'ms', 'with', 'respect', 'to', 'the', 'environment', 'results', 'we', 'examine', 'the', 'environmental', 'dependence', 'for', 'stellar', 'mass', 'selected', 'samples', 'without', 'preselecting', 'starforming', 'galaxies', 'and', 'study', 'any', 'dependence', 'on', 'the', 'host', 'halo', 'mass', 'separately', 'for', 'centrals', 'and', 'satellites', 'out', 'to', 'z', '03', 'we', 'find', 'the', 'sfr', 'distribution', 'at', 'fixed', 'stellar', 'mass', 'can', 'be', 'described', 'by', 'the', 'combination', 'of', 'two', 'gaussians', 'referred', 'to', 'as', 'the', 'starforming', 'gaussian', 'and', 'the', 'quiescent', 'gaussian', 'using', 'the', 'observed', 'bimodality', 'to', 'define', 'sfg', 'we', 'investigate', 'how', 'the', 'fraction', 'of', 'sfg', 'fsfg', 'and', 'properties', 'of', 'the', 'ms', 'change', 'with', 'environment', 'for', 'centrals', 'the', 'position', 'of', 'the', 'ms', 'is', 'similar', 'to', 'the', 'field', 'but', 'with', 'a', 'larger', 'scatter', 'no', 'significant', 'dependence', 'on', 'halo', 'mass', 'is', 'observed', 'for', 'satellites', 'the', 'position', 'of', 'the', 'ms', 'is', 'almost', 'always', 'lower', 'by', '02', 'dex', 'compared', 'to', 'the', 'field', 'and', 'the', 'width', 'is', 'almost', 'always', 'larger', 'fsfg', 'is', 'similar', 'between', 'centrals', 'in', 'different', 'halo', 'mass', 'bins', 'and', 'field', 'galaxies', 'however', 'for', 'satellites', 'fsfg', 'decreases', 'with', 'increasing', 'halo', 'mass', 'and', 'this', 'dependence', 'is', 'stronger', 'towards', 'lower', 'redshift']] | [-0.03809603039788776, 0.11291511595902519, -0.07631533851620419, 0.1428613654318347, -0.07439718542871962, -0.0005643101667581629, 0.030959871987557258, 0.48733069575586474, -0.11888362014906997, -0.3858762080190232, 0.0027109554604921107, -0.27708652153249985, -0.003195910810399092, 0.18136138250314748, -0.04066520821307251, -0.03225018563919378, 0.010577084794073956, -0.08590627429978533, -0.06829778434900823, -0.2844040947700691, 0.3463771182020326, 0.062305449009713625, 0.206078791045389, -0.05287300334967134, 0.07772657078843097, -0.04863336902844787, -0.10698324936962626, -0.06190674580959426, -0.20405242855580055, -0.007080280793894493, 0.21249501887680572, 0.11616444814872322, 0.2469157442289401, -0.2863410674035549, -0.16512712348295028, 0.11369704733117565, 0.2163123816354448, 0.023036597949937836, -0.11538090691777803, -0.2520046394128891, 0.09034618488141112, -0.17282130244451827, -0.15268351046630524, 0.09652787014911086, 0.009818124913738, 0.04975716687584855, -0.21287051200540913, 0.1903711638861325, -0.0011197501889114825, 0.08190204784939838, -0.10515050375178994, -0.10881583097288137, -0.13211386266762937, 0.12353350085776454, 0.02605450852888507, 0.10393556491949882, 0.24954448402558274, -0.16805084063600706, 0.028050544661090856, 0.4105458603605288, -0.0924445675106581, -0.03018869983011099, 0.20447988946614043, -0.22569998783991627, -0.1550476995665056, 0.0795228256000305, 0.1619761066706922, 0.057788677422636096, -0.1629490309653068, 0.013474334866639993, -0.004387758319892924, 0.2670608274266832, 0.025753530664829813, 0.06926247147822659, 0.30529943316070074, 0.10129333120512249, 0.09419848543092495, 0.08155678538118663, -0.189137682946799, -0.030473964115314382, -0.18593079394204082, -0.08378134446551477, -0.13820963877185952, 0.06927186234131767, -0.1434987148268019, -0.0708489996082762, 0.3628970935813261, 0.11251723293760374, 0.2577600925442623, 0.14975265287192177, 0.33841108713748763, 0.11876931608815681, 0.13804295844090358, 0.09484721562991577, 0.26635088764676407, 0.20364095146516373, 0.03438442857040114, -0.27506048012942697, 0.05266366228673735, -0.013015268266487853] |
1,802.08457 | Resilience against Misbehaving Nodes in Asynchronous Networks | Network systems are one of the most active research areas in the engineering
community as they feature a paradigm shift from centralized to distributed
control and computation. When dealing with network systems, a fundamental
challenge is to ensure their functioning even when some of the network nodes do
not operate as intended due to faults or attacks. The objective of this paper
is to address the problem of resilient consensus in a context where the nodes
have their own clocks, possibly operating in an asynchronous way, and can make
updates at arbitrary time instants. The results represent a first step towards
the development of resilient event-triggered and self-triggered coordination
protocols.
| cs.SY | network systems are one of the most active research areas in the engineering community as they feature a paradigm shift from centralized to distributed control and computation when dealing with network systems a fundamental challenge is to ensure their functioning even when some of the network nodes do not operate as intended due to faults or attacks the objective of this paper is to address the problem of resilient consensus in a context where the nodes have their own clocks possibly operating in an asynchronous way and can make updates at arbitrary time instants the results represent a first step towards the development of resilient eventtriggered and selftriggered coordination protocols | [['network', 'systems', 'are', 'one', 'of', 'the', 'most', 'active', 'research', 'areas', 'in', 'the', 'engineering', 'community', 'as', 'they', 'feature', 'a', 'paradigm', 'shift', 'from', 'centralized', 'to', 'distributed', 'control', 'and', 'computation', 'when', 'dealing', 'with', 'network', 'systems', 'a', 'fundamental', 'challenge', 'is', 'to', 'ensure', 'their', 'functioning', 'even', 'when', 'some', 'of', 'the', 'network', 'nodes', 'do', 'not', 'operate', 'as', 'intended', 'due', 'to', 'faults', 'or', 'attacks', 'the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'address', 'the', 'problem', 'of', 'resilient', 'consensus', 'in', 'a', 'context', 'where', 'the', 'nodes', 'have', 'their', 'own', 'clocks', 'possibly', 'operating', 'in', 'an', 'asynchronous', 'way', 'and', 'can', 'make', 'updates', 'at', 'arbitrary', 'time', 'instants', 'the', 'results', 'represent', 'a', 'first', 'step', 'towards', 'the', 'development', 'of', 'resilient', 'eventtriggered', 'and', 'selftriggered', 'coordination', 'protocols']] | [-0.20023278893733568, 0.0640602345061118, -0.02805179988711395, 0.0036153282377530227, -0.07679477362385527, -0.2044410725208846, 0.09311299976490607, 0.40319854696281254, -0.3071608723194169, -0.3161947645077651, 0.15119598796696995, -0.2322655311573974, -0.16603351605802097, 0.1528321288515475, -0.13988562886180178, 0.08130261559907177, 0.05268854288892313, 0.063534647280308, 0.011974835866765881, -0.2511452619833025, 0.2880077200486663, 0.08135692207883535, 0.30712200454859573, -0.006021382704123177, 0.05905331810407171, -0.02648020563647151, -0.020173901116306132, 0.004310081836725162, -0.0019918407885019074, 0.12194544880185276, 0.3763479041782292, 0.15623316228051076, 0.39428361793133343, -0.48448814800517126, -0.1922589011236348, 0.14306747167032552, 0.14324237286451866, 0.15922259496186267, -0.02202140031467107, -0.2797950779003176, 0.10754787210713733, -0.1766084296798164, -0.10536651015281677, -0.04769445320760662, -0.0041105425620282235, 0.0461645326577127, -0.23462628607892178, -0.02730034411122853, 0.07040291337127036, 0.030836386974392966, -0.040433057156306774, -0.04535980004901913, 0.03022708870385858, 0.19441465013713408, 0.009239136448807337, 0.028870778894898565, 0.16856768076646733, -0.1309766190761531, -0.16979968284510755, 0.41595034494318744, 0.06306852187792009, -0.17179676933896684, 0.2119678740389645, -0.024595090475949374, -0.18557459690015424, 0.074962176179344, 0.25324662398885595, 0.08900504003818654, -0.18148151380565566, 0.022940578269878064, 0.04537744922563434, 0.16883014736866409, 0.010772904893383384, 0.07475667999718677, 0.20071818942881442, 0.20601412156512114, 0.1777168068653819, 0.09165044894060967, -0.03153379784727638, -0.12810654506425967, -0.23668054988269102, -0.1342513037972491, -0.17434839735611934, -0.013110370601564433, -0.022989438130885404, -0.15221022579353302, 0.38953620714389464, 0.18568553350950506, 0.18788196361962367, 0.07758558709068562, 0.35795241719619797, 0.0499765854191289, 0.09023039747791534, 0.13225914890962567, 0.22058914452923503, 0.07230837089432911, 0.15819522045891393, -0.15932227504143323, 0.1639303540387614, -0.021281439846974205] |
1,802.08458 | Experimental study of heterogeneous organic chemistry induced by far
ultraviolet light: Implications for growth of organic aerosols by CH3
addition in the atmospheres of Titan and early Earth | Formation of organic aerosols driven by photochemical reactions has been
observed and suggested in CH4-containing atmospheres, including Titan and early
Earth. However the detailed production and growth mechanisms of organic
aerosols driven by solar far ultraviolet (FUV) light remain poorly constrained.
We conducted laboratory experiments simulating photochemical reactions in a
CH4-CO2 atmosphere driven by the FUV radiations dominated by the Lyman-{\alpha}
line. In the experiments, we analyzed time variations in thickness and infrared
spectra of solid organic film formed on an optical window in a reaction cell.
Gas species formed by FUV irradiation were also analyzed and compared with
photochemical model calculations. Our experimental results show that the growth
rate of the organic film decreases as the CH4/CO2 ratio of reactant gas mixture
decreases, and that the decrease becomes very steep for CH4/CO2 < 1. Comparison
with photochemical model calculations suggests that polymerizations of
gas-phase hydrocarbons, such as polyynes and aromatics, cannot account for the
growth rate of the organic film but that the addition reaction of CH3 radicals
onto the organic film with the reaction probability around 10-2 can explain the
growth rate. At CH4/CO2 < 1, etching by O atom formed by CO2 photolysis would
reduce or inhibit the growth of the organic film. Our results suggest that
organic aerosols would grow through CH3 addition onto the surface during the
precipitation of aerosol particles in the middle atmosphere of Titan and early
Earth. On Titan, effective CH3 addition would reduce C2H6 production in the
atmosphere. On early Earth, growth of aerosol particles would be less efficient
than those on Titan, possibly resulting in small-sized monomers and influencing
UV shielding.
| astro-ph.EP | formation of organic aerosols driven by photochemical reactions has been observed and suggested in ch4containing atmospheres including titan and early earth however the detailed production and growth mechanisms of organic aerosols driven by solar far ultraviolet fuv light remain poorly constrained we conducted laboratory experiments simulating photochemical reactions in a ch4co2 atmosphere driven by the fuv radiations dominated by the lymanalpha line in the experiments we analyzed time variations in thickness and infrared spectra of solid organic film formed on an optical window in a reaction cell gas species formed by fuv irradiation were also analyzed and compared with photochemical model calculations our experimental results show that the growth rate of the organic film decreases as the ch4co2 ratio of reactant gas mixture decreases and that the decrease becomes very steep for ch4co2 1 comparison with photochemical model calculations suggests that polymerizations of gasphase hydrocarbons such as polyynes and aromatics cannot account for the growth rate of the organic film but that the addition reaction of ch3 radicals onto the organic film with the reaction probability around 102 can explain the growth rate at ch4co2 1 etching by o atom formed by co2 photolysis would reduce or inhibit the growth of the organic film our results suggest that organic aerosols would grow through ch3 addition onto the surface during the precipitation of aerosol particles in the middle atmosphere of titan and early earth on titan effective ch3 addition would reduce c2h6 production in the atmosphere on early earth growth of aerosol particles would be less efficient than those on titan possibly resulting in smallsized monomers and influencing uv shielding | [['formation', 'of', 'organic', 'aerosols', 'driven', 'by', 'photochemical', 'reactions', 'has', 'been', 'observed', 'and', 'suggested', 'in', 'ch4containing', 'atmospheres', 'including', 'titan', 'and', 'early', 'earth', 'however', 'the', 'detailed', 'production', 'and', 'growth', 'mechanisms', 'of', 'organic', 'aerosols', 'driven', 'by', 'solar', 'far', 'ultraviolet', 'fuv', 'light', 'remain', 'poorly', 'constrained', 'we', 'conducted', 'laboratory', 'experiments', 'simulating', 'photochemical', 'reactions', 'in', 'a', 'ch4co2', 'atmosphere', 'driven', 'by', 'the', 'fuv', 'radiations', 'dominated', 'by', 'the', 'lymanalpha', 'line', 'in', 'the', 'experiments', 'we', 'analyzed', 'time', 'variations', 'in', 'thickness', 'and', 'infrared', 'spectra', 'of', 'solid', 'organic', 'film', 'formed', 'on', 'an', 'optical', 'window', 'in', 'a', 'reaction', 'cell', 'gas', 'species', 'formed', 'by', 'fuv', 'irradiation', 'were', 'also', 'analyzed', 'and', 'compared', 'with', 'photochemical', 'model', 'calculations', 'our', 'experimental', 'results', 'show', 'that', 'the', 'growth', 'rate', 'of', 'the', 'organic', 'film', 'decreases', 'as', 'the', 'ch4co2', 'ratio', 'of', 'reactant', 'gas', 'mixture', 'decreases', 'and', 'that', 'the', 'decrease', 'becomes', 'very', 'steep', 'for', 'ch4co2', '1', 'comparison', 'with', 'photochemical', 'model', 'calculations', 'suggests', 'that', 'polymerizations', 'of', 'gasphase', 'hydrocarbons', 'such', 'as', 'polyynes', 'and', 'aromatics', 'can', 'not', 'account', 'for', 'the', 'growth', 'rate', 'of', 'the', 'organic', 'film', 'but', 'that', 'the', 'addition', 'reaction', 'of', 'ch3', 'radicals', 'onto', 'the', 'organic', 'film', 'with', 'the', 'reaction', 'probability', 'around', '102', 'can', 'explain', 'the', 'growth', 'rate', 'at', 'ch4co2', '1', 'etching', 'by', 'o', 'atom', 'formed', 'by', 'co2', 'photolysis', 'would', 'reduce', 'or', 'inhibit', 'the', 'growth', 'of', 'the', 'organic', 'film', 'our', 'results', 'suggest', 'that', 'organic', 'aerosols', 'would', 'grow', 'through', 'ch3', 'addition', 'onto', 'the', 'surface', 'during', 'the', 'precipitation', 'of', 'aerosol', 'particles', 'in', 'the', 'middle', 'atmosphere', 'of', 'titan', 'and', 'early', 'earth', 'on', 'titan', 'effective', 'ch3', 'addition', 'would', 'reduce', 'c2h6', 'production', 'in', 'the', 'atmosphere', 'on', 'early', 'earth', 'growth', 'of', 'aerosol', 'particles', 'would', 'be', 'less', 'efficient', 'than', 'those', 'on', 'titan', 'possibly', 'resulting', 'in', 'smallsized', 'monomers', 'and', 'influencing', 'uv', 'shielding']] | [-0.012925421375500862, 0.24325601491159854, 0.011003128499278217, 0.026396146840433204, 0.051393912417890306, -0.07897663718698802, 0.05419657828236954, 0.391290178927541, -0.1941174549815768, -0.31401034181445947, 0.059335280803541154, -0.30146093383348344, -0.08630998118877493, 0.19804762501865072, -0.02141436258829493, -0.010110342799388149, 0.050109101452459635, -0.12245704954469293, 0.03278350218399999, -0.2413048296735812, 0.21671435301673345, 0.15773232782010307, 0.181233244548209, 0.11852145105510341, 0.01229873251734253, -0.10661980574132639, -0.008165037919434834, -0.08053655334537135, -0.1651701583344129, 0.08512150253903651, 0.2354482635301728, 0.04199607294921843, 0.13759302073997898, -0.5471462144474862, -0.3151371275216729, 0.0558929259578964, 0.15796577078411458, 0.05483322199537907, -0.11722777032580739, -0.1888605214233015, -0.0034768146531549055, -0.1487862162679766, -0.12304836818619483, 0.031813810280866946, 0.024232636971856195, 0.013112891178714893, -0.2673173525516068, 0.056724265702051496, 0.012530226637366951, 0.12074286988143312, -0.14949969241402516, -0.1730541476882911, -0.15092704843792054, 0.049456922118430856, 0.04119810641646519, -0.006138939525673277, 0.31966042584483423, -0.11066151794641656, -0.005153533745103526, 0.41047412776093944, -0.16536501250049093, -0.04069023904889185, 0.25522322673004355, -0.19468298894448421, -0.09510592054610303, 0.26278457520910464, 0.16003283745259544, 0.12710329973516246, -0.1367391484640677, 0.021707337419978486, -0.015374663303221911, 0.19460879020707952, 0.145634250152773, 0.014201141836737943, 0.2522207478944279, 0.2061614855010838, -0.02391569466645168, 0.10561059091757762, -0.1540760032120282, -0.07263062536183287, -0.14494064113049038, -0.22353966271705566, -0.1375289722038502, 0.06949371810692845, -0.07120487997155822, -0.11051353543380546, 0.2934937029834629, 0.09190500307880986, 0.1754876180633307, -0.04683717595695494, 0.2830585760088658, 0.054882417744558765, 0.07859640029522151, 0.03344123097756344, 0.2684341521248166, 0.10113540239853708, 0.11758345233788887, -0.28603721558736106, 0.202389053318331, 0.002850111864756474] |
1,802.08459 | Boundedness of solutions for the reversible system with low regularity
in time | In the present paper, it is proved that all solutions are bounded for the
reversible system
\ddot{x}+\sum_{i=0}^{l}b_{i}(t)x^{2i+1}\dot{x}+x^{2n+1}+\sum_{i=0}^{n-1}a_{i}(t)x^{2i+1}=0,
0\leq l\leq [\frac{n}{2}]-1,t\in\mathbb{T}^{1}=\mathbb{R}/\mathbb{Z}, where
a_{i}(t)\in C^{1}(\mathbb{T}^{1})\;([\frac{n-1}{2}]+1\leq i\leq n-1),
a_{j}(t)\in L^{1}(\mathbb{T}^{1})\;(0\leq j\leq [\frac{n-1}{2}]) and
b_{k}(t)\in C^{1}(\mathbb{T}^{1})\;(0\leq k\leq l).
| math.DS | in the present paper it is proved that all solutions are bounded for the reversible system ddotxsum_i0lb_itx2i1dotxx2n1sum_i0n1a_itx2i10 0leq lleq fracn21tinmathbbt1mathbbrmathbbz where a_itin c1mathbbt1fracn121leq ileq n1 a_jtin l1mathbbt10leq jleq fracn12 and b_ktin c1mathbbt10leq kleq l | [['in', 'the', 'present', 'paper', 'it', 'is', 'proved', 'that', 'all', 'solutions', 'are', 'bounded', 'for', 'the', 'reversible', 'system', 'ddotxsum_i0lb_itx2i1dotxx2n1sum_i0n1a_itx2i10', '0leq', 'lleq', 'fracn21tinmathbbt1mathbbrmathbbz', 'where', 'a_itin', 'c1mathbbt1fracn121leq', 'ileq', 'n1', 'a_jtin', 'l1mathbbt10leq', 'jleq', 'fracn12', 'and', 'b_ktin', 'c1mathbbt10leq', 'kleq', 'l']] | [-0.2466382857841941, 0.21448500046076682, 0.11360664973751856, -0.03161004348210274, 0.04569154501391145, -0.33671091611568743, -0.07981104755218929, 0.3455243809865071, -0.2437315170581524, -0.16609028748308236, 0.15155286816074154, -0.40818127746192306, -0.13914134460859573, 0.13792001115731323, -0.032602266050302066, 0.05308158874798279, -0.031925207254691765, 0.0816957978800369, 0.04049320623744279, -0.2879993560222479, 0.27840600420649236, -0.18814871578405684, 0.12901889393106103, 0.04188386402809276, 0.11767224308389884, -0.04689470915876042, 0.09011554710853559, -0.04534790435662636, -0.29805688263737606, -0.021959664049343422, 0.35482806268219763, 0.1887959768780722, 0.24784526544121596, -0.3196271167208369, -0.12211979047144549, 0.2289706773411196, 0.26854452531999695, -0.07500220233431229, 0.03514669000959167, -0.1817664704643763, 0.25197100868591893, -0.08959632177049151, -0.15135484880123, -0.042368993234749026, 0.1799276821458569, 0.01573634770913766, -0.4353741720462075, 0.008691795815068942, 0.20790690656464833, 0.04035938022514948, -0.05641682286603519, -0.24866915058541614, -0.05526687770795364, 0.06988156928967398, -0.08532561497010577, 0.09043338221426193, -0.0817412667406293, 0.02133769144375737, -0.017105417182812326, 0.29793304913283253, 0.030503110037758373, -0.23428637763628593, 0.031992342591715545, -0.19337498751254037, -0.22707129812512833, 0.04815244323645647, -3.685204921146998e-05, 0.25292128267196506, -0.11264508618758275, 0.3017134898713826, -0.1160355440985698, 0.17946681638176626, 0.126500980122588, 0.027728840690822557, 0.016979938372969627, 0.04235482188568522, 0.16264527004498702, 0.10681264999752435, 0.03775706693816643, 0.027837142975141223, -0.41468305541918826, -0.18091143252184758, -0.24916662168778622, 0.13600099118999565, -0.11000569261411258, -0.024559505785313938, 0.2252924763955749, 0.1337382746860385, 0.13027329904098922, 0.20843336272698182, 0.1602611945798764, 0.07645098399370909, -0.07126867527572009, 0.2141850856670107, 0.05826358210581999, 0.09633219335228205, 0.08154941912597188, -0.1817383868440699, -0.0252922334923194, 0.13162805998077742] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.