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.0336 | Information Planning for Text Data | Information planning enables faster learning with fewer training examples. It
is particularly applicable when training examples are costly to obtain. This
work examines the advantages of information planning for text data by focusing
on three supervised models: Naive Bayes, supervised LDA and deep neural
networks. We show that planning based on entropy and mutual information
outperforms random selection baseline and therefore accelerates learning.
| stat.ML cs.LG | information planning enables faster learning with fewer training examples it is particularly applicable when training examples are costly to obtain this work examines the advantages of information planning for text data by focusing on three supervised models naive bayes supervised lda and deep neural networks we show that planning based on entropy and mutual information outperforms random selection baseline and therefore accelerates learning | [['information', 'planning', 'enables', 'faster', 'learning', 'with', 'fewer', 'training', 'examples', 'it', 'is', 'particularly', 'applicable', 'when', 'training', 'examples', 'are', 'costly', 'to', 'obtain', 'this', 'work', 'examines', 'the', 'advantages', 'of', 'information', 'planning', 'for', 'text', 'data', 'by', 'focusing', 'on', 'three', 'supervised', 'models', 'naive', 'bayes', 'supervised', 'lda', 'and', 'deep', 'neural', 'networks', 'we', 'show', 'that', 'planning', 'based', 'on', 'entropy', 'and', 'mutual', 'information', 'outperforms', 'random', 'selection', 'baseline', 'and', 'therefore', 'accelerates', 'learning']] | [-0.005275596317554277, 0.009095438504739413, -0.040812035490359576, 0.13267338648438454, -0.20537832677955664, -0.24589403269309845, 0.0562840232714301, 0.49204254895448685, -0.24031559060815544, -0.28580109540018295, 0.08800935203446046, -0.30423357613414287, -0.18697239077162175, 0.24458436649440538, -0.16934702252703054, 0.07871823979630357, 0.21639451635484067, 0.08030189820639198, -0.09965465932212297, -0.35790471652788775, 0.303730804013044, 0.0509667086654291, 0.4219815201229519, -0.009696825174614787, 0.15494951282605707, 0.053042521825917656, -0.0775402338846424, -0.014538457291939902, -0.05986634868491415, 0.19194706557466398, 0.37953591001080766, 0.2803034942582368, 0.4119661930386746, -0.4142172683976472, -0.27410226071342114, 0.09408987678646569, 0.15560666095494988, 0.14098922348773432, 0.02014849239975096, -0.3157796813581612, 0.016794337284943416, -0.15989178866342021, 0.09577912045642734, -0.2583697451988146, -0.051905256603652285, -1.4686883087196047e-05, -0.3524893580026747, 0.05857944013994364, 0.12508845194760296, 0.08626483788802511, -0.0005115738419431543, -0.15901188503596045, 0.033725870891459404, 0.07846162150224065, 0.0633677501889271, 0.04290913551905385, 0.151109966309002, -0.1950047967608072, -0.1755864106872607, 0.30388056161621263, -0.031873593428393916, -0.2130060126295402, 0.1999702993965161, 0.0635846846234349, -0.16749022659357815, 0.09771656183644183, 0.2579812574059895, 0.14099721307496701, -0.19294357547903293, -0.003389805410286441, 0.014831138006041921, 0.1443366765133327, 0.021037005666007715, -0.014700570032887515, 0.11476625067954292, 0.33701752340199337, 0.055611902995715064, 0.13916715602612212, -0.1546750472607239, -0.1579213206848455, -0.16735967012890984, -0.06608263234282652, -0.23615355216084966, -0.031494755305290695, -0.1396277180851145, -0.11446064698790746, 0.3217912797893708, 0.286042304813034, 0.15750423689476317, 0.18107603964883656, 0.3810243827719537, -0.026422460992184895, 0.10258860007992812, 0.17504041314509416, 0.1840647328349333, -0.016573350562433167, 0.1362045399164633, -0.16885242460384256, 0.09831347655771035, 0.029430129203117557] |
1,802.03361 | Pseudofinite groups and VC-dimension | We develop local NIP group theory in the context of pseudofinite groups. In
particular, given a sufficiently saturated pseudofinite structure $G$ expanding
a group, and left invariant NIP formula $\delta(x;\bar{y})$, we prove various
aspects of "local fsg" for the right-stratified formula
$\delta^r(x;\bar{y},u):=\delta(x\cdot u;\bar{y})$. This includes a
$\delta^r$-type-definable connected component, uniqueness of the pseudofinite
counting measure as a left-invariant measure on $\delta^r$-formulas, and
generic compact domination for $\delta^r$-definable sets.
| math.LO | we develop local nip group theory in the context of pseudofinite groups in particular given a sufficiently saturated pseudofinite structure g expanding a group and left invariant nip formula deltaxbary we prove various aspects of local fsg for the rightstratified formula deltarxbaryudeltaxcdot ubary this includes a deltartypedefinable connected component uniqueness of the pseudofinite counting measure as a leftinvariant measure on deltarformulas and generic compact domination for deltardefinable sets | [['we', 'develop', 'local', 'nip', 'group', 'theory', 'in', 'the', 'context', 'of', 'pseudofinite', 'groups', 'in', 'particular', 'given', 'a', 'sufficiently', 'saturated', 'pseudofinite', 'structure', 'g', 'expanding', 'a', 'group', 'and', 'left', 'invariant', 'nip', 'formula', 'deltaxbary', 'we', 'prove', 'various', 'aspects', 'of', 'local', 'fsg', 'for', 'the', 'rightstratified', 'formula', 'deltarxbaryudeltaxcdot', 'ubary', 'this', 'includes', 'a', 'deltartypedefinable', 'connected', 'component', 'uniqueness', 'of', 'the', 'pseudofinite', 'counting', 'measure', 'as', 'a', 'leftinvariant', 'measure', 'on', 'deltarformulas', 'and', 'generic', 'compact', 'domination', 'for', 'deltardefinable', 'sets']] | [-0.18978914176495593, 0.09747348009364405, -0.12810476083064176, 0.11202381690773258, -0.1050092868667218, -0.09280985511350827, 0.011655992085923304, 0.35931895470216135, -0.28359777498684946, -0.22956502125369477, 0.10134905104555922, -0.21130710498231356, -0.1377187333390361, 0.17450050814229934, -0.10114239379152899, -0.025925663391464068, -0.004679948712706749, 0.16140186074418855, -0.04236493873043505, -0.23254067896193534, 0.39442543661771495, -0.10105430017240712, 0.28589984739474095, 0.061275695984969375, 0.12393723365652268, 0.040618399219190485, -0.06411677669947509, 0.12041998674451816, -0.18973924949398782, 0.13165519102552875, 0.2683342307286917, 0.10349907708110014, 0.2426215319275917, -0.3818235501158433, -0.1931791462798099, 0.17525130161465924, 0.0672075727107156, -0.0029264674719984137, -0.0991326736526747, -0.2799605313444235, 0.16005304626754072, -0.21466649287059658, -0.17458435909853118, -0.09943177083843067, 0.11002771325836905, -0.005021348885673463, -0.23113508099312208, 0.023871499678639115, 0.11390916096260313, 0.09995225314661617, -0.06266450150640773, -0.022864638201770236, 0.006736622747323918, 0.09757084553664336, -0.04403628527995993, 0.02752704013780248, 0.12835979912063625, -0.10447667413543849, -0.08271412281930203, 0.359189872393293, -0.16012994258008043, -0.17921143795409408, 0.14876466202473299, -0.16015792244159785, -0.24298311069180242, 0.051871289888427395, 0.10812305240723931, 0.20721097605028113, -0.06703425307288674, 0.22004727049555142, -0.1567968178509933, 0.0811432703840928, 0.07339607173057854, 0.012896442663718442, 0.11161026179973708, 0.13962443114914855, 0.12643409136407932, 0.145010661860531, 0.05435840562214983, 0.024089203368811332, -0.37118780185453226, -0.156789409298236, -0.10463072080928527, 0.1129431681799107, -0.11484698738213858, -0.24174029198780533, 0.39620594310833784, 0.0506419550444259, 0.13390614870996748, 0.1064302269064012, 0.19604642939616423, 0.03940728608495937, 0.02973674570943122, 0.08636450556824442, 0.09228522256474758, 0.2723539150701683, -0.07641420946227478, -0.14019122287692104, -0.006340652620267184, 0.18090788375769482] |
1,802.03362 | Three-body spectrum in a finite volume: the role of cubic symmetry | The three-particle quantization condition is partially diagonalized in the
center-of-mass frame by using cubic symmetry on the lattice. To this end,
instead of spherical harmonics, the kernel of the Bethe-Salpeter equation for
particle-dimer scattering is expanded in the basis functions of different
irreducible representations of the octahedral group. Such a projection is of
particular importance for the three-body problem in the finite volume due to
the occurrence of three-body singularities above breakup. Additionally, we
study the numerical solution and properties of such a projected quantization
condition in a simple model. It is shown that, for large volumes, these
solutions allow for an instructive interpretation of the energy eigenvalues in
terms of bound and scattering states.
| hep-lat nucl-th | the threeparticle quantization condition is partially diagonalized in the centerofmass frame by using cubic symmetry on the lattice to this end instead of spherical harmonics the kernel of the bethesalpeter equation for particledimer scattering is expanded in the basis functions of different irreducible representations of the octahedral group such a projection is of particular importance for the threebody problem in the finite volume due to the occurrence of threebody singularities above breakup additionally we study the numerical solution and properties of such a projected quantization condition in a simple model it is shown that for large volumes these solutions allow for an instructive interpretation of the energy eigenvalues in terms of bound and scattering states | [['the', 'threeparticle', 'quantization', 'condition', 'is', 'partially', 'diagonalized', 'in', 'the', 'centerofmass', 'frame', 'by', 'using', 'cubic', 'symmetry', 'on', 'the', 'lattice', 'to', 'this', 'end', 'instead', 'of', 'spherical', 'harmonics', 'the', 'kernel', 'of', 'the', 'bethesalpeter', 'equation', 'for', 'particledimer', 'scattering', 'is', 'expanded', 'in', 'the', 'basis', 'functions', 'of', 'different', 'irreducible', 'representations', 'of', 'the', 'octahedral', 'group', 'such', 'a', 'projection', 'is', 'of', 'particular', 'importance', 'for', 'the', 'threebody', 'problem', 'in', 'the', 'finite', 'volume', 'due', 'to', 'the', 'occurrence', 'of', 'threebody', 'singularities', 'above', 'breakup', 'additionally', 'we', 'study', 'the', 'numerical', 'solution', 'and', 'properties', 'of', 'such', 'a', 'projected', 'quantization', 'condition', 'in', 'a', 'simple', 'model', 'it', 'is', 'shown', 'that', 'for', 'large', 'volumes', 'these', 'solutions', 'allow', 'for', 'an', 'instructive', 'interpretation', 'of', 'the', 'energy', 'eigenvalues', 'in', 'terms', 'of', 'bound', 'and', 'scattering', 'states']] | [-0.1231039630724927, 0.13225376918296958, -0.10633006234926617, 0.07328643106308806, -0.0458795667666456, -0.055669108995884335, 0.011839691547514951, 0.32616120972873075, -0.2631902870033746, -0.21980370164484433, 0.0763087849041609, -0.2662388504077883, -0.1427077727432808, 0.1393861019315765, -0.0006888362989032074, 0.08736473786563653, 0.09153718919209812, 0.05048377720801079, -0.11540798928143213, -0.21537545644475714, 0.3627747737195181, 0.04406967132716723, 0.2512531334109118, 0.10001238854197056, 0.10528958768624326, 0.046014062576400845, 0.03193414335584511, -0.02414314961086189, -0.11726574966229711, 0.11516236022934723, 0.24643058504139922, 0.06794603864621857, 0.21171065214009066, -0.4087998905421599, -0.16124997874316963, 0.10420710057344125, 0.1628624026866063, 0.14638305392278278, -0.040668962285449, -0.273133754082348, 0.0533974239886131, -0.18144250610924284, -0.18266155802361342, -0.0862550076815988, 0.03548099045115321, 0.00018185717053711414, -0.2533340606595511, 0.09998711349402109, 0.06365940290219758, 0.033487770892679694, -0.12535233272482518, -0.11219913859082305, -0.00300021063455421, 0.06216374218220944, 0.025071717640789956, -0.0054034278748314015, 0.038243430554259404, -0.14734790250456528, -0.05922961028130806, 0.42178168168048497, -0.01511853376261728, -0.27374129376333695, 0.15421466909186995, -0.15010628803207984, -0.09898166370821064, 0.1553226698230466, 0.17686417265997634, 0.11652014452721114, -0.13896008757671907, 0.12115187947739564, -0.0538602242367747, 0.12248035370797405, 0.10334491272173497, 0.01966502948704621, 0.14799569531384368, 0.12829897005272947, 0.06311205599618995, 0.14239320714866904, -0.06734223257061904, -0.10394927456003168, -0.36069133971696316, -0.14518662038228838, -0.22392188961334203, 0.03637802174476826, -0.09763485172171267, -0.1687474696661609, 0.40166433396870677, 0.06610079631285297, 0.21743591043126323, 0.020390344832254492, 0.24697055913831878, 0.17310221445260812, 0.07932230949239887, 0.03093514544889331, 0.23182584048937196, 0.1605651048862416, 0.021630530006697644, -0.2737567950283056, -0.01237246341922361, 0.14532542304014381] |
1,802.03363 | Effect of Post Weld Heat Treatments on the Elevated Temperature
Mechanical Properties of Ti6Al4V Friction Welds | The {\alpha}+\b{eta} titanium alloy (Ti6Al4V) has been successfully joined
using rotary friction welding. To investigate the influence of post weld heat
treatments on the microstructure and mechanical properties of the welds, the
weld joints were heat treated in {\alpha}+\b{eta} and \b{eta} regions, followed
by air cooling and furnace cooling. Subsequent to heat treatment, the specimens
were subjected to stress relieving treatment. The heat treatment temperatures
were selected keeping in view the beta transus temperature of the alloy.
Mechanical properties of the welds are evaluated in the as-welded and post weld
heat treated conditions at the working temperature of this alloy. The results
reported are an average of the values obtained from three tests carried out at
a given set of condition. Joints produced exhibited better mechanical
properties when compared to the parent metal. Coarse transgranular
microstructure and coarse grains in general exhibit better creep and stress
rupture properties, while finer microstructures exhibit better tensile
strengths
| physics.app-ph | the alphabeta titanium alloy ti6al4v has been successfully joined using rotary friction welding to investigate the influence of post weld heat treatments on the microstructure and mechanical properties of the welds the weld joints were heat treated in alphabeta and beta regions followed by air cooling and furnace cooling subsequent to heat treatment the specimens were subjected to stress relieving treatment the heat treatment temperatures were selected keeping in view the beta transus temperature of the alloy mechanical properties of the welds are evaluated in the aswelded and post weld heat treated conditions at the working temperature of this alloy the results reported are an average of the values obtained from three tests carried out at a given set of condition joints produced exhibited better mechanical properties when compared to the parent metal coarse transgranular microstructure and coarse grains in general exhibit better creep and stress rupture properties while finer microstructures exhibit better tensile strengths | [['the', 'alphabeta', 'titanium', 'alloy', 'ti6al4v', 'has', 'been', 'successfully', 'joined', 'using', 'rotary', 'friction', 'welding', 'to', 'investigate', 'the', 'influence', 'of', 'post', 'weld', 'heat', 'treatments', 'on', 'the', 'microstructure', 'and', 'mechanical', 'properties', 'of', 'the', 'welds', 'the', 'weld', 'joints', 'were', 'heat', 'treated', 'in', 'alphabeta', 'and', 'beta', 'regions', 'followed', 'by', 'air', 'cooling', 'and', 'furnace', 'cooling', 'subsequent', 'to', 'heat', 'treatment', 'the', 'specimens', 'were', 'subjected', 'to', 'stress', 'relieving', 'treatment', 'the', 'heat', 'treatment', 'temperatures', 'were', 'selected', 'keeping', 'in', 'view', 'the', 'beta', 'transus', 'temperature', 'of', 'the', 'alloy', 'mechanical', 'properties', 'of', 'the', 'welds', 'are', 'evaluated', 'in', 'the', 'aswelded', 'and', 'post', 'weld', 'heat', 'treated', 'conditions', 'at', 'the', 'working', 'temperature', 'of', 'this', 'alloy', 'the', 'results', 'reported', 'are', 'an', 'average', 'of', 'the', 'values', 'obtained', 'from', 'three', 'tests', 'carried', 'out', 'at', 'a', 'given', 'set', 'of', 'condition', 'joints', 'produced', 'exhibited', 'better', 'mechanical', 'properties', 'when', 'compared', 'to', 'the', 'parent', 'metal', 'coarse', 'transgranular', 'microstructure', 'and', 'coarse', 'grains', 'in', 'general', 'exhibit', 'better', 'creep', 'and', 'stress', 'rupture', 'properties', 'while', 'finer', 'microstructures', 'exhibit', 'better', 'tensile', 'strengths']] | [-0.044464304196563637, 0.1745648066062131, -0.07018392028395909, -0.038268436125159115, -0.012809616468193662, -0.1450454758589047, 0.06193886795338219, 0.44209886678530796, -0.2372073886625759, -0.3011580225830148, 0.06212842820647668, -0.29849528861020436, -0.06210173774123579, 0.20775743356192267, -0.027083710037087174, 0.09466594795315819, 0.024266464291019488, -0.016754220075400353, -0.0766881617608589, -0.22570088782722686, 0.20775897843859992, 0.11833219284602961, 0.32750338292378306, 0.03515416204849222, 0.05557519628956624, -0.05087221474023899, 0.008048954265579195, 0.07408127804927818, -0.20131529401080658, -0.005048635040784811, 0.19502804581795566, -0.043379933670066394, 0.2444212622970778, -0.4929502008168341, -0.26428702965910944, 0.034441571703858, 0.020445592931241957, 0.02056817131497982, -0.01020361222976867, -0.23034512218051625, 0.05391385611872394, -0.06545614182658784, -0.10646105746666042, -0.05647845422237123, -0.03601412250140271, 0.03301918115686057, -0.23899189999641537, 0.10719137548698814, 0.06629523676624499, 0.14019522907941107, -0.12903217508082654, -0.16828026741292545, -0.08887650271387795, 0.1400743993054002, 0.07394543460074376, -0.038434713816590756, 0.29060385440319003, -0.13079828306482258, -0.0007445899506595421, 0.3777118611403487, 0.012155540543381584, -0.13819206080266408, 0.19344510603242543, -0.13850764119120726, -0.05987408973882126, 0.19563706637384345, 0.13413166155730216, 0.10169960718372135, -0.20642151063288844, -0.03411093730004746, 0.0925419093018954, 0.13339098524786047, 0.16000008403456636, -0.046968057701385325, 0.1877441242482368, 0.21673954379678304, -0.09716931143594155, 0.22702372599508033, -0.08940116097007623, -0.018835481483029663, -0.2172978230080773, -0.17575909460096487, -0.1404259371247699, 0.044435545514101865, -0.11538928827552833, -0.18994080269249616, 0.3449159172823193, 0.11513097279451111, 0.14921863892496648, -0.009535888783511247, 0.21467027779027528, 0.03395415281859157, 0.06597166113077675, 0.031762718939669914, 0.26681401495906437, 0.15987145980856346, 0.1279803443769622, -0.2829940118932758, 0.1347616223902623, 0.05095443650233475] |
1,802.03364 | Reverse Brascamp-Lieb inequality and the dual Bollobas-Thomason
inequality | The purpose of this article is to establish the dual version of the uniform
cover inequality of Bollobas and Thomason.
| math.MG | the purpose of this article is to establish the dual version of the uniform cover inequality of bollobas and thomason | [['the', 'purpose', 'of', 'this', 'article', 'is', 'to', 'establish', 'the', 'dual', 'version', 'of', 'the', 'uniform', 'cover', 'inequality', 'of', 'bollobas', 'and', 'thomason']] | [-0.09636933486908675, 0.017362527176737787, -0.09675193891162052, 0.08902707751840352, -0.07861056011170149, -0.09716669991612434, 0.04913544226437807, 0.2597703911364079, -0.31466659940779207, -0.2935866706189699, 0.1363705188035965, -0.2145557438954711, -0.0989428110420704, 0.10732881939038634, -0.21075491113588213, -0.015346680581569672, 0.030212222784757613, 0.014557499368675054, 0.014517930930014699, -0.3415337109938264, 0.31129327276721597, 0.05711661390960217, 0.283629041723907, 0.15838001854717731, 0.02007780452258885, 0.08214430387597531, -0.0601544460747391, 0.018921884708106518, -0.25161097198724747, 0.23381908382289113, 0.20620621349662543, 0.1532242034561932, 0.2655888045206666, -0.3567024049349129, -0.07019338230602443, 0.16313102692365647, 0.06828692606650293, 0.05773571213940158, 0.015651104925200342, -0.2640883867163211, 0.1184871586970985, -0.1374537380412221, -0.22214753068983556, 0.018056209199130535, 0.0008473096415400505, 0.05699902083724737, -0.29762770566158, 0.024131534853950143, 0.16618779306299986, 0.04271735418587923, -0.015083258831873536, -0.05664211544208229, 0.06976897101849318, 0.08004471510648728, 0.02540652615716681, 0.07855294721666724, -0.003916291706264019, -0.051379309117328374, -0.11711921924725174, 0.30128603167831897, -0.027851282432675362, -0.12132957009598613, 0.1288143215700984, -0.10372976426733657, -0.2080554130487144, 0.008036862872540951, 0.08931397548876703, 0.14006983051076533, -0.14676245872396976, 0.19627284514426718, -0.2163392849266529, 0.051970240846276286, 0.15440389229916035, 0.034789100848138334, 0.05741966958157718, 0.12253962294198573, 0.17569236452691256, 0.28581077624112367, -0.010263268323615193, -0.0767409629188478, -0.333856251463294, -0.23372493423521518, -0.24219290021574125, 0.09487067447043955, -0.08072159222720074, -0.1819637494161725, 0.4023430868983269, 0.12314649354666471, 0.136855414416641, 0.13299327264539898, 0.19028273541480303, 0.05049825357273221, -0.05603215508162975, 0.08122949886601419, 0.22569444682449102, 0.33313670605421064, 0.11331000509671867, -0.12844398787710815, 0.0629213344072923, 0.26921504432102666] |
1,802.03365 | Astor: Exploring the Design Space of Generate-and-Validate Program
Repair beyond GenProg | During last years, researches have proposed novel repair approaches that
automatically generate patches for repairing software bugs. Repair approaches
can be loosely characterized along the main design philosophy such generate-
and-validate or synthesis-based. Each of those repair approaches is a point in
the design space of program repair. Our goal is to facilitate the design,
development and evaluation of repair approaches by providing a framework that:
a) contains components commonly present in approaches implementations thus new
approaches can be built over them, b) provides built-in implementations of
existing repair approach. This paper presents a framework named Astor that
encores the design space of generate-and-validate repair approaches. Astor
provides extension points that form the explicit decision space of program
repair. Over those extension points, researchers can reuse existing components
or implements new ones. Astor includes 6 Java implementation of repair
approaches, including one of the pioneer: GenProg. Researcher have been already
defining new approaches over Astor, proposing improvements of those built-in
approaches by using the extension points, and executing approaches
implementations from Astor in their evaluations. The implementations of the
repair approaches built over Astor are capable of repair, in total, 98 real
bugs from 5 large Java programs.
| cs.SE | during last years researches have proposed novel repair approaches that automatically generate patches for repairing software bugs repair approaches can be loosely characterized along the main design philosophy such generate andvalidate or synthesisbased each of those repair approaches is a point in the design space of program repair our goal is to facilitate the design development and evaluation of repair approaches by providing a framework that a contains components commonly present in approaches implementations thus new approaches can be built over them b provides builtin implementations of existing repair approach this paper presents a framework named astor that encores the design space of generateandvalidate repair approaches astor provides extension points that form the explicit decision space of program repair over those extension points researchers can reuse existing components or implements new ones astor includes 6 java implementation of repair approaches including one of the pioneer genprog researcher have been already defining new approaches over astor proposing improvements of those builtin approaches by using the extension points and executing approaches implementations from astor in their evaluations the implementations of the repair approaches built over astor are capable of repair in total 98 real bugs from 5 large java programs | [['during', 'last', 'years', 'researches', 'have', 'proposed', 'novel', 'repair', 'approaches', 'that', 'automatically', 'generate', 'patches', 'for', 'repairing', 'software', 'bugs', 'repair', 'approaches', 'can', 'be', 'loosely', 'characterized', 'along', 'the', 'main', 'design', 'philosophy', 'such', 'generate', 'andvalidate', 'or', 'synthesisbased', 'each', 'of', 'those', 'repair', 'approaches', 'is', 'a', 'point', 'in', 'the', 'design', 'space', 'of', 'program', 'repair', 'our', 'goal', 'is', 'to', 'facilitate', 'the', 'design', 'development', 'and', 'evaluation', 'of', 'repair', 'approaches', 'by', 'providing', 'a', 'framework', 'that', 'a', 'contains', 'components', 'commonly', 'present', 'in', 'approaches', 'implementations', 'thus', 'new', 'approaches', 'can', 'be', 'built', 'over', 'them', 'b', 'provides', 'builtin', 'implementations', 'of', 'existing', 'repair', 'approach', 'this', 'paper', 'presents', 'a', 'framework', 'named', 'astor', 'that', 'encores', 'the', 'design', 'space', 'of', 'generateandvalidate', 'repair', 'approaches', 'astor', 'provides', 'extension', 'points', 'that', 'form', 'the', 'explicit', 'decision', 'space', 'of', 'program', 'repair', 'over', 'those', 'extension', 'points', 'researchers', 'can', 'reuse', 'existing', 'components', 'or', 'implements', 'new', 'ones', 'astor', 'includes', '6', 'java', 'implementation', 'of', 'repair', 'approaches', 'including', 'one', 'of', 'the', 'pioneer', 'genprog', 'researcher', 'have', 'been', 'already', 'defining', 'new', 'approaches', 'over', 'astor', 'proposing', 'improvements', 'of', 'those', 'builtin', 'approaches', 'by', 'using', 'the', 'extension', 'points', 'and', 'executing', 'approaches', 'implementations', 'from', 'astor', 'in', 'their', 'evaluations', 'the', 'implementations', 'of', 'the', 'repair', 'approaches', 'built', 'over', 'astor', 'are', 'capable', 'of', 'repair', 'in', 'total', '98', 'real', 'bugs', 'from', '5', 'large', 'java', 'programs']] | [-0.11966968790198175, -0.025825863918110443, -0.058605815486934706, 0.0047685364314999715, -0.09135844936737647, -0.21126250676715222, 0.05853758081137083, 0.3751797706235009, -0.21914103454313216, -0.3245724540681411, 0.11070380066402065, -0.2609640782746749, -0.14538180894481065, 0.2192378304206217, -0.1201404474878636, 0.0921735309327069, 0.08853687242222712, -0.021728511551060738, -0.07952143003423817, -0.28635114949160756, 0.2592958048945617, 0.07282227877145395, 0.2962406638699273, -0.007920993941250997, 0.040622015120700385, 0.013198537355623183, -0.06736913988701045, 0.005901883951856946, -0.08937731476049894, 0.16627499683736227, 0.3508708442429988, 0.290078498796039, 0.32681224504246925, -0.4054982785583259, -0.21403764786843496, 0.052903836764072856, 0.14556579039826129, 0.12357804973920186, -0.00609441221667788, -0.25405539109920844, 0.12288060523271083, -0.22514872581889042, -0.04189066399032107, -0.12724905611577036, -0.026418972982523534, 0.000565646552385237, -0.2392137961032299, -0.05949889417403401, 0.03486277979488174, 0.09911029630770476, -0.04926173064666681, -0.14957694818910497, 0.06688469040971727, 0.1200228799158373, 0.045788106637505384, 0.06539977666480132, 0.16376921253469892, -0.05213783823046236, -0.24452372016146398, 0.35291425335961274, 0.028002477303529397, -0.18013270204253973, 0.21513316821488282, 0.055502527355192566, -0.1614780087238894, 0.15785875756962178, 0.18096112669385875, 0.10025061714009215, -0.19828459883395297, 0.10380464252263594, 0.022876056364904612, 0.16142731358950885, 0.08916073300374242, 0.012028474631687202, 0.19965351860110575, 0.21101157549911967, 0.04320642964799518, 0.13701717408541111, -0.03787070538696403, -0.07661068588107203, -0.2919976961536285, -0.15672263910946174, -0.12037056269458471, -0.03921743728793584, -0.036176247677306095, -0.1606937533429561, 0.4251622196155576, 0.212816377556047, 0.10199827635899568, 0.10746975898599395, 0.37606722947974236, -0.01647907982592304, 0.23723074505374264, 0.17606281894139755, 0.12830252199648665, -0.01601578905605353, 0.07571031962019893, -0.13336372713391215, 0.11658518038681136, 0.055842785596943056] |
1,802.03366 | Alignment Limit in 2HDM: Robustness put to test | In a two-Higgs-doublet model (2HDM), at the vicinity of the alignment limit,
the extra contributions to the couplings of the SM-like Higgs with other
particles can be subdominant to the same coming from the six dimensional
operators. In this context, we revisit the alignment limit itself. It is
investigated to what extent these operators can mask the actual alignment in a
2HDM. The bosonic operators which rescale the Higgs kinetic terms can lead to
substantial change in the parameter space of the model. We find that some other
bosonic operators, which are severely constrained from the electroweak
precision tests, can also modify the parameter space of 2HDM due to their
anomalous momentum structures. A particular kind of Little Higgs model is
explored as an example of 2HDM effective field theory in connection with 2HDM
alignment. Choosing a suitable benchmark point in a Type-II 2HDM, we highlight
the possibility that the exact alignment limit is ruled out at 95% CL in
presence of such operators.
| hep-ph | in a twohiggsdoublet model 2hdm at the vicinity of the alignment limit the extra contributions to the couplings of the smlike higgs with other particles can be subdominant to the same coming from the six dimensional operators in this context we revisit the alignment limit itself it is investigated to what extent these operators can mask the actual alignment in a 2hdm the bosonic operators which rescale the higgs kinetic terms can lead to substantial change in the parameter space of the model we find that some other bosonic operators which are severely constrained from the electroweak precision tests can also modify the parameter space of 2hdm due to their anomalous momentum structures a particular kind of little higgs model is explored as an example of 2hdm effective field theory in connection with 2hdm alignment choosing a suitable benchmark point in a typeii 2hdm we highlight the possibility that the exact alignment limit is ruled out at 95 cl in presence of such operators | [['in', 'a', 'twohiggsdoublet', 'model', '2hdm', 'at', 'the', 'vicinity', 'of', 'the', 'alignment', 'limit', 'the', 'extra', 'contributions', 'to', 'the', 'couplings', 'of', 'the', 'smlike', 'higgs', 'with', 'other', 'particles', 'can', 'be', 'subdominant', 'to', 'the', 'same', 'coming', 'from', 'the', 'six', 'dimensional', 'operators', 'in', 'this', 'context', 'we', 'revisit', 'the', 'alignment', 'limit', 'itself', 'it', 'is', 'investigated', 'to', 'what', 'extent', 'these', 'operators', 'can', 'mask', 'the', 'actual', 'alignment', 'in', 'a', '2hdm', 'the', 'bosonic', 'operators', 'which', 'rescale', 'the', 'higgs', 'kinetic', 'terms', 'can', 'lead', 'to', 'substantial', 'change', 'in', 'the', 'parameter', 'space', 'of', 'the', 'model', 'we', 'find', 'that', 'some', 'other', 'bosonic', 'operators', 'which', 'are', 'severely', 'constrained', 'from', 'the', 'electroweak', 'precision', 'tests', 'can', 'also', 'modify', 'the', 'parameter', 'space', 'of', '2hdm', 'due', 'to', 'their', 'anomalous', 'momentum', 'structures', 'a', 'particular', 'kind', 'of', 'little', 'higgs', 'model', 'is', 'explored', 'as', 'an', 'example', 'of', '2hdm', 'effective', 'field', 'theory', 'in', 'connection', 'with', '2hdm', 'alignment', 'choosing', 'a', 'suitable', 'benchmark', 'point', 'in', 'a', 'typeii', '2hdm', 'we', 'highlight', 'the', 'possibility', 'that', 'the', 'exact', 'alignment', 'limit', 'is', 'ruled', 'out', 'at', '95', 'cl', 'in', 'presence', 'of', 'such', 'operators']] | [-0.1309372629677854, 0.16505323959702253, -0.015133831838838666, 0.14816352270583327, -0.08976141985352491, -0.1719544528012459, 0.05560436230309012, 0.3247991205738267, -0.2412075261931821, -0.2776195424631601, 0.06621782481741365, -0.2559953557935021, -0.10618128101966094, 0.11676951873871474, -0.012110076254097426, 0.026174046098476095, 0.03529927371603596, 0.02649553663597056, -0.09987288067847058, -0.2638652365819392, 0.32823953023407515, 0.05294709539370293, 0.2284737415498168, 0.034413277130380907, 0.04160956103672705, -0.027716590829829617, 0.010647724151168382, -0.024552970423672642, -0.10830760127114113, 0.10562352032724359, 0.19475337892214245, 0.050227108814685444, 0.1583029434124644, -0.3576511316478434, -0.1917778518442746, 0.18004326252039612, 0.18578334889238382, 0.1257175873615779, -0.017186999559493328, -0.31918373748251216, 0.044026992292279694, -0.19147678960410014, -0.12599515965458277, -0.07230688018792468, -0.07066898576832921, -0.0932525238320345, -0.3076656298405241, 0.061958336248985356, 0.011287631114899385, 0.034301937858733096, -0.022864774031360155, -0.10745674657504778, -0.07854314792685484, 0.033314014109214994, 0.13103627806909882, 0.018933814900597874, 0.13633859693072736, -0.18850680131085604, -0.1275577928009159, 0.41673224120082836, -0.1100955270674426, -0.24709735720605794, 0.16125154689596058, -0.1773417327076015, -0.16327415548389915, 0.09770070735745631, 0.17282892387962287, 0.07638982481272784, -0.16526820309028575, 0.21509759238830245, -0.029264814613625498, 0.14495115290575508, 0.02984667255077511, 0.06849362633599923, 0.254634198275531, 0.1642134322624415, 0.04979406274491694, 0.10957258401109224, -0.1009956682100892, -0.13444867581356226, -0.40142471293305476, -0.1311256861812492, -0.0860928068797831, 0.023861077188218876, -0.11811300866549307, -0.12368862457550699, 0.3990922062146682, 0.1933084407423072, 0.23869712402328577, -0.026761327090775368, 0.26257820242289, 0.11526405261531358, 0.11785253838559406, -0.02730611008705526, 0.3393444598422786, 0.07924811356905394, 0.08988571410648036, -0.2056982915521253, 0.02279370464100616, 0.08018697155980258] |
1,802.03367 | When Textbook RSA is Used to Protect the Privacy of Hundreds of Millions
of Users | We evaluate Tencent's QQ Browser, a popular mobile browser in China with
hundreds of millions of users---including 16 million overseas, with respect to
the threat model of a man-in-the-middle attacker with state actor capabilities.
This is motivated by information in the Snowden revelations suggesting that
another Chinese mobile browser, UC Browser, was being used to track users by
Western nation-state adversaries.
Among the many issues we found in QQ Browser that are presented in this
paper, the use of "textbook RSA"---that is, RSA implemented as shown in
textbooks, with no padding---is particularly interesting because it affords us
the opportunity to contextualize existing research in breaking textbook RSA. We
also present a novel attack on QQ Browser's use of textbook RSA that is
distinguished from previous research by its simplicity. We emphasize that
although QQ Browser's cryptography and our attacks on it are very simple, the
impact is serious. Thus, research into how to break very poor cryptography
(such as textbook RSA) has both pedagogical value and real-world impact.
| cs.CR | we evaluate tencents qq browser a popular mobile browser in china with hundreds of millions of usersincluding 16 million overseas with respect to the threat model of a maninthemiddle attacker with state actor capabilities this is motivated by information in the snowden revelations suggesting that another chinese mobile browser uc browser was being used to track users by western nationstate adversaries among the many issues we found in qq browser that are presented in this paper the use of textbook rsathat is rsa implemented as shown in textbooks with no paddingis particularly interesting because it affords us the opportunity to contextualize existing research in breaking textbook rsa we also present a novel attack on qq browsers use of textbook rsa that is distinguished from previous research by its simplicity we emphasize that although qq browsers cryptography and our attacks on it are very simple the impact is serious thus research into how to break very poor cryptography such as textbook rsa has both pedagogical value and realworld impact | [['we', 'evaluate', 'tencents', 'qq', 'browser', 'a', 'popular', 'mobile', 'browser', 'in', 'china', 'with', 'hundreds', 'of', 'millions', 'of', 'usersincluding', '16', 'million', 'overseas', 'with', 'respect', 'to', 'the', 'threat', 'model', 'of', 'a', 'maninthemiddle', 'attacker', 'with', 'state', 'actor', 'capabilities', 'this', 'is', 'motivated', 'by', 'information', 'in', 'the', 'snowden', 'revelations', 'suggesting', 'that', 'another', 'chinese', 'mobile', 'browser', 'uc', 'browser', 'was', 'being', 'used', 'to', 'track', 'users', 'by', 'western', 'nationstate', 'adversaries', 'among', 'the', 'many', 'issues', 'we', 'found', 'in', 'qq', 'browser', 'that', 'are', 'presented', 'in', 'this', 'paper', 'the', 'use', 'of', 'textbook', 'rsathat', 'is', 'rsa', 'implemented', 'as', 'shown', 'in', 'textbooks', 'with', 'no', 'paddingis', 'particularly', 'interesting', 'because', 'it', 'affords', 'us', 'the', 'opportunity', 'to', 'contextualize', 'existing', 'research', 'in', 'breaking', 'textbook', 'rsa', 'we', 'also', 'present', 'a', 'novel', 'attack', 'on', 'qq', 'browsers', 'use', 'of', 'textbook', 'rsa', 'that', 'is', 'distinguished', 'from', 'previous', 'research', 'by', 'its', 'simplicity', 'we', 'emphasize', 'that', 'although', 'qq', 'browsers', 'cryptography', 'and', 'our', 'attacks', 'on', 'it', 'are', 'very', 'simple', 'the', 'impact', 'is', 'serious', 'thus', 'research', 'into', 'how', 'to', 'break', 'very', 'poor', 'cryptography', 'such', 'as', 'textbook', 'rsa', 'has', 'both', 'pedagogical', 'value', 'and', 'realworld', 'impact']] | [-0.08634971708510775, -0.003636259168227453, -0.10343843433869684, 0.08617631492926171, -0.13635599484848904, -0.2510673981855578, 0.06020653605242487, 0.37444735654039174, -0.24565157768736798, -0.3290032918622473, 0.0882015094833971, -0.3268424033829034, -0.17033706992160438, 0.24091356092419408, -0.1386112058790764, 0.015171565501255029, 0.01987816950181363, 0.02472112115143185, 0.010960026340177226, -0.3186274010307587, 0.2649658933571517, 0.06246105100669921, 0.298035458009974, 0.09119584439208776, -0.006130173373626682, 0.029685686637715595, -0.050447750232173925, -0.06210465698287163, -0.06526990308622949, 0.09358593701135094, 0.3267860705964267, 0.20268516090454353, 0.3308751782907809, -0.40953530668758037, -0.14888773520800808, 0.07048566492910428, 0.15439972976824587, 0.0941895845533553, -0.11574597424677029, -0.30790600185168954, 0.10572134714897313, -0.26454484015816776, -0.07580877190012848, -0.06842368700408104, 0.04263934373526221, -0.006370128561152009, -0.16412855043053265, -0.022209247212364374, 0.02149842430343397, 0.10312975540958777, 0.061109467008486164, -0.09750760716624648, 0.014573330608361242, 0.1536024929643268, 0.10851532375232725, 0.01659994579428557, 0.17641016271919374, -0.14243608592577647, -0.15613730527778588, 0.4207297296422284, -0.026179855925076437, -0.10557232479985076, 0.20492292413624322, -0.03589193349158982, -0.14337991893280116, 0.08361633259962063, 0.1770321903544444, 0.08601143742093771, -0.16631471239390255, 0.08277303183555287, -0.06099209496069972, 0.20789652177851034, 0.06169660636876914, 0.008404256090260588, 0.19060242716109427, 0.17708868994633098, 0.013231090070870024, 0.12867334393088573, -0.03630806931802753, -0.12656394243751448, -0.22579549528976403, -0.1546269466365097, -0.15217974253862007, 0.020261993193033536, -0.006365518465960432, -0.15261162274638504, 0.37654251751785234, 0.23735945257812557, 0.12406357644954924, -0.0005780982773569299, 0.35540622543038164, -0.045493080495805596, 0.12967246870095728, 0.10948307386872064, 0.20235453045035418, -0.0016728659776584587, 0.175264122935648, -0.10478634836305524, 0.12562255070987727, -0.024772791754491288] |
1,802.03368 | Moments of inertia of neutron stars in relativistic mean field theory:
the role of the isovector scalar channel | With the inclusion of the isovector scalar channel in the meson-nucleon
couplings, taking DD-ME$\delta$ as an effective interaction, the moments of
inertia of neutron stars possessing various stellar masses are studied within
the density dependent relativistic mean field (RMF) theory. The isovector
scalar channel contributes to the softening of the neutron-star matter equation
of state (EOS) and therefore the reduction of the maximum mass and radius of
neutron stars. Smaller values of the total moment of inertia $I$ and the
crustal moment of inertia $\Delta{I}$ are then obtained in DD-ME$\delta$ via
numerical procedure in comparison with those in other selected RMF functionals.
In addition, the involvement of the isovector scalar channel lowers the
thickness of the neutron star crust and its mass fraction as well. The
sensitivity to both the crustal mass and stellar radius causes the crustal
moment of inertia to be more obviously reduced than the total one, eventually
leading to a suppression on the fraction of crustal moment of inertia
$\Delta{I}/I$ in DD-ME$\delta$. The results indicate the crustal moment of
inertia as a more sensitive probe of the neutron-star matter EOS than the total
one, and demonstrate that the isovector scalar meson-nucleon couplings in the
RMF theory could exert influence over the physics of pulsar glitches.
| nucl-th astro-ph.HE | with the inclusion of the isovector scalar channel in the mesonnucleon couplings taking ddmedelta as an effective interaction the moments of inertia of neutron stars possessing various stellar masses are studied within the density dependent relativistic mean field rmf theory the isovector scalar channel contributes to the softening of the neutronstar matter equation of state eos and therefore the reduction of the maximum mass and radius of neutron stars smaller values of the total moment of inertia i and the crustal moment of inertia deltai are then obtained in ddmedelta via numerical procedure in comparison with those in other selected rmf functionals in addition the involvement of the isovector scalar channel lowers the thickness of the neutron star crust and its mass fraction as well the sensitivity to both the crustal mass and stellar radius causes the crustal moment of inertia to be more obviously reduced than the total one eventually leading to a suppression on the fraction of crustal moment of inertia deltaii in ddmedelta the results indicate the crustal moment of inertia as a more sensitive probe of the neutronstar matter eos than the total one and demonstrate that the isovector scalar mesonnucleon couplings in the rmf theory could exert influence over the physics of pulsar glitches | [['with', 'the', 'inclusion', 'of', 'the', 'isovector', 'scalar', 'channel', 'in', 'the', 'mesonnucleon', 'couplings', 'taking', 'ddmedelta', 'as', 'an', 'effective', 'interaction', 'the', 'moments', 'of', 'inertia', 'of', 'neutron', 'stars', 'possessing', 'various', 'stellar', 'masses', 'are', 'studied', 'within', 'the', 'density', 'dependent', 'relativistic', 'mean', 'field', 'rmf', 'theory', 'the', 'isovector', 'scalar', 'channel', 'contributes', 'to', 'the', 'softening', 'of', 'the', 'neutronstar', 'matter', 'equation', 'of', 'state', 'eos', 'and', 'therefore', 'the', 'reduction', 'of', 'the', 'maximum', 'mass', 'and', 'radius', 'of', 'neutron', 'stars', 'smaller', 'values', 'of', 'the', 'total', 'moment', 'of', 'inertia', 'i', 'and', 'the', 'crustal', 'moment', 'of', 'inertia', 'deltai', 'are', 'then', 'obtained', 'in', 'ddmedelta', 'via', 'numerical', 'procedure', 'in', 'comparison', 'with', 'those', 'in', 'other', 'selected', 'rmf', 'functionals', 'in', 'addition', 'the', 'involvement', 'of', 'the', 'isovector', 'scalar', 'channel', 'lowers', 'the', 'thickness', 'of', 'the', 'neutron', 'star', 'crust', 'and', 'its', 'mass', 'fraction', 'as', 'well', 'the', 'sensitivity', 'to', 'both', 'the', 'crustal', 'mass', 'and', 'stellar', 'radius', 'causes', 'the', 'crustal', 'moment', 'of', 'inertia', 'to', 'be', 'more', 'obviously', 'reduced', 'than', 'the', 'total', 'one', 'eventually', 'leading', 'to', 'a', 'suppression', 'on', 'the', 'fraction', 'of', 'crustal', 'moment', 'of', 'inertia', 'deltaii', 'in', 'ddmedelta', 'the', 'results', 'indicate', 'the', 'crustal', 'moment', 'of', 'inertia', 'as', 'a', 'more', 'sensitive', 'probe', 'of', 'the', 'neutronstar', 'matter', 'eos', 'than', 'the', 'total', 'one', 'and', 'demonstrate', 'that', 'the', 'isovector', 'scalar', 'mesonnucleon', 'couplings', 'in', 'the', 'rmf', 'theory', 'could', 'exert', 'influence', 'over', 'the', 'physics', 'of', 'pulsar', 'glitches']] | [-0.10768645614399038, 0.24950544719083084, -0.07544286414430154, 0.10191366328665306, -0.11252060668686262, -0.016260432802552644, 0.02354091101873424, 0.2720355722793521, -0.17385873700438353, -0.34654374075930366, -0.0043404520144507, -0.2856942367014618, -0.006321525964617299, 0.15635416902771865, 0.036536905480506206, -0.008976140895356366, 0.048781608628185216, 0.12181775983369264, -0.1036375695447742, -0.19949930883565406, 0.3194140958904217, 0.051089674449310854, 0.18009994327327988, 0.08805959424521112, 0.042466468886302136, -0.01861808488963736, 0.008011589496163651, 0.005840297638384912, -0.12568406611720861, 0.07676916010565876, 0.17553153898720317, 0.050007938309975616, 0.16880392038729042, -0.44016444908741575, -0.20632319829522971, 0.07893826367440991, 0.08840423362394526, 0.06597118608960255, -0.007314358731701549, -0.2651061079008147, 0.051303951079227354, -0.2901216788808457, -0.154315295788155, -0.0830397029438665, 0.03198974079116222, 0.07085968936399485, -0.26982610108993516, 0.1611742921294745, 0.04384590899560582, 0.019683627015463293, -0.17354951746584937, -0.2663093709337633, -0.06338577830152084, 0.028372496980759585, 0.15976347871988905, 0.039005156845423, 0.19557052574013, -0.21061053167375995, 0.01060411668424002, 0.4008566119636481, -0.07778506355134596, -0.15366102498956025, 0.0880268368936623, -0.2000379843520932, -0.10804396200602731, 0.12763303505086626, 0.18040654053374267, 0.12101533229640783, -0.12848914099875122, 0.0381527243371238, 0.018419618332700338, 0.1852256691781804, 0.04915400901742172, 0.03185664156514507, 0.2761336851309842, 0.17194407182334823, 0.03454527224396141, 0.07262060688802964, -0.18820707921762592, -0.09708947473084734, -0.2981769977917653, -0.07376039163388598, -0.15456196225624388, 0.051152115884738475, -0.14450309181470053, -0.12840399113002393, 0.3559270284514731, 0.0821946077944281, 0.13228396765211634, 0.006601931247412442, 0.2814928939780937, 0.11447650371470584, 0.09706492559053004, 0.07006923786208902, 0.3606912348589573, 0.31040030147414654, 0.06561504951129721, -0.36230379380420064, 0.0702176647005567, 0.03161507619817992] |
1,802.03369 | Generalized Heisenberg algebra and (non linear) pseudo-bosons | We propose a deformed version of the generalized Heisenberg algebra by using
techniques borrowed from the theory of pseudo-bosons. In particular, this
analysis is relevant when non self-adjoint Hamiltonians are needed to describe
a given physical system. We also discuss relations with nonlinear
pseudo-bosons. Several examples are discussed.
| math-ph math.MP quant-ph | we propose a deformed version of the generalized heisenberg algebra by using techniques borrowed from the theory of pseudobosons in particular this analysis is relevant when non selfadjoint hamiltonians are needed to describe a given physical system we also discuss relations with nonlinear pseudobosons several examples are discussed | [['we', 'propose', 'a', 'deformed', 'version', 'of', 'the', 'generalized', 'heisenberg', 'algebra', 'by', 'using', 'techniques', 'borrowed', 'from', 'the', 'theory', 'of', 'pseudobosons', 'in', 'particular', 'this', 'analysis', 'is', 'relevant', 'when', 'non', 'selfadjoint', 'hamiltonians', 'are', 'needed', 'to', 'describe', 'a', 'given', 'physical', 'system', 'we', 'also', 'discuss', 'relations', 'with', 'nonlinear', 'pseudobosons', 'several', 'examples', 'are', 'discussed']] | [-0.09057641501810092, 0.12225691261604273, -0.06834389767997588, 0.12513721756113227, -0.09183907774665083, -0.1558292532378497, -0.043316880447188545, 0.3430259465045917, -0.2868785784424593, -0.2297607821674319, 0.11769145475166927, -0.2876759495702572, -0.241964108000199, 0.2183520955926118, -0.11000289164561157, 0.062289716103502236, 0.050674599556562804, 0.05696189533045981, -0.15508684175438248, -0.19563961560682705, 0.41000072639629553, 0.01013977639740915, 0.20018440320078904, 0.002546297531807795, 0.06931386677509484, 0.04532304426053694, -0.021414246254911024, 0.03070131902738164, -0.177715496441427, 0.1595199282746762, 0.2644617194843401, 0.11540893116034567, 0.23794256577578685, -0.43008984458477545, -0.19037636703190705, 0.08198460070222306, 0.11236102824720244, 0.16746515838894993, -0.024841821771891166, -0.3036740454651105, 0.032005206507164985, -0.22972935313979784, -0.1450920965774761, -0.17885948164621368, -0.02376879002743711, 0.03212529793381691, -0.19867453211918473, 0.0682592593117685, 0.06636373333943386, 0.08651725361899783, -0.06335814975318499, -0.08894368071681431, 0.014777765599622702, 0.036068722109121154, -0.006607291458446222, -0.061963167206461854, 0.07591603938878204, -0.04347325779478221, -0.1710090590446877, 0.4116756299044937, -0.013993302384430232, -0.2634978127510597, 0.14967278233962134, -0.10822985207778402, -0.18278424289504377, 0.006155283238816385, 0.12438899323266621, 0.11625106493011117, -0.1875050972439567, 0.16507650209435573, -0.07302621823813145, 0.10012417038281758, -0.004094934871924731, 0.046185033900352813, 0.13926475190479928, 0.13231226257630624, -0.006055570847820491, 0.20553835978110632, 0.03599487392542263, -0.13700811349553987, -0.39057990722358227, -0.08483236029860564, -0.14096377028423981, 0.050331647607284445, -0.06625031550356653, -0.13181723250697056, 0.3983111225922282, 0.18606887399801053, 0.16647163839176451, 0.02000476881706466, 0.21064867802973217, 0.17944885286851786, 0.03904701980839794, 0.056167513374627255, 0.2048285335113178, 0.20487359579904782, 0.0703937777725514, -0.16309573226074767, -0.06955027308625479, 0.16164466817766274] |
1,802.0337 | Cosmological aspects of the Eisenhart-Duval lift | A cosmological extension of the Eisenhart-Duval metric is constructed by
incorporating a cosmic scale factor and the energy-momentum tensor into the
scheme. The dynamics of the spacetime is governed the Ermakov-Milne-Pinney
equation. Killing isometries include spatial translations and rotations,
Newton--Hooke boosts and translation in the null direction. Geodesic motion in
Ermakov-Milne-Pinney cosmoi is analyzed. The derivation of the Ermakov-Lewis
invariant, the Friedmann equations and the Dmitriev-Zel'dovich equations within
the Eisenhart--Duval framework is presented.
| gr-qc astro-ph.CO hep-th math-ph math.MP | a cosmological extension of the eisenhartduval metric is constructed by incorporating a cosmic scale factor and the energymomentum tensor into the scheme the dynamics of the spacetime is governed the ermakovmilnepinney equation killing isometries include spatial translations and rotations newtonhooke boosts and translation in the null direction geodesic motion in ermakovmilnepinney cosmoi is analyzed the derivation of the ermakovlewis invariant the friedmann equations and the dmitrievzeldovich equations within the eisenhartduval framework is presented | [['a', 'cosmological', 'extension', 'of', 'the', 'eisenhartduval', 'metric', 'is', 'constructed', 'by', 'incorporating', 'a', 'cosmic', 'scale', 'factor', 'and', 'the', 'energymomentum', 'tensor', 'into', 'the', 'scheme', 'the', 'dynamics', 'of', 'the', 'spacetime', 'is', 'governed', 'the', 'ermakovmilnepinney', 'equation', 'killing', 'isometries', 'include', 'spatial', 'translations', 'and', 'rotations', 'newtonhooke', 'boosts', 'and', 'translation', 'in', 'the', 'null', 'direction', 'geodesic', 'motion', 'in', 'ermakovmilnepinney', 'cosmoi', 'is', 'analyzed', 'the', 'derivation', 'of', 'the', 'ermakovlewis', 'invariant', 'the', 'friedmann', 'equations', 'and', 'the', 'dmitrievzeldovich', 'equations', 'within', 'the', 'eisenhartduval', 'framework', 'is', 'presented']] | [-0.18746042406370103, 0.11789373657010285, -0.09860289721211916, 0.06275355476479401, -0.11489043815035216, -0.07605628952921802, -0.11681240354500659, 0.29929095068552963, -0.27927150298565834, -0.2281842593261054, 0.05941745880819057, -0.26014163384450156, -0.10982765273099214, 0.11364093157921878, -0.0288801170413343, 0.05100669643700674, -0.0017190895922167201, 0.04725433811283027, -0.09483548760755171, -0.19417589382124198, 0.37669690032030495, 0.08064218998794824, 0.3222705319550046, -0.021134792367967083, 0.2625455237584005, -0.014300162025110823, -0.09837331283758853, 0.04013169853305313, -0.11517699717701425, 0.07351532978543514, 0.13944699598187713, 0.11263436602238355, 0.1650482213426329, -0.3750344217217094, -0.21725526021655753, 0.03264479407332313, 0.1260381092409223, 0.1266392452353743, -0.022288034591351598, -0.39448740039492997, 0.018231529762155155, -0.12469959497766596, -0.18000927154945445, -0.07178060741911471, 0.006142289262973297, -0.07110614926409974, -0.19275816453253508, 0.14424369515667498, 0.11887645797525667, 0.013167979218669131, -0.1463848421461618, -0.01673457704559887, -0.04459865012166785, 0.04643141004768476, 0.10654335594276937, 0.047126886893955756, 0.1309788958235106, -0.09226803654726122, -0.10514631302712459, 0.4689129286931014, -0.1012287575826967, -0.3690872264265175, 0.038439653249798526, -0.1429245753974562, -0.0974497577293553, 0.08929779670450469, 0.13228635750973308, 0.13838879586997585, -0.20769967921865237, 0.21542570613731277, -0.007275311250082204, 0.08611711290415744, 0.1109171251759825, -0.03189558927527249, 0.15602377306302667, 0.10483457325157565, 0.037707340129664244, 0.09387182791940343, -0.012994716075104726, -0.159094618187404, -0.395988596524571, -0.19026401776715485, -0.11196435979423179, 0.09088815948073294, -0.18548385703093437, -0.12333119705214467, 0.3870051226590028, 0.07300253800185345, 0.11775225535458164, 0.05297574555684983, 0.22948618526865636, 0.11264901999121821, 0.0892427285582247, 0.14213588080880507, 0.23490016696266305, 0.20264494777525918, 0.07356066576821703, -0.25277107823590916, -0.03906841109782248, 0.1883582240101737] |
1,802.03371 | Some inequalities related to differential monomials | The aim of this paper is to consider the value distribution of a differential
monomial generated by a transcendental meromorphic function.
| math.CV | the aim of this paper is to consider the value distribution of a differential monomial generated by a transcendental meromorphic function | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'consider', 'the', 'value', 'distribution', 'of', 'a', 'differential', 'monomial', 'generated', 'by', 'a', 'transcendental', 'meromorphic', 'function']] | [-0.18832858696225144, -8.476516675381434e-05, -0.09247673023492098, 0.06287050903553054, -0.11945473101167452, -0.04123338280866543, -0.016295469360470417, 0.24403602133194605, -0.3629939101991199, -0.2042767238758859, 0.06852835771583375, -0.2636562181370599, -0.16440484739307845, 0.16632549337200112, -0.08881400702964692, 0.09484397868315379, 0.005481602757104805, 0.05023368856027013, -0.06324388126709632, -0.2895621227300061, 0.5174442600636255, -0.020963347827394802, 0.1600907136287008, 0.0021239054344949267, 0.13592539497074627, -0.006381480466751825, -0.057990197979268576, -0.065603592920871, -0.19035702531359025, 0.16342534439726955, 0.28802046694216277, 0.1300825346261263, 0.36650587520783856, -0.32836413924537955, -0.13702852553909733, 0.21687830612063408, 0.13003870321526415, -0.014129195628421647, -0.036363408324264344, -0.15746966199505896, 0.10328926774673164, -0.17824770702004789, -0.2622621692938819, -0.016381630585307165, 0.043131054600789434, 0.06853093455235164, -0.34968465389240355, 0.010262121712522847, 0.05567465970913569, 0.13797044479066417, 7.592161585177694e-05, -0.0708129560308797, -0.04746195137323368, 0.013673196679779462, 0.028477539668702298, 0.11227893665255535, 0.0788579545028153, -0.170917920579779, -0.06221694188813368, 0.3417219225139845, -0.13011516062986284, -0.2560354959042299, 0.027883403845840975, -0.20969124934414313, -0.07326045454967589, 0.12415663844772748, 0.14288150576785916, 0.20835029724098386, -0.19934890822817883, 0.15149573870890198, -0.11734726949639264, 0.13291132782718965, 0.06796887574628704, -0.0851520961150527, 0.1821823056255068, 0.08659320200483005, 0.07246103647741534, 0.2182808064279102, 0.03997178670639793, -0.053903243194023766, -0.3614874744699115, -0.1840227665601387, -0.18044108223347438, 0.12281630742585375, -0.006004724385482925, -0.19554082942860468, 0.5493563546666077, 0.1278243265336468, 0.2252005592343353, 0.1398988277429626, 0.24722898840194657, 0.22285472433127107, -0.014665928713622548, -0.0334481766580471, 0.1316153830183404, 0.1575578241609037, 0.07520496627936761, -0.18335716189107015, 0.06463385085087447, 0.13036443035872208] |
1,802.03372 | Synergistic interactions promote behavior spreading and alter phase
transition on multiplex networks | Synergistic interactions are ubiquitous in the real world. Recent studies
have revealed that, for a single-layer network, synergy can enhance spreading
and even induce an explosive contagion. There is at the present a growing
interest in behavior spreading dynamics on multiplex networks. What is the role
of synergistic interactions in behavior spreading in such networked systems? To
address this question, we articulate a synergistic behavior spreading model on
a double layer network, where the key manifestation of the synergistic
interactions is that the adoption of one behavior by a node in one layer
enhances its probability of adopting the behavior in the other layer. A general
result is that synergistic interactions can greatly enhance the spreading of
the behaviors in both layers. A remarkable phenomenon is that the interactions
can alter the nature of the phase transition associated with behavior adoption
or spreading dynamics. In particular, depending on the transmission rate of one
behavior in a network layer, synergistic interactions can lead to a
discontinuous (first-order) or a continuous (second-order) transition in the
adoption scope of the other behavior with respect to its transmission rate. A
surprising two-stage spreading process can arise: due to synergy, nodes having
adopted one behavior in one layer adopt the other behavior in the other layer
and then prompt the remaining nodes in this layer to quickly adopt the
behavior. Analytically, we develop an edge-based compartmental theory and
perform a bifurcation analysis to fully understand, in the weak synergistic
interaction regime where the dynamical correlation between the network layers
is negligible, the role of the interactions in promoting the social behavioral
spreading dynamics in the whole system.
| physics.soc-ph cs.SI | synergistic interactions are ubiquitous in the real world recent studies have revealed that for a singlelayer network synergy can enhance spreading and even induce an explosive contagion there is at the present a growing interest in behavior spreading dynamics on multiplex networks what is the role of synergistic interactions in behavior spreading in such networked systems to address this question we articulate a synergistic behavior spreading model on a double layer network where the key manifestation of the synergistic interactions is that the adoption of one behavior by a node in one layer enhances its probability of adopting the behavior in the other layer a general result is that synergistic interactions can greatly enhance the spreading of the behaviors in both layers a remarkable phenomenon is that the interactions can alter the nature of the phase transition associated with behavior adoption or spreading dynamics in particular depending on the transmission rate of one behavior in a network layer synergistic interactions can lead to a discontinuous firstorder or a continuous secondorder transition in the adoption scope of the other behavior with respect to its transmission rate a surprising twostage spreading process can arise due to synergy nodes having adopted one behavior in one layer adopt the other behavior in the other layer and then prompt the remaining nodes in this layer to quickly adopt the behavior analytically we develop an edgebased compartmental theory and perform a bifurcation analysis to fully understand in the weak synergistic interaction regime where the dynamical correlation between the network layers is negligible the role of the interactions in promoting the social behavioral spreading dynamics in the whole system | [['synergistic', 'interactions', 'are', 'ubiquitous', 'in', 'the', 'real', 'world', 'recent', 'studies', 'have', 'revealed', 'that', 'for', 'a', 'singlelayer', 'network', 'synergy', 'can', 'enhance', 'spreading', 'and', 'even', 'induce', 'an', 'explosive', 'contagion', 'there', 'is', 'at', 'the', 'present', 'a', 'growing', 'interest', 'in', 'behavior', 'spreading', 'dynamics', 'on', 'multiplex', 'networks', 'what', 'is', 'the', 'role', 'of', 'synergistic', 'interactions', 'in', 'behavior', 'spreading', 'in', 'such', 'networked', 'systems', 'to', 'address', 'this', 'question', 'we', 'articulate', 'a', 'synergistic', 'behavior', 'spreading', 'model', 'on', 'a', 'double', 'layer', 'network', 'where', 'the', 'key', 'manifestation', 'of', 'the', 'synergistic', 'interactions', 'is', 'that', 'the', 'adoption', 'of', 'one', 'behavior', 'by', 'a', 'node', 'in', 'one', 'layer', 'enhances', 'its', 'probability', 'of', 'adopting', 'the', 'behavior', 'in', 'the', 'other', 'layer', 'a', 'general', 'result', 'is', 'that', 'synergistic', 'interactions', 'can', 'greatly', 'enhance', 'the', 'spreading', 'of', 'the', 'behaviors', 'in', 'both', 'layers', 'a', 'remarkable', 'phenomenon', 'is', 'that', 'the', 'interactions', 'can', 'alter', 'the', 'nature', 'of', 'the', 'phase', 'transition', 'associated', 'with', 'behavior', 'adoption', 'or', 'spreading', 'dynamics', 'in', 'particular', 'depending', 'on', 'the', 'transmission', 'rate', 'of', 'one', 'behavior', 'in', 'a', 'network', 'layer', 'synergistic', 'interactions', 'can', 'lead', 'to', 'a', 'discontinuous', 'firstorder', 'or', 'a', 'continuous', 'secondorder', 'transition', 'in', 'the', 'adoption', 'scope', 'of', 'the', 'other', 'behavior', 'with', 'respect', 'to', 'its', 'transmission', 'rate', 'a', 'surprising', 'twostage', 'spreading', 'process', 'can', 'arise', 'due', 'to', 'synergy', 'nodes', 'having', 'adopted', 'one', 'behavior', 'in', 'one', 'layer', 'adopt', 'the', 'other', 'behavior', 'in', 'the', 'other', 'layer', 'and', 'then', 'prompt', 'the', 'remaining', 'nodes', 'in', 'this', 'layer', 'to', 'quickly', 'adopt', 'the', 'behavior', 'analytically', 'we', 'develop', 'an', 'edgebased', 'compartmental', 'theory', 'and', 'perform', 'a', 'bifurcation', 'analysis', 'to', 'fully', 'understand', 'in', 'the', 'weak', 'synergistic', 'interaction', 'regime', 'where', 'the', 'dynamical', 'correlation', 'between', 'the', 'network', 'layers', 'is', 'negligible', 'the', 'role', 'of', 'the', 'interactions', 'in', 'promoting', 'the', 'social', 'behavioral', 'spreading', 'dynamics', 'in', 'the', 'whole', 'system']] | [-0.18137920765387688, 0.1063648526530468, -0.07215193814665648, 0.04866374784382836, -0.05226369514061576, -0.14973952386208111, 0.06421050314854844, 0.3547866781547568, -0.3335249970550649, -0.23485337351453114, 0.05781460957009318, -0.31583412801324706, -0.2595084293998833, 0.09899999291434035, -0.005949877380557796, -0.018740423657565022, 0.025305630628923503, 0.04212204966033289, -0.002661692481042872, -0.20278189419118195, 0.34747310124101416, 0.06459994185837893, 0.32746049176785164, 0.07376441878680934, 0.03959157255902777, 0.011437968916973606, 0.04145513916420682, 0.027592961356276646, -0.09101558633558264, 0.08900374341037069, 0.25005548672347416, 0.09908315010825926, 0.3197178491288522, -0.4707365653148907, -0.2992186199510744, 0.08251161751789315, 0.16936262874043997, 0.09608628997161492, -0.047862617731559164, -0.2534563315986067, 0.04038445614081437, -0.19677300681360066, -0.1075903060298194, -0.04121366615307873, -0.024230297635179286, 0.02494319327011266, -0.2625621414216071, 0.07412687434321817, 0.07026146454186613, 0.043911637257277855, 0.005413565063088968, -0.02272775488552939, -0.023246917855217094, 0.21428736211622462, 0.054000404835800084, -0.012909430395880276, 0.14681057426616248, -0.19051082457436302, -0.11712542593094814, 0.3570504817043376, -0.06617108318973539, -0.18441539613446795, 0.24119154634022646, -0.13005273010083543, -0.09896459811373942, 0.13420759743038455, 0.24022944273276473, 0.07418556249810054, -0.1496937861357925, 0.004639867927086444, 0.013520521734950735, 0.1854561064786086, 0.014867650050505558, 0.039570320814699, 0.18273044605516855, 0.2557046707960955, 0.05646111433281262, 0.12341851631080157, -0.05614224026730346, -0.17744170735514833, -0.21269488864174277, -0.12428628477124114, -0.13104263358657, 0.03143566999680094, -0.11175847654420282, -0.15818200741726768, 0.41832552040817544, 0.1691625891993788, 0.21802525623249547, 0.002796520904452978, 0.2526093657429823, 0.08372730338220101, 0.06807061874218669, 0.03455923684591385, 0.2879405440043603, 0.08333936264235116, 0.15317618959242657, -0.22049061386839158, 0.20134713673691937, 0.023994792047340202] |
1,802.03373 | InferBeam: A Fast Beam Alignment Protocol for Millimeter-wave Networking | We introduce fast millimeter-wave base station (BS) and its antenna sector
selection for user equipment based on its location. Using a conditional random
field inference model with specially designed parameters, which are robust to
change of environment, InferBeam allows the use of measurement samples on best
beam selection at a small number of locations to infer the rest dynamically.
Compared to beam-sweeping based approaches in the literature, InferBeam can
drastically reduce the setup cost for beam alignment for a new environment, and
also the latency in acquiring a new beam under intermittent blockage. We have
evaluated InferBeam using a discrete event simulation. Our results indicate
that the system can make best beam selection for 98% of locations in test
environments comprising smallsized apartment or office spaces, while sampling
fewer than 1% of locations. InferBeam is a complete protocol for best beam
inference that can be integrated into millimeter-wave standards for
accelerating the much-needed fast and economic beam alignment capability.
| cs.NI | we introduce fast millimeterwave base station bs and its antenna sector selection for user equipment based on its location using a conditional random field inference model with specially designed parameters which are robust to change of environment inferbeam allows the use of measurement samples on best beam selection at a small number of locations to infer the rest dynamically compared to beamsweeping based approaches in the literature inferbeam can drastically reduce the setup cost for beam alignment for a new environment and also the latency in acquiring a new beam under intermittent blockage we have evaluated inferbeam using a discrete event simulation our results indicate that the system can make best beam selection for 98 of locations in test environments comprising smallsized apartment or office spaces while sampling fewer than 1 of locations inferbeam is a complete protocol for best beam inference that can be integrated into millimeterwave standards for accelerating the muchneeded fast and economic beam alignment capability | [['we', 'introduce', 'fast', 'millimeterwave', 'base', 'station', 'bs', 'and', 'its', 'antenna', 'sector', 'selection', 'for', 'user', 'equipment', 'based', 'on', 'its', 'location', 'using', 'a', 'conditional', 'random', 'field', 'inference', 'model', 'with', 'specially', 'designed', 'parameters', 'which', 'are', 'robust', 'to', 'change', 'of', 'environment', 'inferbeam', 'allows', 'the', 'use', 'of', 'measurement', 'samples', 'on', 'best', 'beam', 'selection', 'at', 'a', 'small', 'number', 'of', 'locations', 'to', 'infer', 'the', 'rest', 'dynamically', 'compared', 'to', 'beamsweeping', 'based', 'approaches', 'in', 'the', 'literature', 'inferbeam', 'can', 'drastically', 'reduce', 'the', 'setup', 'cost', 'for', 'beam', 'alignment', 'for', 'a', 'new', 'environment', 'and', 'also', 'the', 'latency', 'in', 'acquiring', 'a', 'new', 'beam', 'under', 'intermittent', 'blockage', 'we', 'have', 'evaluated', 'inferbeam', 'using', 'a', 'discrete', 'event', 'simulation', 'our', 'results', 'indicate', 'that', 'the', 'system', 'can', 'make', 'best', 'beam', 'selection', 'for', '98', 'of', 'locations', 'in', 'test', 'environments', 'comprising', 'smallsized', 'apartment', 'or', 'office', 'spaces', 'while', 'sampling', 'fewer', 'than', '1', 'of', 'locations', 'inferbeam', 'is', 'a', 'complete', 'protocol', 'for', 'best', 'beam', 'inference', 'that', 'can', 'be', 'integrated', 'into', 'millimeterwave', 'standards', 'for', 'accelerating', 'the', 'muchneeded', 'fast', 'and', 'economic', 'beam', 'alignment', 'capability']] | [-0.12388084616084472, 0.06539964418764571, -0.057441930271942845, 0.04026102710078886, -0.09763724925055069, -0.19038503808584414, 0.10746042560141697, 0.4381105592591489, -0.18170855708607714, -0.3443684276697115, 0.10154144210029253, -0.21480147877523936, -0.07672913111277721, 0.21379328095178418, -0.07731507763664865, 0.06911626735148635, 0.08555143818686828, -0.006980022346694609, -0.03229207123687224, -0.2030028364600602, 0.25350957756946974, 0.1572223915162045, 0.3562396674053802, -0.04165367748326206, 0.11338825573787421, 0.029025136875340116, -0.022044891267487744, -0.006371972827627411, -0.0494598784875132, 0.099149731670231, 0.24940945164435221, 0.18291808954738784, 0.2685920812874892, -0.42472754670717056, -0.21985716168305972, 0.08196696896639026, 0.13486518763421607, 0.08718461915393032, -0.051190979069292125, -0.29029360897516915, 0.09559052065161273, -0.18632124289749455, -0.08591239378383418, -0.03313331598410114, -0.042611799701468424, 0.06073677125086703, -0.33393545455662477, -0.012713823091339777, -0.04170220534159046, 0.05737294611058333, -0.035311892258556875, -0.13017131875740634, 0.020680166510045058, 0.1325991176558972, -0.008412808255269046, 0.04182267554379625, 0.17441842974157734, -0.10076162965716384, -0.1004793860498558, 0.3757368703519211, -0.014855544302929574, -0.21808655486945883, 0.17985439505545223, -0.12287930044076119, -0.11367169939239258, 0.14556644896100973, 0.26058528088501787, 0.08411183123588094, -0.18228230697729583, -0.002320837584959706, 0.0047993618795800505, 0.19359457709258363, 0.07271230214058697, 0.03393869733849468, 0.18535666338771395, 0.21756902840552242, 0.12281525642471974, 0.13529227660608673, -0.15947850279249368, -0.07676190067098751, -0.2523488544144392, -0.12558148523613974, -0.17686753260241178, -0.006633496989712775, -0.0885924358802603, -0.09793459246544249, 0.3898959685550452, 0.18796460566831366, 0.1612934166793975, 0.0810864153718056, 0.35291042448308485, 0.039633240027253595, 0.07914818157354053, 0.08587671106142349, 0.19957314779586233, 0.03120669902964208, 0.11095419960278056, -0.18151871899564592, 0.09198429357313914, -0.0202501348041162] |
1,802.03374 | Generative ScatterNet Hybrid Deep Learning (G-SHDL) Network with
Structural Priors for Semantic Image Segmentation | This paper proposes a generative ScatterNet hybrid deep learning (G-SHDL)
network for semantic image segmentation. The proposed generative architecture
is able to train rapidly from relatively small labeled datasets using the
introduced structural priors. In addition, the number of filters in each layer
of the architecture is optimized resulting in a computationally efficient
architecture. The G-SHDL network produces state-of-the-art classification
performance against unsupervised and semi-supervised learning on two image
datasets. Advantages of the G-SHDL network over supervised methods are
demonstrated with experiments performed on training datasets of reduced size.
| cs.CV | this paper proposes a generative scatternet hybrid deep learning gshdl network for semantic image segmentation the proposed generative architecture is able to train rapidly from relatively small labeled datasets using the introduced structural priors in addition the number of filters in each layer of the architecture is optimized resulting in a computationally efficient architecture the gshdl network produces stateoftheart classification performance against unsupervised and semisupervised learning on two image datasets advantages of the gshdl network over supervised methods are demonstrated with experiments performed on training datasets of reduced size | [['this', 'paper', 'proposes', 'a', 'generative', 'scatternet', 'hybrid', 'deep', 'learning', 'gshdl', 'network', 'for', 'semantic', 'image', 'segmentation', 'the', 'proposed', 'generative', 'architecture', 'is', 'able', 'to', 'train', 'rapidly', 'from', 'relatively', 'small', 'labeled', 'datasets', 'using', 'the', 'introduced', 'structural', 'priors', 'in', 'addition', 'the', 'number', 'of', 'filters', 'in', 'each', 'layer', 'of', 'the', 'architecture', 'is', 'optimized', 'resulting', 'in', 'a', 'computationally', 'efficient', 'architecture', 'the', 'gshdl', 'network', 'produces', 'stateoftheart', 'classification', 'performance', 'against', 'unsupervised', 'and', 'semisupervised', 'learning', 'on', 'two', 'image', 'datasets', 'advantages', 'of', 'the', 'gshdl', 'network', 'over', 'supervised', 'methods', 'are', 'demonstrated', 'with', 'experiments', 'performed', 'on', 'training', 'datasets', 'of', 'reduced', 'size']] | [-0.024950837033664745, -0.06109930769529905, -0.030239195803577982, 0.02807227395026254, -0.09625752722802625, -0.20507805709716645, 0.0011536909981494706, 0.5206983706422066, -0.2484851043378369, -0.34103462962287195, 0.013560951510810534, -0.23409754046228495, -0.20954105062828807, 0.19362728753953837, -0.18181908095067137, 0.10876322140017253, 0.22195266529765983, 0.04780414390241664, -0.069124778612318, -0.326814338538712, 0.29246772272418137, 0.03537639018293376, 0.4230442571589786, -0.0452854936795958, 0.18254316480976812, -0.0775126531599822, -0.030631993266785246, 0.005922987872703273, -0.03312110435740834, 0.2204500096274561, 0.3446821204224455, 0.22470096667203004, 0.3533979475477271, -0.40493878466600364, -0.24250370424157114, 0.07494254513863433, 0.14922019711360754, 0.0761282714651152, -0.04402793506735915, -0.3748590564172129, 0.08146506340473136, -0.18265270445956272, 0.11715088847480463, -0.2004973893943295, -0.06386492020984212, -0.033934905287924776, -0.3202854037870852, 0.023070625482085213, 0.06857206740971195, 0.04846308134454355, -0.038138693417330914, -0.14493333542290446, 0.01572548409432089, 0.1000308542292607, -0.009691330347879884, 0.07241478739724902, 0.13750562624315196, -0.21123328080840326, -0.1296270976727305, 0.2882677232114117, -0.08712567983383543, -0.21171188383792225, 0.20464541754695806, 0.07790597035873974, -0.1608191322838741, 0.11759784299712837, 0.2698360806686825, 0.1380131556390879, -0.1671804180996639, 0.014673834705196865, -0.034250230831878906, 0.1953270079861029, 0.035815204799782195, -0.044529349825690304, 0.12149048193810466, 0.4004072903189808, 0.0010612366499975741, 0.19753026429647474, -0.22985098246757066, -0.046225256011873654, -0.14657188707627775, -0.03792257361072168, -0.24627530070157785, -0.07775930194916685, -0.13758489970896742, -0.1657953356089217, 0.43294338999169596, 0.2548016741573601, 0.21213004644960165, 0.1484780815335807, 0.403429632076439, -0.06073695130311371, 0.18602725995568495, 0.11966479669084375, 0.16295523877946264, 0.01749115725037422, 0.13325524035438352, -0.15073120340527024, 0.07400606774588984, 0.06771942031873243] |
1,802.03375 | ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback | ATPboost is a system for solving sets of large-theory problems by
interleaving ATP runs with state-of-the-art machine learning of premise
selection from the proofs. Unlike many previous approaches that use multi-label
setting, the learning is implemented as binary classification that estimates
the pairwise-relevance of (theorem, premise) pairs. ATPboost uses for this the
XGBoost gradient boosting algorithm, which is fast and has state-of-the-art
performance on many tasks. Learning in the binary setting however requires
negative examples, which is nontrivial due to many alternative proofs. We
discuss and implement several solutions in the context of the ATP/ML feedback
loop, and show that ATPboost with such methods significantly outperforms the
k-nearest neighbors multilabel classifier.
| cs.AI cs.LO stat.ML | atpboost is a system for solving sets of largetheory problems by interleaving atp runs with stateoftheart machine learning of premise selection from the proofs unlike many previous approaches that use multilabel setting the learning is implemented as binary classification that estimates the pairwiserelevance of theorem premise pairs atpboost uses for this the xgboost gradient boosting algorithm which is fast and has stateoftheart performance on many tasks learning in the binary setting however requires negative examples which is nontrivial due to many alternative proofs we discuss and implement several solutions in the context of the atpml feedback loop and show that atpboost with such methods significantly outperforms the knearest neighbors multilabel classifier | [['atpboost', 'is', 'a', 'system', 'for', 'solving', 'sets', 'of', 'largetheory', 'problems', 'by', 'interleaving', 'atp', 'runs', 'with', 'stateoftheart', 'machine', 'learning', 'of', 'premise', 'selection', 'from', 'the', 'proofs', 'unlike', 'many', 'previous', 'approaches', 'that', 'use', 'multilabel', 'setting', 'the', 'learning', 'is', 'implemented', 'as', 'binary', 'classification', 'that', 'estimates', 'the', 'pairwiserelevance', 'of', 'theorem', 'premise', 'pairs', 'atpboost', 'uses', 'for', 'this', 'the', 'xgboost', 'gradient', 'boosting', 'algorithm', 'which', 'is', 'fast', 'and', 'has', 'stateoftheart', 'performance', 'on', 'many', 'tasks', 'learning', 'in', 'the', 'binary', 'setting', 'however', 'requires', 'negative', 'examples', 'which', 'is', 'nontrivial', 'due', 'to', 'many', 'alternative', 'proofs', 'we', 'discuss', 'and', 'implement', 'several', 'solutions', 'in', 'the', 'context', 'of', 'the', 'atpml', 'feedback', 'loop', 'and', 'show', 'that', 'atpboost', 'with', 'such', 'methods', 'significantly', 'outperforms', 'the', 'knearest', 'neighbors', 'multilabel', 'classifier']] | [-0.04994437550386807, -0.01373227943726089, -0.06402517615928563, 0.0738303474216816, -0.11783167701043668, -0.20745322880241165, 0.0457595882161922, 0.4046309332559825, -0.24991550387114014, -0.2982945141485046, 0.1113600260898505, -0.279845183040229, -0.17495445278259592, 0.2852455293774389, -0.12467810098902074, 0.07807091155320132, 0.16436535957987086, 0.06218994160208407, -0.07155615671611511, -0.3207607988498832, 0.31926832166329505, 0.014653372219464647, 0.3223026998922092, 0.006808639081075377, 0.13427088874682716, 0.025162228090483525, -0.024120740115070084, 0.011009644538616983, -0.02345309454279924, 0.1460832259478902, 0.31087542155227804, 0.2277507476739312, 0.363451640864988, -0.33197880092017146, -0.22617675069241075, 0.1120156871983696, 0.15401597414592946, 0.1321714137309154, -0.048853149788172213, -0.2703970266578702, 0.09518606250960414, -0.16080165024736784, 0.024225006277305543, -0.14721135784863332, -0.03289106073404808, 0.026802764661557926, -0.2917040632888162, 0.03394626985825257, 0.14090820318173378, 0.031930316043077805, -0.0493891680326928, -0.15114356609330504, 0.08089268237454902, 0.07229598788031881, 0.06679214948335441, 0.07558486637992597, 0.14263424492193336, -0.1504785649781756, -0.2427272804149794, 0.3463974078741232, -0.03567031662219093, -0.19255835629589513, 0.26209810504330955, 0.0290823846312086, -0.1852650149178546, 0.068400272971378, 0.1977860501779397, 0.1534938152512074, -0.11874748550252903, 0.07997559441024985, -0.047888308848946466, 0.15910376045306068, 0.056222766684795464, -0.02355990228627663, 0.11889868890311261, 0.22328872254135412, 0.06531748658637815, 0.12602724934663248, -0.06978804520502208, -0.11903715303697444, -0.20568525006806632, -0.09916231081470711, -0.17257432178423288, -0.048036375382077806, -0.12015114745102212, -0.16048454104521132, 0.336125343593709, 0.21445255432226654, 0.17584958665047284, 0.12078347013742073, 0.36379358411655516, 0.06306663662977004, 0.11199125030650459, 0.14632151154544923, 0.2012482709037738, 0.08084442052315202, 0.09081906473708398, -0.18320750170216443, 0.10569482277267091, 0.12454379633695972] |
1,802.03376 | Visualizing Treasury Issuance Strategy | We introduce simple cost and risk proxy metrics that can be attached to
Treasury issuance strategy to complement analysis of the resulting portfolio
weighted-average maturity (WAM). These metrics are based on mapping issuance
fractions to their long-term, asymptotic portfolio implications for cost and
risk under mechanical debt-rolling dynamics. The resulting mapping enables one
to visualize tradeoffs involved in contemplated issuance reallocation, and
identify an efficient frontier and optimal tenor. Historical Treasury issuance
strategy is analyzed empirically using these cost and risk metrics to
illustrate how changes in issuance needs and strategy have translated into
structural shifts in the cost and risk stance of Treasury issuance.
| q-fin.PM q-fin.EC q-fin.GN q-fin.MF q-fin.RM | we introduce simple cost and risk proxy metrics that can be attached to treasury issuance strategy to complement analysis of the resulting portfolio weightedaverage maturity wam these metrics are based on mapping issuance fractions to their longterm asymptotic portfolio implications for cost and risk under mechanical debtrolling dynamics the resulting mapping enables one to visualize tradeoffs involved in contemplated issuance reallocation and identify an efficient frontier and optimal tenor historical treasury issuance strategy is analyzed empirically using these cost and risk metrics to illustrate how changes in issuance needs and strategy have translated into structural shifts in the cost and risk stance of treasury issuance | [['we', 'introduce', 'simple', 'cost', 'and', 'risk', 'proxy', 'metrics', 'that', 'can', 'be', 'attached', 'to', 'treasury', 'issuance', 'strategy', 'to', 'complement', 'analysis', 'of', 'the', 'resulting', 'portfolio', 'weightedaverage', 'maturity', 'wam', 'these', 'metrics', 'are', 'based', 'on', 'mapping', 'issuance', 'fractions', 'to', 'their', 'longterm', 'asymptotic', 'portfolio', 'implications', 'for', 'cost', 'and', 'risk', 'under', 'mechanical', 'debtrolling', 'dynamics', 'the', 'resulting', 'mapping', 'enables', 'one', 'to', 'visualize', 'tradeoffs', 'involved', 'in', 'contemplated', 'issuance', 'reallocation', 'and', 'identify', 'an', 'efficient', 'frontier', 'and', 'optimal', 'tenor', 'historical', 'treasury', 'issuance', 'strategy', 'is', 'analyzed', 'empirically', 'using', 'these', 'cost', 'and', 'risk', 'metrics', 'to', 'illustrate', 'how', 'changes', 'in', 'issuance', 'needs', 'and', 'strategy', 'have', 'translated', 'into', 'structural', 'shifts', 'in', 'the', 'cost', 'and', 'risk', 'stance', 'of', 'treasury', 'issuance']] | [-0.0457867638548263, -0.019091829347346972, -0.14320644771214575, 0.15054606597606415, -0.13009425899228796, -0.14900359693834056, 0.16243190786917694, 0.45634996776397413, -0.28873730443704587, -0.2871329231868283, 0.1774571895959805, -0.25870455366272765, -0.17222761584427923, 0.20276095472777692, -0.17603704902844933, 0.052340370701411024, 0.03879901438351506, -0.06376367030539908, 0.03336300622994223, -0.31928348746105956, 0.26218259621125, 0.12564234709582076, 0.3204417187147416, 0.053980669165097285, 0.09857491458891533, 0.011722943438843895, -0.05743679082773339, 0.030594498322058756, -0.15197764491795868, 0.1844709085456858, 0.3201467335703245, 0.2479615225770081, 0.37536784469221646, -0.41008659647419476, -0.10014519558395617, 0.13078482278909248, 0.06394580356572988, 0.0129934544070588, 0.0043962371721415995, -0.26117343259438014, -0.0013757149438158823, -0.19954661544089994, -0.09090654570116805, -0.138193920863649, -0.005304835416049732, 0.017643047219070677, -0.25871707653949183, 0.0045420380125646125, -0.1122320059982415, 0.06998609527587317, -0.09857217706919003, -0.13945510293034694, -0.05285347358081848, 0.20447830205263856, 0.09480671157227614, -0.00918715805388414, 0.18586963530217943, -0.08781310868093548, -0.14927629687232324, 0.36650094214396983, -0.05658448058798408, -0.15679228503722697, 0.14376493351972805, -0.07302440171154628, -0.14173881275704703, 0.10750256771112057, 0.25031279925203237, 0.016839297340573885, -0.2209463900922296, 0.044353276281281766, 0.06632577813266274, 0.17287025677461104, 0.06270079588284716, 0.043603683181572706, 0.13805921179188702, 0.16090288934579944, 0.1220402471954003, 0.16479629841342103, -0.06621703965580449, -0.1399395022535128, -0.24365110256901693, -0.17603837212776013, -0.06652439226253101, 0.023886750462294843, -0.11257888227961442, -0.13242596271447837, 0.38205534463318497, 0.1407583753238074, 0.10624803250762992, 0.13415301706677732, 0.2804620402424077, 0.07943558846063052, 0.05308909631611851, 0.06158261678109948, 0.18156747335496431, -0.030760401824059393, 0.06862259117546134, -0.24054009027895518, 0.1743332603140376, 0.035956356479660966] |
1,802.03377 | A note on the linear independence of a class of series of functions | For $k\in\mathbb R$, we consider a $\mathbb C$-algebra $\mathcal A_k$ of
holomorphic functions in the half plane $Re\; z>k$ with (at most)
subexponential growth on the real line to $+\infty$. In the $\mathcal
A_k$-algebra of sequences of functions $\{\alpha:\mathbb N\rightarrow \mathcal
A_k\}$, we consider the $\mathcal A_k$-subalgebra $\mathcal H_k$ consisting in
those $\alpha$ for which there exists a continuous map $M:\{Re\;
z>k\}\rightarrow [0,+\infty)$ such that $|\alpha(n)(z)|\leq M(z)n^k$ for all
$Re\; z>k,n\geq 1$, and $\lim_{x\rightarrow +\infty}e^{-ax}M(x)=0$, for all
$a>0$. Given $L$ a sequence of holomorphic functions on $Re\; z>k$ which
satisfies certain conditions, we prove that the map $\alpha\mapsto
F_L(\alpha)$, where $F_L(\alpha):=\sum_{n=1}^{+\infty}\alpha(n)(z)L(n)(z)$, is
an injective morphism of $\mathcal A_k$-modules (or $\mathcal A_k$-algebras).
Consequently, if $n\mapsto \alpha_j(n)(z)\in\mathbb C$, $1\leq j\leq r$, are
linearly (algebraically) independent over $\mathbb C$, for $z$ in a nondiscrete
subset of $Re\; z>k$, then $F_{\alpha_1},\ldots,F_{\alpha_r}$ are linearly
(algebraically) independent over the quotient field of $\mathcal A_k$.
| math.NT math.CV | for kinmathbb r we consider a mathbb calgebra mathcal a_k of holomorphic functions in the half plane re zk with at most subexponential growth on the real line to infty in the mathcal a_kalgebra of sequences of functions alphamathbb nrightarrow mathcal a_k we consider the mathcal a_ksubalgebra mathcal h_k consisting in those alpha for which there exists a continuous map mre zkrightarrow 0infty such that alphanzleq mznk for all re zkngeq 1 and lim_xrightarrow inftyeaxmx0 for all a0 given l a sequence of holomorphic functions on re zk which satisfies certain conditions we prove that the map alphamapsto f_lalpha where f_lalphasum_n1inftyalphanzlnz is an injective morphism of mathcal a_kmodules or mathcal a_kalgebras consequently if nmapsto alpha_jnzinmathbb c 1leq jleq r are linearly algebraically independent over mathbb c for z in a nondiscrete subset of re zk then f_alpha_1ldotsf_alpha_r are linearly algebraically independent over the quotient field of mathcal a_k | [['for', 'kinmathbb', 'r', 'we', 'consider', 'a', 'mathbb', 'calgebra', 'mathcal', 'a_k', 'of', 'holomorphic', 'functions', 'in', 'the', 'half', 'plane', 're', 'zk', 'with', 'at', 'most', 'subexponential', 'growth', 'on', 'the', 'real', 'line', 'to', 'infty', 'in', 'the', 'mathcal', 'a_kalgebra', 'of', 'sequences', 'of', 'functions', 'alphamathbb', 'nrightarrow', 'mathcal', 'a_k', 'we', 'consider', 'the', 'mathcal', 'a_ksubalgebra', 'mathcal', 'h_k', 'consisting', 'in', 'those', 'alpha', 'for', 'which', 'there', 'exists', 'a', 'continuous', 'map', 'mre', 'zkrightarrow', '0infty', 'such', 'that', 'alphanzleq', 'mznk', 'for', 'all', 're', 'zkngeq', '1', 'and', 'lim_xrightarrow', 'inftyeaxmx0', 'for', 'all', 'a0', 'given', 'l', 'a', 'sequence', 'of', 'holomorphic', 'functions', 'on', 're', 'zk', 'which', 'satisfies', 'certain', 'conditions', 'we', 'prove', 'that', 'the', 'map', 'alphamapsto', 'f_lalpha', 'where', 'f_lalphasum_n1inftyalphanzlnz', 'is', 'an', 'injective', 'morphism', 'of', 'mathcal', 'a_kmodules', 'or', 'mathcal', 'a_kalgebras', 'consequently', 'if', 'nmapsto', 'alpha_jnzinmathbb', 'c', '1leq', 'jleq', 'r', 'are', 'linearly', 'algebraically', 'independent', 'over', 'mathbb', 'c', 'for', 'z', 'in', 'a', 'nondiscrete', 'subset', 'of', 're', 'zk', 'then', 'f_alpha_1ldotsf_alpha_r', 'are', 'linearly', 'algebraically', 'independent', 'over', 'the', 'quotient', 'field', 'of', 'mathcal', 'a_k']] | [-0.2030932880461888, 0.12073133985043234, 0.02990856413778506, -0.020054329791512424, 0.0029393303001481563, -0.18710486977746277, -0.04442118601374594, 0.3703302633651021, -0.3465685212741347, -0.07791079761446419, 0.06893845569146306, -0.32569673120287507, -0.059894073259127434, 0.20573563978979295, -0.056192093805402965, 0.008359464913032445, -0.04164026840765001, 0.13551125719204993, -0.06264206174326907, -0.2584864701375477, 0.364056852513126, -0.13240333236193746, 0.13994360462363278, -0.012520669840444299, 0.09558882525344327, 0.0072172427886074645, 0.02479946900411208, -0.04714645201662429, -0.27269070219177194, 0.00924089509657675, 0.2936960704400575, 0.16575165512291906, 0.2720906374191767, -0.3046607807085191, -0.09081131398250677, 0.2774095474987438, 0.23464495647362524, -0.15055656022938402, 0.01806896194619568, -0.21777011741554939, 0.16214540943195274, -0.10078493916671163, -0.11429444292238108, -0.04264446347951889, 0.21635230059500896, 0.06731470400700346, -0.4056987533051717, 0.005912204752711201, 0.1090095888515164, 0.12764088201679682, -0.04697784947938657, -0.1658159224701611, -0.12263945132297904, 0.02610369003727976, -0.021305003943958116, 0.1823235797849869, 0.07880490874395446, -0.04024460635505112, -0.010392449337540936, 0.3510951865184352, -0.08665702097061881, -0.2409312690125036, 0.09266853838444765, -0.2361231440961837, -0.19019977042549535, 0.11819399013779217, 0.08138920909452035, 0.2186668349808096, 0.024045108999580816, 0.3065293730508809, -0.15412992363641584, 0.11909876109794118, 0.047023732656318894, 0.03555510705161868, 0.10812970065280683, 0.032806135156485984, 0.08018885859939501, 0.08327118201790504, 0.037092613164839666, 0.0249933741384543, -0.4074859403045778, -0.1480758331919131, -0.12873436295500906, 0.20824249490003163, -0.16546901367257674, -0.18478432937028041, 0.33149961588021953, 0.06258982053915865, 0.24066773591969245, 0.17217988537491433, 0.1481990626447701, 0.10425355181420096, 0.01669770809979339, 0.09648771334397502, 0.03446867704895654, 0.1257204803799216, -0.04841930351195563, -0.1345826258875878, -0.03711812699885857, 0.17618802644984616] |
1,802.03378 | Necessary Optimality Conditions for Continuous-Time Optimization
Problems with Equality and Inequality Constraints | The paper is devoted to obtain first and second order necessary optimality
conditions for continuous-time optimization problems with equality and
inequality constraints. A full rank type regularity condition along with an
uniform implicit function theorem are used in order to establish such necessary
conditions.
| math.OC | the paper is devoted to obtain first and second order necessary optimality conditions for continuoustime optimization problems with equality and inequality constraints a full rank type regularity condition along with an uniform implicit function theorem are used in order to establish such necessary conditions | [['the', 'paper', 'is', 'devoted', 'to', 'obtain', 'first', 'and', 'second', 'order', 'necessary', 'optimality', 'conditions', 'for', 'continuoustime', 'optimization', 'problems', 'with', 'equality', 'and', 'inequality', 'constraints', 'a', 'full', 'rank', 'type', 'regularity', 'condition', 'along', 'with', 'an', 'uniform', 'implicit', 'function', 'theorem', 'are', 'used', 'in', 'order', 'to', 'establish', 'such', 'necessary', 'conditions']] | [-0.10539018718356435, -0.018321030018837933, -0.06109295878559351, 0.12745293730668808, -0.13625172062099658, -0.16181924764532596, -0.003585345775883814, 0.34660740482451563, -0.29260905053127895, -0.3047063412536359, 0.20898752385189504, -0.1536927277391607, -0.12148221844637935, 0.15449562107890166, -0.11472220277540725, 0.15189098255624148, 0.03928120292469182, 0.060938277006657285, -0.1276596479848112, -0.3132929665205831, 0.3402807697315108, -0.0105948289221322, 0.25408351205458696, 0.10961390504698185, 0.1298903043551201, 0.020529896856962958, 0.028575813366015525, -0.004546448757702654, -0.27359775333157316, 0.09228981621245938, 0.2576279851226983, 0.10760753489607437, 0.3413776656274091, -0.4589022526686842, -0.11120190473527393, 0.17975011867979032, 0.05015409931498156, 0.05033946187574078, -0.010360445488582958, -0.24925605563277548, 0.13406112939860163, -0.08270928109149364, -0.20109810692850838, -0.0912042419764806, -0.06319009522981518, 0.04376888660375367, -0.4453401994806799, 0.11232475500384514, 0.11157735818150369, 0.05844070550731637, -0.11107645682270893, -0.050333123336630786, 0.029525885019790043, 0.09585394661090421, 0.038904762694569814, -0.005696294019633735, -0.015765707453035495, -0.05299707955088128, -0.09171588883460076, 0.35876867259767925, -0.0042858018000102175, -0.24914068889550187, 0.17716148667122153, -0.06734532255425373, -0.18881639147135007, 0.08898594286504456, 0.17333042397248474, 0.150576890139994, -0.183435820794495, 0.08928458976548757, 0.000385887243530967, 0.15206575994803148, 0.07551101289308546, 0.06565391803583638, 0.04811957622984086, 0.10922199957580729, 0.26100792458534916, 0.20986603200435638, 0.03525604306593199, -0.06471648816527291, -0.39681222730062227, -0.1699453866379124, -0.1335137696852061, 0.0306236927439882, -0.1016511999974186, -0.126828692514788, 0.3113890433345329, 0.12467553776646541, 0.11277856952934102, 0.1331880890806629, 0.27582371251826937, 0.18148803727870638, -0.031898866344073955, 0.07048733275256712, 0.15298957322639498, 0.26239643104649574, 0.13329225340434772, -0.10341627112211427, 0.09977516103324226, 0.19194010744633322] |
1,802.03379 | The Herschel-PACS legacy of low-mass protostars: Properties of warm and
hot gas and its origin in far-UV illuminated shocks | Recent observations from Herschel allow the identification of important
mechanisms responsible for the heating of gas surrounding low-mass protostars
and its subsequent cooling in the far-infrared (FIR). Shocks are routinely
invoked to reproduce some properties of the far-IR spectra, but standard models
fail to reproduce the emission from key molecules, e.g. H$_2$O. Here, we
present the Herschel-PACS far-IR spectroscopy of 90 embedded low-mass
protostars (Class 0/I). The Herschel-PACS spectral maps covering $\sim55-210$
$\mu$m with a field-of-view of $\sim$50'' are used to quantify the gas
excitation conditions and spatial extent using rotational transitions of
H$_{2}$O, high-$J$ CO, and OH, as well as [O I] and [C II]. We confirm that a
warm ($\sim$300 K) CO reservoir is ubiquitous and that a hotter component
($760\pm170$ K) is frequently detected around protostars. The line emission is
extended beyond $\sim$1000 AU spatial scales in 40/90 objects, typically in
molecular tracers in Class 0 and atomic tracers in Class I objects.
High-velocity emission ($\gtrsim90$ km s$^{-1}$) is detected in only 10 sources
in the [O I] line, suggesting that the bulk of [O I] arises from gas that is
moving slower than typical jets. Line flux ratios show an excellent agreement
with models of $C$-shocks illuminated by UV photons for pre-shock densities of
$\sim$$10^5$ cm$^{-3}$ and UV fields 0.1-10 times the interstellar value. The
far-IR molecular and atomic lines are a unique diagnostic of feedback from UV
emission and shocks in envelopes of deeply embedded protostars.
| astro-ph.SR astro-ph.GA | recent observations from herschel allow the identification of important mechanisms responsible for the heating of gas surrounding lowmass protostars and its subsequent cooling in the farinfrared fir shocks are routinely invoked to reproduce some properties of the farir spectra but standard models fail to reproduce the emission from key molecules eg h_2o here we present the herschelpacs farir spectroscopy of 90 embedded lowmass protostars class 0i the herschelpacs spectral maps covering sim55210 mum with a fieldofview of sim50 are used to quantify the gas excitation conditions and spatial extent using rotational transitions of h_2o highj co and oh as well as o i and c ii we confirm that a warm sim300 k co reservoir is ubiquitous and that a hotter component 760pm170 k is frequently detected around protostars the line emission is extended beyond sim1000 au spatial scales in 4090 objects typically in molecular tracers in class 0 and atomic tracers in class i objects highvelocity emission gtrsim90 km s1 is detected in only 10 sources in the o i line suggesting that the bulk of o i arises from gas that is moving slower than typical jets line flux ratios show an excellent agreement with models of cshocks illuminated by uv photons for preshock densities of sim105 cm3 and uv fields 0110 times the interstellar value the farir molecular and atomic lines are a unique diagnostic of feedback from uv emission and shocks in envelopes of deeply embedded protostars | [['recent', 'observations', 'from', 'herschel', 'allow', 'the', 'identification', 'of', 'important', 'mechanisms', 'responsible', 'for', 'the', 'heating', 'of', 'gas', 'surrounding', 'lowmass', 'protostars', 'and', 'its', 'subsequent', 'cooling', 'in', 'the', 'farinfrared', 'fir', 'shocks', 'are', 'routinely', 'invoked', 'to', 'reproduce', 'some', 'properties', 'of', 'the', 'farir', 'spectra', 'but', 'standard', 'models', 'fail', 'to', 'reproduce', 'the', 'emission', 'from', 'key', 'molecules', 'eg', 'h_2o', 'here', 'we', 'present', 'the', 'herschelpacs', 'farir', 'spectroscopy', 'of', '90', 'embedded', 'lowmass', 'protostars', 'class', '0i', 'the', 'herschelpacs', 'spectral', 'maps', 'covering', 'sim55210', 'mum', 'with', 'a', 'fieldofview', 'of', 'sim50', 'are', 'used', 'to', 'quantify', 'the', 'gas', 'excitation', 'conditions', 'and', 'spatial', 'extent', 'using', 'rotational', 'transitions', 'of', 'h_2o', 'highj', 'co', 'and', 'oh', 'as', 'well', 'as', 'o', 'i', 'and', 'c', 'ii', 'we', 'confirm', 'that', 'a', 'warm', 'sim300', 'k', 'co', 'reservoir', 'is', 'ubiquitous', 'and', 'that', 'a', 'hotter', 'component', '760pm170', 'k', 'is', 'frequently', 'detected', 'around', 'protostars', 'the', 'line', 'emission', 'is', 'extended', 'beyond', 'sim1000', 'au', 'spatial', 'scales', 'in', '4090', 'objects', 'typically', 'in', 'molecular', 'tracers', 'in', 'class', '0', 'and', 'atomic', 'tracers', 'in', 'class', 'i', 'objects', 'highvelocity', 'emission', 'gtrsim90', 'km', 's1', 'is', 'detected', 'in', 'only', '10', 'sources', 'in', 'the', 'o', 'i', 'line', 'suggesting', 'that', 'the', 'bulk', 'of', 'o', 'i', 'arises', 'from', 'gas', 'that', 'is', 'moving', 'slower', 'than', 'typical', 'jets', 'line', 'flux', 'ratios', 'show', 'an', 'excellent', 'agreement', 'with', 'models', 'of', 'cshocks', 'illuminated', 'by', 'uv', 'photons', 'for', 'preshock', 'densities', 'of', 'sim105', 'cm3', 'and', 'uv', 'fields', '0110', 'times', 'the', 'interstellar', 'value', 'the', 'farir', 'molecular', 'and', 'atomic', 'lines', 'are', 'a', 'unique', 'diagnostic', 'of', 'feedback', 'from', 'uv', 'emission', 'and', 'shocks', 'in', 'envelopes', 'of', 'deeply', 'embedded', 'protostars']] | [-0.023133398306207288, 0.12202166475577983, 0.032834634065012365, 0.08268495642523589, -0.01949055461703983, -0.08918748204459954, 0.015209656796553542, 0.4924214019763545, -0.16599826154271805, -0.3016084805832373, 0.03926684234216303, -0.27674431277431205, 0.022066386935978673, 0.14070680657295495, 0.01034405304578807, -0.05425197308250824, 0.011832907206523057, -0.16935158116844284, 0.0010438523641066572, -0.1574660949043688, 0.28589890750756325, 0.08085063807120757, 0.11593259031938927, 0.015323995026101253, 0.0328285285828452, -0.20587617938823718, -0.06602427634706713, -0.036931389871162505, -0.15660728502419005, 0.07589293097680258, 0.27080541855508145, 0.11801123279965167, 0.1835854173226698, -0.3902218122748613, -0.2577065435933752, 0.054430338557981045, 0.1934312477555768, 0.009496984352595387, 0.013812637521600873, -0.2619478777070456, 0.023345012458871318, -0.1231946300824317, -0.17433428301409698, 0.06522064341040265, 0.07513513280250225, 0.06119800056900911, -0.2349731998818159, 0.10658463922613709, 0.013671752426356357, 0.13130562497248335, -0.12168331139878795, -0.12404930661140189, -0.10271494373582717, 0.04195299353080346, -0.023228963982424928, 0.07712922725635561, 0.270315805570881, -0.1679936268553917, -0.023212662975938998, 0.42852284181785133, -0.141184198572975, 0.026562137151269483, 0.30697082799068304, -0.21591577234981918, -0.20480392369876174, 0.2959011319233689, 0.08629555766233028, 0.15753932664108514, -0.12166210828411342, 0.014619992765116751, -0.039968248414826504, 0.2259024944639605, 0.049461887592145835, 0.13372275377226148, 0.31651613401506234, 0.05439768993260658, 0.007297490701451021, 0.11455737215210586, -0.27236300347583314, -0.04772879434632581, -0.24741614496171724, -0.16763994488699524, -0.12438076755195607, 0.1160452856427004, -0.10114137539156628, -0.07277006082062387, 0.2714757163930128, 0.13242806849619335, 0.23574856499981556, 0.0013097418690388672, 0.30881926749548466, 0.07251917773265407, 0.09640440603262242, 0.14767182434550544, 0.2654341060701596, 0.19403171337382072, 0.11403733221073654, -0.22736191678651954, 0.058927302800652774, -0.021998218775076097] |
1,802.0338 | Nonlinear Schr\"odinger equation in the Bopp-Podolsky electrodynamics:
solutions in the electrostatic case | We study the following nonlinear Schr\"odinger-Bopp-Podolsky system \[
\begin{cases} -\Delta u + \omega u + q^{2}\phi u = |u|^{p-2}u -\Delta \phi +
a^2 \Delta^2 \phi = 4\pi u^2 \end{cases} \hbox{ in }\mathbb{R}^3 \] with
$a,\omega>0$. We prove existence and nonexistence results depending on the
parameters $q,p$. Moreover we also show that, in the radial case, the solutions
we find tend to solutions of the classical Schr\"odinger-Poisson system as
$a\to0$.
| math.AP | we study the following nonlinear schrodingerbopppodolsky system begincases delta u omega u q2phi u up2u delta phi a2 delta2 phi 4pi u2 endcases hbox in mathbbr3 with aomega0 we prove existence and nonexistence results depending on the parameters qp moreover we also show that in the radial case the solutions we find tend to solutions of the classical schrodingerpoisson system as ato0 | [['we', 'study', 'the', 'following', 'nonlinear', 'schrodingerbopppodolsky', 'system', 'begincases', 'delta', 'u', 'omega', 'u', 'q2phi', 'u', 'up2u', 'delta', 'phi', 'a2', 'delta2', 'phi', '4pi', 'u2', 'endcases', 'hbox', 'in', 'mathbbr3', 'with', 'aomega0', 'we', 'prove', 'existence', 'and', 'nonexistence', 'results', 'depending', 'on', 'the', 'parameters', 'qp', 'moreover', 'we', 'also', 'show', 'that', 'in', 'the', 'radial', 'case', 'the', 'solutions', 'we', 'find', 'tend', 'to', 'solutions', 'of', 'the', 'classical', 'schrodingerpoisson', 'system', 'as', 'ato0']] | [-0.25701917939198515, 0.05002585030160844, 0.0044795161113142965, 0.009738637743672977, -0.04617771666683742, -0.1990755327666799, -0.03183132937798897, 0.29574234563236435, -0.31528226809265714, -0.16597029867892463, 0.07027784479432739, -0.4356071723314623, -0.12197617926479627, 0.15776999317846882, -0.030232078100865086, 0.06021595449031641, 0.058980333339422944, 0.06861335569216559, -0.10504166152095422, -0.15939407618716359, 0.34263667988901336, -0.24458194319158794, 0.08075018009791772, 0.08297750619240105, 0.03550410383225729, -0.032463870197534564, 0.1487278801156208, -0.029783259456356365, -0.36288009544041416, -0.049760585247228546, 0.15209902009616297, 0.044138230301905425, 0.30145130238185325, -0.37872882646818956, -0.12097584920314451, 0.1959374150649334, 0.1761143836037566, -0.045000127687429385, 0.005624175353053336, -0.32610552437836304, 0.13002606703278918, -0.07761845490216122, -0.22459143991582095, -0.03984426423558034, 0.11824328970784942, 0.12121312797923262, -0.3676967627058427, 0.15723119832352192, 0.08119461879250593, -0.030963473153921464, -0.14809664764131109, -0.20111129586196816, -0.04050744942602857, 0.002172597528745731, 0.050179770573352774, 0.17308554524788633, -0.01522492093887801, -0.12086529262305704, 0.03371699086079995, 0.3690417079875867, -0.14279409006703644, -0.2823896179907024, 0.08488766416461052, -0.2235015074800079, -0.1561040756913523, 0.007443218356153618, 0.12119724103637661, 0.15849467578033608, -0.08248951992330451, 0.24253507583925965, -0.10434374332156343, 0.24882302368059755, 0.12428511562757194, -0.005472924280911684, -0.01841041612594078, 0.12495950007190307, 0.14457759602810255, 0.08250081745985274, -0.049948797619435936, -0.016559205763041974, -0.3741102132325371, -0.09113864179623003, -0.04072474860586226, 0.16817196041423207, -0.061641462837724245, -0.11887290814581017, 0.3047177305289855, 0.0838094500543472, 0.16465409647983809, 0.04845396059875687, 0.12646028016461058, 0.18218983060796745, -0.07111404173386594, 0.1393060073411713, 0.15596546508992712, 0.06617055895815914, 0.17629406620593122, -0.3459530017649134, -0.10521786134534826, 0.13609379906362543] |
1,802.03381 | Confluence Modulo Equivalence with Invariants in Constraint Handling
Rules | Confluence denotes the property of a state transition system that states can
be rewritten in more than one way yielding the same result. Although it is a
desirable property, confluence is often too strict in practical applications
because it also considers states that can never be reached in practice.
Additionally, sometimes states that have the same semantics in the practical
context are considered as different states due to different syntactic
representations. By introducing suitable invariants and equivalence relations
on the states, programs may have the property to be confluent modulo the
equivalence relation w.r.t. the invariant which often is desirable in practice.
In this paper, a sufficient and necessary criterion for confluence modulo
equivalence w.r.t. an invariant for Constraint Handling Rules (CHR) is
presented. It is the first approach that covers invariant-based confluence
modulo equivalence for the de facto standard semantics of CHR. There is a
trade-off between practical applicability and the simplicity of proving a
confluence property. Therefore, a better manageable subset of equivalence
relations has been identified that allows for the proposed confluence criterion
and and simplifies the confluence proofs by using well established CHR analysis
methods.
| cs.LO | confluence denotes the property of a state transition system that states can be rewritten in more than one way yielding the same result although it is a desirable property confluence is often too strict in practical applications because it also considers states that can never be reached in practice additionally sometimes states that have the same semantics in the practical context are considered as different states due to different syntactic representations by introducing suitable invariants and equivalence relations on the states programs may have the property to be confluent modulo the equivalence relation wrt the invariant which often is desirable in practice in this paper a sufficient and necessary criterion for confluence modulo equivalence wrt an invariant for constraint handling rules chr is presented it is the first approach that covers invariantbased confluence modulo equivalence for the de facto standard semantics of chr there is a tradeoff between practical applicability and the simplicity of proving a confluence property therefore a better manageable subset of equivalence relations has been identified that allows for the proposed confluence criterion and and simplifies the confluence proofs by using well established chr analysis methods | [['confluence', 'denotes', 'the', 'property', 'of', 'a', 'state', 'transition', 'system', 'that', 'states', 'can', 'be', 'rewritten', 'in', 'more', 'than', 'one', 'way', 'yielding', 'the', 'same', 'result', 'although', 'it', 'is', 'a', 'desirable', 'property', 'confluence', 'is', 'often', 'too', 'strict', 'in', 'practical', 'applications', 'because', 'it', 'also', 'considers', 'states', 'that', 'can', 'never', 'be', 'reached', 'in', 'practice', 'additionally', 'sometimes', 'states', 'that', 'have', 'the', 'same', 'semantics', 'in', 'the', 'practical', 'context', 'are', 'considered', 'as', 'different', 'states', 'due', 'to', 'different', 'syntactic', 'representations', 'by', 'introducing', 'suitable', 'invariants', 'and', 'equivalence', 'relations', 'on', 'the', 'states', 'programs', 'may', 'have', 'the', 'property', 'to', 'be', 'confluent', 'modulo', 'the', 'equivalence', 'relation', 'wrt', 'the', 'invariant', 'which', 'often', 'is', 'desirable', 'in', 'practice', 'in', 'this', 'paper', 'a', 'sufficient', 'and', 'necessary', 'criterion', 'for', 'confluence', 'modulo', 'equivalence', 'wrt', 'an', 'invariant', 'for', 'constraint', 'handling', 'rules', 'chr', 'is', 'presented', 'it', 'is', 'the', 'first', 'approach', 'that', 'covers', 'invariantbased', 'confluence', 'modulo', 'equivalence', 'for', 'the', 'de', 'facto', 'standard', 'semantics', 'of', 'chr', 'there', 'is', 'a', 'tradeoff', 'between', 'practical', 'applicability', 'and', 'the', 'simplicity', 'of', 'proving', 'a', 'confluence', 'property', 'therefore', 'a', 'better', 'manageable', 'subset', 'of', 'equivalence', 'relations', 'has', 'been', 'identified', 'that', 'allows', 'for', 'the', 'proposed', 'confluence', 'criterion', 'and', 'and', 'simplifies', 'the', 'confluence', 'proofs', 'by', 'using', 'well', 'established', 'chr', 'analysis', 'methods']] | [-0.11988269190319996, 0.04742356610834591, -0.12764776348279266, 0.13887406375552355, -0.10852751050824447, -0.17202620272815386, 0.05337621826400103, 0.3338350098328813, -0.30921048922316424, -0.29230004560852807, 0.09630850697719744, -0.20693358606370918, -0.12486041035310971, 0.195046908542435, -0.10509417534229301, 0.08244132985134249, 0.08522871564630241, 0.023774645891208104, -0.08431611857783522, -0.2301292934260336, 0.3213142239385181, 0.01592285685960657, 0.3273518542246647, 0.05955532887240961, 0.09721248802381245, -0.006124904254825894, 0.04134562469294502, 0.05468337966015848, -0.07749447636353253, 0.0840085107243679, 0.3226767260637923, 0.22292699332339147, 0.28065436064985105, -0.3914060672577569, -0.1258706418432729, 0.11535181830114828, 0.14175426374835076, 0.07467188786594542, -0.00314553978795336, -0.29144743732398465, 0.14397349329073988, -0.1692322892427602, -0.07620128497934689, -0.15289382171624946, 0.05192696775689169, -0.024238899774558686, -0.23759247108347833, 0.0084085191596021, 0.16576201620908385, 0.09142940047211827, -0.018723084091482357, -0.06359812653951209, -0.01778996362111891, 0.0770736330992015, 0.04438976709183956, -0.005641444195702514, 0.07170732219324068, -0.10610236083871867, -0.1142321731993761, 0.41350378309470165, -0.006341031420296526, -0.22853869160331747, 0.2359140155955203, -0.038130649020550425, -0.20366606303791285, 0.11083657990047147, 0.045348121083055734, 0.0996713612965313, -0.171541130386426, 0.1349675653304624, -0.05232395934404204, 0.1581989116689545, 0.12129703941927464, 0.08222635568331474, 0.16070676248683224, 0.14928089230439612, 0.0814741851845707, 0.15988159990098288, 0.0619921762134052, -0.09772170764497584, -0.33436657214369725, -0.1985596383345269, -0.10966487119600138, -0.0007360267481229529, -0.04811019478105538, -0.1379770491489027, 0.3414664647330052, 0.1608807428711631, 0.13404165460649883, 0.10400741480391906, 0.28215378534945623, 0.15244149989799582, 0.12186329132537284, 0.020547556772331645, 0.22301068000012525, 0.1476276819397099, 0.06003079278808501, -0.13481967295914218, 0.1522816780772277, 0.1015534162565711] |
1,802.03382 | Zero-sum Generalized Schur Numbers | Let $r$ and $k$ be positive integers with $r \mid k$. Denote by
$S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every
coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to
$\sum_{i=1}^{k-1} x_i = x_k$ with $\sum_{i=1}^{k} \chi(x_i) \equiv 0
\,(\mathrm{mod }\,r)$. We give some formulas and lower bounds for various
instances.
| math.CO | let r and k be positive integers with r mid k denote by s_mathrmmathfrakzkr the minimum integer n such that every coloring chi1n rightarrow 01dotsr1 admits a solution to sum_i1k1 x_i x_k with sum_i1k chix_i equiv 0 mathrmmod r we give some formulas and lower bounds for various instances | [['let', 'r', 'and', 'k', 'be', 'positive', 'integers', 'with', 'r', 'mid', 'k', 'denote', 'by', 's_mathrmmathfrakzkr', 'the', 'minimum', 'integer', 'n', 'such', 'that', 'every', 'coloring', 'chi1n', 'rightarrow', '01dotsr1', 'admits', 'a', 'solution', 'to', 'sum_i1k1', 'x_i', 'x_k', 'with', 'sum_i1k', 'chix_i', 'equiv', '0', 'mathrmmod', 'r', 'we', 'give', 'some', 'formulas', 'and', 'lower', 'bounds', 'for', 'various', 'instances']] | [-0.27514466116933717, 0.13253338422383304, -0.022220520201422598, -0.06736552999000592, -0.05005800112596025, -0.3363892794687949, 0.011147231673416884, 0.30492676042890904, -0.2942512998276431, -0.2169950331925698, 0.054241561320731824, -0.4006745702708545, -0.06722808022396234, 0.11849333086739415, -0.04261175919489925, -0.05832148436456919, -0.014192476909121742, 0.11115691254583551, -0.04619570841263656, -0.27821762013532547, 0.18464228729514973, -0.12627877461035614, 0.011008189646932095, 0.06782530210709767, 0.0779743435509179, 0.005739096724225775, 0.0896563154908464, 0.013691484948377247, -0.348753090973965, -0.020565649616005627, 0.364662072347963, 0.22527133276605088, 0.2982653488567018, -0.322682711849389, -0.05493355049427761, 0.3364312268348168, 0.17671971970096068, -0.15972253566850786, 0.047328153422669224, -0.21199499528207208, 0.2864138975779971, -0.08369064347251602, -0.058212385745719075, -0.04498901003566773, 0.23855631272106068, 0.03299644075172103, -0.4428320583765921, -0.060431884409373866, 0.096106284196772, 0.11681187855403709, 0.018415686765523707, -0.35908504346709536, -0.029029483909455492, 0.009984852164052427, -0.038865859012888825, 0.16945227089530343, -0.03077164116320605, -0.028150572239056877, -0.09904597998272789, 0.33257105675242515, -0.1450293332884979, -0.2002765824613364, -0.012735190072461315, -0.17225474709361469, -0.14011751224651284, 0.11251252356147312, 0.022836560342946777, 0.22503323492634555, 0.03413575364317259, 0.2885965265146376, -0.1619259176330398, 0.10782291759412897, 0.14653606801901176, 0.03179318645118695, 0.1308751415926963, -0.06044807510814913, 0.12256093439646065, 0.12299168338422137, 0.010167173307348528, 0.14193190268807762, -0.3697870205277982, -0.12985927012303602, -0.1844321911668648, 0.24366438575088978, -0.23775266111846102, -0.07902748825828261, 0.22245207792350455, 0.06040039611980319, 0.24995378331969614, 0.21961106608986206, 0.1911955321278504, 0.107596049166244, -0.06281902359636582, 0.19436544704291484, -0.09639348576298368, 0.1894213091177137, -0.04100615393532359, -0.1498383196151775, 0.01920910238328835, 0.17223009718177112] |
1,802.03383 | Displays and antiferroelectric liquid crystals | Recently we have formulated theory of bi-layer-dimerized chiral liquid
antiferroelectric crystals. The spontaneous polarization has been increased
owing to the strong interaction of the aromatic cores of the rod like liquid
crystal molecules with the honey-comb pattern of the CNT walls The SmC*A
ordering is improved around the CNTs. All relaxation modes in each phase are
facilitated by dispersion of nanotubes whicg enhances the relaxation
frequencies. This composite system with improvement in electro-optical
properties can be exploited in modern display applications. SmC* LC were
studied by one of t he authors (OH), namely their transition from the SmC
phase. The role of disclinations in an applied electric field was studied by O.
Hudak in the SmC* structure. While the role of fluctuations and of
disclinations in the SmC* (FLC)was studied in the above papers, the role of
fluctuations and disclinations in SmC*A and the role of addition of MWCNTs in
SmC*A phaseis not well understood. Our theoretical description of (AFLC)
including SmC*A introduced in may thus be used to study these effects.
| cond-mat.soft | recently we have formulated theory of bilayerdimerized chiral liquid antiferroelectric crystals the spontaneous polarization has been increased owing to the strong interaction of the aromatic cores of the rod like liquid crystal molecules with the honeycomb pattern of the cnt walls the smca ordering is improved around the cnts all relaxation modes in each phase are facilitated by dispersion of nanotubes whicg enhances the relaxation frequencies this composite system with improvement in electrooptical properties can be exploited in modern display applications smc lc were studied by one of t he authors oh namely their transition from the smc phase the role of disclinations in an applied electric field was studied by o hudak in the smc structure while the role of fluctuations and of disclinations in the smc flcwas studied in the above papers the role of fluctuations and disclinations in smca and the role of addition of mwcnts in smca phaseis not well understood our theoretical description of aflc including smca introduced in may thus be used to study these effects | [['recently', 'we', 'have', 'formulated', 'theory', 'of', 'bilayerdimerized', 'chiral', 'liquid', 'antiferroelectric', 'crystals', 'the', 'spontaneous', 'polarization', 'has', 'been', 'increased', 'owing', 'to', 'the', 'strong', 'interaction', 'of', 'the', 'aromatic', 'cores', 'of', 'the', 'rod', 'like', 'liquid', 'crystal', 'molecules', 'with', 'the', 'honeycomb', 'pattern', 'of', 'the', 'cnt', 'walls', 'the', 'smca', 'ordering', 'is', 'improved', 'around', 'the', 'cnts', 'all', 'relaxation', 'modes', 'in', 'each', 'phase', 'are', 'facilitated', 'by', 'dispersion', 'of', 'nanotubes', 'whicg', 'enhances', 'the', 'relaxation', 'frequencies', 'this', 'composite', 'system', 'with', 'improvement', 'in', 'electrooptical', 'properties', 'can', 'be', 'exploited', 'in', 'modern', 'display', 'applications', 'smc', 'lc', 'were', 'studied', 'by', 'one', 'of', 't', 'he', 'authors', 'oh', 'namely', 'their', 'transition', 'from', 'the', 'smc', 'phase', 'the', 'role', 'of', 'disclinations', 'in', 'an', 'applied', 'electric', 'field', 'was', 'studied', 'by', 'o', 'hudak', 'in', 'the', 'smc', 'structure', 'while', 'the', 'role', 'of', 'fluctuations', 'and', 'of', 'disclinations', 'in', 'the', 'smc', 'flcwas', 'studied', 'in', 'the', 'above', 'papers', 'the', 'role', 'of', 'fluctuations', 'and', 'disclinations', 'in', 'smca', 'and', 'the', 'role', 'of', 'addition', 'of', 'mwcnts', 'in', 'smca', 'phaseis', 'not', 'well', 'understood', 'our', 'theoretical', 'description', 'of', 'aflc', 'including', 'smca', 'introduced', 'in', 'may', 'thus', 'be', 'used', 'to', 'study', 'these', 'effects']] | [-0.1220466398751129, 0.17293458121968502, -0.06257024928258208, 0.008059035576768443, -0.0019489461472425274, -0.07647713880517526, 0.03524515453466733, 0.4068333210233978, -0.2406476293470917, -0.3046331074852831, 0.04629670724713294, -0.2511231332918361, -0.13877563132251985, 0.12042886693787644, -0.01214552963855551, 0.019351123037474778, -0.034174145355508355, -0.0338777914060514, -0.03151244173679657, -0.2207181145232115, 0.22666683843537808, 0.06571422242921983, 0.3095339362782811, 0.07396324445119874, 0.03323343006840316, -0.007961035297603575, 0.02927023571676123, 0.05049202602892043, -0.13833344107337608, 0.10508591871887088, 0.24522172735514633, -0.02758891580620792, 0.2029844896287886, -0.4793527302092421, -0.2285559343475246, 0.05424504149231145, 0.17263159290524924, 0.1193844253451056, -0.05737922322228105, -0.2734324949553716, 0.06366057932574837, -0.13250817786651234, -0.14201130758424452, -0.037979377890953764, 0.022760382845780316, 0.06353783727174592, -0.17519351501822258, 0.09732722672689595, 0.08937533480090139, 0.10679795889756022, -0.06098707972797091, -0.14458509984155726, -0.05979479221114052, 0.10095952196649002, 0.07480849623875302, 0.03279810954822216, 0.16669770759393734, -0.16098905139335035, -0.127571851115473, 0.4141452505537671, -0.06537568501983128, -0.10521519003285396, 0.15481796595797745, -0.13225032937640469, -0.12940777561342912, 0.17797031386024847, 0.1267396601047339, 0.11490603161468255, -0.12364851078889919, 0.08017996436404622, 0.013980449109009193, 0.13473592444203103, 0.10036551441807678, 0.06932199029196165, 0.24504497046666052, 0.1794518251473943, -0.0063261185552434115, 0.18036979336352896, -0.112516651065284, -0.11376724431073729, -0.20407139944068775, -0.18779101856275945, -0.15598295165105963, 0.002030782276171282, -0.0640356191431352, -0.13923714803475998, 0.36240705998034445, 0.08747567994935539, 0.15705202827732007, -0.08324367298694428, 0.19282495824781853, 0.0809166091236336, 0.11692018554445557, 0.01567060272014159, 0.3186481895460608, 0.18879545582068002, 0.11271216896708364, -0.27890705742906713, 0.1095619093080213, 0.034037963554129275] |
1,802.03384 | Biadjoint scalar tree amplitudes and intersecting dual associahedra | We present a new formula for the biadjoint scalar tree amplitudes
$m(\alpha|\beta)$ based on the combinatorics of dual associahedra. Our
construction makes essential use of the cones in 'kinematic space' introduced
by Arkani-Hamed, Bai, He, and Yan. We then consider dual associahedra in 'dual
kinematic space.' If appropriately embedded, the intersections of these dual
associahedra encode the amplitudes $m(\alpha|\beta)$. In fact, we encode all
the partial amplitudes at $n$-points using a single object (a fan) in dual
kinematic space. Equivalently, as a pleasant corollary of our construction, all
$n$-point partial amplitudes can be understood as coming from integrals over
subvarieties in a single toric variety. Explicit formulas for the amplitudes
then follow by evaluating these integrals using the equivariant localisation
(or Duistermaat-Heckman) formula. Finally, by introducing a lattice in
kinematic space, we observe that our fan is also related to the inverse KLT
kernel, sometimes denoted $m_{\alpha'}(\alpha|\beta)$.
| hep-th | we present a new formula for the biadjoint scalar tree amplitudes malphabeta based on the combinatorics of dual associahedra our construction makes essential use of the cones in kinematic space introduced by arkanihamed bai he and yan we then consider dual associahedra in dual kinematic space if appropriately embedded the intersections of these dual associahedra encode the amplitudes malphabeta in fact we encode all the partial amplitudes at npoints using a single object a fan in dual kinematic space equivalently as a pleasant corollary of our construction all npoint partial amplitudes can be understood as coming from integrals over subvarieties in a single toric variety explicit formulas for the amplitudes then follow by evaluating these integrals using the equivariant localisation or duistermaatheckman formula finally by introducing a lattice in kinematic space we observe that our fan is also related to the inverse klt kernel sometimes denoted m_alphaalphabeta | [['we', 'present', 'a', 'new', 'formula', 'for', 'the', 'biadjoint', 'scalar', 'tree', 'amplitudes', 'malphabeta', 'based', 'on', 'the', 'combinatorics', 'of', 'dual', 'associahedra', 'our', 'construction', 'makes', 'essential', 'use', 'of', 'the', 'cones', 'in', 'kinematic', 'space', 'introduced', 'by', 'arkanihamed', 'bai', 'he', 'and', 'yan', 'we', 'then', 'consider', 'dual', 'associahedra', 'in', 'dual', 'kinematic', 'space', 'if', 'appropriately', 'embedded', 'the', 'intersections', 'of', 'these', 'dual', 'associahedra', 'encode', 'the', 'amplitudes', 'malphabeta', 'in', 'fact', 'we', 'encode', 'all', 'the', 'partial', 'amplitudes', 'at', 'npoints', 'using', 'a', 'single', 'object', 'a', 'fan', 'in', 'dual', 'kinematic', 'space', 'equivalently', 'as', 'a', 'pleasant', 'corollary', 'of', 'our', 'construction', 'all', 'npoint', 'partial', 'amplitudes', 'can', 'be', 'understood', 'as', 'coming', 'from', 'integrals', 'over', 'subvarieties', 'in', 'a', 'single', 'toric', 'variety', 'explicit', 'formulas', 'for', 'the', 'amplitudes', 'then', 'follow', 'by', 'evaluating', 'these', 'integrals', 'using', 'the', 'equivariant', 'localisation', 'or', 'duistermaatheckman', 'formula', 'finally', 'by', 'introducing', 'a', 'lattice', 'in', 'kinematic', 'space', 'we', 'observe', 'that', 'our', 'fan', 'is', 'also', 'related', 'to', 'the', 'inverse', 'klt', 'kernel', 'sometimes', 'denoted', 'm_alphaalphabeta']] | [-0.10558869537087284, 0.11242091912163855, -0.10095061646289613, 0.14436246726936214, -0.12089636548396761, -0.09229209895998444, 0.03787999154763832, 0.349548987470159, -0.2793126301712369, -0.21270090446820203, 0.07413371579166604, -0.21049694764453356, -0.2179159774103725, 0.1816426174542133, -0.11430513778849336, 0.008868261680568326, 0.036666373782854984, 0.02701721260043448, -0.11342191950925179, -0.258987029137892, 0.3713846752126637, -0.03420855060589742, 0.21999134787371102, 0.026619640707631582, 0.1423152957194523, 0.10296938732610889, -0.0772392379091287, 0.03670817040615039, -0.13291852254515604, 0.1363490415156551, 0.272785677834516, 0.1303037320589009, 0.11799798956721358, -0.3813204873474442, -0.15154218475680403, 0.10299162661707768, 0.18103646240771226, 0.07839194140460802, 0.03903517150559322, -0.2718737084188894, 0.05857173082648381, -0.16097715384528608, -0.1515422848416875, -0.10813834317896055, 0.03056034058641821, -0.013469220949209307, -0.24320804190898493, -0.014318525537805415, 0.04818338812137508, 0.05083877160548781, -0.0021754689482742385, -0.11661269010063771, -0.06765613970601905, 0.0659160639385833, -0.03066768840972768, 0.07655506062142756, 0.048019230404026704, -0.11613233457080228, -0.1760738693880976, 0.329348781294419, -0.047257644922092994, -0.24978838699920844, 0.11678830519069802, -0.14726024443899244, -0.17249419726112425, 0.13341606902724054, 0.11161394791090734, 0.16507051629652206, -0.10531485270810863, 0.1598418560417286, -0.11165244382334082, 0.02426663874201987, 0.16759302068425164, 0.04365148407100917, 0.18729460652126637, 0.07093247423930833, 0.009020572151089317, 0.18118022972229894, -0.05129756576266803, -0.08025267317074619, -0.3778793876480362, -0.15507501828179643, -0.12862986586318184, 0.09887512095195994, -0.14506275068571048, -0.1736687777933907, 0.3411611630134795, 0.08212150511856522, 0.2405833616965986, 0.09042702156616604, 0.24541073188357923, 0.09229698279323949, 0.06546845516725762, 0.05624376450129466, 0.16174193328782305, 0.18461188150104135, 0.026715632734584226, -0.16470534778806087, -0.007435150404639338, 0.24447725337853476] |
1,802.03385 | Krein-type theorems and ordered structure for Cauchy-de Branges spaces | We extend some results of M.G. Krein to the class of entire functions which
can be represented as ratios of discrete Cauchy transforms in the plane. As an
application we obtain new versions of de Branges' Ordering Theorem for nearly
invariant subspaces in a class of Hilbert spaces of entire functions. Examples
illustrating sharpness of the obtained results are given.
| math.CV math.FA | we extend some results of mg krein to the class of entire functions which can be represented as ratios of discrete cauchy transforms in the plane as an application we obtain new versions of de branges ordering theorem for nearly invariant subspaces in a class of hilbert spaces of entire functions examples illustrating sharpness of the obtained results are given | [['we', 'extend', 'some', 'results', 'of', 'mg', 'krein', 'to', 'the', 'class', 'of', 'entire', 'functions', 'which', 'can', 'be', 'represented', 'as', 'ratios', 'of', 'discrete', 'cauchy', 'transforms', 'in', 'the', 'plane', 'as', 'an', 'application', 'we', 'obtain', 'new', 'versions', 'of', 'de', 'branges', 'ordering', 'theorem', 'for', 'nearly', 'invariant', 'subspaces', 'in', 'a', 'class', 'of', 'hilbert', 'spaces', 'of', 'entire', 'functions', 'examples', 'illustrating', 'sharpness', 'of', 'the', 'obtained', 'results', 'are', 'given']] | [-0.09726361353726437, 0.08136428645254151, -0.05975668265018612, 0.11223801895976067, -0.05995975110757475, -0.031403721085128684, -0.03388564029398064, 0.3535278138394157, -0.27770597183456025, -0.23539605416978399, 0.11959330351479973, -0.23550767271469036, -0.16330745046337444, 0.274102302097405, -0.10770171580370516, 0.06217375160194934, 0.02395265786132465, -0.0001545010367408395, -0.18107170974835754, -0.2675127190925802, 0.38491386628399293, -0.01007767083744208, 0.1963473155318449, 0.01827381901287784, 0.06646428590950866, 0.02945370845651875, -0.02824913294365009, 0.019751867279410362, -0.16224657798496386, 0.11725035996399431, 0.32520533284793296, 0.1609569551112751, 0.23193696433057387, -0.3134082251538833, -0.17700894994971653, 0.15458873012103141, 0.13522194520240494, 0.04760627771999377, -0.03415263748417298, -0.34639803630610305, 0.058610613473380604, -0.11401982667545478, -0.18662369741747778, -0.12311841519549489, -0.04180309554406752, 0.081850380039153, -0.2867474816739559, 0.04037340270200123, 0.11404125764966011, 0.04703295631334185, -0.17604464099276812, -0.12053653901287666, -0.0437468881951645, 0.10057278835835556, -0.004972122679464519, 0.006308630582255622, 0.06391531777723382, -0.04275887868522356, -0.14406258633825927, 0.3389481756525735, -0.08989146887227738, -0.25315439819047847, 0.13646704857237638, -0.13568639176276823, -0.15675828637710462, 0.1072189146381182, 0.16386014789653322, 0.16593155196557444, -0.057796045082310836, 0.16135660478224356, -0.10997236416830371, 0.09819136690348387, 0.12499464803840965, 0.07683711087641616, 0.11123756196272248, 0.06921718702651561, 0.0941608890114973, 0.20716743280451436, -0.007013554981676861, -0.12654707964490322, -0.3928046563329796, -0.22579676398697, -0.20446570102940315, 0.051058214406172434, -0.11404254710456978, -0.22214583276460567, 0.41841616071760657, 0.057979714063306646, 0.2446295333094895, 0.10315645674127154, 0.14893982713110746, 0.12111009005069112, 0.017683872068300844, 0.045748992497101425, 0.14505969133315375, 0.1672247660967211, 0.07755307726717243, -0.08165555934732159, -0.01506095212729027, 0.17244957819736254] |
1,802.03386 | Make the Minority Great Again: First-Order Regret Bound for Contextual
Bandits | Regret bounds in online learning compare the player's performance to $L^*$,
the optimal performance in hindsight with a fixed strategy. Typically such
bounds scale with the square root of the time horizon $T$. The more refined
concept of first-order regret bound replaces this with a scaling $\sqrt{L^*}$,
which may be much smaller than $\sqrt{T}$. It is well known that minor variants
of standard algorithms satisfy first-order regret bounds in the full
information and multi-armed bandit settings. In a COLT 2017 open problem,
Agarwal, Krishnamurthy, Langford, Luo, and Schapire raised the issue that
existing techniques do not seem sufficient to obtain first-order regret bounds
for the contextual bandit problem. In the present paper, we resolve this open
problem by presenting a new strategy based on augmenting the policy space.
| cs.LG | regret bounds in online learning compare the players performance to l the optimal performance in hindsight with a fixed strategy typically such bounds scale with the square root of the time horizon t the more refined concept of firstorder regret bound replaces this with a scaling sqrtl which may be much smaller than sqrtt it is well known that minor variants of standard algorithms satisfy firstorder regret bounds in the full information and multiarmed bandit settings in a colt 2017 open problem agarwal krishnamurthy langford luo and schapire raised the issue that existing techniques do not seem sufficient to obtain firstorder regret bounds for the contextual bandit problem in the present paper we resolve this open problem by presenting a new strategy based on augmenting the policy space | [['regret', 'bounds', 'in', 'online', 'learning', 'compare', 'the', 'players', 'performance', 'to', 'l', 'the', 'optimal', 'performance', 'in', 'hindsight', 'with', 'a', 'fixed', 'strategy', 'typically', 'such', 'bounds', 'scale', 'with', 'the', 'square', 'root', 'of', 'the', 'time', 'horizon', 't', 'the', 'more', 'refined', 'concept', 'of', 'firstorder', 'regret', 'bound', 'replaces', 'this', 'with', 'a', 'scaling', 'sqrtl', 'which', 'may', 'be', 'much', 'smaller', 'than', 'sqrtt', 'it', 'is', 'well', 'known', 'that', 'minor', 'variants', 'of', 'standard', 'algorithms', 'satisfy', 'firstorder', 'regret', 'bounds', 'in', 'the', 'full', 'information', 'and', 'multiarmed', 'bandit', 'settings', 'in', 'a', 'colt', '2017', 'open', 'problem', 'agarwal', 'krishnamurthy', 'langford', 'luo', 'and', 'schapire', 'raised', 'the', 'issue', 'that', 'existing', 'techniques', 'do', 'not', 'seem', 'sufficient', 'to', 'obtain', 'firstorder', 'regret', 'bounds', 'for', 'the', 'contextual', 'bandit', 'problem', 'in', 'the', 'present', 'paper', 'we', 'resolve', 'this', 'open', 'problem', 'by', 'presenting', 'a', 'new', 'strategy', 'based', 'on', 'augmenting', 'the', 'policy', 'space']] | [-0.08850189141867304, 0.035548251478758175, -0.09031350848454167, 0.1306711577663009, -0.16500919529971725, -0.20643413410471112, 0.12586755606480438, 0.3589152276836103, -0.27127221135015134, -0.3511686571655446, 0.14067817765953805, -0.2522215245626285, -0.15048895124891715, 0.18480026701672614, -0.1820486054311914, 0.11442071527562803, 0.03796817207330605, 0.0420589656860102, -0.055356558706989745, -0.34163059695856646, 0.27596232677751686, 0.09139357657841174, 0.23383271888451418, 0.022564025328392745, 0.06991046871553408, -0.011042391848604893, -0.0026442259677423863, 0.0618588857503255, -0.2044379306959172, 0.07447562478137115, 0.29639347293687024, 0.1861663263371156, 0.37487606445210986, -0.35322010271192994, -0.14338217564818478, 0.14064016522843303, 0.1348061263852287, 0.08207571391085366, -0.040535149889933564, -0.305522297960124, 0.03616336200866499, -0.11975866821740055, -0.028950517891644267, -0.033822893062279036, -0.03141963149028015, -0.038664645497192396, -0.3195486581971636, 0.05380782138672657, 0.12127532921022066, 0.011277715555479517, -0.026548078822088428, -0.1625468020356493, 0.12132809917056875, 0.06077021892633638, 0.042575822428261745, 0.07312657081183715, 0.08408713377139065, -0.11322508836747147, -0.2236650654067489, 0.3277585918549448, -0.06522243482788781, -0.169811536630732, 0.13822294188594242, -0.09205182703954051, -0.14962484702846268, 0.09677486901318844, 0.20219704900409852, 0.16203217619477073, -0.13635370644624345, 0.13460903980103467, -0.10765619936319126, 0.16632745667448035, 0.0827134337669122, 0.05086056318396004, 0.040497308003978105, 0.1856753952552026, 0.18656259005547327, 0.1385706771752666, 0.009528461623631301, -0.15636884851846844, -0.25338767962239217, -0.10200057413067043, -0.15961859556591662, -0.015760031817876552, -0.12562009931912144, -0.1353849096885824, 0.2845654593947984, 0.1628824870213066, 0.20489838697903906, 0.18533163771735417, 0.31343642154297413, 0.08712567662360016, 0.05163218625966692, 0.2126616797868337, 0.21976117166104814, 0.048050735147626256, 0.11805737007307471, -0.20764698068433063, 0.11782067181411549, 0.10683547066673782] |
1,802.03387 | Zero-sum Analogues of van der Waerden's Theorem on Arithmetic
Progressions | Let $r$ and $k$ be positive integers with $r \mid k$. Denote by
$w_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer such that every coloring
$\chi:[1,w_{\mathrm{\mathfrak{z}}}(k;r)] \rightarrow \{0,1,\dots,r-1\}$ admits
a $k$-term arithmetic progression $a,a+d,\dots,a+(k-1)d$ with $\sum_{j=0}^{k-1}
\chi(a+jd) \equiv 0 \,(\mathrm{mod }\,r)$. We investigate these numbers as well
as a "mixed" monochromatic/zero-sum analogue. We also present an interesting
reciprocity between the van der Waerden numbers and
$w_{\mathrm{\mathfrak{z}}}(k;r)$.
| math.CO | let r and k be positive integers with r mid k denote by w_mathrmmathfrakzkr the minimum integer such that every coloring chi1w_mathrmmathfrakzkr rightarrow 01dotsr1 admits a kterm arithmetic progression aaddotsak1d with sum_j0k1 chiajd equiv 0 mathrmmod r we investigate these numbers as well as a mixed monochromaticzerosum analogue we also present an interesting reciprocity between the van der waerden numbers and w_mathrmmathfrakzkr | [['let', 'r', 'and', 'k', 'be', 'positive', 'integers', 'with', 'r', 'mid', 'k', 'denote', 'by', 'w_mathrmmathfrakzkr', 'the', 'minimum', 'integer', 'such', 'that', 'every', 'coloring', 'chi1w_mathrmmathfrakzkr', 'rightarrow', '01dotsr1', 'admits', 'a', 'kterm', 'arithmetic', 'progression', 'aaddotsak1d', 'with', 'sum_j0k1', 'chiajd', 'equiv', '0', 'mathrmmod', 'r', 'we', 'investigate', 'these', 'numbers', 'as', 'well', 'as', 'a', 'mixed', 'monochromaticzerosum', 'analogue', 'we', 'also', 'present', 'an', 'interesting', 'reciprocity', 'between', 'the', 'van', 'der', 'waerden', 'numbers', 'and', 'w_mathrmmathfrakzkr']] | [-0.2699564442885193, 0.13662276328356132, -0.06786121732809326, 0.018952380254102702, -0.034510448083958846, -0.23131301961839199, 0.016652100190350957, 0.2677064830056307, -0.32866607904434203, -0.2566123364022298, 0.03246968371624297, -0.3409844463860447, -0.19434628327461806, 0.14616405999457294, -0.04373422557149421, -0.0665759934535758, -0.023825870183381167, 0.05311643584970046, -0.006826978748325597, -0.23611373285000975, 0.237771939587864, -0.06337797115133567, 0.040207983688874675, 0.07005001453005455, 0.05174974843182347, 0.07015573677860877, 0.07794616224074906, 0.05425509705462239, -0.2917925517377708, 0.02522361830554225, 0.320736551835117, 0.11167030144821513, 0.33607264019718225, -0.33864122875278224, -0.09713023115288127, 0.2634097099304199, 0.15155292532660744, -0.06848037349144843, 0.016211811927231874, -0.19822282984175466, 0.20622573620216414, -0.1500521912493489, -0.07666993981904605, -0.05536371943625537, 0.19353292079811746, 0.0923397379165346, -0.3363343836908991, 0.007762980261627077, 0.07693461847110566, 0.1823167230256579, 0.038953996140679174, -0.28553947743705727, -0.016157432810657405, 0.04576983862048523, -0.06844352780925957, 0.09930493872909045, -0.036331220691896635, -0.04638903402638706, -0.11962016746401787, 0.36901648166504775, -0.13488628058270974, -0.13088697408410635, 0.08725109983193265, -0.12856917385519906, -0.10948651021515782, 0.05290592324666001, 0.04628320878202265, 0.14962398325177756, 0.06545348952270368, 0.21198946248358963, -0.15127291714941912, 0.17015930862081322, 0.19628680795431136, 0.022902882310815834, 0.2027673931877044, -0.00768988605758006, 0.05198384371840141, 0.14737345335624097, -0.005479324583641507, 0.10083229226822203, -0.3559662092815746, -0.21339396190914242, -0.20807235737077215, 0.237058734301139, -0.1297351903615477, -0.17271988693286072, 0.24410867128859867, 0.034865385615690185, 0.1959821653129025, 0.15847102738916874, 0.22260228117335248, 0.10114942731081762, -0.0005126840180971406, 0.10322714369236068, 0.00804191722788594, 0.2218180371321399, -0.03320017419755459, -0.17566219488666815, -0.013446522910486569, 0.17248099066994407] |
1,802.03388 | Search for Higgs boson decays to beyond-the-Standard-Model light bosons
in four-lepton events with the ATLAS detector at $\sqrt{s}=13$ TeV | A search is conducted for a new beyond-the-Standard-Model boson using events
where a Higgs boson with mass 125 GeV decays to four leptons ($\ell =$ $e$ or
$\mu$). This decay is presumed to occur via an intermediate state which
contains one or two on-shell, promptly decaying bosons: $H\rightarrow ZX/XX
\rightarrow 4\ell$, where $X$ is a new vector boson $Z_d$ or pseudoscalar $a$
with mass between 1 and 60 GeV. The search uses $pp$ collision data collected
with the ATLAS detector at the LHC with an integrated luminosity of 36.1
fb$^{-1}$ at a centre-of-mass energy $\sqrt{s}=13$ TeV. No significant excess
of events above Standard Model background predictions is observed; therefore,
upper limits at 95% confidence level are set on model-independent fiducial
cross-sections, and on the Higgs boson decay branching ratios to vector and
pseudoscalar bosons in two benchmark models.
| hep-ex | a search is conducted for a new beyondthestandardmodel boson using events where a higgs boson with mass 125 gev decays to four leptons ell e or mu this decay is presumed to occur via an intermediate state which contains one or two onshell promptly decaying bosons hrightarrow zxxx rightarrow 4ell where x is a new vector boson z_d or pseudoscalar a with mass between 1 and 60 gev the search uses pp collision data collected with the atlas detector at the lhc with an integrated luminosity of 361 fb1 at a centreofmass energy sqrts13 tev no significant excess of events above standard model background predictions is observed therefore upper limits at 95 confidence level are set on modelindependent fiducial crosssections and on the higgs boson decay branching ratios to vector and pseudoscalar bosons in two benchmark models | [['a', 'search', 'is', 'conducted', 'for', 'a', 'new', 'beyondthestandardmodel', 'boson', 'using', 'events', 'where', 'a', 'higgs', 'boson', 'with', 'mass', '125', 'gev', 'decays', 'to', 'four', 'leptons', 'ell', 'e', 'or', 'mu', 'this', 'decay', 'is', 'presumed', 'to', 'occur', 'via', 'an', 'intermediate', 'state', 'which', 'contains', 'one', 'or', 'two', 'onshell', 'promptly', 'decaying', 'bosons', 'hrightarrow', 'zxxx', 'rightarrow', '4ell', 'where', 'x', 'is', 'a', 'new', 'vector', 'boson', 'z_d', 'or', 'pseudoscalar', 'a', 'with', 'mass', 'between', '1', 'and', '60', 'gev', 'the', 'search', 'uses', 'pp', 'collision', 'data', 'collected', 'with', 'the', 'atlas', 'detector', 'at', 'the', 'lhc', 'with', 'an', 'integrated', 'luminosity', 'of', '361', 'fb1', 'at', 'a', 'centreofmass', 'energy', 'sqrts13', 'tev', 'no', 'significant', 'excess', 'of', 'events', 'above', 'standard', 'model', 'background', 'predictions', 'is', 'observed', 'therefore', 'upper', 'limits', 'at', '95', 'confidence', 'level', 'are', 'set', 'on', 'modelindependent', 'fiducial', 'crosssections', 'and', 'on', 'the', 'higgs', 'boson', 'decay', 'branching', 'ratios', 'to', 'vector', 'and', 'pseudoscalar', 'bosons', 'in', 'two', 'benchmark', 'models']] | [-0.058455341953102855, 0.2773430198394635, -0.038441462437142894, 0.18420696800817762, -0.06622381657635902, -0.19824095761321267, 0.055554199504138736, 0.3305913558767369, -0.1602207217570942, -0.31749113479300456, -0.012218123984091696, -0.3820770501076956, 0.13450690807932167, 0.14579881955561338, 0.13247257170287946, 0.10201629527899272, 0.15545382942175767, 0.04909385664744631, -0.009094630412565655, -0.24812076895100557, 0.241163154170328, 0.060447913637343684, 0.17799544666880085, 0.054778180047458803, 0.09429131430207395, 0.026207057740333873, -0.019978968562313907, -0.17408855050898103, -0.11890282528303728, 0.03847607718917596, 0.1969828608865314, 0.09034671557053704, 0.12619765512371325, -0.24958352763068808, -0.0328668093545061, 0.24006033808622948, 0.1733992919565507, 6.01676754954764e-06, -0.0666784369643531, -0.39150313599213193, 0.15726818924304098, -0.22795637565842994, -0.04006495951633791, 0.030863882691311816, 0.022114947143777767, -0.14264754708582425, -0.3927512345424689, 0.10835853025406215, -0.11049494488157935, 0.08362032952936715, -0.012311715019784649, -0.221307244953042, -0.10497093754512367, -0.10781403945464477, 0.1285530210880097, 0.11396211446267177, 0.2142430156476193, -0.16613947668926865, -0.24795378960312947, 0.3264159246293061, -0.12517480098347947, -0.1678815962959026, 0.2504293549778488, -0.1613694309592521, -0.14200124632471295, 0.2298543147455134, 0.3036247810266693, 0.007247496964683866, -0.24211664388969759, 0.16442764654750455, -0.008661516453952679, 0.2134801409316852, 0.06576236245318261, 0.053473942919962984, 0.2529266816936262, 0.251244474462617, -0.006784136489252834, 0.02381421285955345, -0.16361358674475923, -0.01948908463408075, -0.49658303292851674, -0.11697931136757903, -0.035377723373719215, 0.09668445759983596, -0.04739348595477863, -0.0425196398213944, 0.32891164787853244, 0.08144345744649935, 0.37390345176818834, 0.023495179072864737, 0.27394504324012603, 0.12481634449892119, 0.0670361186733798, 0.0830146390842, 0.3443961425526889, 0.12171566521283239, 0.12303017681765863, -0.12442183126832414, -0.06787582310190533, 0.06596210392822019] |
1,802.03389 | Adding transmitters dramatically boosts coded-caching gains for finite
file sizes | In the context of coded caching in the $K$-user BC, our work reveals the
surprising fact that having multiple ($L$) transmitting antennas, dramatically
ameliorates the long-standing subpacketization bottleneck of coded caching by
reducing the required subpacketization to approximately its $L$th root, thus
boosting the actual DoF by a multiplicative factor of up to $L$. In asymptotic
terms, this reveals that as long as $L$ scales with the theoretical caching
gain, then the full cumulative (multiplexing + full caching) gains are achieved
with constant subpacketization. This is the first time, in any known setting,
that unbounded caching gains appear under finite file-size constraints. The
achieved caching gains here are up to $L$ times higher than any caching gains
previously experienced in any single- or multi-antenna fully-connected setting,
thus offering a multiplicative mitigation to a subpacketization problem that
was previously known to hard-bound caching gains to small constants.
The proposed scheme is practical and it works for all values of $K,L$ and all
cache sizes. The scheme's gains show in practice: e.g. for $K=100$, when $L=1$
the theoretical caching gain of $G=10$, under the original coded caching
algorithm, would have needed subpacketization $S_1 = \binom{K}{G}=
\binom{100}{10} > 10^{13}$, while if extra transmitting antennas were added,
the subpacketization was previously known to match or exceed $S_1$. Now for
$L=5$, our scheme offers the theoretical (unconstrained) cumulative DoF $d_L =
L+G = 5+10=15$, with subpacketization $S_L=\binom{K/L}{G/L}
=\binom{100/5}{10/5} = 190$. The work extends to the multi-server and
cache-aided IC settings, while the scheme's performance, given subpacketization
$S_L=\binom{K/L}{G/L}$, is within a factor of 2 from the optimal linear
sum-DoF.
| cs.IT math.IT | in the context of coded caching in the kuser bc our work reveals the surprising fact that having multiple l transmitting antennas dramatically ameliorates the longstanding subpacketization bottleneck of coded caching by reducing the required subpacketization to approximately its lth root thus boosting the actual dof by a multiplicative factor of up to l in asymptotic terms this reveals that as long as l scales with the theoretical caching gain then the full cumulative multiplexing full caching gains are achieved with constant subpacketization this is the first time in any known setting that unbounded caching gains appear under finite filesize constraints the achieved caching gains here are up to l times higher than any caching gains previously experienced in any single or multiantenna fullyconnected setting thus offering a multiplicative mitigation to a subpacketization problem that was previously known to hardbound caching gains to small constants the proposed scheme is practical and it works for all values of kl and all cache sizes the schemes gains show in practice eg for k100 when l1 the theoretical caching gain of g10 under the original coded caching algorithm would have needed subpacketization s_1 binomkg binom10010 1013 while if extra transmitting antennas were added the subpacketization was previously known to match or exceed s_1 now for l5 our scheme offers the theoretical unconstrained cumulative dof d_l lg 51015 with subpacketization s_lbinomklgl binom1005105 190 the work extends to the multiserver and cacheaided ic settings while the schemes performance given subpacketization s_lbinomklgl is within a factor of 2 from the optimal linear sumdof | [['in', 'the', 'context', 'of', 'coded', 'caching', 'in', 'the', 'kuser', 'bc', 'our', 'work', 'reveals', 'the', 'surprising', 'fact', 'that', 'having', 'multiple', 'l', 'transmitting', 'antennas', 'dramatically', 'ameliorates', 'the', 'longstanding', 'subpacketization', 'bottleneck', 'of', 'coded', 'caching', 'by', 'reducing', 'the', 'required', 'subpacketization', 'to', 'approximately', 'its', 'lth', 'root', 'thus', 'boosting', 'the', 'actual', 'dof', 'by', 'a', 'multiplicative', 'factor', 'of', 'up', 'to', 'l', 'in', 'asymptotic', 'terms', 'this', 'reveals', 'that', 'as', 'long', 'as', 'l', 'scales', 'with', 'the', 'theoretical', 'caching', 'gain', 'then', 'the', 'full', 'cumulative', 'multiplexing', 'full', 'caching', 'gains', 'are', 'achieved', 'with', 'constant', 'subpacketization', 'this', 'is', 'the', 'first', 'time', 'in', 'any', 'known', 'setting', 'that', 'unbounded', 'caching', 'gains', 'appear', 'under', 'finite', 'filesize', 'constraints', 'the', 'achieved', 'caching', 'gains', 'here', 'are', 'up', 'to', 'l', 'times', 'higher', 'than', 'any', 'caching', 'gains', 'previously', 'experienced', 'in', 'any', 'single', 'or', 'multiantenna', 'fullyconnected', 'setting', 'thus', 'offering', 'a', 'multiplicative', 'mitigation', 'to', 'a', 'subpacketization', 'problem', 'that', 'was', 'previously', 'known', 'to', 'hardbound', 'caching', 'gains', 'to', 'small', 'constants', 'the', 'proposed', 'scheme', 'is', 'practical', 'and', 'it', 'works', 'for', 'all', 'values', 'of', 'kl', 'and', 'all', 'cache', 'sizes', 'the', 'schemes', 'gains', 'show', 'in', 'practice', 'eg', 'for', 'k100', 'when', 'l1', 'the', 'theoretical', 'caching', 'gain', 'of', 'g10', 'under', 'the', 'original', 'coded', 'caching', 'algorithm', 'would', 'have', 'needed', 'subpacketization', 's_1', 'binomkg', 'binom10010', '1013', 'while', 'if', 'extra', 'transmitting', 'antennas', 'were', 'added', 'the', 'subpacketization', 'was', 'previously', 'known', 'to', 'match', 'or', 'exceed', 's_1', 'now', 'for', 'l5', 'our', 'scheme', 'offers', 'the', 'theoretical', 'unconstrained', 'cumulative', 'dof', 'd_l', 'lg', '51015', 'with', 'subpacketization', 's_lbinomklgl', 'binom1005105', '190', 'the', 'work', 'extends', 'to', 'the', 'multiserver', 'and', 'cacheaided', 'ic', 'settings', 'while', 'the', 'schemes', 'performance', 'given', 'subpacketization', 's_lbinomklgl', 'is', 'within', 'a', 'factor', 'of', '2', 'from', 'the', 'optimal', 'linear', 'sumdof']] | [-0.22061343098071357, 0.05162683115581949, -0.007165878877578029, 0.010252184619054762, -0.0649516850865754, -0.23904459145053686, 0.1535504465696376, 0.3769580051599746, -0.2601569859511349, -0.31146677426875113, 0.06956243676280016, -0.23871913634980862, -0.10704858196468883, 0.1273394998114749, -0.13025996153821717, 0.07000175093105146, -0.0015894806051094121, 0.03775505962980117, -0.06443077906598875, -0.3865968647813684, 0.2383683692006231, 0.1391532279781077, 0.3076953909524987, 0.021746277705714315, 0.07614607697508606, -0.028517256756748544, -0.019045910769257234, -0.03990737348470273, -0.10959936246756868, 0.0659326405159617, 0.3142286686642296, 0.14057515982716562, 0.27596521678851893, -0.35106692901734576, -0.24227398869524008, 0.08198046254734341, 0.21297224413665464, 0.07049526475125041, -0.006321752095359389, -0.21796835488472802, 0.1858048532974435, -0.2117189498510642, -0.04070778491635959, 0.03047080995863771, -0.013563333094988271, 0.005787741956839049, -0.35078021948526344, 0.001367810441540977, 0.046969130497974944, 0.017066583365751096, -0.015684033536715842, -0.21742517020160507, 0.04306953725779793, 0.12305254150431072, 0.03154200509902966, 0.042910882147526246, 0.06330201594322267, -0.08800647932566717, -0.12673180564807587, 0.3844807114882536, 0.00036272577090565474, -0.21305157358765572, 0.10878192007252241, -0.133827867404747, -0.07979500811060972, 0.21213425545622985, 0.1644089125501237, 0.0668491661164583, -0.11699269655415931, 0.09820196873891497, -0.06540503454175722, 0.20131017164924586, 0.1676115279514491, 0.15537369996216518, 0.06604558522108037, 0.1813260344628419, 0.14217222998483642, 0.1250043033355053, -0.06770941565848472, -0.10749846736740959, -0.234873994322451, -0.08555595134199408, -0.192889846903105, 0.048302801117784275, -0.16170811821295894, -0.015576560350795429, 0.29020678185666166, 0.11259751735427657, 0.13264079783037602, 0.17711147823857062, 0.38208201205899633, 0.08965695634961084, 0.13251856155484817, 0.18826476655032234, 0.18820459268935233, 0.07957683337306923, 0.10173171327868662, -0.21905026157327234, 0.06513193034844295, -0.009094765990512423] |
1,802.0339 | Same-different problems strain convolutional neural networks | The robust and efficient recognition of visual relations in images is a
hallmark of biological vision. We argue that, despite recent progress in visual
recognition, modern machine vision algorithms are severely limited in their
ability to learn visual relations. Through controlled experiments, we
demonstrate that visual-relation problems strain convolutional neural networks
(CNNs). The networks eventually break altogether when rote memorization becomes
impossible, as when intra-class variability exceeds network capacity. Motivated
by the comparable success of biological vision, we argue that feedback
mechanisms including attention and perceptual grouping may be the key
computational components underlying abstract visual reasoning.\
| cs.CV cs.AI cs.LG q-bio.NC | the robust and efficient recognition of visual relations in images is a hallmark of biological vision we argue that despite recent progress in visual recognition modern machine vision algorithms are severely limited in their ability to learn visual relations through controlled experiments we demonstrate that visualrelation problems strain convolutional neural networks cnns the networks eventually break altogether when rote memorization becomes impossible as when intraclass variability exceeds network capacity motivated by the comparable success of biological vision we argue that feedback mechanisms including attention and perceptual grouping may be the key computational components underlying abstract visual reasoning | [['the', 'robust', 'and', 'efficient', 'recognition', 'of', 'visual', 'relations', 'in', 'images', 'is', 'a', 'hallmark', 'of', 'biological', 'vision', 'we', 'argue', 'that', 'despite', 'recent', 'progress', 'in', 'visual', 'recognition', 'modern', 'machine', 'vision', 'algorithms', 'are', 'severely', 'limited', 'in', 'their', 'ability', 'to', 'learn', 'visual', 'relations', 'through', 'controlled', 'experiments', 'we', 'demonstrate', 'that', 'visualrelation', 'problems', 'strain', 'convolutional', 'neural', 'networks', 'cnns', 'the', 'networks', 'eventually', 'break', 'altogether', 'when', 'rote', 'memorization', 'becomes', 'impossible', 'as', 'when', 'intraclass', 'variability', 'exceeds', 'network', 'capacity', 'motivated', 'by', 'the', 'comparable', 'success', 'of', 'biological', 'vision', 'we', 'argue', 'that', 'feedback', 'mechanisms', 'including', 'attention', 'and', 'perceptual', 'grouping', 'may', 'be', 'the', 'key', 'computational', 'components', 'underlying', 'abstract', 'visual', 'reasoning']] | [-0.07530441707543407, 0.056245832403268047, -0.03058694873470813, 0.09424639860541599, -0.15544434507804303, -0.19863950989383738, 0.0034602374265280864, 0.47679859803368646, -0.3216508851037361, -0.33213385230556014, 0.06402661851825542, -0.2295935959361183, -0.31501327626028797, 0.20945928115785742, -0.24208098129020073, 0.11957705679621237, 0.15022330460487865, 0.01880224372871453, -0.03960269302721523, -0.28828221859415254, 0.2627315015148876, 0.04931443861763304, 0.3778766256776483, 0.043182751168690935, 0.10809994283863489, -0.05160607276532877, -0.04341454822861124, -0.015228608359999877, -0.022712481969620057, 0.20221248704668446, 0.3814211766196725, 0.2319164202005292, 0.38134122610790655, -0.4671106742268118, -0.26875029457733035, 0.10319399950822117, 0.18875648716251212, 0.09205207172393177, -0.023911437006366516, -0.3364759046623173, 0.08147059851277542, -0.13529830344486982, 0.02559069109944782, -0.16200156999669466, 0.052133559037126055, -0.034668600221020064, -0.2116909416896912, 0.04513820975989802, 0.11998155348313351, 0.1322439757251838, -0.03801936180874085, -0.049468115457178406, 0.011430462938733399, 0.18783009175785992, 0.029112699662315816, 0.035790358000667766, 0.21041389682068257, -0.3096661545278039, -0.17452156118815765, 0.38400688600571203, 0.02367929609802862, -0.17314618438589, 0.24716168706072494, -0.02991115111944964, -0.2012317400512984, 0.10169875469000544, 0.23075475596548736, 0.04607502865352823, -0.14310984004653923, 0.007662767494669727, -0.00830287161807064, 0.20889120773790637, 0.050414566016115714, 0.047787984479024694, 0.24326782074543493, 0.28229775585471845, -0.009526857391468488, 0.10825180118627031, -0.08387423091213957, -0.06315507524413988, -0.13735410513860793, -0.04497832071441129, -0.19783325678630112, -0.0012271852040915594, -0.13032827789690296, -0.08694424127512927, 0.324034777074606, 0.2698313808905368, 0.19908835994040905, 0.11765356870212902, 0.35167379743264365, 0.027048505788116017, 0.17929656126216287, 0.06539077397610527, 0.2359723418679399, 0.05501196230034111, 0.15939692317139512, -0.19839022788316166, 0.1363872514302784, 0.030047924619187445] |
1,802.03391 | Uneven flows: On cosmic bulk flows, local observers, and gravity | Using N-body simulations we study the impact of various systematic effects on
the bulk flow (BF) and the Cosmic Mach Number (CMN). We consider two types of
systematics: those related to survey properties and those induced by observer's
location in the Universe. In the former category we model sparse sampling,
velocity errors, and survey incompleteness. In the latter, we consider Local
Group (LG) analogue observers, placed in a specific location within the Cosmic
Web, satisfying various observational criteria. We differentiate such LG
observers from Copernican ones, who are at random locations. We report strong
systematic effects on the measured BF and CMN induced by sparse sampling,
velocity errors and radial incompleteness. For BF most of these effects exceed
10\% for scales $R\leq100h^{-1}$Mpc. For CMN some of these systematics can be
catastrophically large ($>50\%$) also on bigger scales. Moreover, we find that
the position of the observer in the Cosmic Web significantly affects the
locally measured BF (CMN), with effects as large as $\sim20\%$ ($30\%)$ at
$R\leq50h^{-1}$Mpc for a LG-like observer as compared to a random one. This
effect is comparable to the sample variance. To highlight the importance of
these systematics, we additionally study a model of modified gravity (MG) with
$\sim15\%$ enhanced growth rate. We found that the systematic effects can mimic
the modified gravity signal. The worst-case scenario is realized for a case of
a LG-like observer, when the effects induced by local structures are degenerate
with the enhanced growth rate fostered by MG. Our results indicate that
dedicated constrained simulations and realistic mock galaxy catalogs will be
absolutely necessary to fully benefit from the statistical power of the
forthcoming peculiar velocity data from surveys such as TAIPAN, WALLABY, Cosmic
Flows-4 and SKA.
| astro-ph.CO | using nbody simulations we study the impact of various systematic effects on the bulk flow bf and the cosmic mach number cmn we consider two types of systematics those related to survey properties and those induced by observers location in the universe in the former category we model sparse sampling velocity errors and survey incompleteness in the latter we consider local group lg analogue observers placed in a specific location within the cosmic web satisfying various observational criteria we differentiate such lg observers from copernican ones who are at random locations we report strong systematic effects on the measured bf and cmn induced by sparse sampling velocity errors and radial incompleteness for bf most of these effects exceed 10 for scales rleq100h1mpc for cmn some of these systematics can be catastrophically large 50 also on bigger scales moreover we find that the position of the observer in the cosmic web significantly affects the locally measured bf cmn with effects as large as sim20 30 at rleq50h1mpc for a lglike observer as compared to a random one this effect is comparable to the sample variance to highlight the importance of these systematics we additionally study a model of modified gravity mg with sim15 enhanced growth rate we found that the systematic effects can mimic the modified gravity signal the worstcase scenario is realized for a case of a lglike observer when the effects induced by local structures are degenerate with the enhanced growth rate fostered by mg our results indicate that dedicated constrained simulations and realistic mock galaxy catalogs will be absolutely necessary to fully benefit from the statistical power of the forthcoming peculiar velocity data from surveys such as taipan wallaby cosmic flows4 and ska | [['using', 'nbody', 'simulations', 'we', 'study', 'the', 'impact', 'of', 'various', 'systematic', 'effects', 'on', 'the', 'bulk', 'flow', 'bf', 'and', 'the', 'cosmic', 'mach', 'number', 'cmn', 'we', 'consider', 'two', 'types', 'of', 'systematics', 'those', 'related', 'to', 'survey', 'properties', 'and', 'those', 'induced', 'by', 'observers', 'location', 'in', 'the', 'universe', 'in', 'the', 'former', 'category', 'we', 'model', 'sparse', 'sampling', 'velocity', 'errors', 'and', 'survey', 'incompleteness', 'in', 'the', 'latter', 'we', 'consider', 'local', 'group', 'lg', 'analogue', 'observers', 'placed', 'in', 'a', 'specific', 'location', 'within', 'the', 'cosmic', 'web', 'satisfying', 'various', 'observational', 'criteria', 'we', 'differentiate', 'such', 'lg', 'observers', 'from', 'copernican', 'ones', 'who', 'are', 'at', 'random', 'locations', 'we', 'report', 'strong', 'systematic', 'effects', 'on', 'the', 'measured', 'bf', 'and', 'cmn', 'induced', 'by', 'sparse', 'sampling', 'velocity', 'errors', 'and', 'radial', 'incompleteness', 'for', 'bf', 'most', 'of', 'these', 'effects', 'exceed', '10', 'for', 'scales', 'rleq100h1mpc', 'for', 'cmn', 'some', 'of', 'these', 'systematics', 'can', 'be', 'catastrophically', 'large', '50', 'also', 'on', 'bigger', 'scales', 'moreover', 'we', 'find', 'that', 'the', 'position', 'of', 'the', 'observer', 'in', 'the', 'cosmic', 'web', 'significantly', 'affects', 'the', 'locally', 'measured', 'bf', 'cmn', 'with', 'effects', 'as', 'large', 'as', 'sim20', '30', 'at', 'rleq50h1mpc', 'for', 'a', 'lglike', 'observer', 'as', 'compared', 'to', 'a', 'random', 'one', 'this', 'effect', 'is', 'comparable', 'to', 'the', 'sample', 'variance', 'to', 'highlight', 'the', 'importance', 'of', 'these', 'systematics', 'we', 'additionally', 'study', 'a', 'model', 'of', 'modified', 'gravity', 'mg', 'with', 'sim15', 'enhanced', 'growth', 'rate', 'we', 'found', 'that', 'the', 'systematic', 'effects', 'can', 'mimic', 'the', 'modified', 'gravity', 'signal', 'the', 'worstcase', 'scenario', 'is', 'realized', 'for', 'a', 'case', 'of', 'a', 'lglike', 'observer', 'when', 'the', 'effects', 'induced', 'by', 'local', 'structures', 'are', 'degenerate', 'with', 'the', 'enhanced', 'growth', 'rate', 'fostered', 'by', 'mg', 'our', 'results', 'indicate', 'that', 'dedicated', 'constrained', 'simulations', 'and', 'realistic', 'mock', 'galaxy', 'catalogs', 'will', 'be', 'absolutely', 'necessary', 'to', 'fully', 'benefit', 'from', 'the', 'statistical', 'power', 'of', 'the', 'forthcoming', 'peculiar', 'velocity', 'data', 'from', 'surveys', 'such', 'as', 'taipan', 'wallaby', 'cosmic', 'flows4', 'and', 'ska']] | [-0.0966016933675327, 0.119991238441992, -0.05629131365699548, 0.09678886024548064, -0.0871918021745861, -0.059078509968883815, 0.022197813959379437, 0.37264050813788113, -0.26374637163021264, -0.3435579252772773, 0.09124581658913826, -0.28999219594378, -0.07877457727503084, 0.21004256092058166, -0.05259217697786867, 0.006772242756048548, 0.0403993902513295, -0.02005775462330735, -0.045327248456068454, -0.27130123898172287, 0.29984026374163253, 0.1303035825827813, 0.2582231398974463, -0.02706165142449821, 0.058239166143908436, -0.03428228069526137, -0.08964809253547631, 0.09034657793066708, -0.15704127141612095, 0.04405724859329152, 0.2101288493268575, 0.1237863281986128, 0.24254803747270612, -0.39997291852251426, -0.21041290904890667, 0.11865313634514174, 0.11862665254140524, 0.12939001909367978, -0.0665393164934564, -0.3125846999695736, 0.09097366321977254, -0.16329814804179582, -0.127717234765622, -0.0015667834969779067, 0.003629853806940588, 0.04591173924718726, -0.24208295398353805, 0.12306899527582779, 0.01218630961334029, 0.0755465846270957, -0.05579810996675296, -0.11499475893326738, -0.018982569462494225, 0.09844920379062207, 0.023226345209768108, 0.036256445896256956, 0.1674167686422745, -0.11705283318061699, -0.07092199101177182, 0.413230445044419, -0.09417073957536184, -0.15688088030557656, 0.16519198142626185, -0.19080994750458932, -0.15444245727704706, 0.08291565967684096, 0.20014934552873068, 0.08498848059399595, -0.11187212343654035, 0.052315645387391266, 0.010945215837778986, 0.1575377339939752, 0.04392359137505372, 0.05165632839191, 0.23157071021339254, 0.10117367920895101, 0.06271971810397738, 0.08377759701965364, -0.15434436030860937, -0.027076741655733674, -0.3113819053285121, -0.09238439712488482, -0.1473859118368701, 0.059936223440169495, -0.12792194500968648, -0.11281583373402229, 0.34542858652962066, 0.17905267259913724, 0.1870824649470944, 0.052928352544368215, 0.2770985386099878, 0.03893540915166167, 0.07026839527208967, 0.07047916249766721, 0.275490085071416, 0.10426162866633926, 0.04896057503965043, -0.22075256700908225, 0.06546251311838786, 0.0005636162567117536] |
1,802.03392 | On domination perfect graphs | Let $\gamma(G)$ and $\beta(G)$ denote the domination number and the covering
number of a graph $G$, respectively. A connected non-trivial graph $G$ is said
to be $\gamma\beta$-{perfect} if $\gamma(H)=\beta(H)$ for every non-trivial
induced connected subgraph $H$ of $G$. In this note we present an elementary
proof of a characterization of the $\gamma\beta$-perfect graphs.
| math.CO | let gammag and betag denote the domination number and the covering number of a graph g respectively a connected nontrivial graph g is said to be gammabetaperfect if gammahbetah for every nontrivial induced connected subgraph h of g in this note we present an elementary proof of a characterization of the gammabetaperfect graphs | [['let', 'gammag', 'and', 'betag', 'denote', 'the', 'domination', 'number', 'and', 'the', 'covering', 'number', 'of', 'a', 'graph', 'g', 'respectively', 'a', 'connected', 'nontrivial', 'graph', 'g', 'is', 'said', 'to', 'be', 'gammabetaperfect', 'if', 'gammahbetah', 'for', 'every', 'nontrivial', 'induced', 'connected', 'subgraph', 'h', 'of', 'g', 'in', 'this', 'note', 'we', 'present', 'an', 'elementary', 'proof', 'of', 'a', 'characterization', 'of', 'the', 'gammabetaperfect', 'graphs']] | [-0.2708547164127231, 0.1797799483060953, -0.06630467675626278, -0.04854034693911671, -0.16194764307700096, -0.09198195417411625, 0.04582824775483459, 0.3423293380439281, -0.28626867473125456, -0.3339606925845146, 0.05327588908141479, -0.30172254391014575, -0.14049164738622494, 0.1419616489857435, -0.12155492568388582, -0.11943997845053672, 0.11910076243802906, 0.18367929104715586, 0.07160449225455523, -0.24087409621686676, 0.2760488358139992, -0.12363956669345498, 0.09773008747026324, 0.1357154106721282, 0.07301737028174102, 0.03367757609579712, -0.025863840086385606, 0.1502455901913345, -0.24484254756942392, 0.09460531605407596, 0.2712837250251323, 0.14614549323916434, 0.26145576683804395, -0.3487640391726745, -0.11549136187881232, 0.34709048407152293, 0.11298125641420484, -0.08715964905917645, 0.023652762966230513, -0.2180507306009531, 0.1757995200995356, -0.15751173302531243, -0.07369504351168871, 0.02965695021674037, 0.16517172649502754, -0.03238927001133561, -0.29310843729414043, -0.0689766586245969, 0.1133800921589136, 0.05078274269588292, 0.14735741232521832, -0.12577174115926026, -0.09384368567727507, 0.05786371965892613, -0.11061327593866736, 0.10814235630445182, -0.011329369825543835, -0.11841236169915646, -0.1377337746694684, 0.38499117029830815, -0.05759476838633418, -0.08875072784721852, 0.061994945155456664, -0.13935226453468202, -0.1905990244448185, 0.11352908052504063, 0.13061697694472968, 0.1968261956470087, -0.04863589596003294, 0.192369906201493, -0.15316805493086577, 0.11650882781483234, 0.08857587495818735, -0.0015978409163653852, 0.11461121506989003, 0.15989327881485224, 0.20283788945525885, 0.20035957200219856, 0.07991788476705551, 0.18790088295936586, -0.3927670016884804, -0.1237109623849392, -0.29608510825783013, 0.16053993994370103, -0.1805278529872885, -0.23123421078547834, 0.4686251572519541, 0.06526575392112136, 0.15312920207157732, 0.12014628648757934, 0.1805795044079423, 0.0711992403306067, -0.0030576468631625174, 0.219473236175254, 0.03647789753042161, 0.3179749484360218, -0.14304495085030794, -0.17783232838846744, 0.019618438053876162, 0.1882319951057434] |
1,802.03393 | A Study of WhatsApp Usage Patterns and Prediction Models without Message
Content | Internet social networks have become a ubiquitous application allowing people
to easily share text, pictures, and audio and video files. Popular networks
include WhatsApp, Facebook, Reddit and LinkedIn. We present an extensive study
of the usage of the WhatsApp social network, an Internet messaging application
that is quickly replacing SMS messaging. In order to better understand people's
use of the network, we provide an analysis of over 6 million messages from over
100 users, with the objective of building demographic prediction models using
activity data. We performed extensive statistical and numerical analysis of the
data and found significant differences in WhatsApp usage across people of
different genders and ages. We also inputted the data into the Weka data mining
package and studied models created from decision tree and Bayesian network
algorithms. We found that different genders and age demographics had
significantly different usage habits in almost all message and group
attributes. We also noted differences in users' group behavior and created
prediction models, including the likelihood a given group would have relatively
more file attachments, if a group would contain a larger number of
participants, a higher frequency of activity, quicker response times and
shorter messages. We were successful in quantifying and predicting a user's
gender and age demographic. Similarly, we were able to predict different types
of group usage. All models were built without analyzing message content. We
present a detailed discussion about the specific attributes that were contained
in all predictive models and suggest possible applications based on these
results.
| cs.CY cs.SI | internet social networks have become a ubiquitous application allowing people to easily share text pictures and audio and video files popular networks include whatsapp facebook reddit and linkedin we present an extensive study of the usage of the whatsapp social network an internet messaging application that is quickly replacing sms messaging in order to better understand peoples use of the network we provide an analysis of over 6 million messages from over 100 users with the objective of building demographic prediction models using activity data we performed extensive statistical and numerical analysis of the data and found significant differences in whatsapp usage across people of different genders and ages we also inputted the data into the weka data mining package and studied models created from decision tree and bayesian network algorithms we found that different genders and age demographics had significantly different usage habits in almost all message and group attributes we also noted differences in users group behavior and created prediction models including the likelihood a given group would have relatively more file attachments if a group would contain a larger number of participants a higher frequency of activity quicker response times and shorter messages we were successful in quantifying and predicting a users gender and age demographic similarly we were able to predict different types of group usage all models were built without analyzing message content we present a detailed discussion about the specific attributes that were contained in all predictive models and suggest possible applications based on these results | [['internet', 'social', 'networks', 'have', 'become', 'a', 'ubiquitous', 'application', 'allowing', 'people', 'to', 'easily', 'share', 'text', 'pictures', 'and', 'audio', 'and', 'video', 'files', 'popular', 'networks', 'include', 'whatsapp', 'facebook', 'reddit', 'and', 'linkedin', 'we', 'present', 'an', 'extensive', 'study', 'of', 'the', 'usage', 'of', 'the', 'whatsapp', 'social', 'network', 'an', 'internet', 'messaging', 'application', 'that', 'is', 'quickly', 'replacing', 'sms', 'messaging', 'in', 'order', 'to', 'better', 'understand', 'peoples', 'use', 'of', 'the', 'network', 'we', 'provide', 'an', 'analysis', 'of', 'over', '6', 'million', 'messages', 'from', 'over', '100', 'users', 'with', 'the', 'objective', 'of', 'building', 'demographic', 'prediction', 'models', 'using', 'activity', 'data', 'we', 'performed', 'extensive', 'statistical', 'and', 'numerical', 'analysis', 'of', 'the', 'data', 'and', 'found', 'significant', 'differences', 'in', 'whatsapp', 'usage', 'across', 'people', 'of', 'different', 'genders', 'and', 'ages', 'we', 'also', 'inputted', 'the', 'data', 'into', 'the', 'weka', 'data', 'mining', 'package', 'and', 'studied', 'models', 'created', 'from', 'decision', 'tree', 'and', 'bayesian', 'network', 'algorithms', 'we', 'found', 'that', 'different', 'genders', 'and', 'age', 'demographics', 'had', 'significantly', 'different', 'usage', 'habits', 'in', 'almost', 'all', 'message', 'and', 'group', 'attributes', 'we', 'also', 'noted', 'differences', 'in', 'users', 'group', 'behavior', 'and', 'created', 'prediction', 'models', 'including', 'the', 'likelihood', 'a', 'given', 'group', 'would', 'have', 'relatively', 'more', 'file', 'attachments', 'if', 'a', 'group', 'would', 'contain', 'a', 'larger', 'number', 'of', 'participants', 'a', 'higher', 'frequency', 'of', 'activity', 'quicker', 'response', 'times', 'and', 'shorter', 'messages', 'we', 'were', 'successful', 'in', 'quantifying', 'and', 'predicting', 'a', 'users', 'gender', 'and', 'age', 'demographic', 'similarly', 'we', 'were', 'able', 'to', 'predict', 'different', 'types', 'of', 'group', 'usage', 'all', 'models', 'were', 'built', 'without', 'analyzing', 'message', 'content', 'we', 'present', 'a', 'detailed', 'discussion', 'about', 'the', 'specific', 'attributes', 'that', 'were', 'contained', 'in', 'all', 'predictive', 'models', 'and', 'suggest', 'possible', 'applications', 'based', 'on', 'these', 'results']] | [-0.09898255878388659, 0.033555972253308274, -0.08227473937366749, 0.11576809838186905, -0.13016522692198615, -0.16216674935819198, 0.09591435974035116, 0.454155555689737, -0.2103281895249402, -0.37299195246859673, 0.098091704709308, -0.3552527488024521, -0.16061192079417644, 0.19177754501449978, -0.08171183897444742, -0.0019409386367197075, 0.08619910653076313, 0.09086256497366343, -0.01881533578183273, -0.3206418666204194, 0.2726958490333461, 0.04266401755970917, 0.32107661547146676, 0.026477722148041404, 0.04956597400855066, 0.006973722276078271, -0.12881779453776304, -0.015091513077976064, -0.09746637505509531, 0.12735320855715562, 0.33280419570992165, 0.24016018460379057, 0.3100948679641569, -0.4548730399914175, -0.20551129570230842, 0.09715171758314624, 0.15506757131781398, 0.08723493865025896, -0.06787400065519568, -0.3414136860445733, 0.10776531092969457, -0.2462965033806136, -0.021604239597864863, -0.07361745661159697, 0.01936514478635102, 0.019908035663233715, -0.21481057373614657, 0.03593541311616603, -0.03666012502764629, 0.15602048503101937, -0.036791865307364675, -0.12213101918441391, -0.030135883238732016, 0.2496304104644214, 0.09632114082815528, -0.04321836373521133, 0.16812928974820626, -0.13668786995445512, -0.13425410087479073, 0.3750400557413712, -0.03360293245558361, -0.11064597428221964, 0.2135372209918892, -0.059375971757126826, -0.15557613801617648, 0.06806841529794924, 0.2645553907366573, 0.06816917519632076, -0.18413771986952127, -0.04979522964923591, -0.044667450150304905, 0.22898834239366272, 0.07415232064187645, 0.004182596387441403, 0.16446478059515357, 0.19102865758366763, -0.013014131992508376, 0.07340430989510395, -0.05954913048137516, -0.07356939167601965, -0.1736911901814257, -0.13304576465106083, -0.10983067627170212, 0.016671374094642935, -0.14715104950098773, -0.11119161497585342, 0.4289689216104942, 0.2112276362272424, 0.1504232188398462, 0.07927743713674043, 0.2743502381204125, -0.02399558178518736, 0.12359286945531263, 0.13121204558826452, 0.092456210102509, 0.011350601808064513, 0.1604710124859897, -0.10443493411072441, 0.12760228039105498, -0.03918881194678963] |
1,802.03394 | Mimetic gravity as DHOST theories | We show that theories of mimetic gravity can be viewed as degenerate
higher-order scalar-tensor (DHOST) theories that admit an extra local (gauge)
symmetry in addition to the usual diffeomorphism invariance. We reformulate and
classify mimetic theories in this perspective. Using the effective theory of
dark energy, recently extended to include DHOST theories, we then investigate
the linear perturbations about a homogeneous and isotropic background for all
mimetic theories. We also include matter, in the form of a $k$-essence scalar
field, and we derive the quadratic action for linear perturbations in this
case.
| gr-qc astro-ph.CO hep-th | we show that theories of mimetic gravity can be viewed as degenerate higherorder scalartensor dhost theories that admit an extra local gauge symmetry in addition to the usual diffeomorphism invariance we reformulate and classify mimetic theories in this perspective using the effective theory of dark energy recently extended to include dhost theories we then investigate the linear perturbations about a homogeneous and isotropic background for all mimetic theories we also include matter in the form of a kessence scalar field and we derive the quadratic action for linear perturbations in this case | [['we', 'show', 'that', 'theories', 'of', 'mimetic', 'gravity', 'can', 'be', 'viewed', 'as', 'degenerate', 'higherorder', 'scalartensor', 'dhost', 'theories', 'that', 'admit', 'an', 'extra', 'local', 'gauge', 'symmetry', 'in', 'addition', 'to', 'the', 'usual', 'diffeomorphism', 'invariance', 'we', 'reformulate', 'and', 'classify', 'mimetic', 'theories', 'in', 'this', 'perspective', 'using', 'the', 'effective', 'theory', 'of', 'dark', 'energy', 'recently', 'extended', 'to', 'include', 'dhost', 'theories', 'we', 'then', 'investigate', 'the', 'linear', 'perturbations', 'about', 'a', 'homogeneous', 'and', 'isotropic', 'background', 'for', 'all', 'mimetic', 'theories', 'we', 'also', 'include', 'matter', 'in', 'the', 'form', 'of', 'a', 'kessence', 'scalar', 'field', 'and', 'we', 'derive', 'the', 'quadratic', 'action', 'for', 'linear', 'perturbations', 'in', 'this', 'case']] | [-0.14704642433966714, 0.13702117667027935, -0.11811099328485358, 0.1551896026636393, -0.12112365190810322, -0.1545899359954764, -0.10501620915095808, 0.2826938827866283, -0.2405025549207652, -0.27673703129403293, 0.032505496999795505, -0.21640987945315632, -0.2015612658072749, 0.07256852330022451, -0.059056432720314224, -0.017151324879428696, -0.09334363491001094, 0.07216374993162311, -0.1071713947356962, -0.27610932251074066, 0.3612679358642629, 0.02757685735275078, 0.19682958127384115, 0.0006474234725591605, 0.10620053195516052, -0.012521483239454581, -0.0032323993762712116, 0.09160588131002757, -0.14540097665161264, 0.08105303404812256, 0.23032888365022422, 0.10396005269949851, 0.19318585865371657, -0.45887722868634306, -0.33306911681859713, 0.14660753113339128, 0.11543066751049913, 0.18795089399614168, -0.061967935177760766, -0.27966214574458403, 0.07571583264127738, -0.2072375236742158, -0.17383824317822355, -0.13921775352766574, -0.04756297047994019, -0.062042524673692555, -0.25407858294657554, 0.11522093067849157, 0.054824419299383524, 0.029270480599497325, -0.1291053764441091, -0.03914110657111134, -0.021004679288877094, -0.00013849315861159045, 0.11083755639138752, -0.006822466232773402, 0.0966291369467913, -0.16429890877486247, -0.10267654256819261, 0.4463715563811686, -0.20399065462507956, -0.26587043990350695, 0.1601582971583728, -0.0971532932928075, -0.215858579911899, 0.017615696906274105, 0.16822858029247625, 0.17177616133678542, -0.12463691206041562, 0.23917096240620594, -0.02892465543244844, 0.12750512758097815, 0.10514019181668434, 0.06652923912295829, 0.26229376621220424, 0.03620307305169737, 0.06387660152319333, 0.13772814856249327, 0.03276881419689111, -0.11883924609940985, -0.41750972993347957, -0.17504414535284488, -0.05688836215615637, 0.06486657348527249, -0.10761749772206278, -0.16811875203806584, 0.3727289130784693, 0.1479887440395744, 0.0810897749312141, 0.08786730181790241, 0.1996543576799171, 0.11947246933350866, 0.08239423907260694, 0.03871568096624485, 0.2978207044829817, 0.17607087914265043, 0.040410405376662864, -0.2123632061285088, -0.16444949925694938, 0.11573512440182916] |
1,802.03395 | Bootstrap validation of links of a minimum spanning tree | We describe two different bootstrap methods applied to the detection of a
minimum spanning tree obtained from a set of multivariate variables. We show
that two different bootstrap procedures provide partly distinct information
that can be highly informative about the investigated complex system. Our case
study, based on the investigation of daily returns of a portfolio of stocks
traded in the US equity markets, shows the degree of robustness and
completeness of the information extracted with popular information filtering
methods such as the minimum spanning tree and the planar maximally filtered
graph. The first method performs a "row bootstrap" whereas the second method
performs a "pair bootstrap". We show that the parallel use of the two methods
is suggested especially for complex systems presenting both a nested
hierarchical organization together with the presence of global feedback
channels.
| stat.ME | we describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables we show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system our case study based on the investigation of daily returns of a portfolio of stocks traded in the us equity markets shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph the first method performs a row bootstrap whereas the second method performs a pair bootstrap we show that the parallel use of the two methods is suggested especially for complex systems presenting both a nested hierarchical organization together with the presence of global feedback channels | [['we', 'describe', 'two', 'different', 'bootstrap', 'methods', 'applied', 'to', 'the', 'detection', 'of', 'a', 'minimum', 'spanning', 'tree', 'obtained', 'from', 'a', 'set', 'of', 'multivariate', 'variables', 'we', 'show', 'that', 'two', 'different', 'bootstrap', 'procedures', 'provide', 'partly', 'distinct', 'information', 'that', 'can', 'be', 'highly', 'informative', 'about', 'the', 'investigated', 'complex', 'system', 'our', 'case', 'study', 'based', 'on', 'the', 'investigation', 'of', 'daily', 'returns', 'of', 'a', 'portfolio', 'of', 'stocks', 'traded', 'in', 'the', 'us', 'equity', 'markets', 'shows', 'the', 'degree', 'of', 'robustness', 'and', 'completeness', 'of', 'the', 'information', 'extracted', 'with', 'popular', 'information', 'filtering', 'methods', 'such', 'as', 'the', 'minimum', 'spanning', 'tree', 'and', 'the', 'planar', 'maximally', 'filtered', 'graph', 'the', 'first', 'method', 'performs', 'a', 'row', 'bootstrap', 'whereas', 'the', 'second', 'method', 'performs', 'a', 'pair', 'bootstrap', 'we', 'show', 'that', 'the', 'parallel', 'use', 'of', 'the', 'two', 'methods', 'is', 'suggested', 'especially', 'for', 'complex', 'systems', 'presenting', 'both', 'a', 'nested', 'hierarchical', 'organization', 'together', 'with', 'the', 'presence', 'of', 'global', 'feedback', 'channels']] | [-0.09458953945686782, 0.037340800264292824, -0.10509601108947375, 0.11161504498679517, -0.05829375351772365, -0.1284979865376423, 0.0709688802127366, 0.3930440669383065, -0.25171452680140405, -0.29160618002698113, 0.1493935602178362, -0.27295247682227486, -0.1744579392872805, 0.19081821495218435, -0.04262885112097881, 0.03630362660879011, 0.10431652205459176, 0.03519811831524317, -0.04506120834683143, -0.2840967293479055, 0.3078501829027749, 0.01595420303353428, 0.32191427349772334, -0.012423002817090193, 0.13582697142948852, 0.06127820302473966, -0.10408658121991222, 0.06113968733919064, -0.089027729731707, 0.18342992437010916, 0.24342936615248884, 0.16993902686534682, 0.29869888090005103, -0.39322403441761095, -0.18764137238073741, 0.09767043457305344, 0.10159870587207757, 0.09167984783153192, 0.002634154868067453, -0.2429473802199193, 0.07444670231652575, -0.17051450840809745, -0.08310210273493197, -0.09452809690477422, -0.05138938344444019, 0.0049599742864448295, -0.30535786097910067, 0.06246304719872011, 0.050692078405498345, 0.05018863080402523, 0.007457587485589142, -0.147046250001405, -0.050368748506680674, 0.1357583641312527, 0.02210461070427984, -0.022855458499856946, 0.11218769163790628, -0.10382528621091569, -0.193563990376509, 0.3281958775567639, -0.0542743236462103, -0.17024052412296733, 0.1849631162268538, -0.11947421193544339, -0.175305151667813, 0.10027288200238543, 0.18109128141544595, 0.1230605092276921, -0.1754514461274456, 0.012754232666020139, -0.06110208346610413, 0.17893651009700431, 0.0631081340409625, -0.014192913934234937, 0.17779399998431658, 0.20283754276669155, 0.1011588291951666, 0.16678160756365837, -0.10870411001140741, -0.10688944377793666, -0.25261051593820844, -0.11544173424443176, -0.17868995233133, -0.021939142586758536, -0.17352118999438096, -0.2100540351591678, 0.4362101790896297, 0.18878926079801833, 0.18163606273112343, 0.07822432009550831, 0.2773941897440457, 0.08723523048269749, 0.0488405387753444, 0.09855814488523089, 0.16310470050921405, 0.09342609561961077, 0.06872419738312707, -0.17187317739853492, 0.07597463703238452, 0.056037992646876915] |
1,802.03396 | Predicting Customer Churn: Extreme Gradient Boosting with Temporal Data | Accurately predicting customer churn using large scale time-series data is a
common problem facing many business domains. The creation of model features
across various time windows for training and testing can be particularly
challenging due to temporal issues common to time-series data. In this paper,
we will explore the application of extreme gradient boosting (XGBoost) on a
customer dataset with a wide-variety of temporal features in order to create a
highly-accurate customer churn model. In particular, we describe an effective
method for handling temporally sensitive feature engineering. The proposed
model was submitted in the WSDM Cup 2018 Churn Challenge and achieved
first-place out of 575 teams.
| stat.ML cs.AI cs.LG | accurately predicting customer churn using large scale timeseries data is a common problem facing many business domains the creation of model features across various time windows for training and testing can be particularly challenging due to temporal issues common to timeseries data in this paper we will explore the application of extreme gradient boosting xgboost on a customer dataset with a widevariety of temporal features in order to create a highlyaccurate customer churn model in particular we describe an effective method for handling temporally sensitive feature engineering the proposed model was submitted in the wsdm cup 2018 churn challenge and achieved firstplace out of 575 teams | [['accurately', 'predicting', 'customer', 'churn', 'using', 'large', 'scale', 'timeseries', 'data', 'is', 'a', 'common', 'problem', 'facing', 'many', 'business', 'domains', 'the', 'creation', 'of', 'model', 'features', 'across', 'various', 'time', 'windows', 'for', 'training', 'and', 'testing', 'can', 'be', 'particularly', 'challenging', 'due', 'to', 'temporal', 'issues', 'common', 'to', 'timeseries', 'data', 'in', 'this', 'paper', 'we', 'will', 'explore', 'the', 'application', 'of', 'extreme', 'gradient', 'boosting', 'xgboost', 'on', 'a', 'customer', 'dataset', 'with', 'a', 'widevariety', 'of', 'temporal', 'features', 'in', 'order', 'to', 'create', 'a', 'highlyaccurate', 'customer', 'churn', 'model', 'in', 'particular', 'we', 'describe', 'an', 'effective', 'method', 'for', 'handling', 'temporally', 'sensitive', 'feature', 'engineering', 'the', 'proposed', 'model', 'was', 'submitted', 'in', 'the', 'wsdm', 'cup', '2018', 'churn', 'challenge', 'and', 'achieved', 'firstplace', 'out', 'of', '575', 'teams']] | [-0.07121024679124602, 0.03689745344775663, -0.052538578714823946, 0.07861822619946357, -0.10038213960756108, -0.16679139125362952, 0.06206330171904861, 0.42490228005456476, -0.2630778064968873, -0.3554303006989495, 0.12394867778562431, -0.2964856038968307, -0.12105654198500626, 0.16748093005559705, -0.13776157516107526, 0.107097959629137, 0.12536138531593782, 0.012675312527824403, 0.029082832392305136, -0.28434934764485453, 0.28749974520507987, 0.06203158221752295, 0.3567693538629924, 0.05429500993945249, 0.09160269509104765, -0.027737252392261377, -0.08120467553336946, -0.00913706715086932, -0.032695950511930826, 0.14204311392251906, 0.3566996331550708, 0.1799058905222787, 0.35453280822356353, -0.40084990555033934, -0.19376599859173918, 0.09920773877902835, 0.09378376574352172, 0.08939335341038147, -0.005275374657874224, -0.3194321718348085, 0.07518989641553248, -0.19941351043482153, -0.08324798971127921, -0.13520694744579917, 0.042675593657032496, -0.016050021524347785, -0.3228090228952186, 0.021892753867641144, 0.015812663132992556, 0.07131555309202874, -0.04603387939058385, -0.05255875175484931, 0.04796602335903477, 0.18470512177654594, 0.06980489710025173, 0.024394013752001075, 0.1045414886639436, -0.16460162963287658, -0.1241355506343029, 0.4276447294033923, -0.07378204624313545, -0.11826004679226931, 0.17898728119710214, -0.04317591668827073, -0.18329290994706582, 0.05482568254887636, 0.28830450449912054, 0.11971584864110106, -0.20474673293636375, -0.0002337284001767776, 0.012034505113678158, 0.18214591734884483, 0.049459120889088874, -0.06285619727700492, 0.2003137176913508, 0.2840035193806233, 0.045007175282149064, 0.10911534406697238, -0.12804584973491728, -0.0696820152818032, -0.20734593580599944, -0.09700299569467118, -0.13626800713410495, -0.024950640576997033, -0.09106481841404017, -0.16496517382263434, 0.4337333267870939, 0.2433556855440948, 0.2003195532685462, 0.03263879334087317, 0.2849766584816125, 0.04429917466246857, 0.086488265104873, 0.08593020255607113, 0.1355499976253102, -0.039161970294168534, 0.19087299211214315, -0.16440235491719027, 0.1232240066648338, -0.004758133447535758] |
1,802.03397 | Network organization of coopetitive genetic influences on cortical
morphologies | Brain can be represented as a network, where regions are the nodes and
relations between the regions are edges. Within a network, co-existence of
cooperative and competitive relationships between different nodes is called
coopetition. Inter-regional genetic influences on morphological phenotypes
(cortical thickness, surface area) of cortex display such coopetitive
relationships. Here, we have represented these genetic influences as a network
and shown that cooperative and competitive genetic influences on cortical
morphological phenotypes follow distinct organization principles. Utilizing the
theory of structural balance, we have shown that the pattern of collective
regulation of cortical morphological phenotypes by cooperative and competitive
genetic influences are overall bilaterally symmetric and such patterns of
collective genetic regulation are similar to the principal modes of population
variation of cortical morphological phenotypes. Finally, we have observed that
the maximally and minimally imbalanced regions corresponding to the collective
genetic regulation partially overlap with the cortical structural network hubs.
| q-bio.NC | brain can be represented as a network where regions are the nodes and relations between the regions are edges within a network coexistence of cooperative and competitive relationships between different nodes is called coopetition interregional genetic influences on morphological phenotypes cortical thickness surface area of cortex display such coopetitive relationships here we have represented these genetic influences as a network and shown that cooperative and competitive genetic influences on cortical morphological phenotypes follow distinct organization principles utilizing the theory of structural balance we have shown that the pattern of collective regulation of cortical morphological phenotypes by cooperative and competitive genetic influences are overall bilaterally symmetric and such patterns of collective genetic regulation are similar to the principal modes of population variation of cortical morphological phenotypes finally we have observed that the maximally and minimally imbalanced regions corresponding to the collective genetic regulation partially overlap with the cortical structural network hubs | [['brain', 'can', 'be', 'represented', 'as', 'a', 'network', 'where', 'regions', 'are', 'the', 'nodes', 'and', 'relations', 'between', 'the', 'regions', 'are', 'edges', 'within', 'a', 'network', 'coexistence', 'of', 'cooperative', 'and', 'competitive', 'relationships', 'between', 'different', 'nodes', 'is', 'called', 'coopetition', 'interregional', 'genetic', 'influences', 'on', 'morphological', 'phenotypes', 'cortical', 'thickness', 'surface', 'area', 'of', 'cortex', 'display', 'such', 'coopetitive', 'relationships', 'here', 'we', 'have', 'represented', 'these', 'genetic', 'influences', 'as', 'a', 'network', 'and', 'shown', 'that', 'cooperative', 'and', 'competitive', 'genetic', 'influences', 'on', 'cortical', 'morphological', 'phenotypes', 'follow', 'distinct', 'organization', 'principles', 'utilizing', 'the', 'theory', 'of', 'structural', 'balance', 'we', 'have', 'shown', 'that', 'the', 'pattern', 'of', 'collective', 'regulation', 'of', 'cortical', 'morphological', 'phenotypes', 'by', 'cooperative', 'and', 'competitive', 'genetic', 'influences', 'are', 'overall', 'bilaterally', 'symmetric', 'and', 'such', 'patterns', 'of', 'collective', 'genetic', 'regulation', 'are', 'similar', 'to', 'the', 'principal', 'modes', 'of', 'population', 'variation', 'of', 'cortical', 'morphological', 'phenotypes', 'finally', 'we', 'have', 'observed', 'that', 'the', 'maximally', 'and', 'minimally', 'imbalanced', 'regions', 'corresponding', 'to', 'the', 'collective', 'genetic', 'regulation', 'partially', 'overlap', 'with', 'the', 'cortical', 'structural', 'network', 'hubs']] | [-0.12243503602376829, 0.14440558443078771, -0.02511300747593244, 0.09016201882700746, -0.0796633260945479, -0.13287172390458485, 0.07120822392636911, 0.4457650580878059, -0.2891238357006417, -0.27134136591106656, -0.00028125192038714887, -0.26663312619241575, -0.36045846294146033, 0.07908041787644228, -0.07613363881061863, -0.03504815290526797, 0.0363769028801471, -0.008304354281475147, 0.06172269786242396, -0.17797347114110987, 0.2951054296797762, 0.046813747168829044, 0.3469503000099212, -0.018067804075156648, 0.10780503985161582, -0.10434418126009405, -0.048241427571823196, 0.07127428869406383, -0.08306758925236257, 0.1653747319492201, 0.3376533620571718, 0.21928343296671907, 0.278734925352037, -0.50060118380934, -0.24058299674031636, 0.1125201309286058, 0.17339727473445238, 0.07934540404938162, 0.017506474397766092, -0.2815394172196587, 0.09137733637432878, -0.12217756452659766, 0.00623238678711156, -0.08229841489965717, 0.007229103184848403, 0.10045488663949072, -0.22767972017483165, 0.1639874734232823, 0.007546137763808171, 0.16149541245773436, -0.08145853620643417, -0.10930879736474405, -0.11457390678736071, 0.2286307323879252, 0.036608562352291, -0.015103121486802895, 0.23948308407018581, -0.13160996438624958, -0.1372501370124519, 0.2862139020425578, 0.06515050812119928, -0.2170498333266005, 0.265687874428307, -0.09822223986499011, -0.14466244871883344, 0.05543448634445667, 0.20933706553652884, 0.022835545986890794, -0.18594379177937906, -0.028917269917437805, -0.035067301436016954, 0.21423858317468936, 0.09241518214500198, 0.0462988061675181, 0.19123301178139324, 0.21493545317091048, 0.0616476191378509, 0.1218886389886029, -0.09264283490367234, -0.14792922345300516, -0.17372034654331703, -0.06573767092855026, -0.10185897568861643, -0.027115668261346097, -0.17538043485576055, -0.1714293720398564, 0.46545043191562097, 0.024325169414902727, 0.19651697864600767, 0.06509238248380522, 0.18510895272678074, 0.0004565863450989127, 0.13643638899549843, 0.027390935371319453, 0.19706926975399255, 0.09482654074362169, 0.05133500558246548, -0.31263151871971784, 0.20415714938814442, -0.0016203311582406361] |
1,802.03398 | Precision determination of the strong coupling constant within a global
PDF analysis | We present a determination of the strong coupling constant $\alpha_s(m_Z)$
based on the NNPDF3.1 determination of parton distributions, which for the
first time includes constraints from jet production, top-quark pair
differential distributions, and the $Z$ $p_T$ distributions using exact NNLO
theory. Our result is based on a novel extension of the NNPDF methodology - the
correlated replica method - which allows for a simultaneous determination of
$\alpha_s$ and the PDFs with all correlations between them fully taken into
account. We study in detail all relevant sources of experimental,
methodological and theoretical uncertainty. At NNLO we find $\alpha_s(m_Z) =
0.1185 \pm 0.0005^\text{(exp)}\pm 0.0001^\text{(meth)}$, showing that
methodological uncertainties are negligible. We conservatively estimate the
theoretical uncertainty due to missing higher order QCD corrections (N$^3$LO
and beyond) from half the shift between the NLO and NNLO $\alpha_s$ values,
finding $\Delta\alpha^{\rm th}_s =0.0011$.
| hep-ph hep-ex | we present a determination of the strong coupling constant alpha_sm_z based on the nnpdf31 determination of parton distributions which for the first time includes constraints from jet production topquark pair differential distributions and the z p_t distributions using exact nnlo theory our result is based on a novel extension of the nnpdf methodology the correlated replica method which allows for a simultaneous determination of alpha_s and the pdfs with all correlations between them fully taken into account we study in detail all relevant sources of experimental methodological and theoretical uncertainty at nnlo we find alpha_sm_z 01185 pm 00005textexppm 00001textmeth showing that methodological uncertainties are negligible we conservatively estimate the theoretical uncertainty due to missing higher order qcd corrections n3lo and beyond from half the shift between the nlo and nnlo alpha_s values finding deltaalpharm th_s 00011 | [['we', 'present', 'a', 'determination', 'of', 'the', 'strong', 'coupling', 'constant', 'alpha_sm_z', 'based', 'on', 'the', 'nnpdf31', 'determination', 'of', 'parton', 'distributions', 'which', 'for', 'the', 'first', 'time', 'includes', 'constraints', 'from', 'jet', 'production', 'topquark', 'pair', 'differential', 'distributions', 'and', 'the', 'z', 'p_t', 'distributions', 'using', 'exact', 'nnlo', 'theory', 'our', 'result', 'is', 'based', 'on', 'a', 'novel', 'extension', 'of', 'the', 'nnpdf', 'methodology', 'the', 'correlated', 'replica', 'method', 'which', 'allows', 'for', 'a', 'simultaneous', 'determination', 'of', 'alpha_s', 'and', 'the', 'pdfs', 'with', 'all', 'correlations', 'between', 'them', 'fully', 'taken', 'into', 'account', 'we', 'study', 'in', 'detail', 'all', 'relevant', 'sources', 'of', 'experimental', 'methodological', 'and', 'theoretical', 'uncertainty', 'at', 'nnlo', 'we', 'find', 'alpha_sm_z', '01185', 'pm', '00005textexppm', '00001textmeth', 'showing', 'that', 'methodological', 'uncertainties', 'are', 'negligible', 'we', 'conservatively', 'estimate', 'the', 'theoretical', 'uncertainty', 'due', 'to', 'missing', 'higher', 'order', 'qcd', 'corrections', 'n3lo', 'and', 'beyond', 'from', 'half', 'the', 'shift', 'between', 'the', 'nlo', 'and', 'nnlo', 'alpha_s', 'values', 'finding', 'deltaalpharm', 'th_s', '00011']] | [-0.061824358666358006, 0.09028201224282384, -0.12784869335662347, 0.11674259641828637, -0.06824766879964789, -0.05510616964646474, 0.08249274237173129, 0.37582011002990784, -0.17509763367530523, -0.291947781319984, 0.010535352993015707, -0.3349247240395484, 0.027166137847058108, 0.14227223880659562, 0.060221985146530314, 0.13342920995141452, 0.07967871265965655, -0.08538759712510827, -0.09856844541024078, -0.1970575401774664, 0.3145380865881276, 0.04725511856800453, 0.22306216901845552, 0.17182596155202412, 0.0986423487691244, 0.05829657361645139, -0.13355384793293057, -0.045882155441425064, -0.19779273967998795, 0.12930074540517209, 0.22894006095311575, 0.03727266163156001, 0.19536419894024165, -0.3155690294224769, -0.09817453129852022, 0.05188684895719317, 0.1130122555186972, 0.15463953471573239, -0.009097795215590546, -0.28885804107553803, 0.07005849662660198, -0.2565716484272288, -0.08956431577715909, -0.12204836061309007, -0.015299814894343868, -0.0216840275397496, -0.34497712128866237, 0.11852507230430616, -0.03648599669373432, 0.021274676301276708, -0.0017465034814614971, -0.2289872455858682, -0.054831194827177875, 0.10325215736785057, 0.1273307448555539, 0.08639808251190874, 0.09280787110081733, -0.1309538249448506, -0.15524598272873624, 0.4013278290953939, -0.058681036611122894, -0.13998012757634348, 0.044007722679948943, -0.21301822550594807, -0.20659596507550415, 0.1272741017517436, 0.2234597154328543, 0.09905594256071543, -0.18271595010336375, 0.1041220314214253, 0.04234694022064408, 0.2178544147261136, 0.004903165119079252, 0.04120042814456886, 0.1549277335412405, 0.15605900368554462, -0.00033433564275390273, 0.03616961675244525, -0.08218163935750701, -0.12425710294734348, -0.45316368129781703, -0.037690302486721936, -0.08525542523641365, 0.03791692238794922, -0.1586950637436971, -0.1285941271410345, 0.37283658225329197, 0.2126698053828229, 0.2454602160265274, 0.09948500620808001, 0.3562207764691927, 0.13403567311329287, 0.04487407017520375, 0.057911303246411, 0.29356536337626027, 0.17244081496204616, 0.06451704908359909, -0.2169980171108336, 0.09087610354463597, 0.06606178133480364] |
1,802.03399 | DarkSUSY 6 : An Advanced Tool to Compute Dark Matter Properties
Numerically | The nature of dark matter remains one of the key science questions. Weakly
Interacting Massive Particles (WIMPs) are among the best motivated particle
physics candidates, allowing to explain the measured dark matter density by
employing standard big-bang thermodynamics. We introduce here a radically new
version of the widely used DarkSUSY package, which allows to compute the
properties of such dark matter particles numerically. With DarkSUSY 6 one can
accurately predict a large variety of astrophysical signals from dark matter,
such as direct detection rates in low-background counting experiments and
indirect detection signals through antiprotons, antideuterons, gamma rays and
positrons from the Galactic halo, or high-energy neutrinos from the center of
the Earth or of the Sun. For thermally produced dark matter like WIMPs,
high-precision tools are provided for the computation of the relic density in
the Universe today, as well as for the size of the smallest dark matter
protohalos. Furthermore, the code allows to calculate dark matter
self-interaction rates, which may affect the distribution of dark matter at
small cosmological scales. Compared to earlier versions, DarkSUSY 6 introduces
many significant physics improvements and extensions. The most fundamental new
feature of this release, however, is that the code has been completely
re-organized and brought into a highly modular and flexible shape. Switching
between different pre-implemented dark matter candidates has thus become
straight-forward, just as adding new - WIMP or non-WIMP - particle models or
replacing any given functionality in a fully user-specified way. In this
article, we describe the physics behind the computer package, along with the
main structure and philosophy of this major revision of DarkSUSY. A detailed
manual is provided together with the public release at www.darksusy.org.
| hep-ph astro-ph.CO | the nature of dark matter remains one of the key science questions weakly interacting massive particles wimps are among the best motivated particle physics candidates allowing to explain the measured dark matter density by employing standard bigbang thermodynamics we introduce here a radically new version of the widely used darksusy package which allows to compute the properties of such dark matter particles numerically with darksusy 6 one can accurately predict a large variety of astrophysical signals from dark matter such as direct detection rates in lowbackground counting experiments and indirect detection signals through antiprotons antideuterons gamma rays and positrons from the galactic halo or highenergy neutrinos from the center of the earth or of the sun for thermally produced dark matter like wimps highprecision tools are provided for the computation of the relic density in the universe today as well as for the size of the smallest dark matter protohalos furthermore the code allows to calculate dark matter selfinteraction rates which may affect the distribution of dark matter at small cosmological scales compared to earlier versions darksusy 6 introduces many significant physics improvements and extensions the most fundamental new feature of this release however is that the code has been completely reorganized and brought into a highly modular and flexible shape switching between different preimplemented dark matter candidates has thus become straightforward just as adding new wimp or nonwimp particle models or replacing any given functionality in a fully userspecified way in this article we describe the physics behind the computer package along with the main structure and philosophy of this major revision of darksusy a detailed manual is provided together with the public release at wwwdarksusyorg | [['the', 'nature', 'of', 'dark', 'matter', 'remains', 'one', 'of', 'the', 'key', 'science', 'questions', 'weakly', 'interacting', 'massive', 'particles', 'wimps', 'are', 'among', 'the', 'best', 'motivated', 'particle', 'physics', 'candidates', 'allowing', 'to', 'explain', 'the', 'measured', 'dark', 'matter', 'density', 'by', 'employing', 'standard', 'bigbang', 'thermodynamics', 'we', 'introduce', 'here', 'a', 'radically', 'new', 'version', 'of', 'the', 'widely', 'used', 'darksusy', 'package', 'which', 'allows', 'to', 'compute', 'the', 'properties', 'of', 'such', 'dark', 'matter', 'particles', 'numerically', 'with', 'darksusy', '6', 'one', 'can', 'accurately', 'predict', 'a', 'large', 'variety', 'of', 'astrophysical', 'signals', 'from', 'dark', 'matter', 'such', 'as', 'direct', 'detection', 'rates', 'in', 'lowbackground', 'counting', 'experiments', 'and', 'indirect', 'detection', 'signals', 'through', 'antiprotons', 'antideuterons', 'gamma', 'rays', 'and', 'positrons', 'from', 'the', 'galactic', 'halo', 'or', 'highenergy', 'neutrinos', 'from', 'the', 'center', 'of', 'the', 'earth', 'or', 'of', 'the', 'sun', 'for', 'thermally', 'produced', 'dark', 'matter', 'like', 'wimps', 'highprecision', 'tools', 'are', 'provided', 'for', 'the', 'computation', 'of', 'the', 'relic', 'density', 'in', 'the', 'universe', 'today', 'as', 'well', 'as', 'for', 'the', 'size', 'of', 'the', 'smallest', 'dark', 'matter', 'protohalos', 'furthermore', 'the', 'code', 'allows', 'to', 'calculate', 'dark', 'matter', 'selfinteraction', 'rates', 'which', 'may', 'affect', 'the', 'distribution', 'of', 'dark', 'matter', 'at', 'small', 'cosmological', 'scales', 'compared', 'to', 'earlier', 'versions', 'darksusy', '6', 'introduces', 'many', 'significant', 'physics', 'improvements', 'and', 'extensions', 'the', 'most', 'fundamental', 'new', 'feature', 'of', 'this', 'release', 'however', 'is', 'that', 'the', 'code', 'has', 'been', 'completely', 'reorganized', 'and', 'brought', 'into', 'a', 'highly', 'modular', 'and', 'flexible', 'shape', 'switching', 'between', 'different', 'preimplemented', 'dark', 'matter', 'candidates', 'has', 'thus', 'become', 'straightforward', 'just', 'as', 'adding', 'new', 'wimp', 'or', 'nonwimp', 'particle', 'models', 'or', 'replacing', 'any', 'given', 'functionality', 'in', 'a', 'fully', 'userspecified', 'way', 'in', 'this', 'article', 'we', 'describe', 'the', 'physics', 'behind', 'the', 'computer', 'package', 'along', 'with', 'the', 'main', 'structure', 'and', 'philosophy', 'of', 'this', 'major', 'revision', 'of', 'darksusy', 'a', 'detailed', 'manual', 'is', 'provided', 'together', 'with', 'the', 'public', 'release', 'at', 'wwwdarksusyorg']] | [-0.05569796591231167, 0.15913393692724218, -0.11133985796276238, 0.125777717885153, -0.11336586010250924, -0.12200971768892276, -0.022351913264055442, 0.2897619225567315, -0.25930729954026005, -0.40927061344078486, 0.039015148810627266, -0.27970080315719603, -0.04330860189857312, 0.20855263099361185, 0.018570067027041292, 0.040105622909217396, 0.03116485341688267, 0.016687958715551034, -0.015348224149024843, -0.2403861934342759, 0.2742413280867513, 0.1196013828061489, 0.19901680829766058, 0.049798099698660815, 0.08423832899796357, 0.0033408072355297813, -0.09253435558302031, -0.05594454858193943, -0.13709312380495353, 0.09816623414340227, 0.2339934736826868, 0.14523990002065978, 0.19502882326217502, -0.4371030051396161, -0.23161802516129892, 0.16982305890026814, 0.17080621819532363, 0.11682800979663928, -0.13678979366111732, -0.3044038791356244, 0.06442288948860748, -0.22685327737818242, -0.12097694934936294, -0.04586186602988375, -0.017955246490706435, 0.01189747185107199, -0.19147981986664134, 0.08132317085898873, -0.024256263497459324, -0.03284000105265042, -0.03465453742967878, -0.13990557053678102, 0.016043917471677927, 0.05316030135061052, 0.07854225476014266, -0.01068099815249983, 0.21184594237770332, -0.19996896646984352, -0.09775430062090627, 0.4450309683865719, -0.08452429583944056, -0.12122060796431522, 0.22306872348037912, -0.11812387047963135, -0.17259850246204145, 0.13531942771025596, 0.15613829291196188, 0.07614931794460458, -0.15997407965524885, 0.11463442098128312, -0.004608411953718725, 0.18689961304324612, 0.051487713817682496, 0.029541092568779015, 0.3410825145640073, 0.18806944562648836, 0.04588861909144106, 0.05579816490585538, -0.10468679107978697, -0.05953575035074618, -0.31579342140922445, -0.17318906162636002, -0.1456495339465935, 0.0012166945139735776, -0.04473002563632242, -0.12976642776672068, 0.3786244700136392, 0.12749797162351847, 0.16109600398972954, -0.007242764816180789, 0.3290930140706157, 0.016076675749491846, 0.06796645860953689, 0.07172724699426064, 0.27585800206187466, 0.1337787898002611, 0.08998476135024829, -0.15883873581364955, 0.033352993958481195, -0.0020960648409158425] |
1,802.034 | Extended and broad Lyman alpha emission around a BAL quasar at z~5 | In this work we report deep MUSE observations of a Broad Absorption Line
(BAL) quasar at z ~ 5, revealing a Lyman alpha nebula with a maximum projected
linear size of ~ 60 kpc around the quasar (down to our 2-sigma SB limit per
layer of ~ 9e-19 erg/s/cm^2/arcsec^2 for a 1 arcsec^2 aperture). After
correcting for the cosmological surface brightness dimming, we find that our
nebula, at z ~ 5, has an intrinsically less extended Lyman alpha emission than
nebulae at lower redshift. However, such a discrepancy is greatly reduced when
referring to comoving distances, which take into account the cosmological
growth of dark matter (DM) haloes, suggesting a positive correlation between
the size of Lyman alpha nebulae and the sizes of DM haloes/structures around
quasars. Differently from the typical nebulae around radio-quiet non-BAL
quasars, in the inner regions (~ 10 kpc) of the circumgalactic medium (CGM) of
our source, the velocity dispersion of the Lyman alpha emission is very high
(FWHM > 1000 km/s), suggesting that in our case we may be probing outflowing
material associated with the quasar.
| astro-ph.GA astro-ph.CO | in this work we report deep muse observations of a broad absorption line bal quasar at z 5 revealing a lyman alpha nebula with a maximum projected linear size of 60 kpc around the quasar down to our 2sigma sb limit per layer of 9e19 ergscm2arcsec2 for a 1 arcsec2 aperture after correcting for the cosmological surface brightness dimming we find that our nebula at z 5 has an intrinsically less extended lyman alpha emission than nebulae at lower redshift however such a discrepancy is greatly reduced when referring to comoving distances which take into account the cosmological growth of dark matter dm haloes suggesting a positive correlation between the size of lyman alpha nebulae and the sizes of dm haloesstructures around quasars differently from the typical nebulae around radioquiet nonbal quasars in the inner regions 10 kpc of the circumgalactic medium cgm of our source the velocity dispersion of the lyman alpha emission is very high fwhm 1000 kms suggesting that in our case we may be probing outflowing material associated with the quasar | [['in', 'this', 'work', 'we', 'report', 'deep', 'muse', 'observations', 'of', 'a', 'broad', 'absorption', 'line', 'bal', 'quasar', 'at', 'z', '5', 'revealing', 'a', 'lyman', 'alpha', 'nebula', 'with', 'a', 'maximum', 'projected', 'linear', 'size', 'of', '60', 'kpc', 'around', 'the', 'quasar', 'down', 'to', 'our', '2sigma', 'sb', 'limit', 'per', 'layer', 'of', '9e19', 'ergscm2arcsec2', 'for', 'a', '1', 'arcsec2', 'aperture', 'after', 'correcting', 'for', 'the', 'cosmological', 'surface', 'brightness', 'dimming', 'we', 'find', 'that', 'our', 'nebula', 'at', 'z', '5', 'has', 'an', 'intrinsically', 'less', 'extended', 'lyman', 'alpha', 'emission', 'than', 'nebulae', 'at', 'lower', 'redshift', 'however', 'such', 'a', 'discrepancy', 'is', 'greatly', 'reduced', 'when', 'referring', 'to', 'comoving', 'distances', 'which', 'take', 'into', 'account', 'the', 'cosmological', 'growth', 'of', 'dark', 'matter', 'dm', 'haloes', 'suggesting', 'a', 'positive', 'correlation', 'between', 'the', 'size', 'of', 'lyman', 'alpha', 'nebulae', 'and', 'the', 'sizes', 'of', 'dm', 'haloesstructures', 'around', 'quasars', 'differently', 'from', 'the', 'typical', 'nebulae', 'around', 'radioquiet', 'nonbal', 'quasars', 'in', 'the', 'inner', 'regions', '10', 'kpc', 'of', 'the', 'circumgalactic', 'medium', 'cgm', 'of', 'our', 'source', 'the', 'velocity', 'dispersion', 'of', 'the', 'lyman', 'alpha', 'emission', 'is', 'very', 'high', 'fwhm', '1000', 'kms', 'suggesting', 'that', 'in', 'our', 'case', 'we', 'may', 'be', 'probing', 'outflowing', 'material', 'associated', 'with', 'the', 'quasar']] | [-0.03233366819217026, 0.10021548670377768, -0.016991107332967006, 0.0827704682829117, -0.08903022258773963, -0.11200583693329137, 0.03525751604660915, 0.44166090246828305, -0.133116151515739, -0.34978265588769336, -0.01639861825818594, -0.328355153251407, 0.05726845835663938, 0.190888977326948, 0.02980107107237412, -0.04662296128583092, -0.01933908561847544, -0.15052455953844537, -0.028889733153268173, -0.282192057811499, 0.28070146831511544, 0.08720793917952133, 0.11064915668025527, -0.020961749467008205, 0.09549390081036298, -0.13005369618222806, -0.0637751876043179, 0.0017714961243502666, -0.15222270598655602, 0.029223222966505095, 0.25293247290816956, 0.11434425013086011, 0.275992277023151, -0.2785985159789982, -0.21975114059263054, 0.05717214916945796, 0.2597220221425358, 0.04165807108036808, -0.031490912057346304, -0.3059354390763285, 0.07258931395592373, -0.1670277733140426, -0.19859757984993776, 0.17183688348643697, 0.06204157899203845, -0.008508007918589485, -0.1809754704002081, 0.17643241277987384, 0.005296356149685349, 0.11198973602203469, -0.06995476648006911, -0.0898999803715703, -0.0699078019929113, -0.012266622307660553, 0.016772264918861534, 0.05546343893639076, 0.22605186450359752, -0.16535833998949326, 0.030053993372443116, 0.43573559309232096, -0.05304689667393881, 0.03978251766768753, 0.1784723252757867, -0.2709310274925137, -0.1906009939528808, 0.24007940519536505, 0.1711202329616843, 0.09318312886978548, -0.07002699909897621, 0.02637649117666162, -0.060690272614262956, 0.3238288197811758, 0.058644100459766264, 0.07851697675442335, 0.33415840846093403, 0.06815400687477019, 0.06470853896310952, 0.06583712380742816, -0.2833659046445973, 0.0528265925035462, -0.26237453332956817, -0.1284125279090125, -0.11695862301043908, 0.14567308799724357, -0.23119990566650855, -0.11844024016398054, 0.32990792340389047, 0.14783442008370976, 0.26156219242361367, 0.1072430455622484, 0.29386902531888875, 0.10430003701833028, 0.09585798767040689, 0.13128835804803524, 0.3395573031910927, 0.1674359298507667, 0.08473343192195962, -0.20312788586046093, 0.0528745768494861, -0.02165215762030613] |
1,802.03401 | Anomalous thermalization and transport in disordered interacting Floquet
systems | Local observables in generic periodically driven closed quantum systems are
known to relax to values described by periodic infinite temperature ensembles.
At the same time, ergodic static systems exhibit anomalous thermalization of
local observables and satisfy a modified version of the eigenstate
thermalization hypothesis (ETH), when disorder is present. This raises the
question, how does the introduction of disorder affect relaxation in
periodically driven systems? In this work, we analyze this problem by
numerically studying transport and thermalization in an archetypal example. We
find that thermalization is anomalous and is accompanied by subdiffusive
transport with a disorder dependent dynamical exponent. Distributions of matrix
elements of local operators in the eigenbases of a family of effective
time-independent Hamiltonians, which describe the stroboscopic dynamics of such
systems, show anomalous departures from predictions of ETH signaling that only
a modified version of ETH is satisfied. The dynamical exponent is shown to be
related to the scaling of the variance of these distributions with system size.
| cond-mat.dis-nn cond-mat.quant-gas | local observables in generic periodically driven closed quantum systems are known to relax to values described by periodic infinite temperature ensembles at the same time ergodic static systems exhibit anomalous thermalization of local observables and satisfy a modified version of the eigenstate thermalization hypothesis eth when disorder is present this raises the question how does the introduction of disorder affect relaxation in periodically driven systems in this work we analyze this problem by numerically studying transport and thermalization in an archetypal example we find that thermalization is anomalous and is accompanied by subdiffusive transport with a disorder dependent dynamical exponent distributions of matrix elements of local operators in the eigenbases of a family of effective timeindependent hamiltonians which describe the stroboscopic dynamics of such systems show anomalous departures from predictions of eth signaling that only a modified version of eth is satisfied the dynamical exponent is shown to be related to the scaling of the variance of these distributions with system size | [['local', 'observables', 'in', 'generic', 'periodically', 'driven', 'closed', 'quantum', 'systems', 'are', 'known', 'to', 'relax', 'to', 'values', 'described', 'by', 'periodic', 'infinite', 'temperature', 'ensembles', 'at', 'the', 'same', 'time', 'ergodic', 'static', 'systems', 'exhibit', 'anomalous', 'thermalization', 'of', 'local', 'observables', 'and', 'satisfy', 'a', 'modified', 'version', 'of', 'the', 'eigenstate', 'thermalization', 'hypothesis', 'eth', 'when', 'disorder', 'is', 'present', 'this', 'raises', 'the', 'question', 'how', 'does', 'the', 'introduction', 'of', 'disorder', 'affect', 'relaxation', 'in', 'periodically', 'driven', 'systems', 'in', 'this', 'work', 'we', 'analyze', 'this', 'problem', 'by', 'numerically', 'studying', 'transport', 'and', 'thermalization', 'in', 'an', 'archetypal', 'example', 'we', 'find', 'that', 'thermalization', 'is', 'anomalous', 'and', 'is', 'accompanied', 'by', 'subdiffusive', 'transport', 'with', 'a', 'disorder', 'dependent', 'dynamical', 'exponent', 'distributions', 'of', 'matrix', 'elements', 'of', 'local', 'operators', 'in', 'the', 'eigenbases', 'of', 'a', 'family', 'of', 'effective', 'timeindependent', 'hamiltonians', 'which', 'describe', 'the', 'stroboscopic', 'dynamics', 'of', 'such', 'systems', 'show', 'anomalous', 'departures', 'from', 'predictions', 'of', 'eth', 'signaling', 'that', 'only', 'a', 'modified', 'version', 'of', 'eth', 'is', 'satisfied', 'the', 'dynamical', 'exponent', 'is', 'shown', 'to', 'be', 'related', 'to', 'the', 'scaling', 'of', 'the', 'variance', 'of', 'these', 'distributions', 'with', 'system', 'size']] | [-0.17690852103843985, 0.22309704734679717, -0.11527776687957898, 0.10024247768501762, 0.034254706463270626, -0.18500438326952495, 0.006062760627914772, 0.30556744068608055, -0.29305719799523094, -0.23904133283958576, 0.0715894101577075, -0.2773641921855785, -0.153126221697743, 0.17728730416454283, -0.014610399425972575, 0.08099212608076302, 0.02798385147356003, 0.017858983889900516, -0.08884139741586958, -0.2361641561118081, 0.3379851806733504, 0.05063311763418218, 0.27222720653474053, 0.05398637603358998, 0.056890556776865935, 0.017134676479021616, 0.021819986425984053, 0.040479502698153626, -0.11350405920071623, 0.04665272001731842, 0.17107266752282158, 0.05485076094506147, 0.2172009963168544, -0.4066501854815417, -0.22066838362679622, 0.11712978355713005, 0.15990817165692095, 0.13065956817022928, -0.021428049382477724, -0.2694877308842232, 0.03907451956866332, -0.14403089969476432, -0.20372551470063627, -0.09124409605139568, 0.0407738248317468, 0.01706785668998405, -0.2771552882091154, 0.15150850630608922, 0.10476679940539826, 0.07967206742614508, -0.05826247182195391, -0.019441714791299337, 0.03440013869930013, 0.08529117558619301, 0.046701443414663736, -0.0396427029778284, 0.17161736384689533, -0.09658225261704008, -0.12916464046402662, 0.3715223353941793, -0.08303774719666919, -0.19457169481190956, 0.18955643333057748, -0.16966153666618522, -0.16598003182271323, 0.1041412012576827, 0.14741644576870272, 0.08381507631655737, -0.19631961293787664, 0.10700052225985457, -0.04287161002866924, 0.16650532555973363, -0.002319551859177465, 0.06083101091653476, 0.19863620435497092, 0.14837357722493003, 0.06036437865070723, 0.14865129778411723, 0.019825389056845947, -0.15349168095588225, -0.2842712769353831, -0.11598239297530165, -0.2261356793223294, 0.13835773427890222, -0.06554044952249963, -0.18716547885722118, 0.385937310019393, 0.19732616722503285, 0.192805983517089, 0.05050750316284528, 0.18058808657547665, 0.1967994193316518, 0.033499234798292477, 0.09396272235733952, 0.1979703583817837, 0.12573813826110167, 0.10545631953411633, -0.31797745939269434, 0.0745167175428597, 0.07652151078146732] |
1,802.03402 | Bow shock in merging cluster A520: the edge of the radio halo and the
electron-ion equilibration timescale | We studied the prominent bow shock in the merging galaxy cluster A520 using a
deep Chandra X-ray observation and archival VLA radio data. This shock is a
useful diagnostic tool, owing to its clear geometry and relatively high Mach
number. At the "nose" of the shock, we measure a Mach number of
$M=2.4_{-0.2}^{+0.4}$. The shock becomes oblique away from the merger axis,
with the Mach number falling to $\simeq$1.6 around 30$^{\circ}$ from the nose.
The electron temperature immediately behind the shock nose is consistent with
that from the Rankine-Hugoniot adiabat, and is higher (at a 95% confidence)
than expected for adiabatic compression of electrons followed by Coulomb
electron-proton equilibration, indicating the presence of equilibration
mechanisms faster than Coulomb collisions. This is similar to an earlier
finding for the Bullet cluster. We also combined four archival VLA datasets to
obtain a better image of the cluster's giant radio halo at 1.4 GHz. An abrupt
edge of the radio halo traces the shock front, and no emission is detected in
the pre-shock region. If the radio edge were due only to adiabatic compression
of relativistic electrons in pre-shock plasma, we would expect a pre-shock
radio emission detectable in this radio dataset; however, an interferometric
artifact dominates the uncertainty, so we cannot rule this model out. Other
interesting features of the radio halo include a peak at the remnant of the
cool core, suggesting that the core used to have a radio minihalo, and a peak
marking a possible region of high turbulence.
| astro-ph.HE | we studied the prominent bow shock in the merging galaxy cluster a520 using a deep chandra xray observation and archival vla radio data this shock is a useful diagnostic tool owing to its clear geometry and relatively high mach number at the nose of the shock we measure a mach number of m24_0204 the shock becomes oblique away from the merger axis with the mach number falling to simeq16 around 30circ from the nose the electron temperature immediately behind the shock nose is consistent with that from the rankinehugoniot adiabat and is higher at a 95 confidence than expected for adiabatic compression of electrons followed by coulomb electronproton equilibration indicating the presence of equilibration mechanisms faster than coulomb collisions this is similar to an earlier finding for the bullet cluster we also combined four archival vla datasets to obtain a better image of the clusters giant radio halo at 14 ghz an abrupt edge of the radio halo traces the shock front and no emission is detected in the preshock region if the radio edge were due only to adiabatic compression of relativistic electrons in preshock plasma we would expect a preshock radio emission detectable in this radio dataset however an interferometric artifact dominates the uncertainty so we cannot rule this model out other interesting features of the radio halo include a peak at the remnant of the cool core suggesting that the core used to have a radio minihalo and a peak marking a possible region of high turbulence | [['we', 'studied', 'the', 'prominent', 'bow', 'shock', 'in', 'the', 'merging', 'galaxy', 'cluster', 'a520', 'using', 'a', 'deep', 'chandra', 'xray', 'observation', 'and', 'archival', 'vla', 'radio', 'data', 'this', 'shock', 'is', 'a', 'useful', 'diagnostic', 'tool', 'owing', 'to', 'its', 'clear', 'geometry', 'and', 'relatively', 'high', 'mach', 'number', 'at', 'the', 'nose', 'of', 'the', 'shock', 'we', 'measure', 'a', 'mach', 'number', 'of', 'm24_0204', 'the', 'shock', 'becomes', 'oblique', 'away', 'from', 'the', 'merger', 'axis', 'with', 'the', 'mach', 'number', 'falling', 'to', 'simeq16', 'around', '30circ', 'from', 'the', 'nose', 'the', 'electron', 'temperature', 'immediately', 'behind', 'the', 'shock', 'nose', 'is', 'consistent', 'with', 'that', 'from', 'the', 'rankinehugoniot', 'adiabat', 'and', 'is', 'higher', 'at', 'a', '95', 'confidence', 'than', 'expected', 'for', 'adiabatic', 'compression', 'of', 'electrons', 'followed', 'by', 'coulomb', 'electronproton', 'equilibration', 'indicating', 'the', 'presence', 'of', 'equilibration', 'mechanisms', 'faster', 'than', 'coulomb', 'collisions', 'this', 'is', 'similar', 'to', 'an', 'earlier', 'finding', 'for', 'the', 'bullet', 'cluster', 'we', 'also', 'combined', 'four', 'archival', 'vla', 'datasets', 'to', 'obtain', 'a', 'better', 'image', 'of', 'the', 'clusters', 'giant', 'radio', 'halo', 'at', '14', 'ghz', 'an', 'abrupt', 'edge', 'of', 'the', 'radio', 'halo', 'traces', 'the', 'shock', 'front', 'and', 'no', 'emission', 'is', 'detected', 'in', 'the', 'preshock', 'region', 'if', 'the', 'radio', 'edge', 'were', 'due', 'only', 'to', 'adiabatic', 'compression', 'of', 'relativistic', 'electrons', 'in', 'preshock', 'plasma', 'we', 'would', 'expect', 'a', 'preshock', 'radio', 'emission', 'detectable', 'in', 'this', 'radio', 'dataset', 'however', 'an', 'interferometric', 'artifact', 'dominates', 'the', 'uncertainty', 'so', 'we', 'can', 'not', 'rule', 'this', 'model', 'out', 'other', 'interesting', 'features', 'of', 'the', 'radio', 'halo', 'include', 'a', 'peak', 'at', 'the', 'remnant', 'of', 'the', 'cool', 'core', 'suggesting', 'that', 'the', 'core', 'used', 'to', 'have', 'a', 'radio', 'minihalo', 'and', 'a', 'peak', 'marking', 'a', 'possible', 'region', 'of', 'high', 'turbulence']] | [-0.09590471843463261, 0.13187177285820154, -0.09645672014589052, 0.10303952370024096, -0.11740007747551913, -0.0757995063250129, 0.06352348514761491, 0.42159710888821916, -0.21096435227760033, -0.3076898323140111, 0.05780158623918352, -0.2801567502899552, -0.01513726842481209, 0.18908779835983003, 0.029953873822658163, -0.033876133673351225, 0.07729945794574497, -0.04924925751086459, -0.04149717843392864, -0.16590898240501262, 0.26561792129529155, 0.15797365440724764, 0.22710357857849375, 0.053029325954573055, 0.07785709021682197, -0.11064539748584351, -0.03139570077047141, -0.008492036132575816, -0.08074699953361134, 0.02139106136968782, 0.22166012469248988, 0.1199793933042658, 0.2338846727091086, -0.4428474783489946, -0.22423414520668727, 0.026323951043966544, 0.20940900062506337, 0.0720760755650124, -0.02580973448373946, -0.27946731858105067, 0.06270906333456257, -0.2102515513832909, -0.1855839489674921, 0.10753235494578631, 0.038190525744192634, 0.015602897717075116, -0.23036618956016847, 0.1535679406502114, 0.012819590318871355, 0.04675555542839226, -0.06690282133233968, -0.06710260359936929, -0.03419644069525013, 0.025075265816057544, 0.047824349873848856, 0.11499761734681437, 0.19558928397542097, -0.166503481187738, -0.039284067805370235, 0.40066221306085525, -0.028263136356097486, 0.013033653817973641, 0.2604988584796109, -0.2290571430683076, -0.15630679975458267, 0.21907226669127083, 0.13427471822823386, 0.05223233044431751, -0.08244312206567471, -0.021845559500967598, -0.05402603603424467, 0.18118982591542854, 0.11653799053850064, 0.0067734403562489855, 0.2852321085968919, 0.11073156592883095, 0.0644430217125554, 0.15122500925916751, -0.2615555631367108, 0.0228907171855157, -0.26042534431524905, -0.08401617811488765, -0.15604515125167118, 0.05713052009930133, -0.14546379332969958, -0.13938906377763605, 0.35705473406397437, 0.1428221843015341, 0.18288336006221342, 0.011248764392160568, 0.3471304140985012, 0.12054295197174132, 0.07344643786702919, 0.18230872541052628, 0.2984627512055468, 0.15934642341294622, 0.11753458719341511, -0.21404622769241322, 0.06315862177964673, -0.008224010025244581] |
1,802.03403 | Gauge-Invariant Formalism of Cosmological Weak Lensing | We present the gauge-invariant formalism of cosmological weak lensing,
accounting for all the relativistic effects due to the scalar, vector, and
tensor perturbations at the linear order. While the light propagation is fully
described by the geodesic equation, the relation of the photon wavevector to
the physical quantities requires the specification of the frames, where they
are defined. By constructing the local tetrad bases at the observer and the
source positions, we clarify the relation of the weak lensing observables such
as the convergence, the shear, and the rotation to the physical size and shape
defined in the source rest-frame and the observed angle and redshift measured
in the observer rest-frame. Compared to the standard lensing formalism,
additional relativistic effects contribute to all the lensing observables. We
explicitly verify the gauge-invariance of the lensing observables and compare
our results to previous work. In particular, we demonstrate that even in the
presence of the vector and tensor perturbations, the physical rotation of the
lensing observables vanishes at the linear order, while the tetrad basis
rotates along the light propagation compared to a FRW coordinate. Though the
latter is often used as a probe of primordial gravitational waves, the rotation
of the tetrad basis is indeed not a physical observable. We further clarify its
relation to the E-B decomposition in weak lensing. Our formalism provides a
transparent and comprehensive perspective of cosmological weak lensing.
| astro-ph.CO | we present the gaugeinvariant formalism of cosmological weak lensing accounting for all the relativistic effects due to the scalar vector and tensor perturbations at the linear order while the light propagation is fully described by the geodesic equation the relation of the photon wavevector to the physical quantities requires the specification of the frames where they are defined by constructing the local tetrad bases at the observer and the source positions we clarify the relation of the weak lensing observables such as the convergence the shear and the rotation to the physical size and shape defined in the source restframe and the observed angle and redshift measured in the observer restframe compared to the standard lensing formalism additional relativistic effects contribute to all the lensing observables we explicitly verify the gaugeinvariance of the lensing observables and compare our results to previous work in particular we demonstrate that even in the presence of the vector and tensor perturbations the physical rotation of the lensing observables vanishes at the linear order while the tetrad basis rotates along the light propagation compared to a frw coordinate though the latter is often used as a probe of primordial gravitational waves the rotation of the tetrad basis is indeed not a physical observable we further clarify its relation to the eb decomposition in weak lensing our formalism provides a transparent and comprehensive perspective of cosmological weak lensing | [['we', 'present', 'the', 'gaugeinvariant', 'formalism', 'of', 'cosmological', 'weak', 'lensing', 'accounting', 'for', 'all', 'the', 'relativistic', 'effects', 'due', 'to', 'the', 'scalar', 'vector', 'and', 'tensor', 'perturbations', 'at', 'the', 'linear', 'order', 'while', 'the', 'light', 'propagation', 'is', 'fully', 'described', 'by', 'the', 'geodesic', 'equation', 'the', 'relation', 'of', 'the', 'photon', 'wavevector', 'to', 'the', 'physical', 'quantities', 'requires', 'the', 'specification', 'of', 'the', 'frames', 'where', 'they', 'are', 'defined', 'by', 'constructing', 'the', 'local', 'tetrad', 'bases', 'at', 'the', 'observer', 'and', 'the', 'source', 'positions', 'we', 'clarify', 'the', 'relation', 'of', 'the', 'weak', 'lensing', 'observables', 'such', 'as', 'the', 'convergence', 'the', 'shear', 'and', 'the', 'rotation', 'to', 'the', 'physical', 'size', 'and', 'shape', 'defined', 'in', 'the', 'source', 'restframe', 'and', 'the', 'observed', 'angle', 'and', 'redshift', 'measured', 'in', 'the', 'observer', 'restframe', 'compared', 'to', 'the', 'standard', 'lensing', 'formalism', 'additional', 'relativistic', 'effects', 'contribute', 'to', 'all', 'the', 'lensing', 'observables', 'we', 'explicitly', 'verify', 'the', 'gaugeinvariance', 'of', 'the', 'lensing', 'observables', 'and', 'compare', 'our', 'results', 'to', 'previous', 'work', 'in', 'particular', 'we', 'demonstrate', 'that', 'even', 'in', 'the', 'presence', 'of', 'the', 'vector', 'and', 'tensor', 'perturbations', 'the', 'physical', 'rotation', 'of', 'the', 'lensing', 'observables', 'vanishes', 'at', 'the', 'linear', 'order', 'while', 'the', 'tetrad', 'basis', 'rotates', 'along', 'the', 'light', 'propagation', 'compared', 'to', 'a', 'frw', 'coordinate', 'though', 'the', 'latter', 'is', 'often', 'used', 'as', 'a', 'probe', 'of', 'primordial', 'gravitational', 'waves', 'the', 'rotation', 'of', 'the', 'tetrad', 'basis', 'is', 'indeed', 'not', 'a', 'physical', 'observable', 'we', 'further', 'clarify', 'its', 'relation', 'to', 'the', 'eb', 'decomposition', 'in', 'weak', 'lensing', 'our', 'formalism', 'provides', 'a', 'transparent', 'and', 'comprehensive', 'perspective', 'of', 'cosmological', 'weak', 'lensing']] | [-0.14770538976379863, 0.10080687110593285, -0.10442052982900099, 0.1079301846846898, -0.1081837081061355, -0.0660878727433336, -0.035208804052170556, 0.34237804160260693, -0.2634528865134504, -0.2642864329501553, 0.029530897482141757, -0.2729768938954984, -0.08156768117874764, 0.15250937093715666, 0.02497217323077072, 0.07688122729601234, 0.01348699094047208, 0.010410719964621139, -0.11209151922650626, -0.23228784357318014, 0.3430164492084918, 0.10758609820060946, 0.2560181257581932, 0.009546116640759182, 0.12060766010384621, 0.020298417852810134, -0.0893795367246012, 0.05312418294789527, -0.11290686040558348, 0.06273260847304081, 0.1929018613645267, 0.13426874212294432, 0.1979503395567886, -0.3735936852894595, -0.18985167473699127, 0.07862399706761514, 0.11447251415289618, 0.16341586503730124, -0.006247208104468882, -0.32060708743941585, 0.049360842413393426, -0.13033532563512662, -0.1573945188670066, -0.0706390139108909, -0.0012863792312443898, 0.0034294414613998078, -0.23846807389656596, 0.12775762484746117, 0.059529285697298574, 0.03244874813064034, -0.08216726951399449, -0.03867084257192267, -0.060111698130514986, 0.09833360205360303, 0.08850659685839642, 0.06260776805394361, 0.14378732886438356, -0.13268481058887496, -0.041444730395722156, 0.44301027465402953, -0.09388374705128533, -0.211002215563424, 0.13471317301897717, -0.19463795554048405, -0.12836317749742163, 0.044374665177170314, 0.15665754579120025, 0.10139417827956314, -0.15441746367663467, 0.09662975546488552, 0.014183269197458466, 0.15699703337881585, 0.06839970279493016, 0.08118036375702198, 0.2564064873390478, 0.0545152631454804, 0.03149781646487977, 0.09169862003332598, -0.11444454558257913, -0.04932008415725532, -0.37238845033651413, -0.1106225299376688, -0.14272354519825653, 0.06070071431625773, -0.14714544752991812, -0.1602127253487385, 0.41087338832560283, 0.1720553340293981, 0.1848655351847089, 0.06785725768161777, 0.3319493925965648, 0.11620530560421999, 0.06417525460710749, 0.06680976025406914, 0.3809222051761402, 0.19651056100927486, 0.09664561662317157, -0.24799337098977112, 0.03990047418408032, 0.036534632010192705] |
1,802.03404 | Prospects for resolving the Hubble constant tension with standard sirens | The Hubble constant ($H_0$) estimated from the local Cepheid-supernova (SN)
distance ladder is in 3-$\sigma$ tension with the value extrapolated from
cosmic microwave background (CMB) data assuming the standard cosmological
model. Whether this tension represents new physics or systematic effects is the
subject of intense debate. Here, we investigate how new, independent $H_0$
estimates can arbitrate this tension, assessing whether the measurements are
consistent with being derived from the same model using the posterior
predictive distribution (PPD). We show that, with existing data, the inverse
distance ladder formed from BOSS baryon acoustic oscillation measurements and
the Pantheon SN sample yields an $H_0$ posterior near-identical to the Planck
CMB measurement. The observed local distance ladder value is a very unlikely
draw from the resulting PPD. Turning to the future, we find that a sample of
$\sim50$ binary neutron star "standard sirens" (detectable within the next
decade) will be able to adjudicate between the local and CMB estimates.
| astro-ph.CO | the hubble constant h_0 estimated from the local cepheidsupernova sn distance ladder is in 3sigma tension with the value extrapolated from cosmic microwave background cmb data assuming the standard cosmological model whether this tension represents new physics or systematic effects is the subject of intense debate here we investigate how new independent h_0 estimates can arbitrate this tension assessing whether the measurements are consistent with being derived from the same model using the posterior predictive distribution ppd we show that with existing data the inverse distance ladder formed from boss baryon acoustic oscillation measurements and the pantheon sn sample yields an h_0 posterior nearidentical to the planck cmb measurement the observed local distance ladder value is a very unlikely draw from the resulting ppd turning to the future we find that a sample of sim50 binary neutron star standard sirens detectable within the next decade will be able to adjudicate between the local and cmb estimates | [['the', 'hubble', 'constant', 'h_0', 'estimated', 'from', 'the', 'local', 'cepheidsupernova', 'sn', 'distance', 'ladder', 'is', 'in', '3sigma', 'tension', 'with', 'the', 'value', 'extrapolated', 'from', 'cosmic', 'microwave', 'background', 'cmb', 'data', 'assuming', 'the', 'standard', 'cosmological', 'model', 'whether', 'this', 'tension', 'represents', 'new', 'physics', 'or', 'systematic', 'effects', 'is', 'the', 'subject', 'of', 'intense', 'debate', 'here', 'we', 'investigate', 'how', 'new', 'independent', 'h_0', 'estimates', 'can', 'arbitrate', 'this', 'tension', 'assessing', 'whether', 'the', 'measurements', 'are', 'consistent', 'with', 'being', 'derived', 'from', 'the', 'same', 'model', 'using', 'the', 'posterior', 'predictive', 'distribution', 'ppd', 'we', 'show', 'that', 'with', 'existing', 'data', 'the', 'inverse', 'distance', 'ladder', 'formed', 'from', 'boss', 'baryon', 'acoustic', 'oscillation', 'measurements', 'and', 'the', 'pantheon', 'sn', 'sample', 'yields', 'an', 'h_0', 'posterior', 'nearidentical', 'to', 'the', 'planck', 'cmb', 'measurement', 'the', 'observed', 'local', 'distance', 'ladder', 'value', 'is', 'a', 'very', 'unlikely', 'draw', 'from', 'the', 'resulting', 'ppd', 'turning', 'to', 'the', 'future', 'we', 'find', 'that', 'a', 'sample', 'of', 'sim50', 'binary', 'neutron', 'star', 'standard', 'sirens', 'detectable', 'within', 'the', 'next', 'decade', 'will', 'be', 'able', 'to', 'adjudicate', 'between', 'the', 'local', 'and', 'cmb', 'estimates']] | [-0.05395317775531648, 0.1314031346799031, -0.07140491019862776, 0.10801333551166746, -0.12467676450689442, -0.08486431612012287, 0.06283994041120586, 0.34814359930654365, -0.2786061139060901, -0.3096079779460501, 0.06925855340252896, -0.3365241532715467, 0.00024615536676719785, 0.2051760555462888, 0.013653607847980963, 0.014913649104178498, 0.08701540061454767, 0.0015353539552635108, -0.09899006724560586, -0.25773206132819326, 0.28378010505082035, 0.1584224629556187, 0.2751529502461497, -0.04247153644414189, 0.05935390634635368, -0.06840844589094512, -0.09869054161670367, 0.027238247281041905, -0.22239933978459867, 0.07408838777486473, 0.18925807644905618, 0.16532951338362742, 0.1927737245001854, -0.3837870883896987, -0.21947266883216798, 0.17365104421221006, 0.13055244990540907, 0.14490016425947827, -0.041120937485874705, -0.3017625705173347, 0.014568766478661042, -0.1479191927997491, -0.10849302635193826, 0.022579228330869228, -0.025998481132913955, -0.03330099256858469, -0.27535930463375574, 0.1821193007606034, -0.041626741646980055, 0.01385119639766904, -0.08139982784334092, -0.11457790340481995, -0.015559906198177487, 0.06888387311781304, 0.0464151828096081, 0.11602793473045891, 0.14334892883049086, -0.08601498490987489, -0.043753207641062684, 0.3577984292418338, -0.1257145647974446, -0.07451606677839151, 0.12046733715135652, -0.20437378261703998, -0.12891925306310162, 0.05751351623360115, 0.13093788308413842, 0.007237920107749792, -0.19479821963558117, 0.07346195400952218, 0.004792200590973386, 0.21318540845487194, 0.0388552436667781, -0.0020290247003476205, 0.3097285418950308, 0.15420784490953127, 0.07690375193487853, 0.06266010565107138, -0.20594440039862186, 0.009157167596873851, -0.32072855145013773, -0.013983982770393292, -0.1834506869722062, 0.11111357849604712, -0.16245731537939997, -0.14615491232595956, 0.32690287062611717, 0.18962903388996777, 0.22914101372962484, 0.06747835830379373, 0.30129510249035096, 0.055328355730475426, 0.07037746883146703, 0.0576246207824741, 0.3554380510169535, 0.14031087592220268, 0.053132246052906014, -0.2237004002971121, 0.07790566522490759, -0.008764795173938649] |
1,802.03405 | Particle-without-Particle: a practical pseudospectral collocation method
for linear partial differential equations with distributional sources | Partial differential equations with distributional sources---in particular,
involving (derivatives of) delta distributions---have become increasingly
ubiquitous in numerous areas of physics and applied mathematics. It is often of
considerable interest to obtain numerical solutions for such equations, but any
singular ("particle"-like) source modeling invariably introduces nontrivial
computational obstacles. A common method to circumvent these is through some
form of delta function approximation procedure on the computational grid;
however, this often carries significant limitations on the efficiency of the
numerical convergence rates, or sometimes even the resolvability of the problem
at all.
In this paper, we present an alternative technique for tackling such
equations which avoids the singular behavior entirely: the
"Particle-without-Particle" method. Previously introduced in the context of the
self-force problem in gravitational physics, the idea is to discretize the
computational domain into two (or more) disjoint pseudospectral
(Chebyshev-Lobatto) grids such that the "particle" is always at the interface
between them; thus, one only needs to solve homogeneous equations in each
domain, with the source effectively replaced by jump (boundary) conditions
thereon. We prove here that this method yields solutions to any linear PDE the
source of which is any linear combination of delta distributions and
derivatives thereof supported on a one-dimensional subspace of the problem
domain. We then implement it to numerically solve a variety of relevant PDEs:
hyperbolic (with applications to neuroscience and acoustics), parabolic (with
applications to finance), and elliptic. We generically obtain improved
convergence rates relative to typical past implementations relying on delta
function approximations.
| physics.comp-ph gr-qc math.NA q-bio.NC q-fin.CP | partial differential equations with distributional sourcesin particular involving derivatives of delta distributionshave become increasingly ubiquitous in numerous areas of physics and applied mathematics it is often of considerable interest to obtain numerical solutions for such equations but any singular particlelike source modeling invariably introduces nontrivial computational obstacles a common method to circumvent these is through some form of delta function approximation procedure on the computational grid however this often carries significant limitations on the efficiency of the numerical convergence rates or sometimes even the resolvability of the problem at all in this paper we present an alternative technique for tackling such equations which avoids the singular behavior entirely the particlewithoutparticle method previously introduced in the context of the selfforce problem in gravitational physics the idea is to discretize the computational domain into two or more disjoint pseudospectral chebyshevlobatto grids such that the particle is always at the interface between them thus one only needs to solve homogeneous equations in each domain with the source effectively replaced by jump boundary conditions thereon we prove here that this method yields solutions to any linear pde the source of which is any linear combination of delta distributions and derivatives thereof supported on a onedimensional subspace of the problem domain we then implement it to numerically solve a variety of relevant pdes hyperbolic with applications to neuroscience and acoustics parabolic with applications to finance and elliptic we generically obtain improved convergence rates relative to typical past implementations relying on delta function approximations | [['partial', 'differential', 'equations', 'with', 'distributional', 'sourcesin', 'particular', 'involving', 'derivatives', 'of', 'delta', 'distributionshave', 'become', 'increasingly', 'ubiquitous', 'in', 'numerous', 'areas', 'of', 'physics', 'and', 'applied', 'mathematics', 'it', 'is', 'often', 'of', 'considerable', 'interest', 'to', 'obtain', 'numerical', 'solutions', 'for', 'such', 'equations', 'but', 'any', 'singular', 'particlelike', 'source', 'modeling', 'invariably', 'introduces', 'nontrivial', 'computational', 'obstacles', 'a', 'common', 'method', 'to', 'circumvent', 'these', 'is', 'through', 'some', 'form', 'of', 'delta', 'function', 'approximation', 'procedure', 'on', 'the', 'computational', 'grid', 'however', 'this', 'often', 'carries', 'significant', 'limitations', 'on', 'the', 'efficiency', 'of', 'the', 'numerical', 'convergence', 'rates', 'or', 'sometimes', 'even', 'the', 'resolvability', 'of', 'the', 'problem', 'at', 'all', 'in', 'this', 'paper', 'we', 'present', 'an', 'alternative', 'technique', 'for', 'tackling', 'such', 'equations', 'which', 'avoids', 'the', 'singular', 'behavior', 'entirely', 'the', 'particlewithoutparticle', 'method', 'previously', 'introduced', 'in', 'the', 'context', 'of', 'the', 'selfforce', 'problem', 'in', 'gravitational', 'physics', 'the', 'idea', 'is', 'to', 'discretize', 'the', 'computational', 'domain', 'into', 'two', 'or', 'more', 'disjoint', 'pseudospectral', 'chebyshevlobatto', 'grids', 'such', 'that', 'the', 'particle', 'is', 'always', 'at', 'the', 'interface', 'between', 'them', 'thus', 'one', 'only', 'needs', 'to', 'solve', 'homogeneous', 'equations', 'in', 'each', 'domain', 'with', 'the', 'source', 'effectively', 'replaced', 'by', 'jump', 'boundary', 'conditions', 'thereon', 'we', 'prove', 'here', 'that', 'this', 'method', 'yields', 'solutions', 'to', 'any', 'linear', 'pde', 'the', 'source', 'of', 'which', 'is', 'any', 'linear', 'combination', 'of', 'delta', 'distributions', 'and', 'derivatives', 'thereof', 'supported', 'on', 'a', 'onedimensional', 'subspace', 'of', 'the', 'problem', 'domain', 'we', 'then', 'implement', 'it', 'to', 'numerically', 'solve', 'a', 'variety', 'of', 'relevant', 'pdes', 'hyperbolic', 'with', 'applications', 'to', 'neuroscience', 'and', 'acoustics', 'parabolic', 'with', 'applications', 'to', 'finance', 'and', 'elliptic', 'we', 'generically', 'obtain', 'improved', 'convergence', 'rates', 'relative', 'to', 'typical', 'past', 'implementations', 'relying', 'on', 'delta', 'function', 'approximations']] | [-0.09245660042128057, 0.03292586138843212, -0.07827590772980536, 0.06334568005021117, -0.1270803058589998, -0.14492776070918312, 0.011929955017824876, 0.34334063511796115, -0.31765831207356804, -0.2823791232876237, 0.1452874873052124, -0.2681811196706826, -0.1495301719789007, 0.23234529835285572, -0.07872647686286004, 0.09606103680656874, 0.06362016645697423, 0.001752545913478844, -0.08053612438450772, -0.22943292193235906, 0.32462932184107635, -0.022706136509811136, 0.2451173968185345, 0.05551872125304327, 0.12822001405643316, -0.02734767893098325, -0.0302576076029232, 0.022710460657443154, -0.12327811291671549, 0.12278895195037869, 0.2863483499864313, 0.09952134587158395, 0.31400445860912796, -0.44337613239308926, -0.24096747118283093, 0.12138323406300817, 0.1611208371303188, 0.12140880222526962, -0.051732789378007966, -0.25082550918124047, 0.08152671307618768, -0.13429426917393608, -0.15070700576922635, -0.08430923064091675, 0.01062150928570427, 0.02287710383127451, -0.26291585290081404, 0.07414813598757988, 0.06333028695634703, 0.03320400986245008, -0.03693858992849757, -0.10317735774328977, 0.025472184169443128, 0.06702920963525832, 0.06717547910700636, 0.01654205043001358, 0.06008418410547017, -0.13120913467979498, -0.08317673505601905, 0.3855589492326012, -0.023951118113473058, -0.3090642887400463, 0.2110315963589942, -0.11659730068457405, -0.12913166196274806, 0.12568109877037484, 0.18540852242414424, 0.1478884930767846, -0.14552952605678238, 0.11213702540390375, 0.005936894421011391, 0.15640952001783404, 0.09060791976053298, -0.0013959011445351976, 0.13909672035237516, 0.1326823801633228, 0.12313274145542788, 0.10418877320702953, -0.021282316626705478, -0.13209221303762064, -0.3006870065194865, -0.13289066128706278, -0.1651854094546629, 0.03826053209254533, -0.09720906424011971, -0.22272909681380884, 0.3623246770925684, 0.16797501194514183, 0.14687963297242315, 0.029801505399163722, 0.3112726976585809, 0.17145721613674622, 0.034419542623823886, 0.08118404361371583, 0.17276443543191336, 0.11274623059728221, 0.10977869775199248, -0.2031119739129473, 0.05468747094443931, 0.0968513897173173] |
1,802.03406 | LOFAR 150-MHz observations of SS 433 and W 50 | We present LOFAR high-band data over the frequency range 115-189 MHz for the
X-ray binary SS 433, obtained in an observing campaign from 2013 February -
2014 May. Our results include a deep, wide-field map, allowing a detailed view
of the surrounding supernova remnant W 50 at low radio frequencies, as well as
a light curve for SS 433 determined from shorter monitoring runs. The complex
morphology of W 50 is in excellent agreement with previously published
higher-frequency maps; we find additional evidence for a spectral turnover in
the eastern wing, potentially due to foreground free-free absorption.
Furthermore, SS 433 is tentatively variable at 150 MHz, with both a debiased
modulation index of 11 per cent and a $\chi^2$ probability of a flat light
curve of $8.2 \times 10^{-3}$. By comparing the LOFAR flux densities with
contemporaneous observations carried out at 4800 MHz with the RATAN-600
telescope, we suggest that an observed $\sim$0.5-1 Jy rise in the 150-MHz flux
density may correspond to sustained flaring activity over a period of
approximately six months at 4800 MHz. However, the increase is too large to be
explained with a standard synchrotron bubble model. We also detect a wealth of
structure along the nearby Galactic plane, including the most complete
detection to date of the radio shell of the candidate supernova remnant G
38.7-1.4. This further demonstrates the potential of supernova remnant studies
with the current generation of low-frequency radio telescopes.
| astro-ph.HE astro-ph.GA | we present lofar highband data over the frequency range 115189 mhz for the xray binary ss 433 obtained in an observing campaign from 2013 february 2014 may our results include a deep widefield map allowing a detailed view of the surrounding supernova remnant w 50 at low radio frequencies as well as a light curve for ss 433 determined from shorter monitoring runs the complex morphology of w 50 is in excellent agreement with previously published higherfrequency maps we find additional evidence for a spectral turnover in the eastern wing potentially due to foreground freefree absorption furthermore ss 433 is tentatively variable at 150 mhz with both a debiased modulation index of 11 per cent and a chi2 probability of a flat light curve of 82 times 103 by comparing the lofar flux densities with contemporaneous observations carried out at 4800 mhz with the ratan600 telescope we suggest that an observed sim051 jy rise in the 150mhz flux density may correspond to sustained flaring activity over a period of approximately six months at 4800 mhz however the increase is too large to be explained with a standard synchrotron bubble model we also detect a wealth of structure along the nearby galactic plane including the most complete detection to date of the radio shell of the candidate supernova remnant g 38714 this further demonstrates the potential of supernova remnant studies with the current generation of lowfrequency radio telescopes | [['we', 'present', 'lofar', 'highband', 'data', 'over', 'the', 'frequency', 'range', '115189', 'mhz', 'for', 'the', 'xray', 'binary', 'ss', '433', 'obtained', 'in', 'an', 'observing', 'campaign', 'from', '2013', 'february', '2014', 'may', 'our', 'results', 'include', 'a', 'deep', 'widefield', 'map', 'allowing', 'a', 'detailed', 'view', 'of', 'the', 'surrounding', 'supernova', 'remnant', 'w', '50', 'at', 'low', 'radio', 'frequencies', 'as', 'well', 'as', 'a', 'light', 'curve', 'for', 'ss', '433', 'determined', 'from', 'shorter', 'monitoring', 'runs', 'the', 'complex', 'morphology', 'of', 'w', '50', 'is', 'in', 'excellent', 'agreement', 'with', 'previously', 'published', 'higherfrequency', 'maps', 'we', 'find', 'additional', 'evidence', 'for', 'a', 'spectral', 'turnover', 'in', 'the', 'eastern', 'wing', 'potentially', 'due', 'to', 'foreground', 'freefree', 'absorption', 'furthermore', 'ss', '433', 'is', 'tentatively', 'variable', 'at', '150', 'mhz', 'with', 'both', 'a', 'debiased', 'modulation', 'index', 'of', '11', 'per', 'cent', 'and', 'a', 'chi2', 'probability', 'of', 'a', 'flat', 'light', 'curve', 'of', '82', 'times', '103', 'by', 'comparing', 'the', 'lofar', 'flux', 'densities', 'with', 'contemporaneous', 'observations', 'carried', 'out', 'at', '4800', 'mhz', 'with', 'the', 'ratan600', 'telescope', 'we', 'suggest', 'that', 'an', 'observed', 'sim051', 'jy', 'rise', 'in', 'the', '150mhz', 'flux', 'density', 'may', 'correspond', 'to', 'sustained', 'flaring', 'activity', 'over', 'a', 'period', 'of', 'approximately', 'six', 'months', 'at', '4800', 'mhz', 'however', 'the', 'increase', 'is', 'too', 'large', 'to', 'be', 'explained', 'with', 'a', 'standard', 'synchrotron', 'bubble', 'model', 'we', 'also', 'detect', 'a', 'wealth', 'of', 'structure', 'along', 'the', 'nearby', 'galactic', 'plane', 'including', 'the', 'most', 'complete', 'detection', 'to', 'date', 'of', 'the', 'radio', 'shell', 'of', 'the', 'candidate', 'supernova', 'remnant', 'g', '38714', 'this', 'further', 'demonstrates', 'the', 'potential', 'of', 'supernova', 'remnant', 'studies', 'with', 'the', 'current', 'generation', 'of', 'lowfrequency', 'radio', 'telescopes']] | [-0.09270292017249727, 0.09717307834145415, -0.031994772692547836, 0.048995470884256064, -0.09992469908729038, -0.08973302545144837, 0.10647095305686619, 0.44194235379629315, -0.17629030366958257, -0.3630798078632537, 0.1215720246813478, -0.2930116811370913, -0.037664087457542725, 0.2516309530345446, -0.004396757766842208, -0.058321382400351875, 0.09343489933204144, -0.07264091220307857, -0.03701637090986317, -0.19981868416231938, 0.16996636698815099, 0.14931374806303907, 0.2317186677868062, -0.01673434679891835, 0.09097651913118093, -0.08727299525635317, -0.10164926629699271, -0.05017473376256988, -0.08424128187102627, 0.030163986412213836, 0.2469395351957188, 0.10064544990520052, 0.1803202184858395, -0.34961728108947737, -0.23215290011560663, 0.0738043441367831, 0.12951509411659765, 0.017267068773210843, -0.0037823207220657076, -0.28734273384771053, 0.07064679902755318, -0.22763617585036666, -0.1985834802486042, 0.08879434277917793, 0.05621169733993234, 0.025366785041888818, -0.22255103732087708, 0.11516970781537585, -0.03350671266770347, 0.11386179796796529, -0.11531538964804024, -0.13151087957295649, -0.034031868609599766, 0.035989849631516066, 0.007844725029761012, 0.11718177781935701, 0.11392047259575153, -0.09339064812545288, -0.09012636120054633, 0.35173576382543653, -0.10733521609824706, 0.034219993370897234, 0.19584349071745702, -0.23017941500119707, -0.1659648344317015, 0.23825921957242363, 0.1557690391881748, 0.05812890526065801, -0.12044460335127177, -0.008146394945884202, -0.034538466289659286, 0.25302545692414996, 0.08289311029056602, 0.048756994319449, 0.3081527489019518, 0.14779006265688371, 0.03175249569560153, 0.15160038717279328, -0.29928532254466034, 0.012392532169581093, -0.2664539537868126, -0.038739753177171536, -0.1219451141588271, 0.12303811688634983, -0.11063252082880973, -0.07933831708109443, 0.42198231472098763, 0.08000328003706292, 0.20345826877499038, 0.03210673315074057, 0.27398995582529523, 0.07023624408088545, 0.08066278494717405, 0.11638158777768308, 0.3063129299181573, 0.12567553184332048, 0.13272086519133697, -0.18455706823498327, 0.00288725485430753, -0.05917143652790246] |
1,802.03407 | Supergravity in the group-geometric framework: a primer | We review the group-geometric approach to supergravity theories, in the
perspective of recent developments and applications. Usual diffeomorphisms,
gauge symmetries and supersymmetries are unified as superdiffeomorphisms in a
supergroup manifold. Integration on supermanifolds is briefly revisited, and
used as a tool to provide a bridge between component and superspace actions. As
an illustration of the constructive techniques, the cases of $d=3,4$ off-shell
supergravities and $d=5$ Chern-Simons supergravity are discussed in detail. A
cursory account of $d=10+2$ supergravity is also included. We recall a
covariant canonical formalism, well adapted to theories described by
Lagrangians $d$-forms, that allows to define a form hamiltonian and to recast
constrained hamiltonian systems in a covariant form language. Finally, group
geometry and properties of spinors and gamma matrices in $d=s+t$ dimensions are
summarized in Appendices.
| hep-th | we review the groupgeometric approach to supergravity theories in the perspective of recent developments and applications usual diffeomorphisms gauge symmetries and supersymmetries are unified as superdiffeomorphisms in a supergroup manifold integration on supermanifolds is briefly revisited and used as a tool to provide a bridge between component and superspace actions as an illustration of the constructive techniques the cases of d34 offshell supergravities and d5 chernsimons supergravity are discussed in detail a cursory account of d102 supergravity is also included we recall a covariant canonical formalism well adapted to theories described by lagrangians dforms that allows to define a form hamiltonian and to recast constrained hamiltonian systems in a covariant form language finally group geometry and properties of spinors and gamma matrices in dst dimensions are summarized in appendices | [['we', 'review', 'the', 'groupgeometric', 'approach', 'to', 'supergravity', 'theories', 'in', 'the', 'perspective', 'of', 'recent', 'developments', 'and', 'applications', 'usual', 'diffeomorphisms', 'gauge', 'symmetries', 'and', 'supersymmetries', 'are', 'unified', 'as', 'superdiffeomorphisms', 'in', 'a', 'supergroup', 'manifold', 'integration', 'on', 'supermanifolds', 'is', 'briefly', 'revisited', 'and', 'used', 'as', 'a', 'tool', 'to', 'provide', 'a', 'bridge', 'between', 'component', 'and', 'superspace', 'actions', 'as', 'an', 'illustration', 'of', 'the', 'constructive', 'techniques', 'the', 'cases', 'of', 'd34', 'offshell', 'supergravities', 'and', 'd5', 'chernsimons', 'supergravity', 'are', 'discussed', 'in', 'detail', 'a', 'cursory', 'account', 'of', 'd102', 'supergravity', 'is', 'also', 'included', 'we', 'recall', 'a', 'covariant', 'canonical', 'formalism', 'well', 'adapted', 'to', 'theories', 'described', 'by', 'lagrangians', 'dforms', 'that', 'allows', 'to', 'define', 'a', 'form', 'hamiltonian', 'and', 'to', 'recast', 'constrained', 'hamiltonian', 'systems', 'in', 'a', 'covariant', 'form', 'language', 'finally', 'group', 'geometry', 'and', 'properties', 'of', 'spinors', 'and', 'gamma', 'matrices', 'in', 'dst', 'dimensions', 'are', 'summarized', 'in', 'appendices']] | [-0.12037681095353037, 0.10898744043072384, -0.05982881113595795, 0.13426324527063116, -0.11906310453923652, -0.14950417236468638, -0.031123620068683522, 0.3481652111695439, -0.15609734462123015, -0.25656179806173895, 0.07785754213000473, -0.24599402503929468, -0.23441351373139696, 0.12720348642869794, -0.12594606970560562, 0.015209953277008026, 0.00022316734248306602, 0.041000217174087084, -0.14021190206221945, -0.2562256673918455, 0.30873880351282423, 0.011263674834481208, 0.20462272902659606, 0.02118863548457739, 0.1347525630990276, -0.0060011398018104956, -0.027278804445813876, 0.020311523839254164, -0.1256119368138684, 0.13517830384989793, 0.300118415561883, 0.12213812936170143, 0.11330467536026845, -0.4443399780720938, -0.21787225338994176, 0.015244192914906307, 0.16950499358426896, 0.11435389667349227, 0.01445651395169989, -0.33359726493654307, 0.011155793324974184, -0.2025968106390792, -0.16507716996875388, -0.1673186986479891, 0.03804281531782294, -0.11165571945457486, -0.21956699073052732, 0.04957603516390918, 0.04183191316860757, 0.08581736873384216, -0.055277444523653685, -0.09893497565099096, -0.0470985864103568, 0.04734746804115275, 0.09590553602652108, 0.041839804314804496, 0.13624357851858804, -0.11865981055757402, -0.180644370029313, 0.4073268878055387, -0.05446989653728451, -0.281127925398323, 0.1370716149767759, -0.05956329344553524, -0.23308503402586211, 0.025775058009458007, 0.14628623818134656, 0.16326209676844883, -0.17750917206285521, 0.2177659996414718, 0.006099721565988148, 0.0727974990477378, 0.05952934765446116, 0.05058969535457436, 0.1874432395961776, 0.10724537200439954, 0.02594074945000102, 0.11895444575566216, 0.06504370677885163, -0.12348776428257224, -0.4396420494886115, -0.17931247303911846, -0.08132942196971271, 0.0923181122607275, -0.07058021792090585, -0.112835443491349, 0.3719151622899517, 0.09667656494275434, 0.14470161496137735, 0.06612546007090714, 0.22418907339124416, 0.09539118301927374, 0.06157142380834557, 0.029816049798682798, 0.19771997080943038, 0.24532525284485018, 0.0684749445917987, -0.13895286431852583, -0.16671352252410543, 0.1769540845652955] |
1,802.03408 | On the Computational Complexity of Curing the Sign Problem | Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have
positive off-diagonal matrix elements in a given basis, are known to pose
severe limitations on the efficiency of Quantum Monte Carlo algorithms designed
to simulate them, due to the infamous sign problem. We study the computational
complexity associated with `curing' non-stoquastic Hamiltonians, i.e.,
transforming them into sign-problem-free ones. We prove that if such
transformations are limited to single-qubit Clifford group elements or general
single-qubit orthogonal matrices, finding the curing transformation is
NP-complete. We discuss the implications of this result.
| quant-ph | quantum manybody systems whose hamiltonians are nonstoquastic ie have positive offdiagonal matrix elements in a given basis are known to pose severe limitations on the efficiency of quantum monte carlo algorithms designed to simulate them due to the infamous sign problem we study the computational complexity associated with curing nonstoquastic hamiltonians ie transforming them into signproblemfree ones we prove that if such transformations are limited to singlequbit clifford group elements or general singlequbit orthogonal matrices finding the curing transformation is npcomplete we discuss the implications of this result | [['quantum', 'manybody', 'systems', 'whose', 'hamiltonians', 'are', 'nonstoquastic', 'ie', 'have', 'positive', 'offdiagonal', 'matrix', 'elements', 'in', 'a', 'given', 'basis', 'are', 'known', 'to', 'pose', 'severe', 'limitations', 'on', 'the', 'efficiency', 'of', 'quantum', 'monte', 'carlo', 'algorithms', 'designed', 'to', 'simulate', 'them', 'due', 'to', 'the', 'infamous', 'sign', 'problem', 'we', 'study', 'the', 'computational', 'complexity', 'associated', 'with', 'curing', 'nonstoquastic', 'hamiltonians', 'ie', 'transforming', 'them', 'into', 'signproblemfree', 'ones', 'we', 'prove', 'that', 'if', 'such', 'transformations', 'are', 'limited', 'to', 'singlequbit', 'clifford', 'group', 'elements', 'or', 'general', 'singlequbit', 'orthogonal', 'matrices', 'finding', 'the', 'curing', 'transformation', 'is', 'npcomplete', 'we', 'discuss', 'the', 'implications', 'of', 'this', 'result']] | [-0.14330001357699407, 0.1547315844482827, 0.0005032040326940743, 0.07097158238122409, -0.07491196935403753, -0.2228179681696929, 0.03094866109974894, 0.4149900776418773, -0.30944715309041465, -0.2821091524462893, 0.10957891109732869, -0.271889996688432, -0.17782272309572858, 0.18211966291313397, -0.08024381662306207, 0.12411726251329211, 0.10056925197766925, -0.008952694833913649, -0.16788808941650626, -0.28257277533306147, 0.28976539814770647, 0.011715413936392659, 0.2197057247394696, 0.00712790301556445, 0.0745295679979873, 0.014301584263607352, -0.0028961374032819135, -0.02522114226171239, -0.08679714911150685, 0.08927951314068526, 0.2915747258812189, 0.12975231801233764, 0.24197764215271242, -0.4670575470875271, -0.16806862634521993, 0.18746755694817033, 0.10497401012848555, 0.17253079775466837, -0.05363544561259914, -0.29592535142596305, 0.06372365708970888, -0.16322678700089455, -0.11998474196827208, -0.12260465676610527, -0.007634475205453451, -0.0489852326863911, -0.24073566719677977, 0.02989363986534954, 0.06075370907571844, 0.02683562532977455, 0.007769129646476358, -0.13982158521354326, 0.06341406530488959, 0.10810257006299005, 0.009183580443442968, -0.05295931369420776, 0.12547931669343432, -0.08483890984577803, -0.1710798215883022, 0.42621726356446743, 0.06567467539571226, -0.24410278357523071, 0.1805461904309182, -0.07749689443417909, -0.1536636402822544, 0.08574010793844619, 0.14044935884290186, 0.09475573966681788, -0.13011875896799294, 0.13758555028206584, 0.0009446294597265395, 0.12916778153951533, 0.0107016780000942, 0.05872389907348075, 0.12350394264583221, 0.06797825593226166, 0.07405168586741308, 0.1580377716163639, 0.04386778936366847, -0.14483926665376534, -0.23247745555867863, -0.1528251930245791, -0.2199546014360914, 0.10246616588185796, -0.077551668160595, -0.19189588968848428, 0.388750070060434, 0.18071187871762298, 0.13016513742464172, 0.07055049107293598, 0.27141286920629104, 0.14877462193412197, 0.08114917085252026, 0.07856494691540403, 0.1583712849982972, 0.17313687702302227, -0.033163273320745, -0.2879262197688645, 0.06234312923201783, 0.12745654117316008] |
1,802.03409 | Deflections of ultra-high energy cosmic rays by the Milky Way magnetic
field: how well can they be corrected? | Locating the sources of ultra-high energy cosmic rays (UHECRs) still remains
a difficult puzzle for modern astrophysics. A major hurdle in the search for
the sources is the fact that UHECRs are deflected by the Galactic magnetic
field (GMF). Current knowledge of the GMF is limited, as most experimental
measurements track line-of-sight--integrated quantities that are used to obtain
best-fit parameters for global models including a large random component. The
advent, however, of the Gaia era, with measurements of $\sim 10^9$ stellar
parallaxes, in combination with upcoming large polarimetric surveys, make, for
the first time, a 3D measurement of the GMF possible in principle. Such
measurements can then be used to attempt a reconstruction of the trajectories
of individual UHECRs through the Galaxy, in order to correct for their
deflection.
Motivated by these developments, in the present work, we study the limits of
such a correction, by examining how its effectiveness depends on the
uncertainty of any such future magnetic field measurements. To that end, we
simulate attempts to reconstruct the trajectory of the cosmic ray by using
hypothetical measurements of the GMF, based on values received from two
recently updated GMF models. To simulate the uncertainty of a 3D measurement,
random errors to these values are introduced separately for the
plane-of-the-sky (POS) magnitude, the line-of-sight (LOS) magnitude and the POS
direction.
Our results highlight the conditions under which an effective correction is
achievable. We find that the effectiveness is dependent on the particle
rigidity and arrival direction, and can vary significantly depending on the GMF
model used.
| astro-ph.HE | locating the sources of ultrahigh energy cosmic rays uhecrs still remains a difficult puzzle for modern astrophysics a major hurdle in the search for the sources is the fact that uhecrs are deflected by the galactic magnetic field gmf current knowledge of the gmf is limited as most experimental measurements track lineofsightintegrated quantities that are used to obtain bestfit parameters for global models including a large random component the advent however of the gaia era with measurements of sim 109 stellar parallaxes in combination with upcoming large polarimetric surveys make for the first time a 3d measurement of the gmf possible in principle such measurements can then be used to attempt a reconstruction of the trajectories of individual uhecrs through the galaxy in order to correct for their deflection motivated by these developments in the present work we study the limits of such a correction by examining how its effectiveness depends on the uncertainty of any such future magnetic field measurements to that end we simulate attempts to reconstruct the trajectory of the cosmic ray by using hypothetical measurements of the gmf based on values received from two recently updated gmf models to simulate the uncertainty of a 3d measurement random errors to these values are introduced separately for the planeofthesky pos magnitude the lineofsight los magnitude and the pos direction our results highlight the conditions under which an effective correction is achievable we find that the effectiveness is dependent on the particle rigidity and arrival direction and can vary significantly depending on the gmf model used | [['locating', 'the', 'sources', 'of', 'ultrahigh', 'energy', 'cosmic', 'rays', 'uhecrs', 'still', 'remains', 'a', 'difficult', 'puzzle', 'for', 'modern', 'astrophysics', 'a', 'major', 'hurdle', 'in', 'the', 'search', 'for', 'the', 'sources', 'is', 'the', 'fact', 'that', 'uhecrs', 'are', 'deflected', 'by', 'the', 'galactic', 'magnetic', 'field', 'gmf', 'current', 'knowledge', 'of', 'the', 'gmf', 'is', 'limited', 'as', 'most', 'experimental', 'measurements', 'track', 'lineofsightintegrated', 'quantities', 'that', 'are', 'used', 'to', 'obtain', 'bestfit', 'parameters', 'for', 'global', 'models', 'including', 'a', 'large', 'random', 'component', 'the', 'advent', 'however', 'of', 'the', 'gaia', 'era', 'with', 'measurements', 'of', 'sim', '109', 'stellar', 'parallaxes', 'in', 'combination', 'with', 'upcoming', 'large', 'polarimetric', 'surveys', 'make', 'for', 'the', 'first', 'time', 'a', '3d', 'measurement', 'of', 'the', 'gmf', 'possible', 'in', 'principle', 'such', 'measurements', 'can', 'then', 'be', 'used', 'to', 'attempt', 'a', 'reconstruction', 'of', 'the', 'trajectories', 'of', 'individual', 'uhecrs', 'through', 'the', 'galaxy', 'in', 'order', 'to', 'correct', 'for', 'their', 'deflection', 'motivated', 'by', 'these', 'developments', 'in', 'the', 'present', 'work', 'we', 'study', 'the', 'limits', 'of', 'such', 'a', 'correction', 'by', 'examining', 'how', 'its', 'effectiveness', 'depends', 'on', 'the', 'uncertainty', 'of', 'any', 'such', 'future', 'magnetic', 'field', 'measurements', 'to', 'that', 'end', 'we', 'simulate', 'attempts', 'to', 'reconstruct', 'the', 'trajectory', 'of', 'the', 'cosmic', 'ray', 'by', 'using', 'hypothetical', 'measurements', 'of', 'the', 'gmf', 'based', 'on', 'values', 'received', 'from', 'two', 'recently', 'updated', 'gmf', 'models', 'to', 'simulate', 'the', 'uncertainty', 'of', 'a', '3d', 'measurement', 'random', 'errors', 'to', 'these', 'values', 'are', 'introduced', 'separately', 'for', 'the', 'planeofthesky', 'pos', 'magnitude', 'the', 'lineofsight', 'los', 'magnitude', 'and', 'the', 'pos', 'direction', 'our', 'results', 'highlight', 'the', 'conditions', 'under', 'which', 'an', 'effective', 'correction', 'is', 'achievable', 'we', 'find', 'that', 'the', 'effectiveness', 'is', 'dependent', 'on', 'the', 'particle', 'rigidity', 'and', 'arrival', 'direction', 'and', 'can', 'vary', 'significantly', 'depending', 'on', 'the', 'gmf', 'model', 'used']] | [-0.0830292462617308, 0.13943829755186243, -0.04901263447209203, 0.08301816908351611, -0.10850647769166244, -0.03268956751708174, 0.015063235069646908, 0.38407691276370315, -0.2504426647906257, -0.37977348248932685, 0.07704282246913863, -0.27668719939902076, -0.06387976707173948, 0.2404420699954244, -0.02261097275732027, 0.05355410619574741, 0.07009136786291492, -0.0009963887168851215, -0.0575032195267795, -0.22508981244072856, 0.28550526646813523, 0.13525164444581605, 0.2634940804900907, 0.026372838626002704, 0.12008402215121805, -0.005939786263297719, -0.07622166300643585, 0.03371093836676664, -0.13784983212326551, 0.11980945727486869, 0.21544615989515137, 0.13792031969933305, 0.20664697678148514, -0.41805540503810334, -0.24154933015597635, 0.10337367315332813, 0.14304050564714998, 0.10848610452484309, -0.07029338543907215, -0.28824358177371323, 0.08142540045241731, -0.12716480308574774, -0.13002157324262953, -0.02879333645978477, -0.015484892047425092, 0.05857118406947848, -0.24555998958385317, 0.06598397819323054, -0.005232604197772162, 0.04018116705992725, -0.08553239129810208, -0.11326706691215804, 0.01960625925403292, 0.14590053018559956, 0.08501957054659215, 0.07904171855170716, 0.15964277555121953, -0.15448244852268544, -0.11952968715013412, 0.41127826127194567, -0.0855197238920482, -0.1673223571069684, 0.13566179819554236, -0.16340969418160967, -0.17897073134554375, 0.08811759901345795, 0.21403808091486098, 0.09723466003742942, -0.16535396020117332, 0.0598343047211074, 0.004443186333446647, 0.15974153760271292, 0.013622466958622681, -0.00199408446809457, 0.24335371226698044, 0.1260780146039906, 0.07522119125474092, 0.06213226182262588, -0.1988757099927625, -0.02828507848994377, -0.26593852906808024, -0.1109976569587161, -0.1798508033325561, 0.05916434993741859, -0.11519508612565232, -0.12001306466254391, 0.4091706504304966, 0.24273205640929518, 0.2019252930986113, 0.011416337258651765, 0.34359766736179154, 0.06577000555580526, 0.04599079721356247, 0.07097863793205761, 0.32440831583971885, 0.13700431976030814, 0.0832516605391902, -0.19156285328517697, 0.12825563975275145, 0.0011122095829705358] |
1,802.0341 | Generalized Eigenvectors of Isospectral Transformations,Spectral
Equivalence and Reconstruction of Original Networks | Isospectral transformations (IT) of matrices and networks allow for
compression of either object while keeping all the information about their
eigenvalues and eigenvectors.We analyze here what happens to generalized
eigenvectors under isospectral transformations and to what extent the initial
network can be reconstructed from its compressed image under IT. We also
generalize and essentially simplify the proof that eigenvectors are invariant
under isospectral transformations and generalize and clarify the notion of
spectral equivalence of networks.
| math.DS | isospectral transformations it of matrices and networks allow for compression of either object while keeping all the information about their eigenvalues and eigenvectorswe analyze here what happens to generalized eigenvectors under isospectral transformations and to what extent the initial network can be reconstructed from its compressed image under it we also generalize and essentially simplify the proof that eigenvectors are invariant under isospectral transformations and generalize and clarify the notion of spectral equivalence of networks | [['isospectral', 'transformations', 'it', 'of', 'matrices', 'and', 'networks', 'allow', 'for', 'compression', 'of', 'either', 'object', 'while', 'keeping', 'all', 'the', 'information', 'about', 'their', 'eigenvalues', 'and', 'eigenvectorswe', 'analyze', 'here', 'what', 'happens', 'to', 'generalized', 'eigenvectors', 'under', 'isospectral', 'transformations', 'and', 'to', 'what', 'extent', 'the', 'initial', 'network', 'can', 'be', 'reconstructed', 'from', 'its', 'compressed', 'image', 'under', 'it', 'we', 'also', 'generalize', 'and', 'essentially', 'simplify', 'the', 'proof', 'that', 'eigenvectors', 'are', 'invariant', 'under', 'isospectral', 'transformations', 'and', 'generalize', 'and', 'clarify', 'the', 'notion', 'of', 'spectral', 'equivalence', 'of', 'networks']] | [-0.05191669054329395, 0.1217808730623408, -0.10236819593135167, 0.11737371821466179, -0.08418445532663248, -0.16968258565316932, 0.027099973660566518, 0.4147078659687493, -0.3363564445108578, -0.27449976638387386, 0.15013606208880004, -0.2546620012537853, -0.19454987191695822, 0.12209609329599787, -0.11882474232540541, 0.09701919116353541, 0.10210382085721437, 0.0790507555404376, -0.16363684217936383, -0.2407685275114066, 0.3888172936197874, 0.04992461822945876, 0.2896659311372787, 0.042275249864434115, 0.0979156163363793, 0.007543134660384542, -0.0483181349605926, -0.04199160630594486, -0.10824223862368239, 0.11491143709753414, 0.2530568214259236, 0.1765702992577005, 0.14318962129638405, -0.4128189077349128, -0.1522592953028711, 0.16306360388753582, 0.1372044962591718, 0.09037545297886371, 0.04752449625851335, -0.33144275577285803, 0.13047510856523406, -0.0994207235808308, -0.10900681178916145, -0.13860968580293292, 0.00988528593065771, 0.004310769185493071, -0.22040719142485712, 0.04845632051669904, 0.1340816008128427, 0.02685679555430102, -0.057020688682756816, -0.05785286863258964, -0.02699790075987678, 0.14009900752303972, 0.03502792150184915, -0.04374521414000491, 0.1461407032581298, -0.09056370193138719, -0.058571193744806016, 0.4077584775718483, 0.027315697733413528, -0.28822375312950965, 0.1499552885699715, -0.08660746567152641, -0.15379384921460942, 0.08519471217123037, 0.14811657752363463, 0.08328267838805914, -0.12995749306739182, 0.08424595435861044, -0.06803524655264777, 0.10808194559570905, 0.17597842835066085, 0.08197734672953752, 0.12667035020107553, 0.02555033297756234, 0.09560265657617836, 0.15520057794354805, 0.01723657754828801, -0.10319079300766257, -0.2567199441805683, -0.11601371641547696, -0.18586461004530508, 0.08357780790459868, -0.10311538013322845, -0.12174841324245003, 0.44930676993838436, 0.19533081233778313, 0.21287977449419732, 0.09257080293310857, 0.2023054268085272, 0.05835171317920793, 0.10020035629576021, 0.08057985131351932, 0.19399206317659165, 0.2157288106973283, 0.08940015808125404, -0.15414412533298033, 0.022099149803555495, 0.08953991779315008] |
1,802.03411 | Charting generalized supersoft supersymmetry | Without any shred of evidence for new physics from LHC, the last hiding spots
of natural electroweak supersymmetry seem to lie either in compressed spectra
or in spectra where scalars are suppressed with respect to the gauginos. While
in the MSSM (or in any theory where supersymmetry is broken by the $F$-vev of a
chiral spurion), a hierarchy between scalar and gaugino masses requires special
constructions, it is automatic in scenarios where supersymmetry is broken by
$D$-vev of a real spurion. In the latter framework, gaugino mediated
contributions to scalar soft masses are finite (loop suppressed but not
$\log$-enhanced), a feature often referred to as "supersoftness". Though
phenomenologically attractive, pure supersoft models suffer from the
$\mu$-problem, potential color-breaking minima, large $T$-parameter, etc. These
problems can be overcome without sacrificing the model's virtues by departing
from pure supersoftness and including $\mu$-type operators that use the same
$D$-vev, a framework known as generalized supersoft supersymmetry. The main
purpose of this paper is to point out that the new operators also solve the
last remaining issue associated with supersoft spectra, namely that a right
handed (RH) slepton is predicted to be the lightest superpartner, rendering the
setup cosmologically unfeasible. In particular, we show that the
$\mu$-operators in generalized supersoft generate a new source for scalar
masses, which can raise the RH-slepton mass above bino due to corrections from
renormalisation group evolutions (RGEs). In fact, a mild tuning can open up the
bino--RH slepton coannihilation regime for a thermal dark matter. We derive the
full set of RGEs required to determine the spectrum at low energies. Beginning
with input conditions at a high scale, we show that completely viable spectra
can be achieved.
| hep-ph | without any shred of evidence for new physics from lhc the last hiding spots of natural electroweak supersymmetry seem to lie either in compressed spectra or in spectra where scalars are suppressed with respect to the gauginos while in the mssm or in any theory where supersymmetry is broken by the fvev of a chiral spurion a hierarchy between scalar and gaugino masses requires special constructions it is automatic in scenarios where supersymmetry is broken by dvev of a real spurion in the latter framework gaugino mediated contributions to scalar soft masses are finite loop suppressed but not logenhanced a feature often referred to as supersoftness though phenomenologically attractive pure supersoft models suffer from the muproblem potential colorbreaking minima large tparameter etc these problems can be overcome without sacrificing the models virtues by departing from pure supersoftness and including mutype operators that use the same dvev a framework known as generalized supersoft supersymmetry the main purpose of this paper is to point out that the new operators also solve the last remaining issue associated with supersoft spectra namely that a right handed rh slepton is predicted to be the lightest superpartner rendering the setup cosmologically unfeasible in particular we show that the muoperators in generalized supersoft generate a new source for scalar masses which can raise the rhslepton mass above bino due to corrections from renormalisation group evolutions rges in fact a mild tuning can open up the binorh slepton coannihilation regime for a thermal dark matter we derive the full set of rges required to determine the spectrum at low energies beginning with input conditions at a high scale we show that completely viable spectra can be achieved | [['without', 'any', 'shred', 'of', 'evidence', 'for', 'new', 'physics', 'from', 'lhc', 'the', 'last', 'hiding', 'spots', 'of', 'natural', 'electroweak', 'supersymmetry', 'seem', 'to', 'lie', 'either', 'in', 'compressed', 'spectra', 'or', 'in', 'spectra', 'where', 'scalars', 'are', 'suppressed', 'with', 'respect', 'to', 'the', 'gauginos', 'while', 'in', 'the', 'mssm', 'or', 'in', 'any', 'theory', 'where', 'supersymmetry', 'is', 'broken', 'by', 'the', 'fvev', 'of', 'a', 'chiral', 'spurion', 'a', 'hierarchy', 'between', 'scalar', 'and', 'gaugino', 'masses', 'requires', 'special', 'constructions', 'it', 'is', 'automatic', 'in', 'scenarios', 'where', 'supersymmetry', 'is', 'broken', 'by', 'dvev', 'of', 'a', 'real', 'spurion', 'in', 'the', 'latter', 'framework', 'gaugino', 'mediated', 'contributions', 'to', 'scalar', 'soft', 'masses', 'are', 'finite', 'loop', 'suppressed', 'but', 'not', 'logenhanced', 'a', 'feature', 'often', 'referred', 'to', 'as', 'supersoftness', 'though', 'phenomenologically', 'attractive', 'pure', 'supersoft', 'models', 'suffer', 'from', 'the', 'muproblem', 'potential', 'colorbreaking', 'minima', 'large', 'tparameter', 'etc', 'these', 'problems', 'can', 'be', 'overcome', 'without', 'sacrificing', 'the', 'models', 'virtues', 'by', 'departing', 'from', 'pure', 'supersoftness', 'and', 'including', 'mutype', 'operators', 'that', 'use', 'the', 'same', 'dvev', 'a', 'framework', 'known', 'as', 'generalized', 'supersoft', 'supersymmetry', 'the', 'main', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'point', 'out', 'that', 'the', 'new', 'operators', 'also', 'solve', 'the', 'last', 'remaining', 'issue', 'associated', 'with', 'supersoft', 'spectra', 'namely', 'that', 'a', 'right', 'handed', 'rh', 'slepton', 'is', 'predicted', 'to', 'be', 'the', 'lightest', 'superpartner', 'rendering', 'the', 'setup', 'cosmologically', 'unfeasible', 'in', 'particular', 'we', 'show', 'that', 'the', 'muoperators', 'in', 'generalized', 'supersoft', 'generate', 'a', 'new', 'source', 'for', 'scalar', 'masses', 'which', 'can', 'raise', 'the', 'rhslepton', 'mass', 'above', 'bino', 'due', 'to', 'corrections', 'from', 'renormalisation', 'group', 'evolutions', 'rges', 'in', 'fact', 'a', 'mild', 'tuning', 'can', 'open', 'up', 'the', 'binorh', 'slepton', 'coannihilation', 'regime', 'for', 'a', 'thermal', 'dark', 'matter', 'we', 'derive', 'the', 'full', 'set', 'of', 'rges', 'required', 'to', 'determine', 'the', 'spectrum', 'at', 'low', 'energies', 'beginning', 'with', 'input', 'conditions', 'at', 'a', 'high', 'scale', 'we', 'show', 'that', 'completely', 'viable', 'spectra', 'can', 'be', 'achieved']] | [-0.08073536786694258, 0.22829642041924073, -0.04918768053239846, 0.1594639812573115, -0.10992823845123524, -0.20497079174573304, 0.02485428956992269, 0.33558624331675635, -0.25025690124274635, -0.3181137927757122, 0.10607233120387782, -0.2464532748848923, -0.07235496490852628, 0.14877986291767994, -0.05627392767757969, 0.030742504403691043, 0.029029888100922108, -0.0003299787094741514, -0.09634007371095565, -0.23088657509086946, 0.3300478993607992, 0.017781639859701198, 0.1828537903446363, 0.078886458931675, 0.0576524807049828, -0.05547022603575017, 0.002207305488746354, -0.07229636672537965, -0.04928117900413155, 0.04469672301673286, 0.24184308957169195, 0.06474090918929286, 0.16954135077821275, -0.37254781817041693, -0.20737379167788414, 0.18314499626551914, 0.1850091056888002, 0.11562384207154737, -0.0750259429981773, -0.28162601439712137, 0.12317418285147474, -0.18939860730650307, -0.13238146494316694, -0.07311674931739891, -0.06543400577327489, -0.12641434970221418, -0.300369542139845, 0.09264754330738953, -0.019229835110815455, -0.014808550023946283, -0.03294193966530823, -0.10930731901540779, -0.08191763869897828, 0.03796144334033077, 0.1442701171976156, -0.027204338126839735, 0.12124645781802225, -0.19844735088658386, -0.11426975966248688, 0.44020245803499614, -0.08765370302898434, -0.14437438553479975, 0.16205632211113835, -0.11183243070135486, -0.18460567210094778, 0.14937376550734793, 0.14273252047857632, 0.11366486541371223, -0.16685921385979804, 0.18052614588623495, -0.024296051431140237, 0.18509782027146582, 0.08331687668092795, 0.041800159425389415, 0.2845183281268884, 0.13547364213408378, 0.06760444653718545, 0.08253268628797387, -0.008180941764440989, -0.0804133053268596, -0.3829528991535524, -0.07171665532036851, -0.11356410042181501, 0.05065897877522976, -0.06830170380978012, -0.12171892907757026, 0.3729390040851938, 0.1524377553659788, 0.23590250516433145, 0.04225273648679475, 0.29051382638575446, 0.10330580271941042, 0.1396183188999969, 0.054508958999476914, 0.2673348950185035, 0.09720911113323555, 0.1069390610493242, -0.2075611402810681, -0.035173254865375196, 0.05982451209109345] |
1,802.03412 | Multi-mode four-wave mixing with a spatially-structured pump | We demonstrate a new four-wave mixing (4WM) geometry based on structured
light. By utilizing near-field diffraction through a narrow slit, the pump beam
is asymmetrically structured to modify the phase matching condition, generating
multi-mode output in both the spatial and frequency domains. We show that the
frequency parameter enables selection of various spatial-mode outputs,
including a twin-beam geometry which preserves relative intensity squeezing
shared between the two beams. The results suggest that the engineering of
atomic states via structured light may provide a pathway to a diverse set of
quantum resources based on multi-mode squeezed light.
| quant-ph physics.optics | we demonstrate a new fourwave mixing 4wm geometry based on structured light by utilizing nearfield diffraction through a narrow slit the pump beam is asymmetrically structured to modify the phase matching condition generating multimode output in both the spatial and frequency domains we show that the frequency parameter enables selection of various spatialmode outputs including a twinbeam geometry which preserves relative intensity squeezing shared between the two beams the results suggest that the engineering of atomic states via structured light may provide a pathway to a diverse set of quantum resources based on multimode squeezed light | [['we', 'demonstrate', 'a', 'new', 'fourwave', 'mixing', '4wm', 'geometry', 'based', 'on', 'structured', 'light', 'by', 'utilizing', 'nearfield', 'diffraction', 'through', 'a', 'narrow', 'slit', 'the', 'pump', 'beam', 'is', 'asymmetrically', 'structured', 'to', 'modify', 'the', 'phase', 'matching', 'condition', 'generating', 'multimode', 'output', 'in', 'both', 'the', 'spatial', 'and', 'frequency', 'domains', 'we', 'show', 'that', 'the', 'frequency', 'parameter', 'enables', 'selection', 'of', 'various', 'spatialmode', 'outputs', 'including', 'a', 'twinbeam', 'geometry', 'which', 'preserves', 'relative', 'intensity', 'squeezing', 'shared', 'between', 'the', 'two', 'beams', 'the', 'results', 'suggest', 'that', 'the', 'engineering', 'of', 'atomic', 'states', 'via', 'structured', 'light', 'may', 'provide', 'a', 'pathway', 'to', 'a', 'diverse', 'set', 'of', 'quantum', 'resources', 'based', 'on', 'multimode', 'squeezed', 'light']] | [-0.12071172279441574, 0.20290813593601342, -0.09442508876842719, 0.009856701749716498, -0.0801716882463855, -0.16429962329614986, 0.08261228590708924, 0.4622991319823389, -0.27708250971045345, -0.2569204544124659, 0.02331460984108465, -0.20673110033385456, -0.13537580800281526, 0.2690206666108376, -0.04326585443535199, 0.08260363435753486, 0.07044353117574549, -0.09114777632657933, -0.029561017522307036, -0.1284357799074011, 0.3178334186450229, 0.019169737345994992, 0.3890688421282296, 0.03345320870478948, 0.14935963460447965, 0.06054055942513514, -0.015206828694014499, -0.06170116740880379, -0.05450060912653498, 0.14751525870027157, 0.20060359494527802, 0.11975284704506824, 0.2586979018766821, -0.417549830803182, -0.24744039214177369, 0.05249236930224773, 0.11621831944103178, 0.16149463943414352, -0.06699973211167769, -0.3121440342122999, -0.02835933954520442, -0.0763102092414556, -0.07670878543285653, -0.09219545597443357, -0.08951217508486782, 0.0522267509707793, -0.30758163222829654, 0.009678140636727525, 0.031911916800784944, 0.04079523074324243, 0.04059590653438742, -0.05375660098313043, -0.0486822532924028, 0.06654614294044829, -0.07774244091948883, -0.03658671482844511, 0.15164072702464182, -0.1250162258371764, -0.12386300331369664, 0.3558220402240598, -0.09117405519282329, -0.1906419579455966, 0.15521263285457584, -0.14397543918554825, -0.018639275930278625, 0.13418886567039104, 0.19995754578364236, 0.09014692313940031, -0.11850099541819266, -0.0007723335008146629, -0.055614009647494335, 0.2685293711183476, 0.1709073148231255, 0.151175394654274, 0.22707125291829774, 0.15985214928514324, 0.055134024480745815, 0.2210633488939493, -0.1432136994138394, -0.08934194403142708, -0.27767840824769036, -0.10647817758338836, -0.18031872966093943, 0.025627810779648524, -0.10870633553213338, -0.13806144695263356, 0.4385390387518176, 0.12061964074988889, 0.17870101421916237, -0.03939542333318968, 0.35097932334368426, 0.07849788512627735, 0.03782700874338237, 0.0232262468537859, 0.25519825343750807, 0.16664956763997907, 0.09595392039530755, -0.27032103002420627, 0.008883402023154, -0.024165985926326055] |
1,802.03413 | Small zeros of Dirichlet $L$-functions of quadratic characters of prime
modulus | In this paper, we investigate the distribution of the imaginary parts of
zeros near the real axis of Dirichlet $L$-functions associated to the quadratic
characters $\chi_{p}(\cdot)=(\cdot |p)$ with $p$ a prime number. Assuming the
Generalized Riemann Hypothesis (GRH), we compute the one-level density for the
zeros of this family of $L$-functions under the condition that the Fourier
transform of the test function is supported on a closed subinterval of
$(-1,1)$. We also write down the ratios conjecture for this family of
$L$-functions a la Conrey, Farmer and Zirnbauer and derive a conjecture for the
one-level density which is consistent with the main theorem of this paper and
with the Katz-Sarnak prediction and includes lower order terms. Following the
methods of \"Ozl\"uk and Snyder, we prove that GRH implies
$L(\frac{1}{2},\chi_p)\neq 0$ for at least $75\%$ of the primes.
| math.NT | in this paper we investigate the distribution of the imaginary parts of zeros near the real axis of dirichlet lfunctions associated to the quadratic characters chi_pcdotcdot p with p a prime number assuming the generalized riemann hypothesis grh we compute the onelevel density for the zeros of this family of lfunctions under the condition that the fourier transform of the test function is supported on a closed subinterval of 11 we also write down the ratios conjecture for this family of lfunctions a la conrey farmer and zirnbauer and derive a conjecture for the onelevel density which is consistent with the main theorem of this paper and with the katzsarnak prediction and includes lower order terms following the methods of ozluk and snyder we prove that grh implies lfrac12chi_pneq 0 for at least 75 of the primes | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'distribution', 'of', 'the', 'imaginary', 'parts', 'of', 'zeros', 'near', 'the', 'real', 'axis', 'of', 'dirichlet', 'lfunctions', 'associated', 'to', 'the', 'quadratic', 'characters', 'chi_pcdotcdot', 'p', 'with', 'p', 'a', 'prime', 'number', 'assuming', 'the', 'generalized', 'riemann', 'hypothesis', 'grh', 'we', 'compute', 'the', 'onelevel', 'density', 'for', 'the', 'zeros', 'of', 'this', 'family', 'of', 'lfunctions', 'under', 'the', 'condition', 'that', 'the', 'fourier', 'transform', 'of', 'the', 'test', 'function', 'is', 'supported', 'on', 'a', 'closed', 'subinterval', 'of', '11', 'we', 'also', 'write', 'down', 'the', 'ratios', 'conjecture', 'for', 'this', 'family', 'of', 'lfunctions', 'a', 'la', 'conrey', 'farmer', 'and', 'zirnbauer', 'and', 'derive', 'a', 'conjecture', 'for', 'the', 'onelevel', 'density', 'which', 'is', 'consistent', 'with', 'the', 'main', 'theorem', 'of', 'this', 'paper', 'and', 'with', 'the', 'katzsarnak', 'prediction', 'and', 'includes', 'lower', 'order', 'terms', 'following', 'the', 'methods', 'of', 'ozluk', 'and', 'snyder', 'we', 'prove', 'that', 'grh', 'implies', 'lfrac12chi_pneq', '0', 'for', 'at', 'least', '75', 'of', 'the', 'primes']] | [-0.19435945675889058, 0.0347666032485266, -0.13463965175610815, 0.08450673992307718, -0.03257740617715823, -0.08692445800771742, 0.04854060648836251, 0.24318293814543884, -0.2251389739294745, -0.2675279284090693, 0.07903540890521384, -0.2428076083097718, -0.12930901907036887, 0.18421056419923734, -0.05709568696242493, 0.06653751963367269, 0.00092468411599133, 0.06789734058860522, -0.10858036160517706, -0.2992251280750801, 0.36580083964031135, -0.008660389643002635, 0.22782413305631324, 0.07596151417585215, 0.07215733721212887, 0.027990316583361447, 0.02527756885792226, -0.09364428221067386, -0.14697974918242074, 0.15829856190204955, 0.22289440235289842, 0.07282753230711973, 0.26276885045330917, -0.3717750989720781, -0.12103557471297126, 0.17035614748471486, 0.11394845045852794, -0.004630004688263384, 0.011695458561550381, -0.23685033408118716, 0.1563002383449365, -0.13905173942139162, -0.2195710713989032, -0.02327856353749938, 0.03861385934166054, 0.048212660079536986, -0.323624820069674, 0.09388021307927034, 0.1030301440528024, 0.10289577253287964, -0.10435906084907699, -0.20375245337291106, 0.03510031866868819, 0.025210592688109948, 0.09893647457278375, 0.03210740815848112, 0.03759333277607698, -0.08336227635658387, -0.07781673370471308, 0.3307582126372605, -0.08435824351322685, -0.18324053457090214, 0.10646151072943388, -0.21275254567640264, -0.20438139258063773, 0.09369947200418631, 0.11794879888497126, 0.14946367365739016, -0.04417052326911588, 0.16134886459383155, -0.1370090968896454, 0.11082802133273277, 0.1484942543459361, -0.07108179736298634, 0.18661298895074027, 0.02952877399789642, 0.043778760310040035, 0.16657247441932002, -0.09643413042936322, -0.045143505641773565, -0.3512047390634222, -0.24192307149268574, -0.19925741478105757, 0.07515760734173428, -0.09329556123257542, -0.19675535222154056, 0.40454969677462504, 0.13217682547436388, 0.18421644504301932, 0.20044964455405195, 0.21098183491267264, 0.17690604802832674, 0.03469636438609059, 0.08474695573407989, 0.11548578509115684, 0.18748481247275234, 0.0008689495491614538, -0.18037100259298042, 0.026728408414620295, 0.11564735846190866] |
1,802.03414 | Co-formation of the Galactic disc and the stellar halo | Using a large sample of Main Sequence stars with 7-D measurements supplied by
Gaia and SDSS, we study the kinematic properties of the local (within ~10 kpc
from the Sun) stellar halo. We demonstrate that the halo's velocity ellipsoid
evolves strongly with metallicity. At the low [Fe/H] end, the orbital
anisotropy (the amount of motion in the radial direction compared to the
tangential one) is mildly radial with 0.2<beta<0.4. However, for stars with
[Fe/H]>-1.7 we measure extreme values of beta~0.9. Across the metallicity range
considered, i.e. -3<[Fe/H]<-1, the stellar halo's spin is minimal, at the level
of 20<v_theta (km/s) <30. Using a suite of cosmological zoom-in simulations of
halo formation, we deduce that the observed acute anisotropy is inconsistent
with the continuous accretion of dwarf satellites. Instead, we argue, the
stellar debris in the inner halo were deposited in a major accretion event by a
satellite with Mvir>10^10 Msun around the epoch of the Galactic disc formation,
i.e. between 8 and 11 Gyr ago. The radical halo anisotropy is the result of the
dramatic radialisation of the massive progenitor's orbit, amplified by the
action of the growing disc.
| astro-ph.GA | using a large sample of main sequence stars with 7d measurements supplied by gaia and sdss we study the kinematic properties of the local within 10 kpc from the sun stellar halo we demonstrate that the halos velocity ellipsoid evolves strongly with metallicity at the low feh end the orbital anisotropy the amount of motion in the radial direction compared to the tangential one is mildly radial with 02beta04 however for stars with feh17 we measure extreme values of beta09 across the metallicity range considered ie 3feh1 the stellar halos spin is minimal at the level of 20v_theta kms 30 using a suite of cosmological zoomin simulations of halo formation we deduce that the observed acute anisotropy is inconsistent with the continuous accretion of dwarf satellites instead we argue the stellar debris in the inner halo were deposited in a major accretion event by a satellite with mvir1010 msun around the epoch of the galactic disc formation ie between 8 and 11 gyr ago the radical halo anisotropy is the result of the dramatic radialisation of the massive progenitors orbit amplified by the action of the growing disc | [['using', 'a', 'large', 'sample', 'of', 'main', 'sequence', 'stars', 'with', '7d', 'measurements', 'supplied', 'by', 'gaia', 'and', 'sdss', 'we', 'study', 'the', 'kinematic', 'properties', 'of', 'the', 'local', 'within', '10', 'kpc', 'from', 'the', 'sun', 'stellar', 'halo', 'we', 'demonstrate', 'that', 'the', 'halos', 'velocity', 'ellipsoid', 'evolves', 'strongly', 'with', 'metallicity', 'at', 'the', 'low', 'feh', 'end', 'the', 'orbital', 'anisotropy', 'the', 'amount', 'of', 'motion', 'in', 'the', 'radial', 'direction', 'compared', 'to', 'the', 'tangential', 'one', 'is', 'mildly', 'radial', 'with', '02beta04', 'however', 'for', 'stars', 'with', 'feh17', 'we', 'measure', 'extreme', 'values', 'of', 'beta09', 'across', 'the', 'metallicity', 'range', 'considered', 'ie', '3feh1', 'the', 'stellar', 'halos', 'spin', 'is', 'minimal', 'at', 'the', 'level', 'of', '20v_theta', 'kms', '30', 'using', 'a', 'suite', 'of', 'cosmological', 'zoomin', 'simulations', 'of', 'halo', 'formation', 'we', 'deduce', 'that', 'the', 'observed', 'acute', 'anisotropy', 'is', 'inconsistent', 'with', 'the', 'continuous', 'accretion', 'of', 'dwarf', 'satellites', 'instead', 'we', 'argue', 'the', 'stellar', 'debris', 'in', 'the', 'inner', 'halo', 'were', 'deposited', 'in', 'a', 'major', 'accretion', 'event', 'by', 'a', 'satellite', 'with', 'mvir1010', 'msun', 'around', 'the', 'epoch', 'of', 'the', 'galactic', 'disc', 'formation', 'ie', 'between', '8', 'and', '11', 'gyr', 'ago', 'the', 'radical', 'halo', 'anisotropy', 'is', 'the', 'result', 'of', 'the', 'dramatic', 'radialisation', 'of', 'the', 'massive', 'progenitors', 'orbit', 'amplified', 'by', 'the', 'action', 'of', 'the', 'growing', 'disc']] | [-0.09425868033151565, 0.1433347541701476, -0.06393960613194062, 0.06262360926707342, -0.0835032110188991, 0.014084235337547591, 0.001731813738321061, 0.3933831189586997, -0.17879254148021095, -0.38512558016742837, 0.027680329930118687, -0.28229442051016407, 0.01073791053593973, 0.19429456417657476, -0.035839041282773994, -0.014976221635410323, 0.0873613528540877, -0.052694236030140534, -0.0777481442643075, -0.2804040830490775, 0.33871086086324653, 0.05530388466759376, 0.110892818945516, -0.079850641177214, 0.09656528780450586, -0.08432220280026671, -0.05289355492667178, -0.0295010813315656, -0.20256320443145914, 0.029320416805370012, 0.1917932639311989, 0.10335537385961417, 0.24307639138579695, -0.3546434597573367, -0.18946222938429258, 0.034684972748506425, 0.1944589986226679, 0.06887632655178622, -0.11148301536383366, -0.25029367768801136, 0.10193145969791002, -0.21218241325673734, -0.2083684087965047, 0.1146435095709774, 0.03977966428317048, 0.026596355855673593, -0.207144660571758, 0.19340177333743255, 0.05211119000581119, 0.12402744769357918, -0.11014563963580572, -0.07534026360403889, -0.1323418574715593, 0.04330835532196008, 0.07163859767930918, 0.0822713699039451, 0.21523990600542903, -0.11310553799581821, 0.010454664205307843, 0.42067056063236924, -0.10036497276309828, -0.017825145044114664, 0.21078468101160203, -0.2667500211964132, -0.13058866164010893, 0.09725829199862367, 0.1499484328227372, 0.10918717906120758, -0.1292187179657605, 0.03833150798458061, -0.02406754251951199, 0.21156692755271178, 0.07411842296648098, -0.01177626931938073, 0.34791461503530136, 0.12045376938691393, 0.08224040068065126, 0.04899812006783453, -0.23189806476581454, -0.05684719758208134, -0.2024584651951388, -0.10217483177312899, -0.13625420182256304, 0.08067838211487877, -0.19229993771470935, -0.11490963881102498, 0.35739457552687676, 0.1170334457719598, 0.25653958937428034, 0.05640082826180755, 0.3066052650839416, 0.07306317883464787, 0.11449681234621072, 0.1359468908430856, 0.3024836867701649, 0.18547285400086738, 0.06408910224623876, -0.2660466277885347, 0.07301130697456866, -9.576296382914475e-06] |
1,802.03415 | Colored ray configurations | We study the cyclic color sequences induced at infinity by colored rays with
apices being a given balanced finite bichromatic point set. We first study the
case in which the rays are required to be pairwise disjoint. We derive a lower
bound on the number of color sequences that can be realized from any such fixed
point set and examine color sequences that can be realized regardless of the
point set, exhibiting negative examples as well. We also provide a tight upper
bound on the number of configurations that can be realized from a point set,
and point sets for which there are asymptotically less configurations than that
number. In addition, we provide algorithms to decide whether a color sequence
is realizable from a given point set in a line or in general position. We
address afterwards the variant of the problem where the rays are allowed to
intersect. We prove that for some configurations and point sets, the number of
ray crossings must be $\Theta(n^2)$ and study then configurations that can be
realized by rays that pairwise cross. We show that there are point sets for
which the number of configurations that can be realized by pairwise-crossing
rays is asymptotically smaller than the number of configurations realizable by
pairwise-disjoint rays. We provide also point sets from which any configuration
can be realized by pairwise-crossing rays and show that there is no
configuration that can be realized by pairwise-crossing rays from every point
set.
| cs.CG | we study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set we first study the case in which the rays are required to be pairwise disjoint we derive a lower bound on the number of color sequences that can be realized from any such fixed point set and examine color sequences that can be realized regardless of the point set exhibiting negative examples as well we also provide a tight upper bound on the number of configurations that can be realized from a point set and point sets for which there are asymptotically less configurations than that number in addition we provide algorithms to decide whether a color sequence is realizable from a given point set in a line or in general position we address afterwards the variant of the problem where the rays are allowed to intersect we prove that for some configurations and point sets the number of ray crossings must be thetan2 and study then configurations that can be realized by rays that pairwise cross we show that there are point sets for which the number of configurations that can be realized by pairwisecrossing rays is asymptotically smaller than the number of configurations realizable by pairwisedisjoint rays we provide also point sets from which any configuration can be realized by pairwisecrossing rays and show that there is no configuration that can be realized by pairwisecrossing rays from every point set | [['we', 'study', 'the', 'cyclic', 'color', 'sequences', 'induced', 'at', 'infinity', 'by', 'colored', 'rays', 'with', 'apices', 'being', 'a', 'given', 'balanced', 'finite', 'bichromatic', 'point', 'set', 'we', 'first', 'study', 'the', 'case', 'in', 'which', 'the', 'rays', 'are', 'required', 'to', 'be', 'pairwise', 'disjoint', 'we', 'derive', 'a', 'lower', 'bound', 'on', 'the', 'number', 'of', 'color', 'sequences', 'that', 'can', 'be', 'realized', 'from', 'any', 'such', 'fixed', 'point', 'set', 'and', 'examine', 'color', 'sequences', 'that', 'can', 'be', 'realized', 'regardless', 'of', 'the', 'point', 'set', 'exhibiting', 'negative', 'examples', 'as', 'well', 'we', 'also', 'provide', 'a', 'tight', 'upper', 'bound', 'on', 'the', 'number', 'of', 'configurations', 'that', 'can', 'be', 'realized', 'from', 'a', 'point', 'set', 'and', 'point', 'sets', 'for', 'which', 'there', 'are', 'asymptotically', 'less', 'configurations', 'than', 'that', 'number', 'in', 'addition', 'we', 'provide', 'algorithms', 'to', 'decide', 'whether', 'a', 'color', 'sequence', 'is', 'realizable', 'from', 'a', 'given', 'point', 'set', 'in', 'a', 'line', 'or', 'in', 'general', 'position', 'we', 'address', 'afterwards', 'the', 'variant', 'of', 'the', 'problem', 'where', 'the', 'rays', 'are', 'allowed', 'to', 'intersect', 'we', 'prove', 'that', 'for', 'some', 'configurations', 'and', 'point', 'sets', 'the', 'number', 'of', 'ray', 'crossings', 'must', 'be', 'thetan2', 'and', 'study', 'then', 'configurations', 'that', 'can', 'be', 'realized', 'by', 'rays', 'that', 'pairwise', 'cross', 'we', 'show', 'that', 'there', 'are', 'point', 'sets', 'for', 'which', 'the', 'number', 'of', 'configurations', 'that', 'can', 'be', 'realized', 'by', 'pairwisecrossing', 'rays', 'is', 'asymptotically', 'smaller', 'than', 'the', 'number', 'of', 'configurations', 'realizable', 'by', 'pairwisedisjoint', 'rays', 'we', 'provide', 'also', 'point', 'sets', 'from', 'which', 'any', 'configuration', 'can', 'be', 'realized', 'by', 'pairwisecrossing', 'rays', 'and', 'show', 'that', 'there', 'is', 'no', 'configuration', 'that', 'can', 'be', 'realized', 'by', 'pairwisecrossing', 'rays', 'from', 'every', 'point', 'set']] | [-0.12305380421934924, 0.19501707441799465, -0.0655330561452591, 0.07332568425164161, -0.01679068628496292, -0.11709391315024896, 0.07863399302195681, 0.4239291616478843, -0.2694961412487262, -0.293740556976132, 0.08902495158750365, -0.27427824698846603, -0.13595431023129437, 0.23629458598815453, -0.058471873049532656, -0.01757268036561102, 0.08563700854992036, 0.06210825826004663, -0.013298245646883963, -0.26418759583468837, 0.34016221221803583, -0.0038789565604348043, 0.20503025312648446, 0.03658486111089587, 0.07933060466202137, -0.014174157904354154, 0.04121570459344676, 0.11046086193528026, -0.11652735475536992, 0.0726360957196448, 0.23705262638491076, 0.1664142010907154, 0.1874416908096583, -0.40021379782995264, -0.19211787415895473, 0.22917861155554897, 0.14091642647332772, 0.10555851038499567, -0.050378578073787886, -0.2414413303982268, 0.18382210010609237, -0.09866646309259164, -0.1376837163774266, -0.04975889998365988, -0.015248424900298724, 0.04608016391380186, -0.26832639275225584, -0.06049643556771563, 0.05285279698274862, 0.048440610105243365, -0.009913921919670414, -0.10589778458496334, -0.029509904066322097, 0.10581029309570546, 0.013470216788786661, 0.06670192517359268, 0.08435016466265537, -0.08147346329890558, -0.13087718392775746, 0.3865266681541918, -0.02707606625848652, -0.23256984658417154, 0.17696692609728207, -0.13500029459500495, -0.11887026863596326, 0.1457736262685207, 0.14235104854432407, 0.11449578840316074, -0.13262968905819733, 0.10154468298257047, -0.10296455390949841, 0.1490062130665212, 0.1445578838370313, 0.019389673718966955, 0.2522562363902565, 0.09089903512131804, 0.1485008974712281, 0.1555422974142559, -0.07452229152960306, -0.03644067184335445, -0.3443743711314546, -0.11012377930455841, -0.22029779782446224, 0.08036522752391632, -0.0922550943554985, -0.1572033208565878, 0.3441531008078915, 0.12140855562995326, 0.2591248617515151, 0.02847605827837022, 0.23645849708376115, 0.12715812592247605, 0.028060939017450437, 0.1325485676385798, 0.2017036250437711, 0.026560337261724302, -0.05315000648213337, -0.12947030961189082, 0.03481514212774632, 0.10040105239595057] |
1,802.03416 | Global stability of a distributed delayed viral model with general
incidence rate | In this paper, we discussed an infinitely distributed delayed viral infection
model with nonlinear immune response and general incidence rate. We proved the
existence and uniqueness of the equilibria. By using the Lyapunov functional
and LaSalle invariance principle, we obtained the conditions of global
stabilities of the infection-free equilibrium, the immune-exhausted equilibrium
and the endemic equilibrium. Numerical simulations are given to verify the
analytical results.
| math.DS | in this paper we discussed an infinitely distributed delayed viral infection model with nonlinear immune response and general incidence rate we proved the existence and uniqueness of the equilibria by using the lyapunov functional and lasalle invariance principle we obtained the conditions of global stabilities of the infectionfree equilibrium the immuneexhausted equilibrium and the endemic equilibrium numerical simulations are given to verify the analytical results | [['in', 'this', 'paper', 'we', 'discussed', 'an', 'infinitely', 'distributed', 'delayed', 'viral', 'infection', 'model', 'with', 'nonlinear', 'immune', 'response', 'and', 'general', 'incidence', 'rate', 'we', 'proved', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'equilibria', 'by', 'using', 'the', 'lyapunov', 'functional', 'and', 'lasalle', 'invariance', 'principle', 'we', 'obtained', 'the', 'conditions', 'of', 'global', 'stabilities', 'of', 'the', 'infectionfree', 'equilibrium', 'the', 'immuneexhausted', 'equilibrium', 'and', 'the', 'endemic', 'equilibrium', 'numerical', 'simulations', 'are', 'given', 'to', 'verify', 'the', 'analytical', 'results']] | [-0.16311612325080205, 0.06243918153109007, -0.10890080334502272, 0.082008146253429, 0.03272173327059136, -0.13663014648773242, 0.06209615449370176, 0.3110181159863714, -0.2848280750331469, -0.19874277344206348, 0.15931858661679144, -0.2502114628587151, -0.21995482430793345, 0.11030540479623596, -0.04346522208652459, 0.14049268637609202, 0.04599989788403036, -0.002365617692703381, -0.0005039451571065001, -0.2446057836205, 0.3188136650733213, 0.06715586992504541, 0.2809040153533715, 0.04395708426454803, 0.10850838456099154, 0.009857377721345983, -0.0047673603403382, 0.06459145876578987, -0.25535926136217313, 0.08597708395973314, 0.25712939265577006, 0.1426509234297555, 0.2872716609854251, -0.4562731525511481, -0.17580950960109476, 0.12579308162094094, 0.08978462903178297, 0.1430833282356616, -0.0709832128486596, -0.29123650171095505, 0.1239929100847803, -0.1547647943807533, -0.253147156421619, -0.09838147195114288, -0.03305609954986721, 0.11127486165787559, -0.305414931710402, 0.1254831454862142, 0.05354341368365567, 0.10621640335739357, -0.17251624583877856, -0.05584523895049642, -0.09583148793899454, 0.12033113146208052, 0.0944744473654282, -0.1043052029053797, 0.1177405353737413, -0.08823594233763288, -0.11597810003149789, 0.3059114495990798, -0.05967792337469291, -0.19951653759926558, 0.2144174440181814, -0.10403961579140741, -0.1028904818740557, 0.1330855007036007, 0.11110611908952706, 0.14477320955484174, -0.16754476504866034, 0.037014777790318476, -0.057764393102843314, 0.12553123428369872, 0.07757720174413407, -0.026420397206493362, 0.11264361493522301, 0.1397207422851352, 0.10939028603752377, 0.14057129010689096, -0.0169456535450081, -0.1934847656521015, -0.3166454270540271, -0.09357938464017934, -0.11447327550558839, 0.10179195395176066, -0.10671675883259013, -0.14586075916304253, 0.399333106353879, 0.14778638610732742, 0.08135756107367342, 0.12901266564585967, 0.22504430086701177, 0.14954886496707331, -0.10474661158514209, 0.08109078535926528, 0.28474482995807193, 0.16868956798134604, 0.10469234474294353, -0.29624042274372187, 0.11024163797992514, 0.08153776782637578] |
1,802.03417 | Narrow Artificial Intelligence with Machine Learning for Real-Time
Estimation of a Mobile Agents Location Using Hidden Markov Models | We propose to use a supervised machine learning technique to track the
location of a mobile agent in real time. Hidden Markov Models are used to build
artificial intelligence that estimates the unknown position of a mobile target
moving in a defined environment. This narrow artificial intelligence performs
two distinct tasks. First, it provides real-time estimation of the mobile
agent's position using the forward algorithm. Second, it uses the Baum-Welch
algorithm as a statistical learning tool to gain knowledge of the mobile
target. Finally, an experimental environment is proposed, namely a video game
that we use to test our artificial intelligence. We present statistical and
graphical results to illustrate the efficiency of our method.
| cs.AI | we propose to use a supervised machine learning technique to track the location of a mobile agent in real time hidden markov models are used to build artificial intelligence that estimates the unknown position of a mobile target moving in a defined environment this narrow artificial intelligence performs two distinct tasks first it provides realtime estimation of the mobile agents position using the forward algorithm second it uses the baumwelch algorithm as a statistical learning tool to gain knowledge of the mobile target finally an experimental environment is proposed namely a video game that we use to test our artificial intelligence we present statistical and graphical results to illustrate the efficiency of our method | [['we', 'propose', 'to', 'use', 'a', 'supervised', 'machine', 'learning', 'technique', 'to', 'track', 'the', 'location', 'of', 'a', 'mobile', 'agent', 'in', 'real', 'time', 'hidden', 'markov', 'models', 'are', 'used', 'to', 'build', 'artificial', 'intelligence', 'that', 'estimates', 'the', 'unknown', 'position', 'of', 'a', 'mobile', 'target', 'moving', 'in', 'a', 'defined', 'environment', 'this', 'narrow', 'artificial', 'intelligence', 'performs', 'two', 'distinct', 'tasks', 'first', 'it', 'provides', 'realtime', 'estimation', 'of', 'the', 'mobile', 'agents', 'position', 'using', 'the', 'forward', 'algorithm', 'second', 'it', 'uses', 'the', 'baumwelch', 'algorithm', 'as', 'a', 'statistical', 'learning', 'tool', 'to', 'gain', 'knowledge', 'of', 'the', 'mobile', 'target', 'finally', 'an', 'experimental', 'environment', 'is', 'proposed', 'namely', 'a', 'video', 'game', 'that', 'we', 'use', 'to', 'test', 'our', 'artificial', 'intelligence', 'we', 'present', 'statistical', 'and', 'graphical', 'results', 'to', 'illustrate', 'the', 'efficiency', 'of', 'our', 'method']] | [-0.07220549889219303, 0.01020322499192716, -0.12484620104690916, 0.0630665968443888, -0.1401267426921741, -0.2045144419872055, 0.07221870025769979, 0.4640992119695926, -0.2719882016413306, -0.3637439533251158, 0.04717179251581496, -0.2288088263788571, -0.19859264139086008, 0.16773190819290712, -0.1262041645618809, 0.09594264936943848, 0.07936311221534484, 0.09823341089660269, 0.010803864029105426, -0.2712096759003767, 0.25762834381965694, 0.04413961117940122, 0.3150093451779532, -0.022891150256455467, 0.15257375166146903, 0.02377385694509078, -0.01947513843371876, -0.03031308020121957, -0.0648106590222022, 0.2096623214893043, 0.30921262309809544, 0.24685743925766201, 0.37741502114620645, -0.39723623663252383, -0.19714311348568453, 0.10039985558557275, 0.13524305521053048, 0.11401747520849631, -0.07138603093233287, -0.35437700388495597, 0.08080987997655348, -0.17399775248282312, -0.09692898427806142, -0.09921723880331244, -0.03495126822146408, 0.00510612709739801, -0.29029575184502293, -0.04120145835341853, 0.03684316561639048, 0.0726088951178418, -0.05653182210466057, -0.08395461158177472, 0.06666613926114351, 0.2007719782556881, 0.0027660416140988992, 0.03168111750774347, 0.19814395505461124, -0.1331787691476979, -0.2066279411266901, 0.34531567055372553, -0.05677501367366252, -0.22099667861077346, 0.2256136564211103, -0.00111408312723302, -0.161374545876721, 0.08141079503765102, 0.2758885492170393, 0.13092102964915203, -0.17593930243400105, 0.01697377146481079, -0.043016024742667615, 0.1934334465237171, -0.03414219902142098, -0.05496909419532146, 0.16234346654004694, 0.27175009858451393, 0.07991052126070779, 0.13270904895187796, -0.15486577148304173, -0.12645094276389532, -0.23639742335664077, -0.14885278446844927, -0.23395524420693778, -0.02512254217933667, -0.08666485190999658, -0.15609865669945353, 0.3577377356082332, 0.27326983688889367, 0.17150773097385177, 0.08032809373342611, 0.39285690796545203, 0.055099346296118346, 0.026753427771230538, 0.10116945125424025, 0.1669357086025309, 0.044395442651748135, 0.18658329684311817, -0.1881049117137241, 0.07919738368997187, 0.040681029018423145] |
1,802.03418 | Predicting University Students' Academic Success and Major using Random
Forests | In this article, a large data set containing every course taken by every
undergraduate student in a major university in Canada over 10 years is
analysed. Modern machine learning algorithms can use large data sets to build
useful tools for the data provider, in this case, the university. In this
article, two classifiers are constructed using random forests. To begin, the
first two semesters of courses completed by a student are used to predict if
they will obtain an undergraduate degree. Secondly, for the students that
completed a program, their major is predicted using once again the first few
courses they have registered to. A classification tree is an intuitive and
powerful classifier and building a random forest of trees improves this
classifier. Random forests also allow for reliable variable importance
measurements. These measures explain what variables are useful to the
classifiers and can be used to better understand what is statistically related
to the students' situation. The results are two accurate classifiers and a
variable importance analysis that provides useful information to university
administrations.
| stat.ML cs.LG | in this article a large data set containing every course taken by every undergraduate student in a major university in canada over 10 years is analysed modern machine learning algorithms can use large data sets to build useful tools for the data provider in this case the university in this article two classifiers are constructed using random forests to begin the first two semesters of courses completed by a student are used to predict if they will obtain an undergraduate degree secondly for the students that completed a program their major is predicted using once again the first few courses they have registered to a classification tree is an intuitive and powerful classifier and building a random forest of trees improves this classifier random forests also allow for reliable variable importance measurements these measures explain what variables are useful to the classifiers and can be used to better understand what is statistically related to the students situation the results are two accurate classifiers and a variable importance analysis that provides useful information to university administrations | [['in', 'this', 'article', 'a', 'large', 'data', 'set', 'containing', 'every', 'course', 'taken', 'by', 'every', 'undergraduate', 'student', 'in', 'a', 'major', 'university', 'in', 'canada', 'over', '10', 'years', 'is', 'analysed', 'modern', 'machine', 'learning', 'algorithms', 'can', 'use', 'large', 'data', 'sets', 'to', 'build', 'useful', 'tools', 'for', 'the', 'data', 'provider', 'in', 'this', 'case', 'the', 'university', 'in', 'this', 'article', 'two', 'classifiers', 'are', 'constructed', 'using', 'random', 'forests', 'to', 'begin', 'the', 'first', 'two', 'semesters', 'of', 'courses', 'completed', 'by', 'a', 'student', 'are', 'used', 'to', 'predict', 'if', 'they', 'will', 'obtain', 'an', 'undergraduate', 'degree', 'secondly', 'for', 'the', 'students', 'that', 'completed', 'a', 'program', 'their', 'major', 'is', 'predicted', 'using', 'once', 'again', 'the', 'first', 'few', 'courses', 'they', 'have', 'registered', 'to', 'a', 'classification', 'tree', 'is', 'an', 'intuitive', 'and', 'powerful', 'classifier', 'and', 'building', 'a', 'random', 'forest', 'of', 'trees', 'improves', 'this', 'classifier', 'random', 'forests', 'also', 'allow', 'for', 'reliable', 'variable', 'importance', 'measurements', 'these', 'measures', 'explain', 'what', 'variables', 'are', 'useful', 'to', 'the', 'classifiers', 'and', 'can', 'be', 'used', 'to', 'better', 'understand', 'what', 'is', 'statistically', 'related', 'to', 'the', 'students', 'situation', 'the', 'results', 'are', 'two', 'accurate', 'classifiers', 'and', 'a', 'variable', 'importance', 'analysis', 'that', 'provides', 'useful', 'information', 'to', 'university', 'administrations']] | [-0.009115788524172136, 0.09787558664052215, -0.13396386097850543, 0.13019855790904591, -0.12126038066843259, -0.16828066478882517, 0.06562604414033038, 0.4049100967390197, -0.24337189032563142, -0.3277874691065933, 0.1103518787259236, -0.29760762343449254, -0.13772178183176687, 0.22552524653712422, -0.11614977887698583, 0.040652625768312384, 0.1358596863171884, 0.05034689143699195, -0.02111499507445842, -0.3834657986036369, 0.2867936599879925, 0.09758451079683644, 0.29030599661171436, -0.026078134402632715, 0.08604729092663287, 0.02092666821554303, -0.0725196008038308, 0.032354057228990964, -0.07999306391833151, 0.1544713965484074, 0.412872461322695, 0.2123928615823388, 0.37920470381953886, -0.3965500824961678, -0.14088486180640758, 0.12163088670000434, 0.09634835801885597, 0.10736939287345325, -0.005953819373888629, -0.28564081775689765, 0.07403656074511153, -0.1587574094754278, -0.0887973031241979, -0.1050270004523918, -0.005097291690347317, -0.00707120431520577, -0.24471216302365065, -0.025656203272519634, 0.021695350591159825, 0.13154567218119545, 0.00535010521167091, -0.15549655220936984, 0.024185924895906024, 0.21214579609089665, -0.00014013824186154774, 0.07021808215217398, 0.10430462332242833, -0.11640078463192496, -0.160624937822244, 0.3673384544359786, -0.03862285018499408, -0.1535583058704755, 0.20321702340817346, -0.1159425163881055, -0.1958132796415261, 0.08051383083420141, 0.2480817852861115, 0.05948426273252283, -0.21967881690710783, -0.010786113357171416, -0.03126557579530137, 0.15838219172720397, 0.03162687321858747, -0.07581775717437267, 0.21697562741913964, 0.18646336500133787, 0.013110702728320446, 0.10227773714877132, -0.04804250277977969, -0.020567967370152474, -0.2551178268875395, -0.14113442346511873, -0.16300606363985154, 0.007328519426020128, -0.06405112702632323, -0.11929340983874032, 0.3844380901860339, 0.19228997488240046, 0.15106106486504098, 0.04496656041193221, 0.26003871198743583, 0.07279495994302644, 0.0804526244090604, 0.09831883938184806, 0.18900860225515706, 0.11513595018203238, 0.1484439511084929, -0.058541198146995155, 0.0937494288704225, 0.0157171761803329] |
1,802.03419 | A Correction for IUE UV Flux Distributions from Comparisons with CALSPEC | A collection of spectral energy distributions (SEDs) is available in the
Hubble Space Telescope (HST) CALSPEC database that is based on calculated model
atmospheres for pure hydrogen white dwarfs (WDs). A much larger set (~100,000)
of UV SEDs covering the range (1150-3350A) with somewhat lower quality are
available in the IUE database. IUE low-dispersion flux distributions are
compared with CALSPEC to provide a correction that places IUE fluxes on the
CALSPEC scale. While IUE observations are repeatable to only 4-10% in regions
of good sensitivity, the average flux corrections have a precision of 2-3%. Our
re-calibration places the IUE flux scale on the current UV reference standard
and is relevant for any project based on IUE archival data, including our
planned comparison of GALEX to the corrected IUE fluxes. IUE SEDs may be used
to plan observations and cross-calibrate data from future missions, so the IUE
flux calibration must be consistent with HST instrumental calibrations to the
best possible precision.
| astro-ph.IM | a collection of spectral energy distributions seds is available in the hubble space telescope hst calspec database that is based on calculated model atmospheres for pure hydrogen white dwarfs wds a much larger set 100000 of uv seds covering the range 11503350a with somewhat lower quality are available in the iue database iue lowdispersion flux distributions are compared with calspec to provide a correction that places iue fluxes on the calspec scale while iue observations are repeatable to only 410 in regions of good sensitivity the average flux corrections have a precision of 23 our recalibration places the iue flux scale on the current uv reference standard and is relevant for any project based on iue archival data including our planned comparison of galex to the corrected iue fluxes iue seds may be used to plan observations and crosscalibrate data from future missions so the iue flux calibration must be consistent with hst instrumental calibrations to the best possible precision | [['a', 'collection', 'of', 'spectral', 'energy', 'distributions', 'seds', 'is', 'available', 'in', 'the', 'hubble', 'space', 'telescope', 'hst', 'calspec', 'database', 'that', 'is', 'based', 'on', 'calculated', 'model', 'atmospheres', 'for', 'pure', 'hydrogen', 'white', 'dwarfs', 'wds', 'a', 'much', 'larger', 'set', '100000', 'of', 'uv', 'seds', 'covering', 'the', 'range', '11503350a', 'with', 'somewhat', 'lower', 'quality', 'are', 'available', 'in', 'the', 'iue', 'database', 'iue', 'lowdispersion', 'flux', 'distributions', 'are', 'compared', 'with', 'calspec', 'to', 'provide', 'a', 'correction', 'that', 'places', 'iue', 'fluxes', 'on', 'the', 'calspec', 'scale', 'while', 'iue', 'observations', 'are', 'repeatable', 'to', 'only', '410', 'in', 'regions', 'of', 'good', 'sensitivity', 'the', 'average', 'flux', 'corrections', 'have', 'a', 'precision', 'of', '23', 'our', 'recalibration', 'places', 'the', 'iue', 'flux', 'scale', 'on', 'the', 'current', 'uv', 'reference', 'standard', 'and', 'is', 'relevant', 'for', 'any', 'project', 'based', 'on', 'iue', 'archival', 'data', 'including', 'our', 'planned', 'comparison', 'of', 'galex', 'to', 'the', 'corrected', 'iue', 'fluxes', 'iue', 'seds', 'may', 'be', 'used', 'to', 'plan', 'observations', 'and', 'crosscalibrate', 'data', 'from', 'future', 'missions', 'so', 'the', 'iue', 'flux', 'calibration', 'must', 'be', 'consistent', 'with', 'hst', 'instrumental', 'calibrations', 'to', 'the', 'best', 'possible', 'precision']] | [0.02692429991380411, 0.08097149625584577, -0.08051909972860846, 0.10969972653744989, -0.11937311095765459, -0.07706624550639458, 0.08810796661583602, 0.47980132197621483, -0.0965054842640511, -0.4025871109278908, 0.11481616070198258, -0.39422720540666356, 0.0731842477096438, 0.2662951411912218, -0.12956310730755516, 0.044098138876563914, 0.15561085738499397, -0.09489053508150391, -0.03775684183218909, -0.2933611632829954, 0.2645693912211829, 0.1565795931467236, 0.22973706511745476, -0.09482313339955777, 0.01581639473168355, -0.10862664120387486, -0.17022722130114176, -0.005025942473263778, -0.1384969739533145, 0.08560997277714968, 0.2418398627053665, 0.14782084844517376, 0.14799226054031425, -0.3480144742431131, -0.2417228901583069, 0.054385414878609324, 0.11013381145953101, -0.0061859087359581915, 0.030406113699336285, -0.2645884705648857, -0.01445097368870973, -0.15939611896767086, -0.08886398760156718, -0.02487174036719327, 0.03983982180321367, 0.04004360168385934, -0.2797447565427554, 0.01631173422836857, -0.10630298106280982, 0.16689804012436163, -0.19933796482476987, -0.17271401244654971, -0.10967871190543703, 0.12110613357369443, -0.03524176897583588, 0.0763035894805564, 0.11714663773294796, -0.10288629021917312, -0.021247106323856273, 0.3918320871512523, -0.1422116172927543, -0.0055070000447321145, 0.17935797748589338, -0.1635045680750466, -0.15207271126637809, 0.17821745213660053, 0.11709919957584648, 0.09855099210263751, -0.212622873198077, 0.07186784336281905, 0.01183039427818379, 0.25997351377517125, 0.015044342598338969, 0.11312197748302195, 0.2704337959722528, 0.12426687728426179, 0.018665856261497492, 0.03995879561898047, -0.27892782271154365, 0.010421726951864694, -0.2895782376030378, -0.041274871331575154, -0.17345366405862025, 0.06673799520914894, -0.11393816998347775, -0.12898515037747113, 0.32653423552489225, 0.1817577804336998, 0.18791920540901194, 0.10014709820619451, 0.3479598320833167, 0.056328129489798505, 0.1583610564124706, 0.07158142591551321, 0.3325424971609558, 0.0743123610378038, 0.1490491400026195, -0.17946717101324983, 0.00021437363429639326, 0.01871121366678169] |
1,802.0342 | Reweighted Autoencoded Variational Bayes for Enhanced Sampling (RAVE) | Here we propose the Reweighted Autoencoded Variational Bayes for Enhanced
Sampling (RAVE) method, a new iterative scheme that uses the deep learning
framework of variational autoencoders to enhance sampling in molecular
simulations. RAVE involves iterations between molecular simulations and deep
learning in order to produce an increasingly accurate probability distribution
along a low-dimensional latent space that captures the key features of the
molecular simulation trajectory. Using the Kullback-Leibler divergence between
this latent space distribution and the distribution of various trial reaction
coordinates sampled from the molecular simulation, RAVE determines an optimum,
yet nonetheless physically interpretable, reaction coordinate and optimum
probability distribution. Both then directly serve as the biasing protocol for
a new biased simulation, which is once again fed into the deep learning module
with appropriate weights accounting for the bias, the procedure continuing
until estimates of desirable thermodynamic observables are converged. Unlike
recent methods using deep learning for enhanced sampling purposes, RAVE stands
out in that (a) it naturally produces a physically interpretable reaction
coordinate, (b) is independent of existing enhanced sampling protocols to
enhance the fluctuations along the latent space identified via deep learning,
and (c) it provides the ability to easily filter out spurious solutions learned
by the deep learning procedure. The usefulness and reliability of RAVE is
demonstrated by applying it to model potentials of increasing complexity,
including computation of the binding free energy profile for a hydrophobic
ligand-substrate system in explicit water with dissociation time of more than
three minutes, in computer time at least twenty times less than that needed for
umbrella sampling or metadynamics.
| physics.chem-ph cond-mat.soft cond-mat.stat-mech physics.comp-ph | here we propose the reweighted autoencoded variational bayes for enhanced sampling rave method a new iterative scheme that uses the deep learning framework of variational autoencoders to enhance sampling in molecular simulations rave involves iterations between molecular simulations and deep learning in order to produce an increasingly accurate probability distribution along a lowdimensional latent space that captures the key features of the molecular simulation trajectory using the kullbackleibler divergence between this latent space distribution and the distribution of various trial reaction coordinates sampled from the molecular simulation rave determines an optimum yet nonetheless physically interpretable reaction coordinate and optimum probability distribution both then directly serve as the biasing protocol for a new biased simulation which is once again fed into the deep learning module with appropriate weights accounting for the bias the procedure continuing until estimates of desirable thermodynamic observables are converged unlike recent methods using deep learning for enhanced sampling purposes rave stands out in that a it naturally produces a physically interpretable reaction coordinate b is independent of existing enhanced sampling protocols to enhance the fluctuations along the latent space identified via deep learning and c it provides the ability to easily filter out spurious solutions learned by the deep learning procedure the usefulness and reliability of rave is demonstrated by applying it to model potentials of increasing complexity including computation of the binding free energy profile for a hydrophobic ligandsubstrate system in explicit water with dissociation time of more than three minutes in computer time at least twenty times less than that needed for umbrella sampling or metadynamics | [['here', 'we', 'propose', 'the', 'reweighted', 'autoencoded', 'variational', 'bayes', 'for', 'enhanced', 'sampling', 'rave', 'method', 'a', 'new', 'iterative', 'scheme', 'that', 'uses', 'the', 'deep', 'learning', 'framework', 'of', 'variational', 'autoencoders', 'to', 'enhance', 'sampling', 'in', 'molecular', 'simulations', 'rave', 'involves', 'iterations', 'between', 'molecular', 'simulations', 'and', 'deep', 'learning', 'in', 'order', 'to', 'produce', 'an', 'increasingly', 'accurate', 'probability', 'distribution', 'along', 'a', 'lowdimensional', 'latent', 'space', 'that', 'captures', 'the', 'key', 'features', 'of', 'the', 'molecular', 'simulation', 'trajectory', 'using', 'the', 'kullbackleibler', 'divergence', 'between', 'this', 'latent', 'space', 'distribution', 'and', 'the', 'distribution', 'of', 'various', 'trial', 'reaction', 'coordinates', 'sampled', 'from', 'the', 'molecular', 'simulation', 'rave', 'determines', 'an', 'optimum', 'yet', 'nonetheless', 'physically', 'interpretable', 'reaction', 'coordinate', 'and', 'optimum', 'probability', 'distribution', 'both', 'then', 'directly', 'serve', 'as', 'the', 'biasing', 'protocol', 'for', 'a', 'new', 'biased', 'simulation', 'which', 'is', 'once', 'again', 'fed', 'into', 'the', 'deep', 'learning', 'module', 'with', 'appropriate', 'weights', 'accounting', 'for', 'the', 'bias', 'the', 'procedure', 'continuing', 'until', 'estimates', 'of', 'desirable', 'thermodynamic', 'observables', 'are', 'converged', 'unlike', 'recent', 'methods', 'using', 'deep', 'learning', 'for', 'enhanced', 'sampling', 'purposes', 'rave', 'stands', 'out', 'in', 'that', 'a', 'it', 'naturally', 'produces', 'a', 'physically', 'interpretable', 'reaction', 'coordinate', 'b', 'is', 'independent', 'of', 'existing', 'enhanced', 'sampling', 'protocols', 'to', 'enhance', 'the', 'fluctuations', 'along', 'the', 'latent', 'space', 'identified', 'via', 'deep', 'learning', 'and', 'c', 'it', 'provides', 'the', 'ability', 'to', 'easily', 'filter', 'out', 'spurious', 'solutions', 'learned', 'by', 'the', 'deep', 'learning', 'procedure', 'the', 'usefulness', 'and', 'reliability', 'of', 'rave', 'is', 'demonstrated', 'by', 'applying', 'it', 'to', 'model', 'potentials', 'of', 'increasing', 'complexity', 'including', 'computation', 'of', 'the', 'binding', 'free', 'energy', 'profile', 'for', 'a', 'hydrophobic', 'ligandsubstrate', 'system', 'in', 'explicit', 'water', 'with', 'dissociation', 'time', 'of', 'more', 'than', 'three', 'minutes', 'in', 'computer', 'time', 'at', 'least', 'twenty', 'times', 'less', 'than', 'that', 'needed', 'for', 'umbrella', 'sampling', 'or', 'metadynamics']] | [-0.03181260683743928, 0.06693635616337325, -0.13141818351521997, 0.0834694431673807, -0.07230798450137417, -0.15731147875149662, 0.07668607434114584, 0.4309176979702897, -0.2925743635170735, -0.3044474081691498, 0.02640377809965195, -0.24136651578166773, -0.130244086055497, 0.19292752837242846, -0.038234739342162635, 0.09137392857900033, 0.11090844185360206, -0.009275581916041959, -0.07621128918029942, -0.24943969061535495, 0.26627784065830595, 0.12357994566264097, 0.29900927611429673, -0.04696442025015131, 0.14450684649178025, 0.002239269210258499, -0.04993149894110572, -0.009524360221537511, -0.12007867283100496, 0.15014279512957168, 0.2833535270684829, 0.1787846463259764, 0.3484548119756465, -0.3888571432111068, -0.24261260512105834, 0.09162913440690877, 0.1939902585116215, 0.1277497739025141, -0.04078458863575808, -0.2879086579876737, 0.04854287503717037, -0.16906064777061916, -0.0707468482773178, -0.15164902695418836, -0.028823442769666703, 0.034436828101752325, -0.3067089985948629, 0.08298968809226957, 0.00032355798623309685, 0.06546659326324096, -0.04720494188726521, -0.14690878521427153, -0.025086898802188583, 0.1043391772483189, 0.014038325232328274, 0.08710108416707954, 0.17782621767658455, -0.12549866658787673, -0.0677603160075915, 0.33210587569225863, -0.040803464136843104, -0.1913996476894961, 0.16714754251118463, -0.05489754583328389, -0.14652207938667675, 0.18211649007056482, 0.1607355737646755, 0.11788061194014378, -0.18162140729523693, 0.010029481860692612, 0.006404515330751355, 0.14235834358260036, 0.039213187686310935, -0.022320761473383754, 0.15774805104592815, 0.1946112791595414, 0.09188082329302023, 0.11422646408206605, -0.13814803082585478, -0.15909595043496946, -0.2582819057521052, -0.13852291781351175, -0.20726025331980333, -0.0014826279670859758, -0.11674607734508194, -0.1311212842209408, 0.3462513528258709, 0.19452281683558026, 0.19254621409076766, 0.06720484007875292, 0.3382085866832103, 0.06506085222824298, 0.10049213787625866, 0.09911904789579029, 0.19142560224192073, 0.10039061182536758, 0.08240068826887112, -0.20478051961086188, 0.10880195332574658, 0.052641851347512925] |
1,802.03421 | Measurement of the Decays $\Lambda_c\to \Sigma\pi\pi$ at Belle | We report measurements of the branching fractions of the decays
$\Lambda^+_c\to\Sigma^+\pi^-\pi^+$, $\Lambda^+_c\to\Sigma^0\pi^+\pi^0$ and
$\Lambda^+_c\to\Sigma^+\pi^0\pi^0$ relative to the reference channel
$\Lambda^+_c\to pK^-\pi^+$. The analysis is based on the full data sample
collected at and close to $\Upsilon(4S)$ resonance by the Belle detector at the
KEKB asymmetric-energy $e^+e^-$ collider corresponding to the integrated
luminosity of 711 fb$^{-1}$. We measure ${\cal
B}(\Lambda^+_c\rightarrow\Sigma^+\pi^-\pi^+)/{\cal B}(\Lambda^+_c\to pK^-\pi^+)
= 0.706~\pm 0.003~\pm 0.029$, ${\cal
B}(\Lambda^+_c\rightarrow\Sigma^0\pi^+\pi^0)/{\cal B}(\Lambda^+_c\to pK^-\pi^+)
= 0.491~\pm 0.005~\pm 0.028$ and ${\cal
B}(\Lambda^+_c\rightarrow\Sigma^+\pi^0\pi^0)/{\cal B}(\Lambda^+_c\to pK^-\pi^+)
= 0.198~\pm 0.006~\pm 0.016$. The listed uncertainties are statistical and
systematic, respectively.
| hep-ex | we report measurements of the branching fractions of the decays lambda_ctosigmapipi lambda_ctosigma0pipi0 and lambda_ctosigmapi0pi0 relative to the reference channel lambda_cto pkpi the analysis is based on the full data sample collected at and close to upsilon4s resonance by the belle detector at the kekb asymmetricenergy ee collider corresponding to the integrated luminosity of 711 fb1 we measure cal blambda_crightarrowsigmapipical blambda_cto pkpi 0706pm 0003pm 0029 cal blambda_crightarrowsigma0pipi0cal blambda_cto pkpi 0491pm 0005pm 0028 and cal blambda_crightarrowsigmapi0pi0cal blambda_cto pkpi 0198pm 0006pm 0016 the listed uncertainties are statistical and systematic respectively | [['we', 'report', 'measurements', 'of', 'the', 'branching', 'fractions', 'of', 'the', 'decays', 'lambda_ctosigmapipi', 'lambda_ctosigma0pipi0', 'and', 'lambda_ctosigmapi0pi0', 'relative', 'to', 'the', 'reference', 'channel', 'lambda_cto', 'pkpi', 'the', 'analysis', 'is', 'based', 'on', 'the', 'full', 'data', 'sample', 'collected', 'at', 'and', 'close', 'to', 'upsilon4s', 'resonance', 'by', 'the', 'belle', 'detector', 'at', 'the', 'kekb', 'asymmetricenergy', 'ee', 'collider', 'corresponding', 'to', 'the', 'integrated', 'luminosity', 'of', '711', 'fb1', 'we', 'measure', 'cal', 'blambda_crightarrowsigmapipical', 'blambda_cto', 'pkpi', '0706pm', '0003pm', '0029', 'cal', 'blambda_crightarrowsigma0pipi0cal', 'blambda_cto', 'pkpi', '0491pm', '0005pm', '0028', 'and', 'cal', 'blambda_crightarrowsigmapi0pi0cal', 'blambda_cto', 'pkpi', '0198pm', '0006pm', '0016', 'the', 'listed', 'uncertainties', 'are', 'statistical', 'and', 'systematic', 'respectively']] | [-0.06698624683051164, 0.12762591205144228, -0.04651911386179847, 0.06820225869396145, -0.03252972144778673, -0.07827937840060754, 0.07946895390247032, 0.3106969196301002, -0.10497495327931043, -0.2968775921247222, 0.02505924538164944, -0.528585224956661, 0.13384522845992794, 0.14217936680289348, 0.03214948849341312, 0.19105662778171092, 0.13646029232843937, -0.026340884253285922, -0.06729678758238623, -0.15758087752120836, 0.12584691783776145, 0.09299885295936233, 0.2685651221288392, 0.04817178598665572, 0.049584031874592135, -0.04221775161870453, -0.04159068896785959, -0.12914719843825737, -0.23158908159435762, 0.055120540989937815, 0.2501228509059587, 0.16022675239493128, 0.08400782992361815, -0.2572906957284431, 0.1463908449710383, 0.19757057013981916, 0.13280334910861663, -0.04548638594614995, 0.07146712492957905, -0.45051053480862024, 0.1957232988766068, -0.21248037141276063, -0.01337610859448066, 0.04677556711551431, 0.08409750442226212, -0.13594685109066112, -0.37951558966238, 0.1511175378237839, -0.1492079728151265, 0.12684913260511474, 0.001810582439330491, -0.31847118056536494, -0.0775107467039065, -0.10025816499678926, -0.025835703532271957, 0.10210135676323545, 0.2265831481139236, -0.02516330037169255, -0.1467461244463195, 0.33156717246906325, -0.07377530889099543, -0.03893534154570722, 0.08614071028975334, -0.2897639493457973, -0.11981004342594027, 0.17928048806240807, 0.33415740579003833, 0.010428165254945105, -0.22538156670748027, 0.12838275739681218, 0.03506920234203435, 0.20476681290363724, 0.04896828261893484, 0.10108471013811211, 0.12011857151186892, 0.19599722891247698, -0.04275581220092325, 0.05484952765529032, -0.16695577123008862, 0.025257520734441357, -0.4268864061632012, -0.06908552900150225, -0.020233594848738087, 0.09907778301850784, -0.030954594735219446, -0.018693603865512005, 0.30267528826733686, 0.07194406245593224, 0.3684367754847392, 0.06694152478322193, 0.2533984245587285, 0.11963579599827213, -0.0036412199544145836, 0.05660726352615204, 0.3460907342952567, 0.19517406635288778, 0.11014417548022874, -0.35599623885392756, -0.015912824322457438, -0.04740290190153695] |
1,802.03422 | State of the Practice for GIS Software | We present a reproducible method to analyze the state of software development
practices in a given scientific domain and apply this method to Geographic
Information Systems (GIS). The analysis is based on grading a set of 30 GIS
products using a template of 56 questions based on 13 software qualities. The
products range in scope and purpose from a complete desktop GIS systems, to
stand-alone tools, to programming libraries/packages. The final ranking of the
products is determined using the Analytic Hierarchy Process (AHP), a
multicriteria decision making method that focuses on relative comparisons
between products, rather than directly measuring qualities. The results reveal
concerns regarding the correctness, maintainability, transparency and
reproducibility of some GIS software. Three recommendations are presented as
feedback to the GIS community: 1) Ensure each project has a requirements
specification document, 2) Provide a wealth of support methods, such as an IRC
(Internet Relay Chat) channel, a Stack Exchange tag for new questions, or
opening the issue tracker for support requests, as well as the more traditional
email-based methods, and, 3) Design product websites for maximum transparency
(of the development process), for open source projects, provide a developer's
guide.
| cs.SE | we present a reproducible method to analyze the state of software development practices in a given scientific domain and apply this method to geographic information systems gis the analysis is based on grading a set of 30 gis products using a template of 56 questions based on 13 software qualities the products range in scope and purpose from a complete desktop gis systems to standalone tools to programming librariespackages the final ranking of the products is determined using the analytic hierarchy process ahp a multicriteria decision making method that focuses on relative comparisons between products rather than directly measuring qualities the results reveal concerns regarding the correctness maintainability transparency and reproducibility of some gis software three recommendations are presented as feedback to the gis community 1 ensure each project has a requirements specification document 2 provide a wealth of support methods such as an irc internet relay chat channel a stack exchange tag for new questions or opening the issue tracker for support requests as well as the more traditional emailbased methods and 3 design product websites for maximum transparency of the development process for open source projects provide a developers guide | [['we', 'present', 'a', 'reproducible', 'method', 'to', 'analyze', 'the', 'state', 'of', 'software', 'development', 'practices', 'in', 'a', 'given', 'scientific', 'domain', 'and', 'apply', 'this', 'method', 'to', 'geographic', 'information', 'systems', 'gis', 'the', 'analysis', 'is', 'based', 'on', 'grading', 'a', 'set', 'of', '30', 'gis', 'products', 'using', 'a', 'template', 'of', '56', 'questions', 'based', 'on', '13', 'software', 'qualities', 'the', 'products', 'range', 'in', 'scope', 'and', 'purpose', 'from', 'a', 'complete', 'desktop', 'gis', 'systems', 'to', 'standalone', 'tools', 'to', 'programming', 'librariespackages', 'the', 'final', 'ranking', 'of', 'the', 'products', 'is', 'determined', 'using', 'the', 'analytic', 'hierarchy', 'process', 'ahp', 'a', 'multicriteria', 'decision', 'making', 'method', 'that', 'focuses', 'on', 'relative', 'comparisons', 'between', 'products', 'rather', 'than', 'directly', 'measuring', 'qualities', 'the', 'results', 'reveal', 'concerns', 'regarding', 'the', 'correctness', 'maintainability', 'transparency', 'and', 'reproducibility', 'of', 'some', 'gis', 'software', 'three', 'recommendations', 'are', 'presented', 'as', 'feedback', 'to', 'the', 'gis', 'community', '1', 'ensure', 'each', 'project', 'has', 'a', 'requirements', 'specification', 'document', '2', 'provide', 'a', 'wealth', 'of', 'support', 'methods', 'such', 'as', 'an', 'irc', 'internet', 'relay', 'chat', 'channel', 'a', 'stack', 'exchange', 'tag', 'for', 'new', 'questions', 'or', 'opening', 'the', 'issue', 'tracker', 'for', 'support', 'requests', 'as', 'well', 'as', 'the', 'more', 'traditional', 'emailbased', 'methods', 'and', '3', 'design', 'product', 'websites', 'for', 'maximum', 'transparency', 'of', 'the', 'development', 'process', 'for', 'open', 'source', 'projects', 'provide', 'a', 'developers', 'guide']] | [-0.09567207622607556, -0.022067250373589815, -0.06356299993294384, 0.07744075587950418, -0.1388437969583277, -0.14947709337691167, 0.08749706983073804, 0.4096503981745056, -0.2535058410633453, -0.34002863588689275, 0.1663422837758349, -0.27863739700792894, -0.0950602744751688, 0.23163245929312448, -0.0745441971215083, 0.05637727896390356, 0.11849937645757463, 0.02492520055174096, -0.04330865199511861, -0.2560440071241571, 0.3346680794203781, 0.08210441554013971, 0.3242906091676255, 0.0782178431634757, 0.0424741896964044, 0.03053453252151004, -0.1053046896122396, -0.047874087740238075, -0.10677786387646533, 0.15731457628173198, 0.3271493924493994, 0.2748756509966641, 0.3450738515568341, -0.37307635040378384, -0.151261305582773, -0.007192025246361943, 0.1180382289707963, 0.04682249617299641, -0.05301389185120827, -0.3129247770070571, 0.08071744961527552, -0.2435202624731702, -0.09754905164368567, -0.07392096299561063, -0.0250312161896788, 0.03502134475607313, -0.2598488774267635, -0.060027699655468, 0.01644091521523416, 0.12861867429425267, -0.03130795296247444, -0.1290123818481234, 0.010895261072909645, 0.19044567091044293, 0.0012212600909461174, 0.01994590024300485, 0.1804264035948713, -0.13095104338781643, -0.1777010016260347, 0.3818793248202949, 0.0038322211539278937, -0.18638573336967812, 0.20366085131429576, -0.03498353002012673, -0.13063779283627008, 0.0880430947867477, 0.20994802972506635, 0.07718553370796144, -0.22290210586519063, 0.014712226700223006, 0.03540557776017027, 0.22256295304167625, 0.04696805366919576, 0.010783017336278764, 0.1984492675053853, 0.24516442510986905, 0.07384603889659047, 0.12026680434544458, -0.017237456209460243, -0.06886634831828753, -0.2454379601556447, -0.19804574360251817, -0.1214971009115274, 0.010867856791564776, -0.06667711292436171, -0.18712402524850794, 0.385422927312826, 0.1797476255515327, 0.12174267603172213, 0.027694801335510704, 0.3478814626102828, 0.0026494665834010476, 0.0780857386413708, 0.08900613448441184, 0.13837852837906112, 0.05210606332658668, 0.18811921769733594, -0.11140185456201239, 0.11228091115648833, 0.0240882528428944] |
1,802.03423 | The WISSH Quasars Project IV. BLR versus kpc-scale winds | We have undertaken a multi-band observing program aimed at obtaining a
complete census of winds in a sample of WISE/SDSS selected hyper-luminous
(WISSH) QSOs at z~2-4. We have analyzed the rest-frame optical (LBT/LUCI and
VLT/SINFONI) and UV (SDSS) spectra of 18 randomly selected WISSH QSOs to
measure the SMBH mass and study the properties of winds both in the NLR and BLR
traced by blueshifted/skewed [OIII] and CIV emission lines, respectively. These
WISSH QSOs are powered by SMBH with masses $\ge$10$^9$ Msun accreting at
0.4<$\lambda_{Edd}$<3.1. We have found the existence of two sub-populations
characterized by the presence of outflows at different distances from the SMBH.
One population ([OIII] sources) exhibits powerful [OIII] outflows, rest-frame
EW (REW) of the CIV emission REW$_{CIV}\approx$20-40 A and modest CIV velocity
shift (v$_{CIV}^{peak}$) with respect to the systemic redshift (<=2000 km/s).
The second population (Weak [OIII] sources), representing ~70% of the analyzed
WISSH QSOs, shows weak/absent [OIII] emission and an extremely large
v$_{CIV}^{peak}$ (up to ~8000 km/s and REW$_{CIV}$<=20 A). We propose two
explanations for the observed behavior of the strength of the [OIII] emission
in terms of orientation effects of the line of sight and ionization cone. The
dichotomy in the presence of BLR and NLR winds could be likely due to
inclination effects considering a polar geometry scenario for the BLR winds. We
find a strong correlation with L$_{Bol}$ and an anti-correlation with
$\alpha_{ox}$, whereby the higher L$_{Bol}$, the steeper $\alpha_{ox}$ and the
larger is the v$_{CIV}^{peak}$. Finally, the observed dependence
v$_{CIV}^{peak}\propto L_{Bol}^{0.28\pm0.04}$ is consistent with radiatively
driven winds scenario, where strong UV continuum is necessary to launch the
wind and a weakness of the X-ray emission is fundamental to prevent
overionization of the wind itself.
| astro-ph.GA | we have undertaken a multiband observing program aimed at obtaining a complete census of winds in a sample of wisesdss selected hyperluminous wissh qsos at z24 we have analyzed the restframe optical lbtluci and vltsinfoni and uv sdss spectra of 18 randomly selected wissh qsos to measure the smbh mass and study the properties of winds both in the nlr and blr traced by blueshiftedskewed oiii and civ emission lines respectively these wissh qsos are powered by smbh with masses ge109 msun accreting at 04lambda_edd31 we have found the existence of two subpopulations characterized by the presence of outflows at different distances from the smbh one population oiii sources exhibits powerful oiii outflows restframe ew rew of the civ emission rew_civapprox2040 a and modest civ velocity shift v_civpeak with respect to the systemic redshift 2000 kms the second population weak oiii sources representing 70 of the analyzed wissh qsos shows weakabsent oiii emission and an extremely large v_civpeak up to 8000 kms and rew_civ20 a we propose two explanations for the observed behavior of the strength of the oiii emission in terms of orientation effects of the line of sight and ionization cone the dichotomy in the presence of blr and nlr winds could be likely due to inclination effects considering a polar geometry scenario for the blr winds we find a strong correlation with l_bol and an anticorrelation with alpha_ox whereby the higher l_bol the steeper alpha_ox and the larger is the v_civpeak finally the observed dependence v_civpeakpropto l_bol028pm004 is consistent with radiatively driven winds scenario where strong uv continuum is necessary to launch the wind and a weakness of the xray emission is fundamental to prevent overionization of the wind itself | [['we', 'have', 'undertaken', 'a', 'multiband', 'observing', 'program', 'aimed', 'at', 'obtaining', 'a', 'complete', 'census', 'of', 'winds', 'in', 'a', 'sample', 'of', 'wisesdss', 'selected', 'hyperluminous', 'wissh', 'qsos', 'at', 'z24', 'we', 'have', 'analyzed', 'the', 'restframe', 'optical', 'lbtluci', 'and', 'vltsinfoni', 'and', 'uv', 'sdss', 'spectra', 'of', '18', 'randomly', 'selected', 'wissh', 'qsos', 'to', 'measure', 'the', 'smbh', 'mass', 'and', 'study', 'the', 'properties', 'of', 'winds', 'both', 'in', 'the', 'nlr', 'and', 'blr', 'traced', 'by', 'blueshiftedskewed', 'oiii', 'and', 'civ', 'emission', 'lines', 'respectively', 'these', 'wissh', 'qsos', 'are', 'powered', 'by', 'smbh', 'with', 'masses', 'ge109', 'msun', 'accreting', 'at', '04lambda_edd31', 'we', 'have', 'found', 'the', 'existence', 'of', 'two', 'subpopulations', 'characterized', 'by', 'the', 'presence', 'of', 'outflows', 'at', 'different', 'distances', 'from', 'the', 'smbh', 'one', 'population', 'oiii', 'sources', 'exhibits', 'powerful', 'oiii', 'outflows', 'restframe', 'ew', 'rew', 'of', 'the', 'civ', 'emission', 'rew_civapprox2040', 'a', 'and', 'modest', 'civ', 'velocity', 'shift', 'v_civpeak', 'with', 'respect', 'to', 'the', 'systemic', 'redshift', '2000', 'kms', 'the', 'second', 'population', 'weak', 'oiii', 'sources', 'representing', '70', 'of', 'the', 'analyzed', 'wissh', 'qsos', 'shows', 'weakabsent', 'oiii', 'emission', 'and', 'an', 'extremely', 'large', 'v_civpeak', 'up', 'to', '8000', 'kms', 'and', 'rew_civ20', 'a', 'we', 'propose', 'two', 'explanations', 'for', 'the', 'observed', 'behavior', 'of', 'the', 'strength', 'of', 'the', 'oiii', 'emission', 'in', 'terms', 'of', 'orientation', 'effects', 'of', 'the', 'line', 'of', 'sight', 'and', 'ionization', 'cone', 'the', 'dichotomy', 'in', 'the', 'presence', 'of', 'blr', 'and', 'nlr', 'winds', 'could', 'be', 'likely', 'due', 'to', 'inclination', 'effects', 'considering', 'a', 'polar', 'geometry', 'scenario', 'for', 'the', 'blr', 'winds', 'we', 'find', 'a', 'strong', 'correlation', 'with', 'l_bol', 'and', 'an', 'anticorrelation', 'with', 'alpha_ox', 'whereby', 'the', 'higher', 'l_bol', 'the', 'steeper', 'alpha_ox', 'and', 'the', 'larger', 'is', 'the', 'v_civpeak', 'finally', 'the', 'observed', 'dependence', 'v_civpeakpropto', 'l_bol028pm004', 'is', 'consistent', 'with', 'radiatively', 'driven', 'winds', 'scenario', 'where', 'strong', 'uv', 'continuum', 'is', 'necessary', 'to', 'launch', 'the', 'wind', 'and', 'a', 'weakness', 'of', 'the', 'xray', 'emission', 'is', 'fundamental', 'to', 'prevent', 'overionization', 'of', 'the', 'wind', 'itself']] | [-0.06139028865331109, 0.07742810597657175, 0.014803195267618783, 0.15049863337586378, -0.0948659339060807, -0.11578754271529075, 0.053545594740105604, 0.5169616685134183, -0.11051014042965582, -0.3177225889490016, 0.016749161103254428, -0.33715819418295356, 0.051700841119188976, 0.1847581796388587, -0.0074799632454506946, -0.06283541289335319, -0.04047350621450291, -0.1978350426070392, -0.024315018418733878, -0.22151006661368994, 0.3383305115318196, 0.07964573152012368, 0.1772903899891653, 0.013067091282025196, 0.0965537175256084, -0.1373526579177385, -0.06686156213054083, 0.031329493368199714, -0.10702899245476094, 0.057171140292969845, 0.2306285624205054, 0.1387175939381595, 0.2744887572501983, -0.2574445052810072, -0.18650900338020554, 0.0622534281700728, 0.20102217083536822, 0.020244367496596406, -0.040210201842811606, -0.2859561084769666, 0.022759605109678123, -0.18638628032024734, -0.1823634431217426, 0.09862671877962767, 0.04216260137036443, 0.03311655749195674, -0.21328606144432316, 0.13873154564382698, 0.002841953062907914, 0.14728442176947018, -0.09685607961264263, -0.030896013267709455, -0.12477587888260251, 0.02086724151276808, 0.0669703875234742, 0.04612124407414239, 0.2076427687914448, -0.14705164681958116, -0.03966811452330043, 0.42009010581650597, -0.07926509235551128, 0.05905765108258018, 0.2323726509205079, -0.22977232905459063, -0.15778144379483833, 0.2182530522113666, 0.1642670739421864, 0.12921477648669152, -0.1292848624642816, -0.04303509200648135, -0.04352313901830897, 0.25213253980441747, -0.014092137074550155, 0.11719016805780458, 0.32436663915059005, 0.018239010743327788, 0.006338438114060251, 0.11242510669124886, -0.2550732849428997, 0.010880725893556424, -0.2356389494396854, -0.054005812852731164, -0.07106141033379929, 0.13437498362643807, -0.17475909411782134, -0.10894624400500924, 0.30953193582385924, 0.12506724557201582, 0.2555434894208135, 0.06613534546551714, 0.3013744274005834, 0.13483789807988628, 0.07993776724290819, 0.1514768003818471, 0.3731644943565724, 0.19328443810893764, 0.08955916770113011, -0.2783084384384405, 0.09020974025116775, 0.01912383151922267] |
1,802.03424 | Cooling the Motion of a Silica Microsphere in a Magneto-Gravitational
Trap in Ultra-High Vacuum | Levitated optomechanical systems, and particularly particles trapped in
vacuum, provide unique platforms for studying the mechanical behavior of
objects well-isolated from their environment. Ultimately, such systems may
enable the study of fundamental questions in quantum mechanics, gravity, and
other weak forces. While the optical trapping of nanoparticles has emerged as
the prototypical levitated optomechanical system, it is not without problems
due to the heating from the high optical intensity required, particularly when
combined with a high vacuum environment. Here we investigate a
magneto-gravitational trap in ultra-high vacuum. In contrast to optical
trapping, we create an entirely passive trap for diamagnetic particles by
utilizing the magnetic field generated by permanent magnets and the
gravitational interaction. We demonstrate cooling the center of mass motion of
a trapped silica microsphere from ambient temperature to an effective
temperature near or below one milliKelvin in two degrees of freedom by optical
feedback damping.
| quant-ph | levitated optomechanical systems and particularly particles trapped in vacuum provide unique platforms for studying the mechanical behavior of objects wellisolated from their environment ultimately such systems may enable the study of fundamental questions in quantum mechanics gravity and other weak forces while the optical trapping of nanoparticles has emerged as the prototypical levitated optomechanical system it is not without problems due to the heating from the high optical intensity required particularly when combined with a high vacuum environment here we investigate a magnetogravitational trap in ultrahigh vacuum in contrast to optical trapping we create an entirely passive trap for diamagnetic particles by utilizing the magnetic field generated by permanent magnets and the gravitational interaction we demonstrate cooling the center of mass motion of a trapped silica microsphere from ambient temperature to an effective temperature near or below one millikelvin in two degrees of freedom by optical feedback damping | [['levitated', 'optomechanical', 'systems', 'and', 'particularly', 'particles', 'trapped', 'in', 'vacuum', 'provide', 'unique', 'platforms', 'for', 'studying', 'the', 'mechanical', 'behavior', 'of', 'objects', 'wellisolated', 'from', 'their', 'environment', 'ultimately', 'such', 'systems', 'may', 'enable', 'the', 'study', 'of', 'fundamental', 'questions', 'in', 'quantum', 'mechanics', 'gravity', 'and', 'other', 'weak', 'forces', 'while', 'the', 'optical', 'trapping', 'of', 'nanoparticles', 'has', 'emerged', 'as', 'the', 'prototypical', 'levitated', 'optomechanical', 'system', 'it', 'is', 'not', 'without', 'problems', 'due', 'to', 'the', 'heating', 'from', 'the', 'high', 'optical', 'intensity', 'required', 'particularly', 'when', 'combined', 'with', 'a', 'high', 'vacuum', 'environment', 'here', 'we', 'investigate', 'a', 'magnetogravitational', 'trap', 'in', 'ultrahigh', 'vacuum', 'in', 'contrast', 'to', 'optical', 'trapping', 'we', 'create', 'an', 'entirely', 'passive', 'trap', 'for', 'diamagnetic', 'particles', 'by', 'utilizing', 'the', 'magnetic', 'field', 'generated', 'by', 'permanent', 'magnets', 'and', 'the', 'gravitational', 'interaction', 'we', 'demonstrate', 'cooling', 'the', 'center', 'of', 'mass', 'motion', 'of', 'a', 'trapped', 'silica', 'microsphere', 'from', 'ambient', 'temperature', 'to', 'an', 'effective', 'temperature', 'near', 'or', 'below', 'one', 'millikelvin', 'in', 'two', 'degrees', 'of', 'freedom', 'by', 'optical', 'feedback', 'damping']] | [-0.1290306718705373, 0.24487257743355775, -0.032151130350570926, -0.018430439362812134, -0.0002947173024703925, -0.1710838871763003, 0.014236275421304477, 0.3954045597489017, -0.2457013268753685, -0.32148674584144876, 0.06339874487949183, -0.2661580354340274, -0.0707570268769396, 0.23508874017185205, -0.028886328125687165, 0.05446702478189223, 0.0067473618452110005, -0.002380070415563603, 0.008793850984688647, -0.14731285037988848, 0.27264241628801905, 0.0918890454191274, 0.2659217868270856, 0.06364669393106187, 0.13825830455233873, -0.005665750798102267, 0.10620306726431826, 0.010412986623909878, -0.09828180149968437, 0.09558166850773567, 0.19126147441636784, -0.004532565878754532, 0.26216359075939133, -0.47774617572164013, -0.22887373132697256, 0.105143316134156, 0.15512476378195994, 0.2007363957236521, -0.12256776549966654, -0.29989164095447474, -0.02295513150622011, -0.12777213982111346, -0.20040543319821055, -0.08482253813574947, -0.005204377905151027, 0.021706764346519677, -0.22666158983200738, 0.038391342986574886, 0.0542553383919939, 0.09979778263289985, -0.11843229844738301, -0.03435194855666015, 0.017473537087868397, 0.08978924233363343, -0.026129847639429105, -0.00031481303016629974, 0.2640690048944167, -0.18681463905031215, -0.08382465812453144, 0.4208605929995207, -0.08655678326849246, -0.11218382629905702, 0.24612061334207552, -0.1764957139841155, -0.01781824221708686, 0.16447524626965862, 0.19669326740266704, 0.0907039961327698, -0.17037890140312123, 0.039689380328274786, 0.043609896819484795, 0.17433190625160933, 0.08944203681941773, 0.11056809842537749, 0.3125883341590698, 0.17441365908598527, 0.036060969276051666, 0.1974671106585742, -0.06527272918705225, -0.032571893383597804, -0.22782410054650107, -0.15734019298798632, -0.2003928202210699, 0.0715153887223907, -0.06296249387309512, -0.15300796029623598, 0.311559559890648, 0.16085303577002943, 0.1304821671188079, -0.061738084982828914, 0.3234795487636851, 0.05752578701798779, 0.08303447401094427, 0.03189748805016279, 0.36480880557005674, 0.1570884071910326, 0.12562286080729618, -0.3089736442465486, -0.03786424903287175, -0.006600308313814772] |
1,802.03425 | Asymptotic nonequivalence of density estimation and Gaussian white noise
for small densities | It is well-known that density estimation on the unit interval is
asymptotically equivalent to a Gaussian white noise experiment, provided the
densities are sufficiently smooth and uniformly bounded away from zero. We show
that a uniform lower bound, whose size we sharply characterize, is in general
necessary for asymptotic equivalence to hold.
| math.ST stat.TH | it is wellknown that density estimation on the unit interval is asymptotically equivalent to a gaussian white noise experiment provided the densities are sufficiently smooth and uniformly bounded away from zero we show that a uniform lower bound whose size we sharply characterize is in general necessary for asymptotic equivalence to hold | [['it', 'is', 'wellknown', 'that', 'density', 'estimation', 'on', 'the', 'unit', 'interval', 'is', 'asymptotically', 'equivalent', 'to', 'a', 'gaussian', 'white', 'noise', 'experiment', 'provided', 'the', 'densities', 'are', 'sufficiently', 'smooth', 'and', 'uniformly', 'bounded', 'away', 'from', 'zero', 'we', 'show', 'that', 'a', 'uniform', 'lower', 'bound', 'whose', 'size', 'we', 'sharply', 'characterize', 'is', 'in', 'general', 'necessary', 'for', 'asymptotic', 'equivalence', 'to', 'hold']] | [-0.09425219528090495, 0.18712109198363927, -0.10428935510572046, 0.10700916952471463, -0.03244326666642267, -0.17537534251235998, 0.05675443162237151, 0.39670826652302194, -0.23143633804284036, -0.21506053946751097, 0.14703320879086207, -0.2657164198238976, -0.11774008044113334, 0.19140064610669819, -0.13153834562175548, 0.05357784533631415, 0.025684150397025336, 0.10271046032050016, -0.0786898017484838, -0.27453687579299396, 0.30452364469573906, 0.011347551006250657, 0.2930690491428742, 0.03447263515017067, 0.10845237046193618, -0.03993206473891265, 0.019438756853700258, 0.06468967749522282, -0.1985341120220815, 0.08180585708648253, 0.22278527381758279, 0.09665915433568163, 0.26125059514127386, -0.3407196389296307, -0.19483750616200268, 0.15032918855118063, 0.1217474647743914, 0.06948241993534164, -0.038574856117170736, -0.23776800071265405, 0.17809186895521215, -0.09745665402778496, -0.168575274793861, -0.03152061129311243, 0.0497084532936032, 0.061646504663468264, -0.34098502681948817, 0.08468664701705655, 0.15726541691961196, -0.014360931827328526, -0.07519101767908208, -0.1132266700531965, -0.0025606312287541535, 0.10560051538050175, -0.007322562065942643, 0.05464643985033035, 0.09148331196047366, -0.059646179554804876, 0.02870815889372562, 0.27546483630318946, -0.11497240531473206, -0.25112871996064384, 0.18965802314498711, -0.20983016388848996, -0.07689351491773358, 0.1517523008470352, 0.1377759832522805, 0.1255022820730049, -0.10296331125741395, 0.1574060870144212, -0.0788311427750159, 0.16969672733774552, 0.0965849184878887, 0.018429828195411783, 0.15588023738326648, 0.09058577649725172, 0.22197567568554616, 0.18147105114677778, -0.05575460601651754, -0.12747621898933387, -0.3698004834385266, -0.07325885242160159, -0.24784412969333622, 0.10310598303420612, -0.08346058774595104, -0.20409843799293761, 0.2901377107661504, 0.11854199481268342, 0.20389384719041678, 0.17260528862691268, 0.2891840260977355, 0.1677857211101442, -0.0029633981892122673, 0.14509502227883786, 0.18886730662779883, 0.19150980800175324, -0.01604024737249487, -0.1286559269602339, 0.05208982491435913, 0.031013980275859537] |
1,802.03426 | UMAP: Uniform Manifold Approximation and Projection for Dimension
Reduction | UMAP (Uniform Manifold Approximation and Projection) is a novel manifold
learning technique for dimension reduction. UMAP is constructed from a
theoretical framework based in Riemannian geometry and algebraic topology. The
result is a practical scalable algorithm that applies to real world data. The
UMAP algorithm is competitive with t-SNE for visualization quality, and
arguably preserves more of the global structure with superior run time
performance. Furthermore, UMAP has no computational restrictions on embedding
dimension, making it viable as a general purpose dimension reduction technique
for machine learning.
| stat.ML cs.CG cs.LG | umap uniform manifold approximation and projection is a novel manifold learning technique for dimension reduction umap is constructed from a theoretical framework based in riemannian geometry and algebraic topology the result is a practical scalable algorithm that applies to real world data the umap algorithm is competitive with tsne for visualization quality and arguably preserves more of the global structure with superior run time performance furthermore umap has no computational restrictions on embedding dimension making it viable as a general purpose dimension reduction technique for machine learning | [['umap', 'uniform', 'manifold', 'approximation', 'and', 'projection', 'is', 'a', 'novel', 'manifold', 'learning', 'technique', 'for', 'dimension', 'reduction', 'umap', 'is', 'constructed', 'from', 'a', 'theoretical', 'framework', 'based', 'in', 'riemannian', 'geometry', 'and', 'algebraic', 'topology', 'the', 'result', 'is', 'a', 'practical', 'scalable', 'algorithm', 'that', 'applies', 'to', 'real', 'world', 'data', 'the', 'umap', 'algorithm', 'is', 'competitive', 'with', 'tsne', 'for', 'visualization', 'quality', 'and', 'arguably', 'preserves', 'more', 'of', 'the', 'global', 'structure', 'with', 'superior', 'run', 'time', 'performance', 'furthermore', 'umap', 'has', 'no', 'computational', 'restrictions', 'on', 'embedding', 'dimension', 'making', 'it', 'viable', 'as', 'a', 'general', 'purpose', 'dimension', 'reduction', 'technique', 'for', 'machine', 'learning']] | [-0.057777923535844634, -0.03350168639451437, -0.12973752742547584, 0.09482053438758199, -0.16420302844617043, -0.21662452579315367, 0.011098985399665504, 0.39587211167846603, -0.23987447598884845, -0.28954547971297034, 0.10270040461274356, -0.219277393715135, -0.18846407757962294, 0.24909394890091371, -0.10901956292318887, 0.07980343108547144, 0.11335443251434414, 0.035923047986780775, -0.08666263612511771, -0.28576482424309113, 0.31130452449272933, 0.0636717283953752, 0.3793127792619768, 0.016017238550616063, 0.1582533660513381, 0.009790132758903435, 0.006362736751004283, 0.050042602683192695, -0.06721579134987798, 0.16687404532413716, 0.27937836060835713, 0.21083246538115816, 0.2613127853362768, -0.367916503557186, -0.20997540593339964, 0.10276852660389596, 0.1273723649578276, 0.09864886184276521, -0.08461491743202358, -0.25557290108596115, 0.10408637482919142, -0.11723815879902277, -0.10561357996822603, -0.200772558686848, 0.016989215127267372, -0.11091731771312911, -0.2962104838920875, 0.0061843572291492045, 0.0872226827938495, 0.07861568064471686, -0.025820633685537452, -0.1011355207060817, 0.03375059030093681, 0.06589344412693218, -0.017815456618608415, 0.09597783742857904, 0.11018040703459718, -0.060511755264610396, -0.17056170205489316, 0.3654654963402313, -0.056084200280889784, -0.26067659046886293, 0.19695063380942004, -0.012663583584322497, -0.17575519293782182, 0.15308919595822093, 0.2039280271628636, 0.10901619151405904, -0.0978514068250159, 0.18412354734964434, -0.028344936197859116, 0.16238618569432534, 0.026702426159861445, -0.016654761880770027, 0.03931398159053562, 0.2951874579945258, 0.17137809647996535, 0.10361932344927356, -0.06583590925224232, -0.1154726588852361, -0.22267592754000906, -0.17022311295136466, -0.21846925624614133, 0.05784908216446638, -0.17235669219045466, -0.15079448994077826, 0.3483675166472108, 0.10939377179000012, 0.17380309041760778, 0.09851050197451922, 0.3918275234086075, 0.03276115084661107, 0.057140366457959356, 0.13527979450193287, 0.16325934797835848, 0.10940460571698074, 0.08744632223107178, -0.1329721706208837, 0.061203713761642575, 0.10139824881421766] |
1,802.03427 | Structural matrix algebras, generalized flags and gradings | We show that a structural matrix algebra $A$ is isomorphic to the
endomorphism algebra of an algebraic-combinatorial object called a generalized
flag. If the flag is equipped with a group grading, an algebra grading is
induced on $A$. We classify the gradings obtained in this way as the orbits of
the action of a double semidirect product on a certain set. Under some
conditions on the associated graph, all good gradings on $A$ are of this type.
As a bi-product, we obtain a new approach to compute the automorphism group of
a structural matrix algebra.
| math.RA | we show that a structural matrix algebra a is isomorphic to the endomorphism algebra of an algebraiccombinatorial object called a generalized flag if the flag is equipped with a group grading an algebra grading is induced on a we classify the gradings obtained in this way as the orbits of the action of a double semidirect product on a certain set under some conditions on the associated graph all good gradings on a are of this type as a biproduct we obtain a new approach to compute the automorphism group of a structural matrix algebra | [['we', 'show', 'that', 'a', 'structural', 'matrix', 'algebra', 'a', 'is', 'isomorphic', 'to', 'the', 'endomorphism', 'algebra', 'of', 'an', 'algebraiccombinatorial', 'object', 'called', 'a', 'generalized', 'flag', 'if', 'the', 'flag', 'is', 'equipped', 'with', 'a', 'group', 'grading', 'an', 'algebra', 'grading', 'is', 'induced', 'on', 'a', 'we', 'classify', 'the', 'gradings', 'obtained', 'in', 'this', 'way', 'as', 'the', 'orbits', 'of', 'the', 'action', 'of', 'a', 'double', 'semidirect', 'product', 'on', 'a', 'certain', 'set', 'under', 'some', 'conditions', 'on', 'the', 'associated', 'graph', 'all', 'good', 'gradings', 'on', 'a', 'are', 'of', 'this', 'type', 'as', 'a', 'biproduct', 'we', 'obtain', 'a', 'new', 'approach', 'to', 'compute', 'the', 'automorphism', 'group', 'of', 'a', 'structural', 'matrix', 'algebra']] | [-0.18999546595334418, 0.03601404744427112, -0.10645295634473625, 0.022670878284292196, -0.1604432589546042, -0.08656911628909017, -0.002401485019608548, 0.3839081856765245, -0.3673397515753382, -0.1946012016091692, 0.15797048571985214, -0.2363297786073465, -0.20203798495625194, 0.19418515832604547, -0.16430486872988312, -0.09027214347335853, 0.11024491732547942, 0.19184766961384173, -0.14229634539714378, -0.22516369325212987, 0.42961979073129203, -0.002157426048315277, 0.21504741617919584, 0.014166569807199075, 0.1604438786443911, -0.01423519947811177, 0.009465802470712286, 0.022457579082172167, -0.1339562668052263, 0.11147594138930896, 0.21867409358291248, 0.07178515389953789, 0.20952758104417865, -0.33611292860617764, -0.08815353339734046, 0.16818270600940052, 0.11178050966149097, 0.02825699648574779, -0.0782945605141944, -0.27781724590612084, 0.11466807471098084, -0.2640608428732345, -0.09419909987696691, -0.07521250336676051, 0.026473246612831167, -0.048489642285398746, -0.28987551105061643, -0.060033819535257, 0.042637287090091326, 0.12151804832790634, -0.08859092283895925, -0.07172477716383965, -0.04182549982919897, 0.10315385118715073, -0.08712362880132309, 0.03162492136716059, 0.13381168448219175, -0.09855214972294082, -0.16160940578893612, 0.4142231820053176, -0.04198157414793968, -0.2599321520838298, 0.12946645645914892, -0.1408131208662924, -0.19884812199069482, 0.08633351207367684, 0.09291126518510281, 0.14542703875585605, -0.0646588120413454, 0.14809981756108373, -0.16237544906080553, 0.08426346051090054, 0.020021012900887352, -0.04336902998681916, 0.11339720616999426, 0.15627312152401396, 0.09748160446209735, 0.14443414849474243, 0.05382714718028805, 0.03391338816696876, -0.3578361131642994, -0.20960124032081742, -0.10884237960103507, 0.14750382711522672, -0.11906492113086738, -0.2171537237339898, 0.4545302116165036, 0.08363456714310144, 0.2216385885337858, 0.09749696850776672, 0.19425438182477497, 0.058337740974016734, 0.13870667640707995, 0.02529458709652413, 0.0997529325875037, 0.25271026599956187, -0.06683989536801452, -0.16297349181320323, -0.0012566911620333007, 0.2121119687774856] |
1,802.03428 | Cover time for the frog model on trees | The frog model is a branching random walk on a graph in which particles
branch only at unvisited sites. Consider an initial particle density of $\mu$
on the full $d$-ary tree of height $n$. If $\mu= \Omega( d^2)$, all of the
vertices are visited in time $\Theta(n\log n)$ with high probability.
Conversely, if $\mu = O(d)$ the cover time is $\exp(\Theta(\sqrt n))$ with high
probability.
| math.PR | the frog model is a branching random walk on a graph in which particles branch only at unvisited sites consider an initial particle density of mu on the full dary tree of height n if mu omega d2 all of the vertices are visited in time thetanlog n with high probability conversely if mu od the cover time is expthetasqrt n with high probability | [['the', 'frog', 'model', 'is', 'a', 'branching', 'random', 'walk', 'on', 'a', 'graph', 'in', 'which', 'particles', 'branch', 'only', 'at', 'unvisited', 'sites', 'consider', 'an', 'initial', 'particle', 'density', 'of', 'mu', 'on', 'the', 'full', 'dary', 'tree', 'of', 'height', 'n', 'if', 'mu', 'omega', 'd2', 'all', 'of', 'the', 'vertices', 'are', 'visited', 'in', 'time', 'thetanlog', 'n', 'with', 'high', 'probability', 'conversely', 'if', 'mu', 'od', 'the', 'cover', 'time', 'is', 'expthetasqrt', 'n', 'with', 'high', 'probability']] | [-0.14078911037335823, 0.2772773749008867, -0.014793541674162186, 0.001031187475688519, 0.013845314870455436, -0.19746648042743642, 0.13554768604300324, 0.37456746358010506, -0.21796731562409105, -0.2539547495396128, 0.06830089692662042, -0.3231449258765058, -0.04630782054219809, 0.03705675949135588, -0.01744190078701765, 0.032018287595184075, 0.0912822705826589, 0.1893429962385978, 0.07949981625591006, -0.2902188755498852, 0.22996234876798496, 0.012112820402733863, 0.199863873836067, 0.011202171430109984, 0.12546395655307505, 0.044858581342157866, 0.0071124946181144975, -0.017774962539237642, -0.1710722709133748, -0.0161978108274828, 0.14872269314669428, 0.11518735179884566, 0.23169405410982788, -0.37404405958359205, -0.14724620418356998, 0.2159544181019541, 0.14139510402160269, 0.04893575876855129, 0.042644935320057566, -0.24461390698949495, 0.11647273572383537, -0.06615384981509238, -0.1455570106941556, 0.09462926851674205, 0.17560167887085487, 0.037353794430456465, -0.33181438731059193, 0.022413042425695393, 0.023875154229620145, -0.0008274265343234653, 0.06359336112019798, -0.1682995961505979, -0.06840097569372683, 0.10106724700964397, -0.03843981546852442, 0.09805345343100647, 0.12548171794633306, -0.09553156637527521, -0.1296346680564244, 0.3498564642144456, -0.09388638817749563, -0.21079280525298108, 0.17295947679806323, -0.28117868429907256, -0.20138319097607146, 0.2001031587816893, 0.17200693011372573, 0.15530205642183623, -0.08280316391398036, 0.22224263053032614, -0.07994874477541696, 0.16614505576176775, 0.13234193915028183, -0.002531608193373633, 0.13906849488349898, 0.2037003100849688, 0.1814775818899747, 0.07137022424666654, -0.0923151538988191, -0.05562177701069722, -0.3175946144121034, -0.13750576473299472, -0.2769319967991332, 0.08370472118258476, -0.20202975173199933, -0.18694790455675314, 0.3098352240428092, 0.06888986959876049, 0.29656389432530555, 0.1551498740131686, 0.22206883419245954, 0.13001018334993175, -0.022418504963362857, 0.1245060416736773, 0.027212757011136367, 0.07982064987577144, 0.040848323764900364, -0.1850933506419616, 0.08891069848692813, 0.11643418715527606] |
1,802.03429 | Hybrid Controller for Wind Turbine Generators to Ensure Adequate
Frequency Response in Power Networks | Converter-interfaced power sources (CIPS) are hybrid control systems as they
may switch between multiple operating modes. Due to increasing penetration, the
hybrid behavior of CIPS, such as, wind turbine generators (WTG), may have
significant impact on power system dynamics. In this paper, the frequency
dynamics under inertia emulation and primary support from WTG is studied. A
mode switching for WTG to ensure adequate frequency response is proposed. The
switching instants are determined by our proposed concept of a region of safety
(ROS), which is the initial set of safe trajectories. The barrier certificate
methodology is employed to derive a new algorithm to obtain and enlarge the ROS
for the given desired safe limits and the worst-case disturbance scenarios.
Then critical switching instants and a safe recovery procedure are found. In
addition, the emulated inertia and load-damping effect is derived in the time
frame of inertia and primary frequency response, respectively. The theoretical
results under critical cases are consistent with simulations and can be used as
guidance for practical control design.
| cs.SY | converterinterfaced power sources cips are hybrid control systems as they may switch between multiple operating modes due to increasing penetration the hybrid behavior of cips such as wind turbine generators wtg may have significant impact on power system dynamics in this paper the frequency dynamics under inertia emulation and primary support from wtg is studied a mode switching for wtg to ensure adequate frequency response is proposed the switching instants are determined by our proposed concept of a region of safety ros which is the initial set of safe trajectories the barrier certificate methodology is employed to derive a new algorithm to obtain and enlarge the ros for the given desired safe limits and the worstcase disturbance scenarios then critical switching instants and a safe recovery procedure are found in addition the emulated inertia and loaddamping effect is derived in the time frame of inertia and primary frequency response respectively the theoretical results under critical cases are consistent with simulations and can be used as guidance for practical control design | [['converterinterfaced', 'power', 'sources', 'cips', 'are', 'hybrid', 'control', 'systems', 'as', 'they', 'may', 'switch', 'between', 'multiple', 'operating', 'modes', 'due', 'to', 'increasing', 'penetration', 'the', 'hybrid', 'behavior', 'of', 'cips', 'such', 'as', 'wind', 'turbine', 'generators', 'wtg', 'may', 'have', 'significant', 'impact', 'on', 'power', 'system', 'dynamics', 'in', 'this', 'paper', 'the', 'frequency', 'dynamics', 'under', 'inertia', 'emulation', 'and', 'primary', 'support', 'from', 'wtg', 'is', 'studied', 'a', 'mode', 'switching', 'for', 'wtg', 'to', 'ensure', 'adequate', 'frequency', 'response', 'is', 'proposed', 'the', 'switching', 'instants', 'are', 'determined', 'by', 'our', 'proposed', 'concept', 'of', 'a', 'region', 'of', 'safety', 'ros', 'which', 'is', 'the', 'initial', 'set', 'of', 'safe', 'trajectories', 'the', 'barrier', 'certificate', 'methodology', 'is', 'employed', 'to', 'derive', 'a', 'new', 'algorithm', 'to', 'obtain', 'and', 'enlarge', 'the', 'ros', 'for', 'the', 'given', 'desired', 'safe', 'limits', 'and', 'the', 'worstcase', 'disturbance', 'scenarios', 'then', 'critical', 'switching', 'instants', 'and', 'a', 'safe', 'recovery', 'procedure', 'are', 'found', 'in', 'addition', 'the', 'emulated', 'inertia', 'and', 'loaddamping', 'effect', 'is', 'derived', 'in', 'the', 'time', 'frame', 'of', 'inertia', 'and', 'primary', 'frequency', 'response', 'respectively', 'the', 'theoretical', 'results', 'under', 'critical', 'cases', 'are', 'consistent', 'with', 'simulations', 'and', 'can', 'be', 'used', 'as', 'guidance', 'for', 'practical', 'control', 'design']] | [-0.16103896777525809, 0.12412211859113807, -0.07945549600590958, 0.02859150028557478, -0.05749248895524125, -0.14909880442996704, 0.0665011764869105, 0.3600739566113293, -0.23396542475602905, -0.31203390179014595, 0.13107448393415616, -0.21399539758137168, -0.12637029248207102, 0.2518202814386507, -0.10216137738612524, 0.0910480663403538, 0.03659454998477588, 0.02410163596746396, 0.006722093432364688, -0.16334444998361214, 0.23598959685452062, 0.10825449388099492, 0.32536653675601857, 0.02379878710875475, 0.09321070534656563, -0.02661017386958116, 0.03918157979162663, 0.023483072458593757, -0.09285412362043763, 0.05767844855983758, 0.26123726843531136, 0.12655608794932977, 0.26984554376265796, -0.42570866712716204, -0.20505513181391904, 0.0843795435916434, 0.11691465119269163, 0.07331746824005807, -0.040025746155690024, -0.25255120843208045, 0.11218845794671739, -0.1906532545907412, -0.12306176469876216, -0.0810750157871289, 0.015971954274073948, 0.07301217404789341, -0.3458241187532008, 0.016510425643863146, 0.03145426283066971, 0.05971608962312605, -0.08519651897571232, -0.08620726179742094, -0.03619095860545099, 0.15452903251855266, 0.04283335963787632, -0.012869172781904244, 0.18377147923284293, -0.07538704961412944, -0.10551628439835983, 0.3830726147138861, -0.021669341754113162, -0.1884310395715513, 0.17853347357836435, -0.09966586953712374, -0.06514874734700872, 0.11481587599808647, 0.21956661764047378, 0.08408774167420507, -0.17099938731083988, 0.036241765442984894, 0.0473002391294218, 0.16795624793402453, 0.05349563759511899, 0.051991584527543225, 0.20886043182948946, 0.19105138050767004, 0.09486114878011813, 0.13234844776876162, -0.08010170780282093, -0.09392856725508116, -0.2969482841783688, -0.08678890832495936, -0.14636033231763793, -0.020448447265744914, -0.07768860213624205, -0.11295936816577254, 0.38897407163463577, 0.1781925569087289, 0.12707959046895953, 0.06920615089271967, 0.34394869629979774, 0.17939453373173012, 0.04057357930330306, 0.07811031483675866, 0.267931205259096, 0.08575181845581081, 0.10318852309964201, -0.25504722754118314, 0.12094706609657795, -0.002280434946248517] |
1,802.0343 | Coded Sparse Matrix Multiplication | In a large-scale and distributed matrix multiplication problem
$C=A^{\intercal}B$, where $C\in\mathbb{R}^{r\times t}$, the coded computation
plays an important role to effectively deal with "stragglers" (distributed
computations that may get delayed due to few slow or faulty processors).
However, existing coded schemes could destroy the significant sparsity that
exists in large-scale machine learning problems, and could result in much
higher computation overhead, i.e., $O(rt)$ decoding time. In this paper, we
develop a new coded computation strategy, we call \emph{sparse code}, which
achieves near \emph{optimal recovery threshold}, \emph{low computation
overhead}, and \emph{linear decoding time} $O(nnz(C))$. We implement our scheme
and demonstrate the advantage of the approach over both uncoded and current
fastest coded strategies.
| cs.DC cs.NA | in a largescale and distributed matrix multiplication problem caintercalb where cinmathbbrrtimes t the coded computation plays an important role to effectively deal with stragglers distributed computations that may get delayed due to few slow or faulty processors however existing coded schemes could destroy the significant sparsity that exists in largescale machine learning problems and could result in much higher computation overhead ie ort decoding time in this paper we develop a new coded computation strategy we call emphsparse code which achieves near emphoptimal recovery threshold emphlow computation overhead and emphlinear decoding time onnzc we implement our scheme and demonstrate the advantage of the approach over both uncoded and current fastest coded strategies | [['in', 'a', 'largescale', 'and', 'distributed', 'matrix', 'multiplication', 'problem', 'caintercalb', 'where', 'cinmathbbrrtimes', 't', 'the', 'coded', 'computation', 'plays', 'an', 'important', 'role', 'to', 'effectively', 'deal', 'with', 'stragglers', 'distributed', 'computations', 'that', 'may', 'get', 'delayed', 'due', 'to', 'few', 'slow', 'or', 'faulty', 'processors', 'however', 'existing', 'coded', 'schemes', 'could', 'destroy', 'the', 'significant', 'sparsity', 'that', 'exists', 'in', 'largescale', 'machine', 'learning', 'problems', 'and', 'could', 'result', 'in', 'much', 'higher', 'computation', 'overhead', 'ie', 'ort', 'decoding', 'time', 'in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'coded', 'computation', 'strategy', 'we', 'call', 'emphsparse', 'code', 'which', 'achieves', 'near', 'emphoptimal', 'recovery', 'threshold', 'emphlow', 'computation', 'overhead', 'and', 'emphlinear', 'decoding', 'time', 'onnzc', 'we', 'implement', 'our', 'scheme', 'and', 'demonstrate', 'the', 'advantage', 'of', 'the', 'approach', 'over', 'both', 'uncoded', 'and', 'current', 'fastest', 'coded', 'strategies']] | [-0.21459943859265485, 0.03382005600310507, -0.03372901012915947, 0.041076734353395164, -0.07254584585188316, -0.24684569059760061, 0.12040314745102419, 0.41406300246988964, -0.32323684085399734, -0.318902716100421, 0.12787638966916898, -0.17967707822790877, -0.1974404803135458, 0.18172312060311233, -0.1752934200804544, 0.09237766664030903, 0.1004163291531726, 0.017741094155390876, -0.1012199851427945, -0.3250744741179322, 0.21146782022610375, 0.13681429542959966, 0.30674595897590073, 0.015917291546479688, 0.09574136391939989, 0.009407587528843945, -0.05818219220590427, -0.04152896930250006, -0.03583441614325547, 0.09049051937138781, 0.3320729798090499, 0.21724286777129687, 0.3412731630608029, -0.45297664222777434, -0.193547981466517, 0.13480997111631232, 0.2289860344773859, 0.1590109732751777, -0.08718609018678512, -0.20407085951178447, 0.15582912790571946, -0.20587648106140827, -0.003117404134790285, -0.08892127996900144, -0.025362030504732777, -0.048635169168413026, -0.31581791103262147, 0.029488760461056723, 0.05226095350151625, -0.006159576630100198, 0.007510451681125875, -0.10457963171765344, 0.10248272114330817, 0.0820126389900923, -0.011697074174178751, 0.06596896514604124, 0.10949490703813253, -0.06174418247099795, -0.17156368486343995, 0.3601713748093387, -0.019053972881594928, -0.17803870615711725, 0.14233194596193935, -0.03702886705927619, -0.15391083482926318, 0.16363958294135988, 0.2675172281237917, 0.09352314742623803, -0.07243061304485443, 0.05852956287808494, 0.009242418700606998, 0.21675144993366863, 0.0830252539973125, 0.10851578475104286, 0.08592774169177773, 0.1740421825003118, 0.12650420631222223, 0.13711405521549216, -0.09251888428276422, -0.15542700411239213, -0.19541651728229786, -0.14327705575584715, -0.15700020367672685, -0.022697299816047584, -0.1339632529254582, -0.130718058991938, 0.32069878978985167, 0.19234254865462833, 0.13837336962444519, 0.12320892658370863, 0.3947511805390187, 0.07078671202580487, 0.11029534730547612, 0.22088784011029597, 0.13696052189788208, 0.06921470547607596, 0.14149133714050516, -0.232807183740746, 0.09302566935726946, 0.034284582682789104] |
1,802.03431 | Extremal digraphs avoiding an orientation of $C_4$ | Let $P_{2,2}$ be the orientation of $C_4$ which consists of two 2-paths with
the same initial and terminal vertices. In this paper, we determine the maximum
size of $P_{2,2}$-free digraphs of order $n$ as well as the extremal digraphs
attaining the maximum size when $n\ge 13$.
| math.CO | let p_22 be the orientation of c_4 which consists of two 2paths with the same initial and terminal vertices in this paper we determine the maximum size of p_22free digraphs of order n as well as the extremal digraphs attaining the maximum size when nge 13 | [['let', 'p_22', 'be', 'the', 'orientation', 'of', 'c_4', 'which', 'consists', 'of', 'two', '2paths', 'with', 'the', 'same', 'initial', 'and', 'terminal', 'vertices', 'in', 'this', 'paper', 'we', 'determine', 'the', 'maximum', 'size', 'of', 'p_22free', 'digraphs', 'of', 'order', 'n', 'as', 'well', 'as', 'the', 'extremal', 'digraphs', 'attaining', 'the', 'maximum', 'size', 'when', 'nge', '13']] | [-0.1633865432192882, 0.1884383929686414, 0.03237783869521486, -0.03697331931907684, -0.04252299558785227, -0.1453322815294895, -0.007959578100902339, 0.32618159676591557, -0.25139737526575723, -0.3605017211288214, 0.13017316681798546, -0.3067866115934319, -0.043425873258254595, 0.07312063910067082, -0.0729738792611493, 0.020383545673555797, 0.0292268722007672, 0.14006198078617066, -0.04189307307824493, -0.2784520438587707, 0.2967943880603545, -0.01585454110884004, 0.18913468246658643, 0.07076324121509162, 0.09143881754328807, 0.044854503783345635, 0.08092142687075668, 0.09001528719543583, -0.20084358830418853, 0.08572265774839455, 0.25101930855049026, 0.11791019828783142, 0.22041609726018377, -0.34028384304708903, -0.10309201137731887, 0.21408308384319147, 0.16771266283984815, 0.049389339841177896, 0.08051768540042556, -0.1803152972418401, 0.1412500193549527, -0.0996816537860367, -0.17143503841426638, 0.07022259829358922, 0.10066226000587146, 0.09231889918446541, -0.30066107611896264, 0.017889607925381926, 0.11538709416830291, 0.05276371747927947, -9.676652650038401e-05, -0.1842369321733713, -0.10336388540454208, 0.12906138908130946, -0.00777867477801111, 0.0459788316136433, -0.004353371904128127, -0.09754269488880205, -0.1452272388463219, 0.35244978090955154, -0.020017018088967435, -0.11969706666034957, 0.08240553672528929, -0.19657924564348328, -0.12026933177063863, 0.07884403224517074, 0.16244885770397055, 0.2057928280180527, -0.07528059235935669, 0.09336733832412089, -0.08101827362034884, 0.14892734789755196, 0.17270045479138693, 0.01132950335741043, 0.12823016577296786, 0.15120552439346083, 0.1734500148230129, 0.2097360756015405, -0.05624732499321302, 0.01578314196732309, -0.3451307973927922, -0.12491594538506534, -0.23972933012992143, 0.12639394452691907, -0.21582004656568946, -0.1724881379554669, 0.41262263084451356, 0.09622808943192164, 0.25118914014763305, 0.10310409636909348, 0.19060150185186003, 0.061035973366556896, 0.01736301748185522, 0.16654115385479398, 0.14984174371800488, 0.17267744280397893, -0.023803916511436304, -0.24019318220929967, 0.10765961406545507, 0.10152316952331199] |
1,802.03432 | Asymptotic analysis and energy quantization for the Lane-Emden problem
in dimension two | We complete the study of the asymptotic behavior, as $p\rightarrow +\infty$,
of the positive solutions to \[ \left\{\begin{array}{lr}-\Delta u= u^p &
\mbox{in}\Omega\\ u=0 &\mbox{on}\partial \Omega \end{array}\right. \] when
$\Omega$ is any smooth bounded domain in $\mathbb R^2$, started in [4]. In
particular we show quantization of the energy to multiples of $8\pi e$ and
prove convergence to $\sqrt{e}$ of the $L^{\infty}$-norm, thus confirming the
conjecture made in [4].
| math.AP | we complete the study of the asymptotic behavior as prightarrow infty of the positive solutions to leftbeginarraylrdelta u up mboxinomega u0 mboxonpartial omega endarrayright when omega is any smooth bounded domain in mathbb r2 started in 4 in particular we show quantization of the energy to multiples of 8pi e and prove convergence to sqrte of the linftynorm thus confirming the conjecture made in 4 | [['we', 'complete', 'the', 'study', 'of', 'the', 'asymptotic', 'behavior', 'as', 'prightarrow', 'infty', 'of', 'the', 'positive', 'solutions', 'to', 'leftbeginarraylrdelta', 'u', 'up', 'mboxinomega', 'u0', 'mboxonpartial', 'omega', 'endarrayright', 'when', 'omega', 'is', 'any', 'smooth', 'bounded', 'domain', 'in', 'mathbb', 'r2', 'started', 'in', '4', 'in', 'particular', 'we', 'show', 'quantization', 'of', 'the', 'energy', 'to', 'multiples', 'of', '8pi', 'e', 'and', 'prove', 'convergence', 'to', 'sqrte', 'of', 'the', 'linftynorm', 'thus', 'confirming', 'the', 'conjecture', 'made', 'in', '4']] | [-0.2135201783134387, 0.053404186105315325, -0.026739745701734836, 0.00035565275913820816, -0.01835356647005448, -0.1377693475295718, 0.016974390871249714, 0.29174833435278674, -0.2682259967120794, -0.1792448783866488, 0.10916409563416472, -0.3481121107040403, -0.05854660506145312, 0.13649691412440287, -0.09115940449902644, 0.06529076936153265, 0.0024262492115107864, 0.10843517220077606, -0.06093298019124911, -0.24043817100330042, 0.30698519287487636, -0.11785296962524835, 0.17966122118254693, 0.1350714758754923, 0.06570720328734471, -0.036468284172364154, 0.06250037469256382, -0.04061060635229716, -0.27349434179755355, 0.012334595033182547, 0.22320590844521157, 0.05761591599036295, 0.30238452525093007, -0.37674234410604607, -0.1340577764615703, 0.18714474246192436, 0.19540194997993798, -0.041912927414075686, 0.0412963575988005, -0.3024300862318621, 0.18828108145927008, -0.08488331883787535, -0.2226252218278555, -0.02835007325674479, 0.11995529741621934, 0.05476567489453233, -0.34622669480741025, 0.09406982759157052, 0.1423362989211455, 0.02796709295362234, -0.11401842162729456, -0.15912399810667222, -0.04021663053964193, 0.07452491103322245, 0.07421866728064533, 0.1760216108039738, -0.0034801415311029324, -0.1045523444047341, -0.02078292414975854, 0.3377507098305684, -0.11808620357456115, -0.22793938692372578, 0.08766498120071796, -0.28727325669561443, -0.12078269880551558, 0.09259297943566568, 0.09908513837637237, 0.16661012005777312, -0.0385275701466106, 0.2577325858596641, -0.025856730645934408, 0.13684313747172172, 0.15197426649526907, -0.02022036427918535, 0.030206018356749645, 0.10672995614407298, 0.1329059766462216, 0.10317942372594889, -0.021849778889176937, -0.011738201728663765, -0.37961147944801127, -0.14294539394860084, -0.14507969428355305, 0.2099824499195585, -0.09392283806698218, -0.14218913812476855, 0.2835274180254111, 0.05667268904642417, 0.2257388306495089, 0.11292563994916585, 0.17343776496306348, 0.112344560927998, -0.048400939671465984, 0.115641843720984, 0.15217900553073446, 0.12083747323888999, 0.10650218127725217, -0.2273047066329477, -0.050620293610084514, 0.07820485579543926] |
1,802.03433 | GPU Accelerated Finite Element Assembly with Runtime Compilation | In recent years, high performance scientific computing on graphics processing
units (GPUs) have gained widespread acceptance. These devices are designed to
offer massively parallel threads for running code with general purpose. There
are many researches focus on finite element method with GPUs. However, most of
the works are specific to certain problems and applications. Some works propose
methods for finite element assembly that is general for a wide range of finite
element models. But the development of finite element code is dependent on the
hardware architectures. It is usually complicated and error prone using the
libraries provided by the hardware vendors. In this paper, we present
architecture and implementation of finite element assembly for partial
differential equations (PDEs) based on symbolic computation and runtime
compilation technique on GPU. User friendly programming interface with symbolic
computation is provided. At the same time, high computational efficiency is
achieved by using runtime compilation technique. As far as we know, it is the
first work using this technique to accelerate finite element assembly for
solving PDEs. Experiments show that a one to two orders of speedup is achieved
for the problems studied in the paper.
| cs.MS math.NA | in recent years high performance scientific computing on graphics processing units gpus have gained widespread acceptance these devices are designed to offer massively parallel threads for running code with general purpose there are many researches focus on finite element method with gpus however most of the works are specific to certain problems and applications some works propose methods for finite element assembly that is general for a wide range of finite element models but the development of finite element code is dependent on the hardware architectures it is usually complicated and error prone using the libraries provided by the hardware vendors in this paper we present architecture and implementation of finite element assembly for partial differential equations pdes based on symbolic computation and runtime compilation technique on gpu user friendly programming interface with symbolic computation is provided at the same time high computational efficiency is achieved by using runtime compilation technique as far as we know it is the first work using this technique to accelerate finite element assembly for solving pdes experiments show that a one to two orders of speedup is achieved for the problems studied in the paper | [['in', 'recent', 'years', 'high', 'performance', 'scientific', 'computing', 'on', 'graphics', 'processing', 'units', 'gpus', 'have', 'gained', 'widespread', 'acceptance', 'these', 'devices', 'are', 'designed', 'to', 'offer', 'massively', 'parallel', 'threads', 'for', 'running', 'code', 'with', 'general', 'purpose', 'there', 'are', 'many', 'researches', 'focus', 'on', 'finite', 'element', 'method', 'with', 'gpus', 'however', 'most', 'of', 'the', 'works', 'are', 'specific', 'to', 'certain', 'problems', 'and', 'applications', 'some', 'works', 'propose', 'methods', 'for', 'finite', 'element', 'assembly', 'that', 'is', 'general', 'for', 'a', 'wide', 'range', 'of', 'finite', 'element', 'models', 'but', 'the', 'development', 'of', 'finite', 'element', 'code', 'is', 'dependent', 'on', 'the', 'hardware', 'architectures', 'it', 'is', 'usually', 'complicated', 'and', 'error', 'prone', 'using', 'the', 'libraries', 'provided', 'by', 'the', 'hardware', 'vendors', 'in', 'this', 'paper', 'we', 'present', 'architecture', 'and', 'implementation', 'of', 'finite', 'element', 'assembly', 'for', 'partial', 'differential', 'equations', 'pdes', 'based', 'on', 'symbolic', 'computation', 'and', 'runtime', 'compilation', 'technique', 'on', 'gpu', 'user', 'friendly', 'programming', 'interface', 'with', 'symbolic', 'computation', 'is', 'provided', 'at', 'the', 'same', 'time', 'high', 'computational', 'efficiency', 'is', 'achieved', 'by', 'using', 'runtime', 'compilation', 'technique', 'as', 'far', 'as', 'we', 'know', 'it', 'is', 'the', 'first', 'work', 'using', 'this', 'technique', 'to', 'accelerate', 'finite', 'element', 'assembly', 'for', 'solving', 'pdes', 'experiments', 'show', 'that', 'a', 'one', 'to', 'two', 'orders', 'of', 'speedup', 'is', 'achieved', 'for', 'the', 'problems', 'studied', 'in', 'the', 'paper']] | [-0.11395313503971587, 0.034880523745419154, -0.048212211579084396, 0.01240724710935327, -0.12852799604739507, -0.17452986564740772, -0.0057436845421361985, 0.43421107496949235, -0.2737079162098204, -0.35478497554513955, 0.1470273703376943, -0.22409304283578826, -0.10756518384588014, 0.2900949100383523, -0.06698248726748544, 0.12047195035040242, 0.1490760771600354, -0.018823453549451696, -0.08773979068007223, -0.3127645106830132, 0.2709757438933974, 0.06487454139963962, 0.285355905368339, 0.06317713596926348, 0.1333269961348964, -0.047824155734315595, -0.050655900851789254, 0.012971112368072515, -0.08527701412955682, 0.15361418478015362, 0.32621032400605654, 0.1809121321189505, 0.32831064410780736, -0.4564097114151139, -0.19533893768309923, 0.03825372094727311, 0.1515377904361611, 0.09651430804984576, -0.11256263314085617, -0.19869520534707613, 0.15326074109637028, -0.1870337103673925, -0.04416487617922535, -0.09440357893454253, 0.010555324793174005, 0.01933437438269697, -0.2313089427777142, -0.018718681752886525, 0.016312059900035876, 0.1253351095017943, 0.036768500143598094, -0.14628494561269528, 0.08566326288267463, 0.10397406896857876, -0.012260337852682743, 0.0057507800651441145, 0.1213543379084446, -0.07579629059030103, -0.15037105831498015, 0.3968721696941172, -0.02447299253566103, -0.22922598461849683, 0.21314770575573622, -0.056090655305172335, -0.17689852357759137, 0.09973556435842515, 0.20562327717167583, 0.14260406354295957, -0.14606304091513547, 0.1365884417955671, 0.04095043885614235, 0.18006097272048213, 0.0368639200777108, -0.006275673054953481, 0.13341214142725144, 0.23315955463952887, 0.05949830192784871, 0.117067842555954, -0.007326190875531101, -0.12127047529960958, -0.2391661411268315, -0.1715122976130684, -0.19557463689536558, -0.03537870198244434, -0.06545847032084472, -0.18794773724320205, 0.3467483665618597, 0.18977466163096562, 0.09637118211376886, 0.08558020365292801, 0.38442741575314426, 0.11451874280480073, 0.14307891466552441, 0.11562492319806943, 0.14259043883081862, 0.08092109145869682, 0.16338457363408976, -0.2012286445928045, 0.07307269412314724, 0.07292132831485795] |
1,802.03434 | Superconducting properties of under- and over-doped
Ba$_{x}$K$_{1-x}$BiO$_{3}$ perovskite oxide | In the present study, we investigate the thermodynamic properties of the
Ba$_{x}$K$_{1-x}$BiO$_{3}$ (BKBO) superconductor in the under- ($x=0.5$) and
over-doped ($x=0.7$) regime, within the framework of the Migdal-Eliashberg
formalism. The analysis is conducted to verify that the electron-phonon pairing
mechanism is responsible for the induction of the superconducting phase in the
mentioned compound. In particular, we show that BKBO is characterized by the
relatively high critical value of the Coulomb pseudopotential, which changes
with doping level and does not follow the Morel-Anderson model. In what
follows, the corresponding superconducting band gap size and related
dimensionless ratio are estimated to increase with the doping, in agreement
with the experimental predictions. Moreover the effective mass of electrons is
found to take on high values in the entire doping and temperature region.
Finally, the characteristic dimensionless ratios for the superconducting band
gap, the critical magnetic field and the specific heat for the superconducting
state are predicted to exceed the limits set within the
Bardeen-Cooper-Schrieffer theory, suggesting pivotal role of the
strong-coupling and retardation effects in the analyzed compound. Presented
results supplement our previous investigations and account for the
strong-coupling phonon-mediated character of the superconducting phase in BKBO
at any doping level.
| cond-mat.supr-con | in the present study we investigate the thermodynamic properties of the ba_xk_1xbio_3 bkbo superconductor in the under x05 and overdoped x07 regime within the framework of the migdaleliashberg formalism the analysis is conducted to verify that the electronphonon pairing mechanism is responsible for the induction of the superconducting phase in the mentioned compound in particular we show that bkbo is characterized by the relatively high critical value of the coulomb pseudopotential which changes with doping level and does not follow the morelanderson model in what follows the corresponding superconducting band gap size and related dimensionless ratio are estimated to increase with the doping in agreement with the experimental predictions moreover the effective mass of electrons is found to take on high values in the entire doping and temperature region finally the characteristic dimensionless ratios for the superconducting band gap the critical magnetic field and the specific heat for the superconducting state are predicted to exceed the limits set within the bardeencooperschrieffer theory suggesting pivotal role of the strongcoupling and retardation effects in the analyzed compound presented results supplement our previous investigations and account for the strongcoupling phononmediated character of the superconducting phase in bkbo at any doping level | [['in', 'the', 'present', 'study', 'we', 'investigate', 'the', 'thermodynamic', 'properties', 'of', 'the', 'ba_xk_1xbio_3', 'bkbo', 'superconductor', 'in', 'the', 'under', 'x05', 'and', 'overdoped', 'x07', 'regime', 'within', 'the', 'framework', 'of', 'the', 'migdaleliashberg', 'formalism', 'the', 'analysis', 'is', 'conducted', 'to', 'verify', 'that', 'the', 'electronphonon', 'pairing', 'mechanism', 'is', 'responsible', 'for', 'the', 'induction', 'of', 'the', 'superconducting', 'phase', 'in', 'the', 'mentioned', 'compound', 'in', 'particular', 'we', 'show', 'that', 'bkbo', 'is', 'characterized', 'by', 'the', 'relatively', 'high', 'critical', 'value', 'of', 'the', 'coulomb', 'pseudopotential', 'which', 'changes', 'with', 'doping', 'level', 'and', 'does', 'not', 'follow', 'the', 'morelanderson', 'model', 'in', 'what', 'follows', 'the', 'corresponding', 'superconducting', 'band', 'gap', 'size', 'and', 'related', 'dimensionless', 'ratio', 'are', 'estimated', 'to', 'increase', 'with', 'the', 'doping', 'in', 'agreement', 'with', 'the', 'experimental', 'predictions', 'moreover', 'the', 'effective', 'mass', 'of', 'electrons', 'is', 'found', 'to', 'take', 'on', 'high', 'values', 'in', 'the', 'entire', 'doping', 'and', 'temperature', 'region', 'finally', 'the', 'characteristic', 'dimensionless', 'ratios', 'for', 'the', 'superconducting', 'band', 'gap', 'the', 'critical', 'magnetic', 'field', 'and', 'the', 'specific', 'heat', 'for', 'the', 'superconducting', 'state', 'are', 'predicted', 'to', 'exceed', 'the', 'limits', 'set', 'within', 'the', 'bardeencooperschrieffer', 'theory', 'suggesting', 'pivotal', 'role', 'of', 'the', 'strongcoupling', 'and', 'retardation', 'effects', 'in', 'the', 'analyzed', 'compound', 'presented', 'results', 'supplement', 'our', 'previous', 'investigations', 'and', 'account', 'for', 'the', 'strongcoupling', 'phononmediated', 'character', 'of', 'the', 'superconducting', 'phase', 'in', 'bkbo', 'at', 'any', 'doping', 'level']] | [-0.1335029596313169, 0.16257891799287624, -0.03069584404845361, 0.059189585500814934, 0.00041311918235174854, -0.11428686249430994, 0.13181284113076744, 0.334840083057631, -0.212781545401988, -0.28534597829364394, -0.0018625216010948454, -0.29980597482894417, -0.08572673662185516, 0.19358834572378736, 0.025545584484406185, 0.011206165751473793, -0.03425102619862906, 0.01764445445424288, -0.1265305683221098, -0.2042355501444592, 0.3450167588901478, 0.06769515214754003, 0.3423734358701931, 0.12733610815514707, 0.009954220867164585, -0.019721927872041658, 0.09301921078336559, 0.033883056263629426, -0.1783742497949677, 0.02749809132147879, 0.28148325409137565, -0.05500237219634333, 0.21643702079522975, -0.4027874582656184, -0.22216858931731584, 0.0196245721260998, 0.13619929096395417, 0.10783087494913773, -0.025475027009949316, -0.2569850713302077, 0.08462195411117804, -0.14550465746540386, -0.12192386602246373, -0.07073205408440637, -0.021303638954271505, -0.006506302024532414, -0.24930342704732428, 0.0947368225070579, 0.05062677547197827, 0.05456673465009864, -0.12619316553084028, -0.1453708388726227, -0.026826177985046287, 0.07591366703260918, 0.07180682079788127, 0.04174964266326706, 0.15437532686367061, -0.13542226378862954, -0.0410385547444576, 0.34908667233373436, -0.0442286498517354, -0.08294214101921653, 0.12471142613652106, -0.20731983774066048, -0.09511228215082415, 0.13862339021906503, 0.08313026167547369, 0.05187055110997919, -0.12159438830163634, 0.10198043385070359, -0.00726230415201993, 0.19635190750348705, 0.005411944512458404, 0.07599307279715319, 0.21435919362690528, 0.21029036377713425, -0.014186406946427435, 0.1190156632813397, -0.11489176904374011, -0.09150303616806181, -0.29851391570338487, -0.1431742679369192, -0.1929136361310268, 0.007764951336124499, -0.09443586193714398, -0.1613959305259228, 0.38614100959268993, 0.21027373122795287, 0.1944906999730049, -0.018829223418926667, 0.19875775344969174, 0.17501090017715482, 0.07434936256946198, 0.05205255198263924, 0.30481697249758455, 0.1447258775885103, 0.10710677730836621, -0.32450811638097676, 0.08686010830094848, 0.026018979574306583] |
1,802.03435 | Mean-field Games for Bio-inspired Collective Decision-making in
Dynamical Networks | Given a large number of homogeneous players that are distributed across three
possible states, we consider the problem in which these players have to control
their transition rates, while minimizing a cost. The optimal transition rates
are based on the players' knowledge of their current state and of the
distribution of all the other players, and this introduces mean-field terms in
the running and the terminal cost. The first contribution involves a mean-field
game model that brings together macroscopic and microscopic dynamics. We obtain
the mean-field equilibrium associated with this model, by solving the
corresponding initial-terminal value problem. We perform an asymptotic analysis
to obtain a stationary equilibrium for the system. The second contribution
involves the study of the microscopic dynamics of the system for a finite
number of players that interact in a structured environment modeled by an
interaction topology. The third contribution is the specialization of the model
to describe honeybee swarms, virus propagation, and cascading failures in
interconnected smart-grids. A numerical analysis is conducted which involves
two types of cyber-attacks. We simulate in which ways failures propagate across
the interconnected smart grids and the impact on the grids frequencies. We
reframe our analysis within the context of Lyapunov's linearisation method and
stability theory of nonlinear systems and Kuramoto coupled oscillators model.
| cs.SY cs.MA | given a large number of homogeneous players that are distributed across three possible states we consider the problem in which these players have to control their transition rates while minimizing a cost the optimal transition rates are based on the players knowledge of their current state and of the distribution of all the other players and this introduces meanfield terms in the running and the terminal cost the first contribution involves a meanfield game model that brings together macroscopic and microscopic dynamics we obtain the meanfield equilibrium associated with this model by solving the corresponding initialterminal value problem we perform an asymptotic analysis to obtain a stationary equilibrium for the system the second contribution involves the study of the microscopic dynamics of the system for a finite number of players that interact in a structured environment modeled by an interaction topology the third contribution is the specialization of the model to describe honeybee swarms virus propagation and cascading failures in interconnected smartgrids a numerical analysis is conducted which involves two types of cyberattacks we simulate in which ways failures propagate across the interconnected smart grids and the impact on the grids frequencies we reframe our analysis within the context of lyapunovs linearisation method and stability theory of nonlinear systems and kuramoto coupled oscillators model | [['given', 'a', 'large', 'number', 'of', 'homogeneous', 'players', 'that', 'are', 'distributed', 'across', 'three', 'possible', 'states', 'we', 'consider', 'the', 'problem', 'in', 'which', 'these', 'players', 'have', 'to', 'control', 'their', 'transition', 'rates', 'while', 'minimizing', 'a', 'cost', 'the', 'optimal', 'transition', 'rates', 'are', 'based', 'on', 'the', 'players', 'knowledge', 'of', 'their', 'current', 'state', 'and', 'of', 'the', 'distribution', 'of', 'all', 'the', 'other', 'players', 'and', 'this', 'introduces', 'meanfield', 'terms', 'in', 'the', 'running', 'and', 'the', 'terminal', 'cost', 'the', 'first', 'contribution', 'involves', 'a', 'meanfield', 'game', 'model', 'that', 'brings', 'together', 'macroscopic', 'and', 'microscopic', 'dynamics', 'we', 'obtain', 'the', 'meanfield', 'equilibrium', 'associated', 'with', 'this', 'model', 'by', 'solving', 'the', 'corresponding', 'initialterminal', 'value', 'problem', 'we', 'perform', 'an', 'asymptotic', 'analysis', 'to', 'obtain', 'a', 'stationary', 'equilibrium', 'for', 'the', 'system', 'the', 'second', 'contribution', 'involves', 'the', 'study', 'of', 'the', 'microscopic', 'dynamics', 'of', 'the', 'system', 'for', 'a', 'finite', 'number', 'of', 'players', 'that', 'interact', 'in', 'a', 'structured', 'environment', 'modeled', 'by', 'an', 'interaction', 'topology', 'the', 'third', 'contribution', 'is', 'the', 'specialization', 'of', 'the', 'model', 'to', 'describe', 'honeybee', 'swarms', 'virus', 'propagation', 'and', 'cascading', 'failures', 'in', 'interconnected', 'smartgrids', 'a', 'numerical', 'analysis', 'is', 'conducted', 'which', 'involves', 'two', 'types', 'of', 'cyberattacks', 'we', 'simulate', 'in', 'which', 'ways', 'failures', 'propagate', 'across', 'the', 'interconnected', 'smart', 'grids', 'and', 'the', 'impact', 'on', 'the', 'grids', 'frequencies', 'we', 'reframe', 'our', 'analysis', 'within', 'the', 'context', 'of', 'lyapunovs', 'linearisation', 'method', 'and', 'stability', 'theory', 'of', 'nonlinear', 'systems', 'and', 'kuramoto', 'coupled', 'oscillators', 'model']] | [-0.17045846722680622, 0.08452918721979297, -0.07938041888334066, 0.034067112491705465, -0.021412224687252925, -0.1286012920024413, 0.07717994221858245, 0.3200961833811043, -0.2733333207168165, -0.3064762394370459, 0.08859884656832998, -0.2858836269201972, -0.15810628625168247, 0.12469648377356232, -0.030147924054213845, 0.03700008996431585, 0.04571841800776876, 0.025134200706782045, 0.017532968088803884, -0.22608716613243152, 0.34292103676288604, 0.0203166898823056, 0.27635900463438895, 0.00245108496001704, 0.10742074436569046, -0.00035243189271330557, -0.008248945836861244, 0.03913571183987519, -0.10534009064498621, 0.12172052314886866, 0.2291029195258259, 0.11402443520154665, 0.32822319907876096, -0.4623290080159346, -0.2073806254454305, 0.10074421265989403, 0.11201233127960614, 0.1260217648520674, -0.010473980590653232, -0.2644355403342084, 0.049129031934758004, -0.19514272103595295, -0.13698395115767267, -0.061190264797813004, -0.030961063045303328, 0.06801790372271604, -0.27592530497567397, 0.047518719270581676, 0.03770979886078145, 0.054776036661993016, -0.07163317267408717, -0.0785109799618563, -0.020934633541826123, 0.1887715915174476, 0.026662688436330444, -0.051875220710698895, 0.12377507762687508, -0.13733973357528362, -0.12996137627018572, 0.3757115967275801, -0.0349506286525594, -0.1997312568476267, 0.18436902206038586, -0.09005014393432392, -0.12279207865211451, 0.11873689777583371, 0.23173037354146767, 0.1327094629920462, -0.15442591727978908, 0.05410013722569168, -0.01745933701423493, 0.16518178568700345, 0.001006955855360655, -0.005179183303039068, 0.16741308414542647, 0.2156403567206776, 0.09313490373522008, 0.150447785614437, -0.03063364320453126, -0.2132219823262824, -0.2834242179937591, -0.09928632297805537, -0.1526659035380107, 0.027594799485392695, -0.10205340247316216, -0.16992391280124886, 0.42610477954671483, 0.17449186549316079, 0.16870697433015802, 0.08577600953840459, 0.30233668044065864, 0.11644344817532583, 0.005535982331591789, 0.06890827562947209, 0.23224605503492057, 0.1056732784741271, 0.10815916915324073, -0.26057182300673193, 0.08998245810741716, 0.05844123345510338] |
1,802.03436 | The language (and series) of Hammersley-type processes | We study languages and formal power series associated to (variants of)
Hammersley's process. We show that the ordinary Hammersley process yields a
regular language and the Hammersley tree process yields deterministic
context-free (but non-regular) languages. For the extension to intervals of the
Hammersley process we show that there are two relevant formal languages. One of
them leads to the same class of languages as the ordinary Hammersley tree
process. The other one yields non-context-free languages. The results are
motivated by the problem of studying the analog of the famous Ulam-Hammersley
problem for heapable sequences. Towards this goal we also give an algorithm for
computing formal power series associated to the variants of Hammersley's
process. We employ these algorithms to settle the nature of the scaling
constant, conjectured in previous work to be the golden ratio. Our results
provide experimental support to this conjecture.
| cs.FL cs.DM math.CO math.PR | we study languages and formal power series associated to variants of hammersleys process we show that the ordinary hammersley process yields a regular language and the hammersley tree process yields deterministic contextfree but nonregular languages for the extension to intervals of the hammersley process we show that there are two relevant formal languages one of them leads to the same class of languages as the ordinary hammersley tree process the other one yields noncontextfree languages the results are motivated by the problem of studying the analog of the famous ulamhammersley problem for heapable sequences towards this goal we also give an algorithm for computing formal power series associated to the variants of hammersleys process we employ these algorithms to settle the nature of the scaling constant conjectured in previous work to be the golden ratio our results provide experimental support to this conjecture | [['we', 'study', 'languages', 'and', 'formal', 'power', 'series', 'associated', 'to', 'variants', 'of', 'hammersleys', 'process', 'we', 'show', 'that', 'the', 'ordinary', 'hammersley', 'process', 'yields', 'a', 'regular', 'language', 'and', 'the', 'hammersley', 'tree', 'process', 'yields', 'deterministic', 'contextfree', 'but', 'nonregular', 'languages', 'for', 'the', 'extension', 'to', 'intervals', 'of', 'the', 'hammersley', 'process', 'we', 'show', 'that', 'there', 'are', 'two', 'relevant', 'formal', 'languages', 'one', 'of', 'them', 'leads', 'to', 'the', 'same', 'class', 'of', 'languages', 'as', 'the', 'ordinary', 'hammersley', 'tree', 'process', 'the', 'other', 'one', 'yields', 'noncontextfree', 'languages', 'the', 'results', 'are', 'motivated', 'by', 'the', 'problem', 'of', 'studying', 'the', 'analog', 'of', 'the', 'famous', 'ulamhammersley', 'problem', 'for', 'heapable', 'sequences', 'towards', 'this', 'goal', 'we', 'also', 'give', 'an', 'algorithm', 'for', 'computing', 'formal', 'power', 'series', 'associated', 'to', 'the', 'variants', 'of', 'hammersleys', 'process', 'we', 'employ', 'these', 'algorithms', 'to', 'settle', 'the', 'nature', 'of', 'the', 'scaling', 'constant', 'conjectured', 'in', 'previous', 'work', 'to', 'be', 'the', 'golden', 'ratio', 'our', 'results', 'provide', 'experimental', 'support', 'to', 'this', 'conjecture']] | [-0.09992859697692305, 0.033965298343532055, -0.082491538532964, 0.11736343711590898, -0.09213016658917174, -0.1250105461600673, 0.08886222475634926, 0.3501451604338558, -0.34151524471093, -0.2493765800344673, 0.07884978066390654, -0.2691196704696916, -0.1513856936187542, 0.23486003097329106, -0.09073525054785156, 0.06634308247976786, 0.07085672178683425, 0.035504338551529235, -0.002061445402776028, -0.27074956460823335, 0.32877112230794, 0.03251073038583244, 0.24660396338863808, 0.004777591735762837, 0.07480630443359797, -0.009117098800329999, -0.043473477903558135, -0.004909661769463153, -0.14013936816459485, 0.1307548942741241, 0.2947136428413939, 0.1942872658658486, 0.24582306349037827, -0.38577423413720474, -0.1332324799329329, 0.12604534480121585, 0.12504752928886068, 0.097536649398662, -0.008470810966084262, -0.23180017792261565, 0.11221929602129581, -0.15949970555420107, -0.10687633558140638, -0.055756544713842705, 0.03144667565275531, 0.02227363253331424, -0.2650699779770656, 0.03531528787074409, 0.18065527196113879, 0.03576853144523147, -0.015862177319863772, -0.13415592007495306, 0.055406859003730324, 0.11548710692595769, 0.0486639910682847, 0.02054904913041298, 0.06141444338628879, -0.07621422999740377, -0.22983143499472758, 0.35742992892131936, -0.04837397525047923, -0.18357919177392146, 0.21659703971492453, -0.1129621891597924, -0.21821537325028462, 0.09049501951126109, 0.12873768829170718, 0.09867223737748353, -0.13599528645171777, 0.10065652766685047, -0.056915908433184344, 0.11935126918556911, 0.10428571007442433, -0.021159809419781073, 0.15978399643322805, 0.17606610824008817, 0.043013933616188854, 0.18995995317720907, 0.01780492299943804, -0.1182762768927154, -0.25737451654500687, -0.1783692090856758, -0.12039135543587194, 0.011933892229376556, -0.08197706597152987, -0.21806857060849458, 0.36813852838338257, 0.17024236897306216, 0.17412260923716988, 0.17518260010185985, 0.23763867643485953, 0.14924515716054224, 0.025759072791153265, 0.051516654852360906, 0.12645523349259544, 0.10759004116403525, 0.08781227124268776, -0.16402300451784493, 0.07344816754721886, 0.12456274743784558] |
1,802.03437 | Integers represented by positive-definite quadratic forms and Petersson
inner products | Let $Q$ be a positive-definite quaternary quadratic form with integer
coefficients. We study the problem of giving bounds on the largest positive
integer $n$ that is locally represented by $Q$ but not represented. Assuming
that $n$ is relatively prime to $D(Q)$, the determinant of the Gram matrix of
$Q$, we show that $n$ is represented provided that \[
n \gg \max \{ N(Q)^{3/2 + \epsilon} D(Q)^{5/4 + \epsilon}, N(Q)^{2 +
\epsilon} D(Q)^{1 + \epsilon} \}. \] Here $N(Q)$ is the level of $Q$. We give
three other bounds that hold under successively weaker local conditions on $n$.
These results are proven by bounding the Petersson norm of the cuspidal part
of the theta series, which is accomplished using an explicit formula for the
Weil representation due to Scheithauer.
| math.NT | let q be a positivedefinite quaternary quadratic form with integer coefficients we study the problem of giving bounds on the largest positive integer n that is locally represented by q but not represented assuming that n is relatively prime to dq the determinant of the gram matrix of q we show that n is represented provided that n gg max nq32 epsilon dq54 epsilon nq2 epsilon dq1 epsilon here nq is the level of q we give three other bounds that hold under successively weaker local conditions on n these results are proven by bounding the petersson norm of the cuspidal part of the theta series which is accomplished using an explicit formula for the weil representation due to scheithauer | [['let', 'q', 'be', 'a', 'positivedefinite', 'quaternary', 'quadratic', 'form', 'with', 'integer', 'coefficients', 'we', 'study', 'the', 'problem', 'of', 'giving', 'bounds', 'on', 'the', 'largest', 'positive', 'integer', 'n', 'that', 'is', 'locally', 'represented', 'by', 'q', 'but', 'not', 'represented', 'assuming', 'that', 'n', 'is', 'relatively', 'prime', 'to', 'dq', 'the', 'determinant', 'of', 'the', 'gram', 'matrix', 'of', 'q', 'we', 'show', 'that', 'n', 'is', 'represented', 'provided', 'that', 'n', 'gg', 'max', 'nq32', 'epsilon', 'dq54', 'epsilon', 'nq2', 'epsilon', 'dq1', 'epsilon', 'here', 'nq', 'is', 'the', 'level', 'of', 'q', 'we', 'give', 'three', 'other', 'bounds', 'that', 'hold', 'under', 'successively', 'weaker', 'local', 'conditions', 'on', 'n', 'these', 'results', 'are', 'proven', 'by', 'bounding', 'the', 'petersson', 'norm', 'of', 'the', 'cuspidal', 'part', 'of', 'the', 'theta', 'series', 'which', 'is', 'accomplished', 'using', 'an', 'explicit', 'formula', 'for', 'the', 'weil', 'representation', 'due', 'to', 'scheithauer']] | [-0.21493475630274442, 0.14376264854454193, -0.054239325902203865, 0.02944463680589842, -0.041746079426211044, -0.199707897606855, 0.010110544287559822, 0.30642084209805626, -0.2876098244689787, -0.2702878750074639, 0.06569355419383217, -0.2601484050854849, -0.1675566363797133, 0.19812755557334322, -0.032915352342220455, 0.032470118854036674, 0.008230061998638587, 0.1255767896102789, -0.07185487830255212, -0.31409159140152915, 0.33595391179824996, -0.011547634191015083, 0.12732332850145733, 0.03458179314332242, 0.07678919556574562, -0.013984721583815722, 0.02272862180844586, -0.01174091188929593, -0.15085027013209093, 0.1269141192295246, 0.25844477092186546, 0.09963047748797724, 0.2512668036043835, -0.3818664003609337, -0.1094430396751238, 0.1708845624871329, 0.15377794285344645, -0.038206969695285156, 0.011659793631356751, -0.1962763908613696, 0.18283817668059346, -0.13528093382363948, -0.13305192101651278, -0.099190653860967, 0.09430782098132066, -0.0237297226404214, -0.38664531025987786, 0.03781578547528221, 0.13577844134858277, 0.06155637508401504, -0.03279279648628818, -0.24543663131821358, 0.023452179836762004, 0.07936472160359606, 0.010792832389776396, 0.06306506545928657, 0.04331307281127088, -0.0924540876180061, -0.048624939575759515, 0.3270194194713432, -0.08695132859274109, -0.23802981639686877, 0.056560272516575284, -0.1948326852124853, -0.10358258076091735, 0.11724446818996699, 0.1120872149307631, 0.17470658717390436, -0.013577994182069078, 0.19953161228097913, -0.11535167686082025, 0.16779514984028715, 0.1157981822720896, -0.007365980595509466, 0.11103287726863582, 0.027907809529166955, 0.07863463529059266, 0.14169116327131134, -0.017708031663623374, -0.018010666623261846, -0.35316161521606976, -0.13820099933908728, -0.2666772099940154, 0.12650064148646123, -0.13982960781576032, -0.15386221201843622, 0.28915641431967354, 0.03617141341480116, 0.22831284788906828, 0.14340537322513983, 0.22088429705900514, 0.1751890090541938, 0.045470661457834974, 0.09834293780338943, 0.1322154997008192, 0.15190253471637255, -0.0304149568049062, -0.18640184689026612, 0.08447748934651096, 0.17956430894824174] |
1,802.03438 | Generalized Master-Slave-Splitting Method and Application to
Transmission-Distribution Coordinated Energy Management | Transmission-Distribution coordinated energy management (TDCEM) is recognized
as a promising solution to the challenge of high DER penetration, but there is
a lack of a distributed computation method that universally and effectively
works for the TDCEM. To bridge this gap, a generalized mas-ter-slave-splitting
(G-MSS) method is presented in this paper. This method is based on a
general-purpose transmis-sion-distribution coordination model called G-TDCM,
which thus enables the G-MSS to be applicable to most of the central functions
of the TDCEM. In this G-MSS method, a basic heter-ogenous decomposition (HGD)
algorithm is first derived from the HGD of the coupling constraints in the
optimality conditions of the G-TDCM. Its optimality and convergence properties
are then proved. Further, inspired by the conditions for conver-gence, a
modified HGD algorithm that utilizes the subsystem's response function is
developed and thus converges faster. The distributed G-MSS method is then
demonstrated to successfully solve a series of central functions, e.g. power
flow, contingency analysis, voltage stability assessment, economic dispatch and
optimal power flow, of the TDCEM. The severe issues of over-voltage and
erroneous assessment of the system security that are caused by DERs are thus
resolved by the G-MSS method with modest computation cost.
| cs.SY | transmissiondistribution coordinated energy management tdcem is recognized as a promising solution to the challenge of high der penetration but there is a lack of a distributed computation method that universally and effectively works for the tdcem to bridge this gap a generalized masterslavesplitting gmss method is presented in this paper this method is based on a generalpurpose transmissiondistribution coordination model called gtdcm which thus enables the gmss to be applicable to most of the central functions of the tdcem in this gmss method a basic heterogenous decomposition hgd algorithm is first derived from the hgd of the coupling constraints in the optimality conditions of the gtdcm its optimality and convergence properties are then proved further inspired by the conditions for convergence a modified hgd algorithm that utilizes the subsystems response function is developed and thus converges faster the distributed gmss method is then demonstrated to successfully solve a series of central functions eg power flow contingency analysis voltage stability assessment economic dispatch and optimal power flow of the tdcem the severe issues of overvoltage and erroneous assessment of the system security that are caused by ders are thus resolved by the gmss method with modest computation cost | [['transmissiondistribution', 'coordinated', 'energy', 'management', 'tdcem', 'is', 'recognized', 'as', 'a', 'promising', 'solution', 'to', 'the', 'challenge', 'of', 'high', 'der', 'penetration', 'but', 'there', 'is', 'a', 'lack', 'of', 'a', 'distributed', 'computation', 'method', 'that', 'universally', 'and', 'effectively', 'works', 'for', 'the', 'tdcem', 'to', 'bridge', 'this', 'gap', 'a', 'generalized', 'masterslavesplitting', 'gmss', 'method', 'is', 'presented', 'in', 'this', 'paper', 'this', 'method', 'is', 'based', 'on', 'a', 'generalpurpose', 'transmissiondistribution', 'coordination', 'model', 'called', 'gtdcm', 'which', 'thus', 'enables', 'the', 'gmss', 'to', 'be', 'applicable', 'to', 'most', 'of', 'the', 'central', 'functions', 'of', 'the', 'tdcem', 'in', 'this', 'gmss', 'method', 'a', 'basic', 'heterogenous', 'decomposition', 'hgd', 'algorithm', 'is', 'first', 'derived', 'from', 'the', 'hgd', 'of', 'the', 'coupling', 'constraints', 'in', 'the', 'optimality', 'conditions', 'of', 'the', 'gtdcm', 'its', 'optimality', 'and', 'convergence', 'properties', 'are', 'then', 'proved', 'further', 'inspired', 'by', 'the', 'conditions', 'for', 'convergence', 'a', 'modified', 'hgd', 'algorithm', 'that', 'utilizes', 'the', 'subsystems', 'response', 'function', 'is', 'developed', 'and', 'thus', 'converges', 'faster', 'the', 'distributed', 'gmss', 'method', 'is', 'then', 'demonstrated', 'to', 'successfully', 'solve', 'a', 'series', 'of', 'central', 'functions', 'eg', 'power', 'flow', 'contingency', 'analysis', 'voltage', 'stability', 'assessment', 'economic', 'dispatch', 'and', 'optimal', 'power', 'flow', 'of', 'the', 'tdcem', 'the', 'severe', 'issues', 'of', 'overvoltage', 'and', 'erroneous', 'assessment', 'of', 'the', 'system', 'security', 'that', 'are', 'caused', 'by', 'ders', 'are', 'thus', 'resolved', 'by', 'the', 'gmss', 'method', 'with', 'modest', 'computation', 'cost']] | [-0.11173078900121498, 0.02589935984176862, -0.10391898685826238, 0.04610572132964849, -0.05404403784609947, -0.14625650052144432, 0.048493158809730263, 0.32741663991425607, -0.2850710452089, -0.3120967685677034, 0.137795410969309, -0.20641734025239483, -0.1685075537066369, 0.20655349997075073, -0.10723953835933815, 0.08671082048100832, 0.05194061431318483, -0.030348254095273305, -0.030739209252546456, -0.23213936925683284, 0.27331113785963757, 0.10004882876144376, 0.326813372146079, 0.07363292335330979, 0.11319718686155687, -0.03495766921688985, -0.0063556071092403426, 0.045082708590570356, -0.07696813416901163, 0.163951443102614, 0.2563610142432921, 0.16132016722640963, 0.3505155457010896, -0.39200704551503524, -0.1918098915394722, 0.0756196799260785, 0.12710360885433045, 0.0616493510013655, -0.04743070053428738, -0.23694944789767572, 0.13211405492320502, -0.19358825284061165, -0.10309854693189935, -0.08501548942816972, -0.015843592556529514, 0.059388382113106625, -0.3088497663632074, 0.07867215604391717, 0.05120030444561859, 0.016917941880594825, -0.06406784059237401, -0.08114516757339835, 0.0011926519686893857, 0.09882581695559021, 0.03186195195933381, 0.02347819369103875, 0.11993375564589329, -0.09283855089380108, -0.08564997459257732, 0.3800051567341518, -0.01062226856064973, -0.18717079017714588, 0.14880193683040357, -0.04809521532799933, -0.14451616144374244, 0.12736880257197647, 0.16301978542949505, 0.12915903567360504, -0.18210790367297752, 0.06128660683698962, -0.00924962229988317, 0.16230690797560454, 0.03767058832844546, -0.015018723924289044, 0.1483742823373027, 0.19003554047373383, 0.12747438204445943, 0.1373445718427976, -0.04664455657433622, -0.11422541098952409, -0.2480160912850478, -0.13687761021374734, -0.19794904629216223, -0.006891742247257612, -0.06932316737550433, -0.1495085010213835, 0.38630534400059313, 0.1562278775543877, 0.1337422066963441, 0.05898659927446453, 0.35673101023607645, 0.13667520534513594, 0.07196066797304101, 0.1121656173412909, 0.21523413450466758, 0.10333268764337582, 0.12396530094844549, -0.2313571876915863, 0.09977332556850671, 0.0746500037308091] |
1,802.03439 | A T-shaped double quantum dot system as a Fano interferometer: interplay
of coherence and correlation upon spin currents | Based on Keldysh non-equilibrium Green function method, we have investigated
spin current production in a hybrid T-shaped device, consisting of a central
quantum dot connected to the leads and a side dot which only couples to the
central dot. The topology of this structure allows for quantum interference of
the different paths that go across the device, yielding Fano resonances in the
spin dependent transport properties. Correlation effects are taken into account
at the central dot and handled within a mean field approximation. Its interplay
with the Fano effect is analyzed in the strong coupling regime. Non-vanishing
spin currents are only obtained when the leads are ferromagnetic, the current
being strongly dependent on the relative orientation of the lead polarizations.
We calculate the conductance (spin and charge) by numerically differentiating
the current, and a rich structure is obtained as a manifestation of quantum
coherence and correlation effects. Increase of the Coulomb interaction produces
localization of states at the side dot, largely suppressing Fano resonances.
The interaction is also responsible for the negative values of the spin
conductance in some regions of the voltage near resonances, effect which is the
spin analog of the Esaki tunnel diode. We also analyze control of the currents
via gate voltages applied to the dots, possibility which is interesting for
practical operations.
| cond-mat.mes-hall | based on keldysh nonequilibrium green function method we have investigated spin current production in a hybrid tshaped device consisting of a central quantum dot connected to the leads and a side dot which only couples to the central dot the topology of this structure allows for quantum interference of the different paths that go across the device yielding fano resonances in the spin dependent transport properties correlation effects are taken into account at the central dot and handled within a mean field approximation its interplay with the fano effect is analyzed in the strong coupling regime nonvanishing spin currents are only obtained when the leads are ferromagnetic the current being strongly dependent on the relative orientation of the lead polarizations we calculate the conductance spin and charge by numerically differentiating the current and a rich structure is obtained as a manifestation of quantum coherence and correlation effects increase of the coulomb interaction produces localization of states at the side dot largely suppressing fano resonances the interaction is also responsible for the negative values of the spin conductance in some regions of the voltage near resonances effect which is the spin analog of the esaki tunnel diode we also analyze control of the currents via gate voltages applied to the dots possibility which is interesting for practical operations | [['based', 'on', 'keldysh', 'nonequilibrium', 'green', 'function', 'method', 'we', 'have', 'investigated', 'spin', 'current', 'production', 'in', 'a', 'hybrid', 'tshaped', 'device', 'consisting', 'of', 'a', 'central', 'quantum', 'dot', 'connected', 'to', 'the', 'leads', 'and', 'a', 'side', 'dot', 'which', 'only', 'couples', 'to', 'the', 'central', 'dot', 'the', 'topology', 'of', 'this', 'structure', 'allows', 'for', 'quantum', 'interference', 'of', 'the', 'different', 'paths', 'that', 'go', 'across', 'the', 'device', 'yielding', 'fano', 'resonances', 'in', 'the', 'spin', 'dependent', 'transport', 'properties', 'correlation', 'effects', 'are', 'taken', 'into', 'account', 'at', 'the', 'central', 'dot', 'and', 'handled', 'within', 'a', 'mean', 'field', 'approximation', 'its', 'interplay', 'with', 'the', 'fano', 'effect', 'is', 'analyzed', 'in', 'the', 'strong', 'coupling', 'regime', 'nonvanishing', 'spin', 'currents', 'are', 'only', 'obtained', 'when', 'the', 'leads', 'are', 'ferromagnetic', 'the', 'current', 'being', 'strongly', 'dependent', 'on', 'the', 'relative', 'orientation', 'of', 'the', 'lead', 'polarizations', 'we', 'calculate', 'the', 'conductance', 'spin', 'and', 'charge', 'by', 'numerically', 'differentiating', 'the', 'current', 'and', 'a', 'rich', 'structure', 'is', 'obtained', 'as', 'a', 'manifestation', 'of', 'quantum', 'coherence', 'and', 'correlation', 'effects', 'increase', 'of', 'the', 'coulomb', 'interaction', 'produces', 'localization', 'of', 'states', 'at', 'the', 'side', 'dot', 'largely', 'suppressing', 'fano', 'resonances', 'the', 'interaction', 'is', 'also', 'responsible', 'for', 'the', 'negative', 'values', 'of', 'the', 'spin', 'conductance', 'in', 'some', 'regions', 'of', 'the', 'voltage', 'near', 'resonances', 'effect', 'which', 'is', 'the', 'spin', 'analog', 'of', 'the', 'esaki', 'tunnel', 'diode', 'we', 'also', 'analyze', 'control', 'of', 'the', 'currents', 'via', 'gate', 'voltages', 'applied', 'to', 'the', 'dots', 'possibility', 'which', 'is', 'interesting', 'for', 'practical', 'operations']] | [-0.19932223681236022, 0.1552639887088798, -0.057746906717595414, 0.055590901474070344, -0.0011163022688886126, -0.17480590187167655, 0.04137667202849954, 0.35766714577957953, -0.2547350674438449, -0.26874844736552667, 0.013660626773495005, -0.27803646361844, -0.12294574772449819, 0.21823359175246157, 0.02018008510848241, -0.017919839015066913, 0.0044214596021233754, 0.012904854068609839, -0.06362467746181663, -0.16256164082042734, 0.32015896841515773, 0.003772002548807674, 0.29836555750083504, 0.1298677771205237, 0.0855690802400288, 0.036773607053274655, 0.07051380993562326, 0.045830298745189256, -0.09969935077326378, 0.08351627880603307, 0.20537259366871866, -0.061304444480421286, 0.2087226965838039, -0.44246624619592717, -0.15582074132245807, 0.018495035608844135, 0.13454720274596754, 0.144129767984448, -0.057523703086189926, -0.2972995639147778, 0.05071790385905499, -0.14930212625392503, -0.09293419349518034, -0.04015091340452398, 0.0035256725775661625, 0.020355865217676634, -0.2705436601600726, 0.08674606687066355, 0.05436845279577288, 0.0022322631576248714, -0.0005682928834758561, -0.09044904043588976, -0.04055899173806718, 0.134273604111379, -0.01250322719645356, 0.015728702236499106, 0.2198877810052068, -0.15731721846730135, -0.1340373597480142, 0.3023548192550613, -0.059860729708975775, -0.18041368549816258, 0.1383479664816783, -0.20742413110833632, -0.043840524431506885, 0.12524508627148748, 0.14329612283851556, 0.10384946123349227, -0.1476651055490612, 0.10003000827294813, 0.03300914655907363, 0.1301044857119798, 0.05229234027092598, 0.11208965039430058, 0.2609503437219883, 0.1671403356975863, 0.06456239729763485, 0.15289308420652825, -0.14043766445526423, -0.13083557461772644, -0.2789901763303763, -0.13598447755270976, -0.17819907190063583, 0.10799855264204164, -0.059462785737657134, -0.15767270659873356, 0.4663257301836822, 0.1350033586750382, 0.1970274041391789, -0.03569837489816111, 0.29233689034520755, 0.18828099499046716, 0.10348297009021387, 0.008058571404697533, 0.2618462989351676, 0.22070538661816083, 0.06626496081935748, -0.3406550107976585, 0.06591705335218305, -0.01973314960551564] |
1,802.0344 | Constraining Stellar Coronal Mass Ejections Through Multi-Wavelength
Analysis of the Active M Dwarf EQ Peg | Stellar coronal mass ejections remain experimentally unconstrained, unlike
their stellar flare counterparts which are observed ubiquitously across the
electromagnetic spectrum. Low frequency radio bursts in the form of a type II
burst offer the best means of identifying and constraining the rate and
properties of stellar CMEs. CME properties can be further improved through the
use of proposed solar-stellar scaling relations and multi-wavelength
observations of CMEs through the use of type II bursts and the associated flare
expected to occur occur alongside. We report on 20 hours of observation of the
nearby, magnetically active, and well characterized M dwarf star EQ Peg. The
observations are simultaneously observed with the Jansky Very Large Array at
their P-band (230-470 MHz) and at the Apache Point observatory in the SDSS u'
filter ($\lambda$ = 3557 \AA). Dynamic spectra of the P band data, constructed
to search for signals in the frequency-time domains, did not reveal evidence
for drifting radio bursts that could be ascribed to type II bursts. Given the
sensitivity of our observations, we are able to place limits on the brightness
temperature and source size of any bursts which may have occurred. Using solar
scaling rations on four observed stellar flares, we predict CME parameters.
Given the constraints on coronal density and photospheric field strength, our
models suggest that the observed flares would have been insufficient to produce
detectable type II bursts at our observed frequencies. We consider the
implications of these results, and other recent findings, on stellar mass loss.
| astro-ph.SR | stellar coronal mass ejections remain experimentally unconstrained unlike their stellar flare counterparts which are observed ubiquitously across the electromagnetic spectrum low frequency radio bursts in the form of a type ii burst offer the best means of identifying and constraining the rate and properties of stellar cmes cme properties can be further improved through the use of proposed solarstellar scaling relations and multiwavelength observations of cmes through the use of type ii bursts and the associated flare expected to occur occur alongside we report on 20 hours of observation of the nearby magnetically active and well characterized m dwarf star eq peg the observations are simultaneously observed with the jansky very large array at their pband 230470 mhz and at the apache point observatory in the sdss u filter lambda 3557 aa dynamic spectra of the p band data constructed to search for signals in the frequencytime domains did not reveal evidence for drifting radio bursts that could be ascribed to type ii bursts given the sensitivity of our observations we are able to place limits on the brightness temperature and source size of any bursts which may have occurred using solar scaling rations on four observed stellar flares we predict cme parameters given the constraints on coronal density and photospheric field strength our models suggest that the observed flares would have been insufficient to produce detectable type ii bursts at our observed frequencies we consider the implications of these results and other recent findings on stellar mass loss | [['stellar', 'coronal', 'mass', 'ejections', 'remain', 'experimentally', 'unconstrained', 'unlike', 'their', 'stellar', 'flare', 'counterparts', 'which', 'are', 'observed', 'ubiquitously', 'across', 'the', 'electromagnetic', 'spectrum', 'low', 'frequency', 'radio', 'bursts', 'in', 'the', 'form', 'of', 'a', 'type', 'ii', 'burst', 'offer', 'the', 'best', 'means', 'of', 'identifying', 'and', 'constraining', 'the', 'rate', 'and', 'properties', 'of', 'stellar', 'cmes', 'cme', 'properties', 'can', 'be', 'further', 'improved', 'through', 'the', 'use', 'of', 'proposed', 'solarstellar', 'scaling', 'relations', 'and', 'multiwavelength', 'observations', 'of', 'cmes', 'through', 'the', 'use', 'of', 'type', 'ii', 'bursts', 'and', 'the', 'associated', 'flare', 'expected', 'to', 'occur', 'occur', 'alongside', 'we', 'report', 'on', '20', 'hours', 'of', 'observation', 'of', 'the', 'nearby', 'magnetically', 'active', 'and', 'well', 'characterized', 'm', 'dwarf', 'star', 'eq', 'peg', 'the', 'observations', 'are', 'simultaneously', 'observed', 'with', 'the', 'jansky', 'very', 'large', 'array', 'at', 'their', 'pband', '230470', 'mhz', 'and', 'at', 'the', 'apache', 'point', 'observatory', 'in', 'the', 'sdss', 'u', 'filter', 'lambda', '3557', 'aa', 'dynamic', 'spectra', 'of', 'the', 'p', 'band', 'data', 'constructed', 'to', 'search', 'for', 'signals', 'in', 'the', 'frequencytime', 'domains', 'did', 'not', 'reveal', 'evidence', 'for', 'drifting', 'radio', 'bursts', 'that', 'could', 'be', 'ascribed', 'to', 'type', 'ii', 'bursts', 'given', 'the', 'sensitivity', 'of', 'our', 'observations', 'we', 'are', 'able', 'to', 'place', 'limits', 'on', 'the', 'brightness', 'temperature', 'and', 'source', 'size', 'of', 'any', 'bursts', 'which', 'may', 'have', 'occurred', 'using', 'solar', 'scaling', 'rations', 'on', 'four', 'observed', 'stellar', 'flares', 'we', 'predict', 'cme', 'parameters', 'given', 'the', 'constraints', 'on', 'coronal', 'density', 'and', 'photospheric', 'field', 'strength', 'our', 'models', 'suggest', 'that', 'the', 'observed', 'flares', 'would', 'have', 'been', 'insufficient', 'to', 'produce', 'detectable', 'type', 'ii', 'bursts', 'at', 'our', 'observed', 'frequencies', 'we', 'consider', 'the', 'implications', 'of', 'these', 'results', 'and', 'other', 'recent', 'findings', 'on', 'stellar', 'mass', 'loss']] | [-0.08583471311724297, 0.1526907871706381, -0.008732198748827701, 0.13007508498060727, -0.12558090598266122, -0.08540398386051698, 0.06796838961505977, 0.45652952893907506, -0.1687596468968437, -0.38430928622162147, 0.08666648764976286, -0.282341044677812, -0.09864748057894289, 0.24779544376266835, 0.0006967315247522727, -0.014862023399121339, 0.10436945888889773, -0.04175492816589652, -0.05706870882028353, -0.20720115319727483, 0.250782862351644, 0.10535994864438826, 0.19679606601881283, -0.019001126786949294, 0.06192263029093268, -0.10760255308442508, -0.08154540980843106, -0.020350495220496197, -0.12730665053195186, 0.023985392595462937, 0.2298673761192731, 0.13709266784210358, 0.1790724191589341, -0.42084902154296755, -0.25479817301581326, 0.0631098083104007, 0.15897613145493633, -0.008107741446902735, -0.044074139381747604, -0.29770678298776937, 0.08041670955055687, -0.1411801052839315, -0.13367743443532457, 0.056768910195152726, 0.037577295017282235, 0.07973299140036444, -0.24889627706039802, 0.10034984242614178, 0.017623272869968787, 0.08243376410457366, -0.12364110965638482, -0.06834563570174074, -0.035133979977261684, 0.10754259463564883, 0.06862030872857318, 0.02610581271883641, 0.14762584831060527, -0.0942803267614856, -0.0865208779629733, 0.3692973184722265, -0.05967735783985605, -0.0015107159805108582, 0.23388959154310154, -0.22543328307238558, -0.19370200540194468, 0.1568869826944372, 0.18549631312189083, 0.0710653000747815, -0.12647961700971674, 0.00514158907413554, 0.0016729944317992176, 0.1777607121988577, 0.0463079197478721, 0.0773597891806745, 0.30144004743065567, 0.10346310520582201, -0.005651306709267139, 0.07319056252022312, -0.25778457252501186, 0.01077031625684486, -0.25636719594284285, -0.05526428868841087, -0.13928957481402904, 0.07161518060251358, -0.08802858223674365, -0.14558291739282844, 0.4071336640448745, 0.1331383201724689, 0.21035405901831486, 0.030682437808976712, 0.21119601516928074, 0.11269334166248765, 0.1135931849656176, 0.13035253299993552, 0.32636362693888404, 0.13429047215935674, 0.15103887842081848, -0.24432960007693655, 0.08161922976526717, 0.02796379297562394] |
1,802.03441 | Locally Private Hypothesis Testing | We initiate the study of differentially private hypothesis testing in the
local-model, under both the standard (symmetric) randomized-response mechanism
(Warner, 1965, Kasiviswanathan et al, 2008) and the newer (non-symmetric)
mechanisms (Bassily and Smith, 2015, Bassily et al, 2017). First, we study the
general framework of mapping each user's type into a signal and show that the
problem of finding the maximum-likelihood distribution over the signals is
feasible. Then we discuss the randomized-response mechanism and show that, in
essence, it maps the null- and alternative-hypotheses onto new sets, an affine
translation of the original sets. We then give sample complexity bounds for
identity and independence testing under randomized-response. We then move to
the newer non-symmetric mechanisms and show that there too the problem of
finding the maximum-likelihood distribution is feasible. Under the mechanism of
Bassily et al (2007) we give identity and independence testers with better
sample complexity than the testers in the symmetric case, and we also propose a
$\chi^2$-based identity tester which we investigate empirically.
| cs.CR | we initiate the study of differentially private hypothesis testing in the localmodel under both the standard symmetric randomizedresponse mechanism warner 1965 kasiviswanathan et al 2008 and the newer nonsymmetric mechanisms bassily and smith 2015 bassily et al 2017 first we study the general framework of mapping each users type into a signal and show that the problem of finding the maximumlikelihood distribution over the signals is feasible then we discuss the randomizedresponse mechanism and show that in essence it maps the null and alternativehypotheses onto new sets an affine translation of the original sets we then give sample complexity bounds for identity and independence testing under randomizedresponse we then move to the newer nonsymmetric mechanisms and show that there too the problem of finding the maximumlikelihood distribution is feasible under the mechanism of bassily et al 2007 we give identity and independence testers with better sample complexity than the testers in the symmetric case and we also propose a chi2based identity tester which we investigate empirically | [['we', 'initiate', 'the', 'study', 'of', 'differentially', 'private', 'hypothesis', 'testing', 'in', 'the', 'localmodel', 'under', 'both', 'the', 'standard', 'symmetric', 'randomizedresponse', 'mechanism', 'warner', '1965', 'kasiviswanathan', 'et', 'al', '2008', 'and', 'the', 'newer', 'nonsymmetric', 'mechanisms', 'bassily', 'and', 'smith', '2015', 'bassily', 'et', 'al', '2017', 'first', 'we', 'study', 'the', 'general', 'framework', 'of', 'mapping', 'each', 'users', 'type', 'into', 'a', 'signal', 'and', 'show', 'that', 'the', 'problem', 'of', 'finding', 'the', 'maximumlikelihood', 'distribution', 'over', 'the', 'signals', 'is', 'feasible', 'then', 'we', 'discuss', 'the', 'randomizedresponse', 'mechanism', 'and', 'show', 'that', 'in', 'essence', 'it', 'maps', 'the', 'null', 'and', 'alternativehypotheses', 'onto', 'new', 'sets', 'an', 'affine', 'translation', 'of', 'the', 'original', 'sets', 'we', 'then', 'give', 'sample', 'complexity', 'bounds', 'for', 'identity', 'and', 'independence', 'testing', 'under', 'randomizedresponse', 'we', 'then', 'move', 'to', 'the', 'newer', 'nonsymmetric', 'mechanisms', 'and', 'show', 'that', 'there', 'too', 'the', 'problem', 'of', 'finding', 'the', 'maximumlikelihood', 'distribution', 'is', 'feasible', 'under', 'the', 'mechanism', 'of', 'bassily', 'et', 'al', '2007', 'we', 'give', 'identity', 'and', 'independence', 'testers', 'with', 'better', 'sample', 'complexity', 'than', 'the', 'testers', 'in', 'the', 'symmetric', 'case', 'and', 'we', 'also', 'propose', 'a', 'chi2based', 'identity', 'tester', 'which', 'we', 'investigate', 'empirically']] | [-0.0802750804941311, 0.022190059267891093, -0.09319718122820962, 0.08488422295953514, -0.09150033330149723, -0.1254606725803266, 0.09656088230637551, 0.34528141253430283, -0.26708584036678074, -0.30917166079761405, 0.08660975211285844, -0.23745993580669164, -0.2031028928065842, 0.1767405852929435, -0.12480758806747018, 0.044525847643275156, 0.024948782803998752, -0.056064401837912475, -0.03868827690144606, -0.3134486748335996, 0.3112994840312185, 0.11004217248828906, 0.3131989193233577, 0.006392984944889604, 0.08207686281001025, 0.044717285003174435, -0.04931592753291074, -0.003559272312982516, -0.16889393118727833, 0.08321767461796602, 0.18955573697263997, 0.23574595929151684, 0.24583990332868064, -0.38392005925107336, -0.13934769710582315, 0.15303544382931608, 0.06328340794213794, 0.09677328129482428, -0.06867470472035082, -0.28678083421916445, 0.09168472678372354, -0.15907404824639812, -0.07054760279980572, -0.04104566991216305, 0.05319571889668816, -0.006573996953242882, -0.3223627828287356, 0.06029414756516362, 0.1399152551410776, 0.02281813071758458, -0.053317996788995736, -0.11086271326128168, 0.030796214644656036, 0.0682012436572801, 0.008663518917852674, 0.013131753919702588, 0.052438535544118196, -0.05587466921883099, -0.13640349789974138, 0.3247248966514951, -0.022929134783352668, -0.1531882128480709, 0.19237806659304735, -0.10701225086727804, -0.16441485433923927, 0.03673100241770347, 0.17739818310647298, 0.13517424990846352, -0.14282896875432044, 0.13205278486147468, -0.13269451337894708, 0.12177748348648575, 0.07717379497110166, -0.017550678543788806, 0.11854525804519653, 0.08932118496088537, 0.06229815880175341, 0.17332072271542115, -0.06915429780175063, -0.06835875525527323, -0.27561430482398436, -0.17649859924144534, -0.1312378696137757, 0.018661917683978877, -0.0652456990068348, -0.13412996924439954, 0.3672557043137424, 0.17183157301853608, 0.19805383112450892, 0.10017508295237679, 0.25728560885499147, 0.07365788824743394, -0.0030432976150857, 0.16920736106677037, 0.2139686716918015, 0.11140660423446785, 0.05081307340737884, -0.17598582298184434, 0.09859769954769448, 0.07523350884404147] |
1,802.03442 | Battery Energy Storage Scheduling for Optimal Load Variance Minimization | Generation portfolio can be significantly altered due to the deployment of
distributed energy resources (DER) in distribution networks and the concept of
microgrid. Generally, distribution networks can operate in a more resilient and
economic fashion through proper coordination of DER. However, due to the
partially uncontrollable and stochastic nature of some DER, the variance of net
load of distribution systems increases, which raises the operational cost and
complicates operation for transmission companies. This motivates peak shaving
and valley filling using energy storage units deployed in distribution systems.
This paper aims at theoretical formulation of optimal load variance
minimization, where the infinity norm of net load is minimized. Then, the
problem is reformulated equivalently as a linear program. A case study is
performed with capacity-limited battery energy storage model and the simplified
power flow model of a radial distribution network. The influence of capacity
limit and deployment location are studied.
| cs.SY | generation portfolio can be significantly altered due to the deployment of distributed energy resources der in distribution networks and the concept of microgrid generally distribution networks can operate in a more resilient and economic fashion through proper coordination of der however due to the partially uncontrollable and stochastic nature of some der the variance of net load of distribution systems increases which raises the operational cost and complicates operation for transmission companies this motivates peak shaving and valley filling using energy storage units deployed in distribution systems this paper aims at theoretical formulation of optimal load variance minimization where the infinity norm of net load is minimized then the problem is reformulated equivalently as a linear program a case study is performed with capacitylimited battery energy storage model and the simplified power flow model of a radial distribution network the influence of capacity limit and deployment location are studied | [['generation', 'portfolio', 'can', 'be', 'significantly', 'altered', 'due', 'to', 'the', 'deployment', 'of', 'distributed', 'energy', 'resources', 'der', 'in', 'distribution', 'networks', 'and', 'the', 'concept', 'of', 'microgrid', 'generally', 'distribution', 'networks', 'can', 'operate', 'in', 'a', 'more', 'resilient', 'and', 'economic', 'fashion', 'through', 'proper', 'coordination', 'of', 'der', 'however', 'due', 'to', 'the', 'partially', 'uncontrollable', 'and', 'stochastic', 'nature', 'of', 'some', 'der', 'the', 'variance', 'of', 'net', 'load', 'of', 'distribution', 'systems', 'increases', 'which', 'raises', 'the', 'operational', 'cost', 'and', 'complicates', 'operation', 'for', 'transmission', 'companies', 'this', 'motivates', 'peak', 'shaving', 'and', 'valley', 'filling', 'using', 'energy', 'storage', 'units', 'deployed', 'in', 'distribution', 'systems', 'this', 'paper', 'aims', 'at', 'theoretical', 'formulation', 'of', 'optimal', 'load', 'variance', 'minimization', 'where', 'the', 'infinity', 'norm', 'of', 'net', 'load', 'is', 'minimized', 'then', 'the', 'problem', 'is', 'reformulated', 'equivalently', 'as', 'a', 'linear', 'program', 'a', 'case', 'study', 'is', 'performed', 'with', 'capacitylimited', 'battery', 'energy', 'storage', 'model', 'and', 'the', 'simplified', 'power', 'flow', 'model', 'of', 'a', 'radial', 'distribution', 'network', 'the', 'influence', 'of', 'capacity', 'limit', 'and', 'deployment', 'location', 'are', 'studied']] | [-0.18457744837716697, 0.08369215863292737, -0.03838858125210215, 0.03607130804858577, -0.043504460267847614, -0.15494582332020637, 0.10923452494000303, 0.3444360995902711, -0.310349128491889, -0.3214061096804404, 0.10210266693779611, -0.26083319476999395, -0.11761934418174995, 0.15161223109223998, -0.12763491805155305, 0.08801235731584864, 0.05116303405418192, -0.01296300941065654, -0.0008548082015789645, -0.23589995139334727, 0.2700225028034375, 0.1543674297605785, 0.36127908421592825, 0.06711543519003005, 0.06636953902557405, 0.01772130822494076, 0.0022783527625787176, 0.041523688481401824, -0.06029915507889084, 0.140742409671188, 0.27376138935359384, 0.1266571147954904, 0.3431672007040802, -0.47391902551605, -0.22001947172614278, 0.153147777364333, 0.11427655244842265, 0.04459919513206329, 0.0038984130559943852, -0.17810569994070335, 0.05657366999181225, -0.25417458256019043, -0.09789848693915261, -0.04241663100269792, -0.018154130600886605, 0.07353336594751943, -0.2849657995963857, 0.0761879908183477, 0.034649716252648594, 0.05110825633086364, -0.07304429759165185, -0.11093434529541522, -0.04719615595465238, 0.11031450579179632, 0.027234739583335665, -0.029337263398885028, 0.18624365978503926, -0.1312510490654999, -0.07303265669233097, 0.40206765169090275, -0.010159516581662325, -0.18325152073130513, 0.11852981760197838, -0.05624526385030391, -0.09185712355999245, 0.10399447644016886, 0.25587446389769847, 0.06488761576455111, -0.18350852639828466, 0.06644161492890847, 0.032032595309835155, 0.16430864125746458, 0.06800340735447287, 0.04351151383000632, 0.19449863274387966, 0.20987051373797674, 0.16096576009119154, 0.16191096422528137, -0.07262382194112312, -0.14169916870610025, -0.2290505094847473, -0.1278063323588623, -0.2130793098558753, 0.048963682047847734, -0.06989829365451955, -0.12463409608642527, 0.367447622795433, 0.12128413941761192, 0.15286100057935054, 0.10088658617612524, 0.342623802651995, 0.13918274731590918, 0.06554815910315928, 0.12529087504809536, 0.18213405871186436, 0.08391502495830092, 0.17036765070957124, -0.24088316970823595, 0.10800124884851826, -0.005995049366364943] |
1,802.03443 | On a transformation of Riordan moment sequences | We define a transformation that associates certain exponential moment
sequences with ordinary moment sequences in a natural way. The ingredients of
this transformation are series reversion, the Sumudu transform (a variant of
the Laplace transform), and the inverting of generating functions. This
transformation also has a simple interpretation in terms of continued
fractions. It associates lattice path objects with permutation objects, and in
particular it associates the Narayana triangle with the Eulerian triangle.
| math.CO | we define a transformation that associates certain exponential moment sequences with ordinary moment sequences in a natural way the ingredients of this transformation are series reversion the sumudu transform a variant of the laplace transform and the inverting of generating functions this transformation also has a simple interpretation in terms of continued fractions it associates lattice path objects with permutation objects and in particular it associates the narayana triangle with the eulerian triangle | [['we', 'define', 'a', 'transformation', 'that', 'associates', 'certain', 'exponential', 'moment', 'sequences', 'with', 'ordinary', 'moment', 'sequences', 'in', 'a', 'natural', 'way', 'the', 'ingredients', 'of', 'this', 'transformation', 'are', 'series', 'reversion', 'the', 'sumudu', 'transform', 'a', 'variant', 'of', 'the', 'laplace', 'transform', 'and', 'the', 'inverting', 'of', 'generating', 'functions', 'this', 'transformation', 'also', 'has', 'a', 'simple', 'interpretation', 'in', 'terms', 'of', 'continued', 'fractions', 'it', 'associates', 'lattice', 'path', 'objects', 'with', 'permutation', 'objects', 'and', 'in', 'particular', 'it', 'associates', 'the', 'narayana', 'triangle', 'with', 'the', 'eulerian', 'triangle']] | [-0.10919214079590285, 0.11719755233865078, -0.1526442032677364, 0.08774032164046107, -0.12121535554426173, -0.06889113915242152, 0.03422392954035624, 0.3543687867485497, -0.35148461295725547, -0.23779829425660715, 0.0738613611128666, -0.2595658041026494, -0.23317596538324062, 0.15693099036404531, -0.09989795540395664, 0.0395693008545531, 0.051509030745364726, 0.06260648931134237, -0.11540598564219903, -0.22852298214215122, 0.30004868722737654, -0.04014881001147505, 0.24857718716949634, -0.06936859247619159, 0.14581489718633972, 0.05009126714239382, -0.058460682279698244, -0.01927871356577906, -0.09518337387909351, 0.1517522806709964, 0.16864583019983687, 0.12636187514417793, 0.17075659008058783, -0.3720045457147572, -0.10252390966801712, 0.13643685350679371, 0.11678646404729927, 0.040412629291109024, -0.0931358807146141, -0.2474418092672139, 0.04573207277141205, -0.1442409393135203, -0.1356298281390169, -0.100318010596635, 0.0796198952011764, 0.08156029701437036, -0.2891534776235484, 0.04064085110006352, 0.10948227886876015, 0.0675929656861452, -0.009575606023969308, -0.09378882588767638, 0.0628163681416581, 0.08175060480380748, 0.019603269948139275, 0.07762985478780449, 0.05636368011290284, -0.10012793442400249, -0.11848249152455836, 0.4313986783030711, -0.024300250690430403, -0.24781312779459644, 0.12647958695633363, -0.17435580884961233, -0.19687090429464635, 0.13292544733091857, 0.053296002227659914, 0.12251124719846739, -0.1282403230769177, 0.10445775905439043, -0.1089807777627282, 0.10540311294926764, 0.16837897186792672, -0.02556805761071713, 0.19045035131181964, 0.054323972237921535, 0.08331633082348598, 0.21293062403517432, -0.034454922906237924, -0.0980307085260953, -0.3350064992467707, -0.24149442212145827, -0.17668174134171888, 0.037571346581824226, -0.10727056700772963, -0.2199943560137324, 0.4004263114184141, 0.05292642339171, 0.21490144951600734, 0.1091219531244611, 0.22519002460606702, 0.21772492296789606, 0.09288751240500746, -0.04307739530526156, 0.047001171225605355, 0.17483684828836624, 0.05848703923163145, -0.18896769353966802, 0.049846006991112066, 0.22360096291370996] |
1,802.03444 | Using the existence of t-designs to prove Erd\H{o}s-Ko-Rado | In 1984, Wilson proved the Erd\H{o}s-Ko-Rado theorem for $t$-intersecting
families of $k$-subsets of an $n$-set: he showed that if $n\ge(t+1)(k-t+1)$ and
$\mathcal{F}$ is a family of $k$-subsets of an $n$-set such that any two
members of $\mathcal{F}$ have at least $t$ elements in common, then
$|\mathcal{F}|\le\binom{n-t}{k-t}$. His proof made essential use of a matrix
whose origin is not obvious. In this paper we show that this matrix can be
derived, in a sense, as a projection of $t$-$(n,k,1)$ design.
| math.CO | in 1984 wilson proved the erdhoskorado theorem for tintersecting families of ksubsets of an nset he showed that if nget1kt1 and mathcalf is a family of ksubsets of an nset such that any two members of mathcalf have at least t elements in common then mathcalflebinomntkt his proof made essential use of a matrix whose origin is not obvious in this paper we show that this matrix can be derived in a sense as a projection of tnk1 design | [['in', '1984', 'wilson', 'proved', 'the', 'erdhoskorado', 'theorem', 'for', 'tintersecting', 'families', 'of', 'ksubsets', 'of', 'an', 'nset', 'he', 'showed', 'that', 'if', 'nget1kt1', 'and', 'mathcalf', 'is', 'a', 'family', 'of', 'ksubsets', 'of', 'an', 'nset', 'such', 'that', 'any', 'two', 'members', 'of', 'mathcalf', 'have', 'at', 'least', 't', 'elements', 'in', 'common', 'then', 'mathcalflebinomntkt', 'his', 'proof', 'made', 'essential', 'use', 'of', 'a', 'matrix', 'whose', 'origin', 'is', 'not', 'obvious', 'in', 'this', 'paper', 'we', 'show', 'that', 'this', 'matrix', 'can', 'be', 'derived', 'in', 'a', 'sense', 'as', 'a', 'projection', 'of', 'tnk1', 'design']] | [-0.1392812233565277, 0.1088369743883959, -0.09689172523365797, -0.002964883636818022, -0.02196952937121846, -0.15251190681010485, 0.037229742251312065, 0.35327051190267267, -0.25523279639157026, -0.23601724979418673, 0.08740923841067247, -0.3100397795144665, -0.1660328377773495, 0.14939044518886427, -0.1501555991248767, -0.007941149512158805, 0.09671236279628877, 0.10033773567135397, -0.027054926965655268, -0.28961024535084634, 0.3332137844745854, -0.07227923105911989, 0.18375557063049391, 0.04440818894899597, 0.12619195705720862, 0.019278265125314265, 0.007153360448826693, 0.04044078710476721, -0.11737568781695461, 0.11139320182663046, 0.2963539665368827, 0.1938409918281985, 0.2930203842391309, -0.32710807727600794, -0.1425372942635716, 0.20640741360961998, 0.1622524189052025, 0.02542987375177051, -0.03928046945580527, -0.19715137735597396, 0.1465350074914137, -0.16899609331678794, -0.18200279870315603, -0.010267946764973826, 0.10334131053011668, -0.0004765627060183569, -0.2894949051857877, -0.06295978938731805, 0.16515683846572707, 0.07924327873134691, 0.051265751011669636, -0.19027003147149166, -0.03155480542734854, 0.08281934081184629, -0.006392611858533009, 0.046059766643386534, 0.01219655059915232, -0.03914352711657748, -0.13872387150676282, 0.35201925628950304, -0.05039689719284836, -0.14995558481467397, 0.0956369047941591, -0.1248126013869248, -0.20372571152371452, 0.08498836574510374, 0.09048885618042397, 0.1527103618297444, -0.14276362072345555, 0.1344902701668233, -0.2049704206568238, 0.1654583107263438, 0.14614250656756522, 0.047206759728540326, 0.15815249100131423, 0.08140825254744605, 0.10519494278981399, 0.11997793433961067, 0.01927440784454934, 0.03190857854573742, -0.3477662984208253, -0.20496458968294687, -0.21800875555307261, 0.12743636843534709, -0.08633455044362467, -0.22950586115353203, 0.35239669295812126, 0.10929225426853488, 0.20212257161620073, 0.02627573164768125, 0.18345143783249354, 0.0495172166127687, 0.06537201958340838, 0.13601457812872372, 0.18233601609244943, 0.15160561715693852, -0.04603062003948971, -0.12857104736796923, 0.08770256092094841, 0.1637100534587118] |
1,802.03445 | Difference equations related to Jacobi-type pencils | In this paper we study various difference equations related to Jacobi-type
pencils. By a Jacobi-type pencil one means the following pencil: $J_5 - \lambda
J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real
symmetric five-diagonal matrix with positive numbers on the second subdiagonal.
The basic set of solutions for the corresponding $4$-th order difference
equation is constructed. Spectral properties of the truncated pencil and some
special matrix orthogonality relations are investigated. Classical type
orthogonal polynomials satisfying a $4$-th order differential equation are
constructed.
| math.CA | in this paper we study various difference equations related to jacobitype pencils by a jacobitype pencil one means the following pencil j_5 lambda j_3 where j_3 is a jacobi matrix and j_5 is a semiinfinite real symmetric fivediagonal matrix with positive numbers on the second subdiagonal the basic set of solutions for the corresponding 4th order difference equation is constructed spectral properties of the truncated pencil and some special matrix orthogonality relations are investigated classical type orthogonal polynomials satisfying a 4th order differential equation are constructed | [['in', 'this', 'paper', 'we', 'study', 'various', 'difference', 'equations', 'related', 'to', 'jacobitype', 'pencils', 'by', 'a', 'jacobitype', 'pencil', 'one', 'means', 'the', 'following', 'pencil', 'j_5', 'lambda', 'j_3', 'where', 'j_3', 'is', 'a', 'jacobi', 'matrix', 'and', 'j_5', 'is', 'a', 'semiinfinite', 'real', 'symmetric', 'fivediagonal', 'matrix', 'with', 'positive', 'numbers', 'on', 'the', 'second', 'subdiagonal', 'the', 'basic', 'set', 'of', 'solutions', 'for', 'the', 'corresponding', '4th', 'order', 'difference', 'equation', 'is', 'constructed', 'spectral', 'properties', 'of', 'the', 'truncated', 'pencil', 'and', 'some', 'special', 'matrix', 'orthogonality', 'relations', 'are', 'investigated', 'classical', 'type', 'orthogonal', 'polynomials', 'satisfying', 'a', '4th', 'order', 'differential', 'equation', 'are', 'constructed']] | [-0.19493382429429276, 0.06451330967870172, 0.0065551920858926555, 0.06482898119869533, -0.12232878362370092, -0.1543210988842644, -0.06521166422875425, 0.31280303417250166, -0.33485367809703875, -0.17687384092227318, 0.14821303461483398, -0.3457656291145615, -0.179675699601513, 0.11839476751899997, 0.0007434108316205269, 0.08099690904884144, 0.03508809222948066, 0.06778005166737319, -0.2042092944300452, -0.2504379413263916, 0.4350145347416401, -0.05324043314037628, 0.18113850903978876, -0.04742703128126883, 0.10900535608295264, 0.010685626065445155, -0.01131678843968223, -0.06499688115599024, -0.11993931062779455, 0.11871154388198954, 0.2402183898605493, 0.0613104778471901, 0.241364527158006, -0.34486806498797135, -0.0649212972629209, 0.16317597217857838, 0.11085733966522872, 0.0028289836018514105, -0.04736359971494219, -0.2351814269326454, 0.08806492230140192, -0.15774760432649665, -0.21523409031418173, -0.05837440653484136, -0.0076524002130988035, 0.10149963817093521, -0.3179719663376725, 0.053496798067245374, 0.053042791626784346, 0.07404632197671332, 0.01335369717048178, -0.18963644456464884, -0.006094275328038304, 0.027785187246018025, -0.027927575827857782, -0.05445647754484441, -0.026559444615444124, -0.014609639984988716, -0.05830901044117676, 0.4002441160467475, -0.026264178402841006, -0.29139379143368366, 0.049868778320202645, -0.1474830634935304, -0.11541698044328409, 0.12517548911950313, 0.10688876125929055, 0.12372016752961763, -0.13086314600090995, 0.15477278851227141, -0.09949345894964672, 0.14534217435298055, 0.15385798738489664, -0.08373018656315845, 0.08678534055713477, 0.020631554211641468, 0.023782060286679934, 0.11477515983481913, 0.04474870768798039, -0.12999329779318772, -0.31969245172343974, -0.16021182429218708, -0.19570903018723393, 0.09109798965022661, -0.14270260459899112, -0.18794939325321033, 0.4166823153405689, 0.010157995047128955, 0.16829154624192175, 0.028998842235481322, 0.21302848127345705, 0.2109317274665701, -0.0025032148263308893, 0.0079625025337432, 0.1437259884947115, 0.30635252761990267, 0.0804610998358924, -0.19869527972180148, -0.016811352986625807, 0.23495958782299314] |
1,802.03446 | Pros and Cons of GAN Evaluation Measures | Generative models, in particular generative adversarial networks (GANs), have
received significant attention recently. A number of GAN variants have been
proposed and have been utilized in many applications. Despite large strides in
terms of theoretical progress, evaluating and comparing GANs remains a daunting
task. While several measures have been introduced, as of yet, there is no
consensus as to which measure best captures strengths and limitations of models
and should be used for fair model comparison. As in other areas of computer
vision and machine learning, it is critical to settle on one or few good
measures to steer the progress in this field. In this paper, I review and
critically discuss more than 24 quantitative and 5 qualitative measures for
evaluating generative models with a particular emphasis on GAN-derived models.
I also provide a set of 7 desiderata followed by an evaluation of whether a
given measure or a family of measures is compatible with them.
| cs.CV | generative models in particular generative adversarial networks gans have received significant attention recently a number of gan variants have been proposed and have been utilized in many applications despite large strides in terms of theoretical progress evaluating and comparing gans remains a daunting task while several measures have been introduced as of yet there is no consensus as to which measure best captures strengths and limitations of models and should be used for fair model comparison as in other areas of computer vision and machine learning it is critical to settle on one or few good measures to steer the progress in this field in this paper i review and critically discuss more than 24 quantitative and 5 qualitative measures for evaluating generative models with a particular emphasis on ganderived models i also provide a set of 7 desiderata followed by an evaluation of whether a given measure or a family of measures is compatible with them | [['generative', 'models', 'in', 'particular', 'generative', 'adversarial', 'networks', 'gans', 'have', 'received', 'significant', 'attention', 'recently', 'a', 'number', 'of', 'gan', 'variants', 'have', 'been', 'proposed', 'and', 'have', 'been', 'utilized', 'in', 'many', 'applications', 'despite', 'large', 'strides', 'in', 'terms', 'of', 'theoretical', 'progress', 'evaluating', 'and', 'comparing', 'gans', 'remains', 'a', 'daunting', 'task', 'while', 'several', 'measures', 'have', 'been', 'introduced', 'as', 'of', 'yet', 'there', 'is', 'no', 'consensus', 'as', 'to', 'which', 'measure', 'best', 'captures', 'strengths', 'and', 'limitations', 'of', 'models', 'and', 'should', 'be', 'used', 'for', 'fair', 'model', 'comparison', 'as', 'in', 'other', 'areas', 'of', 'computer', 'vision', 'and', 'machine', 'learning', 'it', 'is', 'critical', 'to', 'settle', 'on', 'one', 'or', 'few', 'good', 'measures', 'to', 'steer', 'the', 'progress', 'in', 'this', 'field', 'in', 'this', 'paper', 'i', 'review', 'and', 'critically', 'discuss', 'more', 'than', '24', 'quantitative', 'and', '5', 'qualitative', 'measures', 'for', 'evaluating', 'generative', 'models', 'with', 'a', 'particular', 'emphasis', 'on', 'ganderived', 'models', 'i', 'also', 'provide', 'a', 'set', 'of', '7', 'desiderata', 'followed', 'by', 'an', 'evaluation', 'of', 'whether', 'a', 'given', 'measure', 'or', 'a', 'family', 'of', 'measures', 'is', 'compatible', 'with', 'them']] | [-0.02518865192019476, 0.03085069743797365, -0.059546887543267354, 0.08663156717338073, -0.05882968247915881, -0.18517274059092578, 0.01011989813653203, 0.4510710346631897, -0.18712054110633639, -0.3492231882081773, 0.10105264871470773, -0.2817469316427238, -0.17662412071457276, 0.22995413902054468, -0.14025832718433753, 0.11420831483048506, 0.08343131456953976, 0.05226764953355693, -0.04739600480836369, -0.2782358100207952, 0.304717297021013, 0.047359627386471495, 0.3109793332226288, 0.07207829067005943, 0.09449495944397476, -0.07869888053280122, -0.036497953795613006, 0.06078049395299063, -0.10710503046329205, 0.16533779743342444, 0.2762829326612775, 0.20697386599987602, 0.37793938300978297, -0.4340447714098562, -0.26421382152236617, 0.1616122568748557, 0.12939248172057352, 0.10099998541633025, -0.08356171781810982, -0.2701523822600929, 0.10193319967574774, -0.1959274064671869, -0.019352499670229662, -0.13230892731987226, 0.06851450263191229, 0.01615944995435898, -0.21919790067327902, -0.022165274130925238, 0.0695086128036611, 0.12598721086620712, -0.016659489813415956, -0.1490421956136393, 0.04136771251572869, 0.1479757328828176, 0.08471451141014814, 0.09712086883612359, 0.05924459762620525, -0.19677582151220682, -0.18116062389573273, 0.37700491030334843, -0.03986616127496326, -0.2048380925746945, 0.2148334136328254, -0.06735674752435909, -0.19120555931630617, 0.05674769018122998, 0.20210100589200664, 0.09907520533157274, -0.16745955037932175, 0.044693903632250086, -0.030541636743761886, 0.12804484956312734, 0.04197511016928519, 0.039720256304672845, 0.21004297428477842, 0.2374938128916069, 0.03439751107548662, 0.10648134489691494, -0.05694711475968152, -0.11963937684702568, -0.21243005922326866, -0.11997373400887366, -0.17604623419137147, 0.016296679039861865, -0.03005743699638212, -0.13794465351682633, 0.41142439787299967, 0.20044213630115756, 0.23080547651849115, 0.051218393384867035, 0.2807353766566405, 0.07560961379511774, 0.07868000442156187, 0.05074059361411342, 0.24883335932360914, 0.11351772206268297, 0.07701959046206842, -0.09676994000955556, 0.134169836800235, -0.005475002803648703] |
1,802.03447 | WIYN Open Cluster Study, LXXVI. Li Evolution Among Stars of
Low/Intermediate Mass: The Metal-Deficient Open Cluster, NGC 2506 | HYDRA spectra of 287 stars in the field of NGC 2506 from the turnoff through
the giant branch are analyzed. With previous data, 22 are identified as
probable binaries; 90 more are classified as potential non-members.
Spectroscopic analyses of ~60 red giants and slowly rotating turnoff stars
using line equivalent widths and a neural network approach lead to [Fe/H] =
-0.27 +/- 0.07 (s.d.) and [Fe/H] = -0.27 +/- 0.06 (s.d.), respectively. Li
abundances are derived for 145 probable single-star members, 44 being upper
limits. Among turnoff stars outside the Li-dip, A(Li) = 3.04 +/- 0.16 (s.d.),
with no trend with color, luminosity, or rotation speed. Evolving from the
turnoff across the subgiant branch, there is a well-delineated decline to A(Li)
~1.25 at the giant branch base, coupled with the rotational spindown from
between ~20 and 70 km/s to less than 20 km/s for stars entering the subgiant
branch and beyond. A(Li) remains effectively constant from the giant branch
base to the red giant clump level. A new member above the clump redefines the
path of the first-ascent red giant branch; its Li is 0.6 dex below the
first-ascent red giants. With one exception, all post-He-flash stars have upper
limits to A(Li), at or below the level of the brightest first-ascent red giant.
The patterns are in excellent qualitative agreement with the model predictions
for low/intermediate-mass stars which undergo rotation-induced mixing at the
turnoff and subgiant branch, first dredge-up, and thermohaline mixing beyond
the red giant bump.
| astro-ph.SR | hydra spectra of 287 stars in the field of ngc 2506 from the turnoff through the giant branch are analyzed with previous data 22 are identified as probable binaries 90 more are classified as potential nonmembers spectroscopic analyses of 60 red giants and slowly rotating turnoff stars using line equivalent widths and a neural network approach lead to feh 027 007 sd and feh 027 006 sd respectively li abundances are derived for 145 probable singlestar members 44 being upper limits among turnoff stars outside the lidip ali 304 016 sd with no trend with color luminosity or rotation speed evolving from the turnoff across the subgiant branch there is a welldelineated decline to ali 125 at the giant branch base coupled with the rotational spindown from between 20 and 70 kms to less than 20 kms for stars entering the subgiant branch and beyond ali remains effectively constant from the giant branch base to the red giant clump level a new member above the clump redefines the path of the firstascent red giant branch its li is 06 dex below the firstascent red giants with one exception all postheflash stars have upper limits to ali at or below the level of the brightest firstascent red giant the patterns are in excellent qualitative agreement with the model predictions for lowintermediatemass stars which undergo rotationinduced mixing at the turnoff and subgiant branch first dredgeup and thermohaline mixing beyond the red giant bump | [['hydra', 'spectra', 'of', '287', 'stars', 'in', 'the', 'field', 'of', 'ngc', '2506', 'from', 'the', 'turnoff', 'through', 'the', 'giant', 'branch', 'are', 'analyzed', 'with', 'previous', 'data', '22', 'are', 'identified', 'as', 'probable', 'binaries', '90', 'more', 'are', 'classified', 'as', 'potential', 'nonmembers', 'spectroscopic', 'analyses', 'of', '60', 'red', 'giants', 'and', 'slowly', 'rotating', 'turnoff', 'stars', 'using', 'line', 'equivalent', 'widths', 'and', 'a', 'neural', 'network', 'approach', 'lead', 'to', 'feh', '027', '007', 'sd', 'and', 'feh', '027', '006', 'sd', 'respectively', 'li', 'abundances', 'are', 'derived', 'for', '145', 'probable', 'singlestar', 'members', '44', 'being', 'upper', 'limits', 'among', 'turnoff', 'stars', 'outside', 'the', 'lidip', 'ali', '304', '016', 'sd', 'with', 'no', 'trend', 'with', 'color', 'luminosity', 'or', 'rotation', 'speed', 'evolving', 'from', 'the', 'turnoff', 'across', 'the', 'subgiant', 'branch', 'there', 'is', 'a', 'welldelineated', 'decline', 'to', 'ali', '125', 'at', 'the', 'giant', 'branch', 'base', 'coupled', 'with', 'the', 'rotational', 'spindown', 'from', 'between', '20', 'and', '70', 'kms', 'to', 'less', 'than', '20', 'kms', 'for', 'stars', 'entering', 'the', 'subgiant', 'branch', 'and', 'beyond', 'ali', 'remains', 'effectively', 'constant', 'from', 'the', 'giant', 'branch', 'base', 'to', 'the', 'red', 'giant', 'clump', 'level', 'a', 'new', 'member', 'above', 'the', 'clump', 'redefines', 'the', 'path', 'of', 'the', 'firstascent', 'red', 'giant', 'branch', 'its', 'li', 'is', '06', 'dex', 'below', 'the', 'firstascent', 'red', 'giants', 'with', 'one', 'exception', 'all', 'postheflash', 'stars', 'have', 'upper', 'limits', 'to', 'ali', 'at', 'or', 'below', 'the', 'level', 'of', 'the', 'brightest', 'firstascent', 'red', 'giant', 'the', 'patterns', 'are', 'in', 'excellent', 'qualitative', 'agreement', 'with', 'the', 'model', 'predictions', 'for', 'lowintermediatemass', 'stars', 'which', 'undergo', 'rotationinduced', 'mixing', 'at', 'the', 'turnoff', 'and', 'subgiant', 'branch', 'first', 'dredgeup', 'and', 'thermohaline', 'mixing', 'beyond', 'the', 'red', 'giant', 'bump']] | [-0.026777582063611288, 0.1776597876586796, -0.04703260113407547, 0.08227994659197672, -0.11194109949089276, -0.09499033835406105, 0.18481502023350913, 0.4055620805166351, -0.08501356520349267, -0.4146796322602313, 0.000643006914954943, -0.34497122212002673, -0.001935824909984755, 0.17406785778390865, -0.09395240230854446, -0.105580996543722, 0.14753098689482916, -0.017561014805687593, -0.017961568226261684, -0.24444014151085866, 0.24069525826344035, -0.04009722196860821, 0.15138958822644782, -0.11216819041486209, -0.019540983158609984, -0.20658999657607638, 0.01002952037936969, -0.11265212746269147, -0.16958047772204737, -0.006495813294895925, 0.21096703574003187, 0.11085973374429159, 0.2131085412654405, -0.2559975822456181, -0.13636396643123588, 0.026003778778855728, 0.2647243899801955, 0.026987949096655937, -0.05080206765687763, -0.2745614575736302, 0.12066021487504865, -0.15212509484166123, -0.2364732077267642, 0.1447218352521304, 0.05717203268092514, 0.004034784791292623, -0.20179557671071963, 0.1457299166494825, 0.039095959539796846, 0.1794840925622945, -0.07347012746710485, -0.28846423368086105, -0.1678133107488975, 0.08267352483914389, 0.016069237568687337, 0.0961463395266037, 0.11615799662540667, -0.07418380314484238, 0.03318166815345951, 0.3776160691554348, -0.1836793587963257, 0.0847331074202278, 0.20393524592024428, -0.1799215324880303, -0.1431875573451786, 0.15136879472659834, 0.08476842568682817, 0.13888829516169304, -0.19742829345632346, -0.022567699460341827, 0.0816896961487752, 0.17850751292595912, 0.1251226540383262, 0.04443463446341411, 0.3335400397063798, 0.15217732836026698, 0.01874627437937306, 0.005644401292132292, -0.2782680435319586, -0.09953709427791183, -0.19449095491921373, -0.053043451848983146, -0.041972458541567906, 0.044219879503361884, -0.180786923988065, -0.14929366491851398, 0.3062022118438714, 0.0576095751253888, 0.23274241924130668, 0.044478137574211964, 0.2855347253518024, 0.1114161294332007, 0.1494283808657201, 0.16995564942092944, 0.3553986239945516, 0.28315600042794054, 0.09888237769094606, -0.2633454359214132, 0.06397444650259179, -0.007254702999004318] |
1,802.03448 | Skew braces and the Galois correspondence for Hopf Galois structures | Let $L/K$ be a Galois extension of fields with Galois group $\Gamma$, and
suppose $L/K$ is also an $H$-Hopf Galois extension. Using the recently
uncovered connection between Hopf Galois structures and skew left braces, we
introduce a method to quantify the failure of surjectivity of the Galois
correspondence from subHopf algebras of $H$ to intermediate subfields of $L/K$,
given by the Fundamental Theorem of Hopf Galois Theory. Suppose $L \otimes_K H
= LN$ where $N \cong (G, \star)$. Then there exists a skew left brace $(G,
\star, \circ)$ where $(G, \circ) \cong \Gamma$. We show that there is a
bijective correspondence between intermediate fields $E$ between $K$ and $L$
and certain sub-skew left braces of $G$, which we call the $\circ$-stable
subgroups of $(G, \star)$. Counting these subgroups and comparing that number
with the number of subgroups of $\Gamma \cong (G, \circ)$ describes how far the
Galois correspondence for the $H$-Hopf Galois structure is from being
surjective. The method is illustrated by a variety of examples.
| math.RA | let lk be a galois extension of fields with galois group gamma and suppose lk is also an hhopf galois extension using the recently uncovered connection between hopf galois structures and skew left braces we introduce a method to quantify the failure of surjectivity of the galois correspondence from subhopf algebras of h to intermediate subfields of lk given by the fundamental theorem of hopf galois theory suppose l otimes_k h ln where n cong g star then there exists a skew left brace g star circ where g circ cong gamma we show that there is a bijective correspondence between intermediate fields e between k and l and certain subskew left braces of g which we call the circstable subgroups of g star counting these subgroups and comparing that number with the number of subgroups of gamma cong g circ describes how far the galois correspondence for the hhopf galois structure is from being surjective the method is illustrated by a variety of examples | [['let', 'lk', 'be', 'a', 'galois', 'extension', 'of', 'fields', 'with', 'galois', 'group', 'gamma', 'and', 'suppose', 'lk', 'is', 'also', 'an', 'hhopf', 'galois', 'extension', 'using', 'the', 'recently', 'uncovered', 'connection', 'between', 'hopf', 'galois', 'structures', 'and', 'skew', 'left', 'braces', 'we', 'introduce', 'a', 'method', 'to', 'quantify', 'the', 'failure', 'of', 'surjectivity', 'of', 'the', 'galois', 'correspondence', 'from', 'subhopf', 'algebras', 'of', 'h', 'to', 'intermediate', 'subfields', 'of', 'lk', 'given', 'by', 'the', 'fundamental', 'theorem', 'of', 'hopf', 'galois', 'theory', 'suppose', 'l', 'otimes_k', 'h', 'ln', 'where', 'n', 'cong', 'g', 'star', 'then', 'there', 'exists', 'a', 'skew', 'left', 'brace', 'g', 'star', 'circ', 'where', 'g', 'circ', 'cong', 'gamma', 'we', 'show', 'that', 'there', 'is', 'a', 'bijective', 'correspondence', 'between', 'intermediate', 'fields', 'e', 'between', 'k', 'and', 'l', 'and', 'certain', 'subskew', 'left', 'braces', 'of', 'g', 'which', 'we', 'call', 'the', 'circstable', 'subgroups', 'of', 'g', 'star', 'counting', 'these', 'subgroups', 'and', 'comparing', 'that', 'number', 'with', 'the', 'number', 'of', 'subgroups', 'of', 'gamma', 'cong', 'g', 'circ', 'describes', 'how', 'far', 'the', 'galois', 'correspondence', 'for', 'the', 'hhopf', 'galois', 'structure', 'is', 'from', 'being', 'surjective', 'the', 'method', 'is', 'illustrated', 'by', 'a', 'variety', 'of', 'examples']] | [-0.2106700987873099, 0.13040115134927185, -0.10425651925985088, 0.03941698394795289, -0.14405293917715004, -0.15102501598856888, 0.005218585473258139, 0.36372255363569755, -0.41600020841990665, -0.2498605148242105, 0.017610150148024466, -0.2629319015867645, -0.13925332184341485, 0.20908538773996618, -0.1308859354765268, -0.09646910391662769, 0.010750270391837126, 0.18649114451155338, -0.06040076458175019, -0.21766347489490107, 0.33401681206553957, -0.07730922719219518, 0.13943328514763312, 0.010299932305337635, 0.09664059695560576, 0.0017967155634811738, -0.005405343561106725, -0.04622668618614581, -0.21755364322057064, 0.03452594380005172, 0.34063017959337366, 0.08773033345038662, 0.2311048388251149, -0.3169373269647178, -0.06511039981084717, 0.286294609595022, 0.13513944361915403, -0.1073690413876448, -0.037759714441873676, -0.2902330992038492, 0.13372250517444095, -0.18930594100639586, -0.06369485512302007, -0.03557243320392445, 0.1722038675883285, -0.005038649985203292, -0.26183176192734675, 0.012207848373225538, 0.10954777113440242, 0.2049421010937871, 0.0464135486257785, -0.13300546080657713, -0.08797395436899601, 0.04891411136415583, -0.017896527554357153, 0.10280538128870653, 0.0877198593452482, -0.10159866111182676, -0.09860337716129768, 0.3761261045342175, -0.06699539289139665, -0.11973882879154678, 0.10046500367788234, -0.18429041854475012, -0.16423086887339083, 0.09005972105305551, 0.009411217332476886, 0.1428735085604031, 0.012161573139232265, 0.24657049577182055, -0.1874857878767837, 0.07538698189224616, 0.10340045237482139, -0.07167437005356499, 0.12915998582569202, 0.07304230637467898, 0.06558489032578087, 0.11664699484159738, 0.01146365343536273, 0.08336036031066281, -0.3827378525307811, -0.1332473795883721, -0.06909059856382267, 0.1429097973542833, -0.09926928264873668, -0.11932661082800024, 0.3502085905908266, 0.08612389372315303, 0.16278508964289978, 0.1181055501198521, 0.15165211993167405, 0.03423363386323994, 0.07713519922662072, 0.08877581317636479, 0.06589238002197817, 0.3721291577676311, -0.1365057917186854, -0.19464810036985977, -0.06876418261686568, 0.1836697547469379] |
1,802.03449 | Accuracy of the microcanonical Lanczos method to compute real-frequency
dynamical spectral functions of quantum models at finite temperatures | We examine the accuracy of the microcanonical Lanczos method (MCLM) developed
by Long, {\it et al.} [Phys. Rev. B {\bf 68}, 235106 (2003)] to compute
dynamical spectral functions of interacting quantum models at finite
temperatures. The MCLM is based on the microcanonical ensemble, which becomes
exact in the thermodynamic limit. To apply the microcanonical ensemble at a
fixed temperature, one has to find energy eigenstates with the energy
eigenvalue corresponding to the internal energy in the canonical ensemble.
Here, we propose to use thermal pure quantum state methods by Sugiura and
Shimizu [Phys. Rev. Lett. {\bf 111}, 010401 (2013)] to obtain the internal
energy. After obtaining the energy eigenstates using the Lanczos
diagonalization method, dynamical quantities are computed via a continued
fraction expansion, a standard procedure for Lanczos-based numerical methods.
Using one-dimensional antiferromagnetic Heisenberg chains with $S=1/2$, we
demonstrate that the proposed procedure is reasonably accurate even for
relatively small systems.
| cond-mat.str-el | we examine the accuracy of the microcanonical lanczos method mclm developed by long it et al phys rev b bf 68 235106 2003 to compute dynamical spectral functions of interacting quantum models at finite temperatures the mclm is based on the microcanonical ensemble which becomes exact in the thermodynamic limit to apply the microcanonical ensemble at a fixed temperature one has to find energy eigenstates with the energy eigenvalue corresponding to the internal energy in the canonical ensemble here we propose to use thermal pure quantum state methods by sugiura and shimizu phys rev lett bf 111 010401 2013 to obtain the internal energy after obtaining the energy eigenstates using the lanczos diagonalization method dynamical quantities are computed via a continued fraction expansion a standard procedure for lanczosbased numerical methods using onedimensional antiferromagnetic heisenberg chains with s12 we demonstrate that the proposed procedure is reasonably accurate even for relatively small systems | [['we', 'examine', 'the', 'accuracy', 'of', 'the', 'microcanonical', 'lanczos', 'method', 'mclm', 'developed', 'by', 'long', 'it', 'et', 'al', 'phys', 'rev', 'b', 'bf', '68', '235106', '2003', 'to', 'compute', 'dynamical', 'spectral', 'functions', 'of', 'interacting', 'quantum', 'models', 'at', 'finite', 'temperatures', 'the', 'mclm', 'is', 'based', 'on', 'the', 'microcanonical', 'ensemble', 'which', 'becomes', 'exact', 'in', 'the', 'thermodynamic', 'limit', 'to', 'apply', 'the', 'microcanonical', 'ensemble', 'at', 'a', 'fixed', 'temperature', 'one', 'has', 'to', 'find', 'energy', 'eigenstates', 'with', 'the', 'energy', 'eigenvalue', 'corresponding', 'to', 'the', 'internal', 'energy', 'in', 'the', 'canonical', 'ensemble', 'here', 'we', 'propose', 'to', 'use', 'thermal', 'pure', 'quantum', 'state', 'methods', 'by', 'sugiura', 'and', 'shimizu', 'phys', 'rev', 'lett', 'bf', '111', '010401', '2013', 'to', 'obtain', 'the', 'internal', 'energy', 'after', 'obtaining', 'the', 'energy', 'eigenstates', 'using', 'the', 'lanczos', 'diagonalization', 'method', 'dynamical', 'quantities', 'are', 'computed', 'via', 'a', 'continued', 'fraction', 'expansion', 'a', 'standard', 'procedure', 'for', 'lanczosbased', 'numerical', 'methods', 'using', 'onedimensional', 'antiferromagnetic', 'heisenberg', 'chains', 'with', 's12', 'we', 'demonstrate', 'that', 'the', 'proposed', 'procedure', 'is', 'reasonably', 'accurate', 'even', 'for', 'relatively', 'small', 'systems']] | [-0.06217551737048682, 0.13276138221266862, -0.07110640778825086, 0.010210049227692636, 0.00024637731023432823, -0.10720410055930933, 0.09299359739376795, 0.3577991588683424, -0.17055945651177568, -0.30529232190971906, 0.012189142462241169, -0.2712676296785674, -0.09759070442195657, 0.1740381040816639, -0.008260653948023815, 0.07699659014208204, 0.08056255661485553, 0.010867656322255505, -0.13254746121523164, -0.26124378567524004, 0.19021906263363741, 0.13691538976874176, 0.282028566480258, 0.02812296543082835, 0.11139021503532794, 0.04138578759543848, 0.04666477267086606, -0.014421826416795337, -0.19784168602966887, 0.048482531009729476, 0.23337198884317503, 0.041443243494644864, 0.23846490441465237, -0.38076585953767667, -0.20799816560450216, 0.11512552284254324, 0.0864033313177451, 0.17540753729900832, 0.03481436337284969, -0.30579159095033304, 0.0482950137611502, -0.22684620975222963, -0.14107252653077207, -0.2055533024163654, 0.04821102742743272, -0.005344773567712947, -0.27525417374887645, 0.20781184661892813, 0.01632497173182404, 0.04258093449768404, -0.021110126870565567, -0.11809492307158824, -0.025949359987081096, 0.002754592083569541, -0.03696065226838543, 0.031962717911416055, 0.12545395528916395, -0.007194195624015875, -0.10322908447561598, 0.33696217346161406, -0.06272886728949145, -0.17092819846603993, 0.20756707463144705, -0.06890521548694663, -0.1407548272138424, 0.11356821030240831, 0.09843045391217374, 0.1375362691219471, -0.1686383523390747, 0.1603807483783348, -0.038038574140393897, 0.14707679554469252, 0.04486919653558191, -0.01842411179970575, 0.1811111931245299, 0.09387720876917142, -0.013519374259916329, 0.14435422578639032, -0.10506569336937278, -0.17742214936195816, -0.23889184419390738, -0.14842721674856557, -0.2739318895431848, 0.10218044371662924, -0.03537529611625262, -0.17238723020063051, 0.38251579680398806, 0.17678884289621208, 0.210722326763086, 0.05186672056571974, 0.23704553288001343, 0.15190907574849416, -0.029919577435505947, 0.18019559338607594, 0.23360622118870983, 0.18816332491864793, 0.10010704181653966, -0.2801680632823166, -0.06782199699906695, 0.14436746545248483] |
1,802.0345 | Minimizing Latency to Support VR Social Interactions over Wireless
Cellular Systems via Bandwidth Allocation | Immersive social interactions of mobile users are soon to be enabled within a
virtual space, by means of virtual reality (VR) technologies and wireless
cellular systems. In a VR mobile social network, the states of all interacting
users should be updated synchronously and with low latency via two-way
communications with edge computing servers. The resulting end-to-end latency
depends on the relationship between the virtual and physical locations of the
wireless VR users and of the edge servers. In this work, the problem of
analyzing and optimizing the end-to-end latency is investigated for a simple
network topology, yielding important insights into the interplay between
physical and virtual geometries.
| cs.IT cs.NI math.IT | immersive social interactions of mobile users are soon to be enabled within a virtual space by means of virtual reality vr technologies and wireless cellular systems in a vr mobile social network the states of all interacting users should be updated synchronously and with low latency via twoway communications with edge computing servers the resulting endtoend latency depends on the relationship between the virtual and physical locations of the wireless vr users and of the edge servers in this work the problem of analyzing and optimizing the endtoend latency is investigated for a simple network topology yielding important insights into the interplay between physical and virtual geometries | [['immersive', 'social', 'interactions', 'of', 'mobile', 'users', 'are', 'soon', 'to', 'be', 'enabled', 'within', 'a', 'virtual', 'space', 'by', 'means', 'of', 'virtual', 'reality', 'vr', 'technologies', 'and', 'wireless', 'cellular', 'systems', 'in', 'a', 'vr', 'mobile', 'social', 'network', 'the', 'states', 'of', 'all', 'interacting', 'users', 'should', 'be', 'updated', 'synchronously', 'and', 'with', 'low', 'latency', 'via', 'twoway', 'communications', 'with', 'edge', 'computing', 'servers', 'the', 'resulting', 'endtoend', 'latency', 'depends', 'on', 'the', 'relationship', 'between', 'the', 'virtual', 'and', 'physical', 'locations', 'of', 'the', 'wireless', 'vr', 'users', 'and', 'of', 'the', 'edge', 'servers', 'in', 'this', 'work', 'the', 'problem', 'of', 'analyzing', 'and', 'optimizing', 'the', 'endtoend', 'latency', 'is', 'investigated', 'for', 'a', 'simple', 'network', 'topology', 'yielding', 'important', 'insights', 'into', 'the', 'interplay', 'between', 'physical', 'and', 'virtual', 'geometries']] | [-0.25564851534741095, 0.09491148819737832, -0.016807539608856125, 0.03066184318615733, -0.05720386400636042, -0.21760439343976778, 0.13456102756339464, 0.4098306286070391, -0.2792192880786677, -0.3224914256727027, 0.015170754079280473, -0.2550476069222683, -0.21187709634427296, 0.15379229961746485, -0.09143552700031514, 0.03742200568335775, 0.071665754493883, 0.04003866939483402, 0.004157148922437793, -0.2208984259093859, 0.325817822583159, 0.0553513292928235, 0.32234014773079867, 0.12920553707104246, 0.042456737212471174, 0.0665846675477713, -0.03498649435274512, -0.0038924049654057266, -0.04551270704881819, 0.19418899342472118, 0.32044998468900815, 0.19620454375562477, 0.3051161683190649, -0.5131476453427121, -0.21132976261063297, 0.07148973879656781, 0.17803153891342682, 0.009035182934010698, -0.02019492394908845, -0.3739790929846953, 0.10428731870254344, -0.24846127714578795, -0.06242465635622355, 0.022588669122240255, 0.02414385506134724, 0.08114157936200674, -0.2712947863598015, -0.0722231749427792, -0.09256853347766066, 0.0970240498187943, -0.06861629370582577, 0.003856113773338697, -0.024156748465149203, 0.26113296395045854, 0.009358783755190322, -0.004538938925366535, 0.1508449150214546, -0.16989139398499, -0.12259982825282996, 0.4268481668050044, 0.047847299549345655, -0.17848563766994766, 0.20686239233919393, -0.01139791293296023, -0.08124018040546607, 0.10160518328824611, 0.2784795167237938, -0.001187958537000362, -0.19456230494776897, 0.04734103297123851, 0.006487372975413488, 0.11928214920058011, 0.04144266945588464, 0.13049809784828642, 0.20236110633291374, 0.23492203875897436, 0.08652959640842871, 0.08669800551338383, -0.05276389707915624, -0.1299064275895672, -0.17801949726069502, -0.1928948347117299, -0.22291908937258315, 0.028653068263431853, -0.13477982650973364, -0.09421871489819104, 0.3741547417931398, 0.09451872057055132, 0.17288175566887884, 0.0784655951842596, 0.4012838853436096, 0.07377057377614568, 0.09918807755946835, 0.1593771418208413, 0.171614841932309, 0.008770705159387994, 0.22106090806442025, -0.17237924026960733, 0.08811604007795697, 0.01856332828255945] |
1,802.03451 | Estimating the Spectral Density of Large Implicit Matrices | Many important problems are characterized by the eigenvalues of a large
matrix. For example, the difficulty of many optimization problems, such as
those arising from the fitting of large models in statistics and machine
learning, can be investigated via the spectrum of the Hessian of the empirical
loss function. Network data can be understood via the eigenstructure of a graph
Laplacian matrix using spectral graph theory. Quantum simulations and other
many-body problems are often characterized via the eigenvalues of the solution
space, as are various dynamic systems. However, naive eigenvalue estimation is
computationally expensive even when the matrix can be represented; in many of
these situations the matrix is so large as to only be available implicitly via
products with vectors. Even worse, one may only have noisy estimates of such
matrix vector products. In this work, we combine several different techniques
for randomized estimation and show that it is possible to construct unbiased
estimators to answer a broad class of questions about the spectra of such
implicit matrices, even in the presence of noise. We validate these methods on
large-scale problems in which graph theory and random matrix theory provide
ground truth.
| stat.ML stat.CO | many important problems are characterized by the eigenvalues of a large matrix for example the difficulty of many optimization problems such as those arising from the fitting of large models in statistics and machine learning can be investigated via the spectrum of the hessian of the empirical loss function network data can be understood via the eigenstructure of a graph laplacian matrix using spectral graph theory quantum simulations and other manybody problems are often characterized via the eigenvalues of the solution space as are various dynamic systems however naive eigenvalue estimation is computationally expensive even when the matrix can be represented in many of these situations the matrix is so large as to only be available implicitly via products with vectors even worse one may only have noisy estimates of such matrix vector products in this work we combine several different techniques for randomized estimation and show that it is possible to construct unbiased estimators to answer a broad class of questions about the spectra of such implicit matrices even in the presence of noise we validate these methods on largescale problems in which graph theory and random matrix theory provide ground truth | [['many', 'important', 'problems', 'are', 'characterized', 'by', 'the', 'eigenvalues', 'of', 'a', 'large', 'matrix', 'for', 'example', 'the', 'difficulty', 'of', 'many', 'optimization', 'problems', 'such', 'as', 'those', 'arising', 'from', 'the', 'fitting', 'of', 'large', 'models', 'in', 'statistics', 'and', 'machine', 'learning', 'can', 'be', 'investigated', 'via', 'the', 'spectrum', 'of', 'the', 'hessian', 'of', 'the', 'empirical', 'loss', 'function', 'network', 'data', 'can', 'be', 'understood', 'via', 'the', 'eigenstructure', 'of', 'a', 'graph', 'laplacian', 'matrix', 'using', 'spectral', 'graph', 'theory', 'quantum', 'simulations', 'and', 'other', 'manybody', 'problems', 'are', 'often', 'characterized', 'via', 'the', 'eigenvalues', 'of', 'the', 'solution', 'space', 'as', 'are', 'various', 'dynamic', 'systems', 'however', 'naive', 'eigenvalue', 'estimation', 'is', 'computationally', 'expensive', 'even', 'when', 'the', 'matrix', 'can', 'be', 'represented', 'in', 'many', 'of', 'these', 'situations', 'the', 'matrix', 'is', 'so', 'large', 'as', 'to', 'only', 'be', 'available', 'implicitly', 'via', 'products', 'with', 'vectors', 'even', 'worse', 'one', 'may', 'only', 'have', 'noisy', 'estimates', 'of', 'such', 'matrix', 'vector', 'products', 'in', 'this', 'work', 'we', 'combine', 'several', 'different', 'techniques', 'for', 'randomized', 'estimation', 'and', 'show', 'that', 'it', 'is', 'possible', 'to', 'construct', 'unbiased', 'estimators', 'to', 'answer', 'a', 'broad', 'class', 'of', 'questions', 'about', 'the', 'spectra', 'of', 'such', 'implicit', 'matrices', 'even', 'in', 'the', 'presence', 'of', 'noise', 'we', 'validate', 'these', 'methods', 'on', 'largescale', 'problems', 'in', 'which', 'graph', 'theory', 'and', 'random', 'matrix', 'theory', 'provide', 'ground', 'truth']] | [-0.06357243240429716, 0.07540392567562856, -0.05136869515297172, 0.11276100515967014, -0.05899805516496764, -0.14008574541254026, -0.0028736160813536437, 0.39750862581935265, -0.32376619580640925, -0.32947637388058043, 0.1879667585620348, -0.27439542710292514, -0.20585187788632905, 0.20416780585064817, -0.06304298156457398, 0.11810140455035502, 0.1261845666606346, 0.04144274203696076, -0.08616915550818811, -0.2338192003507377, 0.34426867907114056, 0.015465394267450458, 0.22944357251468564, 0.0289021462535032, 0.07361568180528118, 0.007426073578056045, -0.025546914400832024, 0.057652882167465086, -0.04456011675814091, 0.14286180684063102, 0.32028179078138874, 0.1799788947164086, 0.3005423590583788, -0.4337352207847364, -0.2299592113267109, 0.16717668293632681, 0.152419298089838, 0.12676277208754821, -0.00037855262219075865, -0.2729393202193815, 0.10409938026378848, -0.15561371913343822, -0.0615713848838573, -0.14027618153088298, -0.052694796080281235, 0.018717257987582392, -0.30815923790124106, 0.0848248899272532, 0.01931236493473612, 0.04636623460673993, -0.013590135961442876, -0.16501162430377667, 0.0340198086546927, 0.13890806576457246, 0.05226747786229605, -0.03596739190355561, 0.11258567357194547, -0.13846848827516514, -0.12331647385114447, 0.37266491193787576, -0.026033798408805552, -0.2340966809608544, 0.17842161810204116, -0.0902284894963736, -0.1386873403472411, 0.1092067717748255, 0.1869909463865306, 0.13203741771945912, -0.1389906173949691, 0.10150787667998648, -0.06830327850259801, 0.1374095725541008, 0.015762230079775494, 0.0313620839193777, 0.15253937952920138, 0.11374024415287368, 0.07873682479688975, 0.11181367100174225, -0.025197455274674638, -0.09389721078181716, -0.24089529019312383, -0.10966118119042995, -0.2792636795654661, 0.05099871818342975, -0.14330956485536228, -0.21446228664069208, 0.3754514657845238, 0.14392625236789663, 0.22564780429111783, 0.031578038994662, 0.2923078296435852, 0.14596686828181804, 0.05147586594977527, 0.06895711052369018, 0.18657560552014377, 0.15105119666417607, 0.05162942454633858, -0.15263919331618328, 0.08438135327776132, 0.05592604993162146] |
1,802.03452 | Learning Local Metrics and Influential Regions for Classification | The performance of distance-based classifiers heavily depends on the
underlying distance metric, so it is valuable to learn a suitable metric from
the data. To address the problem of multimodality, it is desirable to learn
local metrics. In this short paper, we define a new intuitive distance with
local metrics and influential regions, and subsequently propose a novel local
metric learning method for distance-based classification. Our key intuition is
to partition the metric space into influential regions and a background region,
and then regulate the effectiveness of each local metric to be within the
related influential regions. We learn local metrics and influential regions to
reduce the empirical hinge loss, and regularize the parameters on the basis of
a resultant learning bound. Encouraging experimental results are obtained from
various public and popular data sets.
| cs.LG | the performance of distancebased classifiers heavily depends on the underlying distance metric so it is valuable to learn a suitable metric from the data to address the problem of multimodality it is desirable to learn local metrics in this short paper we define a new intuitive distance with local metrics and influential regions and subsequently propose a novel local metric learning method for distancebased classification our key intuition is to partition the metric space into influential regions and a background region and then regulate the effectiveness of each local metric to be within the related influential regions we learn local metrics and influential regions to reduce the empirical hinge loss and regularize the parameters on the basis of a resultant learning bound encouraging experimental results are obtained from various public and popular data sets | [['the', 'performance', 'of', 'distancebased', 'classifiers', 'heavily', 'depends', 'on', 'the', 'underlying', 'distance', 'metric', 'so', 'it', 'is', 'valuable', 'to', 'learn', 'a', 'suitable', 'metric', 'from', 'the', 'data', 'to', 'address', 'the', 'problem', 'of', 'multimodality', 'it', 'is', 'desirable', 'to', 'learn', 'local', 'metrics', 'in', 'this', 'short', 'paper', 'we', 'define', 'a', 'new', 'intuitive', 'distance', 'with', 'local', 'metrics', 'and', 'influential', 'regions', 'and', 'subsequently', 'propose', 'a', 'novel', 'local', 'metric', 'learning', 'method', 'for', 'distancebased', 'classification', 'our', 'key', 'intuition', 'is', 'to', 'partition', 'the', 'metric', 'space', 'into', 'influential', 'regions', 'and', 'a', 'background', 'region', 'and', 'then', 'regulate', 'the', 'effectiveness', 'of', 'each', 'local', 'metric', 'to', 'be', 'within', 'the', 'related', 'influential', 'regions', 'we', 'learn', 'local', 'metrics', 'and', 'influential', 'regions', 'to', 'reduce', 'the', 'empirical', 'hinge', 'loss', 'and', 'regularize', 'the', 'parameters', 'on', 'the', 'basis', 'of', 'a', 'resultant', 'learning', 'bound', 'encouraging', 'experimental', 'results', 'are', 'obtained', 'from', 'various', 'public', 'and', 'popular', 'data', 'sets']] | [-0.0334179287241188, 0.010280557063672303, -0.11910490513737522, 0.1278203998661058, -0.1388267369614219, -0.14137836974183682, 0.07707366281025696, 0.38775149696687267, -0.28042543201304193, -0.30234476284874573, 0.05959374169426372, -0.2845990267137427, -0.22181723077795398, 0.17086811363523297, -0.12614043429168115, 0.06617621144404941, 0.06719028593193907, 0.07608747425308424, -0.08043729613966016, -0.28256863607232696, 0.400715992528834, 0.100092332831014, 0.3581783290980245, 0.04900278275095816, 0.12223288400703346, -0.0321910574323317, -0.08207222386332813, 0.05788330852602254, -0.12479139947673, 0.21444255364763398, 0.27539542585666943, 0.2301928691510389, 0.3280768984470016, -0.35996951223976575, -0.21242852529177247, 0.11455660557318757, 0.09236195381668244, 0.06438941695491102, -0.0006266245931220144, -0.3340607858575714, 0.103128051489536, -0.1076170508541278, -0.0509072272350261, -0.1431203001550635, -0.010698591124391489, 0.001963497111712819, -0.28976401411441727, 0.04061764616644316, 0.01627814267812394, -0.003910298417530843, -0.07591558935002549, -0.07658788885698835, 0.010835667499584327, 0.18753647126966336, 0.060890582322365425, 0.10588391350213883, 0.16079722578487873, -0.1242995005254738, -0.0925250775719395, 0.3379471112970513, -0.027046475066011075, -0.2329327025287437, 0.20949394308524066, -0.04199143236072095, -0.12146285779204276, 0.06406777383717917, 0.2507618023499624, 0.15651557838488647, -0.1768117015660087, 0.02884588692964527, -0.022941638104384765, 0.13930210130595005, 0.03123839907591412, 0.052900248565085566, 0.16552210003033335, 0.17692109400323078, 0.09944146891255297, 0.1364636694319171, -0.09838121554313867, -0.07331343590796216, -0.24820600461854198, -0.1187873004953926, -0.17927514007593046, -0.019694875696423784, -0.17260703425291915, -0.16642796498132129, 0.42645995685511007, 0.16885228698148824, 0.2518798538845088, 0.04077866110853406, 0.306492584123304, 0.026194164540736812, 0.07782125719058425, 0.12682233614770613, 0.22506594451825454, 0.05678662928099285, 0.048189923427860014, -0.1681722719917324, 0.10718271632525903, 0.09024882949575949] |
1,802.03453 | On variational solutions for whole brain serial-section histology using
the computational anatomy random orbit model | This paper presents a variational framework for dense diffeomorphic
atlas-mapping onto high-throughput histology stacks at the 20 um meso-scale.
The observed sections are modelled as Gaussian random fields conditioned on a
sequence of unknown section by section rigid motions and unknown diffeomorphic
transformation of a three-dimensional atlas. To regularize over the
high-dimensionality of our parameter space (which is a product space of the
rigid motion dimensions and the diffeomorphism dimensions), the histology
stacks are modelled as arising from a first order Sobolev space smoothness
prior. We show that the joint maximum a-posteriori, penalized-likelihood
estimator of our high dimensional parameter space emerges as a joint
optimization interleaving rigid motion estimation for histology restacking and
large deformation diffeomorphic metric mapping to atlas coordinates. We show
that joint optimization in this parameter space solves the classical curvature
non-identifiability of the histology stacking problem. The algorithms are
demonstrated on a collection of whole-brain histological image stacks from the
Mouse Brain Architecture Project.
| eess.IV | this paper presents a variational framework for dense diffeomorphic atlasmapping onto highthroughput histology stacks at the 20 um mesoscale the observed sections are modelled as gaussian random fields conditioned on a sequence of unknown section by section rigid motions and unknown diffeomorphic transformation of a threedimensional atlas to regularize over the highdimensionality of our parameter space which is a product space of the rigid motion dimensions and the diffeomorphism dimensions the histology stacks are modelled as arising from a first order sobolev space smoothness prior we show that the joint maximum aposteriori penalizedlikelihood estimator of our high dimensional parameter space emerges as a joint optimization interleaving rigid motion estimation for histology restacking and large deformation diffeomorphic metric mapping to atlas coordinates we show that joint optimization in this parameter space solves the classical curvature nonidentifiability of the histology stacking problem the algorithms are demonstrated on a collection of wholebrain histological image stacks from the mouse brain architecture project | [['this', 'paper', 'presents', 'a', 'variational', 'framework', 'for', 'dense', 'diffeomorphic', 'atlasmapping', 'onto', 'highthroughput', 'histology', 'stacks', 'at', 'the', '20', 'um', 'mesoscale', 'the', 'observed', 'sections', 'are', 'modelled', 'as', 'gaussian', 'random', 'fields', 'conditioned', 'on', 'a', 'sequence', 'of', 'unknown', 'section', 'by', 'section', 'rigid', 'motions', 'and', 'unknown', 'diffeomorphic', 'transformation', 'of', 'a', 'threedimensional', 'atlas', 'to', 'regularize', 'over', 'the', 'highdimensionality', 'of', 'our', 'parameter', 'space', 'which', 'is', 'a', 'product', 'space', 'of', 'the', 'rigid', 'motion', 'dimensions', 'and', 'the', 'diffeomorphism', 'dimensions', 'the', 'histology', 'stacks', 'are', 'modelled', 'as', 'arising', 'from', 'a', 'first', 'order', 'sobolev', 'space', 'smoothness', 'prior', 'we', 'show', 'that', 'the', 'joint', 'maximum', 'aposteriori', 'penalizedlikelihood', 'estimator', 'of', 'our', 'high', 'dimensional', 'parameter', 'space', 'emerges', 'as', 'a', 'joint', 'optimization', 'interleaving', 'rigid', 'motion', 'estimation', 'for', 'histology', 'restacking', 'and', 'large', 'deformation', 'diffeomorphic', 'metric', 'mapping', 'to', 'atlas', 'coordinates', 'we', 'show', 'that', 'joint', 'optimization', 'in', 'this', 'parameter', 'space', 'solves', 'the', 'classical', 'curvature', 'nonidentifiability', 'of', 'the', 'histology', 'stacking', 'problem', 'the', 'algorithms', 'are', 'demonstrated', 'on', 'a', 'collection', 'of', 'wholebrain', 'histological', 'image', 'stacks', 'from', 'the', 'mouse', 'brain', 'architecture', 'project']] | [-0.09008848659878087, 0.03641723293757695, -0.04834230765285101, 0.05166653430557982, -0.06420246713385461, -0.08391069842407563, -0.03924301848153637, 0.4072228955567642, -0.3065090710475187, -0.28045719612840636, 0.10182211653976019, -0.2327927760720538, -0.17468412382680934, 0.14714494727219746, -0.15467247437495904, 0.10919088177504552, 0.10482704627422533, -0.019781795524618333, -0.05966996423793352, -0.24888802258665585, 0.3284359095552506, -0.0018950217895826716, 0.3027241033543447, -0.054954776733188306, 0.19301149836640544, 0.03210876266039006, -0.03711268401802607, 0.037995909579998405, -0.1443790292185116, 0.16780603588276963, 0.28417313625668267, 0.10320188909187723, 0.22919473568872722, -0.3723179397238478, -0.2379775173594333, 0.10525181175618889, 0.1481624974796525, 0.060088757712506706, 0.004091622039474025, -0.34646355727343425, 0.05318534134288028, -0.10433344958145409, -0.0707582072473493, -0.08751836957730305, -0.006710954603685695, -0.024400566784653126, -0.27193229161440186, 0.0957824542457755, 0.024909025442988203, 0.06882042595582782, -0.11387691497031575, -0.08082492894546431, -0.044269052206592004, 0.11824409645584644, 0.034573905770577916, 0.10863685789429078, 0.17753250899006892, -0.11045222430532409, -0.08892682347977593, 0.3281377741509372, -0.007079874102328756, -0.25638823059556565, 0.16150715748726088, -0.1085293117619956, -0.15035637930201687, 0.18126350737645464, 0.1924843354681566, 0.13754432256019133, -0.13004604358653163, 0.1325122244885209, -0.02304483731840826, 0.16279839792520187, 0.09481056689753369, -0.059753360511485935, 0.14479407932977104, 0.22280700797523567, 0.0898907259188201, 0.121444497966344, -0.17162504865473527, -0.06535296723918373, -0.33893156570017596, -0.1721488038392346, -0.19736491767378156, 0.052566904397043666, -0.13663866989298615, -0.18783343966552027, 0.33343755011001874, 0.0794135741733762, 0.2617469843904114, 0.09661875110472534, 0.32112242083308423, 0.00022448198558394885, 0.06281948480253652, 0.011795876933273617, 0.1751654560152726, 0.10735906319615615, 0.05341154638793509, -0.14540990199419154, 0.01347333731450093, 0.11663518967789117] |
1,802.03454 | Hybrid integration of silicon photonics circuits and InP lasers by
photonic wire bonding | Efficient coupling of III-V light sources to silicon photonic circuits is one
of the key challenges of integrated optics. Important requirements are low
coupling losses, as well as small footprint and high yield of the overall
assembly, along with the ability to use automated processes for large-scale
production. In this paper, we demonstrate that photonic wire bonding addresses
these challenges by exploiting direct-write two-photon lithography for in-situ
fabrication of three-dimensional freeform waveguides between optical chips. In
a series proof-of-concept experiments, we connect InP-based horizontal-cavity
surface emitting lasers (HCSEL) to passive silicon photonic circuits with
insertion losses down to 0.4 dB. To the best of our knowledge, this is the most
efficient interface between an InP light source and a silicon photonic chip
that has so far been demonstrated. Our experiments represent a key step in
advancing photonic wire bonding to a universal integration platform for hybrid
photonic multi-chip assemblies that combine known-good dies of different
materials to high-performance hybrid multi-chip modules.
| physics.app-ph physics.optics | efficient coupling of iiiv light sources to silicon photonic circuits is one of the key challenges of integrated optics important requirements are low coupling losses as well as small footprint and high yield of the overall assembly along with the ability to use automated processes for largescale production in this paper we demonstrate that photonic wire bonding addresses these challenges by exploiting directwrite twophoton lithography for insitu fabrication of threedimensional freeform waveguides between optical chips in a series proofofconcept experiments we connect inpbased horizontalcavity surface emitting lasers hcsel to passive silicon photonic circuits with insertion losses down to 04 db to the best of our knowledge this is the most efficient interface between an inp light source and a silicon photonic chip that has so far been demonstrated our experiments represent a key step in advancing photonic wire bonding to a universal integration platform for hybrid photonic multichip assemblies that combine knowngood dies of different materials to highperformance hybrid multichip modules | [['efficient', 'coupling', 'of', 'iiiv', 'light', 'sources', 'to', 'silicon', 'photonic', 'circuits', 'is', 'one', 'of', 'the', 'key', 'challenges', 'of', 'integrated', 'optics', 'important', 'requirements', 'are', 'low', 'coupling', 'losses', 'as', 'well', 'as', 'small', 'footprint', 'and', 'high', 'yield', 'of', 'the', 'overall', 'assembly', 'along', 'with', 'the', 'ability', 'to', 'use', 'automated', 'processes', 'for', 'largescale', 'production', 'in', 'this', 'paper', 'we', 'demonstrate', 'that', 'photonic', 'wire', 'bonding', 'addresses', 'these', 'challenges', 'by', 'exploiting', 'directwrite', 'twophoton', 'lithography', 'for', 'insitu', 'fabrication', 'of', 'threedimensional', 'freeform', 'waveguides', 'between', 'optical', 'chips', 'in', 'a', 'series', 'proofofconcept', 'experiments', 'we', 'connect', 'inpbased', 'horizontalcavity', 'surface', 'emitting', 'lasers', 'hcsel', 'to', 'passive', 'silicon', 'photonic', 'circuits', 'with', 'insertion', 'losses', 'down', 'to', '04', 'db', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'most', 'efficient', 'interface', 'between', 'an', 'inp', 'light', 'source', 'and', 'a', 'silicon', 'photonic', 'chip', 'that', 'has', 'so', 'far', 'been', 'demonstrated', 'our', 'experiments', 'represent', 'a', 'key', 'step', 'in', 'advancing', 'photonic', 'wire', 'bonding', 'to', 'a', 'universal', 'integration', 'platform', 'for', 'hybrid', 'photonic', 'multichip', 'assemblies', 'that', 'combine', 'knowngood', 'dies', 'of', 'different', 'materials', 'to', 'highperformance', 'hybrid', 'multichip', 'modules']] | [-0.11524478612473504, 0.13096542042944032, -0.0004849431965992136, -0.052061070788742496, -0.049118003551701796, -0.22278942222232526, 0.032789339050767745, 0.5052952481047163, -0.25295278539884036, -0.3330164476057643, 0.04375298089954018, -0.2954202670814124, -0.1411928544289567, 0.27702710656273477, -0.031588191400815105, 0.14327545916008522, 0.059151883898947225, -0.17354450327689824, -0.031654014300449555, -0.1701752172560437, 0.22994830019760337, 0.09459630789457814, 0.36194968204828176, 0.0812076281715161, 0.13106477581573733, -0.02186995067739121, 0.040714604263530706, -0.0810876008351597, -0.06785688405696694, 0.18205096814840002, 0.31645031540461305, 0.0041540936148087, 0.27288143196488795, -0.49953389568430073, -0.20168759260010324, 0.013383615507199517, 0.1735143066902276, 0.13102919514343705, -0.12438595142074914, -0.22912666538390536, 0.06671906751141234, -0.1417933088030268, -0.1148155996394373, -0.0437703438150058, -0.021292083224562823, 0.025060532046423393, -0.17940037045627832, -0.04504079112501921, 0.004838498482779371, 0.01737013789707994, 0.014810190319358927, -0.0706064625256607, -0.019034514931446447, 0.09840442866391544, -0.13537465646253816, -0.01341998663294545, 0.2204282819747386, -0.11045713082201919, -0.16921245834479728, 0.3602950112402158, -0.03811647657981529, -0.12225079443159297, 0.1865892853549793, -0.08821257634627276, -0.06870984997301591, 0.12488140296132404, 0.20669920648061582, 0.05276742864564155, -0.1649372716047713, 0.011202862709738701, 0.06691668059606597, 0.22580794223771672, 0.08254948553318779, 0.13979724924952822, 0.23126584435842415, 0.30429119064689336, 0.018159602651571703, 0.16337073521993165, -0.08992617203321003, -0.024675530754908356, -0.2583523959554029, -0.24767325371767412, -0.17351260258663892, 0.034354515815938604, -0.06538178505498254, -0.20206945132626714, 0.3520388019610923, 0.16466490726964841, 0.1284585925809008, -0.01733550633473685, 0.36782808198868855, 0.04123615851748805, 0.1720062416784887, 0.012106387811543056, 0.2896590829975522, 0.1558750077844861, 0.11835500594439372, -0.1952472962629425, 0.017858733712994266, -0.06530298132950194] |
1,802.03455 | Don't Repeat Yourself: Seamless Execution and Analysis of Extensive
Network Experiments | This paper presents MACI, the first bespoke framework for the management, the
scalable execution, and the interactive analysis of a large number of network
experiments. Driven by the desire to avoid repetitive implementation of just a
few scripts for the execution and analysis of experiments, MACI emerged as a
generic framework for network experiments that significantly increases
efficiency and ensures reproducibility. To this end, MACI incorporates and
integrates established simulators and analysis tools to foster rapid but
systematic network experiments.
We found MACI indispensable in all phases of the research and development
process of various communication systems, such as i) an extensive DASH video
streaming study, ii) the systematic development and improvement of Multipath
TCP schedulers, and iii) research on a distributed topology graph pattern
matching algorithm. With this work, we make MACI publicly available to the
research community to advance efficient and reproducible network experiments.
| cs.NI | this paper presents maci the first bespoke framework for the management the scalable execution and the interactive analysis of a large number of network experiments driven by the desire to avoid repetitive implementation of just a few scripts for the execution and analysis of experiments maci emerged as a generic framework for network experiments that significantly increases efficiency and ensures reproducibility to this end maci incorporates and integrates established simulators and analysis tools to foster rapid but systematic network experiments we found maci indispensable in all phases of the research and development process of various communication systems such as i an extensive dash video streaming study ii the systematic development and improvement of multipath tcp schedulers and iii research on a distributed topology graph pattern matching algorithm with this work we make maci publicly available to the research community to advance efficient and reproducible network experiments | [['this', 'paper', 'presents', 'maci', 'the', 'first', 'bespoke', 'framework', 'for', 'the', 'management', 'the', 'scalable', 'execution', 'and', 'the', 'interactive', 'analysis', 'of', 'a', 'large', 'number', 'of', 'network', 'experiments', 'driven', 'by', 'the', 'desire', 'to', 'avoid', 'repetitive', 'implementation', 'of', 'just', 'a', 'few', 'scripts', 'for', 'the', 'execution', 'and', 'analysis', 'of', 'experiments', 'maci', 'emerged', 'as', 'a', 'generic', 'framework', 'for', 'network', 'experiments', 'that', 'significantly', 'increases', 'efficiency', 'and', 'ensures', 'reproducibility', 'to', 'this', 'end', 'maci', 'incorporates', 'and', 'integrates', 'established', 'simulators', 'and', 'analysis', 'tools', 'to', 'foster', 'rapid', 'but', 'systematic', 'network', 'experiments', 'we', 'found', 'maci', 'indispensable', 'in', 'all', 'phases', 'of', 'the', 'research', 'and', 'development', 'process', 'of', 'various', 'communication', 'systems', 'such', 'as', 'i', 'an', 'extensive', 'dash', 'video', 'streaming', 'study', 'ii', 'the', 'systematic', 'development', 'and', 'improvement', 'of', 'multipath', 'tcp', 'schedulers', 'and', 'iii', 'research', 'on', 'a', 'distributed', 'topology', 'graph', 'pattern', 'matching', 'algorithm', 'with', 'this', 'work', 'we', 'make', 'maci', 'publicly', 'available', 'to', 'the', 'research', 'community', 'to', 'advance', 'efficient', 'and', 'reproducible', 'network', 'experiments']] | [-0.14515360288022164, 0.022509719330553533, -0.05075985711858901, 0.009559749398835115, -0.10569051730650643, -0.14922848242902745, 0.07228087057273401, 0.42459581821059733, -0.2437720585021203, -0.3418857387764609, 0.11742396412452377, -0.24719843124868732, -0.1857038201594387, 0.2244379747250717, -0.07190634940164037, 0.1127905577695482, 0.14968222000935968, -0.038343693501265576, -0.023340561387307737, -0.23241263738779944, 0.24615491794706132, 0.12772324814601507, 0.36916242479920797, 0.095349999294578, 0.06732824291038798, 0.0009681896206106327, -0.12212534343555875, 0.008851018745439409, -0.10488604844974597, 0.16517096175333765, 0.3165436072581231, 0.23879742629232828, 0.3240090686100701, -0.4478403524023621, -0.19687612690924577, 0.05773961889774424, 0.1502148466398429, 0.10688674822210474, -0.08607155185476685, -0.29380335521641865, 0.09489127599286579, -0.22504442210679185, -0.05614247337966035, -0.12412146214963486, -0.006831109663312107, 0.00154189042562032, -0.2684704136894378, -0.03047144293868021, 0.05488027446131439, 0.10012462858408881, 0.008454664777772986, -0.07054866359837048, 0.05726082284523378, 0.16205810619620223, 0.03357074552431722, 0.04783656028233316, 0.13798858338252526, -0.11858613427237237, -0.17052142412006244, 0.37223197569534794, -0.04420136082407138, -0.09077834325829802, 0.19699757540923837, -0.01210547248964048, -0.18001197768181518, 0.07882726999407966, 0.2380792094037345, 0.09635533630682079, -0.17190909474348165, 0.010557667662608652, 0.018075072866775198, 0.17076030014758956, 0.005647785845212638, 0.014762427791799993, 0.14854569671905204, 0.2739281449339365, 0.06683484353890566, 0.1305732826278896, -0.04389407497683974, -0.11405735748360725, -0.2540943471107162, -0.17057159398873784, -0.14021245122341797, -0.04511145316861723, -0.04675654691158816, -0.17485623822502844, 0.4111231973726455, 0.21245731531294726, 0.13288296939971003, 0.06444671353219995, 0.3675144369943603, -0.016538731631031898, 0.08857722056723416, 0.12017502709074993, 0.14406786747364494, 0.025559928572787712, 0.1793798744225594, -0.18541573030931544, 0.08539583542454375, -0.02276425716452849] |
1,802.03456 | Fabry-P\'erot Cavity Formed with Dielectric Metasurfaces in a
Hollow-Core Fiber | We demonstrate a fiber-integrated Fabry-P\'erot cavity formed by attaching a
pair of dielectric metasurfaces to the ends of a hollow-core photonic-crystal
fiber segment. The metasurfaces consist of perforated membranes designed as
photonic-crystal slabs that act as planar mirrors but can potentially allow
injection of gases through their holes into the hollow core of the fiber. We
have so far observed cavities with finesse of ~11 and Q factors of ~$4.5 \times
10^5$, but much higher values should be achievable with improved fabrication
procedures. We expect this device to enable development of new fiber lasers,
enhanced gas spectroscopy, and studies of fundamental light-matter interactions
and nonlinear optics.
| physics.app-ph physics.optics | we demonstrate a fiberintegrated fabryperot cavity formed by attaching a pair of dielectric metasurfaces to the ends of a hollowcore photoniccrystal fiber segment the metasurfaces consist of perforated membranes designed as photoniccrystal slabs that act as planar mirrors but can potentially allow injection of gases through their holes into the hollow core of the fiber we have so far observed cavities with finesse of 11 and q factors of 45 times 105 but much higher values should be achievable with improved fabrication procedures we expect this device to enable development of new fiber lasers enhanced gas spectroscopy and studies of fundamental lightmatter interactions and nonlinear optics | [['we', 'demonstrate', 'a', 'fiberintegrated', 'fabryperot', 'cavity', 'formed', 'by', 'attaching', 'a', 'pair', 'of', 'dielectric', 'metasurfaces', 'to', 'the', 'ends', 'of', 'a', 'hollowcore', 'photoniccrystal', 'fiber', 'segment', 'the', 'metasurfaces', 'consist', 'of', 'perforated', 'membranes', 'designed', 'as', 'photoniccrystal', 'slabs', 'that', 'act', 'as', 'planar', 'mirrors', 'but', 'can', 'potentially', 'allow', 'injection', 'of', 'gases', 'through', 'their', 'holes', 'into', 'the', 'hollow', 'core', 'of', 'the', 'fiber', 'we', 'have', 'so', 'far', 'observed', 'cavities', 'with', 'finesse', 'of', '11', 'and', 'q', 'factors', 'of', '45', 'times', '105', 'but', 'much', 'higher', 'values', 'should', 'be', 'achievable', 'with', 'improved', 'fabrication', 'procedures', 'we', 'expect', 'this', 'device', 'to', 'enable', 'development', 'of', 'new', 'fiber', 'lasers', 'enhanced', 'gas', 'spectroscopy', 'and', 'studies', 'of', 'fundamental', 'lightmatter', 'interactions', 'and', 'nonlinear', 'optics']] | [-0.1669780907846047, 0.17894494422395132, -0.03750384245166678, -0.08462200623405394, -0.04712629928648964, -0.22653964320461284, 0.026768979513226956, 0.5201695544451896, -0.17657484332064413, -0.2839259083189492, 0.058070731836915856, -0.27103196688980424, -0.12889790007589771, 0.26409390569721647, -0.03709807352356191, 0.07547071841800748, 0.04319166563855449, -0.11002368773201937, 0.0007808783930673633, -0.18368354574162163, 0.2520721838721689, 0.05506007650093931, 0.28680915487403014, 0.04977458064391647, 0.10865470425243366, -0.028299954381028964, 0.06555619575786141, -0.007765485782105968, -0.15596493889989807, 0.15648329421825144, 0.2564500596347915, -0.005989883400341672, 0.25648751195941893, -0.504046617664467, -0.23496320031864462, 0.022920108350726363, 0.20149406314748428, 0.11493632837774162, -0.06271148050414785, -0.27526603317555953, 0.023010044200521596, -0.15431046703108806, -0.18461213873277577, -0.031612688886388296, -0.072496829470971, 0.04602742240816917, -0.2109893135164144, -0.049032049312888876, 0.04870871701365653, 0.025665471888200012, 0.00026427739616132005, -0.04672290802107386, -0.0031683696346041165, 0.06294891142005206, -0.08139938720554676, -0.0264186852277731, 0.24263450943531012, -0.12446441188375554, -0.09891208076744147, 0.3967108542169884, -0.08358806098661965, -0.11108748244016238, 0.16506774864216633, -0.2016747453258777, 0.028171206350034138, 0.18908054054767456, 0.19309631381886747, 0.07507479617389727, -0.09813935415959864, -0.01985707786428426, 0.01159314165014844, 0.21819308859006203, 0.18160911038834252, 0.1495153044728246, 0.27419420249566856, 0.2280579717601386, 0.0003179039851156116, 0.15675255854258244, -0.08152819379619411, 0.03979923410938596, -0.241669198375125, -0.17850310416927315, -0.1395251508659402, 0.08130797228494764, -0.09678145915773403, -0.18553207481262396, 0.3287695941673416, 0.07103599992774005, 0.15599877115356614, -0.04281126831456105, 0.29642677761989517, 0.07173805580834665, 0.1765273691502066, -0.020871548586138437, 0.3309510747533081, 0.1763156333538475, 0.06839746342453543, -0.1846517152065095, -0.08035763325872568, -0.017759164597593108] |
1,802.03457 | Bayesian Compressive Sensing with Circulant Matrix for Spectrum Sensing
in Cognitive Radio Networks | For wideband spectrum sensing, compressive sensing has been proposed as a
solution to speed up the high dimensional signals sensing and reduce the
computational complexity. Compressive sensing consists of acquiring the
essential information from a sparse signal and recovering it at the receiver
based on an efficient sampling matrix and a reconstruction technique. In order
to deal with the uncertainty, improve the signal acquisition performance, and
reduce the randomness during the sensing and reconstruction processes,
compressive sensing requires a robust sampling matrix and an efficient
reconstruction technique. In this paper, we propose an approach that combines
the advantages of a Circulant matrix with Bayesian models. This approach is
implemented, extensively tested, and its results have been compared to those of
l1 norm minimization with a Circulant or random matrix based on several
metrics. These metrics are Mean Square Error, reconstruction error,
correlation, recovery time, sampling time, and processing time. The results
show that our technique is faster and more efficient.
| eess.SP cs.IT math.IT | for wideband spectrum sensing compressive sensing has been proposed as a solution to speed up the high dimensional signals sensing and reduce the computational complexity compressive sensing consists of acquiring the essential information from a sparse signal and recovering it at the receiver based on an efficient sampling matrix and a reconstruction technique in order to deal with the uncertainty improve the signal acquisition performance and reduce the randomness during the sensing and reconstruction processes compressive sensing requires a robust sampling matrix and an efficient reconstruction technique in this paper we propose an approach that combines the advantages of a circulant matrix with bayesian models this approach is implemented extensively tested and its results have been compared to those of l1 norm minimization with a circulant or random matrix based on several metrics these metrics are mean square error reconstruction error correlation recovery time sampling time and processing time the results show that our technique is faster and more efficient | [['for', 'wideband', 'spectrum', 'sensing', 'compressive', 'sensing', 'has', 'been', 'proposed', 'as', 'a', 'solution', 'to', 'speed', 'up', 'the', 'high', 'dimensional', 'signals', 'sensing', 'and', 'reduce', 'the', 'computational', 'complexity', 'compressive', 'sensing', 'consists', 'of', 'acquiring', 'the', 'essential', 'information', 'from', 'a', 'sparse', 'signal', 'and', 'recovering', 'it', 'at', 'the', 'receiver', 'based', 'on', 'an', 'efficient', 'sampling', 'matrix', 'and', 'a', 'reconstruction', 'technique', 'in', 'order', 'to', 'deal', 'with', 'the', 'uncertainty', 'improve', 'the', 'signal', 'acquisition', 'performance', 'and', 'reduce', 'the', 'randomness', 'during', 'the', 'sensing', 'and', 'reconstruction', 'processes', 'compressive', 'sensing', 'requires', 'a', 'robust', 'sampling', 'matrix', 'and', 'an', 'efficient', 'reconstruction', 'technique', 'in', 'this', 'paper', 'we', 'propose', 'an', 'approach', 'that', 'combines', 'the', 'advantages', 'of', 'a', 'circulant', 'matrix', 'with', 'bayesian', 'models', 'this', 'approach', 'is', 'implemented', 'extensively', 'tested', 'and', 'its', 'results', 'have', 'been', 'compared', 'to', 'those', 'of', 'l1', 'norm', 'minimization', 'with', 'a', 'circulant', 'or', 'random', 'matrix', 'based', 'on', 'several', 'metrics', 'these', 'metrics', 'are', 'mean', 'square', 'error', 'reconstruction', 'error', 'correlation', 'recovery', 'time', 'sampling', 'time', 'and', 'processing', 'time', 'the', 'results', 'show', 'that', 'our', 'technique', 'is', 'faster', 'and', 'more', 'efficient']] | [-0.06548156590069994, 0.049266969633299594, -0.07931245166273584, 0.011575543181970715, -0.03537835162715055, -0.15692750909074676, 0.010710861907136859, 0.4389997774735093, -0.304676879523322, -0.3083424671902321, 0.20378910100116626, -0.2428595697681885, -0.19866156739444704, 0.17578135755466065, -0.1206592035596259, 0.1488624202491337, 0.10580205567530357, 0.043907437508460136, -0.13640073899241542, -0.23632214127646875, 0.20250703068450093, 0.13665736164548434, 0.34645956410240614, -0.018050987441529286, 0.14009509969910142, 0.04272178640894708, -0.05743536473019049, -0.01886095047229901, -0.05908047827442715, 0.16474634353653528, 0.2654401436283706, 0.1949558836795518, 0.30899932261090723, -0.42710909257875757, -0.26475353099012866, 0.10927975523372879, 0.13301745709904936, 0.11264825277612545, -0.12850280297616337, -0.2760766978288302, 0.11108614532859065, -0.13817867459729313, 0.0012710807466646656, -0.10886040045297704, -0.05449346313835122, -0.030498062720289452, -0.3601654095924459, 0.080714441643795, 0.01832038639113307, 0.014152268969337457, -0.045296888260782, -0.15323644038580825, 0.12047807487106184, 0.11949273969075876, 0.017848965685698204, 0.036464038382837315, 0.11698020008916502, -0.07853888680970159, -0.14253443568704824, 0.3527062398614362, -0.03740998017528909, -0.21966039654798805, 0.17364462734840344, -0.05964902145569795, -0.12516814820846775, 0.19289870171778603, 0.22257005784922512, 0.09809762263321317, -0.1320008529932238, 0.07245155130185595, 0.036010126082692294, 0.20063430590962525, 0.03423056438041385, 0.058478766715415985, 0.07680069444322726, 0.20217009240295739, 0.15108513548184418, 0.11799247056187596, -0.1573518460994819, -0.03332162012302433, -0.17717230687885605, -0.14618815298745175, -0.27271541235095353, -0.02616041482251603, -0.14240841479540906, -0.1487473863118794, 0.41540033188357484, 0.19385342260175092, 0.163002590501128, 0.09832778178970329, 0.40997219058917833, 0.10082656975137069, 0.06524095568747726, 0.07890164684504271, 0.21340334423148305, 0.18428661684301914, 0.09296338470594492, -0.19892330291186228, 0.04901833952753805, 0.042926308617461474] |
1,802.03458 | Vector particle scattering on the lattice | In this work, we present an explicit form of the Luescher equation and
consider the construction of the operators in different irreducible
representations for the case of scattering of two vector particles. The
formalism is applied to scalar QED in the Higgs Phase, where the $U(1)$ gauge
boson acquires mass.
| hep-lat hep-ph | in this work we present an explicit form of the luescher equation and consider the construction of the operators in different irreducible representations for the case of scattering of two vector particles the formalism is applied to scalar qed in the higgs phase where the u1 gauge boson acquires mass | [['in', 'this', 'work', 'we', 'present', 'an', 'explicit', 'form', 'of', 'the', 'luescher', 'equation', 'and', 'consider', 'the', 'construction', 'of', 'the', 'operators', 'in', 'different', 'irreducible', 'representations', 'for', 'the', 'case', 'of', 'scattering', 'of', 'two', 'vector', 'particles', 'the', 'formalism', 'is', 'applied', 'to', 'scalar', 'qed', 'in', 'the', 'higgs', 'phase', 'where', 'the', 'u1', 'gauge', 'boson', 'acquires', 'mass']] | [-0.15079449769109488, 0.22511194774211618, -0.06478994194418192, 0.06942010253667831, -0.06231866195332259, -0.11060867767781019, -0.05262432972434908, 0.30147022027522324, -0.19062823448330163, -0.2205735506536439, -4.393576411530376e-05, -0.2650618615094572, -0.13256572268903255, 0.10841492947191, 0.025553089063614608, 0.04141496863216162, -0.0009078625636175275, 0.0935676996037364, -0.09976802631281316, -0.24744240142870694, 0.41570159546099605, -0.048264046879485246, 0.22392029389739038, 0.06365842903032899, 0.14462310129776598, 0.0710798114258796, -0.011058655008673668, -0.13307464273646474, -0.08867126993834973, 0.10461582629941404, 0.20829857468605043, 0.04589477113448084, 0.14294139425735922, -0.39194641407579184, -0.1552719147450989, 0.1563174492493272, 0.18107476588338614, 0.14335634809918701, -0.06323246151208878, -0.298113560709171, 0.019782821000553667, -0.21474296234548093, -0.14282192195998505, -0.0651970465341583, -0.023795155603438617, -0.11822987193241716, -0.3115535544976592, 0.06734804305247963, 0.018513574339449404, 0.028018676470965148, -0.1046449433080852, -0.09217926058918238, -0.01208831250667572, 0.03818025393411517, 0.12606456170091407, 0.04011330545414239, 0.09382495167665184, -0.21273414153140038, -0.1185584911913611, 0.4129602124914527, -0.11671625876799226, -0.27778154726605864, 0.1044070749823004, -0.14070693727233446, -0.1515414377488196, 0.09266557639464736, 0.20382739931344987, 0.1289059625286609, -0.1642795492708683, 0.2205154468945693, -0.05416770316660404, 0.09166817418998108, 0.03373829716816545, 0.027970459535717963, 0.16400455815717577, 0.11811570218298584, 0.0053574003465473655, 0.1702516074385494, -0.02321596896741539, -0.12885920327156783, -0.4141662005335093, -0.21158492666036183, -0.11431197471451014, 0.06255496153607965, -0.09833023499435513, -0.1660550413839519, 0.41741179251577704, 0.16727827493101358, 0.22067095844307916, 0.033302906807512044, 0.2705296602100134, 0.1739917648397386, 0.0687895499356091, 0.02202174099162221, 0.26694235354661944, 0.19684590499848129, 0.08805769730359315, -0.2377425495442003, -0.09857587749138474, 0.15590827342122793] |
1,802.03459 | On-chip label-free plasmonic based imaging microscopy for microfluidics | In this work, we demonstrated on-chip label-free imaging microscopy using
real and Fourier Plane (FP) microscopic dark field images of Surface Plasmons
(SP), excited on engineered 1D and 2D low aspect ratio periodic plasmonic
nanostructures. The periodic plasmonic nanostructures with period almost equal
to resonance wavelength, were engineered to exhibit transmission resonances as
transmission peaks in visible spectrum at normal incidence, without using
extraordinary optical transmission phenomena. The plasmonic nanostructures
exhibited a polarization rotation of 90 degree mediated by differential phase
retardation in the SP mode due to Transverse Electric and Magnetic components.
This was used to develop a dark field on-chip plasmonic polarization microscope
for imaging SP excitation in real and Fourier planes. After successful
integration of these plasmonic nanostructures with SU- 8 based microfluidic
channels, a real-time monitoring of label free on chip sensing was
demonstrated. Label-free on-chip imaging for interface of colorless miscible
and immiscible analytes flowing on plasmonic nanostructures in the microfluidic
channels were performed using color-selective filtering nature of plasmonic
nanostructures. Since the imaging is realized on a chip and does not need any
complicated and bulky arrangement, it will be well suited for on-chip point of
care diagnostics.
| physics.app-ph physics.optics | in this work we demonstrated onchip labelfree imaging microscopy using real and fourier plane fp microscopic dark field images of surface plasmons sp excited on engineered 1d and 2d low aspect ratio periodic plasmonic nanostructures the periodic plasmonic nanostructures with period almost equal to resonance wavelength were engineered to exhibit transmission resonances as transmission peaks in visible spectrum at normal incidence without using extraordinary optical transmission phenomena the plasmonic nanostructures exhibited a polarization rotation of 90 degree mediated by differential phase retardation in the sp mode due to transverse electric and magnetic components this was used to develop a dark field onchip plasmonic polarization microscope for imaging sp excitation in real and fourier planes after successful integration of these plasmonic nanostructures with su 8 based microfluidic channels a realtime monitoring of label free on chip sensing was demonstrated labelfree onchip imaging for interface of colorless miscible and immiscible analytes flowing on plasmonic nanostructures in the microfluidic channels were performed using colorselective filtering nature of plasmonic nanostructures since the imaging is realized on a chip and does not need any complicated and bulky arrangement it will be well suited for onchip point of care diagnostics | [['in', 'this', 'work', 'we', 'demonstrated', 'onchip', 'labelfree', 'imaging', 'microscopy', 'using', 'real', 'and', 'fourier', 'plane', 'fp', 'microscopic', 'dark', 'field', 'images', 'of', 'surface', 'plasmons', 'sp', 'excited', 'on', 'engineered', '1d', 'and', '2d', 'low', 'aspect', 'ratio', 'periodic', 'plasmonic', 'nanostructures', 'the', 'periodic', 'plasmonic', 'nanostructures', 'with', 'period', 'almost', 'equal', 'to', 'resonance', 'wavelength', 'were', 'engineered', 'to', 'exhibit', 'transmission', 'resonances', 'as', 'transmission', 'peaks', 'in', 'visible', 'spectrum', 'at', 'normal', 'incidence', 'without', 'using', 'extraordinary', 'optical', 'transmission', 'phenomena', 'the', 'plasmonic', 'nanostructures', 'exhibited', 'a', 'polarization', 'rotation', 'of', '90', 'degree', 'mediated', 'by', 'differential', 'phase', 'retardation', 'in', 'the', 'sp', 'mode', 'due', 'to', 'transverse', 'electric', 'and', 'magnetic', 'components', 'this', 'was', 'used', 'to', 'develop', 'a', 'dark', 'field', 'onchip', 'plasmonic', 'polarization', 'microscope', 'for', 'imaging', 'sp', 'excitation', 'in', 'real', 'and', 'fourier', 'planes', 'after', 'successful', 'integration', 'of', 'these', 'plasmonic', 'nanostructures', 'with', 'su', '8', 'based', 'microfluidic', 'channels', 'a', 'realtime', 'monitoring', 'of', 'label', 'free', 'on', 'chip', 'sensing', 'was', 'demonstrated', 'labelfree', 'onchip', 'imaging', 'for', 'interface', 'of', 'colorless', 'miscible', 'and', 'immiscible', 'analytes', 'flowing', 'on', 'plasmonic', 'nanostructures', 'in', 'the', 'microfluidic', 'channels', 'were', 'performed', 'using', 'colorselective', 'filtering', 'nature', 'of', 'plasmonic', 'nanostructures', 'since', 'the', 'imaging', 'is', 'realized', 'on', 'a', 'chip', 'and', 'does', 'not', 'need', 'any', 'complicated', 'and', 'bulky', 'arrangement', 'it', 'will', 'be', 'well', 'suited', 'for', 'onchip', 'point', 'of', 'care', 'diagnostics']] | [-0.16604878560918354, 0.1645194656982509, -0.03932978818673141, -0.012957452884611203, -0.05937454060857789, -0.23011827080500954, -0.0012419084942126742, 0.5086999164279742, -0.21078579493356658, -0.303738160750147, 0.04406811597159363, -0.2594203278854412, -0.16680512637543232, 0.23765807551453033, -0.012494190999297137, 0.10613480796461407, 0.02407106265699318, -0.10594097626654758, 0.03567671318557689, -0.14494571404065937, 0.20188391614902151, 0.014451241247912812, 0.36013039358478693, 0.06265613797106348, 0.08809104352498177, 0.07939919998830895, 0.02650691555814755, -0.05131343580763211, -0.09918395837423266, 0.11745322843744736, 0.30857797667927445, -0.02754572540348799, 0.19027945418246858, -0.49063795427407725, -0.23910102108013384, 0.032177555278788524, 0.22149946516140884, 0.09833613484041746, -0.1104418488589029, -0.279582818725252, 0.03362772277239518, -0.05100366954408771, -0.13425306188777933, -0.05822688413630288, -0.020878542714497822, 0.0013082481539068917, -0.23967683568570436, 0.03637898967543751, -0.007729919213854429, 0.1587754917431853, -0.07276037146730982, -0.06198068819316008, -0.03960917587632064, 0.03880138668116451, -0.07670534190604195, -0.03030109913184394, 0.23711887309756777, -0.12124752578296766, -0.12057114988517438, 0.35433294661415105, -0.06116515816640608, -0.14124693305798106, 0.19621505777257947, -0.17181433643425634, 0.02915847297582641, 0.21858942720165342, 0.19750572559807794, 0.1079017425540441, -0.14059352188865587, 0.03192337386273496, 0.05103697033704633, 0.21752969218137766, 0.17012619809727617, 0.11401232219176348, 0.25329103364162725, 0.20707046338981114, 0.024776198963306725, 0.11751139052056218, -0.1743762713446541, 0.011088672746932999, -0.18586983514911273, -0.18887785525234013, -0.21394476077573965, 0.05258337694309356, -0.041556037228615096, -0.18181632549415544, 0.3837581354039769, 0.08590665671100706, 0.09740260834853674, -0.07559410435478828, 0.35542488670859906, 0.08437218849208762, 0.14432381621429027, -0.04823548026195699, 0.27238714371654255, 0.18628438434337946, 0.16407892514337047, -0.2681045864430285, -0.026648657778085966, -0.049461776765121014] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.